WorldWideScience

Sample records for brane-bulk matching examples

  1. Intermodal Matching on the Example of Sound and Color Connection in Norm and Pathology

    Directory of Open Access Journals (Sweden)

    Dyachenko A.

    2017-05-01

    Full Text Available The article describes the initial period of research of synesthesia and further work, experimental and theoretical, related to the study of various intermodal correspondences. Information about the presence of a statistically significant phenomenon of various intermodal correspondences in healthy people (which includes for example the connection of sound and color is provided. Present experiment reveals that the phenomenon of sound-color correspondences undergoes destructive changes in patients with schizophrenia compared with that in healthy individuals, but does not detect new distinct patterns.

  2. 11 CFR 9034.4 - Use of contributions and matching payments; examples of qualified campaign expenses and non...

    Science.gov (United States)

    2010-01-01

    ... considered primary election expenses. If results are received from a single poll both before and after the... 11 Federal Elections 1 2010-01-01 2010-01-01 false Use of contributions and matching payments... Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: PRESIDENTIAL PRIMARY MATCHING...

  3. Addressing Omitted Prior Achievement Bias in International Assessments: An Applied Example Using PIRLS-NPD Matched Data

    Science.gov (United States)

    Caro, Daniel H.; Kyriakides, Leonidas; Televantou, Ioulia

    2018-01-01

    Omitted prior achievement bias is pervasive in international assessment studies and precludes causal inference. For example, reported negative associations between student-oriented teaching strategies and student performance are against expectations and might actually reflect omitted prior achievement bias. Namely, that these teaching strategies…

  4. Cosmological evolution with brane-bulk energy exchange

    CERN Document Server

    Kiritsis, Elias B; Tetradis, N; Tomaras, T N; Zarikas, V

    2003-01-01

    The consequences for the brane cosmological evolution of energy exchange between the brane and the bulk are analysed in detail, in the context of a non-factorizable background geometry with vanishing effective cosmological constant on the brane. A rich variety of brane cosmologies is obtained, depending on the precise mechanism of energy transfer, the equation of state of brane-matter and the spatial topology. An accelerating era is generically a feature of our solutions. In the case of low-density flat universe more dark matter than in the conventional FRW picture is predicted. Spatially compact solutions are found to delay their recollapse.

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

  6. Matching Students to Schools

    Directory of Open Access Journals (Sweden)

    Dejan Trifunovic

    2017-08-01

    Full Text Available In this paper, we present the problem of matching students to schools by using different matching mechanisms. This market is specific since public schools are free and the price mechanism cannot be used to determine the optimal allocation of children in schools. Therefore, it is necessary to use different matching algorithms that mimic the market mechanism and enable us to determine the core of the cooperative game. In this paper, we will determine that it is possible to apply cooperative game theory in matching problems. This review paper is based on illustrative examples aiming to compare matching algorithms in terms of the incentive compatibility, stability and efficiency of the matching. In this paper we will present some specific problems that may occur in matching, such as improving the quality of schools, favoring minority students, the limited length of the list of preferences and generating strict priorities from weak priorities.

  7. Matching Organs

    Science.gov (United States)

    ... to know FAQ Living donation What is living donation? Organs Types Being a living donor First steps Being ... brochures What Every Patient Needs to Know Living Donation Multiple Listing Visit UNOS Store Learn more How organs are matched How to become a living donor ...

  8. Matching theory for wireless networks

    CERN Document Server

    Han, Zhu; Saad, Walid

    2017-01-01

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

  9. Example book

    International Nuclear Information System (INIS)

    Donnat, Ph.; Treimany, C.; Gouedard, C.; Morice, O.

    1998-06-01

    This document presents some examples which were used for debugging the code. It seemed useful to write these examples onto a book to be sure the code would not regret; to give warranties for the code's functionality; to propose some examples to illustrate the possibilities and the limits of Miro. (author)

  10. Electromagnetic wave matching device

    International Nuclear Information System (INIS)

    Hirata, Yosuke; Mitsunaka, Yoshika; Hayashi, Ken-ichi; Ito, Yasuyuki.

    1997-01-01

    The present invention provides a matching device capable of increasing an efficiency of combining beams of electromagnetic waves outputted from an output window of a gyrotron which is expected for plasma heating of a thermonuclear reactor and an electromagnetic wave transmission system as high as possible. Namely, an electromagnetic wave matching device reflects beams of electromagnetic waves incident from an inlet by a plurality of phase correction mirrors and combines them to an external transmission system through an exit. In this case, the phase correction mirrors change the phase of the beams of electromagnetic waves incident to the phase correction mirrors by a predetermined amount corresponding to the position of the reflection mirrors. Then, the beams of electromagnetic waves outputted, for example, from a gyrotron can properly be shaped as desired for the intensity and the phase. As a result, combination efficiency with the transmission system can be increased. (I.S.)

  11. Image Matching Using Generalized Hough Transforms

    Science.gov (United States)

    Davis, L. S.; Hu, F. P.; Hwang, V.; Kitchen, L.

    1983-01-01

    An image matching system specifically designed to match dissimilar images is described. A set of blobs and ribbons is first extracted from each image, and then generalized Hough transform techniques are used to match these sets and compute the transformation that best registers the image. An example of the application of the approach to one pair of remotely sensed images is presented.

  12. 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 ...... of a mobile phone system in a bigraphical representation of the polyadic π calculus.......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...

  13. In situ LA-ICPMS U–Pb dating of cassiterite without a known-age matrix-matched reference material: Examples from worldwide tin deposits spanning the Proterozoic to the Tertiary

    Science.gov (United States)

    Neymark, Leonid; Holm-Denoma, Christopher S.; Moscati, Richard J.

    2018-01-01

    Cassiterite (SnO2), a main ore mineral in tin deposits, is suitable for U–Pb isotopic dating because of its relatively high U/Pb ratios and typically low common Pb. We report a LA-ICPMS analytical procedure for U–Pb dating of this mineral with no need for an independently dated matrix-matched cassiterite standard. LA-ICPMS U-Th-Pb data were acquired while using NIST 612 glass as a primary non-matrix-matched standard. Raw data are reduced using a combination of Iolite™ and other off-line data reduction methods. Cassiterite is extremely difficult to digest, so traditional approaches in LA-ICPMS U-Pb geochronology that utilize well-characterized matrix-matched reference materials (e.g., age values determined by ID-TIMS) cannot be easily implemented. We propose a new approach for in situ LA-ICPMS dating of cassiterite, which benefits from the unique chemistry of cassiterite with extremely low Th concentrations (Th/U ratio of 10−4 or lower) in some cassiterite samples. Accordingly, it is assumed that 208Pb measured in cassiterite is mostly of non-radiogenic origin—it was initially incorporated in cassiterite during mineral formation, and can be used as a proxy for common Pb. Using 208Pb as a common Pb proxy instead of 204Pb is preferred as 204Pb is much less abundant and is also compromised by 204Hg interference during the LA-ICPMS analyses.Our procedure relies on 208Pb/206Pb vs 207Pb/206Pb (Pb-Pb) and Tera-Wasserburg 207Pb/206Pb vs 238U/206Pb (U-Pb) isochron dates that are calculated for a ~1.54 Ga low-Th cassiterite reference material with varying amounts of common Pb that we assume remained a closed U-Pb system. The difference between the NIST 612 glass normalized biased U-Pb date and the Pb-Pb age of the reference material is used to calculate a correction factor (F) for instrumental U-Pb fractionation. The correction factor (F) is then applied to measured U/Pb ratios and Tera-Wasserburg isochron dates are obtained for the unknown

  14. Aerospace Example

    Data.gov (United States)

    National Aeronautics and Space Administration — This is a textbook, created example for illustration purposes. The System takes inputs of Pt, Ps, and Alt, and calculates the Mach number using the Rayleigh Pitot...

  15. On Tree-Constrained Matchings and Generalizations

    OpenAIRE

    Canzar, Stefan; Elbassioni, Khaled; Klau, Gunnar W.; Mestre, Julián

    2015-01-01

    htmlabstractWe consider the following \\textsc{Tree-Constrained Bipartite Matching} problem: Given two rooted trees $T_1=(V_1,E_1)$, $T_2=(V_2,E_2)$ and a weight function $w: V_1\\times V_2 \\mapsto \\mathbb{R}_+$, find a maximum weight matching $\\mathcal{M}$ between nodes of the two trees, such that none of the matched nodes is an ancestor of another matched node in either of the trees. This generalization of the classical bipartite matching problem appears, for example, in the computational ana...

  16. Stinging Insect Matching Game

    Science.gov (United States)

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

  17. Rapid matching in Drosophila place learning

    Science.gov (United States)

    Zars, Melissa; Zars, Troy

    2009-08-01

    The level of conditioned behavior in animals is proportional to the intensity, amount, frequency, or probability of reinforcement. Interestingly, this matching can be dynamic, with performance levels following, for example, a switch in the probability of reinforcement with a short delay. We previously found that conditioned performance levels in Drosophila match reinforcement intensity in a place conditioning paradigm. Whether Drosophila can match conditioned behavior to a change in reinforcement intensity was an open question. In this study, we found that both conditioned behavior and memory levels match reinforcement intensity after a switch, and this rapid matching occurs within 2 min. Thus, fruit flies can dynamically match conditioned behavior and memory levels to a change in reinforcement intensity.

  18. Matching Systems for Refugees

    Directory of Open Access Journals (Sweden)

    Will Jones

    2017-08-01

    Full Text Available Design of matching systems between refugees and states or local areas is emerging as one of the most promising solutions to problems in refugee resettlement. We describe the basics of two-sided matching theory used in a number of allocation problems, such as school choice, where both sides need to agree to the match. We then explain how these insights can be applied to international refugee matching in the context of the European Union and examine how refugee matching might work within the United Kingdom, Canada, and the United States.

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

  20. Probabilistic seismic history matching using binary images

    Science.gov (United States)

    Davolio, Alessandra; Schiozer, Denis Jose

    2018-02-01

    Currently, the goal of history-matching procedures is not only to provide a model matching any observed data but also to generate multiple matched models to properly handle uncertainties. One such approach is a probabilistic history-matching methodology based on the discrete Latin Hypercube sampling algorithm, proposed in previous works, which was particularly efficient for matching well data (production rates and pressure). 4D seismic (4DS) data have been increasingly included into history-matching procedures. A key issue in seismic history matching (SHM) is to transfer data into a common domain: impedance, amplitude or pressure, and saturation. In any case, seismic inversions and/or modeling are required, which can be time consuming. An alternative to avoid these procedures is using binary images in SHM as they allow the shape, rather than the physical values, of observed anomalies to be matched. This work presents the incorporation of binary images in SHM within the aforementioned probabilistic history matching. The application was performed with real data from a segment of the Norne benchmark case that presents strong 4D anomalies, including softening signals due to pressure build up. The binary images are used to match the pressurized zones observed in time-lapse data. Three history matchings were conducted using: only well data, well and 4DS data, and only 4DS. The methodology is very flexible and successfully utilized the addition of binary images for seismic objective functions. Results proved the good convergence of the method in few iterations for all three cases. The matched models of the first two cases provided the best results, with similar well matching quality. The second case provided models presenting pore pressure changes according to the expected dynamic behavior (pressurized zones) observed on 4DS data. The use of binary images in SHM is relatively new with few examples in the literature. This work enriches this discussion by presenting a new

  1. A Theory of Rerepresentation in Analogical Matching

    Science.gov (United States)

    2003-01-01

    cause (higherPressure Beaker Vial) (flow Beaker Vial Water Pipe)) T2: (cause (hotterThan Coffee IceCube ) (flow Coffee IceCube ...Coffee IceCube ) from the earlier example requires rewriting both expressions in terms of a more general, dimensional-independent comparative (e.g...greaterThan (Temperature Coffee) (Temperature IceCube )) which will match because non-identical function matches are allowed by structure

  2. 't Hooft anomaly matching for discrete symmetries

    International Nuclear Information System (INIS)

    Csaki, C.; Murayama, Hitoshi; Lawrence Berkeley National Lab., CA

    1998-05-01

    The authors show how to extend the 't Hooft anomaly matching conditions to discrete symmetries. They check these discrete anomally matching conditions on several proposed low-energy spectra of certain strongly interacting gauge theories. The excluded examples include the proposed chirally symmetric vacuum of pure N = 1 supersymmetric yang-Mills theories, certain non-supersymmetric confining theories and some self-dual N = 1 supersymmetric theories based on exceptional groups

  3. Dynamic Caliper Matching

    OpenAIRE

    Paweł Strawiński

    2011-01-01

    Matched sampling is a methodology used to estimate treatment effects. A caliper mechanism is used to achieve better similarity among matched pairs. We investigate finite sample properties of matching with calipers and propose a slight modification to the existing mechanism. The simulation study compares the performance of both methods and shows that a standard caliper performs well only in case of constant treatment or uniform propensity score distribution. Secondly, in a case of non-uniform ...

  4. REDUCING THE LIKELIHOOD OF LONG TENNIS MATCHES

    Directory of Open Access Journals (Sweden)

    Tristan Barnett

    2006-12-01

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

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

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

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

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

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

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

  11. Pediatric MATCH Infographic

    Science.gov (United States)

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

  12. Personality Matching for Student-Teacher Development.

    Science.gov (United States)

    Trieber, J. Marshall

    Examples of personality types of supervising teachers and student teachers are described. Conflicts arising out of these clashes are illustrated and used to point up the need for personality matching in the selection of student teachers for student teaching programs. Some personality types listed are energetic and creative supervisors, meek…

  13. Impedance-matched drilling telemetry system

    Science.gov (United States)

    Normann, Randy A [Edgewood, NM; Mansure, Arthur J [Albuquerque, NM

    2008-04-22

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

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

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

  16. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Winicour Jeffrey

    2001-01-01

    Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to current 3D codes that simulate binary black holes. A prime application of characteristic evolution is Cauchy-characteristic matching, which is also reviewed.

  17. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Winicour Jeffrey

    1998-05-01

    Full Text Available We review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to current 3D black hole codes that run forever. A prime application of characteristic evolution is Cauchy-characteristic matching, which is also reviewed.

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

  19. Matched-Filter Thermography

    Directory of Open Access Journals (Sweden)

    Nima Tabatabaei

    2018-04-01

    Full Text Available Conventional infrared thermography techniques, including pulsed and lock-in thermography, have shown great potential for non-destructive evaluation of broad spectrum of materials, spanning from metals to polymers to biological tissues. However, performance of these techniques is often limited due to the diffuse nature of thermal wave fields, resulting in an inherent compromise between inspection depth and depth resolution. Recently, matched-filter thermography has been introduced as a means for overcoming this classic limitation to enable depth-resolved subsurface thermal imaging and improving axial/depth resolution. This paper reviews the basic principles and experimental results of matched-filter thermography: first, mathematical and signal processing concepts related to matched-fileting and pulse compression are discussed. Next, theoretical modeling of thermal-wave responses to matched-filter thermography using two categories of pulse compression techniques (linear frequency modulation and binary phase coding are reviewed. Key experimental results from literature demonstrating the maintenance of axial resolution while inspecting deep into opaque and turbid media are also presented and discussed. Finally, the concept of thermal coherence tomography for deconvolution of thermal responses of axially superposed sources and creation of depth-selective images in a diffusion-wave field is reviewed.

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

  1. [Propensity score matching in SPSS].

    Science.gov (United States)

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

    2015-11-01

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

  2. 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...... 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...... that contain confidential data (e.g., health related data about patient history). Our constructions offer simulation-based security in the presence of semi-honest and malicious adversaries (in the random oracle model) and limit the communication in the query phase to O(m) bits plus the number of occurrences...

  3. Bayesian grid matching

    DEFF Research Database (Denmark)

    Hartelius, Karsten; Carstensen, Jens Michael

    2003-01-01

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

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

  5. Covariant diagrams for one-loop matching

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-10-15

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

  6. Computer-Generated Holographic Matched Filters

    Science.gov (United States)

    Butler, Steven Frank

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

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

  8. Plasma focus matching conditions

    International Nuclear Information System (INIS)

    Soliman, H.M.; Masoud, M.M.; Elkhalafawy, T.A.

    1988-01-01

    A snow-plough and slug models have been used to obtain the optimum matching conditions of the plasma in the focus. The dimensions of the plasma focus device are, inner electrode radius = 2 cm, outer electrode radius = 5.5 cm, and its length = 8 cm. It was found that the maximum magnetic energy of 12.26 kJ has to be delivered to plasma focus whose density is 10 19 /cm 3 at focusing time of 2.55 μs and with total external inductance of 24.2 n H. The same method is used to evaluate the optimum matching conditions for the previous coaxial discharge system which had inner electrode radius = 1.6 cm, outer electrode radius = 3.3 cm and its length = 31.5 cm. These conditions are charging voltage = 12 kV, capacity of the condenser bank = 430 μf, plasma focus density = 10 19 /cm 3 focusing time = 8 μs and total external inductance = 60.32 n H.3 fig., 2 tab

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

  10. 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. PMID:20514196

  11. Material and process selection using product examples

    DEFF Research Database (Denmark)

    Lenau, Torben Anker

    2002-01-01

    The objective of the paper is to suggest a different procedure for selecting materials and processes within the product development work. The procedure includes using product examples in order to increase the number of alternative materials and processes that is considered. Product examples can...... communicate information about materials and processes in a very concentrated and effective way. The product examples represent desired material properties but also includes information that can not be associated directly to the material, e.g. functional or perceived attributes. Previous studies suggest....... A database that support the selection procedure has been compiled. It contains uniform descriptions of a wide range of materials and processes. For each of those, good product examples have been identified, described and associated with keywords. Product examples matching the requirements can be found using...

  12. Job Searchers, Job Matches and the Elasticity of Matching

    NARCIS (Netherlands)

    Broersma, L.; van Ours, J.C.

    1998-01-01

    This paper stresses the importance of a specification of the matching function in which the measure of job matches corresponds to the measure of job searchers. In many empirical studies on the matching function this requirement has not been fulfilled because it is difficult to find information about

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

  14. Electromagnetic wave matching device

    International Nuclear Information System (INIS)

    Hirata, Yosuke; Mitsunaka, Yoshika; Hayashi, Ken-ichi; Ito, Yasuyuki.

    1997-01-01

    The present invention provides an electromagnetic wave matching capable of reducing a cost for the transmission system in a system of using electromagnetic waves for plasma heating of a thermonuclear reactor. Namely, incident electromagnetic waves are reflected by using a plurality of phase correction mirrors. The reflected electromagnetic waves are connected to an external transmission system through an exit. The phase correction mirrors have such a shape to receive a plurality of beam-like electromagnetic waves and output electromagnetic waves by the number different from the number of the received electromagnetic wave beams having a predetermined distribution. Further, at least two of the phase correction mirrors have such a shape to change the phase of the electromagnetic waves beams incident to the reflection surface of the phase correction mirrors by a predetermined amount corresponding to the position of the reflection surface. Then, the cost for transmission system can greatly be reduced. (I.S.)

  15. Quantity precommitment and price matching

    DEFF Research Database (Denmark)

    Tumennasan, Norovsambuu

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

  16. 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...... fully expressive representations of externalities in matchings require exponential space, in this paper we propose a compact model of externalities, in which the influence of a match on each agent is computed additively. Under this framework, we analyze many-to-many matchings and one-to-one matchings...

  17. Organizations must match assets

    International Nuclear Information System (INIS)

    Carley, G.R.

    1991-01-01

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

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

  19. Global Patch Matching

    Science.gov (United States)

    Huang, X.; Hu, K.; Ling, X.; Zhang, Y.; Lu, Z.; Zhou, G.

    2017-09-01

    This paper introduces a novel global patch matching method that focuses on how to remove fronto-parallel bias and obtain continuous smooth surfaces with assuming that the scenes covered by stereos are piecewise continuous. Firstly, simple linear iterative cluster method (SLIC) is used to segment the base image into a series of patches. Then, a global energy function, which consists of a data term and a smoothness term, is built on the patches. The data term is the second-order Taylor expansion of correlation coefficients, and the smoothness term is built by combing connectivity constraints and the coplanarity constraints are combined to construct the smoothness term. Finally, the global energy function can be built by combining the data term and the smoothness term. We rewrite the global energy function in a quadratic matrix function, and use least square methods to obtain the optimal solution. Experiments on Adirondack stereo and Motorcycle stereo of Middlebury benchmark show that the proposed method can remove fronto-parallel bias effectively, and produce continuous smooth surfaces.

  20. Table tennis match analysis: a review.

    Science.gov (United States)

    Fuchs, Michael; Liu, Ruizhi; Malagoli Lanzoni, Ivan; Munivrana, Goran; Straub, Gunter; Tamaki, Sho; Yoshida, Kazuto; Zhang, Hui; Lames, Martin

    2018-03-15

    In table tennis, many different approaches to scientific founded match analysis have been developed since the first ones in the 1960s. The aim of this paper is to give a review on some of the most acknowledged methods of match analysis in table tennis. The first chapter presents a historical overview of match analysis from all over the world. The second part reviews different approaches to match analysis in more detail, using the performance analysis classification of theoretical and practical performance analysis. The review includes the most actual theoretical performance analysis techniques in table tennis: performance indices, simulative approaches, momentum analysis, footwork analysis, and finally an approach which uses top expert knowledge for a comprehensive technical-tactical analysis. In the section of practical performance analysis, the paper presents two "best practice" examples describing performance analysis procedures of the two most successful countries of the last Olympics: China and Japan. The paper ends with a summary on the impact of the different approaches and gives an outlook on promising new developments.

  1. DOE Matching Grant Program

    International Nuclear Information System (INIS)

    Tsoukalas, L.

    2002-01-01

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

  2. Regression analysis by example

    CERN Document Server

    Chatterjee, Samprit

    2012-01-01

    Praise for the Fourth Edition: ""This book is . . . an excellent source of examples for regression analysis. It has been and still is readily readable and understandable."" -Journal of the American Statistical Association Regression analysis is a conceptually simple method for investigating relationships among variables. Carrying out a successful application of regression analysis, however, requires a balance of theoretical results, empirical rules, and subjective judgment. Regression Analysis by Example, Fifth Edition has been expanded

  3. Matching Games with Additive Externalities

    DEFF Research Database (Denmark)

    Branzei, Simina; Michalak, Tomasz; Rahwan, Talal

    2012-01-01

    Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas...... fully expressive representations of externalities in matchings require exponential space, in this paper we propose a compact model of externalities, in which the influence of a match on each agent is computed additively. In this framework, we analyze many-to-many and one-to-one matchings under neutral...

  4. Code query by example

    Science.gov (United States)

    Vaucouleur, Sebastien

    2011-02-01

    We introduce code query by example for customisation of evolvable software products in general and of enterprise resource planning systems (ERPs) in particular. The concept is based on an initial empirical study on practices around ERP systems. We motivate our design choices based on those empirical results, and we show how the proposed solution helps with respect to the infamous upgrade problem: the conflict between the need for customisation and the need for upgrade of ERP systems. We further show how code query by example can be used as a form of lightweight static analysis, to detect automatically potential defects in large software products. Code query by example as a form of lightweight static analysis is particularly interesting in the context of ERP systems: it is often the case that programmers working in this field are not computer science specialists but more of domain experts. Hence, they require a simple language to express custom rules.

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

  6. Matching score based face recognition

    NARCIS (Netherlands)

    Boom, B.J.; Beumer, G.M.; Spreeuwers, Lieuwe Jan; Veldhuis, Raymond N.J.

    2006-01-01

    Accurate face registration is of vital importance to the performance of a face recognition algorithm. We propose a new method: matching score based face registration, which searches for optimal alignment by maximizing the matching score output of a classifier as a function of the different

  7. Efficient line matching with homography

    Science.gov (United States)

    Shen, Yan; Dai, Yuxing; Zhu, Zhiliang

    2018-03-01

    In this paper, we propose a novel approach to line matching based on homography. The basic idea is to use cheaply obtainable matched points to boost the similarity between two images. Two types of homography method, which are estimated by direct linear transformation, transform images and extract their similar parts, laying a foundation for the use of optical flow tracking. The merit of the similarity is that rapid matching can be achieved by regionalizing line segments and local searching. For multiple homography estimation that can perform better than one global homography, we introduced the rank-one modification method of singular value decomposition to reduce the computation cost. The proposed approach results in point-to-point matches, which can be utilized with state-of-the-art point-match-based structures from motion (SfM) frameworks seamlessly. The outstanding performance and feasible robustness of our approach are demonstrated in this paper.

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

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

  10. An Implementation of the Frequency Matching Method

    DEFF Research Database (Denmark)

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

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

  11. Maple by example

    CERN Document Server

    Abell, Martha L

    2005-01-01

    Maple by Example, Third Edition, is a reference/text with CD for beginning and experienced students, professional engineers, and other Maple users. This new edition has been updated to be compatible with the most recent release of the Maple software. Coverage includes built-in Maple commands used in courses and practices that involve calculus, linear algebra, business mathematics, ordinary and partial differential equations, numerical methods, graphics and more. The CD-ROM provides updated Maple input and all text from the book.* Updated coverage of Maple features and functions * Backwards compatible for all versions* New applications from a variety of fields, including biology, physics and engineering* Expanded topics with many additional examples

  12. Neutrosophic Examples in Physics

    Directory of Open Access Journals (Sweden)

    Fu Yuhua

    2013-03-01

    Full Text Available Neutrosophy can be widely applied in physics and the like. For example, one of the reasons for 2011 Nobel Prize for physics is "for the discovery of the accelerating expansion of the universe through observations of distant supernovae", but according to neutrosophy, there exist seven or nine states of accelerating expansion and contraction and the neutrosophic state in the universe. Another two examples are "a revision to Gödel's incompleteness theorem by neutrosophy" and "six neutral (neutrosophic fundamental interactions". In addition, the "partial and temporary unified theory so far" is discussed (including "partial and temporary unified electromagnetic theory so far", "partial and temporary unified gravitational theory so far", "partial and temporary unified theory of four fundamental interactions so far", and "partial and temporary unified theory of natural science so far".

  13. The Power of Example

    DEFF Research Database (Denmark)

    Bülow, Anne Marie

    2013-01-01

    This paper suggests that for negotiation studies, the well-researched role of cognitive closure in decision-making should be supplemented with specific research on what sort of information is seized on as unambiguous, salient and easily processable by negotiators. A study of email negotiation is ...... is reported that suggests that negotiators seize on concrete examples as building blocks that produce immediate positive feedback and consequent utilization in establishing common ground....

  14. Examples of plasma horizons

    International Nuclear Information System (INIS)

    Hanni, R.S.

    1975-01-01

    The concept of the plasma horizon, defined as the boundary of the region in which an infinitely thin plasma can be supported against Coulomb attraction by a magnetic field, shows that the argument of selective accretion does not rule out the existence of charged black holes embedded in a conducting plasma. A detailed account of the covariant definition of plasma horizon is given and some examples of plasma horizons are presented. 7 references

  15. Toward Practical Secure Stable Matching

    Directory of Open Access Journals (Sweden)

    Riazi M. Sadegh

    2017-01-01

    Full Text Available The Stable Matching (SM algorithm has been deployed in many real-world scenarios including the National Residency Matching Program (NRMP and financial applications such as matching of suppliers and consumers in capital markets. Since these applications typically involve highly sensitive information such as the underlying preference lists, their current implementations rely on trusted third parties. This paper introduces the first provably secure and scalable implementation of SM based on Yao’s garbled circuit protocol and Oblivious RAM (ORAM. Our scheme can securely compute a stable match for 8k pairs four orders of magnitude faster than the previously best known method. We achieve this by introducing a compact and efficient sub-linear size circuit. We even further decrease the computation cost by three orders of magnitude by proposing a novel technique to avoid unnecessary iterations in the SM algorithm. We evaluate our implementation for several problem sizes and plan to publish it as open-source.

  16. Approximate Matching of Hierarchial Data

    DEFF Research Database (Denmark)

    Augsten, Nikolaus

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

  17. Stretching Local Dollars: A Small Town Guide to Matching Funds.

    Science.gov (United States)

    Brown, Hamilton

    The purpose of this guidebook is to help elected leaders of small towns and communities stretch their investments when matching funds are required to compete for a grant or to pay for development costs above the grant award itself. The federal "small cities" Community Development Block Grant (CDBG) is used as an example throughout the…

  18. PRINCIPLE "EARLY MATCHING" AERODYNAMIC DESIGN AIRCRAFT WITH LANDING GEAR HOVERCRAFT

    Directory of Open Access Journals (Sweden)

    V. P. Morozov

    2015-01-01

    Full Text Available The principle of "early matching" aircraft aerohydrodynamic layouts with air cushion landing gear is suggested. Application of this principle is considered as an example of adaptation to the ball screw base circuit of light transport aircraft. The principle, other than weight, aerodynamic, technological and operational requirements includes additional project activities related to the installation of ball screws.

  19. A string matching based algorithm for performance evaluation of ...

    Indian Academy of Sciences (India)

    Levenshtein edit distance can be applied. This approach is intuitive as extraneous symbols are not involved in the matching process. The paper is organized as follows. .... For example, consider an ME: ai+1. 2 and its LATEX string given by: aˆ{i+1}_2. In LATEX,ˆ and _ designate superscript (northern subexpression) and ...

  20. Multi-track Map Matching

    OpenAIRE

    Javanmard, Adel; Haridasan, Maya; Zhang, Li

    2012-01-01

    We study algorithms for matching user tracks, consisting of time-ordered location points, to paths in the road network. Previous work has focused on the scenario where the location data is linearly ordered and consists of fairly dense and regular samples. In this work, we consider the \\emph{multi-track map matching}, where the location data comes from different trips on the same route, each with very sparse samples. This captures the realistic scenario where users repeatedly travel on regular...

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

  2. Matching bunched beams to alternating gradient focusing systems

    International Nuclear Information System (INIS)

    Lysenko, W.P.

    1980-07-01

    A numerical procedure for generating phase-space distributions matched to alternating gradient focusing systems has been tested. For a smooth-focusing system a matched distribution can be calculated. With a particle tracing simulation code such a distribution can be followed while adiabatically deforming the focusing forces until an alternating gradient configuration is reached. The distribution remains matched; that is, the final distribution is periodic with the structure period. This method is useful because it can produce distributions matched to nonlinear forces. This is a feature that elliptical distributions, with ellipse parameters obtained from the Courant-Snyder theory, do not have. External nonlinearities, including nonlinear couplings, were included in our examples but space charge was not. This procedure is expected to work with space charge but will require a three-dimensional space charge calculation in the simulation code

  3. Template matching techniques in computer vision theory and practice

    CERN Document Server

    Brunelli, Roberto

    2009-01-01

    The detection and recognition of objects in images is a key research topic in the computer vision community.  Within this area, face recognition and interpretation has attracted increasing attention owing to the possibility of unveiling human perception mechanisms, and for the development of practical biometric systems. This book and the accompanying website, focus on template matching, a subset of object recognition techniques of wide applicability, which has proved to be particularly effective for face recognition applications. Using examples from face processing tasks throughout the book to illustrate more general object recognition approaches, Roberto Brunelli: examines the basics of digital image formation, highlighting points critical to the task of template matching;presents basic and  advanced template matching techniques, targeting grey-level images, shapes and point sets;discusses recent pattern classification paradigms from a template matching perspective;illustrates the development of a real fac...

  4. Modern examples of extinctions

    DEFF Research Database (Denmark)

    Lövei, Gabor L

    2013-01-01

    No species lives forever, and extinction is the ultimate fate of all living species. The fossil record indicates that a recent extinction wave affecting terrestrial vertebrates was parallel with the arrival of modern humans to areas formerly uninhabited by them. These modern instances of extinction......, by the time it has run its course, it will potentially surpass the previous five mass extinction events in the history of Earth. This article only deals with examples of extinction in the Quaternary period (from the final period of the last Ice Age, 10,000 years ago)....

  5. The Kent Face Matching Test.

    Science.gov (United States)

    Fysh, Matthew C; Bindemann, Markus

    2018-05-01

    This study presents the Kent Face Matching Test (KFMT), which comprises 200 same-identity and 20 different-identity pairs of unfamiliar faces. Each face pair consists of a photograph from a student ID card and a high-quality portrait that was taken at least three months later. The test is designed to complement existing resources for face-matching research, by providing a more ecologically valid stimulus set that captures the natural variability that can arise in a person's appearance over time. Two experiments are presented to demonstrate that the KFMT provides a challenging measure of face matching but correlates with established tests. Experiment 1 compares a short version of this test with the optimized Glasgow Face Matching Test (GFMT). In Experiment 2, a longer version of the KFMT, with infrequent identity mismatches, is correlated with performance on the Cambridge Face Memory Test (CFMT) and the Cambridge Face Perception Test (CFPT). The KFMT is freely available for use in face-matching research. © 2017 The British Psychological Society.

  6. Mix-and-match holography

    KAUST Repository

    Peng, Yifan

    2017-11-22

    Computational caustics and light steering displays offer a wide range of interesting applications, ranging from art works and architectural installations to energy efficient HDR projection. In this work we expand on this concept by encoding several target images into pairs of front and rear phase-distorting surfaces. Different target holograms can be decoded by mixing and matching different front and rear surfaces under specific geometric alignments. Our approach, which we call mix-and-match holography, is made possible by moving from a refractive caustic image formation process to a diffractive, holographic one. This provides the extra bandwidth that is required to multiplex several images into pairing surfaces.

  7. A Phase Matching, Adiabatic Accelerator

    Energy Technology Data Exchange (ETDEWEB)

    Lemery, Francois [Hamburg U.; Flöttmann, Klaus [DESY; Kärtner, Franz [CFEL, Hamburg; Piot, Philippe [Northern Illinois U.

    2017-05-01

    Tabletop accelerators are a thing of the future. Reducing their size will require scaling down electromagnetic wavelengths; however, without correspondingly high field gradients, particles will be more susceptible to phase-slippage – especially at low energy. We investigate how an adiabatically-tapered dielectric-lined waveguide could maintain phase-matching between the accelerating mode and electron bunch. We benchmark our simple model with CST and implement it into ASTRA; finally we provide a first glimpse into the beam dynamics in a phase-matching accelerator.

  8. Psychometric functions of uncertain template matching observers.

    Science.gov (United States)

    Geisler, Wilson S

    2018-02-01

    This theoretical note describes a simple equation that closely approximates the psychometric functions of template-matching observers with arbitrary levels of position and orientation uncertainty. We show that the approximation is accurate for detection of targets in white noise, 1/f noise, and natural backgrounds. In its simplest form, this equation, which we call the uncertain normal integral (UNI) function, has two parameters: one that varies only with the level of uncertainty and one that varies only with the other properties of the stimuli. The UNI function is useful for understanding and generating predictions of uncertain template matching (UTM) observers. For example, we use the UNI function to derive a closed-form expression for the detectability (d') of UTM observers in 1/f noise, as a function of target amplitude, background contrast, and position uncertainty. As a descriptive function, the UNI function is just as flexible and simple as other common descriptive functions, such as the Weibull function, and it avoids some of their undesirable properties. In addition, the estimated parameters have a clear interpretation within the family of UTM observers. Thus, the UNI function may be the better default descriptive formula for psychometric functions in detection and discrimination tasks.

  9. Towards optimal packed string matching

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  10. Typed and Unambiguous Pattern Matching on Strings using Regular Expressions

    DEFF Research Database (Denmark)

    Brabrand, Claus; Thomsen, Jakob Grauenkjær

    2010-01-01

     capable of pinpointing all ambiguities in terms of the structure of the regular expression and report shortest ambiguous strings. We also show how pattern matching can be integrated into statically typed programming languages for deconstructing strings and reproducing typed and structured values. We validate our...... approach by giving a full implementation of the approach presented in this paper.  The resulting tool, reg-exp-rec, adds typed and unambiguous pattern matching to Java in a stand-alone and non-intrusive manner.  We evaluate the approach using several realistic examples....

  11. Model-based shape matching of orthopaedic implants in RSA and fluoroscopy

    NARCIS (Netherlands)

    Prins, Anne Hendrik

    2015-01-01

    Model-based shape matching is commonly used, for example to measure the migration of an implant with Roentgen stereophotogrammetric analysis (RSA) or to measure implant kinematics with fluoroscopy. The aim of this thesis was to investigate the general usability of shape matching and to improve the

  12. Matching of equivalent field regions

    DEFF Research Database (Denmark)

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

    2005-01-01

    In aperture problems, integral equations for equivalent currents are often found by enforcing matching of equivalent fields. The enforcement is made in the aperture surface region adjoining the two volumes on each side of the aperture. In the case of an aperture in a planar perfectly conducting...... 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...... 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...

  13. Role model and prototype matching

    DEFF Research Database (Denmark)

    Lykkegaard, Eva; Ulriksen, Lars

    2016-01-01

    Previous research has found that young people’s prototypes of science students and scientists affect their inclination to choose tertiary STEM programs (Science, Technology, Engineering and Mathematics). Consequently, many recruitment initiatives include role models to challenge these prototypes......’ meetings with the role models affected their thoughts concerning STEM students and attending university. The regular self-to-prototype matching process was shown in real-life role-models meetings to be extended to a more complex three-way matching process between students’ self-perceptions, prototype...... images and situation-specific conceptions of role models. Furthermore, the study underlined the positive effect of prolonged role-model contact, the importance of using several role models and that traditional school subjects catered more resistant prototype images than unfamiliar ones did...

  14. University Reactor Matching Grants Program

    International Nuclear Information System (INIS)

    John Valentine; Farzad Rahnema; Said Abdel-Khalik

    2003-01-01

    During the 2002 Fiscal year, funds from the DOE matching grant program, along with matching funds from the industrial sponsors, have been used to support research in the area of thermal-hydraulics. Both experimental and numerical research projects have been performed. Experimental research focused on two areas: (1) Identification of the root cause mechanism for axial offset anomaly in pressurized water reactors under prototypical reactor conditions, and (2) Fluid dynamic aspects of thin liquid film protection schemes for inertial fusion reactor chambers. Numerical research focused on two areas: (1) Multi-fluid modeling of both two-phase and two-component flows for steam conditioning and mist cooling applications, and (2) Modeling of bounded Rayleigh-Taylor instability with interfacial mass transfer and fluid injection through a porous wall simulating the ''wetted wall'' protection scheme in inertial fusion reactor chambers. Details of activities in these areas are given

  15. Matching conditions in relativistic astrophysics

    OpenAIRE

    Quevedo, Hernando

    2012-01-01

    We present an exact electrovacuum solution of Einstein-Maxwell equations with infinite sets of multipole moments which can be used to describe the exterior gravitational field of a rotating charged mass distribution. We show that in the special case of a slowly rotating and slightly deformed body, the exterior solution can be matched to an interior solution belonging to the Hartle-Thorne family of approximate solutions. To search for exact interior solutions, we propose to use the derivatives...

  16. Impedance-matched Marx generators

    Directory of Open Access Journals (Sweden)

    W. A. Stygar

    2017-04-01

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

  17. Impedance-matched Marx generators

    Science.gov (United States)

    Stygar, W. A.; LeChien, K. R.; Mazarakis, M. G.; Savage, M. E.; Stoltzfus, B. S.; Austin, K. N.; Breden, E. W.; Cuneo, M. E.; Hutsel, B. T.; Lewis, S. A.; McKee, G. R.; Moore, J. K.; Mulville, T. D.; Muron, D. J.; Reisman, D. B.; Sceiford, M. E.; Wisher, M. L.

    2017-04-01

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

  18. Examples of Dietary Supplement Interactions

    Science.gov (United States)

    ... Products Drug-Nutrient Interactions and Drug-Supplement Interactions | Examples of Dietary Supplement Interactions Drug-Nutrient Interactions and Drug-Supplement Interactions | Examples of Dietary Supplement Interactions Share Print Almost half ...

  19. Transit Matching for International Safeguards

    International Nuclear Information System (INIS)

    Gilligan, K.; Whitaker, M.; Oakberg, J.

    2015-01-01

    In 2013 the U.S. Department of Energy / National Nuclear Security Administration Office of Non-proliferation and International Security (NIS) supported a study of the International Atomic Energy Agency's (IAEA) processes and procedures for ensuring that shipments of nuclear material correspond to (match) their receipts (i.e., transit matching). Under Comprehensive Safeguards Agreements, Member States are obliged to declare such information within certain time frames. Nuclear weapons states voluntarily declare such information under INFCIRC/207. This study was funded by the NIS Next Generation Safeguards Initiative (NGSI) Concepts and Approaches program. Oak Ridge National Laboratory led the research, which included collaboration with the U.S. Nuclear Regulatory Commission, the U.S. Nuclear Material Management and Safeguards System (NMMSS), and the IAEA Section for Declared Information Analysis within the Department of Safeguards. The project studied the current transit matching methodologies, identified current challenges (e.g., level of effort and timeliness), and suggested improvements. This paper presents the recommendations that resulted from the study and discussions with IAEA staff. In particular, it includes a recommendation to collaboratively develop a set of best reporting practices for nuclear weapons states under INFCIRC/207. (author)

  20. Organizing for a Peaceful Crowd: An Example of a Football Match

    Directory of Open Access Journals (Sweden)

    Ingrid Hylander

    2010-03-01

    Full Text Available Crowd violence has interested researchers in social psychology for many years and is an important issue for sports psychology (STOTT, ADANG, LIVINGSTONE & SCHREIBER, 2007; STOTT, HUTCHINSON & DRURY, 2001; RUSSELL, 2004; MUSTONEN, ARMS & RUSSELL, 1996. Riots in crowds have been explained from different theoretical perspectives (HYLANDER, 2008, such as individual differences, de-individuation (PRENTICE-DUNN & ROGERS, 1989, group interaction (DRURY & REICHER, 2000, history (GUTTMAN, 1986, 1998 and cultural perspectives (CRABBE, 2003. In this study, a social psychology model focusing on group interaction, the Aggravation and Mitigation (AM model (GUVÅ & HYLANDER, 2008; GRANSTRÖM, 2008; GRANSTRÖM & ROSANDER, 2008, is used as a means of analysis. This article applies the AM model to a sporting event to identify if and how peacemaking processes can be detected. Furthermore, the intention is to discern and illuminate organizational strategies that maybe linked to peacemaking processes. The main results indicate that when arrangements are based on (a "festival-making," (b arrangements for basic needs and recognizable order and (c the creation of a superordinate identity, then the outcome of mass events may turn out peaceful, which is also in line with the AM model. URN: urn:nbn:de:0114-fqs100283

  1. Adding Trace Matching with Free Variables to AspectJ

    DEFF Research Database (Denmark)

    Allan, Chris; Avgustinov, Pavel; Christensen, Aske Simon

    2005-01-01

    An aspect observes the execution of a base program; when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspect can make are confined to the current action: it is not possible to directly observe the history of a computation...... by specifying a regular pattern of events in a computation trace. We have fully designed and implemented tracematches as a seamless extension of AspectJ. A key innovation in our tracematch approach is the introduction of free variables in the matching patterns. This enhancement enables a whole new class...... of applications in which events can be matched not only by the event kind, but also by the values associated with the free variables. We provide several examples of applications enabled by this feature. After introducing and motivating the idea of tracematches via examples, we present a detailed semantics of our...

  2. Typed and unambiguous pattern matching on strings using regular expressions

    DEFF Research Database (Denmark)

    Brabrand, Claus; Thomsen, Jakob G.

    2010-01-01

    We show how to achieve typed and unambiguous declarative pattern matching on strings using regular expressions extended with a simple recording operator. We give a characterization of ambiguity of regular expressions that leads to a sound and complete static analysis. The analysis is capable...... of pinpointing all ambiguities in terms of the structure of the regular expression and report shortest ambiguous strings. We also show how pattern matching can be integrated into statically typed programming languages for deconstructing strings and reproducing typed and structured values. We validate our...... approach by giving a full implementation of the approach presented in this paper. The resulting tool, reg-exp-rec, adds typed and unambiguous pattern matching to Java in a stand-alone and non-intrusive manner. We evaluate the approach using several realistic examples....

  3. Application of supergeneralized matched filters to target classification

    Science.gov (United States)

    Heidary, Kaveh; Caulfield, H. John

    2005-01-01

    The matched filter (MF) is the optimum linear operator for distinguishing between a fixed signal and noise, given the noise statistics. A generalized matched filter (GMF) is a linear filter that can handle the more difficult problem of a multiple-example signal set, and it reduces to a MF when the signal set has only one member. A supergeneralized matched filter (SGMF) is a set of GMFs and a procedure to combine their results nonlinearly to handle the multisignal problem even better. Obviously the SGMF contains the GMF as a special case. An algorithm for training SGMFs is presented, and it is shown that the algorithm performs quite well even for extremely difficult classification problems.

  4. The power of example

    Science.gov (United States)

    Liliana Gheorghian, Mariana

    2014-05-01

    beginning of the XXI century" with the participation of several schools in the country in 2009 and 2011. The papers presented were diverse and gave examples of various teaching experiences and scientific information. Topics by the teachers: The impact of tourism on the environment, Tornadoes, Natural science and environmental education in school, Air Pollution and health, Ecological education of children from primary school, The effects of electromagnetic radiation, Formation of an ecological mentality using chemistry, Why should we protect water, Environmental education, Education for the future, SOS Nature, Science in the twenty-first century, etc. Topics by students: Nature- the palace of thermal phenomena, Life depends on heat, Water Mysteries, Global Heating, The Mysterious universe, etc. In March 2013 our school hosted an interesting exchange of ideas on environmental issues between our students and those from Bulgaria, Poland and Turkey, during a symposium of the Comenius multilateral project "Conserving Nature". In order to present the results of protecting nature in their communities, two projects "Citizen" qualified in the Program Civitas in the autumn of 2013. "The Battle" continues both in nature and in classrooms, in order to preserve the environment.

  5. Customer and household matching: resolving entity identity in data warehouses

    Science.gov (United States)

    Berndt, Donald J.; Satterfield, Ronald K.

    2000-04-01

    The data preparation and cleansing tasks necessary to ensure high quality data are among the most difficult challenges faced in data warehousing and data mining projects. The extraction of source data, transformation into new forms, and loading into a data warehouse environment are all time consuming tasks that can be supported by methodologies and tools. This paper focuses on the problem of record linkage or entity matching, tasks that can be very important in providing high quality data. Merging two or more large databases into a single integrated system is a difficult problem in many industries, especially in the wake of acquisitions. For example, managing customer lists can be challenging when duplicate entries, data entry problems, and changing information conspire to make data quality an elusive target. Common tasks with regard to customer lists include customer matching to reduce duplicate entries and household matching to group customers. These often O(n2) problems can consume significant resources, both in computing infrastructure and human oversight, and the goal of high accuracy in the final integrated database can be difficult to assure. This paper distinguishes between attribute corruption and entity corruption, discussing the various impacts on quality. A metajoin operator is proposed and used to organize past and current entity matching techniques. Finally, a logistic regression approach to implementing the metajoin operator is discussed and illustrated with an example. The metajoin can be used to determine whether two records match, don't match, or require further evaluation by human experts. Properly implemented, the metajoin operator could allow the integration of individual databases with greater accuracy and lower cost.

  6. Value-driven service matching

    NARCIS (Netherlands)

    Gordijn, Jaap; de Kinderen, Sybren; Wieringa, Roelf J.

    2008-01-01

    Today's economy is a service economy, and an increasing number of services is electronic, i.e. can be ordered and provisioned online. Examples include Internet access, email and Voice over IP. Just as any other kind of services, e-services often are offered in bundles, and many consumer needs

  7. Query by image example: The CANDID approach

    Energy Technology Data Exchange (ETDEWEB)

    Kelly, P.M.; Cannon, M. [Los Alamos National Lab., NM (United States). Computer Research and Applications Group; Hush, D.R. [Univ. of New Mexico, Albuquerque, NM (United States). Dept. of Electrical and Computer Engineering

    1995-02-01

    CANDID (Comparison Algorithm for Navigating Digital Image Databases) was developed to enable content-based retrieval of digital imagery from large databases using a query-by-example methodology. A user provides an example image to the system, and images in the database that are similar to that example are retrieved. The development of CANDID was inspired by the N-gram approach to document fingerprinting, where a ``global signature`` is computed for every document in a database and these signatures are compared to one another to determine the similarity between any two documents. CANDID computes a global signature for every image in a database, where the signature is derived from various image features such as localized texture, shape, or color information. A distance between probability density functions of feature vectors is then used to compare signatures. In this paper, the authors present CANDID and highlight two results from their current research: subtracting a ``background`` signature from every signature in a database in an attempt to improve system performance when using inner-product similarity measures, and visualizing the contribution of individual pixels in the matching process. These ideas are applicable to any histogram-based comparison technique.

  8. Eyes Matched to the Prize: The State of Matched Filters in Insect Visual Circuits

    Directory of Open Access Journals (Sweden)

    Jessica R. Kohn

    2018-04-01

    Full Text Available Confronted with an ever-changing visual landscape, animals must be able to detect relevant stimuli and translate this information into behavioral output. A visual scene contains an abundance of information: to interpret the entirety of it would be uneconomical. To optimally perform this task, neural mechanisms exist to enhance the detection of important features of the sensory environment while simultaneously filtering out irrelevant information. This can be accomplished by using a circuit design that implements specific “matched filters” that are tuned to relevant stimuli. Following this rule, the well-characterized visual systems of insects have evolved to streamline feature extraction on both a structural and functional level. Here, we review examples of specialized visual microcircuits for vital behaviors across insect species, including feature detection, escape, and estimation of self-motion. Additionally, we discuss how these microcircuits are modulated to weigh relevant input with respect to different internal and behavioral states.

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

  10. Monetary Exchange with Multilateral Matching

    DEFF Research Database (Denmark)

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

    This paper analyzes monetary exchange in a search model allowing for multilateral matches to be formed, according to a standard urn-ballprocess. We consider three physical environments: indivisible goods and money, divisible goods and indivisible money, and divisible goods and money. We compare....... In particular, surplus maximization can be achieved in this setting, in equilibrium, with a positive money supply. Moreover, with flexible prices and directed search, the first best allocation can be attained through price posting or through auctions with lotteries, but not through auctions without lotteries....... 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)....

  11. LDAHash: Improved Matching with Smaller Descriptors.

    Science.gov (United States)

    Strecha, C; Bronstein, A M; Bronstein, M M; Fua, P

    2012-01-01

    SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such as content-based retrieval, video analysis, copy detection, object recognition, photo tourism, and 3D reconstruction. Feature descriptors can be designed to be invariant to certain classes of photometric and geometric transformations, in particular, affine and intensity scale transformations. However, real transformations that an image can undergo can only be approximately modeled in this way, and thus most descriptors are only approximately invariant in practice. Second, descriptors are usually high dimensional (e.g., SIFT is represented as a 128-dimensional vector). In large-scale retrieval and matching problems, this can pose challenges in storing and retrieving descriptor data. We map the descriptor vectors into the Hamming space in which the Hamming metric is used to compare the resulting representations. This way, we reduce the size of the descriptors by representing them as short binary strings and learn descriptor invariance from examples. We show extensive experimental validation, demonstrating the advantage of the proposed approach.

  12. 24 CFR 576.51 - Matching funds.

    Science.gov (United States)

    2010-04-01

    ... specific statutory subtitle from which ESG funds are provided), as well as State, local, and private... match a previous ESG grant may not be used to match a subsequent grant award under this part. A grantee...

  13. Database crime to crime match rate calculation.

    Science.gov (United States)

    Buckleton, John; Bright, Jo-Anne; Walsh, Simon J

    2009-06-01

    Guidance exists on how to count matches between samples in a crime sample database but we are unable to locate a definition of how to estimate a match rate. We propose a method that does not proceed from the match counting definition but which has a strong logic.

  14. Small sample properties of matching with caliper

    OpenAIRE

    Paweł Strawiński

    2012-01-01

    A caliper mechanism is a common tool used to prevent from inexact matches. The existing literature discusses asymptotic properties of matching with caliper. In this simulation study we investigate properties in small and medium sized samples. We show that caliper causes a significant bias of the ATT estimator and raises its variance in comparison to one-to-one matching.

  15. Robust weighted scan matching with quadtrees

    NARCIS (Netherlands)

    Visser, A.; Slamet, B.A.; Pfingsthorn, M.

    2009-01-01

    This paper presents the improvement of the robustness and accuracy of the weighted scan matching algorithm matching against the union of earlier acquired scans. The approach allows to reduce the correspondence error, which is explicitly modeled in the weighted scan matching algorithm, by providing a

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

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

  18. Extended asymptotic functions - some examples

    International Nuclear Information System (INIS)

    Todorov, T.D.

    1981-01-01

    Several examples of extended asymptotic functions of two variables are given. This type of asymptotic functions has been introduced as an extension of continuous ordinary functions. The presented examples are realizations of some Schwartz distributions delta(x), THETA(x), P(1/xsup(n)) and can be multiplied in the class of the asymptotic functions as opposed to the theory of Schwartz distributions. The examples illustrate the method of construction of extended asymptotic functions similar to the distributions. The set formed by the extended asymptotic functions is also considered. It is shown, that this set is not closed with respect to addition and multiplication

  19. Matching roots to their environment.

    Science.gov (United States)

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

    2013-07-01

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

  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. Kangaroo – A pattern-matching program for biological sequences

    Directory of Open Access Journals (Sweden)

    Betel Doron

    2002-07-01

    Full Text Available Abstract Background Biologists are often interested in performing a simple database search to identify proteins or genes that contain a well-defined sequence pattern. Many databases do not provide straightforward or readily available query tools to perform simple searches, such as identifying transcription binding sites, protein motifs, or repetitive DNA sequences. However, in many cases simple pattern-matching searches can reveal a wealth of information. We present in this paper a regular expression pattern-matching tool that was used to identify short repetitive DNA sequences in human coding regions for the purpose of identifying potential mutation sites in mismatch repair deficient cells. Results Kangaroo is a web-based regular expression pattern-matching program that can search for patterns in DNA, protein, or coding region sequences in ten different organisms. The program is implemented to facilitate a wide range of queries with no restriction on the length or complexity of the query expression. The program is accessible on the web at http://bioinfo.mshri.on.ca/kangaroo/ and the source code is freely distributed at http://sourceforge.net/projects/slritools/. Conclusion A low-level simple pattern-matching application can prove to be a useful tool in many research settings. For example, Kangaroo was used to identify potential genetic targets in a human colorectal cancer variant that is characterized by a high frequency of mutations in coding regions containing mononucleotide repeats.

  2. From Utterance to Example Sentence

    DEFF Research Database (Denmark)

    Kristoffersen, Jette Hedegaard

    This poster will address some of the problems on excerption of example sentences for the online dictionary of Danish Sign Language (DTS) from a raw corpus of dialogues and monologues. In the Danish Sign Language Dictionary every meaning is illustrated by one or more sentences showing the sign...... lexicographers. The sentences were excerpted by hand from a raw corpus of dialogues and monologues – given to us by our group of consultants. The poster describes the process from utterance in a corpus in a larger context to an example sentence in a dictionary, where the purpose of having examples sentences...... is to help the dictionary user to gain additional knowledge of a meaning of a sign, as well as to provide sentence constructions that can be adopted by the L2 learner. The process from the moment when a sentence has been excerpted from the corpus to the point when an example sentence is finally accepted...

  3. Example Problems in LES Combustion

    Science.gov (United States)

    2016-09-26

    memorandum is the evaporation and subsequent combustion of liquid fuel droplets. Kerosene, a complex hydrogen mixture, is explored from the standpoint of...AFRL-RW-EG-TP-2016-002 Example Problems in LES Combustion Douglas V. Nance Air Force Research Laboratory Munitions...4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Example Problem in LES Combustion 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER

  4. Fast matching of sensor data with manual observations.

    Science.gov (United States)

    Jit, Biswas; Maniyeri, Jayachandran; Louis, Shue; Philip, Yap Lin Kiat

    2009-01-01

    In systems and trials concerning wearable sensors and devices used for medical data collection, the validation of sensor data with respect to manual observations is very important. However, this is often problematic because of feigned behavior, errors in manual recording (misclassification), gaps in recording (missing readings), missed observations and timing mismatch between manual observations and sensor data due to a difference in time granularity. Using sleep activity pattern monitoring as an example we present a fast algorithm for matching sensor data with manual observations. Major components include a) signal analysis to classify states of sleep activity pattern, b) matching of states with Sleep Diary (SD) and c) automated detection of anomalies and reconciliation of mismatches between the SD and the sensor data.

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

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

  7. Matching fields and lattice points of simplices

    OpenAIRE

    Loho, Georg; Smith, Ben

    2018-01-01

    We show that the Chow covectors of a linkage matching field define a bijection of lattice points and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels & Zelevinsky (1993) on linkage matching fields. For this, we give an explicit construction that associates a bipartite incidence graph of an ordered partition of a common set to all lattice points in a dilated simplex. Given a triangulation of a product of two simp...

  8. Tackling the challenges of matching biomedical ontologies.

    Science.gov (United States)

    Faria, Daniel; Pesquita, Catia; Mott, Isabela; Martins, Catarina; Couto, Francisco M; Cruz, Isabel F

    2018-01-15

    Biomedical ontologies pose several challenges to ontology matching due both to the complexity of the biomedical domain and to the characteristics of the ontologies themselves. The biomedical tracks in the Ontology Matching Evaluation Initiative (OAEI) have spurred the development of matching systems able to tackle these challenges, and benchmarked their general performance. In this study, we dissect the strategies employed by matching systems to tackle the challenges of matching biomedical ontologies and gauge the impact of the challenges themselves on matching performance, using the AgreementMakerLight (AML) system as the platform for this study. We demonstrate that the linear complexity of the hash-based searching strategy implemented by most state-of-the-art ontology matching systems is essential for matching large biomedical ontologies efficiently. We show that accounting for all lexical annotations (e.g., labels and synonyms) in biomedical ontologies leads to a substantial improvement in F-measure over using only the primary name, and that accounting for the reliability of different types of annotations generally also leads to a marked improvement. Finally, we show that cross-references are a reliable source of information and that, when using biomedical ontologies as background knowledge, it is generally more reliable to use them as mediators than to perform lexical expansion. We anticipate that translating traditional matching algorithms to the hash-based searching paradigm will be a critical direction for the future development of the field. Improving the evaluation carried out in the biomedical tracks of the OAEI will also be important, as without proper reference alignments there is only so much that can be ascertained about matching systems or strategies. Nevertheless, it is clear that, to tackle the various challenges posed by biomedical ontologies, ontology matching systems must be able to efficiently combine multiple strategies into a mature matching

  9. Online Job Search and Matching Quality

    OpenAIRE

    Constantin Mang

    2012-01-01

    The Internet has fundamentally changed the way workers and firms are matched on the job market. Compared to newspapers and other traditional employment resources, online job boards presumably lead to better matches by providing a wider choice of job advertisements and more sophisticated methods for finding suitable vacancies. This study investigates the association of online job search and matching quality using individual-level data from the German Socio-Economic Panel (SOEP). My results sho...

  10. Parameterized String Matching Algorithms with Application to ...

    African Journals Online (AJOL)

    In the parameterized string matching problem, a given pattern P is said to match with a sub-string t of the text T, if there exist a bijection from the symbols of P to the symbols of t. Salmela and Tarhio solve the parameterized string matching problem in sub-linear time by applying the concept of q-gram in the Horspool algorithm ...

  11. A vector matching method for analysing logic Petri nets

    Science.gov (United States)

    Du, YuYue; Qi, Liang; Zhou, MengChu

    2011-11-01

    Batch processing function and passing value indeterminacy in cooperative systems can be described and analysed by logic Petri nets (LPNs). To directly analyse the properties of LPNs, the concept of transition enabling vector sets is presented and a vector matching method used to judge the enabling transitions is proposed in this article. The incidence matrix of LPNs is defined; an equation about marking change due to a transition's firing is given; and a reachable tree is constructed. The state space explosion is mitigated to a certain extent from directly analysing LPNs. Finally, the validity and reliability of the proposed method are illustrated by an example in electronic commerce.

  12. Examples and counter-examples of log-symplectic manifolds

    NARCIS (Netherlands)

    Cavalcanti, Gil R.

    We study topological properties of log-symplectic structures and produce examples of compact manifolds with such structures. Notably, we show that several symplectic manifolds do not admit bona fide log-symplectic structures and several bona fide log-symplectic manifolds do not admit symplectic

  13. Anomalous dispersion enhanced Cerenkov phase-matching

    Energy Technology Data Exchange (ETDEWEB)

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

    1993-11-01

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

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

  15. 44 CFR 361.4 - Matching contributions.

    Science.gov (United States)

    2010-10-01

    ... HOMELAND SECURITY PREPAREDNESS NATIONAL EARTHQUAKE HAZARDS REDUCTION ASSISTANCE TO STATE AND LOCAL GOVERNMENTS Earthquake Hazards Reduction Assistance Program § 361.4 Matching contributions. (a) All State...

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

  17. Second Order Mode Selective Phase-Matching

    DEFF Research Database (Denmark)

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

    2006-01-01

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

  18. Fundamental Travel Demand Model Example

    Science.gov (United States)

    Hanssen, Joel

    2010-01-01

    Instances of transportation models are abundant and detailed "how to" instruction is available in the form of transportation software help documentation. The purpose of this paper is to look at the fundamental inputs required to build a transportation model by developing an example passenger travel demand model. The example model reduces the scale to a manageable size for the purpose of illustrating the data collection and analysis required before the first step of the model begins. This aspect of the model development would not reasonably be discussed in software help documentation (it is assumed the model developer comes prepared). Recommendations are derived from the example passenger travel demand model to suggest future work regarding the data collection and analysis required for a freight travel demand model.

  19. 26 CFR 1.825-3 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 8 2010-04-01 2010-04-01 false Examples. 1.825-3 Section 1.825-3 Internal....825-3 Examples. The application of section 825 may be illustrated by the following examples: Example 1... 1970, 1971, and 1972, in that order. Example 2. If in example 1 F had an unused loss in 1966 of 22...

  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. Shaping Discourse and Setting Examples

    DEFF Research Database (Denmark)

    Persson, Anders

    2017-01-01

    around an issue. By using Tuomas Forsberg's framework of four different mechanisms of normative power: persuasion, invoking norms, shaping the discourse and the power of example on three important case studies from the conflict (EC/EU's declaratory diplomacy on the need for a just peace in the conflict...

  2. Interactive example-based hatching

    NARCIS (Netherlands)

    Gerl, Moritz; Isenberg, Tobias

    2013-01-01

    We present an approach for interactively generating pen-and-ink hatching renderings based on hand-drawn examples. We aim to overcome the regular and synthetic appearance of the results of existing methods by incorporating human virtuosity and illustration skills in the computer generation of such

  3. Active Learning with Irrelevant Examples

    Science.gov (United States)

    Wagstaff, Kiri; Mazzoni, Dominic

    2009-01-01

    An improved active learning method has been devised for training data classifiers. One example of a data classifier is the algorithm used by the United States Postal Service since the 1960s to recognize scans of handwritten digits for processing zip codes. Active learning algorithms enable rapid training with minimal investment of time on the part of human experts to provide training examples consisting of correctly classified (labeled) input data. They function by identifying which examples would be most profitable for a human expert to label. The goal is to maximize classifier accuracy while minimizing the number of examples the expert must label. Although there are several well-established methods for active learning, they may not operate well when irrelevant examples are present in the data set. That is, they may select an item for labeling that the expert simply cannot assign to any of the valid classes. In the context of classifying handwritten digits, the irrelevant items may include stray marks, smudges, and mis-scans. Querying the expert about these items results in wasted time or erroneous labels, if the expert is forced to assign the item to one of the valid classes. In contrast, the new algorithm provides a specific mechanism for avoiding querying the irrelevant items. This algorithm has two components: an active learner (which could be a conventional active learning algorithm) and a relevance classifier. The combination of these components yields a method, denoted Relevance Bias, that enables the active learner to avoid querying irrelevant data so as to increase its learning rate and efficiency when irrelevant items are present. The algorithm collects irrelevant data in a set of rejected examples, then trains the relevance classifier to distinguish between labeled (relevant) training examples and the rejected ones. The active learner combines its ranking of the items with the probability that they are relevant to yield a final decision about which item

  4. Face recognition using ensemble string matching.

    Science.gov (United States)

    Chen, Weiping; Gao, Yongsheng

    2013-12-01

    In this paper, we present a syntactic string matching approach to solve the frontal face recognition problem. String matching is a powerful partial matching technique, but is not suitable for frontal face recognition due to its requirement of globally sequential representation and the complex nature of human faces, containing discontinuous and non-sequential features. Here, we build a compact syntactic Stringface representation, which is an ensemble of strings. A novel ensemble string matching approach that can perform non-sequential string matching between two Stringfaces is proposed. It is invariant to the sequential order of strings and the direction of each string. The embedded partial matching mechanism enables our method to automatically use every piece of non-occluded region, regardless of shape, in the recognition process. The encouraging results demonstrate the feasibility and effectiveness of using syntactic methods for face recognition from a single exemplar image per person, breaking the barrier that prevents string matching techniques from being used for addressing complex image recognition problems. The proposed method not only achieved significantly better performance in recognizing partially occluded faces, but also showed its ability to perform direct matching between sketch faces and photo faces.

  5. Competence Matching Tool - Explanations and Implementation

    NARCIS (Netherlands)

    Herder, Eelco; Kärger, Philipp

    2010-01-01

    Herder, E., Kärger, P. (2009) Competence Matching Tool - Explanations and Implementation. The document contains the technical specification of the competence matching tool. The tool can be found at http://tencompetence.cvs.sourceforge.net/viewvc/tencompetence/wp7/CompetenceMatcher/ and the location

  6. Equilibrium and matching under price controls

    NARCIS (Netherlands)

    Herings, P.J.J.

    2015-01-01

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

  7. Anarchy, Stability, and Utopia: Creating Better Matchings

    Science.gov (United States)

    Anshelevich, Elliot; Das, Sanmay; Naamad, Yonatan

    We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with socially optimal ones, as well as studying the convergence of various natural algorithms to stable matchings. Our main goal is to design mechanisms that incentivize agents to participate in matchings that are socially desirable. We show that theoretically, the loss in social welfare caused by strategic behavior can be substantial. However, under some natural distributions of utilities, we show experimentally that stable matchings attain close to the optimal social welfare. Furthermore, for certain graph structures, simple greedy algorithms for partner-switching (some without convergence guarantees) converge to stability remarkably quickly in expectation. Even when stable matchings are significantly socially suboptimal, slight changes in incentives can provide good solutions. We derive conditions for the existence of approximately stable matchings that are also close to socially optimal, which demonstrates that adding small switching costs can make socially optimal matchings stable.

  8. DOE/Industry Matching Grant Program

    International Nuclear Information System (INIS)

    Lee, John C.

    2003-01-01

    For the academic year 2001-2002, the Department of Nuclear Engineering and Radiological Sciences received $50,000 of industrial contributions, matched by a DOE grant of $35,000. We used the combined DOE/Industry Matching Grant of $85,000 toward (a) undergraduate merit scholarships and research support, (b) graduate student support, and (c) partial support of a research scientist

  9. On Tree-Constrained Matchings and Generalizations

    NARCIS (Netherlands)

    S. Canzar (Stefan); K. Elbassioni; G.W. Klau (Gunnar); J. Mestre

    2011-01-01

    htmlabstractWe consider the following \\textsc{Tree-Constrained Bipartite Matching} problem: Given two rooted trees $T_1=(V_1,E_1)$, $T_2=(V_2,E_2)$ and a weight function $w: V_1\\times V_2 \\mapsto \\mathbb{R}_+$, find a maximum weight matching $\\mathcal{M}$ between nodes of the two trees, such that

  10. Fingerprint Matching Using Minutiae Quadruplets | Iloanusi ...

    African Journals Online (AJOL)

    Fingerprint matching faces several challenges resulting from the varying quality of fingerprint scanners, the weakness of some scanners in detecting fake fingerprints and the poor performance of fingerprint matching algorithms caused by the high intraclass variations between fingerprints of the same subject. The major ...

  11. Determination of Transmission Line Impedance Matching Parameters

    African Journals Online (AJOL)

    The analysis of measured and computed matching parameters show that the values obtained are within the acceptable standard threshold values of Voltage Standing Wave Ratio ≤1.50 and Return loss ≥ +14dB used by telecommunication transmission designers worldwide. Keywords: Impedance matching, voltage ...

  12. Monkeys Match and Tally Quantities across Senses

    Science.gov (United States)

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

    2008-01-01

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

  13. Local Stereo Matching Using Adaptive Local Segmentation

    NARCIS (Netherlands)

    Damjanovic, S.; van der Heijden, Ferdinand; Spreeuwers, Lieuwe Jan

    We propose a new dense local stereo matching framework for gray-level images based on an adaptive local segmentation using a dynamic threshold. We define a new validity domain of the fronto-parallel assumption based on the local intensity variations in the 4-neighborhood of the matching pixel. The

  14. On solution concepts for matching games

    NARCIS (Netherlands)

    Biro, Peter; Kern, Walter; Paulusma, Daniël; Kratochvil, J.; Li, A.; Fiala, J.; Kolman, P.

    A matching game is a cooperative game $(N,v)$ defined on a graph $G = (N,E)$ with an edge weighting $\\omega : E \\to {\\Bbb R}_+$ . The player set is $N$ and the value of a coalition $S \\subseteq  N$ is defined as the maximum weight of a matching in the subgraph induced by $S$. First we present an

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

  16. Semantic Data Matching: Principles and Performance

    Science.gov (United States)

    Deaton, Russell; Doan, Thao; Schweiger, Tom

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

  17. Context-dependent logo matching and recognition.

    Science.gov (United States)

    Sahbi, Hichem; Ballan, Lamberto; Serra, Giuseppe; Del Bimbo, Alberto

    2013-03-01

    We contribute, through this paper, to the design of a novel variational framework able to match and recognize multiple instances of multiple reference logos in image archives. Reference logos and test images are seen as constellations of local features (interest points, regions, etc.) and matched by minimizing an energy function mixing: 1) a fidelity term that measures the quality of feature matching, 2) a neighborhood criterion that captures feature co-occurrence/geometry, and 3) a regularization term that controls the smoothness of the matching solution. We also introduce a detection/recognition procedure and study its theoretical consistency. Finally, we show the validity of our method through extensive experiments on the challenging MICC-Logos dataset. Our method overtakes, by 20%, baseline as well as state-of-the-art matching/recognition procedures.

  18. Fiber cavities with integrated mode matching optics.

    Science.gov (United States)

    Gulati, Gurpreet Kaur; Takahashi, Hiroki; Podoliak, Nina; Horak, Peter; Keller, Matthias

    2017-07-17

    In fiber based Fabry-Pérot Cavities (FFPCs), limited spatial mode matching between the cavity mode and input/output modes has been the main hindrance for many applications. We have demonstrated a versatile mode matching method for FFPCs. Our novel design employs an assembly of a graded-index and large core multimode fiber directly spliced to a single mode fiber. This all-fiber assembly transforms the propagating mode of the single mode fiber to match with the mode of a FFPC. As a result, we have measured a mode matching of 90% for a cavity length of ~400 μm. This is a significant improvement compared to conventional FFPCs coupled with just a single mode fiber, especially at long cavity lengths. Adjusting the parameters of the assembly, the fundamental cavity mode can be matched with the mode of almost any single mode fiber, making this approach highly versatile and integrable.

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

    CSIR Research Space (South Africa)

    Mlambo, CS

    2016-12-01

    Full Text Available The fingerprint matching on the smart card has long been developed and recognized faster method than fingerprint matching on a computer or large capacity systems. There has been much research and activities concerned with improving the accuracy...

  20. Map Matching and Real World Integrated Sensor Data Warehousing (Presentation)

    Energy Technology Data Exchange (ETDEWEB)

    Burton, E.

    2014-02-01

    The inclusion of interlinked temporal and spatial elements within integrated sensor data enables a tremendous degree of flexibility when analyzing multi-component datasets. The presentation illustrates how to warehouse, process, and analyze high-resolution integrated sensor datasets to support complex system analysis at the entity and system levels. The example cases presented utilizes in-vehicle sensor system data to assess vehicle performance, while integrating a map matching algorithm to link vehicle data to roads to demonstrate the enhanced analysis possible via interlinking data elements. Furthermore, in addition to the flexibility provided, the examples presented illustrate concepts of maintaining proprietary operational information (Fleet DNA) and privacy of study participants (Transportation Secure Data Center) while producing widely distributed data products. Should real-time operational data be logged at high resolution across multiple infrastructure types, map matched to their associated infrastructure, and distributed employing a similar approach; dependencies between urban environment infrastructures components could be better understood. This understanding is especially crucial for the cities of the future where transportation will rely more on grid infrastructure to support its energy demands.

  1. PSOM2—partitioning-based scalable ontology matching using ...

    Indian Academy of Sciences (India)

    B Sathiya

    2017-11-16

    -based systems to reduce the matching space. ... reduction in execution time, leading to an effective and scalable ontology matching system. Keywords. ... ontology matching results, collaborative and social ontol- ogy matching ...

  2. Introduction: The Power of Example

    DEFF Research Database (Denmark)

    Højer, Lars; Bandak, Andreas

    2015-01-01

    It is the contention of this introduction that examples are important prisms through which both reality and anthropological analysis are thought and, equally importantly, reconfigured. The aim of the introduction is to redress the theoretical disregard for exemplification by exploring the persuas......It is the contention of this introduction that examples are important prisms through which both reality and anthropological analysis are thought and, equally importantly, reconfigured. The aim of the introduction is to redress the theoretical disregard for exemplification by exploring...... the persuasive and evocative power – positive and negative – of ‘examples’ in social and academic life while also proposing exemplification as a distinct anthropological way of theorizing. Such theorizing points to a ‘lateral’ rethinking of the relation between the particular and the general. Our central...

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

  4. 26 CFR 1.826-7 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 8 2010-04-01 2010-04-01 false Examples. 1.826-7 Section 1.826-7 Internal....826-7 Examples. The application of section 826 may be illustrated by the following examples: Example 1... percent of 8 exceeds 25 percent of 0), may remain in such account beyond the taxable year 1968. Example 2...

  5. 26 CFR 301.9000-6 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 18 2010-04-01 2010-04-01 false Examples. 301.9000-6 Section 301.9000-6... Examples. The following examples illustrate the provisions of §§ 301.9000-1 through 301.9000-5: Example 1... commitment of resources to comply with the subpoena inappropriate. Example 2. In a state judicial proceeding...

  6. 12 CFR 222.2 - Examples.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 3 2010-01-01 2010-01-01 false Examples. 222.2 Section 222.2 Banks and Banking... (REGULATION V) General Provisions § 222.2 Examples. The examples in this part are not exclusive. Compliance with an example, to the extent applicable, constitutes compliance with this part. Examples in a...

  7. 12 CFR 334.2 - Examples.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 4 2010-01-01 2010-01-01 false Examples. 334.2 Section 334.2 Banks and Banking... General Provisions § 334.2 Examples. The examples in this part are not exclusive. Compliance with an example, to the extent applicable, constitutes compliance with this part. Examples in a paragraph...

  8. 26 CFR 801.7 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 20 2010-04-01 2010-04-01 false Examples. 801.7 Section 801.7 Internal Revenue... Examples. (a) The rules of § 801.3 are illustrated by the following examples: Example 1. (i) Each year... permissible because case closures are a quantity measure. Case closures are an example of outcome-neutral...

  9. 12 CFR 571.2 - Examples.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 5 2010-01-01 2010-01-01 false Examples. 571.2 Section 571.2 Banks and Banking... Examples. The examples in this part are not exclusive. Compliance with an example, to the extent applicable, constitutes compliance with this part. Examples in a paragraph illustrate only the issue described in the...

  10. 22 CFR 96.15 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Examples. 96.15 Section 96.15 Foreign Relations... Services § 96.15 Examples. The following examples illustrate the rules of §§ 96.12 to 96.14: Example 1... the adoption. Example 2. Child welfare services exemption. Doctor X evaluates the medical records and...

  11. 12 CFR 717.2 - Examples.

    Science.gov (United States)

    2010-01-01

    ... 12 Banks and Banking 6 2010-01-01 2010-01-01 false Examples. 717.2 Section 717.2 Banks and Banking... Provisions § 717.2 Examples. The examples in this part are not exclusive. Compliance with an example, to the extent applicable, constitutes compliance with this part. Examples in a paragraph illustrate only the...

  12. MR angiography with a matched filter

    International Nuclear Information System (INIS)

    De Castro, J.B.; Riederer, S.J.; Lee, J.N.

    1987-01-01

    The technique of matched filtering was applied to a series of cine MR images. The filter was devised to yield a subtraction angiographic image in which direct current components present in the cine series are removed and the signal-to-noise ratio (S/N) of the vascular structures is optimized. The S/N of a matched filter was compared with that of a simple subtraction, in which an image with high flow is subtracted from one with low flow. Experimentally, a range of results from minimal improvement to significant (60%) improvement in S/N was seen in the comparisons of matched filtered subtraction with simple subtraction

  13. Nonlinear soliton matching between optical fibers

    DEFF Research Database (Denmark)

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

    2011-01-01

    In this Letter, we propose a generic nonlinear coupling coefficient, η2 NL ¼ ηjγ=β2jfiber2=jγ=β2jfiber1, which gives a quantitative measure for the efficiency of nonlinear matching of optical fibers by describing how a fundamental soliton couples from one fiber into another. Specifically, we use η......NL to demonstrate a significant soliton selffrequency shift of a fundamental soliton, and we show that nonlinear matching can take precedence over linear mode matching. The nonlinear coupling coefficient depends on both the dispersion (β2) and nonlinearity (γ), as well as on the power coupling efficiency η. Being...

  14. 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. Copyright © 2015 by the American Society of Nephrology.

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

    Science.gov (United States)

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

    2015-05-01

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

  16. Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences

    Directory of Open Access Journals (Sweden)

    Maria Silvia Pini

    2013-11-01

    Full Text Available The stable matching problem (also known as the stable marriage problem is a well-known problem of matching men to women, so that no man and woman, who are not married to each other, both prefer each other. Such a 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 stable marriage problem, both men and women express a strict preference order over the members of the other sex, in a qualitative way. Here, we consider stable marriage problems with weighted preferences: each man (resp., woman provides a score for each woman (resp., man. Such problems are more expressive than the classical stable marriage problems. Moreover, in some real-life situations, it is more natural to express scores (to model, for example, profits or costs rather than a qualitative preference ordering. In this context, we define new notions of stability and optimality, and we provide algorithms to find marriages that are stable and/or optimal according to these notions. While expressivity greatly increases by adopting weighted preferences, we show that, in most cases, the desired solutions can be found by adapting existing algorithms for the classical stable marriage problem. We also consider the manipulability properties of the procedures that return such stable marriages. While we know that all procedures are manipulable by modifying the preference lists or by truncating them, here, we consider if manipulation can occur also by just modifying the weights while preserving the ordering and avoiding truncation. It turns out that, by adding weights, in some cases, we may increase the possibility of manipulating, and this cannot be avoided by any reasonable restriction on the weights.

  17. Advancements in automatic marking with range pattern matching

    Science.gov (United States)

    Salazar, D.; Valadez, J.

    2013-06-01

    In previous work, an approach was detailed using CATS-MRCC-RPM, where new pattern matching functionality is used to find locations on a jobdeck that are suitable for mark placements and ultimately, metrology tool measurement locations. These locations are found by first creating pattern definitions. The defined patterns are passed to the CATS MRCC-RPM match algorithm which in turn outputs all found locations that match the description. In that previous work, the pattern definitions, also known as mark templates, had several limitations. For example, each template could hold only one mark placed at its center, and had to be symmetrical. This was considered to be severely limiting in nature and not production worthy for advanced mask manufacturing. This paper builds on top of the previous one in various ways, extends the possibilities, and provides mask makers unlimited options for extending metrology automation. Mark templates are expanded upon to hold multiple marks at different offsets from its center, and even of different types. Each template can be symmetrical or asymmetrical, and yet all the marks on it can still be correctly placed by taking advantage of match orientation information during the Classification step. Placement of other mark types beyond basic ones is also explored, such as Arbitrary Area. Lastly, the classification step is an enhancement process that thoroughly manages the use of chip/mark information. The result makes use of the output of JD MRC (jobdeck MRC) which executes RPM on jobdecks by chip in order to reduce redundant chips processing, rather than search all chip placements by extension.

  18. Matching modes between HIRFL and CSR

    International Nuclear Information System (INIS)

    Tang, J.Y.; Li, H.H.; Yuan, Y.J.

    2001-01-01

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

  19. Shape-matching soft mechanical metamaterials

    NARCIS (Netherlands)

    Mirzaali Mazandarani, M.; Janbaz, S.; Strano, M.; Vergani, L.; Zadpoor, A.A.

    2018-01-01

    Architectured materials with rationally designed geometries could be used to create mechanical metamaterials with unprecedented or rare properties and functionalities. Here, we introduce "shape-matching" metamaterials where the geometry of cellular structures comprising auxetic and conventional

  20. Mobile Application for Pesticide Label Matching

    Science.gov (United States)

    The label matching application will give inspectors the ability to instantly compare pesticide product labels against state and federal label databases via their cell phone, tablet or other mobile device.

  1. Matched Spectral Filter Imager, Phase I

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

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

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

  4. Random Matching Models and Money : The Global Structure and Approximation of Stationary Equilibria

    NARCIS (Netherlands)

    Kamiya, K.; Talman, A.J.J.

    2003-01-01

    Random matching models with different states are an important class of dynamic games; for example, money search models, job search models, and some games in biology are special cases.In this paper, we investigate the basic structure of the models: the existence of equilibria, the global structure of

  5. On the matched pairs sign test using bivariate ranked set sampling ...

    African Journals Online (AJOL)

    Administrator

    2008-01-15

    Jan 15, 2008 ... control confounding in the design stage of a study, matching is a strategy that must include elements of both design and analysis”. (Hennekens and Buring 1987). For example, a two-year .... used the RSS sampling method to improve parametric and non- parametric statistical inference. For non-parametric ...

  6. Dataset Curation through Renders and Ontology Matching

    Science.gov (United States)

    2015-09-01

    Dataset Curation through Renders and Ontology Matching Yair Movshovitz-Attias CMU-CS-15-119 September 2015 School of Computer Science Computer...REPORT TYPE 3. DATES COVERED 00-00-2015 to 00-00-2015 4. TITLE AND SUBTITLE Dataset Curation through Renders and Ontology Matching 5a...mapped to an ontology of geographical entities, we are able to extract multiple relevant labels per image. For the viewpoint estimation problem, by

  7. Technological progress and average job matching quality

    OpenAIRE

    Centeno, Mário; Corrêa, Márcio V.

    2009-01-01

    Our objective is to study, in a labor market characterized by search frictions, the effect of technological progress on the average quality of job matches. For that, we use an extension of Mortensen and Pissarides (1998) and obtain as results that the effects of technological progress on the labor market depend upon the initial conditions of the economy. If the economy is totally characterized by the presence of low-quality job matches, an increase in technological progress is accompanied by ...

  8. INFORMATION SYSTEMS AUDIT CURRICULA CONTENT MATCHING

    OpenAIRE

    Vasile-Daniel CARDOȘ; Ildikó Réka CARDOȘ

    2014-01-01

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

  9. Rebate subsidies, matching subsidies and isolation effects

    Directory of Open Access Journals (Sweden)

    Douglas D. Davis

    2006-07-01

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

  10. Application examples of EFPACS series

    International Nuclear Information System (INIS)

    Tsuchiya, Yasunori; Aoki, Makoto; Yamahata, Noboru

    1989-01-01

    This paper introduces some application examples of picture archiving and communications system EFPACS series which achieves efficient management of a volume of image data generated in a hospital, and powerfully support image diagnosis using multi-modality. EFPACS can be applied to various objectives of system installation, and can meet the scale of a hospital and the way of image filing. EFPACS has been installed in a middle-scale hospital for image conference, in a general hospital for long-term archiving of MRI data and for referring in the outpatient clinic, in a dental hospital for dental image processing, and so on. (author)

  11. Projector Method: theory and examples

    International Nuclear Information System (INIS)

    Dahl, E.D.

    1985-01-01

    The Projector Method technique for numerically analyzing lattice gauge theories was developed to take advantage of certain simplifying features of gauge theory models. Starting from a very general notion of what the Projector Method is, the techniques are applied to several model problems. After these examples have traced the development of the actual algorithm from the general principles of the Projector Method, a direct comparison between the Projector and the Euclidean Monte Carlo is made, followed by a discussion of the application to Periodic Quantum Electrodynamics in two and three spatial dimensions. Some methods for improving the efficiency of the Projector in various circumstances are outlined. 10 refs., 7 figs

  12. Fast algorithms for approximate circular string matching.

    Science.gov (United States)

    Barton, Carl; Iliopoulos, Costas S; Pissis, Solon P

    2014-03-22

    Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optimal average-case algorithms for exact circular string matching. Approximate circular string matching is a rather undeveloped area. In this article, we present a suboptimal average-case algorithm for exact circular string matching requiring time O(n). Based on our solution for the exact case, we present two fast average-case algorithms for approximate circular string matching with k-mismatches, under the Hamming distance model, requiring time O(n) for moderate values of k, that is k=O(m/logm). We show how the same results can be easily obtained under the edit distance model. The presented algorithms are also implemented as library functions. Experimental results demonstrate that the functions provided in this library accelerate the computations by more than three orders of magnitude compared to a naïve approach. We present two fast average-case algorithms for approximate circular string matching with k-mismatches; and show that they also perform very well in practice. The importance of our contribution is underlined by the fact that the provided functions may be seamlessly integrated into any biological pipeline. The source code of the library is freely available at http://www.inf.kcl.ac.uk/research/projects/asmf/.

  13. Efficient Aho-Corasick String Matching on Emerging Multicore Architectures

    Energy Technology Data Exchange (ETDEWEB)

    Tumeo, Antonino; Villa, Oreste; Secchi, Simone; Chavarría-Miranda, Daniel

    2013-12-12

    String matching algorithms are critical to several scientific fields. Beside text processing and databases, emerging applications such as DNA protein sequence analysis, data mining, information security software, antivirus, ma- chine learning, all exploit string matching algorithms [3]. All these applica- tions usually process large quantity of textual data, require high performance and/or predictable execution times. Among all the string matching algorithms, one of the most studied, especially for text processing and security applica- tions, is the Aho-Corasick algorithm. 1 2 Book title goes here Aho-Corasick is an exact, multi-pattern string matching algorithm which performs the search in a time linearly proportional to the length of the input text independently from pattern set size. However, depending on the imple- mentation, when the number of patterns increase, the memory occupation may raise drastically. In turn, this can lead to significant variability in the performance, due to the memory access times and the caching effects. This is a significant concern for many mission critical applications and modern high performance architectures. For example, security applications such as Network Intrusion Detection Systems (NIDS), must be able to scan network traffic against very large dictionaries in real time. Modern Ethernet links reach up to 10 Gbps, and malicious threats are already well over 1 million, and expo- nentially growing [28]. When performing the search, a NIDS should not slow down the network, or let network packets pass unchecked. Nevertheless, on the current state-of-the-art cache based processors, there may be a large per- formance variability when dealing with big dictionaries and inputs that have different frequencies of matching patterns. In particular, when few patterns are matched and they are all in the cache, the procedure is fast. Instead, when they are not in the cache, often because many patterns are matched and the caches are

  14. Selective suppression of high-order harmonics within phase-matched spectral regions.

    Science.gov (United States)

    Lerner, Gavriel; Diskin, Tzvi; Neufeld, Ofer; Kfir, Ofer; Cohen, Oren

    2017-04-01

    Phase matching in high-harmonic generation leads to enhancement of multiple harmonics. It is sometimes desired to control the spectral structure within the phase-matched spectral region. We propose a scheme for selective suppression of high-order harmonics within the phase-matched spectral region while weakly influencing the other harmonics. The method is based on addition of phase-mismatched segments within a phase-matched medium. We demonstrate the method numerically in two examples. First, we show that one phase-mismatched segment can significantly suppress harmonic orders 9, 15, and 21. Second, we show that two phase-mismatched segments can efficiently suppress circularly polarized harmonics with one helicity over the other when driven by a bi-circular field. The new method may be useful for various applications, including the generation of highly helical bright attosecond pulses.

  15. Privacy-preserving matching of similar patients.

    Science.gov (United States)

    Vatsalan, Dinusha; Christen, Peter

    2016-02-01

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

  16. The geometry of generalized force matching and related information metrics in coarse-graining of molecular systems

    International Nuclear Information System (INIS)

    Kalligiannaki, Evangelia; Harmandaris, Vagelis; Katsoulakis, Markos A.; Plecháč, Petr

    2015-01-01

    Using the probabilistic language of conditional expectations, we reformulate the force matching method for coarse-graining of molecular systems as a projection onto spaces of coarse observables. A practical outcome of this probabilistic description is the link of the force matching method with thermodynamic integration. This connection provides a way to systematically construct a local mean force and to optimally approximate the potential of mean force through force matching. We introduce a generalized force matching condition for the local mean force in the sense that allows the approximation of the potential of mean force under both linear and non-linear coarse graining mappings (e.g., reaction coordinates, end-to-end length of chains). Furthermore, we study the equivalence of force matching with relative entropy minimization which we derive for general non-linear coarse graining maps. We present in detail the generalized force matching condition through applications to specific examples in molecular systems

  17. The geometry of generalized force matching and related information metrics in coarse-graining of molecular systems

    Energy Technology Data Exchange (ETDEWEB)

    Kalligiannaki, Evangelia, E-mail: ekalligian@tem.uoc.gr [Department of Mathematics and Applied Mathematics, University of Crete, 70013 Heraklion (Greece); Harmandaris, Vagelis, E-mail: harman@uoc.gr [Department of Mathematics and Applied Mathematics, University of Crete, 70013 Heraklion (Greece); Institute of Applied and Computational Mathematics (IACM), Foundation for Research and Technology Hellas (FORTH), IACM/FORTH, GR-71110 Heraklion (Greece); Katsoulakis, Markos A., E-mail: markos@math.umass.edu [Department of Mathematics and Statistics, University of Massachusetts, Amherst, Massachusetts 01003 (United States); Plecháč, Petr, E-mail: plechac@math.udel.edu [Department of Mathematical Sciences, University of Delaware, Newark, Delaware 19716 (United States)

    2015-08-28

    Using the probabilistic language of conditional expectations, we reformulate the force matching method for coarse-graining of molecular systems as a projection onto spaces of coarse observables. A practical outcome of this probabilistic description is the link of the force matching method with thermodynamic integration. This connection provides a way to systematically construct a local mean force and to optimally approximate the potential of mean force through force matching. We introduce a generalized force matching condition for the local mean force in the sense that allows the approximation of the potential of mean force under both linear and non-linear coarse graining mappings (e.g., reaction coordinates, end-to-end length of chains). Furthermore, we study the equivalence of force matching with relative entropy minimization which we derive for general non-linear coarse graining maps. We present in detail the generalized force matching condition through applications to specific examples in molecular systems.

  18. The geometry of generalized force matching and related information metrics in coarse-graining of molecular systems.

    Science.gov (United States)

    Kalligiannaki, Evangelia; Harmandaris, Vagelis; Katsoulakis, Markos A; Plecháč, Petr

    2015-08-28

    Using the probabilistic language of conditional expectations, we reformulate the force matching method for coarse-graining of molecular systems as a projection onto spaces of coarse observables. A practical outcome of this probabilistic description is the link of the force matching method with thermodynamic integration. This connection provides a way to systematically construct a local mean force and to optimally approximate the potential of mean force through force matching. We introduce a generalized force matching condition for the local mean force in the sense that allows the approximation of the potential of mean force under both linear and non-linear coarse graining mappings (e.g., reaction coordinates, end-to-end length of chains). Furthermore, we study the equivalence of force matching with relative entropy minimization which we derive for general non-linear coarse graining maps. We present in detail the generalized force matching condition through applications to specific examples in molecular systems.

  19. Statics learning from engineering examples

    CERN Document Server

    Emri, Igor

    2016-01-01

    This textbook introduces and explains the basic concepts on which statics is based utilizing real engineering examples. The authors emphasize the learning process by showing a real problem, analyzing it, simplifying it, and developing a way to solve it. This feature teaches students intuitive thinking in solving real engineering problems using the fundamentals of Newton’s laws. This book also: · Stresses representation of physical reality in ways that allow students to solve problems and obtain meaningful results · Emphasizes identification of important features of the structure that should be included in a model and which features may be omitted · Facilitates students' understanding and mastery of the "flow of thinking" practiced by professional engineers.

  20. 16 CFR 680.2 - Examples.

    Science.gov (United States)

    2010-01-01

    ... 16 Commercial Practices 1 2010-01-01 2010-01-01 false Examples. 680.2 Section 680.2 Commercial Practices FEDERAL TRADE COMMISSION THE FAIR CREDIT REPORTING ACT AFFILIATE MARKETING § 680.2 Examples. The examples in this part are not exclusive. Compliance with an example, to the extent applicable, constitutes...

  1. 42 CFR 408.26 - Examples.

    Science.gov (United States)

    2010-10-01

    ... 42 Public Health 2 2010-10-01 2010-10-01 false Examples. 408.26 Section 408.26 Public Health... PREMIUMS FOR SUPPLEMENTARY MEDICAL INSURANCE Amount of Monthly Premiums § 408.26 Examples. Example 1. Mr. J... 10 percent greater than if he had enrolled in his initial enrollment period. Example 2. Mr. V, who...

  2. 10 CFR 1706.9 - Examples.

    Science.gov (United States)

    2010-01-01

    ... 10 Energy 4 2010-01-01 2010-01-01 false Examples. 1706.9 Section 1706.9 Energy DEFENSE NUCLEAR FACILITIES SAFETY BOARD ORGANIZATIONAL AND CONSULTANT CONFLICTS OF INTERESTS § 1706.9 Examples. The examples in this section illustrate situations in which questions concerning OCIs may arise. The examples are...

  3. 45 CFR 1151.18 - Illustrative examples.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 3 2010-10-01 2010-10-01 false Illustrative examples. 1151.18 Section 1151.18... Prohibited General § 1151.18 Illustrative examples. (a) The following examples will illustrate the... and offering, for example, a specific event in an inaccessible facility may arrange to provide a...

  4. 78 FR 46851 - Controlled Group Regulation Examples

    Science.gov (United States)

    2013-08-02

    ... Controlled Group Regulation Examples AGENCY: Internal Revenue Service (IRS), Treasury. ACTION: Notice of proposed rulemaking and notice of public hearing. SUMMARY: This document proposes revisions to examples... include a series of examples, two of which reproduce, nearly verbatim, examples contained in the 1942...

  5. 48 CFR 9.508 - Examples.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Examples. 9.508 Section 9... CONTRACTOR QUALIFICATIONS Organizational and Consultant Conflicts of Interest 9.508 Examples. The examples in... (e.g., fire control, navigation, etc.). In this example, the system is the powerplant, not the...

  6. 17 CFR 248.102 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 17 Commodity and Securities Exchanges 3 2010-04-01 2010-04-01 false Examples. 248.102 Section 248... AND S-AM Regulation S-AM: Limitations on Affiliate Marketing § 248.102 Examples. The examples in this subpart are not exclusive. The examples in this subpart provide guidance concerning the rules' application...

  7. 29 CFR 4022.95 - Examples.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Examples. 4022.95 Section 4022.95 Labor Regulations... IN TERMINATED SINGLE-EMPLOYER PLANS Certain Payments Owed Upon Death § 4022.95 Examples. The following examples show how the rules in §§ 4022.91 through 4022.94 apply. For examples on how these rules...

  8. 29 CFR 4022.104 - Examples.

    Science.gov (United States)

    2010-07-01

    ... 29 Labor 9 2010-07-01 2010-07-01 false Examples. 4022.104 Section 4022.104 Labor Regulations... Future Periods After Death § 4022.104 Examples. The following examples show how the rules in §§ 4022.101.... (1) Example 1: where surviving beneficiary predeceases participant. Ellen died before Charlie. As...

  9. 12 CFR 41.2 - Examples.

    Science.gov (United States)

    2010-01-01

    ... COMPTROLLER OF THE CURRENCY, DEPARTMENT OF THE TREASURY FAIR CREDIT REPORTING General Provisions § 41.2 Examples. The examples in this part are not exclusive. Compliance with an example, to the extent applicable, constitutes compliance with this part. Examples in a paragraph illustrate only the issue described in the...

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

  11. A robust line extraction and matching algorithm

    Science.gov (United States)

    Hussien, B.; Sridhar, B.

    1993-01-01

    This paper presents an algorithm for extracting straight lines from intensity mages and describes a line matching algorithm for solving the line correspondence problem. The line extraction process begins by detecting edges in the intensity image. Next, line support regions are formed where image points (pixels) have similar gradient orientation. A line fitting algorithm is then used to fit a line to the points in the line support region based on a least means square fitting algorithm. Finally, line segments are linked together to form the final lines by using an adaptive line linking method; this results in much stronger lines and a smaller set of lines to be considered. Once the lines are detected in a sequence of images, a line matching algorithm is used to match lines in one image to the lines in the other image. The images are either from a motion or stereo sequence. The matched lines may then be used with the sensor position and orientation data to estimate range to objects corresponding to the lines. We present results based on applying the line extraction and line matching algorithms to a synthetic image and an outdoor scene captured by a camera on a helicopter.

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

  13. Match Analysis in Volleyball: a systematic review

    Directory of Open Access Journals (Sweden)

    Miguel Silva

    2016-03-01

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

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

    Directory of Open Access Journals (Sweden)

    Michael Bailey

    2006-12-01

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

  15. Evaluating OO example programs for CS1

    DEFF Research Database (Denmark)

    Börstler, Jürgen; Christensen, Henrik Bærbak; Bennedsen, Jens

    2008-01-01

    Example programs play an important role in learning to program. They work as templates, guidelines, and inspiration for learners when developing their own programs. It is therefore important to provide learners with high quality examples. In this paper, we discuss properties of example programs...... that might affect the teaching and learning of object-oriented programming. Furthermore, we present an evaluation instrument for example programs and report on initial experiences of its application to a selection of examples from popular introductory programming textbooks....

  16. [Establishment of beta block matching technique].

    Science.gov (United States)

    Zhu, Fa-Ming; Lü, Qin-Feng; Zhang, Wei; Zhang, Hai-Qin; Fu, Qi-Hua; Yan, Li-Xing

    2005-10-01

    The purpose of this study was to establish beta block matching technique. DNA was extracted from whole blood by salting-out method, beta block matching was performed by PCR and GeneScan technique. The results showed that the length of fragments amplificated in 100 samples was different and the range of them was 91-197 bp. Amplification fragments could be divided into four regions: 91-93, 105-113, 125-139 and 177-197 bp respectively. 91 bp DNA fragments could be found in all of samples. The numbers of DNA fragments with different length have been shown high polymorphism and they focused on the range of seven to twenty four. In conclusion, the beta block matching technique is reliable and applicable to the selection of hematopoietic stem cell transplantation donors.

  17. Shape-matching soft mechanical metamaterials.

    Science.gov (United States)

    Mirzaali, M J; Janbaz, S; Strano, M; Vergani, L; Zadpoor, A A

    2018-01-17

    Architectured materials with rationally designed geometries could be used to create mechanical metamaterials with unprecedented or rare properties and functionalities. Here, we introduce "shape-matching" metamaterials where the geometry of cellular structures comprising auxetic and conventional unit cells is designed so as to achieve a pre-defined shape upon deformation. We used computational models to forward-map the space of planar shapes to the space of geometrical designs. The validity of the underlying computational models was first demonstrated by comparing their predictions with experimental observations on specimens fabricated with indirect additive manufacturing. The forward-maps were then used to devise the geometry of cellular structures that approximate the arbitrary shapes described by random Fourier's series. Finally, we show that the presented metamaterials could match the contours of three real objects including a scapula model, a pumpkin, and a Delft Blue pottery piece. Shape-matching materials have potential applications in soft robotics and wearable (medical) devices.

  18. Matching to Openly Innovate with Suppliers

    DEFF Research Database (Denmark)

    Laursen, Linda Nhu

    2017-01-01

    heterogeneous suppliers with the internal organisation in order to openly innovate. More specifically, it focuses on a governance mode, recently emerged in practice, by which firms summon their suppliers and their own internal organisation at an event to match them for open innovation activities – innovation......When large firms choose to involve their many suppliers in open innovation, they are faced with a set of challenges pertaining to the governance of several suppliers. Suppliers are heterogeneous, offering heterogeneous materials, products, information, services, and knowledge, which are differently...... organized across functions and hierarchies. To make use of such heterogeneous resources, a critical challenge for open innovation is to pair a supplier resource with a suitable opportunity-for-use from within the firm – a challenge of matching. This dissertation addresses the challenge of matching...

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

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

  1. Matching in the Pi-Calculus

    Directory of Open Access Journals (Sweden)

    Kirstin Peters

    2014-08-01

    Full Text Available We study whether, in the pi-calculus, the match prefix—a conditional operator testing two names for (syntactic equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables. Later on, Gorla developed a by now widely-tested set of criteria for encodings that allows much more freedom (e.g. instead of direct translations of observables it allows comparison of calculi with respect to reachability of successful states. In this paper, we offer a considerably stronger separation result on the non-expressibility of matching using only Gorla's relaxed requirements.

  2. Performance Evaluation of Tree Object Matching

    DEFF Research Database (Denmark)

    Somchaipeng, Kerawit; Sporring, Jon; Kreiborg, Sven

    2005-01-01

    of the algorithm is presented: an exact and an approximation. Several experiments are conducted to empirically evaluate the MSST matching algorithm under image distortions. Further, the performance of the MSST matching algorithm is measured on three databases: the ORL face database, magazine covers, and the COIL......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 versions...... database. Finally the performance is compared with algorithms based on the Scale Invariant Feature Transform (SIFT), and the Position of Catastrophes (CAT)....

  3. Surface Area Distribution Descriptor for object matching

    Directory of Open Access Journals (Sweden)

    Mohamed F. Gafar

    2010-07-01

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

  4. Transverse Matching Techniques for the SNS Linac

    CERN Document Server

    Jeon Dong Oh; Danilov, Viatcheslav V

    2005-01-01

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

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

  6. Techniques Used in String Matching for Network Security

    OpenAIRE

    Jamuna Bhandari

    2014-01-01

    String matching also known as pattern matching is one of primary concept for network security. In this area the effectiveness and efficiency of string matching algorithms is important for applications in network security such as network intrusion detection, virus detection, signature matching and web content filtering system. This paper presents brief review on some of string matching techniques used for network security.

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

    Science.gov (United States)

    2011-01-28

    ... which we will compare our current employee records of the Federal Personnel/Payroll System with the... computerized comparison of records. We will use this information to verify self-certification statements of... Matching Program We will compare identifying information from The Payroll, Leave and Attendance Records (60...

  8. A Matched Filter For Communicating With Chaos

    Science.gov (United States)

    Corron, Ned J.; Blakely, Jonathan N.

    2011-04-01

    In conventional communication systems, a matched filter provides optimal receiver performance in the presence of noise. As such, matched filters are highly desirable, yet they are practical only when a relatively small number of known basis functions are used to represent information. For communications using chaotic waveforms, the unpredictable and nonrepeating nature of chaos suggests the basis functions are uncertain and ever changing, which would preclude the use of a simple matched filter. Consequently, it is widely accepted that the performance of chaos communications lags that of conventional, no chaotic systems. In this paper, we show this assumption is not necessarily true. We describe a simple, low-dimensional chaotic oscillator that admits an exact analytic solution containing a single fixed basis function. The solution is written as the linear convolution of a symbol sequence and the basis function, similar to how conventional communications waveforms are usually represented. Despite the linear nature of the solution, waveform returns sampled at regular switching times are conjugate to a shift map, proving the oscillator is chaotic. A matched filter for the basis function is defined and used to extract symbolic information from the chaotic wave-form. Its performance in additive white Gaussian noise is comparable to that of binary phase-shift keying (BPSK). The oscillator and its matched filter have potential application in Hayes-type chaos communications where a message signal is encoded in the symbolic dynamics via small perturbation control. The discovery of a practical matched filter for chaos finally provides a coherent receiver to complement this elegant encoding scheme.

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

  10. Load Matching and Grid Interaction of Net Zero Energy Buildings

    DEFF Research Database (Denmark)

    Voss, Karsten; Sartori, Igor; Napolitano, Assunta

    2010-01-01

    “Net Zero Energy Building” has become a prominent wording to describe the synergy of energy efficient building and renewable energy utilization to reach a balanced energy budget over a yearly cycle. Taking into account the energy exchange with a grid infrastructure overcomes the limitations...... of seasonal energy storage on-site. Even though the wording “Net Zero Energy Building” focuses on the annual energy balance, large differences may occur between solution sets in the amount of grid interaction needed to reach the goal. The paper reports on the analysis of example buildings concerning the load...... matching and grid interaction. Indices to describe both issues are proposed and foreseen as part of a harmonized definition framework. The work is part of subtask A of the IEA SHCP Task40/ECBCS Annex 52: “Towards Net Zero Energy Solar Buildings”....

  11. Matching Parasitic Antenna for Single RF MIMO

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  12. Faster and Simpler Approximation of Stable Matchings

    Directory of Open Access Journals (Sweden)

    Katarzyna Paluch

    2014-04-01

    Full Text Available We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m time, where n denotes the number of people andm is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.

  13. History Matching: Towards Geologically Reasonable Models

    DEFF Research Database (Denmark)

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

    that measures similarity between statistics of a training image and statistics of any smooth model is introduced and its analytical gradient is computed. This allows us to apply any gradientbased method to history matching problem and guide a solution until it satisfies both production data and complexity......This work focuses on the development of a new method for history matching problem that through a deterministic search finds a geologically feasible solution. Complex geology is taken into account evaluating multiple point statistics from earth model prototypes - training images. Further a function...

  14. Adiabatic matching section for plasma accelerated beams

    Directory of Open Access Journals (Sweden)

    Klaus Floettmann

    2014-05-01

    Full Text Available An adiabatic matching section is discussed as option to control the divergence and emittance growth of a beam exiting a plasma channel. Based on a general analytical solution of a focusing channel with varying focusing strength, a focusing profile is proposed which allows for a fast expansion of the beam size while keeping the emittance growth minimal. The solution is also applicable to other cases, e.g., the matching of a positron source to the downstream accelerating section, which are, however, not discussed in this contribution.

  15. Egg size matching by an intraspecific brood parasite

    Science.gov (United States)

    Lemons, Patrick R.; Sedinger, James S.

    2011-01-01

    Avian brood parasitism provides an ideal system with which to understand animal recognition and its affect on fitness. This phenomenon of laying eggs in the nests of other individuals has classically been framed from the perspective of interspecific brood parasitism and host recognition of parasitic eggs. Few examples exist of strategies adopted by intraspecific brood parasites to maximize success of parasitic eggs. Intraspecific brood parasitism within precocial birds can be a risky strategy in that hatch synchrony is essential to reproductive success. Given that egg size is positively correlated with incubation time, parasitic birds would benefit by recognizing and selecting hosts with a similar egg size. Intraspecific brood parasitism is an alternative reproductive strategy in black brant (Branta bernicla nigricans), a colonial nesting goose with precocial young. Based on a randomization test, parasitic eggs in this study differed less in size from eggs in their host's nests than did random eggs placed in random nests. Parasitic eggs were remarkably similar in size to hosts’ eggs, differing by parasitic brant match the egg size of hosts in our study supports our hypothesis that brant match egg size of hosts, thereby maximizing hatching success of their parasitic eggs.

  16. Using visual analytics model for pattern matching in surveillance data

    Science.gov (United States)

    Habibi, Mohammad S.

    2013-03-01

    In a persistent surveillance system huge amount of data is collected continuously and significant details are labeled for future references. In this paper a method to summarize video data as a result of identifying events based on these tagged information is explained, leading to concise description of behavior within a section of extended recordings. An efficient retrieval of various events thus becomes the foundation for determining a pattern in surveillance system observations, both in its extended and fragmented versions. The patterns consisting of spatiotemporal semantic contents are extracted and classified by application of video data mining on generated ontology, and can be matched based on analysts interest and rules set forth for decision making. The proposed extraction and classification method used in this paper uses query by example for retrieving similar events containing relevant features, and is carried out by data aggregation. Since structured data forms majority of surveillance information this Visual Analytics model employs KD-Tree approach to group patterns in variant space and time, thus making it convenient to identify and match any abnormal burst of pattern detected in a surveillance video. Several experimental video were presented to viewers to analyze independently and were compared with the results obtained in this paper to demonstrate the efficiency and effectiveness of the proposed technique.

  17. Multimodal correlation and intraoperative matching of virtual models in neurosurgery

    Science.gov (United States)

    Ceresole, Enrico; Dalsasso, Michele; Rossi, Aldo

    1994-01-01

    The multimodal correlation between different diagnostic exams, the intraoperative calibration of pointing tools and the correlation of the patient's virtual models with the patient himself, are some examples, taken from the biomedical field, of a unique problem: determine the relationship linking representation of the same object in different reference frames. Several methods have been developed in order to determine this relationship, among them, the surface matching method is one that gives the patient minimum discomfort and the errors occurring are compatible with the required precision. The surface matching method has been successfully applied to the multimodal correlation of diagnostic exams such as CT, MR, PET and SPECT. Algorithms for automatic segmentation of diagnostic images have been developed to extract the reference surfaces from the diagnostic exams, whereas the surface of the patient's skull has been monitored, in our approach, by means of a laser sensor mounted on the end effector of an industrial robot. An integrated system for virtual planning and real time execution of surgical procedures has been realized.

  18. Successive odor matching- and non-matching-to-sample in rats: A reversal design.

    Science.gov (United States)

    Bruce, Katherine; Dyer, Katherine; Mathews, Michael; Nealley, Catharine; Phasukkan, Tiffany; Prichard, Ashley; Galizio, Mark

    2017-07-13

    There is a growing body of research on matching- and non-matching-to-sample (MTS, NMTS) relations with rats using olfactory stimuli; however, the specific characteristics of this relational control are unclear. In the current study we examine MTS and NMTS in rats with an automated olfactometer using a successive (go, no-go) procedure. Ten rats were trained to either match- or non-match-to-sample with common scents (apple, cinnamon, etc.) as olfactory stimuli. After matching or non-matching training with four odorants, rats were tested for transfer twice with four new odorants on each test. Most rats trained on MTS showed immediate transfer to new stimuli, and most rats trained on NMTS showed full transfer by the second set of new odors. After meeting criterion on the second transfer test, the contingencies were reversed with four new odor stimuli such that subjects trained on matching were shifted to non-matching and vice versa. Following these reversed contingencies, the effects of the original training persisted for many trials with new odorants. These data extend previous studies on same-different concept formation in rats, showing strong generalization requiring few exemplars. The critical role of olfactory stimuli is discussed. Copyright © 2017 Elsevier B.V. All rights reserved.

  19. Do people match surface reflectance fundamentally differently than they match emitted light?

    NARCIS (Netherlands)

    Granzier, J.J.M.; Brenner, E.; Smeets, J.B.J.

    2009-01-01

    We compared matches between colours that were both presented on a computer monitor or both as pieces of paper, with matching the colour of a piece of paper with a colour presented on a computer monitor and vice versa. Performance was specifically poor when setting an image on a computer monitor to

  20. Recent trends in applicants and the matching process for the integrated plastic surgery match.

    Science.gov (United States)

    Super, Nikki; Tieman, Joshua; Boucher, Kenneth; Rockwell, William Bradford; Agarwal, Jayant P

    2013-10-01

    Matching into a plastic surgery (PS) residency program is a highly competitive process. Selection criteria are very stringent and may influence an applicant's candidacy and application strategy. The purpose of this study was to evaluate recent trends of applicants matching into integrated PS programs using published National Resident Match Program data. Residency match data were gathered for application years 2002 to 2011 using the National Resident Match Program/Association of American Medical Colleges databases. Analyses were limited to the US senior group and excluded the non-US senior group because of the small numbers in the latter group. For all data sets, a logistic regression was performed to analyze the statistical significance of the data. The overall match rate continues to approximately 50%. United States senior applicants were more likely to rank PS only versus PS and others (PS + other) over time (P ranking PS only were more likely to match versus US senior applicants ranking PS + other (odds ratio, 1.71; P rank PS only. The proportion of applicants ranking PS only is steadily rising. The ranking strategy used by US senior applicants is self-selecting into a more competitive (PS only) and less competitive (PS + other) applicant pool. If this continues, nearly 50% of applicants will not match and could be left scrambling for an alternative residency position. These findings therefore suggest that all candidates, regardless of their perceived application strength, should consider having a "backup plan."

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

  2. Decentralized trade with bargaining and voluntary matching

    DEFF Research Database (Denmark)

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

    1994-01-01

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

  3. Scalable Multigigabit Pattern Matching for Packet Inspection

    NARCIS (Netherlands)

    Sourdis, I.; Pnevmatikatos, D.N.; Vassiliadis, S.

    2007-01-01

    In this paper, we consider hardware-based scanning and analyzing packets payload in order to detect hazardous contents.We present two pattern matching techniques to compare incoming packets against intrusion detection search patterns. The first approach, decoded partial CAM (DpCAM), predecodes

  4. A question of matching rather than scheduling

    NARCIS (Netherlands)

    van de Velde, S.L.

    1995-01-01

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

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

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

  7. The Match Quality Gains from Unemployment Insurance

    Science.gov (United States)

    Centeno, Mario

    2004-01-01

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

  8. The Effectiveness of Advertising Matching Purchase Motivation

    OpenAIRE

    Loef, J.; Antonides, G.; van Raaij, W.F.

    2001-01-01

    textabstractSeveral authors have proposed frameworks to help advertisers predict and plan advertising effectiveness. Rossiter and Percy's advertising grid (1997) recommends that the ad appeal should match the purchase motivation or attitude base. They suggest that for utilitarian brands informational advertising is more effective than transformational advertising. Likewise, for hedonic brands transformational advertising is more effective than informational advertising. These recommendations ...

  9. Fingerprint matching on smart card: A review

    CSIR Research Space (South Africa)

    Baruni, Kedimotse P

    2016-12-01

    Full Text Available Fingerprint Match-on-Card (MoC) offers the highest degree of privacy and security to cardholders as the fingerprint never leaves the secure environment of a smart card. The level of security of a biometric system is evaluated by the location where...

  10. Dispersion and betatron matching into the linac

    International Nuclear Information System (INIS)

    Decker, F.J.; Adolphsen, C.; Corbett, W.J.; Emma, P.; Hsu, I.; Moshammer, H.; Seeman, J.T.; Spence, W.L.

    1991-05-01

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

  11. Product Substitutability and the Matching Law

    Science.gov (United States)

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

    2010-01-01

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

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

  13. Revisiting the concept of 'style match'.

    Science.gov (United States)

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

    2013-06-01

    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 the focal point for debate among researchers, educators, and the general public. The preliminary objective of this research was to investigate the psychometric properties of the Preferred Teaching Approach Inventory (PTAI). The research's primary objective was to re-examine the concept of 'style match' through testing the predictive power of students' thinking styles for their preferred teaching approaches. Data were collected from two samples of university students, one each from Shanghai, mainland China (N = 236), and Hong Kong (N = 123). Participants provided the required demographic information and responded to two self-report inventories: the Thinking Styles Inventory - Revised II and the PTAI. Acceptable reliability and good validity were found for the PTAI. All of the eight multiple regressions indicated that students' thinking styles significantly contributed to their preferences for teachers' teaching approaches. These contributions varied by gender among the Shanghai students and by academic discipline among the Hong Kong students. Students, especially Shanghai female students and Hong Kong natural science students, are open to teaching approaches that do not precisely match their thinking styles. The concept of 'style match' requires new understanding. Findings have implications for research and education. © 2013 The British Psychological Society.

  14. Unconditionally stable perfectly matched layer boundary conditions

    NARCIS (Netherlands)

    De Raedt, H.; Michielsen, K.

    2007-01-01

    A brief review is given of a systematic, product-formula based approach to construct unconditionally stable algorithms for solving the time-dependent Maxwell equations. The fundamental difficulties that arise when we want to incorporate uniaxial perfectly matched layer boundary conditions into this

  15. Comparison of Orthogonal Matching Pursuit Implementations

    DEFF Research Database (Denmark)

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

    2012-01-01

    We study the numerical and computational performance of three implementations of orthogonal matching pursuit: one using the QR matrix decomposition, one using the Cholesky matrix decomposition, and one using the matrix inversion lemma. We find that none of these implementations suffer from numeri...

  16. Lifecycle marriage matching: Theory and Evidence

    OpenAIRE

    Aloysius Siow; Eugene Choo

    2007-01-01

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

  17. Computers Launch Faster, Better Job Matching

    Science.gov (United States)

    Stevenson, Gloria

    1976-01-01

    Employment Security Automation Project (ESAP), a five-year program sponsored by the Employment and Training Administration, features an innovative computer-assisted job matching system and instantaneous computer-assisted service for unemployment insurance claimants. ESAP will also consolidate existing automated employment security systems to…

  18. On a special case of model matching

    Czech Academy of Sciences Publication Activity Database

    Zagalak, Petr

    2004-01-01

    Roč. 77, č. 2 (2004), s. 164-172 ISSN 0020-7179 R&D Projects: GA ČR GA102/01/0608 Institutional research plan: CEZ:AV0Z1075907 Keywords : linear systems * state feedback * model matching Subject RIV: BC - Control Systems Theory Impact factor: 0.702, year: 2004

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

  20. 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...... indistinguishable from the training image....

  1. Maximum dynamic responses using matched filter theory and random process theory

    Science.gov (United States)

    Pototzky, Anthony S.; Zeiler, Thomas A.; Perry, Boyd, III

    1988-01-01

    This paper describes and illustrates two ways of performing time-correlated gust-load calculations. The first is based on Matched Filter Theory; the second on Random Process Theory. The two yield theoretically identical results and both employ novel applications of the theories and unconventional interpretations of the intermediate and final results. Both approaches are computationally fast and are general enough to be applied to dynamic-response problems other than gust loads. A brief mathematical development and example calculations using both Matched Filter Theory and Random Process Theory are presented.

  2. Dehydration of football referees during a match.

    Science.gov (United States)

    Da Silva, A I; Fernandez, R

    2003-12-01

    To study hydration status in referees (main) and assistant referees (linesmen) during official football matches. Twelve male football referees were evaluated; all were volunteers. Before and after each match, the referee and one of the assistants were weighed without clothes and a blood sample was taken. Total water loss was determined for each subject from the change in body weight. The main haematological variables were analysed in the blood samples. Total plasma protein concentration and osmolarity were also determined. Variation in plasma volume was determined from changes in packed cell volume and a combination of changes in packed cell volume and haemoglobin concentrations. During a match, total body water loss was 1.60 (0.13) litres, equivalent to 2.05 (0.18)% of body weight. Body weight was reduced by 1.55 (0.12)%, showing that water ingestion during the interval replaces only 24.4% of the body fluids lost during the match. The assistants lost 0.79 (0.19) litre of water, equivalent to 1.05 (0.25)% of body weight. The referees showed a significant decrease in plasma volume of 4.99 (1.33)%. The assistants showed a non-significant increase in plasma volume. The reduction in plasma volume observed in the referees correlated significantly with total body water loss (r = 0.9623). From these data, it is possible to predict that a dehydration of 1% reflects a reduction in plasma volume of nearly 2.5%. Referees are moderately dehydrated after a football match (2%), whereas assistants show a non-significant dehydration of 1% of their body weight.

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

  4. Exercise‐induced homeostatic perturbations provoked by singles tennis match play with reference to development of fatigue

    OpenAIRE

    Mendez‐Villanueva, Alberto; Fernandez‐Fernandez, Jaime; Bishop, David

    2007-01-01

    This review addresses metabolic, neural, mechanical and thermal alterations during tennis match play with special focus on associations with fatigue. Several studies have provided a link between fatigue and the impairment of tennis skills proficiency. A tennis player's ability to maintain skilled on‐court performance and/or optimal muscle function during a demanding match can be compromised as a result of several homeostatic perturbations, for example hypoglycaemia, muscle damage and hyperthe...

  5. Examples of Radiation-Emitting Products

    Science.gov (United States)

    Examples of Radiation-Emitting Electronic Products Radiation Use Medical: Diagnostic Medical: Therapeutic Medical: Surgical Medical: Other Scientific, ... FDA Enforcement Authorities for Radiation-Emitting Products (with examples of products) RCHSA Television Receivers, Microwave Ovens, Cabinet ...

  6. Simple Perturbation Example for Quantum Chemistry.

    Science.gov (United States)

    Goodfriend, P. L.

    1985-01-01

    Presents a simple example that illustrates various aspects of the Rayleigh-Schrodinger perturbation theory. The example is a particularly good one because it is straightforward and can be compared with both the exact solution and with experimental data. (JN)

  7. 26 CFR 1.1368-3 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 11 2010-04-01 2010-04-01 true Examples. 1.1368-3 Section 1.1368-3 Internal... TAXES Small Business Corporations and Their Shareholders § 1.1368-3 Examples. The principles of §§ 1.1368-1 and 1.1368-2 are illustrated by the examples below. In each example Corporation S is a calendar...

  8. 26 CFR 7.465-5 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 14 2010-04-01 2010-04-01 false Examples. 7.465-5 Section 7.465-5 Internal... INCOME TAX REGULATIONS UNDER THE TAX REFORM ACT OF 1976 § 7.465-5 Examples. The provisions of § 7.465-1 and § 7.465-2 may be illustrated by the following examples: Example (1). J and K, as equal partners...

  9. 26 CFR 20.2013-6 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 14 2010-04-01 2010-04-01 false Examples. 20.2013-6 Section 20.2013-6 Internal...; ESTATES OF DECEDENTS DYING AFTER AUGUST 16, 1954 Credits Against Tax § 20.2013-6 Examples. The application of §§ 20.2013-1 to 20.2013-5 may be further illustrated by the following examples: Example (1). (a) A...

  10. 14 CFR Appendix - Example of SIFL Adjustment

    Science.gov (United States)

    2010-01-01

    ... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Example of SIFL Adjustment Aeronautics and Space OFFICE OF THE SECRETARY, DEPARTMENT OF TRANSPORTATION (AVIATION PROCEEDINGS) POLICY STATEMENTS... taxes for rate purposes. Pt. 399, Subpt. C, Example Example of SIFL Adjustment [Methodology for...

  11. 48 CFR 225.504 - Evaluation examples.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 3 2010-10-01 2010-10-01 false Evaluation examples. 225.504 Section 225.504 Federal Acquisition Regulations System DEFENSE ACQUISITION REGULATIONS SYSTEM... 225.504 Evaluation examples. For examples that illustrate the evaluation procedures in 225.502(c)(ii...

  12. 48 CFR 25.504 - Evaluation Examples.

    Science.gov (United States)

    2010-10-01

    ... 48 Federal Acquisition Regulations System 1 2010-10-01 2010-10-01 false Evaluation Examples. 25... PROGRAMS FOREIGN ACQUISITION Evaluating Foreign Offers-Supply Contracts 25.504 Evaluation Examples. The following examples illustrate the application of the evaluation procedures in 25.502 and 25.503. The...

  13. 45 CFR 1170.13 - Illustrative examples.

    Science.gov (United States)

    2010-10-01

    ... 45 Public Welfare 3 2010-10-01 2010-10-01 false Illustrative examples. 1170.13 Section 1170.13... ASSISTED PROGRAMS OR ACTIVITIES Discrimination Prohibited § 1170.13 Illustrative examples. (a) The following examples will illustrate the application of the foregoing provisions to some of the activities...

  14. PAC-Learning from General Examples

    DEFF Research Database (Denmark)

    Fischer, Paul; Hoeffgen, K.- U.; Lefmann, H.

    1997-01-01

    We study a novel view on the PAC learning model in which the examples are more complicated than in the standard model. There, an example usually is an element of the learning domain and its label indicates whether it belongs to the target concept. Here, the examples can be subsets and their label...

  15. Example Sentences in Bilingual School Dictionaries

    African Journals Online (AJOL)

    in dictionary articles, different types of example sentences as well as the criteria for example sen- tences in bilingual school dictionaries in order to ensure that the final product is natural, typical, informative, intelligible and of use to the user. Keywords: SCHOOL DICTIONARY, USER, USER NEEDS, EXAMPLE SENTENCE, ...

  16. SSCL RFQ-DTL matching section instrumentation

    International Nuclear Information System (INIS)

    Datte, P.; Aiello, R.; Hayworth, M.; Johnson, R.; Jones, A.; McClure, S.; Mills, M.; Martin, D.; Ringwall, A.; Webber, R.; Yao, C.

    1994-01-01

    A description of the SSCL RFQ-DTL Matching Section instrumentation is presented with emphasis on design issues and early instrumentation commissioning results. The H - beam energy through the RFQ-DTL matching section is 2.5 Mev, the beam current is 27 mA with a pulse width of 35 μs. The typical beam diameter is 3 mm. The instrumentation consists of three beam position monitors (BPM), a wire scanner, beam loss monitors (BLM), a slit and collector emittance measurement unit (EMU), a current toroid, and a Faraday cup. The instruments were designed to accommodate high current densities, have a large dynamic range with moderate bandwidths, and fit congested spaces

  17. [Establishment of delta block matching technique].

    Science.gov (United States)

    Lü, Qin-Feng; Zhang, Wei; Zhu, Fa-Ming; Yan, Li-Xing

    2006-04-01

    To establish delta block HLA-matching technique, DNA was extracted from whole blood by salting-out method, delta block was amplified by polymerase chain reaction (PCR), and PCR product was detected by GeneScan. The results showed that delta block had polymorphism in 104 samples without sibship of the Han people from Zhejiang province. The range of DNA fragment length was 81-393 bp and could be divided into 4 groups: 81-118 bp, 140-175 bp, 217-301 bp, 340-393 bp. The numbers of DNA fragments were 6-32. It is concluded that the method of delta block matching is reliable and can be applied to select donors for the patients to be transplanted. It is the first time to get delta block data of the Han people in China.

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

  19. Passport officers' errors in face matching.

    Science.gov (United States)

    White, David; Kemp, Richard I; Jenkins, Rob; Matheson, Michael; Burton, A Mike

    2014-01-01

    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.

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

  1. SSCL RFQ-DTL Matching Section instrumentation

    International Nuclear Information System (INIS)

    Datte, P.; Aielo, R.; Hayworth, M.

    1993-11-01

    A description of the SSCL RFQ-DTL Matching Section instrumentation is presented with emphasis on design issues and early instrumentation commissioning results. The H - beam energy through the RFQ-DTL matching section is 2.5 MeV, the beam current is 27 mA with a pulse width of 35 Its. The typical beam diameter is 3 mm. The instrumentation consists of three beam position monitors (BPM), a wire scanner, beam loss monitors (BLM), a slit and collector emittance measurement unit (EMU), a current toroid, and a Faraday cup. The instruments were designed to accommodate high current densities, have a large dynamic range with moderate bandwidths, and fit congested spaces

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

  3. Generating catalogs of transverse matching solutions

    International Nuclear Information System (INIS)

    Swain, G.; Busch, P.; Burns, M.

    1989-01-01

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

  4. Wake field in matched kicker magnet

    International Nuclear Information System (INIS)

    Miyahara, Y.

    1979-01-01

    Coherent transverse instability observed in KEK booster proton synchrotron has been reported previously. This instability is induced by the interaction of the beam with kicker magnet for the fast beam extraction. To understand the mechanism completely, it is necessary to know the wake field in detail. Here, the wake field or induced current in the kicker magnet which is terminated with matched resistance is considered

  5. Bridging Database Applications and Declarative Similarity Matching

    OpenAIRE

    Andrade Ribeiro, Leonardo; Schneider, Natália Cristina; de Souza Inácio, Andrei; Wagner, Harley Michel; von Wangenheim, Aldo

    2017-01-01

    Effective manipulation of string data is of fundamental importance to modern database applications. Very often, textual inconsistencies render equality comparisons meaningless and strings have to be matched in terms of their similarity. Previous work has proposed techniques to express similarity operations using declarative SQL statements. However, the non-trivial issue of embedding similarity support into object-oriented applications has received little attention. Particularly, declarative s...

  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. Time Series Analysis and Forecasting by Example

    CERN Document Server

    Bisgaard, Soren

    2011-01-01

    An intuition-based approach enables you to master time series analysis with ease Time Series Analysis and Forecasting by Example provides the fundamental techniques in time series analysis using various examples. By introducing necessary theory through examples that showcase the discussed topics, the authors successfully help readers develop an intuitive understanding of seemingly complicated time series models and their implications. The book presents methodologies for time series analysis in a simplified, example-based approach. Using graphics, the authors discuss each presented example in

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

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

  10. Best matching Barenblatt profiles are delayed

    International Nuclear Information System (INIS)

    Dolbeault, Jean; Toscani, Giuseppe

    2015-01-01

    The growth of the second moments of the solutions of fast diffusion equations is asymptotically governed by the behavior of self-similar solutions. However, at next order, there is a correction term which amounts to a delay depending on the nonlinearity and on a distance of the initial data to the set of self-similar Barenblatt solutions. This distance can be measured in terms of a relative entropy to the best matching Barenblatt profile. This best matching Barenblatt function determines a scale. In new variables based on this scale, which are given by a self-similar change of variables if and only if the initial datum is one of the Barenblatt profiles, the typical scale is monotone and has a limit. Coming back to original variables, the best matching Barenblatt profile is delayed compared to the self-similar solution with same initial second moment as the initial datum. Such a delay is a new phenomenon, which has to be taken into account for instance when fitting experimental data. (paper)

  11. Stereo matching using epipolar distance transform.

    Science.gov (United States)

    Yang, Qingxiong; Ahuja, Narendra

    2012-10-01

    In this paper, we propose a simple but effective image transform, called the epipolar distance transform, for matching low-texture regions. It converts image intensity values to a relative location inside a planar segment along the epipolar line, such that pixels in the low-texture regions become distinguishable. We theoretically prove that the transform is affine invariant, thus the transformed images can be directly used for stereo matching. Any existing stereo algorithms can be directly used with the transformed images to improve reconstruction accuracy for low-texture regions. Results on real indoor and outdoor images demonstrate the effectiveness of the proposed transform for matching low-texture regions, keypoint detection, and description for low-texture scenes. Our experimental results on Middlebury images also demonstrate the robustness of our transform for highly textured scenes. The proposed transform has a great advantage, its low computational complexity. It was tested on a MacBook Air laptop computer with a 1.8 GHz Core i7 processor, with a speed of about 9 frames per second for a video graphics array-sized image.

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

  13. An investigation of the complexities of successful and unsuccessful guide dog matching and partnerships.

    Directory of Open Access Journals (Sweden)

    Janice Kathryn Foyer Lloyd

    2016-12-01

    Full Text Available Matching a person who is blind or visually impaired with a guide dog is a process of finding the most suitable guide dog available for that individual. Not all guide dog partnerships are successful, and the consequences of an unsuccessful partnership may result in reduced mobility and quality of life for the handler (owner, and are costly in time and resources for guide dog training establishments. This study examined 50 peoples’ partnerships with one or more dogs (118 pairings to ascertain the outcome of the relationship. Forty three of the 118 dogs were returned to the guide dog training establishment before reaching retirement age, with the majority (n = 40 being categorised as having dog related issues. Most (n = 26 of these dogs’ issues were classified as being behavioural in character, including work related and non-work related behaviour, and 14 were due to physical causes (mainly poor health. Three dogs were returned due to matters relating to the handlers’ behaviour. More second dogs were returned than the handlers’ first or third dogs, and dogs that had been previously used as a guide could be rematched successfully. Defining matching success is not clear-cut. Not all dogs that were returned were considered by their handlers to have been mismatched, and not all dogs retained until retirement were thought to have been good matches, suggesting that some handlers were retaining what they considered to be a poorly matched dog. Almost all the handlers who regarded a dog as being mismatched conceded that some aspects of the match were good. For example, a dog deemed mismatched for poor working behaviour may have shown good home and/or other social behaviours. The same principle was true for successful matches, where few handlers claimed to have had a perfect dog. It is hoped that these results may help the guide dog industry identify important aspects of the matching process, and/or be used to identify areas where a matching problem

  14. Case-control matching: effects, misconceptions, and recommendations.

    Science.gov (United States)

    Mansournia, Mohammad Ali; Jewell, Nicholas Patrick; Greenland, Sander

    2018-01-01

    Misconceptions about the impact of case-control matching remain common. We discuss several subtle problems associated with matched case-control studies that do not arise or are minor in matched cohort studies: (1) matching, even for non-confounders, can create selection bias; (2) matching distorts dose-response relations between matching variables and the outcome; (3) unbiased estimation requires accounting for the actual matching protocol as well as for any residual confounding effects; (4) for efficiency, identically matched groups should be collapsed; (5) matching may harm precision and power; (6) matched analyses may suffer from sparse-data bias, even when using basic sparse-data methods. These problems support advice to limit case-control matching to a few strong well-measured confounders, which would devolve to no matching if no such confounders are measured. On the positive side, odds ratio modification by matched variables can be assessed in matched case-control studies without further data, and when one knows either the distribution of the matching factors or their relation to the outcome in the source population, one can estimate and study patterns in absolute rates. Throughout, we emphasize distinctions from the more intuitive impacts of cohort matching.

  15. A beam-matching concept for medical linear accelerators

    DEFF Research Database (Denmark)

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

    2009-01-01

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

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

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

    DEFF Research Database (Denmark)

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

    2009-01-01

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

  18. MEMORY EFFICIENT SEMI-GLOBAL MATCHING

    Directory of Open Access Journals (Sweden)

    H. Hirschmüller

    2012-07-01

    Full Text Available Semi-GlobalMatching (SGM is a robust stereo method that has proven its usefulness in various applications ranging from aerial image matching to driver assistance systems. It supports pixelwise matching for maintaining sharp object boundaries and fine structures and can be implemented efficiently on different computation hardware. Furthermore, the method is not sensitive to the choice of parameters. The structure of the matching algorithm is well suited to be processed by highly paralleling hardware e.g. FPGAs and GPUs. The drawback of SGM is the temporary memory requirement that depends on the number of pixels and the disparity range. On the one hand this results in long idle times due to the bandwidth limitations of the external memory and on the other hand the capacity bounds are quickly reached. A full HD image with a size of 1920 × 1080 pixels and a disparity range of 512 pixels requires already 1 billion elements, which is at least several GB of RAM, depending on the element size, wich are not available at standard FPGA- and GPUboards. The novel memory efficient (eSGM method is an advancement in which the amount of temporary memory only depends on the number of pixels and not on the disparity range. This permits matching of huge images in one piece and reduces the requirements of the memory bandwidth for real-time mobile robotics. The feature comes at the cost of 50% more compute operations as compared to SGM. This overhead is compensated by the previously idle compute logic within the FPGA and the GPU and therefore results in an overall performance increase. We show that eSGM produces the same high quality disparity images as SGM and demonstrate its performance both on an aerial image pair with 142 MPixel and within a real-time mobile robotic application. We have implemented the new method on the CPU, GPU and FPGA.We conclude that eSGM is advantageous for a GPU implementation and essential for an implementation on our FPGA.

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

  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. On the theoretical and empirical status of the matching law and matching theory.

    Science.gov (United States)

    McDowell, J J

    2013-09-01

    The original and power function versions of the matching law and matching theory are mathematical accounts of continuous choice that have been applied to the behavior of many vertebrate species, including humans, and have become influential in a variety of disciplines, such as economics, behavioral pharmacology, and clinical science. Each version can be interpreted either from a response strength perspective or from a purely algebraic perspective. The point of departure of both versions of matching theory is the assertion that all behavior is choice governed by the matching law. This assertion permits sets of equations to be derived that constitute the 2 versions of the theory. Considerable experimental evidence leads to the conclusion that both interpretations of the original version of the matching law and theory are false and that both interpretations of the power function version of the law and theory are tenable. Specifically, the behavior of animal and human subjects conforms exactly to the mathematical forms required by the power function version of the law and theory, and the theoretical assumptions entailed by both interpretations of this version are supported by the empirical evidence. In addition, the theoretical interpretations of all but 1 of the parameters of the power function version's equations are consistent with available evidence. The one problematic parameter is interpreted as the rate at which unmeasured background resources are acquired. The theoretical interpretation of this parameter must be reconciled with observation in order to maintain matching theory's central assertion that all behavior is choice. (c) 2013 APA, all rights reserved.

  2. Determination of methodology of automatic history matching; Determinacao de metodologia de ajuste automatizado de historico

    Energy Technology Data Exchange (ETDEWEB)

    Santos, Jose Pedro Moura dos

    2000-01-01

    In management of hydrocarbon reservoirs the numeric simulation is a fundamental tool. The validation of a field model with production report is made through history matching which, many times, is done by trial and errors procedures consuming excessive computational time and human efforts. The objective of this work is to present a methodology for automation of the history matching using the program UNIPAR with the modules of parallel computing, sensibility analysis and optimization. Based on an example of an offshore field, analyses of the objective function (water production, oil production and average pressure of the reservoir) behavior were accomplished as function of the variations of reservoir parameters. It was verified that this behavior is very regular. After that, several adjustment situations were tested to define a procedure to be used for a history matching. (author) Ate aqui estao scanned.

  3. Power calculation in matched case-referent studies. Application and accuracy of the asymptotic power function.

    Science.gov (United States)

    Blitzer, P H; Hsieh, C C; Miettinen, O S

    1986-11-01

    Although the asymptotic power function for matched case-referent (case-control) studies has been given, it is not widely applied. One reason for this is that the parameters in the power function do not correspond directly to the usual description of the research situation. When designing a matched case-referent study, the potentially available relevant information concerns the joint distribution of the determinant and matching variate, and the illness rate in relation to those factors, in the study base. Application of the asymptotic power function using these inputs is described. The asymptotic power function is then assessed by use of the Monte Carlo method and is found to be accurate. An example of the application of the asymptotic power function is given.

  4. A frequency response model matching method for PID controller design for processes with dead-time.

    Science.gov (United States)

    Anwar, Md Nishat; Pan, Somnath

    2015-03-01

    In this paper, a PID controller design method for the integrating processes based on frequency response matching is presented. Two approaches are proposed for the controller design. In the first approach, a double feedback loop configuration is considered where the inner loop is designed with a stabilizing gain. In the outer loop, the parameters of the PID controller are obtained by frequency response matching between the closed-loop system with the PID controller and a reference model with desired specifications. In the second approach, the design is directly carried out considering a desired load-disturbance rejection model of the system. In both the approaches, two low frequency points are considered for matching the frequency response, which yield linear algebraic equations, solution of which gives the controller parameters. Several examples are taken from the literature to demonstrate the effectiveness and to compare with some well known design methods. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

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

    Science.gov (United States)

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

    2015-01-01

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

  6. Image Segmentation, Registration, Compression, and Matching

    Science.gov (United States)

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

    2011-01-01

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

  7. Some Recent Results on Graph Matching,

    Science.gov (United States)

    1987-06-01

    UNIV NASHVILLE TN DEPT OF MATHENATICS L LAVfASZ ET A. JUN 97 NM 4-5-K-04N UNCLRSSIFIED F/0 12/2 NM. IEEE’.omomol m IA I11.25 1" MICROCMP RESOLUTKIH...Department of Computer Science _ Etv6s Lorind University Budapest, Hungary DTIC and ELECTE Michael D. Plummer* AUG 1 41987 Department of Mathematics...in polynomial time. From this it is not difficult to compute a basis in the matching lattice and solve other fundamental questions concerning lat(M

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

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

  10. Impedance matched thin metamaterials make metals absorbing.

    Science.gov (United States)

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

    2013-11-13

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

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

  12. Symmetric Circular Matchings and RNA Folding

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  13. Technological progress and average job matching quality

    Directory of Open Access Journals (Sweden)

    Mário Centeno

    2009-12-01

    Full Text Available Our objective is to study, in a labor market characterized by search frictions, the effect of technological progress on the average quality of job matches. For that, we use an extension of Mortensen and Pissarides (1998 and obtain as results that the effects of technological progress on the labor market depend upon the initial conditions of the economy. If the economy is totally characterized by the presence of low-quality job matches, an increase in technological progress is accompanied by an increase in the quality of jobs. In turn, if the economy is totally characterized by the presence of high-quality job matches, an increase in the technological progress rate implies the reverse effect. Finally, if the economy is totally characterized by the presence of very high-quality jobs, an increase in the technological progress rate implies an increase in the average quality of the job matches.O objetivo deste artigo é o de estudar, em um mercado de trabalho caracterizado por fricções, os efeitos do progresso tecnológico sobre a qualidade média das parcerias produtivas. Para tal, utilizamos uma extensão do modelo de Mortensen and Pissarides (1998 e obtivemos, como resultados, que os efeitos de variações na taxa de progresso tecnológico sobre o mercado de trabalho dependerão das condições da economia. Se a economia for totalmente caracterizada pela presença de parcerias produtivas de baixa qualidade, um aumento na taxa de progresso tecnológico vem acompanhado por um aumento na qualidade médias das parcerias produtivas. Por sua vez, se a economia for totalmente caracterizada pela presença de parcerias produtivas de alta qualidade, um aumento na taxa de progresso tecnológico gera um efeito inverso. Finalmente, se a economia for totalmente caracterizada pela presença de parcerias produtivas de muito alta qualidade, um aumento na taxa de progresso tecnológico virá acompanhado de uma elevação na qualidade média dos empregos.

  14. PIV uncertainty quantification by image matching

    International Nuclear Information System (INIS)

    Sciacchitano, Andrea; Scarano, Fulvio; Wieneke, Bernhard

    2013-01-01

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

  15. Miro V4.0: example book

    International Nuclear Information System (INIS)

    Morice, O.; Ribeyre, X.; Donnat, Ph.; Porcher, Th.; Treimany, C.; Nassiet, D.; Gallice, G.; Rivoire, V.; L'hullier, N.

    2000-01-01

    This manual presents an ensemble of examples related to the use of the Miro code. It can be used for leaning how to perform simulations with Miro. Furthermore the presented examples are used for checking that new routines added in Miro do not perturb the efficiency of the older ones. In that purpose most of the capabilities of Miro are covered by the examples. (authors)

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

  17. Muscle fatigue during football match-play.

    Science.gov (United States)

    Reilly, Thomas; Drust, Barry; Clarke, Neil

    2008-01-01

    One of the consequences of sustaining exercise for 90 minutes of football match-play is that the capability of muscle to generate force declines. This impairment is reflected in the decline of work-rate towards the late part of the game. Causes of this phenomenon, which is known as fatigue, and some of its consequences are considered in this article. The stores of muscle glycogen may be considerably reduced by the end of the game, especially if there has not been a tapering of the training load. Thermoregulatory strain may also be encountered, resulting in a fall in physical performance, or there may be a reduced central drive from the nervous system. The decline in muscle strength may increase the predisposition to injury in the lower limbs. Central fatigue may also occur with implications for muscle performance. Strategies to offset fatigue include astute use of substitutions, appropriate nutritional preparation and balancing pre-cooling and warm-up procedures. There is also a role for endurance training and for a pacing strategy that optimizes the expenditure of energy during match-play.

  18. The Southampton Cauchy-characteristic matching project

    International Nuclear Information System (INIS)

    D'Inverno, R.

    2001-01-01

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

  19. Rapid contrast matching by microfluidic SANS.

    Science.gov (United States)

    Adamo, Marco; Poulos, Andreas S; Miller, Ruhina M; Lopez, Carlos G; Martel, Anne; Porcar, Lionel; Cabral, João T

    2017-05-02

    We report a microfluidic approach to perform small angle neutron scattering (SANS) measurements of contrast variation and matching, extensively employed in soft and biological matter research. We integrate a low scattering background microfluidic mixer and serpentine channel in a SANS beamline to yield a single phase, continuous flow, reconfigurable liquid cell. By contrast with conventional, sequential measurements of discrete (typically 4-6) solutions of varying isotopic solvent composition, our approach continually varies solution composition during SANS acquisition. We experimentally and computationally determine the effects of flow dispersion and neutron beam overillumination of microchannels in terms of the composition resolution and precision. The approach is demonstrated with model systems: H 2 O/D 2 O mixtures, a surfactant (sodium dodecyl sulfate, SDS), a triblock copolymer (pluronic F127), and silica nanoparticles (Ludox) in isotopic aqueous mixtures. The system is able to zoom into a composition window to refine contrast matching conditions, and robustly resolve solute structure and form factors by simultaneous fitting of scattering data with continuously varying contrast. We conclude by benchmarking our microflow-SANS with the discrete approach, in terms of volume required, composition resolution and (preparation and measurement) time required, proposing a leap forward in equilibrium, liquid solution phase mapping and contrast variation by SANS.

  20. Robust Matching Pursuit Extreme Learning Machines

    Directory of Open Access Journals (Sweden)

    Zejian Yuan

    2018-01-01

    Full Text Available Extreme learning machine (ELM is a popular learning algorithm for single hidden layer feedforward networks (SLFNs. It was originally proposed with the inspiration from biological learning and has attracted massive attentions due to its adaptability to various tasks with a fast learning ability and efficient computation cost. As an effective sparse representation method, orthogonal matching pursuit (OMP method can be embedded into ELM to overcome the singularity problem and improve the stability. Usually OMP recovers a sparse vector by minimizing a least squares (LS loss, which is efficient for Gaussian distributed data, but may suffer performance deterioration in presence of non-Gaussian data. To address this problem, a robust matching pursuit method based on a novel kernel risk-sensitive loss (in short KRSLMP is first proposed in this paper. The KRSLMP is then applied to ELM to solve the sparse output weight vector, and the new method named the KRSLMP-ELM is developed for SLFN learning. Experimental results on synthetic and real-world data sets confirm the effectiveness and superiority of the proposed method.

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

    Directory of Open Access Journals (Sweden)

    Tianyang Cao

    2017-01-01

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

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

    2008-01-01

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

  3. Development of 3D Image Measurement System and Stereo-matching Method, and Its Archeological Measurement

    Science.gov (United States)

    Kochi, Nobuo; Ito, Tadayuki; Kitamura, Kazuo; Kaneko, Syun'ichi

    The three dimensional measurement & modeling system with digital cameras on PC is now making progress and its need and hope is increasingly felt in terrestrial (close-range) photogrammetry for such sectors as cultural heritage preservation, architecture, civil engineering, manufacturing, measurement etc. Therefore, we have developed a system to improve the accuracy of stereo-matching, which is the very core of 3D measurement. As for stereo-matching method, in order to minimize the mismatching and to be robust in geometric distortions, occlusion, as well as brightness change, we invented Coarse-to-Fine Strategy Method by integrating OCM (Orientation Code Matching) with LSM (Least Squares Matching). Thus this system could attain the accuracy of 0.26mm, when we experimented on a mannequin. And when we actually experimented on the archeological ruins in Greece and Turkey, the accuracy was within the range of 1cm, compared with their blue-print plan. Besides, formally workers used to take at least 1.5 month for this kind of survey operation with the existing method, but now workers need only 3 or 4 days. Thus, its practicality and efficiency was confirmed. This paper demonstrates our new system of 3D measurement and stereo-matching with some concrete examples as its practical application.

  4. Matching Matched Filtering with Deep Networks for Gravitational-Wave Astronomy

    Science.gov (United States)

    Gabbard, Hunter; Williams, Michael; Hayes, Fergus; Messenger, Chris

    2018-04-01

    We report on the construction of a deep convolutional neural network that can reproduce the sensitivity of a matched-filtering search for binary black hole gravitational-wave signals. The standard method for the detection of well-modeled transient gravitational-wave signals is matched filtering. We use only whitened time series of measured gravitational-wave strain as an input, and we train and test on simulated binary black hole signals in synthetic Gaussian noise representative of Advanced LIGO sensitivity. We show that our network can classify signal from noise with a performance that emulates that of match filtering applied to the same data sets when considering the sensitivity defined by receiver-operator characteristics.

  5. Conflict between background matching and social signalling in a colour-changing freshwater fish.

    Science.gov (United States)

    Kelley, Jennifer L; Rodgers, Gwendolen M; Morrell, Lesley J

    2016-06-01

    The ability to change coloration allows animals to modify their patterning to suit a specific function. Many freshwater fishes, for example, can appear cryptic by altering the dispersion of melanin pigment in the skin to match the visual background. However, melanin-based pigments are also used to signal dominance among competing males; thus colour change for background matching may conflict with colour change for social status signalling. We used a colour-changing freshwater fish to investigate whether colour change for background matching influenced aggressive interactions between rival males. Subordinate males that had recently darkened their skin for background matching received heightened aggression from dominant males, relative to males whose coloration had not changed. We then determined whether the social status of a rival male, the focal male's previous social status, and his previous skin coloration, affected a male's ability to change colour for background matching. Social status influenced skin darkening in the first social encounter, with dominant males darkening more than subordinate males, but there was no effect of social status on colour change in the second social encounter. We also found that the extent of skin colour change (by both dominant and subordinate males) was dependent on previous skin coloration, with dark males displaying a smaller change in coloration than pale males. Our findings suggest that skin darkening for background matching imposes a significant social cost on subordinate males in terms of increased aggression. We also suggest that the use of melanin-based signals during social encounters can impede subsequent changes in skin coloration for other functions, such as skin darkening for background matching.

  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. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

  7. An Elegant Example of Chemoselective Reaction

    Indian Academy of Sciences (India)

    Srimath

    is given the least attention in our undergraduate teaching. For this purpose I have chosen the example of the preparation of sulfona-. Keywords. Chemoselectivity, sulfa drugs, sulfonamides, amide hydrolysis. An Elegant Example of Chemoselective Reaction. The Preparation of Sulfonamide Drugs. Gopalpur Nagendrappa.

  8. RFID Malware: Design Principles and Examples

    NARCIS (Netherlands)

    Rieback, M.R.; Simpson, P.N.D.; Crispo, B.; Tanenbaum, A.S.

    2006-01-01

    This paper explores the concept of malware for Radio Frequency Identification (RFID) systems - including RFID exploits, RFID worms, and RFID viruses. We present RFID malware design principles together with concrete examples; the highlight is a fully illustrated example of a self-replicating RFID

  9. Some Examples of Identification with Neural Networks

    OpenAIRE

    Sjöberg, Jonas

    1994-01-01

    In this report some examples on system identification of non-linear systems with neural networks are presented. The systems being identified all have different kinds of non-linearities, more or less known. The examples in this paper show that these non-linearities can be successfully modeled by non-linear models based on neural networks.

  10. 26 CFR 1.851-5 - Examples.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 9 2010-04-01 2010-04-01 false Examples. 1.851-5 Section 1.851-5 Internal Revenue INTERNAL REVENUE SERVICE, DEPARTMENT OF THE TREASURY (CONTINUED) INCOME TAX (CONTINUED) INCOME TAXES Regulated Investment Companies and Real Estate Investment Trusts § 1.851-5 Examples. The...

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

    KAUST Repository

    Gu, Binbin

    2017-05-18

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

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

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  13. Tuned driving of piezoelectric resonators: impedance matching

    Directory of Open Access Journals (Sweden)

    Pons, J. L.

    2006-06-01

    Full Text Available For optimal operation of piezoelectric resonators, the electrical impedance of electronic drivers and the resonator itself must be matched. Lack of matching results in a non smooth transmission of electrical power between the drive and the load which, in turn, leads to heating and poor efficiency. The rest of properties of the driving voltage (frequency, amplitude and phase are also affected by this mismatch. This paper presents the optimal design of power drivers for piezoelectric resonators. This approach is based on a first stage of electro-mechanical experimental characterization. This first step sets the basis for an impedance matching process. The approach has been experimentally validated on a well known piezoelectric resonator: the ultrasonic motor.

    La operación óptima de un resonador piezoeléctrico requiere de la adaptación de impedancia eléctrica entre el circuito de excitación y el propio resonador. La falta de adaptación se traduce en una pobre transmisión de potencia desde el excitador hasta el resonador, lo que a su vez se traduce en calentamiento y pérdida de eficienca en la operación. Las características morfológicas de la tensión de excitación (amplitud, frecuencia y fase también quedan afectadas por esta falta de adaptación. Este artículo analiza el diseño óptimo de la etapa de potencia de un circuito eléctrico de excitación para resonadores piezoeléctricos. Se trata la caracterización electromecánica del resonador y, en base a ésta, la adaptación de impedancias entre circuito y resonador. La contrastación experimental se ha llevado a cabo con un resonador bien estudiado en la literatura: un motor ultrasónico.

  14. Block-Matching Based Multifocus Image Fusion

    Directory of Open Access Journals (Sweden)

    Feng Zhu

    2015-01-01

    Full Text Available A new multifocus image fusion method is proposed. Two image blocks are selected by sliding the window from the two source images at the same position, discrete cosine transform (DCT is implemented, respectively, on these two blocks, and the alternating component (AC energy of these blocks is then calculated to decide which is the well-focused one. In addition, block matching is used to determine a group of image blocks that are all similar to the well-focused reference block. Finally, all the blocks are returned to their original positions through weighted average. The weight is decided with the AC energy of the well-focused block. Experimental results demonstrate that, unlike other spatial methods, the proposed method effectively avoids block artifacts. The proposed method also significantly improves the objective evaluation results, which are obtained by some transform domain methods.

  15. Time-allocation matching between punishing situations.

    Science.gov (United States)

    Deluty, M Z; Church, R M

    1978-03-01

    In the presence and absence of white noise, response-independent aversive events were delivered to rats according to several variable-time electric-shock schedules. The animals could switch from the noise component to the no-noise component and vice versa by making a single lever-press response. If the schedule in one component was not in operation when the animal was in the other component, the proportion of time allocated to one component equalled or matched the proportion of obtained punishers in the other component. If both schedules were always in operation, minimizing tended to occur: the animals allocated almost all of their time to the component having the lower shock rate. An analysis of these results, in terms of the expected time until an aversive event, is presented.

  16. Robust structural identification via polyhedral template matching

    DEFF Research Database (Denmark)

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

    2016-01-01

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

  17. Matching Value Propositions with Varied Customer Needs

    DEFF Research Database (Denmark)

    Heikka, Eija-Liisa; Frandsen, Thomas; Hsuan, Juliana

    2018-01-01

    Organizations seek to manage varied customer segments using varied value propositions. The ability of a knowledge-intensive business service (KIBS) provider to formulate value propositions into attractive offerings to varied customers becomes a competitive advantage. In this specific business based...... on often highly abstract service offerings, this requires the provider to have a clear overview of its knowledge and resources and how these can be configured to obtain the desired customization of services. Hence, the purpose of this paper is to investigate how a KIBS provider can match value propositions...... with varied customer needs utilizing service modularity. To accomplish this purpose, a qualitative multiple case study is organized around 5 projects allowing within-case and cross-case comparisons. Our findings describe how through the configuration of knowledge and resources a sustainable competitive...

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

  19. On Tree Pattern Matching by Pushdown Automata

    Directory of Open Access Journals (Sweden)

    T. Flouri

    2009-01-01

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

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

  1. Quasicrystalline nanocrystal superlattice with partial matching rules

    Science.gov (United States)

    Ye, Xingchen; Chen, Jun; Eric Irrgang, M.; Engel, Michael; Dong, Angang; Glotzer, Sharon C.; Murray, Christopher B.

    2017-02-01

    Expanding the library of self-assembled superstructures provides insight into the behaviour of atomic crystals and supports the development of materials with mesoscale order. Here we build on recent findings of soft matter quasicrystals and report a quasicrystalline binary nanocrystal superlattice that exhibits correlations in the form of partial matching rules reducing tiling disorder. We determine a three-dimensional structure model through electron tomography and direct imaging of surface topography. The 12-fold rotational symmetry of the quasicrystal is broken in sublayers, forming a random tiling of rectangles, large triangles and small triangles with 6-fold symmetry. We analyse the geometry of the experimental tiling and discuss factors relevant for the stabilization of the quasicrystal. Our joint experimental-computational study demonstrates the power of nanocrystal superlattice engineering and further narrows the gap between the richness of crystal structures found with atoms and in soft matter assemblies.

  2. Anesthesia and Poliomyelitis: A Matched Cohort Study.

    Science.gov (United States)

    Van Alstine, Luke W; Gunn, Paul W; Schroeder, Darrell R; Hanson, Andrew C; Sorenson, Eric J; Martin, David P

    2016-06-01

    Poliomyelitis is a viral infectious disease caused by 1 of the 3 strains of poliovirus. The World Health Organization launched an eradication campaign in 1988. Although the number of cases of poliomyelitis has drastically declined, eradication has not yet been achieved, and there are a substantial number of survivors of the disease. Survivors of poliomyelitis present a unique set of challenges to the anesthesiologist. The scientific literature regarding the anesthetic management of survivors of poliomyelitis, however, is limited and primarily experiential in nature. Using a retrospective, matched cohort study, we sought to more precisely characterize the anesthetic implications of poliomyelitis and to determine what risks, if any, may be present for patients with a history of the disease. Using the Mayo Clinic Life Sciences System Data Discovery and Query Builder, study subjects were identified as those with a history of paralytic poliomyelitis who had undergone major surgery at Mayo Clinic Rochester between 2005 and 2009. For each case, 2 sex- and age-matched controls that underwent the same surgical procedure during the study period were randomly selected from a pool of possible controls. Medical records were manually interrogated with respect to demographic variables, comorbid conditions, operative and anesthetic course, and postoperative course. We analyzed 100 cases with 2:1 matched controls and found that the peri- and postoperative courses were very similar for both groups of patients. Pain scores, postanesthesia care unit admission, length of postanesthesia care unit stay, intensive care unit admission, length of intensive care unit stay, and initial extubation location were not significantly different between the 2 groups. Looking at pulmonary complications in our primary outcome, there was no significant difference between the 2 groups (17% vs 14% for polio versus control, respectively; conditional logistic regression odds ratio = 1.5; 95% confidence

  3. Faster catalog matching on Graphics Processing Units

    Science.gov (United States)

    Lee, M. A.; Budavári, T.

    2017-07-01

    One of the most fundamental problems in observational astronomy is the cross-identification of sources. Observations are made at different times in different wavelengths with separate instruments, resulting in a large set of independent observations. The scientific outcome is often limited by our ability to quickly perform associations across catalogs. The matching, however, is difficult scientifically, statistically as well as computationally. The former two require detailed physical modeling and advanced probabilistic concepts; the latter is due to the large volumes of data and the problem's combinatorial nature. In order to tackle the computational challenge and to prepare for future surveys we developed a new implementation on Graphics Processing Units. Our solution scales across multiple devices and can process hundreds of trillions of crossmatch candidates per second in a single machine.

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

  5. Load Matching and Grid Interaction of Net Zero Energy Buildings

    DEFF Research Database (Denmark)

    Voss, Karsten; Candanedo, José A.; Geier, Sonja

    2010-01-01

    “Net Zero Energy Building” has become a prominent wording to describe the synergy of energy efficient building and renewable energy utilization to reach a balanced energy budget over a yearly cycle. Taking into account the energy exchange with a grid infrastructure overcomes the limitations of se...... matching and grid interaction. Indices to describe both issues are proposed and foreseen as part of a harmonized definition framework. The work is part of subtask A of the IEA SHCP Task40/ECBCS Annex 52: “Towards Net Zero Energy Solar Buildings”.......“Net Zero Energy Building” has become a prominent wording to describe the synergy of energy efficient building and renewable energy utilization to reach a balanced energy budget over a yearly cycle. Taking into account the energy exchange with a grid infrastructure overcomes the limitations...... of seasonal energy storage on-site. Even though the wording “Net Zero Energy Building” focuses on the annual energy balance, large differences may occur between solution sets in the amount of grid interaction needed to reach the goal. The paper reports on the analysis of example buildings concerning the load...

  6. One-loop matching and running with covariant derivative expansion

    Science.gov (United States)

    Henning, Brian; Lu, Xiaochuan; Murayama, Hitoshi

    2018-01-01

    We develop tools for performing effective field theory (EFT) calculations in a manifestly gauge-covariant fashion. We clarify how functional methods account for one-loop diagrams resulting from the exchange of both heavy and light fields, as some confusion has recently arisen in the literature. To efficiently evaluate functional traces containing these "mixed" one-loop terms, we develop a new covariant derivative expansion (CDE) technique that is capable of evaluating a much wider class of traces than previous methods. The technique is detailed in an appendix, so that it can be read independently from the rest of this work. We review the well-known matching procedure to one-loop order with functional methods. What we add to this story is showing how to isolate one-loop terms coming from diagrams involving only heavy propagators from diagrams with mixed heavy and light propagators. This is done using a non-local effective action, which physically connects to the notion of "integrating out" heavy fields. Lastly, we show how to use a CDE to do running analyses in EFTs, i.e. to obtain the anomalous dimension matrix. We demonstrate the methodologies by several explicit example calculations.

  7. Multiscale molecular dynamics using the matched interface and boundary method

    International Nuclear Information System (INIS)

    Geng Weihua; Wei, G.W.

    2011-01-01

    The Poisson-Boltzmann (PB) equation is an established multiscale model for electrostatic analysis of biomolecules and other dielectric systems. PB based molecular dynamics (MD) approach has a potential to tackle large biological systems. Obstacles that hinder the current development of PB based MD methods are concerns in accuracy, stability, efficiency and reliability. The presence of complex solvent-solute interface, geometric singularities and charge singularities leads to challenges in the numerical solution of the PB equation and electrostatic force evaluation in PB based MD methods. Recently, the matched interface and boundary (MIB) method has been utilized to develop the first second order accurate PB solver that is numerically stable in dealing with discontinuous dielectric coefficients, complex geometric singularities and singular source charges. The present work develops the PB based MD approach using the MIB method. New formulation of electrostatic forces is derived to allow the use of sharp molecular surfaces. Accurate reaction field forces are obtained by directly differentiating the electrostatic potential. Dielectric boundary forces are evaluated at the solvent-solute interface using an accurate Cartesian-grid surface integration method. The electrostatic forces located at reentrant surfaces are appropriately assigned to related atoms. Extensive numerical tests are carried out to validate the accuracy and stability of the present electrostatic force calculation. The new PB based MD method is implemented in conjunction with the AMBER package. MIB based MD simulations of biomolecules are demonstrated via a few example systems.

  8. A STREAMLINE APPROACH FOR HISTORY-MATCHING PRODUCTION DATA

    Energy Technology Data Exchange (ETDEWEB)

    Yuandong Wang; Anthony R. Kovscek

    2001-06-01

    This study proposes and develops a streamline approach for inferring field-scale effective permeability distributions based on dynamic production data including producer water-cut curve, well pressures, and rates. The streamline-based inverse approach simplifies the history-matching process significantly. The basic idea is to relate the water-cut curve at a producer to the water breakthrough of individual streamlines. By adjusting the effective permeability along streamlines, the breakthrough time of each streamline is found that reproduces the reference producer fractional-flow curve. Then the permeability modification along each streamline is mapped onto cells of the simulation grid. Modifying effective permeability at the streamline level greatly reduces the size of the inverse problem compared to modifications at the grid-block level. The approach outlined here is relatively direct and rapid. Limitations include that the forward flow problem must be solvable with streamlines, streamline locations do not evolve radically during displacement, no new wells are included, and relatively noise-free production data is available. It works well for reservoirs where heterogeneity determines flow patterns. Example cases illustrate computational efficiency, generality, and robustness of the proposed procedure. Advantages and limitations of this work, and the scope of future study, are also discussed.

  9. FPGA-accelerated algorithm for the regular expression matching system

    Science.gov (United States)

    Russek, P.; Wiatr, K.

    2015-01-01

    This article describes an algorithm to support a regular expressions matching system. The goal was to achieve an attractive performance system with low energy consumption. The basic idea of the algorithm comes from a concept of the Bloom filter. It starts from the extraction of static sub-strings for strings of regular expressions. The algorithm is devised to gain from its decomposition into parts which are intended to be executed by custom hardware and the central processing unit (CPU). The pipelined custom processor architecture is proposed and a software algorithm explained accordingly. The software part of the algorithm was coded in C and runs on a processor from the ARM family. The hardware architecture was described in VHDL and implemented in field programmable gate array (FPGA). The performance results and required resources of the above experiments are given. An example of target application for the presented solution is computer and network security systems. The idea was tested on nearly 100,000 body-based viruses from the ClamAV virus database. The solution is intended for the emerging technology of clusters of low-energy computing nodes.

  10. Matched Weyl-Heisenberg expansions of nonstationary environments

    International Nuclear Information System (INIS)

    Kozek, W.

    1996-09-01

    This thesis is about various aspects of linear time-varying systems and nonstationary processes (together nonstationary environments). Such nonstationary environments play an important role in modern communication engineering, particularly as models for natural signals or time-varying communication channels. Emphasis is on time-frequency-parametrized representations of nonstationary environments, i.e., time-varying power spectra and time varying transfer functions. Introduction of the generalized Weyl correspondence enables a unified formulation of classical, so far seemingly disparate definitions like Priestley's evolutionary spectrum, the Wigner-Ville spectrum, Zadeh's time-varying transfer function (Kohn-Nirenberg symbol) and the Weyl symbol. Nonstationary Wiener filtering provides an illustrative example for the limited applicability of these time-frequency concepts to a straight forward generalization of frequency domain solutions. We introduce a fundamental classification into underspread/overspread environments based on characterizing the underlying linear operator by the essential support of its spreading function. For underspread environments it is shown that the time-frequency-parametrized representations get essentially definition-independent and can be used in the same manner as the frequency-parametrized representations of stationary environments. Combining the practical efficiency of time-frequency-parametrized representations with the theoretical optimality of a diagonalizing transform leads to window matching criteria for the short-time Fourier transform/ Gabor expansion (discrete/continuous Weyl-Heisenberg expansion) of signals and linear systems. (author)

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

  12. Robust point matching via vector field consensus.

    Science.gov (United States)

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

    2014-04-01

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

  13. Combining geometric matching with SVM to improve symbol spotting

    Science.gov (United States)

    Nayef, Nibal; Breuel, Thomas M.

    2013-01-01

    Symbol spotting is important for automatic interpretation of technical line drawings. Current spotting methods are not reliable enough for such tasks due to low precision rates. In this paper, we combine a geometric matching-based spotting method with an SVM classifier to improve the precision of the spotting. In symbol spotting, a query symbol is to be located within a line drawing. Candidate matches can be found, however, the found matches may be true or false. To distinguish a false match, an SVM classifier is used. The classifier is trained on true and false matches of a query symbol. The matches are represented as vectors that indicate the qualities of how well the query features are matched, those qualities are obtained via geometric matching. Using the classification, the precision of the spotting improved from an average of 76.6% to an average of 97.2% on a database of technical line drawings.

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

    Directory of Open Access Journals (Sweden)

    JI Shunping

    2016-02-01

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

  15. Testing Job Matching Services for Unemployed Educated Youth in Jordan

    OpenAIRE

    Matthew Groh; David McKenzie; Nour Shammout; Tara Vishwanath

    2014-01-01

    This note tests the extent to which search and matching frictions are the cause of high levels of unemployment for educated youth in Jordan, and whether a job matching service can reduce unemployment.

  16. Alternative confidence measure for local matching stereo algorithms

    CSIR Research Space (South Africa)

    Ndhlovu, T

    2009-11-01

    Full Text Available by analyzing the correlation curve produced during the matching process. The authors also test the confidence measure by developing an easily parallelized local matching algorithm, and use our confidence measure to filter out unreliable disparity estimates...

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

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

    OpenAIRE

    JI Shunping; YUAN Xiuxiao

    2016-01-01

    A matching method for high resolution satellite images based on RFM is presented.Firstly,the RFM parameters are used to predict the initial parallax of corresponding points and the prediction accuracy is analyzed.Secondly,the approximate epipolar equation is constructed based on projection tracking and its accuracy is analyzed.Thirdly,approximate 1D image matching is executed on pyramid images and least square matching on base images.At last RANSAC is imbedded to eliminate mis-matching points...

  19. Money creation in a random matching model

    OpenAIRE

    Alexei Deviatov

    2004-01-01

    I study money creation in versions of the Trejos-Wright (1995) and Shi (1995) models with indivisible money and individual holdings bounded at two units. I work with the same class of policies as in Deviatov and Wallace (2001), who study money creation in that model. However, I consider an alternative notion of implementability–the ex ante pairwise core. I compute a set of numerical examples to determine whether money creation is beneficial. I find beneficial e?ects of money creation if indiv...

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

    Science.gov (United States)

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

    2015-01-01

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

  1. Examples and problems in mathematical statistics

    CERN Document Server

    Zacks, Shelemyahu

    2013-01-01

    This book presents examples that illustrate the theory of mathematical statistics and details how to apply the methods for solving problems.  While other books on the topic contain problems and exercises, they do not focus on problem solving. This book fills an important niche in the statistical theory literature by providing a theory/example/problem approach.  Each chapter is divided into four parts: Part I provides the needed theory so readers can become familiar with the concepts, notations, and proven results; Part II presents examples from a variety of fields including engineering, mathem

  2. HTML5 web application development by example

    CERN Document Server

    Gustafson, JM

    2013-01-01

    The best way to learn anything is by doing. The author uses a friendly tone and fun examples to ensure that you learn the basics of application development. Once you have read this book, you should have the necessary skills to build your own applications.If you have no experience but want to learn how to create applications in HTML5, this book is the only help you'll need. Using practical examples, HTML5 Web Application Development by Example will develop your knowledge and confidence in application development.

  3. 78 FR 32711 - Privacy Act of 1974: Computer Matching Program

    Science.gov (United States)

    2013-05-31

    ... unearned income, and to adjust or terminate VA benefits, if appropriate. DATES: The match will start no... receiving needs-based VA benefits, with unearned income information maintained by IRS. VA will use this... recurring computer-matching program matching Internal Revenue Service (IRS) Federal tax information with VA...

  4. Can simple population genetic models reconcile partial match ...

    Indian Academy of Sciences (India)

    A recent study of partial matches in the Arizona offender database of DNA profiles has revealed a large number of nine and ten locus matches. I use simple models that incorporate the product rule, population substructure, and relatedness to predict the expected number of matches in large databases. I find that there is a ...

  5. Characterizing graphs of maximum matching width at most 2

    DEFF Research Database (Denmark)

    Jeong, Jisu; Ok, Seongmin; Suh, Geewon

    2017-01-01

    The maximum matching width is a width-parameter that is de ned on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is used as a cut-function. In this paper, we characterize the graphs of maximum matching width at most 2 using the minor...

  6. Exploiting Best-Match Equations for Efficient Reinforcement Learning

    NARCIS (Netherlands)

    van Seijen, Harm; Whiteson, Shimon; van Hasselt, Hado; Wiering, Marco

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

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

  8. PSOM2—partitioning-based scalable ontology matching using ...

    Indian Academy of Sciences (India)

    B Sathiya

    2017-11-16

    Nov 16, 2017 ... algorithms generally do not scale well due to the massive number of complex computations required to achieve matching. One of the methods used .... Even though several ontology matching systems exist, there are only very few matching ...... in Computational Intelligence, vol. 292, pp. 251–269. [12] Hanif ...

  9. 7 CFR 210.17 - Matching Federal funds.

    Science.gov (United States)

    2010-01-01

    ... individual school food authorities. (f) Failure to match. If, in any school year, a State fails to meet the... AGRICULTURE CHILD NUTRITION PROGRAMS NATIONAL SCHOOL LUNCH PROGRAM Requirements for State Agency Participation § 210.17 Matching Federal funds. (a) State revenue matching. For each school year, the amount of State...

  10. PowerMatching City : A unique smart grid project

    NARCIS (Netherlands)

    dr. C.J. Wiekens

    2014-01-01

    In this presentation, the smart grid project 'PowerMatching City' is introduced. PowerMatching City is a living lab demonstration of the future energy system. In PowerMatching City the connected households are equipped with a mix of decentralized energy sources, hybrid heat pumps, smart appliances,

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

  12. Identity Matching of Consonant-Vowel-Consonant Words by Prereaders.

    Science.gov (United States)

    Saunders, Kathryn J.; Johnston, Mark D.; Brady, Nancy C.

    2000-01-01

    Using an identify matching-to-sample procedure, three typical prereaders who matched individual letters with high accuracy did not show high accuracy in matching three-letter printed words that differed only in the first letter. Teachers cautioned against assuming the children who can discriminate between individual letters can also discriminate…

  13. Football match spectator sound exposure and effect on hearing: A ...

    African Journals Online (AJOL)

    This was a one-group pretest–post-test design of football spectators attending a premier soccer league match at a designated FIFA 2010 training stadium in Gauteng, South Africa. Individual spectator noise exposure for the duration of the football match and post-match changes in hearing thresholds were measured with ...

  14. Pooling Objects for Recognizing Scenes without Examples

    NARCIS (Netherlands)

    Kordumova, S.; Mensink, T.; Snoek, C.G.M.

    2016-01-01

    In this paper we aim to recognize scenes in images without using any scene images as training data. Different from attribute based approaches, we do not carefully select the training classes to match the unseen scene classes. Instead, we propose a pooling over ten thousand of off-the-shelf object

  15. Consumer Social Responsibility: Example of Cycling Service

    Directory of Open Access Journals (Sweden)

    Jesevičiūtė-Ufartienė Laima

    2017-12-01

    Full Text Available The article presents research on consumer social responsibility based on the example of cycling service. The author analyses the tourism sector determining a relation between socially responsible behaviour of an organization and consumer behaviour.

  16. Tribal Green Building Administrative Code Example

    Science.gov (United States)

    This Tribal Green Building Administrative Code Example can be used as a template for technical code selection (i.e., building, electrical, plumbing, etc.) to be adopted as a comprehensive building code.

  17. Didaktikogenic Misconception in Physics: An Example

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 21; Issue 4. Didaktikogenic Misconception in Physics: An Example. Dhrubajyoti Chattopadhyay. Classroom Volume 21 Issue 4 April 2016 pp 381-386. Fulltext. Click here to view fulltext PDF. Permanent link:

  18. An Elegant Example of Chemoselective Reaction

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 13; Issue 10. An Elegant Example of a Chemoselective Reaction - The Preparation of Sulfonamide Drugs. Gopalpur Nagendrappa. General Article Volume 13 Issue 10 October ... Keywords. Chemoselectivity; sulfa drugs; sulfonamides; amide hydrolysis.

  19. When greediness fails: examples from stochastic scheduling

    NARCIS (Netherlands)

    Uetz, Marc Jochen

    2003-01-01

    The purpose of this paper is to present examples for the sometimes surprisingly different behavior of deterministic and stochastic scheduling problems. In particular, it demonstrates some seemingly counterintuitive properties of optimal scheduling policies for stochastic machine scheduling problems.

  20. Example sentences in bilingual specialised dictionaries assisting ...

    African Journals Online (AJOL)

    Keywords: Specialised lexicography, online dictionaries, printed dictionaries, technical dictionaries, specialised communication, examples, lexicographical functions, text production, user needs, writing, translation. Voorbeeldsinne in tweetalige vakwoordeboeke help met kommunikasie in 'n vreemde taal. Praktisyns ...

  1. Analysis of match-related information seeking behaviour during the act of watching football matches on TV

    OpenAIRE

    Sezen, Ege

    2014-01-01

    This paper presents a study that investigates how, when, why people seek football match-related information via their second screens when they watch football matches on Television (TV). The study focuses on the type of match-related information that TV football audience seek during their act of football match viewing and whether this info seeking activity improves their TV experience in that context. In addition, triangulating the ideal second experience of the aforementioned group is another...

  2. California scrub-jays reduce visual cues available to potential pilferers by matching food colour to caching substrate.

    Science.gov (United States)

    Kelley, Laura A; Clayton, Nicola S

    2017-07-01

    Some animals hide food to consume later; however, these caches are susceptible to theft by conspecifics and heterospecifics. Caching animals can use protective strategies to minimize sensory cues available to potential pilferers, such as caching in shaded areas and in quiet substrate. Background matching (where object patterning matches the visual background) is commonly seen in prey animals to reduce conspicuousness, and caching animals may also use this tactic to hide caches, for example, by hiding coloured food in a similar coloured substrate. We tested whether California scrub-jays ( Aphelocoma californica ) camouflage their food in this way by offering them caching substrates that either matched or did not match the colour of food available for caching. We also determined whether this caching behaviour was sensitive to social context by allowing the birds to cache when a conspecific potential pilferer could be both heard and seen (acoustic and visual cues present), or unseen (acoustic cues only). When caching events could be both heard and seen by a potential pilferer, birds cached randomly in matching and non-matching substrates. However, they preferentially hid food in the substrate that matched the food colour when only acoustic cues were present. This is a novel cache protection strategy that also appears to be sensitive to social context. We conclude that studies of cache protection strategies should consider the perceptual capabilities of the cacher and potential pilferers. © 2017 The Author(s).

  3. Some illustrative examples of model uncertainty

    International Nuclear Information System (INIS)

    Bier, V.M.

    1994-01-01

    In this paper, we first discuss the view of model uncertainty proposed by Apostolakis. We then present several illustrative examples related to model uncertainty, some of which are not well handled by this formalism. Thus, Apostolakis' approach seems to be well suited to describing some types of model uncertainty, but not all. Since a comprehensive approach for characterizing and quantifying model uncertainty is not yet available, it is hoped that the examples presented here will service as a springboard for further discussion

  4. Bridge Design to Eurocodes – Worked examples

    OpenAIRE

    BOUASSIDA Yorsa; BOUCHON Emmanuel; CRESPO Pilar; CROCE Pietro; DAVAINE Laurence; DENTON Steve; FELDMANN Markus; FRANK Roger; HANSWILLE Gerhard; HENSEN Wolfang; KOLIAS Basil; MALAKATAS Nikolaos; MANCINI Giuseppe; ORTEGA CORNEJO Miguel; SEDLACEK Gerhard

    2011-01-01

    This document is a Technical Report with worked examples for a bridge structure designed following the Eurocodes. It summarizes important points of the Eurocodes for the design of concrete, steel and composite road bridges, including foundations and seismic design, utilizing a common bridge project as a basis. The geometry and materials of the example bridge as well as the main assumptions and the detailed structural calculations are presented in the first chapter of the report. Each of ...

  5. Killer "Killer Examples" for Design Patterns

    DEFF Research Database (Denmark)

    Caspersen, Michael Edelgaard; Alphonce, Carl; Decker, Adrienne

    2007-01-01

    Giving students an appreciation of the benefits of using design patterns and an ability to use them effectively in developing code presents several interesting pedagogical challenges. This paper discusses pedagogical lessons learned at the "Killer Examples" for Design Patterns and Objects First...... series of workshops held at the Object Oriented Programming, Systems, Languages and Applications (OOPSLA) conference over the past four years. It also showcases three "killer examples" which can be used to support the teaching of design patterns....

  6. An accurate algorithm to match imperfectly matched images for lung tumor detection without markers.

    Science.gov (United States)

    Rozario, Timothy; Bereg, Sergey; Yan, Yulong; Chiu, Tsuicheng; Liu, Honghuan; Kearney, Vasant; Jiang, Lan; Mao, Weihua

    2015-05-08

    In order to locate lung tumors on kV projection images without internal markers, digitally reconstructed radiographs (DRRs) are created and compared with projection images. However, lung tumors always move due to respiration and their locations change on projection images while they are static on DRRs. In addition, global image intensity discrepancies exist between DRRs and projections due to their different image orientations, scattering, and noises. This adversely affects comparison accuracy. A simple but efficient comparison algorithm is reported to match imperfectly matched projection images and DRRs. The kV projection images were matched with different DRRs in two steps. Preprocessing was performed in advance to generate two sets of DRRs. The tumors were removed from the planning 3D CT for a single phase of planning 4D CT images using planning contours of tumors. DRRs of background and DRRs of tumors were generated separately for every projection angle. The first step was to match projection images with DRRs of background signals. This method divided global images into a matrix of small tiles and similarities were evaluated by calculating normalized cross-correlation (NCC) between corresponding tiles on projections and DRRs. The tile configuration (tile locations) was automatically optimized to keep the tumor within a single projection tile that had a bad matching with the corresponding DRR tile. A pixel-based linear transformation was determined by linear interpolations of tile transformation results obtained during tile matching. The background DRRs were transformed to the projection image level and subtracted from it. The resulting subtracted image now contained only the tumor. The second step was to register DRRs of tumors to the subtracted image to locate the tumor. This method was successfully applied to kV fluoro images (about 1000 images) acquired on a Vero (BrainLAB) for dynamic tumor tracking on phantom studies. Radiation opaque markers were

  7. Match analysis on no-gi Brazilian jiu-jitsu

    OpenAIRE

    Simola, Tuomas

    2017-01-01

    Gi and no-gi Brazilian jiu-jitsu are fast growing sports. The aim of this thesis is to conclude a match analysis on no-gi Brazilian jiu-jitsu. Match analysis is used to identify the most used techniques in no-gi Brazilian jiu-jitsu. There is no sport analysis done for either gi or no-gi Brazilian jiu-jitsu, therefore the match analysis and its results can be utilized later as a base for sport analysis. The goal of this study is to find out the match duration, the type of match ending, the...

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

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

  10. 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. © 2016 American Heart Association, Inc.

  11. A matched filter hypothesis for cognitive control.

    Science.gov (United States)

    Chrysikou, Evangelia G; Weber, Matthew J; Thompson-Schill, Sharon L

    2014-09-01

    The prefrontal cortex exerts top-down influences on several aspects of higher-order cognition by functioning as a filtering mechanism that biases bottom-up sensory information toward a response that is optimal in context. However, research also indicates that not all aspects of complex cognition benefit from prefrontal regulation. Here we review and synthesize this research with an emphasis on the domains of learning and creative cognition, and outline how the appropriate level of cognitive control in a given situation can vary depending on the organism's goals and the characteristics of the given task. We offer a matched filter hypothesis for cognitive control, which proposes that the optimal level of cognitive control is task-dependent, with high levels of cognitive control best suited to tasks that are explicit, rule-based, verbal or abstract, and can be accomplished given the capacity limits of working memory and with low levels of cognitive control best suited to tasks that are implicit, reward-based, non-verbal or intuitive, and which can be accomplished irrespective of working memory limitations. Our approach promotes a view of cognitive control as a tool adapted to a subset of common challenges, rather than an all-purpose optimization system suited to every problem the organism might encounter. © 2013 Published by Elsevier Ltd.

  12. The Galaxy Clustering Crisis in Abundance Matching

    Science.gov (United States)

    Campbell, Duncan; van den Bosch, Frank C.; Padmanabhan, Nikhil; Mao, Yao-Yuan; Zentner, Andrew R.; Lange, Johannes U.; Jiang, Fangzhou; Villarreal, Antonio

    2018-02-01

    Galaxy clustering on small scales is significantly under-predicted by sub-halo abundance matching (SHAM) models that populate (sub-)haloes with galaxies based on peak halo mass, Mpeak. SHAM models based on the peak maximum circular velocity, Vpeak, have had much better success. The primary reason Mpeak based models fail is the relatively low abundance of satellite galaxies produced in these models compared to those based on Vpeak. Despite success in predicting clustering, a simple Vpeak based SHAM model results in predictions for galaxy growth that are at odds with observations. We evaluate three possible remedies that could "save" mass-based SHAM: (1) SHAM models require a significant population of "orphan" galaxies as a result of artificial disruption/merging of sub-haloes in modern high resolution dark matter simulations; (2) satellites must grow significantly after their accretion; and (3) stellar mass is significantly affected by halo assembly history. No solution is entirely satisfactory. However, regardless of the particulars, we show that popular SHAM models based on Mpeak cannot be complete physical models as presented. Either Vpeak truly is a better predictor of stellar mass at z ˜ 0 and it remains to be seen how the correlation between stellar mass and Vpeak comes about, or SHAM models are missing vital component(s) that significantly affect galaxy clustering.

  13. MatchIt: Nonparametric Preprocessing for Parametric Causal Inference

    Directory of Open Access Journals (Sweden)

    Daniel Ho

    2011-08-01

    Full Text Available MatchIt implements the suggestions of Ho, Imai, King, and Stuart (2007 for improving parametric statistical models by preprocessing data with nonparametric matching methods. MatchIt implements a wide range of sophisticated matching methods, making it possible to greatly reduce the dependence of causal inferences on hard-to-justify, but commonly made, statistical modeling assumptions. The software also easily fits into existing research practices since, after preprocessing data with MatchIt, researchers can use whatever parametric model they would have used without MatchIt, but produce inferences with substantially more robustness and less sensitivity to modeling assumptions. MatchIt is an R program, and also works seamlessly with Zelig.

  14. Application of TXRF for ion implanter dose matching experiments

    Science.gov (United States)

    Frost, M. R.; French, M.; Harris, W.

    2004-06-01

    Secondary ion mass spectrometry (SIMS) has been utilized for many years to measure the dose of ion implants in silicon for the purpose of verifying the ability of ion implantation equipment to accurately and reproducibly implant the desired species at the target dose. The development of statistically and instrumentally rigorous protocols has lead to high confidence levels, particularly with regard to accuracy and short-term repeatability. For example, high-dose, high-energy B implant dosimetry can be targeted to within ±1%. However, performing dose determination experiments using SIMS does have undesirable aspects, such as being highly labor intensive and sample destructive. Modern total reflection X-ray fluorescence (TXRF) instruments are equipped with capabilities for full 300 mm wafer handling, automated data acquisition software and intense X-ray sources. These attributes enable the technique to overcome the SIMS disadvantages listed above, as well as provide unique strengths that make it potentially highly amenable to implanter dose matching. In this paper, we report on data collected to date that provides confidence that TXRF is an effective and economical method to perform these measurements within certain limitations. We have investigated a number of ion implanted species that are within the "envelope" of TXRF application. This envelope is defined by a few important parameters. Species: For the anode materials used in the more common X-ray sources on the market, each has its own set of elements that can be detected. We have investigated W and Mo X-ray sources, which are the most common in use in commercial instrumentation. Implant energy: In general, if the energy of the implanted species is too high (or more specifically, the distribution of the implanted species is too deep), the amount of dopant not detected by TXRF may be significant, increasing the error of the measurement. Therefore, for each species investigated, the implant energy cannot exceed a

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

    ... Privacy Act regarding protections for such individuals. The Privacy Act, as amended, regulates the use of... Federally- facilitated Exchange, and by State-based Exchanges that will receive the results of verifications... MATCHING PROGRAM: System of Records Maintained by CMS The matching program will be conducted with data...

  16. Influence of the Substrate Properties on the Offset Printing ink Colour Matching

    Directory of Open Access Journals (Sweden)

    Anne Blayo

    2003-07-01

    Full Text Available The printing industry has been using computerised ink colour matching for a long time. The problem of ink formulation is to match a given standard colour with only three or four inks from a basis of about twelve inks.This is generally achieved by calculations based on the well-known Kubelka-Munk turbid media theory, which gives excellent results in many industrial situations. However, some hypotheses are necessary to apply the Kubelka-Munk model and corrections to the measured reflectance are often required (Saunderson’s correction coefficients, for example.One limitation in the resolution of this method of formulation may arise from the fact that the characterisation of the basic inks is made on one standard substrate, which may differ a lot from the real printing substrate.The aim of this work is precisely to study the contribution of the substrate to the colour matching procedure. The properties of the substrate which intervene in the process are physical properties (thickness, absorbency… and optical properties (brightness and gloss. Five different papers were chosen to make the characterisations of the basic offset inks. The reflectance measurements were performed with spectrophotometer X-Rite with the D/0° geometry, specular excluded or included, coupled with a coloured matching software (X-Rite Inkmaster. A special emphasis was put on the influence on the calculation of the ink film thickness, estimated for the different substrates, and on the choice of the correction coefficients for the Kubelka-Munk theory.

  17. The effect of match standard and referee experience on the objective and subjective match workload of English Premier League referees.

    Science.gov (United States)

    Weston, M; Bird, S; Helsen, W; Nevill, A; Castagna, C

    2006-06-01

    The aim of the present study was to examine the effect of match standard and referee experience on the objective and subjective workload of referees during English Premier League and Football League soccer matches. We also examined the relationship between heart rate (HR) and ratings of perceived exertion (RPE) for assessing match intensity in soccer referees. Heart rate responses were recorded using short-range telemetry and RPE scores were collected using a 10-point scale. Analysis revealed a significant relationship between mean match HR and match RPE scores (r=0.485, pFootball League 81.5+/-2.2%HRmax, pFootball League 6.9+/-0.8, pReferee experience had no effect on match HR and RPE responses to Premier League and Football League matches. The results of the present study demonstrate the validity of using HR and RPE as a measure of global match intensity in soccer referees. Referee experience had no effect on the referees' objective and subjective match workload assessments, whereas match intensity was correlated to competition standard. These findings have implications for fitness preparation and evaluation in soccer referees. When progressing to a higher level of competition, referees should ensure that appropriate levels of fitness are developed in order to enable them to cope with an increase in physical match demands.

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

  19. Examples from Astronomy for High School Physics

    Science.gov (United States)

    Dieterich, Sergio

    2016-01-01

    A formal course in physics is increasingly becoming a standard requirement in the high school curriculum. With that dissemination comes the challenge of reaching and motivating a population that is more diverse in their academic abilities and intrinsic motivation. The abstract nature of pure physics is often made more accessible when motivated by examples from everyday life, and providing copious mathematical as well as conceptual examples has become standard practice in high school physics textbooks. Astronomy is a naturally captivating subject and astronomical examples are often successful in capturing the curiosity of high school students as well as the general population. This project seeks to diversify the range of pedagogical materials available to the high school physics instructor by compiling and publishing specific examples where an astronomical concept can be used to motivate the physics curriculum. This collection of examples will consist of both short problems suitable for daily homework assignments as well as longer project style activities. Collaborations are encouraged and inquiries should be directed to sdieterich at carnegiescience dot edu.This work is funded by the NSF Astronomy and Astrophysics Postdoctoral Fellowship Program through NSF grant AST-1400680.

  20. Multicomponent isotope separation in matched abundance ratio cascades composed of stages with large separation factors

    International Nuclear Information System (INIS)

    Von Halle, E.

    1987-06-01

    The concept of the matched abundance ratio cascade and the system of equations for performing multicomponent productivity calculations upon them has proven extremely useful for analyzing the behavior of gaseous diffusion plants in which the stage separation factors are very nearly equal to unity. Recent interest in the gas centrifuge process, in which the separation factor of a single centrifuge can be relatively large, makes desirable the extension of the theory of the matched abundance ratio cascade to cascades composed of stages with large separation factors. Equations permit the calculation of the productivity for simple cascades composed of stages with large separation factors. The concentration gradient of each of the isotopic species present can be calculated and the cascade description can be determined. An illustrative example dealing with the separation of the isotopes of tungsten in a cascade composed of gas centrifuges is included

  1. Automation of NLO processes and decays and POWHEG matching in WHIZARD

    International Nuclear Information System (INIS)

    Reuter, Jürgen; Chokoufé, Bijan; Weiss, Christian; Hoang, André; Kilian, Wolfgang; Stahlhofen, Maximilian; Teubner, Thomas

    2016-01-01

    We give a status report on the automation of next-to-leading order processes within the Monte Carlo event generator WHIZARD, using GoSam and OpenLoops as provider for one- loop matrix elements. To deal with divergences, WHIZARD uses automated FKS subtraction, and the phase space for singular regions is generated automatically. NLO examples for both scattering and decay processes with a focus on e + e - processes are shown. Also, first NLO- studies of observables for collisions of polarized leptons beams, e.g. at the ILC, will be presented. Furthermore, the automatic matching of the fixed-order NLO amplitudes with emissions from the parton shower within the Powheg formalism inside WHIZARD will be discussed. We also present results for top pairs at threshold in lepton collisions, including matching between a resummed threshold calculation and fixed-order NLO. This allows the investigation of more exclusive differential observables. (paper)

  2. MATCH package for the ANL three-view geometry program

    International Nuclear Information System (INIS)

    Gieraltowski, G.F.

    1976-02-01

    The ANL MATCH package consists of a set of 13 subroutines which are linked to the current 12-foot and 15-foot versions of the ANL TVGP program. Their purpose is to match the tracks from the various measured views to obtain a proper matched set of tracks to be processed by TVGP. The MATCH package can effectively handle up to 20 tracks per event measured in 2 or 3 views and, in cases of ambiguous match solutions, allow up to 10 match ambiguities. A basic assumption made is that the same number of tracks is measured in each view. MATCH can work in either two or three measured views with the assumption that, if only two views are measured, the last point measured on each track is a good representation of the true end-point of the track. This is not to say that, if this assumption is false, that MATCH cannot obtain a match solution. It is true, however, that the probability of obtaining a match solution is inversely proportional both to the number of tracks per vertex and to the momentum of the tracks. Current uses of MATCH are in obtaining match solutions for two-view K - p (6.5 GeV/c) events measured on POLLY III and in obtaining match solutions for events with large numbers of tracks (3 to 10) produced by an anti ν p interaction in the FNAL 15-foot bubble chamber with a spectrum of momentum values ranging from 5 to 25 Gev/c

  3. Material and process selection using product examples

    DEFF Research Database (Denmark)

    Lenau, Torben Anker

    2002-01-01

    The objective of the paper is to suggest a different procedure for selecting materials and processes within the product development work. The procedure includes using product examples in order to increase the number of alternative materials and processes that is considered. Product examples can...... communicate information about materials and processes in a very concentrated and effective way. The product examples represent desired material properties but also includes information that can not be associated directly to the material, e.g. functional or perceived attributes. Previous studies suggest...... that designers often limit their selection of materials and processes to a few well-known ones. Designers need to expand the solution space by considering more materials and processes. But they have to be convinced that the materials and processes are likely candidates that are worth investing time in exploring...

  4. Material and process selection using product examples

    DEFF Research Database (Denmark)

    Lenau, Torben Anker

    2001-01-01

    The objective of the paper is to suggest a different procedure for selecting materials and processes within the product development work. The procedure includes using product examples in order to increase the number of alternative materials and processes that is considered. Product examples can...... communicate information about materials and processes in a very concentrated and effective way. The product examples represent desired material properties but also includes information that can not be associated directly to the material, e.g. functional or perceived attributes. Previous studies suggest...... that designers often limit their selection of materials and processes to a few well-known ones. Designers need to expand the solution space by considering more materials and processes. But they have to be convinced that the materials and processes are likely candidates that are worth investing time in exploring...

  5. An Investigation of the Complexities of Successful and Unsuccessful Guide Dog Matching and Partnerships

    Science.gov (United States)

    Lloyd, Janice; Budge, Claire; La Grow, Steve; Stafford, Kevin

    2016-01-01

    Matching a person who is blind or visually impaired with a guide dog is a process of finding the most suitable guide dog available for that individual. Not all guide dog partnerships are successful, and the consequences of an unsuccessful partnership may result in reduced mobility and quality of life for the handler (owner), and are costly in time and resources for guide dog training establishments. This study examined 50 peoples’ partnerships with one or more dogs (118 pairings) to ascertain the outcome of the relationship. Forty-three of the 118 dogs were returned to the guide dog training establishment before reaching retirement age, with the majority (n = 40) being categorized as having dog-related issues. Most (n = 26) of these dogs’ issues were classified as being behavioral in character, including work-related and non-work-related behavior, and 14 were due to physical causes (mainly poor health). Three dogs were returned due to matters relating to the handlers’ behavior. More second dogs were returned than the handlers’ first or third dogs, and dogs that had been previously used as a guide could be rematched successfully. Defining matching success is not clear-cut. Not all dogs that were returned were considered by their handlers to have been mismatched, and not all dogs retained until retirement were thought to have been good matches, suggesting that some handlers were retaining what they considered to be a poorly matched dog. Almost all the handlers who regarded a dog as being mismatched conceded that some aspects of the match were good. For example, a dog deemed mismatched for poor working behavior may have shown good home and/or other social behaviors. The same principle was true for successful matches, where few handlers claimed to have had a perfect dog. It is hoped that these results may help the guide dog industry identify important aspects of the matching process, and/or be used to identify areas where a matching problem exists. PMID

  6. Pengenalan Angka Pada Sistem Operasi Android Dengan Menggunakan Metode Template Matching

    Directory of Open Access Journals (Sweden)

    Abdi Pandu Kusuma

    2016-07-01

    input image with the image of the template. Template matching results are calculated from the number of points in the input image corresponding to the image of the template. Templates are provided in the database to provide an example of how to write a pattern of numbers. Tests performed on the application as much as 40 times with different patterns. From the test results obtained percentage of success of these applications reached 75.75%.Key word: Early age, playing, study,Template Matching.

  7. An Investigation of the Complexities of Successful and Unsuccessful Guide Dog Matching and Partnerships.

    Science.gov (United States)

    Lloyd, Janice; Budge, Claire; La Grow, Steve; Stafford, Kevin

    2016-01-01

    Matching a person who is blind or visually impaired with a guide dog is a process of finding the most suitable guide dog available for that individual. Not all guide dog partnerships are successful, and the consequences of an unsuccessful partnership may result in reduced mobility and quality of life for the handler (owner), and are costly in time and resources for guide dog training establishments. This study examined 50 peoples' partnerships with one or more dogs (118 pairings) to ascertain the outcome of the relationship. Forty-three of the 118 dogs were returned to the guide dog training establishment before reaching retirement age, with the majority ( n  = 40) being categorized as having dog-related issues. Most ( n  = 26) of these dogs' issues were classified as being behavioral in character, including work-related and non-work-related behavior, and 14 were due to physical causes (mainly poor health). Three dogs were returned due to matters relating to the handlers' behavior. More second dogs were returned than the handlers' first or third dogs, and dogs that had been previously used as a guide could be rematched successfully. Defining matching success is not clear-cut. Not all dogs that were returned were considered by their handlers to have been mismatched, and not all dogs retained until retirement were thought to have been good matches, suggesting that some handlers were retaining what they considered to be a poorly matched dog. Almost all the handlers who regarded a dog as being mismatched conceded that some aspects of the match were good. For example, a dog deemed mismatched for poor working behavior may have shown good home and/or other social behaviors. The same principle was true for successful matches, where few handlers claimed to have had a perfect dog. It is hoped that these results may help the guide dog industry identify important aspects of the matching process, and/or be used to identify areas where a matching problem exists.

  8. HANDBOOK OF SOCCER MATCH ANALYSIS: A SYSTEMATIC APPROACH TO IMPROVING PERFORMANCE

    Directory of Open Access Journals (Sweden)

    Christopher Carling

    2006-03-01

    Analysis Tells Us about Successful Strategy and Tactics in Soccer, 8. From Technical and Tactical Performance Analysis to Training Drills, 9. The Future of Soccer Match Analysis. ASSESSMENT The authors have assembled an essential reading for all who are interested in understanding and doing better coaching and improving the performance in soccer. To this purpose, there is a strong practical approach in the book by giving plenty of examples along with a satisfactory scientific analysis of the subject area. It is concise and well organized in its presentation, creating an effective textbook. I believe, therefore, the book will serve as a first-rate teaching tool and reference for coaches, athletes and professionals in the human performance sciences.

  9. Active learning techniques for librarians practical examples

    CERN Document Server

    Walsh, Andrew

    2010-01-01

    A practical work outlining the theory and practice of using active learning techniques in library settings. It explains the theory of active learning and argues for its importance in our teaching and is illustrated using a large number of examples of techniques that can be easily transferred and used in teaching library and information skills to a range of learners within all library sectors. These practical examples recognise that for most of us involved in teaching library and information skills the one off session is the norm, so we need techniques that allow us to quickly grab and hold our

  10. Multiple factor analysis by example using R

    CERN Document Server

    Pagès, Jérôme

    2014-01-01

    Multiple factor analysis (MFA) enables users to analyze tables of individuals and variables in which the variables are structured into quantitative, qualitative, or mixed groups. Written by the co-developer of this methodology, Multiple Factor Analysis by Example Using R brings together the theoretical and methodological aspects of MFA. It also includes examples of applications and details of how to implement MFA using an R package (FactoMineR).The first two chapters cover the basic factorial analysis methods of principal component analysis (PCA) and multiple correspondence analysis (MCA). The

  11. Eclipse plugin development by example beginner's guide

    CERN Document Server

    Blewitt, Alex

    2013-01-01

    A Beginner's Guide following the ""by Example"" approach. There will be 5-8 major examples that will be used in the book to develop advanced plugins with the Eclipse IDE.This book is for Java developers who are familiar with Eclipse as a Java IDE and are interested in learning how to develop plug-ins for Eclipse. No prior knowledge of Eclipse plug-in development or OSGi is necessary, although you are expected to know how to create, run, and debug Java programs in Eclipse.

  12. Worked examples in engineering field theory

    CERN Document Server

    Fuller, A J Baden

    1976-01-01

    Worked Examples in Engineering Field Theory is a product of a lecture course given by the author to first-year students in the Department of Engineering in the University of Leicester. The book presents a summary of field theory together with a large number of worked examples and solutions to all problems given in the author's other book, Engineering Field Theory. The 14 chapters of this book are organized into two parts. Part I focuses on the concept of flux including electric flux. This part also tackles the application of the theory in gravitation, ideal fluid flow, and magnetism. Part II d

  13. NESSIE: Network Example Source Supporting Innovative Experimentation

    Science.gov (United States)

    Taylor, Alan; Higham, Desmond J.

    We describe a new web-based facility that makes available some realistic examples of complex networks. NESSIE (Network Example Source Supporting Innovative Experimentation) currently contains 12 specific networks from a diverse range of application areas, with a Scottish emphasis. This collection of data sets is designed to be useful for researchers in network science who wish to evaluate new algorithms, concepts and models. The data sets are available to download in two formats (MATLAB's .mat format and .txt files readable by packages such as Pajek), and some basic MATLAB tools for computing summary statistics are also provided.

  14. Mathematics and fisheries: Match or mismatch?

    Directory of Open Access Journals (Sweden)

    Jon T. Schnute

    2005-04-01

    Full Text Available Mathematics plays a major role in contemporary fisheries management. Stock assessments often depend on elaborate models used to set catch levels and address other policy objectives. In recent years, the collapse of various important fish stocks has caused some critics to suggest that mathematical models actually obscure the truth by narrowing scientific understanding to the realm of quantifiable events. In the words of one fisherman, ``Mathematics has highjacked the definition and position of real science.'' In this paper, I present a number of typical fishery models, examine their limitations, discuss controversies about their use, and explore possible alternatives. I draw on examples from economics and investment theory to illustrate the problem of making credible predictions about an uncertain future. The constraints of the real world, where people care deeply about policy consequences, have altered my scientific perspective as an applied mathematician. This paper reflects the evolution of thought that has accompanied my experience working for 28 years at the Pacific Biological Station in Nanaimo, B.C., the host city for this conference.

  15. Fuzzy based finger vein recognition with rotation invariant feature matching

    Science.gov (United States)

    Ezhilmaran, D.; Joseph, Rose Bindu

    2017-11-01

    Finger vein recognition is a promising biometric with commercial applications which is explored widely in the recent years. In this paper, a finger vein recognition system is proposed using rotation invariant feature descriptors for matching after enhancing the finger vein images with an interval type-2 fuzzy method. SIFT features are extracted and matched using a matching score based on Euclidian distance. Rotation invariance of the proposed method is verified in the experiment and the results are compared with SURF matching and minutiae matching. It is seen that rotation invariance is verified and the poor quality issues are solved efficiently with the designed system of finger vein recognition during the analysis. The experiments underlines the robustness and reliability of the interval type-2 fuzzy enhancement and SIFT feature matching.

  16. Selection method of terrain matching area for TERCOM algorithm

    Science.gov (United States)

    Zhang, Qieqie; Zhao, Long

    2017-10-01

    The performance of terrain aided navigation is closely related to the selection of terrain matching area. The different matching algorithms have different adaptability to terrain. This paper mainly studies the adaptability to terrain of TERCOM algorithm, analyze the relation between terrain feature and terrain characteristic parameters by qualitative and quantitative methods, and then research the relation between matching probability and terrain characteristic parameters by the Monte Carlo method. After that, we propose a selection method of terrain matching area for TERCOM algorithm, and verify the method correctness with real terrain data by simulation experiment. Experimental results show that the matching area obtained by the method in this paper has the good navigation performance and the matching probability of TERCOM algorithm is great than 90%

  17. Realization of matching conditions for high-resolution spectrometers

    International Nuclear Information System (INIS)

    Fujita, H.; Fujita, Y.; Berg, G.P.A.; Bacher, A.D.; Foster, C.C.; Hara, K.; Hatanaka, K.; Kawabata, T.; Noro, T.; Sakaguchi, H.; Shimbara, Y.; Shinada, T.; Stephenson, E.J.; Ueno, H.; Yosoi, M.

    2002-01-01

    For precise measurements of nuclear-reaction spectra using a beam from an accelerator, a high-resolution magnetic spectrometer is a powerful tool. The full capability of a magnetic spectrometer, however, can be achieved only if the characteristics of the beam coming from the accelerator are matched to those required by the spectrometer by properly adjusting the beam line conditions. The matching methods, lateral dispersion matching, focus matching and also the kinematic correction compensate the spectrum line-broadening effects caused by the beam momentum spread and reaction kinematics. In addition, angular dispersion matching should be performed if good resolution of the scattering angle is important. Diagnostic methods developed to realize these matching conditions for the spectrometers K600 at IUCF and Grand Raiden at RCNP are presented

  18. Indonesian name matching using machine learning supervised approach

    Science.gov (United States)

    Alifikri, Mohamad; Arif Bijaksana, Moch.

    2018-03-01

    Most existing name matching methods are developed for English language and so they cover the characteristics of this language. Up to this moment, there is no specific one has been designed and implemented for Indonesian names. The purpose of this thesis is to develop Indonesian name matching dataset as a contribution to academic research and to propose suitable feature set by utilizing combination of context of name strings and its permute-winkler score. Machine learning classification algorithms is taken as the method for performing name matching. Based on the experiments, by using tuned Random Forest algorithm and proposed features, there is an improvement of matching performance by approximately 1.7% and it is able to reduce until 70% misclassification result of the state of the arts methods. This improving performance makes the matching system more effective and reduces the risk of misclassified matches.

  19. Realization of matching conditions for high-resolution spectrometers

    CERN Document Server

    Fujita, H; Berg, G P A; Bacher, A D; Foster, C C; Hara, K; Hatanaka, K; Kawabata, T; Noro, T; Sakaguchi, H; Shimbara, Y; Shinada, T; Stephenson, E J; Ueno, H; Yosoi, M

    2002-01-01

    For precise measurements of nuclear-reaction spectra using a beam from an accelerator, a high-resolution magnetic spectrometer is a powerful tool. The full capability of a magnetic spectrometer, however, can be achieved only if the characteristics of the beam coming from the accelerator are matched to those required by the spectrometer by properly adjusting the beam line conditions. The matching methods, lateral dispersion matching, focus matching and also the kinematic correction compensate the spectrum line-broadening effects caused by the beam momentum spread and reaction kinematics. In addition, angular dispersion matching should be performed if good resolution of the scattering angle is important. Diagnostic methods developed to realize these matching conditions for the spectrometers K600 at IUCF and Grand Raiden at RCNP are presented.

  20. Analysis of fatigue development during elite male handball matches

    DEFF Research Database (Denmark)

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

    2014-01-01

    This study aimed at describing the physiological demands and fatigue development during elite male handball matches. Our hypothesis was that players perform multiple high-intensity activities during periods of the game and develop temporary and end-match neuromuscular fatigue. Time-motion analyse...... lactate during the match was 3.6±2.1 (1.3-8.6) mM. Plasma FFA, glycerol, glucose and uric acid increased (p...

  1. NCI-MATCH Trial Links Targeted Drugs to Mutations

    Science.gov (United States)

    Investigators for the nationwide trial, NCI-MATCH: Molecular Analysis for Therapy Choice, announced that the trial will seek to determine whether targeted therapies for people whose tumors have specific gene mutations will be effective regardless of their cancer type. NCI-MATCH will incorporate more than 20 different study drugs or drug combinations, each targeting a specific gene mutation, in order to match each patient in the trial with a therapy that targets a molecular abnormality in their tumor.

  2. Sleep patterns and match performance in elite Australian basketball athletes.

    Science.gov (United States)

    Staunton, Craig; Gordon, Brett; Custovic, Edhem; Stanger, Jonathan; Kingsley, Michael

    2017-08-01

    To assess sleep patterns and associations between sleep and match performance in elite Australian female basketball players. Prospective cohort study. Seventeen elite female basketball players were monitored across two consecutive in-season competitions (30 weeks). Total sleep time and sleep efficiency were determined using triaxial accelerometers for Baseline, Pre-match, Match-day and Post-match timings. Match performance was determined using the basketball efficiency statistic (EFF). The effects of match schedule (Regular versus Double-Header; Home versus Away) and sleep on EFF were assessed. The Double-Header condition changed the pattern of sleep when compared with the Regular condition (F (3,48) =3.763, P=0.017), where total sleep time Post-match was 11% less for Double-Header (mean±SD; 7.2±1.4h) compared with Regular (8.0±1.3h; P=0.007). Total sleep time for Double-Header was greater Pre-match (8.2±1.7h) compared with Baseline (7.1±1.6h; P=0.022) and Match-day (7.3±1.5h; P=0.007). Small correlations existed between sleep metrics at Pre-match and EFF for pooled data (r=-0.39 to -0.22; P≥0.238). Relationships between total sleep time and EFF ranged from moderate negative to large positive correlations for individual players (r=-0.37 to 0.62) and reached significance for one player (r=0.60; P=0.025). Match schedule can affect the sleep patterns of elite female basketball players. A large degree of inter-individual variability existed in the relationship between sleep and match performance; nevertheless, sleep monitoring might assist in the optimisation of performance for some athletes. Copyright © 2017 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.

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

  4. Improved SIFT descriptor applied to stereo image matching

    Science.gov (United States)

    Zeng, Luan; Zhai, You; Xiong, Wei

    2015-02-01

    Scale Invariant Feature Transform (SIFT) has been proven to perform better on the distinctiveness and robustness than other features. But it cannot satisfy the needs of low contrast images matching and the matching results are sensitive to 3D viewpoint change of camera. In order to improve the performance of SIFT to low contrast images and images with large 3D viewpoint change, a new matching method based on improved SIFT is proposed. First, an adaptive contrast threshold is computed for each initial key point in low contrast image region, which uses pixels in its 9×9 local neighborhood, and then using it to eliminate initial key points in low contrast image region. Second, a new SIFT descriptor with 48 dimensions is computed for each key point. Third, a hierarchical matching method based on epipolar line and differences of key points' dominate orientation is presented. The experimental results prove that the method can greatly enhance the performance of SIFT to low contrast image matching. Besides, when applying it to stereo images matching with the hierarchical matching method, the correct matches and matching efficiency are greatly enhanced.

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

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

  7. Multi-Configuration Matched Spectral Filter Core, Phase II

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

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

  9. Matchings Extend to Hamiltonian Cycles in 5-Cube

    Directory of Open Access Journals (Sweden)

    Wang Fan

    2018-02-01

    Full Text Available Ruskey and Savage asked the following question: Does every matching in a hypercube Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? Fink confirmed that every perfect matching can be extended to a Hamiltonian cycle of Qn, thus solved Kreweras’ conjecture. Also, Fink pointed out that every matching can be extended to a Hamiltonian cycle of Qn for n ∈ {2, 3, 4}. In this paper, we prove that every matching in Q5 can be extended to a Hamiltonian cycle of Q5.

  10. PIMR: Parallel and Integrated Matching for Raw Data.

    Science.gov (United States)

    Li, Zhenghao; Yang, Junying; Zhao, Jiaduo; Han, Peng; Chai, Zhi

    2016-01-02

    With the trend of high-resolution imaging, computational costs of image matching have substantially increased. In order to find the compromise between accuracy and computation in real-time applications, we bring forward a fast and robust matching algorithm, named parallel and integrated matching for raw data (PIMR). This algorithm not only effectively utilizes the color information of raw data, but also designs a parallel and integrated framework to shorten the time-cost in the demosaicing stage. Experiments show that compared to existing state-of-the-art methods, the proposed algorithm yields a comparable recognition rate, while the total time-cost of imaging and matching is significantly reduced.

  11. An example in linear quadratic optimal control

    NARCIS (Netherlands)

    Weiss, George; Zwart, Heiko J.

    1998-01-01

    We construct a simple example of a quadratic optimal control problem for an infinite-dimensional linear system based on a shift semigroup. This system has an unbounded control operator. The cost is quadratic in the input and the state, and the weighting operators are bounded. Despite its extreme

  12. Freeform aberrations in phase space: an example.

    Science.gov (United States)

    Babington, James

    2017-06-01

    We consider how optical propagation and aberrations of freeform systems can be formulated in phase space. As an example system, a freeform prism is analyzed and discussed. Symmetry considerations and their group theory descriptions are given some importance. Numerical aberrations are also highlighted and put into the context of the underlying aberration theory.

  13. Students' Views of Example Generation Tasks

    Science.gov (United States)

    Breen, Sinead; O'Shea, Ann; Pfeiffer, Kirsten

    2016-01-01

    We report here on students' views of example generation tasks assigned to them in two first year undergraduate Calculus courses. The design and use of such tasks was undertaken as part of a project which aimed to afford students opportunities to develop their thinking skills and their conceptual understanding. In interviews with 10 students, we…

  14. Magnetic Force and Work: An Accessible Example

    Science.gov (United States)

    Gates, Joshua

    2014-01-01

    Despite their physics instructors' arguments to the contrary, introductory students can observe situations in which there seems to be compelling evidence for magnetic force doing work. The counterarguments are often highly technical and require physics knowledge beyond the experience of novice students, however. A simple example is presented…

  15. Fluid dynamics via examples and solutions

    CERN Document Server

    Nazarenko, Sergey

    2014-01-01

    "This is an excellent book for fluid dynamics students. It gives a good overview of the theory through a large set of worthy example problems. After many classical textbooks on the subject, there is finally one with solved exercises. I fully appreciate the selection of topics."-Professor Miguel Onorato, Physics Department, University of Torino.

  16. Returnable containers: an example of reverse logistics

    NARCIS (Netherlands)

    L.G. Kroon (Leo); G.M.C. Vrijens

    1996-01-01

    textabstractConsiders the application of returnable containers as an example of reverse logistics. A returnable container is a type of secondary packaging that can be used several times in the same form, in contrast with traditional cardboard boxes. For this equipment to be used, a system for the

  17. Collaborative Learning in Practice : Examples from Natural ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    1 déc. 2010 ... Couverture du livre Collaborative Learning in Practice: Examples from Natural Resource Management in Asia ... Collaborative Learning in Practice saura intéresser les universitaires, les chercheurs et les étudiants des cycles supérieurs en études du développement, ... Strategic leverage on value chains.

  18. Student activation: Considerations and successful examples

    DEFF Research Database (Denmark)

    Fjerbæk Søtoft, Lene

    My development project focuses on student activitation. I incorporated various types of activation into two courses, which I have been teaching in the autumn 2012. Three practical examples are presented below, which I found has been very successfull in my courses. Additionally, I present some of my...

  19. Proterozoic intracontinental basin: The Vindhyan example

    Indian Academy of Sciences (India)

    The Vindhyan basin is a classic example of Proterozoic intracontinental basin that developed in the central part of the Indian shield along with several other basins such as Cuddapah,Chattisgarh,etc.The strata are exposed in three major sectors:Son valley,Bundelkhand and Rajasthan. Substantially thick Vindhyan rocks ...

  20. BLOOM: BLoom filter based oblivious outsourced matchings.

    Science.gov (United States)

    Ziegeldorf, Jan Henrik; Pennekamp, Jan; Hellmanns, David; Schwinger, Felix; Kunze, Ike; Henze, Martin; Hiller, Jens; Matzutt, Roman; Wehrle, Klaus

    2017-07-26

    Whole genome sequencing has become fast, accurate, and cheap, paving the way towards the large-scale collection and processing of human genome data. Unfortunately, this dawning genome era does not only promise tremendous advances in biomedical research but also causes unprecedented privacy risks for the many. Handling storage and processing of large genome datasets through cloud services greatly aggravates these concerns. Current research efforts thus investigate the use of strong cryptographic methods and protocols to implement privacy-preserving genomic computations. We propose FHE-BLOOM and PHE-BLOOM, two efficient approaches for genetic disease testing using homomorphically encrypted Bloom filters. Both approaches allow the data owner to securely outsource storage and computation to an untrusted cloud. FHE-BLOOM is fully secure in the semi-honest model while PHE-BLOOM slightly relaxes security guarantees in a trade-off for highly improved performance. We implement and evaluate both approaches on a large dataset of up to 50 patient genomes each with up to 1000000 variations (single nucleotide polymorphisms). For both implementations, overheads scale linearly in the number of patients and variations, while PHE-BLOOM is faster by at least three orders of magnitude. For example, testing disease susceptibility of 50 patients with 100000 variations requires only a total of 308.31 s (σ=8.73 s) with our first approach and a mere 0.07 s (σ=0.00 s) with the second. We additionally discuss security guarantees of both approaches and their limitations as well as possible extensions towards more complex query types, e.g., fuzzy or range queries. Both approaches handle practical problem sizes efficiently and are easily parallelized to scale with the elastic resources available in the cloud. The fully homomorphic scheme, FHE-BLOOM, realizes a comprehensive outsourcing to the cloud, while the partially homomorphic scheme, PHE-BLOOM, trades a slight relaxation of security

  1. The within-match patterns of locomotor efficiency during professional soccer match play: Implications for injury risk?

    Science.gov (United States)

    Barrett, Steve; Midgley, Adrian; Reeves, Matt; Joel, Tom; Franklin, Ed; Heyworth, Rob; Garrett, Andrew; Lovell, Ric

    2016-10-01

    The principle aim of the current study was to examine within-match patterns of locomotor efficiency in professional soccer, determined as the ratio between tri-axial accelerometer data (PlayerLoad™) and locomotor activities. Between match variability and determinants of PlayerLoad™ during match play were also assessed. A single cohort, observational study. Tri-axial accelerometer data (PlayerLoad™) was recorded during 86 competitive soccer matches in 63 English championship players (574 match observations). Accelerometer data accumulated (PlayerLoad Vector Magnitude [PLVM]) from the individual-component planes of PlayerLoad™ (anterior-posterior PlayerLoad™ [PLAP], medial-lateral PlayerLoad™ [PLML] and vertical PlayerLoad™ [PLV]), together with locomotor activity (Total Distance Covered [TDC]) were determined in 15-min segments. Locomotor efficiency was calculated using the ratio of PLVM and TDC (PlayerLoad™ per metre). The proportion of variance explaining the within-match trends in PLVM, PLAP, APML, APv, and TDC was determined owing to matches, individual players, and positional role. PLVM, PLAP, APML, APv and TDC reduced after the initial 15-min match period (p=0.001; η(2)=0.22-0.43, large effects). PL:TDC increased in the last 15min of each half (p=0.001; η(2)=0.25, large effect). The variance in PLVM during soccer match-play was explained by individual players (63.9%; p=0.001) and between-match variation (21.6%; p=0.001), but not positional role (14.1%; p=0.364). Locomotor efficiency is lower during the latter stages of each half of competitive soccer match-play, a trend synonymous with observations of increased injury incidence and fatigue in these periods. Locomotor efficiency may be a valuable metric to identify fatigue and heightened injury risk during soccer training and match-play. Copyright © 2015 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.

  2. Association Between Match Activity Variables, Measures of Fatigue and Neuromuscular Performance Capacity Following Elite Competitive Soccer Matches

    Directory of Open Access Journals (Sweden)

    Varley Ian

    2017-12-01

    Full Text Available The aim of the study was to assess the relationships between match activity variables, subsequent fatigue and neuromuscular performance capacity in elite soccer players. Subjects (n = 10 were professional soccer players participating in the English Championships. Match activity variables and markers of fatigue status were measured before and following two matches. Creatine kinase (CK and muscle soreness were measured at baseline, immediately following, as well as 40 and 64 h post-match. Countermovement jump performance and perceived ratings of wellness were measured at baseline, then 40 and 64 h post-match. Relationships were shown between CK and the total number of accelerations and decelerations immediately (r = 0.63; large, 40 h (r = 0.45; moderate and 64 h post-match (r = 0.35; moderate (p < 0.05. Relationships between CK and total sprint distance (r = 0.39; moderate and the number of sprints (r = 0.35; moderate 40 h post-match (p < 0.05 were observed. Furthermore, relationships were shown between the perceived rating of wellness and number of accelerations 40 (r = 0.52; large and 64 h (r = 0.40; moderate post-match, sprint distance 40 h post-match (r = 0.40; moderate and the total number of sprints 40 h post-match (r = 0.51; large (p < 0.05. The quantification of match activity variables, particularly the total number of accelerations and decelerations and the number of sprints, provides insights into the fatigue status in elite soccer players 40 and 64 h post-match.

  3. Posterior Probability Matching and Human Perceptual Decision Making.

    Science.gov (United States)

    Murray, Richard F; Patel, Khushbu; Yee, Alan

    2015-06-01

    Probability matching is a classic theory of decision making that was first developed in models of cognition. Posterior probability matching, a variant in which observers match their response probabilities to the posterior probability of each response being correct, is being used increasingly often in models of perception. However, little is known about whether posterior probability matching is consistent with the vast literature on vision and hearing that has developed within signal detection theory. Here we test posterior probability matching models using two tools from detection theory. First, we examine the models' performance in a two-pass experiment, where each block of trials is presented twice, and we measure the proportion of times that the model gives the same response twice to repeated stimuli. We show that at low performance levels, posterior probability matching models give highly inconsistent responses across repeated presentations of identical trials. We find that practised human observers are more consistent across repeated trials than these models predict, and we find some evidence that less practised observers more consistent as well. Second, we compare the performance of posterior probability matching models on a discrimination task to the performance of a theoretical ideal observer that achieves the best possible performance. We find that posterior probability matching is very inefficient at low-to-moderate performance levels, and that human observers can be more efficient than is ever possible according to posterior probability matching models. These findings support classic signal detection models, and rule out a broad class of posterior probability matching models for expert performance on perceptual tasks that range in complexity from contrast discrimination to symmetry detection. However, our findings leave open the possibility that inexperienced observers may show posterior probability matching behaviour, and our methods provide new tools

  4. Posterior Probability Matching and Human Perceptual Decision Making.

    Directory of Open Access Journals (Sweden)

    Richard F Murray

    2015-06-01

    Full Text Available Probability matching is a classic theory of decision making that was first developed in models of cognition. Posterior probability matching, a variant in which observers match their response probabilities to the posterior probability of each response being correct, is being used increasingly often in models of perception. However, little is known about whether posterior probability matching is consistent with the vast literature on vision and hearing that has developed within signal detection theory. Here we test posterior probability matching models using two tools from detection theory. First, we examine the models' performance in a two-pass experiment, where each block of trials is presented twice, and we measure the proportion of times that the model gives the same response twice to repeated stimuli. We show that at low performance levels, posterior probability matching models give highly inconsistent responses across repeated presentations of identical trials. We find that practised human observers are more consistent across repeated trials than these models predict, and we find some evidence that less practised observers more consistent as well. Second, we compare the performance of posterior probability matching models on a discrimination task to the performance of a theoretical ideal observer that achieves the best possible performance. We find that posterior probability matching is very inefficient at low-to-moderate performance levels, and that human observers can be more efficient than is ever possible according to posterior probability matching models. These findings support classic signal detection models, and rule out a broad class of posterior probability matching models for expert performance on perceptual tasks that range in complexity from contrast discrimination to symmetry detection. However, our findings leave open the possibility that inexperienced observers may show posterior probability matching behaviour, and our methods

  5. Influence of a Prolonged Tennis Match Play on Serve Biomechanics.

    Directory of Open Access Journals (Sweden)

    Caroline Martin

    Full Text Available The aim of this study was to quantify kinematic, kinetic and performance changes that occur in the serve throughout a prolonged tennis match play. Serves of eight male advanced tennis players were recorded with a motion capture system before, at mid-match, and after a 3-hour tennis match. Before and after each match, electromyographic data of 8 upper limb muscles obtained during isometric maximal voluntary contraction were compared to determine the presence of muscular fatigue. Vertical ground reaction forces, rating of perceived exertion, ball speed, and ball impact height were measured. Kinematic and upper limb kinetic variables were computed. The results show decrease in mean power frequency values for several upper limb muscles that is an indicator of local muscular fatigue. Decreases in serve ball speed, ball impact height, maximal angular velocities and an increase in rating of perceived exertion were also observed between the beginning and the end of the match. With fatigue, the majority of the upper limb joint kinetics decreases at the end of the match. No change in timing of maximal angular velocities was observed between the beginning and the end of the match. A prolonged tennis match play may induce fatigue in upper limb muscles, which decrease performance and cause changes in serve maximal angular velocities and joint kinetics. The consistency in timing of maximal angular velocities suggests that advanced tennis players are able to maintain the temporal pattern of their serve technique, in spite of the muscular fatigue development.

  6. 77 FR 38610 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2012-06-28

    ... verification records from its DMDC and DEERS data bases to ED's Central Processing System files (Federal... Privacy Act of 1974; Computer Matching Program AGENCY: Department of Education. ACTION: Notice--Computer... document provides notice of the continuation of the computer matching program between the Departments of...

  7. N.Y.C. System School-Match Gaps Tracked

    Science.gov (United States)

    Sparks, Sarah D.

    2013-01-01

    The first round of this year's high-school-match notifications in New York City's massive, district-wide school choice process went out to students this month, sparking celebration, consternation, and a renewal of concerns about unequal access to the city's best schools. The Big Apple's school-matching system is certainly on a New York scale, with…

  8. An expert system for automated flavour matching - Prioritizer

    DEFF Research Database (Denmark)

    Silva, Bárbara Santos; Tøstesen, Marie; Petersen, Mikael Agerlin

    2017-01-01

    Flavour matching can be viewed as trying to reproduce a specific flavour. This is a time consuming task and may lead to flavour mixtures that are too complex or too expensive to be commercialized. In order to facilitate the matching, we have developed a new mathematical model, called Prioritizer....

  9. Standardized letters of recommendation and successful match into otolaryngology.

    Science.gov (United States)

    Kimple, Adam J; McClurg, Stanley W; Del Signore, Anthony G; Tomoum, Mohamed O; Lin, Feng-Chang; Senior, Brent A

    2016-05-01

    Historically, narrative letters of recommendation have been utilized in the selection of applicants for otolaryngology residency programs. In the last two application cycles, our specialty adopted a standardized letter of recommendation (SLOR). The intent was to decrease time burden for letter writers and to provide readers with an objective evaluation of applicants. The objective of this study was to determine attributes in the SLOR that correlate with matching into a residency program. We performed a retrospective study using SLOR, United States Medical Licensing Examination (USMLE) step 1 scores, and matched outcomes of applicants who applied to our institution for the 2013 and 2014 match cycle. We included the following variables from the SLOR in the statistical analysis to determine which ones were associated with matching: patient care, medical knowledge, communication skills, procedural skills, research, initiative and drive, commitment to otolaryngology, commitment to academic medicine, match potential, and USMLE1 scores. We identified 532 applicants and 963 SLOR. In successful applicants, scores for patient care, medical knowledge, communication skills, initiative and drive, and match potential were statistically higher (P otolaryngology, commitment to academic medicine, and USMLE step 1 scores were not higher among successfully matched applicants. Although SLOR can save time for letter writers and provide an objective description of applicants, the utility of individual domains within the SLOR is questionable. Additionally, it is concerning that applicants' professionalism and procedural skills are not correlated with matching in our specialty. NA. Laryngoscope, 126:1071-1076, 2016. © 2016 The American Laryngological, Rhinological and Otological Society, Inc.

  10. A Grammar-Based Index for Matching Business Processes

    NARCIS (Netherlands)

    Mahleko, Bendick; Wombacher, Andreas; Fankhauser, Peter

    Complex services are composed of simple services which typically need to be processed in a particular order. Two complex services only match if they agree on both, their simple services and their processing order. This matching semantics can be formalized by means of modelling complex services as

  11. A computationally efficient approach for template matching-based ...

    Indian Academy of Sciences (India)

    ) methods have been proposed (Zitová &. Flusser 2003). The NCC method is one of the successful template matching methods and it is widely used in image matching application. Suppose I(j, k)is the reference image of size M ×. M pixel and ...

  12. Matching Managerial Skills and Behaviour with Business Strategy ...

    African Journals Online (AJOL)

    ... number of authors. The paper then concludes that matching a manager to a business strategy needs learning. However managerial characteristics are difficult to change as business change. At best the matching concepts suits manual and technical jobs. African Journal of Finance and Management Vol.8(2) 2000: 32-36 ...

  13. ORIGINAL ARTICLES Football match spectator sound exposure and ...

    African Journals Online (AJOL)

    Department of Communication Pathology, University of Pretoria, and Callier Center for Communication Disorders, University of Texas at Dallas, USA. De Wet Swanepoel, PhD. Department of Communicative ... soccer league match; and (ii) changes in auditory functioning after the match. Methods. This was a one-group ...

  14. A Test of the Formal and Modern Theories of Matching

    Science.gov (United States)

    Dallery, Jesse; Soto, Paul L.; McDowell, J. J.

    2005-01-01

    The present study tested a formal, or purely mathematical, theory of matching, and a modern account derived by McDowell (1986) that incorporates deviations from strict matching--bias and sensitivity. Six humans pressed a lever for monetary reinforcers on five concurrent variable interval (VI) schedules of reinforcement. All schedules were…

  15. Approximate semantic matching of music classes on the internet

    NARCIS (Netherlands)

    Aleksovski, Zharko; Kate, Warner Ten; Van Harmelen, Frank

    2006-01-01

    We address the problem of semantic matching, which concerns the search for semantic agreement between heterogeneous concept hierarchies. We propose a new approximation method to discover and assess the "strength" (preciseness) of a semantic match between concepts from two such concept hierarchies.

  16. Instance-Based Ontology Matching by Instance Enrichment

    NARCIS (Netherlands)

    Schopman, B.; Wang, S.; Isaac, A.H.J.C.A.; Schlobach, K.S.

    2012-01-01

    The ontology matching (OM) problem is an important barrier to achieve true Semantic Interoperability. Instance-based ontology matching (IBOM) uses the extension of concepts, the instances directly associated with a concept, to determine whether a pair of concepts is related or not. While IBOM has

  17. Matching performance of vehicle icons in graphical and textual formats.

    Science.gov (United States)

    Chi, Chia-Fen; Dewi, Ratna Sari

    2014-07-01

    The current research classified 82 vehicle icons into seven categories (image-related, concept-related, semi-abstract, arbitrary, abbreviation, word, and combined) for their matching accuracy, matching sequence, and matching time. These data can be compared and used as a framework for future icon development. Forty participants, all with a university degree, took part in this experiment. Half of the participants had intensive driving experience, while the other half never driven a car. The results indicated that on average, word icons had a significantly greater matching accuracy than the other icon formats; ranging from 4.7 to 20.8% difference. Regarding the matching sequence, participants matched image-related icons before other icon formats. Arbitrary and combined icons took significantly longer to match than other icon formats by 1.4-6.2 s. Based on the high matching accuracy (86.3%) and high ratings on subjective design features, word format can be used for functions describable using simple English for users with English reading ability. Confusion matrices showed that 63.2% of the misunderstandings were caused by similarity in format or function. Copyright © 2013 Elsevier Ltd and The Ergonomics Society. All rights reserved.

  18. MUSCLE DAMAGE AFTER A TENNIS MATCH IN YOUNG PLAYERS

    Directory of Open Access Journals (Sweden)

    R.V. Gomes

    2014-07-01

    Full Text Available The present study investigated changes in indirect markers of muscle damage following a simulated tennis match play using nationally ranked young (17.6 ± 1.4 years male tennis players. Ten young athletes played a 3-hour simulated match play on outdoor red clay courts following the International Tennis Federation rules. Muscle soreness, plasma creatine kinase activity (CK, serum myoglobin concentration (Mb, one repetition maximum (1RM squat strength, and squat jump (SJ and counter movement jump (CMJ heights were assessed before, immediately after, and 24 and 48 h after the simulated match play. All parameters were also evaluated in a non-exercised group (control group. A small increase in the indirect markers of muscle damage (muscle soreness, CK and Mb was detected at 24-48 hours post-match (p<0.05. A marked acute decrement in neuromuscular performance (1RM squat strength: -35.2 ± 10.4%, SJ: -7.0 ± 6.0%, CMJ: -10.0 ± 6.3% was observed immediately post-match (p<0.05. At 24 h post-match, the 1RM strength and jump heights were not significantly different from the baseline values. However, several players showed a decrease of these measures at 24 h after the match play. The simulated tennis match play induced mild muscle damage in young players. Coaches could monitor changes in the indirect markers of muscle damage to assess athletes’ recovery status during training and competition.

  19. Identification of meat products by shotgun spectral matching

    DEFF Research Database (Denmark)

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

    2016-01-01

    A new method, based on shotgun spectral matching of peptide tandem mass spectra, was successfully applied to the identification of different food species. The method was demonstrated to work on raw as well as processed samples from 16 mammalian and 10 bird species by counting spectral matches to ...

  20. Matching children with foster carers : A literature review

    NARCIS (Netherlands)

    Zeijlmans, Kirti; López, Monica; Grietens, Hans; Knorth, Erik J.

    Matching in family foster care is a form of complex decision-making influenced by more than case factors alone. Organizational, contextual, and decision-maker factors also contribute to the process. This scoping review has synthesized the empirical literature on matching decisions in family foster

  1. 76 FR 77015 - Privacy Act of 1974; Computer Matching Agreement

    Science.gov (United States)

    2011-12-09

    ... DEPARTMENT OF JUSTICE [AAG/A Order No. 001/2011] Privacy Act of 1974; Computer Matching Agreement AGENCY: Department of Justice. ACTION: Notice--computer matching between the Department of Justice and the Internal Revenue Service, Department of Treasury. SUMMARY: In accordance with the Privacy Act of...

  2. Beam transport through electrostatic accelerators and matching into post accelerators

    International Nuclear Information System (INIS)

    Larson, J.D.

    1986-01-01

    Ion beam transport through electrostatic acceleration is briefly reviewed. Topics discussed include injection, matching into the low-energy acceleration stage, matching from the terminal stripper into the high-energy stage, transport to a post accelerator, space charge, bunching isochronism, dispersion and charge selection. Beam transport plans for the proposed Vivitron accelerator are described. (orig.)

  3. Pattern classification approaches to matching building polygons at multiple scales

    NARCIS (Netherlands)

    Zhang, X.; Zhao, X.; Molenaar, M.; Stoter, J.; Kraak, M.J.; Ai, T.

    2012-01-01

    Matching of building polygons with different levels of detail is crucial in the maintenance and quality assessment of multi-representation databases. Two general problems need to be addressed in the matching process: (1) Which criteria are suitable? (2) How to effectively combine different criteria

  4. Model Reduction by Moment Matching for Linear Switched Systems

    DEFF Research Database (Denmark)

    Bastug, Mert; Petreczky, Mihaly; Wisniewski, Rafal

    2014-01-01

    A moment-matching method for the model reduction of linear switched systems (LSSs) is developed. The method is based based upon a partial realization theory of LSSs and it is similar to the Krylov subspace methods used for moment matching for linear systems. The results are illustrated by numerical...

  5. Poor textural image tie point matching via graph theory

    Science.gov (United States)

    Yuan, Xiuxiao; Chen, Shiyu; Yuan, Wei; Cai, Yang

    2017-07-01

    Feature matching aims to find corresponding points to serve as tie points between images. Robust matching is still a challenging task when input images are characterized by low contrast or contain repetitive patterns, occlusions, or homogeneous textures. In this paper, a novel feature matching algorithm based on graph theory is proposed. This algorithm integrates both geometric and radiometric constraints into an edge-weighted (EW) affinity tensor. Tie points are then obtained by high-order graph matching. Four pairs of poor textural images covering forests, deserts, bare lands, and urban areas are tested. For comparison, three state-of-the-art matching techniques, namely, scale-invariant feature transform (SIFT), speeded up robust features (SURF), and features from accelerated segment test (FAST), are also used. The experimental results show that the matching recall obtained by SIFT, SURF, and FAST varies from 0 to 35% in different types of poor textures. However, through the integration of both geometry and radiometry and the EW strategy, the recall obtained by the proposed algorithm is better than 50% in all four image pairs. The better matching recall improves the number of correct matches, dispersion, and positional accuracy.

  6. 36 CFR 72.32 - Funding and matching share.

    Science.gov (United States)

    2010-07-01

    ... which will address systemwide coordination, management and community resource problems through innovative and cost-effective approaches. (c) Sources of Matching Share—(1) State Incentive. As an incentive... project costs. In addition, two types of Federal funds may be used as part of a local match: General...

  7. Conditional versus Trial-Unique Delayed Matching-to-Sample.

    Science.gov (United States)

    Williams, Dean C.; Dube, William V.; Johnston, Mark D.; Saunders, Kathryn J.

    1998-01-01

    Two studies compared performance on conditional and trial-unique delayed identity matching-to-sample procedures with five subjects having moderate to severe mental retardation and four subjects with mild mental retardation. Across the studies, six of nine subjects showed lower delayed-matching accuracy when fewer rather than more stimuli were…

  8. Individual match approach to Bowling performance measures in ...

    African Journals Online (AJOL)

    Match conditions can play a significant role in player performances in a cricket match. If the pitch is in a good condition, the batsmen can achieve good scores, making it difficult for the bowlers. In the case of an uneven pitch or adverse weather conditions, the bowlers may have the upper hand. In order to measure bowlers' ...

  9. Fuzzy Clustering - Principles, Methods and Examples

    DEFF Research Database (Denmark)

    Kroszynski, Uri; Zhou, Jianjun

    1998-01-01

    of the methods. The examples were solved by hand and served as a test bench for exploration of the MATLAB capabilities included in the Fuzzy Control Toolbox. The fuzzy clustering methods described include Fuzzy c-means (FCM), Fuzzy c-lines (FCL) and Fuzzy c-elliptotypes (FCE).......One of the most remarkable advances in the field of identification and control of systems -in particular mechanical systems- whose behaviour can not be described by means of the usual mathematical models, has been achieved by the application of methods of fuzzy theory.In the framework of a study...... about identification of "black-box" properties by analysis of system input/output data sets, we have prepared an introductory note on the principles and the most popular data classification methods used in fuzzy modeling. This introductory note also includes some examples that illustrate the use...

  10. NASTRAN: User experience with four example problems

    Science.gov (United States)

    Rivello, R. M.

    1972-01-01

    Four different structural problems are solved to gain familiarity with the NASTRAN computer program. The problems are: (1) a simply-supported beam subjected to lateral loads, (2) a rotating filamentary composite bar under the action of centrifugal forces, (3) a missile body with aerodynamic, gravitational, and inertial forces, and (4) a square simply-supported plate with in-plane temperature changes capable of buckling the plate. Input and output data are given for each problem. The results are compared with those obtained by other methods. However, except for the examples employing beam elements in which the agreement is excellent, the element breakup chosen for convenience in obtaining program familiarity is too coarse to draw conclusions regarding the program accuracy. The example problems disclosed errors in the plotting and thermal-buckling routines of the program.

  11. Regionalism on the example of Hungary

    Directory of Open Access Journals (Sweden)

    Kovač Terez

    2002-01-01

    Full Text Available This paper is about the processes of association with the EU in which Hungary took place, and about the demands that should have been fulfilled. It is shown, on the example of Hungary, what progress has taken place in the last 15 years in the area of establishing of regional science and what sort of conclusion can be made for Yugoslavia. The author also deals with the possible functions of sociology in regional research.

  12. New examples of continuum graded Lie algebras

    International Nuclear Information System (INIS)

    Savel'ev, M.V.

    1989-01-01

    Several new examples of continuum graded Lie algebras which provide an additional elucidation of these algebras are given. Here, in particular, the Kac-Moody algebras, the algebra S 0 Diff T 2 of infinitesimal area-preserving diffeomorphisms of the torus T 2 , the Fairlie, Fletcher and Zachos sine-algebras, etc., are described as special cases of the cross product Lie algebras. 8 refs

  13. Uranium prospection methods illustrated with examples

    International Nuclear Information System (INIS)

    Valsardieu, C.

    1985-01-01

    Uranium exploration methods are briefly reviewed: aerial (radiometric, spectrometric), surface (mapping, radiometric, geophysical, geochemical), sub-surface (well logging, boring) and mining methods in the different steps of a mine project: preliminary studies, general prospecting, detailed prospecting deposit area and deposit estimation. Choice of methods depends strongly on geographic and geologic environment. Three examples are given concerning: an intragranitic deposit Limousin (France), a deposit spatially related to a discordance Athabasca (Canada) and a sedimentary deposit Manyingee (Western Australia) [fr

  14. Examples to Keep the Passion for the Geosciences

    Science.gov (United States)

    Fernández Raga, María; Palencia Coto, Covadonga; Cerdà, Artemi

    2014-05-01

    It is said that the beasts can smell fear. The translation to education is that students know when our vocation is really teaching or when you are teaching as a result of the sequence of events like a side effect of an investigating vocation path. But to become a good teacher, you need to love teaching!!! Education work requires a dynamic appeal by the students. It should be entertaining, motivating, interactive and dynamic. In this session I will present several tips and examples to get attention on your geology sessions: 1. The teacher should maintain a high interest in the subject of your work. Motivation is contagious!!!!If you show passion the other will feel it. 2. Change the attitude of students. Some activities can help you to do that like asking for the preparation of an experiment, and analyzing the results. Some examples will be shown. 3. Arouse the curiosity of the students. Some strategies could be asking questions in novel, controversial or inconsistent ways, asking conceptual conflicts and paradox that looks not expected from what is studied or 4. Use some tools to get the attention of the students. Examples of these tools can be Google Maps and Google Earth (teaching them to design routes and marking studies), Google drive (to create documents online in a team and file sharing), Google plus (to hang interesting news). 5. Examine students each week. Although it will be laborious, their work and learning will be more gradual. 6. Increase levels of competition among peers. 7. Relate what you know with what you learn. It is very important to be aware of the basis on which pupils, through prior knowledge test match. 8. Feel competent. Teacher's confidence is vital when teaching a class. You must be aware of our weaknesses and humble, but our nerves should help us to improve the quality of our classes. 9. Individualized teaching and learning. Numerous psychological and sociological studies suggest that the existence of social networks contribute to the

  15. Collinear phase matching for second harmonic generation using conoscopic interferometry

    Science.gov (United States)

    De, A.; Puri, A.

    2010-04-01

    The problem of finding phase-matching directions in noncentrosymmetric biaxial crystals is simplified here by the use of Conoscopic interferometry. Based on vector relations for wave propagation in birefringent media and solutions to phase-matching equations, we show that phase matching directions can be located on the conoscopic interferograms and that fringe numbers for dark-isochromes can be used as a guide to find phase-matching directions for a biaxial crystal. This technique can be generalized and extended to any anisotropic crystal. We have demonstrated this method for the particular case of a biaxial KTiOPO4 crystal, where it is found to be particularly suitable for finding the optimum-phase-matching directions.

  16. Vein matching using artificial neural network in vein authentication systems

    Science.gov (United States)

    Noori Hoshyar, Azadeh; Sulaiman, Riza

    2011-10-01

    Personal identification technology as security systems is developing rapidly. Traditional authentication modes like key; password; card are not safe enough because they could be stolen or easily forgotten. Biometric as developed technology has been applied to a wide range of systems. According to different researchers, vein biometric is a good candidate among other biometric traits such as fingerprint, hand geometry, voice, DNA and etc for authentication systems. Vein authentication systems can be designed by different methodologies. All the methodologies consist of matching stage which is too important for final verification of the system. Neural Network is an effective methodology for matching and recognizing individuals in authentication systems. Therefore, this paper explains and implements the Neural Network methodology for finger vein authentication system. Neural Network is trained in Matlab to match the vein features of authentication system. The Network simulation shows the quality of matching as 95% which is a good performance for authentication system matching.

  17. High Performance Embedded System for Real-Time Pattern Matching

    CERN Document Server

    Sotiropoulou, Calliope Louisa; The ATLAS collaboration; Gkaitatzis, Stamatios; Citraro, Saverio; Giannetti, Paola; Dell'Orso, Mauro

    2016-01-01

    In this paper we present an innovative and high performance embedded system for real-time pattern matching. This system is based on the evolution of hardware and algorithms developed for the field of High Energy Physics (HEP) and more specifically for the execution of extremely fast pattern matching for tracking of particles produced by proton-proton collisions in hadron collider experiments. A miniaturised version of this complex system is being developed for pattern matching in generic image processing applications. The system works as a contour identifier able to extract the salient features of an image. It is based on the principles of cognitive image processing, which means that it executes fast pattern matching and data reduction mimicking the operation of the human brain. The pattern matching can be executed by a custom designed Associative Memory (AM) chip. The reference patterns are chosen by a complex training algorithm implemented on an FPGA device. Post processing algorithms (e.g. pixel clustering...

  18. Generation Y and the Integrated Plastic Surgery Residency Match: A Cross-sectional Study of the 2011 Match Outcomes

    Science.gov (United States)

    Narayan, Deepak

    2013-01-01

    Background: Plastic surgery is the most competitive specialty in medicine. We sought to identify factors associated with the successful match of generation Y applicants into integrated plastic surgery residency. Methods: We utilized the most recent data from the Charting Outcomes in the Match published by the National Resident Matching Program in 2011. We had data on US senior or independent applicant status, Alpha Omega Alpha (AOA) status, attendance of top 40 medical schools, advanced degree status, and number of contiguous ranks within plastic surgery. Our main outcome measure was match status. Results: A total of 81 out of 197 applicants (41.1%) successfully matched into integrated plastic surgery in the 2011 main match. US seniors matched at a significantly higher rate compared to independent applicants (44.0% vs 24.1%, P = 0.044). Matched US seniors were more likely to have AOA membership compared to unmatched US seniors (45.9% vs 27.7%, P = 0.014) and attend a top 40 medical school (52.7% vs 35.1%, P = 0.022). There were no differences in terms of advanced degrees between matched and unmatched US seniors. Unmatched US seniors were more likely to have 3 or fewer contiguous ranks of plastic surgery residency programs than matched US seniors (86.2% vs 68.9%, P = 0.007). Conclusions: US senior status, AOA membership, and attendance at a top 40 medical school are predictors of matching into integrated plastic surgery. Program directors need to be aware of the background of the millennial applicants to recruit and maintain top residents. PMID:25289227

  19. QCD NLO with POWHEG matching and top threshold matching in WHIZARD

    Energy Technology Data Exchange (ETDEWEB)

    Reuter, Juergen; Nejad, Bijan Chokoufe [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group; Bach, Fabian [European Commission, Luxembourg (Luxembourg); Kilian, Wolfgang [Siegen Univ. (Germany); Stahlhofen, Maximilian [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group; Mainz Univ. (Germany). PRISMA Cluster of Excellence; Weiss, Christian [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group; Siegen Univ. (Germany)

    2016-01-15

    We present the status of the automation of NLO processes within the event generator WHIZARD. The program provides an automated FKS subtraction and phase space integration over the FKS regions, while the (QCD) NLO matrix element is accessed via the Binoth Les Houches Interface from an externally linked one-loop program. Massless and massive test cases and validation are shown for several e{sup +}e{sup -} processes. Furthermore, we discuss work in progress and future plans. The second part covers the matching of the NRQCD prediction with NLL threshold resummation to the NLO continuum top pair production at lepton colliders. Both the S-wave and P-wave production of the top pair are taken into account in the resummation. The inclusion in WHIZARD allows to study more exclusive observables than just the total cross section and automatically accounts for important electroweak and relativistic corrections in the threshold region.

  20. An ensemble based nonlinear orthogonal matching pursuit algorithm for sparse history matching of reservoir models

    KAUST Repository

    Fsheikh, Ahmed H.

    2013-01-01

    A nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of reservoir models is presented. Sparse calibration is a challenging problem as the unknowns are both the non-zero components of the solution and their associated weights. NOMP is a greedy algorithm that discovers at each iteration the most correlated components of the basis functions with the residual. The discovered basis (aka support) is augmented across the nonlinear iterations. Once the basis functions are selected from the dictionary, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on approximate gradient estimation using an iterative stochastic ensemble method (ISEM). ISEM utilizes an ensemble of directional derivatives to efficiently approximate gradients. In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm.

  1. 78 FR 48170 - Privacy Act of 1974; CMS Computer Match No. 2013-12; HHS Computer Match No. 1307; SSA Computer...

    Science.gov (United States)

    2013-08-07

    ... 1974; CMS Computer Match No. 2013-12; HHS Computer Match No. 1307; SSA Computer Match No. 1097-1899...). ACTION: Notice of Computer Matching Program (CMP). SUMMARY: In accordance with the requirements of the....hhs.gov . SUPPLEMENTARY INFORMATION: The Computer Matching and Privacy Protection Act of 1988 (Public...

  2. 75 FR 30839 - Privacy Act of 1974; CMS Computer Match No. 2010-03, HHS Computer Match No. 1003, SSA Computer...

    Science.gov (United States)

    2010-06-02

    ... Match No. 1003 SSA Computer Match No. 1048 IRS Project No. 241 NAME: ``Medicare Secondary Payer (MSP... 1974; CMS Computer Match No. 2010-03, HHS Computer Match No. 1003, SSA Computer Match No. 1048, IRS Project No. 241 AGENCY: Department of Health and Human Services (HHS), Centers for Medicare & Medicaid...

  3. A novel retinal vessel extraction algorithm based on matched filtering and gradient vector flow

    Science.gov (United States)

    Yu, Lei; Xia, Mingliang; Xuan, Li

    2013-10-01

    The microvasculature network of retina plays an important role in the study and diagnosis of retinal diseases (age-related macular degeneration and diabetic retinopathy for example). Although it is possible to noninvasively acquire high-resolution retinal images with modern retinal imaging technologies, non-uniform illumination, the low contrast of thin vessels and the background noises all make it difficult for diagnosis. In this paper, we introduce a novel retinal vessel extraction algorithm based on gradient vector flow and matched filtering to segment retinal vessels with different likelihood. Firstly, we use isotropic Gaussian kernel and adaptive histogram equalization to smooth and enhance the retinal images respectively. Secondly, a multi-scale matched filtering method is adopted to extract the retinal vessels. Then, the gradient vector flow algorithm is introduced to locate the edge of the retinal vessels. Finally, we combine the results of matched filtering method and gradient vector flow algorithm to extract the vessels at different likelihood levels. The experiments demonstrate that our algorithm is efficient and the intensities of vessel images exactly represent the likelihood of the vessels.

  4. A Novel Method of Estimating Statistically Matched Wavelet: Part 1-Compactly Supported Wavelet

    Directory of Open Access Journals (Sweden)

    Anubha Gupta

    2004-10-01

    Full Text Available Issue of finding a wavelet matched to signal has been addressed by various researchers in past. This paper presents a new method of estimating wavelet that is matched to a given signal in the statistical sense. The key idea lies in the estimation of analysis wavelet filter from a given signal and is similar to a sharpening filter used in image enhancement. The output of analysis wavelet filter branch after decimation is written in terms of filter weights and input signal samples. It is then viewed to be equivalent to difference of middle sample and its smoother estimate from the neighborhood which then needs to be minimized. To achieve this, minimum mean square error (MMSE criterion is employed using the autocorrelation function of input signal. Since wavelet expansion acts like Karhunen-Loève type expansion for generalized 1/f processes, it is assumed that the given signal is a sample function of an nth order fractional Brownian motion. Its autocorrelation function is used with MMSE criterion to estimate analysis wavelet filter. Next, a method is proposed to design 2-band FIR perfect reconstruction biorthogonal filter bank. This result in compactly supported wavelet matched statistically to given signal. Further, it is shown that compactly supported wavelet with desired support can be designed from a given signal. The theory is supported with number of simulation examples.

  5. PLANE MATCHING WITH OBJECT-SPACE SEARCHING USING INDEPENDENTLY RECTIFIED IMAGES

    Directory of Open Access Journals (Sweden)

    H. Takeda

    2012-07-01

    Full Text Available In recent years, the social situation in cities has changed significantly such as redevelopment due to the massive earthquake and large-scale urban development. For example, numerical simulations can be used to study this phenomenon. Such simulations require the construction of high-definition three-dimensional city models that accurately reflect the real world. Progress in sensor technology allows us to easily obtain multi-view images. However, the existing multi-image matching techniques are inadequate. In this paper, we propose a new technique for multi-image matching. Since the existing method of feature searching is complicated, we have developed a rectification method that can be processed independently for each image does not depend on the stereo-pair. The object-space searching method that produces mismatches due to the occlusion or distortion of wall textures on images is the focus of our study. Our proposed technique can also match the building wall surface. The proposed technique has several advantages, and its usefulness is clarified through an experiment using actual images.

  6. Plane Matching with Object-Space Searching Using Independently Rectified Images

    Science.gov (United States)

    Takeda, H.; Akamatsu, Y.; Minami, Y.

    2012-07-01

    In recent years, the social situation in cities has changed significantly such as redevelopment due to the massive earthquake and large-scale urban development. For example, numerical simulations can be used to study this phenomenon. Such simulations require the construction of high-definition three-dimensional city models that accurately reflect the real world. Progress in sensor technology allows us to easily obtain multi-view images. However, the existing multi-image matching techniques are inadequate. In this paper, we propose a new technique for multi-image matching. Since the existing method of feature searching is complicated, we have developed a rectification method that can be processed independently for each image does not depend on the stereo-pair. The object-space searching method that produces mismatches due to the occlusion or distortion of wall textures on images is the focus of our study. Our proposed technique can also match the building wall surface. The proposed technique has several advantages, and its usefulness is clarified through an experiment using actual images.

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

  8. Current Interview Trail Metrics in the Otolaryngology Match.

    Science.gov (United States)

    Cabrera-Muffly, Cristina; Chang, C W David; Puscas, Liana

    2017-06-01

    Objectives To identify how applicants to otolaryngology residency determine how to apply to, interview with, and rank programs on the interview trail and to determine the extent of the financial burden of the otolaryngology interview trail. Study Design Web-based survey distributed in March and April 2016. Setting Otolaryngology residency applicants throughout the United States. Subjects and Methods Applicants to otolaryngology residency during the 2016 match cycle and current otolaryngology residents were surveyed. Results Median number of applications, interview offers, interviews attended, and programs ranked was not different during the 2016 match and the previous 5 match years. The most important factor affecting the number of applications was the need to apply widely to ensure sufficient interview offers. The most common reason for declining an interview offer was scheduling conflict. Applicants during the 2016 match spent a median of $5400 applying and interviewing for otolaryngology residency. Conclusions Median number of applications, interview offers, interviews attended, and programs ranked has not changed. The most cited reason for applying to many programs was to increase the chances of matching, but this is not statistically likely to increase match success. We advocate for continued attempts to make the otolaryngology match process more transparent for both applicants and resident selection committees, but recognize that applicants are likely to continue to overapply for otolaryngology residency positions.

  9. Template matching for auditing hospital cost and quality.

    Science.gov (United States)

    Silber, Jeffrey H; Rosenbaum, Paul R; Ross, Richard N; Ludwig, Justin M; Wang, Wei; Niknam, Bijan A; Mukherjee, Nabanita; Saynisch, Philip A; Even-Shoshan, Orit; Kelz, Rachel R; Fleisher, Lee A

    2014-10-01

    Develop an improved method for auditing hospital cost and quality. Medicare claims in general, gynecologic and urologic surgery, and orthopedics from Illinois, Texas, and New York between 2004 and 2006. A template of 300 representative patients was constructed and then used to match 300 patients at hospitals that had a minimum of 500 patients over a 3-year study period. From each of 217 hospitals we chose 300 patients most resembling the template using multivariate matching. The matching algorithm found close matches on procedures and patient characteristics, far more balanced than measured covariates would be in a randomized clinical trial. These matched samples displayed little to no differences across hospitals in common patient characteristics yet found large and statistically significant hospital variation in mortality, complications, failure-to-rescue, readmissions, length of stay, ICU days, cost, and surgical procedure length. Similar patients at different hospitals had substantially different outcomes. The template-matched sample can produce fair, directly standardized audits that evaluate hospitals on patients with similar characteristics, thereby making benchmarking more believable. Through examining matched samples of individual patients, administrators can better detect poor performance at their hospitals and better understand why these problems are occurring. © Health Research and Educational Trust.

  10. 3-D FEATURE-BASED MATCHING BY RSTG APPROACH

    Directory of Open Access Journals (Sweden)

    J.-J. Jaw

    2012-07-01

    Full Text Available 3-D feature matching is the essential kernel in a fully automated feature-based LiDAR point cloud registration. After feasible procedures of feature acquisition, connecting corresponding features in different data frames is imperative to be solved. The objective addressed in this paper is developing an approach coined RSTG to retrieve corresponding counterparts of unsorted multiple 3-D features extracted from sets of LiDAR point clouds. RSTG stands for the four major processes, "Rotation alignment"; "Scale estimation"; "Translation alignment" and "Geometric check," strategically formulated towards finding out matching solution with high efficiency and leading to accomplishing the 3-D similarity transformation among all sets. The workable types of features to RSTG comprise points, lines, planes and clustered point groups. Each type of features can be employed exclusively or combined with others, if sufficiently supplied, throughout the matching scheme. The paper gives a detailed description of the matching methodology and discusses on the matching effects based on the statistical assessment which revealed that the RSTG approach reached an average matching rate of success up to 93% with around 6.6% of statistical type 1 error. Notably, statistical type 2 error, the critical indicator of matching reliability, was kept 0% throughout all the experiments.

  11. Minutia tensor matrix: a new strategy for fingerprint matching.

    Science.gov (United States)

    Fu, Xiang; Feng, Jufu

    2015-01-01

    Establishing correspondences between two minutia sets is a fundamental issue in fingerprint recognition. This paper proposes a new tensor matching strategy. First, the concept of minutia tensor matrix (simplified as MTM) is proposed. It describes the first-order features and second-order features of a matching pair. In the MTM, the diagonal elements indicate similarities of minutia pairs and non-diagonal elements indicate pairwise compatibilities between minutia pairs. Correct minutia pairs are likely to establish both large similarities and large compatibilities, so they form a dense sub-block. Minutia matching is then formulated as recovering the dense sub-block in the MTM. This is a new tensor matching strategy for fingerprint recognition. Second, as fingerprint images show both local rigidity and global nonlinearity, we design two different kinds of MTMs: local MTM and global MTM. Meanwhile, a two-level matching algorithm is proposed. For local matching level, the local MTM is constructed and a novel local similarity calculation strategy is proposed. It makes full use of local rigidity in fingerprints. For global matching level, the global MTM is constructed to calculate similarities of entire minutia sets. It makes full use of global compatibility in fingerprints. Proposed method has stronger description ability and better robustness to noise and nonlinearity. Experiments conducted on Fingerprint Verification Competition databases (FVC2002 and FVC2004) demonstrate the effectiveness and the efficiency.

  12. Fractured reservoir history matching improved based on artificial intelligent

    Directory of Open Access Journals (Sweden)

    Sayyed Hadi Riazi

    2016-12-01

    Full Text Available In this paper, a new robust approach based on Least Square Support Vector Machine (LSSVM as a proxy model is used for an automatic fractured reservoir history matching. The proxy model is made to model the history match objective function (mismatch values based on the history data of the field. This model is then used to minimize the objective function through Particle Swarm Optimization (PSO and Imperialist Competitive Algorithm (ICA. In automatic history matching, sensitive analysis is often performed on full simulation model. In this work, to get new range of the uncertain parameters (matching parameters in which the objective function has a minimum value, sensitivity analysis is also performed on the proxy model. By applying the modified ranges to the optimization methods, optimization of the objective function will be faster and outputs of the optimization methods (matching parameters are produced in less time and with high precision. This procedure leads to matching of history of the field in which a set of reservoir parameters is used. The final sets of parameters are then applied for the full simulation model to validate the technique. The obtained results show that the present procedure in this work is effective for history matching process due to its robust dependability and fast convergence speed. Due to high speed and need for small data sets, LSSVM is the best tool to build a proxy model. Also the comparison of PSO and ICA shows that PSO is less time-consuming and more effective.

  13. Computationally Secure Pattern Matching in the Presence of Malicious Adversaries

    DEFF Research Database (Denmark)

    Hazay, Carmit; Toft, Tomas

    2014-01-01

    We propose a protocol for the problem of secure two-party pattern matching, where Alice holds a text t∈{0,1}∗ of length n, while Bob has a pattern p∈{0,1}∗ of length m. The goal is for Bob to (only) learn where his pattern occurs in Alice’s text, while Alice learns nothing. Private pattern matching...... for important variations of the secure pattern matching problem that are significantly more efficient than the current state of art solutions: First, we deal with secure pattern matching with wildcards. In this variant the pattern may contain wildcards that match both 0 and 1. Our protocol requires O......(n+m) communication and O(1) rounds using O(nm) computation. Then we treat secure approximate pattern matching. In this variant the matches may be approximated, i.e., have Hamming distance less than some threshold, τ. Our protocol requires O(nτ) communication in O(1) rounds using O(nm) computation. Third, we have...

  14. Commentary: the postdoctoral residency match in clinical neuropsychology.

    Science.gov (United States)

    Bodin, Doug; Grote, Christopher L

    2016-07-01

    Postdoctoral recruitment in clinical neuropsychology has evolved significantly over the past two decades. Prior to 1994, there were no organized recruitment guidelines for the specialty. From 1994 to 2001, the Association of Postdoctoral Programs in Clinical Neuropsychology (APPCN) facilitated a uniform notification date where member programs agreed to not make offers prior to a specified date. In 2001, APPCN partnered with National Matching Services to administer a computerized match recruitment system. Presently, not all programs participate in the match. This often results in students applying to 'match' and 'non-match' programs which can lead to significant stress on the part of applicants and program directors. This issue has recently become the focus of journal articles and public discussions. The goals of this paper were to review the history of postdoctoral recruitment in clinical neuropsychology, review the benefits of coordinated recruitment systems, review the structure and function of the computerized match, and explain why the computerized match for postdoctoral recruitment in clinical neuropsychology is beneficial for the specialty of clinical neuropsychology.

  15. Unfamiliar Face Matching With Frontal and Profile Views.

    Science.gov (United States)

    Kramer, Robin S S; Reynolds, Michael G

    2018-04-01

    Research has systematically examined how laboratory participants and real-world practitioners decide whether two face photographs show the same person or not using frontal images. In contrast, research has not examined face matching using profile images. In Experiment 1, we ask whether matching unfamiliar faces is easier with frontal compared with profile views. Participants completed the original, frontal version of the Glasgow Face Matching Test, and also an adapted version where all face pairs were presented in profile. There was no difference in performance across the two tasks, suggesting that both views were similarly useful for face matching. Experiments 2 and 3 examined whether matching unfamiliar faces is improved when both frontal and profile views are provided. We compared face matching accuracy when both a frontal and a profile image of each face were presented, with accuracy using each view alone. Surprisingly, we found no benefit when both views were presented together in either experiment. Overall, these results suggest that either frontal or profile views provide substantially overlapping information regarding identity or participants are unable to utilise both sources of information when making decisions. Each of these conclusions has important implications for face matching research and real-world identification development.

  16. Effects of Sensor Errors on the Performance of Map Matching

    Science.gov (United States)

    Chen, Wu; Li, Zhilin; Yu, Meng; Chen, Yongqi

    2005-05-01

    Map matching has been widely applied in car navigation systems as an efficient method to display the location of vehicles on maps. Various map-matching algorithms have been proposed. Inevitably, the correctness of the map matching is closely related to the accuracy of positioning sensors, such as GPS or Dead Reckoning (DR), and the complexity of the road network and map, especially in urban areas where the GPS signal may be constantly blocked by buildings and the road network is complicated. The existing map matching algorithms cannot resolve the positioning problems under all circumstances. They sometimes give the wrong position estimates of the car on road; the result is called mismatching. In order to improve the quality of map matching, a deep understand of the accuracy of sensor errors on mismatching is important. This paper analyses various factors that may affect the quality of map matching based on extensive tests in Hong Kong. Suggestions to improve the success rate of map matching are also provided.

  17. Energy conservation with non-symplectic methods: examples and counter-examples

    OpenAIRE

    Faou, Erwan; Hairer, Ernst; Pham, Truong-Linh

    2004-01-01

    Energy conservation of numerical integrators is well understood for symplectic one-step methods. This article provides new insight into energy conservation with non-symplectic methods. Sufficient conditions and counter-examples are presented.

  18. Improving catalogue matching by supplementing astrometry with additional photometric information

    Science.gov (United States)

    Wilson, Tom J.; Naylor, Tim

    2018-02-01

    The matching of sources between photometric catalogues can lead to cases where objects of differing brightness are incorrectly assumed to be detections of the same source. The rejection of unphysical matches can be achieved through the inclusion of information about the sources' magnitudes. The method described here uses the additional photometric information from both catalogues in the process of accepting or rejecting counterparts, providing approximately a factor of 10 improvement in Bayes' factor with its inclusion. When folding in the photometric information we avoid using prior astrophysical knowledge. Additionally, the method allows for the possibility of no counterparts to sources and the possibility that sources overlap multiple potential counterparts. We formally describe the probability of two sources being the same astrometric object, allowing systematic effects of astrometric perturbation (by e.g. contaminant objects) to be accounted for. We apply the method to two cases. First, we test INT Photometric Hα Survey of the Northern Galactic Plane (IPHAS)-Gaia matches to compare the resulting matches in two catalogues of similar wavelength coverage but differing dynamical ranges. Second, we apply the method to matches between IPHAS and Two Micron All Sky Survey and show that the method holds when considering two catalogues with approximately equal astrometric precision. We discuss the importance of including the magnitude information in each case. Additionally, we discuss extending the method to multiple catalogue matches through an iterative matching process. The method allows for the selection of high-quality matches by providing an overall probability for each pairing, giving the flexibility to choose stars known to be good matches.

  19. On two examples in linear topological spaces

    International Nuclear Information System (INIS)

    Iyahen, S.O.

    1985-11-01

    This note first gives examples of B-complete linear topological spaces, and shows that neither the closed graph theorem nor the open mapping theorem holds for linear mappings from such a space to itself. It then looks at Hausdorff linear topological spaces for which coarser Hausdorff linear topologies can be extended from hyperplanes. For B-complete spaces, those which are barrelled necessarily have countable dimension, and conversely. The paper had been motivated by two questions arising in earlier studies related to the closed graph and open mapping theorems; answers to these questions are contained therein. (author)

  20. Continuum modeling an approach through practical examples

    CERN Document Server

    Muntean, Adrian

    2015-01-01

    This book develops continuum modeling skills and approaches the topic from three sides: (1) derivation of global integral laws together with the associated local differential equations, (2) design of constitutive laws and (3) modeling boundary processes. The focus of this presentation lies on many practical examples covering aspects such as coupled flow, diffusion and reaction in porous media or microwave heating of a pizza, as well as traffic issues in bacterial colonies and energy harvesting from geothermal wells. The target audience comprises primarily graduate students in pure and applied mathematics as well as working practitioners in engineering who are faced by nonstandard rheological topics like those typically arising in the food industry.