WorldWideScience

Sample records for scd-based service matching

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

  2. Ontology-based composition and matching for dynamic service coordination

    OpenAIRE

    Pahl, Claus; Gacitua-Decar, Veronica; Wang, MingXue; Yapa Bandara, Kosala

    2011-01-01

    Service engineering needs to address integration problems allowing services to collaborate and coordinate. The need to address dynamic automated changes - caused by on-demand environments and changing requirements - can be addressed through service coordination based on ontology-based composition and matching techniques. Our solution to composition and matching utilises a service coordination space that acts as a passive infrastructure for collaboration. We discuss the information models an...

  3. Hierarchical Matching of Traffic Information Services Using Semantic Similarity

    Directory of Open Access Journals (Sweden)

    Zongtao Duan

    2018-01-01

    Full Text Available Service matching aims to find the information similar to a given query, which has numerous applications in web search. Although existing methods yield promising results, they are not applicable for transportation. In this paper, we propose a multilevel matching method based on semantic technology, towards efficiently searching the traffic information requested. Our approach is divided into two stages: service clustering, which prunes candidate services that are not promising, and functional matching. The similarity at function level between services is computed by grouping the connections between the services into inheritance and noninheritance relationships. We also developed a three-layer framework with a semantic similarity measure that requires less time and space cost than existing method since the scale of candidate services is significantly smaller than the whole transportation network. The OWL_TC4 based service set was used to verify the proposed approach. The accuracy of offline service clustering reached 93.80%, and it reduced the response time to 651 ms when the total number of candidate services was 1000. Moreover, given the different thresholds for the semantic similarity measure, the proposed mixed matching model did better in terms of recall and precision (i.e., up to 72.7% and 80%, respectively, for more than 1000 services compared to the compared models based on information theory and taxonomic distance. These experimental results confirmed the effectiveness and validity of service matching for responding quickly and accurately to user queries.

  4. Matching Danish Shop Stewards' Service Demands

    DEFF Research Database (Denmark)

    Navrbjerg, Steen Erik; Larsen, Trine Pernille

    process of the collective bargaining system, which adds more and more tasks on the shoulders of the shop steward and; b) the on-going trend of union mergers. While it could be expected that union merger and the reduction of local branches would entail a lower service level and at democratic deficit...... unions from 1998 to 2011. During the same period, the unions under the confederation reduced the number of branches from 886 to 334; a reduction by 62 per cent. At the same time, a process of decentralisation of the collective bargaining system has taken place since the early 1990s based on the needs...

  5. Optimal Quality Strategy and Matching Service on Crowdfunding Platforms

    Directory of Open Access Journals (Sweden)

    Wenqing Wu

    2018-04-01

    Full Text Available This paper develops a crowdfunding platform model incorporating quality and a matching service from the perspective of a two-sided market. It aims to explore the impact of different factors on the optimal quality threshold and matching service in a context of crowdfunding from the perspective of a two-sided market. We discuss the impact of different factors on the optimal quality threshold and matching service. Two important influential factors are under consideration, simultaneously. One is the quality threshold of admission and the other is the matching efficiency on crowdfunding platforms. This paper develops a two-sided market model incorporating quality, a matching service, and the characters of crowdfunding campaigns. After attempting to solve the model by derivative method, this paper identifies the mechanism of how the parameters influence the optimal quality threshold and matching service. Additionally, it compares the platform profits in scenarios with and without an exclusion policy. The results demonstrate that excluding low-quality projects is profitable when funder preference for project quality is substantial enough. Crowdfunding platform managers would be unwise to admit the quality threshold of the crowdfunding project and charge entrance fees when the parameter of funder preference for project quality is small.

  6. Employment Effects of Service Offshoring: Evidence from Matched Firms

    OpenAIRE

    Rosario Crinò

    2009-01-01

    This paper studies the effects of service offshoring on the level and skill composition of domestic employment, using a rich data set of Italian firms and propensity score matching techniques. The results show that service offshoring has no effect on the level of employment but changes its composition in favor of high skilled workers.

  7. Graphical matching rules for cardinality based service feature diagrams

    Directory of Open Access Journals (Sweden)

    Faiza Kanwal

    2017-03-01

    Full Text Available To provide efficient services to end-users, variability and commonality among the features of the product line is a challenge for industrialist and researchers. Feature modeling provides great services to deal with variability and commonality among the features of product line. Cardinality based service feature diagrams changed the basic framework of service feature diagrams by putting constraints to them, which make service specifications more flexible, but apart from their variation in selection third party services may have to be customizable. Although to control variability, cardinality based service feature diagrams provide high level visual notations. For specifying variability, the use of cardinality based service feature diagrams raises the problem of matching a required feature diagram against the set of provided diagrams.

  8. Towards a Next-Generation Catalogue Cross-Match Service

    Science.gov (United States)

    Pineau, F.; Boch, T.; Derriere, S.; Arches Consortium

    2015-09-01

    We have been developing in the past several catalogue cross-match tools. On one hand the CDS XMatch service (Pineau et al. 2011), able to perform basic but very efficient cross-matches, scalable to the largest catalogues on a single regular server. On the other hand, as part of the European project ARCHES1, we have been developing a generic and flexible tool which performs potentially complex multi-catalogue cross-matches and which computes probabilities of association based on a novel statistical framework. Although the two approaches have been managed so far as different tracks, the need for next generation cross-match services dealing with both efficiency and complexity is becoming pressing with forthcoming projects which will produce huge high quality catalogues. We are addressing this challenge which is both theoretical and technical. In ARCHES we generalize to N catalogues the candidate selection criteria - based on the chi-square distribution - described in Pineau et al. (2011). We formulate and test a number of Bayesian hypothesis which necessarily increases dramatically with the number of catalogues. To assign a probability to each hypotheses, we rely on estimated priors which account for local densities of sources. We validated our developments by comparing the theoretical curves we derived with the results of Monte-Carlo simulations. The current prototype is able to take into account heterogeneous positional errors, object extension and proper motion. The technical complexity is managed by OO programming design patterns and SQL-like functionalities. Large tasks are split into smaller independent pieces for scalability. Performances are achieved resorting to multi-threading, sequential reads and several tree data-structures. In addition to kd-trees, we account for heterogeneous positional errors and object's extension using M-trees. Proper-motions are supported using a modified M-tree we developed, inspired from Time Parametrized R-trees (TPR

  9. A New Model for a Carpool Matching Service.

    Directory of Open Access Journals (Sweden)

    Jizhe Xia

    Full Text Available Carpooling is an effective means of reducing traffic. A carpool team shares a vehicle for their commute, which reduces the number of vehicles on the road during rush hour periods. Carpooling is officially sanctioned by most governments, and is supported by the construction of high-occupancy vehicle lanes. A number of carpooling services have been designed in order to match commuters into carpool teams, but it known that the determination of optimal carpool teams is a combinatorially complex problem, and therefore technological solutions are difficult to achieve. In this paper, a model for carpool matching services is proposed, and both optimal and heuristic approaches are tested to find solutions for that model. The results show that different solution approaches are preferred over different ranges of problem instances. Most importantly, it is demonstrated that a new formulation and associated solution procedures can permit the determination of optimal carpool teams and routes. An instantiation of the model is presented (using the street network of Guangzhou city, China to demonstrate how carpool teams can be determined.

  10. 77 FR 27263 - Computer Matching Between the Selective Service System and the Department of Education

    Science.gov (United States)

    2012-05-09

    ... SELECTIVE SERVICE SYSTEM Computer Matching Between the Selective Service System and the Department of Education AGENCY: Selective Service System. Action: Notice. In accordance with the Privacy Act of... of Participating Agencies The Selective Service System (SSS) and the Department of Education (ED). 2...

  11. UltiMatch-NL: a Web service matchmaker based on multiple semantic filters.

    Science.gov (United States)

    Mohebbi, Keyvan; Ibrahim, Suhaimi; Zamani, Mazdak; Khezrian, Mojtaba

    2014-01-01

    In this paper, a Semantic Web service matchmaker called UltiMatch-NL is presented. UltiMatch-NL applies two filters namely Signature-based and Description-based on different abstraction levels of a service profile to achieve more accurate results. More specifically, the proposed filters rely on semantic knowledge to extract the similarity between a given pair of service descriptions. Thus it is a further step towards fully automated Web service discovery via making this process more semantic-aware. In addition, a new technique is proposed to weight and combine the results of different filters of UltiMatch-NL, automatically. Moreover, an innovative approach is introduced to predict the relevance of requests and Web services and eliminate the need for setting a threshold value of similarity. In order to evaluate UltiMatch-NL, the repository of OWLS-TC is used. The performance evaluation based on standard measures from the information retrieval field shows that semantic matching of OWL-S services can be significantly improved by incorporating designed matching filters.

  12. UltiMatch-NL: A Web Service Matchmaker Based on Multiple Semantic Filters

    Science.gov (United States)

    Mohebbi, Keyvan; Ibrahim, Suhaimi; Zamani, Mazdak; Khezrian, Mojtaba

    2014-01-01

    In this paper, a Semantic Web service matchmaker called UltiMatch-NL is presented. UltiMatch-NL applies two filters namely Signature-based and Description-based on different abstraction levels of a service profile to achieve more accurate results. More specifically, the proposed filters rely on semantic knowledge to extract the similarity between a given pair of service descriptions. Thus it is a further step towards fully automated Web service discovery via making this process more semantic-aware. In addition, a new technique is proposed to weight and combine the results of different filters of UltiMatch-NL, automatically. Moreover, an innovative approach is introduced to predict the relevance of requests and Web services and eliminate the need for setting a threshold value of similarity. In order to evaluate UltiMatch-NL, the repository of OWLS-TC is used. The performance evaluation based on standard measures from the information retrieval field shows that semantic matching of OWL-S services can be significantly improved by incorporating designed matching filters. PMID:25157872

  13. Automatic geospatial information Web service composition based on ontology interface matching

    Science.gov (United States)

    Xu, Xianbin; Wu, Qunyong; Wang, Qinmin

    2008-10-01

    With Web services technology the functions of WebGIS can be presented as a kind of geospatial information service, and helped to overcome the limitation of the information-isolated situation in geospatial information sharing field. Thus Geospatial Information Web service composition, which conglomerates outsourced services working in tandem to offer value-added service, plays the key role in fully taking advantage of geospatial information services. This paper proposes an automatic geospatial information web service composition algorithm that employed the ontology dictionary WordNet to analyze semantic distances among the interfaces. Through making matching between input/output parameters and the semantic meaning of pairs of service interfaces, a geospatial information web service chain can be created from a number of candidate services. A practice of the algorithm is also proposed and the result of it shows the feasibility of this algorithm and the great promise in the emerging demand for geospatial information web service composition.

  14. A Propensity Score Matching Analysis of the Effects of Special Education Services.

    Science.gov (United States)

    Morgan, Paul L; Frisco, Michelle; Farkas, George; Hibel, Jacob

    2010-02-01

    We sought to quantify the effectiveness of special education services as naturally delivered in U.S. schools. Specifically, we examined whether children receiving special education services displayed (a) greater reading or mathematics skills, (b) more frequent learning-related behaviors, or (c) less frequent externalizing or internalizing problem behaviors than closely matched peers not receiving such services. To do so, we used propensity score matching techniques to analyze data from the Early Childhood Longitudinal-Study Kindergarten Cohort, 1998-1999, a large scale, nationally representative sample of U.S. schoolchildren. Collectively, results indicate that receipt of special education services has either a negative or statistically non-significant impact on children's learning or behavior. However, special education services do yield a small, positive effect on children's learning-related behaviors.

  15. A Propensity Score Matching Analysis of the Effects of Special Education Services

    Science.gov (United States)

    Morgan, Paul L.; Frisco, Michelle; Farkas, George; Hibel, Jacob

    2013-01-01

    We sought to quantify the effectiveness of special education services as naturally delivered in U.S. schools. Specifically, we examined whether children receiving special education services displayed (a) greater reading or mathematics skills, (b) more frequent learning-related behaviors, or (c) less frequent externalizing or internalizing problem behaviors than closely matched peers not receiving such services. To do so, we used propensity score matching techniques to analyze data from the Early Childhood Longitudinal—Study Kindergarten Cohort, 1998–1999, a large scale, nationally representative sample of U.S. schoolchildren. Collectively, results indicate that receipt of special education services has either a negative or statistically non-significant impact on children’s learning or behavior. However, special education services do yield a small, positive effect on children’s learning-related behaviors. PMID:23606759

  16. An intelligent service matching method for mechanical equipment condition monitoring using the fibre Bragg grating sensor network

    Science.gov (United States)

    Zhang, Fan; Zhou, Zude; Liu, Quan; Xu, Wenjun

    2017-02-01

    Due to the advantages of being able to function under harsh environmental conditions and serving as a distributed condition information source in a networked monitoring system, the fibre Bragg grating (FBG) sensor network has attracted considerable attention for equipment online condition monitoring. To provide an overall conditional view of the mechanical equipment operation, a networked service-oriented condition monitoring framework based on FBG sensing is proposed, together with an intelligent matching method for supporting monitoring service management. In the novel framework, three classes of progressive service matching approaches, including service-chain knowledge database service matching, multi-objective constrained service matching and workflow-driven human-interactive service matching, are developed and integrated with an enhanced particle swarm optimisation (PSO) algorithm as well as a workflow-driven mechanism. Moreover, the manufacturing domain ontology, FBG sensor network structure and monitoring object are considered to facilitate the automatic matching of condition monitoring services to overcome the limitations of traditional service processing methods. The experimental results demonstrate that FBG monitoring services can be selected intelligently, and the developed condition monitoring system can be re-built rapidly as new equipment joins the framework. The effectiveness of the service matching method is also verified by implementing a prototype system together with its performance analysis.

  17. 75 FR 62623 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Internal Revenue Service (IRS...

    Science.gov (United States)

    2010-10-12

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2010-0015] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Internal Revenue Service (IRS))--Match Number 1016 AGENCY: Social Security... regarding protections for such persons. The Privacy Act, as amended, regulates the use of computer matching...

  18. 75 FR 18251 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Internal Revenue Service (IRS...

    Science.gov (United States)

    2010-04-09

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA-2009-0066] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Internal Revenue Service (IRS))--Match 1305 AGENCY: Social Security... INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Public Law (Pub. L.) 100-503...

  19. Collaboratively Conceived, Designed and Implemented: Matching Visualization Tools with Geoscience Data Collections and Geoscience Data Collections with Visualization Tools via the ToolMatch Service.

    Science.gov (United States)

    Hoebelheinrich, N. J.; Lynnes, C.; West, P.; Ferritto, M.

    2014-12-01

    Two problems common to many geoscience domains are the difficulties in finding tools to work with a given dataset collection, and conversely, the difficulties in finding data for a known tool. A collaborative team from the Earth Science Information Partnership (ESIP) has gotten together to design and create a web service, called ToolMatch, to address these problems. The team began their efforts by defining an initial, relatively simple conceptual model that addressed the two uses cases briefly described above. The conceptual model is expressed as an ontology using OWL (Web Ontology Language) and DCterms (Dublin Core Terms), and utilizing standard ontologies such as DOAP (Description of a Project), FOAF (Friend of a Friend), SKOS (Simple Knowledge Organization System) and DCAT (Data Catalog Vocabulary). The ToolMatch service will be taking advantage of various Semantic Web and Web standards, such as OpenSearch, RESTful web services, SWRL (Semantic Web Rule Language) and SPARQL (Simple Protocol and RDF Query Language). The first version of the ToolMatch service was deployed in early fall 2014. While more complete testing is required, a number of communities besides ESIP member organizations have expressed interest in collaborating to create, test and use the service and incorporate it into their own web pages, tools and / or services including the USGS Data Catalog service, DataONE, the Deep Carbon Observatory, Virtual Solar Terrestrial Observatory (VSTO), and the U.S. Global Change Research Program. In this session, presenters will discuss the inception and development of the ToolMatch service, the collaborative process used to design, refine, and test the service, and future plans for the service.

  20. Matching health needs of refugee children with services: how big is the gap?

    Science.gov (United States)

    Raman, Shanti; Wood, Nicholas; Webber, Murray; Taylor, Kellie-Ann; Isaacs, David

    2009-10-01

    To document the health needs of refugee children accessing comprehensive refugee health services in New South Wales (NSW), to match needs with available services and establish gaps in services. We collated clinical data on all children aged under 14 years attending the three refugee specific clinics seeing children in NSW in 2005. We compared these data to the number of refugee children settling in NSW in 2005. NSW received 1,557 refugee children (vitamin D levels. Most children needed catch up immunisation. Other problems included chronic health, developmental and behavioural problems. Screening tests varied across sites. Follow up was problematic for most. A small proportion of refugee children arriving in NSW have access to comprehensive screening and assessment, in spite of significant health needs. There is variation in screening practices, and follow up is poor. There is a high pick up rate for diseases of personal and public health significance. There is a strong moral and public health imperative to provide appropriately resourced, culturally competent and comprehensive health care to optimise refugee children's wellbeing.

  1. 75 FR 5854 - Proposed Collection; Comment Request for e-Services Registration TIN Matching-Application and...

    Science.gov (United States)

    2010-02-04

    ... on or before April 5, 2010 to be assured of consideration. ADDRESSES: Direct all written comments to...--Application and Screens for TIN Matching Interactive. OMB Number: 1545-1823. Abstract: E-services is a system... support electronic filing and resolve tax administration issues for practitioners, payers, States and...

  2. Focused Crawling of the Deep Web Using Service Class Descriptions

    Energy Technology Data Exchange (ETDEWEB)

    Rocco, D; Liu, L; Critchlow, T

    2004-06-21

    Dynamic Web data sources--sometimes known collectively as the Deep Web--increase the utility of the Web by providing intuitive access to data repositories anywhere that Web access is available. Deep Web services provide access to real-time information, like entertainment event listings, or present a Web interface to large databases or other data repositories. Recent studies suggest that the size and growth rate of the dynamic Web greatly exceed that of the static Web, yet dynamic content is often ignored by existing search engine indexers owing to the technical challenges that arise when attempting to search the Deep Web. To address these challenges, we present DynaBot, a service-centric crawler for discovering and clustering Deep Web sources offering dynamic content. DynaBot has three unique characteristics. First, DynaBot utilizes a service class model of the Web implemented through the construction of service class descriptions (SCDs). Second, DynaBot employs a modular, self-tuning system architecture for focused crawling of the DeepWeb using service class descriptions. Third, DynaBot incorporates methods and algorithms for efficient probing of the Deep Web and for discovering and clustering Deep Web sources and services through SCD-based service matching analysis. Our experimental results demonstrate the effectiveness of the service class discovery, probing, and matching algorithms and suggest techniques for efficiently managing service discovery in the face of the immense scale of the Deep Web.

  3. SkyQuery - A Prototype Distributed Query and Cross-Matching Web Service for the Virtual Observatory

    Science.gov (United States)

    Thakar, A. R.; Budavari, T.; Malik, T.; Szalay, A. S.; Fekete, G.; Nieto-Santisteban, M.; Haridas, V.; Gray, J.

    2002-12-01

    We have developed a prototype distributed query and cross-matching service for the VO community, called SkyQuery, which is implemented with hierarchichal Web Services. SkyQuery enables astronomers to run combined queries on existing distributed heterogeneous astronomy archives. SkyQuery provides a simple, user-friendly interface to run distributed queries over the federation of registered astronomical archives in the VO. The SkyQuery client connects to the portal Web Service, which farms the query out to the individual archives, which are also Web Services called SkyNodes. The cross-matching algorithm is run recursively on each SkyNode. Each archive is a relational DBMS with a HTM index for fast spatial lookups. The results of the distributed query are returned as an XML DataSet that is automatically rendered by the client. SkyQuery also returns the image cutout corresponding to the query result. SkyQuery finds not only matches between the various catalogs, but also dropouts - objects that exist in some of the catalogs but not in others. This is often as important as finding matches. We demonstrate the utility of SkyQuery with a brown-dwarf search between SDSS and 2MASS, and a search for radio-quiet quasars in SDSS, 2MASS and FIRST. The importance of a service like SkyQuery for the worldwide astronomical community cannot be overstated: data on the same objects in various archives is mapped in different wavelength ranges and looks very different due to different errors, instrument sensitivities and other peculiarities of each archive. Our cross-matching algorithm preforms a fuzzy spatial join across multiple catalogs. This type of cross-matching is currently often done by eye, one object at a time. A static cross-identification table for a set of archives would become obsolete by the time it was built - the exponential growth of astronomical data means that a dynamic cross-identification mechanism like SkyQuery is the only viable option. SkyQuery was funded by a

  4. Using an Optimized Chinese Address Matching Method to Develop a Geocoding Service: A Case Study of Shenzhen, China

    Directory of Open Access Journals (Sweden)

    Qin Tian

    2016-05-01

    Full Text Available With the coming era of big data and the rapid development and widespread applications of Geographical Information Systems (GISs, geocoding technology is playing an increasingly important role in bridging the gap between non-spatial data resources and spatial data in various fields. However, Chinese geocoding faces great challenges because of the complexity of the address string format in Chinese, which contains no delimiters between Chinese words, and the poor address management resulting from the existence of multiple address authorities spread among different governmental agencies. This paper presents a geocoding service based on an optimized Chinese address matching method, including address modeling, address standardization and address matching. The address model focuses on the spatial semantics of each address element, and the address standardization process is based on an address tree model. A geocoding service application is implemented in practice using a large quantity of data from Shenzhen Municipality. More than 1,460,000 data records were used to test the geocoding service, and good matching rates were achieved with good adaptability and intelligence.

  5. Republication of "A Propensity Score Matching Analysis of the Effects of Special Education Services"

    Science.gov (United States)

    Morgan, Paul L.; Frisco, Michelle L.; Farkas, George; Hibel, Jacob

    2017-01-01

    Since the landmark enactment of Education of the Handicapped Act in 1975, special education supports and services have been provided to children with disabilities. Although costly, the intentionality of these specialized services has been to advance the educational and societal opportunities of children with disabilities as they progress to…

  6. Neural network based pattern matching and spike detection tools and services--in the CARMEN neuroinformatics project.

    Science.gov (United States)

    Fletcher, Martyn; Liang, Bojian; Smith, Leslie; Knowles, Alastair; Jackson, Tom; Jessop, Mark; Austin, Jim

    2008-10-01

    In the study of information flow in the nervous system, component processes can be investigated using a range of electrophysiological and imaging techniques. Although data is difficult and expensive to produce, it is rarely shared and collaboratively exploited. The Code Analysis, Repository and Modelling for e-Neuroscience (CARMEN) project addresses this challenge through the provision of a virtual neuroscience laboratory: an infrastructure for sharing data, tools and services. Central to the CARMEN concept are federated CARMEN nodes, which provide: data and metadata storage, new, thirdparty and legacy services, and tools. In this paper, we describe the CARMEN project as well as the node infrastructure and an associated thick client tool for pattern visualisation and searching, the Signal Data Explorer (SDE). We also discuss new spike detection methods, which are central to the services provided by CARMEN. The SDE is a client application which can be used to explore data in the CARMEN repository, providing data visualization, signal processing and a pattern matching capability. It performs extremely fast pattern matching and can be used to search for complex conditions composed of many different patterns across the large datasets that are typical in neuroinformatics. Searches can also be constrained by specifying text based metadata filters. Spike detection services which use wavelet and morphology techniques are discussed, and have been shown to outperform traditional thresholding and template based systems. A number of different spike detection and sorting techniques will be deployed as services within the CARMEN infrastructure, to allow users to benchmark their performance against a wide range of reference datasets.

  7. Service quality: understanding and implementing the concept in the clinical laboratory. Match service quality to consumer expectations.

    Science.gov (United States)

    O'Connor, S J

    1989-01-01

    The increasingly competitive health-care marketplace has mandated that health-care managers pay careful attention to the issue of quality from the perspective of the consumer. The importance of this issue is underscored by the fact that numerous health-care institutions and associations have recently begun to recognize the urgent need to obtain a greater understanding of service quality in a health-care situation. This article suggests means to understand, identify, improve, and implement effective approaches to this vital aspect of the marketing mix.

  8. 78 FR 69925 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Bureau of the Fiscal Service...

    Science.gov (United States)

    2013-11-21

    ... regarding protections for such persons. The Privacy Act, as amended, regulates the use of computer matching... savings securities. C. Authority for Conducting the Matching Program This computer matching agreement sets... amended by the Computer Matching and Privacy Protection Act of 1988, as amended, and the regulations and...

  9. 78 FR 37875 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Bureau of the Fiscal Service...

    Science.gov (United States)

    2013-06-24

    ...: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer matching... above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988... computer matching involving the Federal government could be performed and adding certain protections for...

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

  11. 78 FR 16048 - Proposed Collection; Comment Request for e-Services Registration TIN Matching-Application and...

    Science.gov (United States)

    2013-03-13

    ... on or before May 13, 2013 to be assured of consideration. ADDRESSES: Direct all written comments to... Interactive. OMB Number: 1545-1823. Abstract: E-services is a system which will permit the Internal Revenue Service to electronically communicate with third party users to support electronic filing and resolve tax...

  12. Designing a reproductive health services package in the universal health insurance scheme in Thailand: match and mismatch of need, demand and supply.

    Science.gov (United States)

    Teerawattananon, Yot; Tangcharoensathien, Viroj

    2004-10-01

    In October 2001 Thailand introduced universal healthcare coverage (UC) financed by general tax revenue. This paper aims to assess the design and content of the UC benefit package, focusing on the part of the package concerned with sexual and reproductive health (SRH). The economic concept of need, demand and supply in the process of developing the SRH package was applied to the analysis. The analysis indicated that SRH constitutes a major part of the package, including the control of communicable and non-communicable diseases, the promotion and maintenance of reproductive health, and early detection and management of reproductive health problems. In addition, the authors identified seven areas within three overlapping spheres; namely need, demand and supply. The burden of disease on reproductive conditions was used as a proxy indicator of health needs in the population; the findings of a study of private obstetric practice in public hospitals as a proxy of patients' demands; and the SRH services offered in the UC package as a proxy of general healthcare supply. The authors recommend that in order to ensure that healthcare needs match consumer demand, the inclusion of SRH services not currently offered in the package (e.g. treatment of HIV infection, abortion services) should be considered, if additional resources can be made available. Where health needs exist but consumers do not express demand, and the appropriate SRH services would provide external benefits to society (e.g. the programme for prevention of sexual and gender-related violence), policymakers are encouraged to expand and offer these services. Efforts should be made to create consumer awareness and stimulate demand. Research can play an important role in identifying the services in which supply matches demand but does not necessarily reflect the health needs of the population (e.g. unnecessary investigations and prescriptions). Where only demand or supply exists (e.g. breast cosmetic procedures and

  13. Impact Evaluation of a System-Wide Chronic Disease Management Program on Health Service Utilisation: A Propensity-Matched Cohort Study.

    Science.gov (United States)

    Billot, Laurent; Corcoran, Kate; McDonald, Alina; Powell-Davies, Gawaine; Feyer, Anne-Marie

    2016-06-01

    The New South Wales Health (NSW Health) Chronic Disease Management Program (CDMP) delivers interventions to adults at risk of hospitalisation for five target chronic conditions that respond well to ambulatory care: diabetes, hypertension, chronic obstructive pulmonary disease, congestive heart failure, and coronary artery disease. The intervention consists of two main components: (1) care coordination across sectors (acute, ambulatory, and community care from both public and private sectors) and clinical specialties, facilitated by program care coordinators, and (2) health coaching including management of lifestyle risk factors and medications and self-management. These components were broadly prescribed by the head office of NSW Health, which funded the program, and were implemented by regional health services (local health districts) in ways that best suited their own history, environment, workforce, and patient need. We used a propensity-matched cohort study to evaluate health service utilisation after enrolment in the CDMP. The evaluation cohort included 41,303 CDMP participants enrolled between 1 January 2011 and 31 December 2013 who experienced at least one hospital admission or emergency department (ED) presentation for a target condition in the 12 mo preceding enrolment. Potential controls were selected from patients not enrolled in the CDMP but experiencing at least one hospital admission or ED presentation over the same period. Each CDMP patient in the evaluation cohort was matched to one control using 1:1 propensity score matching. The primary outcome was avoidable hospitalisations. Secondary outcomes included avoidable readmissions, avoidable bed days, unplanned hospitalisations, unplanned readmissions, unplanned bed days, ED presentations, and all-cause death. The primary analysis consisted of 30,057 CDMP participants and 30,057 matched controls with a median follow-up of 15 mo. Of those, 25,638 (85.3%) and 25,597 (85.2%) were alive by the end of

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

    Science.gov (United States)

    2013-12-05

    ... 1974: CMS Computer Matching Program Match No. 2013-01; HHS Computer Matching Program Match No. 1312 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS... Privacy Act of 1974 (5 U.S.C. 552a), as amended, this notice announces the renewal of a CMP that CMS plans...

  15. Levels of depression in transgender people and its predictors: Results of a large matched control study with transgender people accessing clinical services.

    Science.gov (United States)

    Witcomb, Gemma L; Bouman, Walter Pierre; Claes, Laurence; Brewin, Nicola; Crawford, John R; Arcelus, Jon

    2018-02-17

    Depression is a serious disorder which significantly impacts wellbeing and quality of life. Studies exploring mental wellbeing in the transgender population are mostly limited by small, non-homogenous samples and lack of matched controls. This study aimed to address these limitations and explore depression rates in a large sample of transgender people, compared with matched controls from the general population, as well as factors predicting depression in those taking cross-sex hormone treatment (CHT) compared to those not. Transgender individuals (n = 913) completed a measure of depression, measures which predict psychopathology (self-esteem, victimization, social support, interpersonal problems), and information regarding CHT use. Participants were matched by age and experienced gender with adults from the general population who had completed the measure of depression. Individuals were categorized as having no, possible or probable depressive disorder. Transgender individuals not on CHT had a nearly four-fold increased risk of probable depressive disorder, compared to controls. Older age, lower self-esteem, poorer interpersonal function and less social support predicted depressive disorder. Use of CHT was associated with less depression. Participants were attending a national gender identity service and therefore represent only a sub-group of transgender people. Due to the cross-sectional design, longitudinal research is required to fully confirm the finding that CHT use reduces depression. This study confirms that non-treated transgender individuals have an increased risk of a depressive disorder. Interventions offered alongside gender affirming treatment to develop interpersonal skills, increase self-esteem and improve social support may reduce depression and prepare individuals for a more successful transition. Copyright © 2018. Published by Elsevier B.V.

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

  17. Cost of treating ventilator-associated pneumonia post cardiac surgery in the National Health Service: Results from a propensity-matched cohort study.

    Science.gov (United States)

    Luckraz, Heyman; Manga, Na'ngono; Senanayake, Eshan L; Abdelaziz, Mahmoud; Gopal, Shameer; Charman, Susan C; Giri, Ramesh; Oppong, Raymond; Andronis, Lazaros

    2018-05-01

    Ventilator-associated pneumonia is associated with significant morbidity, mortality and healthcare costs. Most of the cost data that are available relate to general intensive care patients in privately remunerated institutions. This study assessed the cost of managing ventilator-associated pneumonia in a cardiac intensive care unit in the National Health Service in the United Kingdom. Propensity-matched study of prospectively collected data from the cardiac surgical database between April 2011 and December 2014 in all patients undergoing cardiac surgery (n = 3416). Patients who were diagnosed as developing ventilator-associated pneumonia, as per the surveillance definition for ventilator-associated pneumonia (n = 338), were propensity score matched with those who did not (n = 338). Costs of treating post-op cardiac surgery patients in intensive care and cost difference if ventilator-associated pneumonia occurred based on Healthcare Resource Group categories were assessed. Secondary outcomes included differences in morbidity, mortality and cardiac intensive care unit and in-hospital length of stay. There were no significant differences in the pre-operative characteristics or procedures between the groups. Ventilator-associated pneumonia developed in 10% of post-cardiac surgery patients. Post-operatively, the ventilator-associated pneumonia group required longer ventilation (p < 0.01), more respiratory support, longer cardiac intensive care unit (8 vs 3, p < 0.001) and in-hospital stay (16 vs 9) days. The overall cost for post-operative recovery after cardiac surgery for ventilator-associated pneumonia patients was £15,124 compared to £6295 for non-ventilator-associated pneumonia (p < 0.01). The additional cost of treating patients with ventilator-associated pneumonia was £8829. Ventilator-associated pneumonia was associated with significant morbidity to the patients, generating significant costs. This cost was nearer to the lower end for

  18. MENINGKATKAN KEMAMPUAN SERVICE DALAM PERMAINAN BOLA VOLLY DENGAN MAKE A MATCH PADA SISWA KELAS VII-H SMP NEGERI 1 WONOASRI

    Directory of Open Access Journals (Sweden)

    Anik Sri Handayani

    2016-11-01

    Full Text Available In the learning process of Physical Education in, teachers are expected to teach varieties of basic motor skills, techniques and strategy of games and sports, internalization of values (sportsmanship, honesty, cooperation, etc. as well as the conditioning of healthy lifestyles. The implementation is not through conventional teaching in the classroom consisting theoretical studies, but it also involves elements of physical, mental, intellectual, emotional and social. The activities which are given in teaching should get a methodical didactic touch, so that the activities carried out can achieve the aim of teaching. The problem formulation of this research is: is there an increase in the ability of service in the game of volleyball with “make-match” at VII-H grade of SMP Negeri 1 Wonoasri in 2012/2013 academic year? The purpose Classroom Action Research (CAR is to improve the quality of learning on the physical education in doing “service” in a volleyball game through a “make-match” learning approach  In this study, researchers have collaboration with other teachers and the principal. Researchers are involved in the study from the beginning to the end of the researech. Researchers try to see, observe, feel, live, reflect and evaluate learning activities that take place. The implementation stages of the action research consist of planning, acting, observation, and reflection. To obtain accurate results, the collected data in study were statistically analyzed using the formulas of mean or average.  The result showed that the average value of the first cycle of 66.14 (46.33% while the Cycle II 91.29 (96.43% in the second cycle, it has increased significantly. Referring to the hypothesis that the actions proposed in this class action research, it can be concluded that: there is an increased ability of “service” in volleyball games with “make-a-match” at VII-H grade of SMP Negeri 1 Wonoasri in 2012/2013 academic year.   Keywords

  19. Use of health services in the last year of life and cause of death in people with intellectual disability: a retrospective matched cohort study.

    Science.gov (United States)

    Brameld, Kate; Spilsbury, Katrina; Rosenwax, Lorna; Leonard, Helen; Semmens, James

    2018-02-25

    To describe the cause of death together with emergency department presentations and hospital admissions in the last year of life of people with intellectual disability. A retrospective matched cohort study using de-identified linked data of people aged 20 years or over, with and without intellectual disability who died during 2009 to 2013 in Western Australia. Emergency department presentations and hospital admissions in the last year of life of people with intellectual disability are described along with cause of death. Of the 63 508 deaths in Western Australia from 2009 to 2013, there were 591 (0.93%) decedents with a history of intellectual disability. Decedents with intellectual disability tended to be younger, lived in areas of more social disadvantage, did not have a partner and were Australian born compared with all other decedents. A matched comparison cohort of decedents without intellectual disability (n=29 713) was identified from the general population to improve covariate balance.Decedents with intellectual disability attended emergency departments more frequently than the matched cohort (mean visits 3.2 vs 2.5) and on average were admitted to hospital less frequently (mean admissions 4.1 vs 6.1), but once admitted stayed longer (average length of stay 5.2 days vs 4.3 days). People with intellectual disability had increased odds of presentation, admission or death from conditions that have been defined as ambulatory care sensitive and are potentially preventable. These included vaccine-preventable respiratory disease, asthma, cellulitis and convulsions and epilepsy. People with intellectual disability were more likely to experience potentially preventable conditions at the end of their lives. This indicates a need for further improvements in access, quality and coordination of healthcare to provide optimal health for this group. © Article author(s) (or their employer(s) unless otherwise stated in the text of the article) 2018. All rights reserved

  20. Psychological autopsy study comparing suicide decedents, suicide ideators, and propensity score matched controls: results from the study to assess risk and resilience in service members (Army STARRS).

    Science.gov (United States)

    Nock, M K; Dempsey, C L; Aliaga, P A; Brent, D A; Heeringa, S G; Kessler, R C; Stein, M B; Ursano, R J; Benedek, D

    2017-11-01

    The suicide rate has increased significantly among US Army soldiers over the past decade. Here we report the first results from a large psychological autopsy study using two control groups designed to reveal risk factors for suicide death among soldiers beyond known sociodemographic factors and the presence of suicide ideation. Informants were next-of-kin and Army supervisors for: 135 suicide cases, 137 control soldiers propensity-score-matched on known sociodemographic risk factors for suicide and Army history variables, and 118 control soldiers who reported suicide ideation in the past year. Results revealed that most (79.3%) soldiers who died by suicide have a prior mental disorder; mental disorders in the prior 30-days were especially strong risk factors for suicide death. Approximately half of suicide decedents tell someone that they are considering suicide. Virtually all of the risk factors identified in this study differed between suicide cases and propensity-score-matched controls, but did not significantly differ between suicide cases and suicide ideators. The most striking difference between suicides and ideators was the presence in the former of an internalizing disorder (especially depression) and multi-morbidity (i.e. 3+ disorders) in the past 30 days. Most soldiers who die by suicide have identifiable mental disorders shortly before their death and tell others about their suicidal thinking, suggesting that there are opportunities for prevention and intervention. However, few risk factors distinguish between suicide ideators and decedents, pointing to an important direction for future research.

  1. Evaluation of pre-hospital administration of adrenaline (epinephrine) by emergency medical services for patients with out of hospital cardiac arrest in Japan: controlled propensity matched retrospective cohort study.

    Science.gov (United States)

    Nakahara, Shinji; Tomio, Jun; Takahashi, Hideto; Ichikawa, Masao; Nishida, Masamichi; Morimura, Naoto; Sakamoto, Tetsuya

    2013-12-10

    To evaluate the effectiveness of pre-hospital adrenaline (epinephrine) administered by emergency medical services to patients with out of hospital cardiac arrest. Controlled propensity matched retrospective cohort study, in which pairs of patients with or without (control) adrenaline were created with a sequential risk set matching based on time dependent propensity score. Japan's nationwide registry database of patients with out of hospital cardiac arrest registered between January 2007 and December 2010. Among patients aged 15-94 with out of hospital cardiac arrest witnessed by a bystander, we created 1990 pairs of patients with and without adrenaline with an initial rhythm of ventricular fibrillation or pulseless ventricular tachycardia (VF/VT) and 9058 pairs among those with non-VF/VT. Overall and neurologically intact survival at one month or at discharge, whichever was earlier. After propensity matching, pre-hospital administration of adrenaline by emergency medical services was associated with a higher proportion of overall survival (17.0% v 13.4%; unadjusted odds ratio 1.34, 95% confidence interval 1.12 to 1.60) but not with neurologically intact survival (6.6% v 6.6%; 1.01, 0.78 to 1.30) among those with VF/VT; and higher proportions of overall survival (4.0% v 2.4%; odds ratio 1.72, 1.45 to 2.04) and neurologically intact survival (0.7% v 0.4%; 1.57, 1.04 to 2.37) among those with non-VF/VT. Pre-hospital administration of adrenaline by emergency medical services improves the long term outcome in patients with out of hospital cardiac arrest, although the absolute increase of neurologically intact survival was minimal.

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

    Science.gov (United States)

    2013-08-07

    ... 1974; CMS Computer Match No. 2013-02; HHS Computer Match No. 1306; DoD-DMDC Match No. 12 AGENCY: Department of Health and Human Services (HHS), Centers for Medicare & Medicaid Services (CMS). ACTION: Notice... of 1974, as amended, this notice establishes a CMP that CMS plans to conduct with the Department of...

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

    ... 1974; CMS Computer Match No. 2013-07; HHS Computer Match No. 1303; DoD-DMDC Match No. 18 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION... Act of 1974, as amended, this notice announces the establishment of a CMP that CMS plans to conduct...

  4. Effect of a home-based end-of-life nursing service on hospital use at the end of life and place of death: a study using administrative data and matched controls.

    Science.gov (United States)

    Chitnis, X A; Georghiou, T; Steventon, A; Bardsley, M J

    2013-12-01

    To assess the effect of routinely delivered home-based end-of-life care on hospital use at the end of life and place of death. Retrospective analysis using matched controls and administrative data. Community-based care in England. 29,538 people aged over 18 who received Marie Curie nursing support compared with 29,538 controls individually matched on variables including: age, socioeconomic deprivation, prior hospital use, number of chronic conditions and prior diagnostic history. Home-based end-of-life nursing care delivered by the Marie Curie Nursing Service (MCNS), compared with end-of-life care available to those who did not receive MCNS care. Proportion of people who died at home; numbers of emergency and elective inpatient admissions, outpatient attendances and attendances at emergency departments in the period until death; and notional costs of hospital care. Intervention patients were significantly more likely to die at home and less likely to die in hospital than matched controls (unadjusted OR 6.16, 95% CI 5.94 to 6.38, pnursing for longer. Home-based end-of-life care offers the potential to reduce demand for acute hospital care and increase the number of people able to die at home.

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

  6. 78 FR 50419 - Privacy Act of 1974; CMS Computer Match No. 2013-10; HHS Computer Match No. 1310

    Science.gov (United States)

    2013-08-19

    ... 1974; CMS Computer Match No. 2013-10; HHS Computer Match No. 1310 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION: Notice of Computer Matching... notice announces the establishment of a CMP that CMS plans to conduct with the Department of Homeland...

  7. 78 FR 39730 - Privacy Act of 1974; CMS Computer Match No. 2013-11; HHS Computer Match No. 1302

    Science.gov (United States)

    2013-07-02

    ... 1974; CMS Computer Match No. 2013-11; HHS Computer Match No. 1302 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION: Notice of Computer Matching... notice announces the establishment of a CMP that CMS intends to conduct with State-based Administering...

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

    Science.gov (United States)

    2011-03-17

    ... 1974; CMS Computer Match No. 2011-02; HHS Computer Match No. 1007 AGENCY: Department of Health and Human Services (HHS), Centers for Medicare & Medicaid Services (CMS). ACTION: Notice of computer... notice establishes a computer matching agreement between CMS and the Department of Defense (DoD). We have...

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

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

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

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

  13. Matching Extension Service With Farmers' Needs: Towards ...

    African Journals Online (AJOL)

    Eastern Africa Social Science Research Review. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 24, No 2 (2008) >. Log in or Register to get access to full text downloads.

  14. Services

    International Nuclear Information System (INIS)

    Hardeman, F.

    1998-01-01

    The objectives of the services section is (1) to offer complete services in health-physics measurements according to international quality standards, (2) to improve continuously these measurement techniques and to follow up international recommendations and legislation concerning the surveillance of workers, (3) to support and advise nuclear and non-nuclear industry on problems of radioactive contamination. Achievements related to gamma spectrometry, whole-body counting, beta and alpha spectrometry, dosimetry, radon measurements, calibration, instrumentation, and neutron activation analysis are described

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

    ... 1974; CMS Computer Match No. 2010-03, HHS Computer Match No. 1003, SSA Computer Match No. 1048, IRS... Services (CMS). ACTION: Notice of renewal of an existing computer matching program (CMP) that has an...'' section below for comment period. DATES: Effective Dates: CMS filed a report of the Computer Matching...

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

  17. Data Matching Imputation System

    Data.gov (United States)

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

  18. 45 CFR 2516.700 - What matching funds are required?

    Science.gov (United States)

    2010-10-01

    ... COMMUNITY SERVICE SCHOOL-BASED SERVICE-LEARNING PROGRAMS Funding Requirements § 2516.700 What matching funds... for that share through State sources, local sources, or Federal sources (other than funds made...

  19. Magnetic safety matches

    Science.gov (United States)

    Lindén, J.; Lindberg, M.; Greggas, A.; Jylhävuori, N.; Norrgrann, H.; Lill, J. O.

    2017-07-01

    In addition to the main ingredients; sulfur, potassium chlorate and carbon, ordinary safety matches contain various dyes, glues etc, giving the head of the match an even texture and appealing color. Among the common reddish-brown matches there are several types, which after ignition can be attracted by a strong magnet. Before ignition the match head is generally not attracted by the magnet. An elemental analysis based on proton-induced x-ray emission was performed to single out iron as the element responsible for the observed magnetism. 57Fe Mössbauer spectroscopy was used for identifying the various types of iron-compounds, present before and after ignition, responsible for the macroscopic magnetism: Fe2O3 before and Fe3O4 after. The reaction was verified by mixing the main chemicals in the match-head with Fe2O3 in glue and mounting the mixture on a match stick. The ash residue after igniting the mixture was magnetic.

  20. Latent palmprint matching.

    Science.gov (United States)

    Jain, Anil K; Feng, Jianjiang

    2009-06-01

    The evidential value of palmprints in forensic applications is clear as about 30 percent of the latents recovered from crime scenes are from palms. While biometric systems for palmprint-based personal authentication in access control type of applications have been developed, they mostly deal with low-resolution (about 100 ppi) palmprints and only perform full-to-full palmprint matching. We propose a latent-to-full palmprint matching system that is needed in forensic applications. Our system deals with palmprints captured at 500 ppi (the current standard in forensic applications) or higher resolution and uses minutiae as features to be compatible with the methodology used by latent experts. Latent palmprint matching is a challenging problem because latent prints lifted at crime scenes are of poor image quality, cover only a small area of the palm, and have a complex background. Other difficulties include a large number of minutiae in full prints (about 10 times as many as fingerprints), and the presence of many creases in latents and full prints. A robust algorithm to reliably estimate the local ridge direction and frequency in palmprints is developed. This facilitates the extraction of ridge and minutiae features even in poor quality palmprints. A fixed-length minutia descriptor, MinutiaCode, is utilized to capture distinctive information around each minutia and an alignment-based minutiae matching algorithm is used to match two palmprints. Two sets of partial palmprints (150 live-scan partial palmprints and 100 latent palmprints) are matched to a background database of 10,200 full palmprints to test the proposed system. Despite the inherent difficulty of latent-to-full palmprint matching, rank-1 recognition rates of 78.7 and 69 percent, respectively, were achieved in searching live-scan partial palmprints and latent palmprints against the background database.

  1. Five-Year Effectiveness of the Multidisciplinary Risk Assessment and Management Programme-Diabetes Mellitus (RAMP-DM) on Diabetes-Related Complications and Health Service Uses-A Population-Based and Propensity-Matched Cohort Study.

    Science.gov (United States)

    Wan, Eric Yuk Fai; Fung, Colman Siu Cheung; Jiao, Fang Fang; Yu, Esther Yee Tak; Chin, Weng Yee; Fong, Daniel Yee Tak; Wong, Carlos King Ho; Chan, Anca Ka Chun; Chan, Karina Hiu Yen; Kwok, Ruby Lai Ping; Lam, Cindy Lo Kuen

    2018-01-01

    To evaluate the 5-year effectiveness of a multidisciplinary Risk Assessment and Management Programme-Diabetes Mellitus (RAMP-DM) in primary care patients with type 2 diabetes. A 5-year prospective cohort study was conducted with 121,584 Chinese primary care patients with type 2 DM who were recruited between August 2009 and June 2011. Missing data were dealt with multiple imputations. After excluding patients with prior diabetes mellitus (DM)-related complications and one-to-one propensity score matching on all patient characteristics, 26,718 RAMP-DM participants and 26,718 matched usual care patients were followed up for a median time of 4.5 years. The effect of RAMP-DM on nine DM-related complications and all-cause mortality were evaluated using Cox regressions. The first incidence for each event was used for all models. Health service use was analyzed using negative binomial regressions. Subgroup analyses on different patient characteristics were performed. The cumulative incidence of all events (DM-related complications and all-cause mortality) was 23.2% in the RAMP-DM group and 43.6% in the usual care group. RAMP-DM led to significantly greater reductions in cardiovascular disease (CVD) risk by 56.6% (95% CI 54.5, 58.6), microvascular complications by 11.9% (95% CI 7.0, 16.6), mortality by 66.1% (95% CI 64.3, 67.9), specialist attendance by 35.0% (95% CI 33.6, 36.4), emergency attendance by 41.2% (95% CI 39.8, 42.5), and hospitalizations by 58.5% (95% CI 57.2, 59.7). Patients with low baseline CVD risks benefitted the most from RAMP-DM, which decreased CVD and mortality risk by 60.4% (95% CI 51.8, 67.5) and 83.6% (95% CI 79.3, 87.0), respectively. This naturalistic study highlighted the importance of early optimal DM control and risk factor management by risk stratification and multidisciplinary, protocol-driven, chronic disease model care to delay disease progression and prevent complications. © 2017 by the American Diabetes Association.

  2. Utility of a Job-Person Match for Personnel Selection.

    Science.gov (United States)

    Camara, Wayne J.

    A backlog of applicants for civil service positions and a work overload on selection and classification specialists at one civil service office prompted a study of the usefulness of a job-person match for personnel selection. An instrument measuring applicants' match to a large number of professional and technical jobs within a state civil service…

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

  4. Dewey Concentration Match.

    Science.gov (United States)

    School Library Media Activities Monthly, 1996

    1996-01-01

    Giving students a chance to associate numbers with subjects can be useful in speeding their location of desired print or nonprint materials and helping students feel independent when browsing. A matching game for helping students learn the Dewey numbers is presented. Instructions for the library media specialist or teacher, instructions for…

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

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

  7. Polytypic pattern matching

    NARCIS (Netherlands)

    Jeuring, J.T.

    1995-01-01

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

  8. Is Matching Innate?

    Science.gov (United States)

    Gallistel, C. R.; King, Adam Philip; Gottlieb, Daniel; Balci, Fuat; Papachristos, Efstathios B.; Szalecki, Matthew; Carbone, Kimberly S.

    2007-01-01

    Experimentally naive mice matched the proportions of their temporal investments (visit durations) in two feeding hoppers to the proportions of the food income (pellets per unit session time) derived from them in three experiments that varied the coupling between the behavioral investment and food income, from no coupling to strict coupling.…

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

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

  11. 7 CFR 3430.906 - Matching requirements.

    Science.gov (United States)

    2010-01-01

    ... 7 Agriculture 15 2010-01-01 2010-01-01 false Matching requirements. 3430.906 Section 3430.906 Agriculture Regulations of the Department of Agriculture (Continued) COOPERATIVE STATE RESEARCH, EDUCATION, AND EXTENSION SERVICE, DEPARTMENT OF AGRICULTURE COMPETITIVE AND NONCOMPETITIVE NON-FORMULA FEDERAL...

  12. 7 CFR 3419.2 - Matching funds.

    Science.gov (United States)

    2010-01-01

    ... Regulations of the Department of Agriculture (Continued) COOPERATIVE STATE RESEARCH, EDUCATION, AND EXTENSION SERVICE, DEPARTMENT OF AGRICULTURE MATCHING FUNDS REQUIREMENT FOR AGRICULTURAL RESEARCH AND EXTENSION FORMULA FUNDS AT 1890 LAND-GRANT INSTITUTIONS, INCLUDING TUSKEGEE UNIVERSITY, AND AT 1862 LAND-GRANT...

  13. Adaptive Discrete Hypergraph Matching.

    Science.gov (United States)

    Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao

    2018-02-01

    This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.

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

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

  16. Matching with transfer matrices

    International Nuclear Information System (INIS)

    Perez-Alvarez, R.; Velasco, V.R.; Garcia-Moliner, F.; Rodriguez-Coppola, H.

    1987-10-01

    An ABC configuration - which corresponds to various systems of physical interest, such as a barrier or a quantum well - is studied by combining a surface Green function matching analysis of the entire system with a description of the intermediate (B) region in terms of a transfer matrix in the sense of Mora et al. (1985). This hybrid approach proves very useful when it is very difficult to construct the corresponding Green function G B . An application is made to the calculation of quantised subband levels in a parabolic quantum well. Further possibilities of extension of this approach are pointed out. (author). 27 refs, 1 tab

  17. Coaxial pulse matching transformer

    International Nuclear Information System (INIS)

    Ledenev, V.V.; Khimenko, L.T.

    1986-01-01

    This paper describes a coaxial pulse matching transformer with comparatively simple design, increased mechanical strength, and low stray inductance. The transformer design makes it easy to change the turns ratio. The circuit of the device and an expression for the current multiplication factor are presented; experiments confirm the efficiency of the transformer. Apparatus with a coaxial transformer for producing high-power pulsed magnetic fields is designed (current pulses of 1-10 MA into a load and a natural frequency of 100 kHz)

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

  19. Optimal background matching camouflage.

    Science.gov (United States)

    Michalis, Constantine; Scott-Samuel, Nicholas E; Gibson, David P; Cuthill, Innes C

    2017-07-12

    Background matching is the most familiar and widespread camouflage strategy: avoiding detection by having a similar colour and pattern to the background. Optimizing background matching is straightforward in a homogeneous environment, or when the habitat has very distinct sub-types and there is divergent selection leading to polymorphism. However, most backgrounds have continuous variation in colour and texture, so what is the best solution? Not all samples of the background are likely to be equally inconspicuous, and laboratory experiments on birds and humans support this view. Theory suggests that the most probable background sample (in the statistical sense), at the size of the prey, would, on average, be the most cryptic. We present an analysis, based on realistic assumptions about low-level vision, that estimates the distribution of background colours and visual textures, and predicts the best camouflage. We present data from a field experiment that tests and supports our predictions, using artificial moth-like targets under bird predation. Additionally, we present analogous data for humans, under tightly controlled viewing conditions, searching for targets on a computer screen. These data show that, in the absence of predator learning, the best single camouflage pattern for heterogeneous backgrounds is the most probable sample. © 2017 The Authors.

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

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

  2. Kinetics of matching.

    Science.gov (United States)

    Mark, T A; Gallistel, C R

    1994-01-01

    Rats responded on concurrent variable interval schedules of brain stimulation reward in 2-trial sessions. Between trials, there was a 16-fold reversal in the relative rate of reward. In successive, narrow time windows, the authors compared the ratio of the times spent on the 2 levers to the ratio of the rewards received. Time-allocation ratios tracked wide, random fluctuations in the reward ratio. The adjustment to the midsession reversal in relative rate of reward was largely completed within 1 interreward interval on the leaner schedule. Both results were unaffected by a 16-fold change in the combined rates of reward. The large, rapid, scale-invariant shifts in time-allocation ratios that underlie matching behavior imply that the subjective relative rate of reward can be determined by a very few of the most recent interreward intervals and that this estimate can directly determine the ratio of the expected stay durations.

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

  4. Matching Schools With Students

    Science.gov (United States)

    Grimes, Paul

    1977-01-01

    The Greater Cleveland External Degree Center is a nonprofit counseling organization and one of the most successful operations in the relatively new field called "educational brokering". Three brokerage services are described and a number of other large brokers listed. These educational brokers are middlemen in the field of adult…

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

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

  7. 7 CFR 3419.5 - Certification of matching funds.

    Science.gov (United States)

    2010-01-01

    ....5 Agriculture Regulations of the Department of Agriculture (Continued) COOPERATIVE STATE RESEARCH, EDUCATION, AND EXTENSION SERVICE, DEPARTMENT OF AGRICULTURE MATCHING FUNDS REQUIREMENT FOR AGRICULTURAL RESEARCH AND EXTENSION FORMULA FUNDS AT 1890 LAND-GRANT INSTITUTIONS, INCLUDING TUSKEGEE UNIVERSITY, AND AT...

  8. Spatial competition with intermediated matching

    NARCIS (Netherlands)

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

    1995-01-01

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

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

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

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

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

  13. Probability matching and strategy availability

    OpenAIRE

    J. Koehler, Derek; Koehler, Derek J.; James, Greta

    2010-01-01

    Findings from two experiments indicate that probability matching in sequential choice arises from an asymmetry in strategy availability: The matching strategy comes readily to mind, whereas a superior alternative strategy, maximizing, does not. First, compared with the minority who spontaneously engage in maximizing, the majority of participants endorse maximizing as superior to matching in a direct comparison when both strategies are described. Second, when the maximizing strategy is brought...

  14. An Incentive Theory of Matching

    OpenAIRE

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

    2010-01-01

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

  15. DOE Matching Grant Program; FINAL

    International Nuclear Information System (INIS)

    Dr Marvin Adams

    2002-01-01

    OAK 270 - The DOE Matching Grant Program provided$50,000.00 to the Dept of N.E. at TAMU, matching a gift of$50,000.00 from TXU Electric. The$100,000.00 total was spent on scholarships, departmental labs, and computing network

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

  17. Platform pricing in matching markets

    NARCIS (Netherlands)

    Goos, M.; van Cayseele, P.; Willekens, B.

    2011-01-01

    This paper develops a simple model of monopoly platform pricing accounting for two pertinent features of matching markets. 1) The trading process is characterized by search and matching frictions implying limits to positive cross-side network effects and the presence of own-side congestion.

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

  19. Role model and prototype matching

    DEFF Research Database (Denmark)

    Lykkegaard, Eva; Ulriksen, Lars

    2016-01-01

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

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

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

  2. The match-to-match variation of match-running in elite female soccer.

    Science.gov (United States)

    Trewin, Joshua; Meylan, César; Varley, Matthew C; Cronin, John

    2018-02-01

    The purpose of this study was to examine the match-to-match variation of match-running in elite female soccer players utilising GPS, using full-match and rolling period analyses. Longitudinal study. Elite female soccer players (n=45) from the same national team were observed during 55 international fixtures across 5 years (2012-2016). Data was analysed using a custom built MS Excel spreadsheet as full-matches and using a rolling 5-min analysis period, for all players who played 90-min matches (files=172). Variation was examined using co-efficient of variation and 90% confidence limits, calculated following log transformation. Total distance per minute exhibited the smallest variation when both the full-match and peak 5-min running periods were examined (CV=6.8-7.2%). Sprint-efforts were the most variable during a full-match (CV=53%), whilst high-speed running per minute exhibited the greatest variation in the post-peak 5-min period (CV=143%). Peak running periods were observed as slightly more variable than full-match analyses, with the post-peak period very-highly variable. Variability of accelerations (CV=17%) and Player Load (CV=14%) was lower than that of high-speed actions. Positional differences were also present, with centre backs exhibiting the greatest variation in high-speed movements (CV=41-65%). Practitioners and researchers should account for within player variability when examining match performances. Identification of peak running periods should be used to assist worst case scenarios. Whilst micro-sensor technology should be further examined as to its viable use within match-analyses. Copyright © 2017 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.

  3. SERVICE QUALITY IN THE PUBLIC SERVICE

    OpenAIRE

    Prabha Ramseook-Munhurrun; Soolakshna D. Lukea-Bhiwajee; Perunjodi Naidoo

    2010-01-01

    The purpose of this paper is to obtain a better understanding of the extent to which service quality is delivered within the Mauritian public service by drawing on front-line employees (FLE) and customer perceptions of service quality. The paper investigates how closely customer expectations of service and FLE perceptions of customer expectations match. SERVQUAL is used to measure service quality amongst FLE and customers in a major public sector department in Mauritius. The survey captures c...

  4. Matching by Monotonic Tone Mapping.

    Science.gov (United States)

    Kovacs, Gyorgy

    2018-06-01

    In this paper, a novel dissimilarity measure called Matching by Monotonic Tone Mapping (MMTM) is proposed. The MMTM technique allows matching under non-linear monotonic tone mappings and can be computed efficiently when the tone mappings are approximated by piecewise constant or piecewise linear functions. The proposed method is evaluated in various template matching scenarios involving simulated and real images, and compared to other measures developed to be invariant to monotonic intensity transformations. The results show that the MMTM technique is a highly competitive alternative of conventional measures in problems where possible tone mappings are close to monotonic.

  5. MATCHING IN INFORMAL FINANCIAL INSTITUTIONS.

    Science.gov (United States)

    Eeckhout, Jan; Munshi, Kaivan

    2010-09-01

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

  6. How is the high vaginal swab used to investigate vaginal discharge in primary care and how do GPs' expectations of the test match the tests performed by their microbiology services?

    Science.gov (United States)

    Noble, H; Estcourt, C; Ison, C; Goold, P; Tite, L; Carter, Y H

    2004-06-01

    To describe the management of vaginal discharge in general practice, with particular regard to the use of the high vaginal swab (HVS), and to compare GPs' expectations of this test with the processing and reporting undertaken by different laboratories. A postal questionnaire survey of 2146 GPs in the North Thames area and postal questionnaire study of the 22 laboratories serving the same GPs were carried out. GPs were asked how they would manage a young woman with vaginal discharge and what information they would like on an HVS report. Laboratories were asked how they would process and report on the HVS sample from the same patient. Response rate was 26%. 72% of GPs would take an HVS and 62% would refer on to a genitourinary medicine (GUM) clinic. 45% would offer empirical therapy and 47% of these would treat for candida initially. 75% of GPs routinely request "M,C&S" on HVS samples but 55% only want to be informed about specific pathogens. Routine processing of HVS samples varies widely between laboratories and 86% only report specific pathogens. 78% of GPs would like to be offered a suggested diagnosis on HVS reports, and 74% would like a suggested treatment. 43% of laboratories ever provide a diagnosis, and 14% provide a suggested treatment. GPs frequently manage vaginal discharge and most of them utilise the HVS. GPs' expectations of the test are not well matched to laboratory processing or reporting of the samples.

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

  8. Probability matching and strategy availability.

    Science.gov (United States)

    Koehler, Derek J; James, Greta

    2010-09-01

    Findings from two experiments indicate that probability matching in sequential choice arises from an asymmetry in strategy availability: The matching strategy comes readily to mind, whereas a superior alternative strategy, maximizing, does not. First, compared with the minority who spontaneously engage in maximizing, the majority of participants endorse maximizing as superior to matching in a direct comparison when both strategies are described. Second, when the maximizing strategy is brought to their attention, more participants subsequently engage in maximizing. Third, matchers are more likely than maximizers to base decisions in other tasks on their initial intuitions, suggesting that they are more inclined to use a choice strategy that comes to mind quickly. These results indicate that a substantial subset of probability matchers are victims of "underthinking" rather than "overthinking": They fail to engage in sufficient deliberation to generate a superior alternative to the matching strategy that comes so readily to mind.

  9. Computing solutions for matching games

    NARCIS (Netherlands)

    Biró, Péter; Kern, Walter; Paulusma, Daniël

    2012-01-01

    A matching game is a cooperative game (N, v) defined on a graph G = (N, E) with an edge weighting w : E → R+. The player set is N and the value of a coalition S ⊆ N is defined as the maximum weight of a matching in the subgraph induced by S. First we present an O(nm+n2 log n) algorithm that tests if

  10. Probability Matching, Fast and Slow

    OpenAIRE

    Koehler, Derek J.; James, Greta

    2014-01-01

    A prominent point of contention among researchers regarding the interpretation of probability-matching behavior is whether it represents a cognitively sophisticated, adaptive response to the inherent uncertainty of the tasks or settings in which it is observed, or whether instead it represents a fundamental shortcoming in the heuristics that support and guide human decision making. Put crudely, researchers disagree on whether probability matching is "smart" or "dumb." Here, we consider eviden...

  11. Matching games with partial information

    Science.gov (United States)

    Laureti, Paolo; Zhang, Yi-Cheng

    2003-06-01

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

  12. 76 FR 48811 - Computer Matching and Privacy Protection Act of 1988

    Science.gov (United States)

    2011-08-09

    ... CORPORATION FOR NATIONAL AND COMMUNITY SERVICE Computer Matching and Privacy Protection Act of... of the Computer Matching and Privacy Protection Act of 1988 (54 FR 25818, June 19, 1989), and OMB... Security Administration (``SSA''). DATES: CNCS will file a report on the computer matching agreement with...

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

    ...; Computer Matching Program (SSA Internal Match)--Match Number 1014 AGENCY: Social Security Administration... regarding protections for such persons. The Privacy Act, as amended, regulates the use of computer matching....C. 552a, as amended, and the provisions of the Computer Matching and Privacy Protection Act of 1988...

  14. Matching faces with emotional expressions

    Directory of Open Access Journals (Sweden)

    Wenfeng eChen

    2011-08-01

    Full Text Available There is some evidence that faces with a happy expression are recognized better than faces with other expressions. However, little is known about whether this happy face advantage also applies to perceptual face matching, and whether similar differences exist among other expressions. Using a sequential matching paradigm, we systematically compared the effects of seven basic facial expressions on identity recognition. Identity matching was quickest when a pair of faces had an identical happy/sad/neutral expression, poorer when they had a fearful/surprise/angry expression, and poorest when they had a disgust expression. Faces with a happy/sad/fear/surprise expression were matched faster than those with an anger/disgust expression when the second face in a pair had a neutral expression. These results demonstrate that effects of facial expression on identity recognition are not limited to happy faces when a learned face is immediately tested. The results suggest different influences of expression in perceptual matching and long-term recognition memory.

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

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

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

  18. Web service discovery among large service pools utilising semantic similarity and clustering

    Science.gov (United States)

    Chen, Fuzan; Li, Minqiang; Wu, Harris; Xie, Lingli

    2017-03-01

    With the rapid development of electronic business, Web services have attracted much attention in recent years. Enterprises can combine individual Web services to provide new value-added services. An emerging challenge is the timely discovery of close matches to service requests among large service pools. In this study, we first define a new semantic similarity measure combining functional similarity and process similarity. We then present a service discovery mechanism that utilises the new semantic similarity measure for service matching. All the published Web services are pre-grouped into functional clusters prior to the matching process. For a user's service request, the discovery mechanism first identifies matching services clusters and then identifies the best matching Web services within these matching clusters. Experimental results show that the proposed semantic discovery mechanism performs better than a conventional lexical similarity-based mechanism.

  19. Canonical Skeletons for Shape Matching

    NARCIS (Netherlands)

    Eede, M. van; Macrini, D.; Telea, A.; Sminchisescu, C.; Dickinson, S.

    2006-01-01

    Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for shape matching and object recognition. However, it is well known that skeletal structure can be unstable under minor boundary deformation, part articulation, and minor shape deformation (due to, for

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

  1. Monetary Exchange with Multilateral Matching

    DEFF Research Database (Denmark)

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

    the results with Kiyotaki and Wright (1993), Trejos and Wright (1995), and Lagos and Wright (2005) respectively. We find that the multilateral matching setting generates very simple and intuitive equilibrium allocations that are similar to those in the other papers, but which have important differences...

  2. Towards optimal packed string matching

    DEFF Research Database (Denmark)

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

    2014-01-01

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

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

  4. Myocardium tracking via matching distributions.

    Science.gov (United States)

    Ben Ayed, Ismail; Li, Shuo; Ross, Ian; Islam, Ali

    2009-01-01

    The goal of this study is to investigate automatic myocardium tracking in cardiac Magnetic Resonance (MR) sequences using global distribution matching via level-set curve evolution. Rather than relying on the pixelwise information as in existing approaches, distribution matching compares intensity distributions, and consequently, is well-suited to the myocardium tracking problem. Starting from a manual segmentation of the first frame, two curves are evolved in order to recover the endocardium (inner myocardium boundary) and the epicardium (outer myocardium boundary) in all the frames. For each curve, the evolution equation is sought following the maximization of a functional containing two terms: (1) a distribution matching term measuring the similarity between the non-parametric intensity distributions sampled from inside and outside the curve to the model distributions of the corresponding regions estimated from the previous frame; (2) a gradient term for smoothing the curve and biasing it toward high gradient of intensity. The Bhattacharyya coefficient is used as a similarity measure between distributions. The functional maximization is obtained by the Euler-Lagrange ascent equation of curve evolution, and efficiently implemented via level-set. The performance of the proposed distribution matching was quantitatively evaluated by comparisons with independent manual segmentations approved by an experienced cardiologist. The method was applied to ten 2D mid-cavity MR sequences corresponding to ten different subjects. Although neither shape prior knowledge nor curve coupling were used, quantitative evaluation demonstrated that the results were consistent with manual segmentations. The proposed method compares well with existing methods. The algorithm also yields a satisfying reproducibility. Distribution matching leads to a myocardium tracking which is more flexible and applicable than existing methods because the algorithm uses only the current data, i.e., does not

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

  6. 32 CFR 32.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-07-01

    ... sharing or matching shall be the lesser of: (1) The certified value of the remaining life of the property recorded in the recipient's accounting records at the time of donation; or (2) The current fair market... services shall be consistent with those paid for similar work in the recipient's organization. In those...

  7. 34 CFR 74.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-07-01

    ... property for cost sharing or matching shall be the lesser of— (1) The certified value of the remaining life of the property recorded in the recipient's accounting records at the time of donation; or (2) The... volunteer services must be consistent with those paid for similar work in the recipient's organization. In...

  8. 45 CFR 74.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-10-01

    ... sharing or matching shall be the lesser of: (1) The certified value of the remaining life of the property recorded in the recipient's accounting records at the time of donation; or (2) The current fair market... services shall be consistent with those paid for similar work in the recipient's organization. In those...

  9. 7 CFR 3419.6 - Use of matching funds.

    Science.gov (United States)

    2010-01-01

    ..., AND EXTENSION SERVICE, DEPARTMENT OF AGRICULTURE MATCHING FUNDS REQUIREMENT FOR AGRICULTURAL RESEARCH AND EXTENSION FORMULA FUNDS AT 1890 LAND-GRANT INSTITUTIONS, INCLUDING TUSKEGEE UNIVERSITY, AND AT...) of the National Agricultural Research, Extension, and Teaching Policy Act of 1977, section 7 of the...

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

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

  12. Mix-and-match holography

    KAUST Repository

    Peng, Yifan; Dun, Xiong; Sun, Qilin; Heidrich, Wolfgang

    2017-01-01

    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 mixWe derive a detailed image formation model for the setting of holographic projection displays, as well as a multiplexing method based on a combination of phase retrieval methods and complex matrix factorization. We demonstrate several application scenarios in both simulation and physical prototypes.

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

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

  15. Evaluation of the impact of the filing on the match results in qualifying for ME 2017 men's volleyball.

    OpenAIRE

    Dopita, Michal

    2017-01-01

    Title of the thesis Evaluation of the impact of service on the match result in qualification for Men's European Volleyball Championship 2017 Abstract The aim of this thesis is to evaluate the influence of service on the match result in qualification for the 2017 Men's Volleyball European Championship, using indirect video monitoring, and trace the success rate and frequency of individual types of services. Our intention is to show the importance of this individual game activity in a match wit...

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

  17. Matchings with Externalities and Attitudes

    DEFF Research Database (Denmark)

    Branzei, Simina; Michalak, Tomasz; Rahwan, Talal

    2013-01-01

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

  18. Reducing the likelihood of long tennis matches.

    Science.gov (United States)

    Barnett, Tristan; Alan, Brown; Pollard, Graham

    2006-01-01

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

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

  20. Robust matching for voice recognition

    Science.gov (United States)

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

    1994-10-01

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

  1. Ontology Matching with Semantic Verification.

    Science.gov (United States)

    Jean-Mary, Yves R; Shironoshita, E Patrick; Kabuka, Mansur R

    2009-09-01

    ASMOV (Automated Semantic Matching of Ontologies with Verification) is a novel algorithm that uses lexical and structural characteristics of two ontologies to iteratively calculate a similarity measure between them, derives an alignment, and then verifies it to ensure that it does not contain semantic inconsistencies. In this paper, we describe the ASMOV algorithm, and then present experimental results that measure its accuracy using the OAEI 2008 tests, and that evaluate its use with two different thesauri: WordNet, and the Unified Medical Language System (UMLS). These results show the increased accuracy obtained by combining lexical, structural and extensional matchers with semantic verification, and demonstrate the advantage of using a domain-specific thesaurus for the alignment of specialized ontologies.

  2. Using crosswell data to enhance history matching

    KAUST Repository

    Ravanelli, Fabio M.; Hoteit, Ibrahim

    2014-01-01

    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

  3. A multiscale approach to mutual information matching

    NARCIS (Netherlands)

    Pluim, J.P.W.; Maintz, J.B.A.; Viergever, M.A.; Hanson, K.M.

    1998-01-01

    Methods based on mutual information have shown promising results for matching of multimodal brain images. This paper discusses a multiscale approach to mutual information matching, aiming for an acceleration of the matching process while considering the accuracy and robustness of the method. Scaling

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

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

  6. Geographic Trends in the Plastic Surgery Match.

    Science.gov (United States)

    Silvestre, Jason; Lin, Ines C; Serletti, Joseph M; Chang, Benjamin

    2016-01-01

    The integrated plastic surgery match is among the most competitive residency matches in recent years. Although previous studies have correlated applicant characteristics with successful match outcomes, none have comprehensively investigated the role of geography in the match. This study elucidates regional biases in the match. Plastic surgery residents who matched during 2011-2015 were eligible for study inclusion. Names of residents were obtained from official residency program websites and cross-referenced with data obtained from the Student Doctor Network. For each resident, region of residency program and medical school were compared. From 67 programs, 622 residents were identified. Most graduated from US medical schools (97.9%). A total of 94 residents matched at a home institution (15.1%). Half of the residents matched in the same region as their medical school (48.9%). Programs in the South matched the greatest number of residents from the same region (60.8%), whereas West programs matched the least (30.8%, p < 0.001). No regional differences existed regarding residents matching at their home institution (p = 0.268). More women matched at West programs (43.1%) versus East programs (30.6%, p < 0.05). A significant number of residents matched at their home institution. Roughly, half matched at a program in the same region as their medical school. Whether this regional phenomenon stems from applicant or program factors remains unknown. Yet, given the limited number of interviews and the high costs of interviewing, applicants and programs can use these data to help optimize the match process. Copyright © 2015 Association of Program Directors in Surgery. Published by Elsevier Inc. All rights reserved.

  7. Image matching navigation based on fuzzy information

    Institute of Scientific and Technical Information of China (English)

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

    2003-01-01

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

  8. Best Practices for NPT Transit Matching

    International Nuclear Information System (INIS)

    Gilligan, Kimberly V.; Whitaker, J. Michael; Oakberg, John A.; Snow, Catherine

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

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

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

  11. Matched Filter Processing for Asteroid Detection

    Science.gov (United States)

    Gural, Peter S.; Larsen, Jeffrey A.; Gleason, Arianna E.

    2005-10-01

    Matched filter (MF) processing has been shown to provide significant performance gains when processing stellar imagery used for asteroid detection, recovery, and tracking. This includes extending detection ranges to fainter magnitudes at the noise limit of the imagery and operating in dense cluttered star fields as encountered at low Galactic latitudes. The MF software has been shown to detect 40% more asteroids in high-quality Spacewatch imagery relative to the currently implemented approaches, which are based on moving target indicator (MTI) algorithms. In addition, MF detections were made in dense star fields and in situations in which the asteroid was collocated with a star in an image frame, cases in which the MTI algorithms failed. Thus, using legacy sensors and optics, improved detection sensitivity is achievable by simply upgrading the image-processing stream. This in turn permits surveys of the near-Earth asteroid (NEA) population farther from opposition, for smaller sizes, and in directions previously inaccessible to current NEA search programs. A software package has been developed and made available on the NASA data services Web site that can be used for asteroid detection and recovery operations utilizing the enhanced performance capabilities of MF processing.

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

  13. Fast and compact regular expression matching

    DEFF Research Database (Denmark)

    Bille, Philip; Farach-Colton, Martin

    2008-01-01

    We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how...... to improve the space and/or remove a dependency on the alphabet size for each problem using either an improved tabulation technique of an existing algorithm or by combining known algorithms in a new way....

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

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

  16. A service component-based accounting and charging architecture to support interim mechanisms across multiple domains

    NARCIS (Netherlands)

    Le, M. van; Beijnum, B.J.F. van; Huitema, G.B.

    2004-01-01

    Today, telematics services are often compositions of different chargeable service components offered by different service providers. To enhance component-based accounting and charging, the service composition information is used to match with the corresponding charging structure of a service

  17. Pemberian Kredit Pada Koperasi Menggunakan Metode Profile Matching

    Directory of Open Access Journals (Sweden)

    Budi Sudradjat

    2017-09-01

    Abstract Cooperatives is an institution economic have function in the process of the increase in community welfare, Travel cooperatives not easy to reach position like now. The existence of movement cooperatives as an institution economic expected to act as propulsion engine national economic activity as well as soko teachers the country economy. Bhakti BPJS Kesehatan Service Cooperative is a cooperative engaged in services, forms of cooperative services to the community one is to lend funds (credit to help resolve the financial problems in the community. In granting the credit cooperatives need to do proper research and calculations to prospective customers who will take credit cooperatives, to avoid mistakes in decision making required data processing is fast, precise and accurate. With the Application Profile Matching Method For Determining Eligibility Lending In BPJS Kesehatan Service Cooperative Bhakti is the best solution to solve the problems that exist in this company, because with this method the decision taken by the cooperative members have been more thorough and detailed than the previous.   Keywords: Decision Support Systems, Profile Matching, The feasibility of the provision of credit.

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

  19. The Gastroenterology Fellowship Match: A Decade Later.

    Science.gov (United States)

    Huang, Robert J; Triadafilopoulos, George; Limsui, David

    2017-06-01

    Following a period of uncertainty and disorganization, the gastroenterology (GI) national leadership decided to reinstitute the fellowship match (the Match) under the auspices of the National Residency Matching Program (NRMP) in 2006. Although it has now been a decade since the rebirth of the Match, there have been limited data published regarding progress made. In this piece, we discuss reasons for the original collapse of the GI Match, including most notably a perceived oversupply of GI physicians and a poor job market. We discuss the negative impacts the absence of the Match had on programs and on applicants, as well as the impetus to reorganize the Match under the NRMP. We then utilize data published annually by the NRMP to demonstrate that in the decade since its rebirth, the GI Match has been remarkably successful in terms of attracting the participation of applicants and programs. We show that previous misguided concerns of an oversupply of GI physicians were not realized, and that GI fellowship positions remain highly competitive for internal medicine applicants. Finally, we discuss possible implications of recent changes in the healthcare landscape on the GI Match.

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

  1. Matching of Tore Supra ICRH antennas

    International Nuclear Information System (INIS)

    Ladurelle, L.; Beaumont, B.; Kuus, H.; Lombard, G.

    1994-01-01

    An automatic matching method is described for Tore Supra ICRH antennas based on impedance variations seen at their feed points. Error signals derived from directional voltage and phase measurements in the feeder allow to control the matching capacitors values for optimal power transmission. (author) 5 refs.; 9 figs

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

  3. Object-based connectedness facilitates matching

    NARCIS (Netherlands)

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

    2003-01-01

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

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

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

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

  7. Matching Two-dimensional Gel Electrophoresis' Spots

    DEFF Research Database (Denmark)

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

    2012-01-01

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

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

  9. Dynamic Matchings in Convex Bipartite Graphs

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  10. Technical performance and match-to-match variation in elite football teams.

    Science.gov (United States)

    Liu, Hongyou; Gómez, Miguel-Angel; Gonçalves, Bruno; Sampaio, Jaime

    2016-01-01

    Recent research suggests that match-to-match variation adds important information to performance descriptors in team sports, as it helps measure how players fine-tune their tactical behaviours and technical actions to the extreme dynamical environments. The current study aims to identify the differences in technical performance of players from strong and weak teams and to explore match-to-match variation of players' technical match performance. Performance data of all the 380 matches of season 2012-2013 in the Spanish First Division Professional Football League were analysed. Twenty-one performance-related match actions and events were chosen as variables in the analyses. Players' technical performance profiles were established by unifying count values of each action or event of each player per match into the same scale. Means of these count values of players from Top3 and Bottom3 teams were compared and plotted into radar charts. Coefficient of variation of each match action or event within a player was calculated to represent his match-to-match variation of technical performance. Differences in the variation of technical performances of players across different match contexts (team and opposition strength, match outcome and match location) were compared. All the comparisons were achieved by the magnitude-based inferences. Results showed that technical performances differed between players of strong and weak teams from different perspectives across different field positions. Furthermore, the variation of the players' technical performance is affected by the match context, with effects from team and opposition strength greater than effects from match location and match outcome.

  11. Stereo Matching Based On Election Campaign Algorithm

    Directory of Open Access Journals (Sweden)

    Xie Qing Hua

    2016-01-01

    Full Text Available Stereo matching is one of the significant problems in the study of the computer vision. By getting the distance information through pixels, it is possible to reproduce a three-dimensional stereo. In this paper, the edges are the primitives for matching, the grey values of the edges and the magnitude and direction of the edge gradient were figured out as the properties of the edge feature points, according to the constraints for stereo matching, the energy function was built for finding the route minimizing by election campaign optimization algorithm during the process of stereo matching was applied to this problem the energy function. Experiment results show that this algorithm is more stable and it can get the matching result with better accuracy.

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

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

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

    KAUST Repository

    Gu, Binbin; Li, Zhixu; Zhang, Xiangliang; Liu, An; Liu, Guanfeng; Zheng, Kai; Zhao, Lei; Zhou, Xiaofang

    2016-01-01

    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

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

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

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

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

  19. The Effectiveness of Advertising Matching Purchase Motivation

    NARCIS (Netherlands)

    J. Loef (Joost); 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

  20. Personalized Medicine: Matching Treatments to Your Genes

    Science.gov (United States)

    ... Issues Subscribe December 2013 Print this issue Personalized Medicine Matching Treatments to Your Genes Send us your ... for disease, and the ways you respond to medicines are also unique. Medicines that work well for ...

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

  2. Study of matching between HIRFL and CSR

    International Nuclear Information System (INIS)

    Tang Jingyu; Li Haohu; Yuan Youjin

    2001-01-01

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

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

  4. Fractional Order Element Based Impedance Matching

    KAUST Repository

    Radwan, Ahmed Gomaa; Salama, Khaled N.; Shamim, Atif

    2014-01-01

    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

  5. Reliability of visual and instrumental color matching.

    Science.gov (United States)

    Igiel, Christopher; Lehmann, Karl Martin; Ghinea, Razvan; Weyhrauch, Michael; Hangx, Ysbrand; Scheller, Herbert; Paravina, Rade D

    2017-09-01

    The aim of this investigation was to evaluate intra-rater and inter-rater reliability of visual and instrumental shade matching. Forty individuals with normal color perception participated in this study. The right maxillary central incisor of a teaching model was prepared and restored with 10 feldspathic all-ceramic crowns of different shades. A shade matching session consisted of the observer (rater) visually selecting the best match by using VITA classical A1-D4 (VC) and VITA Toothguide 3D Master (3D) shade guides and the VITA Easyshade Advance intraoral spectrophotometer (ES) to obtain both VC and 3D matches. Three shade matching sessions were held with 4 to 6 weeks between sessions. Intra-rater reliability was assessed based on the percentage of agreement for the three sessions for the same observer, whereas the inter-rater reliability was calculated as mean percentage of agreement between different observers. The Fleiss' Kappa statistical analysis was used to evaluate visual inter-rater reliability. The mean intra-rater reliability for the visual shade selection was 64(11) for VC and 48(10) for 3D. The corresponding ES values were 96(4) for both VC and 3D. The percentages of observers who matched the same shade with VC and 3D were 55(10) and 43(12), respectively, while corresponding ES values were 88(8) for VC and 92(4) for 3D. The results for visual shade matching exhibited a high to moderate level of inconsistency for both intra-rater and inter-rater comparisons. The VITA Easyshade Advance intraoral spectrophotometer exhibited significantly better reliability compared with visual shade selection. This study evaluates the ability of observers to consistently match the same shade visually and with a dental spectrophotometer in different sessions. The intra-rater and inter-rater reliability (agreement of repeated shade matching) of visual and instrumental tooth color matching strongly suggest the use of color matching instruments as a supplementary tool in

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

    Science.gov (United States)

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

    2016-08-01

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

  7. Fingerprint Recognition Using Minutia Score Matching

    OpenAIRE

    J, Ravi.; Raja, K. B.; R, Venugopal. K.

    2010-01-01

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

  8. Parikh Matching in the Streaming Model

    DEFF Research Database (Denmark)

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

    2012-01-01

    Let S be a string over an alphabet Σ = {σ1, σ2, …}. A Parikh-mapping maps a substring S′ of S to a |Σ|-length vector that contains, in location i of the vector, the count of σi in S′. Parikh matching refers to the problem of finding all substrings of a text T which match to a given input |Σ|-leng...

  9. THE Economics of Match-Fixing

    OpenAIRE

    Caruso, Raul

    2007-01-01

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

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

  11. Fast group matching for MR fingerprinting reconstruction.

    Science.gov (United States)

    Cauley, Stephen F; Setsompop, Kawin; Ma, Dan; Jiang, Yun; Ye, Huihui; Adalsteinsson, Elfar; Griswold, Mark A; Wald, Lawrence L

    2015-08-01

    MR fingerprinting (MRF) is a technique for quantitative tissue mapping using pseudorandom measurements. To estimate tissue properties such as T1 , T2 , proton density, and B0 , the rapidly acquired data are compared against a large dictionary of Bloch simulations. This matching process can be a very computationally demanding portion of MRF reconstruction. We introduce a fast group matching algorithm (GRM) that exploits inherent correlation within MRF dictionaries to create highly clustered groupings of the elements. During matching, a group specific signature is first used to remove poor matching possibilities. Group principal component analysis (PCA) is used to evaluate all remaining tissue types. In vivo 3 Tesla brain data were used to validate the accuracy of our approach. For a trueFISP sequence with over 196,000 dictionary elements, 1000 MRF samples, and image matrix of 128 × 128, GRM was able to map MR parameters within 2s using standard vendor computational resources. This is an order of magnitude faster than global PCA and nearly two orders of magnitude faster than direct matching, with comparable accuracy (1-2% relative error). The proposed GRM method is a highly efficient model reduction technique for MRF matching and should enable clinically relevant reconstruction accuracy and time on standard vendor computational resources. © 2014 Wiley Periodicals, Inc.

  12. Quantum learning and universal quantum matching machine

    International Nuclear Information System (INIS)

    Sasaki, Masahide; Carlini, Alberto

    2002-01-01

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

  13. Hybrid-Based Dense Stereo Matching

    Science.gov (United States)

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

    2016-06-01

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

  14. Demand Analysis of Logistics Information Matching Platform: A Survey from Highway Freight Market in Zhejiang Province

    Science.gov (United States)

    Chen, Daqiang; Shen, Xiahong; Tong, Bing; Zhu, Xiaoxiao; Feng, Tao

    With the increasing competition in logistics industry and promotion of lower logistics costs requirements, the construction of logistics information matching platform for highway transportation plays an important role, and the accuracy of platform design is the key to successful operation or not. Based on survey results of logistics service providers, customers and regulation authorities to access to information and in-depth information demand analysis of logistics information matching platform for highway transportation in Zhejiang province, a survey analysis for framework of logistics information matching platform for highway transportation is provided.

  15. 75 FR 9012 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/U.S. Department of Health and...

    Science.gov (United States)

    2010-02-26

    ... INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503), amended... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA-2009-0052] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ U.S. Department of Health and Human Services (HHS), Administration for...

  16. Preimplantation genetic diagnosis with HLA matching.

    Science.gov (United States)

    Rechitsky, Svetlana; Kuliev, Anver; Tur-Kaspa, Illan; Morris, Randy; Verlinsky, Yury

    2004-08-01

    Preimplantation genetic diagnosis (PGD) has recently been offered in combination with HLA typing, which allowed a successful haematopoietic reconstitution in affected siblings with Fanconi anaemia by transplantation of stem cells obtained from the HLA-matched offspring resulting from PGD. This study presents the results of the first PGD practical experience performed in a group of couples at risk for producing children with genetic disorders. These parents also requested preimplantation HLA typing for treating the affected children in the family, who required HLA-matched stem cell transplantation. Using a standard IVF procedure, oocytes or embryos were tested for causative gene mutations simultaneously with HLA alleles, selecting and transferring only those unaffected embryos, which were HLA matched to the affected siblings. The procedure was performed for patients with children affected by Fanconi anaemia (FANC) A and C, different thalassaemia mutations, Wiscott-Aldrich syndrome, X-linked adrenoleukodystrophy, X-linked hyperimmunoglobulin M syndrome and X-linked hypohidrotic ectodermal displasia with immune deficiency. Overall, 46 PGD cycles were performed for 26 couples, resulting in selection and transfer of 50 unaffected HLA-matched embryos in 33 cycles, yielding six HLA-matched clinical pregnancies and the birth of five unaffected HLA-matched children. Despite the controversy of PGD use for HLA typing, the data demonstrate the usefulness of this approach for at-risk couples, not only to avoid the birth of affected children with an inherited disease, but also for having unaffected children who may also be potential HLA-matched donors of stem cells for treatment of affected siblings.

  17. RNAPattMatch: a web server for RNA sequence/structure motif detection based on pattern matching with flexible gaps

    Science.gov (United States)

    Drory Retwitzer, Matan; Polishchuk, Maya; Churkin, Elena; Kifer, Ilona; Yakhini, Zohar; Barash, Danny

    2015-01-01

    Searching for RNA sequence-structure patterns is becoming an essential tool for RNA practitioners. Novel discoveries of regulatory non-coding RNAs in targeted organisms and the motivation to find them across a wide range of organisms have prompted the use of computational RNA pattern matching as an enhancement to sequence similarity. State-of-the-art programs differ by the flexibility of patterns allowed as queries and by their simplicity of use. In particular—no existing method is available as a user-friendly web server. A general program that searches for RNA sequence-structure patterns is RNA Structator. However, it is not available as a web server and does not provide the option to allow flexible gap pattern representation with an upper bound of the gap length being specified at any position in the sequence. Here, we introduce RNAPattMatch, a web-based application that is user friendly and makes sequence/structure RNA queries accessible to practitioners of various background and proficiency. It also extends RNA Structator and allows a more flexible variable gaps representation, in addition to analysis of results using energy minimization methods. RNAPattMatch service is available at http://www.cs.bgu.ac.il/rnapattmatch. A standalone version of the search tool is also available to download at the site. PMID:25940619

  18. 75 FR 70128 - 2011 Changes for Domestic Mailing Services

    Science.gov (United States)

    2010-11-17

    ...LOT, RDI, and Five-Digit ZIP. The Postal Service certifies software meeting its standards until the... Delivery Point Validation (DPV) service in conjunction with CASS-Certified address matching software... interface between address-matching software and the LACS \\Link\\ database service. 1.21.2 Interface...

  19. Content Based Image Matching for Planetary Science

    Science.gov (United States)

    Deans, M. C.; Meyer, C.

    2006-12-01

    Planetary missions generate large volumes of data. With the MER rovers still functioning on Mars, PDS contains over 7200 released images from the Microscopic Imagers alone. These data products are only searchable by keys such as the Sol, spacecraft clock, or rover motion counter index, with little connection to the semantic content of the images. We have developed a method for matching images based on the visual textures in images. For every image in a database, a series of filters compute the image response to localized frequencies and orientations. Filter responses are turned into a low dimensional descriptor vector, generating a 37 dimensional fingerprint. For images such as the MER MI, this represents a compression ratio of 99.9965% (the fingerprint is approximately 0.0035% the size of the original image). At query time, fingerprints are quickly matched to find images with similar appearance. Image databases containing several thousand images are preprocessed offline in a matter of hours. Image matches from the database are found in a matter of seconds. We have demonstrated this image matching technique using three sources of data. The first database consists of 7200 images from the MER Microscopic Imager. The second database consists of 3500 images from the Narrow Angle Mars Orbital Camera (MOC-NA), which were cropped into 1024×1024 sub-images for consistency. The third database consists of 7500 scanned archival photos from the Apollo Metric Camera. Example query results from all three data sources are shown. We have also carried out user tests to evaluate matching performance by hand labeling results. User tests verify approximately 20% false positive rate for the top 14 results for MOC NA and MER MI data. This means typically 10 to 12 results out of 14 match the query image sufficiently. This represents a powerful search tool for databases of thousands of images where the a priori match probability for an image might be less than 1%. Qualitatively, correct

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

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

  2. Unsupervised image matching based on manifold alignment.

    Science.gov (United States)

    Pei, Yuru; Huang, Fengchun; Shi, Fuhao; Zha, Hongbin

    2012-08-01

    This paper challenges the issue of automatic matching between two image sets with similar intrinsic structures and different appearances, especially when there is no prior correspondence. An unsupervised manifold alignment framework is proposed to establish correspondence between data sets by a mapping function in the mutual embedding space. We introduce a local similarity metric based on parameterized distance curves to represent the connection of one point with the rest of the manifold. A small set of valid feature pairs can be found without manual interactions by matching the distance curve of one manifold with the curve cluster of the other manifold. To avoid potential confusions in image matching, we propose an extended affine transformation to solve the nonrigid alignment in the embedding space. The comparatively tight alignments and the structure preservation can be obtained simultaneously. The point pairs with the minimum distance after alignment are viewed as the matchings. We apply manifold alignment to image set matching problems. The correspondence between image sets of different poses, illuminations, and identities can be established effectively by our approach.

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

  4. Iris Matching Based on Personalized Weight Map.

    Science.gov (United States)

    Dong, Wenbo; Sun, Zhenan; Tan, Tieniu

    2011-09-01

    Iris recognition typically involves three steps, namely, iris image preprocessing, feature extraction, and feature matching. The first two steps of iris recognition have been well studied, but the last step is less addressed. Each human iris has its unique visual pattern and local image features also vary from region to region, which leads to significant differences in robustness and distinctiveness among the feature codes derived from different iris regions. However, most state-of-the-art iris recognition methods use a uniform matching strategy, where features extracted from different regions of the same person or the same region for different individuals are considered to be equally important. This paper proposes a personalized iris matching strategy using a class-specific weight map learned from the training images of the same iris class. The weight map can be updated online during the iris recognition procedure when the successfully recognized iris images are regarded as the new training data. The weight map reflects the robustness of an encoding algorithm on different iris regions by assigning an appropriate weight to each feature code for iris matching. Such a weight map trained by sufficient iris templates is convergent and robust against various noise. Extensive and comprehensive experiments demonstrate that the proposed personalized iris matching strategy achieves much better iris recognition performance than uniform strategies, especially for poor quality iris images.

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

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

  7. Achromatic hues matching in graphic printing

    Directory of Open Access Journals (Sweden)

    Martinia Ira Glogar

    2015-05-01

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

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

  9. Covariant diagrams for one-loop matching

    International Nuclear Information System (INIS)

    Zhang, Zhengkang

    2016-10-01

    We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative expansion (CDE) are represented by diagrams which, unlike conventional Feynman diagrams, involve 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.

  10. 6d, Coulomb branch anomaly matching

    Science.gov (United States)

    Intriligator, Kenneth

    2014-10-01

    6d QFTs are constrained by the analog of 't Hooft anomaly matching: all anomalies for global symmetries and metric backgrounds are constants of RG flows, and for all vacua in moduli spaces. We discuss an anomaly matching mechanism for 6d theories on their Coulomb branch. It is a global symmetry analog of Green-Schwarz-West-Sagnotti anomaly cancellation, and requires the apparent anomaly mismatch to be a perfect square, . Then Δ I 8 is cancelled by making X 4 an electric/magnetic source for the tensor multiplet, so background gauge field instantons yield charged strings. This requires the coefficients in X 4 to be integrally quantized. We illustrate this for theories. We also consider the SCFTs from N small E8 instantons, verifying that the recent result for its anomaly polynomial fits with the anomaly matching mechanism.

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

  12. Covariant diagrams for one-loop matching

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Zhengkang [Michigan Center for Theoretical Physics (MCTP), University of Michigan,450 Church Street, Ann Arbor, MI 48109 (United States); Deutsches Elektronen-Synchrotron (DESY),Notkestraße 85, 22607 Hamburg (Germany)

    2017-05-30

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

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

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

  15. Matching of ion sources to cyclotron inflectors

    International Nuclear Information System (INIS)

    Baartman, R.

    1988-06-01

    In general, cyclotron inflectors strongly couple the two transverse subspaces. This leads to a growth in emittance projections for a beam with no initial correlation between the two transverse subspaces. Only in the case of the Mueller (hyperboloid) inflector is there no emittance growth. We have made calculations using an optimization routine to match a given beam through the axial injection system. We find that in the limit where all the emittance is due to a beam's axial angular momentum (for example, from an ECR source), matching with no emittance growth is possible even in the case of mirror or spiral inflectors. Moreover, any one of the two transverse emittances circulating in the cyclotron can be made smaller than the source emittance while maintaining the sum of the emittances constant. This is achieved by rotating the matching quadrupoles with respect to the inflector and retuning

  16. Covariant diagrams for one-loop matching

    International Nuclear Information System (INIS)

    Zhang, Zhengkang

    2017-01-01

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

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

  18. Anatomy Ontology Matching Using Markov Logic Networks

    Directory of Open Access Journals (Sweden)

    Chunhua Li

    2016-01-01

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

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

  20. Using crosswell data to enhance history matching

    KAUST Repository

    Ravanelli, Fabio M.

    2014-01-01

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

  1. Physiological characteristics of badminton match play.

    Science.gov (United States)

    Faude, Oliver; Meyer, Tim; Rosenberger, Friederike; Fries, Markus; Huber, Günther; Kindermann, Wilfried

    2007-07-01

    The present study aimed at examining the physiological characteristics and metabolic demands of badminton single match play. Twelve internationally ranked badminton players (eight women and four men) performed an incremental treadmill test [VO(2peak = )50.3 +/- 4.1 ml min(-1) kg(-1) (women) and 61.8 +/- 5.9 ml min(-1) kg(-1) (men), respectively]. On a separate day, they played a simulated badminton match of two 15 min with simultaneous gas exchange (breath-by-breath) and heart rate measurements. Additionally, blood lactate concentrations were determined before, after 15 min and at the end of the match. Furthermore, the duration of rallies and rests in between, the score as well as the number of shots per rally were recorded. A total of 630 rallies was analysed. Mean rally and rest duration were 5.5 +/- 4.4 s and 11.4 +/- 6.0 s, respectively, with an average 5.1 +/- 3.9 shots played per rally. Mean oxygen uptake (VO(2)), heart rate (HR), and blood lactate concentrations during badminton matches were 39.6 +/- 5.7 ml min(-1) kg(-1) (73.3% VO(2peak)), 169 +/- 9 min(-1) (89.0% HR(peak)) and 1.9 +/- 0.7 mmol l(-1), respectively. For a single subject 95% confidence intervals for VO(2) and HR during match play were on average 45.7-100.9% VO(2peak) and 78.3-99.8% HR(peak). High average intensity of badminton match play and considerable variability of several physiological variables demonstrate the importance of anaerobic alactacid and aerobic energy production in competitive badminton. A well-developed aerobic endurance capacity seems necessary for fast recovery between rallies or intensive training workouts.

  2. History Matching: Towards Geologically Reasonable Models

    DEFF Research Database (Denmark)

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

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

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

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

    Science.gov (United States)

    Lander, Karen; Poyarekar, Siddhi

    2015-01-01

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

  5. Effects of international football matches on ambulance call profiles and volumes during the 2006 World Cup.

    Science.gov (United States)

    Deakin, Charles D; Thompson, Fizz; Gibson, Caroline; Green, Mark

    2007-06-01

    Prompt ambulance attendance is aimed at improving patient care. With finite resources struggling to meet performance targets, unforeseen demand precludes the ability to tailor resources to cope with increased call volumes, and can have a marked detrimental effect on performance and hence patient care. The effects of the 2006 World Cup football matches on call volumes and profiles were analysed to understand how public events can influence demands on the ambulance service. All emergency calls to the Hampshire Ambulance Service NHS Trust (currently the Hampshire Division of South Central Ambulance Service, Winchester, UK) during the first weekend of the 2006 World Cup football matches were analysed by call volume and classification of call (call type). On the day of the first football match, call volume was over 50% higher than that on a typical Saturday, with distinct peaks before and after the inaugural match. Call profile analysis showed increases in alcohol-related emergencies, including collapse, unconsciousness, assault and road traffic accidents. The increase in assaults was particularly marked at the end of each match and increased again into the late evening. A detailed mapping of call volumes and profiles during the World Cup football shows a significant increase in overall emergency calls, mostly alcohol related. Mapping of limited resources to these patterns will allow improved responses to emergency calls.

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

  7. Photon signature analysis using template matching

    Energy Technology Data Exchange (ETDEWEB)

    Bradley, D.A., E-mail: d.a.bradley@surrey.ac.uk [Department of Physics, University of Surrey, Guildford GU2 7XH (United Kingdom); Hashim, S., E-mail: suhairul@utm.my [Department of Physics, Universiti Teknologi Malaysia, 81310 Skudai, Johor (Malaysia); Saripan, M.I. [Faculty of Engineering, Universiti Putra Malaysia, 43400 Serdang, Selangor (Malaysia); Wells, K. [Centre for Vision, Speech and Signal Processing, University of Surrey, Guildford GU2 7XH (United Kingdom); Dunn, W.L. [Department of Mechanical and Nuclear Engineering, Kansas State University, 3002 Rathbone Hall, Manhattan, KS 66506 (United States)

    2011-10-01

    We describe an approach to detect improvised explosive devices (IEDs) by using a template matching procedure. This approach relies on the signature due to backstreaming {gamma} photons from various targets. In this work we have simulated cylindrical targets of aluminum, iron, copper, water and ammonium nitrate (nitrogen-rich fertilizer). We simulate 3.5 MeV source photons distributed on a plane inside a shielded area using Monte Carlo N-Particle (MCNP{sup TM}) code version 5 (V5). The 3.5 MeV source gamma rays yield 511 keV peaks due to pair production and scattered gamma rays. In this work, we simulate capture of those photons that backstream, after impinging on the target element, toward a NaI detector. The captured backstreamed photons are expected to produce a unique spectrum that will become part of a simple signal processing recognition system based on the template matching method. Different elements were simulated using different sets of random numbers in the Monte Carlo simulation. To date, the sum of absolute differences (SAD) method has been used to match the template. In the examples investigated, template matching was found to detect all elements correctly.

  8. Probabilistic evaluation of process model matching techniques

    NARCIS (Netherlands)

    Kuss, Elena; Leopold, Henrik; van der Aa, Han; Stuckenschmidt, Heiner; Reijers, Hajo A.

    2016-01-01

    Process model matching refers to the automatic identification of corresponding activities between two process models. It represents the basis for many advanced process model analysis techniques such as the identification of similar process parts or process model search. A central problem is how to

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

  10. Regular Expression Matching and Operational Semantics

    Directory of Open Access Journals (Sweden)

    Asiri Rathnayake

    2011-08-01

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

  11. Secure matching of Dutch car license plates

    NARCIS (Netherlands)

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

    2016-01-01

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

  12. Symmetric Circular Matchings and RNA Folding

    DEFF Research Database (Denmark)

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

    2012-01-01

    RNA secondary structures can be computed as optimal solutions of certain circular matching problems. An accurate treatment of this energy minimization problem has to account for the small --- but non-negligible --- entropic destabilization of secondary structures with non-trivial automorphisms. S...

  13. 13 CFR 130.450 - Matching funds.

    Science.gov (United States)

    2010-01-01

    ... in the budget proposal. Cash sources shall be identified by name and account. All applicants must... agreement. The account containing such cash must be under the direct management of the SBDC Director, or, if... received by the SBDC during the budget period, as long as the total Cash Match provided by the SBDC is 50...

  14. 13 CFR 108.2030 - Matching requirements.

    Science.gov (United States)

    2010-01-01

    ... Section 108.2030 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION NEW MARKETS VENTURE CAPITAL... resources raised by the NMVC Company or SSBIC. (b) Allowable sources. (1) Any source other than SBA is an... this part. (3) A portion of Private Capital may be designated as matching resources if the designated...

  15. Performance Evaluation of Tree Object Matching

    DEFF Research Database (Denmark)

    Somchaipeng, Kerawit; Sporring, Jon; Kreiborg, Sven

    2005-01-01

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

  16. Language style matching and police interrogation outcomes

    NARCIS (Netherlands)

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

    2014-01-01

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

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

  18. Matching Expectations for Successful University Student Volunteering

    Science.gov (United States)

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

    2017-01-01

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

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

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

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

  2. Cash Management/Data Matching. Training Guide.

    Science.gov (United States)

    Office of Student Financial Assistance (ED), Washington, DC.

    This training guide for financial aid staff explains the process of direct loan reconciliation and suggests appropriate cash management accounting practices. Chapter 1 explains the importance of cash management, the role of data matching, and reviews basic reconciliation concepts and terms and direct loan reporting requirements. Chapter 2 reviews…

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

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

  5. The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching

    International Nuclear Information System (INIS)

    Wadlinger, E.A.; Garnett, R.W.

    1996-01-01

    The issue involved in the simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ / 4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x = β y and α x = α y = 0 at the exit of the RFQ. This matching between the RFQ and DTL is described. (author)

  6. The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching

    International Nuclear Information System (INIS)

    Wadlinger, E.A.; Garnett, R.W.

    1996-01-01

    The issue involved in simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ/4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x =β y and α x =α y =0 at the exit of the RFQ. This matching between the RFQ and DTL is described

  7. Haptic spatial matching in near peripersonal space.

    Science.gov (United States)

    Kaas, Amanda L; Mier, Hanneke I van

    2006-04-01

    Research has shown that haptic spatial matching at intermanual distances over 60 cm is prone to large systematic errors. The error pattern has been explained by the use of reference frames intermediate between egocentric and allocentric coding. This study investigated haptic performance in near peripersonal space, i.e. at intermanual distances of 60 cm and less. Twelve blindfolded participants (six males and six females) were presented with two turn bars at equal distances from the midsagittal plane, 30 or 60 cm apart. Different orientations (vertical/horizontal or oblique) of the left bar had to be matched by adjusting the right bar to either a mirror symmetric (/ \\) or parallel (/ /) position. The mirror symmetry task can in principle be performed accurately in both an egocentric and an allocentric reference frame, whereas the parallel task requires an allocentric representation. Results showed that parallel matching induced large systematic errors which increased with distance. Overall error was significantly smaller in the mirror task. The task difference also held for the vertical orientation at 60 cm distance, even though this orientation required the same response in both tasks, showing a marked effect of task instruction. In addition, men outperformed women on the parallel task. Finally, contrary to our expectations, systematic errors were found in the mirror task, predominantly at 30 cm distance. Based on these findings, we suggest that haptic performance in near peripersonal space might be dominated by different mechanisms than those which come into play at distances over 60 cm. Moreover, our results indicate that both inter-individual differences and task demands affect task performance in haptic spatial matching. Therefore, we conclude that the study of haptic spatial matching in near peripersonal space might reveal important additional constraints for the specification of adequate models of haptic spatial performance.

  8. The urology residency matching program in practice.

    Science.gov (United States)

    Teichman, J M; Anderson, K D; Dorough, M M; Stein, C R; Optenberg, S A; Thompson, I M

    2000-06-01

    We evaluate behaviors and attitudes among resident applicants and program directors related to the American Urological Association (AUA) residency matching program and recommend changes to improve the match. Written questionnaires were mailed to 519 resident applicants and 112 program directors after the 1999 American Urological Association match. Subjects were asked about their observations, behaviors and opinions towards the match. Questionnaires were returned by 230 resident applicants and 94 program directors (44% and 83% response rates, respectively.) Of the resident applicants 75% spent $1,001 to $5,000 for interviewing. Of the program directors 47% recalled that applicants asked how programs would rank the applicant and 61% of applicants recalled that program directors asked applicants how they would rank programs. Dishonesty was acknowledged by 31% of program directors and 44% of resident applicants. Of program directors 82% thought applicants "lied", while 67% of applicants thought that programs "lied" (quotations indicate questionnaire language). Participants characterized their own dishonesty as "just playing the game" or they "did not feel badly." Of program directors 81% and of applicants 61% were "skeptical" or "did not believe" when informed they were a "high" or "number 1" selection. Being asked about marital status was recalled by 91% of male and 100% of female (p = 0. 02), if they had children by 53% of male and 67% of female, (p = 0. 03), and intent to have children by 25% of male and 62% of female (p match code rules frequently. Program directors and resident applicants are skeptical of each other. Patterns of faculty behavior differ based on applicant gender. Interviews are costly for applicants. We recommend that 1) programs adopt policies to enhance fairness, 2) applications be filed electronically, 3) programs assist resident applicants with interview accommodation to reduce financial burden and 4) a post-interview code of limited or

  9. 26 CFR 31.3406(j)-1 - Taxpayer Identification Number (TIN) matching program.

    Science.gov (United States)

    2010-04-01

    ... 26 Internal Revenue 15 2010-04-01 2010-04-01 false Taxpayer Identification Number (TIN) matching program. 31.3406(j)-1 Section 31.3406(j)-1 Internal Revenue INTERNAL REVENUE SERVICE, DEPARTMENT OF THE... COLLECTION OF INCOME TAX AT SOURCE Collection of Income Tax at Source § 31.3406(j)-1 Taxpayer Identification...

  10. The match between motivation and performance management of health sector workers in Mali

    NARCIS (Netherlands)

    Dieleman, Marjolein; Toonen, Jurrien; Touré, Hamadassalia; Martineau, Tim

    2006-01-01

    UNLABELLED: Human resources for health (HRH) play a central role in improving accessibility to services and quality of care. Their motivation influences this. In Mali, operational research was conducted to identify the match between motivation and the range and use of performance management

  11. 75 FR 25314 - Community Volunteer Income Tax Assistance (VITA) Matching Grant Program-Availability of...

    Science.gov (United States)

    2010-05-07

    ... correction to a notice of the Community Volunteer Income Tax Assistance (VITA) Matching Grant Program, which... DEPARTMENT OF THE TREASURY Internal Revenue Service Community Volunteer Income Tax Assistance... notice of the availability of application packages for the 2011 Community Volunteer Income Tax Assistance...

  12. Good Hope in Chaos: Beyond Matching to Complexity in Career Development

    Science.gov (United States)

    Pryor, R. G. L.; Bright, J. E. H.

    2009-01-01

    The significance of both higher education and career counselling is outlined. The predominant matching paradigm for career development service delivery is described. Its implications for reinforcing the status quo in the South African community are identified and questioned. The Chaos Theory of Careers (CTC) is suggested as an alternative…

  13. Nearest Neighbour Corner Points Matching Detection Algorithm

    Directory of Open Access Journals (Sweden)

    Zhang Changlong

    2015-01-01

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

  14. FINGERPRINT MATCHING BASED ON PORE CENTROIDS

    Directory of Open Access Journals (Sweden)

    S. Malathi

    2011-05-01

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

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

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

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

  18. SAD-Based Stereo Matching Using FPGAs

    Science.gov (United States)

    Ambrosch, Kristian; Humenberger, Martin; Kubinger, Wilfried; Steininger, Andreas

    In this chapter we present a field-programmable gate array (FPGA) based stereo matching architecture. This architecture uses the sum of absolute differences (SAD) algorithm and is targeted at automotive and robotics applications. The disparity maps are calculated using 450×375 input images and a disparity range of up to 150 pixels. We discuss two different implementation approaches for the SAD and analyze their resource usage. Furthermore, block sizes ranging from 3×3 up to 11×11 and their impact on the consumed logic elements as well as on the disparity map quality are discussed. The stereo matching architecture enables a frame rate of up to 600 fps by calculating the data in a highly parallel and pipelined fashion. This way, a software solution optimized by using Intel's Open Source Computer Vision Library running on an Intel Pentium 4 with 3 GHz clock frequency is outperformed by a factor of 400.

  19. Competitiveness of the match for interventional radiology and neuroradiology fellowships.

    Science.gov (United States)

    Chen, Jim Y; Agarwal, Vikas; Orons, Philip D

    2014-11-01

    Overall resident interest in certain subspecialties changes with time. We sought to investigate the latest 6-year trend in interventional radiology (IR) and neuroradiology fellowship applications and how it has affected competitiveness in obtaining a position. We analyzed statistics published by the National Resident Matching Program in Results and Data: Specialties Matching Service from 2008 to 2013. From these data, we calculated the positions per IR applicant (PPIRA) and positions per neuroradiology applicant (PPNRA) for each year. The number of positions per applicant is one way to assess specialty competitiveness on a supply-and-demand basis. A lower PPIRA or PPNRA indicates a more competitive year. PPIRA has decreased every year, from 1.71 to the present 0.84, and contributed to 52 applicants being unmatched in 2013, up from 9 in 2008. Accordingly, the number of unfilled positions has decreased from 86 in 2008 to 8 in 2013. PPNRA waxed and waned from 2008 to 2010 but stabilized at around 1.15 thereafter. The number of unfilled positions has never dropped below 46. The number of unmatched applicants was consistently in the teens, except in 2011, when it increased to 23. Interest in IR fellowship has increased significantly over the past 6 years, whereas interest in neuroradiology fellowships has plateaued. IR fellowships have become increasingly competitive, leading to many unmatched residents. Copyright © 2014 American College of Radiology. Published by Elsevier Inc. All rights reserved.

  20. Final report, DOE/industry matching grant

    International Nuclear Information System (INIS)

    Kumar, Arvind S.

    2003-01-01

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

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

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

  3. Oblique Multi-Camera Systems - Orientation and Dense Matching Issues

    Science.gov (United States)

    Rupnik, E.; Nex, F.; Remondino, F.

    2014-03-01

    The use of oblique imagery has become a standard for many civil and mapping applications, thanks to the development of airborne digital multi-camera systems, as proposed by many companies (Blomoblique, IGI, Leica, Midas, Pictometry, Vexcel/Microsoft, VisionMap, etc.). The indisputable virtue of oblique photography lies in its simplicity of interpretation and understanding for inexperienced users allowing their use of oblique images in very different applications, such as building detection and reconstruction, building structural damage classification, road land updating and administration services, etc. The paper reports an overview of the actual oblique commercial systems and presents a workflow for the automated orientation and dense matching of large image blocks. Perspectives, potentialities, pitfalls and suggestions for achieving satisfactory results are given. Tests performed on two datasets acquired with two multi-camera systems over urban areas are also reported.

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

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

  6. An Implementation of the Frequency Matching Method

    DEFF Research Database (Denmark)

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

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

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

  8. Matching strategies for a plasma booster

    International Nuclear Information System (INIS)

    Tomassini, P; Rossi, A R

    2016-01-01

    This paper presents a theoretical study of a matching strategy for the laser-plasma wakefield accelerator where the injected electron beam is produced by an external source. The matching is achieved after an initial focusing using conventional beam optics, combining a linear tapering of plasma density and the increasing non linearity of the plasma wake due to the focusing of the laser driver. Both effects contribute in increasing the focusing strength from an initial relatively low value, to the considerably higher value present in the flat top plasma profile, where acceleration takes place. The same procedure is exploited to match the beam from plasma to vacuum once acceleration has occurred. Beam loading plays a crucial role both at the very beginning and end of the whole process. In the last stage, two more effects take place: a partial emittance compensation, reducing emittance value by a sizable amount, and a reduction of the energy spread, due to the relevant beam loading operating when the laser is defocused. (paper)

  9. Electromagnetically induced transparency with matched pulses

    International Nuclear Information System (INIS)

    Harris, S.E.

    1993-01-01

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

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

  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. Matching Cost Filtering for Dense Stereo Correspondence

    Directory of Open Access Journals (Sweden)

    Yimin Lin

    2013-01-01

    Full Text Available Dense stereo correspondence enabling reconstruction of depth information in a scene is of great importance in the field of computer vision. Recently, some local solutions based on matching cost filtering with an edge-preserving filter have been proved to be capable of achieving more accuracy than global approaches. Unfortunately, the computational complexity of these algorithms is quadratically related to the window size used to aggregate the matching costs. The recent trend has been to pursue higher accuracy with greater efficiency in execution. Therefore, this paper proposes a new cost-aggregation module to compute the matching responses for all the image pixels at a set of sampling points generated by a hierarchical clustering algorithm. The complexity of this implementation is linear both in the number of image pixels and the number of clusters. Experimental results demonstrate that the proposed algorithm outperforms state-of-the-art local methods in terms of both accuracy and speed. Moreover, performance tests indicate that parameters such as the height of the hierarchical binary tree and the spatial and range standard deviations have a significant influence on time consumption and the accuracy of disparity maps.

  13. Measuring the impact of employment services centres in Lebanon ...

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

    This project will enhance the capacity of employment services centres (ESC) in Palestinian ... employment counseling and job matching services for male and female ... and terms of employment (such as the presence of a contract, work hours, ...

  14. An Improvement on LSB Matching and LSB Matching Revisited Steganography Methods

    OpenAIRE

    Qazanfari, Kazem; Safabakhsh, Reza

    2017-01-01

    The aim of the steganography methods is to communicate securely in a completely undetectable manner. LSB Matching and LSB Matching Revisited steganography methods are two general and esiest methods to achieve this aim. Being secured against first order steganalysis methods is the most important feature of these methods. On the other hand, these methods don't consider inter pixel dependency. Therefore, recently, several steganalysis methods are proposed that by using co-occurrence matrix detec...

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

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

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

  18. Fast image matching algorithm based on projection characteristics

    Science.gov (United States)

    Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun

    2011-06-01

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

  19. Real-time eSports Match Result Prediction

    OpenAIRE

    Yang, Yifan; Qin, Tian; Lei, Yu-Heng

    2016-01-01

    In this paper, we try to predict the winning team of a match in the multiplayer eSports game Dota 2. To address the weaknesses of previous work, we consider more aspects of prior (pre-match) features from individual players' match history, as well as real-time (during-match) features at each minute as the match progresses. We use logistic regression, the proposed Attribute Sequence Model, and their combinations as the prediction models. In a dataset of 78362 matches where 20631 matches contai...

  20. Personalized trajectory matching in spatial networks

    KAUST Repository

    Shang, Shuo; Ding, Ruogu; Zheng, Kai; Jensen, Christian Sø ndergaard; Kalnis, Panos; Zhou, Xiaofang

    2013-01-01

    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

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

  2. Matching disease and phenotype ontologies in the ontology alignment evaluation initiative.

    Science.gov (United States)

    Harrow, Ian; Jiménez-Ruiz, Ernesto; Splendiani, Andrea; Romacker, Martin; Woollard, Peter; Markel, Scott; Alam-Faruque, Yasmin; Koch, Martin; Malone, James; Waaler, Arild

    2017-12-02

    The disease and phenotype track was designed to evaluate the relative performance of ontology matching systems that generate mappings between source ontologies. Disease and phenotype ontologies are important for applications such as data mining, data integration and knowledge management to support translational science in drug discovery and understanding the genetics of disease. Eleven systems (out of 21 OAEI participating systems) were able to cope with at least one of the tasks in the Disease and Phenotype track. AML, FCA-Map, LogMap(Bio) and PhenoMF systems produced the top results for ontology matching in comparison to consensus alignments. The results against manually curated mappings proved to be more difficult most likely because these mapping sets comprised mostly subsumption relationships rather than equivalence. Manual assessment of unique equivalence mappings showed that AML, LogMap(Bio) and PhenoMF systems have the highest precision results. Four systems gave the highest performance for matching disease and phenotype ontologies. These systems coped well with the detection of equivalence matches, but struggled to detect semantic similarity. This deserves more attention in the future development of ontology matching systems. The findings of this evaluation show that such systems could help to automate equivalence matching in the workflow of curators, who maintain ontology mapping services in numerous domains such as disease and phenotype.

  3. Matching and Abstraction in Knowledge Systems,

    Science.gov (United States)

    1980-01-01

    cuts a , 2 A,’ achine area A orpltV METHOD. PERFORM INTERSECTION SEARCH OF SEMANTIC NET RESULT: A LAWN MOWER IS A MACHINE THAT CUTS GRASS OR SIMILAR...34 Remember we created this by just reading the dictionary, and now we want to ask, "What’s a lawn mower ?" We did this more generally for noun-noun...the main method was to compare examples by partial matching over these structures. Thus we find "A lawn mower is a machine that cuts grass, or similar

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

  5. On Resolution Complexity of Matching Principles

    DEFF Research Database (Denmark)

    Dantchev, Stefan S.

    proof system. The results in the thesis fall in this category. We study the Resolution complexity of some Matching Principles. The three major contributions of the thesis are as follows. Firstly, we develop a general technique of proving resolution lower bounds for the perfect matchingprinciples based...... Chessboard as well as for Tseitin tautologies based on rectangular grid graph. We reduce these problems to Tiling games, a concept introduced by us, which may be of interest on its own. Secondly, we find the exact Tree-Resolution complexity of the Weak Pigeon-Hole Principle. It is the most studied...

  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. DOE Utility Matching Program Final Technical Report

    International Nuclear Information System (INIS)

    Haghighat, Alireza

    2002-01-01

    This is the Final report for the DOE Match Grant (DE-FG02-99NE38163) awarded to the Nuclear and Radiological Engineering (NRE) Department, University of Florida, for the period of September 1999 to January 2002. This grant has been instrumental for maintaining high-quality graduate and undergraduate education at the NRE department. The grant has been used for supporting student entry and retention and for upgrading nuclear educational facilities, nuclear instrumentation, computer facilities, and computer codes to better enable the incorporation of experimental experiences and computer simulations related to advanced light water fission reactor engineering and other advanced reactor concepts into the nuclear engineering course curricula

  8. Automatic target detection using binary template matching

    Science.gov (United States)

    Jun, Dong-San; Sun, Sun-Gu; Park, HyunWook

    2005-03-01

    This paper presents a new automatic target detection (ATD) algorithm to detect targets such as battle tanks and armored personal carriers in ground-to-ground scenarios. Whereas most ATD algorithms were developed for forward-looking infrared (FLIR) images, we have developed an ATD algorithm for charge-coupled device (CCD) images, which have superior quality to FLIR images in daylight. The proposed algorithm uses fast binary template matching with an adaptive binarization, which is robust to various light conditions in CCD images and saves computation time. Experimental results show that the proposed method has good detection performance.

  9. Rewrite Systems, Pattern Matching, and Code Generation

    Science.gov (United States)

    1988-06-09

    fmd a local set L’ which includes L and define the transformation on L’ instead of on L. 11 The straightforward way to define tree transformations...Proposition 2.19 Both B-ftt and T-ftt include: REL relabelings FTA (t ,t) such that t e RECOG HOM homomorphisms LHOM linear homomorphisms The capabilities...fsa for the set of the structures of the original pattern set. The LB-fsa IS used to fmd the structural subpatterns matching a: each node of the

  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. Coincidental match of numerical simulation and physics

    Science.gov (United States)

    Pierre, B.; Gudmundsson, J. S.

    2010-08-01

    Consequences of rapid pressure transients in pipelines range from increased fatigue to leakages and to complete ruptures of pipeline. Therefore, accurate predictions of rapid pressure transients in pipelines using numerical simulations are critical. State of the art modelling of pressure transient in general, and water hammer in particular include unsteady friction in addition to the steady frictional pressure drop, and numerical simulations rely on the method of characteristics. Comparison of rapid pressure transient calculations by the method of characteristics and a selected high resolution finite volume method highlights issues related to modelling of pressure waves and illustrates that matches between numerical simulations and physics are purely coincidental.

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

    Directory of Open Access Journals (Sweden)

    DING Hao

    2015-03-01

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

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

  15. Calculating scattering matrices by wave function matching

    International Nuclear Information System (INIS)

    Zwierzycki, M.; Khomyakov, P.A.; Starikov, A.A.; Talanana, M.; Xu, P.X.; Karpan, V.M.; Marushchenko, I.; Brocks, G.; Kelly, P.J.; Xia, K.; Turek, I.; Bauer, G.E.W.

    2008-01-01

    The conductance of nanoscale structures can be conveniently related to their scattering properties expressed in terms of transmission and reflection coefficients. Wave function matching (WFM) is a transparent technique for calculating transmission and reflection matrices for any Hamiltonian that can be represented in tight-binding form. A first-principles Kohn-Sham Hamiltonian represented on a localized orbital basis or on a real space grid has such a form. WFM is based upon direct matching of the scattering-region wave function to the Bloch modes of ideal leads used to probe the scattering region. The purpose of this paper is to give a pedagogical introduction to WFM and present some illustrative examples of its use in practice. We briefly discuss WFM for calculating the conductance of atomic wires, using a real space grid implementation. A tight-binding muffin-tin orbital implementation very suitable for studying spin-dependent transport in layered magnetic materials is illustrated by looking at spin-dependent transmission through ideal and disordered interfaces. (copyright 2008 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim) (orig.)

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

  17. Op zoek naar de perfecte match in vrijwilligersland

    Directory of Open Access Journals (Sweden)

    Els van Gilst

    2015-06-01

    staffed by volunteers be incorporated into the practice of brokerage?The data are derived from a field study among volunteer centres, organizations (partially staffed by volunteers and volunteers in the province of Zuid-Holland in the Netherlands. Three different research methods were used: survey, interviews, and desk research.The analysis of data from the field study showed that volunteer centres in the province of Zuid-Holland follow a similar procedure when it comes to matching volunteers. The brokerage procedure involves six phases. These phases may involve face-to-face contact with employees at the volunteer centre or online via the internet. Fully online brokerage with no personal contact was not an option at the time of the study. The six phases can be characterized as follows:• Orientation – Volunteers and organizations (partially staffed by volunteers are given practical information about volunteering. Volunteers can search a database of volunteer jobs at the office or online. Usually, there is no database of volunteers for organizations to look into, because most volunteer centres do not have such databases.• Registration – In the case of online brokerage, a volunteer must register in order to access the contact details of organizations. With face-to-face brokerage, registration often is incorporated into the matching phase. An organization also has to register to make use of the service of the volunteer centre.• Matching – Information about a volunteer is collected at a face-to-face interview. This information may include prior education, skills, hobbies, interests, aspirations, feelings, motivation and ambitions. Occasionally, tests are used. Several tests are available to determine which volunteer job best suits the personality, motivation and interests of a particular volunteer. However, tests are often considered an unnecessary hindrance. The personal data, test results, and sometimes the intuition and personal impressions of employees of the

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

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

    Science.gov (United States)

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

    2018-04-06

    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.

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

    Directory of Open Access Journals (Sweden)

    J.C. Brezet

    2009-08-01

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

  1. Broadband electrical impedance matching for piezoelectric ultrasound transducers.

    Science.gov (United States)

    Huang, Haiying; Paramo, Daniel

    2011-12-01

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

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

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

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

    KAUST Repository

    Gu, Binbin; Li, Zhixu; Zhang, Xiangliang; Liu, An; Liu, Guanfeng; Zheng, Kai; Zhao, Lei; Zhou, Xiaofang

    2017-01-01

    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.

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

    DEFF Research Database (Denmark)

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

    2012-01-01

    Over the recent years, the national databases of STR profiles have grown in size due to the success of forensic DNA analysis in solving crimes. The accumulation of DNA profiles implies that the probability of a random match or near match of two randomly selected DNA profiles in the database...... increases. We analysed 53,295 STR profiles from individuals investigated in relation to crime case investigations at the Department of Forensic Medicine, Faculty of Health Sciences, University of Copenhagen, Denmark. Incomplete STR profiles (437 circa 0.8% of the total), 48 redundant STR profiles from...

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

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

  8. Time Series Analysis Using Geometric Template Matching.

    Science.gov (United States)

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

    2013-03-01

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

  9. Composite shade guides and color matching.

    Science.gov (United States)

    Paolone, Gaetano; Orsini, Giovanna; Manauta, Jordi; Devoto, Walter; Putignano, Angelo

    2014-01-01

    Finding reliable systems that can help the clinician match the color of direct composite restorations is often an issue. After reviewing several composite shade guides available on the market and outlining their main characteristics and limits (unrealistic specimen thickness, not made with the same material the clinician will use, only a few allow to overlap enamel tabs on dentin ones), the authors evaluated the reliability of a system designed to produce self-made standardized "tooth-shaped" shade guide specimens. Small changes in composite enamel thickness may determine huge differences in esthetic outcomes. In conclusion, the results showed that all the specimens demonstrated comparable enamel thickness in all the examined areas (cervical, middle, incisal).

  10. Sequence Matching Analysis for Curriculum Development

    Directory of Open Access Journals (Sweden)

    Liem Yenny Bendatu

    2015-06-01

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

  11. 28 CFR 90.17 - Matching requirements.

    Science.gov (United States)

    2010-07-01

    ... building in the same locality. The basis for determining the value of personal services, materials..., work space, or the monetary value of time contributed by professional and technical personnel and other... project. The value placed on loaned or donated equipment may not exceed its fair rental value. The value...

  12. 34 CFR 361.60 - Matching requirements.

    Science.gov (United States)

    2010-07-01

    ... that are deposited in the account of the State agency or sole local agency in accordance with State law... organization with whom the donor shares a financial interest. The Secretary does not consider a donor's receipt...., rehabilitation technology services); serving individuals with certain types of disabilities (e.g., individuals...

  13. MATCHING ALTERNATIVE ADDRESSES: A SEMANTIC WEB APPROACH

    Directory of Open Access Journals (Sweden)

    S. Ariannamazi

    2015-12-01

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

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

  15. Alternative confidence measure for local matching stereo algorithms

    CSIR Research Space (South Africa)

    Ndhlovu, T

    2009-11-01

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

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

  17. Relationships Between Internal and External Match-Load Indicators in Soccer Match Officials.

    Science.gov (United States)

    Castillo, Daniel; Weston, Matthew; McLaren, Shaun J; Cámara, Jesús; Yanci, Javier

    2017-08-01

    The aims of this study were to describe the internal and external match loads (ML) of refereeing activity during official soccer matches and to investigate the relationship among the methods of ML quantification across a competitive season. A further aim was to examine the usefulness of differential perceived exertion (dRPE) as a tool for monitoring internal ML in soccer referees. Twenty field referees (FRs) and 43 assistant referees (ARs) participated in the study. Data were collected from 30 competitive matches (FR = 20 observations, AR = 43 observations) and included measures of internal (Edwards' heart-rate-derived training impulse [TRIMP EDW ]) ML, external (total distance covered, distance covered at high speeds, and player load) ML, and ML differentiated ratings of perceived respiratory (sRPE res ) and leg-muscle (sRPE mus ) exertion. Internal and external ML were all greater for FRs than for ARs (-19.7 to -72.5), with differences ranging from very likely very large to most likely extremely large. The relationships between internal-ML and external-ML indicators were, in most cases, unclear for FR (r internal and external ML. Moreover, dRPE represents distinct dimensions of effort and may be useful in monitoring soccer referees' ML during official matches.

  18. Impedance matching through a single passive fractional element

    KAUST Repository

    Radwan, Ahmed Gomaa

    2012-07-01

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

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

  20. FAX SERVICE

    CERN Multimedia

    Telephone Service

    2002-01-01

    As from 1st of July 2002, responsibility for running the Fax Service will be transfered to the Printer Service. Future requests for machines, toner and breakdown should be sent to Printer.Support@cern.ch - tel 78888. Telephone Service

  1. A blind matching algorithm for cognitive radio networks

    KAUST Repository

    Hamza, Doha R.; Shamma, Jeff S.

    2016-01-01

    that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power

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

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

  4. Fingerprint match-on-card: review and outlook

    CSIR Research Space (South Africa)

    Shabalala, MB

    2015-03-01

    Full Text Available the statistics on identity theft. This has been achieved by predominantly implementing biometrics matching algorithms inside smart card technology. The biometric matching inside a smart card is known as Match-on-Card/On-Card comparison. However compared...

  5. Multisensory Information Boosts Numerical Matching Abilities in Young Children

    Science.gov (United States)

    Jordan, Kerry E.; Baker, Joseph

    2011-01-01

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

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

  7. 32 CFR 701.125 - Computer matching program.

    Science.gov (United States)

    2010-07-01

    ... counterintelligence matches done in the course of performing a background check for security clearances of Federal... 32 National Defense 5 2010-07-01 2010-07-01 false Computer matching program. 701.125 Section 701... OF THE NAVY DOCUMENTS AFFECTING THE PUBLIC DON Privacy Program § 701.125 Computer matching program...

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

  9. An Inductive Characterization of Matching in Binding Bigraphs

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  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. 78 FR 15734 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2013-03-12

    ... 1974; Computer Matching Program AGENCY: Department of Homeland Security/U.S. Citizenship and... computer matching program between the Department of Homeland Security/U.S. Citizenship and Immigration... Protection Act of 1988 (Pub. L. 100-503) and the Computer Matching and Privacy Protection Amendments of 1990...

  12. 78 FR 15732 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2013-03-12

    ... 1974; Computer Matching Program AGENCY: Department of Homeland Security/U.S. Citizenship and... Privacy Act of 1974 (5 U.S.C. 552a), as amended by the Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503) and the Computer Matching and Privacy Protection Amendments of 1990 (Pub. L. 101...

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

    Science.gov (United States)

    2013-06-27

    ... 1974; Computer Matching Program AGENCY: Department of Homeland Security/U.S. Citizenship and... Agreement that establishes a computer matching program between the Department of Homeland Security/U.S... and Privacy Protection Act of 1988 (Pub. L. 100-503) and the Computer Matching and Privacy Protection...

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

    Science.gov (United States)

    2011-03-02

    ... Security Administration. SUMMARY: Pursuant to the Computer Matching and Privacy Protection Act of 1988, Public Law 100-503, the Computer Matching and Privacy Protections Amendments of 1990, Pub. L. 101-508... Interpreting the Provisions of Public Law 100-503, the Computer Matching and Privacy Protection Act of 1988...

  15. 78 FR 15733 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2013-03-12

    ... 1974; Computer Matching Program AGENCY: Department of Homeland Security/U.S. Citizenship and... computer matching program between the Department of Homeland Security/U.S. Citizenship and Immigration... Protection Act of 1988 (Pub. L. 100-503) and the Computer Matching and Privacy Protection Amendments of 1990...

  16. 78 FR 1275 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2013-01-08

    ... Social Security Administration (Computer Matching Agreement 1071). SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 552a), as amended by the Computer Matching and Privacy Protection Act of... of its new computer matching program with the Social Security Administration (SSA). DATES: OPM will...

  17. [Application of an improved model of a job-matching platform for nurses].

    Science.gov (United States)

    Huang, Way-Ren; Lin, Chiou-Fen

    2015-04-01

    The three-month attrition rate for new nurses in Taiwan remains high. Many hospitals rely on traditional recruitment methods to find new nurses, yet it appears that their efficacy is less than ideal. To effectively solve this manpower shortage, a nursing resource platform is a project worth developing in the future. This study aimed to utilize a quality-improvement model to establish communication between hospitals and nursing students and create a customized employee-employer information-matching platform to help nursing students enter the workforce. This study was structured around a quality-improvement model and used current situation analysis, literature review, focus-group discussions, and process re-engineering to formulate necessary content for a job-matching platform for nursing. The concept of an academia-industry strategic alliance helped connect supply and demand within the same supply chain. The nurse job-matching platform created in this study provided job flexibility as well as job suitability assessments and continued follow-up and services for nurses after entering the workforce to provide more accurate matching of employers and employees. The academia-industry strategic alliance, job suitability, and long-term follow-up designed in this study are all new features in Taiwan's human resource service systems. The proposed human resource process re-engineering provides nursing students facing graduation with a professionally managed human resources platform. Allowing students to find an appropriate job prior to graduation will improve willingness to work and employee retention.

  18. Service Modularity

    DEFF Research Database (Denmark)

    Avlonitis, Viktor; Hsuan, Juliana

    2015-01-01

    The purpose of this research is to investigate the studies on service modularity with a goal of informing service science and advancing contemporary service systems research. Modularity, a general systems property, can add theoretical underpinnings to the conceptual development of service science...... in general and service systems in particular. Our research is guided by the following question: how can modularity theory inform service system design? We present a review of the modularity literature and associated concepts. We then introduce the contemporary service science and service system discourse...

  19. Matching user needs in health care.

    Science.gov (United States)

    Bremer, G; Leggate, P

    1982-01-01

    Outlines patterns of library service available to users in the (British) National Health Service (NHS); gives preliminary results of a study detailing the character of the library system users, the nature of their needs and the degree to which the library system output meshes with user needs. The NHS library system is composed of widely scattered but small libraries, many of which can be characterized according to the narrow range of needs they serve. The largest libraries of the system, the teaching hospital library, share features of the NHS and university library systems. The most numerous, however, are the postgraduate medical education center libraries and nurse training school libraries. Until recently, there had been no cohesive organizational structure uniting the facilities and services of these various library groups. Regional library systems dating from 1967 have sought to encourage collaboration among libraries and to take into account user needs in policy planning. Recent research into medical libraries conducted by the British Library Research and Development Department points out the need for medical students and doctors to be able to adapt themselves to extracting needed information from any library which they might need to use during their career. Data showed that both clinical and preclinical medical personnel use a wide range of libraries, and are most satisfied with a multifunction library. Interpretation of data was undertaken within a conceptual framework of modelling developed by Checkland which provides a structure for thinking about the system. It is hoped that this approach will help to identify the sort of model of users which the library must maintain in order to provide them with the services they desire.

  20. Dataset Curation through Renders and Ontology Matching

    Science.gov (United States)

    2015-09-01

    government .001 services .246 furniture store .299 health salon .998 assoc./organization* .029 insurance agency .103 gastronomy .001 gas & automotive .219...Stanley Michael Bileschi. StreetScenes: Towards scene understanding in still images. PhD thesis, Massachusetts Institute of Technology , 2006. 3.5, 4.4...computer animation]. In Compcon’96.’ Technologies for the Information Superhigh- way’Digest of Papers. IEEE, 1996. 2.1 Aharon Bar Hillel and Daphna Weinshall

  1. Error Analysis for RADAR Neighbor Matching Localization in Linear Logarithmic Strength Varying Wi-Fi Environment

    Directory of Open Access Journals (Sweden)

    Mu Zhou

    2014-01-01

    Full Text Available This paper studies the statistical errors for the fingerprint-based RADAR neighbor matching localization with the linearly calibrated reference points (RPs in logarithmic received signal strength (RSS varying Wi-Fi environment. To the best of our knowledge, little comprehensive analysis work has appeared on the error performance of neighbor matching localization with respect to the deployment of RPs. However, in order to achieve the efficient and reliable location-based services (LBSs as well as the ubiquitous context-awareness in Wi-Fi environment, much attention has to be paid to the highly accurate and cost-efficient localization systems. To this end, the statistical errors by the widely used neighbor matching localization are significantly discussed in this paper to examine the inherent mathematical relations between the localization errors and the locations of RPs by using a basic linear logarithmic strength varying model. Furthermore, based on the mathematical demonstrations and some testing results, the closed-form solutions to the statistical errors by RADAR neighbor matching localization can be an effective tool to explore alternative deployment of fingerprint-based neighbor matching localization systems in the future.

  2. Error Analysis for RADAR Neighbor Matching Localization in Linear Logarithmic Strength Varying Wi-Fi Environment

    Science.gov (United States)

    Tian, Zengshan; Xu, Kunjie; Yu, Xiang

    2014-01-01

    This paper studies the statistical errors for the fingerprint-based RADAR neighbor matching localization with the linearly calibrated reference points (RPs) in logarithmic received signal strength (RSS) varying Wi-Fi environment. To the best of our knowledge, little comprehensive analysis work has appeared on the error performance of neighbor matching localization with respect to the deployment of RPs. However, in order to achieve the efficient and reliable location-based services (LBSs) as well as the ubiquitous context-awareness in Wi-Fi environment, much attention has to be paid to the highly accurate and cost-efficient localization systems. To this end, the statistical errors by the widely used neighbor matching localization are significantly discussed in this paper to examine the inherent mathematical relations between the localization errors and the locations of RPs by using a basic linear logarithmic strength varying model. Furthermore, based on the mathematical demonstrations and some testing results, the closed-form solutions to the statistical errors by RADAR neighbor matching localization can be an effective tool to explore alternative deployment of fingerprint-based neighbor matching localization systems in the future. PMID:24683349

  3. Football officials activities during matches: a comparison of activity of referees and linesmen in European, Premiership and Championship matches

    OpenAIRE

    Di Salvo, Valter; Carmont, Michael R; Maffulli, Nicola

    2012-01-01

    We compared the notational activity of 68 referees and 170 referee’s assistants or linesmen officiating European matches from UEFA and the Champions League together with matches from the English Premiership and the English Championship competitions during the 2005/2006 football season using a computerised video system. We studied 328 games (14 European matches, UEFA and Champions league, 202 matches from the English Premiership and 112 from the English Championship).

  4. Job creation, heterogeneous workers and technical change : matched worker/plant data : evidence from Norway

    OpenAIRE

    Salvanes, Kjell G.; Førre, Svein Erik

    2001-01-01

    Abstract: Using matched worker/plant level data for Norway, theories explaining the change in skill composition are assessed using direct evidence on the job creation and destruction for high, medium and low skilled workers. Skill based job creation is analysed in detail for plants in a high-skill service sector and in low- and high-tech manufacturing sectors. Given a compressed wage structure in Norway and increased supply of high skilled workers, the supply of skills may also explain the...

  5. Accuracy of Probabilistic Linkage Using the Enhanced Matching System for Public Health and Epidemiological Studies.

    Science.gov (United States)

    Aldridge, Robert W; Shaji, Kunju; Hayward, Andrew C; Abubakar, Ibrahim

    2015-01-01

    The Enhanced Matching System (EMS) is a probabilistic record linkage program developed by the tuberculosis section at Public Health England to match data for individuals across two datasets. This paper outlines how EMS works and investigates its accuracy for linkage across public health datasets. EMS is a configurable Microsoft SQL Server database program. To examine the accuracy of EMS, two public health databases were matched using National Health Service (NHS) numbers as a gold standard unique identifier. Probabilistic linkage was then performed on the same two datasets without inclusion of NHS number. Sensitivity analyses were carried out to examine the effect of varying matching process parameters. Exact matching using NHS number between two datasets (containing 5931 and 1759 records) identified 1071 matched pairs. EMS probabilistic linkage identified 1068 record pairs. The sensitivity of probabilistic linkage was calculated as 99.5% (95%CI: 98.9, 99.8), specificity 100.0% (95%CI: 99.9, 100.0), positive predictive value 99.8% (95%CI: 99.3, 100.0), and negative predictive value 99.9% (95%CI: 99.8, 100.0). Probabilistic matching was most accurate when including address variables and using the automatically generated threshold for determining links with manual review. With the establishment of national electronic datasets across health and social care, EMS enables previously unanswerable research questions to be tackled with confidence in the accuracy of the linkage process. In scenarios where a small sample is being matched into a very large database (such as national records of hospital attendance) then, compared to results presented in this analysis, the positive predictive value or sensitivity may drop according to the prevalence of matches between databases. Despite this possible limitation, probabilistic linkage has great potential to be used where exact matching using a common identifier is not possible, including in low-income settings, and for vulnerable

  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. 77 FR 24757 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of Labor (DOL))-Match...

    Science.gov (United States)

    2012-04-25

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2011-0083] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Department of Labor (DOL))--Match Number 1015 AGENCY: Social Security... regarding protections for such persons. The Privacy Act, as amended, regulates the use of computer matching...

  8. 77 FR 6620 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/the States); Match 6000 and 6003

    Science.gov (United States)

    2012-02-08

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2011-0102] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ the States); Match 6000 and 6003 AGENCY: Social Security Administration..., as shown above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection...

  9. 75 FR 68396 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of Labor (DOL))-Match...

    Science.gov (United States)

    2010-11-05

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2010-0052] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Department of Labor (DOL))--Match Number 1003 AGENCY: Social Security... as shown above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection...

  10. 77 FR 24756 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of Labor (DOL))-Match...

    Science.gov (United States)

    2012-04-25

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2011-0084] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Department of Labor (DOL))--Match Number 1003 AGENCY: Social Security... above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988...

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

    Galaxy clustering on small scales is significantly underpredicted 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 for 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.

  12. Introducing passive matched field acoustic tomography

    International Nuclear Information System (INIS)

    Gasparini, O.; Camporeale, C.; Crise, A.

    1997-01-01

    In acoustic tomography sea-basin environmental parameters such as temperature profiles and current-velocities are derived, when ray propagation models are adopted, by the travel time estimates relative to the identifiable ray paths. The transmitted signals are either single frequency, or impulsive, or intermittent and deterministic. When the wavelength is comparable with the scale lengths present in the propagation scenario, Matched Field Tomography (MFT) is used, entailing the consideration of waveguide modes instead of rays. A new concept in tomography is introduced in the paper, that employs passively the noise emitted by ships of opportunity (cargoes, ferries) as source signals. The passive technique is acoustic-pollution-free, and if a basin is selected in which a regular ship traffic occurs data can be received on a regular schedule, with no transmission cost. A novel array pre-processor for passive tomography is introduced, such that the signal structure at the pre-processor output in nearly the same as that obtainable in the case of single-frequency source signals

  13. Compressed Subsequence Matching and Packed Tree Coloring

    DEFF Research Database (Denmark)

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

    2017-01-01

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

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

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

    Directory of Open Access Journals (Sweden)

    XIAO Xiongwu

    2015-04-01

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

  16. A Sorting-to-Matching Method to Teach Compound Matching to Sample

    OpenAIRE

    Farber, Rachel S.; Dube, William V.; Dickson, Chata A.

    2016-01-01

    Individuals with developmental disabilities may fail to attend to multiple features in compound stimuli (e.g., arrays of pictures, letters within words) with detrimental effects on learning. Participants were 5 children with autism spectrum disorders who had low to intermediate accuracy scores (35% to 84%) on a computer-presented compound matching task. Sample stimuli were pairs of icons (e.g., chair-tree), the correct comparison was identical to the sample, and each incorrect comparison had ...

  17. CPU and GPU (Cuda Template Matching Comparison

    Directory of Open Access Journals (Sweden)

    Evaldas Borcovas

    2014-05-01

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

  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. Selecting foils for identification lineups: matching suspects or descriptions?

    Science.gov (United States)

    Tunnicliff, J L; Clark, S E

    2000-04-01

    Two experiments directly compare two methods of selecting foils for identification lineups. The suspect-matched method selects foils based on their match to the suspect, whereas the description-matched method selects foils based on their match to the witness's description of the perpetrator. Theoretical analyses and previous results predict an advantage for description-matched lineups both in terms of correctly identifying the perpetrator and minimizing false identification of innocent suspects. The advantage for description-matched lineups should be particularly pronounced if the foils selected in suspect-matched lineups are too similar to the suspect. In Experiment 1, the lineups were created by trained police officers, and in Experiment 2, the lineups were constructed by undergraduate college students. The results of both experiments showed higher suspect-to-foil similarity for suspect-matched lineups than for description-matched lineups. However, neither experiment showed a difference in correct or false identification rates. Both experiments did, however, show that there may be an advantage for suspect-matched lineups in terms of no-pick and rejection responses. From these results, the endorsement of one method over the other seems premature.

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

  1. Sodium bicarbonate supplementation prevents skilled tennis performance decline after a simulated match

    Directory of Open Access Journals (Sweden)

    Huang Ming-Hsiang

    2010-10-01

    Full Text Available Abstract The supplementation of sodium bicarbonate (NaHCO3 could increase performance or delay fatigue in intermittent high-intensity exercise. Prolonged tennis matches result in fatigue, which impairs skilled performance. The aim of this study was to investigate the effect of NaHCO3 supplementation on skilled tennis performance after a simulated match. Nine male college tennis players were recruited for this randomized cross-over, placebo-controlled, double-blind study. The participants consumed NaHCO3 (0.3 g. kg-1 or NaCl (0.209 g. kg-1 before the trial. An additional supplementation of 0.1 g. kg-1 NaHCO3 or 0.07 g. kg-1 NaCl was ingested after the third game in the simulated match. The Loughborough Tennis Skill Test was performed before and after the simulated match. Post-match [HCO3-] and base excess were significantly higher in the bicarbonate trial than those in the placebo trial. Blood [lactate] was significantly increased in the placebo (pre: 1.22 ± 0.54; post: 2.17 ± 1.46 mM and bicarbonate (pre: 1.23 ± 0.41; post: 3.21 ± 1.89 mM trials. The match-induced change in blood [lactate] was significantly higher in the bicarbonate trial. Blood pH remained unchanged in the placebo trial (pre: 7.37 ± 0.32; post: 7.37 ± 0.14 but was significantly increased in the bicarbonate trial (pre: 7.37 ± 0.26; post: 7.45 ± 0.63, indicating a more alkaline environment. The service and forehand ground stroke consistency scores were declined significantly after the simulated match in the placebo trial, while they were maintained in the bicarbonate trial. The match-induced declines in the consistency scores were significantly larger in the placebo trial than those in the bicarbonate trial. This study suggested that NaHCO3 supplementation could prevent the decline in skilled tennis performance after a simulated match.

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

    Institute of Scientific and Technical Information of China (English)

    ZHENG Shunyi; ZHANG Zuxun; ZHANG Jianqing

    2004-01-01

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

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

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

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

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

  7. An Improved Ant Colony Matching by Using Discrete Curve Evolution

    OpenAIRE

    Saadi, Younes; Sari, Eka,; Herawan, Tutut

    2014-01-01

    Part 1: Information & Communication Technology-EurAsia Conference 2014, ICT-EurAsia 2014; International audience; In this paper we present an improved Ant Colony Optimization (ACO) for contour matching, which can be used to match 2D shapes. Discrete Curve Evolution (DCE) technique is used to simplify the extracted contour. In order to find the best correspondence between shapes, the match process is formulated as a Quadratic Assignment Problem (QAP) and resolved by using Ant Colony Optimizati...

  8. Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching

    Science.gov (United States)

    2013-01-01

    REPORT Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching 14. ABSTRACT 16. SECURITY CLASSIFICATION OF: The stable matching...Franceschetti 858-822-2284 3. DATES COVERED (From - To) Standard Form 298 (Rev 8/98) Prescribed by ANSI Std. Z39.18 - Jealousy Graphs: Structure and...market. Using this structure, we are able to provide a ner analysis of the complexity of a subclass of decentralized matching markets. Jealousy

  9. Tuning and matching of the BPX ICH system

    International Nuclear Information System (INIS)

    Swain, D.W.

    1991-01-01

    Two methods of tuning and matching the ion cyclotron heating (ICH) antennas for the Burning Plasma Experiment (BPX) to the BPX plasma have been analyzed. Both appear to provide adequate tuning and matching capabilities. However, there are trade-offs between the frequency range that can be covered and the compactness of the high-voltage region of the transmission lines that makes up of the matching network. 4 refs., 5 figs

  10. National Resident Matching Program, Results and Data: 2016 Main Residency Match®

    Directory of Open Access Journals (Sweden)

    Michael A. Gisondi

    2017-05-01

    Full Text Available ALiEM EM Match Advice is a web series hosted on the Academic Life in Emergency Medicine website. The intended audience includes senior medical students seeking a residency in emergency medicine (EM and the faculty members who advise them. Each episode features a panel of three EM program directors who discuss a critical step in the residency application process. This article serves as a user’s guide to the series, including a timeline for viewing each episode, brief summaries of the panel discussions, and reflection questions for discussion between students and their faculty advisors.

  11. EMI Execution Service (EMI-ES) Specification

    CERN Document Server

    Schuller, B

    2010-01-01

    This document provides the interface specification, including related data models such as state model, activity description, resource and activity information, of an execution service, matching the needs of the EMI production middleware stack composed of ARC, gLite and UNICORE components. This service therefore is referred to as the EMI Execution Service (or “ES” for short). This document is a continuation of the work previously know as the GENEVA, then AGU (“ARC, gLite UNICORE”), then PGI execution service. As a starting point, the v0.42 of the “PGI Execution Service Specification” (doc15839) was used.

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

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

  14. Evaluation of the Match External Load in Soccer: Methods Comparison.

    Science.gov (United States)

    Castagna, Carlo; Varley, Matthew; Póvoas, Susana C A; D'Ottavio, Stefano

    2017-04-01

    To test the interchangeability of 2 match-analysis approaches for external-load detection considering arbitrary selected speeds and metabolic power (MP) thresholds in male top-level soccer. Data analyses were performed considering match physical performance of 60 matches (1200 player cases) of randomly selected Spanish, German, and English first-division championship matches (2013-14 season). Match analysis was performed with a validated semiautomated multicamera system operating at 25 Hz. During a match, players covered 10,673 ± 348 m, of which 1778 ± 208 m and 2759 ± 241 m were performed at high intensity, as measured using speed (≥16 km/h, HI) and metabolic power (≥20 W/kg, MPHI) notations. High-intensity notations were nearly perfectly associated (r = .93, P Player high-intensity decelerations (≥-2 m/s 2 ) were very largely associated with MPHI (r = .73, P physical match-analysis methods can be independently used to track match external load in elite-level players. However, match-analyst decisions must be based on use of a single method to avoid bias in external-load determination.

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

  16. Transverse Matching Progress Of The SNS Superconducting Linac

    International Nuclear Information System (INIS)

    Zhang, Yan; Cousineau, Sarah M.; Liu, Yun

    2011-01-01

    Experience using laser-wire beam profile measurement to perform transverse beam matching in the SNS superconducting linac is discussed. As the SNS beam power is ramped up to 1 MW, transverse beam matching becomes a concern to control beam loss and residual activation in the linac. In our experiments, however, beam loss is not very sensitive to the matching condition. In addition, we have encountered difficulties in performing a satisfactory transverse matching with the envelope model currently available in the XAL software framework. Offline data analysis from multi-particle tracking simulation shows that the accuracy of the current online model may not be sufficient for modeling the SC linac.

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

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

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

  20. Ecosystem Services

    Science.gov (United States)

    Ecosystem goods and services are the many life-sustaining benefits we receive from nature and contribute to environmental and human health and well-being. Ecosystem-focused research will develop methods to measure ecosystem goods and services.

  1. Web Service

    Science.gov (United States)

    ... topic data in XML format. Using the Web service, software developers can build applications that utilize MedlinePlus health topic information. The service accepts keyword searches as requests and returns relevant ...

  2. Service Innovations

    DEFF Research Database (Denmark)

    Sørensen, Lene Tolstrup; Nicolajsen, Hanne Westh

    2010-01-01

    This article discusses the challenges in relation to an ongoing project named converged advanced mobile media platform (CAMMP), where all the different stakeholders need to have a saying in the service development for the upcoming rich, mobile broadcasting services....

  3. HLA Match Likelihoods for Hematopoietic Stem-Cell Grafts in the U.S. Registry

    Science.gov (United States)

    Gragert, Loren; Eapen, Mary; Williams, Eric; Freeman, John; Spellman, Stephen; Baitty, Robert; Hartzman, Robert; Rizzo, J. Douglas; Horowitz, Mary; Confer, Dennis; Maiers, Martin

    2018-01-01

    Background Hematopoietic stem-cell transplantation (HSCT) is a potentially lifesaving therapy for several blood cancers and other diseases. For patients without a suitable related HLA-matched donor, unrelated-donor registries of adult volunteers and banked umbilical cord–blood units, such as the Be the Match Registry operated by the National Marrow Donor Program (NMDP), provide potential sources of donors. Our goal in the present study was to measure the likelihood of finding a suitable donor in the U.S. registry. Methods Using human HLA data from the NMDP donor and cord-blood-unit registry, we built population-based genetic models for 21 U.S. racial and ethnic groups to predict the likelihood of identifying a suitable donor (either an adult donor or a cord-blood unit) for patients in each group. The models incorporated the degree of HLA matching, adult-donor availability (i.e., ability to donate), and cord-blood-unit cell dose. Results Our models indicated that most candidates for HSCT will have a suitable (HLA-matched or minimally mismatched) adult donor. However, many patients will not have an optimal adult donor — that is, a donor who is matched at high resolution at HLA-A, HLA-B, HLA-C, and HLA-DRB1. The likelihood of finding an optimal donor varies among racial and ethnic groups, with the highest probability among whites of European descent, at 75%, and the lowest probability among blacks of South or Central American descent, at 16%. Likelihoods for other groups are intermediate. Few patients will have an optimal cord-blood unit — that is, one matched at the antigen level at HLA-A and HLA-B and matched at high resolution at HLA-DRB1. However, cord-blood units mismatched at one or two HLA loci are available for almost all patients younger than 20 years of age and for more than 80% of patients 20 years of age or older, regardless of racial and ethnic background. Conclusions Most patients likely to benefit from HSCT will have a donor. Public investment in

  4. A Service Component-based Accounting and Charging Architecture to Support Interim Mechanisms across Multiple Domains

    NARCIS (Netherlands)

    Le, V.M.; van Beijnum, Bernhard J.F.; Huitema, G.B.

    Today, telematics services are o Aen compositions of different chargeable service components offered by different service providers. To enhance component-based accounting and charging, the service composition information is used to match with the corresponding charging structure of a service

  5. Service marketing

    Directory of Open Access Journals (Sweden)

    Babić-Hodović Vesna

    2002-01-01

    Full Text Available Development of postindustrial society and services revolution created numerous changes in size of consumer demand, consumer reaction and priorities. Continuous change on the side of demand and offer must follow changes in marketing orientation. Leader in that change is services marketing which by knowing services range and all the changes builds a new concept called Relationship Marketing.

  6. Definition of an Ontology Matching Algorithm for Context Integration in Smart Cities.

    Science.gov (United States)

    Otero-Cerdeira, Lorena; Rodríguez-Martínez, Francisco J; Gómez-Rodríguez, Alma

    2014-12-08

    In this paper we describe a novel proposal in the field of smart cities: using an ontology matching algorithm to guarantee the automatic information exchange between the agents and the smart city. A smart city is composed by different types of agents that behave as producers and/or consumers of the information in the smart city. In our proposal, the data from the context is obtained by sensor and device agents while users interact with the smart city by means of user or system agents. The knowledge of each agent, as well as the smart city's knowledge, is semantically represented using different ontologies. To have an open city, that is fully accessible to any agent and therefore to provide enhanced services to the users, there is the need to ensure a seamless communication between agents and the city, regardless of their inner knowledge representations, i.e., ontologies. To meet this goal we use ontology matching techniques, specifically we have defined a new ontology matching algorithm called OntoPhil to be deployed within a smart city, which has never been done before. OntoPhil was tested on the benchmarks provided by the well known evaluation initiative, Ontology Alignment Evaluation Initiative, and also compared to other matching algorithms, although these algorithms were not specifically designed for smart cities. Additionally, specific tests involving a smart city's ontology and different types of agents were conducted to validate the usefulness of OntoPhil in the smart city environment.

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

  8. Integrated services

    International Nuclear Information System (INIS)

    Chafcouloff, S.; Michel, G.; Trice, M.; Clark, G.; Cosad, C.; Forbes, K.

    1995-01-01

    Integrated services is the name given to several services grouped together under a single contract. Four key factors determine the success of integrated services projects: teamwork, common objectives, technology, and shared benefits. For oil companies, integration means smoother, more efficient operations by bringing service companies on board as part of the team. For the service industry, it means a radical change in the way business is conducted, taking on more responsibility in return for greater incentives. This article reviews the need for change and the approach Schlumberger has adopted to meet this challenge. 20 figs., 20 refs

  9. Integrated services

    Energy Technology Data Exchange (ETDEWEB)

    Chafcouloff, S.; Michel, G.; Trice, M. [Schlumberger Integrated Project Management Group, Montrouge (France); Clark, G. [Schlumberger Testing Services, Aberdeen (United Kingdom); Cosad, C.; Forbes, K. [Schlumberger Integrated Project Management Group, Aberdeen (United Kingdom)

    1995-12-31

    Integrated services is the name given to several services grouped together under a single contract. Four key factors determine the success of integrated services projects: teamwork, common objectives, technology, and shared benefits. For oil companies, integration means smoother, more efficient operations by bringing service companies on board as part of the team. For the service industry, it means a radical change in the way business is conducted, taking on more responsibility in return for greater incentives. This article reviews the need for change and the approach Schlumberger has adopted to meet this challenge. 20 figs., 20 refs

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

  11. Teaching Identity Matching of Braille Characters to Beginning Braille Readers

    Science.gov (United States)

    Toussaint, Karen A.; Scheithauer, Mindy C.; Tiger, Jeffrey H.; Saunders, Kathryn J.

    2017-01-01

    We taught three children with visual impairments to make tactile discriminations of the braille alphabet within a matching-to-sample format. That is, we presented participants with a braille character as a sample stimulus, and they selected the matching stimulus from a three-comparison array. In order to minimize participant errors, we initially…

  12. 77 FR 75499 - Privacy Act of 1974: Computer Matching Program

    Science.gov (United States)

    2012-12-20

    ... DEPARTMENT OF VETERANS AFFAIRS Privacy Act of 1974: Computer Matching Program AGENCY: Department...: This match will commence on or about January 22, 2013 or 40 days after the Office of Management and... of 18 months after the commencing date, the Departments may renew the agreement for another 12 months...

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

  14. User-friendly matching protocol for online social networks

    NARCIS (Netherlands)

    Tang, Qiang

    2010-01-01

    In this paper, we outline a privacy-preserving matching protocol for OSN (online social network) users to find their potential friends. With the proposed protocol, a logged-in user can match her profile with that of an off-line stranger, while both profiles are maximally protected. Our solution

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

  16. Body Weight and Matching with a Physically Attractive Romantic Partner

    Science.gov (United States)

    Carmalt, Julie H.; Cawley, John; Joyner, Kara; Sobal, Jeffery

    2008-01-01

    Matching and attribute trade are two perspectives used to explain mate selection. We investigated patterns of matching and trade, focusing on obesity, using Add Health Romantic Pair data (N = 1,405 couples). Obese individuals, relative to healthy weight individuals, were less likely to have physically attractive partners, with this disadvantage…

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

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

  19. Explaining soccer match outcomes with goal scoring opportunities predictive analytics

    NARCIS (Netherlands)

    Eggels, H.; van Elk, R.; Pechenizkiy, M.

    2016-01-01

    In elite soccer, decisions are often based on recent results and emotions. In this paper, we propose a method to determine the expected winner of a match in elite soccer. The expected result of a soccer match is determined by estimating the probability of scoring for the individual goal scoring

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

  1. Analysis of fatigue development during elite male handball matches

    DEFF Research Database (Denmark)

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

    2014-01-01

    This study aimed at describing the physiological demands and fatigue development during elite male handball matches. Our hypothesis was that players perform multiple high-intensity activities during periods of the game and develop temporary and end-match neuromuscular fatigue. Time-motion analyses...

  2. The Modality-Match Effect in Recognition Memory

    Science.gov (United States)

    Mulligan, Neil W.; Osborn, Katherine

    2009-01-01

    The modality-match effect in recognition refers to superior memory for words presented in the same modality at study and test. Prior research on this effect is ambiguous and inconsistent. The present study demonstrates that the modality-match effect is found when modality is rendered salient at either encoding or retrieval. Specifically, in…

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

  4. 36 CFR 72.32 - Funding and matching share.

    Science.gov (United States)

    2010-07-01

    ... development may be used as part of a local match for Innovation or Rehabilitation grants only when the... approved by the respective NPS Regional Office. (b) Rehabilitation and Innovation grant matching. The... INTERIOR URBAN PARK AND RECREATION RECOVERY ACT OF 1978 Grants for Recovery Action Program Development...

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

  6. Anticipated growth and business cycles in matching models

    NARCIS (Netherlands)

    den Haan, W.J.; Kaltenbrunner, G.

    2009-01-01

    In a business cycle model that incorporates a standard matching framework, employment increases in response to news shocks, even though the wealth effect associated with the increase in expected productivity reduces labor force participation. The reason is that the matching friction induces

  7. Reliable Line Matching Algorithm for Stereo Images with Topological Relationship

    Directory of Open Access Journals (Sweden)

    WANG Jingxue

    2017-11-01

    Full Text Available Because of the lack of relationships between matching line and adjacent lines in the process of individual line matching, and the weak reliability of the individual line descriptor facing on discontinue texture, this paper presents a reliable line matching algorithm for stereo images with topological relationship. The algorithm firstly generates grouped line pairs from lines extracted from the reference image and searching image according to the basic topological relationships such as distance and angle between the lines. Then it takes the grouped line pairs as matching primitives, and matches these grouped line pairs by using epipolar constraint, homography constraint, quadrant constraint and gray correlation constraint of irregular triangle in order. And finally, it resolves the corresponding line pairs into two pairs of corresponding individual lines, and obtains one to one matching results after the post-processing of integrating, fitting, and checking. This paper adopts digital aerial images and close-range images with typical texture features to deal with the parameter analysis and line matching, and the experiment results demonstrate that the proposed algorithm in this paper can obtain reliable line matching results.

  8. Marriage and Divorce in a Model of Matching

    OpenAIRE

    Mumcu, Ayse; Saglam, Ismail

    2006-01-01

    We study the problem of marriage formation and marital distribution in a two-period model of matching, extending the matching with bargaining framework of Crawford and Rochford (1986). We run simulations to find the effects of alimony rate, legal cost of divorce, initial endowments, couple and single productivity parameters on the payoffs and marital status in the society.

  9. Matching games: the least core and the nucleolus

    NARCIS (Netherlands)

    Kern, Walter; Paulusma, Daniël

    2003-01-01

    A matching game is a cooperative game defined by a graph G = (N, E). The player set is N and the value of a coalition S ⫅ N is defined as the size of a maximum matching in the subgraph induced by S. We show that the nucleolus of such games can be computed efficiently. The result is based on an

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

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

  12. How convincing is a matching Y-chromosome profile?

    DEFF Research Database (Denmark)

    Andersen, Mikkel Meyer; Balding, David J.

    2017-01-01

    , yet the number of matching relatives is fixed as population size varies, it is typically infeasible to derive population-based match probabilities relevant to a specific crime. We propose a conceptually simple solution, based on a simulation model and software to approximate the distribution...

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

    Science.gov (United States)

    2013-03-12

    ... DEPARTMENT OF HOMELAND SECURITY Office of the Secretary [Docket No. DHS-2013-0011] Privacy Act of 1974; Computer Matching Program AGENCY: Department of Homeland Security/U.S. Citizenship and... amended by the Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503) and the Computer...

  14. Mode-matching strategies in slowly varying engine ducts

    NARCIS (Netherlands)

    Ovenden, N.C.; Rienstra, S.W.

    2003-01-01

    A matching method is proposed to connect the CFD source region to the CAA propagation region of rotorstator interaction sound produced in a turbofan engine. The method is based on a modal decomposition across three neighbouring axial interfaces adjacent to the matching interface. The modal

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

  16. Reheat cracking susceptibility of new generation 2%CrMo(W)V P23 steel multipass welds made using matching and mis-matching filler metals

    Energy Technology Data Exchange (ETDEWEB)

    Nevasmaa, P.; Salonen, J.; Holmstroem, S. [VTT Technical Research Centre of Finland, Espoo (Finland)

    2007-06-15

    In comparison with conventional creep resisting grade T/P22, the modified 2%Cr steels T/P23 and T/P24 show nearly twice the creep strength at typical service temperatures of about 520-570 deg C. The possibility of welding thin-wall boiler tubes without preheating or PWHT has promoted the use of T23 and T24 in practical boiler service. For thick-wall applications and multipass welds, welding consumables still require further development to improve creep strength and ductility. Susceptibility to reheat cracking and hydrogen cracking increase with the wall-thickness and structural rigidity of the component. Consequently, thick-wall sections generally require the use of PWHT and sometimes preheating as well. This paper is concerned with weldability of P23 pipe steel, with particular emphasis on reheat cracking sensitivity of simulated HAZ microstructures and thick-section multipass welds made using closely matching and mis-matching filler metals. The results demonstrate that the weld metal is far more critical than the parent steel HAZ, both in terms of reheat cracking sensitivity and ductility and toughness. In the as-welded condition, the weld metal exhibited excessive hardness of {approx}380 HV and only diminutive Charpy toughness at room temperature. Adoption of the PWHT (760 deg C/2h) enhanced the weldment toughness; however, it also inevitably raises risk to reheat cracking in the weld metal that showed values of reduction of area (RA) no more than 2-3% in the BWI cracking test. The results imply that thick-section multipass welds made using filler metal with the chemical composition closer to P24 grade material are much less susceptible to reheat cracking than 'matching' P23 grade welds. (orig.)

  17. A coarse to fine minutiae-based latent palmprint matching.

    Science.gov (United States)

    Liu, Eryun; Jain, Anil K; Tian, Jie

    2013-10-01

    With the availability of live-scan palmprint technology, high resolution palmprint recognition has started to receive significant attention in forensics and law enforcement. In forensic applications, latent palmprints provide critical evidence as it is estimated that about 30 percent of the latents recovered at crime scenes are those of palms. Most of the available high-resolution palmprint matching algorithms essentially follow the minutiae-based fingerprint matching strategy. Considering the large number of minutiae (about 1,000 minutiae in a full palmprint compared to about 100 minutiae in a rolled fingerprint) and large area of foreground region in full palmprints, novel strategies need to be developed for efficient and robust latent palmprint matching. In this paper, a coarse to fine matching strategy based on minutiae clustering and minutiae match propagation is designed specifically for palmprint matching. To deal with the large number of minutiae, a local feature-based minutiae clustering algorithm is designed to cluster minutiae into several groups such that minutiae belonging to the same group have similar local characteristics. The coarse matching is then performed within each cluster to establish initial minutiae correspondences between two palmprints. Starting with each initial correspondence, a minutiae match propagation algorithm searches for mated minutiae in the full palmprint. The proposed palmprint matching algorithm has been evaluated on a latent-to-full palmprint database consisting of 446 latents and 12,489 background full prints. The matching results show a rank-1 identification accuracy of 79.4 percent, which is significantly higher than the 60.8 percent identification accuracy of a state-of-the-art latent palmprint matching algorithm on the same latent database. The average computation time of our algorithm for a single latent-to-full match is about 141 ms for genuine match and 50 ms for impostor match, on a Windows XP desktop system with 2

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

    DEFF Research Database (Denmark)

    Hazay, Carmit; Toft, Tomas

    2014-01-01

    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......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...... is an important problem that has many applications in the area of DNA search, computational biology and more. Our construction guarantees full simulation in the presence of malicious, polynomial-time adversaries (assuming the hardness of DDH assumption) and exhibits computation and communication costs of O...

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

  20. Improved artificial bee colony algorithm based gravity matching navigation method.

    Science.gov (United States)

    Gao, Wei; Zhao, Bo; Zhou, Guang Tao; Wang, Qiu Ying; Yu, Chun Yang

    2014-07-18

    Gravity matching navigation algorithm is one of the key technologies for gravity aided inertial navigation systems. With the development of intelligent algorithms, the powerful search ability of the Artificial Bee Colony (ABC) algorithm makes it possible to be applied to the gravity matching navigation field. However, existing search mechanisms of basic ABC algorithms cannot meet the need for high accuracy in gravity aided navigation. Firstly, proper modifications are proposed to improve the performance of the basic ABC algorithm. Secondly, a new search mechanism is presented in this paper which is based on an improved ABC algorithm using external speed information. At last, modified Hausdorff distance is introduced to screen the possible matching results. Both simulations and ocean experiments verify the feasibility of the method, and results show that the matching rate of the method is high enough to obtain a precise matching position.

  1. CMOS Silicon-on-Sapphire RF Tunable Matching Networks

    Directory of Open Access Journals (Sweden)

    Chamseddine Ahmad

    2006-01-01

    Full Text Available This paper describes the design and optimization of an RF tunable network capable of matching highly mismatched loads to 50 at 1.9 GHz. Tuning was achieved using switched capacitors with low-loss, single-transistor switches. Simulations show that the performance of the matching network depends strongly on the switch performances and on the inductor losses. A 0.5 m silicon-on-sapphire (SOS CMOS technology was chosen for network implementation because of the relatively high-quality monolithic inductors achievable in the process. The matching network provides very good matching for inductive loads, and acceptable matching for highly capacitive loads. A 1 dB compression point greater than dBm was obtained for a wide range of load impedances.

  2. POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY

    Directory of Open Access Journals (Sweden)

    S. Chen

    2016-06-01

    Full Text Available Image matching lies at the heart of photogrammetry and computer vision. For poor textural images, the matching result is affected by low contrast, repetitive patterns, discontinuity or occlusion, few or homogeneous textures. Recently, graph matching became popular for its integration of geometric and radiometric information. Focused on poor textural image matching problem, it is proposed an edge-weight strategy to improve graph matching algorithm. A series of experiments have been conducted including 4 typical landscapes: Forest, desert, farmland, and urban areas. And it is experimentally found that our new algorithm achieves better performance. Compared to SIFT, doubled corresponding points were acquired, and the overall recall rate reached up to 68%, which verifies the feasibility and effectiveness of the algorithm.

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

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

  5. Comparative Performance Analysis of Different Fingerprint Biometric Scanners for Patient Matching.

    Science.gov (United States)

    Kasiiti, Noah; Wawira, Judy; Purkayastha, Saptarshi; Were, Martin C

    2017-01-01

    Unique patient identification within health services is an operational challenge in healthcare settings. Use of key identifiers, such as patient names, hospital identification numbers, national ID, and birth date are often inadequate for ensuring unique patient identification. In addition approximate string comparator algorithms, such as distance-based algorithms, have proven suboptimal for improving patient matching, especially in low-resource settings. Biometric approaches may improve unique patient identification. However, before implementing the technology in a given setting, such as health care, the right scanners should be rigorously tested to identify an optimal package for the implementation. This study aimed to investigate the effects of factors such as resolution, template size, and scan capture area on the matching performance of different fingerprint scanners for use within health care settings. Performance analysis of eight different scanners was tested using the demo application distributed as part of the Neurotech Verifinger SDK 6.0.

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

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

    Science.gov (United States)

    Kohn, Jessica R; Heath, Sarah L; Behnia, Rudy

    2018-01-01

    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.

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

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

    International Nuclear Information System (INIS)

    Reuter, Juergen; Nejad, Bijan Chokoufe; Kilian, Wolfgang; Stahlhofen, Maximilian

    2016-01-01

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

  10. Managing employee creativity and health in nursing homes : the moderating role of matching job resources and matching occupational rewards

    NARCIS (Netherlands)

    de Jonge, J.; Gevers, J.M.P.; Dollard, M.F.

    2014-01-01

    Health care staff in nursing homes are facing increasingly high job demands at work, which can have a detrimental impact on their health and work motivation. The Demand-Induced Strain Compensation (DISC) Model offers a theoretical framework to study how matching job resources and matching

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

    DEFF Research Database (Denmark)

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

    2014-01-01

    The study examined the effect of caffeine supplementation on match activities and development of fatigue during a football match. In a randomised, double-blind cross-over design, two experimental football games separated by 7 days were organised between the junior teams of two professional footba...

  12. Chest compression quality management and return of spontaneous circulation: a matched-pair registry study.

    Science.gov (United States)

    Lukas, Roman-Patrik; Gräsner, Jan Thorsten; Seewald, Stephan; Lefering, Rolf; Weber, Thomas Peter; Van Aken, Hugo; Fischer, Matthias; Bohn, Andreas

    2012-10-01

    Investigating the effects of any intervention during cardiac arrest remains difficult. The ROSC after cardiac arrest score was introduced to facilitate comparison of rates of return of spontaneous circulation (ROSC) between different ambulance services. To study the influence of chest compression quality management (including training, real-time feedback devices, and debriefing) in comparison with conventional cardiopulmonary resuscitation (CPR), a matched-pair analysis was conducted using data from the German Resuscitation Registry, with the calculated ROSC after cardiac arrest score as the baseline. Matching for independent ROSC after cardiac arrest score variables yielded 319 matched cases from the study period (January 2007-March 2011). The score predicted a 45% ROSC rate for the matched pairs. The observed ROSC increased significantly with chest compression quality management, to 52% (P=0.013; 95% CI, 46-57%). No significant differences were seen in the conventional CPR group (47%; 95% CI, 42-53%). The difference between the observed ROSC rates was not statistically significant. Chest compression quality management leads to significantly higher ROSC rates than those predicted by the prognostic score (ROSC after cardiac arrest score). Matched-pair analysis shows that with conventional CPR, the observed ROSC rate was not significantly different from the predicted rate. Analysis shows a trend toward a higher ROSC rate for chest compression quality management in comparison with conventional CPR. It is unclear whether a single aspect of chest compression quality management or the combination of training, real-time feedback, and debriefing contributed to this result. Copyright © 2012 Elsevier Ireland Ltd. All rights reserved.

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

  14. Energy demands during a judo match and recovery.

    Science.gov (United States)

    Degoutte, F; Jouanel, P; Filaire, E

    2003-06-01

    To assess energy demand during a judo match and the kinetics of recovery by measuring the metabolites of the oxypurine cascade, lipolytic activity, and glycolytic pathway. Venous blood samples were taken from 16 national judoists (mean (SEM) age 18.4 (1.6) years), before (T(1)) and three minutes (T(2)), one hour (T(3)), and 24 hours (T(4)) after a match. A seven day diet record was used to evaluate nutrient intake. Nutrient analysis indicated that these athletes followed a low carbohydrate diet. Plasma lactate concentration had increased to 12.3 (1.8) mmol/l at the end of the match. An increase in the levels of extracellular markers of muscle adenine nucleotide catabolism, urea, and creatinine was observed at T(2), while uric acid levels remained unchanged. High concentrations of urea persisted for 24 hours during the recovery period. Ammonia, hypoxanthine, xanthine, and creatinine returned to control levels within the 24 hour recovery period. Uric acid concentrations rose from T(3) and had not returned to baseline 24 hours after the match. The levels of triglycerides, glycerol, and free fatty acids had increased significantly (p<0.05) after the match (T(2)) but returned to baseline values within 24 hours. Concentrations of high density lipoprotein cholesterol and total cholesterol were significantly increased after the match. These results show that a judo match induces both protein and lipid metabolism. Carbohydrate availability, training adaptation, and metabolic stress may explain the requirement for these types of metabolism.

  15. Improved LSB matching steganography with histogram characters reserved

    Science.gov (United States)

    Chen, Zhihong; Liu, Wenyao

    2008-03-01

    This letter bases on the researches of LSB (least significant bit, i.e. the last bit of a binary pixel value) matching steganographic method and the steganalytic method which aims at histograms of cover images, and proposes a modification to LSB matching. In the LSB matching, if the LSB of the next cover pixel matches the next bit of secret data, do nothing; otherwise, choose to add or subtract one from the cover pixel value at random. In our improved method, a steganographic information table is defined and records the changes which embedded secrete bits introduce in. Through the table, the next LSB which has the same pixel value will be judged to add or subtract one dynamically in order to ensure the histogram's change of cover image is minimized. Therefore, the modified method allows embedding the same payload as the LSB matching but with improved steganographic security and less vulnerability to attacks compared with LSB matching. The experimental results of the new method show that the histograms maintain their attributes, such as peak values and alternative trends, in an acceptable degree and have better performance than LSB matching in the respects of histogram distortion and resistance against existing steganalysis.

  16. Steelmaking-Casting of Molten Steel by Decarburization Ladle Matching

    Directory of Open Access Journals (Sweden)

    Wei Liu

    2018-01-01

    Full Text Available Steelmaking–continuous casting is a complex process. The method of selecting a ladle, which also functions as a storage device, follows a specific process of the production plan. In ladle matching, several ladle attributes are considered. However, matching objectives are difficult to achieve simultaneously. Different molten steel properties have contributed to the complexity of matching constraints, and, thus, matching optimization is regarded a multiconflict goal problem. In the process of optimization, the first-order rule learning method is first used to extract key ladle attributes (performance indicators, including highest temperature, usage frequency, lowest-level material, and outlet. On the basis of a number of indicators, such as ladle temperature, quantity, material, and usage frequency, as well as skateboard quantity, the ladle matching model is established. Second, the rule of ladle selection is determined by the method of least-generalization rule learning. Third, a simulation experiment is carried out according to various scheduling order strategies and matching priority combinations. Finally, the heuristic ladle matching method based on the rule priority (RP is determined for possible industrial applications. Results show that the accuracy of ladle selection can be improved. In particular, the numbers of ladles and maintenance times are reduced. Consequently, furnace production efficiency is also enhanced.

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

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

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

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

  1. Management services

    International Nuclear Information System (INIS)

    Adkins, S.K.; Alford, D.R.; Barnette, A.B.

    1979-01-01

    The Management Services Section provides coordinated professional administrative services to the Fusion Energy Division (FED), allowing the work of technical professionals to be more fully concentrated in their areas of specialty. Services are provided in general administration, personnel, financial management, communications (including text and graphics generation), management information, library, safety, quality assurance, and nonprogrammatic engineering services. Highlights of the past year included adoption of the Procurement Module in the FED Management Information System (MIS) for use by the entire Laboratory, completion of the Personnel Module of the MIS, greatly increased personnel recruiting activity, and increased industrial subcontracting activity

  2. Dosimetry Service

    CERN Multimedia

    2006-01-01

    Cern Staff and Users can now consult their dose records for an individual or an organizational unit with HRT. Please see more information on our web page: http://cern.ch/rp-dosimetry Dosimetry Service is open every morning from 8.30 - 12.00. Closed in the afternoons. We would like to remind you that dosimeters cannot be sent to customers by internal mail. Short-term dosimeters (VCT's) must always be returned to the Service after the use and must not be left on the racks in the experimental areas or in the secretariats. Dosimetry Service Tel. 7 2155 Dosimetry.service@cern.ch http://cern.ch/rp-dosimetry

  3. Matching food service products to consumer demands through product development alliances and modularisation

    OpenAIRE

    Olsen, Johanne Rønnow; Friis, Alan; Christensen, Torben Bo Toft; Harmsen, Hanne

    2009-01-01

    An increasing number of meals are being consumed outside the home, and a new, interesting market for food producers are therefore emerging. However, meeting consumers’ demands, among others for quality, can represent a challenge, especially because producers are typically not involved in the composition of meal solutions and, therefore cannot control all processing steps and interactions with other meal components. In this project, it is proposed that cooperation between food producers on pro...

  4. Matching food service products to consumer demands through product development alliances and modularisation

    DEFF Research Database (Denmark)

    Olsen, Johanne Rønnow

    2009-01-01

    of product development managers (with the main themes food trends, meal solutions and product development alliances), as well as data from sensory studies of interactions between meal components. Apart from the quality cycle mentioned above, the research has generated the tools listed below to be applied......, more specifically, meal solutions. The results of this research contribute to the knowledge base on product development in the food industry, mainly regarding quality, product development alliances and modularisation,and fill several gaps in the literature. Future research should focus on further...... in the composition of meal solutions and, therefore cannot control all processing steps and interactions with other meal components. In this project, it is proposed that cooperation between food producers on product development (product development alliances) in relation to meal solutions can improve the quality...

  5. Center for Medicare and Medicaid Services (CMS) Nursing Home Match (MDS)

    Data.gov (United States)

    Social Security Administration — The purpose of the project is to detect unreported Supplemental Security Income (SSI) recipient admissions to Title XIX institutions. A file containing SSN's of SSI...

  6. DEHYDRATION IN SOCCER PLAYERS AFTER A MATCH IN THE HEAT

    Directory of Open Access Journals (Sweden)

    J.C.B. Marins

    2011-11-01

    Full Text Available We investigated the level of dehydration after a match in 20 soccer players (mean ± SD, 17.9 ± 1.3 years old, height 1.75 ± 0.05 m, body mass 70.71± 7.65 kg from two teams that participate in a Brazilian Championship game performed at a temperature of 29 ± 1.1 C and a relative humidity of 64 ± 4.2%. Body mass, urine specific gravity and urinary protein were measured before and after the match, and self-perception measurements were performed during the match. Body mass loss was 1.00 ± 0.39 kg, corresponding to a dehydration percentage of 1.35 ± 0.87%. The mean sweating rate during the match was 866 ± 319 ml · h[sup]-1[/sup] and total fluid intake was 1265.00 ± 505.45 ml. The sweating rate and the quantity of ingested fluids correlated positively (r = 0.98; P<0.05. Protein occurred in the urine in 18 soccer players. The players showed no perception of thirst and considered themselves as comfortable during the match. At the end of the match the soccer players replaced 57.7 ± 15% of the water loss and presented a condition of significant to severe dehydration based on the post-match urine specific gravity data (1.027 ± 6 g · ml[sup]-1[/sup]. The results of this study demonstrate that most of the soccer players began the match with some degree of dehydration that worsened during the match.

  7. Robust and accurate multi-view reconstruction by prioritized matching

    DEFF Research Database (Denmark)

    Ylimaki, Markus; Kannala, Juho; Holappa, Jukka

    2012-01-01

    a prioritized matching method which expands the most promising seeds first. The output of the method is a three-dimensional point cloud. Unlike previous correspondence growing approaches our method allows to use the best-first matching principle in the generic multi-view stereo setting with arbitrary number...... of input images. Our experiments show that matching the most promising seeds first provides very robust point cloud reconstructions efficiently with just a single expansion step. A comparison to the current state-of-the-art shows that our method produces reconstructions of similar quality but significantly...

  8. The Basic Economics of Match Fixing in Sport Tournaments

    OpenAIRE

    Raul Caruso

    2009-01-01

    Match-fixing is a recurring phenomenon of sport contests. This paper presents a simple formal model in order to explain them. The intuition behind is that an asymmetry in the evaluation of the stake is the key factor leading to match-fixing or to tacit collusion. In particular, it will be demonstrated that an asymmetry in the evaluation of the stake can lead to a concession from one agent to the other and then to a match-fixing. It is also demonstrated that when the asymmetry in the evaluatio...

  9. Price-Matching leads to the Cournot Outcome

    DEFF Research Database (Denmark)

    Batsaikhan, Mongoljin; Tumennasan, Norovsambuu

    Bertrand competition that the market price in the presence of a price-matching option ranges from the monopolistic price to the Bertrand price. Our result suggests that the effect of price-matching depends on whether the output is a choice variable for the firms.......We study the effects of price-matching in a duopoly setting in which each firm selects both its price and output, simultaneously. We show that the availability of a pricematching option leads to the Cournot outcome in this setting. This result is a stark contrast to the one obtained in the standard...

  10. Match Rigging and the Career Concerns of Referees

    DEFF Research Database (Denmark)

    Severgnini, Battista; Boeri, Tito

    2011-01-01

    This paper contributes to the literature on career concerns and corruption by drawing on extensive information on the performance of referees and records from Calciopoli, a judicial inquiry carried out in 2006 on corruption in the Italian football league. Unlike previous studies, we can analyse...... in detail the assignment of the referees to the most important matches, which is an important step in their career. Moreover, we can relate this choice to the performance of referees in previous matches and the evaluations they received in this context. We find that referees involved in match rigging were...

  11. EMI Execution Service Specification 1.0

    CERN Document Server

    Schuller, B. (JUELICH); Smirnova, O (Lund University); Konstantinov, A. (Oslo University); Skou Andersen, M. (University of Copenhagen); Riedel, M. (JUELICH); Memon, A.S. (JUELICH); Memon, M.S. (JUELICH); Zangrando, L. (INFN); Sgaravatto, M. (INFN); Frizziero, E. (INFN)

    2010-01-01

    This document provides the interface specification, including related data models such as state model, activity description, resource and activity information, of an execution service, matching the needs of the EMI production middleware stack composed of ARC, gLite and UNICORE components. This service therefore is referred to as the EMI Execution Service (or “ES” for short). This document is a continuation of the work previously known as the GENEVA, then AGU (“ARC, gLite UNICORE”), then PGI execution service.

  12. Information Service.

    Science.gov (United States)

    Scofield, James

    Newspaper librarians discussed the public use of their newspapers' libraries. Policies run the gamut from well-staffed public information services, within or outside the newspaper library, to no service at all to those outside the staff of the paper. Problems of dealing with tax and law enforcement agencies were covered, as well as cooperative…

  13. Registration Service

    CERN Multimedia

    GS Department

    2010-01-01

    Following a reorganization in Building 55, please note that the Registration Service is now organised as follows :  Ground floor: access cards (76903). 1st floor : registration of external firms’ personnel (76611 / 76622); car access stickers (76633); biometric registration (79710). Opening hours: 07-30 to 16-00 non-stop. GS-SEM Group General Infrastructure Services Department

  14. Telephone Service

    CERN Multimedia

    2005-01-01

    As part of the upgrade of telephone services, the CERN exchange switches will be updated on Thursday 2 June between 7.00 p.m. and midnight. Telephone services may be affected and possibly even disrupted during this operation. 

  15. Cleaning Services.

    Science.gov (United States)

    Sharpton, James L.

    This curriculum guide provides cleaning services instructional materials for a ninth- and tenth-grade Coordinated Vocational Education and Training: Home and Community Services program. It includes 2 sections and 11 instructional units. Each unit of instruction consists of eight basic components: performance objectives, teacher activities,…

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

    Science.gov (United States)

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

    2006-08-10

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

  17. Equation level matching: An extension of the method of matched asymptotic expansion for problems of wave propagation

    Science.gov (United States)

    Faria, Luiz; Rosales, Rodolfo

    2017-11-01

    We introduce an alternative to the method of matched asymptotic expansions. In the ``traditional'' implementation, approximate solutions, valid in different (but overlapping) regions are matched by using ``intermediate'' variables. Here we propose to match at the level of the equations involved, via a ``uniform expansion'' whose equations enfold those of the approximations to be matched. This has the advantage that one does not need to explicitly solve the asymptotic equations to do the matching, which can be quite impossible for some problems. In addition, it allows matching to proceed in certain wave situations where the traditional approach fails because the time behaviors differ (e.g., one of the expansions does not include dissipation). On the other hand, this approach does not provide the fairly explicit approximations resulting from standard matching. In fact, this is not even its aim, which to produce the ``simplest'' set of equations that capture the behavior. Ruben Rosales work was partially supported by NSF Grants DMS-1614043 and DMS-1719637.

  18. Service Modeling for Service Engineering

    Science.gov (United States)

    Shimomura, Yoshiki; Tomiyama, Tetsuo

    Intensification of service and knowledge contents within product life cycles is considered crucial for dematerialization, in particular, to design optimal product-service systems from the viewpoint of environmentally conscious design and manufacturing in advanced post industrial societies. In addition to the environmental limitations, we are facing social limitations which include limitations of markets to accept increasing numbers of mass-produced artifacts and such environmental and social limitations are restraining economic growth. To attack and remove these problems, we need to reconsider the current mass production paradigm and to make products have more added values largely from knowledge and service contents to compensate volume reduction under the concept of dematerialization. Namely, dematerialization of products needs to enrich service contents. However, service was mainly discussed within marketing and has been mostly neglected within traditional engineering. Therefore, we need new engineering methods to look at services, rather than just functions, called "Service Engineering." To establish service engineering, this paper proposes a modeling technique of service.

  19. Numerical experiment on finite element method for matching data

    International Nuclear Information System (INIS)

    Tokuda, Shinji; Kumakura, Toshimasa; Yoshimura, Koichi.

    1993-03-01

    Numerical experiments are presented on the finite element method by Pletzer-Dewar for matching data of an ordinary differential equation with regular singular points by using model equation. Matching data play an important role in nonideal MHD stability analysis of a magnetically confined plasma. In the Pletzer-Dewar method, the Frobenius series for the 'big solution', the fundamental solution which is not square-integrable at the regular singular point, is prescribed. The experiments include studies of the convergence rate of the matching data obtained by the finite element method and of the effect on the results of computation by truncating the Frobenius series at finite terms. It is shown from the present study that the finite element method is an effective method for obtaining the matching data with high accuracy. (author)

  20. A Multi-Scale Settlement Matching Algorithm Based on ARG

    Science.gov (United States)

    Yue, Han; Zhu, Xinyan; Chen, Di; Liu, Lingjia

    2016-06-01

    Homonymous entity matching is an important part of multi-source spatial data integration, automatic updating and change detection. Considering the low accuracy of existing matching methods in dealing with matching multi-scale settlement data, an algorithm based on Attributed Relational Graph (ARG) is proposed. The algorithm firstly divides two settlement scenes at different scales into blocks by small-scale road network and constructs local ARGs in each block. Then, ascertains candidate sets by merging procedures and obtains the optimal matching pairs by comparing the similarity of ARGs iteratively. Finally, the corresponding relations between settlements at large and small scales are identified. At the end of this article, a demonstration is presented and the results indicate that the proposed algorithm is capable of handling sophisticated cases.

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

    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 miniaturized version of this complex system is being developed for pattern matching in generic image processing applications. The design uses the flexibility of Field Programmable Gate Arrays (FPGAs) and the powerful Associative Memory Chip (ASIC) to achieve real-time performance. 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.

  2. Transition I efficiency and victory in volleyball matches

    Directory of Open Access Journals (Sweden)

    Herbert Ugrinowitsch

    2014-03-01

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

  3. Rating of vocational interests under matching and nonmatching conditions.

    Science.gov (United States)

    Athanasou, James A

    2003-06-01

    This study examined whether high school students were better able to assess their scores on an interest inventory when the self-ratings were either matched or unmatched with the interest categories in an interest inventory. Students (N = 329) completed the Career Interest Test and a survey containing the same seven interest dimensions (Outdoor, Practical, Scientific, Creative, Business, Office, and People Contact). At the same time they completed four ratings of interests in the Data, Ideas, People, and Things work-task dimensions. Findings indicated higher convergent validities for matching self-ratings. The median correlation for matching categories was 52 and for unmatched categories was .21. Results supported the validity of self-ratings and the use of matched categories for the assessment of interests.

  4. Multi-Configuration Matched Spectral Filter Core, Phase I

    Data.gov (United States)

    National Aeronautics and Space Administration — OPTRA proposes an open-architecture spectral gas sensor based on compressive sensing concepts employed for both spatial and spectral domains. Our matched spectral...

  5. Coarse-to-fine region selection and matching

    KAUST Repository

    Yang, Yanchao

    2015-10-15

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

  6. PATTERN CLASSIFICATION APPROACHES TO MATCHING BUILDING POLYGONS AT MULTIPLE SCALES

    Directory of Open Access Journals (Sweden)

    X. Zhang

    2012-07-01

    Full Text Available 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 to make decisions? This paper mainly focuses on the second issue and views data matching as a supervised pattern classification. Several classifiers (i.e. decision trees, Naive Bayes and support vector machines are evaluated for the matching task. Four criteria (i.e. position, size, shape and orientation are used to extract information for these classifiers. Evidence shows that these classifiers outperformed the weighted average approach.

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

  8. Matched conversion sales in the nuclear fuel market

    International Nuclear Information System (INIS)

    Fuller, D.M.

    1996-01-01

    The negotiations leading up to the Suspension Agreement with Russia focused solely on uranium and SWU, leaving conversion in its traditional role as the overlooked constituent of the fuel cycle. In fact, the initial agreement did not even distinguish U 3 O 8 from UF 6 ; it effectively ignored the conversion component contained in UF 6 and the possibility of matched conversion sales. After some criticism from ConverDyn and others, The US Department of Commerce issued a clarification, confirming that all three major components of the fuel cycle can be sold under matched sales agreements. However, matched conversion sales remain somewhat of an enigma as few have been done and the logistics are poorly understood. Nonetheless, in a conversion market where supply and demand are closely balanced, secondary supplies, including those from matched sales, will likely play an important role in the evolution of conversion prices

  9. Constructed-Response Matching to Sample and Spelling Instruction.

    Science.gov (United States)

    Dube, William V.; And Others

    1991-01-01

    This paper describes a computer-based spelling program grounded in programed instructional techniques and using constructed-response matching-to-sample procedures. Following use of the program, two mentally retarded men successfully spelled previously misspelled words. (JDD)

  10. Multi data reservior history matching and uncertainty quantification framework

    KAUST Repository

    Katterbauer, Klemens; Hoteit, Ibrahim; Sun, Shuyu

    2015-01-01

    A multi-data reservoir history matching and uncertainty quantification framework is provided. The framework can utilize multiple data sets such as production, seismic, electromagnetic, gravimetric and surface deformation data for improving

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

    KAUST Repository

    Katterbauer, Klemens

    2015-01-01

    Reservoir history matching is becoming increasingly important with the growing demand for higher quality formation characterization and forecasting and the increased complexity and expenses for modern hydrocarbon exploration projects. History

  12. Reservoir History Matching Using Ensemble Kalman Filters with Anamorphosis Transforms

    KAUST Repository

    Aman, Beshir M.

    2012-01-01

    Some History matching methods such as Kalman filter, particle filter and the ensemble Kalman filter are reviewed and applied to a test case in the reservoir application. The key idea is to apply the transformation before the update step

  13. Theory of fractional order elements based impedance matching networks

    KAUST Repository

    Radwan, Ahmed G.; Shamim, Atif; Salama, Khaled N.

    2011-01-01

    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.

  14. Non-foster matching of an RFID antenna

    KAUST Repository

    Mohamed Hassan Salem, Nedime Pelin; Niver, Edip

    2011-01-01

    Novel designs of radio-frequency identification (RFID) tag antennas with better matching characteristics to achieve extended range for passive tags are investigated in ultra-high frequency (UHF) band. A microstrip dipole antenna with or without

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

  16. 76 FR 1410 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2011-01-10

    ... will contain data elements of the client's name, SSN, date of birth, address, sex, marital status..., and current work or home address, and other relevant information. F. Inclusive Dates of the Matching...

  17. Affective match: Leader emotions, follower positive affect, and follower performance

    NARCIS (Netherlands)

    Damen, F.; van Knippenberg, B.M.; van Knippenberg, D.

    2008-01-01

    Leader emotions may play an important role in leadership effectiveness. Extending earlier research on leader emotional displays and leadership effectiveness, we propose that the affective match between follower positive affect (PA) and leaders' emotional displays moderates the effectiveness of

  18. A Multi-Scale Settlement Matching Algorithm Based on ARG

    Directory of Open Access Journals (Sweden)

    H. Yue

    2016-06-01

    Full Text Available Homonymous entity matching is an important part of multi-source spatial data integration, automatic updating and change detection. Considering the low accuracy of existing matching methods in dealing with matching multi-scale settlement data, an algorithm based on Attributed Relational Graph (ARG is proposed. The algorithm firstly divides two settlement scenes at different scales into blocks by small-scale road network and constructs local ARGs in each block. Then, ascertains candidate sets by merging procedures and obtains the optimal matching pairs by comparing the similarity of ARGs iteratively. Finally, the corresponding relations between settlements at large and small scales are identified. At the end of this article, a demonstration is presented and the results indicate that the proposed algorithm is capable of handling sophisticated cases.

  19. Study on electrical impedance matching for broadband ultrasonic transducer

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Geon Woo [University of Science and Technology, Daejeon (Korea, Republic of); Kim, Ki Bok [Korea Research Institute of Standards and Science, Center for Safety Measurement, Daejeon (Korea, Republic of); Baek, Kwang Sae [Elache Co., Busan (Korea, Republic of)

    2017-02-15

    Ultrasonic transducers with high resolution and resonant frequency are required to detect small defects (less than hundreds of μm) by ultrasonic testing. The resonance frequency and resolution of an ultrasonic transducer are closely related to the thickness of piezo-electric materials, backing materials, and the electric impedance matching technique. Among these factors, electrical impedance matching plays an important role because it can reduce the loss and reflection of ultrasonic energy differences in electrical impedance between an ultrasonic transducer and an ultrasonic defects detecting system. An LC matching circuit is the most frequently used electric matching method. It is necessary for the electrical impedance of an ultrasonic transducer to correspond to approximately 50 Ω to compensate the difference in electrical impedance between both connections. In this study, a 15 MHz immersion ultrasonic transducer was fabricated and an LC electrical impedance circuit was applied to that for having broad-band frequency characteristic.

  20. Sparse reconstruction using distribution agnostic bayesian matching pursuit

    KAUST Repository

    Masood, Mudassir; Al-Naffouri, Tareq Y.

    2013-01-01

    A fast matching pursuit method using a Bayesian approach is introduced for sparse signal recovery. This method performs Bayesian estimates of sparse signals even when the signal prior is non-Gaussian or unknown. It is agnostic on signal statistics

  1. Iris recognition using possibilistic fuzzy matching on local features.

    Science.gov (United States)

    Tsai, Chung-Chih; Lin, Heng-Yi; Taur, Jinshiuh; Tao, Chin-Wang

    2012-02-01

    In this paper, we propose a novel possibilistic fuzzy matching strategy with invariant properties, which can provide a robust and effective matching scheme for two sets of iris feature points. In addition, the nonlinear normalization model is adopted to provide more accurate position before matching. Moreover, an effective iris segmentation method is proposed to refine the detected inner and outer boundaries to smooth curves. For feature extraction, the Gabor filters are adopted to detect the local feature points from the segmented iris image in the Cartesian coordinate system and to generate a rotation-invariant descriptor for each detected point. After that, the proposed matching algorithm is used to compute a similarity score for two sets of feature points from a pair of iris images. The experimental results show that the performance of our system is better than those of the systems based on the local features and is comparable to those of the typical systems.

  2. Matching therapists' predicates: an in vivo test of effectiveness.

    Science.gov (United States)

    Dowd, E T; Hingst, A G

    1983-08-01

    The theory of neurolinguistic programming predicts that a therapist's matching of a client's primary representational system, as expressed in the client's predicates, should result in increased therapist's rapport and social influence. This hypothesis was tested in an actual interview situation. Six relatively inexperienced therapists, two each in predicate matching, predicate mismatching, and predicate no-matching conditions, conducted a 30-min. interview with nine undergraduate student volunteers each, for a total of 54 subjects. After the appropriate interview condition was completed, subjects rated ther therapists on the Counselor Rating Form and the Counseling Evaluation Inventory. No significant differences among the three conditions on any of the measures were found. Results are compared with those of previous research on assessment and primary representational matching in analogue situations.

  3. A blind matching algorithm for cognitive radio networks

    KAUST Repository

    Hamza, Doha R.

    2016-08-15

    We consider a cognitive radio network where secondary users (SUs) are allowed access time to the spectrum belonging to the primary users (PUs) provided that they relay primary messages. PUs and SUs negotiate over allocations of the secondary power that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power allocations. We stipulate a limited information exchange in the network so that agents only calculate their own utilities but no information is available about the utilities of any other users in the network. We establish convergence to epsilon pairwise stable matchings in finite time. Finally we show that our algorithm exhibits a limited degradation in PU utility when compared with the Pareto optimal results attained using perfect information assumptions. © 2016 IEEE.

  4. CDBG Public Services Activity

    Data.gov (United States)

    Department of Housing and Urban Development — CDBG activity related to public services, including senior services, legal services, youth services, employment training, health services, homebuyer counseling, food...

  5. A fuzzy-match search engine for physician directories.

    Science.gov (United States)

    Rastegar-Mojarad, Majid; Kadolph, Christopher; Ye, Zhan; Wall, Daniel; Murali, Narayana; Lin, Simon

    2014-11-04

    A search engine to find physicians' information is a basic but crucial function of a health care provider's website. Inefficient search engines, which return no results or incorrect results, can lead to patient frustration and potential customer loss. A search engine that can handle misspellings and spelling variations of names is needed, as the United States (US) has culturally, racially, and ethnically diverse names. The Marshfield Clinic website provides a search engine for users to search for physicians' names. The current search engine provides an auto-completion function, but it requires an exact match. We observed that 26% of all searches yielded no results. The goal was to design a fuzzy-match algorithm to aid users in finding physicians easier and faster. Instead of an exact match search, we used a fuzzy algorithm to find similar matches for searched terms. In the algorithm, we solved three types of search engine failures: "Typographic", "Phonetic spelling variation", and "Nickname". To solve these mismatches, we used a customized Levenshtein distance calculation that incorporated Soundex coding and a lookup table of nicknames derived from US census data. Using the "Challenge Data Set of Marshfield Physician Names," we evaluated the accuracy of fuzzy-match engine-top ten (90%) and compared it with exact match (0%), Soundex (24%), Levenshtein distance (59%), and fuzzy-match engine-top one (71%). We designed, created a reference implementation, and evaluated a fuzzy-match search engine for physician directories. The open-source code is available at the codeplex website and a reference implementation is available for demonstration at the datamarsh website.

  6. Color memory matching: time effect and other factors

    OpenAIRE

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

    1998-01-01

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

  7. The effect of football matches on crime patterns in Barcelona

    OpenAIRE

    Struse, Simon Planells; Montolio, Daniel

    2014-01-01

    Given the actual debate, in many European countries, about the need for public administrations to raise their revenues through taxing the crime externalities generated by some private leisure activities, this article analyzes the effect of football matches on crime focusing both on property crimes and interpersonal violent crimes. Our aim is to determine up to what extent a private leisure activity, such as football matches, induces negative crime externalities to the whole society. Using dat...

  8. High performance embedded system for real-time pattern matching

    International Nuclear Information System (INIS)

    Sotiropoulou, C.-L.; Luciano, P.; Gkaitatzis, S.; Citraro, S.; Giannetti, P.; Dell'Orso, M.

    2017-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 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 miniaturized 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 chip. The reference patterns are chosen by a complex training algorithm implemented on an FPGA device. Post processing algorithms (e.g. pixel clustering) are also implemented on the FPGA. The pattern matching can be executed on a 2D or 3D space, on black and white or grayscale images, depending on the application and thus increasing exponentially the processing requirements of the system. We present the firmware implementation of the training and pattern matching algorithm, performance and results on a latest generation Xilinx Kintex Ultrascale FPGA device. - Highlights: • A high performance embedded system for real-time pattern matching is proposed. • It is based on a system developed for High Energy Physics experiment triggers. • It mimics the operation of the human brain (cognitive image processing). • The process can be executed on 2D and 3D, black and white or grayscale images. • The implementation uses FPGAs and custom designed associative memory (AM) chips.

  9. High performance embedded system for real-time pattern matching

    Energy Technology Data Exchange (ETDEWEB)

    Sotiropoulou, C.-L., E-mail: c.sotiropoulou@cern.ch [University of Pisa, Largo B. Pontecorvo 3, 56127 Pisa (Italy); INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy); Luciano, P. [University of Cassino and Southern Lazio, Gaetano di Biasio 43, Cassino 03043 (Italy); INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy); Gkaitatzis, S. [Aristotle University of Thessaloniki, 54124 Thessaloniki (Greece); Citraro, S. [University of Pisa, Largo B. Pontecorvo 3, 56127 Pisa (Italy); INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy); Giannetti, P. [INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy); Dell' Orso, M. [University of Pisa, Largo B. Pontecorvo 3, 56127 Pisa (Italy); INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy)

    2017-02-11

    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 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 miniaturized 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 chip. The reference patterns are chosen by a complex training algorithm implemented on an FPGA device. Post processing algorithms (e.g. pixel clustering) are also implemented on the FPGA. The pattern matching can be executed on a 2D or 3D space, on black and white or grayscale images, depending on the application and thus increasing exponentially the processing requirements of the system. We present the firmware implementation of the training and pattern matching algorithm, performance and results on a latest generation Xilinx Kintex Ultrascale FPGA device. - Highlights: • A high performance embedded system for real-time pattern matching is proposed. • It is based on a system developed for High Energy Physics experiment triggers. • It mimics the operation of the human brain (cognitive image processing). • The process can be executed on 2D and 3D, black and white or grayscale images. • The implementation uses FPGAs and custom designed associative memory (AM) chips.

  10. Perturbative matching of continuum and lattice quasi-distributions

    Directory of Open Access Journals (Sweden)

    Ishikawa Tomomi

    2018-01-01

    Full Text Available Matching of the quasi parton distribution functions between continuum and lattice is addressed using lattice perturbation theory specifically withWilson-type fermions. The matching is done for nonlocal quark bilinear operators with a straightWilson line in a spatial direction. We also investigate operator mixing in the renormalization and possible O(a operators for the nonlocal operators based on a symmetry argument on lattice.

  11. Personnel Selection Method Based on Personnel-Job Matching

    OpenAIRE

    Li Wang; Xilin Hou; Lili Zhang

    2013-01-01

    The existing personnel selection decisions in practice are based on the evaluation of job seeker's human capital, and it may be difficult to make personnel-job matching and make each party satisfy. Therefore, this paper puts forward a new personnel selection method by consideration of bilateral matching. Starting from the employment thoughts of ¡°satisfy¡±, the satisfaction evaluation indicator system of each party are constructed. The multi-objective optimization model is given according to ...

  12. Compositionality and Compatibility of Service Contracts

    DEFF Research Database (Denmark)

    Okika, Joseph C.; Ravn, Anders Peter

    2007-01-01

    Service Oriented Architecture (SOA) is a way of reorganizing series of previously operational software applications and support infrastructure into an interconnected set of services, each accessible through standard interfaces and messaging protocols. Once all the elements of an enterprise...... architecture are in place, existing and future applications can access these services as necessary. This architectural approach is particularly applicable when multiple applications running on varied technologies and platforms need to communicate with each other. It promotes services that are distributed......, heterogeneous, autonomous and open in nature. In this way, enterprises can mix and match services to perform business transactions with less programming effort. In recent times, Service Oriented Architecture is being employed in developing service based applications. While this is a welcome idea by a versed...

  13. Cross matching of blood in carcharhiniform, lamniform, and orectolobiform sharks.

    Science.gov (United States)

    Hadfield, Catherine A; Haines, Ashley N; Clayton, Leigh A; Whitaker, Brent R

    2010-09-01

    The transfusion of whole blood in elasmobranchs could provide cardiovascular support following hemorrhage. Since donor and recipient compatibility is not known, a technique was established to allow cross matching of red blood cells and serum in sharks. Cross matching was carried out among 19 individuals from seven species: the nurse shark (Ginglymostoma cirratum), sandbar shark (Carcharhinus plumbeus), sandtiger shark (Carcharias taurus), white-spotted bamboo shark (Chiloscyllium plagiosum), brown-banded bamboo shark (Chiloscyllium punctatum), zebra shark (Stegostoma fasciatum), and spotted wobbegong (Orectolobus maculatus). Negative cross-matches showed no agglutination or hemolysis, suggesting that donor and recipient would be compatible. Cross-matches between conspecifics were all negative (sandbar, sandtiger, nurse, and white-spotted bamboo sharks). All cross-matches between sandbar and sandtiger sharks were also negative. Positive crossmatches consisted of agglutination or hemolysis of red blood cells, suggesting that the donor and recipient would be incompatible. Strong positive reactions occurred, for example, with red blood cells from sandtiger and sandbar sharks and serum from nurse sharks. Cross matching should be carried out in elasmobranchs prior to any blood transfusion.

  14. Geomagnetic matching navigation algorithm based on robust estimation

    Science.gov (United States)

    Xie, Weinan; Huang, Liping; Qu, Zhenshen; Wang, Zhenhuan

    2017-08-01

    The outliers in the geomagnetic survey data seriously affect the precision of the geomagnetic matching navigation and badly disrupt its reliability. A novel algorithm which can eliminate the outliers influence is investigated in this paper. First, the weight function is designed and its principle of the robust estimation is introduced. By combining the relation equation between the matching trajectory and the reference trajectory with the Taylor series expansion for geomagnetic information, a mathematical expression of the longitude, latitude and heading errors is acquired. The robust target function is obtained by the weight function and the mathematical expression. Then the geomagnetic matching problem is converted to the solutions of nonlinear equations. Finally, Newton iteration is applied to implement the novel algorithm. Simulation results show that the matching error of the novel algorithm is decreased to 7.75% compared to the conventional mean square difference (MSD) algorithm, and is decreased to 18.39% to the conventional iterative contour matching algorithm when the outlier is 40nT. Meanwhile, the position error of the novel algorithm is 0.017° while the other two algorithms fail to match when the outlier is 400nT.

  15. Gun bore flaw image matching based on improved SIFT descriptor

    Science.gov (United States)

    Zeng, Luan; Xiong, Wei; Zhai, You

    2013-01-01

    In order to increase the operation speed and matching ability of SIFT algorithm, the SIFT descriptor and matching strategy are improved. First, a method of constructing feature descriptor based on sector area is proposed. By computing the gradients histogram of location bins which are parted into 6 sector areas, a descriptor with 48 dimensions is constituted. It can reduce the dimension of feature vector and decrease the complexity of structuring descriptor. Second, it introduce a strategy that partitions the circular region into 6 identical sector areas starting from the dominate orientation. Consequently, the computational complexity is reduced due to cancellation of rotation operation for the area. The experimental results indicate that comparing with the OpenCV SIFT arithmetic, the average matching speed of the new method increase by about 55.86%. The matching veracity can be increased even under some variation of view point, illumination, rotation, scale and out of focus. The new method got satisfied results in gun bore flaw image matching. Keywords: Metrology, Flaw image matching, Gun bore, Feature descriptor

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

    KAUST Repository

    Katterbauer, Klemens

    2015-05-01

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

  17. Tackle mechanisms and match characteristics in women's elite football tournaments.

    Science.gov (United States)

    Tscholl, P; O'Riordan, D; Fuller, C W; Dvorak, J; Junge, A

    2007-08-01

    Several tools have been used for assessing risk situations and for gathering tackle information from international football matches for men but not for women. To analyse activities in women's football and to identify the characteristics and risk potentials of tackles. Retrospective video analysis. Video recordings of 24 representative matches from six women's top-level tournaments were analysed for tackle parameters and their risk potential. 3531 tackles were recorded. Tackles in which the tackling player came from the side and stayed on her feet accounted for nearly half of all challenges for the ball in which body contact occurred. 2.7% of all tackles were classified as risk situations, with sliding-in tackles from behind and the side having the highest risk potential. Match referees sanctioned sliding-in tackles more often than other tackles (20% v 17%, respectively). Tackle parameters did not change in the duration of a match; however, there was an increase in the number of injury risk situations and foul plays towards the end of each half. Match properties provide valuable information for a better understanding of injury situations in football. Staying on feet and jumping vertically tackle actions leading to injury were sanctioned significantly more times by the referee than those not leading to injury (pgame are not adequate or match referees in women's football are not able to distinguish between sliding-in tackles leading to and those not leading to injury.

  18. Applicant characteristics associated with successful matching into otolaryngology.

    Science.gov (United States)

    Hauser, Leah J; Gebhard, Grant M; Blumhagen, Rachel; Carlson, Nichole E; Cabrera-Muffly, Cristina

    2017-05-01

    To identify resident applicant characteristics that increase the odds of matching to otolaryngology residency. Cross-sectional analysis. Residency applications to our institution from 2009 through 2013 were reviewed. The available data represented 81.1% of applicants to otolaryngology programs nationwide. Online public records were searched to determine whether an applicant matched to an otolaryngology residency position. Factors that were significantly associated with the odds of matching were determined using logistic regression. A total of 1,479 unique applications were analyzed. On univariate analysis, 27 demographic, academic, personal, medical school, prior training, and application-specific factors were associated with the odds of matching into otolaryngology. On multivariate analysis, indicators of academic achievement, such as Alpha Omega Alpha Honor Medical Society (AOA) status, whether applicant received awards, and publications, were significantly associated with the odds of matching (odds ratio [OR] 2.03, 1.39, 1.66, respectively). The odds of matching increased with increasing step 1 scores (P otolaryngology residency. Although this information allows medical students to determine the strength of their application, these criteria have not been correlated with resident success. We urge selection committees to begin identifying applicant selection methods that reflect the values we want to cultivate in our future colleagues. N/A. Laryngoscope, 127:1052-1057, 2017. © 2016 The American Laryngological, Rhinological and Otological Society, Inc.

  19. Visual color matching system based on RGB LED light source

    Science.gov (United States)

    Sun, Lei; Huang, Qingmei; Feng, Chen; Li, Wei; Wang, Chaofeng

    2018-01-01

    In order to study the property and performance of LED as RGB primary color light sources on color mixture in visual psychophysical experiments, and to find out the difference between LED light source and traditional light source, a visual color matching experiment system based on LED light sources as RGB primary colors has been built. By simulating traditional experiment of metameric color matching in CIE 1931 RGB color system, it can be used for visual color matching experiments to obtain a set of the spectral tristimulus values which we often call color-matching functions (CMFs). This system consists of three parts: a monochromatic light part using blazed grating, a light mixing part where the summation of 3 LED illuminations are to be visually matched with a monochromatic illumination, and a visual observation part. The three narrow band LEDs used have dominant wavelengths of 640 nm (red), 522 nm (green) and 458 nm (blue) respectively and their intensities can be controlled independently. After the calibration of wavelength and luminance of LED sources with a spectrophotometer, a series of visual color matching experiments have been carried out by 5 observers. The results are compared with those from CIE 1931 RGB color system, and have been used to compute an average locus for the spectral colors in the color triangle, with white at the center. It has been shown that the use of LED is feasible and has the advantages of easy control, good stability and low cost.

  20. A Condition Number for Non-Rigid Shape Matching

    KAUST Repository

    Ovsjanikov, Maks

    2011-08-01

    © 2011 The Author(s). Despite the large amount of work devoted in recent years to the problem of non-rigid shape matching, practical methods that can successfully be used for arbitrary pairs of shapes remain elusive. In this paper, we study the hardness of the problem of shape matching, and introduce the notion of the shape condition number, which captures the intuition that some shapes are inherently more difficult to match against than others. In particular, we make a connection between the symmetry of a given shape and the stability of any method used to match it while optimizing a given distortion measure. We analyze two commonly used classes of methods in deformable shape matching, and show that the stability of both types of techniques can be captured by the appropriate notion of a condition number. We also provide a practical way to estimate the shape condition number and show how it can be used to guide the selection of landmark correspondences between shapes. Thus we shed some light on the reasons why general shape matching remains difficult and provide a way to detect and mitigate such difficulties in practice.