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

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

  2. Towards Separation of Concerns in Flow-Based Programming

    DEFF Research Database (Denmark)

    Zarrin, Bahram; Baumeister, Hubert

    2015-01-01

    Flow-Based Programming (FBP) is a programming paradigm that models software systems as a directed graph of predefined processes which run asynchronously and exchange data through input and output ports. FBP decomposes software systems into a network of processes. However there are concerns...

  3. DOE Matching Grant Program

    International Nuclear Information System (INIS)

    Tsoukalas, L.

    2002-01-01

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

  4. DOE Matching Grant Program; FINAL

    International Nuclear Information System (INIS)

    Dr Marvin Adams

    2002-01-01

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

  5. University Reactor Matching Grants Program

    International Nuclear Information System (INIS)

    John Valentine; Farzad Rahnema; Said Abdel-Khalik

    2003-01-01

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

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

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

  7. The urology residency matching program in practice.

    Science.gov (United States)

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

    2000-06-01

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

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

    Science.gov (United States)

    2011-01-28

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

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

    Science.gov (United States)

    2013-12-05

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

  10. 32 CFR 701.125 - Computer matching program.

    Science.gov (United States)

    2010-07-01

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

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

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

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

    Science.gov (United States)

    2013-03-12

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

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

    Science.gov (United States)

    2013-06-27

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

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

    Science.gov (United States)

    2013-03-12

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

  15. DOE/Industry Matching Grant Program

    International Nuclear Information System (INIS)

    Lee, John C.

    2003-01-01

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

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

    Science.gov (United States)

    2013-03-12

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

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

    Science.gov (United States)

    2013-01-08

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

  18. DOE Utility Matching Program Final Technical Report

    International Nuclear Information System (INIS)

    Haghighat, Alireza

    2002-01-01

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

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

    Science.gov (United States)

    2012-12-20

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

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

    Science.gov (United States)

    2013-03-12

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

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

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

    International Nuclear Information System (INIS)

    Gieraltowski, G.F.

    1976-02-01

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

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

    Science.gov (United States)

    2013-07-29

    ... Responsibilities for Maintaining Records about Individuals'', dated February 8, 1996 (February 20, 1996, 61 FR 6427... purpose of this matching program is to provide the SPAAs with data from DoD military and civilian pay files, the military retired pay files, survivor pay files and the OPM civilian retired and survivor pay...

  4. 76 FR 50198 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2011-08-12

    ... Management (OPM) (source agency). This matching program will become effective as explained in this notice. In... between ED and OPM is to assist ED in detecting improper disbursements or overpayments of need- based... underreport family income on the Free Application for Federal Student Aid (FAFSA). Financial need is...

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

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

    Science.gov (United States)

    2012-04-25

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

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

    Science.gov (United States)

    2012-02-08

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

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

    Science.gov (United States)

    2010-11-05

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

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

    Science.gov (United States)

    2012-04-25

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

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

    Directory of Open Access Journals (Sweden)

    Michael A. Gisondi

    2017-05-01

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

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

    Science.gov (United States)

    2011-03-02

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

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

  13. 76 FR 50460 - Privacy Act of 1974; Notice of a Computer Matching Program

    Science.gov (United States)

    2011-08-15

    ... records will be disclosed for the purpose of this computer match are as follows: OPM will use the system... entitled to health care under TRS and TRR.'' E. Description of Computer Matching Program: Under the terms...; Notice of a Computer Matching Program AGENCY: Defense Manpower Data Center, Department of Defense (DoD...

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

    Science.gov (United States)

    2011-01-10

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

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

    Science.gov (United States)

    2012-12-18

    ...; Computer Matching Program (Social Security Administration (SSA)/Office of Personnel Management (OPM.... SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Public Law (Pub... computer matching involving the Federal government could be performed and adding certain protections for...

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

    Science.gov (United States)

    2010-02-01

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2009-0043] Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration/Railroad Retirement Board (SSA/RRB))-- Match... INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 Public Law (Pub. L.) 100-503...

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

    Science.gov (United States)

    2013-06-21

    ... DEPARTMENT OF TRANSPORTATION Federal Aviation Administration Space Transportation Infrastructure...-availability of Space Transportation Infrastructure Matching Grants in FY 2013. SUMMARY: The Office of... Administrator for Commercial Space Transportation. [FR Doc. 2013-14859 Filed 6-20-13; 8:45 am] BILLING CODE 4910...

  18. 77 FR 56824 - Privacy Act of 1974; Computer Matching Program

    Science.gov (United States)

    2012-09-14

    ... functions and duties of the Chief Operating Officer. Dated: September 11, 2012. James F. Manning, Chief of... recipients of, financial assistance under title IV of the Higher Education Act of 1965, as amended (HEA), as.... 4. Categories of Records and Individuals Covered The records to be used in the match and the roles...

  19. 78 FR 21713 - Privacy Act of 1974: Computer Matching Program

    Science.gov (United States)

    2013-04-11

    ... income information from other agencies for purposes of verification of income for determining eligibility... data needed for the income verification process. The VA records involved in the match are ``Enrollment and Eligibility Records--VA'' (147VA16). The SSA records are from the Earnings Recording and Self...

  20. 75 FR 54966 - Privacy Act of 1974: Computer Matching Program

    Science.gov (United States)

    2010-09-09

    ... agencies for purposes of verification of income for determining eligibility for benefits. 38 U.S.C. 1710(a... income verification process. The VA records involved in the match are ``Enrollment and Eligibility Records--VA'' (147VA16). The SSA records are from the Earnings Recording and Self- Employment Income...

  1. Final report to DOE: Matching Grant Program for the Penn State University Nuclear Engineering Program

    International Nuclear Information System (INIS)

    Jack S. Brenizer, Jr.

    2003-01-01

    The DOE/Industry Matching Grant Program is designed to encourage collaborative support for nuclear engineering education as well as research between the nation's nuclear industry and the U.S. Department of Energy (DOE). Despite a serious decline in student enrollments in the 1980s and 1990s, the discipline of nuclear engineering remained important to the advancement of the mission goals of DOE. The program is designed to ensure that academic programs in nuclear engineering are maintained and enhanced in universities throughout the U.S. At Penn State, the Matching Grant Program played a critical role in the survival of the Nuclear Engineering degree programs. Funds were used in a variety of ways to support both undergraduate and graduate students directly. Some of these included providing seed funding for new graduate research initiatives, funding the development of new course materials, supporting new teaching facilities, maintenance and purchase of teaching laboratory equipment, and providing undergraduate scholarships, graduate fellowships, and wage payroll positions for students

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

    Science.gov (United States)

    2010-03-15

    ... Naturalization Service. SUMMARY: Pursuant to the Office of Management and Budget (OMB) Final Guidance... and Mathematics Access to Retain Talent Grant Program; the Iraq and Afghanistan Service Grant Program... met. 6. Address for Receipt of Public Comments or Inquires. Mr. Leroy Everett, Management and Program...

  3. Learning Expressive Linkage Rules for Entity Matching using Genetic Programming

    OpenAIRE

    Isele, Robert

    2013-01-01

    A central problem in data integration and data cleansing is to identify pairs of entities in data sets that describe the same real-world object. Many existing methods for matching entities rely on explicit linkage rules, which specify how two entities are compared for equivalence. Unfortunately, writing accurate linkage rules by hand is a non-trivial problem that requires detailed knowledge of the involved data sets. Another important issue is the efficient execution of link...

  4. Matching grant program for university nuclear engineering education

    International Nuclear Information System (INIS)

    Bajorek, Stephen M.

    2002-01-01

    The grant augmented funds from Westinghouse Electric Co. to enhance the Nuclear Engineering program at KSU. The program was designed to provide educational opportunities and to train engineers for careers in the nuclear industry. It provided funding and access to Westinghouse proprietary design codes for graduate and undergraduate studies on topics of current industrial importance. Students had the opportunity to use some of the most advanced nuclear design tools in the industry and to work on actual design problems. The WCOBRA/TRAC code was used to simulate loss of coolant accidents (LOCAs)

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

    Science.gov (United States)

    2013-03-12

    ... the New York Department of Labor. SUMMARY: This document provides notice of the existence of a...), requires DHS to establish a system for the verification of immigration status of alien applicants for, or... order to prevent the issuance of benefits to alien applicants who are not entitled to program benefits...

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

    Science.gov (United States)

    2012-07-25

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2011-0090] Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration (SSA)/Department of Veterans Affairs (VA.... SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503...

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

    Science.gov (United States)

    2012-09-06

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2012-0016] Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration (SSA)/Department of Veterans Affairs (VA.... SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503...

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

    Science.gov (United States)

    2012-06-01

    ...; Computer Matching Program (SSA/ Department of Homeland Security (DHS))--Match Number 1010 AGENCY: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer matching program that... amended by the Computer Matching and Privacy Protection Act of 1988, as amended, and the regulations and...

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

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

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

    Science.gov (United States)

    2013-11-21

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

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

    Science.gov (United States)

    2011-11-17

    ...; Computer Matching Program (SSA/ Law Enforcement Agencies (LEA)) Match Number 5001 AGENCY: Social Security... protections for such persons. The Privacy Act, as amended, regulates the use of computer matching by Federal... accordance with the Privacy Act of 1974, as amended by the Computer Matching and Privacy Protection Act of...

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

  14. 75 FR 53004 - Privacy Act of 1974, as Amended; Notice of Computer-Matching Program (Railroad Retirement Board...

    Science.gov (United States)

    2010-08-30

    ... report of this computer-matching program with the Committee on Homeland Security and Governmental Affairs... INFORMATION: A. General The Computer-Matching and Privacy Protection Act of 1988, (Pub. L. 100-503), amended... RAILROAD RETIREMENT BOARD Privacy Act of 1974, as Amended; Notice of Computer-Matching Program...

  15. 78 FR 34678 - Privacy Act of 1974, as Amended; Notice of Computer Matching Program (Railroad Retirement Board...

    Science.gov (United States)

    2013-06-10

    ... notice of its renewal of an ongoing computer-matching program with the Social Security Administration... computer-matching program with the Committee on Homeland Security and Governmental Affairs of the Senate... Computer Matching and Privacy Protection Act of 1988, (Pub. L. 100-503), amended by the Privacy Act of 1974...

  16. 78 FR 70971 - Privacy Act of 1974, as Amended; Notice of Computer Matching Program (Railroad Retirement Board...

    Science.gov (United States)

    2013-11-27

    ... will file a report of this computer-matching program with the Committee on Homeland Security and... . SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988, (Pub. L. 100-503... RAILROAD RETIREMENT BOARD Privacy Act of 1974, as Amended; Notice of Computer Matching Program...

  17. 75 FR 53005 - Privacy Act of 1974, as amended; Notice of Computer Matching Program (Railroad Retirement Board...

    Science.gov (United States)

    2010-08-30

    ... notice of its renewal of an ongoing computer-matching program with the Social Security Administration... computer-matching program with the Committee on Homeland Security and Governmental Affairs of the Senate.... General The Computer Matching and Privacy Protection Act of 1988, (Pub. L. 100-503), amended by the...

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

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

    International Nuclear Information System (INIS)

    Holliday, Emma B.; Thomas, Charles R.; Kusano, Aaron S.

    2015-01-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

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

    Science.gov (United States)

    2010-04-01

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

  1. 77 FR 13388 - Treasury Inspector General for Tax Administration; Privacy Act of 1974: Computer Matching Program

    Science.gov (United States)

    2012-03-06

    ... DEPARTMENT OF THE TREASURY Treasury Inspector General for Tax Administration; Privacy Act of 1974...: Notice. SUMMARY: Pursuant to 5 U.S.C. 552a, the Privacy Act of 1974, as amended, notice is hereby given... Administration. Beginning and Completion Dates: This program of computer matches is expected to commence on March...

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

    Science.gov (United States)

    2010-05-07

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

  3. Away Rotations and Matching in Integrated Plastic Surgery Residency: Applicant and Program Director Perspectives.

    Science.gov (United States)

    Drolet, Brian C; Brower, Jonathan P; Lifchez, Scott D; Janis, Jeffrey E; Liu, Paul Y

    2016-04-01

    Although nearly all medical students pursuing integrated plastic surgery residency participate in elective rotations away from their home medical school, the value and costs of these "away" rotations have not been well studied. The authors surveyed all integrated plastic surgery program directors and all applicants in the 2015 National Residency Matching Program. Forty-two program directors and 149 applicants (64 percent and 70 percent response rate, respectively) completed the survey. Applicants reported 13.7 weeks spent on plastic surgery rotations during medical school, including a mean of 9.2 weeks on away rotations. Average reported cost for away rotations was $3591 per applicant. Both applicants and program directors most commonly reported "making a good impression" (44.6 percent and 36.6 percent, respectively) or finding a "good-fit" program (27.7 percent and 48.8 percent, respectively) as the primary goal for away rotations. Almost all applicants (91.1 percent) believed an away rotation made them more competitive for matching to a program at which they rotated. Program directors ranked a strong away rotation performance as the most important residency selection criterion. Twenty-seven percent of postgraduate year-1 positions were filled by an away rotatorm and an additional 17 percent were filled by a home medical student. Away rotations appear to be mutually beneficial for applicants and programs in helping to establish a good fit between students and training programs through an extended interaction with the students, residents, and faculty. In addition, making a good impression on a senior elective rotation (home or away) may improve an applicant's chance of matching to a residency program.

  4. Combining machine learning and matching techniques to improve causal inference in program evaluation.

    Science.gov (United States)

    Linden, Ariel; Yarnold, Paul R

    2016-12-01

    Program evaluations often utilize various matching approaches to emulate the randomization process for group assignment in experimental studies. Typically, the matching strategy is implemented, and then covariate balance is assessed before estimating treatment effects. This paper introduces a novel analytic framework utilizing a machine learning algorithm called optimal discriminant analysis (ODA) for assessing covariate balance and estimating treatment effects, once the matching strategy has been implemented. This framework holds several key advantages over the conventional approach: application to any variable metric and number of groups; insensitivity to skewed data or outliers; and use of accuracy measures applicable to all prognostic analyses. Moreover, ODA accepts analytic weights, thereby extending the methodology to any study design where weights are used for covariate adjustment or more precise (differential) outcome measurement. One-to-one matching on the propensity score was used as the matching strategy. Covariate balance was assessed using standardized difference in means (conventional approach) and measures of classification accuracy (ODA). Treatment effects were estimated using ordinary least squares regression and ODA. Using empirical data, ODA produced results highly consistent with those obtained via the conventional methodology for assessing covariate balance and estimating treatment effects. When ODA is combined with matching techniques within a treatment effects framework, the results are consistent with conventional approaches. However, given that it provides additional dimensions and robustness to the analysis versus what can currently be achieved using conventional approaches, ODA offers an appealing alternative. © 2016 John Wiley & Sons, Ltd.

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

    ... required by the Privacy Act of 1974, as amended, the RRB is issuing a public notice in the Federal Register... benefits under the Railroad Retirement Act that the RRB plans to share this computer matching data with...

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

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

    Science.gov (United States)

    2010-10-12

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

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

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2010-0034] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Bureau of the Public Debt (BPD))--Match Number 1304 AGENCY: Social Security... as shown above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection...

  9. 78 FR 12128 - Privacy Act of 1974; Computer Matching Program (SSA/Department of the Treasury, Internal Revenue...

    Science.gov (United States)

    2013-02-21

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2012-0067] Privacy Act of 1974; Computer Matching... Security Administration (SSA). ACTION: Notice of a renewal of an existing computer matching program... INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Public Law (Pub. L.) 100-503...

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

    Science.gov (United States)

    2010-04-09

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

  11. 75 FR 32833 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Office of Personnel Management...

    Science.gov (United States)

    2010-06-09

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA-2009-0077] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Office of Personnel Management (OPM))--Match 1307 AGENCY: Social Security... INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Public Law (Pub. L.) 100-503...

  12. 75 FR 59780 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Railroad Retirement Board (RRB...

    Science.gov (United States)

    2010-09-28

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2010-0040] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Railroad Retirement Board (RRB))--Match Number 1006 AGENCY: Social Security...: A. General The Computer Matching and Privacy Protection Act of 1988 (Pub. L.) 100-503), amended the...

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

    Science.gov (United States)

    2011-03-07

    ...; Computer Matching Program (SSA/ Bureau of the Public Debt (BPD))--Match Number 1038 AGENCY: Social Security... as shown above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection... containing SSNs extracted from the Supplemental Security Record database. Exchanges for this computer...

  14. Medical Student Summer Externship Program: Increasing the Number Matching in Family Practice

    Directory of Open Access Journals (Sweden)

    Holly Cronau

    2004-02-01

    Full Text Available Background and Objectives. The number of US allopathic medical school graduates choosing a residency in family medicine has fallen from 13.4% in 1999 to 10.5% in 2002. Concern about declining numbers has led to the development of programs to provide medical students exposure to family medicine outside the clerkship. This paper reports on the development and longitudinal achievements of a clinical summer externship program 1993 to 1999. Methods. The program description, practice settings, students’ experiences, and department commitment are described. The purpose of this prospective study is to determine the percentage of family medicine summer externship participants (n=115 who match into family medicine. Results. During the six years studied, 49 (43.4% of the participants matched into family medicine. Program participants viewed the program favorably, mean = 5.82 out of 6. Conclusions. The Ohio State University Department of Family Medicine Medical Student Summer Externship Program demonstrates an effective educational experience that can increase and/or attain the proportion of students going into family medicine at the time of graduation

  15. 78 FR 3474 - Privacy Act of 1974; Computer Matching Program Between the Office Of Personnel Management and...

    Science.gov (United States)

    2013-01-16

    ... amended by the Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503), Office of... Security benefit information to OPM via direct computer link for the administration of certain programs by... OFFICE OF PERSONNEL MANAGEMENT Privacy Act of 1974; Computer Matching Program Between the Office...

  16. Gender Diversity in Anesthesiology Programs: The Role of Current Residents and Department Leadership in the 2014 Match Results.

    Science.gov (United States)

    Kranner, Paul W; Mussehl, Denise A; Hess, Aaron S

    2016-01-01

    Nearly half of graduates of American medical colleges are women, yet the percentage of women entering accredited anesthesiology programs remains less than 40%. There are obviously many factors that influence the choice of a residency training program, from geography to reputation to the atmosphere, composition and camaraderie of the department. We examined whether a greater number of current female residents, a female Chair, or a female Program Director were associated with a program matching a greater number of female candidates in the 2014 NRMP Match. An electronic questionnaire was sent to all 132 ACGME-accredited anesthesiology programs immediately following the 2014 Match seeking information on the gender mix of their current residents, the gender of the Chair and Program Director, and the gender composition of their newly-matched candidates. The percentage of current female residents was significantly associated with the percentage of incoming female residents (p = 0.013). There was no association between the percentage of new female residents obtained in the Match and the presence of a female Chair or Program Director. The results of the 2013 NRMP anesthesiology match indicate that programs with a higher proportion of female residents were able to sustain that diversity and successfully match a higher percentage of female candidates. No correlation was seen with Chair and Program Director gender, suggesting further work is needed to define the influence of female role models on female applicants' choice of anesthesiology residency programs.

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

  18. Bias due to sample selection in propensity score matching for a supportive housing program evaluation in New York City.

    Directory of Open Access Journals (Sweden)

    Sungwoo Lim

    Full Text Available OBJECTIVES: Little is known about influences of sample selection on estimation in propensity score matching. The purpose of the study was to assess potential selection bias using one-to-one greedy matching versus optimal full matching as part of an evaluation of supportive housing in New York City (NYC. STUDY DESIGN AND SETTINGS: Data came from administrative data for 2 groups of applicants who were eligible for an NYC supportive housing program in 2007-09, including chronically homeless adults with a substance use disorder and young adults aging out of foster care. We evaluated the 2 matching methods in their ability to balance covariates and represent the original population, and in how those methods affected outcomes related to Medicaid expenditures. RESULTS: In the population with a substance use disorder, only optimal full matching performed well in balancing covariates, whereas both methods created representative populations. In the young adult population, both methods balanced covariates effectively, but only optimal full matching created representative populations. In the young adult population, the impact of the program on Medicaid expenditures was attenuated when one-to-one greedy matching was used, compared with optimal full matching. CONCLUSION: Given covariate balancing with both methods, attenuated program impacts in the young adult population indicated that one-to-one greedy matching introduced selection bias.

  19. 77 FR 33547 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Centers for Medicare and Medicaid...

    Science.gov (United States)

    2012-06-06

    ...: Social Security Administration (SSA). ACTION: Notice of a new computer matching program that will expire... protections for such persons. The Privacy Act, as amended, regulates the use of computer matching by Federal... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2012-0015] Privacy Act of 1974, as Amended...

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

    Science.gov (United States)

    2012-06-29

    ... Security Administration (SSA). ACTION: Notice of a renewal of an existing computer matching program that... regarding protections for such persons. The Privacy Act, as amended, regulates the use of computer matching... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2012-0002] Privacy Act of 1974, as Amended...

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

    ... require additional verification to identify inappropriate or inaccurate rental assistance, and may provide... Affordable Housing Act, the Native American Housing Assistance and Self-Determination Act of 1996, and the... matching activities. The computer matching program will also provide for the verification of social...

  2. 75 FR 43579 - Privacy Act of 1974; Computer Matching Program Between the Office of Personnel Management and...

    Science.gov (United States)

    2010-07-26

    ... the Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503), Office of Management and... safeguards for disclosure of Social Security benefit information to OPM via direct computer link for the... OFFICE OF PERSONNEL MANAGEMENT Privacy Act of 1974; Computer Matching Program Between the Office...

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

    Science.gov (United States)

    2010-02-26

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

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

    Science.gov (United States)

    2010-02-22

    ... Computer Matching and Privacy Protection Act of 1988 (Public Law (Pub. L.) 100-503), amended the Privacy... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2010-0006] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Department of Veterans Affairs/Veterans Benefits Administration (VA/ VBA...

  5. AGS - The ISR computer program for synchrotron design, orbit analysis and insertion matching

    International Nuclear Information System (INIS)

    Keil, E.; Marti, Y.; Montague, B.W.; Sudboe, A.

    1975-01-01

    This is a detailed guide to the use of the current version of a FORTRAN program for carrying out computations required in the design or modification of alternating-gradient synchrotrons and storage rings. The program, which runs on the CDC 7600 computer at CERN, computes linear transformation functions, and modifications of parameters to achieve specified properties; it tracks sets of particle trajectories, finds closed orbits when elements of the structure are displaced, computes the equilibrium orbit, designs closed-orbit bumps, tracks betatron functions through the structure, and matches insertions in the structure to specified betatron and dispersion functions. The report supersedes CERN 69-5 (AGS - The ISR computer system for synchrotron design and orbit analysis, by E. Keil and P. Strolin). (Author)

  6. 25 CFR 47.11 - Can these funds be used as matching funds for other Federal programs?

    Science.gov (United States)

    2010-04-01

    ... EDUCATION UNIFORM DIRECT FUNDING AND SUPPORT FOR BUREAU-OPERATED SCHOOLS § 47.11 Can these funds be used as matching funds for other Federal programs? A Bureau-operated school may use funds that it receives under...

  7. Evaluation of an online peer fundus photograph matching program in teaching direct ophthalmoscopy to medical students.

    Science.gov (United States)

    Kwok, Jason; Liao, Walter; Baxter, Stephanie

    2017-10-01

    Direct ophthalmoscopy is an important clinical skill that is often poorly performed by medical professionals and students. This is attributable to a declining emphasis on ophthalmology in medical school. We present and evaluate a self-directed approach of teaching ophthalmoscopy to medical students that is suitable for the current medical curriculum. Prospective medical education trial. Ninety-five second-year medical students at Queen's University: 32 in the experimental group and 63 in the control group. The experimental group consisted of medical students who practised ophthalmoscopy with one another using an online peer fundus photograph matching exercise created by the Department of Ophthalmology at Queen's University. To use the program, students first examined a peer with an ophthalmoscope and then selected an online photograph of a fundus corresponding to that of the examinee. The program notifies students if a correct selection is made. To encourage use of the program, students participated in a 2-week ophthalmoscopy competition during their ophthalmology rotation. The control group consisted of students who did not participate in the learning exercise. On assessment at the end of the ophthalmology rotation, the experimental group (n = 32) was more accurate in matching fundus photographs compared with the control group (n = 63) (p = 0.02). Participants were faster at performing ophthalmoscopy at the end of the learning exercise (p peer fundus photographs in a self-directed manner appeared to increase the skill and confidence of medical students in ophthalmoscopy. Copyright © 2017 Canadian Ophthalmological Society. Published by Elsevier Inc. All rights reserved.

  8. The Effects of Game Strategy and Preference-Matching on Flow Experience and Programming Performance in Game-Based Learning

    Science.gov (United States)

    Wang, Li-Chun; Chen, Ming-Puu

    2010-01-01

    Learning to program is difficult for novices, even for those undergraduates who have majored in computer science. The study described in this paper has investigated the effects of game strategy and preference-matching on novice learners' flow experience and performance in learning to program using an experiential gaming activity. One hundred and…

  9. Attracting Future Radiation Oncologists: An Analysis of the National Resident Matching Program Data Trends From 2004 to 2015.

    Science.gov (United States)

    Ahmed, Awad A; Holliday, Emma B; Deville, Curtiland; Jagsi, Reshma; Haffty, Bruce G; Wilson, Lynn D

    2015-12-01

    A significant physician shortage has been projected to occur by 2025, and demand for oncologists is expected to outpace supply to an even greater degree. In response to this, many have called to increase the number of radiation oncology residency positions. The purpose of this study is to evaluate National Resident Matching Program (NRMP) data for the number of residency positions between 2004 and 2015 as well as the number and caliber of applicants for those positions and to compare radiation oncology to all residency specialties. NRMP data for all specialties participating in the match, including radiation oncology, were assessed over time examining the number of programs participating in the match, the number of positions offered, and the ratio of applicants to positions in the match from 2004 to 2015. From 2004 to 2015, the number of total programs participating in the match has increased by 26.7%, compared to the increase of 28.6% in the number of radiation oncology programs from during the same time period. The total number of positions offered in the match increased by 53.4%, whereas radiation oncology positions increased by 56.3%, during the same time period. The ratio of applicants (defined as those selecting a specialty as their first or only choice) to positions for all specialties has fluctuated over this time period and has gone from 1.21 to 1.15, whereas radiation oncology experienced a decrease from 1.45 to 1.14. NRMP data suggest that senior medical student applications to radiation oncology are decreasing compared to those of other specialties. If we hope to continue to attract the best and brightest to enter our field, we must continue to support early exposure to radiation oncology, positive educational experiences, and dedicated mentorship to interested medical students. Copyright © 2015 Elsevier Inc. All rights reserved.

  10. Attracting Future Radiation Oncologists: An Analysis of the National Resident Matching Program Data Trends From 2004 to 2015

    Energy Technology Data Exchange (ETDEWEB)

    Ahmed, Awad A., E-mail: Awad.ahmed@jhsmiami.org [Department of Radiation Oncology, Sylvester Comprehensive Cancer Center, University of Miami Miller School of Medicine, Miami, Florida (United States); Holliday, Emma B. [Division of Radiation Oncology, The University of Texas MD Anderson Cancer Center, Houston, Texas (United States); Deville, Curtiland [Department of Radiation Oncology and Molecular Radiation Sciences, Johns Hopkins University School of Medicine, Baltimore, Maryland (United States); Jagsi, Reshma [Department of Radiation Oncology, University of Michigan, Ann Arbor, Michigan (United States); Haffty, Bruce G. [Department of Radiation Oncology, Rutgers-Robert Wood Johnson Medical School, New Brunswick, New Jersey (United States); Wilson, Lynn D. [Department of Therapeutic Radiology, Yale School of Medicine and Yale Cancer Center, New Haven, Connecticut (United States)

    2015-12-01

    Purpose: A significant physician shortage has been projected to occur by 2025, and demand for oncologists is expected to outpace supply to an even greater degree. In response to this, many have called to increase the number of radiation oncology residency positions. The purpose of this study is to evaluate National Resident Matching Program (NRMP) data for the number of residency positions between 2004 and 2015 as well as the number and caliber of applicants for those positions and to compare radiation oncology to all residency specialties. Methods: NRMP data for all specialties participating in the match, including radiation oncology, were assessed over time examining the number of programs participating in the match, the number of positions offered, and the ratio of applicants to positions in the match from 2004 to 2015. Results: From 2004 to 2015, the number of total programs participating in the match has increased by 26.7%, compared to the increase of 28.6% in the number of radiation oncology programs from during the same time period. The total number of positions offered in the match increased by 53.4%, whereas radiation oncology positions increased by 56.3%, during the same time period. The ratio of applicants (defined as those selecting a specialty as their first or only choice) to positions for all specialties has fluctuated over this time period and has gone from 1.21 to 1.15, whereas radiation oncology experienced a decrease from 1.45 to 1.14. Conclusions: NRMP data suggest that senior medical student applications to radiation oncology are decreasing compared to those of other specialties. If we hope to continue to attract the best and brightest to enter our field, we must continue to support early exposure to radiation oncology, positive educational experiences, and dedicated mentorship to interested medical students.

  11. 75 FR 35847 - Privacy Act of 1974, Computer Matching Program-U.S. Small Business Administration and U.S...

    Science.gov (United States)

    2010-06-23

    ... ID Number, Product (Home/Business) and Registration Occupant Social Security Number to create a New... SMALL BUSINESS ADMINISTRATION Privacy Act of 1974, Computer Matching Program--U.S. Small Business Administration and U.S. Department of Homeland Security, Federal Emergency Management Agency AGENCY: Small...

  12. 78 FR 4968 - Privacy Act of 1974, Computer Matching Program-U.S. Small Business Administration and U.S...

    Science.gov (United States)

    2013-01-23

    ... Small Business Administration (SBA) and the Department of Homeland Security, Federal Emergency... Security Officer, Office of the Chief Information Officer, Small Business Administration. Eric Won, Chief... SMALL BUSINESS ADMINISTRATION Privacy Act of 1974, Computer Matching Program--U.S. Small Business...

  13. A Technology Based Program That Matches Enrichment Resources With Student Strengths

    Directory of Open Access Journals (Sweden)

    J.S. Renzulli

    2007-09-01

    Full Text Available Remarkable advances in instructionalcommunication technology (ICT have now made ispossible to provide high levels of enrichment and thekinds of curricular differentiation that facilitateadvanced learning services to students who have accessto a computer and the Internet. But in order tomaximize the potential if ICT it is necessary to constructprograms that are based on learning theory that goesbeyond the didactic and prescriptive models that haveresulted in too much worksheets-on-line and electronicencyclopedias. The Renzulli Learning System (RLSuses a strength-based learning theory called theEnrichment Triad Model that is purposefully designedto promote advanced level learning, creativeproductivity, and high levels of student engagement byfocusing on the application of knowledge rather than themere acquisition and storage of information.The Renzulli Learning System is acomprehensive program that begins by providing acomputer-generated profile of each student’s academicstrengths, interests, learning styles, and preferred modesof expression. A search engine then matches Internetresources to the student’s profile from fourteen carefullyscreened data bases that are categorized by subject area,grade level, state curricular standards, and degree ofcomplexity. There are also hundreds of enrichmentactivities that can be down loaded and reproduced forindividual or group learning activities. A managementsystem called the Wizard Project Maker guides studentsin the application of knowledge to teacher or studentselected assignments, independent research studies, orcreative projects that individuals or small groups wouldlike to pursue. Students and teachers can evaluate thequality of students’ products using a rubric called TheStudent Product Assessment Form. Students can rateeach site visited, conduct a self-assessment of what theyhave gained from the site, and place resources in theirown Total talent Portfolio for future use. RLS alsoincludes a

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

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

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

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

    NARCIS (Netherlands)

    van der Linden, Willem 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

  18. 78 FR 73851 - Privacy Act of 1974; Notice of a Computer Matching Program

    Science.gov (United States)

    2013-12-09

    ...: This proposed action will become effective January 8, 2014 and matching may commence unless changes to... Management and Budget objections. Public comments must be received before January 8, 2014. ADDRESSES: You may... DMDC files, and an electronic listing of records that contain data that are inconsistent with data...

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

    Science.gov (United States)

    2012-08-13

    ... reliable, shows only that individuals have been incarcerated in the past, and does not provide the... including children and one-person households in the PVS matches provide little value. FNS carefully... children, as that status is defined by each State, and one-person households where there is a face-to-face...

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

  1. Penerapan Metode Profile Matching Pada Sistem Pendukung Keputusan Pemilihan Ketua Program Studi (STUDI Kasus : Program Studi Teknik Informatika STMIK Musi Rawas

    Directory of Open Access Journals (Sweden)

    Andri Anto Tri Susilo

    2018-01-01

    Full Text Available Abstract-- In the organizational structure of a study program, always led by a chairman of the study program. In STMIK Musi Rawas, the process of selecting the head of the study program is usually appointed directly by the chairman of the foundation. The shortcomings of the direct appointment process is not able to see the capabilities possessed by the candidate chairman of the study program be it social skills, planning, management of learning, management of Human Resources, Finance and so forth. Decision support system is a system that can be used to help make decisions based on existing criteria. In this research the method used is Profile Matching method. The concept of Profile Matching method is to compare individual competence into job competence so that it can know the difference of competence (also called gap, the smaller the gap that is generated, the greater the value the greater the greater the chance for someone to occupy the position. The end result of this research is obtained information about the highest value of each candidate chairman of the Study Program based on the calculation of Profile Matching

  2. Matching policy with objectives : an analysis of international wind programs and results

    International Nuclear Information System (INIS)

    Deveaux, L.

    2008-01-01

    There are a variety of mechanisms used to procure wind energy, but successful programs typically combine legislative backing with financial incentives that aim to maintain acceptable prices for wind power developers. This presentation discussed mechanisms used in Ireland and Texas to ensure the success of wind power programs. Alternative energy requirement programs were designed as a competitive bid-style procurement program launched to increase the development of renewable resources in Ireland. Power purchase agreements for up to 15 years were awarded to winning bidders. The purpose of the program was to lower systems costs through the competitive bid process from 1996 to 2002. The program's failure was attributed to permitting delays, unsustainable bid pricing and constraints on transmission. The financial incentives did not compensate for the low bid prices. A renewable energy feed-in tariff program was launched in 2006 to pay electricity retailers for contracted projects. The tariff program provided reliable pricing mechanisms and promoted sector growth for both large-scale and small wind power projects. Texas developed renewable portfolio standards (RPSs) in 1999. The state's renewable energy certificate (REC) program was designed to issue RECs to generators for each MWh or eligible generation produced and sold in Texas. Retailers purchase the credits through the merchant market, resale, or long-term contracts. The system has strong legislative backing, which ensures that noncompliant retailers pay heavy penalties. It was concluded that competitive bid programs need strong legislative backing, financial support, and industry commitments. By contrast, feed-in tariffs can be used to promote many different sized wind farms. refs., tabs., figs

  3. Towards Domain-specific Flow-based Languages

    DEFF Research Database (Denmark)

    Zarrin, Bahram; Baumeister, Hubert; Sarjoughian, Hessam S.

    2018-01-01

    describe their problems and solutions, instead of using general purpose programming languages. The goal of these languages is to improve the productivity and efficiency of the development and simulation of concurrent scientific models and systems. Moreover, they help to expose parallelism and to specify...... the concurrency within a component or across different independent components. In this paper, we introduce the concept of domain-specific flowbased languages which allows domain experts to use flow-based languages adapted to a particular problem domain. Flow-based programming is used to support concurrency, while......Due to the significant growth of the demand for data-intensive computing, in addition to the emergence of new parallel and distributed computing technologies, scientists and domain experts are leveraging languages specialized for their problem domain, i.e., domain-specific languages, to help them...

  4. The National Marrow Donor Program and Be The Match Registry | NIH MedlinePlus the Magazine

    Science.gov (United States)

    ... outcomes for transplant patients. The National Marrow Donor Program conducts and supports research to help more patients get a transplant and to improve transplant results. Research is also conducted by two affiliate organizations, the Center for International Blood and Marrow ...

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

  6. Selecting electrode configurations for image-guided cochlear implant programming using template matching.

    Science.gov (United States)

    Zhang, Dongqing; Zhao, Yiyuan; Noble, Jack H; Dawant, Benoit M

    2018-04-01

    Cochlear implants (CIs) are neural prostheses that restore hearing using an electrode array implanted in the cochlea. After implantation, the CI processor is programmed by an audiologist. One factor that negatively impacts outcomes and can be addressed by programming is cross-electrode neural stimulation overlap (NSO). We have proposed a system to assist the audiologist in programming the CI that we call image-guided CI programming (IGCIP). IGCIP permits using CT images to detect NSO and recommend deactivation of a subset of electrodes to avoid NSO. We have shown that IGCIP significantly improves hearing outcomes. Most of the IGCIP steps are robustly automated but electrode configuration selection still sometimes requires manual intervention. With expertise, distance-versus-frequency curves, which are a way to visualize the spatial relationship learned from CT between the electrodes and the nerves they stimulate, can be used to select the electrode configuration. We propose an automated technique for electrode configuration selection. A comparison between this approach and one we have previously proposed shows that our method produces results that are as good as those obtained with our previous method while being generic and requiring fewer parameters.

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

  8. Mixing and matching Bevalac programs: Rapid-switching of ions and other operations highlights: Progress report

    International Nuclear Information System (INIS)

    Lothrop, F.; Alonso, J.; Krebs, G.; Miller, R.; Stevenson, R.

    1987-03-01

    Rapid switching of ion, energy, and beam line has been accomplished on a routine basis; typical transfer time is 1 to 2 minutes in worst case situations. Operational efficiency has been improved by substantial reduction of inter-experiment tune time and improved optics in the external beam area installed in 1985. A comparison of current research efficiency and previous year efficiency is given. It is shown that compatibility and productivity for two simultaneous, independent research programs are not mutually exclusive

  9. RPE vs. Percentage 1RM Loading in Periodized Programs Matched for Sets and Repetitions

    Science.gov (United States)

    Helms, Eric R.; Byrnes, Ryan K.; Cooke, Daniel M.; Haischer, Michael H.; Carzoli, Joseph P.; Johnson, Trevor K.; Cross, Matthew R.; Cronin, John B.; Storey, Adam G.; Zourdos, Michael C.

    2018-01-01

    Purpose: To investigate differences between rating of perceived exertion (RPE) and percentage one-repetition maximum (1RM) load assignment in resistance-trained males (19–35 years) performing protocols with matched sets and repetitions differentiated by load-assignment. Methods: Participants performed squats then bench press 3x/weeks in a daily undulating format over 8-weeks. Participants were counterbalanced by pre-test 1RM then assigned to percentage 1RM (1RMG, n = 11); load-assignment via percentage 1RMs, or RPE groups (RPEG, n = 10); participant-selected loads to reach target RPE ranges. Ultrasonography determined pre and post-test pectoralis (PMT), and vastus lateralis muscle thickness at 50 (VLMT50) and 70% (VLMT70) femur-length. Results: Bench press (1RMG +9.64 ± 5.36; RPEG + 10.70 ± 3.30 kg), squat (1RMG + 13.91 ± 5.89; RPEG + 17.05 ± 5.44 kg) and their combined-total 1RMs (1RMG + 23.55 ± 10.38; RPEG + 27.75 ± 7.94 kg) increased (p 0.05). Magnitude-based inferences revealed 79, 57, and 72% chances of mean small effect size (ES) advantages for squat; ES 90% confidence limits (CL) = 0.50 ± 0.63, bench press; ES 90% CL = 0.28 ± 0.73, and combined-total; ES 90% CL = 0.48 ± 0.68 respectively, in RPEG. There were 4, 14, and 6% chances 1RMG had a strength advantage of the same magnitude, and 18, 29, and 22% chances, respectively of trivial differences between groups. Conclusions: Both loading-types are effective. However, RPE-based loading may provide a small 1RM strength advantage in a majority of individuals. PMID:29628895

  10. RPE vs. Percentage 1RM Loading in Periodized Programs Matched for Sets and Repetitions

    Directory of Open Access Journals (Sweden)

    Eric R. Helms

    2018-03-01

    Full Text Available Purpose: To investigate differences between rating of perceived exertion (RPE and percentage one-repetition maximum (1RM load assignment in resistance-trained males (19–35 years performing protocols with matched sets and repetitions differentiated by load-assignment.Methods: Participants performed squats then bench press 3x/weeks in a daily undulating format over 8-weeks. Participants were counterbalanced by pre-test 1RM then assigned to percentage 1RM (1RMG, n = 11; load-assignment via percentage 1RMs, or RPE groups (RPEG, n = 10; participant-selected loads to reach target RPE ranges. Ultrasonography determined pre and post-test pectoralis (PMT, and vastus lateralis muscle thickness at 50 (VLMT50 and 70% (VLMT70 femur-length.Results: Bench press (1RMG +9.64 ± 5.36; RPEG + 10.70 ± 3.30 kg, squat (1RMG + 13.91 ± 5.89; RPEG + 17.05 ± 5.44 kg and their combined-total 1RMs (1RMG + 23.55 ± 10.38; RPEG + 27.75 ± 7.94 kg increased (p < 0.05 in both groups as did PMT (1RMG + 1.59 ± 1.33; RPEG +1.90 ± 1.91 mm, VLMT50 (1RMG +2.13 ± 1.95; RPEG + 1.85 ± 1.97 mm and VLMT70 (1RMG + 2.40 ± 2.22; RPEG + 2.31 ± 2.27 mm. Between-group differences were non-significant (p > 0.05. Magnitude-based inferences revealed 79, 57, and 72% chances of mean small effect size (ES advantages for squat; ES 90% confidence limits (CL = 0.50 ± 0.63, bench press; ES 90% CL = 0.28 ± 0.73, and combined-total; ES 90% CL = 0.48 ± 0.68 respectively, in RPEG. There were 4, 14, and 6% chances 1RMG had a strength advantage of the same magnitude, and 18, 29, and 22% chances, respectively of trivial differences between groups.Conclusions: Both loading-types are effective. However, RPE-based loading may provide a small 1RM strength advantage in a majority of individuals.

  11. Fractional Programming for Communication Systems—Part II: Uplink Scheduling via Matching

    Science.gov (United States)

    Shen, Kaiming; Yu, Wei

    2018-05-01

    This two-part paper develops novel methodologies for using fractional programming (FP) techniques to design and optimize communication systems. Part I of this paper proposes a new quadratic transform for FP and treats its application for continuous optimization problems. In this Part II of the paper, we study discrete problems, such as those involving user scheduling, which are considerably more difficult to solve. Unlike the continuous problems, discrete or mixed discrete-continuous problems normally cannot be recast as convex problems. In contrast to the common heuristic of relaxing the discrete variables, this work reformulates the original problem in an FP form amenable to distributed combinatorial optimization. The paper illustrates this methodology by tackling the important and challenging problem of uplink coordinated multi-cell user scheduling in wireless cellular systems. Uplink scheduling is more challenging than downlink scheduling, because uplink user scheduling decisions significantly affect the interference pattern in nearby cells. Further, the discrete scheduling variable needs to be optimized jointly with continuous variables such as transmit power levels and beamformers. The main idea of the proposed FP approach is to decouple the interaction among the interfering links, thereby permitting a distributed and joint optimization of the discrete and continuous variables with provable convergence. The paper shows that the well-known weighted minimum mean-square-error (WMMSE) algorithm can also be derived from a particular use of FP; but our proposed FP-based method significantly outperforms WMMSE when discrete user scheduling variables are involved, both in term of run-time efficiency and optimizing results.

  12. Assessing experiential education factors contributing to a PGY1 residency match: Pharmacy residency program director and comparative student survey.

    Science.gov (United States)

    Prisco, Jennifer L; Hritcko, Philip M; Feret, Brett; Yorra, Mark L; Todd, Noreen E; Kim Tanzer; Basile, Cathy; Bonaceto, Kara; Morelli, Rita; Carace, Nicole; Szumita, Andrew

    2018-02-01

    To compare and contrast experiential education perceptions of pharmacy residency program directors (RPDs) and doctor of pharmacy students in their last year of the curriculum for residency application considerations. The New England Regional Departments of Experiential Education (NERDEE) consortium developed a 17-question survey to assess residency factors, including those related to experiential education. The survey was dispersed to advanced pharmacy practice experience (APPE) students from six colleges/schools of pharmacy and RPDs nationwide. Students have different values on experiential preferences compared to RPDs. Sample findings include internal medicine and specialty clinical elective experiences prior to American Society of Health-System Pharmacists (ASHP) Midyear were extremely important to important for students, while RPDs viewed these experiences as somewhat important at best (p hinder a successful postgraduate year 1 (PGY1) residency match. Copyright © 2017 Elsevier Inc. All rights reserved.

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

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

    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

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

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

    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

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

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

    Science.gov (United States)

    2013-06-24

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

  17. 76 FR 21091 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Centers for Medicare & Medicaid...

    Science.gov (United States)

    2011-04-14

    ...: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer matching...: A. General The Computer Matching and Privacy Protection Act of 1988 (Public Law (Pub. L.) 100-503...), as amended, (Pub. L. 100-503, the Computer Matching and Privacy Protection Act (CMPPA) of 1988), the...

  18. 77 FR 27108 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Office of Child Support...

    Science.gov (United States)

    2012-05-08

    ...: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer matching... protections for such persons. The Privacy Act, as amended, regulates the use of computer matching by Federal... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2012-0010] Privacy Act of 1974, as Amended...

  19. 75 FR 54213 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Office of Personnel Management...

    Science.gov (United States)

    2010-09-03

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

  20. 77 FR 49849 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Office of Child Support...

    Science.gov (United States)

    2012-08-17

    ...: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer-matching... INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Public Law (Pub. L.) 100-503... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2012-0021] Privacy Act of 1974, as Amended...

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

    Science.gov (United States)

    2013-11-21

    ...: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer matching... INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988 (Pub. L 100-503), amended the... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2013-0059] Privacy Act of 1974, as Amended...

  2. On the exactness of the cavity method for weighted b-matchings on arbitrary graphs and its relation to linear programs

    International Nuclear Information System (INIS)

    Bayati, Mohsen; Borgs, Christian; Chayes, Jennifer; Zecchina, Riccardo

    2008-01-01

    We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programing relaxation of the problem has no fractional solutions, then the cavity or belief propagation equations converge to the correct solution both for synchronous and asynchronous updating. (letter)

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

  4. Multi-domain computerized cognitive training program improves performance of bookkeeping tasks: a matched-sampling active-controlled trial.

    Science.gov (United States)

    Lampit, Amit; Ebster, Claus; Valenzuela, Michael

    2014-01-01

    Cognitive skills are important predictors of job performance, but the extent to which computerized cognitive training (CCT) can improve job performance in healthy adults is unclear. We report, for the first time, that a CCT program aimed at attention, memory, reasoning and visuo-spatial abilities can enhance productivity in healthy younger adults on bookkeeping tasks with high relevance to real-world job performance. 44 business students (77.3% female, mean age 21.4 ± 2.6 years) were assigned to either (a) 20 h of CCT, or (b) 20 h of computerized arithmetic training (active control) by a matched sampling procedure. Both interventions were conducted over a period of 6 weeks, 3-4 1-h sessions per week. Transfer of skills to performance on a 60-min paper-based bookkeeping task was measured at three time points-baseline, after 10 h and after 20 h of training. Repeated measures ANOVA found a significant Group X Time effect on productivity (F = 7.033, df = 1.745; 73.273, p = 0.003) with a significant interaction at both the 10-h (Relative Cohen's effect size = 0.38, p = 0.014) and 20-h time points (Relative Cohen's effect size = 0.40, p = 0.003). No significant effects were found on accuracy or on Conners' Continuous Performance Test, a measure of sustained attention. The results are discussed in reference to previous findings on the relationship between brain plasticity and job performance. Generalization of results requires further study.

  5. Multi-domain computerized cognitive training program improves performance of bookkeeping tasks: a matched-sampling active-controlled trial

    Directory of Open Access Journals (Sweden)

    Amit eLampit

    2014-07-01

    Full Text Available Cognitive skills are important predictors of job performance, but the extent to which Computerized Cognitive Training (CCT can improve job performance in healthy adults is unclear. We report, for the first time, that a CCT program aimed at attention, memory, reasoning and visuo-spatial abilities can enhance productivity in healthy younger adults on bookkeeping tasks with high relevance to real-world job performance. 44 business students (77.3% female, mean age 21.4 ± 2.6 years were assigned to either (a 20 hours of CCT, or (b 20 hours of computerized arithmetic training (active control by a matched sampling procedure. Both interventions were conducted over a period of six weeks, 3-4 one-hour sessions per week. Transfer of skills to performance on a 60-minute paper-based bookkeeping task was measured at three time points – baseline, after 10 hours and after 20 hours of training. Repeated measures ANOVA found a significant Group X Time effect on productivity (F=7.033, df=1.745; 73.273, p=0.003 with a significant interaction at both the 10-hour (Relative Cohen’s effect size = 0.38, p=0.014 and 20-hour time points (Relative Cohen’s effect size = 0.40, p=0.003. No significant effects were found on accuracy or on Conners’ Continuous Performance Test, a measure of sustained attention. The results are discussed in reference to previous findings on the relationship between brain plasticity and job performance. Generalization of results requires further study.

  6. A quantitative experimental paradigm to optimize construction of rank order lists in the National Resident Matching Program: the ROSS-MOORE approach.

    Science.gov (United States)

    Ross, David A; Moore, Edward Z

    2013-09-01

    As part of the National Resident Matching Program, programs must submit a rank order list of desired applicants. Despite the importance of this process and the numerous manifest limitations with traditional approaches, minimal research has been conducted to examine the accuracy of different ranking strategies. The authors developed the Moore Optimized Ordinal Rank Estimator (MOORE), a novel algorithm for ranking applicants that is based on college sports ranking systems. Because it is not possible to study the Match in vivo, the authors then designed the Recruitment Outcomes Simulation System (ROSS). This program was used to simulate a series of interview seasons and to compare MOORE and traditional approaches under different conditions. The accuracy of traditional ranking and the MOORE approach are equally and adversely affected with higher levels of intrarater variability. However, compared with traditional ranking methods, MOORE produces a more accurate rank order list as interrater variability increases. The present data demonstrate three key findings. First, they provide proof of concept that it is possible to scientifically test the accuracy of different rank methods used in the Match. Second, they show that small amounts of variability can have a significant adverse impact on the accuracy of rank order lists. Finally, they demonstrate that an ordinal approach may lead to a more accurate rank order list in the presence of interviewer bias. The ROSS-MOORE approach offers programs a novel way to optimize the recruitment process and, potentially, to construct a more accurate rank order list.

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

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

    Directory of Open Access Journals (Sweden)

    Jill A Hollenbach

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

  9. Flow-based model of computer hackers' motivation.

    Science.gov (United States)

    Voiskounsky, Alexander E; Smyslova, Olga V

    2003-04-01

    Hackers' psychology, widely discussed in the media, is almost entirely unexplored by psychologists. In this study, hackers' motivation is investigated, using the flow paradigm. Flow is likely to motivate hackers, according to views expressed by researchers and by hackers themselves. Taken as granted that hackers experience flow, it was hypothesized that flow increases with the increase of hackers' competence in IT use. Self-selected subjects were recruited on specialized web sources; 457 hackers filled out a web questionnaire. Competence in IT use, specific flow experience, and demographic data were questioned. An on-line research was administered within the Russian-speaking community (though one third of Ss are non-residents of Russian Federation); since hacking seems to be international, the belief is expressed that the results are universal. The hypothesis is not confirmed: flow motivation characterizes the least and the most competent hackers, and the members of an intermediate group, that is, averagely competent Ss report the "flow crisis"-no (or less) flow experience. Two differing strategies of task choice were self-reported by Ss: a step-by-step increase of the difficulty of choices leads to a match of challenges and skills (and to preserving the flow experience); putting choices irrespective of the likelihood of solution leads to a "flow crisis." The findings give productive hints on processes of hackers' motivational development. The flow-based model of computer hackers' motivation was developed. It combines both empirically confirmed and theoretically possible ways of hackers' "professional" growth.

  10. 78 FR 12127 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of the Treasury...

    Science.gov (United States)

    2013-02-21

    ... 1310 AGENCY: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer..., as shown above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2013-0007] Privacy Act of 1974, as Amended...

  11. 75 FR 51154 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of the Treasury...

    Science.gov (United States)

    2010-08-18

    ... 1310 AGENCY: Social Security Administration (SSA) ACTION: Notice of a renewal of an existing computer..., as shown above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2010-0035] Privacy Act of 1974, as Amended...

  12. 78 FR 51264 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Department of the Treasury...

    Science.gov (United States)

    2013-08-20

    ... 1016 AGENCY: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer... above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2013-0022] Privacy Act of 1974, as Amended...

  13. 78 FR 16564 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Office of Personnel Management...

    Science.gov (United States)

    2013-03-15

    ... 1021 AGENCY: Social Security Administration (SSA). ACTION: Notice of a renewal of existing computer... above. SUPPLEMENTARY INFORMATION: A. General The Computer Matching and Privacy Protection Act of 1988... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2012-0073] Privacy Act of 1974, as Amended...

  14. Matching Organs

    Science.gov (United States)

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

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

  16. A Labeled Data Set For Flow-based Intrusion Detection

    NARCIS (Netherlands)

    Sperotto, Anna; Sadre, R.; van Vliet, Frank; Pras, Aiko; Nunzi, Giorgio; Scoglio, Caterina; Li, Xing

    2009-01-01

    Flow-based intrusion detection has recently become a promising security mechanism in high speed networks (1-10 Gbps). Despite the richness in contributions in this field, benchmarking of flow-based IDS is still an open issue. In this paper, we propose the first publicly available, labeled data set

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

  18. 78 FR 47336 - Privacy Act of 1974; Computer Matching Program Between the Department of Housing and Urban...

    Science.gov (United States)

    2013-08-05

    ...) (Pub. L. 111-204); 2. Presidential Memorandum on Enhancing Payment Accuracy Through a ``Do Not Pay List... operating Public Housing programs may now offer tenants the option to pay a flat rent, or an income-based..., program administrators will resolve income discrepancies in consultation with tenants. Additionally...

  19. 76 FR 579 - Privacy Act of 1974; Computer Matching Program Between the Department of Housing and Urban...

    Science.gov (United States)

    2011-01-05

    ... Payment Accuracy Through a ``Do Not Pay List'' (June 18, 2010); 3. Office of Management and Budget M-10-13... operating Public Housing programs may now offer tenants the option to pay a flat rent, or an income-based... all cases, program administrators will resolve income discrepancies in consultation with tenants...

  20. Foods Served in Child Care Facilities Participating in the Child and Adult Care Food Program: Menu Match and Agreement with the New Meal Patterns and Best Practices.

    Science.gov (United States)

    Dave, Jayna M; Cullen, Karen W

    2018-02-20

    To assess the agreement of posted menus with foods served to 3- to 5-year-old children attending federal Child and Adult Care Food Program (CACFP)-enrolled facilities, and the degree to which the facilities met the new meal patterns and best practices. On-site observations and menu coding. Nine early care and education centers. Agreement of posted menus with foods served, and comparison of foods served and consumed with the new CACFP meal guidelines and best practices. Data were compiled for each meal (breakfast, lunch, and snacks). Frequencies and percentages of agreement with the posted menu (coded matches, substitutions, additions, and omissions) were calculated for each food component in the CACFP menu guidelines. Menu total match was created by summing the menu match plus acceptable substitutions. Menus were compared with the new CACFP meal guidelines and best practices. The match between the posted menus and foods actually served to children at breakfast, lunch, and snack was high when the acceptable menu substitutions were considered (approximately 94% to 100% total match). Comparing the menus with the new meal guidelines and best practices, the 1 guideline that was fully implemented was serving only unflavored, low-fat, or 1% milk; fruit and vegetable guidelines were partially met; fruit juice was not served often, nor were legumes; the guideline for 1 whole grain-rich serving/d was not met; and regular beef and full-fat cheese products were commonly served. Early care and education centers enrolled in CACFP provided meals that met the current CACFP guidelines. Some menu improvements are needed for the centers to meet the new guidelines and best practices. Copyright © 2018 Society for Nutrition Education and Behavior. Published by Elsevier Inc. All rights reserved.

  1. 75 FR 40770 - Creation of a New Computer Matching Program That Will Expire on December 31, 2013

    Science.gov (United States)

    2010-07-14

    ... Program (SSA/U.S. Office of Personnel Management (OPM)/U.S. Department of Agriculture's National Finance..., National Finance Center. ACTION: Notice. SUMMARY: In accordance with the provisions of the Privacy Act, as... the U.S. Office of Personnel Management (OPM), The Social Security Administration (SSA), and the...

  2. Information-flow-based Access Control for Virtualized Systems

    Directory of Open Access Journals (Sweden)

    Dmitriy Aleksandrovich Postoev

    2014-12-01

    Full Text Available The article is devoted to the method of information-flow-based access control, adopted for virtualized systems. General structure of access control system for virtual infrastructure is proposed.

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

    Science.gov (United States)

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

    2016-06-01

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

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

    Science.gov (United States)

    Pradhan, Menno; Brinkman, Sally A; Beatty, Amanda; Maika, Amelia; Satriawan, Elan; de Ree, Joppe; Hasan, Amer

    2013-08-16

    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 was developed in collaboration with the World Bank with a total budget of US$127.7 million, and targets an estimated 738,000 children aged 0 to 6 years living in approximately 6,000 poor communities. The aim of the program is to increase access to early childhood services with the secondary aim of improving school readiness. The study is being conducted across nine districts. The baseline survey contained 310 villages, of which 100 were originally allocated to the intervention arm, 20 originally allocated to a 9-month delay staggered start, 100 originally allocated to an 18-month delay staggered start and 90 allocated to a matched control group (no intervention). The study consists of two cohorts, one comprising children aged 12 to 23 months and the other comprising children aged 48 to 59 months at baseline. The data collection instruments include child observations and task/game-based assessments as well as a questionnaire suite, village head questionnaire, service level questionnaires, household questionnaire, and child caretaker questionnaire. The baseline survey was conducted from March to April 2009, midline was conducted from April to August 2010 and endline conducted early 2013. The resultant participation rates at both the district and village levels were 90%. At the child level, the participation rate was 99.92%. The retention rate at the child level at midline was 99.67%. This protocol paper provides a detailed record of the trial design including a discussion regarding difficulties faced with compliance to the randomization, compliance to the dispersion schedule of community block grants, and procurement delays for baseline and midline data collections. Considering the

  5. Geographic Trends in the Plastic Surgery Match.

    Science.gov (United States)

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

    2016-01-01

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

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

  7. Flowbca : A flow-based cluster algorithm in Stata

    NARCIS (Netherlands)

    Meekes, J.; Hassink, W.H.J.

    In this article, we introduce the Stata implementation of a flow-based cluster algorithm written in Mata. The main purpose of the flowbca command is to identify clusters based on relational data of flows. We illustrate the command by providing multiple applications, from the research fields of

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

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

    Directory of Open Access Journals (Sweden)

    Shah Anoop D

    2012-08-01

    Full Text Available Abstract Background 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. Methods 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. Results 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. Conclusions 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

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

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

  12. Toward Practical Secure Stable Matching

    Directory of Open Access Journals (Sweden)

    Riazi M. Sadegh

    2017-01-01

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

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

    International Nuclear Information System (INIS)

    Van der Welle, A.J.

    2012-07-01

    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.

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

    Science.gov (United States)

    Bacik, Karol A; Schaub, Michael T; Beguerisse-Díaz, Mariano; Billeh, Yazan N; Barahona, Mauricio

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

  15. 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. Copyright © 2014 Elsevier B.V. All rights reserved.

  16. Stinging Insect Matching Game

    Science.gov (United States)

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

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

  18. Matching Students to Schools

    Directory of Open Access Journals (Sweden)

    Dejan Trifunovic

    2017-08-01

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

  19. The Gastroenterology Fellowship Match: A Decade Later.

    Science.gov (United States)

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

    2017-06-01

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

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

  1. Optimal Packed String Matching

    DEFF Research Database (Denmark)

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

    2011-01-01

    In the packed string matching problem, each machine word accommodates – characters, thus an n-character text occupies n/– memory words. We extend the Crochemore-Perrin constantspace O(n)-time string matching algorithm to run in optimal O(n/–) time and even in real-time, achieving a factor – speed...

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

  3. Foods served in child care facilities participating in the Child and Adult Care Food Program: Menu match and agreement with the new meal patterns and best practices

    Science.gov (United States)

    Our objective was to assess the agreement of posted menus with foods served to 3- to 5-year-old children attending federal Child and Adult Care Food Program (CACFP)-enrolled facilities, and the degree to which the facilities met the new meal patterns and best practices. On-site observations and menu...

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

    Science.gov (United States)

    Dube, William V.; And Others

    1991-01-01

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

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

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

  7. Magnetic safety matches

    Science.gov (United States)

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

    2017-07-01

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

  8. Improving elementary school quality through the use of a social-emotional and character development program: a matched-pair, cluster-randomized, controlled trial in Hawai'i.

    Science.gov (United States)

    Snyder, Frank J; Vuchinich, Samuel; Acock, Alan; Washburn, Isaac J; Flay, Brian R

    2012-01-01

    School safety and quality affect student learning and success. This study examined the effects of a comprehensive elementary school-wide social-emotional and character education program, Positive Action, on teacher, parent, and student perceptions of school safety and quality utilizing a matched-pair, cluster-randomized, controlled design. The Positive Action Hawai'i trial included 20 racially/ethnically diverse schools and was conducted from 2002-2003 through 2005-2006. School-level archival data, collected by the Hawai'i Department of Education, were used to examine program effects at 1-year post-trial. Teacher, parent, and student data were analyzed to examine indicators of school quality such as student safety and well-being, involvement, and satisfaction, as well as overall school quality. Matched-paired t-tests were used for the primary analysis, and sensitivity analyses included permutation tests and random-intercept growth curve models. Analyses comparing change from baseline to 1-year post-trial revealed that intervention schools demonstrated significantly improved school quality compared to control schools, with 21%, 13%, and 16% better overall school quality scores as reported by teachers, parents, and students, respectively. Teacher, parent, and student reports on individual school-quality indicators showed improvement in student safety and well-being, involvement, satisfaction, quality student support, focused and sustained action, standards-based learning, professionalism and system capacity, and coordinated team work. Teacher reports also showed an improvement in the responsiveness of the system. School quality was substantially improved, providing evidence that a school-wide social-emotional and character education program can enhance school quality and facilitate whole-school change. © 2011, American School Health Association.

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

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

    Science.gov (United States)

    2010-06-02

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

  11. Latent palmprint matching.

    Science.gov (United States)

    Jain, Anil K; Feng, Jianjiang

    2009-06-01

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

  12. Semantic Data Matching: Principles and Performance

    Science.gov (United States)

    Deaton, Russell; Doan, Thao; Schweiger, Tom

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

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

  14. A Multi Agent System for Flow-Based Intrusion Detection

    Science.gov (United States)

    2013-03-01

    Mechanics and its Applications, 340(1-3):388 – 394, 2004. ISSN 0378-4371. [46] Dawkins , Richard. The Selfish Gene . Oxford University Press, Oxford New...were considered but not chosen for this research assignment are: 31 • Gene Expression Programming [138] • Maximum Entropy Classifier Logistic...regression [70] • Naive Bayes Classifier [148] • Neural Networks [79] • Quadratic Discriminant Analysis • Binary Classifier Tree [100] Gene expression

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

  16. Transit Matching for International Safeguards

    International Nuclear Information System (INIS)

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

    2015-01-01

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

  17. Dewey Concentration Match.

    Science.gov (United States)

    School Library Media Activities Monthly, 1996

    1996-01-01

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

  18. Matched-Filter Thermography

    Directory of Open Access Journals (Sweden)

    Nima Tabatabaei

    2018-04-01

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

  19. Bayesian grid matching

    DEFF Research Database (Denmark)

    Hartelius, Karsten; Carstensen, Jens Michael

    2003-01-01

    A method for locating distorted grid structures in images is presented. The method is based on the theories of template matching and Bayesian image restoration. The grid is modeled as a deformable template. Prior knowledge of the grid is described through a Markov random field (MRF) model which r...

  20. Polytypic pattern matching

    NARCIS (Netherlands)

    Jeuring, J.T.

    1995-01-01

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

  1. Is Matching Innate?

    Science.gov (United States)

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

    2007-01-01

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

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

  3. Effects of a Community-Based Program for Oral Health and Nutrition on Cost-Effectiveness by Preventing Disability in Japanese Frail Elderly: A Quasi-Experimental Study Using Propensity Score Matching.

    Science.gov (United States)

    Tomata, Yasutake; Watanabe, Takashi; Sugiyama, Kemmyo; Zhang, Shu; Sugawara, Yumi; Tsuji, Ichiro

    2017-08-01

    In the Japanese Long-Term Care Insurance (LTCI) system, a community-based program for oral health and nutrition (OHN program) has been implemented with the aim of reducing incident disability and care costs. However, the effectiveness of this program has not been confirmed epidemiologically. The purpose of the present study was to test the hypothesis that the OHN program does reduce incident disability and care costs. A prospective study with a 28-month follow-up period was conducted using data from administrative databases at Tagajo City, Japan. Among frail elderly persons (aged 65 years or more) who were enrolled in the LTCI program in Tagajo, 64 participants in the OHN program and 128 controls (nonparticipants) were selected by propensity score matching. We used 2 types of outcome measure: composite outcome (incident disability and death) and care cost. Data on incident disability were retrieved from the public LTCI database. Care cost was defined as the total amount of LTCI service cost added to medical care cost. The hazard ratio of composite outcome was significantly lower for the intervention group than for the control group (hazard ratio = 0.32, 95% confidence interval 0.12-0.82). Even when we set incident disability as an outcome, the hazard ratio for the intervention group did not change (hazard ratio = 0.33, 95% confidence interval 0.11-0.97). The mean cumulative care cost during the 28 months tended to be lower for the intervention group ($4893) than that for the control group ($5770), but this was not statistically significant by the gamma regression model (cost ratio = 0.85, P = .513). The mean care cost per unit follow-up period (1 month) for the intervention group was significantly lower (cost ratio = 0.54, P = .027). The results of this study suggest that the OHN program is effective for preventing incident disability and, consequently, for saving care costs per unit survival period. Copyright © 2017 AMDA – The Society for Post

  4. Impact of a social-emotional and character development program on school-level indicators of academic achievement, absenteeism, and disciplinary outcomes: A matched-pair, cluster randomized, controlled trial.

    Science.gov (United States)

    Snyder, Frank; Flay, Brian; Vuchinich, Samuel; Acock, Alan; Washburn, Isaac; Beets, Michael; Li, Kin-Kit

    2010-01-01

    This paper reports the effects of a comprehensive elementary school-based social-emotional and character education program on school-level achievement, absenteeism, and disciplinary outcomes utilizing a matched-pair, cluster randomized, controlled design. The Positive Action Hawai'i trial included 20 racially/ethnically diverse schools (mean enrollment = 544) and was conducted from the 2002-03 through the 2005-06 academic years. Using school-level archival data, analyses comparing change from baseline (2002) to one-year post trial (2007) revealed that intervention schools scored 9.8% better on the TerraNova (2 nd ed.) test for reading and 8.8% on math; 20.7% better in Hawai'i Content and Performance Standards scores for reading and 51.4% better in math; and that intervention schools reported 15.2% lower absenteeism and fewer suspensions (72.6%) and retentions (72.7%). Overall, effect sizes were moderate to large (range 0.5-1.1) for all of the examined outcomes. Sensitivity analyses using permutation models and random-intercept growth curve models substantiated results. The results provide evidence that a comprehensive school-based program, specifically developed to target student behavior and character, can positively influence school-level achievement, attendance, and disciplinary outcomes concurrently.

  5. Adaptive Discrete Hypergraph Matching.

    Science.gov (United States)

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

    2018-02-01

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

  6. Electromagnetic wave matching device

    International Nuclear Information System (INIS)

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

    1997-01-01

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

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

  8. Matching with transfer matrices

    International Nuclear Information System (INIS)

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

    1987-10-01

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

  9. Coaxial pulse matching transformer

    International Nuclear Information System (INIS)

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

    1986-01-01

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

  10. Plasma focus matching conditions

    International Nuclear Information System (INIS)

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

    1988-01-01

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

  11. Optimal background matching camouflage.

    Science.gov (United States)

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

    2017-07-12

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

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

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

    NARCIS (Netherlands)

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

    1998-01-01

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

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

    DEFF Research Database (Denmark)

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

    2012-01-01

    ,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....... By combining several microvalves, more complex units, such as micropumps, switches, mixers, and multiplexers, can be built. The manufacturing technology, soft lithography, used for the flow-based biochips is advancing faster than Moore's law, resulting in increased architectural complexity. However...... by synthesizing architectures for real-life applications as well as synthetic benchmarks....

  15. 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, such asmi......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...

  16. Kinetics of matching.

    Science.gov (United States)

    Mark, T A; Gallistel, C R

    1994-01-01

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

  17. Electromagnetic wave matching device

    International Nuclear Information System (INIS)

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

    1997-01-01

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

  18. Quantity precommitment and price matching

    DEFF Research Database (Denmark)

    Tumennasan, Norovsambuu

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

  19. Spatial competition with intermediated matching

    NARCIS (Netherlands)

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

    1995-01-01

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

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

  1. Flow-Based Network Management: A Report from the IRTF NMRG Workshop

    NARCIS (Netherlands)

    de Oliveira Schmidt, R.; Sadre, R.; Hendriks, Luuk

    This is the report on the Workshop on Flow-Based Network Management, held within the 37th IRTF NMRG meeting, during IETF 93, on 24th July 2015, in Prague, Czech Republic. Following the tradition of the IRTF NMRG, the workshop focused on technologies, developments, and challenges of using flow-level

  2. Fusion of optical flow based motion pattern analysis and silhouette classification for person tracking and detection

    NARCIS (Netherlands)

    Tangelder, J.W.H.; Lebert, E.; Burghouts, G.J.; Zon, K. van; Den Uyl, M.J.

    2014-01-01

    This paper presents a novel approach to detect persons in video by combining optical flow based motion analysis and silhouette based recognition. A new fast optical flow computation method is described, and its application in a motion based analysis framework unifying human tracking and detection is

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

    NARCIS (Netherlands)

    Hofstede, R.J.; Pras, Aiko

    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

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

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

    ....hhs.gov . SUPPLEMENTARY INFORMATION: The Computer Matching and Privacy Protection Act of 1988 (Public... computer matching involving Federal agencies could be performed and adding certain protections for... Affordability Programs under the Patient Protection and Affordable Care Act''. SECURITY CLASSIFICATION...

  6. Organizations must match assets

    International Nuclear Information System (INIS)

    Carley, G.R.

    1991-01-01

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

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

  8. 36 CFR 72.32 - Funding and matching share.

    Science.gov (United States)

    2010-07-01

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

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

  10. Probability matching and strategy availability

    OpenAIRE

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

    2010-01-01

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

  11. An Incentive Theory of Matching

    OpenAIRE

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

    2010-01-01

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

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

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

    Science.gov (United States)

    2010-10-01

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

  14. Flow-based vulnerability measures for network component importance: Experimentation with preparedness planning

    International Nuclear Information System (INIS)

    Nicholson, Charles D.; Barker, Kash; Ramirez-Marquez, Jose E.

    2016-01-01

    This work develops and compares several flow-based vulnerability measures to prioritize important network edges for the implementation of preparedness options. These network vulnerability measures quantify different characteristics and perspectives on enabling maximum flow, creating bottlenecks, and partitioning into cutsets, among others. The efficacy of these vulnerability measures to motivate preparedness options against experimental geographically located disruption simulations is measured. Results suggest that a weighted flow capacity rate, which accounts for both (i) the contribution of an edge to maximum network flow and (ii) the extent to which the edge is a bottleneck in the network, shows most promise across four instances of varying network sizes and densities. - Highlights: • We develop new flow-based measures of network vulnerability. • We apply these measures to determine the importance of edges after disruptions. • Networks of varying size and density are explored.

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

  16. A distributed predictive control approach for periodic flow-based networks: application to drinking water systems

    Science.gov (United States)

    Grosso, Juan M.; Ocampo-Martinez, Carlos; Puig, Vicenç

    2017-10-01

    This paper proposes a distributed model predictive control approach designed to work in a cooperative manner for controlling flow-based networks showing periodic behaviours. Under this distributed approach, local controllers cooperate in order to enhance the performance of the whole flow network avoiding the use of a coordination layer. Alternatively, controllers use both the monolithic model of the network and the given global cost function to optimise the control inputs of the local controllers but taking into account the effect of their decisions over the remainder subsystems conforming the entire network. In this sense, a global (all-to-all) communication strategy is considered. Although the Pareto optimality cannot be reached due to the existence of non-sparse coupling constraints, the asymptotic convergence to a Nash equilibrium is guaranteed. The resultant strategy is tested and its effectiveness is shown when applied to a large-scale complex flow-based network: the Barcelona drinking water supply system.

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

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

  19. Unmatched U.S. Allopathic Seniors in the 2015 Main Residency Match: A Study of Applicant Behavior, Interview Selection, and Match Outcome.

    Science.gov (United States)

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

    2017-07-01

    The application and interview behaviors of unmatched U.S. allopathic medical school senior students (U.S. seniors) participating in the 2015 National Resident Matching Program (NRMP) Main Residency Match were studied in conjunction with their United States Medical Licensing Examination (USMLE) Step 1 scores and ranking preferences to understand their effects on Match outcome. USMLE Step 1 score and preferred specialty information were reviewed for U.S. seniors who responded to the 2015 NRMP Applicant Survey. Unmatched U.S. seniors were categorized as "strong," "solid," "marginal," or "weak" based on the perceived competitiveness of their Step 1 scores compared with U.S. seniors who matched in the same preferred specialty. The numbers of applications sent, interviews obtained, and programs ranked also were examined by Match outcome. Strong unmatched U.S. seniors submitted significantly more applications to achieve and attend approximately the same number of interviews as strong matched U.S. seniors. Strong unmatched seniors ranked fewer programs than their matched counterparts. As a group, unmatched U.S. seniors were less likely than their matched counterparts to rank a mix of competitive and less competitive programs and more likely to rank programs based on their perceived likelihood of matching. A small number of unmatched U.S. seniors would have matched if they had ranked programs that ranked them. U.S. seniors' Match outcomes may be affected by applicant characteristics that negatively influence their selection for interviews, and their difficulties may be exacerbated by disadvantageous ranking behaviors.

  20. Matching score based face recognition

    NARCIS (Netherlands)

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

    2006-01-01

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

  1. Platform pricing in matching markets

    NARCIS (Netherlands)

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

    2011-01-01

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

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

  3. Role model and prototype matching

    DEFF Research Database (Denmark)

    Lykkegaard, Eva; Ulriksen, Lars

    2016-01-01

    ’ meetings with the role models affected their thoughts concerning STEM students and attending university. The regular self-to-prototype matching process was shown in real-life role-models meetings to be extended to a more complex three-way matching process between students’ self-perceptions, prototype...

  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. Efficient line matching with homography

    Science.gov (United States)

    Shen, Yan; Dai, Yuxing; Zhu, Zhiliang

    2018-03-01

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

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

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

    Science.gov (United States)

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

    2018-02-01

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

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

    OpenAIRE

    Smiljanic, M.; van Keulen, 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 all kinds of schema matching problems. The target is specifically personal schema matching using XML. The report is organized as follows. Chapter 2 provides a detailed description of our research ...

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

    Science.gov (United States)

    Narayan, Deepak

    2013-01-01

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

  10. Matching by Monotonic Tone Mapping.

    Science.gov (United States)

    Kovacs, Gyorgy

    2018-06-01

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

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

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

  13. Probability matching and strategy availability.

    Science.gov (United States)

    Koehler, Derek J; James, Greta

    2010-09-01

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

  14. Risk of bacterial cross infection associated with inspiration through flow-based spirometers.

    Science.gov (United States)

    Bracci, Massimo; Strafella, Elisabetta; Croce, Nicola; Staffolani, Sara; Carducci, Annalaura; Verani, Marco; Valentino, Matteo; Santarelli, Lory

    2011-02-01

    Bacterial contamination of spirometers has been documented in water-sealed devices, mouthpieces, and connection tubes. Little information is available about bacterial contamination of flow-based apparatuses such as turbine-type spirometers and pneumotachographs. Inspiration through contaminated equipment is a potential source of cross infection. To investigate bacteria mobilization (ie, bacteria detachment and aerosolization from the instrument) during routine spirometric testing, 2 types of flow-based spirometers were used. Bacteria mobilization during artificial inspiration through in-line filters or cardboard mouthpieces was evaluated. Nine hundred workers undergoing periodic spirometric testing were enrolled at the occupational physician office in 30 sessions of 30 subjects each. The participants were asked to perform a forced vital capacity test in a turbine-type spirometer and in an unheated pneumotachograph fitted with disposable in-line filters or cardboard mouthpieces. To evaluate bacterial mobilization, an artificial inspiration was performed and bacterial growth determined. The bacterial growth analysis was assessed after the first and the thirtieth spirometric tests of each session without disinfecting the instruments between tests. In addition, instrument bacterial contamination was evaluated. No significant bacterial mobilization and instrument contamination were found in spirometric tests executed with in-line filters. Conversely, a significant bacterial mobilization and instrument contamination were observed in tests performed with cardboard mouthpieces. Differences between the 2 spirometers were not significant. In-line filters may effectively reduce the risk of bacterial cross infection. Inspiration through flow-based spirometers fitted with disposable cardboard mouthpieces is completely safe when combined with spirometer disinfection/sterilization between subjects. Copyright © 2011 Association for Professionals in Infection Control and

  15. Computing solutions for matching games

    NARCIS (Netherlands)

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

    2012-01-01

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

  16. Probability Matching, Fast and Slow

    OpenAIRE

    Koehler, Derek J.; James, Greta

    2014-01-01

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

  17. Matching games with partial information

    Science.gov (United States)

    Laureti, Paolo; Zhang, Yi-Cheng

    2003-06-01

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

  18. A two-stage flow-based intrusion detection model for next-generation networks.

    Science.gov (United States)

    Umer, Muhammad Fahad; Sher, Muhammad; Bi, Yaxin

    2018-01-01

    The next-generation network provides state-of-the-art access-independent services over converged mobile and fixed networks. Security in the converged network environment is a major challenge. Traditional packet and protocol-based intrusion detection techniques cannot be used in next-generation networks due to slow throughput, low accuracy and their inability to inspect encrypted payload. An alternative solution for protection of next-generation networks is to use network flow records for detection of malicious activity in the network traffic. The network flow records are independent of access networks and user applications. In this paper, we propose a two-stage flow-based intrusion detection system for next-generation networks. The first stage uses an enhanced unsupervised one-class support vector machine which separates malicious flows from normal network traffic. The second stage uses a self-organizing map which automatically groups malicious flows into different alert clusters. We validated the proposed approach on two flow-based datasets and obtained promising results.

  19. Matching faces with emotional expressions

    Directory of Open Access Journals (Sweden)

    Wenfeng eChen

    2011-08-01

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

  20. The Kent Face Matching Test.

    Science.gov (United States)

    Fysh, Matthew C; Bindemann, Markus

    2018-05-01

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

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

  2. A Phase Matching, Adiabatic Accelerator

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-05-01

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

  3. Mix-and-match holography

    KAUST Repository

    Peng, Yifan

    2017-11-22

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

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

    NARCIS (Netherlands)

    Smiljanic, M.; van Keulen, Maurice; Jonker, Willem

    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

  5. Canonical Skeletons for Shape Matching

    NARCIS (Netherlands)

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

    2006-01-01

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

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

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

  8. Towards optimal packed string matching

    DEFF Research Database (Denmark)

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

    2014-01-01

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

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

  10. Myocardium tracking via matching distributions.

    Science.gov (United States)

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

    2009-01-01

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

  11. Programming

    International Nuclear Information System (INIS)

    Jackson, M.A.

    1982-01-01

    The programmer's task is often taken to be the construction of algorithms, expressed in hierarchical structures of procedures: this view underlies the majority of traditional programming languages, such as Fortran. A different view is appropriate to a wide class of problem, perhaps including some problems in High Energy Physics. The programmer's task is regarded as having three main stages: first, an explicit model is constructed of the reality with which the program is concerned; second, this model is elaborated to produce the required program outputs; third, the resulting program is transformed to run efficiently in the execution environment. The first two stages deal in network structures of sequential processes; only the third is concerned with procedure hierarchies. (orig.)

  12. Programming

    OpenAIRE

    Jackson, M A

    1982-01-01

    The programmer's task is often taken to be the construction of algorithms, expressed in hierarchical structures of procedures: this view underlies the majority of traditional programming languages, such as Fortran. A different view is appropriate to a wide class of problem, perhaps including some problems in High Energy Physics. The programmer's task is regarded as having three main stages: first, an explicit model is constructed of the reality with which the program is concerned; second, thi...

  13. Matching of equivalent field regions

    DEFF Research Database (Denmark)

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

    2005-01-01

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

  14. Mix-and-match holography

    KAUST Repository

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

    2017-01-01

    target images into pairs of front and rear phase-distorting surfaces. Different target holograms can be decoded by mixing and matching different front and rear surfaces under specific geometric alignments. Our approach, which we call mixWe derive a detailed image formation model for the setting of holographic projection displays, as well as a multiplexing method based on a combination of phase retrieval methods and complex matrix factorization. We demonstrate several application scenarios in both simulation and physical prototypes.

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

  16. Impedance-matched Marx generators

    Science.gov (United States)

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

    2017-04-01

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

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

    Science.gov (United States)

    Dowd, E T; Hingst, A G

    1983-08-01

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

  18. Real-time estimation of optical flow based on optimized haar wavelet features

    DEFF Research Database (Denmark)

    Salmen, Jan; Caup, Lukas; Igel, Christian

    2011-01-01

    -objective optimization. In this work, we build on a popular algorithm developed for realtime applications. It is originally based on the Census transform and benefits from this encoding for table-based matching and tracking of interest points. We propose to use the more universal Haar wavelet features instead...

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

  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. FLOW-BASED NETWORK MEASURES OF BRAIN CONNECTIVITY IN ALZHEIMER'S DISEASE.

    Science.gov (United States)

    Prasad, Gautam; Joshi, Shantanu H; Nir, Talia M; Toga, Arthur W; Thompson, Paul M

    2013-01-01

    We present a new flow-based method for modeling brain structural connectivity. The method uses a modified maximum-flow algorithm that is robust to noise in the diffusion data and guided by biologically viable pathways and structure of the brain. A flow network is first created using a lattice graph by connecting all lattice points (voxel centers) to all their neighbors by edges. Edge weights are based on the orientation distribution function (ODF) value in the direction of the edge. The maximum-flow is computed based on this flow graph using the flow or the capacity between each region of interest (ROI) pair by following the connected tractography fibers projected onto the flow graph edges. Network measures such as global efficiency, transitivity, path length, mean degree, density, modularity, small world, and assortativity are computed from the flow connectivity matrix. We applied our method to diffusion-weighted images (DWIs) from 110 subjects (28 normal elderly, 56 with early and 11 with late mild cognitive impairment, and 15 with AD) and segmented co-registered anatomical MRIs into cortical regions. Experimental results showed better performance compared to the standard fiber-counting methods when distinguishing Alzheimer's disease from normal aging.

  2. A novel flow-based parameter of collateral function assessed by intracoronary thermodilution.

    Science.gov (United States)

    Lindner, Markus; Felix, Stephan B; Empen, Klaus; Reffelmann, Thorsten

    2014-04-01

    Currently, many methods for quantitation of coronary collateral function are based on intracoronary pressure measurements distal of an occluded balloon, which do not fully account for the dynamic nature of collateral flow. Therefore, a flow-based parameter of coronary collateral function based upon principles of thermodilution was evaluated. In 26 patients with a high-grade coronary artery stenosis, intracoronary hemodynamics were analyzed by the RadiAnalyzer system (St Jude Medical), including fractional flow reserve (FFR), index of microcirculatory resistance (IMR), and the pressure-based collateral flow index (CFI) during balloon occlusion and hyperemia (intravenous adenosine). Moreover, immediately after an intracoronary bolus of room-temperature saline, the balloon was occluded and the intracoronary temperature distal to the balloon was analyzed over time. The slope of the temperature-time curve was calculated after logarithmic transformation as an index of collateral blood flow (CBFI). The coefficient of variation between two measurements of CBFI amounted to 11 ± 2%. In patients with CFI ≥0.25, CBFI amounted to 0.55 ± 0.09, whereas in those with CFI function, and should be evaluated in further studies.

  3. On Tree Pattern Matching by Pushdown Automata

    Directory of Open Access Journals (Sweden)

    T. Flouri

    2009-01-01

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

  4. Matchings with Externalities and Attitudes

    DEFF Research Database (Denmark)

    Branzei, Simina; Michalak, Tomasz; Rahwan, Talal

    2013-01-01

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

  5. 34 CFR 350.62 - What are the matching requirements?

    Science.gov (United States)

    2010-07-01

    ... PROJECTS AND CENTERS PROGRAM What Conditions Must Be Met After an Award? § 350.62 What are the matching... projects that bear directly on the development of procedures, methods, and devices to assist the provision... projects. (2) Each grantee must participate in the costs of those projects. (3) The specific amount of cost...

  6. 38 CFR 61.16 - Matching funds for capital grants.

    Science.gov (United States)

    2010-07-01

    ... capital grants. 61.16 Section 61.16 Pensions, Bonuses, and Veterans' Relief DEPARTMENT OF VETERANS AFFAIRS (CONTINUED) VA HOMELESS PROVIDERS GRANT AND PER DIEM PROGRAM § 61.16 Matching funds for capital grants. The amount of a capital grant may not exceed 65 percent of the total cost of the project for which the...

  7. CONVEC: a computer program for transient incompressible fluid flow based on quadratic finite elements. Part 1: theoretical aspects

    International Nuclear Information System (INIS)

    Laval, H.

    1981-01-01

    This report describes the theoretical and numerical aspects of the finite element computer code CONVEC designed for the transient analysis of two-dimensional plane or three-dimensional axisymmetric incompressible flows including the effects of heat transfer. The governing equations for the above class of problems are the time-dependent incompressible Navier-Stokes equations and the thermal energy equation. The general class of flow problems analysed by CONVEC is discussed and the equations for the initial-boundary value problem are represented. A brief description of the finite element method and the weighted residual formulation is presented. The numerical solution of the incompressible equations is achieved by using a fractional step method. The mass lumping process associated with an explicit time integration scheme is described. The time integration is analysed and the stability conditions are derived. Numerical applications are presented. Standard problems of natural and forced convection are solved and the solutions obtained are compared with other numerical solutions published in the literature

  8. World wide matching of registration metrology tools of various generations

    Science.gov (United States)

    Laske, F.; Pudnos, A.; Mackey, L.; Tran, P.; Higuchi, M.; Enkrich, C.; Roeth, K.-D.; Schmidt, K.-H.; Adam, D.; Bender, J.

    2008-10-01

    Turn around time/cycle time is a key success criterion in the semiconductor photomask business. Therefore, global mask suppliers typically allocate work loads based on fab capability and utilization capacity. From a logistical point of view, the manufacturing location of a photomask should be transparent to the customer (mask user). Matching capability of production equipment and especially metrology tools is considered a key enabler to guarantee cross site manufacturing flexibility. Toppan, with manufacturing sites in eight countries worldwide, has an on-going program to match the registration metrology systems of all its production sites. This allows for manufacturing flexibility and risk mitigation.In cooperation with Vistec Semiconductor Systems, Toppan has recently completed a program to match the Vistec LMS IPRO systems at all production sites worldwide. Vistec has developed a new software feature which allows for significantly improved matching of LMS IPRO(x) registration metrology tools of various generations. We will report on the results of the global matching campaign of several of the leading Toppan sites.

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

  10. Rethinking the Match: A Proposal for Modern Matchmaking.

    Science.gov (United States)

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

    2018-01-01

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

  11. Uncertainty in sap flow-based transpiration due to xylem properties

    Science.gov (United States)

    Looker, N. T.; Hu, J.; Martin, J. T.; Jencso, K. G.

    2014-12-01

    Transpiration, the evaporative loss of water from plants through their stomata, is a key component of the terrestrial water balance, influencing streamflow as well as regional convective systems. From a plant physiological perspective, transpiration is both a means of avoiding destructive leaf temperatures through evaporative cooling and a consequence of water loss through stomatal uptake of carbon dioxide. Despite its hydrologic and ecological significance, transpiration remains a notoriously challenging process to measure in heterogeneous landscapes. Sap flow methods, which estimate transpiration by tracking the velocity of a heat pulse emitted into the tree sap stream, have proven effective for relating transpiration dynamics to climatic variables. To scale sap flow-based transpiration from the measured domain (often area) to the whole-tree level, researchers generally assume constancy of scale factors (e.g., wood thermal diffusivity (k), radial and azimuthal distributions of sap velocity, and conducting sapwood area (As)) through time, across space, and within species. For the widely used heat-ratio sap flow method (HRM), we assessed the sensitivity of transpiration estimates to uncertainty in k (a function of wood moisture content and density) and As. A sensitivity analysis informed by distributions of wood moisture content, wood density and As sampled across a gradient of water availability indicates that uncertainty in these variables can impart substantial error when scaling sap flow measurements to the whole tree. For species with variable wood properties, the application of the HRM assuming a spatially constant k or As may systematically over- or underestimate whole-tree transpiration rates, resulting in compounded error in ecosystem-scale estimates of transpiration.

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

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

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

    International Nuclear Information System (INIS)

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

    2016-01-01

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

  15. Robust matching for voice recognition

    Science.gov (United States)

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

    1994-10-01

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

  16. Ontology Matching with Semantic Verification.

    Science.gov (United States)

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

    2009-09-01

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

  17. Using crosswell data to enhance history matching

    KAUST Repository

    Ravanelli, Fabio M.; Hoteit, Ibrahim

    2014-01-01

    of the reality. This problem is mitigated by conditioning the model with data through data assimilation, a process known in the oil industry as history matching. Several recent advances are being used to improve history matching reliability, notably the use

  18. Exact Methods for Solving the Train Departure Matching Problem

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund; Bull, Simon Henry

    In this paper we consider the train departure matching problem which is an important subproblem of the Rolling Stock Unit Management on Railway Sites problem introduced in the ROADEF/EURO Challenge 2014. The subproblem entails matching arriving train units to scheduled departing trains at a railway...... site while respecting multiple physical and operational constraints. In this paper we formally define that subproblem, prove its NP- hardness, and present two exact method approaches for solving the problem. First, we present a compact Mixed Integer Program formulation which we solve using a MIP solver...

  19. Unification and matching in Church's Original Lambda Calculus

    OpenAIRE

    Hustadt, U.

    1992-01-01

    In current implementations of higher-order logics higher-orderunification is used to lift the resolution principle from the first-order case to the higher-order case. Higher-order matching is the core of implementations of higher-order rewriting systems and some systems for program transformation. In this paper I argue that Church's original lambda calculus, called non-forgetful lambda calculus, is an appropriate basis for higher-order matching. I provide two correct and complete algorithms f...

  20. Dipole showers and automated NLO matching in Herwig++

    International Nuclear Information System (INIS)

    Plaetzer, Simon; Gieseke, Stefan

    2011-09-01

    We report on the implementation of a coherent dipole shower algorithm along with an automated implementation for dipole subtraction and for performing POWHEG- and MC rate at NLO-type matching to next-to-leading order (NLO) calculations. Both programs are implemented as add-on modules to the event generator HERWIG++. A preliminary tune of parameters to data acquired at LEP, HERA and Drell-Yan pair production at the Tevatron has been performed, and we find an overall very good description which is slightly improved by the NLO matching. (orig.)

  1. Dipole showers and automated NLO matching in Herwig++

    Energy Technology Data Exchange (ETDEWEB)

    Plaetzer, Simon [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Gieseke, Stefan [Karlsruher Institut fuer Technologie, Karlsruhe (Germany). Inst. fuer Theoretische Teilchenphysik

    2011-09-15

    We report on the implementation of a coherent dipole shower algorithm along with an automated implementation for dipole subtraction and for performing POWHEG- and MC rate at NLO-type matching to next-to-leading order (NLO) calculations. Both programs are implemented as add-on modules to the event generator HERWIG++. A preliminary tune of parameters to data acquired at LEP, HERA and Drell-Yan pair production at the Tevatron has been performed, and we find an overall very good description which is slightly improved by the NLO matching. (orig.)

  2. A multiscale approach to mutual information matching

    NARCIS (Netherlands)

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

    1998-01-01

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

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

  4. Database crime to crime match rate calculation.

    Science.gov (United States)

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

    2009-06-01

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

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

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

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

  8. Learning SAS’s Perl Regular Expression Matching the Easy Way: By Doing

    Science.gov (United States)

    2015-01-12

    Doing 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S) Paul Genovesi 5d. PROJECT NUMBER 5e. TASK NUMBER 5f...regex_learning_tool allows both beginner and expert to efficiently practice PRX matching by selecting and processing only the match records that the user is interested...perl regular expression and/or source string. The regex_learning_tool allows both beginner and expert to efficiently practice PRX matching by

  9. Best Practices for NPT Transit Matching

    International Nuclear Information System (INIS)

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

    2016-01-01

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

  10. Probabilistic seismic history matching using binary images

    Science.gov (United States)

    Davolio, Alessandra; Schiozer, Denis Jose

    2018-02-01

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

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

  12. Is it a match? a novel method of evaluating medical school success.

    Science.gov (United States)

    Chang, Leslie L; Nagler, Alisa; Rudd, Mariah; Grochowski, Colleen O'Connor; Buckley, Edward G; Chudgar, Saumil M; Engle, Deborah L

    2018-12-01

    Medical education program evaluation allows for curricular improvements to both Undergraduate (UME) and Graduate Medical Education (GME). UME programs are left with little more than match rates and self-report to evaluate success of graduates in The Match. This manuscript shares a novel method of program evaluation through a systematic assessment of Match outcomes. Surveys were developed and distributed to Program Training Directors (PTDs) at our institution to classify residency programs into which our UME graduates matched using an ordinal response scale and open-ended responses. Outcomes-based measures for UME graduates were collected and analyzed. The relationship between PTD survey data and UME graduates' outcomes were explored. Open-ended response data were qualitatively analyzed using iterative cycles of coding and identifying themes. The PTD survey response rate was 100%. 71% of our graduates matched to programs ranked as 'elite' (36%) or 'top' (35%) tier. The mean total number of 'Honors' grades achieved by UME graduates was 2.6. Data showed that graduates entering elite and top GME programs did not consistently earn Honors in their associated clerkships. A positive correlation was identified between USMLE Step 1 score, number of honors, and residency program rankings for a majority of the programs. Qualitative analysis identified research, faculty, and clinical exposure as necessary characteristics of 'elite' programs:. Factors considered by PTDs in the rating of programs included reputation, faculty, research, national presence and quality of graduates. This study describes a novel outcomes-based method of evaluating the success of UME programs. Results provided useful feedback about the quality of our UME program and its ability to produce graduates who match in highly-regarded GME programs. The findings from this study can benefit Clerkship Directors, Student Affairs and Curriculam Deans, and residency PTDs as they help students determine their

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

  14. 34 CFR 636.5 - What are the matching contribution and planning consortium requirements?

    Science.gov (United States)

    2010-07-01

    ... 34 Education 3 2010-07-01 2010-07-01 false What are the matching contribution and planning... PROGRAM General § 636.5 What are the matching contribution and planning consortium requirements? (a) The... agreed to by the members of a planning consortium. (Authority: 20 U.S.C. 1136b, 1136e) ...

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

  16. Matched Filter Processing for Asteroid Detection

    Science.gov (United States)

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

    2005-10-01

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

  17. Fast and compact regular expression matching

    DEFF Research Database (Denmark)

    Bille, Philip; Farach-Colton, Martin

    2008-01-01

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

  18. Matching fields and lattice points of simplices

    OpenAIRE

    Loho, Georg; Smith, Ben

    2018-01-01

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

  19. Online Job Search and Matching Quality

    OpenAIRE

    Constantin Mang

    2012-01-01

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

  20. 75 FR 29774 - Office of Child Support Enforcement; Privacy Act of 1974; Computer Matching Agreement

    Science.gov (United States)

    2010-05-27

    ... of Federal Systems, Office of Automation and Program Operations, Office of Child Support Enforcement... INFORMATION CONTACT: Linda Deimeke, Director, Division of Federal Systems, Office of Automation and Program..., home addresses, and employment information. E. Inclusive Dates of the Matching Program The computer...

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

  2. Anomalous dispersion enhanced Cerenkov phase-matching

    Energy Technology Data Exchange (ETDEWEB)

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

    1993-11-01

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

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

    Science.gov (United States)

    Arnold, Raoul; Neu, Marie; Hirtler, Daniel; Gimpel, Charlotte; Markl, Michael; Geiger, Julia

    2017-04-01

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

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

  5. Learning Disabilities and the Auditory and Visual Matching Computer Program

    Science.gov (United States)

    Tormanen, Minna R. K.; Takala, Marjatta; Sajaniemi, Nina

    2008-01-01

    This study examined whether audiovisual computer training without linguistic material had a remedial effect on different learning disabilities, like dyslexia and ADD (Attention Deficit Disorder). This study applied a pre-test-intervention-post-test design with students (N = 62) between the ages of 7 and 19. The computer training lasted eight weeks…

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

    Science.gov (United States)

    2010-11-16

    ... Crime Control Act of 1990, Public Law 101-647 (hereinafter referred to as ``section 5301''), authorizes... amended and redesignated as section 421 of the Controlled Substances Act by section 1002(d) of the Crime... accessible format (e.g., Braille, large print, audiotape, or computer diskette) by contacting the contact...

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

    Science.gov (United States)

    2011-05-02

    ..., Internal Revenue Service, SE:S:CLD:GLD:DS--M/S C-2-235, 500 Ellin Road, Lanham, MD 20706. FOR FURTHER..., Internal Revenue Service, SE:S:CLD:GLD:DS--M/S C-2-235, 500 Ellin Road, Lanham, MD 20706. (202) 283-5211...

  8. 75 FR 28252 - Notice of a Computer Matching Program

    Science.gov (United States)

    2010-05-20

    ... 1.F, GSA Information Technology (IT) Security Policy, and CIO 2104.1, GSA Information Technology (IT...: Director, Office of Forensic Auditing, Office of Inspector General, 1800 F Street, NW., Room G-242...

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

    International Nuclear Information System (INIS)

    Arnold, Raoul; Neu, Marie; Hirtler, Daniel; Gimpel, Charlotte; Markl, Michael; Geiger, Julia

    2017-01-01

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

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

  11. On Tree-Constrained Matchings and Generalizations

    NARCIS (Netherlands)

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

    2011-01-01

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

  12. Matching of Tore Supra ICRH antennas

    International Nuclear Information System (INIS)

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

    1994-01-01

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

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

  14. On solution concepts for matching games

    NARCIS (Netherlands)

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

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

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

  16. Competence Matching Tool - Explanations and Implementation

    NARCIS (Netherlands)

    Herder, Eelco; Kärger, Philipp

    2010-01-01

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

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

  18. Local Stereo Matching Using Adaptive Local Segmentation

    NARCIS (Netherlands)

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

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

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

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

    Science.gov (United States)

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

    2016-01-01

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

  1. Stereo Matching Based On Election Campaign Algorithm

    Directory of Open Access Journals (Sweden)

    Xie Qing Hua

    2016-01-01

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

  2. Fiber cavities with integrated mode matching optics.

    Science.gov (United States)

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

    2017-07-17

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

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

    KAUST Repository

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

    2016-01-01

    Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have

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

    CSIR Research Space (South Africa)

    Mlambo, CS

    2016-12-01

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

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

  6. Sprego programming

    OpenAIRE

    Csernoch, Mária; Biró, Piroska

    2015-01-01

    Spreadsheet management is a border-land between office applications and programming, however, it is rather communicated that spreadsheet is nothing more than an easily handled fun piece. Consequently, the complexity of spreadsheet handling, the unprepared end-users, their problem solving abilities and approaches do not match. To overcome these problems we have developed and introduced Sprego (Spreadsheet Lego). Sprego is a simplified functional programming language in spreadsheet environment,...

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

  8. MR angiography with a matched filter

    International Nuclear Information System (INIS)

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

    1987-01-01

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

  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 Judicial Supervision to Clients’ Risk Status in Drug Court

    Science.gov (United States)

    Marlowe, Douglas B.; Festinger, David S.; Lee, Patricia A.; Dugosh, Karen L.; Benasutti, Kathleen M.

    2007-01-01

    This article reports outcomes from a program of experimental research evaluating the risk principle in drug courts. Prior studies revealed that participants who were high risk and had (a) antisocial personality disorder or (b) a prior history of drug abuse treatment performed better in drug court when scheduled to attend biweekly judicial status hearings in court. In contrast, participants who were low risk performed equivalently regardless of the court hearings schedule. This study prospectively matches drug court clients to the optimal schedule of court hearings based on an assessment of their risk status and compares outcomes to clients randomly assigned to the standard hearings schedule. Results confirmed that participants who were high risk and matched to biweekly hearings had better during-treatment outcomes than participants assigned to status hearings as usual. These findings provide confirmation of the risk principle in drug courts and yield practical information for enhancing the efficacy and cost-efficiency of drug courts. PMID:18174915

  11. Matching fully differential NNLO calculations and parton showers

    International Nuclear Information System (INIS)

    Alioli, Simone; Bauer, Christian W.; Berggren, Calvin; Walsh, Jonathan R.; Zuberi, Saba

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

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

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

  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. A new cellular automaton for signal controlled traffic flow based on driving behaviors

    Science.gov (United States)

    Wang, Yang; Chen, Yan-Yan

    2015-03-01

    The complexity of signal controlled traffic largely stems from the various driving behaviors developed in response to the traffic signal. However, the existing models take a few driving behaviors into account and consequently the traffic dynamics has not been completely explored. Therefore, a new cellular automaton model, which incorporates the driving behaviors typically manifesting during the different stages when the vehicles are moving toward a traffic light, is proposed in this paper. Numerical simulations have demonstrated that the proposed model can produce the spontaneous traffic breakdown and the dissolution of the over-saturated traffic phenomena. Furthermore, the simulation results indicate that the slow-to-start behavior and the inch-forward behavior can foster the traffic breakdown. Particularly, it has been discovered that the over-saturated traffic can be revised to be an under-saturated state when the slow-down behavior is activated after the spontaneous breakdown. Finally, the contributions of the driving behaviors on the traffic breakdown have been examined. Project supported by the National Basic Research Program of China (Grand No. 2012CB723303) and the Beijing Committee of Science and Technology, China (Grand No. Z1211000003120100).

  15. Fully automatic flow-based device for monitoring of drug permeation across a cell monolayer.

    Science.gov (United States)

    Zelená, Lucie; Marques, Sara S; Segundo, Marcela A; Miró, Manuel; Pávek, Petr; Sklenářová, Hana; Solich, Petr

    2016-01-01

    A novel flow-programming setup based on the sequential injection principle is herein proposed for on-line monitoring of temporal events in cell permeation studies. The permeation unit consists of a Franz cell with its basolateral compartment mixed under mechanical agitation and thermostated at 37 °C. The apical compartment is replaced by commercially available Transwell inserts with a precultivated cell monolayer. The transport of drug substances across epithelial cells genetically modified with the P-glycoprotein membrane transporter (MDCKII-MDR1) is monitored on-line using rhodamine 123 as a fluorescent marker. The permeation kinetics of the marker is obtained in a fully automated mode by sampling minute volumes of solution from the basolateral compartment in short intervals (10 min) up to 4 h. The effect of a P-glycoprotein transporter inhibitor, verapamil as a model drug, on the efficiency of the marker transport across the cell monolayer is thoroughly investigated. The analytical features of the proposed flow method for cell permeation studies in real time are critically compared against conventional batch-wise procedures and microfluidic devices.

  16. Shape-matching soft mechanical metamaterials

    NARCIS (Netherlands)

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

    2018-01-01

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

  17. The Effectiveness of Advertising Matching Purchase Motivation

    NARCIS (Netherlands)

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

    2001-01-01

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

  18. Personalized Medicine: Matching Treatments to Your Genes

    Science.gov (United States)

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

  19. Mobile Application for Pesticide Label Matching

    Science.gov (United States)

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

  20. Study of matching between HIRFL and CSR

    International Nuclear Information System (INIS)

    Tang Jingyu; Li Haohu; Yuan Youjin

    2001-01-01

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

  1. Matching modes between HIRFL and CSR

    International Nuclear Information System (INIS)

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

    2001-01-01

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

  2. Fractional Order Element Based Impedance Matching

    KAUST Repository

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

    2014-01-01

    Disclosed are various embodiments of methods and systems related to fractional order element based impedance matching. In one embodiment, a method includes aligning a traditional Smith chart (|.alpha.|=1) with a fractional order Smith chart (|.alpha

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

  4. Reliability of visual and instrumental color matching.

    Science.gov (United States)

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

    2017-09-01

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

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

    Science.gov (United States)

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

    2016-08-01

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

  6. Fingerprint Recognition Using Minutia Score Matching

    OpenAIRE

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

    2010-01-01

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

  7. Parikh Matching in the Streaming Model

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  8. THE Economics of Match-Fixing

    OpenAIRE

    Caruso, Raul

    2007-01-01

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

  9. INFORMATION SYSTEMS AUDIT CURRICULA CONTENT MATCHING

    OpenAIRE

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

    2014-01-01

    Financial and internal auditors must cope with the challenge of performing their mission in technology enhanced environment. In this article we match the information technology description found in the International Federation of Accountants (IFAC) and the Institute of Internal Auditors (IIA) curricula against the Model Curriculum issued by the Information Systems Audit and Control Association (ISACA). By reviewing these three curricula, we matched the content in the ISACA Model Curriculum wi...

  10. Fast group matching for MR fingerprinting reconstruction.

    Science.gov (United States)

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

    2015-08-01

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

  11. Quantum learning and universal quantum matching machine

    International Nuclear Information System (INIS)

    Sasaki, Masahide; Carlini, Alberto

    2002-01-01

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

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

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

  14. System-Level Modeling and Synthesis Techniques for Flow-Based Microfluidic Very Large Scale Integration Biochips

    DEFF Research Database (Denmark)

    Minhass, Wajid Hassan

    Microfluidic biochips integrate different biochemical analysis functionalities on-chip and offer several advantages over the conventional biochemical laboratories. In this thesis, we focus on the flow-based biochips. The basic building block of such a chip is a valve which can be fabricated at very...... propose a framework for mapping the biochemical applications onto the mVLSI biochips, binding and scheduling the operations and performing fluid routing. A control synthesis framework for determining the exact valve activation sequence required to execute the application is also proposed. In order...... to reduce the macro-assembly around the chip and enhance chip scalability, we propose an approach for the biochip pin count minimization. We also propose a throughput maximization scheme for the cell culture mVLSI biochips, saving time and reducing costs. We have extensively evaluated the proposed...

  15. Preimplantation genetic diagnosis with HLA matching.

    Science.gov (United States)

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

    2004-08-01

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

  16. Content Based Image Matching for Planetary Science

    Science.gov (United States)

    Deans, M. C.; Meyer, C.

    2006-12-01

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

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

  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. Unsupervised image matching based on manifold alignment.

    Science.gov (United States)

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

    2012-08-01

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

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

  1. Iris Matching Based on Personalized Weight Map.

    Science.gov (United States)

    Dong, Wenbo; Sun, Zhenan; Tan, Tieniu

    2011-09-01

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

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

  3. Shape-matching soft mechanical metamaterials.

    Science.gov (United States)

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

    2018-01-17

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

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

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

  6. Covariant diagrams for one-loop matching

    International Nuclear Information System (INIS)

    Zhang, Zhengkang

    2016-10-01

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

  7. 6d, Coulomb branch anomaly matching

    Science.gov (United States)

    Intriligator, Kenneth

    2014-10-01

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

  8. Matching to Openly Innovate with Suppliers

    DEFF Research Database (Denmark)

    Laursen, Linda Nhu

    2017-01-01

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

  9. Covariant diagrams for one-loop matching

    Energy Technology Data Exchange (ETDEWEB)

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

    2017-05-30

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

  10. A medium resolution fingerprint matching system

    Directory of Open Access Journals (Sweden)

    Ayman Mohammad Bahaa-Eldin

    2013-09-01

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

  11. Covariant diagrams for one-loop matching

    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.

  12. Matching of ion sources to cyclotron inflectors

    International Nuclear Information System (INIS)

    Baartman, R.

    1988-06-01

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

  13. Covariant diagrams for one-loop matching

    International Nuclear Information System (INIS)

    Zhang, Zhengkang

    2017-01-01

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

  14. Surface Area Distribution Descriptor for object matching

    Directory of Open Access Journals (Sweden)

    Mohamed F. Gafar

    2010-07-01

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

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

  16. Techniques Used in String Matching for Network Security

    OpenAIRE

    Jamuna Bhandari

    2014-01-01

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

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

  18. Physiological characteristics of badminton match play.

    Science.gov (United States)

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

    2007-07-01

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

  19. History Matching: Towards Geologically Reasonable Models

    DEFF Research Database (Denmark)

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

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

  20. Faster and Simpler Approximation of Stable Matchings

    Directory of Open Access Journals (Sweden)

    Katarzyna Paluch

    2014-04-01

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

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

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

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

  4. A functional analysis of photo-object matching skills of severely retarded adolescents.

    Science.gov (United States)

    Dixon, L S

    1981-01-01

    Matching-to-sample procedures were used to assess picture representation skills of severely retarded, nonverbal adolescents. Identity matching within the classes of objects and life-size, full-color photos of the objects was first used to assess visual discrimination, a necessary condition for picture representation. Picture representation was then assessed through photo-object matching tasks. Five students demonstrated visual discrimination (identity matching) within the two classes of photos and the objects. Only one student demonstrated photo-object matching. The results of the four students who failed to demonstrate photo-object matching suggested that physical properties of photos (flat, rectangular) and depth dimensions of objects may exert more control over matching than the similarities of the objects and images within the photos. An analysis of figure-ground variables was conducted to provide an empirical basis for program development in the use of pictures. In one series of tests, rectangular shape and background were removed by cutting out the figures in the photos. The edge shape of the photo and the edge shape of the image were then identical. The results suggest that photo-object matching may be facilitated by using cut-out figures rather than the complete rectangular photo.

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

    OpenAIRE

    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 expectations, context and characteristics of female borrowers in a rural agrarian setting in Uganda. Quantitative and qualiative methods were used to obtain socio-demographic, personality and microenterprise...

  6. Dispersion and betatron matching into the linac

    International Nuclear Information System (INIS)

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

    1991-05-01

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

  7. Photon signature analysis using template matching

    Energy Technology Data Exchange (ETDEWEB)

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

    2011-10-01

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

  8. Probabilistic evaluation of process model matching techniques

    NARCIS (Netherlands)

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

    2016-01-01

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

  9. Decentralized trade with bargaining and voluntary matching

    DEFF Research Database (Denmark)

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

    1994-01-01

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

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

  11. 7 CFR 3430.906 - Matching requirements.

    Science.gov (United States)

    2010-01-01

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

  12. Symmetric Circular Matchings and RNA Folding

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  13. 13 CFR 130.450 - Matching funds.

    Science.gov (United States)

    2010-01-01

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

  14. 13 CFR 108.2030 - Matching requirements.

    Science.gov (United States)

    2010-01-01

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

  15. Performance Evaluation of Tree Object Matching

    DEFF Research Database (Denmark)

    Somchaipeng, Kerawit; Sporring, Jon; Kreiborg, Sven

    2005-01-01

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

  16. Language style matching and police interrogation outcomes

    NARCIS (Netherlands)

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

    2014-01-01

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

  17. Sidescan Sonar Image Matching Using Cross Correlation

    DEFF Research Database (Denmark)

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

    2003-01-01

    When surveying an area for sea mines with a sidescan sonar, the ability to find the same object in two different sonar images is helpful to determine the nature of the object. The main problem with matching two sidescan sonar images is that a scene changes appearance when viewed from different vi...

  18. Matching Expectations for Successful University Student Volunteering

    Science.gov (United States)

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

    2017-01-01

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

  19. 7 CFR 3419.2 - Matching funds.

    Science.gov (United States)

    2010-01-01

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

  20. Nonlinear soliton matching between optical fibers

    DEFF Research Database (Denmark)

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

    2011-01-01

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

  1. The Match Quality Gains from Unemployment Insurance

    Science.gov (United States)

    Centeno, Mario

    2004-01-01

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

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

  3. Cash Management/Data Matching. Training Guide.

    Science.gov (United States)

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

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

  4. Fingerprint matching on smart card: A review

    CSIR Research Space (South Africa)

    Baruni, Kedimotse P

    2016-12-01

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

  5. On a special case of model matching

    Czech Academy of Sciences Publication Activity Database

    Zagalak, Petr

    2004-01-01

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

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

    International Nuclear Information System (INIS)

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

    1996-01-01

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

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

    International Nuclear Information System (INIS)

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

    1996-01-01

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

  8. Haptic spatial matching in near peripersonal space.

    Science.gov (United States)

    Kaas, Amanda L; Mier, Hanneke I van

    2006-04-01

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

  9. Fast and accurate phylogeny reconstruction using filtered spaced-word matches

    Science.gov (United States)

    Sohrabi-Jahromi, Salma; Morgenstern, Burkhard

    2017-01-01

    Abstract Motivation: Word-based or ‘alignment-free’ algorithms are increasingly used for phylogeny reconstruction and genome comparison, since they are much faster than traditional approaches that are based on full sequence alignments. Existing alignment-free programs, however, are less accurate than alignment-based methods. Results: We propose Filtered Spaced Word Matches (FSWM), a fast alignment-free approach to estimate phylogenetic distances between large genomic sequences. For a pre-defined binary pattern of match and don’t-care positions, FSWM rapidly identifies spaced word-matches between input sequences, i.e. gap-free local alignments with matching nucleotides at the match positions and with mismatches allowed at the don’t-care positions. We then estimate the number of nucleotide substitutions per site by considering the nucleotides aligned at the don’t-care positions of the identified spaced-word matches. To reduce the noise from spurious random matches, we use a filtering procedure where we discard all spaced-word matches for which the overall similarity between the aligned segments is below a threshold. We show that our approach can accurately estimate substitution frequencies even for distantly related sequences that cannot be analyzed with existing alignment-free methods; phylogenetic trees constructed with FSWM distances are of high quality. A program run on a pair of eukaryotic genomes of a few hundred Mb each takes a few minutes. Availability and Implementation: The program source code for FSWM including a documentation, as well as the software that we used to generate artificial genome sequences are freely available at http://fswm.gobics.de/ Contact: chris.leimeister@stud.uni-goettingen.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:28073754

  10. Least median of squares filtering of locally optimal point matches for compressible flow image registration

    International Nuclear Information System (INIS)

    Castillo, Edward; Guerrero, Thomas; Castillo, Richard; White, Benjamin; Rojo, Javier

    2012-01-01

    Compressible flow based image registration operates under the assumption that the mass of the imaged material is conserved from one image to the next. Depending on how the mass conservation assumption is modeled, the performance of existing compressible flow methods is limited by factors such as image quality, noise, large magnitude voxel displacements, and computational requirements. The Least Median of Squares Filtered Compressible Flow (LFC) method introduced here is based on a localized, nonlinear least squares, compressible flow model that describes the displacement of a single voxel that lends itself to a simple grid search (block matching) optimization strategy. Spatially inaccurate grid search point matches, corresponding to erroneous local minimizers of the nonlinear compressible flow model, are removed by a novel filtering approach based on least median of squares fitting and the forward search outlier detection method. The spatial accuracy of the method is measured using ten thoracic CT image sets and large samples of expert determined landmarks (available at www.dir-lab.com). The LFC method produces an average error within the intra-observer error on eight of the ten cases, indicating that the method is capable of achieving a high spatial accuracy for thoracic CT registration. (paper)

  11. A flow-based methodology for the calculation of TSO to TSO compensations for cross-border flows

    International Nuclear Information System (INIS)

    Glavitsch, H.; Andersson, G.; Lekane, Th.; Marien, A.; Mees, E.; Naef, U.

    2004-01-01

    In the context of the development of the European internal electricity market, several methods for the tarification of cross-border flows have been proposed. This paper presents a flow-based method for the calculation of TSO to TSO compensations for cross-border flows. The basic principle of this approach is the allocation of the costs of cross-border flows to the TSOs who are responsible for these flows. This method is cost reflective, non-transaction based and compatible with domestic tariffs. It can be applied when limited data are available. Each internal transmission network is then modelled as an aggregated node, called 'supernode', and the European network is synthesized by a graph of supernodes and arcs, each arc representing all cross-border lines between two adjacent countries. When detailed data are available, the proposed methodology is also applicable to all the nodes and lines of the transmission network. Costs associated with flows transiting through supernodes or network elements are forwarded through the network in a way reflecting how the flows make use of the network. The costs can be charged either towards loads and exports or towards generations and imports. Combination of the two charging directions can also be considered. (author)

  12. Privacy‐Preserving Friend Matching Protocol approach for Pre‐match in Social Networks

    DEFF Research Database (Denmark)

    Ople, Shubhangi S.; Deshmukh, Aaradhana A.; Mihovska, Albena Dimitrova

    2016-01-01

    Social services make the most use of the user profile matching to help the users to discover friends with similar social attributes (e.g. interests, location, age). However, there are many privacy concerns that prevent to enable this functionality. Privacy preserving encryption is not suitable...... for use in social networks due to its data sharing problems and information leakage. In this paper, we propose a novel framework for privacy–preserving profile matching. We implement both the client and server portion of the secure match and evaluate its performance network dataset. The results show...

  13. Nearest Neighbour Corner Points Matching Detection Algorithm

    Directory of Open Access Journals (Sweden)

    Zhang Changlong

    2015-01-01

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

  14. FINGERPRINT MATCHING BASED ON PORE CENTROIDS

    Directory of Open Access Journals (Sweden)

    S. Malathi

    2011-05-01

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

  15. SSCL RFQ-DTL Matching Section instrumentation

    International Nuclear Information System (INIS)

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

    1993-11-01

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

  16. Passport officers' errors in face matching.

    Science.gov (United States)

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

    2014-01-01

    Photo-ID is widely used in security settings, despite research showing that viewers find it very difficult to match unfamiliar faces. Here we test participants with specialist experience and training in the task: passport-issuing officers. First, we ask officers to compare photos to live ID-card bearers, and observe high error rates, including 14% false acceptance of 'fraudulent' photos. Second, we compare passport officers with a set of student participants, and find equally poor levels of accuracy in both groups. Finally, we observe that passport officers show no performance advantage over the general population on a standardised face-matching task. Across all tasks, we observe very large individual differences: while average performance of passport staff was poor, some officers performed very accurately--though this was not related to length of experience or training. We propose that improvements in security could be made by emphasising personnel selection.

  17. Passport officers' errors in face matching.

    Directory of Open Access Journals (Sweden)

    David White

    Full Text Available Photo-ID is widely used in security settings, despite research showing that viewers find it very difficult to match unfamiliar faces. Here we test participants with specialist experience and training in the task: passport-issuing officers. First, we ask officers to compare photos to live ID-card bearers, and observe high error rates, including 14% false acceptance of 'fraudulent' photos. Second, we compare passport officers with a set of student participants, and find equally poor levels of accuracy in both groups. Finally, we observe that passport officers show no performance advantage over the general population on a standardised face-matching task. Across all tasks, we observe very large individual differences: while average performance of passport staff was poor, some officers performed very accurately--though this was not related to length of experience or training. We propose that improvements in security could be made by emphasising personnel selection.

  18. SAD-Based Stereo Matching Using FPGAs

    Science.gov (United States)

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

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

  19. Final report, DOE/industry matching grant

    International Nuclear Information System (INIS)

    Kumar, Arvind S.

    2003-01-01

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

  20. Wake field in matched kicker magnet

    International Nuclear Information System (INIS)

    Miyahara, Y.

    1979-01-01

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

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

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

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

  4. Best matching Barenblatt profiles are delayed

    International Nuclear Information System (INIS)

    Dolbeault, Jean; Toscani, Giuseppe

    2015-01-01

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

  5. Matching strategies for a plasma booster

    International Nuclear Information System (INIS)

    Tomassini, P; Rossi, A R

    2016-01-01

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

  6. Electromagnetically induced transparency with matched pulses

    International Nuclear Information System (INIS)

    Harris, S.E.

    1993-01-01

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

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

  8. Stereo matching using epipolar distance transform.

    Science.gov (United States)

    Yang, Qingxiong; Ahuja, Narendra

    2012-10-01

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

  9. Matching Cost Filtering for Dense Stereo Correspondence

    Directory of Open Access Journals (Sweden)

    Yimin Lin

    2013-01-01

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

  10. Assessing Correlation of Residency Applicants' Interview Dates With Likelihood of Matching.

    Science.gov (United States)

    Avasarala, Sameer; Thompson, Elizabeth; Whitehouse, Sarah; Drake, Sean

    2018-02-01

    This study aimed to determine whether the timing of an interview relative to the recruitment season was associated with being ranked or matched at an academic medical center. Eleven specialties (anesthesiology, diagnostic radiology, emergency medicine, family medicine, general surgery, internal medicine, neurology, neurosurgery, obstetrics-gynecology, orthopedic surgery, and psychiatry) that participated in the National Resident Matching Program were included in the study. Each program's total number of interview days during the October 2014-January 2015 interview season were divided equally into three interview time periods. The Cochran-Armitage trend test was used to evaluate associations among the three interview time periods (early, middle, and late) and interviewee outcomes (ranked or matched at our institution) for all subjects combined for each of the 11 programs and for specialty groups (medical, surgical, and hospital). Of 1034 applicants included in the analyses, 60% were men. Most were graduated from US medical schools (59.8%; a total of 103 applicants obtained first-year training positions through the Match [95.4% combined fill rate]). Twenty-nine interviewed early, 38 in the middle, and 36 in the late period ( P = 0.3877). A total of 864 applicants were ranked by 1 of the 11 residency programs at the study site: 267 in the early period, 319 in the middle, and 278 in the late period ( P = 0.4184). Being ranked in association with specialty classification also showed no significant differences. Interview timing had no relation to the likelihood of a match or being ranked by 1 of the 11 programs studied at our institution. These findings help dispel misconceptions about the importance of the interview date for a successful match.

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

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

  13. Measurement issues associated with using survey data matched with administrative data from the Social Security Administration.

    Science.gov (United States)

    Davies, Paul S; Fisher, T Lynn

    2009-01-01

    Researchers using survey data matched with administrative data benefit from the rich demographic and economic detail available from survey data combined with detailed programmatic data from administrative records. The research benefits of using these matched data are too numerous to mention. But there are drawbacks as well, and those drawbacks have received less systematic attention from researchers. We focus on survey data matched with administrative data from the Social Security Administration and address the strengths and weaknesses of each in four specific areas: (1) program participation and benefits, (2) disability and health information, (3) earnings, and (4) deferred compensation. We discuss the implications of these strengths and weaknesses for decisions that researchers must make regarding the appropriate data source and definition for the concepts in question. From this discussion, some general conclusions are drawn about measurement issues associated with using matched survey and administrative data for research, policy evaluation, and statistics.

  14. Use of the contingency matrix in the TRACK-MATCH procedure for two projections

    International Nuclear Information System (INIS)

    Baginyan, S.A.; Moroz, V.I.

    1985-01-01

    When analysing the work of geometrical reconstruction programs it is noted that if the TRACK-MATCH procedure is successful, it garantes the event measurement correctness. This serves as a base for application of the TRACK-MATCH procedure as a test for event mask measurements. Such use of the procedure does not require point-to-point correspondence between track images in different projections. It is sufficient to establish that the TRACK-MATCH procedure admits a solusion. It is shown that the problem of point-to-point correspondence between track images in different projections is reduced to conting matrix analysis. It is stated that if the determinant of the contingency matrix is not equal to zero it is sufficient for the TRACK-MATCH procedure to be solved

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

  16. Mentoring during Medical School and Match Outcome among Emergency Medicine Residents.

    Science.gov (United States)

    Dehon, Erin; Cruse, Margaret H; Dawson, Brandon; Jackson-Williams, Loretta

    2015-11-01

    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]). 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. 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, pmentors, 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, pmentor during medical school does not impact match outcome, but having an effective mentor is associated with a more favorable match outcome among medical students

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

    OpenAIRE

    Qazanfari, Kazem; Safabakhsh, Reza

    2017-01-01

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

  18. Local Search Approaches in Stable Matching Problems

    Directory of Open Access Journals (Sweden)

    Toby Walsh

    2013-10-01

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

  19. History Matching in Parallel Computational Environments

    Energy Technology Data Exchange (ETDEWEB)

    Steven Bryant; Sanjay Srinivasan; Alvaro Barrera; Sharad Yadav

    2005-10-01

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

  20. MEMORY EFFICIENT SEMI-GLOBAL MATCHING

    Directory of Open Access Journals (Sweden)

    H. Hirschmüller

    2012-07-01

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

  1. Fast image matching algorithm based on projection characteristics

    Science.gov (United States)

    Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun

    2011-06-01

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

  2. Real-time eSports Match Result Prediction

    OpenAIRE

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

    2016-01-01

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

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

    Science.gov (United States)

    2013-08-07

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

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

    Science.gov (United States)

    2013-07-15

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

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

    Science.gov (United States)

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

    2014-11-01

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

  6. The test of time in school-based mentoring: the role of relationship duration and re-matching on academic outcomes.

    Science.gov (United States)

    Grossman, Jean B; Chan, Christian S; Schwartz, Sarah E O; Rhodes, Jean E

    2012-03-01

    The influence of match length and re-matching on the effectiveness of school-based mentoring was studied in the context of a national, randomized study of 1,139 youth in Big Brothers Big Sisters programs. The sample included youth in grades four through nine from diverse racial and ethnic backgrounds. At the end of the year, youth in intact relationships showed significant academic improvement, while youth in matches that terminated prematurely showed no impact. Those who were re-matched after terminations showed negative impacts. Youth, mentor, and program characteristics associated with having an intact match were examined. Youth with high levels of baseline stress and those matched with college student mentors were likely to be in matches that terminated prematurely, while rejection-sensitive youth and mentors who had previous mentoring experience were more likely to be in intact relationships. Implications for research and practice are discussed.

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

    Science.gov (United States)

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

    2015-01-01

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

  8. Matching and Abstraction in Knowledge Systems,

    Science.gov (United States)

    1980-01-01

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

  9. PIV uncertainty quantification by image matching

    International Nuclear Information System (INIS)

    Sciacchitano, Andrea; Scarano, Fulvio; Wieneke, Bernhard

    2013-01-01

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

  10. On Resolution Complexity of Matching Principles

    DEFF Research Database (Denmark)

    Dantchev, Stefan S.

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

  11. Image Segmentation, Registration, Compression, and Matching

    Science.gov (United States)

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

    2011-01-01

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

  12. Automatic target detection using binary template matching

    Science.gov (United States)

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

    2005-03-01

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

  13. Rewrite Systems, Pattern Matching, and Code Generation

    Science.gov (United States)

    1988-06-09

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

  14. Impedance matched thin metamaterials make metals absorbing.

    Science.gov (United States)

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

    2013-11-13

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

  15. Edge-Matching Problems with Rotations

    DEFF Research Database (Denmark)

    Ebbesen, Martin; Fischer, Paul; Witt, Carsten

    2011-01-01

    Edge-matching problems, also called puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity II...... puzzle, and new complexity results. In this paper we consider a number of settings which differ in size of the puzzles and the manipulations allowed on the pieces. We investigate the effect of allowing rotations of the pieces on the complexity of the problem, an aspect that is only marginally treated so...

  16. Coincidental match of numerical simulation and physics

    Science.gov (United States)

    Pierre, B.; Gudmundsson, J. S.

    2010-08-01

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

  17. Applicant Interview Experiences and Postinterview Communication of the 2016 Radiation Oncology Match Cycle

    Energy Technology Data Exchange (ETDEWEB)

    Berriochoa, Camille; Ward, Matthew C.; Weller, Michael A. [Department of Radiation Oncology, Taussig Cancer Institute, Cleveland Clinic, Cleveland, Ohio (United States); Holliday, Emma [Department of Radiation Oncology, M. D. Anderson Cancer Center, Houston, Texas (United States); Kusano, Aaron [Department of Radiation Oncology, Anchorage and Valley Radiation Therapy Center, Anchorage, Alaska (United States); Thomas, Charles R. [Department of Radiation Oncology, Oregon Health & Science University, Portland, Oregon (United States); Tendulkar, Rahul D., E-mail: tendulr@ccf.org [Department of Radiation Oncology, Taussig Cancer Institute, Cleveland Clinic, Cleveland, Ohio (United States)

    2016-11-01

    Purpose: To characterize applicant interview experiences at radiation oncology residency programs during the 2016 match cycle and to assess applicant opinions regarding postinterview communication (PIC) after recent attention to gamesmanship noted in prior match cycles. Methods and Materials: An anonymous, institutional review board–approved, 29-question survey was deployed following the rank order list deadline to all 2016 radiation oncology residency applicants applying to a single institution. Results: Complete surveys were returned by 118 of 210 applicants, for a 56% response rate. Regarding possible match violation questions, 84% of respondents were asked at least once about where else they were interviewing (occurred at a median of 20% of program interviews); 51% were asked about marital status (6% of interviews); and 22% were asked about plans to have children (1% of interviews). Eighty-three percent of applicants wrote thank-you notes, with 55% reporting fear of being viewed unfavorably if such notes were not communicated. Sixty percent of applicants informed a program that they had ranked a program highly; 53% felt this PIC strategy would improve their standing on the rank order list, yet 46% reported feeling distressed by this obligation. A majority of applicants stated that they would feel relieved if programs explicitly discouraged PIC (89%) and that it would be preferable if programs prohibited applicants from notifying the program of their rank position (66%). Conclusions: Potential match violations occur at a high rate but are experienced at a minority of interviews. Postinterview communication occurs frequently, with applicants reporting resultant distress. Respondents stated that active discouragement of both thank-you notes/e-mails and applicants' notification to programs of their ranking would be preferred.

  18. Applicant Interview Experiences and Postinterview Communication of the 2016 Radiation Oncology Match Cycle

    International Nuclear Information System (INIS)

    Berriochoa, Camille; Ward, Matthew C.; Weller, Michael A.; Holliday, Emma; Kusano, Aaron; Thomas, Charles R.; Tendulkar, Rahul D.

    2016-01-01

    Purpose: To characterize applicant interview experiences at radiation oncology residency programs during the 2016 match cycle and to assess applicant opinions regarding postinterview communication (PIC) after recent attention to gamesmanship noted in prior match cycles. Methods and Materials: An anonymous, institutional review board–approved, 29-question survey was deployed following the rank order list deadline to all 2016 radiation oncology residency applicants applying to a single institution. Results: Complete surveys were returned by 118 of 210 applicants, for a 56% response rate. Regarding possible match violation questions, 84% of respondents were asked at least once about where else they were interviewing (occurred at a median of 20% of program interviews); 51% were asked about marital status (6% of interviews); and 22% were asked about plans to have children (1% of interviews). Eighty-three percent of applicants wrote thank-you notes, with 55% reporting fear of being viewed unfavorably if such notes were not communicated. Sixty percent of applicants informed a program that they had ranked a program highly; 53% felt this PIC strategy would improve their standing on the rank order list, yet 46% reported feeling distressed by this obligation. A majority of applicants stated that they would feel relieved if programs explicitly discouraged PIC (89%) and that it would be preferable if programs prohibited applicants from notifying the program of their rank position (66%). Conclusions: Potential match violations occur at a high rate but are experienced at a minority of interviews. Postinterview communication occurs frequently, with applicants reporting resultant distress. Respondents stated that active discouragement of both thank-you notes/e-mails and applicants' notification to programs of their ranking would be preferred.

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

    Directory of Open Access Journals (Sweden)

    DING Hao

    2015-03-01

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

  20. HOPI: on-line injection optimization program

    International Nuclear Information System (INIS)

    LeMaire, J.L.

    1977-01-01

    A method of matching the beam from the 200 MeV linac to the AGS without the necessity of making emittance measurements is presented. An on-line computer program written on the PDP10 computer performs the matching by modifying independently the horizontal and vertical emittance. Experimental results show success with this method, which can be applied to any matching section

  1. Robust Matching Pursuit Extreme Learning Machines

    Directory of Open Access Journals (Sweden)

    Zejian Yuan

    2018-01-01

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

  2. Calculating scattering matrices by wave function matching

    International Nuclear Information System (INIS)

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

    2008-01-01

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

  3. The Southampton Cauchy-characteristic matching project

    International Nuclear Information System (INIS)

    D'Inverno, R.

    2001-01-01

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

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

    Science.gov (United States)

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

    2018-04-01

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

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

    Science.gov (United States)

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

    2018-04-06

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

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

    Directory of Open Access Journals (Sweden)

    J.C. Brezet

    2009-08-01

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

  7. Broadband electrical impedance matching for piezoelectric ultrasound transducers.

    Science.gov (United States)

    Huang, Haiying; Paramo, Daniel

    2011-12-01

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

  8. Theory of fractional order elements based impedance matching networks

    KAUST Repository

    Radwan, Ahmed G.

    2011-03-01

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

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

    KAUST Repository

    Gu, Binbin

    2017-05-18

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

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

    KAUST Repository

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

    2017-01-01

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

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

    DEFF Research Database (Denmark)

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

    2012-01-01

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

  12. Anesthesia and Poliomyelitis: A Matched Cohort Study.

    Science.gov (United States)

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

    2016-06-01

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

  13. Matching Value Propositions with Varied Customer Needs

    DEFF Research Database (Denmark)

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

    2018-01-01

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

  14. Time Series Analysis Using Geometric Template Matching.

    Science.gov (United States)

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

    2013-03-01

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

  15. Composite shade guides and color matching.

    Science.gov (United States)

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

    2014-01-01

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

  16. Sequence Matching Analysis for Curriculum Development

    Directory of Open Access Journals (Sweden)

    Liem Yenny Bendatu

    2015-06-01

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

  17. PHYSIOLOGICAL RESPONSES OF ELITE JUNIOR AUSTRALIAN RULES FOOTBALLERS DURING MATCH-PLAY

    Directory of Open Access Journals (Sweden)

    James P. Veale

    2009-09-01

    Full Text Available Australian Football (AF is Australia's major football code. Despite research in other football codes, to date, no data has been published on the physiological responses of AF players during match play. Fifteen athletes (17.28 ± 0.76 yrs participated in four pre-season matches, sanctioned by Australian Football League (AFL Victoria, investigating Heart Rate (HR, Blood Lactate (BLa, Core Temperature (Tcore, and Hydration status. Match HR was measured continuously using HR monitors. BLa was measured via finger prick lancet at the end of each quarter of play. Tcore was measured by use of ingestible temperature sensor and measured wirelessly at the end of each quarter of play. Hydration status was measured using refractometry, measuring urine specific gravity, and body weight pre and post-match. Environmental conditions were measured continuously during matches. Results of HR responses showed a high exertion of players in the 85-95% maximum HR range. Elevated mean BLa levels, compared to rest, were observed in all players over the duration of the matches (p = 0.007. Mean Tcore rose 0.68 °C between start and end of matches. Mean USG increased between 0.008 g/ml (p = 0.001 with mean body weight decreasing 1.88 kg (p = 0.001. This study illustrates physiological responses in junior AF players playing in the heat as well as providing physiological data for consideration by AF coaching staff when developing specific training programs. Continued research should consider physiological measurements under varying environments, and at all playing levels of AF, to ascertain full physiological responses during AF matches.

  18. MATCHING ALTERNATIVE ADDRESSES: A SEMANTIC WEB APPROACH

    Directory of Open Access Journals (Sweden)

    S. Ariannamazi

    2015-12-01

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

  19. Personalized trajectory matching in spatial networks

    KAUST Repository

    Shang, Shuo

    2013-07-31

    With the increasing availability of moving-object tracking data, trajectory search and matching is increasingly important. We propose and investigate a novel problem called personalized trajectory matching (PTM). In contrast to conventional trajectory similarity search by spatial distance only, PTM takes into account the significance of each sample point in a query trajectory. A PTM query takes a trajectory with user-specified weights for each sample point in the trajectory as its argument. It returns the trajectory in an argument data set with the highest similarity to the query trajectory. We believe that this type of query may bring significant benefits to users in many popular applications such as route planning, carpooling, friend recommendation, traffic analysis, urban computing, and location-based services in general. PTM query processing faces two challenges: how to prune the search space during the query processing and how to schedule multiple so-called expansion centers effectively. To address these challenges, a novel two-phase search algorithm is proposed that carefully selects a set of expansion centers from the query trajectory and exploits upper and lower bounds to prune the search space in the spatial and temporal domains. An efficiency study reveals that the algorithm explores the minimum search space in both domains. Second, a heuristic search strategy based on priority ranking is developed to schedule the multiple expansion centers, which can further prune the search space and enhance the query efficiency. The performance of the PTM query is studied in extensive experiments based on real and synthetic trajectory data sets. © 2013 Springer-Verlag Berlin Heidelberg.

  20. Robust point matching via vector field consensus.

    Science.gov (United States)

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

    2014-04-01

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

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

    Science.gov (United States)

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

    2015-01-01

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

  2. Alternative confidence measure for local matching stereo algorithms

    CSIR Research Space (South Africa)

    Ndhlovu, T

    2009-11-01

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

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

    KAUST Repository

    Gu, Binbin

    2016-09-20

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

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

    Science.gov (United States)

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

    2017-08-01

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

  5. Keylogger Application to Monitoring Users Activity with Exact String Matching Algorithm

    Science.gov (United States)

    Rahim, Robbi; Nurdiyanto, Heri; Saleh A, Ansari; Abdullah, Dahlan; Hartama, Dedy; Napitupulu, Darmawan

    2018-01-01

    The development of technology is very fast, especially in the field of Internet technology that at any time experiencing significant changes, The development also supported by the ability of human resources, Keylogger is a tool that most developed because this application is very rarely recognized a malicious program by antivirus, keylogger will record all activities related to keystrokes, the recording process is accomplished by using string matching method. The application of string matching method in the process of recording the keyboard is to help the admin in knowing what the user accessed on the computer.

  6. Matching the Nagy-Soper parton shower at next-to-leading order

    Energy Technology Data Exchange (ETDEWEB)

    Kraus, Manfred [Institute for Theoretical Particle Physics and Cosmology, RWTH Aachen University (Germany)

    2015-07-01

    We give a short review of the shower concept, first introduced by Nagy and Soper, that includes full quantum correlations in the shower evolution. We also state the current status of implementation of the publicly available shower program Deductor. However, the main focus of the talk is the matching of the shower at next-to-leading order within the MC rate at NLO formalism. Matching is necessary in order to increase the accuracy of theoretical predictions and to employ a hadronization model. We show first results using Deductor in conjunction with the Helac-NLO framework for top quark pair production in association with one hard jet.

  7. Impedance matching through a single passive fractional element

    KAUST Repository

    Radwan, Ahmed Gomaa

    2012-07-01

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

  8. Electron ring design for HERA, including spin-matching

    International Nuclear Information System (INIS)

    Skuja, A.; Hand, L.; Steffen, K.; Barber, D.

    1984-01-01

    A. Skuja has been working in collaboration with Professor Lou Hand in obtaining an optics for the electron ring at HERA that satisfies the usual constraints of an electron storage ring, but in addition allows longitudinal polarization in the interaction region without depolarizing the electron beam completely. This collaboration effort grew out of their work on a possible electron ring at Fermilab. When this project was degraded in priority at Fermilab, they turned their attention to the HERA project at DESY. The HERA project will have an electron ring of about 30 GeV e - (or e + ) incident on 800 GeV protons. Recently it has been decided that the collisions should be head on (0 0 crossing), although all previous designs had a crossing angle of the 2 beams of 20 mrad. Professors Hand and Skuja implemented a complete program in the last year and a half that could fit the usual Turis parameters as well as the so called 12 spin-matching conditions of Chao and Yukoya for all possible machine elements including solenoids. The program has the possibility of fully coupling vertical and horizontal motion using the usual eigenvalue method

  9. The tangential breast match plane: Practical problems and solutions

    International Nuclear Information System (INIS)

    Norris, M.

    1989-01-01

    The three-field breast set-up, in which tangential oblique opposed fields are joined to an anterior supraclavicular field, has been the method of choice for treatment of breast cancer for many years. In the last several years many authors have suggested refinements to the technique that improve the accuracy with which fields join at a match plane. The three-field breast set-up, using a rotatable half-beam block is the technique used at our institution. In instituting this procedure, several practical problems were encountered. Due to the small collimator rotation angles used it is possible to clinically reverse the collimator angle without observing an error noticeable on fluoroscopy. A second error can occur when the table base angle is used to compensate for the incorrect collimator rotation. These potential sources of error can be avoided if a programmable calculator or computer program is used to assist the dosimetrist during the simulation. Utilization of fluoroscopy, digital table position displays and a caliper provide accurate input for the computer program. This paper will present a hybrid procedure that combines practical set-up procedures with the mathematical calculation of ideal angles to result in an accurate and practical approach to breast simulation

  10. A blind matching algorithm for cognitive radio networks

    KAUST Repository

    Hamza, Doha R.; Shamma, Jeff S.

    2016-01-01

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

  11. Exploiting Best-Match Equations for Efficient Reinforcement Learning

    NARCIS (Netherlands)

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

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

  12. Matching profiles of masked perpetrators: a pilot study

    DEFF Research Database (Denmark)

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

    2010-01-01

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

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

    CSIR Research Space (South Africa)

    Shabalala, MB

    2015-03-01

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

  14. Multisensory Information Boosts Numerical Matching Abilities in Young Children

    Science.gov (United States)

    Jordan, Kerry E.; Baker, Joseph

    2011-01-01

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

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

    African Journals Online (AJOL)

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

  16. Characterizing graphs of maximum matching width at most 2

    DEFF Research Database (Denmark)

    Jeong, Jisu; Ok, Seongmin; Suh, Geewon

    2017-01-01

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

  17. An Inductive Characterization of Matching in Binding Bigraphs

    DEFF Research Database (Denmark)

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

    2010-01-01

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

  18. PowerMatching City : A unique smart grid project

    NARCIS (Netherlands)

    dr. C.J. Wiekens

    2014-01-01

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

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

    OpenAIRE

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

    2012-01-01

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

  20. Probabilistic commodity-flow-based focusing of monitoring activities to facilitate early detection of Phytophthora ramorum outbreaks

    Science.gov (United States)

    Steven C. McKelvey; William D. Smith; Frank Koch

    2012-01-01

    This project summary describes a probabilistic model developed with funding support from the Forest Health Monitoring Program of the Forest Service, U.S. Department of Agriculture (BaseEM Project SO-R-08-01). The model has been implemented in SODBuster, a standalone software package developed using the Java software development kit from Sun Microsystems.