WorldWideScience

Sample records for flow-based program matching

  1. A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking

    DEFF Research Database (Denmark)

    Brunel, Julien Pierre Manuel; Doligez, Damien; Hansen, Rene Rydhof

    2008-01-01

    Reasoning about program control-flow paths is an important functionality of a number of recent program matching languages and associated searching and transformation tools. Temporal logic provides a well-defined means of expressing properties of control-flow paths in programs, and indeed...... an extension of the temporal logic CTL has been applied to the problem of specifying and verifying the transformations commonly performed by optimizing compilers. Nevertheless, in developing the Coccinelle program transformation tool for performing Linux collateral evolutions in systems code, we have found......-VW (CTL with variables and witnesses) that is a suitable basis for the semantics and implementation of the Coccinelle’s program matching language. Our extension to CTL includes existential quantification over program fragments, which allows metavariables in the program matching language to range over...

  2. A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking

    DEFF Research Database (Denmark)

    Brunel, Julien Pierre Manuel; Doligez, Damien; Hansen, Rene Rydhof

    2008-01-01

    an extension of the temporal logic CTL has been applied to the problem of specifying and verifying the transformations commonly performed by optimizing compilers. Nevertheless, in developing the Coccinelle program transformation tool for performing Linux collateral evolutions in systems code, we have found......, using a transformation rule that fixes several reference count bugs in Linux code....

  3. A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking

    DEFF Research Database (Denmark)

    Brunel, Julien; Doligez, Damien; Hansen, Rene Rydhof

    2009-01-01

    an extension of the temporal logic CTL has been applied to the problem of specifying and verifying the transformations commonly performed by optimizing compilers. Nevertheless, in developing the Coccinelle program transformation tool for performing Linux collateral evolutions in systems code, we have found...... a transformation rule that fixes several reference count bugs in Linux code.  ...

  4. A foundation for flow-based matching: using temporal logic and model checking

    DEFF Research Database (Denmark)

    Brunel, Julien Pierre Manuel; Doligez, Damien; Hansen, René Rydhof

    2009-01-01

    Reasoning about program control-flow paths is an important functionality of a number of recent program matching languages and associated searching and transformation tools. Temporal logic provides a well-defined means of expressing properties of control-flow paths in programs, and indeed...... an extension of the temporal logic CTL has been applied to the problem of specifying and verifying the transformations commonly performed by optimizing compilers. Nevertheless, in developing the Coccinelle program transformation tool for performing Linux collateral evolutions in systems code, we have found...... with variables and witnesses) that is a suitable basis for the semantics and implementation of the Coccinelle’s program matching language. Our extension to CTL includes existential quantification over program fragments, which allows metavariables in the program matching language to range over different values...

  5. Optical flow based Kalman filter for body joint prediction and tracking using HOG-LBP matching

    Science.gov (United States)

    Nair, Binu M.; Kendricks, Kimberley D.; Asari, Vijayan K.; Tuttle, Ronald F.

    2014-03-01

    We propose a real-time novel framework for tracking specific joints in the human body on low resolution imagery using optical flow based Kalman tracker without the need of a depth sensor. Body joint tracking is necessary for a variety of surveillance based applications such as recognizing gait signatures of individuals, identifying the motion patterns associated with a particular action and the corresponding interactions with objects in the scene to classify a certain activity. The proposed framework consists of two stages; the initialization stage and the tracking stage. In the initialization stage, the joints to be tracked are either manually marked or automatically obtained from other joint detection algorithms in the first few frames within a window of interest and appropriate image descriptions of each joint are computed. We employ the use of a well-known image coding scheme known as the Local Binary Patterns (LBP) to represent the joint local region where this image coding removes the variance to non-uniform lighting conditions as well as enhances the underlying edges and corner. The image descriptions of the joint region would then include a histogram computed from the LBP-coded ROI and a HOG (Histogram of Oriented Gradients) descriptor to represent the edge information. Next the tracking stage can be divided into two phases: Optical flow based detection of joints in corresponding frames of the sequence and prediction /correction phases of Kalman tracker with respect to the joint coordinates. Lucas Kanade optical flow is used to locate the individual joints in consecutive frames of the video based on their location in the previous frame. But more often, mismatches can occur due to the rotation of the joint region and the rotation variance of the optical flow matching technique. The mismatch is then determined by comparing the joint region descriptors using Chi-squared metric between a pair of frames and depending on this statistic, either the prediction

  6. Genetic Programming Framework for Fingerprint Matching

    CERN Document Server

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

    2009-01-01

    A fingerprint matching is a very difficult problem. Minutiae based matching is the most popular and widely used technique for fingerprint matching. The minutiae points considered in automatic identification systems are based normally on termination and bifurcation points. In this paper we propose a new technique for fingerprint matching using minutiae points and genetic programming. The goal of this paper is extracting the mathematical formula that defines the minutiae points.

  7. Synthesis of Biochemical Applications on Flow-Based Microfluidic Biochips using Constraint Programming

    DEFF Research Database (Denmark)

    Minhass, Wajid Hassan; Pop, Paul; Madsen, Jan

    2012-01-01

    . By combining several microvalves, more complex units, such as micropumps, switches, mixers, and multiplexers, can be built. We propose a constraint programming (CP) based approach for the synthesis of biochemical applications on flow-based microfluidic biochips. We use a sequencing graph to model...

  8. National Medical School Matching Program: optimizing outcomes

    Science.gov (United States)

    Eltorai, Adam EM; Daniels, Alan H

    2016-01-01

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

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

    Science.gov (United States)

    2013-03-12

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

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

    Science.gov (United States)

    Trochim, Wilham M. K.

    1985-01-01

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

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

    Science.gov (United States)

    2013-06-21

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

  12. Fast approximate quadratic programming for graph matching.

    Directory of Open Access Journals (Sweden)

    Joshua T Vogelstein

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

  13. Fast approximate quadratic programming for graph matching.

    Science.gov (United States)

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

    2015-01-01

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

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

    Science.gov (United States)

    2011-03-02

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

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

    Science.gov (United States)

    2012-03-09

    ... Federal Aviation Administration Space Transportation Infrastructure Matching Grants Program AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Notice of request for grant proposals for the Space... proposals to continue the development of a Commercial Space Transportation infrastructure system...

  16. Towards agile large-scale predictive modelling in drug discovery with flow-based programming design principles.

    Science.gov (United States)

    Lampa, Samuel; Alvarsson, Jonathan; Spjuth, Ola

    2016-01-01

    Predictive modelling in drug discovery is challenging to automate as it often contains multiple analysis steps and might involve cross-validation and parameter tuning that create complex dependencies between tasks. With large-scale data or when using computationally demanding modelling methods, e-infrastructures such as high-performance or cloud computing are required, adding to the existing challenges of fault-tolerant automation. Workflow management systems can aid in many of these challenges, but the currently available systems are lacking in the functionality needed to enable agile and flexible predictive modelling. We here present an approach inspired by elements of the flow-based programming paradigm, implemented as an extension of the Luigi system which we name SciLuigi. We also discuss the experiences from using the approach when modelling a large set of biochemical interactions using a shared computer cluster.Graphical abstract.

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

    Science.gov (United States)

    2010-10-15

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

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

    Science.gov (United States)

    2012-07-05

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

  19. 78 FR 45513 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2013-07-29

    .... DESCRIPTION OF COMPUTER MATCHING PROGRAM: Each participating SPAA will send ACF an electronic file of eligible public assistance client information. These files are non- Federal computer records maintained by the... on no more than 10,000,000 public assistance beneficiaries. 2. The DMDC computer database...

  20. 75 FR 69988 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2010-11-16

    ...Section 421(a)(1) of the Controlled Substances Act (21 U.S.C. 862(a)(1)) includes provisions regarding the judicial denial of Federal benefits. Section 421 of the Controlled Substances Act, which was originally enacted as section 5301 of the Anti-Drug Abuse Act of 1988, and which was amended and redesignated as section 421 of the Controlled Substances Act by section 1002(d) of the Crime Control Act of 1990, Public Law 101-647 (hereinafter referred to as ``section 5301''), authorizes Federal and State judges to deny certain Federal benefits (including student financial assistance under Title IV of the Higher Education Act of 1965, as amended (HEA)) to individuals convicted of drug trafficking or possession of a controlled substance. In order to ensure that Title IV, HEA student financial assistance is not awarded to individuals subject to denial of benefits under court orders issued pursuant to section 5301, the Department of Justice and the Department of Education implemented a computer matching program. The 18-month computer matching agreement (CMA) was recertified for an additional 12 months on December 19, 2009. The 12-month recertification of the CMA will automatically expire on December 17, 2010. The Department of Education must continue to obtain from the Department of Justice identifying information regarding individuals who are the subject of section 5301 denial of benefits court orders for the purpose of ensuring that Title IV, HEA student financial assistance is not awarded to individuals subject to denial of benefits under court orders issued pursuant to the Denial of Federal Benefits Program. The purpose of this notice is to announce the continued operation of the computer matching program and to provide certain required information concerning the computer matching program. In accordance with the 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 Office of Management and

  1. Kangaroo – A pattern-matching program for biological sequences

    Directory of Open Access Journals (Sweden)

    Betel Doron

    2002-07-01

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

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

    Science.gov (United States)

    2013-12-05

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

  3. 78 FR 29786 - Computer Matching and Privacy Protection Act of 1988; Report of Matching Program: RRB and State...

    Science.gov (United States)

    2013-05-21

    ... Privacy Act Systems of Records notices on our public Web site at: ( http://www.rrb.gov/bis/privacy_act... in the records will consist of beneficiary identifying information such as: name, Social Security... ongoing computer matching program. In this match, we provide certain Medicare and benefit rate information...

  4. 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... number of computer matches expected, for their approval/disapproval. (g) Questions. CNO (DNS-36... CNO (DNS-36)....

  5. 76 FR 56744 - Privacy Act of 1974; Notice of a Computer Matching Program

    Science.gov (United States)

    2011-09-14

    ... Agencies: Participants in this computer matching program are the Social Security Administration (SSA) and... pertaining to computer matching at 54 FR 25818, June 1989. The legal authority for this exchange is sections... of the Secretary Privacy Act of 1974; Notice of a Computer Matching Program AGENCY: Defense...

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

    Science.gov (United States)

    Walvoord, Mark E.; Pleitz, Jacob D.

    2016-01-01

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

  7. 77 FR 74913 - Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration (SSA...

    Science.gov (United States)

    2012-12-18

    ... From the Federal Register Online via the Government Publishing Office SOCIAL SECURITY ADMINISTRATION Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration (SSA)/Office of Personnel Management (OPM))--Match Number 1307 AGENCY: Social Security Administration....

  8. 75 FR 5166 - Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration...

    Science.gov (United States)

    2010-02-01

    ... From the Federal Register Online via the Government Publishing Office SOCIAL SECURITY ADMINISTRATION Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration/Railroad Retirement Board (SSA/RRB))-- Match Number 1308 AGENCY: Social Security Administration...

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

    Science.gov (United States)

    2011-01-10

    ... action as may be authorized by law and regulation. ACF, in its role as match facilitator, will support... Office of Management and Budget Guidelines on computer matching published on June 19, 1989, at 54 FR...', dated February 8, 1996 (February 20, 1996, 61 FR 6427). Dated: January 4, 2011. Morgan F....

  10. 76 FR 42769 - Privacy Act of 1974; Report of Matching Program

    Science.gov (United States)

    2011-07-19

    ... match are the VA system of records, ``Compensation, Pension, Education, and Vocational Rehabilitation... continue a recurring computer program matching Internal Revenue Service (IRS) records with VA pension and... match records of veterans, surviving spouses and children who receive pension, and parents who...

  11. 75 FR 12226 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2010-03-15

    ... to the Office of Management and Budget (OMB) Final Guidance Interpreting the Provisions of Public Law... Talent Grant Program; the Iraq and Afghanistan Service Grant Program; the Federal Perkins Loan Program... Comments or Inquires. Mr. Leroy Everett, Management and Program Analyst, U.S. Department of...

  12. 77 FR 43639 - Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration (SSA...

    Science.gov (United States)

    2012-07-25

    ... From the Federal Register Online via the Government Publishing Office SOCIAL SECURITY ADMINISTRATION Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration (SSA.... ACTION: Notice of a renewal of an existing computer matching program that expired on May 10,...

  13. 77 FR 54943 - Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration (SSA...

    Science.gov (United States)

    2012-09-06

    ... From the Federal Register Online via the Government Publishing Office SOCIAL SECURITY ADMINISTRATION Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration (SSA.... ACTION: Notice of a renewal of an existing computer matching program that will expire on October 1,...

  14. 76 FR 24564 - Privacy Act of 1974: Computer Matching Program

    Science.gov (United States)

    2011-05-02

    ... Department of Health & Social Services. 4. Arizona Department of Economic Security. 5. Arkansas Department of... a program listed below: (1) A state program funded under part A of Title IV of the Social Security... Security Act; (3) Supplemental security income benefits under Title XVI of the Social Security Act,...

  15. SAM: The "Search and Match" Computer Program of the Escherichia coli Genetic Stock Center

    Science.gov (United States)

    Bachmann, B. J.; And Others

    1973-01-01

    Describes a computer program used at a genetic stock center to locate particular strains of bacteria. The program can match up to 30 strain descriptions requested by a researcher with the records on file. Uses of this particular program can be made in many fields. (PS)

  16. The Abstraction and Instantiation of String-Matching Programs

    DEFF Research Database (Denmark)

    Amtoft, Torben; Consel, Charles; Danvy, Olivier;

    2002-01-01

    , using the off-the-shelf partial evaluator Similix. Instantiating the abstracted program with a left-to-right traversal policy yields the linear-time behavior of Knuth, Morris and Pratt’s string matcher. Instantiating it with a right-to-left policy yields the linear-time behavior of Boyer and Moore...

  17. 76 FR 71417 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Law Enforcement Agencies (LEA...

    Science.gov (United States)

    2011-11-17

    ... ADMINISTRATION Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Law Enforcement Agencies (LEA... General Counsel. Notice of Computer Matching Program, SSA With the Law Enforcement Agency (LEA) A... establish terms, conditions, and safeguards under which we will conduct a computer matching program with law...

  18. Flow Based Algorithm

    Directory of Open Access Journals (Sweden)

    T. Karpagam

    2012-01-01

    Full Text Available Problem statement: Network topology design problems find application in several real life scenario. Approach: Most designs in the past either optimize for a single criterion like shortest or cost minimization or maximum flow. Results: This study discussed about solving a multi objective network topology design problem for a realistic traffic model specifically in the pipeline transportation. Here flow based algorithm focusing to transport liquid goods with maximum capacity with shortest distance, this algorithm developed with the sense of basic pert and critical path method. Conclusion/Recommendations: This flow based algorithm helps to give optimal result for transporting maximum capacity with minimum cost. It could be used in the juice factory, milk industry and its best alternate for the vehicle routing problem.

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

  20. Object matching using a locally affine invariant and linear programming techniques.

    Science.gov (United States)

    Li, Hongsheng; Huang, Xiaolei; He, Lei

    2013-02-01

    In this paper, we introduce a new matching method based on a novel locally affine-invariant geometric constraint and linear programming techniques. To model and solve the matching problem in a linear programming formulation, all geometric constraints should be able to be exactly or approximately reformulated into a linear form. This is a major difficulty for this kind of matching algorithm. We propose a novel locally affine-invariant constraint which can be exactly linearized and requires a lot fewer auxiliary variables than other linear programming-based methods do. The key idea behind it is that each point in the template point set can be exactly represented by an affine combination of its neighboring points, whose weights can be solved easily by least squares. Errors of reconstructing each matched point using such weights are used to penalize the disagreement of geometric relationships between the template points and the matched points. The resulting overall objective function can be solved efficiently by linear programming techniques. Our experimental results on both rigid and nonrigid object matching show the effectiveness of the proposed algorithm.

  1. 77 FR 32709 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of Homeland Security...

    Science.gov (United States)

    2012-06-01

    ... us. DHS will disclose two separate data files through a computer matching operation for our use in... ADMINISTRATION Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Department of Homeland Security... an existing computer matching program that will expire on July 18, 2012. SUMMARY: In accordance...

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

    Science.gov (United States)

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

    2017-03-01

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

  3. Integrity of the National Resident Matching Program for Radiation Oncology: National Survey of Applicant Experiences

    Energy Technology Data Exchange (ETDEWEB)

    Holliday, Emma B. [Division of Radiation Oncology, The University of Texas MD Anderson Cancer Center, Houston, Texas (United States); Thomas, Charles R., E-mail: thomasch@ohsu.edu [Department of Radiation Medicine, OHSU Knight Cancer Institute, Oregon Health and Science University, Portland, Oregon (United States); Kusano, Aaron S. [Department of Radiation Oncology, University of Washington Medical Center, Seattle, Washington (United States)

    2015-07-01

    Purpose: The aim of this study was to examine the experiences of radiation oncology applicants and to evaluate the prevalence of behaviors that may be in conflict with established ethical standards. Methods and Materials: An anonymous survey was sent to all 2013 applicants to a single domestic radiation oncology residency program through the National Resident Matching Program (NRMP). Questions included demographics, survey of observed behaviors, and opinions regarding the interview and matching process. Descriptive statistics were presented. Characteristics and experiences of respondents who matched were compared with those who did not match. Results: Questionnaires were returned by 87 of 171 applicants for a 51% response rate. Eighty-two questionnaires were complete and included for analysis. Seventy-eight respondents (95.1%) reported being asked at least 1 question in conflict with the NRMP code of conduct. When asked where else they were interviewing, 64% stated that this query made them uncomfortable. Forty-five respondents (54.9%) reported unsolicited post-interview contact by programs, and 31 (37.8%) felt pressured to give assurances. Fifteen respondents (18.3%) reported being told their rank position or that they were “ranked to match” prior to Match day, with 27% of those individuals indicating this information influenced how they ranked programs. Half of respondents felt applicants often made dishonest or misleading assurances, one-third reported that they believed their desired match outcome could be improved by deliberately misleading programs, and more than two-thirds felt their rank position could be improved by having faculty from their home institutions directly contact programs on their behalf. Conclusions: Radiation oncology applicants report a high prevalence of behaviors in conflict with written NRMP policies. Post-interview communication should be discouraged in order to enhance fairness and support the professional development of future

  4. ROTC Validation Study of LEADER MATCH IV, Programmed Instruction in Leadership for the US Army

    Science.gov (United States)

    1978-05-01

    00/ SARI TECHNICAL REPORT TR-78-TH2 utm ROTC Validation Study of LEADER MATCH IV, Programmed Instruction in Leadership for the US Army by ,EVEL Fred ...E. Fiedler and Linda Mahar University of Washington S Seattle, Washington 98105 and -I. Robert M. Carroll . Army Research Institute •,et q•\\•’~e009ŕ...Sciences as ARI Technical Report TR-77-TH3, "LEADER MATCH IV, Programmed Instruction in Leadership for the U.S. Army," by F. E. Fiedler , L. Mahar, and M

  5. 77 FR 48045 - Supplemental Nutrition Assistance Program: Disqualified Recipient Reporting and Computer Matching...

    Science.gov (United States)

    2012-08-13

    ... / Monday, August 13, 2012 / Rules and Regulations#0;#0; ] DEPARTMENT OF AGRICULTURE Food and Nutrition Service 7 CFR Parts 272 and 273 RIN 0584-AB51 Supplemental Nutrition Assistance Program: Disqualified Recipient Reporting and Computer Matching Requirements AGENCY: Food and Nutrition Service, USDA....

  6. 22 CFR 1101.4 - Reports on new systems of records; computer matching programs.

    Science.gov (United States)

    2010-04-01

    ... 22 Foreign Relations 2 2010-04-01 2010-04-01 true Reports on new systems of records; computer..., UNITED STATES AND MEXICO, UNITED STATES SECTION PRIVACY ACT OF 1974 § 1101.4 Reports on new systems of records; computer matching programs. (a) Before establishing any new systems of records, or making...

  7. SEMTAP (Serpentine End Match TApe program): The Easy Way to Program Your Numerically Controlled Router for the Production of SEM Joints

    Science.gov (United States)

    Ronald E. Coleman

    1977-01-01

    SEMTAP (Serpentine End Match TApe Program) is an easy and inexpensive method of programing a numerically controlled router for the manufacture of SEM (Serpentine End Matching) joints. The SEMTAP computer program allows the user to issue commands that will accurately direct a numerically controlled router along any SEM path. The user need not be a computer programer to...

  8. Hierarchical adaptive stereo matching algorithm for obstacle detection with dynamic programming

    Institute of Scientific and Technical Information of China (English)

    Ming BAI; Yan ZHUANG; Wei WANG

    2009-01-01

    An adaptive weighted stereo matching algorithm with multilevel and bidirectional dynamic programming based on ground control points(GCPs) is presented.To decrease time complexity without losing matching precision,using a multilevel search scheme,the coarse matching is processed in typical disparity space image,while the fine matching is processed in disparity-offset space image.In the upper level,GCPs are obtained by enhanced volumetric iterative algorithm enforcing the mutual constraint and the threshold constraint.Under the supervision of the highly reliable GCPs,bidirec-tional dynamic programming framework is employed to solve the inconsistency in the optimization path.In the lower level,to reduce running time,disparity-offset space is proposed to efficiently achieve the dense disparity image.In addition,an adaptive dual support-weight strategy is presented to aggregate matching cost,which considers photometric and geomet-ric information.Further,post-processing algorithm can ameliorate disparity results in areas with depth discontinuities and related by occlusions using dual threshold algorithm,where missing stereo information is substituted from surrounding re-gions.To demonstrate the effectiveness of the algorithm,we present the two groups of experimental results for four widely used standard stereo data sets,including discussion on performance and comparison with other methods,which show that the algorithm has not only a fast speed,but also significantly improves the efficiency of holistic optimization.

  9. Landmark matching based automatic retinal image registration with linear programming and self-similarities.

    Science.gov (United States)

    Zheng, Yuanjie; Hunter, Allan A; Wu, Jue; Wang, Hongzhi; Gao, Jianbin; Maguire, Maureen G; Gee, James C

    2011-01-01

    In this paper, we address the problem of landmark matching based retinal image registration. Two major contributions render our registration algorithm distinguished from many previous methods. One is a novel landmark-matching formulation which enables not only a joint estimation of the correspondences and transformation model but also the optimization with linear programming. The other contribution lies in the introduction of a reinforced self-similarities descriptor in characterizing the local appearance of landmarks. Theoretical analysis and a series of preliminary experimental results show both the effectiveness of our optimization scheme and the high differentiating ability of our features.

  10. Flow-Based Provenance

    Directory of Open Access Journals (Sweden)

    Sabah Al-Fedaghi

    2017-02-01

    Full Text Available Aim/Purpose: With information almost effortlessly created and spontaneously available, current progress in Information and Communication Technology (ICT has led to the complication that information must be scrutinized for trustworthiness and provenance. Information systems must become provenance-aware to be satisfactory in accountability, reproducibility, and trustworthiness of data. Background:\tMultiple models for abstract representation of provenance have been proposed to describe entities, people, and activities involved in producing a piece of data, including the Open Provenance Model (OPM and the World Wide Web Consortium. These models lack certain concepts necessary for specifying workflows and encoding the provenance of data products used and generated. Methodology: Without loss of generality, the focus of this paper is on OPM depiction of provenance in terms of a directed graph. We have redrawn several case studies in the framework of our proposed model in order to compare and evaluate it against OPM for representing these cases. Contribution: This paper offers an alternative flow-based diagrammatic language that can form a foundation for modeling of provenance. The model described here provides an (abstract machine-like representation of provenance. Findings: The results suggest a viable alternative in the area of diagrammatic representation for provenance applications. Future Research: Future work will seek to achieve more accurate comparisons with current models in the field.

  11. The impact of the Indonesian health card program: a matching estimator approach.

    Science.gov (United States)

    Johar, Meliyanni

    2009-01-01

    This study evaluates the effectiveness of a pro-poor nation-wide health card program, which provides free basic health care at public health facilities in Indonesia. To quantify the effect of the program, it departs from the traditional regression-based approach in the literature. It employs propensity score matching to reduce the selection bias due to non-random health card distribution. The setting of the program and the richness of the data set support this strategy in providing accurate estimates of the program's effect on its recipients. The results indicate that, in general, the health card program only has limited impact on the consumption of primary health care by its recipients. This finding suggests the presence of other factors counteracting the generous demand incentive.

  12. Hand Society and Matching Program Web Sites Provide Poor Access to Information Regarding Hand Surgery Fellowship.

    Science.gov (United States)

    Hinds, Richard M; Klifto, Christopher S; Naik, Amish A; Sapienza, Anthony; Capo, John T

    2016-08-01

    The Internet is a common resource for applicants of hand surgery fellowships, however, the quality and accessibility of fellowship online information is unknown. The objectives of this study were to evaluate the accessibility of hand surgery fellowship Web sites and to assess the quality of information provided via program Web sites. Hand fellowship Web site accessibility was evaluated by reviewing the American Society for Surgery of the Hand (ASSH) on November 16, 2014 and the National Resident Matching Program (NRMP) fellowship directories on February 12, 2015, and performing an independent Google search on November 25, 2014. Accessible Web sites were then assessed for quality of the presented information. A total of 81 programs were identified with the ASSH directory featuring direct links to 32% of program Web sites and the NRMP directory directly linking to 0%. A Google search yielded direct links to 86% of program Web sites. The quality of presented information varied greatly among the 72 accessible Web sites. Program description (100%), fellowship application requirements (97%), program contact email address (85%), and research requirements (75%) were the most commonly presented components of fellowship information. Hand fellowship program Web sites can be accessed from the ASSH directory and, to a lesser extent, the NRMP directory. However, a Google search is the most reliable method to access online fellowship information. Of assessable programs, all featured a program description though the quality of the remaining information was variable. Hand surgery fellowship applicants may face some difficulties when attempting to gather program information online. Future efforts should focus on improving the accessibility and content quality on hand surgery fellowship program Web sites.

  13. Is orthopedics more competitive today than when my attending matched? An analysis of National Resident Matching Program data for orthopedic PGY1 applicants from 1984 to 2011.

    Science.gov (United States)

    Karnes, Jonathan M; Mayerson, Joel L; Scharschmidt, Thomas J

    2014-01-01

    This study evaluated supply and demand trends for orthopedic postgraduate year 1 (PGY1) positions from 1984 to 2011 for the purpose of estimating national intercandidate competition over time. National Resident Matching Program (NRMP) data for orthopedic surgery from 1984 to 2011 were collected. Proxy variables including (total number of orthopedic applicants/number of orthopedic PGY1 positions), (number of US senior applicants to orthopedics/number of orthopedic PGY1 positions), (number of US seniors matching into orthopedics/number of US senior orthopedic applicants), (total number of matched orthopedic applicants/total number of orthopedic applicants), and (total number of US applicants who fail to match into orthopedics/total number of US senior applicants into orthopedics) as well as average United States Medical Licensing Examination Step 1 scores were used to gauge the level of competition between candidates and were compared over time. Academic medical center in the Midwestern United States. Medical professors and medical students. The NRMP data suggested that the number of positions per applicant decreased or remained stable since 1984 and that the percentage of applicants who did not match was no higher now than in the past. This finding was primarily because of the relative decrease in the ratio of applicants to available PGY1 positions, which stems from the number of positions increasing more rapidly than the number of applicants. The NRMP data from 1984 to 2011 supported our hypothesis that intercandidate competition intensity for orthopedic PGY1 positions has not increased over time. The misconception that orthopedics is becoming more competitive likely arises from the increased number of applications submitted per candidate and the resulting relative importance placed on objective criteria such as United States Medical Licensing Examination Step 1 scores when programs select interview cohorts. Copyright © 2014 Association of Program Directors in

  14. 77 FR 38880 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Railroad Retirement Board (SSA...

    Science.gov (United States)

    2012-06-29

    ... RRB-20 systems of records. We will match RRB's data with our Medicare Database (MDB) File, system of... Post Entitlement System file daily. The number of records will differ each day, but consist of... computer matching program that we are currently conducting with RRB. DATES: We will file a report of...

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

    ... ADMINISTRATION Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Bureau of the Fiscal Service..., 2013. SUMMARY: In accordance with the provisions of the Privacy Act, as amended, this notice announces... INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503),...

  16. 78 FR 71591 - Privacy Act of 1974; Computer Matching Program between the U.S. Department of Education (ED) and...

    Science.gov (United States)

    2013-11-29

    ... Privacy Act of 1974; Computer Matching Program between the U.S. Department of Education (ED) and the U.S.... SUPPLEMENTARY INFORMATION: Pursuant to the Privacy Act of 1974, as amended (Privacy Act) (5 U.S.C. 552a), the..., the Computer Matching and Privacy Protection Act of 1988, 54 FR 25818 (June 19, 1989), and...

  17. 32 CFR Appendix E to Part 323 - OMB Guidelines for Matching Programs

    Science.gov (United States)

    2010-07-01

    ... soon after the information is received. d. Matches done to produce aggregate statistical data without any personal identifiers. e. Matches done to support any research or statistical project when the... match. b. Records relating to this will be kept only so long as an investigation, either criminal...

  18. 75 FR 16171 - Privacy Act of 1974; Notice of Modification of Existing Computer Matching Program Between the...

    Science.gov (United States)

    2010-03-31

    ... Individuals Covered by the System, Categories of Records in the System, Purposes of the System, and Routine Uses of Records Maintained in the System, Including Categories of Users and Purposes of Such Users. The... URBAN DEVELOPMENT Privacy Act of 1974; Notice of Modification of Existing Computer Matching Program...

  19. 76 FR 56781 - Privacy Act of 1974; Notice of a Computer Matching Program Between the Department of Housing and...

    Science.gov (United States)

    2011-09-14

    ... Housing and Urban Development (HUD) and the Social Security Administration (SSA): Matching Tenant Data in Assisted Housing Programs AGENCY: Office of the Chief Information Officer, HUD. ACTION: Notice of a... From the Federal Register Online via the Government Publishing Office DEPARTMENT OF HOUSING...

  20. 78 FR 69926 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Centers for Medicare & Medicaid...

    Science.gov (United States)

    2013-11-21

    ... ADMINISTRATION Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Centers for Medicare & Medicaid... accordance with the provisions of the Privacy Act, as amended, this notice announces a renewal of an existing... Act of 1988 (Pub. L 100-503), amended the Privacy Act (5 U.S.C. 552a) by describing the...

  1. 75 FR 26847 - Privacy Act of 1974; Report of Matching Program

    Science.gov (United States)

    2010-05-12

    ... system of records, ``Compensation, Pension, Education, and Vocational Rehabilitation and Employment.... The goal of this match is to compare income and employment status as reported to VA with wage records... to ensure accurate reporting of income and employment status. The authority for this matching...

  2. Estimating the Counterfactual Impact of Conservation Programs on Land Cover Outcomes: The Role of Matching and Panel Regression Techniques.

    Directory of Open Access Journals (Sweden)

    Kelly W Jones

    Full Text Available Deforestation and conversion of native habitats continues to be the leading driver of biodiversity and ecosystem service loss. A number of conservation policies and programs are implemented--from protected areas to payments for ecosystem services (PES--to deter these losses. Currently, empirical evidence on whether these approaches stop or slow land cover change is lacking, but there is increasing interest in conducting rigorous, counterfactual impact evaluations, especially for many new conservation approaches, such as PES and REDD, which emphasize additionality. In addition, several new, globally available and free high-resolution remote sensing datasets have increased the ease of carrying out an impact evaluation on land cover change outcomes. While the number of conservation evaluations utilizing 'matching' to construct a valid control group is increasing, the majority of these studies use simple differences in means or linear cross-sectional regression to estimate the impact of the conservation program using this matched sample, with relatively few utilizing fixed effects panel methods--an alternative estimation method that relies on temporal variation in the data. In this paper we compare the advantages and limitations of (1 matching to construct the control group combined with differences in means and cross-sectional regression, which control for observable forms of bias in program evaluation, to (2 fixed effects panel methods, which control for observable and time-invariant unobservable forms of bias, with and without matching to create the control group. We then use these four approaches to estimate forest cover outcomes for two conservation programs: a PES program in Northeastern Ecuador and strict protected areas in European Russia. In the Russia case we find statistically significant differences across estimators--due to the presence of unobservable bias--that lead to differences in conclusions about effectiveness. The Ecuador case

  3. Estimating the Counterfactual Impact of Conservation Programs on Land Cover Outcomes: The Role of Matching and Panel Regression Techniques.

    Science.gov (United States)

    Jones, Kelly W; Lewis, David J

    2015-01-01

    Deforestation and conversion of native habitats continues to be the leading driver of biodiversity and ecosystem service loss. A number of conservation policies and programs are implemented--from protected areas to payments for ecosystem services (PES)--to deter these losses. Currently, empirical evidence on whether these approaches stop or slow land cover change is lacking, but there is increasing interest in conducting rigorous, counterfactual impact evaluations, especially for many new conservation approaches, such as PES and REDD, which emphasize additionality. In addition, several new, globally available and free high-resolution remote sensing datasets have increased the ease of carrying out an impact evaluation on land cover change outcomes. While the number of conservation evaluations utilizing 'matching' to construct a valid control group is increasing, the majority of these studies use simple differences in means or linear cross-sectional regression to estimate the impact of the conservation program using this matched sample, with relatively few utilizing fixed effects panel methods--an alternative estimation method that relies on temporal variation in the data. In this paper we compare the advantages and limitations of (1) matching to construct the control group combined with differences in means and cross-sectional regression, which control for observable forms of bias in program evaluation, to (2) fixed effects panel methods, which control for observable and time-invariant unobservable forms of bias, with and without matching to create the control group. We then use these four approaches to estimate forest cover outcomes for two conservation programs: a PES program in Northeastern Ecuador and strict protected areas in European Russia. In the Russia case we find statistically significant differences across estimators--due to the presence of unobservable bias--that lead to differences in conclusions about effectiveness. The Ecuador case illustrates that

  4. A zero-one programming approach to Gulliksen's matched random subtests method

    NARCIS (Netherlands)

    van der Linden, Willem J.; Boekkooi-Timminga, Ellen

    1986-01-01

    In order to estimate the classical coefficient of test reliability, parallel measurements are needed. H. Gulliksen's matched random subtests method, which is a graphical method for splitting a test into parallel test halves, has practical relevance because it maximizes the alpha coefficient as a low

  5. A zero-one programming approach to Gulliksen's matched random subtests method

    NARCIS (Netherlands)

    Linden, van der Wim J.; Boekkooi-Timminga, Ellen

    1988-01-01

    Gulliksen’s matched random subtests method is a graphical method to split a test into parallel test halves. The method has practical relevance because it maximizes coefficient α as a lower bound to the classical test reliability coefficient. In this paper the same problem is formulated as a zero-one

  6. Maximum matching by convex quadratic programming based o an adverse graph conjecture

    OpenAIRE

    Pacheco, Maria F.; Cardoso, Domingos Moreira; Luz, Carlos J.

    2012-01-01

    In this talk, we describe a procedure for determining a maximum stable set in a graph with convex-$QP$ stability number (which is a graph whose stability number can be determined by solving a convex quadratic programming problem) unless there is a subgraph for which neither the optimal value of the convex quadratic program nor the least adjacency eigenvalue changes when the neighborhood of any vertex is deleted. Such a graph is called adverse. Assuming the trueness of the adver...

  7. How can clinician-educator training programs be optimized to match clinician motivations and concerns?

    Science.gov (United States)

    McCullough, Brendan; Marton, Gregory E; Ramnanan, Christopher J

    2015-01-01

    Background Several medical schools have implemented programs aimed at supporting clinician-educators with formal mentoring, training, and experience in undergraduate medical teaching. However, consensus program design has yet to be established, and the effectiveness of these programs in terms of producing quality clinician-educator teaching remains unclear. The goal of this study was to review the literature to identify motivations and perceived barriers to clinician-educators, which in turn will improve clinician-educator training programs to better align with clinician-educator needs and concerns. Methods Review of medical education literature using the terms “attitudes”, “motivations”, “physicians”, “teaching”, and “undergraduate medical education” resulted in identification of key themes revealing the primary motivations and barriers involved in physicians teaching undergraduate medical students. Results A synthesis of articles revealed that physicians are primarily motivated to teach undergraduate students for intrinsic reasons. To a lesser extent, physicians are motivated to teach for extrinsic reasons, such as rewards or recognition. The key barriers deterring physicians from teaching medical students included: decreased productivity, lack of compensation, increased length of the working day, patient concerns/ethical issues, and lack of confidence in their own ability. Conclusion Our findings suggest that optimization of clinician-educator training programs should address, amongst other factors, time management concerns, appropriate academic recognition for teaching service, and confidence in teaching ability. Addressing these issues may increase the retention of clinicians who are active and proficient in medical education. PMID:25653570

  8. How can clinician-educator training programs be optimized to match clinician motivations and concerns?

    Science.gov (United States)

    McCullough, Brendan; Marton, Gregory E; Ramnanan, Christopher J

    2015-01-01

    Several medical schools have implemented programs aimed at supporting clinician-educators with formal mentoring, training, and experience in undergraduate medical teaching. However, consensus program design has yet to be established, and the effectiveness of these programs in terms of producing quality clinician-educator teaching remains unclear. The goal of this study was to review the literature to identify motivations and perceived barriers to clinician-educators, which in turn will improve clinician-educator training programs to better align with clinician-educator needs and concerns. Review of medical education literature using the terms "attitudes", "motivations", "physicians", "teaching", and "undergraduate medical education" resulted in identification of key themes revealing the primary motivations and barriers involved in physicians teaching undergraduate medical students. A synthesis of articles revealed that physicians are primarily motivated to teach undergraduate students for intrinsic reasons. To a lesser extent, physicians are motivated to teach for extrinsic reasons, such as rewards or recognition. The key barriers deterring physicians from teaching medical students included: decreased productivity, lack of compensation, increased length of the working day, patient concerns/ethical issues, and lack of confidence in their own ability. Our findings suggest that optimization of clinician-educator training programs should address, amongst other factors, time management concerns, appropriate academic recognition for teaching service, and confidence in teaching ability. Addressing these issues may increase the retention of clinicians who are active and proficient in medical education.

  9. How can clinician-educator training programs be optimized to match clinician motivations and concerns?

    Directory of Open Access Journals (Sweden)

    McCullough B

    2015-01-01

    Full Text Available Brendan McCullough, Gregory E Marton, Christopher J Ramnanan Faculty of Medicine, University of Ottawa, Ottawa, ON, Canada Background: Several medical schools have implemented programs aimed at supporting clinician-educators with formal mentoring, training, and experience in undergraduate medical teaching. However, consensus program design has yet to be established, and the effectiveness of these programs in terms of producing quality clinician-educator teaching remains unclear. The goal of this study was to review the literature to identify motivations and perceived barriers to clinician-educators, which in turn will improve clinician-educator training programs to better align with clinician-educator needs and concerns. Methods: Review of medical education literature using the terms “attitudes”, “motivations”, “physicians”, “teaching”, and “undergraduate medical education” resulted in identification of key themes revealing the primary motivations and barriers involved in physicians teaching undergraduate medical students. Results: A synthesis of articles revealed that physicians are primarily motivated to teach undergraduate students for intrinsic reasons. To a lesser extent, physicians are motivated to teach for extrinsic reasons, such as rewards or recognition. The key barriers deterring physicians from teaching medical students included: decreased productivity, lack of compensation, increased length of the working day, patient concerns/ethical issues, and lack of confidence in their own ability. Conclusion: Our findings suggest that optimization of clinician-educator training programs should address, amongst other factors, time management concerns, appropriate academic recognition for teaching service, and confidence in teaching ability. Addressing these issues may increase the retention of clinicians who are active and proficient in medical education. Keywords: clinician-educators, teaching, undergraduate medical

  10. RT-PSM, a real-time program for peptide-spectrum matching with statistical significance.

    Science.gov (United States)

    Wu, Fang-Xiang; Gagné, Pierre; Droit, Arnaud; Poirier, Guy G

    2006-01-01

    The analysis of complex biological peptide mixtures by tandem mass spectrometry (MS/MS) produces a huge body of collision-induced dissociation (CID) MS/MS spectra. Several methods have been developed for identifying peptide-spectrum matches (PSMs) by assigning MS/MS spectra to peptides in a database. However, most of these methods either do not give the statistical significance of PSMs (e.g., SEQUEST) or employ time-consuming computational methods to estimate the statistical significance (e.g., PeptideProphet). In this paper, we describe a new algorithm, RT-PSM, which can be used to identify PSMs and estimate their accuracy statistically in real time. RT-PSM first computes PSM scores between an MS/MS spectrum and a set of candidate peptides whose masses are within a preset tolerance of the MS/MS precursor ion mass. Then the computed PSM scores of all candidate peptides are employed to fit the expectation value distribution of the scores into a second-degree polynomial function in PSM score. The statistical significance of the best PSM is estimated by extrapolating the fitting polynomial function to the best PSM score. RT-PSM was tested on two pairs of MS/MS spectrum datasets and protein databases to investigate its performance. The MS/MS spectra were acquired using an ion trap mass spectrometer equipped with a nano-electrospray ionization source. The results show that RT-PSM has good sensitivity and specificity. Using a 55,577-entry protein database and running on a standard Pentium-4, 2.8-GHz CPU personal computer, RT-PSM can process peptide spectra on a sequential, one-by-one basis in 0.047 s on average, compared to more than 7 s per spectrum on average for Sequest and X!Tandem, in their current batch-mode processing implementations. RT-PSM is clearly shown to be fast enough for real-time PSM assignment of MS/MS spectra generated every 3 s or so by a 3D ion trap or by a QqTOF instrument.

  11. Pattern matching

    NARCIS (Netherlands)

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

    2009-01-01

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

  12. Evaluating a community-based early childhood education and development program in Indonesia: study protocol for a pragmatic cluster randomized controlled trial with supplementary matched control group

    NARCIS (Netherlands)

    M. Pradhan; S.A. Brinkman; A. Beatty; A. Maika; E. Satriawan; J. de Ree; A. Hasan

    2013-01-01

    Background This paper presents the study protocol for a pragmatic cluster randomized controlled trial (RCT) with a supplementary matched control group. The aim of the trial is to evaluate a community-based early education and development program launched by the Government of Indonesia. The program w

  13. Participatory Assessment of a Matched Savings Program for Human Trafficking Survivors and their Family Members in the Philippines

    Directory of Open Access Journals (Sweden)

    Laura Cordisco Tsai

    2017-05-01

    Full Text Available Survivors of human trafficking often experience considerable financial difficulties upon exiting human trafficking, including pressure to provide financially for their families, challenges securing employment, lack of savings, and familial debt. Few evaluations have been conducted of reintegration support interventions addressing financial vulnerability among trafficking survivors. In this article, we present findings from a participatory assessment of the BARUG program, a matched savings and financial capability program for survivors of human trafficking and their family members in the Philippines. Photovoice was used to understand the experiences of two cohorts of BARUG participants. Survivors collaborated with research team members in conducting thematic analysis of transcripts from the photovoice sessions. Themes included: the positive emotional impact of financial wellness, overcoming the challenges of saving, applying financial management skills in daily decision making, developing a habit of savings, building a future-oriented mindset, receiving guidance and enlightenment, the learning process, and the change process. Findings reinforce the importance of interventions to support trafficked persons and their family members in getting out of debt and accumulating emergency savings, while also providing emotional support to survivors in coping with family financial pressures. The study also highlights the value of using participatory research methods to understand the experiences of trafficked persons. URN: http://nbn-resolving.de/urn:nbn:de:0114-fqs1702116

  14. One-bit-matching theorem for ICA, convex-concave programming on polyhedral set, and distribution approximation for combinatorics.

    Science.gov (United States)

    Xu, Lei

    2007-02-01

    According to the proof by Liu, Chiu, and Xu (2004) on the so-called one-bit-matching conjecture (Xu, Cheung, and Amari, 1998a), all the sources can be separated as long as there is an one-to-one same-sign correspondence between the kurtosis signs of all source probability density functions (pdf's) and the kurtosis signs of all model pdf's, which is widely believed and implicitly supported by many empirical studies. However, this proof is made only in a weak sense that the conjecture is true when the global optimal solution of an independent component analysis criterion is reached. Thus, it cannot support the successes of many existing iterative algorithms that usually converge at one of the local optimal solutions. This article presents a new mathematical proof that is obtained in a strong sense that the conjecture is also true when any one of local optimal solutions is reached in helping to investigating convex-concave programming on a polyhedral set. Theorems are also provided not only on partial separation of sources when there is a partial matching between the kurtosis signs, but also on an interesting duality of maximization and minimization on source separation. Moreover, corollaries are obtained on an interesting duality, with supergaussian sources separated by maximization and subgaussian sources separated by minimization. Also, a corollary is obtained to confirm the symmetric orthogonalization implementation of the kurtosis extreme approach for separating multiple sources in parallel, which works empirically but lacks mathematical proof. Furthermore, a linkage has been set up to combinatorial optimization from a distribution approximation perspective and a Stiefel manifold perspective, with algorithms that guarantee convergence as well as satisfaction of constraints.

  15. Pattern matching

    OpenAIRE

    Hak, Tony; Dul, Jan

    2009-01-01

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

  16. The Old Brain, the New Mirror: Matching Teaching and Learning Styles in Foreign Language Class (Based on Neuro-Linguistic Programming).

    Science.gov (United States)

    Knowles, John K.

    The process of matching teaching materials and methods to the student's learning style and ability level in foreign language classes is explored. The Neuro-Linguistic Programming (NLP) model offers a diagnostic process for the identification of style. This process can be applied to the language learning setting as a way of presenting material to…

  17. Improved Body Mass Index Measures Following a Middle School-Based Obesity Intervention--The MATCH Program

    Science.gov (United States)

    Lazorick, Suzanne; Fang, Xiangming; Hardison, George T.; Crawford, Yancey

    2015-01-01

    Background: Motivating Adolescents with Technology to CHOOSE Health™ (MATCH) is an educational and behavioral intervention in seventh grade. Methods: Teachers in 2 schools delivered the MATCH curriculum, with 1 control school. Using a quasi-experimental design, outcome measures included lessons completed, body mass index (BMI), BMI z-score (zBMI),…

  18. Matching Procedures at the Time of Immediate Breast Reconstruction: An American College of Surgeons National Surgical Quality Improvement Program Study of 24,191 Patients.

    Science.gov (United States)

    Cooney, Carisa M; Sebai, Mohamad E; Ogbuagu, Onyebuchi; Devulapalli, Chris; Manahan, Michele A; Rosson, Gedge D

    2016-12-01

    The purpose of this study was to assess for compounded risk of postoperative morbidity with the addition of a simultaneous contralateral breast matching procedure at the time of mastectomy and immediate breast reconstruction. 2005 to 2012 American College of Surgeons National Surgical Quality Improvement Program databases were used to identify cases of mastectomy and immediate breast reconstruction with and without simultaneous contralateral breast matching procedures. Matching procedures included mastopexy, reduction mammaplasty, and augmentation mammaplasty. Thirty-day postoperative morbidity was assessed using univariable and multivariable logistic regression. Of 59,766 mastectomy patients, 24,191 (40 percent) underwent immediate breast reconstruction: 903 (3.7 percent) underwent matching procedures and 23,288 (96.3 percent) did not. Univariable logistic regression demonstrated that the matching procedure group had statistically significantly higher overall morbidity (OR, 1.288; 95 percent CI, 1.022 to 1.623; p = 0.032). Although surgical and systemic morbidity did not differ significantly, the matching procedure group demonstrated higher risk for superficial surgical-site infection (OR, 1.57; 95 percent CI, 1.066 to 2.31; p = 0.022), reconstruction failure (OR, 1.69; 95 percent CI, 1.014 to 2.814; p = 0.044), and pulmonary embolism (OR, 2.54; 95 percent CI, 1.01 to 6.37; p = 0.048). Controlling for possible confounders, multivariable logistic regression rendered the relationship between matching procedure and complications insignificant (OR, 1.17; 95 percent CI, 0.92 to 1.48; p = 0.2). These data suggest that preoperative comorbidities and other patient-related factors may have a larger influence on postoperative morbidity than the addition of a contralateral matching procedure alone. Therapeutic, III.

  19. 75 FR 7648 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of Veterans Affairs...

    Science.gov (United States)

    2010-02-22

    ..., 2010. Michael G. Gallagher, Deputy Commissioner for Budget, Finance and Management. Notice of Computer... FR 29275 (June 19, 2009). We will match VA data with our SOR 60-0321, our Medicare Database....

  20. Race, Ethnicity and Ancestry in Unrelated Transplant Matching for the National Marrow Donor Program: A Comparison of Multiple Forms of Self-Identification with Genetics.

    Science.gov (United States)

    Hollenbach, Jill A; Saperstein, Aliya; Albrecht, Mark; Vierra-Green, Cynthia; Parham, Peter; Norman, Paul J; Maiers, Martin

    2015-01-01

    We conducted a nationwide study comparing self-identification to genetic ancestry classifications in a large cohort (n = 1752) from the National Marrow Donor Program. We sought to determine how various measures of self-identification intersect with genetic ancestry, with the aim of improving matching algorithms for unrelated bone marrow transplant. Multiple dimensions of self-identification, including race/ethnicity and geographic ancestry were compared to classifications based on ancestry informative markers (AIMs), and the human leukocyte antigen (HLA) genes, which are required for transplant matching. Nearly 20% of responses were inconsistent between reporting race/ethnicity versus geographic ancestry. Despite strong concordance between AIMs and HLA, no measure of self-identification shows complete correspondence with genetic ancestry. In certain cases geographic ancestry reporting matches genetic ancestry not reflected in race/ethnicity identification, but in other cases geographic ancestries show little correspondence to genetic measures, with important differences by gender. However, when respondents assign ancestry to grandparents, we observe sub-groups of individuals with well- defined genetic ancestries, including important differences in HLA frequencies, with implications for transplant matching. While we advocate for tailored questioning to improve accuracy of ancestry ascertainment, collection of donor grandparents' information will improve the chances of finding matches for many patients, particularly for mixed-ancestry individuals.

  1. UMCP-BG and E collaboration in nuclear power engineering in the framework of DOE-Utility Nuclear Power Engineering Education Matching Grant Program

    Energy Technology Data Exchange (ETDEWEB)

    Wolfe, Lothar PhD

    2000-03-01

    The DOE-Utility Nuclear Power Engineering Education Matching Grant Program has been established to support the education of students in Nuclear Engineering Programs to maintain a knowledgeable workforce in the United States in order to keep nuclear power as a viable component in a mix of energy sources for the country. The involvement of the utility industry ensures that this grant program satisfies the needs and requirements of local nuclear energy producers and at the same time establishes a strong linkage between education and day-to-day nuclear power generation. As of 1997, seventeen pairs of university-utility partners existed. UMCP was never a member of that group of universities, but applied for the first time with a proposal to Baltimore Gas and Electric Company in January 1999 [1]. This proposal was generously granted by BG&E [2,3] in the form of a gift in the amount of $25,000 from BG&E's Corporate Contribution Program. Upon the arrival of a newly appointed Director of Administration in the Department of Materials and Nuclear Engineering, the BG&E check was deposited into the University's Maryland Foundation Fund. The receipt of the letter and the check enabled UMCP to apply for DOE's matching funds in the same amount by a proposal.

  2. The New Rule Paradigm Shift: Transforming At-Risk Programs by Matching Business Archetypes Strategies in the Global Market

    Science.gov (United States)

    Stark, Paul S.

    2007-01-01

    The challenge was given to transform aviation-related programs to keep them from being eliminated. These programs were to be discontinued due to enrollment declines, costs, legislative mandates, lack of administrative support, and drastic state budget reductions. The New Rule was a paradigm shift of focus to the global market for program…

  3. The New Rule Paradigm Shift: Transforming At-Risk Programs by Matching Business Archetypes Strategies in the Global Market

    Science.gov (United States)

    Stark, Paul S.

    2007-01-01

    The challenge was given to transform aviation-related programs to keep them from being eliminated. These programs were to be discontinued due to enrollment declines, costs, legislative mandates, lack of administrative support, and drastic state budget reductions. The New Rule was a paradigm shift of focus to the global market for program…

  4. Matching Matters!

    CERN Document Server

    Freitas, Ayres; Plehn, Tilman

    2016-01-01

    Effective Lagrangians are a useful tool for a data-driven approach to physics beyond the Standard Model at the LHC. However, for the new physics scales accessible at the LHC, the effective operator expansion is only relatively slowly converging at best. For tree-level processes, it has been found that the agreement between the effective Lagrangian and a range of UV-complete models depends sensitively on the appropriate definition of the matching. We extend this analysis to the one-loop level, which is relevant for electroweak precision data and Higgs decay to photons. We show that near the scale of electroweak symmetry breaking the validity of the effective theory description can be systematically improved through an appropriate matching procedure. In particular, we find a significant increase in accuracy when including suitable terms suppressed by the Higgs vacuum expectation value in the matching.

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

    Science.gov (United States)

    2010-07-01

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

  6. Unsolicited Reporting to Prescribers of Opioid Analgesics by a State Prescription Drug Monitoring Program: An Observational Study with Matched Comparison Group.

    Science.gov (United States)

    Young, Leonard D; Kreiner, Peter W; Panas, Lee

    2017-04-04

     State prescription drug monitoring programs (PDMPs) can help detect individuals with multiple provider episodes (MPEs; also referred to as doctor/pharmacy shopping), an indicator of prescription drug abuse and/or diversion. Although unsolicited reporting by PDMPs to prescribers of opioid analgesics is thought to be an important practice in reducing MPEs and the potential harm associated with them, evidence of its effectiveness is mixed. This exploratory research evaluates the impact of unsolicited reports sent by Massachusetts' PDMP to the prescribers of persons with MPEs.  Individuals with MPEs were identified from PDMP records between January 2010 and July 2011 as individuals having Schedule II prescriptions (at least one prescription being an opioid) from four or more distinct prescribers and four or more distinct pharmacies within six months. Based on available MA-PDMP resources, an unsolicited report containing the patient's 12-month prescription history was sent to prescribers of a subset of patients who met the MPE threshold; a comparison group closely matched on demographics and baseline prescription history, whose prescribers were not sent a report, was generated using propensity score matching. The prescription history of each group was examined for 12 months before and after the intervention.  There were eighty-four patients (intervention group) whose prescribers received an unsolicited report and 504 matched patients (comparison group) whose prescribers were not sent a report. Regression analyses indicated significantly greater decreases in the number of Schedule II opioid prescriptions ( P  opioid analgesics from multiple providers.

  7. Effects of a School-Based Social-Emotional and Character Development Program on Health Behaviors: A Matched-Pair, Cluster-Randomized Controlled Trial.

    Science.gov (United States)

    Bavarian, Niloofar; Lewis, Kendra M; Acock, Alan; DuBois, David L; Yan, Zi; Vuchinich, Samuel; Silverthorn, Naida; Day, Joseph; Flay, Brian R

    2016-02-01

    There is considerable research that suggests that school-based social-emotional programs can foster improved mental health and reduce problem behaviors for participating youth; in contrast, much less is known about the impact of these programs on physical health, even though some of these programs also include at least limited direct attention to promoting physical health behaviors. We examined the effects of one such program, Positive Action (PA), on physical health behaviors and body mass index (BMI), and tested for mediation of program effects through a measure of social-emotional and character development (SECD). Participating schools in the matched-pair, cluster-randomized trial were 14 low-performing K-8 Chicago Public Schools. We followed a cohort of students in each school from grades 3 to 8 (eight waves of data collection; 1170 total students). Student self-reports of health behaviors served as the basis for measures of healthy eating and exercise, unhealthy eating, personal hygiene, consistent bedtime, and SECD. We collected height and weight measurements at endpoint to calculate age- and gender-adjusted BMI z-scores. Longitudinal multilevel modeling analyses revealed evidence of favorable program effects on personal hygiene [effect size (ES) = 0.48], healthy eating and exercise (ES = 0.21), and unhealthy eating (ES = -0.19); in addition, BMI z-scores were lower among students in PA schools at endpoint (ES = -0.21). Program effects were not moderated by either gender or student mobility. Longitudinal structural equation modeling demonstrated mediation through SECD for healthy eating and exercise, unhealthy eating, and personal hygiene. Findings suggest that a SECD program without a primary focus on health behavior promotion can have a modest impact on outcomes in this domain during the childhood to adolescence transition.

  8. Truecluster matching

    CERN Document Server

    Oehlschlägel, Jens

    2007-01-01

    Cluster matching by permuting cluster labels is important in many clustering contexts such as cluster validation and cluster ensemble techniques. The classic approach is to minimize the euclidean distance between two cluster solutions which induces inappropriate stability in certain settings. Therefore, we present the truematch algorithm that introduces two improvements best explained in the crisp case. First, instead of maximizing the trace of the cluster crosstable, we propose to maximize a chi-square transformation of this crosstable. Thus, the trace will not be dominated by the cells with the largest counts but by the cells with the most non-random observations, taking into account the marginals. Second, we suggest a probabilistic component in order to break ties and to make the matching algorithm truly random on random data. The truematch algorithm is designed as a building block of the truecluster framework and scales in polynomial time. First simulation results confirm that the truematch algorithm give...

  9. 76 FR 12398 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Bureau of the Public Debt (BPD...

    Science.gov (United States)

    2011-03-07

    ... comparison file compiled of records from our expanded Medicare Database (MDB) File system of records in order to support our administration of the prescription drug subsidy program. The MDB File system of... computer systems and provide the response file to us as soon as possible. This agreement covers...

  10. 77 FR 35432 - Privacy Act of 1974, Computer Matching Program: United States Postal Service and the Defense...

    Science.gov (United States)

    2012-06-13

    ... Numbers, names, and dates of birth for TRS-enrolled Selected Reservists or TRR-enrolled Retired Reservists.... TRS Program--TRICARE Reserve Select, a premium based TRICARE military health plan for members of the... Retired Reserve, a premium based TRICARE military health plan for members of the Retired Reserve of...

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

    Directory of Open Access Journals (Sweden)

    Laurent Billot

    2016-06-01

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

  12. 24 CFR 92.221 - Match credit.

    Science.gov (United States)

    2010-04-01

    ... 24 Housing and Urban Development 1 2010-04-01 2010-04-01 false Match credit. 92.221 Section 92.221... INVESTMENT PARTNERSHIPS PROGRAM Program Requirements Matching Contribution Requirement § 92.221 Match credit. (a) When credit is given. Contributions are credited on a fiscal year basis at the time the...

  13. Improving the Nephrology Match: the Path Forward.

    Science.gov (United States)

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

    2015-11-01

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

  14. The freetext matching algorithm: a computer program to extract diagnoses and causes of death from unstructured text in electronic health records.

    Science.gov (United States)

    Shah, Anoop D; Martinez, Carlos; Hemingway, Harry

    2012-08-07

    Electronic health records are invaluable for medical research, but much information is stored as free text rather than in a coded form. For example, in the UK General Practice Research Database (GPRD), causes of death and test results are sometimes recorded only in free text. Free text can be difficult to use for research if it requires time-consuming manual review. Our aim was to develop an automated method for extracting coded information from free text in electronic patient records. We reviewed the electronic patient records in GPRD of a random sample of 3310 patients who died in 2001, to identify the cause of death. We developed a computer program called the Freetext Matching Algorithm (FMA) to map diagnoses in text to the Read Clinical Terminology. The program uses lookup tables of synonyms and phrase patterns to identify diagnoses, dates and selected test results. We tested it on two random samples of free text from GPRD (1000 texts associated with death in 2001, and 1000 general texts from cases and controls in a coronary artery disease study), comparing the output to the U.S. National Library of Medicine's MetaMap program and the gold standard of manual review. Among 3310 patients registered in the GPRD who died in 2001, the cause of death was recorded in coded form in 38.1% of patients, and in the free text alone in 19.4%. On the 1000 texts associated with death, FMA coded 683 of the 735 positive diagnoses, with precision (positive predictive value) 98.4% (95% confidence interval (CI) 97.2, 99.2) and recall (sensitivity) 92.9% (95% CI 90.8, 94.7). On the general sample, FMA detected 346 of the 447 positive diagnoses, with precision 91.5% (95% CI 88.3, 94.1) and recall 77.4% (95% CI 73.2, 81.2), which was similar to MetaMap. We have developed an algorithm to extract coded information from free text in GP records with good precision. It may facilitate research using free text in electronic patient records, particularly for extracting the cause of death.

  15. A network-flow based valve-switching aware binding algorithm for flow-based microfluidic biochips

    DEFF Research Database (Denmark)

    Tseng, Kai-Han; You, Sheng-Chi; Minhass, Wajid Hassan

    2013-01-01

    -flow based resource binding algorithm based on breadth-first search (BFS) and minimum cost maximum flow (MCMF) in architectural-level synthesis. The experimental results show that our methodology not only makes significant reduction of valve-switching activities but also diminishes the application completion......Designs of flow-based microfluidic biochips are receiving much attention recently because they replace conventional biological automation paradigm and are able to integrate different biochemical analysis functions on a chip. However, as the design complexity increases, a flow-based microfluidic...... biochip needs more chip-integrated micro-valves, i.e., the basic unit of fluid-handling functionality, to manipulate the fluid flow for biochemical applications. Moreover, frequent switching of micro-valves results in decreased reliability. To minimize the valve-switching activities, we develop a network...

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

    Science.gov (United States)

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

    2005-01-01

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

  17. The Comparison of Matching Methods Using Different Measures of Balance: Benefits and Risks Exemplified within a Study to Evaluate the Effects of German Disease Management Programs on Long-Term Outcomes of Patients with Type 2 Diabetes.

    Science.gov (United States)

    Fullerton, Birgit; Pöhlmann, Boris; Krohn, Robert; Adams, John L; Gerlach, Ferdinand M; Erler, Antje

    2016-10-01

    To present a case study on how to compare various matching methods applying different measures of balance and to point out some pitfalls involved in relying on such measures. Administrative claims data from a German statutory health insurance fund covering the years 2004-2008. We applied three different covariance balance diagnostics to a choice of 12 different matching methods used to evaluate the effectiveness of the German disease management program for type 2 diabetes (DMPDM2). We further compared the effect estimates resulting from applying these different matching techniques in the evaluation of the DMPDM2. The choice of balance measure leads to different results on the performance of the applied matching methods. Exact matching methods performed well across all measures of balance, but resulted in the exclusion of many observations, leading to a change of the baseline characteristics of the study sample and also the effect estimate of the DMPDM2. All PS-based methods showed similar effect estimates. Applying a higher matching ratio and using a larger variable set generally resulted in better balance. Using a generalized boosted instead of a logistic regression model showed slightly better performance for balance diagnostics taking into account imbalances at higher moments. Best practice should include the application of several matching methods and thorough balance diagnostics. Applying matching techniques can provide a useful preprocessing step to reveal areas of the data that lack common support. The use of different balance diagnostics can be helpful for the interpretation of different effect estimates found with different matching methods. © Health Research and Educational Trust.

  18. A Pilot Participant Observation Study of the Environment in a Program for Young Offenders from a Conceptual Level Matching Model Perspective.

    Science.gov (United States)

    Reitsma-Street, Marge

    1988-01-01

    Discusses conceptual clarification of dimensions in the treatment environment of a residential unit for young offenders. Examines ideas of structure, control, contemporaneous, and developmental matching from the Conceptual Level Matching Model. Describes specification of types, quality, and settings of staff-youth interactions. Addresses the…

  19. Matching Supernovae to Galaxies

    Science.gov (United States)

    Kohler, Susanna

    2016-12-01

    One of the major challenges for modern supernova surveys is identifying the galaxy that hosted each explosion. Is there an accurate and efficient way to do this that avoids investing significant human resources?Why Identify Hosts?One problem in host galaxy identification. Here, the supernova lies between two galaxies but though the centroid of the galaxy on the right is closer in angular separation, this may be a distant background galaxy that is not actually near the supernova. [Gupta et al. 2016]Supernovae are a critical tool for making cosmological predictions that help us to understand our universe. But supernova cosmology relies on accurately identifying the properties of the supernovae including their redshifts. Since spectroscopic followup of supernova detections often isnt possible, we rely on observations of the supernova host galaxies to obtain redshifts.But how do we identify which galaxy hosted a supernova? This seems like a simple problem, but there are many complicating factors a seemingly nearby galaxy could be a distant background galaxy, for instance, or a supernovas host could be too faint to spot.The authors algorithm takes into account confusion, a measure of how likely the supernova is to be mismatched. In these illustrations of low (left) and high (right) confusion, the supernova is represented by a blue star, and the green circles represent possible host galaxies. [Gupta et al. 2016]Turning to AutomationBefore the era of large supernovae surveys, searching for host galaxies was done primarily by visual inspection. But current projects like the Dark Energy Surveys Supernova Program is finding supernovae by the thousands, and the upcoming Large Synoptic Survey Telescope will likely discover hundreds of thousands. Visual inspection will not be possible in the face of this volume of data so an accurate and efficient automated method is clearly needed!To this end, a team of scientists led by Ravi Gupta (Argonne National Laboratory) has recently

  20. Rethinking the Match: A Proposal for Modern Match-Making.

    Science.gov (United States)

    Ray, Chris; Bishop, Steven E; Dow, Alan W

    2017-06-27

    Since the 1950s, the National Resident Matching Program, or "the Match," has governed the placement of medical students into residencies. The Match was created to protect students in an era when residency positions outnumbered applicants and hospitals pressured students early in their academic careers to commit to a residency position. Now, however, applicants outnumber positions, applicants are applying to increasing numbers of programs, and the costs of the Match for applicants and programs are high. Meanwhile, medical education is evolving toward a competency-based approach, a U.S. physician shortage is predicted, and some researchers describe a "July effect"-worse clinical outcomes correlated with the mass entry of new residents.Against this background, the authors argue for adopting a more modern, free-market approach to residency match-making that might better suit the needs of applicants, programs, and the public. They propose allowing students who have been identified by their medical schools as having achieved graduation-level competency to apply to residency programs at any point during the year. Residency programs would set their own application timetables and extend offers in an ongoing fashion. Students, counseled by their schools, would accept or decline offers as desired. The authors argue this approach would better support competency-based education while allowing applicants and programs more choice regarding how they engage and adapt within the selection process. The approach's staggered start times for new residents might attenuate the July effect and improve outcomes for patients. Medical students might also enter and thereby complete residency earlier, increasing the physician workforce.

  1. 34 CFR 361.60 - Matching requirements.

    Science.gov (United States)

    2010-07-01

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

  2. 28 CFR 33.21 - Match.

    Science.gov (United States)

    2010-07-01

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

  3. Flow-based reputation: more than just ranking

    CERN Document Server

    Simone, Antonino; Zannone, Nicola

    2012-01-01

    The last years have seen a growing interest in collaborative systems like electronic marketplaces and P2P file sharing systems where people are intended to interact with other people. Those systems, however, are subject to security and operational risks because of their open and distributed nature. Reputation systems provide a mechanism to reduce such risks by building trust relationships among entities and identifying malicious entities. A popular reputation model is the so called flow-based model. Most existing reputation systems based on such a model provide only a ranking, without absolute reputation values; this makes it difficult to determine whether entities are actually trustworthy or untrustworthy. In addition, those systems ignore a significant part of the available information; as a consequence, reputation values may not be accurate. In this paper, we present a flow-based reputation metric that gives absolute values instead of merely a ranking. Our metric makes use of all the available information....

  4. Fuzzy Prediction for Traffic Flow Based on Delta Test

    OpenAIRE

    2016-01-01

    This paper presents a novel approach to one-step-forward prediction of traffic flow based on fuzzy reasoning. The successful construction of a competent fuzzy inference system of Sugeno type largely relies on proper choice of input dimension and accurate estimation of structure parameters and rules. The first issue is addressed with a proposed method, based on δ-test, which can simultaneously determine input dimension and reduce noise level. In response to the second issue, two clustering tec...

  5. Improved bounds for stochastic matching

    CERN Document Server

    Li, Jian

    2010-01-01

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

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

    Science.gov (United States)

    2010-07-01

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

  7. 77 FR 22326 - Privacy Act of 1974, as Amended by Public Law 100-503; Notice of a Computer Matching Program

    Science.gov (United States)

    2012-04-13

    ... HUMAN SERVICES Administration for Children and Families Privacy Act of 1974, as Amended by Public Law... 1974, as amended by Public Law 100-503. SUMMARY: In compliance with the Privacy Act of 1974, as amended by Public Law 100-503, the Computer Matching and Privacy Protection Act of 1988, ACF is publishing...

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

    Science.gov (United States)

    2013-08-07

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

  9. Effects of a School-Based Social-Emotional and Character Development Program on Health Behaviors: A Matched-Pair, Cluster-Randomized Controlled Trial

    OpenAIRE

    Bavarian, Niloofar; Lewis, Kendra M.; Acock, Alan; DuBois, David L.; Yan, Zi; Vuchinich, Samuel; Silverthorn, Naida; Day, Joseph; Flay, Brian R.

    2016-01-01

    There is considerable research that suggests that school-based social-emotional programs can foster improved mental health and reduce problem behaviors for participating youth; in contrast, much less is known about the impact of these programs on physical health, even though some of these programs also include at least limited direct attention to promoting physical health behaviors. We examined the effects of one such program, Positive Action (PA), on physical health behaviors and body mass i...

  10. Optical flow based velocity estimation for mobile robots

    Science.gov (United States)

    Li, Xiuzhi; Zhao, Guanrong; Jia, Songmin; Qin, Baoling; Yang, Ailin

    2015-02-01

    This paper presents an optical flow based novel technique to perceive the instant motion velocity of mobile robots. The primary focus of this study is to determine the robot's ego-motion using displacement field in temporally consecutive image pairs. In contrast to most previous approaches for estimating velocity, we employ a polynomial expansion based dense optical flow approach and propose a quadratic model based RANSAC refinement of flow fields to render our method more robust with respect to noise and outliers. Accordingly, techniques for geometrical transformation and interpretation of the inter-frame motion are presented. Advantages of our proposal are validated by real experimental results conducted on Pioneer robot.

  11. Modeling and Simulation Framework for Flow-Based Microfluidic Biochips

    DEFF Research Database (Denmark)

    Schmidt, Morten Foged; Minhass, Wajid Hassan; Pop, Paul

    2013-01-01

    Microfluidic biochips are replacing the conventional biochemical analyzers and are able to integrate the necessary functions for biochemical analysis on-chip. In this paper we are interested in flow-based biochips, in which the fluidic flow is manipulated using integrated microvalves. By combining...... and error prone. In this paper, we present an Integrated Development Environment (IDE), which addresses (i) schematic capture of the biochip architecture and biochemical application, (ii) logic simulation of an application running on a biochip, and is able to integrate the high level synthesis tasks we have...

  12. Flow-based market coupling. Stepping stone towards nodal pricing?

    Energy Technology Data Exchange (ETDEWEB)

    Van der Welle, A.J. [ECN Policy Studies, Petten (Netherlands)

    2012-07-15

    For achieving one internal energy market for electricity by 2014, market coupling is deployed to integrate national markets into regional markets and ultimately one European electricity market. The extent to which markets can be coupled depends on the available transmission capacities between countries. Since interconnections are congested from time to time, congestion management methods are deployed to divide the scarce available transmission capacities over market participants. For further optimization of the use of available transmission capacities while maintaining current security of supply levels, flow-based market coupling (FBMC) will be implemented in the CWE region by 2013. Although this is an important step forward, important hurdles for efficient congestion management remain. Hence, flow based market coupling is compared to nodal pricing, which is often considered as the most optimal solution from theoretical perspective. In the context of decarbonised power systems it is concluded that advantages of nodal pricing are likely to exceed its disadvantages, warranting further development of FBMC in the direction of nodal pricing.

  13. Statistics of polarisation matching

    NARCIS (Netherlands)

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

    2014-01-01

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

  14. Matching Through Position Auctions

    OpenAIRE

    Terence Johnson

    2009-01-01

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

  15. Hierarchical model of matching

    Science.gov (United States)

    Pedrycz, Witold; Roventa, Eugene

    1992-01-01

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

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

  17. Flow-Based Network Analysis of the Caenorhabditis elegans Connectome

    Science.gov (United States)

    Bacik, Karol A.; Schaub, Michael T.; Billeh, Yazan N.; Barahona, Mauricio

    2016-01-01

    We exploit flow propagation on the directed neuronal network of the nematode C. elegans to reveal dynamically relevant features of its connectome. We find flow-based groupings of neurons at different levels of granularity, which we relate to functional and anatomical constituents of its nervous system. A systematic in silico evaluation of the full set of single and double neuron ablations is used to identify deletions that induce the most severe disruptions of the multi-resolution flow structure. Such ablations are linked to functionally relevant neurons, and suggest potential candidates for further in vivo investigation. In addition, we use the directional patterns of incoming and outgoing network flows at all scales to identify flow profiles for the neurons in the connectome, without pre-imposing a priori categories. The four flow roles identified are linked to signal propagation motivated by biological input-response scenarios. PMID:27494178

  18. An improved approach for flow-based cloud point extraction.

    Science.gov (United States)

    Frizzarin, Rejane M; Rocha, Fábio R P

    2014-04-11

    Novel strategies are proposed to circumvent the main drawbacks of flow-based cloud point extraction (CPE). The surfactant-rich phase (SRP) was directly retained into the optical path of the spectrophotometric cell, thus avoiding its dilution previously to the measurement and yielding higher sensitivity. Solenoid micro-pumps were exploited to improve mixing by the pulsed flow and also to modulate the flow-rate for retention and removal of the SRP, thus avoiding the elution step, often carried out with organic solvents. The heat released and the increase of the salt concentration provided by an on-line neutralization reaction were exploited to induce the cloud point without an external heating device. These innovations were demonstrated by the spectrophotometric determination of iron, yielding a linear response from 10 to 200 μg L(-1) with a coefficient of variation of 2.3% (n=7). Detection limit and sampling rate were estimated at 5 μg L(-1) (95% confidence level) and 26 samples per hour, respectively. The enrichment factor was 8.9 and the procedure consumed only 6 μg of TAN and 390 μg of Triton X-114 per determination. At the 95% confidence level, the results obtained for freshwater samples agreed with the reference procedure and those obtained for digests of bovine muscle, rice flour, brown bread and tort lobster agreed with the certified reference values. The proposed procedure thus shows advantages in relation to previously proposed approaches for flow-based CPE, being a fast and environmental friendly alternative for on-line separation and pre-concentration.

  19. Spurring Innovation with Matching Grants

    OpenAIRE

    2015-01-01

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

  20. The Impact of a School-Based Water, Sanitation, and Hygiene Program on Absenteeism, Diarrhea, and Respiratory Infection: A Matched-Control Trial in Mali.

    Science.gov (United States)

    Trinies, Victoria; Garn, Joshua V; Chang, Howard H; Freeman, Matthew C

    2016-06-01

    We conducted a matched-control trial in Mali to assess the effectiveness of a comprehensive school-based water, sanitation, and hygiene (WASH) intervention on pupil absence, diarrhea, and respiratory infections. After completion of the intervention, data were collected from 100 beneficiary schools and 100 matched comparison schools in 5-6 sessions over a 14-month period. Data collection included roll calls to assess absenteeism and interviews with a subset of pupils to assess recent absence and disease symptoms. The odds of pupils being absent at roll call were 23% higher in beneficiary schools than in comparison schools (odds ratio [OR]: 1.23, 95% confidence interval [CI]: 1.06, 1.42). The odds of pupils reporting being absent due to diarrhea (OR: 0.73, 95% CI: 0.56, 0.94) or having had diarrhea (OR: 0.71, 95% CI: 0.60, 0.85) or respiratory infection symptoms (OR: 0.75, 95% CI: 0.65, 0.86) in the past week were lower in beneficiary schools compared with comparison schools. We found that a school-based WASH intervention can have a positive effect on reducing rates of illness, as well as absence due to diarrhea. However, we did not find evidence that these health impacts led to a reduction in overall absence. Higher absence rates are less likely attributable to the intervention than the result of an imbalance in unobserved confounders between study groups. © The American Society of Tropical Medicine and Hygiene.

  1. Uncertain Schema Matching

    CERN Document Server

    Gal, Avigdor

    2011-01-01

    Schema matching is the task of providing correspondences between concepts describing the meaning of data in various heterogeneous, distributed data sources. Schema matching is one of the basic operations required by the process of data and schema integration, and thus has a great effect on its outcomes, whether these involve targeted content delivery, view integration, database integration, query rewriting over heterogeneous sources, duplicate data elimination, or automatic streamlining of workflow activities that involve heterogeneous data sources. Although schema matching research has been o

  2. Guided Wave Signal Recognition by Orthogonal Matching Pursuit Based on Modified Evolutionary Programming Algorithm%基于改进进化规划的正交匹配追踪超声导波信号识别

    Institute of Scientific and Technical Information of China (English)

    申传俊; 刘燕; 王悦民; 孙丰瑞

    2015-01-01

    提出基于 t 算子的改进的进化规划(M tEP),进行了性能测试,发现其以更高的概率收敛到全局最优。采用chirplet 函数作为匹配原子,将其应用于正交匹配追踪方法(OM P)。利用导波检测仪对含缺陷铝管进行导波检测,利用M tEP 实现的正交匹配追踪方法对检测信号进行匹配分解与重构,发现重构所得导波信号信噪比明显提高。将匹配结果与未改进的进化规划算法(tEP)实现的正交匹配追踪匹配同样的信号所得结果作比较,基于 M tEP 的 OMP 比基于 tEP 的OM P 匹配所得参数能够更加准确地反映信号激励频率,且耗时更少,因此是一种有效的导波信号识别方法。%A kind of modified evolutionary programming using mutations based on the t probability distribution(M tEP) is proposed and applied to the orthogonal matching pursuit method .Three kinds of mutation operators are compared and the chirplet function is chosen as matching atom .An aluminum pipe with holes is inspected by guided wave testing system and the measured signal is decomposed and reconstructed by the orthogonal matching pursuit method .The SNR of the processed signal is improved obviously .The matched result is compared to the matched result from OMP with EP using mutations based on the t probability distribution(tEP) .The matched parameters get from OMP with MtEP and tEP are compared and analyzed .The center frequency of the excitation signal are more exactly and the computation time is shorter by OMP based on M tEP than based on tEP .Therefore ,OMP based on MtEP is a useful signal recognition approach for pipes guided wave NDT .

  3. Matchings in hexagonal cacti

    Directory of Open Access Journals (Sweden)

    E. J. Farrell

    1987-01-01

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

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

  5. 基于模板匹配的启发式编程训练软件的Web实现%Web Implementation of Heuristic Programming Training Software Based on Template Matching

    Institute of Scientific and Technical Information of China (English)

    丁振凡; 张晓瑞

    2011-01-01

    Heuristic programming training is very helpful for cultivating students' standard programming and thinking in the web teaching coursewares. The programming training software uses DHTML technology of the client to realize interaction and dynamic display of processing with the students, adopting teacher's template programs as matched objective. In the template programs, it gives some prompts and parts requiting students to input with specific markers. By comparing the character input by students and the character of.teacher template programs, it checks and displays whether it is right or wrong, thus guiding students to standard programming. a A powerful platform is given to develop and improve students' thinking and practice ability.%在wleb教学课件中进行启发式编程训练对培养学生规范编程和思考问题很有帮助.该编程训练软件利用客户端的DHTML技术实现与学生的交互和动态显示处理,以教师模板程序为匹配目标,在模板程序中通过特殊标记给出提示和需要学生输入部分.通过学生输入的字符与教师模板程序的字符对比来检查和提示对错,从而引导学生规范编程,为开拓学生思维、提高学生思考和动手能力提供了一个强大的实践平台.

  6. Material flow-based economic assessment of landfill mining processes.

    Science.gov (United States)

    Kieckhäfer, Karsten; Breitenstein, Anna; Spengler, Thomas S

    2017-02-01

    This paper provides an economic assessment of alternative processes for landfill mining compared to landfill aftercare with the goal of assisting landfill operators with the decision to choose between the two alternatives. A material flow-based assessment approach is developed and applied to a landfill in Germany. In addition to landfill aftercare, six alternative landfill mining processes are considered. These range from simple approaches where most of the material is incinerated or landfilled again to sophisticated technology combinations that allow for recovering highly differentiated products such as metals, plastics, glass, recycling sand, and gravel. For the alternatives, the net present value of all relevant cash flows associated with plant installation and operation, supply, recycling, and disposal of material flows, recovery of land and landfill airspace, as well as landfill closure and aftercare is computed with an extensive sensitivity analyses. The economic performance of landfill mining processes is found to be significantly influenced by the prices of thermal treatment (waste incineration as well as refuse-derived fuels incineration plant) and recovered land or airspace. The results indicate that the simple process alternatives have the highest economic potential, which contradicts the aim of recovering most of the resources. Copyright © 2016 Elsevier Ltd. All rights reserved.

  7. Fuzzy Prediction for Traffic Flow Based on Delta Test

    Directory of Open Access Journals (Sweden)

    Yang Wang

    2016-01-01

    Full Text Available This paper presents a novel approach to one-step-forward prediction of traffic flow based on fuzzy reasoning. The successful construction of a competent fuzzy inference system of Sugeno type largely relies on proper choice of input dimension and accurate estimation of structure parameters and rules. The first issue is addressed with a proposed method, based on δ-test, which can simultaneously determine input dimension and reduce noise level. In response to the second issue, two clustering techniques, based on nearest-neighbor clustering and Gaussian mixture models, are successively employed to determine the antecedent parameters and rules, and the estimation for the consequent parameters is achieved by the least square estimation technique. A number of experiments have been performed on the one-week data of traffic flow to evaluate the proposed approach in terms of denosing, prediction performances, overfitting, and so forth. The experimental results have demonstrated that the proposed prediction approach is effective in removing noise and constructing a competent and compact fuzzy inference system without significant overfitting.

  8. Maximum flow-based resilience analysis: From component to system

    Science.gov (United States)

    Jin, Chong; Li, Ruiying; Kang, Rui

    2017-01-01

    Resilience, the ability to withstand disruptions and recover quickly, must be considered during system design because any disruption of the system may cause considerable loss, including economic and societal. This work develops analytic maximum flow-based resilience models for series and parallel systems using Zobel’s resilience measure. The two analytic models can be used to evaluate quantitatively and compare the resilience of the systems with the corresponding performance structures. For systems with identical components, the resilience of the parallel system increases with increasing number of components, while the resilience remains constant in the series system. A Monte Carlo-based simulation method is also provided to verify the correctness of our analytic resilience models and to analyze the resilience of networked systems based on that of components. A road network example is used to illustrate the analysis process, and the resilience comparison among networks with different topologies but the same components indicates that a system with redundant performance is usually more resilient than one without redundant performance. However, not all redundant capacities of components can improve the system resilience, the effectiveness of the capacity redundancy depends on where the redundant capacity is located. PMID:28545135

  9. Learning Graph Matching

    CERN Document Server

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

    2008-01-01

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

  10. Matched-pair classification

    Energy Technology Data Exchange (ETDEWEB)

    Theiler, James P [Los Alamos National Laboratory

    2009-01-01

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

  11. Risk of symptomatic gallstones and cholecystectomy after a very-low-calorie diet or low-calorie diet in a commercial weight loss program: 1-year matched cohort study

    Science.gov (United States)

    Johansson, K; Sundström, J; Marcus, C; Hemmingsson, E; Neovius, M

    2014-01-01

    Background: Concern exists regarding gallstones as an adverse event of very-low-calorie diets (VLCDs; gallstones requiring hospital care and/or cholecystectomy in a commercial weight loss program using VLCD or low-calorie diet (LCD). Design: A 1-year matched cohort study of consecutively enrolled adults in a commercial weight loss program conducted at 28 Swedish centers between 2006 and 2009. A 3-month weight loss phase of VLCD (500 kcal per day) or LCD (1200–1500 kcal per day) was followed by a 9-month weight maintenance phase. Matching (1:1) was performed by age, sex, body mass index, waist circumference and gallstone history (n=3320:3320). Gallstone and cholecystectomy data were retrieved from the Swedish National Patient Register. Results: One-year weight loss was greater in the VLCD than in the LCD group (−11.1 versus −8.1 kg; adjusted difference, −2.8 kg, 95% CI −3.1 to −2.4; Pgallstones requiring hospital care occurred in the VLCD and LCD groups, respectively, (152 versus 44/10 000 person–years; hazard ratio, 3.4, 95% CI 1.8–6.3; Pgallstone events, 38 (61%) resulted in cholecystectomy (29 versus 9; hazard ratio, 3.2, 95% CI 1.5–6.8; P=0.003; number-needed-to-harm, 151, 95% CI 94–377; Pgallstones (2.5, 95% CI 1.3–5.1; P=0.009) and became borderline for cholecystectomy (2.2, 95% CI 0.9–5.2; P=0.08). Conclusion: The risk of symptomatic gallstones requiring hospitalization or cholecystectomy, albeit low, was 3-fold greater with VLCD than LCD during the 1-year commercial weight loss program. PMID:23736359

  12. HipMatch: an object-oriented cross-platform program for accurate determination of cup orientation using 2D-3D registration of single standard X-ray radiograph and a CT volume.

    Science.gov (United States)

    Zheng, Guoyan; Zhang, Xuan; Steppacher, Simon D; Murphy, Stephen B; Siebenrock, Klaus A; Tannast, Moritz

    2009-09-01

    The widely used procedure of evaluation of cup orientation following total hip arthroplasty using single standard anteroposterior (AP) radiograph is known inaccurate, largely due to the wide variability in individual pelvic orientation relative to X-ray plate. 2D-3D image registration methods have been introduced for an accurate determination of the post-operative cup alignment with respect to an anatomical reference extracted from the CT data. Although encouraging results have been reported, their extensive usage in clinical routine is still limited. This may be explained by their requirement of a CAD model of the prosthesis, which is often difficult to be organized from the manufacturer due to the proprietary issue, and by their requirement of either multiple radiographs or a radiograph-specific calibration, both of which are not available for most retrospective studies. To address these issues, we developed and validated an object-oriented cross-platform program called "HipMatch" where a hybrid 2D-3D registration scheme combining an iterative landmark-to-ray registration with a 2D-3D intensity-based registration was implemented to estimate a rigid transformation between a pre-operative CT volume and the post-operative X-ray radiograph for a precise estimation of cup alignment. No CAD model of the prosthesis is required. Quantitative and qualitative results evaluated on cadaveric and clinical datasets are given, which indicate the robustness and the accuracy of the program. HipMatch is written in object-oriented programming language C++ using cross-platform software Qt (TrollTech, Oslo, Norway), VTK, and Coin3D and is transportable to any platform.

  13. Learning graph matching.

    Science.gov (United States)

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

    2009-06-01

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

  14. Latent fingerprint matching.

    Science.gov (United States)

    Jain, Anil K; Feng, Jianjiang

    2011-01-01

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

  15. Optimal Packed String Matching

    DEFF Research Database (Denmark)

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

    2011-01-01

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

  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. Cognitive Levels Matching.

    Science.gov (United States)

    Brooks, Martin; And Others

    1983-01-01

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

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

  20. Regular Expression Matching and Operational Semantics

    CERN Document Server

    Rathnayake, Asiri; 10.4204/EPTCS.62.3

    2011-01-01

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

  1. 36 CFR 72.32 - Funding and matching share.

    Science.gov (United States)

    2010-07-01

    .... 72.32 Section 72.32 Parks, Forests, and Public Property NATIONAL PARK SERVICE, DEPARTMENT OF THE..., Rehabilitation and Innovation § 72.32 Funding and matching share. (a) Recovery Action Program Grant Matching. Up... development may be used as part of a local match for Innovation or Rehabilitation grants only when the...

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

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

    Science.gov (United States)

    2011-03-17

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

  4. Schema matching and mapping

    CERN Document Server

    Bellahsene, Zohra; Rahm, Erhard

    2011-01-01

    Requiring heterogeneous information systems to cooperate and communicate has now become crucial, especially in application areas like e-business, Web-based mash-ups and the life sciences. Such cooperating systems have to automatically and efficiently match, exchange, transform and integrate large data sets from different sources and of different structure in order to enable seamless data exchange and transformation. The book edited by Bellahsene, Bonifati and Rahm provides an overview of the ways in which the schema and ontology matching and mapping tools have addressed the above requirements

  5. Bayesian grid matching

    DEFF Research Database (Denmark)

    Hartelius, Karsten; Carstensen, Jens Michael

    2003-01-01

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

  6. Middle matching mining algorithm

    Institute of Scientific and Technical Information of China (English)

    GUO Ping; CHEN Li

    2003-01-01

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

  7. Factorized Graph Matching.

    Science.gov (United States)

    Zhou, Feng; de la Torre, Fernando

    2015-11-19

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

  8. A Football Match

    Institute of Scientific and Technical Information of China (English)

    彭硕

    2002-01-01

    It was a Saturday morning, our school football team was going to have a match with the No. 28 Middle Schooh They were really a strong team. But we weren't afraid of them. We had many mare good players on our team, so we were stronger than ever before.

  9. Derivatives of Matching.

    Science.gov (United States)

    Herrnstein, R. J.

    1979-01-01

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

  10. n! matchings, n! posets

    CERN Document Server

    Claesson, Anders

    2010-01-01

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

  11. 'Wiggle matching' radiocarbon dates

    NARCIS (Netherlands)

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

    2001-01-01

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

  12. Polytypic pattern matching

    NARCIS (Netherlands)

    Jeuring, J.T.

    2007-01-01

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

  13. Power system transient stability constrained optimal power flow based on active-set reduced-space sequential quadratic programming%基于有效集减空间逐次二次规划算法的电力系统暂态稳定约束最优潮流

    Institute of Scientific and Technical Information of China (English)

    韩其国; 陈功洵; 肖宏飞

    2016-01-01

    Transient stability constrained optimal power flow (TSCOPF) is able to effectively coordinate the dynamic security and operation economics for power systems. Focusing on existing technical difficulties, including low computational efficiency and high memory consumption, this paper proposes an active-set reduced-space sequential quadratic programming algorithm to solve this problem. This approach is able to take advantage of the characteristics of few degree of freedom in TSCOPF problems, in order to decrease the computational complexity. Meanwhile, active-set technique is introduced to reduce the dimensions of quadratic programming subproblems by filtering inactive inequality constraints and reducing computational demand. Compared with existing algorithms, case studies based on a series of test cases indicate the effectiveness of the proposed approach in solving TSCOPF problems for large-scale power systems.%暂态稳定约束最优潮流是实现电力系统动态安全性和运行经济性协调的一种有效方式。针对已有研究中求解算法计算效率低、内存使用量大等困难,提出使用有效集减空间逐次二次规划算法求解该问题。该方法能够利用暂态稳定约束最优潮流问题中低自由度的特点,显著降低计算复杂性。引入有效集方法,在求解二次规划子问题时滤除不起作用的不等式约束,缩减子问题维度,减少了计算量。基于一系列测试算例的分析结果表明,与已有算法相比,所提算法能够有效求解大规模电力系统的暂态稳定约束最优潮流问题。

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

  15. Resurgence matches quantization

    Science.gov (United States)

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

    2017-04-01

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

  16. Resurgence Matches Quantization

    CERN Document Server

    Couso-Santamaría, Ricardo; Schiappa, Ricardo

    2016-01-01

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

  17. Matchings on infinite graphs

    CERN Document Server

    Bordenave, Charles; Salez, Justin

    2011-01-01

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

  18. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Winicour Jeffrey

    2005-12-01

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

  19. Longitudinal matching between SFC and SSC

    Energy Technology Data Exchange (ETDEWEB)

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

    1998-11-01

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

  20. Match injury rates in professional soccer vary with match result, match venue, and type of competition.

    Science.gov (United States)

    Bengtsson, Håkan; Ekstrand, Jan; Waldén, Markus; Hägglund, Martin

    2013-07-01

    Player activities in soccer matches are influenced by the match result and match venue. It is not known whether injury rates are influenced by these factors. To investigate whether there are associations between injury rates and the match result, venue, and type of competition in male soccer. Cohort study; Level of evidence, 3. Twenty-six professional clubs from 10 countries were followed prospectively during 9 seasons (2001-2002 to 2009-2010). All matches, and injuries occurring in these matches, were registered by the team's medical staff. An injury was registered if it resulted in player absence from training or matches. Information about match result, venue, and type of competition for all reported matches was gathered by the authors from online databases. Injury rates in matches with varying match characteristics were compared by use of generalized estimating equations. Odds ratios (ORs) with 95% confidence intervals (CIs) were calculated. A total of 2738 injuries during 6010 matches were registered. There were no associations between odds of 1 injury occurrence and match result or type of competition, whereas the odds were decreased in matches played away compared with home matches (OR, 0.89; 95% CI, 0.80-0.99). The odds of 2 or more injury occurrences in a match were increased in matches resulting in a draw (OR, 1.39; 95% CI, 1.15-1.69) or loss (OR, 1.66; 95% CI, 1.38-1.98) compared with matches won and were decreased in other cup matches compared with league matches (OR, 0.57; 95% CI, 0.39-0.84) and in matches played away compared with home matches (OR, 0.70; 95% CI, 0.60-0.82). Finally, injuries with more than 1 week's absence occurred more frequently in Champions League matches compared with league matches both for matches with 1 injury (OR, 1.26; 95% CI, 1.09-1.45) and matches with 2 or more injuries (OR, 1.57; 95% CI, 1.13-2.20). The odds of 2 or more injury occurrences in professional soccer were higher in matches resulting in a loss or a draw compared

  1. 45 CFR 1301.20 - Matching requirements.

    Science.gov (United States)

    2010-10-01

    ... Public Welfare Regulations Relating to Public Welfare (Continued) OFFICE OF HUMAN DEVELOPMENT SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES THE ADMINISTRATION FOR CHILDREN, YOUTH AND FAMILIES, HEAD START PROGRAM HEAD START GRANTS ADMINISTRATION Federal Financial Assistance § 1301.20 Matching requirements. (a...

  2. 32 CFR 310.52 - Computer matching publication and review requirements.

    Science.gov (United States)

    2010-07-01

    ... 32 National Defense 2 2010-07-01 2010-07-01 false Computer matching publication and review... OF DEFENSE (CONTINUED) PRIVACY PROGRAM DOD PRIVACY PROGRAM Computer Matching Program Procedures § 310.52 Computer matching publication and review requirements. (a) DoD Components shall identify...

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

    ... HUMAN SERVICES Centers for Medicare & Medicaid Services Privacy Act of 1974; CMS Computer Match No. 2010-03, HHS Computer Match No. 1003, SSA Computer Match No. 1048, IRS Project No. 241 AGENCY: Department... renewal of an existing computer matching program (CMP) that has an expiration date of June 30, 2010...

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

    Science.gov (United States)

    2013-08-07

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

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

    Directory of Open Access Journals (Sweden)

    Abbas S. Lokman

    2010-01-01

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

  6. PATTERN MATCHING IN MODELS

    Directory of Open Access Journals (Sweden)

    Cristian GEORGESCU

    2005-01-01

    Full Text Available The goal of this paper is to investigate how such a pattern matching could be performed on models,including the definition of the input language as well as the elaboration of efficient matchingalgorithms. Design patterns can be considered reusable micro-architectures that contribute to anoverall system architecture. Frameworks are also closely related to design patterns. Componentsoffer the possibility to radically change the behaviors and services offered by an application bysubstitution or addition of new components, even a long time after deployment. Software testing isanother aspect of reliable development. Testing activities mainly consist in ensuring that a systemimplementation conforms to its specifications.

  7. Apfel's excellent match

    Science.gov (United States)

    1997-01-01

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

  8. Where is the match?

    OpenAIRE

    Alba Avilés, Manuel

    2015-01-01

    WhereIsTheMatch is a very ambitious project that consists of developing my own social network mobile app for Android. This app is focused on easily finding people and places to play sports. The main idea of this project is create a first step to a final product and my own developing style. I knew from the beginning that this would be a very hard and a very demanding task because of the several areas that are involved in the development of a mobile app, such as database implementation, interfa...

  9. Outsourced pattern matching

    DEFF Research Database (Denmark)

    Faust, Sebastian; Hazay, Carmit; Venturi, Daniele

    2013-01-01

    on concrete and important functionalities and give the first protocol for the pattern matching problem in the cloud. Loosely speaking, this problem considers a text T that is outsourced to the cloud S by a client C T . In a query phase, clients C 1, …, C l run an efficient protocol with the server S...... that contain confidential data (e.g., health related data about patient history). Our constructions offer simulation-based security in the presence of semi-honest and malicious adversaries (in the random oracle model) and limit the communication in the query phase to O(m) bits plus the number of occurrences...

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

    Science.gov (United States)

    2013-07-15

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

  11. Generalized Orthogonal Matching Pursuit

    CERN Document Server

    Wang, Jian; Shim, Byonghyo

    2011-01-01

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

  12. Stinging Insect Matching Game

    Science.gov (United States)

    ... Education Center Fellows-in-Training Grants & Awards Program Directors Practice Resources ASTHMA IQ Consultation and Referral Guidelines Practice Financial Survey Practice Tools Running a Practice Statements and Practice Parameters About AAAAI Advocacy Allergist / Immunologists: ...

  13. A lightweight, flow-based toolkit for parallel and distributed bioinformatics pipelines

    Directory of Open Access Journals (Sweden)

    Cieślik Marcin

    2011-02-01

    Full Text Available Abstract Background Bioinformatic analyses typically proceed as chains of data-processing tasks. A pipeline, or 'workflow', is a well-defined protocol, with a specific structure defined by the topology of data-flow interdependencies, and a particular functionality arising from the data transformations applied at each step. In computer science, the dataflow programming (DFP paradigm defines software systems constructed in this manner, as networks of message-passing components. Thus, bioinformatic workflows can be naturally mapped onto DFP concepts. Results To enable the flexible creation and execution of bioinformatics dataflows, we have written a modular framework for parallel pipelines in Python ('PaPy'. A PaPy workflow is created from re-usable components connected by data-pipes into a directed acyclic graph, which together define nested higher-order map functions. The successive functional transformations of input data are evaluated on flexibly pooled compute resources, either local or remote. Input items are processed in batches of adjustable size, all flowing one to tune the trade-off between parallelism and lazy-evaluation (memory consumption. An add-on module ('NuBio' facilitates the creation of bioinformatics workflows by providing domain specific data-containers (e.g., for biomolecular sequences, alignments, structures and functionality (e.g., to parse/write standard file formats. Conclusions PaPy offers a modular framework for the creation and deployment of parallel and distributed data-processing workflows. Pipelines derive their functionality from user-written, data-coupled components, so PaPy also can be viewed as a lightweight toolkit for extensible, flow-based bioinformatics data-processing. The simplicity and flexibility of distributed PaPy pipelines may help users bridge the gap between traditional desktop/workstation and grid computing. PaPy is freely distributed as open-source Python code at http://muralab.org/PaPy, and

  14. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Winicour Jeffrey

    2009-04-01

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

  15. Matching with Commitments

    CERN Document Server

    Costello, Kevin; Tripathi, Pushkar

    2012-01-01

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

  16. The earliest matches.

    Directory of Open Access Journals (Sweden)

    Naama Goren-Inbar

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

  17. The earliest matches.

    Science.gov (United States)

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

    2012-01-01

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

  18. Optimizing Transmission Line Matching Circuits

    OpenAIRE

    Novak, S.

    1996-01-01

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

  19. INFORMATION SYSTEMS AUDIT CURRICULA CONTENT MATCHING

    Directory of Open Access Journals (Sweden)

    Vasile-Daniel CARDOȘ

    2014-11-01

    Full Text Available Financial and internal auditors must cope with the challenge of performing their mission in technology enhanced environment. In this article we match the information technology description found in the International Federation of Accountants (IFAC and the Institute of Internal Auditors (IIA curricula against the Model Curriculum issued by the Information Systems Audit and Control Association (ISACA. By reviewing these three curricula, we matched the content in the ISACA Model Curriculum with the IFAC International Education Practice Statement 2 and the IIAs’ Global Model Internal Audit Curriculum. In the IFAC and IIA Curriculum there are 16 content elements, out of 19 possible, which match, in their description, the ISACA Model Curriculum’s content. We noticed that a candidate who graduates an IFAC or IIA compliant program acquire IS auditing competences similar to the specific content of the ISACA model curriculum but less than the requirements for a professional information systems auditor.

  20. Flow-Based Systems for Rapid and High-Precision Enzyme Kinetics Studies

    Directory of Open Access Journals (Sweden)

    Supaporn Kradtap Hartwell

    2012-01-01

    Full Text Available Enzyme kinetics studies normally focus on the initial rate of enzymatic reaction. However, the manual operation of steps of the conventional enzyme kinetics method has some drawbacks. Errors can result from the imprecise time control and time necessary for manual changing the reaction cuvettes into and out of the detector. By using the automatic flow-based analytical systems, enzyme kinetics studies can be carried out at real-time initial rate avoiding the potential errors inherent in manual operation. Flow-based systems have been developed to provide rapid, low-volume, and high-precision analyses that effectively replace the many tedious and high volume requirements of conventional wet chemistry analyses. This article presents various arrangements of flow-based techniques and their potential use in future enzyme kinetics applications.

  1. 34 CFR 74.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-07-01

    ... INSTITUTIONS OF HIGHER EDUCATION, HOSPITALS, AND OTHER NON-PROFIT ORGANIZATIONS Post-Award Requirements Financial and Program Management § 74.23 Cost sharing or matching. (a) All contributions, including cash and... 34 Education 1 2010-07-01 2010-07-01 false Cost sharing or matching. 74.23 Section 74.23...

  2. An HLA matched donor! An HLA matched donor? What do you mean by: HLA matched donor?

    Science.gov (United States)

    van Rood, J J; Oudshoorn, M

    1998-07-01

    The term 'an HLA matched donor' is in general used without giving exact information on the level of resolution of the HLA typing. This can lead to misunderstandings. A proposal is formulated to agree on using six match categories according to the HLA typing technique used to indicate the level of confidence of the matching.

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

  4. Characteristic Evolution and Matching

    Directory of Open Access Journals (Sweden)

    Jeffrey Winicour

    2012-01-01

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

  5. Quantum image matching

    Science.gov (United States)

    Jiang, Nan; Dang, Yijie; Wang, Jian

    2016-09-01

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

  6. Synoname: The Getty's New Approach to Pattern Matching for Personal Names.

    Science.gov (United States)

    Siegfried, Susan L.; Bernstein, Julie

    1991-01-01

    Describes "Synoname," the Getty Museum's computer program that matches varying versions of personal names for research purposes. Reports that the program uses an ordered algorithm sequence for pattern matching that includes both character- and word-matching techniques. Concludes that the technique can approach near-total accuracy at the…

  7. 22 CFR 518.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-04-01

    ... AGREEMENTS WITH INSTITUTIONS OF HIGHER EDUCATION, HOSPITALS, AND OTHER NON-PROFIT ORGANIZATIONS Post-Award Requirements Financial and Program Management § 518.23 Cost sharing or matching. (a) All...

  8. 45 CFR 2543.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-10-01

    ... SERVICE GRANTS AND AGREEMENTS WITH INSTITUTIONS OF HIGHER EDUCATION, HOSPITALS, AND OTHER NON-PROFIT ORGANIZATIONS Post-Award Requirements Financial and Program Management § 2543.23 Cost sharing or matching....

  9. Communication in the Home and Classroom: Match or Mismatch?

    Science.gov (United States)

    Iglesias, Aquiles

    1985-01-01

    The article examines variations in communication of cultural-linguistic minority children at home and in school and describes a communicative match/mismatch model. Implications of educational policy and program development are noted. (CL)

  10. 22 CFR 226.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-04-01

    ...-GOVERNMENTAL ORGANIZATIONS Post-award Requirements Financial and Program Management § 226.23 Cost sharing or... classroom supplies. Value assessed to donated supplies included in the cost sharing or matching share shall...

  11. 28 CFR 70.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-07-01

    ... OTHER NON-PROFIT ORGANIZATIONS Post-Award Requirements Financial and Program Management § 70.23 Cost... and classroom supplies. Value assessed to donated supplies included in the cost sharing or matching...

  12. 36 CFR 1210.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-07-01

    ... Program Management § 1210.23 Cost sharing or matching. (a) All contributions, including cash and third... supplies, laboratory supplies or workshop and classroom supplies. Value assessed to donated supplies...

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

  14. Real-Time and Resilient Intrusion Detection: A Flow-Based Approach

    NARCIS (Netherlands)

    Hofstede, Rick; Pras, Aiko

    2012-01-01

    Flow-based intrusion detection will play an important role in high-speed networks, due to the stringent performance requirements of packet-based solutions. Flow monitoring technologies, such as NetFlow or IPFIX, aggregate individual packets into flows, requiring new intrusion detection algorithms to

  15. Real-Time and Resilient Intrusion Detection: A Flow-Based Approach

    NARCIS (Netherlands)

    Hofstede, Rick; Pras, Aiko

    2012-01-01

    Due to the demanding performance requirements of packet-based monitoring solutions on network equipment, flow-based intrusion detection systems will play an increasingly important role in current high-speed networks. The required technologies are already available and widely deployed: NetFlow and th

  16. Control Synthesis for the Flow-Based Microfluidic Large-Scale Integration Biochips

    DEFF Research Database (Denmark)

    Minhass, Wajid Hassan; Pop, Paul; Madsen, Jan

    2013-01-01

    In this paper we are interested in flow-based microfluidic biochips, which are able to integrate the necessary functions for biochemical analysis on-chip. In these chips, the flow of liquid is manipulated using integrated microvalves. By combining severalmicrovalves, more complex units...

  17. Development of substance flow based Life Cycle Assessment tool for sewage sludge treatment and disposal

    DEFF Research Database (Denmark)

    Yoshida, Hiroko; Clavreul, Julie; Scheutz, Charlotte

    Life Cycle Assessment (LCA) is a method to quantify environmental impacts of products or systems. It is often done by correlating material and energy demands with certain input characteristics. An attempt was made to evaluate the robustness of the substance flow based LCA for wastewater and sludge...

  18. Using ImageJ for the quantitative analysis of flow-based adhesion assays in real-time under physiologic flow conditions.

    Science.gov (United States)

    Meyer dos Santos, Sascha; Klinkhardt, Ute; Schneppenheim, Reinhard; Harder, Sebastian

    2010-01-01

    This article intends to close the gap between the abundance of regular articles focusing on adhesive mechanisms of cells in a flow field and purely technical reports confined to the description of newly developed algorithms, not yet ready to be used by users without programming skills. A simple and robust method is presented for analysing raw videomicroscopic data of flow-based adhesion assays using the freely available public domain software ImageJ. We describe in detail the image processing routines used to rapidly and reliably evaluate the number of adherent and translocating platelets in videomicroscopic recordings. The depicted procedures were exemplified by analysing platelet interaction with immobilized von Willebrand factor and fibrinogen in flowing blood under physiological wall shear rates. Neutralizing GPIbalpha function reduced shear-dependent platelet translocation on von Willebrand factor and abolished firm platelet adhesion. Abciximab, Tirofiban and Eptifibatide completely inhibited GPIIb/IIIa-dependent stable platelet deposition on fibrinogen. The presented method to analyse videomicroscopic recordings from flow-based adhesion assays offers the advantage of providing a simple and reliable way to quantify flow-based adhesion assays, which is completely based on ImageJ and can easily be applied to study adhesion mechanisms of cells in non-fluorescent modes without the need to deviate from the presented protocol.

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

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

    Directory of Open Access Journals (Sweden)

    KATHERINE J. HOOT

    2014-08-01

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

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

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

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

    Science.gov (United States)

    Sue, Gloria R; Narayan, Deepak

    2013-08-01

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

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

  5. Matching conditions in relativistic astrophysics

    CERN Document Server

    Quevedo, Hernando

    2012-01-01

    We present an exact electrovacuum solution of Einstein-Maxwell equations with infinite sets of multipole moments which can be used to describe the exterior gravitational field of a rotating charged mass distribution. We show that in the special case of a slowly rotating and slightly deformed body, the exterior solution can be matched to an interior solution belonging to the Hartle-Thorne family of approximate solutions. To search for exact interior solutions, we propose to use the derivatives of the curvature eigenvalues to formulate a $C^3-$matching condition from which the minimum radius can be derived at which the matching of interior and exterior spacetimes can be carried out. We prove the validity of the $C^3-$matching in the particular case of a static mass with a quadrupole moment. The corresponding interior solution is obtained numerically and the matching with the exterior solution gives as a result the minimum radius of the mass configuration.

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

  7. An efficient flow-based botnet detection using supervised machine learning

    DEFF Research Database (Denmark)

    Stevanovic, Matija; Pedersen, Jens Myrup

    2014-01-01

    Botnet detection represents one of the most crucial prerequisites of successful botnet neutralization. This paper explores how accurate and timely detection can be achieved by using supervised machine learning as the tool of inferring about malicious botnet traffic. In order to do so, the paper...... introduces a novel flow-based detection system that relies on supervised machine learning for identifying botnet network traffic. For use in the system we consider eight highly regarded machine learning algorithms, indicating the best performing one. Furthermore, the paper evaluates how much traffic needs...... to accurately and timely detect botnet traffic using purely flow-based traffic analysis and supervised machine learning. Additionally, the results show that in order to achieve accurate detection traffic flows need to be monitored for only a limited time period and number of packets per flow. This indicates...

  8. Enhanced Tunneling Technique for Flow-Based Fast Handover in Proxy Mobile Ipv6 Networks

    Directory of Open Access Journals (Sweden)

    Yunes Abdussalam Amgahd

    2016-10-01

    Full Text Available In the Mobile IPv6 network, each node is highly mobile and handoff is a very common process. When not processed efficiently, the handoff process may result in large amount of packet loss. If the handover process is performed without appropriate connection verification and through specified tunnels, then this may result in inappropriate traffic flow since the required traffic redirection may not happen in this case. To overcome these issues, we propose to develop an Enhanced Tunneling Technique for Flow-based Fast Handover in Proxy Mobile IPv6 Networks. In this technique, the packets are buffered to minimize the packet loss during handover and then the Flow based Fast Handover techique is employed to ensure that the traffic is redirected to the new subnet after handover process. Thus ensuring efficient network operation.

  9. Architectural Synthesis of Flow-Based Microfluidic Large-Scale Integration Biochips

    DEFF Research Database (Denmark)

    Minhass, Wajid Hassan; Pop, Paul; Madsen, Jan

    2012-01-01

    Microfluidic biochips are replacing the conventional biochemical analyzers and are able to integrate the necessary functions for biochemical analysis on-chip. In this paper we are interested in flow-based biochips, in which the flow of liquid is manipulated using integrated microvalves......,we propose a top-down architectural synthesis methodology for the flow-based biochips. Starting from a given biochemical application and a microfluidic component library, we are interested in synthesizing a biochip architecture, i.e., performing component allocation from the library based on the biochemical...... application, generating the biochip schematic (netlist) and then performing physical synthesis (deciding the placement of the microfluidic components on the chip and performing routing of the microfluidic channels), such that the application completion time is minimized. We evaluate our proposed approach...

  10. A Fractional-Flow Based Compressible Multiphase Flow Model with Newly Proposed Constitutive Retentions

    Science.gov (United States)

    Tsai, C.; Yeh, G.

    2011-12-01

    In this investigation, newly proposed constitutive retentions are implemented to a fractional-flow based compressible multiphase-phase flow model. With the new model, a compressible three-phase (water, non-aqueous phase liquid (NAPL) and air) flow problem is simulated. In fractional-flow approaches, the three mass balance equations written in terms of three phase pressures are transformed to those in terms of the total pressure, saturation of water, and saturation of total liquid. These three governing equations are discretized with the Galerkin finite element method (FEM). The resulted matrix equation is solved with Bi-CGSTAB. Several numerical experiments are presented to examine the accuracy and robustness of the proposed model. The results show the presented fractional-flow based multiphase flow model is feasible and yields physically realistic solutions for compressible three-phase flow problems in porous media.

  11. System-Level Modeling and Synthesis of Flow-Based Microfluidic Biochips

    DEFF Research Database (Denmark)

    Minhass, Wajid Hassan; Pop, Paul; Madsen, Jan

    2011-01-01

    Microfluidic biochips are replacing the conventional biochemical analyzers and are able to integrate the necessary functions for biochemical analysis on-chip. There are several types of microfluidic biochips, each having its advantages and limitations. In this paper we are interested in flow......-based biochips, in which the flow of liquid is manipulated using integrated microvalves. By combining several microvalves, more complex units, such as micropumps, switches, mixers, and multiplexers, can be built. Although researchers have proposed significant work on the system-level synthesis of droplet......-based biochips, which manipulate droplets on a two-dimensional array of electrodes, no research on system-level synthesis of flow-based biochips has been reported so far. The focus has been on application modeling and component-level simulation. Therefore, for the first time to our knowledge, we propose a system...

  12. Statistical methods for history matching

    DEFF Research Database (Denmark)

    Johansen, Kent

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

  13. Pattern Matching in Multiple Streams

    CERN Document Server

    Clifford, Raphael; Porat, Ely; Sach, Benjamin

    2012-01-01

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

  14. Design Pattern Mining Using Graph Matching

    Institute of Scientific and Technical Information of China (English)

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

    2004-01-01

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

  15. Development of substance flow based Life Cycle Assessment tool for sewage sludge treatment and disposal

    DEFF Research Database (Denmark)

    Yoshida, Hiroko; Clavreul, Julie; Scheutz, Charlotte;

    Life Cycle Assessment (LCA) is a method to quantify environmental impacts of products or systems. It is often done by correlating material and energy demands with certain input characteristics. An attempt was made to evaluate the robustness of the substance flow based LCA for wastewater and sludge...... treatment processes correlate sufficiently with the solids content of wastewater influent, while energy use correlates with the total input volume. However, the correlations appeared to be stronger when individual treatment processes were separately analysed....

  16. A fully automated flow-based approach for accelerated peptide synthesis.

    Science.gov (United States)

    Mijalis, Alexander J; Thomas, Dale A; Simon, Mark D; Adamo, Andrea; Beaumont, Ryan; Jensen, Klavs F; Pentelute, Bradley L

    2017-05-01

    Here we report a fully automated, flow-based approach to solid-phase polypeptide synthesis, with amide bond formation in 7 seconds and total synthesis times of 40 seconds per amino acid residue. Crude peptide purities and isolated yields were comparable to those for standard-batch solid-phase peptide synthesis. At full capacity, this approach can yield tens of thousands of individual 30-mer peptides per year.

  17. A DFT Scheme for Pneumatic Control Logic in Flow-based Biochips

    OpenAIRE

    Potluri, Seetal; Pop, Paul; Madsen, Jan

    2016-01-01

    Microfluidic flow-based biochips help perform biochemistry at miniaturized scales, thus enabling cost, performance and other benefits. Although biochips are expected to replace biochemical labs, including point-of-care devices, the off-chip pressure actuators and pumps are bulky, thereby limiting them to laboratory environments. To address this issue, recent work has focused on reducing the number of off-chip pressure sources, using on-chip pneumatic control logic circuits fabricated using th...

  18. 49 CFR 173.186 - Matches.

    Science.gov (United States)

    2010-10-01

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

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

  20. Faculty Development: A Stage Model Matched to Blended Learning Maturation

    Science.gov (United States)

    Fetters, Michael L.; Duby, Tova Garcia

    2011-01-01

    Faculty development programs are critical to the implementation and support of curriculum innovation. In this case study, the authors present lessons learned from ten years of experience in faculty development programs created to support innovation in technology enhanced learning. Stages of curriculum innovation are matched to stages of faculty…

  1. Approximate Matching of Hierarchial Data

    DEFF Research Database (Denmark)

    Augsten, Nikolaus

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

  2. Matched Spectral Filter Imager Project

    Data.gov (United States)

    National Aeronautics and Space Administration — OPTRA proposes the development of an imaging spectrometer for greenhouse gas and volcanic gas imaging based on matched spectral filtering and compressive imaging....

  3. An Efficient Pattern Matching Algorithm

    Science.gov (United States)

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

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

  4. Review og pattern matching approaches

    DEFF Research Database (Denmark)

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

    1996-01-01

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

  5. Matching isotopic distributions from metabolically labeled samples.

    Science.gov (United States)

    McIlwain, Sean; Page, David; Huttlin, Edward L; Sussman, Michael R

    2008-07-01

    In recent years stable isotopic labeling has become a standard approach for quantitative proteomic analyses. Among the many available isotopic labeling strategies, metabolic labeling is attractive for the excellent internal control it provides. However, analysis of data from metabolic labeling experiments can be complicated because the spacing between labeled and unlabeled forms of each peptide depends on its sequence, and is thus variable from analyte to analyte. As a result, one generally needs to know the sequence of a peptide to identify its matching isotopic distributions in an automated fashion. In some experimental situations it would be necessary or desirable to match pairs of labeled and unlabeled peaks from peptides of unknown sequence. This article addresses this largely overlooked problem in the analysis of quantitative mass spectrometry data by presenting an algorithm that not only identifies isotopic distributions within a mass spectrum, but also annotates matches between natural abundance light isotopic distributions and their metabolically labeled counterparts. This algorithm is designed in two stages: first we annotate the isotopic peaks using a modified version of the IDM algorithm described last year; then we use a probabilistic classifier that is supplemented by dynamic programming to find the metabolically labeled matched isotopic pairs. Such a method is needed for high-throughput quantitative proteomic metabolomic experiments measured via mass spectrometry. The primary result of this article is that the dynamic programming approach performs well given perfect isotopic distribution annotations. Our algorithm achieves a true positive rate of 99% and a false positive rate of 1% using perfect isotopic distribution annotations. When the isotopic distributions are annotated given 'expert' selected peaks, the same algorithm gets a true positive rate of 77% and a false positive rate of 1%. Finally, when annotating using machine selected peaks, which

  6. Path following algorithm for the graph matching problem

    CERN Document Server

    Zaslavskiy, Mikhail; Vert, Jean-Philippe

    2008-01-01

    We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We therefore construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore to perform labeled graph matching. The algorithm is compared with some of t...

  7. Does Educational Preparation Match Professional Practice: The Case of Higher Education Policy Analysts

    Science.gov (United States)

    Arellano, Eduardo C.; Martinez, Mario C.

    2009-01-01

    This study compares the extent to which higher education policy analysts and master's and doctoral faculty of higher education and public affairs programs match on a set of competencies thought to be important to higher education policy analysis. Analysts matched master's faculty in three competencies while analysts and doctoral faculty matched in…

  8. Defining the XML schema matching problem for a personal schema based query answering system

    NARCIS (Netherlands)

    Smiljanic, Marko; Keulen, van Maurice; Jonker, Willem

    2004-01-01

    In this report, we analyze the problem of personal schema matching. We define the ingredients of the XML schema matching problem using constraint logic programming. This allows us to thourougly investigate specific matching problems. We do not have the ambition to provide for a formalism that covers

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

    Science.gov (United States)

    2011-08-09

    ... AND COMMUNITY SERVICE Computer Matching and Privacy Protection Act of 1988 AGENCY: Corporation for National and Community Service. ACTION: Notice of new computer matching program between the Corporation for... Privacy Act of 1974 (5 U.S.C. 552a), as amended by the Computer Matching and Privacy Protection Act...

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

  11. Fingerprint Matching and Non-Matching Analysis for Different Tolerance Rotation Degrees in Commercial Matching Algorithms

    Directory of Open Access Journals (Sweden)

    A. J. Perez-Diaz

    2010-08-01

    Full Text Available Fingerprint verification is the most important step in the fingerprint-based biometric systems. The matching score islinked to the chance of identifying a person. Nowadays, two fingerprint matching methods are the most popular: thecorrelation-based method and the minutiae-based method. In this work, three biometric systems were evaluated:Neurotechnology Verifinger 6.0 Extended, Innovatrics IDKit SDK and Griaule Fingerprint SDK 2007. The evaluationwas performed according to the experiments of the Fingerprint Verification Competition (FVC. The influence of thefingerprint rotation degrees on false match rate (FMR and false non-match rate (FNMR was evaluated. The resultsshowed that the FMR values increase as rotation degrees increase too, meanwhile, the FNMR values decrease.Experimental results demonstrate that Verifinger SDK shows good performance on false non-match testing, with anFNMR mean of 7%, followed by IDKit SDK (6.71% ~ 13.66% and Fingerprint SDK (50%. However, Fingerprint SDKdemonstrates a better performance on false match testing, with an FMR mean of ~0%, followed by Verifinger SDK(7.62% - 9% and IDKit SDK (above 28%. As result of the experiments, Verifinger SDK had, in general, the bestperformance. Subsequently, we calculated the regression functions to predict the behavior of FNMR and FMR fordifferent threshold values with different rotation degrees.

  12. Understanding Y haplotype matching probability.

    Science.gov (United States)

    Brenner, Charles H

    2014-01-01

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

  13. Matching illumination of solid objects.

    Science.gov (United States)

    Pont, Sylvia C; Koenderink, Jan J

    2007-04-01

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

  14. Mystery behind the match: an undergraduate medical education–graduate medical education collaborative approach to understanding match goals and outcomes

    Directory of Open Access Journals (Sweden)

    Alisa Nagler

    2016-09-01

    Full Text Available Background: There is a paucity of information regarding institutional targets for the number of undergraduate medical education (UME graduates being matched to graduate medical education (GME programs at their home institutions. At our institution, the Duke University, the number of UME graduates matched to GME programs declined dramatically in 2011. To better understand why this decline may have happened, we sought to identify perceived quality metrics for UME and GME learners, evaluate trends in match outcomes and educational program characteristics, and explore whether there is an ideal retention rate for UME graduates in their home institutions’ GME programs. Methods: We analyzed the number of Duke University UME graduates remaining at Duke for GME training over the past 5 years. We collected data to assess for changing characteristics of UME and GME, and performed descriptive analysis of trends over time to investigate the potential impact on match outcomes. Results: A one-sample t-test analysis showed no statistically significant difference in the number of Duke UME graduates who stayed for GME training. For both UME and GME, no significant changes in the characteristics of either program were found. Discussion: We created a process for monitoring data related to the characteristics or perceived quality of UME and GME programs and developed a shared understanding of what may impact match lists for both UME graduates and GME programs, leaving the Match somewhat less mysterious. While we understand the trend of graduates remaining at their home institutions for GME training, we are uncertain whether setting a goal for retention is reasonable, and so some mystery remains. We believe there is an invaluable opportunity for collaboration between UME and GME stakeholders to facilitate discussion about setting shared institutional goals.

  15. Approximating Graphic TSP by Matchings

    CERN Document Server

    Mömke, Tobias

    2011-01-01

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

  16. A Pin-Count Reduction Algorithm for Flow-Based Microfluidic Biochips

    DEFF Research Database (Denmark)

    Schneider, Alexander Rüdiger; Pop, Paul; Madsen, Jan

    2016-01-01

    Microfluidic biochips are replacing the conventional biochemical analyzers integrating the necessary functions on-chip. We are interested in flow-based biochips, where a continuous flow of liquid is manipulated using integrated microvalves, controlled from external pressure sources via off......-chip control pins. Recent research has addressed the physical design of such biochips. However, such research has so far ignored the pin-count, which rises with the increase in the number of microvalves. Given a biochip architecture and a biochemical application, we propose an algorithm for reducing the number...

  17. A power flow based model for the analysis of vulnerability in power networks

    Science.gov (United States)

    Wang, Zhuoyang; Chen, Guo; Hill, David J.; Dong, Zhao Yang

    2016-10-01

    An innovative model which considers power flow, one of the most important characteristics in a power system, is proposed for the analysis of power grid vulnerability. Moreover, based on the complex network theory and the Max-Flow theorem, a new vulnerability index is presented to identify the vulnerable lines in a power grid. In addition, comparative simulations between the power flow based model and existing models are investigated on the IEEE 118-bus system. The simulation results demonstrate that the proposed model and the index are more effective in power grid vulnerability analysis.

  18. Error-tolerant Tree Matching

    CERN Document Server

    Oflazer, K

    1996-01-01

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

  19. Memristor-based pattern matching

    Science.gov (United States)

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

    2014-10-01

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

  20. Relaxation matching algorithm for moving photogrammetry

    Science.gov (United States)

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

    2015-02-01

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

  1. Towards optimal packed string matching

    DEFF Research Database (Denmark)

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

    2014-01-01

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

  2. Matchings with Externalities and Attitudes

    DEFF Research Database (Denmark)

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

    2013-01-01

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

  3. Fuzzy private matching (extended abstract)

    NARCIS (Netherlands)

    Chmielewski, L.; Hoepman, J.H.

    2008-01-01

    In the private matching problem, a client and a server each hold a set of n input elements. The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all. In certain

  4. An Implementation of Bigraph Matching

    DEFF Research Database (Denmark)

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

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

  5. Matching of equivalent field regions

    DEFF Research Database (Denmark)

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

    2005-01-01

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

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

  7. Template Matching on Parallel Architectures,

    Science.gov (United States)

    1985-07-01

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

  8. Monetary Exchange with Multilateral Matching

    DEFF Research Database (Denmark)

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

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

  9. Duplicate-based Schema Matching

    OpenAIRE

    Bilke, Alexander

    2007-01-01

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

  10. Matching Games with Additive Externalities

    DEFF Research Database (Denmark)

    Branzei, Simina; Michalak, Tomasz; Rahwan, Talal

    2012-01-01

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

  11. On String Matching with Mismatches

    Directory of Open Access Journals (Sweden)

    Marius Nicolae

    2015-05-01

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

  12. Otolaryngology externships and the match: Productive or futile?

    Science.gov (United States)

    Thomas, Carissa M; Cabrera-Muffly, Cristina

    2017-10-01

    The objectives of this study were to summarize externship experiences among recent graduates and current residents in otolaryngology residency programs and determine whether externships affect the match process. Cross-sectional survey. A survey was distributed to otolaryngology residents in allopathic US residency programs and otolaryngology graduates from the past 5 years (2011-2015). There were 2,141 surveys distributed. There were 654 subjects who responded, for a 30.5% response rate. Most respondents were residents (n = 438, 67%). Of the residents, 85.6% had completed at least one externship compared to 75.9% of graduates (P = .002). The most common reasons for selecting a particular externship were geographic location (74.2%) and program reputation (71.1%), whereas the most common reason for not completing an externship was being advised not to (59.1%). Furthermore, 82.6% of respondents received at least one interview from their externships, 90% went to those interviews, and 89.1% reported that externship experiences affected their rank list. Respondents had a 32.7% match rate to the externship residency program if it was ranked versus a 48.8% match rate if the program was ranked first. Respondents who matched at the externship residency program matched higher on their rank list (P < .001). Of the respondents, 90.7% found externships to be valuable, and 74.5% recommended completing one. Externships are beneficial because they influence the rank list of applicants and are viewed as valuable experiences. Completing an externship is advisable for the experience, but applicants should weigh the benefits versus the possible risk of being judged more harshly during a month-long rotation. NA Laryngoscope, 127:2242-2246, 2017. © 2017 The American Laryngological, Rhinological and Otological Society, Inc.

  13. Incremental pattern matching for regular expressions

    NARCIS (Netherlands)

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

    2012-01-01

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

  14. Optical flow based deformable volume registration using a novel second-order regularization prior

    Science.gov (United States)

    Grbić, Saša; Urschler, Martin; Pock, Thomas; Bischof, Horst

    2010-03-01

    Nonlinear image registration is an initial step for a large number of medical image analysis applications. Optical flow based intensity registration is often used for dealing with intra-modality applications involving motion differences. In this work we present an energy functional which uses a novel, second-order regularization prior of the displacement field. Compared to other methods our scheme is robust to non-Gaussian noise and does not penalize locally affine deformation fields in homogeneous areas. We propose an efficient and stable numerical scheme to find the minimizer of the presented energy. We implemented our algorithm using modern consumer graphics processing units and thereby increased the execution performance dramatically. We further show experimental evaluations on clinical CT thorax data sets at different breathing states and on dynamic 4D CT cardiac data sets.

  15. Regional Prediction of Impending Debris Flow Based on Doppler Weather Radar

    Institute of Scientific and Technical Information of China (English)

    JIANG Yuhong; WEI Fangqiang; ZHANG Jinghong; GU Linkang; DENG Bo; LIU Hongjiang

    2007-01-01

    Debris flow prediction is one of the important means to reduce the loss caused by debris flow. This paper built a regional prediction model of impending debris flow based on regional environmentalbackground (including topography, geology, land use, and etc.), rainfalland debris flow data. A system of regional prediction of impending debris flow was set up on ArcGIS 9.0 platform according to the model.The system used forecast precipitation data of Doppler weather radarand observational precipitation data as its input data. It could provide aprediction about the possibility of debris flow one to three hours beforeit happened, and was put into use in Liangshan Meteorological Observatory in Sichuan province in the monsoon of 2006.

  16. "Living in sin" and marriage : A matching model

    NARCIS (Netherlands)

    Sahib, PR; Gu, XH

    2002-01-01

    This paper develops a two sided matching model of premarital cohabitation and marriage in which premarital cohabitation serves as a period of learning. We solve for the optimal policy to be followed by individuals by treating the model as a three stage dynamic programming problem. We find that coupl

  17. "Living in sin" and marriage : a matching model

    NARCIS (Netherlands)

    Rao Sahib, P. Padma; Gu, X. Xinhua

    1999-01-01

    This paper develops a two sided matching model of premarital cohabitation and marriage in which premarital cohabitation serves as a period of learning. We solve for the optimal policy to be followed by individuals by treating the model as a three stage dynamic programming problem. We find that coupl

  18. 34 CFR 661.40 - What are the matching requirements?

    Science.gov (United States)

    2010-07-01

    ... 34 Education 3 2010-07-01 2010-07-01 false What are the matching requirements? 661.40 Section 661.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION BUSINESS AND INTERNATIONAL EDUCATION PROGRAM What...

  19. "Living in sin" and marriage : A matching model

    NARCIS (Netherlands)

    Sahib, PR; Gu, XH

    This paper develops a two sided matching model of premarital cohabitation and marriage in which premarital cohabitation serves as a period of learning. We solve for the optimal policy to be followed by individuals by treating the model as a three stage dynamic programming problem. We find that

  20. "Living in sin" and marriage : a matching model

    NARCIS (Netherlands)

    Rao Sahib, P. Padma; Gu, X. Xinhua

    1999-01-01

    This paper develops a two sided matching model of premarital cohabitation and marriage in which premarital cohabitation serves as a period of learning. We solve for the optimal policy to be followed by individuals by treating the model as a three stage dynamic programming problem. We find that

  1. Model-reduced gradient-based history matching

    NARCIS (Netherlands)

    Kaleta, M.P.; Hanea, R.G.; Heemink, A.W.; Jansen, J.D.

    2010-01-01

    Gradient-based history matching algorithms can be used to adapt the uncertain parameters in a reservoir model using production data. They require, however, the implementation of an adjoint model to compute the gradients, which is usually an enormous programming effort. We propose a new approach to g

  2. 40 CFR 30.23 - Cost sharing or matching.

    Science.gov (United States)

    2010-07-01

    ..., HOSPITALS, AND OTHER NON-PROFIT ORGANIZATIONS Post-Award Requirements Financial and Program Management § 30... accordance with the applicable cost principles. If, after consultation with Agency property management... classroom supplies. Value assessed to donated supplies included in the cost sharing or matching share shall...

  3. Outplacement: Meeting Needs, Matching Services.

    Science.gov (United States)

    Simon, Donald R.

    1988-01-01

    Describes outplacement services as including such services and information as (1) financial and career counseling, (2) connections with established training programs and resources in the community, and (3) workshops to teach business start-up skills (although at different levels depending upon program costs). Includes questions to ask potential…

  4. Outplacement: Meeting Needs, Matching Services.

    Science.gov (United States)

    Simon, Donald R.

    1988-01-01

    Describes outplacement services as including such services and information as (1) financial and career counseling, (2) connections with established training programs and resources in the community, and (3) workshops to teach business start-up skills (although at different levels depending upon program costs). Includes questions to ask potential…

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

    Directory of Open Access Journals (Sweden)

    Gloria R. Sue, MA

    2013-08-01

    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.

  6. The effort and outcomes of the Pediatric Surgery match process: Are we interviewing too many?

    Science.gov (United States)

    Gadepalli, Samir K; Downard, Cynthia D; Thatch, Keith A; Islam, Saleem; Azarow, Kenneth S; Chen, Mike K; Lillehei, Craig W; Puligandla, Pramod S; Reynolds, Marleta; Waldhausen, John H; Oldham, Keith T; Langham, Max R; Tracy, Thomas F; Hirschl, Ronald B

    2015-11-01

    Increasing numbers of programs participating in the pediatric surgery match has resulted in economic and logistical issues for candidates, General Surgery residencies, and Pediatric Surgery training programs (PSTP). We sought to determine the ideal number of interviews conducted by programs based on resultant rank order lists (ROL) of matched candidates. PSTPs received 4 online surveys regarding interview practices (2011-2012, 2014), and matched candidate ROL (2008-2010, 2012, 2014). Program directors (PD) also provided estimates regarding minimum candidate interview numbers necessary for an effective match (2011-2012, 2014). Kruskal-Wallis equality-of-populations rank tests compared ROL and interview numbers conducted. Quartile regression predicted ROL based on the interview numbers. Wilcoxon signed rank-sum tests compared the interview numbers to the minimal interview number using a matched pair. p Values<0.05 were significant. Survey response rates ranged from 85-100%. Median ROL of matched candidates (2-3.5) did not differ between programs (p=0.09) and the lowest matched ROL for any year was 10-12. Interview numbers did not affect the final candidate ROL (p=0.22). While PDs thought the minimum median interview number should be 20, the number actually conducted was significantly higher (p<0.001). These data suggest that PSTPs interview excessive numbers of candidates. Programs and applicants should evaluate mechanisms to reduce interviews to limit costs and effort associated with the match. Copyright © 2015 Elsevier Inc. All rights reserved.

  7. Matching polytopes and Specht modules

    CERN Document Server

    Liu, Ricky Ini

    2009-01-01

    We prove that the dimension of the Specht module of a forest $G$ is the same as the normalized volume of the matching polytope of $G$. We also associate to $G$ a symmetric function $s_G$ (analogous to the Schur symmetric function $s_\\lambda$ for a partition $\\lambda$) and investigate its combinatorial and representation-theoretic properties in relation to the Specht module and Schur module of $G$. We then use this to define notions of standard and semistandard tableaux for forests.

  8. The effect of academic "misrepresentation" on residency match outcomes.

    Science.gov (United States)

    Maverakis, Emanual; Li, Chin-Shang; Alikhan, Ali; Lin, Tzu-Chun; Idriss, Nayla; Armstrong, April W

    2012-01-15

    Studies have uniformly demonstrated misrepresentation of accomplishments by applicants to residency programs; yet it is unknown whether such applicants have a competitive advantage in the MATCH. Herein we identify the factors that influence an applicant's successful selection to a competitive residency. Comparative study of 317 dermatology residency applicants during the 2007 application season. successful matching of an applicant into a U.S. dermatology residency. Factors positively associated with matching in univariate analysis included age (p=0.023); membership, Alpha Omega Alpha honors society (p=0.007); medical school research rank (p=0.013); USMLE scores (p<0.001); and number of unpublished manuscripts (p<0.001). Factors not associated with matching included the number of published manuscripts (p=0.460) and the combined impact factor of all published manuscripts (p=0.490). Multivariate analysis revealed that the USMLE Step 1 score (p=0.001), medical school research rank (p=0.040), and total number of unpublished manuscripts (p=0.046) were significantly associated matching in dermatology. Male gender trended towards but did not reach significance (p=0.054). Applicants that list multiple unpublished manuscripts have a significant competitive advantage in matching into a dermatology residency, even if these manuscripts remain unpublished.

  9. Local Exact Pattern Matching for Non-Fixed RNA Structures.

    Science.gov (United States)

    Amit, Mika; Backofen, Rolf; Heyne, Steffen; Landau, Gad M; Möhl, Mathias; Otto, Christina; Will, Sebastian

    2014-01-01

    Detecting local common sequence-structure regions of RNAs is a biologically important problem. Detecting such regions allows biologists to identify functionally relevant similarities between the inspected molecules. We developed dynamic programming algorithms for finding common structure-sequence patterns between two RNAs. The RNAs are given by their sequence and a set of potential base pairs with associated probabilities. In contrast to prior work on local pattern matching of RNAs, we support the breaking of arcs. This allows us to add flexibility over matching only fixed structures; potentially matching only a similar subset of specified base pairs. We present an O(n(3)) algorithm for local exact pattern matching between two nested RNAs, and an O(n(3) log n) algorithm for one nested RNA and one bounded-unlimited RNA. In addition, an algorithm for approximate pattern matching is introduced that for two given nested RNAs and a number k, finds the maximal local pattern matching score between the two RNAs with at most k mismatches in O(n(3)k(2)) time. Finally, we present an O(n(3)) algorithm for finding the most similar subforest between two nested RNAs.

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

  11. QCD NLO with Powheg matching and top threshold matching in WHIZARD

    CERN Document Server

    Reuter, J; Chokoufe, B; Kilian, W; Stahlhofen, M; Weiss, C

    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.

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

  13. Hybrid Schema Matching for Deep Web

    Science.gov (United States)

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

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

  14. Propensity score matching: A conceptual review for radiology researchers

    Energy Technology Data Exchange (ETDEWEB)

    Baek, Seung Hee; Park, Seong Ho; Park, Yu Rang; Kim, Hwa Jung [Asan Medical Center, University of Ulsan College of Medicine, Seoul (Korea, Republic of); Won, Eugene [Dept. of Radiology, NYU Langone Medical Center, New York (Korea, Republic of)

    2015-04-15

    The propensity score is defined as the probability of each individual study subject being assigned to a group of interest for comparison purposes. Propensity score adjustment is a method of ensuring an even distribution of confounders between groups, thereby increasing between group comparability. Propensity score analysis is therefore an increasingly applied statistical method in observational studies. The purpose of this article was to provide a step-by-step nonmathematical conceptual guide to propensity score analysis with particular emphasis on propensity score matching. A software program code used for propensity score matching was also presented.

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

  16. Monetary Exchange with Multilateral Matching

    DEFF Research Database (Denmark)

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

    . In particular, surplus maximization can be achieved in this setting, in equilibrium, with a positive money supply. Moreover, with flexible prices and directed search, the first best allocation can be attained through price posting or through auctions with lotteries, but not through auctions without lotteries......This paper analyzes monetary exchange in a search model allowing for multilateral matches to be formed, according to a standard urn-ballprocess. We consider three physical environments: indivisible goods and money, divisible goods and indivisible money, and divisible goods and money. We compare....... Finally, analysis of the case of divisible goods and money can be performed without the assumption of large families (as in Shi (1997)) or the day and night structure of Lagos and Wright (2005)....

  17. Matching conditions on capillary ripples

    Energy Technology Data Exchange (ETDEWEB)

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

    2001-12-01

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

  18. Making Palm Print Matching Mobile

    CERN Document Server

    Fang, Li; Chian, Cheng Shao

    2009-01-01

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

  19. An OpenFlow-based performance-oriented multipath forwarding scheme in datacenters

    Institute of Scientific and Technical Information of China (English)

    Bo LIU; Ming CHEN; Bo XU; Hui HU; Chao HU; Qing-yun ZUO; Chang-you XING

    2016-01-01

    Although dense interconnection datacenter networks (DCNs) (e.g., FatTree) provide multiple paths and high bisection bandwidth for each server pair, the widely used single-path Transmission Control Protocol (TCP) and equal-cost multipath (ECMP) transport protocols cannot achieve high resource utilization due to poor resource excavation and allocation. In this paper, we present LESSOR, a performance-oriented multipath forwarding scheme to improve DCNs’ resource utilization. By adopting an OpenFlow-based centralized control mechanism, LESSOR computes near-optimal transmission path and bandwidth provision for each fl ow according to the global network view while maintaining nearly real-time network view with the performance-oriented fl ow observing mechanism. Deployments and comprehensive simulations show that LESSOR can efficiently improve the network throughput, which is higher than ECMP by 4.9%–38.3% under different loads. LESSOR also provides 2%–27.7% improvement of throughput compared with Hedera. Besides, LESSOR decreases the average fl ow completion time signifi cantly.

  20. Transformation of Commercial Flows into Physical Flows of Electricity – Flow Based Method

    Directory of Open Access Journals (Sweden)

    M. Adamec

    2009-01-01

    Full Text Available We are witnesses of large – scale electricity transport between European countries under the umbrella of the UCTE organization. This is due to the inabilyof generators to satisfy the growing consumption in some regions. In this content, we distinguish between two types of flow. The first type is physical flow, which causes costs in the transmission grid, whilst the second type is commercial flow, which provides revenues for the market participants. The old methods for allocating transfer capacity fail to take this duality into account. The old methods that allocate transmission border capacity to “virtual” commercial flows which, in fact, will not flow over this border, do not lead to optimal allocation. Some flows are uselessly rejected and conversely, some accepted flows can cause congestion on another border. The Flow Based Allocation method (FBA is a method which aims to solve this problem.Another goal of FBA is to ensure sustainable development of expansion of transmission capacity. Transmission capacity is important, because it represents a way to establish better transmission system stability, and it provides a distribution channel for electricity to customers abroad. For optimal development, it is necessary to ensure the right division of revenue allocation among the market participants.This paper contains a brief description of the FBA method. Problems of revenue maximization and optimal revenue distribution are mentioned. 

  1. A novel flow-based procedure for automation of respirometric assays in soils.

    Science.gov (United States)

    Silva, Claudineia R; Oliveira, Eliezer; Zagatto, Elias A G; Henriquez, Camelia

    2016-09-01

    A flow-based strategy involving a gas-diffusion sampling probe was proposed for evaluating the respiration rate in soils. The amount of CO2 collected after a pre-defined time interval was proportional to the free CO2 released by the soil ecosystem. The 500-mL incubation flasks typically used for soil respirometric assays were adapted and a special cover was designed for connecting a tubular gas diffusion membrane, a fan, and a septum for adding the CO2(g) standards required for calibration. The method relied on the pH-dependent absorbance variations resulting from the CO2 collection. A 1.3mmolL(-1) bromothymol blue solution (pH 7.0) acted as both acceptor and carrier streams. In order to widen the dynamical working range to 0.003-0.2mmol CO2, two analytical curves were obtained, each related to a different time interval for the CO2 collection. Kinetic curves related to CO2 release by the soil samples were straightforwardly attained. Repeatability and detection limit were estimated as 2.0% and 0.001mmol CO2 (n=10), and accuracy was assessed in relation to a recommended titrimetric procedure.

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

    Directory of Open Access Journals (Sweden)

    Meekan Mark G

    2007-01-01

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

  3. Sample evaluation of ontology-matching systems

    NARCIS (Netherlands)

    Hage, W.R. van; Isaac, A.; Aleksovski, Z.

    2007-01-01

    Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on

  4. Sample evaluation of ontology-matching systems

    NARCIS (Netherlands)

    Hage, W.R. van; Isaac, A.; Aleksovski, Z.

    2007-01-01

    Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on

  5. DEFICIENT CUBIC SPLINES WITH AVERAGE SLOPE MATCHING

    Institute of Scientific and Technical Information of China (English)

    V. B. Das; A. Kumar

    2005-01-01

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

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

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

  8. Concerns on Monotonic Imbalance Bounding Matching Methods

    OpenAIRE

    Yatracos, Yannis G.

    2013-01-01

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

  9. 13 CFR 130.450 - Matching funds.

    Science.gov (United States)

    2010-01-01

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

  10. 13 CFR 102.40 - Computer matching.

    Science.gov (United States)

    2010-01-01

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

  11. 39 CFR 266.10 - Computer matching.

    Science.gov (United States)

    2010-07-01

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

  12. A Discrete Optimization Description for the Solutions in the Matching Problem

    Directory of Open Access Journals (Sweden)

    Walied H. Sharif

    2006-01-01

    Full Text Available This study was concerned with the characterization of solutions in the matching problem. The general mixed-integer programming problem is given together with the definition of the convex hull of the integer solutions. In addition, the matching problem is defined as an integer problem and an algorithm is described to find the optimum matchings. Some illustrative examples are introduced to clarify the presented theory in the study.

  13. LACTATE PROFILE DURING GRECO-ROMAN WRESTLING MATCH

    Directory of Open Access Journals (Sweden)

    Ognjen Uljevic

    2009-11-01

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

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

    DEFF Research Database (Denmark)

    Brabrand, Claus; Thomsen, Jakob G.

    2010-01-01

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

  15. Matching references with MEDLINE via TCP/IP.

    Science.gov (United States)

    Guidi, J N

    1993-01-01

    Bibliographic references are an important part of databases and information resources used by clinicians and biomedical researchers. In addition to the obvious clerical advantages of standard references, bibliographic references can also be used as links to related items in different data sets. This paper describes an effort that involved matching references from a variety of disparate databases to canonical MEDLINE references. The references matched were those involved in a database unification project which is part of the Mouse Genome Informatics effort at The Jackson Laboratory. Software was developed to take advantage of a commercially available retrieval engine which accesses MEDLINE on CD-ROM disks. The software permits client programs on UNIX/C, and potentially other environments, to access unabridged MEDLINE via networks supporting the TCP/IP protocols. The matching process described can be used as a model for similar efforts with different research or clinical data sets, as well as different hardware or software environments.

  16. Matching Theory for Channel Allocation in Cognitive Radio Networks

    Directory of Open Access Journals (Sweden)

    L. Cao

    2016-12-01

    Full Text Available For a cognitive radio network (CRN in which a set of secondary users (SUs competes for a limited number of channels (spectrum resources belonging to primary users (PUs, the channel allocation is a challenge and dominates the throughput and congestion of the network. In this paper, the channel allocation problem is first formulated as the 0-1 integer programming optimization, with considering the overall utility both of primary system and secondary system. Inspired by matching theory, a many-to-one matching game is used to remodel the channel allocation problem, and the corresponding PU proposing deferred acceptance (PPDA algorithm is also proposed to yield a stable matching. We compare the performance and computation complexity between these two solutions. Numerical results demonstrate the efficiency and obtain the communication overhead of the proposed scheme.

  17. A Theory for Optical Flow-based Transport on Image Manifolds

    Science.gov (United States)

    2011-11-21

    I2(x, y) = I1(x+ vx(x, y), y + vy(x, y)). (2) A common assumption in computing the optical flow between images is bright- ness constancy [16], where...not be the transport operator of choice, since such manifolds do not in general obey the brightness constancy requirement needed in optical flow...on Comp. Vision, 2010. [15] M. I. Miller , L. Younes, Group actions, homeomorphisms, and matching: a general framework, Intl. J. of Comp. Vision 41 (1

  18. Utility of onsite interviews in the pediatric surgery match.

    Science.gov (United States)

    Downard, Cynthia D; Goldin, Adam; Garrison, Michelle M; Waldhausen, John; Langham, Max; Hirschl, Ronald

    2015-06-01

    The value of onsite interviews for the pediatric surgery match remains undefined despite substantial cost to applicants. This study assesses the impact of onsite interviews on the rank order lists submitted to the match by pediatric surgery residency training program directors (PDs). PDs were asked prospectively to evaluate pediatric surgery residency candidates based solely on their ERAS application and generate a "pre-interview rank list." Interviews were then held based on the usual practice of each program. PDs then submitted de-identified pre-interview and final rank lists. The impact of the interview process upon rank list movement of candidates was assessed. Of 44 programs, 16 (36%) provided data for analysis. Onsite interviews resulted in candidates moving a mean of 5.2 ± 1.2 rank positions, whereas candidates ranked in the first 5 positions moved an average of 4 ± 2 places, 81% of the initial top-ranked candidates moved out of this position, and 36% of top 10 candidates moved out of the top 10. Onsite interviews are high-stakes events which substantially affect the final rank order list in the pediatric surgery match. Programs should take these data into account when determining the number of interview invitations. Copyright © 2015 Elsevier Inc. All rights reserved.

  19. Matching network for RF plasma source

    Science.gov (United States)

    Pickard, Daniel S.; Leung, Ka-Ngo

    2007-11-20

    A compact matching network couples an RF power supply to an RF antenna in a plasma generator. The simple and compact impedance matching network matches the plasma load to the impedance of a coaxial transmission line and the output impedance of an RF amplifier at radio frequencies. The matching network is formed of a resonantly tuned circuit formed of a variable capacitor and an inductor in a series resonance configuration, and a ferrite core transformer coupled to the resonantly tuned circuit. This matching network is compact enough to fit in existing compact focused ion beam systems.

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

  1. Extremal Matching Energy of Complements of Trees

    Directory of Open Access Journals (Sweden)

    Wu Tingzeng

    2016-08-01

    Full Text Available Gutman and Wagner proposed the concept of the matching energy which is defined as the sum of the absolute values of the zeros of the matching polynomial of a graph. And they pointed out that the chemical applications of matching energy go back to the 1970s. Let T be a tree with n vertices. In this paper, we characterize the trees whose complements have the maximal, second-maximal and minimal matching energy. Furthermore, we determine the trees with edge-independence number p whose complements have the minimum matching energy for p = 1, 2, . . . , [n/2]. When we restrict our consideration to all trees with a perfect matching, we determine the trees whose complements have the second-maximal matching energy.

  2. Bid Optimization in Broad-Match Ad auctions

    CERN Document Server

    Even-dar, Eyal; Mirrokni, Vahab; Muthukrishnan, S; Nadav, Uri

    2009-01-01

    Ad auctions in sponsored search support ``broad match'' that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging to optimize bids to maximize their returns: choosing to bid on a query as a broad match because it provides high profit results in one bidding for related queries which may yield low or even negative profits. We abstract and study the complexity of the {\\em bid optimization problem} which is to determine an advertiser's bids on a subset of keywords (possibly using broad match) so that her profit is maximized. In the query language model when the advertiser is allowed to bid on all queries as broad match, we present an linear programming (LP)-based polynomial-time algorithm that gets the optimal profit. In the model in which an advertiser can only bid on keywords, ie., a subset of keywords as an exact or broad match, we show that this problem is not approximable within any ...

  3. The 1951 Harvard student uprising against the intern match.

    Science.gov (United States)

    Nakayama, Don K; Hendren, W Hardy

    2017-06-01

    In the fall of 1951, a group of Harvard medical students led by W. Hardy Hendren, III organized a national movement against the newly instituted match that would assign graduating seniors to hospital internship programs. Before then, hospitals with intern positions to fill rushed to secure commitments from students, who in turn accepted the first decent offer that came their way. Knowing that students could not risk waiting for a better offer, hospitals pushed them into making early commitments. When some students began getting offers in their junior and sophomore years, medical schools, professional groups, and hospitals organized the National Inter-association Committee on Internships to deal with the issue. The intern match was thus organized and scheduled to take place in 1952. When the plan was announced in mid-October 1951, Hendren recognized that the proposed algorithm placed students at a disadvantage if they did not get their first choice of hospitals. Facing resistance at every step from the National Inter-association Committee on Internships and putting his standing at Harvard Medical School at risk, Hendren led a nationwide movement of medical students to change the procedure to one that favored students' choices. Their success <1 month later established in the inaugural match the fundamental ethic of today's National Resident Matching Program to favor students' preferences at every step of the process. Copyright © 2016 Elsevier Inc. All rights reserved.

  4. Matching roots to their environment.

    Science.gov (United States)

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

    2013-07-01

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

  5. Towards Robust Image Matching Algorithms

    Science.gov (United States)

    Parsons, Timothy J.

    1984-12-01

    The rapid advance in digital electronics during recent years has enabled the real-time hardware implementation of many basic image processing techniques and these methods are finding increasing use in both commercial and military applications where a superiority to existing systems can be demonstrated. The potential superiority of an entirely passive, automatic image processing based navigation system over the less accurate and active navigation systems based on radar, for example "TERCOM", is evident. By placing a sensor on board an aircraft or missile together with the appropriate processing power and enough memory to store a reference image or a map of the planned route, large scale features extracted from the scene available to the sensor can be compared with the same feature stored in memory. The difference between the aircraft's actual position and its desired position can then be evaluated and the appropriate navigational correction undertaken. This paper summaries work carried out at British Aerospace Hatfield to investigate various classes of algorithms and solutions which would render a robust image matching system viable for such an automatic system flying at low level with a thermal I.R. sensor.

  6. Orthogonal Matching Pursuit with Replacement

    CERN Document Server

    Jain, Prateek; Dhillon, Inderjit S

    2011-01-01

    In this paper, we consider the problem of compressed sensing where the goal is to recover almost all the sparse vectors using a small number of fixed linear measurements. For this problem, we propose a novel partial hard-thresholding operator that leads to a general family of iterative algorithms. While one extreme of the family yields well known hard thresholding algorithms like ITI (Iterative Thresholding with Inversion) and HTP (Hard Thresholding Pursuit), the other end of the spectrum leads to a novel algorithm that we call Orthogonal Matching Pursuit with Replacement (OMPR). OMPR, like the classic greedy algorithm OMP, adds exactly one coordinate to the support at each iteration, based on the correlation with the current residual. However, unlike OMP, OMPR also removes one coordinate from the support. This simple change allows us to prove that OMPR has the best known guarantees for sparse recovery in terms of the Restricted Isometry Property (a condition on the measurement matrix). In contrast, OMP is kn...

  7. Maximum Matchings via Glauber Dynamics

    CERN Document Server

    Jindal, Anant; Pal, Manjish

    2011-01-01

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

  8. Holography and Conformal Anomaly Matching

    CERN Document Server

    Cabo-Bizet, Alejandro; Narain, K S

    2013-01-01

    We discuss various issues related to the understanding of the conformal anomaly matching in CFT from the dual holographic viewpoint. First, we act with a PBH diffeomorphism on a generic 5D RG flow geometry and show that the corresponding on-shell bulk action reproduces the Wess-Zumino term for the dilaton of broken conformal symmetry, with the expected coefficient aUV-aIR. Then we consider a specific 3D example of RG flow whose UV asymptotics is normalizable and admits a 6D lifting. We promote a modulus \\rho appearing in the geometry to a function of boundary coordinates. In a 6D description {\\rho} is the scale of an SU(2) instanton. We determine the smooth deformed background up to second order in the space-time derivatives of \\rho and find that the 3D on-shell action reproduces a boundary kinetic term for the massless field \\tau= log(\\rho) with the correct coefficient \\delta c=cUV-cIR. We further analyze the linearized fluctuations around the deformed background geometry and compute the one-point functions ...

  9. Voice Matching Using Genetic Algorithm

    Directory of Open Access Journals (Sweden)

    Abhishek Bal

    2014-03-01

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

  10. Impedance matching at arterial bifurcations.

    Science.gov (United States)

    Brown, N

    1993-01-01

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

  11. Explicit pattern matching assignment algorithm

    Science.gov (United States)

    Levedahl, Mark

    2002-08-01

    Sharing data between two tracking systems frequently involves use of an object map: the transmitting system sends a frame of data with multiple observations, and the receiving system uses an assignment algorithm to correlate the information with its local observation data base. The usual prescription for this problem is an optimal assignment algorithm (such as JVC or auction) using a cost matrix based upon chi-squared distances between the local and remote observation data. The optimal assignment algorithm does not actually perform pattern matching, so this approach is not robust to large registration errors between the two systems when there exist differences in the number of observations held by both systems. Performance of a new assignment algorithm that uses a cost function including terms for both registration errors and track to track random errors is presented: the cost function explicitly includes a bias between the two observation sets and thus provides a maximum likelihood solution to the assignment problem. In practice, this assignment approach provides near perfect assignment accuracy in cases where the bias errors exceed the dimension of the transmitted object map and there exist mismatches in the numbers of observations made by the two systems. This performance extends to many cases where the optimal assignment algorithm methodology produces errors nearly 100% of the time. The paper includes the theoretical foundation of the assignment problem solved and comparison of achieved accuracy with existing optimal assignment approaches.

  12. Women and microcredit in rural agrarian households of Uganda: match or mismatch between lender and borrower?

    NARCIS (Netherlands)

    Namayengo, M.M.F.; Ophem, van J.A.C.; Antonides, G.

    2016-01-01

    The alignment of microfinance programs with the context and expectations of the recipients is critical for ensuring clients' satisfaction and desired program outcomes. This study sought to investigate the extent to which the objectives and design of the BRAC microfinance program match the expectatio

  13. Women and microcredit in rural agrarian households of Uganda: match or mismatch between lender and borrower?

    NARCIS (Netherlands)

    Namayengo, M.M.F.; Ophem, van J.A.C.; Antonides, G.

    2016-01-01

    The alignment of microfinance programs with the context and expectations of the recipients is critical for ensuring clients' satisfaction and desired program outcomes. This study sought to investigate the extent to which the objectives and design of the BRAC microfinance program match the

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

  15. Best Practices for NPT Transit Matching

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-09-01

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

  16. Online versus Face-to-Face Accounting Education: A Comparison of CPA Exam Outcomes across Matched Institutions

    Science.gov (United States)

    Morgan, John Daniel

    2015-01-01

    Programmatic-level comparisons are made between the certified public accountant (CPA) exam outcomes of two types of accounting programs: online or distance accounting programs and face-to-face or classroom accounting programs. After matching programs from each group on student selectivity at admission, the two types of programs are compared on CPA…

  17. Online versus Face-to-Face Accounting Education: A Comparison of CPA Exam Outcomes across Matched Institutions

    Science.gov (United States)

    Morgan, John Daniel

    2015-01-01

    Programmatic-level comparisons are made between the certified public accountant (CPA) exam outcomes of two types of accounting programs: online or distance accounting programs and face-to-face or classroom accounting programs. After matching programs from each group on student selectivity at admission, the two types of programs are compared on CPA…

  18. Stability of the bipartite matching model

    CERN Document Server

    Bušić, Ana; Mairesse, Jean

    2010-01-01

    We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan, and Weiss (Adv. Appl. Probab., 2009). Customers and servers play symmetrical roles. There is a finite set C resp. S, of customer, resp. server, classes. Time is discrete and at each time step, one customer and one server arrive in the system according to a joint probability measure on CxS, independently of the past. Also, at each time step, pairs of matched customer and server, if they exist, depart from the system. Authorized matchings are given by a fixed bipartite graph. A matching policy is chosen, which decides how to match when there are several possibilities. Customers/servers that cannot be matched are stored in a buffer. The evolution of the model can be described by a discrete time Markov chain. We study its stability under various admissible matching policies including: ML (Match the Longest), MS (Match the Shortest), FIFO (match the oldest), priorities. There exist natural necessary conditions for st...

  19. MATCH - A Software Package for Robust Profile Matching Using S-Plus

    Directory of Open Access Journals (Sweden)

    Douglas P. Wiens

    2004-04-01

    Full Text Available This manual details the implementation of the profile matching techniques introduced in Robust Estimation of Air-Borne Particulate Matter (Wiens, Florence and Hiltz, Environmetrics, 2001 - included as an appendix. The program consists of a collection of functions written in S. It runs in S-Plus, including the student version. A graphical user interface is supplied for easy implementation by a user with only a passing familiarity with S-Plus. A description of the software is given, together with an extensive example of an analysis of a data set using the software. The software is available at http://www.stat.ualberta.ca/~wiens/publist.htm where it is linked to the listing for Wiens, Florence and Hiltz (2001.

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

    Science.gov (United States)

    2013-01-08

    ... file when required (71 FR 1796, January 11, 2006). OPM will provide SSA with an electronic finder file... A-130 and OMB M-06-16); National Institute of Science and Technology (NIST) directives; and...

  1. 77 FR 74518 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2012-12-14

    ... an electronic finder file from the OPM system of records published as OPM/Central-1 (Civil Service... memorandum (e.g., OMB Circular A-130 and OMB M-06-16); National Institute of Science and Technology...

  2. 75 FR 17788 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2010-04-07

    ... file when required (71 FR 1796, January 11, 2006). OPM will provide SSA with an electronic finder file... circulars and memorandum (e.g. OMB Circular A-130 and OMB M-06-16); National Institute of Science...

  3. 75 FR 31819 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2010-06-04

    ...'' microfilm file when required (71 FR 1796, January 11, 2006). OPM will provide SSA with an electronic finder... circulars and memorandum (e.g. OMB Circular A-130 and OMB M-06-16); National Institute of Science...

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

    Science.gov (United States)

    2013-06-13

    ..., SSA/OEEAS, 60-0059, last published on January 11, 2006 (71 FR 1819). OPM will disclose to SSA a finder...), National Institute of Science and Technology directives, and the Federal Acquisition Regulations....

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

    Science.gov (United States)

    2012-12-20

    ..., servicemembers, and reservists who have applied for or who are receiving education benefit payments under the... meet the conditions of military service and eligibility criteria for payment of benefits determined...

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

  7. The match between horse and rider

    OpenAIRE

    Axel-Nilsson, Malin

    2015-01-01

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

  8. Lazy AC-Pattern Matching for Rewriting

    OpenAIRE

    Walid Belkhir; Alain Giorgetti

    2012-01-01

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

  9. Lazy AC-Pattern Matching for Rewriting

    Directory of Open Access Journals (Sweden)

    Walid Belkhir

    2012-04-01

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

  10. Parikh Matching in the Streaming Model

    DEFF Research Database (Denmark)

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

    2012-01-01

    |-length count vector. In the streaming model one seeks space-efficient algorithms for problems in which there is one pass over the data. We consider Parikh matching in the streaming model. To make this viable we search for substrings whose Parikh-mappings approximately match the input vector. In this paper we...... present upper and lower bounds on the problem of approximate Parikh matching in the streaming model....

  11. Matching Two-dimensional Gel Electrophoresis' Spots

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  12. Accounting for Endogeneity in Matching Function Estimation

    DEFF Research Database (Denmark)

    Borowczyk-Martins, Daniel; Jolivet, Grégory; Postel-Vinay, Fabien

    2017-01-01

    We show that equilibrium matching models imply that standard estimates of the matching function elasticities are exposed to an endogeneity bias, which arises from the search behavior of agents on either side of the market. We offer an estimation method which, under certain structural assumptions...... about the process driving shocks to matching efficiency, is immune from that bias. Application of our method to the estimation of a basic version of the matching function using aggregate U.S. data from the Job Openings and Labor Turnover Survey (JOLTS) suggests that the bias can be quantitatively...

  13. PUMA: The Positional Update and Matching Algorithm

    Science.gov (United States)

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

    2017-01-01

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

  14. REDUCING THE LIKELIHOOD OF LONG TENNIS MATCHES

    Directory of Open Access Journals (Sweden)

    Tristan Barnett

    2006-12-01

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

  15. Highly Scalable Matching Pursuit Signal Decomposition Algorithm

    Data.gov (United States)

    National Aeronautics and Space Administration — In this research, we propose a variant of the classical Matching Pursuit Decomposition (MPD) algorithm with significantly improved scalability and computational...

  16. Prediction on Droplet Sauter Mean Diameter in Gas-Liquid Mist Flow Based on Droplet Fractal Theory

    OpenAIRE

    Jian-Yi Liu; Xiao-Hua Tan; Zhou Fan; Xu-Tao You; Zhou Li; Jia-Hui Zhao

    2015-01-01

    We present a fractal model for droplet Sauter mean diameter in gas-liquid mist flow, based on the droplet fractal theory and the balance relationship between total droplet surface energy and total gas turbulent kinetic energy. The present model is expressed as functions of the droplet fractal dimension, gas superficial velocity, liquid superficial velocity, and other fluid characteristics. Agreement between the present model predictions and experimental measurements is obtained. Results verif...

  17. Prediction on Droplet Sauter Mean Diameter in Gas-Liquid Mist Flow Based on Droplet Fractal Theory

    Directory of Open Access Journals (Sweden)

    Jian-Yi Liu

    2015-01-01

    Full Text Available We present a fractal model for droplet Sauter mean diameter in gas-liquid mist flow, based on the droplet fractal theory and the balance relationship between total droplet surface energy and total gas turbulent kinetic energy. The present model is expressed as functions of the droplet fractal dimension, gas superficial velocity, liquid superficial velocity, and other fluid characteristics. Agreement between the present model predictions and experimental measurements is obtained. Results verify the reliability of the present model.

  18. Role model and prototype matching

    DEFF Research Database (Denmark)

    Lykkegaard, Eva; Ulriksen, Lars

    2016-01-01

    images and situation-specific conceptions of role models. Furthermore, the study underlined the positive effect of prolonged role-model contact, the importance of using several role models and that traditional school subjects catered more resistant prototype images than unfamiliar ones did......Previous research has found that young people’s prototypes of science students and scientists affect their inclination to choose tertiary STEM programs (Science, Technology, Engineering and Mathematics). Consequently, many recruitment initiatives include role models to challenge these prototypes....... The present study followed 15 STEM-oriented upper-secondary school students from university-distant backgrounds during and after their participation in an 18-months long university-based recruitment and outreach project involving tertiary STEM students as role models. The analysis focusses on how the students...

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

    Science.gov (United States)

    Austin, Peter C; Lee, Douglas S

    2009-06-01

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

  20. A Computer Aided Broad Band Impedance Matching Technique Using a Comparison Reflectometer. Ph.D. Thesis

    Science.gov (United States)

    Gordy, R. S.

    1972-01-01

    An improved broadband impedance matching technique was developed. The technique is capable of resolving points in the waveguide which generate reflected energy. A version of the comparison reflectometer was developed and fabricated to determine the mean amplitude of the reflection coefficient excited at points in the guide as a function of distance, and the complex reflection coefficient of a specific discontinuity in the guide as a function of frequency. An impedance matching computer program was developed which is capable of impedance matching the characteristics of each disturbance independent of other reflections in the guide. The characteristics of four standard matching elements were compiled, and their associated curves of reflection coefficient and shunt susceptance as a function of frequency are presented. It is concluded that an economical, fast, and reliable impedance matching technique has been established which can provide broadband impedance matches.

  1. SEMI-GLOBAL MATCHING IN OBJECT SPACE

    Directory of Open Access Journals (Sweden)

    F. Bethmann

    2015-03-01

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

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

  3. 13 CFR 108.2030 - Matching requirements.

    Science.gov (United States)

    2010-01-01

    ... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Matching requirements. 108.2030 Section 108.2030 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION NEW MARKETS VENTURE CAPITAL... SSBICs § 108.2030 Matching requirements. (a) General. All Operational Assistance grant funds SBA awards...

  4. String matching with variable length gaps

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li; Vildhøj, Hjalte Wedel

    2012-01-01

    We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in T that match P. This problem is a basic...

  5. Partial fingerprint matching based on SIFT Features

    Directory of Open Access Journals (Sweden)

    Ms. S.Malathi,

    2010-07-01

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

  6. Second Order Mode Selective Phase-Matching

    DEFF Research Database (Denmark)

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

    2006-01-01

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

  7. Dynamic Matchings in Convex Bipartite Graphs

    DEFF Research Database (Denmark)

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

    2007-01-01

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

  8. Monkeys Match and Tally Quantities across Senses

    Science.gov (United States)

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

    2008-01-01

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

  9. Why do Worker-Firm Matches Dissolve?

    NARCIS (Netherlands)

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

    2006-01-01

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

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

    Science.gov (United States)

    Lopez, Antonio M.

    1996-01-01

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

  11. Active impedance matching of complex structural systems

    Science.gov (United States)

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

    1991-01-01

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

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

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

    DEFF Research Database (Denmark)

    Brabrand, Claus; Thomsen, Jakob Grauenkjær

    2010-01-01

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

  14. Minutiae matching using local pattern features

    Science.gov (United States)

    Jędryka, Marcin; Wawrzyniak, Zbigniew

    2008-01-01

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

  15. PUMA: The Positional Update and Matching Algorithm

    CERN Document Server

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

    2016-01-01

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

  16. Matching Parasitic Antenna for Single RF MIMO

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  17. A Data-Flow Based Coordination Approach to Concurrent Software Engineering

    NARCIS (Netherlands)

    Penczek, F.; Cheng, W.; Grelck, C.; Kirner, R.; Scheuermann, B.; Shafarenko, A.

    2013-01-01

    In this paper we present S-Net, a coordination language based on dataflow principles, intended for design of concurrent software. The language is introduced and then used for programming a concurrent solver for a combinatorial optimisation problem. We present the analysis and tracing facilities of

  18. A Data-Flow Based Coordination Approach to Concurrent Software Engineering

    NARCIS (Netherlands)

    F. Penczek; W. Cheng; C. Grelck; R. Kirner; B. Scheuermann; A. Shafarenko

    2012-01-01

    In this paper we present S-Net, a coordination language based on dataflow principles, intended for design of concurrent software. The language is introduced and then used for programming a concurrent solver for a combinatorial optimisation problem. We present the analysis and tracing facilities of o

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

  20. Monitoring strategy to match the advanced fabs

    Science.gov (United States)

    Ackmann, Paul W.

    2004-06-01

    The reduction in feature size below the exposure wavelength, the requirement for high yields, the expectation for consistent cycletime and shipment to mix, all mean that the reticle industry must be like advanced wafer fabrication centers. Due to the lower output of write tools versus steppers, and the fact that a reticle is a lot of one instead of 25 or 50 wafers as well as the need to match ship data to Fab ramp, the reticle line monitoring strategy must be optimized for small sample size. The use of tool time and alternative inspection strategies can lead to the early detection of problems. Because every reticle is a customer specific design, the monitoring strategy takes on a new look compared to the Fab. We have organized the AMTC to resemble a wafer fab. We have a dedicated Integration group that works with the customers and technologists, to monitor the needs of the customers and then drive the development programs that improve reticle capability. We have dedicated yield team to identify and classify the yield loss mechanisms and define probable causes. The teams then work with the Process owners to fix the source of yield loss and track the corrective actions. All sources of variations must be modeled and then sources of errors reduced to levels below the tool specification. The manufacturing organization has all the process and tool experts to focus on Pilot Line and Development tasks to meet the advance needs of our customers. With the organization in place we can then develop the methods based on Reticle and Fab manufacturing to best control the line and provide development with manufacturing cycle times.

  1. Practical significance of weld strength matching

    Energy Technology Data Exchange (ETDEWEB)

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

    1996-10-01

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

  2. A Novel Control-flow based Intrusion Detection Technique for Big Data Systems

    OpenAIRE

    Aditham, Santosh; Ranganathan, Nagarajan

    2016-01-01

    Security and distributed infrastructure are two of the most common requirements for big data software. But the security features of the big data platforms are still premature. It is critical to identify, modify, test and execute some of the existing security mechanisms before using them in the big data world. In this paper, we propose a novel intrusion detection technique that understands and works according to the needs of big data systems. Our proposed technique identifies program level ano...

  3. RETIRED MATCHES AMONG MALE PROFESSIONAL TENNIS PLAYERS

    Directory of Open Access Journals (Sweden)

    Kristijan Breznik

    2012-06-01

    Full Text Available The aim of this study was to explore the effect of characteristics of various games and players on the proportion of retired tennis matches in the Open Era of tennis. The data included over 420,000 matches played among 17,553 tennis players in the period from 1968 to the end of 2010. The influence of the surface type was clearly confirmed, with the proportion of retired matches being higher on hard and clay courts compared to grass and carpet surfaces. Similarly, more retired matches were observed in outdoor venues than in indoor ones. The impact of other variables, tournament types, rounds at which the game was played and both players' ranks, is more ambiguous. Our interpretation of the obtained results is presented in the paper. Network analytic methods were applied to extract players with the most retired matches in their careers. Eventually, we defined a group of top tennis players and gave a more precise insight into retired matches in that group. Correspondence analysis was used to visually display the two-mode network of top players and the proportion of retired matches by surface type

  4. Robust Face Image Matching under Illumination Variations

    Directory of Open Access Journals (Sweden)

    Yang Chyuan-Huei Thomas

    2004-01-01

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

  5. Indexing Volumetric Shapes with Matching and Packing.

    Science.gov (United States)

    Koes, David Ryan; Camacho, Carlos J

    2015-04-01

    We describe a novel algorithm for bulk-loading an index with high-dimensional data and apply it to the problem of volumetric shape matching. Our matching and packing algorithm is a general approach for packing data according to a similarity metric. First an approximate k-nearest neighbor graph is constructed using vantage-point initialization, an improvement to previous work that decreases construction time while improving the quality of approximation. Then graph matching is iteratively performed to pack related items closely together. The end result is a dense index with good performance. We define a new query specification for shape matching that uses minimum and maximum shape constraints to explicitly specify the spatial requirements of the desired shape. This specification provides a natural language for performing volumetric shape matching and is readily supported by the geometry-based similarity search (GSS) tree, an indexing structure that maintains explicit representations of volumetric shape. We describe our implementation of a GSS tree for volumetric shape matching and provide a comprehensive evaluation of parameter sensitivity, performance, and scalability. Compared to previous bulk-loading algorithms, we find that matching and packing can construct a GSS-tree index in the same amount of time that is denser, flatter, and better performing, with an observed average performance improvement of 2X.

  6. Graphical models and point pattern matching.

    Science.gov (United States)

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

    2006-10-01

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

  7. Multithreaded Implementation of Hybrid String Matching Algorithm

    Directory of Open Access Journals (Sweden)

    Akhtar Rasool

    2012-03-01

    Full Text Available Reading and taking reference from many books and articles, and then analyzing the Navies algorithm, Boyer Moore algorithm and Knuth Morris Pratt (KMP algorithm and a variety of improved algorithms, summarizes various advantages and disadvantages of the pattern matching algorithms. And on this basis, a new algorithm – Multithreaded Hybrid algorithm is introduced. The algorithm refers to Boyer Moore algorithm, KMP algorithm and the thinking of improved algorithms. Utilize the last character of the string, the next character and the method to compare from side to side, and then advance a new hybrid pattern matching algorithm. And it adjusted the comparison direction and the order of the comparison to make the maximum moving distance of each time to reduce the pattern matching time. The algorithm reduces the comparison number and greatlyreduces the moving number of the pattern and improves the matching efficiency. Multithreaded implementation of hybrid, pattern matching algorithm performs the parallel string searching on different text data by executing a number of threads simultaneously. This approach is advantageous from all other string-pattern matching algorithm in terms of time complexity. This again improves the overall string matching efficiency.

  8. Human-eye versus computerized color matching.

    Science.gov (United States)

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

    1999-01-01

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

  9. Matching fully differential NNLO calculations and parton showers

    Energy Technology Data Exchange (ETDEWEB)

    Alioli, Simone; Bauer, Christian W.; Berggren, Calvin; Walsh, Jonathan R.; Zuberi, Saba [California Univ., Berkeley, CA (United States). Ernest Orlando Lawrence Berkeley National Laboratory; Tackmann, Frank J. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

    2013-11-15

    We present a general method to match fully differential next-to-next-to-leading (NNLO) calculations to parton shower programs. We discuss in detail the perturbative accuracy criteria a complete NNLO+PS matching has to satisfy. Our method is based on consistently improving a given NNLO calculation with the leading-logarithmic (LL) resummation in a chosen jet resolution variable. The resulting NNLO+LL calculation is cast in the form of an event generator for physical events that can be directly interfaced with a parton shower routine, and we give an explicit construction of the input ''Monte Carlo cross sections'' satisfying all required criteria. We also show how other proposed approaches naturally arise as special cases in our method.

  10. Matching Fully Differential NNLO Calculations and Parton Showers

    CERN Document Server

    Alioli, Simone; Berggren, Calvin; Tackmann, Frank J; Walsh, Jonathan R; Zuberi, Saba

    2013-01-01

    We present a general method to match fully differential next-to-next-to-leading (NNLO) calculations to parton shower programs. We discuss in detail the perturbative accuracy criteria a complete NNLO+PS matching has to satisfy. Our method is based on consistently improving a given NNLO calculation with the leading-logarithmic (LL) resummation in a chosen jet resolution variable. The resulting NNLO$+$LL calculation is cast in the form of an event generator for physical events that can be directly interfaced with a parton shower routine, and we give an explicit construction of the input "Monte Carlo cross sections" satisfying all required criteria. We also show how other proposed approaches naturally arise as special cases in our method.

  11. Implementing wide baseline matching algorithms on a graphics processing unit.

    Energy Technology Data Exchange (ETDEWEB)

    Rothganger, Fredrick H.; Larson, Kurt W.; Gonzales, Antonio Ignacio; Myers, Daniel S.

    2007-10-01

    Wide baseline matching is the state of the art for object recognition and image registration problems in computer vision. Though effective, the computational expense of these algorithms limits their application to many real-world problems. The performance of wide baseline matching algorithms may be improved by using a graphical processing unit as a fast multithreaded co-processor. In this paper, we present an implementation of the difference of Gaussian feature extractor, based on the CUDA system of GPU programming developed by NVIDIA, and implemented on their hardware. For a 2000x2000 pixel image, the GPU-based method executes nearly thirteen times faster than a comparable CPU-based method, with no significant loss of accuracy.

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

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

  14. Fingerprint Recognition Using Minutia Score Matching

    CERN Document Server

    J, Ravi; R, Venugopal K

    2010-01-01

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

  15. Impedance-matched cavity quantum memory

    CERN Document Server

    Afzelius, Mikael

    2010-01-01

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

  16. MATCH: An Atom- Typing Toolset for Molecular Mechanics Force Fields

    Science.gov (United States)

    Yesselman, Joseph D.; Price, Daniel J.; Knight, Jennifer L.; Brooks, Charles L.

    2011-01-01

    We introduce a toolset of program libraries collectively titled MATCH (Multipurpose Atom-Typer for CHARMM) for the automated assignment of atom types and force field parameters for molecular mechanics simulation of organic molecules. The toolset includes utilities for the conversion from multiple chemical structure file formats into a molecular graph. A general chemical pattern-matching engine using this graph has been implemented whereby assignment of molecular mechanics atom types, charges and force field parameters is achieved by comparison against a customizable list of chemical fragments. While initially designed to complement the CHARMM simulation package and force fields by generating the necessary input topology and atom-type data files, MATCH can be expanded to any force field and program, and has core functionality that makes it extendable to other applications such as fragment-based property prediction. In the present work, we demonstrate the accurate construction of atomic parameters of molecules within each force field included in CHARMM36 through exhaustive cross validation studies illustrating that bond increment rules derived from one force field can be transferred to another. In addition, using leave-one-out substitution it is shown that it is also possible to substitute missing intra and intermolecular parameters with ones included in a force field to complete the parameterization of novel molecules. Finally, to demonstrate the robustness of MATCH and the coverage of chemical space offered by the recent CHARMM CGENFF force field (Vanommeslaeghe, et al., JCC., 2010, 31, 671–690), one million molecules from the PubChem database of small molecules are typed, parameterized and minimized. PMID:22042689

  17. Magnetic resonance imaging 4-D flow-based analysis of aortic hemodynamics in Turner syndrome

    Energy Technology Data Exchange (ETDEWEB)

    Arnold, Raoul [University Medical Center Heidelberg, Department of Congenital Heart Disease and Pediatric Cardiology, Heidelberg (Germany); Neu, Marie [University Medical Center, Department of Pediatric Hematology/Oncology/Hemostaseology, Mainz (Germany); Hirtler, Daniel [University of Freiburg, Department of Congenital Heart Defects and Pediatric Cardiology, Heart Center, Freiburg im Breisgau (Germany); Gimpel, Charlotte [Center for Pediatrics, Medical Center - University of Freiburg, Department of General Pediatrics, Adolescent Medicine and Neonatology, Freiburg im Breisgau (Germany); Markl, Michael [Northwestern University, Department of Radiology, Feinberg School of Medicine, Chicago, IL (United States); Northwestern University, Department of Biomedical Engineering, McCormick School of Engineering, Chicago, IL (United States); Geiger, Julia [Northwestern University, Department of Radiology, Feinberg School of Medicine, Chicago, IL (United States); University Children' s Hospital, Department of Radiology, Zuerich (Switzerland)

    2017-04-15

    Cardiovascular surveillance is important in Turner syndrome because of the increased risk of aortic dilation and dissection with consecutively increased mortality. To compare 4-D flow MRI for the characterization of aortic 3-D flow patterns, dimensions and vessel wall parameters in pediatric patients with Turner syndrome and age-matched controls. We performed 4-D flow MRI measuring in vivo 3-D blood flow with coverage of the thoracic aorta in 25 patients with Turner syndrome and in 16 female healthy controls (age mean ± standard deviation were 16 ± 5 years and 17 ± 4 years, respectively). Blood flow was visualized by time-resolved 3-D path lines. Visual grading of aortic flow in terms of helices and vortices was performed by two independent observers. Quantitative analysis included measurement of aortic diameters, quantification of peak systolic wall shear stress, pulsatility index and oscillatory shear index at eight defined sites. Patients with Turner syndrome had significantly larger aortic diameters normalized to BSA, increased vortices in the ascending aorta and elevated helix flow in the ascending and descending aorta compared to controls (all P<0.03). Patients with abnormal helical or vortical flow in the ascending aorta had significantly larger diameters of the ascending aorta (P<0.03). Peak systolic wall shear stress, pulsatility index and oscillatory shear index were significantly lower in Turner patients compared to controls (p=0.02, p=0.002 and p=0.01 respectively). Four-dimensional flow MRI provides new insights into the altered aortic hemodynamics and wall shear stress that could have an impact on the development of aortic dissections. (orig.)

  18. Optic flow-based vision system for autonomous 3D localization and control of small aerial vehicles

    OpenAIRE

    Kendoul, Farid; Fantoni, Isabelle; Nonami, Kenzo

    2009-01-01

    International audience; The problem considered in this paper involves the design of a vision-based autopilot for small and micro Unmanned Aerial Vehicles (UAVs). The proposed autopilot is based on an optic flow-based vision system for autonomous localization and scene mapping, and a nonlinear control system for flight control and guidance. This paper focusses on the development of a real-time 3D vision algorithm for estimating optic flow, aircraft self-motion and depth map, using a low-resolu...

  19. The LabelHash algorithm for substructure matching

    Directory of Open Access Journals (Sweden)

    Bryant Drew H

    2010-11-01

    Full Text Available Abstract Background There is an increasing number of proteins with known structure but unknown function. Determining their function would have a significant impact on understanding diseases and designing new therapeutics. However, experimental protein function determination is expensive and very time-consuming. Computational methods can facilitate function determination by identifying proteins that have high structural and chemical similarity. Results We present LabelHash, a novel algorithm for matching substructural motifs to large collections of protein structures. The algorithm consists of two phases. In the first phase the proteins are preprocessed in a fashion that allows for instant lookup of partial matches to any motif. In the second phase, partial matches for a given motif are expanded to complete matches. The general applicability of the algorithm is demonstrated with three different case studies. First, we show that we can accurately identify members of the enolase superfamily with a single motif. Next, we demonstrate how LabelHash can complement SOIPPA, an algorithm for motif identification and pairwise substructure alignment. Finally, a large collection of Catalytic Site Atlas motifs is used to benchmark the performance of the algorithm. LabelHash runs very efficiently in parallel; matching a motif against all proteins in the 95% sequence identity filtered non-redundant Protein Data Bank typically takes no more than a few minutes. The LabelHash algorithm is available through a web server and as a suite of standalone programs at http://labelhash.kavrakilab.org. The output of the LabelHash algorithm can be further analyzed with Chimera through a plugin that we developed for this purpose. Conclusions LabelHash is an efficient, versatile algorithm for large-scale substructure matching. When LabelHash is running in parallel, motifs can typically be matched against the entire PDB on the order of minutes. The algorithm is able to identify

  20. A Moment Matching Approach for Generating Synthetic Data.

    Science.gov (United States)

    Bogle, Brittany Megan; Mehrotra, Sanjay

    2016-09-01

    Synthetic data are becoming increasingly important mechanisms for sharing data among collaborators and with the public. Multiple methods for the generation of synthetic data have been proposed, but many have short comings with respect to maintaining the statistical properties of the original data. We propose a new method for fully synthetic data generation that leverages linear and integer mathematical programming models in order to match the moments of the original data in the synthetic data. This method has no inherent disclosure risk and does not require parametric or distributional assumptions. We demonstrate this methodology using the Framingham Heart Study. Existing synthetic data methods that use chained equations were compared with our approach. We fit Cox proportional hazards, logistic regression, and nonparametric models to synthetic data and compared with models fitted to the original data. True coverage, the proportion of synthetic data parameter confidence intervals that include the original data's parameter estimate, was 100% for parametric models when up to four moments were matched, and consistently outperformed the chained equations approach. The area under the curve and accuracy of the nonparametric models trained on synthetic data marginally differed when tested on the full original data. Models were also trained on synthetic data and a partition of original data and were tested on a held-out portion of original data. Fourth-order moment matched synthetic data outperformed others with respect to fitted parametric models but did not always outperform other methods with fitted nonparametric models. No single synthetic data method consistently outperformed others when assessing the performance of nonparametric models. The performance of fourth-order moment matched synthetic data in fitting parametric models suggests its use in these cases. Our empirical results also suggest that the performance of synthetic data generation techniques, including the

  1. On Stable Marriages and Greedy Matchings

    Energy Technology Data Exchange (ETDEWEB)

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

    2016-12-11

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

  2. Sequence Matching Analysis for Curriculum Development

    National Research Council Canada - National Science Library

    Liem Yenny Bendatu; Bernardo Nugroho Yahya

    2015-01-01

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

  3. Design of New SAW DQPSK Matched Filter

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    A new surface acoustic wave differential quadraphase shift key(SAW DQPSK) spread spectrum(SS) signal matched filter based on the fusion of SS and differential modulation is reported. The design of multi-phase coded SAW matched filter is proposed rather than another design of SAW DQPSK filter, which can cut in a half of the delay time of SAW DQPSK matched filter and SAW fixed delay line(FDL) used for differential demodulation. This breakthrough is made the system largely reduce a size and process much easily. This method can also be feasible in other SAW MPSK matched filter design especially when the modulation phase number is larger than 4. The design example and its experimental results are given.

  4. Clothing Matching for Visually Impaired Persons.

    Science.gov (United States)

    Yuan, Shuai; Tian, Yingli; Arditi, Aries

    2011-01-01

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

  5. The Effectiveness of Advertising Matching Purchase Motivation

    NARCIS (Netherlands)

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

    2001-01-01

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

  6. AN EVEN ODD MULTIPLE PATTERN MATCHING ALGORITHM

    Directory of Open Access Journals (Sweden)

    Raju Bhukya,

    2011-03-01

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

  7. Fast algorithm on string cross pattern matching

    Institute of Scientific and Technical Information of China (English)

    Liu Gongshen; Li Jianhua; Li Shenghong

    2005-01-01

    Given a set U which is consisted of strings defined on alphabet ∑ , string cross pattern matching is to find all the matches between every two strings in U. It is utilized in text processing like removing the duplication of strings.This paper presents a fast string cross pattern matching algorithm based on extracting high frequency strings. Compared with existing algorithms including single-pattern algorithms and multi-pattern matching algorithms, this algorithm is featured by both low time complexityand low space complexity. Because Chinese alphabet is large and the average length of Chinese words is much short, this algorithm is more suitable to process the text written by Chinese, especially when the size of ∑ is large and the number of strings is far more than the maximum length of strings of set U.

  8. AN EVEN ODD MULTIPLE PATTERN MATCHING ALGORITHM

    OpenAIRE

    Raju Bhukya; DVLN Somayajulu

    2011-01-01

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

  9. Secure Fingerprint Alignment and Matching Protocols

    OpenAIRE

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

    2017-01-01

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

  10. Variability of soccer referees' match performances.

    Science.gov (United States)

    Weston, M; Drust, B; Atkinson, G; Gregson, W

    2011-03-01

    The aim of the present study was to determine the between-match variability in soccer referees' match performances. 1 269 individual match observations were undertaken on 59 referees (range 2-79 games per referee) officiating in the English Premier League and Championship from 2003/2004 to 2007/2008 using a computerised tracking system (Prozone (®), Leeds, England). Between-match coefficients of variation (CV) were calculated for all games and then compared between referee age and experience groups. High mean CVs were observed for high-speed running distance (25.9±10.1%), recovery time (32.7±13.8%), explosive sprints (34.3±16.6%), total number of sprints (54.0±20.7%) and number of match fouls (28±4.6%). Smaller CVs were observed for total distance covered (3.8±1.5%), top sprinting speed (5.6±10.9%), distance from the ball (4.2±1.9%) and the distance from fouls (9.9±4.3%). Variability in match activities was not influenced by referee age or experience. The present study's findings demonstrate that variability in soccer referees' match performances is high in some variables and not dependent on referee age or experience. Such variability means that research requires large sample sizes to detect real systematic changes in a number of performance characteristics when studied during matches. © Georg Thieme Verlag KG Stuttgart · New York.

  11. Cost-optimal power system extension under flow-based market coupling

    Energy Technology Data Exchange (ETDEWEB)

    Hagspiel, Simeon; Jaegemann, Cosima; Lindenberger, Dietmar [Koeln Univ. (Germany). Energiewirtschaftliches Inst.; Brown, Tom; Cherevatskiy, Stanislav; Troester, Eckehard [Energynautics GmbH, Langen (Germany)

    2013-05-15

    Electricity market models, implemented as dynamic programming problems, have been applied widely to identify possible pathways towards a cost-optimal and low carbon electricity system. However, the joint optimization of generation and transmission remains challenging, mainly due to the fact that different characteristics and rules apply to commercial and physical exchanges of electricity in meshed networks. This paper presents a methodology that allows to optimize power generation and transmission infrastructures jointly through an iterative approach based on power transfer distribution factors (PTDFs). As PTDFs are linear representations of the physical load flow equations, they can be implemented in a linear programming environment suitable for large scale problems. The algorithm iteratively updates PTDFs when grid infrastructures are modified due to cost-optimal extension and thus yields an optimal solution with a consistent representation of physical load flows. The method is first demonstrated on a simplified three-node model where it is found to be robust and convergent. It is then applied to the European power system in order to find its cost-optimal development under the prescription of strongly decreasing CO{sub 2} emissions until 2050.

  12. An information-flow-based model with dissipation, saturation and direction for active pathway inference

    Directory of Open Access Journals (Sweden)

    Wu Ling-Yun

    2010-05-01

    Full Text Available Abstract Background Biological systems process the genetic information and environmental signals through pathways. How to map the pathways systematically and efficiently from high-throughput genomic and proteomic data is a challenging open problem. Previous methods design different heuristics but do not describe explicitly the behaviours of the information flow. Results In this study, we propose new concepts of dissipation, saturation and direction to decipher the information flow behaviours in the pathways and thereby infer the biological pathways from a given source to its target. This model takes into account explicitly the common features of the information transmission and provides a general framework to model the biological pathways. It can incorporate different types of bio-molecular interactions to infer the signal transduction pathways and interpret the expression quantitative trait loci (eQTL associations. The model is formulated as a linear programming problem and thus is solved efficiently. Experiments on the real data of yeast indicate that the reproduced pathways are highly consistent with the current knowledge. Conclusions Our model explicitly treats the biological pathways as information flows with dissipation, saturation and direction. The effective applications suggest that the three new concepts may be valid to describe the organization rules of biological pathways. The deduced linear programming should be a promising tool to infer the various biological pathways from the high-throughput data.

  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. A Stereo Matching Algorithm Based on Four-Mo ded Census and Relative Confidence Plane Fitting

    Institute of Scientific and Technical Information of China (English)

    MEN Yubo; ZHANG Guoyin; MEN Chaoguang; LI Xiang; MA Ning

    2015-01-01

    A four-moded Census transform stereo matching algorithm using bidirectional constraint dynamic programming and relative confidence plane fitting is pro-posed to solve the problems of matching quality. Using the four-moded Census transform which adds a restrictive condition replaces traditional Census transform to improve matching accuracy and mean value of all pixels intensity replaces the center pixel intensity in the Census window to solve the problem of the center pixel distortion eff ectively, a refined initial local matching cost can be obtained. Dur-ing the disparity optimization, the difficulty of disparity computation in textureless areas is overcome by the esti-mated condition and defined relative confident pixels. Ex-periment results show that a better dense matching map can be obtained by the proposed algorithm.

  15. Automated curve matching techniques for reproducible, high-resolution palaeomagnetic dating

    Science.gov (United States)

    Lurcock, Pontus; Channell, James

    2016-04-01

    High-resolution relative palaeointensity (RPI) and palaeosecular variation (PSV) data are increasingly important for accurate dating of sedimentary sequences, often in combination with oxygen isotope (δ18O) measurements. A chronology is established by matching a measured downcore signal to a dated reference curve, but there is no standard methodology for performing this correlation. Traditionally, matching is done by eye, but this becomes difficult when two parameters (e.g. RPI and δ18O) are being matched simultaneously, and cannot be done entirely objectively or repeatably. More recently, various automated techniques have appeared for matching one or more signals. We present Scoter, a user-friendly program for dating by signal matching and for comparing different matching techniques. Scoter is a cross-platform application implemented in Python, and consists of a general-purpose signal processing and correlation library linked to a graphical desktop front-end. RPI, PSV, and other records can be opened, pre-processed, and automatically matched with reference curves. A Scoter project can be exported as a self-contained bundle, encapsulating the input data, pre-processing steps, and correlation parameters, as well as the program itself. The analysis can be automatically replicated by anyone using only the resources in the bundle, ensuring full reproducibility. The current version of Scoter incorporates an experimental signal-matching algorithm based on simulated annealing, as well as an interface to the well-established Match program of Lisiecki and Lisiecki (2002), enabling results of the two approaches to be compared directly.

  16. Nanoparticle-Directed Metal-Organic Framework/Porous Organic Polymer Monolithic Supports for Flow-Based Applications.

    Science.gov (United States)

    Darder, María Del Mar; Salehinia, Shima; Parra, José B; Herrero-Martinez, José M; Svec, Frantisek; Cerdà, Víctor; Turnes Palomino, Gemma; Maya, Fernando

    2017-01-18

    A two-step nanoparticle-directed route for the preparation of macroporous polymer monoliths for which the pore surface is covered with a metal-organic framework (MOF) coating has been developed to facilitate the use of MOFs in flow-based applications. The flow-through monolithic matrix was prepared in a column format from a polymerization mixture containing ZnO-nanoparticles. These nanoparticles embedded in the precursor monolith were converted to MOF coatings via the dissolution-precipitation equilibrium after filling the pores of the monolith with a solution of the organic linker. Pore surface coverage with the microporous zeolitic imidazolate framework ZIF-8 resulted in an increase in surface area from 72 to 273 m(2) g(-1). Monolithic polymer containing ZIF-8 coating was implemented as a microreactor catalyzing the Knoevenagel condensation reaction and also in extraction column format enabling the preconcentration of trace levels of toxic chlorophenols in environmental waters. Our approach can be readily adapted to other polymers and MOFs thus enabling development of systems for flow-based MOF applications.

  17. Job-Preference and Job-Matching Assessment Results and Their Association with Job Performance and Satisfaction among Young Adults with Developmental Disabilities

    Science.gov (United States)

    Hall, Julie; Morgan, Robert L.; Salzberg, Charles L.

    2014-01-01

    We investigated the effects of preference and degree of match on job performance of four 19 to 20-year-old young adults with developmental disabilities placed in community-based job conditions. We identified high-preference, high-matched and low-preference, low-matched job tasks using a video web-based assessment program. The job matching…

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

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

  20. Matched filter based iterative adaptive approach

    Science.gov (United States)

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

    2016-05-01

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

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

  2. Sketch Matching on Topology Product Graph.

    Science.gov (United States)

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

    2015-08-01

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

  3. Antenna impedance matching with neural networks.

    Science.gov (United States)

    Hemminger, Thomas L

    2005-10-01

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

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

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

    Directory of Open Access Journals (Sweden)

    Zhaohong Xu

    2008-11-01

    Full Text Available Human jumping motion includes stance phase, flight phase and landing impact phase. Jumping robot belongs to a variable constraints system because every phase has different constraint conditions. An unified dynamics equation during stance phase and flight phase is established based on floated-basis space. Inertia matching is used to analyze actuator/gear systems and select the optimum gear ratio based on the transmission performance between the torque produced at the actuator and the torque applied to the load. Load matching is an important index which affects jumping performance and reflects the capability of supporting a weight or mass. It also affects the distributing of the center of gravity (COG. Regarding jumping robot as a redundant manipulator with a load at end-effector, inertia matching can be applied to optimize load matching for jumping robot. Inertia matching manipulability and directional manipulability are easy to analyze and optimize the load matching parameters. A 5th order polynomial function is defined to plan COG trajectory of jumping motion, taking into account the constraint conditions of both velocity and acceleration. Finally, the numerical simulation of vertical jumping and experimental results show inertia matching is in direct proportion to jumping height, and inertia matching manipulability is a valid method to load matching optimization and conceptual design of robot.

  6. Covariant diagrams for one-loop matching

    CERN Document Server

    Zhang, Zhengkang

    2016-01-01

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

  7. Sidescan Sonar Image Matching Using Cross Correlation

    DEFF Research Database (Denmark)

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

    2003-01-01

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

  8. Matching a wavelet to ECG signal.

    Science.gov (United States)

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

    2006-01-01

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

  9. Multi scale feature based matched filter processing

    Institute of Scientific and Technical Information of China (English)

    LI Jun; HOU Chaohuan

    2004-01-01

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

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

  11. Efficient Catalog Matching with Dropout Detection

    CERN Document Server

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

    2014-01-01

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

  12. Unification and Matching on Compressed Terms

    CERN Document Server

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

    2010-01-01

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

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

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

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

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

    Energy Technology Data Exchange (ETDEWEB)

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

    2013-12-12

    continuously thrashed, they should be retrieved from the system memory and the procedure is slowed down by the increased latency. Efficient implementations of string matching algorithms have been the fo- cus of several works, targeting Field Programmable Gate Arrays [4, 25, 15, 5], highly multi-threaded solutions like the Cray XMT [34], multicore proces- sors [19] or heterogeneous processors like the Cell Broadband Engine [35, 22]. Recently, several researchers have also started to investigate the use Graphic Processing Units (GPUs) for string matching algorithms in security applica- tions [20, 10, 32, 33]. Most of these approaches mainly focus on reaching high peak performance, or try to optimize the memory occupation, rather than looking at performance stability. However, hardware solutions supports only small dictionary sizes due to lack of memory and are difficult to customize, while platforms such as the Cell/B.E. are very complex to program.

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

  19. Transverse Beam Matching Application for SNS

    CERN Document Server

    Chu, Chungming; Jeon Dong Oh; Plum, Michael

    2005-01-01

    An automated transverse beam matching application has been developed for the Spallation Neutron Source (SNS) beam transport lines. The application is written within the XAL Java framework and the matching algorithm is based on the simplex optimization method. Other functionalities, such as emittance calculated from profile monitor measurements (adopted from a LANL Fortran code), profile monitor display, and XAL on-line model calculation, are also provided by the application. Test results obtained during the SNS warm linac commissioning will be reported. A comparison between the emittances obtained from this application and an independent Trace-3D routine will also be shown.

  20. Similarity Based Semantic Web Service Match

    Science.gov (United States)

    Peng, Hui; Niu, Wenjia; Huang, Ronghuai

    Semantic web service discovery aims at returning the most matching advertised services to the service requester by comparing the semantic of the request service with an advertised service. The semantic of a web service are described in terms of inputs, outputs, preconditions and results in Ontology Web Language for Service (OWL-S) which formalized by W3C. In this paper we proposed an algorithm to calculate the semantic similarity of two services by weighted averaging their inputs and outputs similarities. Case study and applications show the effectiveness of our algorithm in service match.

  1. Towards the perfect prediction of soccer matches

    CERN Document Server

    Heuer, Andreas

    2012-01-01

    We present a systematic approach to the prediction of soccer matches. First, we show that the information about chances for goals is by far more informative than about the actual results. Second, we present a multivariate regression approach and show how the prediction quality increases with increasing information content. This prediction quality can be explicitly expressed in terms of just two parameters. Third, by disentangling the systematic and random components of soccer matches we can identify the optimum level of predictability. These concepts are exemplified for the German Bundesliga.

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

  3. Line matching for automatic change detection algorithm

    Science.gov (United States)

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

    2012-06-01

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

  4. General Phase Matching Condition for Quantum Searching

    CERN Document Server

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

    2001-01-01

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

  5. Development and elaboration of numerical method for simulating gas-liquid-solid three-phase flows based on particle method

    Science.gov (United States)

    Takahashi, Ryohei; Mamori, Hiroya; Yamamoto, Makoto

    2016-02-01

    A numerical method for simulating gas-liquid-solid three-phase flows based on the moving particle semi-implicit (MPS) approach was developed in this study. Computational instability often occurs in multiphase flow simulations if the deformations of the free surfaces between different phases are large, among other reasons. To avoid this instability, this paper proposes an improved coupling procedure between different phases in which the physical quantities of particles in different phases are calculated independently. We performed numerical tests on two illustrative problems: a dam-break problem and a solid-sphere impingement problem. The former problem is a gas-liquid two-phase problem, and the latter is a gas-liquid-solid three-phase problem. The computational results agree reasonably well with the experimental results. Thus, we confirmed that the proposed MPS method reproduces the interaction between different phases without inducing numerical instability.

  6. 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 , time efficient implementations, security and efficient space of the match on card. In this paper presented is the survey on the methods used to improve the accuracy in matching and memory usage by representing minutiae points in binary. In addition...

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

    DEFF Research Database (Denmark)

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

    2009-01-01

    We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known...

  8. Understanding the Interview and Ranking Behaviors of Unmatched International Medical Students and Graduates in the 2013 Main Residency Match

    Science.gov (United States)

    Liang, Mei; Curtin, Laurie S.; Signer, Mona M.; Savoia, Maria C.

    2015-01-01

    Background  Over the past decade, the number of unfilled positions in the National Resident Matching Program (NRMP) Main Residency Match has declined by one-third, while the number of unmatched applicants has grown by more than 50%, largely due to a rise in the number of international medical school students and graduates (IMGs). Although only half of IMG participants historically have matched to a first-year position, the Match experiences of unmatched IMGs have not been studied. Objective  We examined differences in interview and ranking behaviors between matched and unmatched IMGs participating in the 2013 Match and explored strategic errors made by unmatched IMGs when creating rank order lists. Methods  Rank order lists of IMGs who failed to match were analyzed in conjunction with their United States Medical Licensing Examination (USMLE) Step 1 scores and responses on the 2013 NRMP Applicant Survey. IMGs were categorized as “strong,” “solid,” “marginal,” or “weak” based on the perceived competitiveness of their USMLE Step 1 scores compared to other IMG applicants who matched in the same specialty. We examined ranking preferences and strategies by Match outcome. Results  Most unmatched IMGs were categorized as “marginal” or “weak”. However, unmatched IMGs who were non-US citizens presented more competitive USMLE Step 1 scores compared to unmatched IMGs who were US citizens. Unmatched IMGs were more likely than matched IMGs to rank programs at which they did not interview and to rank programs based on their perceived likelihood of matching. Conclusions  The interview and ranking behaviors of IMGs can have far-reaching consequences on their Match experience and outcomes. PMID:26692974

  9. Informing in-season tactical periodisation in team sport: development of a match difficulty index for Super Rugby.

    Science.gov (United States)

    Robertson, Samuel J; Joyce, David G

    2015-01-01

    In team sports, tactical periodisation refers to the planned manipulation of training loads with the aim of prioritising athlete readiness for matches of greatest importance. Although monitoring of athletes' physical condition is often used to inform this planning, the direct influence of external factors on match difficulty has not been well quantified. In this study, a 'match difficulty index' (MDI) for use in Super Rugby was developed, based on the influence imparted by five external factors on previous match outcomes. Specifically, information relating to match location, days break between matches, time-zone change and opposition ladder position (both current and previous year) were collected for matches played during the 2011-2013 Super Rugby seasons. Logistic regression analyses were used to assess the importance of each of these factors with respect to match outcome (win/loss), with opposition ladder position and match location (home, domestic away or international) exerting the greatest influence on match difficulty. Three separate cross-validated models were constructed, with match outcome classification performance reported as 66.2%, 65.5% and 63.7% respectively. The three MDI models emanating from this study can each be used to inform tactical periodisation program design both prior to and during the regular season.

  10. POINT PATTERN MATCHING ALGORITHM BASED ON POINT PAIR TOPOLOGICAL CHARACTERISTICS AND SPECTRAL MATCHING

    Institute of Scientific and Technical Information of China (English)

    Lu Chunyan; Zou Huanxin; Zhao Jian; Zhou Shilin

    2012-01-01

    Most of the Point Pattern Matching (PPM) algorithm performs poorly when the noise of the point's position and outliers exist.This paper presents a novel and robust PPM algorithm which combined Point Pair Topological Characteristics (PPTC) and Spectral Matching (SM) together to solve the afore mentioned issues.In which PPTC,a new shape descriptor,is firstly proposed.A new comparability measurement based on PPTC is defined as the matching probability.Finally,the correct matching results are achieved by the spectral matching method.The synthetic data experiments show its robustness by comparing with the other state-of-art algorithms and the real world data experiments show its effectiveness.

  11. Manifold Matching for High-Dimensional Pattern Recognition

    OpenAIRE

    HOTTA, Seiji

    2008-01-01

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

  12. History matching through dynamic decision-making.

    Science.gov (United States)

    Cavalcante, Cristina C B; Maschio, Célio; Santos, Antonio Alberto; Schiozer, Denis; Rocha, Anderson

    2017-01-01

    History matching is the process of modifying the uncertain attributes of a reservoir model to reproduce the real reservoir performance. It is a classical reservoir engineering problem and plays an important role in reservoir management since the resulting models are used to support decisions in other tasks such as economic analysis and production strategy. This work introduces a dynamic decision-making optimization framework for history matching problems in which new models are generated based on, and guided by, the dynamic analysis of the data of available solutions. The optimization framework follows a 'learning-from-data' approach, and includes two optimizer components that use machine learning techniques, such as unsupervised learning and statistical analysis, to uncover patterns of input attributes that lead to good output responses. These patterns are used to support the decision-making process while generating new, and better, history matched solutions. The proposed framework is applied to a benchmark model (UNISIM-I-H) based on the Namorado field in Brazil. Results show the potential the dynamic decision-making optimization framework has for improving the quality of history matching solutions using a substantial smaller number of simulations when compared with a previous work on the same benchmark.

  13. Matching Instruction to Children's Thinking about Division.

    Science.gov (United States)

    Weiland, Linnea

    1985-01-01

    Provides examples which suggest the importance of giving children opportunities to create their own arguments and of allowing them the opportunity to verbalize these arguments in clinical interviews. Also indicates that if time is spent interviewing children individually, instruction can be matched to the way they think. (JN)

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

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

  16. Mix 'n' match

    Energy Technology Data Exchange (ETDEWEB)

    Ross, P.D.

    1985-04-01

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

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

  18. Asynchronous event-based binocular stereo matching.

    Science.gov (United States)

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

    2012-02-01

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

  19. Minimal Mimicry: Mere Effector Matching Induces Preference

    Science.gov (United States)

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

    2012-01-01

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

  20. History Matching: Towards Geologically Reasonable Models

    DEFF Research Database (Denmark)

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

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

  1. The Effectiveness of Advertising Matching Purchase Motivation

    NARCIS (Netherlands)

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

    2001-01-01

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

  2. Impedance-matched drilling telemetry system

    Science.gov (United States)

    Normann, Randy A.; Mansure, Arthur J.

    2008-04-22

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

  3. Making better partner matches in brand alliances

    NARCIS (Netherlands)

    B. van den Bergh (Bram)

    2014-01-01

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

  4. Oscillating Rim Hook Tableaux and Colored Matchings

    CERN Document Server

    Chen, William Y C

    2011-01-01

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

  5. Matching in an Undisturbed Natural Human Environment

    Science.gov (United States)

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

    2010-01-01

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

  6. Dual Butterfly Match Filter VLSI Design

    Institute of Scientific and Technical Information of China (English)

    LIU Zhenyu; HAN Yueqiu

    2001-01-01

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

  7. Predictive mean matching imputation of semicontinuous variables

    NARCIS (Netherlands)

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

    2014-01-01

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

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

  9. Revisiting the Concept of "Style Match"

    Science.gov (United States)

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

    2013-01-01

    Background: Intellectual style, an encompassing term for such constructs as learning style, teaching style, teaching approach, and thinking style, refers to one's preferred way of processing information. For the past several decades, whether or not there is a need for a match between teachers' teaching styles and students' learning styles has been…

  10. A question of matching rather than scheduling

    NARCIS (Netherlands)

    van de Velde, S.L.

    1995-01-01

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

  11. The Complexity of Approximately Counting Stable Matchings

    CERN Document Server

    Chebolu, Prasad; Martin, Russell

    2010-01-01

    We investigate the complexity of approximately counting stable matchings in the $k$-attribute model, where the preference lists are determined by dot products of "preference vectors" with "attribute vectors", or by Euclidean distances between "preference points" and "attribute points". Irving and Leather proved that counting the number of stable matchings in the general case is $#P$-complete. Counting the number of stable matchings is reducible to counting the number of downsets in a (related) partial order and is interreducible, in an approximation-preserving sense, to a class of problems that includes counting the number of independent sets in a bipartite graph ($#BIS$). It is conjectured that no FPRAS exists for this class of problems. We show this approximation-preserving interreducibilty remains even in the restricted $k$-attribute setting when $k \\geq 3$ (dot products) or $k \\geq 2$ (Euclidean distances). Finally, we show it is easy to count the number of stable matchings in the 1-attribute dot-product ...

  12. Making better partner matches in brand alliances

    NARCIS (Netherlands)

    B. van den Bergh (Bram)

    2014-01-01

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

  13. Language style matching and police interrogation outcomes

    NARCIS (Netherlands)

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

    2014-01-01

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

  14. Nonlinear soliton matching between optical fibers

    DEFF Research Database (Denmark)

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

    2011-01-01

    In this Letter, we propose a generic nonlinear coupling coefficient, η2 NL ¼ ηjγ=β2jfiber2=jγ=β2jfiber1, which gives a quantitative measure for the efficiency of nonlinear matching of optical fibers by describing how a fundamental soliton couples from one fiber into another. Specifically, we use η...

  15. Adaptive and compressive matched field processing.

    Science.gov (United States)

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

    2017-01-01

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

  16. A Fast Generic Sequence Matching Algorithm

    CERN Document Server

    Musser, David R

    2008-01-01

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

  17. Impedance matching between ventricle and load.

    Science.gov (United States)

    Piene, H

    1984-01-01

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

  18. Occupational Curricula: The School/Job Match

    Science.gov (United States)

    Cohen, Lee; West, Leonard J.

    1978-01-01

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

  19. Accuracy and robustness evaluation in stereo matching

    Science.gov (United States)

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

    2016-09-01

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

  20. Revisiting the Concept of "Style Match"

    Science.gov (United States)

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

    2013-01-01

    Background: Intellectual style, an encompassing term for such constructs as learning style, teaching style, teaching approach, and thinking style, refers to one's preferred way of processing information. For the past several decades, whether or not there is a need for a match between teachers' teaching styles and students' learning styles has been…

  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. Product Substitutability and the Matching Law

    Science.gov (United States)

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

    2010-01-01

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

  3. Circular block matching based video stabilization

    Science.gov (United States)

    Xu, Lidong; Fu, Fangwen; Lin, Xinggang

    2005-07-01

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

  4. The Effect of Case Rate and Coinfection Rate on the Positive Predictive Value of a Registry Data-Matching Algorithm

    Science.gov (United States)

    Braunstein, Sarah L.; Stadelmann, Laura E.; Pathela, Preeti; Torian, Lucia V.

    2014-01-01

    Objective Statistical modeling has suggested that the prevalence of false matches in data matching declines as the events become rarer or the number of matches increases. We examined the effect of case rate and coinfection rate in the population on the positive predictive value (PPV) of a matching algorithm for HIV/AIDS and sexually transmitted disease (STD) surveillance registry data. Methods We used LinkPlus™, a probabilistic data-matching program, to match HIV/AIDS cases diagnosed in New York City (NYC) from 1981 to March 31, 2012, and reported to the NYC HIV/AIDS surveillance registry against syphilis and chlamydia cases diagnosed in NYC from January 1 to June 30, 2010, and reported to the NYC STD registry. Match results were manually reviewed to determine true matches. Results With an agreement/disagreement comparison score cutoff value of 10.0, LinkPlus identified 3,013 matches, of which 1,582 were determined to be true by manual review. PPV varied greatly in subpopulations with different case rates and coinfection rates. PPV was the highest (91.6%) in male syphilis cases, who had a relatively low case rate but a high HIV coinfection rate, and lowest (18.0%) in female chlamydia cases, who had a high case rate but a low HIV coinfection rate. When the cutoff value was increased to 15.0, PPVs in male syphilis and female chlamydia cases increased to 98.3% and 90.5%, respectively. Conclusions Case rates and coinfection rates have a significant effect on the PPV of a registry data-matching algorithm: PPV decreases as the case rate increases and coinfection rate decreases. Before conducting registry data matching, program staff should assess the case rate and coinfection rate of the population included in the data matching and select an appropriate matching algorithm. PMID:24385653

  5. Generating a Pattern Matching Compiler by Partial Evaluation

    DEFF Research Database (Denmark)

    Jørgensen, Knud Jesper

    1991-01-01

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

  6. Optimal affine-invariant matching: performance characterization

    Science.gov (United States)

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

    1992-04-01

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

  7. Optimally Joint Subcarrier Matching and Power Allocation in OFDM Multihop System

    Directory of Open Access Journals (Sweden)

    Shuyuan Yang

    2008-04-01

    Full Text Available Orthogonal frequency division multiplexing (OFDM multihop system is a promising way to increase capacity and coverage. In this paper, we propose an optimally joint subcarrier matching and power allocation scheme to further maximize the total channel capacity with the constrained total system power. First, the problem is formulated as a mixed binary integer programming problem, which is prohibitive to find the global optimum in terms of complexity. Second, by making use of the equivalent channel power gain for any matched subcarrier pair, a low complexity scheme is proposed. The optimal subcarrier matching is to match subcarriers by the order of the channel power gains. The optimal power allocation among the matched subcarrier pairs is water-filling. An analytical argument is given to prove that the two steps achieve the optimally joint subcarrier matching and power allocation. The simulation results show that the proposed scheme achieves the largest total channel capacity as compared to the other schemes, where there is no subcarrier matching or no power allocation.

  8. Optimally Joint Subcarrier Matching and Power Allocation in OFDM Multihop System

    Directory of Open Access Journals (Sweden)

    Wang Wenyi

    2008-01-01

    Full Text Available Orthogonal frequency division multiplexing (OFDM multihop system is a promising way to increase capacity and coverage. In this paper, we propose an optimally joint subcarrier matching and power allocation scheme to further maximize the total channel capacity with the constrained total system power. First, the problem is formulated as a mixed binary integer programming problem, which is prohibitive to find the global optimum in terms of complexity. Second, by making use of the equivalent channel power gain for any matched subcarrier pair, a low complexity scheme is proposed. The optimal subcarrier matching is to match subcarriers by the order of the channel power gains. The optimal power allocation among the matched subcarrier pairs is water-filling. An analytical argument is given to prove that the two steps achieve the optimally joint subcarrier matching and power allocation. The simulation results show that the proposed scheme achieves the largest total channel capacity as compared to the other schemes, where there is no subcarrier matching or no power allocation.

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

    Institute of Scientific and Technical Information of China (English)

    ZHANG Shuyou; YI Guodong; XU Xiaofeng

    2007-01-01

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

  10. Image Searching within Another Image Using Image Matching and Genetic Algorithms

    Directory of Open Access Journals (Sweden)

    Mehmet Karakoc

    2015-10-01

    Full Text Available Main focus of this work is to realize image searching within another image in an efficient way. Image searching within another image is accomplished through the integrated use of image matching techniques and searching algorithms. Artificial neural networks along with various image features such as average color value, color standard deviation, correlation and edge parameters are used for image matching whereas genetic algorithms were used for image searching. In the work presented in this paper, an integrated method based on smart searching algorithms, quick image matching methods and parallel programming techniques were proposed and implemented. Proposed method was tested on several low and high-resolution reference and template images. Results revealed that the proposed method can successfully match images and significantly reduce the total search time.

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

    Directory of Open Access Journals (Sweden)

    Erin Dehon

    2015-11-01

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

  12. Systems and methods for measuring component matching

    Science.gov (United States)

    Courter, Kelly J. (Inventor); Slenk, Joel E. (Inventor)

    2006-01-01

    Systems and methods for measuring a contour match between adjacent components are disclosed. In one embodiment, at least two pressure sensors are located between adjacent components. Each pressure sensor is adapted to obtain a pressure measurement at a location a predetermined distance away from the other pressure sensors, and to output a pressure measurement for each sensor location. An output device is adapted to receive the pressure measurements from at least two pressure sensors and display the pressure measurements. In one aspect, the pressure sensors include flexible thin film pressure sensors. In accordance with other aspects of the invention, a method is provided for measuring a contour match between two interfacing components including measuring at least one pressure applied to at least one sensor between the interfacing components.

  13. Improving Schema Matching with Linked Data

    CERN Document Server

    Assaf, Ahmad; Senart, Aline; Follenfant, Corentin; Troncy, Raphaël; Trastour, David

    2012-01-01

    With today's public data sets containing billions of data items, more and more companies are looking to integrate external data with their traditional enterprise data to improve business intelligence analysis. These distributed data sources however exhibit heterogeneous data formats and terminologies and may contain noisy data. In this paper, we present a novel framework that enables business users to semi-automatically perform data integration on potentially noisy tabular data. This framework offers an extension to Google Refine with novel schema matching algorithms leveraging Freebase rich types. First experiments show that using Linked Data to map cell values with instances and column headers with types improves significantly the quality of the matching results and therefore should lead to more informed decisions.

  14. Refraction and wave matching in hyperbolic thermoelasticity

    Directory of Open Access Journals (Sweden)

    Józef Rafa

    2015-03-01

    Full Text Available The subject of the publication concerns the propagation of thermoelastic waves with a particular emphasis on the refraction of waves at the boundary of a layer laying (resting on a halfspace. Analogously to the effect of wave matching, which appears in the case of acoustic and electromagnetic waves, the impedance of a thermoelastic wave has been introduced and its influence and the reflection andrefraction on the boundary at media has been investigated. The model of the medium describes a mutual coupling of mechanical and thermalinteractions with a wave type propagation of heat in media taken into account.[b]Keywords[/b]: hyperbolic thermoelasticity, wave impedance of a thermoelastic medium,refraction and wave matching

  15. Passport officers' errors in face matching.

    Directory of Open Access Journals (Sweden)

    David White

    Full Text Available Photo-ID is widely used in security settings, despite research showing that viewers find it very difficult to match unfamiliar faces. Here we test participants with specialist experience and training in the task: passport-issuing officers. First, we ask officers to compare photos to live ID-card bearers, and observe high error rates, including 14% false acceptance of 'fraudulent' photos. Second, we compare passport officers with a set of student participants, and find equally poor levels of accuracy in both groups. Finally, we observe that passport officers show no performance advantage over the general population on a standardised face-matching task. Across all tasks, we observe very large individual differences: while average performance of passport staff was poor, some officers performed very accurately--though this was not related to length of experience or training. We propose that improvements in security could be made by emphasising personnel selection.

  16. Rotation Invariant Matching of Partial Shoeprints

    Directory of Open Access Journals (Sweden)

    Khan Mahmood Ahmed

    2014-09-01

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

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

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

  19. Flexible Hardware-Based Stereo Matching

    Directory of Open Access Journals (Sweden)

    2009-02-01

    Full Text Available To enable adaptive stereo vision for hardware-based embedded stereo vision systems, we propose a novel technique for implementing a flexible block size, disparity range, and frame rate. By reusing existing resources of a static architecture, rather than dynamic reconfiguration, our technique is compatible with application specific integrated circuit (ASIC as well as field programmable gate array (FPGA implementations. We present the corresponding block diagrams and their implementation in our hardware-based stereo matching architecture. Furthermore, we show the impact of flexible stereo matching on the generated disparity maps for the sum of absolute differences (SADs, rank, and census transform algorithms. Finally, we discuss the resource usage and achievable performance when synthesized for an Altera Stratix II FPGA.

  20. Flexible Hardware-Based Stereo Matching

    Directory of Open Access Journals (Sweden)

    Steininger Andreas

    2008-01-01

    Full Text Available Abstract To enable adaptive stereo vision for hardware-based embedded stereo vision systems, we propose a novel technique for implementing a flexible block size, disparity range, and frame rate. By reusing existing resources of a static architecture, rather than dynamic reconfiguration, our technique is compatible with application specific integrated circuit (ASIC as well as field programmable gate array (FPGA implementations. We present the corresponding block diagrams and their implementation in our hardware-based stereo matching architecture. Furthermore, we show the impact of flexible stereo matching on the generated disparity maps for the sum of absolute differences (SADs, rank, and census transform algorithms. Finally, we discuss the resource usage and achievable performance when synthesized for an Altera Stratix II FPGA.

  1. Optimal Feedback Communication via Posterior Matching

    CERN Document Server

    Shayevitz, Ofer

    2009-01-01

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

  2. Fast Legendre moment computation for template matching

    Science.gov (United States)

    Li, Bing C.

    2017-05-01

    Normalized cross correlation (NCC) based template matching is insensitive to intensity changes and it has many applications in image processing, object detection, video tracking and pattern recognition. However, normalized cross correlation implementation is computationally expensive since it involves both correlation computation and normalization implementation. In this paper, we propose Legendre moment approach for fast normalized cross correlation implementation and show that the computational cost of this proposed approach is independent of template mask sizes which is significantly faster than traditional mask size dependent approaches, especially for large mask templates. Legendre polynomials have been widely used in solving Laplace equation in electrodynamics in spherical coordinate systems, and solving Schrodinger equation in quantum mechanics. In this paper, we extend Legendre polynomials from physics to computer vision and pattern recognition fields, and demonstrate that Legendre polynomials can help to reduce the computational cost of NCC based template matching significantly.

  3. Image Matching by Using Fuzzy Transforms

    Directory of Open Access Journals (Sweden)

    Ferdinando Di Martino

    2013-01-01

    Full Text Available We apply the concept of Fuzzy Transform (for short, F-transform for improving the results of the image matching based on the Greatest Eigen Fuzzy Set (for short, GEFS with respect to max-min composition and the Smallest Eigen Fuzzy Set (for short, SEFS with respect to min-max composition already studied in the literature. The direct F-transform of an image can be compared with the direct F-transform of a sample image to be matched and we use suitable indexes to measure the grade of similarity between the two images. We make our experiments on the image dataset extracted from the well-known Prima Project View Sphere Database, comparing the results obtained with this method with that one based on the GEFS and SEFS. Other experiments are performed on frames of videos extracted from the Ohio State University dataset.

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

    Science.gov (United States)

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

    2010-01-01

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

  5. On the tautology of the matching law.

    Science.gov (United States)

    Rachlin, H

    1971-03-01

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

  6. Profile Terry Young: man of the match

    CERN Multimedia

    2003-01-01

    Terry Young, chair of health systems at Brunel University, has received a grant of 3.3 million pounds from EPSRC. The money will create the Multidisciplinary Assessment of Technology Centre for Health (MATCH). The aim of the centre is to aid the progress of medical devices from concept to patient care by developing criteria to single out promising technologies and helping them to market (1 page).

  7. Message passing with relaxed moment matching

    OpenAIRE

    Qi, Yuan; Guo, Yandong

    2012-01-01

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

  8. Vividness Effects: A Resource-Matching Perspective.

    OpenAIRE

    Keller, Punam Anand; Block, Lauren G

    1997-01-01

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

  9. Intuitionistic Fuzzy Automaton for Approximate String Matching

    Directory of Open Access Journals (Sweden)

    K.M. Ravi

    2014-03-01

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

  10. Performance Evaluation of Tree Object Matching

    DEFF Research Database (Denmark)

    Somchaipeng, Kerawit; Sporring, Jon; Kreiborg, Sven

    2005-01-01

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

  11. New multi-pattern matching algorithm

    Institute of Scientific and Technical Information of China (English)

    Liu Gongshen; Li Jianhua; Li Shenghong

    2006-01-01

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

  12. Matched Field Tomographic Inversion for Geoacoustic Properties

    Science.gov (United States)

    2016-06-07

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

  13. Matching point clouds: limits and possibilities.

    Science.gov (United States)

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

    2002-01-01

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

  14. Impedance Matched Absorptive Thermal Blocking Filters

    CERN Document Server

    Wollack, E J; Rostem, K; U-Yen, K

    2014-01-01

    We have designed, fabricated and characterized absorptive thermal blocking filters for cryogenic microwave applications. The transmission line filter's input characteristic impedance is designed to match $50\\,\\Omega$ and its response has been validated from 0-to-50\\,GHz. The observed return loss in the 0-to-20\\,GHz design band is greater than $20\\,$dB and shows graceful degradation with frequency. Design considerations and equations are provided that enable this approach to be scaled and modified for use in other applications.

  15. Design of an impedance matching acoustic bend

    OpenAIRE

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

    2017-01-01

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

  16. Labor search and matching in macroeconomics

    OpenAIRE

    2007-01-01

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

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

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

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

  20. Computing the Matched Filter in Linear Time

    CERN Document Server

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

    2011-01-01

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