Sample records for computer matching programs

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-12-05

    .... Description of the Matching Program A. General The Computer Matching and Privacy Protection Act of 1988 (Pub... 1974: CMS Computer Matching Program Match No. 2013-01; HHS Computer Matching Program Match No. 1312...). ACTION: Notice of Computer Matching Program (CMP). SUMMARY: In accordance with the requirements of the...

  2. 41 CFR 105-64.110 - When may GSA establish computer matching programs?

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... computer matching programs? 105-64.110 Section 105-64.110 Public Contracts and Property Management Federal... GSA establish computer matching programs? (a) System managers will establish computer matching... direction of the GSA Data Integrity Board that will be established when and if computer matching programs...

  3. 41 CFR 105-64.110 - When may GSA establish computer matching programs?

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... computer matching programs? 105-64.110 Section 105-64.110 Public Contracts and Property Management Federal... GSA establish computer matching programs? (a) System managers will establish computer matching... direction of the GSA Data Integrity Board that will be established when and if computer matching programs...

  4. 41 CFR 105-64.110 - When may GSA establish computer matching programs?

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... computer matching programs? 105-64.110 Section 105-64.110 Public Contracts and Property Management Federal... GSA establish computer matching programs? (a) System managers will establish computer matching... direction of the GSA Data Integrity Board that will be established when and if computer matching programs...

  5. 41 CFR 105-64.110 - When may GSA establish computer matching programs?

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... computer matching programs? 105-64.110 Section 105-64.110 Public Contracts and Property Management Federal... GSA establish computer matching programs? (a) System managers will establish computer matching... direction of the GSA Data Integrity Board that will be established when and if computer matching programs...

  6. 41 CFR 105-64.110 - When may GSA establish computer matching programs?

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... computer matching programs? 105-64.110 Section 105-64.110 Public Contracts and Property Management Federal... GSA establish computer matching programs? (a) System managers will establish computer matching... direction of the GSA Data Integrity Board that will be established when and if computer matching programs...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-08-12

    ... DEPARTMENT OF EDUCATION Privacy Act of 1974; Computer Matching Program AGENCY: Office of the Inspector General, U.S. Department of Education. ACTION: Notice of computer matching between the U.S... conduct of computer matching programs, notice is hereby given of the establishment of a computer matching...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-05-21

    ... RAILROAD RETIREMENT BOARD Computer Matching and Privacy Protection Act of 1988; Report of Matching...: Notice of a renewal of an existing computer matching program due to expire on May 24, 2013. SUMMARY: As... of its intent to renew an ongoing computer matching program. In this match, we provide certain...

  9. 32 CFR 701.125 - Computer matching program.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 32 National Defense 5 2012-07-01 2012-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. The DPO has responsibility for coordinating the approval of DOD's participation in Computer Matching...

  10. 32 CFR 701.125 - Computer matching program.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 32 National Defense 5 2014-07-01 2014-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. The DPO has responsibility for coordinating the approval of DOD's participation in Computer Matching...

  11. 32 CFR 701.125 - Computer matching program.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 32 National Defense 5 2013-07-01 2013-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. The DPO has responsibility for coordinating the approval of DOD's participation in Computer Matching...

  12. 32 CFR 701.125 - Computer matching program.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 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. The DPO has responsibility for coordinating the approval of DOD's participation in Computer Matching...

  13. 32 CFR 701.125 - Computer matching program.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 32 National Defense 5 2011-07-01 2011-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. The DPO has responsibility for coordinating the approval of DOD's participation in Computer Matching...

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

    Code of Federal Regulations, 2013 CFR

    2013-07-01

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

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

    Code of Federal Regulations, 2014 CFR

    2014-07-01

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

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

    Code of Federal Regulations, 2012 CFR

    2012-07-01

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

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

    Code of Federal Regulations, 2010 CFR

    2010-07-01

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

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

    Code of Federal Regulations, 2011 CFR

    2011-07-01

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-03-06

    ...: Computer Matching Program AGENCY: Treasury Inspector General for Tax Administration, Treasury. ACTION... Internal Revenue Service (IRS) concerning the conduct of TIGTA's computer matching program. DATES... INFORMATION: TIGTA's computer matching program assists in the detection and deterrence of fraud, waste, and...

  20. 78 FR 50146 - Privacy Act of 1974: Computer Matching Program

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-08-16

    ... DEPARTMENT OF VETERANS AFFAIRS Privacy Act of 1974: Computer Matching Program AGENCY: Department of Veterans Affairs. ACTION: Notice of Computer Match Program. SUMMARY: Pursuant to 5 U.S.C. 552a... to conduct a computer matching program with the Internal Revenue Service (IRS). Data from the...

  1. 76 FR 47299 - Privacy Act of 1974: Computer Matching Program

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-08-04

    ... DEPARTMENT OF VETERANS AFFAIRS Privacy Act of 1974: Computer Matching Program AGENCY: Department of Veterans Affairs. ACTION: Notice of Computer Match Program. SUMMARY: Pursuant to 5 U.S.C. 552a... to conduct a computer matching program with the Internal Revenue Service (IRS). Data from the...

  2. 78 FR 29748 - Privacy Act of 1974; Computer Matching Program Between the Department of Education and the...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-05-21

    ... DEPARTMENT OF EDUCATION Privacy Act of 1974; Computer Matching Program Between the Department of... document provides notice of the continuation of a computer matching program between the Department of... 5301, the Department of Justice and the Department of Education implemented a computer matching program...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    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... RAILROAD RETIREMENT BOARD Privacy Act of 1974, as amended; Notice of Computer Matching Program...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    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... RAILROAD RETIREMENT BOARD Privacy Act of 1974, as Amended; Notice of Computer Matching Program...

  5. 75 FR 8311 - Privacy Act of 1974; Notice of a Computer Matching Program

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-02-24

    ...; Notice of a Computer Matching Program AGENCY: Defense Manpower Data Center, DoD. ACTION: Notice of a... hereby giving notice to the record subjects of a computer matching program between the Department of... conduct a computer matching program between the agencies. The purpose of this agreement is to verify an...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-03-12

    ... 1974; Computer Matching Program AGENCY: U.S. Citizenship and Immigration Services, Department of... Matching Program between the Department of Homeland Security, U.S. Citizenship and Immigration Services and... computer matching program between the Department of Homeland Security, U.S. Citizenship and Immigration...

  7. 77 FR 32085 - Privacy Act of 1974, as Amended; Renewal of Computer Matching Program Between the U.S. Department...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-05-31

    ... Matching and Privacy Protection Act of 1988 (Pub. L. 100-503) and the Computer Matching and Privacy... DEPARTMENT OF EDUCATION Privacy Act of 1974, as Amended; Renewal of Computer Matching Program.... ACTION: Notice. SUMMARY: This document provides notice of the renewal of the computer matching program...

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

    Code of Federal Regulations, 2012 CFR

    2012-07-01

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

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

    Code of Federal Regulations, 2014 CFR

    2014-07-01

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

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

    Code of Federal Regulations, 2013 CFR

    2013-07-01

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

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

    Code of Federal Regulations, 2010 CFR

    2010-07-01

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

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

    Code of Federal Regulations, 2011 CFR

    2011-07-01

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-01-28

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

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

    Code of Federal Regulations, 2013 CFR

    2013-07-01

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

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

    Code of Federal Regulations, 2014 CFR

    2014-07-01

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

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

    Code of Federal Regulations, 2012 CFR

    2012-07-01

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

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

    Code of Federal Regulations, 2010 CFR

    2010-07-01

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

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

    Code of Federal Regulations, 2011 CFR

    2011-07-01

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-05-20

    ... GENERAL SERVICES ADMINISTRATION Notice of a Computer Matching Program AGENCY: General Services... providing notice of a proposed computer match. The purpose of this match is to identify individuals who are... providing notice of a proposed computer match. The purpose of this match is to identify individuals who are...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

  1. 32 CFR 505.13 - Computer Matching Agreement Program.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... 32 National Defense 3 2013-07-01 2013-07-01 false Computer Matching Agreement Program. 505.13... AUTHORITIES AND PUBLIC RELATIONS ARMY PRIVACY ACT PROGRAM § 505.13 Computer Matching Agreement Program. (a) General provisions. (1) Pursuant to the Privacy Act and this part, DA records may be subject to computer...

  2. 32 CFR 505.13 - Computer Matching Agreement Program.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... 32 National Defense 3 2012-07-01 2009-07-01 true Computer Matching Agreement Program. 505.13... AUTHORITIES AND PUBLIC RELATIONS ARMY PRIVACY ACT PROGRAM § 505.13 Computer Matching Agreement Program. (a) General provisions. (1) Pursuant to the Privacy Act and this part, DA records may be subject to computer...

  3. 32 CFR 505.13 - Computer Matching Agreement Program.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... 32 National Defense 3 2014-07-01 2014-07-01 false Computer Matching Agreement Program. 505.13... AUTHORITIES AND PUBLIC RELATIONS ARMY PRIVACY ACT PROGRAM § 505.13 Computer Matching Agreement Program. (a) General provisions. (1) Pursuant to the Privacy Act and this part, DA records may be subject to computer...

  4. 32 CFR 505.13 - Computer Matching Agreement Program.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... 32 National Defense 3 2011-07-01 2009-07-01 true Computer Matching Agreement Program. 505.13... AUTHORITIES AND PUBLIC RELATIONS ARMY PRIVACY ACT PROGRAM § 505.13 Computer Matching Agreement Program. (a) General provisions. (1) Pursuant to the Privacy Act and this part, DA records may be subject to computer...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-05-31

    ... DEPARTMENT OF VETERANS AFFAIRS Privacy Act of 1974: Computer Matching Program AGENCY: Department of Veterans Affairs. ACTION: Notice. SUMMARY: The Department of Veterans Affairs (VA) provides notice that it intends to conduct a recurring computer-matching program matching Internal Revenue Service (IRS...

  6. 76 FR 12984 - Privacy Act of 1974; Notice of a Computer Matching Program Between HUD and the United States...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-03-09

    ... of a Computer Matching Program Between HUD and the United States Department of Veterans Affairs (VA) AGENCY: Office of the Chief Information Officer, HUD. ACTION: Notice of a computer matching program... the Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503), and the Office of...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-11-29

    ... DEPARTMENT OF EDUCATION Privacy Act of 1974; Computer Matching Program between the U.S. Department.... ACTION: Notice. SUMMARY: Notice is hereby given of the renewal of the computer matching program between... (VA) (source agency). After the ED and VA Data Integrity Boards approve a new computer matching...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-07-05

    ... RAILROAD RETIREMENT BOARD Computer Matching and Privacy Protection Act of 1988; Report of Matching.... General The Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503), amended the Privacy... of an existing computer matching program due to expire on August 12, 2012. SUMMARY: The Privacy Act...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-06-28

    ... DEPARTMENT OF EDUCATION Privacy Act of 1974; Computer Matching Program AGENCY: Department of Education. ACTION: Notice--Computer matching agreement between the Department of Education and the Department of Defense. SUMMARY: This document provides notice of the continuation of the computer matching...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-07-29

    ...; Computer Matching Program AGENCY: Defense Manpower Data Center (DMDC), DoD. ACTION: Notice of a Computer... individual's privacy, and would result in additional delay in determining eligibility and, if applicable, the... Defense. NOTICE OF A COMPUTER MATCHING PROGRAM AMONG THE DEFENSE MANPOWER DATA CENTER, THE DEPARTMENT OF...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-01-10

    ...; Computer Matching Program AGENCY: Defense Manpower Data Center (DMDC), DoD. ACTION: Notice of a Computer... administrative burden, constitute a greater intrusion of the individual's privacy, and would result in additional... Liaison Officer, Department of Defense. Notice of a Computer Matching Program Among the Defense Manpower...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-06-06

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2012-0015] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Centers for Medicare and Medicaid Services (CMS))--Match Number 1094 AGENCY: Social Security Administration (SSA). ACTION: Notice of a new computer matching program that will expire...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-06-01

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2011-0089] Privacy Act of 1974, as Amended; 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...

  15. 78 FR 37647 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Railroad Retirement Board (RRB...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-06-21

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2013-0010] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Railroad Retirement Board (RRB))--Match Number 1006 AGENCY: Social Security Administration. ACTION: Notice of a renewal of an existing computer matching program that will expire on...

  16. 75 FR 39575 - Privacy Act of 1974; Notice of a Computer Matching Program Between the Department of Housing and...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-07-09

    ... of a Computer Matching Program Between the Department of Housing and Urban Development (HUD) and the.... ACTION: Notice of a computer matching program between the HUD and the USDA. SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 552a), as amended by the Computer Matching and Privacy Protection...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-07-05

    ... of a Computer Matching Program Between the Department of Housing and Urban Development (HUD) and the...: Notice of a computer matching program between the HUD and ED. 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 1988 (Pub...

  18. 75 FR 67755 - Privacy Act of 1974; Notice of a Computer Matching Program Between the Department of Housing and...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-11-03

    ... of a Computer Matching Program Between the Department of Housing and Urban Development (HUD) and the.... ACTION: Notice of a computer matching program between the HUD and the SBA. SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 552a), as amended by the Computer Matching and Privacy Protection...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

  1. 32 CFR 505.13 - Computer Matching Agreement Program.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... 32 National Defense 3 2010-07-01 2010-07-01 true Computer Matching Agreement Program. 505.13 Section 505.13 National Defense Department of Defense (Continued) DEPARTMENT OF THE ARMY AID OF CIVIL AUTHORITIES AND PUBLIC RELATIONS ARMY PRIVACY ACT PROGRAM § 505.13 Computer Matching Agreement Program. (a...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

  4. 77 FR 74020 - Office of Child Support Enforcement; Privacy Act of 1974; Computer Matching Agreement

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-12-12

    ... 29, 2012, sent a report of a Computer Matching Program to the Committee on Homeland Security and... Support Enforcement; Privacy Act of 1974; Computer Matching Agreement AGENCY: Office of Child Support Enforcement (OCSE), ACF, HHS. ACTION: Notice of a Computer Matching Program. SUMMARY: In accordance with the...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-03-12

    ... DEPARTMENT OF HOMELAND SECURITY Office of the Secretary [Docket No. DHS-2013-0010] Privacy Act of 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...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-03-12

    ... DEPARTMENT OF HOMELAND SECURITY Office of the Secretary [Docket No. DHS-2013-0008] Privacy Act of 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...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    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 Immigration Services. ACTION: Notice. Overview Information: Privacy Act of 1974; Computer Matching Program...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-03-12

    ... DEPARTMENT OF HOMELAND SECURITY Office of the Secretary [Docket No. DHS-2013-0007] Privacy Act of 1974; Computer Matching Program AGENCY: Department of Homeland Security/U.S. Citizenship and Immigration Services. ACTION: Notice. Overview Information: Privacy Act of 1974; Computer Matching Program...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-04-25

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-06-02

    ... of the Matching Program A. General The Computer Matching and Privacy Protection Act of 1988 (Pub. L.... 100-503, the Computer Matching and Privacy Protection Act (CMPPA) of 1988), the Office of Management... 1974; CMS Computer Match No. 2010-03, HHS Computer Match No. 1003, SSA Computer Match No. 1048, IRS...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-08-15

    ...; Notice of a Computer Matching Program AGENCY: Defense Manpower Data Center, Department of Defense (DoD). ACTION: Notice of a Computer Matching Program. SUMMARY: Subsection (e)(12) of the Privacy Act of 1974, as amended, (5 U.S.C. 552a) requires agencies to publish advance notice of any proposed or revised computer...

  15. 76 FR 77811 - Privacy Act of 1974; Notice of a Computer Matching Program

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-12-14

    ...; Notice of a Computer Matching Program AGENCY: Defense Manpower Data Center, Department of Defense (DoD). ACTION: Notice of a Computer Matching Program. SUMMARY: Subsection (e)(12) of the Privacy Act of 1974, as amended, (5 U.S.C. 552a) requires agencies to publish advance notice of any proposed or revised computer...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-06-27

    ... DEPARTMENT OF HOMELAND SECURITY Office of the Secretary [Docket No. DHS-2013-0006] Privacy Act of 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...

  17. 77 FR 2299 - Office of Child Support Enforcement; Privacy Act of 1974; Computer Matching Agreement

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-01-17

    ... Support Enforcement; Privacy Act of 1974; Computer Matching Agreement AGENCY: Office of Child Support Enforcement (OCSE), ACF, HHS. ACTION: Notice of a Computer Matching Program. SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 522a), as amended, OCSE is publishing notice of a computer matching program...

  18. 77 FR 74019 - Office of Child Support Enforcement; Privacy Act of 1974; Computer Matching Agreement

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-12-12

    ... Support Enforcement; Privacy Act of 1974; Computer Matching Agreement AGENCY: Office of Child Support Enforcement (OCSE), ACF, HHS. ACTION: Notice of a Computer Matching Program. SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 522a), as amended, OCSE is publishing notice of a computer matching program...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-05-27

    ... Support Enforcement; Privacy Act of 1974; Computer Matching Agreement AGENCY: Office of Child Support Enforcement (OCSE), ACF, HHS. ACTION: Notice of a computer matching program. SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 522a), as amended, OCSE is publishing notice of a computer matching program...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-06-03

    ... Support Enforcement; Privacy Act of 1974; Computer Matching Agreement AGENCY: Office of Child Support Enforcement (OCSE), ACF, HHS. ACTION: Notice of a Computer Matching Program. SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 522a), as amended, OCSE is publishing notice of a computer matching program...

  1. 78 FR 25785 - Privacy Act of 1974; Report of Matching Program

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-05-02

    ... of Veterans Affairs. ACTION: Notice of Computer Matching Program. SUMMARY: The Department of Veterans Affairs (VA) provides notice that it intends to conduct a recurring computer-matching program matching Social Security Administration (SSA) Master Beneficiary Records (MBR) and Self-Employment Income System...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-11-21

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2013-0059] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Centers for Medicare & Medicaid Services (CMS))--Match Number 1076 AGENCY: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer matching...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-04-14

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2011-0022] Privacy Act of 1974, as Amended; Computer Matching Program (SSA/ Centers for Medicare & Medicaid Services (CMS))--Match Number 1076 AGENCY: Social Security Administration (SSA). ACTION: Notice of a renewal of an existing computer matching...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-01-08

    ... Social Security Administration (Computer Matching Agreement 1071). SUMMARY: In accordance with the... of its new computer matching program with the Social Security Administration (SSA). DATES: OPM will... conditions under which SSA will disclose Social Security benefit data to OPM via direct computer link. OPM...

  5. 77 FR 34941 - Privacy Act of 1974; Notice of a Computer Matching Program

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-06-12

    ...; Notice of a Computer Matching Program AGENCY: Defense Manpower Data Center, DoD. ACTION: Notice of a... computer matching program are the Department of Veterans Affairs (VA) and the Defense Manpower Data Center... identified as DMDC 01, entitled ``Defense Manpower Data Center Data Base,'' last published in the Federal...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-06-13

    ... the Defense Manpower Data Center, Department of Defense AGENCY: Postal Service TM . ACTION: Notice of Computer Matching Program--United States Postal Service and the Defense Manpower Data Center, Department of... as the recipient agency in a computer matching program with the Defense Manpower Data Center (DMDC...

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

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 22 Foreign Relations 2 2012-04-01 2009-04-01 true Reports on new systems of records; computer matching programs. 1101.4 Section 1101.4 Foreign Relations INTERNATIONAL BOUNDARY AND WATER COMMISSION... records; computer matching programs. (a) Before establishing any new systems of records, or making any...

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

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 22 Foreign Relations 2 2014-04-01 2014-04-01 false Reports on new systems of records; computer matching programs. 1101.4 Section 1101.4 Foreign Relations INTERNATIONAL BOUNDARY AND WATER COMMISSION... records; computer matching programs. (a) Before establishing any new systems of records, or making any...

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

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 22 Foreign Relations 2 2013-04-01 2009-04-01 true Reports on new systems of records; computer matching programs. 1101.4 Section 1101.4 Foreign Relations INTERNATIONAL BOUNDARY AND WATER COMMISSION... records; computer matching programs. (a) Before establishing any new systems of records, or making any...

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

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 22 Foreign Relations 2 2011-04-01 2009-04-01 true Reports on new systems of records; computer matching programs. 1101.4 Section 1101.4 Foreign Relations INTERNATIONAL BOUNDARY AND WATER COMMISSION... records; computer matching programs. (a) Before establishing any new systems of records, or making any...

  11. 78 FR 47830 - Privacy Act of 1974; Report of Matching Program

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-08-06

    ... of Veterans Affairs. ACTION: Notice of Computer Matching Program. SUMMARY: The Department of Veterans Affairs (VA) provides notice that it intends to conduct a recurring computer matching program matching... necessary information from RRB-26: Payment, Rate, and Entitlement History File, published at 75 FR 43729...

  12. 78 FR 40541 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA)-Match Number 1014

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-07-05

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2013-0019] Privacy Act of 1974, as Amended; Computer Matching Program (SSA)--Match Number 1014 AGENCY: Social Security Administration (SSA). [[Page 40542

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

  18. 7 CFR 272.12 - Computer matching requirements.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 4 2014-01-01 2014-01-01 false Computer matching requirements. 272.12 Section 272.12... Computer matching requirements. (a) General purpose. The Computer Matching and Privacy Protection Act (CMA) of 1988, as amended, addresses the use of information from computer matching programs that involve a...

  19. 7 CFR 272.12 - Computer matching requirements.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 4 2013-01-01 2013-01-01 false Computer matching requirements. 272.12 Section 272.12... Computer matching requirements. (a) General purpose. The Computer Matching and Privacy Protection Act (CMA) of 1988, as amended, addresses the use of information from computer matching programs that involve a...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-12-14

    ... OFFICE OF PERSONNEL MANAGEMENT Privacy Act of 1974; Computer Matching Program AGENCY: Office of Personnel Management. ACTION: Notice--computer matching between the Office of Personnel Management and the Social Security Administration. SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 552a), as...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-06-13

    ... OFFICE OF PERSONNEL MANAGEMENT Privacy Act of 1974; Computer Matching Program AGENCY: Office of Personnel Management. ACTION: Notice of computer matching between the Office of Personnel Management and the Social Security Administration (CMA 1045). SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-04-07

    ... OFFICE OF PERSONNEL MANAGEMENT Privacy Act of 1974; Computer Matching Program AGENCY: Office of Personnel Management. ACTION: Notice--computer matching between the Office of Personnel Management and the Social Security Administration. SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 552a), as...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-06-04

    ... OFFICE OF PERSONNEL MANAGEMENT Privacy Act of 1974; Computer Matching Program AGENCY: Office of Personnel Management. AGENCY: Notice--computer matching between the Office of Personnel Management and the Social Security Administration. SUMMARY: In accordance with the Privacy Act of 1974 (5 U.S.C. 552a), as...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-10-15

    ... RAILROAD RETIREMENT BOARD Computer Matching and Privacy Protection Act of 1988; Report of Matching... Railroad Retirement Act. SUMMARY: As required by the Computer Matching and Privacy Protection Act of [[Page...: Under certain circumstances, the Computer Matching and Privacy Protection Act of 1988, Public Law 100...

  5. A computer program for automated flutter solution and matched point determination

    NASA Technical Reports Server (NTRS)

    Bhatia, K. G.

    1973-01-01

    The use of a digital computer program (MATCH) for automated determination of the flutter velocity and the matched-point flutter density is described. The program is based on the use of the modified Laguerre iteration formula to converge to a flutter crossing or a matched-point density. A general description of the computer program is included and the purpose of all subroutines used is stated. The input required by the program and various input options are detailed, and the output description is presented. The program can solve flutter equations formulated with up to 12 vibration modes and obtain flutter solutions for up to 10 air densities. The program usage is illustrated by a sample run, and the FORTRAN program listing is included.

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

    Treesearch

    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. 77 FR 38880 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA/Railroad Retirement Board (SSA...

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-01-16

    ... 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 Of Personnel Management and Social Security Administration AGENCY: Office of Personnel Management...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-09-14

    ...; Notice of a Computer Matching Program AGENCY: Defense Manpower Data Center, Department of Defense (DoD... (SSA) and DoD Defense Manpower Data Center (DMDC) that their records are being matched by computer. The... intrusion of the individual's privacy and would result in additional delay in the eventual SSI payment and...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-03-17

    ... (CMS); and Department of Defense (DoD), Manpower Data Center (DMDC), Defense Enrollment and Eligibility... the results of the computer match and provide the information to TMA for use in its matching program... under TRICARE. DEERS will receive the results of the computer match and provide the information provided...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    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 Number 1308 AGENCY: Social Security Administration (SSA). ACTION: Notice of renewal of an existing...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-12-18

    ... SOCIAL SECURITY ADMINISTRATION [Docket No. SSA 2012-0055] Privacy Act of 1974, as Amended; Computer Matching Program (Social Security Administration (SSA)/Office of Personnel Management (OPM))--Match Number 1307 AGENCY: Social Security Administration. ACTION: Notice of a renewal of an existing...

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

    ERIC Educational Resources Information Center

    Bachmann, B. J.; And Others

    1973-01-01

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-07-26

    ... 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 of Personnel Management and Social Security Administration AGENCY: Office of Personnel Management...

  19. HOPI: on-line injection optimization program

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    LeMaire, J L

    1977-10-26

    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.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-09-06

    ..., Education, and Vocational Rehabilitation and Employment Records-VA'' (58VA21/22/28), published at 74 FR.... Inclusive Dates of the Matching Program The effective date of this matching program is October 2, 2012...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-02-22

    ..., Education, and Vocational Rehabilitation and Employment Records-VA (58 VA 21/22/28),'' first published at 74.... Inclusive Dates of the Matching Program The matching program will become effective no sooner than 40 days...

  3. 75 FR 54162 - Privacy Act of 1974

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-09-03

    ... Program A. General The Computer Matching and Privacy Protection Act of 1988 (Pub. L. 100-503), amended the... DEPARTMENT OF HEALTH AND HUMAN SERVICES Centers for Medicare and Medicaid Services [CMS Computer Match No. 2010-01; HHS Computer Match No. 1006] Privacy Act of 1974 AGENCY: Department of Health and...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-03-31

    ... program for the purpose of income verifications and computer matching. DATES: Effective Date: The... additional verification to identify inappropriate (excess or insufficient) rental assistance, and perhaps... Act, the Native American Housing Assistance and Self-Determination Act of 1996, and the Quality...

  7. Computer program for the IBM personal computer which searches for approximate matches to short oligonucleotide sequences in long target DNA sequences.

    PubMed Central

    Myers, E W; Mount, D W

    1986-01-01

    We describe a program which may be used to find approximate matches to a short predefined DNA sequence in a larger target DNA sequence. The program predicts the usefulness of specific DNA probes and sequencing primers and finds nearly identical sequences that might represent the same regulatory signal. The program is written in the C programming language and will run on virtually any computer system with a C compiler, such as the IBM/PC and other computers running under the MS/DOS and UNIX operating systems. The program has been integrated into an existing software package for the IBM personal computer (see article by Mount and Conrad, this volume). Some examples of its use are given. PMID:3753785

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-04-13

    ... (OMB). The dates for the matching program will be effective as indicated in ``E. Inclusive Dates of the... Compensation, Pension, Education, and Vocational Rehabilitation and Employment Records--VA (58VA21/22/28... addresses, etc. E. Inclusive Dates of the Matching Program The effective date of the matching agreement and...

  9. DOE Matching Grant Program

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Dr Marvin Adams

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

  10. A Computer-Based Program to Teach Braille Reading to Sighted Individuals

    ERIC Educational Resources Information Center

    Scheithauer, Mindy C.; Tiger, Jeffrey H.

    2012-01-01

    Instructors of the visually impaired need efficient braille-training methods. This study conducted a preliminary evaluation of a computer-based program intended to teach the relation between braille characters and English letters using a matching-to-sample format with 4 sighted college students. Each participant mastered matching visual depictions…

  11. Computers Launch Faster, Better Job Matching

    ERIC Educational Resources Information Center

    Stevenson, Gloria

    1976-01-01

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

  12. 45 CFR 264.10 - Must States do computer matching of data records under IEVS to verify recipient information?

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ... 45 Public Welfare 2 2013-10-01 2012-10-01 true Must States do computer matching of data records... for Other Program Penalties? § 264.10 Must States do computer matching of data records under IEVS to... Internal Revenue Service (IRS), the State Wage Information Collections Agency (SWICA), the Social Security...

  13. 45 CFR 264.10 - Must States do computer matching of data records under IEVS to verify recipient information?

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ... 45 Public Welfare 2 2014-10-01 2012-10-01 true Must States do computer matching of data records... for Other Program Penalties? § 264.10 Must States do computer matching of data records under IEVS to... Internal Revenue Service (IRS), the State Wage Information Collections Agency (SWICA), the Social Security...

  14. 45 CFR 264.10 - Must States do computer matching of data records under IEVS to verify recipient information?

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ... 45 Public Welfare 2 2010-10-01 2010-10-01 false Must States do computer matching of data records... for Other Program Penalties? § 264.10 Must States do computer matching of data records under IEVS to... Internal Revenue Service (IRS), the State Wage Information Collections Agency (SWICA), the Social Security...

  15. 45 CFR 264.10 - Must States do computer matching of data records under IEVS to verify recipient information?

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 45 Public Welfare 2 2011-10-01 2011-10-01 false Must States do computer matching of data records... for Other Program Penalties? § 264.10 Must States do computer matching of data records under IEVS to... Internal Revenue Service (IRS), the State Wage Information Collections Agency (SWICA), the Social Security...

  16. 45 CFR 264.10 - Must States do computer matching of data records under IEVS to verify recipient information?

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 45 Public Welfare 2 2012-10-01 2012-10-01 false Must States do computer matching of data records... for Other Program Penalties? § 264.10 Must States do computer matching of data records under IEVS to... Internal Revenue Service (IRS), the State Wage Information Collections Agency (SWICA), the Social Security...

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

    ERIC Educational Resources Information Center

    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)

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-08-19

    ... (Pub. L. 111- 148), as amended by the Health Care and Education Reconciliation Act of 2010 (Pub. L. 111... Entitlements Program System of Records Notice, 77 FR 47415 (August 8, 2012). Inclusive Dates of the Match: The...

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

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 22 Foreign Relations 2 2010-04-01 2010-04-01 true Reports on new systems of records; computer matching programs. 1101.4 Section 1101.4 Foreign Relations INTERNATIONAL BOUNDARY AND WATER COMMISSION, UNITED STATES AND MEXICO, UNITED STATES SECTION PRIVACY ACT OF 1974 § 1101.4 Reports on new systems of...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-08-05

    ... provides an updated cost/benefit analysis providing an assessment of the benefits attained by HUD through... the scope of the existing computer matching program to now include the updated cost/ benefit analysis... change, and find a continued favorable examination of benefit/cost results; and (2) All parties certify...

  1. Carpool and buspool matching guide. Fourth edition

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Pratsch, L.

    1975-01-01

    The operation and management of numerous successful carpool, buspool, and vanpool programs throughout the U.S. are discussed. The matching of the time and location requirements of the riders with vehicle availability and routing is described. The guide for data collection procedures and computer programs for carpool matching is presented. (LCL)

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-08-13

    ... false positive match rate of 10 percent. Making the match mandatory for the States who did not perform... number of prisoners from 1995 to 2013 and assumed a 10 percent false positive match rate. Finally, we... matches are false positives. We estimate that mandatory matches at certification will identify an...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-12-09

    ... system for the match: Compensation, Pension, Education, and Vocational Rehabilitation and Employment... spent time on active duty while a member of the Reserve Forces. F. Inclusive Dates of the Matching...

  8. 41 CFR 105-56.024 - Purpose and scope.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... offset computer matching, identify Federal employees who owe delinquent non-tax debt to the United States. Centralized salary offset computer matching is the computerized comparison of delinquent debt records with...) administrative offset program, to collect delinquent debts owed to the Federal Government. This process is known...

  9. Epidemiologic programs for computers and calculators. A microcomputer program for multiple logistic regression by unconditional and conditional maximum likelihood methods.

    PubMed

    Campos-Filho, N; Franco, E L

    1989-02-01

    A frequent procedure in matched case-control studies is to report results from the multivariate unmatched analyses if they do not differ substantially from the ones obtained after conditioning on the matching variables. Although conceptually simple, this rule requires that an extensive series of logistic regression models be evaluated by both the conditional and unconditional maximum likelihood methods. Most computer programs for logistic regression employ only one maximum likelihood method, which requires that the analyses be performed in separate steps. This paper describes a Pascal microcomputer (IBM PC) program that performs multiple logistic regression by both maximum likelihood estimation methods, which obviates the need for switching between programs to obtain relative risk estimates from both matched and unmatched analyses. The program calculates most standard statistics and allows factoring of categorical or continuous variables by two distinct methods of contrast. A built-in, descriptive statistics option allows the user to inspect the distribution of cases and controls across categories of any given variable.

  10. 45 CFR 205.56 - Requirements governing the use of income and eligibility information.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ...) of the Social Security Act must provide that: (a) The State agency will use the information obtained... received from the Internal Revenue Service, and earnings information received from the Social Security... Federal computer matching program that is subject to the requirements in the Computer Matching and Privacy...

  11. 45 CFR 205.56 - Requirements governing the use of income and eligibility information.

    Code of Federal Regulations, 2014 CFR

    2014-10-01

    ...) of the Social Security Act must provide that: (a) The State agency will use the information obtained... received from the Internal Revenue Service, and earnings information received from the Social Security... Federal computer matching program that is subject to the requirements in the Computer Matching and Privacy...

  12. 45 CFR 205.56 - Requirements governing the use of income and eligibility information.

    Code of Federal Regulations, 2013 CFR

    2013-10-01

    ...) of the Social Security Act must provide that: (a) The State agency will use the information obtained... received from the Internal Revenue Service, and earnings information received from the Social Security... Federal computer matching program that is subject to the requirements in the Computer Matching and Privacy...

  13. 45 CFR 205.56 - Requirements governing the use of income and eligibility information.

    Code of Federal Regulations, 2010 CFR

    2010-10-01

    ...) of the Social Security Act must provide that: (a) The State agency will use the information obtained... received from the Internal Revenue Service, and earnings information received from the Social Security... Federal computer matching program that is subject to the requirements in the Computer Matching and Privacy...

  14. 45 CFR 205.56 - Requirements governing the use of income and eligibility information.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ...) of the Social Security Act must provide that: (a) The State agency will use the information obtained... received from the Internal Revenue Service, and earnings information received from the Social Security... Federal computer matching program that is subject to the requirements in the Computer Matching and Privacy...

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

    ERIC Educational Resources Information Center

    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…

  16. Toothguide Trainer tests with color vision deficiency simulation monitor.

    PubMed

    Borbély, Judit; Varsányi, Balázs; Fejérdy, Pál; Hermann, Péter; Jakstat, Holger A

    2010-01-01

    The aim of this study was to evaluate whether simulated severe red and green color vision deficiency (CVD) influenced color matching results and to investigate whether training with Toothguide Trainer (TT) computer program enabled better color matching results. A total of 31 color normal dental students participated in the study. Every participant had to pass the Ishihara Test. Participants with a red/green color vision deficiency were excluded. A lecture on tooth color matching was given, and individual training with TT was performed. To measure the individual tooth color matching results in normal and color deficient display modes, the TT final exam was displayed on a calibrated monitor that served as a hardware-based method of simulating protanopy and deuteranopy. Data from the TT final exams were collected in normal and in severe red and green CVD-simulating monitor display modes. Color difference values for each participant in each display mode were computed (∑ΔE(ab)(*)), and the respective means and standard deviations were calculated. The Student's t-test was used in statistical evaluation. Participants made larger ΔE(ab)(*) errors in severe color vision deficient display modes than in the normal monitor mode. TT tests showed significant (p<0.05) difference in the tooth color matching results of severe green color vision deficiency simulation mode compared to normal vision mode. Students' shade matching results were significantly better after training (p=0.009). Computer-simulated severe color vision deficiency mode resulted in significantly worse color matching quality compared to normal color vision mode. Toothguide Trainer computer program improved color matching results. Copyright © 2010 Elsevier Ltd. All rights reserved.

  17. An automated procedure for developing hybrid computer simulations of turbofan engines

    NASA Technical Reports Server (NTRS)

    Szuch, J. R.; Krosel, S. M.

    1980-01-01

    A systematic, computer-aided, self-documenting methodology for developing hybrid computer simulations of turbofan engines is presented. The methodology makes use of a host program that can run on a large digital computer and a machine-dependent target (hybrid) program. The host program performs all of the calculations and date manipulations needed to transform user-supplied engine design information to a form suitable for the hybrid computer. The host program also trims the self contained engine model to match specified design point information. A test case is described and comparisons between hybrid simulation and specified engine performance data are presented.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-08-09

    ...)), concerning an individual's eligibility to receive a Segal AmeriCorps Education Award from the National... the applicable routine use. F. Inclusive Dates of the Matching Program This agreement will be in...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-03-15

    ... include: the Federal Pell Grant Program; the Academic Competitiveness Grant Program; the National Science... the VIS database for the purpose of confirming the immigration status of applicants for assistance, as...

  20. NBS computerized carpool matching system: users' guide. Final technical report

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Gilsinn, J.F.; Landau, S.

    1974-12-01

    The report includes flowcharts, input/output formats, and program listings for the programs, plus details of the manual process for coordinate coding. The matching program produces, for each person desiring it, a list of others residing within a pre-specified distance of him, and is thus applicable to a single work destination having primarily one work schedule. The system is currently operational on the National Bureau of Standards' UNIVAC 1108 computer and was run in March of 1974, producing lists for about 950 employees in less than four minutes computer time. Subsequent maintenance of the system will be carried out by themore » NBS Management and Organization Division. (GRA)« less

  1. A computer-based program to teach braille reading to sighted individuals.

    PubMed

    Scheithauer, Mindy C; Tiger, Jeffrey H

    2012-01-01

    Instructors of the visually impaired need efficient braille-training methods. This study conducted a preliminary evaluation of a computer-based program intended to teach the relation between braille characters and English letters using a matching-to-sample format with 4 sighted college students. Each participant mastered matching visual depictions of the braille alphabet to their printed-word counterparts. Further, each participant increased the number of words they read in a braille passage following this training. These gains were maintained at variable levels on a maintenance probe conducted 2 to 4 weeks after training.

  2. A COMPUTER-BASED PROGRAM TO TEACH BRAILLE READING TO SIGHTED INDIVIDUALS

    PubMed Central

    Scheithauer, Mindy C; Tiger, Jeffrey H

    2012-01-01

    Instructors of the visually impaired need efficient braille-training methods. This study conducted a preliminary evaluation of a computer-based program intended to teach the relation between braille characters and English letters using a matching-to-sample format with 4 sighted college students. Each participant mastered matching visual depictions of the braille alphabet to their printed-word counterparts. Further, each participant increased the number of words they read in a braille passage following this training. These gains were maintained at variable levels on a maintenance probe conducted 2 to 4 weeks after training. PMID:22844139

  3. Computing quantum hashing in the model of quantum branching programs

    NASA Astrophysics Data System (ADS)

    Ablayev, Farid; Ablayev, Marat; Vasiliev, Alexander

    2018-02-01

    We investigate the branching program complexity of quantum hashing. We consider a quantum hash function that maps elements of a finite field into quantum states. We require that this function is preimage-resistant and collision-resistant. We consider two complexity measures for Quantum Branching Programs (QBP): a number of qubits and a number of compu-tational steps. We show that the quantum hash function can be computed efficiently. Moreover, we prove that such QBP construction is optimal. That is, we prove lower bounds that match the constructed quantum hash function computation.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-07-25

    ... pension payment data from its system of records (SOR) entitled the ``Compensation, Pension, Education, and... monthly. The actual match will take place approximately during the first week of every month. E. Inclusive...

  5. Algorithms for computing the geopotential using a simple density layer

    NASA Technical Reports Server (NTRS)

    Morrison, F.

    1976-01-01

    Several algorithms have been developed for computing the potential and attraction of a simple density layer. These are numerical cubature, Taylor series, and a mixed analytic and numerical integration using a singularity-matching technique. A computer program has been written to combine these techniques for computing the disturbing acceleration on an artificial earth satellite. A total of 1640 equal-area, constant surface density blocks on an oblate spheroid are used. The singularity-matching algorithm is used in the subsatellite region, Taylor series in the surrounding zone, and numerical cubature on the rest of the earth.

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

    NASA Technical Reports Server (NTRS)

    Gordy, R. S.

    1972-01-01

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

  7. Automated procedure for developing hybrid computer simulations of turbofan engines. Part 1: General description

    NASA Technical Reports Server (NTRS)

    Szuch, J. R.; Krosel, S. M.; Bruton, W. M.

    1982-01-01

    A systematic, computer-aided, self-documenting methodology for developing hybrid computer simulations of turbofan engines is presented. The methodology that is pesented makes use of a host program that can run on a large digital computer and a machine-dependent target (hybrid) program. The host program performs all the calculations and data manipulations that are needed to transform user-supplied engine design information to a form suitable for the hybrid computer. The host program also trims the self-contained engine model to match specified design-point information. Part I contains a general discussion of the methodology, describes a test case, and presents comparisons between hybrid simulation and specified engine performance data. Part II, a companion document, contains documentation, in the form of computer printouts, for the test case.

  8. Shade matching assisted by digital photography and computer software.

    PubMed

    Schropp, Lars

    2009-04-01

    To evaluate the efficacy of digital photographs and graphic computer software for color matching compared to conventional visual matching. The shade of a tab from a shade guide (Vita 3D-Master Guide) placed in a phantom head was matched to a second guide of the same type by nine observers. This was done for twelve selected shade tabs (tests). The shade-matching procedure was performed visually in a simulated clinic environment and with digital photographs, and the time spent for both procedures was recorded. An alternative arrangement of the shade tabs was used in the digital photographs. In addition, a graphic software program was used for color analysis. Hue, chroma, and lightness values of the test tab and all tabs of the second guide were derived from the digital photographs. According to the CIE L*C*h* color system, the color differences between the test tab and tabs of the second guide were calculated. The shade guide tab that deviated least from the test tab was determined to be the match. Shade matching performance by means of graphic software was compared with the two visual methods and tested by Chi-square tests (alpha= 0.05). Eight of twelve test tabs (67%) were matched correctly by the computer software method. This was significantly better (p < 0.02) than the performance of the visual shade matching methods conducted in the simulated clinic (32% correct match) and with photographs (28% correct match). No correlation between time consumption for the visual shade matching methods and frequency of correct match was observed. Shade matching assisted by digital photographs and computer software was significantly more reliable than by conventional visual methods.

  9. Concurrent performance in a three-alternative choice situation: response allocation in a Rock/Paper/Scissors game.

    PubMed

    Kangas, Brian D; Berry, Meredith S; Cassidy, Rachel N; Dallery, Jesse; Vaidya, Manish; Hackenberg, Timothy D

    2009-10-01

    Adult human subjects engaged in a simulated Rock/Paper/Scissors game against a computer opponent. The computer opponent's responses were determined by programmed probabilities that differed across 10 blocks of 100 trials each. Response allocation in Experiment 1 was well described by a modified version of the generalized matching equation, with undermatching observed in all subjects. To assess the effects of instructions on response allocation, accurate probability-related information on how the computer was programmed to respond was provided to subjects in Experiment 2. Five of 6 subjects played the counter response of the computer's dominant programmed response near-exclusively (e.g., subjects played paper almost exclusively if the probability of rock was high), resulting in minor overmatching, and higher reinforcement rates relative to Experiment 1. On the whole, the study shows that the generalized matching law provides a good description of complex human choice in a gaming context, and illustrates a promising set of laboratory methods and analytic techniques that capture important features of human choice outside the laboratory.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-12-20

    ... education benefit payments under the Montgomery GI Bill and Post-9/11 GI Bill. The purpose of the match is... have applied for and/or are receiving, or have received education benefit payments under the Montgomery... and Legislative Development Team Leader, Education Service (225B), Veterans Benefits Administration...

  13. Tempest: GPU-CPU computing for high-throughput database spectral matching.

    PubMed

    Milloy, Jeffrey A; Faherty, Brendan K; Gerber, Scott A

    2012-07-06

    Modern mass spectrometers are now capable of producing hundreds of thousands of tandem (MS/MS) spectra per experiment, making the translation of these fragmentation spectra into peptide matches a common bottleneck in proteomics research. When coupled with experimental designs that enrich for post-translational modifications such as phosphorylation and/or include isotopically labeled amino acids for quantification, additional burdens are placed on this computational infrastructure by shotgun sequencing. To address this issue, we have developed a new database searching program that utilizes the massively parallel compute capabilities of a graphical processing unit (GPU) to produce peptide spectral matches in a very high throughput fashion. Our program, named Tempest, combines efficient database digestion and MS/MS spectral indexing on a CPU with fast similarity scoring on a GPU. In our implementation, the entire similarity score, including the generation of full theoretical peptide candidate fragmentation spectra and its comparison to experimental spectra, is conducted on the GPU. Although Tempest uses the classical SEQUEST XCorr score as a primary metric for evaluating similarity for spectra collected at unit resolution, we have developed a new "Accelerated Score" for MS/MS spectra collected at high resolution that is based on a computationally inexpensive dot product but exhibits scoring accuracy similar to that of the classical XCorr. In our experience, Tempest provides compute-cluster level performance in an affordable desktop computer.

  14. Computerized Numerical Control Curriculum Guide.

    ERIC Educational Resources Information Center

    Reneau, Fred; And Others

    This guide is intended for use in a course in programming and operating a computerized numerical control system. Addressed in the course are various aspects of programming and planning, setting up, and operating machines with computerized numerical control, including selecting manual or computer-assigned programs and matching them with…

  15. Methods, systems, and computer program products for network firewall policy optimization

    DOEpatents

    Fulp, Errin W [Winston-Salem, NC; Tarsa, Stephen J [Duxbury, MA

    2011-10-18

    Methods, systems, and computer program products for firewall policy optimization are disclosed. According to one method, a firewall policy including an ordered list of firewall rules is defined. For each rule, a probability indicating a likelihood of receiving a packet matching the rule is determined. The rules are sorted in order of non-increasing probability in a manner that preserves the firewall policy.

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

    ERIC Educational Resources Information Center

    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…

  17. A computer program to obtain time-correlated gust loads for nonlinear aircraft using the matched-filter-based method

    NASA Technical Reports Server (NTRS)

    Scott, Robert C.; Pototzky, Anthony S.; Perry, Boyd, III

    1994-01-01

    NASA Langley Research Center has, for several years, conducted research in the area of time-correlated gust loads for linear and nonlinear aircraft. The results of this work led NASA to recommend that the Matched-Filter-Based One-Dimensional Search Method be used for gust load analyses of nonlinear aircraft. This manual describes this method, describes a FORTRAN code which performs this method, and presents example calculations for a sample nonlinear aircraft model. The name of the code is MFD1DS (Matched-Filter-Based One-Dimensional Search). The program source code, the example aircraft equations of motion, a sample input file, and a sample program output are all listed in the appendices.

  18. Equasions for Curriculum Improvement.

    ERIC Educational Resources Information Center

    Eckenrod, James S.

    1986-01-01

    Describes the Technology in Curriculum (TIC) program resource guides which will be distributed to California schools in the fall of 1986. These guides match available instructional television programs and computer software to existing California curriculum guides in order to facilitate teachers' classroom use. (JDH)

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

  20. 40 CFR 51.361 - Motorist compliance enforcement.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... programs and computer-matching programs. States that did not adopt an I/M program for any area of the State... approved. An enhanced I/M area may use an existing alternative if it demonstrates that the alternative has... alternative” only in States that, for some area in the State, had an I/M program with that mechanism in...

  1. 40 CFR 51.361 - Motorist compliance enforcement.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... programs and computer-matching programs. States that did not adopt an I/M program for any area of the State... approved. An enhanced I/M area may use an existing alternative if it demonstrates that the alternative has... alternative” only in States that, for some area in the State, had an I/M program with that mechanism in...

  2. 40 CFR 51.361 - Motorist compliance enforcement.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... programs and computer-matching programs. States that did not adopt an I/M program for any area of the State... approved. An enhanced I/M area may use an existing alternative if it demonstrates that the alternative has... alternative” only in States that, for some area in the State, had an I/M program with that mechanism in...

  3. Phased array antenna matching: Simulation and optimization of a planar phased array of circular waveguide elements

    NASA Technical Reports Server (NTRS)

    Dudgeon, J. E.

    1972-01-01

    A computerized simulation of a planar phased array of circular waveguide elements is reported using mutual coupling and wide angle impedance matching in phased arrays. Special emphasis is given to circular polarization. The aforementioned computer program has as variable inputs: frequency, polarization, grid geometry, element size, dielectric waveguide fill, dielectric plugs in the waveguide for impedance matching, and dielectric sheets covering the array surface for the purpose of wide angle impedance matching. Parameter combinations are found which produce reflection peaks interior to grating lobes, while dielectric cover sheets are successfully employed to extend the usable scan range of a phased array. The most exciting results came from the application of computer aided optimization techniques to the design of this type of array.

  4. From Classroom to Computer Terminal.

    ERIC Educational Resources Information Center

    Bumstead, Richard

    1981-01-01

    Describes a Massachusetts pilot project which matches the state's need for trained technicians with the needs of teachers laid off or dismissed. The computer programer training course and job placement service illustrate a school-business partnership that eases the transition for teachers forced to change careers. (SK)

  5. A Fortran Program to Aid in Mineral Identification Using Optical Properties.

    ERIC Educational Resources Information Center

    Blanchard, Frank N.

    1980-01-01

    Describes a search and match computer program which retreives from a user-generated mineral file those minerals which are not incompatible with the observed or measured optical properties of an unknown. Careful selection of input lists make it unlikely that the program will fail when reasonably accurate observations are recorded. (Author/JN)

  6. 42 CFR 121.2 - Definitions.

    Code of Federal Regulations, 2012 CFR

    2012-10-01

    ... 42 Public Health 1 2012-10-01 2012-10-01 false Definitions. 121.2 Section 121.2 Public Health... PROCUREMENT AND TRANSPLANTATION NETWORK § 121.2 Definitions. As used in this part— Act means the Public Health..., transplant recipient, or organ donor. OPTN computer match program means a set of computer-based instructions...

  7. 42 CFR 121.2 - Definitions.

    Code of Federal Regulations, 2011 CFR

    2011-10-01

    ... 42 Public Health 1 2011-10-01 2011-10-01 false Definitions. 121.2 Section 121.2 Public Health... PROCUREMENT AND TRANSPLANTATION NETWORK § 121.2 Definitions. As used in this part— Act means the Public Health..., transplant recipient, or organ donor. OPTN computer match program means a set of computer-based instructions...

  8. Real-time stereo matching using orthogonal reliability-based dynamic programming.

    PubMed

    Gong, Minglun; Yang, Yee-Hong

    2007-03-01

    A novel algorithm is presented in this paper for estimating reliable stereo matches in real time. Based on the dynamic programming-based technique we previously proposed, the new algorithm can generate semi-dense disparity maps using as few as two dynamic programming passes. The iterative best path tracing process used in traditional dynamic programming is replaced by a local minimum searching process, making the algorithm suitable for parallel execution. Most computations are implemented on programmable graphics hardware, which improves the processing speed and makes real-time estimation possible. The experiments on the four new Middlebury stereo datasets show that, on an ATI Radeon X800 card, the presented algorithm can produce reliable matches for 60% approximately 80% of pixels at the rate of 10 approximately 20 frames per second. If needed, the algorithm can be configured for generating full density disparity maps.

  9. Privacy Act of 1974; matching program--HCFA. Notice of a matching program--the Internal Revenue Service (IRS), the Social Security Administration (SSA), and HCFA--disclosure of IRS taxpayer identity and filing status information to be matched with SSA earned income information for Medicare beneficiaries and their spouses.

    PubMed

    1990-09-21

    As required by Section 6202 of the Omnibus Budget Reconciliation Act of 1989 (OBRA 1989), Public Law 101-239, the Department of Health and Human Services is providing public notice that the IRS and the SSA will disclose certain information regarding the taxpayer identification and filing status and the earned income of Medicare beneficiaries and their spouses for HCFA's use in identifying Medicare secondary payer (MSP) situations. This will enable HCFA to seek recovery of identified mistaken payments that were the liability of another primary insurer or other type of payer. The matching report set forth below is in compliance with the Computer Matching and Privacy Protection Act of 1988 (Pub. L. No. 100-503).

  10. Increasing Use of Instructional Television Programming.

    ERIC Educational Resources Information Center

    Harbison, Elaine S.

    1989-01-01

    Discusses the use of instructional television and video materials in the classroom and suggests what the role of the library/media specialist should be in increasing the use of these materials. Topics discussed include matching video materials with current curriculum needs; computer database programs; needs assessment forms; promotional…

  11. Development of a Tool to Recreate the Mars Science Laboratory Aerothermal Environment

    NASA Technical Reports Server (NTRS)

    Beerman, A. F.; Lewis, M. J.; Santos, J. A.; White, T. R.

    2010-01-01

    The Mars Science Laboratory will enter the Martian atmosphere in 2012 with multiple char depth sensors and in-depth thermocouples in its heatshield. The aerothermal environment experienced by MSL may be computationally recreated using the data from the sensors and a material response program, such as the Fully Implicit Ablation and Thermal (FIAT) response program, through the matching of the char depth and thermocouple predictions of the material response program to the sensor data. A tool, CHanging Inputs from the Environment of FIAT (CHIEF), was developed to iteratively change different environmental conditions such that FIAT predictions match within certain criteria applied to an external data set. The computational environment is changed by iterating on the enthalpy, pressure, or heat transfer coefficient at certain times in the trajectory. CHIEF was initially compared against arc-jet test data from the development of the MSL heatshield and then against simulated sensor data derived from design trajectories for MSL. CHIEF was able to match char depth and in-depth thermocouple temperatures within the bounds placed upon it for these cases. Further refinement of CHIEF to compare multiple time points and assign convergence criteria may improve accuracy.

  12. Constructed-response matching to sample and spelling instruction.

    PubMed Central

    Dube, W V; McDonald, S J; McIlvane, W J; Mackay, H A

    1991-01-01

    The development of interactive programmed instruction using a microcomputer as a teaching machine is described. The program applied a constructed-response matching-to-sample procedure to computer-assisted spelling instruction and review. On each trial, subjects were presented with a sample stimulus and a choice pool consisting of 10 individual letters. In initial training, sample stimuli were arrays of letters, and subjects were taught to construct identical arrays by touching the matching letters in the choice pool. After generalized constructed-response identity matching was established, pictures (line drawings) of common objects were presented as samples. At first, correct spelling was prompted by also presenting the printed name to be "copied" via identity matching; then the prompts were faded out. The program was implemented with 2 mentally retarded individuals. Assessment trials determined appropriate words for training. Correct spelling was established via the prompt-fading procedure; training trials were interspersed among baseline trials that reviewed and maintained spelling of previously learned words. As new words were learned, they were added to a cumulative baseline to generate an individualized review and practice battery for each subject. PMID:1890049

  13. 2D/3D Visual Tracker for Rover Mast

    NASA Technical Reports Server (NTRS)

    Bajracharya, Max; Madison, Richard W.; Nesnas, Issa A.; Bandari, Esfandiar; Kunz, Clayton; Deans, Matt; Bualat, Maria

    2006-01-01

    A visual-tracker computer program controls an articulated mast on a Mars rover to keep a designated feature (a target) in view while the rover drives toward the target, avoiding obstacles. Several prior visual-tracker programs have been tested on rover platforms; most require very small and well-estimated motion between consecutive image frames a requirement that is not realistic for a rover on rough terrain. The present visual-tracker program is designed to handle large image motions that lead to significant changes in feature geometry and photometry between frames. When a point is selected in one of the images acquired from stereoscopic cameras on the mast, a stereo triangulation algorithm computes a three-dimensional (3D) location for the target. As the rover moves, its body-mounted cameras feed images to a visual-odometry algorithm, which tracks two-dimensional (2D) corner features and computes their old and new 3D locations. The algorithm rejects points, the 3D motions of which are inconsistent with a rigid-world constraint, and then computes the apparent change in the rover pose (i.e., translation and rotation). The mast pan and tilt angles needed to keep the target centered in the field-of-view of the cameras (thereby minimizing the area over which the 2D-tracking algorithm must operate) are computed from the estimated change in the rover pose, the 3D position of the target feature, and a model of kinematics of the mast. If the motion between the consecutive frames is still large (i.e., 3D tracking was unsuccessful), an adaptive view-based matching technique is applied to the new image. This technique uses correlation-based template matching, in which a feature template is scaled by the ratio between the depth in the original template and the depth of pixels in the new image. This is repeated over the entire search window and the best correlation results indicate the appropriate match. The program could be a core for building application programs for systems that require coordination of vision and robotic motion.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

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

  15. Neural-Network Simulator

    NASA Technical Reports Server (NTRS)

    Mitchell, Paul H.

    1991-01-01

    F77NNS (FORTRAN 77 Neural Network Simulator) computer program simulates popular back-error-propagation neural network. Designed to take advantage of vectorization when used on computers having this capability, also used on any computer equipped with ANSI-77 FORTRAN Compiler. Problems involving matching of patterns or mathematical modeling of systems fit class of problems F77NNS designed to solve. Program has restart capability so neural network solved in stages suitable to user's resources and desires. Enables user to customize patterns of connections between layers of network. Size of neural network F77NNS applied to limited only by amount of random-access memory available to user.

  16. Helicopter rotor loads using matched asymptotic expansions: User's manual

    NASA Technical Reports Server (NTRS)

    Pierce, G. A.; Vaidyanathan, A. R.

    1983-01-01

    Computer programs were developed to implement the computational scheme arising from Van Holten's asymptotic method for calculating airloads on a helicopter rotor blade in forward flight, and a similar technique which is based on a discretized version of the method. The basic outlines of the two programs are presented, followed by separate descriptions of the input requirements and output format. Two examples illustrating job entry with appropriate input data and corresponding output are included. Appendices contain a sample table of lift coefficient data for the NACA 0012 air foil and listings of the two programs.

  17. Brickworx builds recurrent RNA and DNA structural motifs into medium- and low-resolution electron-density maps

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Chojnowski, Grzegorz, E-mail: gchojnowski@genesilico.pl; Waleń, Tomasz; University of Warsaw, Banacha 2, 02-097 Warsaw

    2015-03-01

    A computer program that builds crystal structure models of nucleic acid molecules is presented. Brickworx is a computer program that builds crystal structure models of nucleic acid molecules using recurrent motifs including double-stranded helices. In a first step, the program searches for electron-density peaks that may correspond to phosphate groups; it may also take into account phosphate-group positions provided by the user. Subsequently, comparing the three-dimensional patterns of the P atoms with a database of nucleic acid fragments, it finds the matching positions of the double-stranded helical motifs (A-RNA or B-DNA) in the unit cell. If the target structure ismore » RNA, the helical fragments are further extended with recurrent RNA motifs from a fragment library that contains single-stranded segments. Finally, the matched motifs are merged and refined in real space to find the most likely conformations, including a fit of the sequence to the electron-density map. The Brickworx program is available for download and as a web server at http://iimcb.genesilico.pl/brickworx.« less

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

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... concern expressed by the Congress in the Privacy Act of 1974 that “the increasing use of computers and sophisticated information technology, while essential to the efficient operation of the Government, has greatly... which a computer is used to compare two or more automated systems of records or a system of records with...

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

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... concern expressed by the Congress in the Privacy Act of 1974 that “the increasing use of computers and sophisticated information technology, while essential to the efficient operation of the Government, has greatly... which a computer is used to compare two or more automated systems of records or a system of records with...

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

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... concern expressed by the Congress in the Privacy Act of 1974 that “the increasing use of computers and sophisticated information technology, while essential to the efficient operation of the Government, has greatly... which a computer is used to compare two or more automated systems of records or a system of records with...

  1. ENGINEL: A single rotor turbojet engine cycle match performance program

    NASA Technical Reports Server (NTRS)

    Lovell, W. A.

    1977-01-01

    ENGINEL is a computer program which was developed to generate the design and off-design performance of a single rotor turbojet engine with or without afterburning using a cycle match procedure. It is capable of producing engine performance over a wide range of altitudes and Mach numbers. The flexibility, of operating with a variable geometry turbine, for improved off-design fuel consumption or with a fixed geometry turbine as in conventional turbojets, has been incorporated. In addition, the option of generation engine performance with JP4, liquid hydrogen or methane as fuel is provided.

  2. An automated approach to design of solid rockets utilizing a special internal ballistics model

    NASA Technical Reports Server (NTRS)

    Sforzini, R. H.

    1980-01-01

    A pattern search technique is presented, which is utilized in a computer program that minimizes the sum of the squares of the differences, at various times, between a desired thrust-time trace and that calculated with a special mathematical internal ballistics model of a solid propellant rocket motor. The program is demonstrated by matching the thrust-time trace obtained from static tests of the first Space Shuttle SRM starting with input values of 10 variables which are, in general, 10% different from the as-built SRM. It is concluded that an excellent match is obtained.

  3. Colorado Students Contend in Competition of the Mind

    Science.gov Websites

    -paced match of questions about physics, math, biology, astronomy, chemistry, computers and the earth one of its premier educational programs to help stimulate young people's interest in science and math

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-11-16

    ... Administration (GSA) for inclusion in GSA's List of Parties Excluded from Federal Procurements and Nonprocurement... (FRS), toll free, at 1-800-877-8339. Individuals with disabilities can obtain this document in an...

  5. Preliminary Report on the Feasibility of Computer Matching in the National School Lunch Program. Nutrition Assistance Program Report Series. Report No. CN-05-PDM.

    ERIC Educational Resources Information Center

    Cole, Nancy; Logan, Christopher

    2005-01-01

    The USDA provides reimbursement for meals served under the National School Lunch Program (NSLP) and School Breakfast Program (SBP) to millions of children each school day. Children in families with income at or below 130 percent of the Federal poverty level are eligible for free meals, and children in families with income between 130 and 185…

  6. Phi-s correlation and dynamic time warping - Two methods for tracking ice floes in SAR images

    NASA Technical Reports Server (NTRS)

    Mcconnell, Ross; Kober, Wolfgang; Kwok, Ronald; Curlander, John C.; Pang, Shirley S.

    1991-01-01

    The authors present two algorithms for performing shape matching on ice floe boundaries in SAR (synthetic aperture radar) images. These algorithms quickly produce a set of ice motion and rotation vectors that can be used to guide a pixel value correlator. The algorithms match a shape descriptor known as the Phi-s curve. The first algorithm uses normalized correlation to match the Phi-s curves, while the second uses dynamic programming to compute an elastic match that better accommodates ice floe deformation. Some empirical data on the performance of the algorithms on Seasat SAR images are presented.

  7. The Effects of Study Tasks in a Computer-Based Chemistry Learning Environment

    NASA Astrophysics Data System (ADS)

    Urhahne, Detlef; Nick, Sabine; Poepping, Anna Christin; Schulz, Sarah Jayne

    2013-12-01

    The present study examines the effects of different study tasks on the acquisition of knowledge about acids and bases in a computer-based learning environment. Three different task formats were selected to create three treatment conditions: learning with gap-fill and matching tasks, learning with multiple-choice tasks, and learning only from text and figures without any additional tasks. Participants were 196 ninth-grade students who learned with a self-developed multimedia program in a pretest-posttest control group design. Research results reveal that gap-fill and matching tasks were most effective in promoting knowledge acquisition, followed by multiple-choice tasks, and no tasks at all. The findings are in line with previous research on this topic. The effects can possibly be explained by the generation-recognition model, which predicts that gap-fill and matching tasks trigger more encompassing learning processes than multiple-choice tasks. It is concluded that instructional designers should incorporate more challenging study tasks for enhancing the effectiveness of computer-based learning environments.

  8. Do-It-Yourself Learning Games: Software That Lets You Pick the Questions--and Answers.

    ERIC Educational Resources Information Center

    Hively, Wells

    1984-01-01

    Reviews user-adaptable learning games that can be customized for any subject, including Tic Tac Show and the Game Show from Computer Advanced Ideas, which are question-answer learning programs based on game shows, and Master Match from Computer Advanced Ideas and Square Pairs from Scholastic Inc., which are based on the card game Concentration.…

  9. One Small Step for Manuals: Computer-Assisted Training in Twelve-Step Facilitation*

    PubMed Central

    Sholomskas, Diane E.; Carroll, Kathleen M.

    2008-01-01

    Objective The burgeoning number of empirically validated therapies has not been met with systematic evaluation of practical, inexpensive means of teaching large numbers of clinicians to use these treatments effectively. An interactive, computer-assisted training program that sought to impart skills associated with the Project MATCH (Matching Alcoholism Treatments to Client Heterogeneity) Twelve-Step Facilitation (TSF) manual was developed to address this need. Method Twenty-five community-based substance use-treatment clinicians were randomized to one of two training conditions: (1) access to the computer-assisted training program plus the TSF manual or (2) access to the manual only. The primary outcome measure was change from pre- to posttraining in the clinicians' ability to demonstrate key TSF skills. Results The data suggested that the clinicians' ability to implement TSF, as assessed by independent ratings of adherence and skill for the key TSF interventions, was significantly higher after training for those who had access to the computerized training condition than those who were assigned to the manual-only condition. Those assigned to the computer-assisted training condition also demonstrated greater gains in a knowledge test assessing familiarity with concepts presented in the TSF manual. Conclusions Computer-based training may be a feasible and effective means of training larger numbers of clinicians in empirically supported, manual-guided therapies. PMID:17061013

  10. One small step for manuals: Computer-assisted training in twelve-step facilitation.

    PubMed

    Sholomskas, Diane E; Carroll, Kathleen M

    2006-11-01

    The burgeoning number of empirically validated therapies has not been met with systematic evaluation of practical, inexpensive means of teaching large numbers of clinicians to use these treatments effectively. An interactive, computer-assisted training program that sought to impart skills associated with the Project MATCH (Matching Alcoholism Treatments to Client Heterogeneity) Twelve-Step Facilitation (TSF) manual was developed to address this need. Twenty-five community-based substance use-treatment clinicians were randomized to one of two training conditions: (1) access to the computer- assisted training program plus the TSF manual or (2) access to the manual only. The primary outcome measure was change from preto posttraining in the clinicians' ability to demonstrate key TSF skills. The data suggested that the clinicians' ability to implement TSF, as assessed by independent ratings of adherence and skill for the key TSF interventions, was significantly higher after training for those who had access to the computerized training condition than those who were assigned to the manual-only condition. Those assigned to the computer-assisted training condition also demonstrated greater gains in a knowledge test assessing familiarity with concepts presented in the TSF manual. Computer-based training may be a feasible and effective means of training larger numbers of clinicians in empirically supported, manual-guided therapies.

  11. Merlin - Massively parallel heterogeneous computing

    NASA Technical Reports Server (NTRS)

    Wittie, Larry; Maples, Creve

    1989-01-01

    Hardware and software for Merlin, a new kind of massively parallel computing system, are described. Eight computers are linked as a 300-MIPS prototype to develop system software for a larger Merlin network with 16 to 64 nodes, totaling 600 to 3000 MIPS. These working prototypes help refine a mapped reflective memory technique that offers a new, very general way of linking many types of computer to form supercomputers. Processors share data selectively and rapidly on a word-by-word basis. Fast firmware virtual circuits are reconfigured to match topological needs of individual application programs. Merlin's low-latency memory-sharing interfaces solve many problems in the design of high-performance computing systems. The Merlin prototypes are intended to run parallel programs for scientific applications and to determine hardware and software needs for a future Teraflops Merlin network.

  12. Keylogger Application to Monitoring Users Activity with Exact String Matching Algorithm

    NASA Astrophysics Data System (ADS)

    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.

  13. Transactions of the Army Conference on Applied Mathematics and Computing (1st) Held at Washington, DC on 9-11 May 1983

    DTIC Science & Technology

    1984-02-01

    I . . . . . . An Introduction to Geometric Programming Patrick D. Allen and David W. Baker . . . . . . , . . . . . . . Space and Time...Zarwyn, US-Army Electronics R & D Comhiand GEOMETRIC PROGRAMING SPACE AND TIFFE ANALYSIS IN DYNAMIC PROGRAMING ALGORITHMS Renne..tf Stizti, AkeanXa...physical and parameter space can be connected by asymptotic matching. The purpose of the asymptotic analysis is to define the simplest problems

  14. Open solutions to distributed control in ground tracking stations

    NASA Technical Reports Server (NTRS)

    Heuser, William Randy

    1994-01-01

    The advent of high speed local area networks has made it possible to interconnect small, powerful computers to function together as a single large computer. Today, distributed computer systems are the new paradigm for large scale computing systems. However, the communications provided by the local area network is only one part of the solution. The services and protocols used by the application programs to communicate across the network are as indispensable as the local area network. And the selection of services and protocols that do not match the system requirements will limit the capabilities, performance, and expansion of the system. Proprietary solutions are available but are usually limited to a select set of equipment. However, there are two solutions based on 'open' standards. The question that must be answered is 'which one is the best one for my job?' This paper examines a model for tracking stations and their requirements for interprocessor communications in the next century. The model and requirements are matched with the model and services provided by the five different software architectures and supporting protocol solutions. Several key services are examined in detail to determine which services and protocols most closely match the requirements for the tracking station environment. The study reveals that the protocols are tailored to the problem domains for which they were originally designed. Further, the study reveals that the process control model is the closest match to the tracking station model.

  15. Expert System Software

    NASA Technical Reports Server (NTRS)

    1989-01-01

    C Language Integrated Production System (CLIPS) is a software shell for developing expert systems is designed to allow research and development of artificial intelligence on conventional computers. Originally developed by Johnson Space Center, it enables highly efficient pattern matching. A collection of conditions and actions to be taken if the conditions are met is built into a rule network. Additional pertinent facts are matched to the rule network. Using the program, E.I. DuPont de Nemours & Co. is monitoring chemical production machines; California Polytechnic State University is investigating artificial intelligence in computer aided design; Mentor Graphics has built a new Circuit Synthesis system, and Brooke and Brooke, a law firm, can determine which facts from a file are most important.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-01-23

    ... hurricanes Katrina and Rita, and referred 67,023 of those registrations to SBA as potential duplicates. Excluding the Katrina and Rita disasters, DHS/FEMA received 7,070,068 registrations from 1998-2009, and...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-06-23

    ... response to hurricanes Katrina and Rita, and referred 67,023 of those registrations to SBA as potential duplicates. Excluding the Katrina and Rita disasters, DHS/FEMA received 7,070,068 registrations from 1998...

  18. Automated support tool for variable rate irrigation prescriptions

    USDA-ARS?s Scientific Manuscript database

    Variable rate irrigation (VRI) enables center pivot management to better meet non-uniform water and fertility needs. This is accomplished through correctly matching system water application with spatial and temporal variability within the field. A computer program was modified to accommodate GIS dat...

  19. 14 CFR 1212.203 - Disclosures.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 14 Aeronautics and Space 5 2011-01-01 2010-01-01 true Disclosures. 1212.203 Section 1212.203 Aeronautics and Space NATIONAL AERONAUTICS AND SPACE ADMINISTRATION PRIVACY ACT-NASA REGULATIONS Access to... computer matching programs (See NASA Management Instruction (NMI) 1382.18). (b) Disclosure accountings are...

  20. 32 CFR 318.4 - Policy.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... administrative, technical, and physical safeguards shall be established, based on the media (e.g., paper... Register and reports shall be submitted to Congress and the Office of Management and Budget, in accordance...) Computer matching programs between DTRA and Federal, State, or local governmental agencies shall be...

  1. 32 CFR 318.4 - Policy.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... administrative, technical, and physical safeguards shall be established, based on the media (e.g., paper... Register and reports shall be submitted to Congress and the Office of Management and Budget, in accordance...) Computer matching programs between DTRA and Federal, State, or local governmental agencies shall be...

  2. 32 CFR 318.4 - Policy.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... administrative, technical, and physical safeguards shall be established, based on the media (e.g., paper... Register and reports shall be submitted to Congress and the Office of Management and Budget, in accordance...) Computer matching programs between DTRA and Federal, State, or local governmental agencies shall be...

  3. Fusing Image Data for Calculating Position of an Object

    NASA Technical Reports Server (NTRS)

    Huntsberger, Terrance; Cheng, Yang; Liebersbach, Robert; Trebi-Ollenu, Ashitey

    2007-01-01

    A computer program has been written for use in maintaining the calibration, with respect to the positions of imaged objects, of a stereoscopic pair of cameras on each of the Mars Explorer Rovers Spirit and Opportunity. The program identifies and locates a known object in the images. The object in question is part of a Moessbauer spectrometer located at the tip of a robot arm, the kinematics of which are known. In the program, the images are processed through a module that extracts edges, combines the edges into line segments, and then derives ellipse centroids from the line segments. The images are also processed by a feature-extraction algorithm that performs a wavelet analysis, then performs a pattern-recognition operation in the wavelet-coefficient space to determine matches to a texture feature measure derived from the horizontal, vertical, and diagonal coefficients. The centroids from the ellipse finder and the wavelet feature matcher are then fused to determine co-location. In the event that a match is found, the centroid (or centroids if multiple matches are present) is reported. If no match is found, the process reports the results of the analyses for further examination by human experts.

  4. Development and verification of real-time, hybrid computer simulation of F100-PW-100(3) turbofan engine

    NASA Technical Reports Server (NTRS)

    Szuch, J. R.; Seldner, K.; Cwynar, D. S.

    1977-01-01

    A real time, hybrid computer simulation of a turbofan engine is described. Controls research programs involving that engine are supported by the simulation. The real time simulation is shown to match the steady state and transient performance of the engine over a wide range of flight conditions and power settings. The simulation equations, FORTRAN listing, and analog patching diagrams are included.

  5. Using multimedia for patient information--a program about nocturnal enuresis.

    PubMed

    Evans, J H; Collier, J; Crook, I; Garrud, P; Harris, P; MacKinlay, D R; Redsell, S A

    1998-05-01

    To identify the information needs of children with nocturnal enuresis, and to design, produce and evaluate an interactive computer program to provide this information. The program was developed over an 18-month period using information provided by children, parents and professionals, and was evaluated in a hospital-based enuresis clinic in 65 children. Usability and knowledge gained were also evaluated in 43 healthy children aged 8-10 years attending a local inner-city primary school. An interactive program about nocturnal enuresis was developed, which runs on a personal computer and uses sound, voice, cartoon drawings and animation in a modular design. Knowledge scores increased in clinic attendees and in schoolchildren after using the program (Wilcoxon matched pairs test, P < 0.001). This improvement was maintained when the program was re-tested 6-10 months later. This interactive computer program holds children's attention and increases their understanding of enuresis. Interactive multimedia may be useful to complement the information provided by health professionals. This method of communication may be particularly useful for children with a low level of literacy.

  6. 75 FR 53375 - Petition for Exemption From the Federal Motor Vehicle Theft Prevention Standard; Chrysler

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-08-31

    ... Module/SKREEM, or the Body Control Module/BCM are integral to the Body Computer Module (BCM) on the Fiat... addition to having to be cut to match the mechanical coding of the ignition lock cylinder and programmed...

  7. 14 CFR 1212.203 - Disclosures.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... Records § 1212.203 Disclosures. (a) The system manager shall keep a disclosure accounting for each... computer matching programs (See NASA Management Instruction (NMI) 1382.18). (b) Disclosure accountings are... (2) In accordance with § 1212.203(g) (1) and (2), below. (c) The disclosure accounting required by...

  8. GR@PPA 2.8: Initial-state jet matching for weak-boson production processes at hadron collisions

    NASA Astrophysics Data System (ADS)

    Odaka, Shigeru; Kurihara, Yoshimasa

    2012-04-01

    The initial-state jet matching method introduced in our previous studies has been applied to the event generation of single W and Z production processes and diboson (WW, WZ and ZZ) production processes at hadron collisions in the framework of the GR@PPA event generator. The generated events reproduce the transverse momentum spectra of weak bosons continuously in the entire kinematical region. The matrix elements (ME) for hard interactions are still at the tree level. As in previous versions, the decays of weak bosons are included in the matrix elements. Therefore, spin correlations and phase-space effects in the decay of weak bosons are exact at the tree level. The program package includes custom-made parton shower programs as well as ME-based hard interaction generators in order to achieve self-consistent jet matching. The generated events can be passed to general-purpose event generators to make the simulation proceed down to the hadron level. Catalogue identifier: ADRH_v3_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADRH_v3_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 112 146 No. of bytes in distributed program, including test data, etc.: 596 667 Distribution format: tar.gz Programming language: Fortran; with some included libraries coded in C and C++ Computer: All Operating system: Any UNIX-like system RAM: 1.6 Mega bytes at minimum Classification: 11.2 Catalogue identifier of previous version: ADRH_v2_0 Journal reference of previous version: Comput. Phys. Comm. 175 (2006) 665 External routines: Bash and Perl for the setup, and CERNLIB, ROOT, LHAPDF, PYTHIA according to the user's choice. Does the new version supersede the previous version?: No, this version supports only a part of the processes included in the previous versions. Nature of problem: We need to combine those processes including 0 jet and 1 jet in the matrix elements using an appropriate matching method, in order to simulate weak-boson production processes in the entire kinematical region. Solution method: The leading logarithmic components to be included in parton distribution functions and parton showers are subtracted from 1-jet matrix elements. Custom-made parton shower programs are provided to ensure satisfactory performance of the matching method. Reasons for new version: An initial-state jet matching method has been implemented. Summary of revisions: Weak-boson production processes associated with 0 jet and 1 jet can be consistently merged using the matching method. Restrictions: The built-in parton showers are not compatible with the PYTHIA new PS and the HERWIG PS. Unusual features: A large number of particles may be produced by the parton showers and passed to general-purpose event generators. Running time: About 10 min for initialization plus 25 s for every 1k-event generation for W production in the LHC condition, on a 3.0-GHz Intel Xeon processor with the default setting.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-07-14

    ... and Privacy Protection Act of 1988 (Pub. L. 100-503), amended the Privacy Act (5 U.S.C. 552a) by... Ross, Chief of Staff, Office of the Secretary, Department of Agriculture. [FR Doc. 2010-17284 Filed 7...

  10. 32 CFR 505.1 - General information.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... Defense Department of Defense (Continued) DEPARTMENT OF THE ARMY AID OF CIVIL AUTHORITIES AND PUBLIC RELATIONS ARMY PRIVACY ACT PROGRAM § 505.1 General information. (a) Purpose. This part sets forth policies... Relating to Individual Persons, November 30, 1943. (9) Public Law 100-503, the Computer Matching and...

  11. 41 CFR 105-56.014 - Purpose and scope.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... centralized salary offset computer matching, identify Federal employees who owe delinquent non-tax debt to the... satisfy delinquent non-tax debt owed to the United States. GSA will pursue, when appropriate, such debt... (FMS) administrative offset program, to collect delinquent debts owed to the Federal Government. This...

  12. On Computing Breakpoint Distances for Genomes with Duplicate Genes.

    PubMed

    Shao, Mingfu; Moret, Bernard M E

    2017-06-01

    A fundamental problem in comparative genomics is to compute the distance between two genomes in terms of its higher level organization (given by genes or syntenic blocks). For two genomes without duplicate genes, we can easily define (and almost always efficiently compute) a variety of distance measures, but the problem is NP-hard under most models when genomes contain duplicate genes. To tackle duplicate genes, three formulations (exemplar, maximum matching, and any matching) have been proposed, all of which aim to build a matching between homologous genes so as to minimize some distance measure. Of the many distance measures, the breakpoint distance (the number of nonconserved adjacencies) was the first one to be studied and remains of significant interest because of its simplicity and model-free property. The three breakpoint distance problems corresponding to the three formulations have been widely studied. Although we provided last year a solution for the exemplar problem that runs very fast on full genomes, computing optimal solutions for the other two problems has remained challenging. In this article, we describe very fast, exact algorithms for these two problems. Our algorithms rely on a compact integer-linear program that we further simplify by developing an algorithm to remove variables, based on new results on the structure of adjacencies and matchings. Through extensive experiments using both simulations and biological data sets, we show that our algorithms run very fast (in seconds) on mammalian genomes and scale well beyond. We also apply these algorithms (as well as the classic orthology tool MSOAR) to create orthology assignment, then compare their quality in terms of both accuracy and coverage. We find that our algorithm for the "any matching" formulation significantly outperforms other methods in terms of accuracy while achieving nearly maximum coverage.

  13. Block matching sparsity regularization-based image reconstruction for incomplete projection data in computed tomography

    NASA Astrophysics Data System (ADS)

    Cai, Ailong; Li, Lei; Zheng, Zhizhong; Zhang, Hanming; Wang, Linyuan; Hu, Guoen; Yan, Bin

    2018-02-01

    In medical imaging many conventional regularization methods, such as total variation or total generalized variation, impose strong prior assumptions which can only account for very limited classes of images. A more reasonable sparse representation frame for images is still badly needed. Visually understandable images contain meaningful patterns, and combinations or collections of these patterns can be utilized to form some sparse and redundant representations which promise to facilitate image reconstructions. In this work, we propose and study block matching sparsity regularization (BMSR) and devise an optimization program using BMSR for computed tomography (CT) image reconstruction for an incomplete projection set. The program is built as a constrained optimization, minimizing the L1-norm of the coefficients of the image in the transformed domain subject to data observation and positivity of the image itself. To solve the program efficiently, a practical method based on the proximal point algorithm is developed and analyzed. In order to accelerate the convergence rate, a practical strategy for tuning the BMSR parameter is proposed and applied. The experimental results for various settings, including real CT scanning, have verified the proposed reconstruction method showing promising capabilities over conventional regularization.

  14. Basinsoft, a computer program to quantify drainage basin characteristics

    USGS Publications Warehouse

    Harvey, Craig A.; Eash, David A.

    2001-01-01

    In 1988, the USGS began developing a program called Basinsoft. The initial program quantified 16 selected drainage basin characteristics from three source-data layers that were manually digitized from topographic maps using the versions of ARC/INFO, Fortran programs, and prime system Command Programming Language (CPL) programs available in 1988 (Majure and Soenksen, 1991). By 1991, Basinsoft was enhanced to quantify 27 selected drainage-basin characteristics from three source-data layers automatically generated from digital elevation model (DEM) data using a set of Fortran programs (Majure and Eash, 1991: Jenson and Dominique, 1988). Due to edge-matching problems encountered in 1991 with the preprocessing

  15. The Use of Computer-Aided Decision Support Systems for Complex Source Selection Decisions

    DTIC Science & Technology

    1989-09-01

    unique low noise interferometer developed at Fusetech Inc. by using divided Fabry - Perot fiber optic cells, common- mode rejection, matched path lengths and...potential techniques for a demodulation scheme. They proposed a detailed investigation of the approaches as part of the program. For mine applications

  16. Southwell's Relaxation Search in Computer Aided Advising: An Intelligent Information System.

    ERIC Educational Resources Information Center

    Song, Xueshu

    1992-01-01

    Describes the development and validation of a microcomputer software system that enhances undergraduate students' interests in becoming engineering graduate students. The development of a database with information on engineering graduate programs is discussed, and a model that matches individual and institutional needs using Southwell's Relaxation…

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-05-02

    ...-federal systems of records are: 1. Alabama Department of Human Resources. 2. Alabama Medicaid Agency. 3... Department of Human Resources. 13. Hawaii Department of Human Services. 14. Idaho Department of Health and... of Human Services. 41. Ohio Department of Job and Family Services. 42. Oklahoma Department of Human...

  18. 13 CFR 102.40 - Computer matching.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... Protection of Privacy and Access to Individual Records Under the Privacy Act of 1974 § 102.40 Computer...) Matching agreements. SBA will comply with the Computer Matching and Privacy Protection Act of 1988 (5 U.S.C... 13 Business Credit and Assistance 1 2013-01-01 2013-01-01 false Computer matching. 102.40 Section...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-12-09

    ... 1974 (5 U.S.C. 552a), as amended by the Computer Matching and Privacy Protection Act of 1988 (Pub. L... DEPARTMENT OF JUSTICE [AAG/A Order No. 001/2011] Privacy Act of 1974; Computer Matching Agreement AGENCY: Department of Justice. ACTION: Notice--computer matching between the Department of Justice and...

  20. 13 CFR 102.40 - Computer matching.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... Protection of Privacy and Access to Individual Records Under the Privacy Act of 1974 § 102.40 Computer...) Matching agreements. SBA will comply with the Computer Matching and Privacy Protection Act of 1988 (5 U.S.C... 13 Business Credit and Assistance 1 2014-01-01 2014-01-01 false Computer matching. 102.40 Section...

  1. 13 CFR 102.40 - Computer matching.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... Protection of Privacy and Access to Individual Records Under the Privacy Act of 1974 § 102.40 Computer...) Matching agreements. SBA will comply with the Computer Matching and Privacy Protection Act of 1988 (5 U.S.C... 13 Business Credit and Assistance 1 2010-01-01 2010-01-01 false Computer matching. 102.40 Section...

  2. 13 CFR 102.40 - Computer matching.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... Protection of Privacy and Access to Individual Records Under the Privacy Act of 1974 § 102.40 Computer...) Matching agreements. SBA will comply with the Computer Matching and Privacy Protection Act of 1988 (5 U.S.C... 13 Business Credit and Assistance 1 2011-01-01 2011-01-01 false Computer matching. 102.40 Section...

  3. 13 CFR 102.40 - Computer matching.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... Protection of Privacy and Access to Individual Records Under the Privacy Act of 1974 § 102.40 Computer...) Matching agreements. SBA will comply with the Computer Matching and Privacy Protection Act of 1988 (5 U.S.C... 13 Business Credit and Assistance 1 2012-01-01 2012-01-01 false Computer matching. 102.40 Section...

  4. Parallel simulations of Grover's algorithm for closest match search in neutron monitor data

    NASA Astrophysics Data System (ADS)

    Kussainov, Arman; White, Yelena

    We are studying the parallel implementations of Grover's closest match search algorithm for neutron monitor data analysis. This includes data formatting, and matching quantum parameters to a conventional structure of a chosen programming language and selected experimental data type. We have employed several workload distribution models based on acquired data and search parameters. As a result of these simulations, we have an understanding of potential problems that may arise during configuration of real quantum computational devices and the way they could run tasks in parallel. The work was supported by the Science Committee of the Ministry of Science and Education of the Republic of Kazakhstan Grant #2532/GF3.

  5. Feasibility study of an Integrated Program for Aerospace vehicle Design (IPAD). Volume 1A: Summary

    NASA Technical Reports Server (NTRS)

    Miller, R. E., Jr.; Redhed, D. D.; Kawaguchi, A. S.; Hansen, S. D.; Southall, J. W.

    1973-01-01

    IPAD was defined as a total system oriented to the product design process. This total system was designed to recognize the product design process, individuals and their design process tasks, and the computer-based IPAD System to aid product design. Principal elements of the IPAD System include the host computer and its interactive system software, new executive and data management software, and an open-ended IPAD library of technical programs to match the intended product design process. The basic goal of the IPAD total system is to increase the productivity of the product design organization. Increases in individual productivity were feasible through automation and computer support of routine information handling. Such proven automation can directly decrease cost and flowtime in the product design process.

  6. Enhanced Graphics for Extended Scale Range

    NASA Technical Reports Server (NTRS)

    Hanson, Andrew J.; Chi-Wing Fu, Philip

    2012-01-01

    Enhanced Graphics for Extended Scale Range is a computer program for rendering fly-through views of scene models that include visible objects differing in size by large orders of magnitude. An example would be a scene showing a person in a park at night with the moon, stars, and galaxies in the background sky. Prior graphical computer programs exhibit arithmetic and other anomalies when rendering scenes containing objects that differ enormously in scale and distance from the viewer. The present program dynamically repartitions distance scales of objects in a scene during rendering to eliminate almost all such anomalies in a way compatible with implementation in other software and in hardware accelerators. By assigning depth ranges correspond ing to rendering precision requirements, either automatically or under program control, this program spaces out object scales to match the precision requirements of the rendering arithmetic. This action includes an intelligent partition of the depth buffer ranges to avoid known anomalies from this source. The program is written in C++, using OpenGL, GLUT, and GLUI standard libraries, and nVidia GEForce Vertex Shader extensions. The program has been shown to work on several computers running UNIX and Windows operating systems.

  7. Solar electric propulsion thrust subsystem development

    NASA Technical Reports Server (NTRS)

    Masek, T. D.

    1973-01-01

    The Solar Electric Propulsion System developed under this program was designed to demonstrate all the thrust subsystem functions needed on an unmanned planetary vehicle. The demonstration included operation of the basic elements, power matching input and output voltage regulation, three-axis thrust vector control, subsystem automatic control including failure detection and correction capability (using a PDP-11 computer), operation of critical elements in thermal-vacuum-, zero-gravity-type propellant storage, and data outputs from all subsystem elements. The subsystem elements, functions, unique features, and test setup are described. General features and capabilities of the test-support data system are also presented. The test program culminated in a 1500-h computer-controlled, system-functional demonstration. This included simultaneous operation of two thruster/power conditioner sets. The results of this testing phase satisfied all the program goals.

  8. A Computerized Lifestyle Application to Promote Multiple Health Behaviors at the Workplace: Testing Its Behavioral and Psychological Effects

    PubMed Central

    Fleig, Lena; Wiedemann, Amelie U; Schwarzer, Ralf

    2015-01-01

    Background Preventive health behaviors, such as regular physical activity and healthy nutrition, are recommended to maintain employability and to facilitate the health of employees. Theory-based workplace health promotion needs to include psychological constructs and consider the motivational readiness (so-called stages of change) of employees. According to the stages, people can be grouped as nonintenders (not motivated to change and not performing the goal behavior), intenders (decided to adopt the goal behavior but not started yet), or actors (performing the goal behavior already). The tailoring to these stages can be done computer based and should make workplace health promotion more effective. Objective It was tested whether a parsimonious computer-based health promotion program implemented at the workplace was effective in terms of lifestyle changes and psychological outcomes as well as body weight. We hypothesized that the stage-matched intervention would outperform the one-size-fits-all active control condition (standard care intervention). Methods In a randomized controlled trial, a total of 1269 employees were recruited by a trained research assistant at their workplace during a routine medical examination. After excluding noneligible employees, 560 completed Time 1 (T1), and 384 also completed Time 2 (T2), achieving a retention rate of 68.6%. Two fully automated computer-based treatments were adopted: (1) an active control condition with information about benefits of exercise and healthy nutrition (n=52), or (2) a stage-matched multiple-behavior intervention that provided different psychological treatments to 9 subgroups, addressing stages of change (nonintenders, intenders, and actors per behavior; n=332). Baseline assessments (T1) on behavior, psychological constructs, and body weight were repeated after 4 weeks (T2). Results The stage-matched intervention outperformed the active control condition for lifestyle changes containing physical activity and nutrition (χ2 1=3.5; P=.04, for N=384) as well as psychological variables (physical activity intention, P=.04; nutrition intention, P=.03; nutrition planning, P=.02; and general social support to live healthily, P=.01). When predicting a healthy lifestyle at follow-up, baseline lifestyle (odds ratio, OR, 2.25, 95% CI 1.73-2.92; P<.01) and the intervention (OR 1.96, 95% CI 1.00-3.82; P=.05) were found to be significant predictors. Physical activity planning mediated the effect of the intervention on the adoption of an overall healthy lifestyle (consisting of activity and nutrition, R 2 adj=.08; P<.01), indicating that if the stage-matched intervention increased planning, the adoption of a healthy lifestyle was more likely. Conclusions Matching an intervention to the motivational readiness of employees can make a health promotion program effective. Employees’ motivation, planning, social support, and lifestyle can be supported by a stage-matched intervention that focuses on both physical activity and healthy nutrition. Occupational settings provide a potential to implement parsimonious computer-based health promotion programs and to facilitate multiple behavior change. PMID:26429115

  9. A Computerized Lifestyle Application to Promote Multiple Health Behaviors at the Workplace: Testing Its Behavioral and Psychological Effects.

    PubMed

    Lippke, Sonia; Fleig, Lena; Wiedemann, Amelie U; Schwarzer, Ralf

    2015-10-01

    Preventive health behaviors, such as regular physical activity and healthy nutrition, are recommended to maintain employability and to facilitate the health of employees. Theory-based workplace health promotion needs to include psychological constructs and consider the motivational readiness (so-called stages of change) of employees. According to the stages, people can be grouped as nonintenders (not motivated to change and not performing the goal behavior), intenders (decided to adopt the goal behavior but not started yet), or actors (performing the goal behavior already). The tailoring to these stages can be done computer based and should make workplace health promotion more effective. It was tested whether a parsimonious computer-based health promotion program implemented at the workplace was effective in terms of lifestyle changes and psychological outcomes as well as body weight. We hypothesized that the stage-matched intervention would outperform the one-size-fits-all active control condition (standard care intervention). In a randomized controlled trial, a total of 1269 employees were recruited by a trained research assistant at their workplace during a routine medical examination. After excluding noneligible employees, 560 completed Time 1 (T1), and 384 also completed Time 2 (T2), achieving a retention rate of 68.6%. Two fully automated computer-based treatments were adopted: (1) an active control condition with information about benefits of exercise and healthy nutrition (n=52), or (2) a stage-matched multiple-behavior intervention that provided different psychological treatments to 9 subgroups, addressing stages of change (nonintenders, intenders, and actors per behavior; n=332). Baseline assessments (T1) on behavior, psychological constructs, and body weight were repeated after 4 weeks (T2). The stage-matched intervention outperformed the active control condition for lifestyle changes containing physical activity and nutrition (χ(2) 1=3.5; P=.04, for N=384) as well as psychological variables (physical activity intention, P=.04; nutrition intention, P=.03; nutrition planning, P=.02; and general social support to live healthily, P=.01). When predicting a healthy lifestyle at follow-up, baseline lifestyle (odds ratio, OR, 2.25, 95% CI 1.73-2.92; P<.01) and the intervention (OR 1.96, 95% CI 1.00-3.82; P=.05) were found to be significant predictors. Physical activity planning mediated the effect of the intervention on the adoption of an overall healthy lifestyle (consisting of activity and nutrition, R(2) adj=.08; P<.01), indicating that if the stage-matched intervention increased planning, the adoption of a healthy lifestyle was more likely. Matching an intervention to the motivational readiness of employees can make a health promotion program effective. Employees' motivation, planning, social support, and lifestyle can be supported by a stage-matched intervention that focuses on both physical activity and healthy nutrition. Occupational settings provide a potential to implement parsimonious computer-based health promotion programs and to facilitate multiple behavior change.

  10. 75 FR 30915 - Computer Matching Program Between the Department of Veterans Affairs (VA) and the Department of...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-06-02

    ..., and reservists, and eligible dependents who have applied for or who are receiving education benefit... Leader, Education Service, Veterans Benefits Administration, Department of Veterans Affairs, 810 Vermont... receiving, or have received education benefit payments under the Post-9/11 GI Bill. These benefit records...

  11. What Does Quality Programming Mean for High Achieving Students?

    ERIC Educational Resources Information Center

    Samudzi, Cleo

    2008-01-01

    The Missouri Academy of Science, Mathematics and Computing (Missouri Academy) is a two-year accelerated, early-entrance-to-college, residential school that matches the level, complexity and pace of the curriculum with the readiness and motivation of high achieving high school students. The school is a part of Northwest Missouri State University…

  12. Matching Feedback and Cognitive Style in Visual CAI Tasks.

    ERIC Educational Resources Information Center

    Hedberg, John G.; McNamara, Suzanne E.

    The effects of different types of feedback in computer assisted instruction were studied in 30 college students with different cognitive styles. The program, written in Apple Pilot and administered on an Apple IIE microcomputer, consisted of 16 problem solving tasks; for each, a graphic display and a textual question were presented. Two feedback…

  13. Using Robot Animation to Promote Gestural Skills in Children with Autism Spectrum Disorders

    ERIC Educational Resources Information Center

    So, W.-C.; Wong, M. K.-Y.; Cabibihan, J.-J.; Lam, C. K.-Y.; Chan, R. Y.-Y.; Qian, H.-H.

    2016-01-01

    School-aged children with autism spectrum disorders (ASDs) have delayed gestural development, in comparison with age-matched typically developing children. In this study, an intervention program taught children with low-functioning ASD gestural comprehension and production using video modelling (VM) by a computer-generated robot animation. Six to…

  14. Reliability of lower limb alignment measures using an established landmark-based method with a customized computer software program

    PubMed Central

    Sled, Elizabeth A.; Sheehy, Lisa M.; Felson, David T.; Costigan, Patrick A.; Lam, Miu; Cooke, T. Derek V.

    2010-01-01

    The objective of the study was to evaluate the reliability of frontal plane lower limb alignment measures using a landmark-based method by (1) comparing inter- and intra-reader reliability between measurements of alignment obtained manually with those using a computer program, and (2) determining inter- and intra-reader reliability of computer-assisted alignment measures from full-limb radiographs. An established method for measuring alignment was used, involving selection of 10 femoral and tibial bone landmarks. 1) To compare manual and computer methods, we used digital images and matching paper copies of five alignment patterns simulating healthy and malaligned limbs drawn using AutoCAD. Seven readers were trained in each system. Paper copies were measured manually and repeat measurements were performed daily for 3 days, followed by a similar routine with the digital images using the computer. 2) To examine the reliability of computer-assisted measures from full-limb radiographs, 100 images (200 limbs) were selected as a random sample from 1,500 full-limb digital radiographs which were part of the Multicenter Osteoarthritis (MOST) Study. Three trained readers used the software program to measure alignment twice from the batch of 100 images, with two or more weeks between batch handling. Manual and computer measures of alignment showed excellent agreement (intraclass correlations [ICCs] 0.977 – 0.999 for computer analysis; 0.820 – 0.995 for manual measures). The computer program applied to full-limb radiographs produced alignment measurements with high inter- and intra-reader reliability (ICCs 0.839 – 0.998). In conclusion, alignment measures using a bone landmark-based approach and a computer program were highly reliable between multiple readers. PMID:19882339

  15. Technology advances and market forces: Their impact on high performance architectures

    NASA Technical Reports Server (NTRS)

    Best, D. R.

    1978-01-01

    Reasonable projections into future supercomputer architectures and technology require an analysis of the computer industry market environment, the current capabilities and trends within the component industry, and the research activities on computer architecture in the industrial and academic communities. Management, programmer, architect, and user must cooperate to increase the efficiency of supercomputer development efforts. Care must be taken to match the funding, compiler, architecture and application with greater attention to testability, maintainability, reliability, and usability than supercomputer development programs of the past.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-08-07

    ...), Defense Manpower Data Center (DMDC) and the Office of the Assistant Secretary of Defense (Health Affairs.../TRICARE. DMDC will receive the results of the computer match and provide the information to TMA for use in...

  17. KONFIG and REKONFIG: Two interactive preprocessing to the Navy/NASA Engine Program (NNEP)

    NASA Technical Reports Server (NTRS)

    Fishbach, L. H.

    1981-01-01

    The NNEP is a computer program that is currently being used to simulate the thermodynamic cycle performance of almost all types of turbine engines by many government, industry, and university personnel. The NNEP uses arrays of input data to set up the engine simulation and component matching method as well as to describe the characteristics of the components. A preprocessing program (KONFIG) is described in which the user at a terminal on a time shared computer can interactively prepare the arrays of data required. It is intended to make it easier for the occasional or new user to operate NNEP. Another preprocessing program (REKONFIG) in which the user can modify the component specifications of a previously configured NNEP dataset is also described. It is intended to aid in preparing data for parametric studies and/or studies of similar engines such a mixed flow turbofans, turboshafts, etc.

  18. 41 CFR 105-56.017 - Centralized salary offset computer match.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... offset computer match. 105-56.017 Section 105-56.017 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  19. 41 CFR 105-56.017 - Centralized salary offset computer match.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... offset computer match. 105-56.017 Section 105-56.017 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  20. 41 CFR 105-56.027 - Centralized salary offset computer match.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... offset computer match. 105-56.027 Section 105-56.027 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  1. 41 CFR 105-56.017 - Centralized salary offset computer match.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... offset computer match. 105-56.017 Section 105-56.017 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  2. 41 CFR 105-56.027 - Centralized salary offset computer match.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... offset computer match. 105-56.027 Section 105-56.027 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  3. 41 CFR 105-56.027 - Centralized salary offset computer match.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... offset computer match. 105-56.027 Section 105-56.027 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  4. 41 CFR 105-56.027 - Centralized salary offset computer match.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... offset computer match. 105-56.027 Section 105-56.027 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  5. 41 CFR 105-56.027 - Centralized salary offset computer match.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... offset computer match. 105-56.027 Section 105-56.027 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  6. 41 CFR 105-56.017 - Centralized salary offset computer match.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... offset computer match. 105-56.017 Section 105-56.017 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  7. 41 CFR 105-56.017 - Centralized salary offset computer match.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... offset computer match. 105-56.017 Section 105-56.017 Public Contracts and Property Management Federal... computer match. (a) Delinquent debt records will be compared with Federal employee records maintained by... a delegation of authority from the Secretary, has waived certain requirements of the Computer...

  8. 76 FR 31317 - Privacy Act of 1974, as Amended; Computer Matching Program

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-05-31

    ... document is the document published in the Federal Register. Free Internet access to the official edition of... document is the document published in the Federal Register. Free Internet access to the official edition of... Service (FRS), toll free, at 1-800-877-8339. Individuals with disabilities can obtain this document in an...

  9. Selecting reference cities for i-Tree Streets

    Treesearch

    E.G. McPherson

    2010-01-01

    The i-Tree Streets (formerly STRATUM) computer program quantifies municipal forest structure, function, and value using tree growth and geographic data from sixteen U.S. reference cities, one for each of sixteen climate zones. Selecting the reference city that best matches a subject city is problematic when the subject city is outside the U.S., lays on the border...

  10. RF Antenna Design for a Helicon Plasma Source

    NASA Astrophysics Data System (ADS)

    Godden, Katarina; Stassel, Brendan; Warta, Daniel; Yep, Isaac; Hicks, Nathaniel; Munk, Jens

    2017-10-01

    A helicon plasma source is under development for the new Plasma Science and Engineering Laboratory at the University of Alaska Anchorage. The helicon source is of a type comprising Pyrex and stainless steel cylindrical sections, joined to an ultrahigh vacuum chamber. A radio frequency (RF) helical antenna surrounds the Pyrex chamber, as well as DC solenoidal magnetic field coils. This presentation focuses on the design of the RF helical antenna and RF matching network, such that helicon wave power is coupled to argon plasma with minimal reflected power to the RF amplifier. The amplifier output is selectable between 2-30 MHz, with forward c.w. power up to 1.5 kW. Details and computer simulation of the antenna geometry, materials, and power matching will be presented, as well as the matching network of RF transmission line, tuning capacitors, and cooling system. An initial computational study of power coupling to the plasma will also be described. Supported by U.S. NSF/DOE Partnership in Basic Plasma Science and Engineering Grant PHY-1619615, by the Alaska Space Grant Program, and by UAA Innovate 2017.

  11. Data Structures for Extreme Scale Computing

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Kahan, Simon

    As computing problems of national importance grow, the government meets the increased demand by funding the development of ever larger systems. The overarching goal of the work supported in part by this grant is to increase efficiency of programming and performing computations on these large computing systems. In past work, we have demonstrated that some of these computations once thought to require expensive hardware designs and/or complex, special-purpose programming may be executed efficiently on low-cost commodity cluster computing systems using a general-purpose “latency-tolerant” programming framework. One important developed application of the ideas underlying this framework is graph database technology supportingmore » social network pattern matching used by US intelligence agencies to more quickly identify potential terrorist threats. This database application has been spun out by the Pacific Northwest National Laboratory, a Department of Energy Laboratory, into a commercial start-up, Trovares Inc. We explore an alternative application of the same underlying ideas to a well-studied challenge arising in engineering: solving unstructured sparse linear equations. Solving these equations is key to predicting the behavior of large electronic circuits before they are fabricated. Predicting that behavior ahead of fabrication means that designs can optimized and errors corrected ahead of the expense of manufacture.« less

  12. Outcomes in the Orthopaedic Sports Medicine Fellowship Match, 2010-2017.

    PubMed

    Mulcahey, Mary K; Hayes, Meghan K; Smith, Christopher M; Kraeutler, Matthew J; Trojan, Jeffrey D; McCarty, Eric C

    2018-05-01

    Sports medicine is one of the most competitive fellowships in orthopaedic surgery. Despite its popularity, fellowship applicants have limited understanding of the orthopaedic sports medicine fellowship match process. To define key outcomes in the orthopaedic sports medicine fellowship match, including the overall match rate, number of programs filled, and number of applicants ranked by programs that filled between 2010 and 2017. Cross-sectional study. This study utilized data regarding the orthopaedic sports medicine fellowship match collected by the American Orthopaedic Society for Sports Medicine (AOSSM) from 2010 through 2017. Applicant data included number of applicants, number of matched and unmatched applicants, and percentage of applicants matching into their top choices. Fellowship program data included number of programs participating in the match and number of applicants ranked by filled and unfilled programs. Between 2010 and 2017, the mean number of orthopaedic sports medicine fellowship applicants was 244.8. On average, 92.0% of applicants matched into a fellowship program. The mean number of programs participating in the fellowship match was 92.9, with a mean of 219.9 accredited positions and 5.4 nonaccredited positions. Over the time period studied, a mean of 75.8% of programs matched all available positions. Programs that matched fully ranked 9.0 applicants per position, on average, compared with a mean of 6.5 applicants ranked per position among programs that did not fully match ( P = .0016). From 2010 to 2017, the number of applicants, positions available, overall match rate, and number of programs participating in the orthopaedic sports medicine fellowship match have remained consistent. The mean number of applicants per position ranked by fully matched fellowship programs was 9.0 compared with a mean of 6.5 applicants per position ranked by programs that did not fully match. These data may be helpful as we look to the future of orthopaedic sports medicine fellowship positions and the match process. In addition, this study reveals characteristics that divide sports medicine fellowship programs that fully match from those that do not. Applicants and/or fellowship program directors may utilize this information to modify their approach to the match process going forward.

  13. Outcomes in the Orthopaedic Sports Medicine Fellowship Match, 2010-2017

    PubMed Central

    Mulcahey, Mary K.; Hayes, Meghan K.; Smith, Christopher M.; Kraeutler, Matthew J.; Trojan, Jeffrey D.; McCarty, Eric C.

    2018-01-01

    Background: Sports medicine is one of the most competitive fellowships in orthopaedic surgery. Despite its popularity, fellowship applicants have limited understanding of the orthopaedic sports medicine fellowship match process. Purpose: To define key outcomes in the orthopaedic sports medicine fellowship match, including the overall match rate, number of programs filled, and number of applicants ranked by programs that filled between 2010 and 2017. Study Design: Cross-sectional study. Methods: This study utilized data regarding the orthopaedic sports medicine fellowship match collected by the American Orthopaedic Society for Sports Medicine (AOSSM) from 2010 through 2017. Applicant data included number of applicants, number of matched and unmatched applicants, and percentage of applicants matching into their top choices. Fellowship program data included number of programs participating in the match and number of applicants ranked by filled and unfilled programs. Results: Between 2010 and 2017, the mean number of orthopaedic sports medicine fellowship applicants was 244.8. On average, 92.0% of applicants matched into a fellowship program. The mean number of programs participating in the fellowship match was 92.9, with a mean of 219.9 accredited positions and 5.4 nonaccredited positions. Over the time period studied, a mean of 75.8% of programs matched all available positions. Programs that matched fully ranked 9.0 applicants per position, on average, compared with a mean of 6.5 applicants ranked per position among programs that did not fully match (P = .0016). Conclusion: From 2010 to 2017, the number of applicants, positions available, overall match rate, and number of programs participating in the orthopaedic sports medicine fellowship match have remained consistent. The mean number of applicants per position ranked by fully matched fellowship programs was 9.0 compared with a mean of 6.5 applicants per position ranked by programs that did not fully match. These data may be helpful as we look to the future of orthopaedic sports medicine fellowship positions and the match process. In addition, this study reveals characteristics that divide sports medicine fellowship programs that fully match from those that do not. Applicants and/or fellowship program directors may utilize this information to modify their approach to the match process going forward. PMID:29796398

  14. The prediction in computer color matching of dentistry based on GA+BP neural network.

    PubMed

    Li, Haisheng; Lai, Long; Chen, Li; Lu, Cheng; Cai, Qiang

    2015-01-01

    Although the use of computer color matching can reduce the influence of subjective factors by technicians, matching the color of a natural tooth with a ceramic restoration is still one of the most challenging topics in esthetic prosthodontics. Back propagation neural network (BPNN) has already been introduced into the computer color matching in dentistry, but it has disadvantages such as unstable and low accuracy. In our study, we adopt genetic algorithm (GA) to optimize the initial weights and threshold values in BPNN for improving the matching precision. To our knowledge, we firstly combine the BPNN with GA in computer color matching in dentistry. Extensive experiments demonstrate that the proposed method improves the precision and prediction robustness of the color matching in restorative dentistry.

  15. An analytical model for highly seperated flow on airfoils at low speeds

    NASA Technical Reports Server (NTRS)

    Zunnalt, G. W.; Naik, S. N.

    1977-01-01

    A computer program was developed to solve the low speed flow around airfoils with highly separated flow. A new flow model included all of the major physical features in the separated region. Flow visualization tests also were made which gave substantiation to the validity of the model. The computation involves the matching of the potential flow, boundary layer and flows in the separated regions. Head's entrainment theory was used for boundary layer calculations and Korst's jet mixing analysis was used in the separated regions. A free stagnation point aft of the airfoil and a standing vortex in the separated region were modelled and computed.

  16. 31 CFR 285.7 - Salary offset.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... Secretary, has waived certain requirements of the Computer Matching and Privacy Protection Act of 1988, 5 U... process known as centralized salary offset computer matching, identify Federal employees who owe delinquent nontax debt to the United States. Centralized salary offset computer matching is the computerized...

  17. Changeable camouflage: how well can flounder resemble the colour and spatial scale of substrates in their natural habitats?

    PubMed Central

    Akkaynak, Derya; Siemann, Liese A.; Barbosa, Alexandra

    2017-01-01

    Flounder change colour and pattern for camouflage. We used a spectrometer to measure reflectance spectra and a digital camera to capture body patterns of two flounder species camouflaged on four natural backgrounds of different spatial scale (sand, small gravel, large gravel and rocks). We quantified the degree of spectral match between flounder and background relative to the situation of perfect camouflage in which flounder and background were assumed to have identical spectral distribution. Computations were carried out for three biologically relevant observers: monochromatic squid, dichromatic crab and trichromatic guitarfish. Our computations present a new approach to analysing datasets with multiple spectra that have large variance. Furthermore, to investigate the spatial match between flounder and background, images of flounder patterns were analysed using a custom program originally developed to study cuttlefish camouflage. Our results show that all flounder and background spectra fall within the same colour gamut and that, in terms of different observer visual systems, flounder matched most substrates in luminance and colour contrast. Flounder matched the spatial scales of all substrates except for rocks. We discuss findings in terms of flounder biology; furthermore, we discuss our methodology in light of hyperspectral technologies that combine high-resolution spectral and spatial imaging. PMID:28405370

  18. Changeable camouflage: how well can flounder resemble the colour and spatial scale of substrates in their natural habitats?

    PubMed

    Akkaynak, Derya; Siemann, Liese A; Barbosa, Alexandra; Mäthger, Lydia M

    2017-03-01

    Flounder change colour and pattern for camouflage. We used a spectrometer to measure reflectance spectra and a digital camera to capture body patterns of two flounder species camouflaged on four natural backgrounds of different spatial scale (sand, small gravel, large gravel and rocks). We quantified the degree of spectral match between flounder and background relative to the situation of perfect camouflage in which flounder and background were assumed to have identical spectral distribution. Computations were carried out for three biologically relevant observers: monochromatic squid, dichromatic crab and trichromatic guitarfish. Our computations present a new approach to analysing datasets with multiple spectra that have large variance. Furthermore, to investigate the spatial match between flounder and background, images of flounder patterns were analysed using a custom program originally developed to study cuttlefish camouflage. Our results show that all flounder and background spectra fall within the same colour gamut and that, in terms of different observer visual systems, flounder matched most substrates in luminance and colour contrast. Flounder matched the spatial scales of all substrates except for rocks. We discuss findings in terms of flounder biology; furthermore, we discuss our methodology in light of hyperspectral technologies that combine high-resolution spectral and spatial imaging.

  19. Geographic Trends in the Plastic Surgery Match.

    PubMed

    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.

  20. Report: NSF Instrumentation and Laboratory Improvement Grants in Chemistry

    NASA Astrophysics Data System (ADS)

    1997-01-01

    The 1996 awards in chemistry under the Instrumentation and Laboratory Improvement Program (ILI) of the Division of Undergraduate Education (DUE) have been announced and are listed below. The ILI program provides matching funds in the range of 5,000 to 100,000 for purchasing equipment for laboratory improvement. Since the recipient institution must provide matching funds equaling or exceeding the NSF award, the supported projects range in cost from 10,000 to over 200,000. The 311 chemistry proposals requesting 13 million constituted 21% of the total number of proposals submitted to the ILI program. A total of 3.9 million was awarded in support of 110 projects in chemistry. The instruments requested most frequently were high field NMRs, GC/MS instruments, computers for data analysis, and FT-IRs; next most commonly requested were UV-vis spectrophotometers, followed by HPLCs, lasers, computers for molecular modeling, AAs, and GCs. In addition, one award was made this year in chemistry within the Leadership in Laboratory Development category. The next deadline for submission of ILI proposals is November 14, 1997. Guidelines for the preparation of proposals are found in the DUE Program Announcement (NSF 96-10), which may be obtained by calling (703) 306-1666 or by e-mail: undergrad@nsf.gov. Other information about DUE programs and activities and abstracts of the funded proposals can be found on the DUE Home Page at http://www.ehr.nsf.gov/EHR/DUE/start.htm. We thank Sandra D. Nelson, Science Education Analyst in DUE, for assistance in data gathering.

  1. 31 CFR 285.7 - Salary offset.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... requirements of the Computer Matching and Privacy Protection Act of 1988, 5 U.S.C. 552a, as amended, for... known as centralized salary offset computer matching, identify Federal employees who owe delinquent nontax debt to the United States. Centralized salary offset computer matching is the computerized...

  2. 31 CFR 285.7 - Salary offset.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... requirements of the Computer Matching and Privacy Protection Act of 1988, 5 U.S.C. 552a, as amended, for... known as centralized salary offset computer matching, identify Federal employees who owe delinquent nontax debt to the United States. Centralized salary offset computer matching is the computerized...

  3. 31 CFR 285.7 - Salary offset.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... requirements of the Computer Matching and Privacy Protection Act of 1988, 5 U.S.C. 552a, as amended, for... known as centralized salary offset computer matching, identify Federal employees who owe delinquent nontax debt to the United States. Centralized salary offset computer matching is the computerized...

  4. 31 CFR 285.7 - Salary offset.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... requirements of the Computer Matching and Privacy Protection Act of 1988, 5 U.S.C. 552a, as amended, for... known as centralized salary offset computer matching, identify Federal employees who owe delinquent nontax debt to the United States. Centralized salary offset computer matching is the computerized...

  5. Matching pursuit parallel decomposition of seismic data

    NASA Astrophysics Data System (ADS)

    Li, Chuanhui; Zhang, Fanchang

    2017-07-01

    In order to improve the computation speed of matching pursuit decomposition of seismic data, a matching pursuit parallel algorithm is designed in this paper. We pick a fixed number of envelope peaks from the current signal in every iteration according to the number of compute nodes and assign them to the compute nodes on average to search the optimal Morlet wavelets in parallel. With the help of parallel computer systems and Message Passing Interface, the parallel algorithm gives full play to the advantages of parallel computing to significantly improve the computation speed of the matching pursuit decomposition and also has good expandability. Besides, searching only one optimal Morlet wavelet by every compute node in every iteration is the most efficient implementation.

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

    PubMed Central

    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

  7. 78 FR 54875 - Privacy Act of 1974; Computer Matching Program Between the Department of Education (ED) and the...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-09-06

    ....C. 1091(g) and (p). SSA will verify the issuance of an SSN to, and will confirm the citizenship... verifying the accuracy of each individual's SSN and claim to a citizenship status that permits that... the Code of Federal Regulations is available via the Federal Digital System at: www.gpo.gov/fsys . At...

  8. 76 FR 67257 - Computer Matching Program Between the Department of Veterans Affairs (VA) and the Department of...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-10-31

    ... for or who are receiving education benefit payments under the Montgomery GI Bill. The purpose of the... for and/or are receiving, or have received education benefit payments under the Post-9/11 GI Bill... of Defense with VA records of benefit recipients under the Montgomery GI Bill. The goal of these...

  9. SDI Software Technology Program Plan Version 1.5

    DTIC Science & Technology

    1987-06-01

    computer generation of auditory communication of meaningful speech. Most speech synthesizers are based on mathematical models of the human vocal tract, but...oral/ auditory and multimodal communications. Although such state-of-the-art interaction technology has not fully matured, user experience has...superior I pattern matching capabilities and the subliminal intuitive deduction capability. The error performance of humans can be helped by careful

  10. Using a Serious Game Approach to Teach Secure Coding in Introductory Programming: Development and Initial Findings

    ERIC Educational Resources Information Center

    Adamo-Villani, Nicoletta; Oania, Marcus; Cooper, Stephen

    2013-01-01

    We report the development and initial evaluation of a serious game that, in conjunction with appropriately designed matching laboratory exercises, can be used to teach secure coding and Information Assurance (IA) concepts across a range of introductory computing courses. The IA Game is a role-playing serious game (RPG) in which the student travels…

  11. 78 FR 11815 - Creation of a New Computer Matching Program That Will Expire on August 13, 2014

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-02-20

    ... Applications, SSA/OEEAS, 60-0058, full text published at 71 FR 1815 (January 11, 2006); the Master Beneficiary Record, SSA/ ORSIS 60-0090, full text published at 71 FR 1826 (January 11, 2006); and Supplemental Security Income and Special Veterans Benefits SSA/ ODSSIS, 60-0103, full text published at 71 FR 1826...

  12. The Computer-Assisted Brief Intervention for Tobacco (CABIT) program: a pilot study.

    PubMed

    Boudreaux, Edwin D; Bedek, Kristyna L; Byrne, Nelson J; Baumann, Brigitte M; Lord, Sherrill A; Grissom, Grant

    2012-12-03

    Health care providers do not routinely carry out brief counseling for tobacco cessation despite the evidence for its effectiveness. For this intervention to be routinely used, it must be brief, be convenient, require little investment of resources, require little specialized training, and be perceived as efficacious by providers. Technological advances hold much potential for addressing the barriers preventing the integration of brief interventions for tobacco cessation into the health care setting. This paper describes the development and initial evaluation of the Computer-Assisted Brief Intervention for Tobacco (CABIT) program, a web-based, multimedia tobacco intervention for use in opportunistic settings. The CABIT uses a self-administered, computerized assessment to produce personalized health care provider and patient reports, and cue a stage-matched video intervention. Respondents interested in changing their tobacco use are offered a faxed referral to a "best matched" tobacco treatment provider (ie, dynamic referral). During 2008, the CABIT program was evaluated in an emergency department, an employee assistance program, and a tobacco dependence program in New Jersey. Participants and health care providers completed semistructured interviews and satisfaction ratings of the assessment, reports, video intervention, and referrals using a 5-point scale. Mean patient satisfaction scores (n = 67) for all domains ranged from 4.00 (Good) to 5.00 (Excellent; Mean = 4.48). Health care providers completed satisfaction forms for 39 patients. Of these 39 patients, 34 (87%) received tobacco resources and referrals they would not have received under standard care. Of the 45 participants offered a dynamic referral, 28 (62%) accepted. The CABIT program provided a user-friendly, desirable service for tobacco users and their health care providers. Further development and clinical trial testing is warranted to establish its effectiveness in promoting treatment engagement and tobacco cessation.

  13. Real-time simulation of the TF30-P-3 turbofan engine using a hybrid computer

    NASA Technical Reports Server (NTRS)

    Szuch, J. R.; Bruton, W. M.

    1974-01-01

    A real-time, hybrid-computer simulation of the TF30-P-3 turbofan engine was developed. The simulation was primarily analog in nature but used the digital portion of the hybrid computer to perform bivariate function generation associated with the performance of the engine's rotating components. FORTRAN listings and analog patching diagrams are provided. The hybrid simulation was controlled by a digital computer programmed to simulate the engine's standard hydromechanical control. Both steady-state and dynamic data obtained from the digitally controlled engine simulation are presented. Hybrid simulation data are compared with data obtained from a digital simulation provided by the engine manufacturer. The comparisons indicate that the real-time hybrid simulation adequately matches the baseline digital simulation.

  14. A computer program (MACPUMP) for interactive aquifer-test analysis

    USGS Publications Warehouse

    Day-Lewis, F. D.; Person, M.A.; Konikow, Leonard F.

    1995-01-01

    This report introduces MACPUMP (Version 1.0), an aquifer-test-analysis package for use with Macintosh4 computers. The report outlines the input- data format, describes the solutions encoded in the program, explains the menu-items, and offers a tutorial illustrating the use of the program. The package reads list-directed aquifer-test data from a file, plots the data to the screen, generates and plots type curves for several different test conditions, and allows mouse-controlled curve matching. MACPUMP features pull-down menus, a simple text viewer for displaying data-files, and optional on-line help windows. This version includes the analytical solutions for nonleaky and leaky confined aquifers, using both type curves and straight-line methods, and for the analysis of single-well slug tests using type curves. An executable version of the code and sample input data sets are included on an accompanying floppy disk.

  15. Application and systems software in Ada: Development experiences

    NASA Technical Reports Server (NTRS)

    Kuschill, Jim

    1986-01-01

    In its most basic sense software development involves describing the tasks to be solved, including the given objects and the operations to be performed on those objects. Unfortunately, the way people describe objects and operations usually bears little resemblance to source code in most contemporary computer languages. There are two ways around this problem. One is to allow users to describe what they want the computer to do in everyday, typically imprecise English. The PRODOC methodology and software development environment is based on a second more flexible and possibly even easier to use approach. Rather than hiding program structure, PRODOC represents such structure graphically using visual programming techniques. In addition, the program terminology used in PRODOC may be customized so as to match the way human experts in any given application area naturally describe the relevant data and operations. The PRODOC methodology is described in detail.

  16. Parallel reduced-instruction-set-computer architecture for real-time symbolic pattern matching

    NASA Astrophysics Data System (ADS)

    Parson, Dale E.

    1991-03-01

    This report discusses ongoing work on a parallel reduced-instruction- set-computer (RISC) architecture for automatic production matching. The PRIOPS compiler takes advantage of the memoryless character of automatic processing by translating a program's collection of automatic production tests into an equivalent combinational circuit-a digital circuit without memory, whose outputs are immediate functions of its inputs. The circuit provides a highly parallel, fine-grain model of automatic matching. The compiler then maps the combinational circuit onto RISC hardware. The heart of the processor is an array of comparators capable of testing production conditions in parallel, Each comparator attaches to private memory that contains virtual circuit nodes-records of the current state of nodes and busses in the combinational circuit. All comparator memories hold identical information, allowing simultaneous update for a single changing circuit node and simultaneous retrieval of different circuit nodes by different comparators. Along with the comparator-based logic unit is a sequencer that determines the current combination of production-derived comparisons to try, based on the combined success and failure of previous combinations of comparisons. The memoryless nature of automatic matching allows the compiler to designate invariant memory addresses for virtual circuit nodes, and to generate the most effective sequences of comparison test combinations. The result is maximal utilization of parallel hardware, indicating speed increases and scalability beyond that found for course-grain, multiprocessor approaches to concurrent Rete matching. Future work will consider application of this RISC architecture to the standard (controlled) Rete algorithm, where search through memory dominates portions of matching.

  17. Fast parallel tandem mass spectral library searching using GPU hardware acceleration.

    PubMed

    Baumgardner, Lydia Ashleigh; Shanmugam, Avinash Kumar; Lam, Henry; Eng, Jimmy K; Martin, Daniel B

    2011-06-03

    Mass spectrometry-based proteomics is a maturing discipline of biologic research that is experiencing substantial growth. Instrumentation has steadily improved over time with the advent of faster and more sensitive instruments collecting ever larger data files. Consequently, the computational process of matching a peptide fragmentation pattern to its sequence, traditionally accomplished by sequence database searching and more recently also by spectral library searching, has become a bottleneck in many mass spectrometry experiments. In both of these methods, the main rate-limiting step is the comparison of an acquired spectrum with all potential matches from a spectral library or sequence database. This is a highly parallelizable process because the core computational element can be represented as a simple but arithmetically intense multiplication of two vectors. In this paper, we present a proof of concept project taking advantage of the massively parallel computing available on graphics processing units (GPUs) to distribute and accelerate the process of spectral assignment using spectral library searching. This program, which we have named FastPaSS (for Fast Parallelized Spectral Searching), is implemented in CUDA (Compute Unified Device Architecture) from NVIDIA, which allows direct access to the processors in an NVIDIA GPU. Our efforts demonstrate the feasibility of GPU computing for spectral assignment, through implementation of the validated spectral searching algorithm SpectraST in the CUDA environment.

  18. mr: A C++ library for the matching and running of the Standard Model parameters

    NASA Astrophysics Data System (ADS)

    Kniehl, Bernd A.; Pikelner, Andrey F.; Veretin, Oleg L.

    2016-09-01

    We present the C++ program library mr that allows us to reliably calculate the values of the running parameters in the Standard Model at high energy scales. The initial conditions are obtained by relating the running parameters in the MS bar renormalization scheme to observables at lower energies with full two-loop precision. The evolution is then performed in accordance with the renormalization group equations with full three-loop precision. Pure QCD corrections to the matching and running are included through four loops. We also provide a Mathematica interface for this program library. Catalogue identifier: AFAI_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AFAI_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public License, version 3 No. of lines in distributed program, including test data, etc.: 517613 No. of bytes in distributed program, including test data, etc.: 2358729 Distribution format: tar.gz Programming language: C++. Computer: IBM PC. Operating system: Linux, Mac OS X. RAM: 1 GB Classification: 11.1. External routines: TSIL [1], OdeInt [2], boost [3] Nature of problem: The running parameters of the Standard Model renormalized in the MS bar scheme at some high renormalization scale, which is chosen by the user, are evaluated in perturbation theory as precisely as possible in two steps. First, the initial conditions at the electroweak energy scale are evaluated from the Fermi constant GF and the pole masses of the W, Z, and Higgs bosons and the bottom and top quarks including the full two-loop threshold corrections. Second, the evolution to the high energy scale is performed by numerically solving the renormalization group evolution equations through three loops. Pure QCD corrections to the matching and running are included through four loops. Solution method: Numerical integration of analytic expressions Additional comments: Available for download from URL: http://apik.github.io/mr/. The MathLink interface is tested to work with Mathematica 7-9 and, with an additional flag, also with Mathematica 10 under Linux and with Mathematica 10 under Mac OS X. Running time: less than 1 second References: [1] S. P. Martin and D. G. Robertson, Comput. Phys. Commun. 174 (2006) 133-151 [hep-ph/0501132]. [2] K. Ahnert and M. Mulansky, AIP Conf. Proc. 1389 (2011) 1586-1589 [arxiv:1110.3397 [cs.MS

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

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... 26 Internal Revenue 15 2013-04-01 2013-04-01 false Taxpayer Identification Number (TIN) matching... Number (TIN) matching program. (a) The matching program. Under section 3406(i), the Commissioner has the authority to establish Taxpayer Identification Number (TIN) matching programs. The Commissioner may...

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

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... 26 Internal Revenue 15 2011-04-01 2011-04-01 false Taxpayer Identification Number (TIN) matching... Number (TIN) matching program. (a) The matching program. Under section 3406(i), the Commissioner has the authority to establish Taxpayer Identification Number (TIN) matching programs. The Commissioner may...

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

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... 26 Internal Revenue 15 2012-04-01 2012-04-01 false Taxpayer Identification Number (TIN) matching... Number (TIN) matching program. (a) The matching program. Under section 3406(i), the Commissioner has the authority to establish Taxpayer Identification Number (TIN) matching programs. The Commissioner may...

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

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... 26 Internal Revenue 15 2014-04-01 2014-04-01 false Taxpayer Identification Number (TIN) matching... Number (TIN) matching program. (a) The matching program. Under section 3406(i), the Commissioner has the authority to establish Taxpayer Identification Number (TIN) matching programs. The Commissioner may...

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

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 26 Internal Revenue 15 2010-04-01 2010-04-01 false Taxpayer Identification Number (TIN) matching... Number (TIN) matching program. (a) The matching program. Under section 3406(i), the Commissioner has the authority to establish Taxpayer Identification Number (TIN) matching programs. The Commissioner may...

  4. Whale Identification

    NASA Technical Reports Server (NTRS)

    1991-01-01

    R:BASE for DOS, a computer program developed under NASA contract, has been adapted by the National Marine Mammal Laboratory and the College of the Atlantic to provide and advanced computerized photo matching technique for identification of humpback whales. The program compares photos with stored digitized descriptions, enabling researchers to track and determine distribution and migration patterns. R:BASE is a spinoff of RIM (Relational Information Manager), which was used to store data for analyzing heat shielding tiles on the Space Shuttle Orbiter. It is now the world's second largest selling line of microcomputer database management software.

  5. Matching and correlation computations in stereoscopic depth perception.

    PubMed

    Doi, Takahiro; Tanabe, Seiji; Fujita, Ichiro

    2011-03-02

    A fundamental task of the visual system is to infer depth by using binocular disparity. To encode binocular disparity, the visual cortex performs two distinct computations: one detects matched patterns in paired images (matching computation); the other constructs the cross-correlation between the images (correlation computation). How the two computations are used in stereoscopic perception is unclear. We dissociated their contributions in near/far discrimination by varying the magnitude of the disparity across separate sessions. For small disparity (0.03°), subjects performed at chance level to a binocularly opposite-contrast (anti-correlated) random-dot stereogram (RDS) but improved their performance with the proportion of contrast-matched (correlated) dots. For large disparity (0.48°), the direction of perceived depth reversed with an anti-correlated RDS relative to that for a correlated one. Neither reversed nor normal depth was perceived when anti-correlation was applied to half of the dots. We explain the decision process as a weighted average of the two computations, with the relative weight of the correlation computation increasing with the disparity magnitude. We conclude that matching computation dominates fine depth perception, while both computations contribute to coarser depth perception. Thus, stereoscopic depth perception recruits different computations depending on the disparity magnitude.

  6. Computer program for calculating aerodynamic characteristics of upper-surface-blowing and over-wing-blowing configurations

    NASA Technical Reports Server (NTRS)

    Lan, C. E.; Fillman, G. L.; Fox, C. H., Jr.

    1977-01-01

    The program is based on the inviscid wing-jet interaction theory of Lan and Campbell, and the jet entrainment theory of Lan. In the interaction theory, the flow perturbations are computed both inside and outside the jet, separately, and then matched on the jet surface to satisfy the jet boundary conditions. The jet Mach number is allowed to be different from the free stream value (Mach number nonuniformity). These jet boundary conditions require that the static pressure be continuous across the jet surface which must always remain as a stream surface. These conditions, as well as the wing-surface tangency condition, are satisified only in the linearized sense. The detailed formulation of these boundary conditions is based on the quasi-vortex-lattice method of Lan.

  7. Block Architecture Problem with Depth First Search Solution and Its Application

    NASA Astrophysics Data System (ADS)

    Rahim, Robbi; Abdullah, Dahlan; Simarmata, Janner; Pranolo, Andri; Saleh Ahmar, Ansari; Hidayat, Rahmat; Napitupulu, Darmawan; Nurdiyanto, Heri; Febriadi, Bayu; Zamzami, Z.

    2018-01-01

    Searching is a common process performed by many computer users, Raita algorithm is one algorithm that can be used to match and find information in accordance with the patterns entered. Raita algorithm applied to the file search application using java programming language and the results obtained from the testing process of the file search quickly and with accurate results and support many data types.

  8. Searching Process with Raita Algorithm and its Application

    NASA Astrophysics Data System (ADS)

    Rahim, Robbi; Saleh Ahmar, Ansari; Abdullah, Dahlan; Hartama, Dedy; Napitupulu, Darmawan; Putera Utama Siahaan, Andysah; Hasan Siregar, Muhammad Noor; Nasution, Nurliana; Sundari, Siti; Sriadhi, S.

    2018-04-01

    Searching is a common process performed by many computer users, Raita algorithm is one algorithm that can be used to match and find information in accordance with the patterns entered. Raita algorithm applied to the file search application using java programming language and the results obtained from the testing process of the file search quickly and with accurate results and support many data types.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-08-07

    ... Wesolowski, Director, Verifications Policy & Operations Branch, Division of Eligibility and Enrollment Policy..., electronic interfaces and an on-line system for the verification of eligibility. PURPOSE(S) OF THE MATCHING... Security number (SSN) verifications, (2) a death indicator, (3) an indicator of a finding of disability by...

  10. A new computer approach to mixed feature classification for forestry application

    NASA Technical Reports Server (NTRS)

    Kan, E. P.

    1976-01-01

    A computer approach for mapping mixed forest features (i.e., types, classes) from computer classification maps is discussed. Mixed features such as mixed softwood/hardwood stands are treated as admixtures of softwood and hardwood areas. Large-area mixed features are identified and small-area features neglected when the nominal size of a mixed feature can be specified. The computer program merges small isolated areas into surrounding areas by the iterative manipulation of the postprocessing algorithm that eliminates small connected sets. For a forestry application, computer-classified LANDSAT multispectral scanner data of the Sam Houston National Forest were used to demonstrate the proposed approach. The technique was successful in cleaning the salt-and-pepper appearance of multiclass classification maps and in mapping admixtures of softwood areas and hardwood areas. However, the computer-mapped mixed areas matched very poorly with the ground truth because of inadequate resolution and inappropriate definition of mixed features.

  11. Large-scale computational drug repositioning to find treatments for rare diseases.

    PubMed

    Govindaraj, Rajiv Gandhi; Naderi, Misagh; Singha, Manali; Lemoine, Jeffrey; Brylinski, Michal

    2018-01-01

    Rare, or orphan, diseases are conditions afflicting a small subset of people in a population. Although these disorders collectively pose significant health care problems, drug companies require government incentives to develop drugs for rare diseases due to extremely limited individual markets. Computer-aided drug repositioning, i.e., finding new indications for existing drugs, is a cheaper and faster alternative to traditional drug discovery offering a promising venue for orphan drug research. Structure-based matching of drug-binding pockets is among the most promising computational techniques to inform drug repositioning. In order to find new targets for known drugs ultimately leading to drug repositioning, we recently developed e MatchSite, a new computer program to compare drug-binding sites. In this study, e MatchSite is combined with virtual screening to systematically explore opportunities to reposition known drugs to proteins associated with rare diseases. The effectiveness of this integrated approach is demonstrated for a kinase inhibitor, which is a confirmed candidate for repositioning to synapsin Ia. The resulting dataset comprises 31,142 putative drug-target complexes linked to 980 orphan diseases. The modeling accuracy is evaluated against the structural data recently released for tyrosine-protein kinase HCK. To illustrate how potential therapeutics for rare diseases can be identified, we discuss a possibility to repurpose a steroidal aromatase inhibitor to treat Niemann-Pick disease type C. Overall, the exhaustive exploration of the drug repositioning space exposes new opportunities to combat orphan diseases with existing drugs. DrugBank/Orphanet repositioning data are freely available to research community at https://osf.io/qdjup/.

  12. Parametric analysis of ATM solar array.

    NASA Technical Reports Server (NTRS)

    Singh, B. K.; Adkisson, W. B.

    1973-01-01

    The paper discusses the methods used for the calculation of ATM solar array performance characteristics and provides the parametric analysis of solar panels used in SKYLAB. To predict the solar array performance under conditions other than test conditions, a mathematical model has been developed. Four computer programs have been used to convert the solar simulator test data to the parametric curves. The first performs module summations, the second determines average solar cell characteristics which will cause a mathematical model to generate a curve matching the test data, the third is a polynomial fit program which determines the polynomial equations for the solar cell characteristics versus temperature, and the fourth program uses the polynomial coefficients generated by the polynomial curve fit program to generate the parametric data.

  13. A FPGA-based architecture for real-time image matching

    NASA Astrophysics Data System (ADS)

    Wang, Jianhui; Zhong, Sheng; Xu, Wenhui; Zhang, Weijun; Cao, Zhiguo

    2013-10-01

    Image matching is a fundamental task in computer vision. It is used to establish correspondence between two images taken at different viewpoint or different time from the same scene. However, its large computational complexity has been a challenge to most embedded systems. This paper proposes a single FPGA-based image matching system, which consists of SIFT feature detection, BRIEF descriptor extraction and BRIEF matching. It optimizes the FPGA architecture for the SIFT feature detection to reduce the FPGA resources utilization. Moreover, we implement BRIEF description and matching on FPGA also. The proposed system can implement image matching at 30fps (frame per second) for 1280x720 images. Its processing speed can meet the demand of most real-life computer vision applications.

  14. The space program's impact on society

    NASA Astrophysics Data System (ADS)

    Toffler, Alvin

    In terms of human evolution, when viewed from 500 or 1000 years from now, today's primitive, still faltering steps beyond the Earth will be recognized as the most important human project of our era, matched only by what is going on in computers and biology. In this paper the social effects of space activity are addressed at three different levels: key social institutions, key social groups, and key social processes.

  15. Reverse time migration: A seismic processing application on the connection machine

    NASA Technical Reports Server (NTRS)

    Fiebrich, Rolf-Dieter

    1987-01-01

    The implementation of a reverse time migration algorithm on the Connection Machine, a massively parallel computer is described. Essential architectural features of this machine as well as programming concepts are presented. The data structures and parallel operations for the implementation of the reverse time migration algorithm are described. The algorithm matches the Connection Machine architecture closely and executes almost at the peak performance of this machine.

  16. Fast parallel tandem mass spectral library searching using GPU hardware acceleration

    PubMed Central

    Baumgardner, Lydia Ashleigh; Shanmugam, Avinash Kumar; Lam, Henry; Eng, Jimmy K.; Martin, Daniel B.

    2011-01-01

    Mass spectrometry-based proteomics is a maturing discipline of biologic research that is experiencing substantial growth. Instrumentation has steadily improved over time with the advent of faster and more sensitive instruments collecting ever larger data files. Consequently, the computational process of matching a peptide fragmentation pattern to its sequence, traditionally accomplished by sequence database searching and more recently also by spectral library searching, has become a bottleneck in many mass spectrometry experiments. In both of these methods, the main rate limiting step is the comparison of an acquired spectrum with all potential matches from a spectral library or sequence database. This is a highly parallelizable process because the core computational element can be represented as a simple but arithmetically intense multiplication of two vectors. In this paper we present a proof of concept project taking advantage of the massively parallel computing available on graphics processing units (GPUs) to distribute and accelerate the process of spectral assignment using spectral library searching. This program, which we have named FastPaSS (for Fast Parallelized Spectral Searching) is implemented in CUDA (Compute Unified Device Architecture) from NVIDIA which allows direct access to the processors in an NVIDIA GPU. Our efforts demonstrate the feasibility of GPU computing for spectral assignment, through implementation of the validated spectral searching algorithm SpectraST in the CUDA environment. PMID:21545112

  17. MICA: desktop software for comprehensive searching of DNA databases

    PubMed Central

    Stokes, William A; Glick, Benjamin S

    2006-01-01

    Background Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegenerate or partially degenerate query. The software programs available for such purposes are normally designed to run on remote servers, but an appealing alternative is to work with DNA databases stored on local computers. We describe a desktop software program termed MICA (K-Mer Indexing with Compact Arrays) that allows large DNA databases to be searched efficiently using very little memory. Results MICA rapidly indexes a DNA database. On a Macintosh G5 computer, the complete human genome could be indexed in about 5 minutes. The indexing algorithm recognizes all 15 characters of the DNA alphabet and fully captures the information in any DNA sequence, yet for a typical sequence of length L, the index occupies only about 2L bytes. The index can be searched to return a complete list of exact matches for a nondegenerate or partially degenerate query of any length. A typical search of a long DNA sequence involves reading only a small fraction of the index into memory. As a result, searches are fast even when the available RAM is limited. Conclusion MICA is suitable as a search engine for desktop DNA analysis software. PMID:17018144

  18. Digital computer program for generating dynamic turbofan engine models (DIGTEM)

    NASA Technical Reports Server (NTRS)

    Daniele, C. J.; Krosel, S. M.; Szuch, J. R.; Westerkamp, E. J.

    1983-01-01

    This report describes DIGTEM, a digital computer program that simulates two spool, two-stream turbofan engines. The turbofan engine model in DIGTEM contains steady-state performance maps for all of the components and has control volumes where continuity and energy balances are maintained. Rotor dynamics and duct momentum dynamics are also included. Altogether there are 16 state variables and state equations. DIGTEM features a backward-differnce integration scheme for integrating stiff systems. It trims the model equations to match a prescribed design point by calculating correction coefficients that balance out the dynamic equations. It uses the same coefficients at off-design points and iterates to a balanced engine condition. Transients can also be run. They are generated by defining controls as a function of time (open-loop control) in a user-written subroutine (TMRSP). DIGTEM has run on the IBM 370/3033 computer using implicit integration with time steps ranging from 1.0 msec to 1.0 sec. DIGTEM is generalized in the aerothermodynamic treatment of components.

  19. Assessing patient dose in interventional fluoroscopy using patient-dependent hybrid phantoms

    NASA Astrophysics Data System (ADS)

    Johnson, Perry Barnett

    Interventional fluoroscopy uses ionizing radiation to guide small instruments through blood vessels or other body pathways to sites of clinical interest. The technique represents a tremendous advantage over invasive surgical procedures, as it requires only a small incision, thus reducing the risk of infection and providing for shorter recovery times. The growing use and increasing complexity of interventional procedures, however, has resulted in public health concerns regarding radiation exposures, particularly with respect to localized skin dose. Tracking and documenting patient-specific skin and internal organ dose has been specifically identified for interventional fluoroscopy where extended irradiation times, multiple projections, and repeat procedures can lead to some of the largest doses encountered in radiology. Furthermore, inprocedure knowledge of localized skin doses can be of significant clinical importance to managing patient risk and in training radiology residents. In this dissertation, a framework is presented for monitoring the radiation dose delivered to patients undergoing interventional procedures. The framework is built around two key points, developing better anthropomorphic models, and designing clinically relevant software systems for dose estimation. To begin, a library of 50 hybrid patient-dependent computational phantoms was developed based on the UF hybrid male and female reference phantoms. These phantoms represent a different type of anthropomorphic model whereby anthropometric parameters from an individual patient are used during phantom selection. The patient-dependent library was first validated and then used in two patient-phantom matching studies focused on cumulative organ and local skin dose. In terms of organ dose, patient-phantom matching was shown most beneficial for estimating the dose to large patients where error associated with soft tissue attenuation differences could be minimized. For small patients, inherent difference in organ size and location limited the effectiveness of matching. For skin dose, patient-phantom matching was found most beneficial for estimating the dose during lateral and anterior-posterior projections. Patient-sculpting of the patient.s outer body contour was also investigated for use during skin dose estimation and highlighted as a substantial step towards better patient-specificity. In order to utilize the models for actual patient dosimetry, two programs were developed based on the newly released Radiation Dose Structured Report (RDSR). The first program allows for the visualization of skin dose by translating the reference point air kerma to the location of the patient.s skin characterized by a computational model. The program represents an innovative tool that can be used by the interventional physician to modify behavior when clinically appropriate. The second program operates by automatically generating an input file from the RDSR which can then be run within a Monte Carlo based radiation transport code. The program has great potential for initiating and promoting the concept of 'cloud dosimetry', where patient-specific radiation transport is performed off-site and returned via the internet. Both programs are non-proprietary and transferable, and also incorporate the most advanced computational phantoms developed to date. Using the tools developed in this work, there exist a tangible opportunity to improve patient care with the end goal being a better understanding of the risk/benefit relationship that accompanies the medical use of ionizing radiation.

  20. Modelling the performance of the tapered artery heat pipe design for use in the radiator of the solar dynamic power system of the NASA Space Station

    NASA Technical Reports Server (NTRS)

    Evans, Austin Lewis

    1988-01-01

    The paper presents a computer program developed to model the steady-state performance of the tapered artery heat pipe for use in the radiator of the solar dynamic power system of the NASA Space Station. The program solves six governing equations to ascertain which one is limiting the maximum heat transfer rate of the heat pipe. The present model appeared to be slightly better than the LTV model in matching the 1-g data for the standard 15-ft test heat pipe.

  1. Nonreflective Conditions for Perfectly Matched Layer in Computational Aeroacoustics

    NASA Astrophysics Data System (ADS)

    Choung, Hanahchim; Jang, Seokjong; Lee, Soogab

    2018-05-01

    In computational aeroacoustics, boundary conditions such as radiation, outflow, or absorbing boundary conditions are critical issues in that they can affect the entire solution of the computation. Among these types of boundary conditions, the perfectly matched layer boundary condition, which has been widely used in computational fluid dynamics and computational aeroacoustics, is developed by augmenting the additional term in the original governing equations by an absorption function so as to stably absorb the outgoing waves. Even if the perfectly matched layer is analytically a perfectly nonreflective boundary condition, spurious waves occur at the interface, since the analysis is performed in discretized space. Hence, this study is focused on factors that affect numerical errors from perfectly matched layer to find the optimum conditions for nonreflective PML. Through a mathematical approach, a minimum width of perfectly matched layer and an optimum absorption coefficient are suggested. To validate the prediction of the analysis, numerical simulations are performed in a generalized coordinate system, as well as in a Cartesian coordinate system.

  2. Spiral: Automated Computing for Linear Transforms

    NASA Astrophysics Data System (ADS)

    Püschel, Markus

    2010-09-01

    Writing fast software has become extraordinarily difficult. For optimal performance, programs and their underlying algorithms have to be adapted to take full advantage of the platform's parallelism, memory hierarchy, and available instruction set. To make things worse, the best implementations are often platform-dependent and platforms are constantly evolving, which quickly renders libraries obsolete. We present Spiral, a domain-specific program generation system for important functionality used in signal processing and communication including linear transforms, filters, and other functions. Spiral completely replaces the human programmer. For a desired function, Spiral generates alternative algorithms, optimizes them, compiles them into programs, and intelligently searches for the best match to the computing platform. The main idea behind Spiral is a mathematical, declarative, domain-specific framework to represent algorithms and the use of rewriting systems to generate and optimize algorithms at a high level of abstraction. Experimental results show that the code generated by Spiral competes with, and sometimes outperforms, the best available human-written code.

  3. Dynamic online surveys and experiments with the free open-source software dynQuest.

    PubMed

    Rademacher, Jens D M; Lippke, Sonia

    2007-08-01

    With computers and the World Wide Web widely available, collecting data through Web browsers is an attractive method utilized by the social sciences. In this article, conducting PC- and Web-based trials with the software package dynQuest is described. The software manages dynamic questionnaire-based trials over the Internet or on single computers, possibly as randomized control trials (RCT), if two or more groups are involved. The choice of follow-up questions can depend on previous responses, as needed for matched interventions. Data are collected in a simple text-based database that can be imported easily into other programs for postprocessing and statistical analysis. The software consists of platform-independent scripts written in the programming language PERL that use the common gateway interface between Web browser and server for submission of data through HTML forms. Advantages of dynQuest are parsimony, simplicity in use and installation, transparency, and reliability. The program is available as open-source freeware from the authors.

  4. Perceptions of the laryngology Match: A survey of program directors and recent trainees.

    PubMed

    Formeister, Eric J; Courey, Mark S; Yung, Katherine C

    2017-12-01

    Evaluate program director and recent trainee perceptions of the advantages and disadvantages of the laryngology Match. Web-based survey study. A Web-based survey study was distributed to program directors and recent laryngology trainees to evaluate perceptions of the laryngology Match. A 15-item questionnaire with free-form, Likert, and multiple selection answers was emailed to 115 recent/current trainees and 22 laryngology directors. Fifty-nine percent (13/22) of the program directors and 47% (54/115) of the recent trainees responded to the survey. There were significant increases in the number of programs applied to, interview offers received, and interviews attended by laryngology trainees who applied after adoption of the Match compared to those who applied prior to the Match. Seventy-one percent (22/31) of applicants after 2012 participated in the Match; those who did not accepted positions outside of the Match. Ninety-five percent (21/22) who applied through the Match successfully matched. Two-thirds of recent trainees and three-quarters of directors believe the Match process primarily benefits the applicant. The number of candidates interviewed per program approximately doubled from three to six after institution of the Match. Overall, both program directors and recent or current laryngology trainees have a positive perception of the laryngology match process. The Match process increased the number of applicants and interviews per year, which both directors and trainees believe increases an applicant's chance at successfully matching. NA. Laryngoscope, 127:2818-2822, 2017. © 2017 The American Laryngological, Rhinological and Otological Society, Inc.

  5. Stochastic model of the NASA/MSFC ground facility for large space structures with uncertain parameters: The maximum entropy approach, part 2

    NASA Technical Reports Server (NTRS)

    Hsia, Wei Shen

    1989-01-01

    A validated technology data base is being developed in the areas of control/structures interaction, deployment dynamics, and system performance for Large Space Structures (LSS). A Ground Facility (GF), in which the dynamics and control systems being considered for LSS applications can be verified, was designed and built. One of the important aspects of the GF is to verify the analytical model for the control system design. The procedure is to describe the control system mathematically as well as possible, then to perform tests on the control system, and finally to factor those results into the mathematical model. The reduction of the order of a higher order control plant was addressed. The computer program was improved for the maximum entropy principle adopted in Hyland's MEOP method. The program was tested against the testing problem. It resulted in a very close match. Two methods of model reduction were examined: Wilson's model reduction method and Hyland's optimal projection (OP) method. Design of a computer program for Hyland's OP method was attempted. Due to the difficulty encountered at the stage where a special matrix factorization technique is needed in order to obtain the required projection matrix, the program was successful up to the finding of the Linear Quadratic Gaussian solution but not beyond. Numerical results along with computer programs which employed ORACLS are presented.

  6. Results of the 2014 National Resident Matching Program®: family medicine.

    PubMed

    Kozakowski, Stanley M; Crosley, Philip W; Bentley, Ashley

    2014-10-01

    The 2014 National Residency Matching Program® results reveal that the number of family medicine positions offered in the Match® by programs accredited by the Accreditation Council on Graduate Medical Education has increased compared to 2013 (3,132 versus 3,062), while the total of all other primary care specialties combined has remained unchanged (784). The number of US seniors matching into family medicine also increased in 2014 over the prior year (1,416 versus 1,374). The percentage of US seniors who matched into family medicine programs grew modestly in 2014 compared to 2013 (8.6% versus 8.4%). Approximately four out of five primary care positions offered in the Match are in family medicine residency programs (3,132 versus 784). Similarly, three out of four US seniors matching into a primary care specialty match into a family medicine program (1,416 versus 520). By way of comparison, nearly five times the number of US seniors matched into family medicine as compared to medicine-pediatrics, the next largest primary care specialty.

  7. 78 FR 49525 - Privacy Act of 1974; CMS Computer Match No. 2013-06; HHS Computer Match No. 1308

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-08-14

    ... Care Act of 2010 (Pub. L. 111-148), as amended by the Health Care and Education Reconciliation Act of..., 2009). INCLUSIVE DATES OF THE MATCH: The CMP will become effective no sooner than 40 days after the...

  8. 78 FR 49524 - Privacy Act of 1974; CMS Computer Match No. 2013-08; HHS Computer Match No. 1309

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-08-14

    ... by the Health Care and Education Reconciliation Act of 2010 (Pub. L. 111-152) (collectively, the ACA...). INCLUSIVE DATES OF THE MATCH: The CMP will become effective no sooner than 40 days after the report of the...

  9. Interhemispheric Resource Sharing: Decreasing Benefits with Increasing Processing Efficiency

    ERIC Educational Resources Information Center

    Maertens, M.; Pollmann, S.

    2005-01-01

    Visual matches are sometimes faster when stimuli are presented across visual hemifields, compared to within-field matching. Using a cued geometric figure matching task, we investigated the influence of computational complexity vs. processing efficiency on this bilateral distribution advantage (BDA). Computational complexity was manipulated by…

  10. Human Expertise Helps Computer Classify Images

    NASA Technical Reports Server (NTRS)

    Rorvig, Mark E.

    1991-01-01

    Two-domain method of computational classification of images requires less computation than other methods for computational recognition, matching, or classification of images or patterns. Does not require explicit computational matching of features, and incorporates human expertise without requiring translation of mental processes of classification into language comprehensible to computer. Conceived to "train" computer to analyze photomicrographs of microscope-slide specimens of leucocytes from human peripheral blood to distinguish between specimens from healthy and specimens from traumatized patients.

  11. From serological to computer cross-matching in nine hospitals.

    PubMed

    Georgsen, J; Kristensen, T

    1998-01-01

    In 1991 it was decided to reorganise the transfusion service of the County of Funen. The aims were to standardise and improve the quality of blood components, laboratory procedures and the transfusion service and to reduce the number of outdated blood units. Part of the efficiency gains was reinvested in a dedicated computer system making it possible--among other things--to change the cross-match procedures from serological to computer cross-matching according to the ABCD-concept. This communication describes how this transition was performed in terms of laboratory techniques, education of personnel as well as implementation of the computer system and indicates the results obtained. The Funen Transfusion Service has by now performed more than 100.000 red cell transfusions based on ABCD-cross-matching and has not encountered any problems. Major results are the significant reductions of cross-match procedures, blood grouping as well as the number of outdated blood components.

  12. LATTICE/hor ellipsis/a beam transport program

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Staples, J.

    1987-06-01

    LATTICE is a computer program that calculates the first order characteristics of synchrotrons and beam transport systems. The program uses matrix algebra to calculate the propagation of the betatron (Twiss) parameters along a beam line. The program draws on ideas from several older programs, notably Transport and Synch, adds many new ones and incorporates them into an interactive, user-friendly program. LATTICE will calculate the matched functions of a synchrotron lattice and display them in a number of ways, including a high resolution Tektronix graphics display. An optimizer is included to adjust selected element parameters so the beam meets a setmore » of constraints. LATTICE is a first order program, but the effect of sextupoles on the chromaticity of a synchrotron lattice is included, and the optimizer will set the sextupole strengths for zero chromaticity. The program will also calculate the characteristics of beam transport systems. In this mode, the beam parameters, defined at the start of the transport line, are propagated through to the end. LATTICE has two distinct modes: the lattice mode which finds the matched functions of a synchrotron, and the transport mode which propagates a predefined beam through a beam line. However, each mode can be used for either type of problem: the transport mode may be used to calculate an insertion for a synchrotron lattice, and the lattice mode may be used to calculate the characteristics of a long periodic beam transport system.« less

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-07-02

    ... (Pub. L. 111-148), as amended by the Health Care and Education Reconciliation Act of 2010 (Pub. L. 111... 78 FR 32256 on May 29, 2013. Inclusive Dates of the Match: The CMP shall become effective no sooner...

  14. 7 CFR 2903.5 - Matching requirements.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ..., DEPARTMENT OF AGRICULTURE BIODIESEL FUEL EDUCATION PROGRAM General Information § 2903.5 Matching requirements. There are no matching funds requirements for the Biodiesel Fuel Education Program and matching resources...

  15. 7 CFR 2903.5 - Matching requirements.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ..., DEPARTMENT OF AGRICULTURE BIODIESEL FUEL EDUCATION PROGRAM General Information § 2903.5 Matching requirements. There are no matching funds requirements for the Biodiesel Fuel Education Program and matching resources...

  16. 7 CFR 2903.5 - Matching requirements.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ..., DEPARTMENT OF AGRICULTURE BIODIESEL FUEL EDUCATION PROGRAM General Information § 2903.5 Matching requirements. There are no matching funds requirements for the Biodiesel Fuel Education Program and matching resources...

  17. 7 CFR 2903.5 - Matching requirements.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ..., DEPARTMENT OF AGRICULTURE BIODIESEL FUEL EDUCATION PROGRAM General Information § 2903.5 Matching requirements. There are no matching funds requirements for the Biodiesel Fuel Education Program and matching resources...

  18. 7 CFR 2903.5 - Matching requirements.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ..., DEPARTMENT OF AGRICULTURE BIODIESEL FUEL EDUCATION PROGRAM General Information § 2903.5 Matching requirements. There are no matching funds requirements for the Biodiesel Fuel Education Program and matching resources...

  19. Mentorship and competencies for applied chronic disease epidemiology.

    PubMed

    Lengerich, Eugene J; Siedlecki, Jennifer C; Brownson, Ross; Aldrich, Tim E; Hedberg, Katrina; Remington, Patrick; Siegel, Paul Z

    2003-01-01

    To understand the potential and establish a framework for mentoring as a method to develop professional competencies of state-level applied chronic disease epidemiologists, model mentorship programs were reviewed, specific competencies were identified, and competencies were then matched to essential public health services. Although few existing mentorship programs in public health were identified, common themes in other professional mentorship programs support the potential of mentoring as an effective means to develop capacity for applied chronic disease epidemiology. Proposed competencies for chronic disease epidemiologists in a mentorship program include planning, analysis, communication, basic public health, informatics and computer knowledge, and cultural diversity. Mentoring may constitute a viable strategy to build chronic disease epidemiology capacity, especially in public health agencies where resource and personnel system constraints limit opportunities to recruit and hire new staff.

  20. The Navy/NASA Engine Program (NNEP89): Interfacing the program for the calculation of complex Chemical Equilibrium Compositions (CEC)

    NASA Technical Reports Server (NTRS)

    Gordon, Sanford

    1991-01-01

    The NNEP is a general computer program for calculating aircraft engine performance. NNEP has been used extensively to calculate the design and off-design (matched) performance of a broad range of turbine engines, ranging from subsonic turboprops to variable cycle engines for supersonic transports. Recently, however, there has been increased interest in applications for which NNEP is not capable of simulating, such as the use of alternate fuels including cryogenic fuels and the inclusion of chemical dissociation effects at high temperatures. To overcome these limitations, NNEP was extended by including a general chemical equilibrium method. This permits consideration of any propellant system and the calculation of performance with dissociation effects. The new extended program is referred to as NNEP89.

  1. Use of computer programs STLK1 and STWT1 for analysis of stream-aquifer hydraulic interaction

    USGS Publications Warehouse

    Desimone, Leslie A.; Barlow, Paul M.

    1999-01-01

    Quantifying the hydraulic interaction of aquifers and streams is important in the analysis of stream base fow, flood-wave effects, and contaminant transport between surface- and ground-water systems. This report describes the use of two computer programs, STLK1 and STWT1, to analyze the hydraulic interaction of streams with confined, leaky, and water-table aquifers during periods of stream-stage fuctuations and uniform, areal recharge. The computer programs are based on analytical solutions to the ground-water-flow equation in stream-aquifer settings and calculate ground-water levels, seepage rates across the stream-aquifer boundary, and bank storage that result from arbitrarily varying stream stage or recharge. Analysis of idealized, hypothetical stream-aquifer systems is used to show how aquifer type, aquifer boundaries, and aquifer and streambank hydraulic properties affect aquifer response to stresses. Published data from alluvial and stratifed-drift aquifers in Kentucky, Massachusetts, and Iowa are used to demonstrate application of the programs to field settings. Analytical models of these three stream-aquifer systems are developed on the basis of available hydrogeologic information. Stream-stage fluctuations and recharge are applied to the systems as hydraulic stresses. The models are calibrated by matching ground-water levels calculated with computer program STLK1 or STWT1 to measured ground-water levels. The analytical models are used to estimate hydraulic properties of the aquifer, aquitard, and streambank; to evaluate hydrologic conditions in the aquifer; and to estimate seepage rates and bank-storage volumes resulting from flood waves and recharge. Analysis of field examples demonstrates the accuracy and limitations of the analytical solutions and programs when applied to actual ground-water systems and the potential uses of the analytical methods as alternatives to numerical modeling for quantifying stream-aquifer interactions.

  2. Control Software for a High-Performance Telerobot

    NASA Technical Reports Server (NTRS)

    Kline-Schoder, Robert J.; Finger, William

    2005-01-01

    A computer program for controlling a high-performance, force-reflecting telerobot has been developed. The goal in designing a telerobot-control system is to make the velocity of the slave match the master velocity, and the environmental force on the master match the force on the slave. Instability can arise from even small delays in propagation of signals between master and slave units. The present software, based on an impedance-shaping algorithm, ensures stability even in the presence of long delays. It implements a real-time algorithm that processes position and force measurements from the master and slave and represents the master/slave communication link as a transmission line. The algorithm also uses the history of the control force and the slave motion to estimate the impedance of the environment. The estimate of the impedance of the environment is used to shape the controlled slave impedance to match the transmission-line impedance. The estimate of the environmental impedance is used to match the master and transmission-line impedances and to estimate the slave/environment force in order to present that force immediately to the operator via the master unit.

  3. Discrete sensitivity derivatives of the Navier-Stokes equations with a parallel Krylov solver

    NASA Technical Reports Server (NTRS)

    Ajmani, Kumud; Taylor, Arthur C., III

    1994-01-01

    This paper solves an 'incremental' form of the sensitivity equations derived by differentiating the discretized thin-layer Navier Stokes equations with respect to certain design variables of interest. The equations are solved with a parallel, preconditioned Generalized Minimal RESidual (GMRES) solver on a distributed-memory architecture. The 'serial' sensitivity analysis code is parallelized by using the Single Program Multiple Data (SPMD) programming model, domain decomposition techniques, and message-passing tools. Sensitivity derivatives are computed for low and high Reynolds number flows over a NACA 1406 airfoil on a 32-processor Intel Hypercube, and found to be identical to those computed on a single-processor Cray Y-MP. It is estimated that the parallel sensitivity analysis code has to be run on 40-50 processors of the Intel Hypercube in order to match the single-processor processing time of a Cray Y-MP.

  4. Guidelines for the Administration of Matching Gift Programs.

    ERIC Educational Resources Information Center

    Business Officer, 1984

    1984-01-01

    Guidelines are presented to help colleges consider their matching gift program, to develop clear policies and procedures, and communicate them to interested and appropriate parties. Responsibilities of companies sponsoring matching gift programs are outlined with attention to policy and program administration. The eight policy recommendations…

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

    PubMed

    Bodin, Doug; Grote, Christopher L

    2016-07-01

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

  6. Comparison of methods for individualized astronaut organ dosimetry: Morphometry-based phantom library versus body contour autoscaling of a reference phantom

    NASA Astrophysics Data System (ADS)

    Sands, Michelle M.; Borrego, David; Maynard, Matthew R.; Bahadori, Amir A.; Bolch, Wesley E.

    2017-11-01

    One of the hazards faced by space crew members in low-Earth orbit or in deep space is exposure to ionizing radiation. It has been shown previously that while differences in organ-specific and whole-body risk estimates due to body size variations are small for highly-penetrating galactic cosmic rays, large differences in these quantities can result from exposure to shorter-range trapped proton or solar particle event radiations. For this reason, it is desirable to use morphometrically accurate computational phantoms representing each astronaut for a risk analysis, especially in the case of a solar particle event. An algorithm was developed to automatically sculpt and scale the UF adult male and adult female hybrid reference phantom to the individual outer body contour of a given astronaut. This process begins with the creation of a laser-measured polygon mesh model of the astronaut's body contour. Using the auto-scaling program and selecting several anatomical landmarks, the UF adult male or female phantom is adjusted to match the laser-measured outer body contour of the astronaut. A dosimetry comparison study was conducted to compare the organ dose accuracy of both the autoscaled phantom and that based upon a height-weight matched phantom from the UF/NCI Computational Phantom Library. Monte Carlo methods were used to simulate the environment of the August 1972 and February 1956 solar particle events. Using a series of individual-specific voxel phantoms as a local benchmark standard, autoscaled phantom organ dose estimates were shown to provide a 1% and 10% improvement in organ dose accuracy for a population of females and males, respectively, as compared to organ doses derived from height-weight matched phantoms from the UF/NCI Computational Phantom Library. In addition, this slight improvement in organ dose accuracy from the autoscaled phantoms is accompanied by reduced computer storage requirements and a more rapid method for individualized phantom generation when compared to the UF/NCI Computational Phantom Library.

  7. Does Timing of Internal Medicine Residency Interview Affect Likelihood of Matching?

    PubMed

    Heidemann, Danielle L; Thompson, Elizabeth; Drake, Sean M

    2016-08-01

    Applicants to our internal medicine (IM) residency program consistently have shared concerns about whether the interview date influences their ability to match via the National Residency Matching Program. We performed a retrospective study to assess whether interview timing was associated with successful matching at our IM program. We identified all of the applicants who interviewed for a first-year position with our IM residency program from 2010 to 2014. Each year's interview dates were totaled and divided equally into three categories: early, middle, or late. Baseline demographics, United States Medical Licensing Examination scores, and type of medical school (American or international) were compared among the interview date groups and between those who did and did not match at our program. Of 914 interviewees, 311 interviewed early (October/November), 299 interviewed in the middle (December), and 304 interviewed late (January). The proportion to match at our program was similar in each interview group (12.5%, 18.4%, 15.1%, respectively; P = 0.133). Logistic regression analysis showed that the middle interview group had increased odds to match compared with the early group (odds ratio 1.590; P = 0.044). The late-versus-early group showed no difference (P = 0.362). No significant differences were found with type of medical school or United States Medical Licensing Examination scores. Of all of the interviewees participating in the match, nearly all matched into a program somewhere, with no significant difference based on interview timing. When considering all of the interviewees, interview date showed no major influence on matching. Only the middle interview time period showed a slight increased chance of matching to our IM program, but the significance was marginal.

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

    PubMed

    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.

  9. On Stable Marriages and Greedy Matchings

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Manne, Fredrik; Naim, Md; Lerring, Hakon

    2016-12-11

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

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

    ERIC Educational Resources Information Center

    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…

  11. Fast online and index-based algorithms for approximate search of RNA sequence-structure patterns

    PubMed Central

    2013-01-01

    Background It is well known that the search for homologous RNAs is more effective if both sequence and structure information is incorporated into the search. However, current tools for searching with RNA sequence-structure patterns cannot fully handle mutations occurring on both these levels or are simply not fast enough for searching large sequence databases because of the high computational costs of the underlying sequence-structure alignment problem. Results We present new fast index-based and online algorithms for approximate matching of RNA sequence-structure patterns supporting a full set of edit operations on single bases and base pairs. Our methods efficiently compute semi-global alignments of structural RNA patterns and substrings of the target sequence whose costs satisfy a user-defined sequence-structure edit distance threshold. For this purpose, we introduce a new computing scheme to optimally reuse the entries of the required dynamic programming matrices for all substrings and combine it with a technique for avoiding the alignment computation of non-matching substrings. Our new index-based methods exploit suffix arrays preprocessed from the target database and achieve running times that are sublinear in the size of the searched sequences. To support the description of RNA molecules that fold into complex secondary structures with multiple ordered sequence-structure patterns, we use fast algorithms for the local or global chaining of approximate sequence-structure pattern matches. The chaining step removes spurious matches from the set of intermediate results, in particular of patterns with little specificity. In benchmark experiments on the Rfam database, our improved online algorithm is faster than the best previous method by up to factor 45. Our best new index-based algorithm achieves a speedup of factor 560. Conclusions The presented methods achieve considerable speedups compared to the best previous method. This, together with the expected sublinear running time of the presented index-based algorithms, allows for the first time approximate matching of RNA sequence-structure patterns in large sequence databases. Beyond the algorithmic contributions, we provide with RaligNAtor a robust and well documented open-source software package implementing the algorithms presented in this manuscript. The RaligNAtor software is available at http://www.zbh.uni-hamburg.de/ralignator. PMID:23865810

  12. Ophthalmology Residency Match outcomes for 2011.

    PubMed

    Yousuf, Salman J; Jones, Leslie S

    2012-03-01

    To determine the match rate and predictors of matching into an ophthalmology residency. Population-based, cross-sectional study. All 746 candidates who submitted an application for the 2011 ophthalmology residency match. The Ophthalmology Residency Matching Program applicant database was reviewed to determine applicant characteristics and match outcomes. For US seniors, multivariate regression analysis was performed to determine predictors of matching. Match rate and predictors of US seniors matching. Rank lists were submitted by 622 applicants, among whom 458 (74%) matched. The match rate was higher for US seniors (83%) than for independent applicants (41%; P < 0.001). US seniors who matched were more likely to be Alpha Omega Alpha medical honor society members (odds ratio [OR], 2.94; 95% confidence interval [CI], 1.16-7.29), to attend medical schools ranked in the top 40 according to National Institutes of Health funding (OR, 2.25; CI, 1.14-4.43), and to have ranked more programs (OR, 1.44; CI, 1.29-1.60). Those ranking 6 to 10 programs had an 80% to 90% chance of matching, and those ranking more than 10 programs had a greater than 90% chance of matching. No clear benefit was observed by ranking additional programs once 11 had already been ranked. Average US Medical Licensing Examination Step 1 scores were 239 ± 14 and 223 ± 18 for applicants who were matched and unmatched, respectively; this difference was significant by univariate analysis (P < 0.001) but not by multivariate regression (P = 0.163). Ophthalmology ranks among the most competitive specialties in medicine. Those most likely to match were US seniors who maintained academic excellence beginning in their preclinical years. A finite relationship exists between ranking a greater number of programs and having a greater chance of matching. Copyright © 2012 American Academy of Ophthalmology. Published by Elsevier Inc. All rights reserved.

  13. Probabilistic fusion of stereo with color and contrast for bilayer segmentation.

    PubMed

    Kolmogorov, Vladimir; Criminisi, Antonio; Blake, Andrew; Cross, Geoffrey; Rother, Carsten

    2006-09-01

    This paper describes models and algorithms for the real-time segmentation of foreground from background layers in stereo video sequences. Automatic separation of layers from color/contrast or from stereo alone is known to be error-prone. Here, color, contrast, and stereo matching information are fused to infer layers accurately and efficiently. The first algorithm, Layered Dynamic Programming (LDP), solves stereo in an extended six-state space that represents both foreground/background layers and occluded regions. The stereo-match likelihood is then fused with a contrast-sensitive color model that is learned on-the-fly and stereo disparities are obtained by dynamic programming. The second algorithm, Layered Graph Cut (LGC), does not directly solve stereo. Instead, the stereo match likelihood is marginalized over disparities to evaluate foreground and background hypotheses and then fused with a contrast-sensitive color model like the one used in LDP. Segmentation is solved efficiently by ternary graph cut. Both algorithms are evaluated with respect to ground truth data and found to have similar performance, substantially better than either stereo or color/ contrast alone. However, their characteristics with respect to computational efficiency are rather different. The algorithms are demonstrated in the application of background substitution and shown to give good quality composite video output.

  14. Tight Bounds for Minimax Grid Matching, with Applications to the Average Case Analysis of Algorithms.

    DTIC Science & Technology

    1986-05-01

    AD-ft?l 552 TIGHT BOUNDS FOR NININAX GRID MATCHING WITH i APPLICATIONS TO THE AVERAGE C.. (U) MASSACHUSETTS INST OF TECH CAMBRIDGE LAS FOR COMPUTER...MASSACHUSETTS LABORATORYFORNSTITUTE OF COMPUTER SCIENCE TECHNOLOGY MIT/LCS/TM-298 TIGHT BOUNDS FOR MINIMAX GRID MATCHING, WITH APPLICATIONS TO THE AVERAGE...PERIOD COVERED Tight bounds for minimax grid matching, Interim research with applications to the average case May 1986 analysis of algorithms. 6

  15. Cloudgene: A graphical execution platform for MapReduce programs on private and public clouds

    PubMed Central

    2012-01-01

    Background The MapReduce framework enables a scalable processing and analyzing of large datasets by distributing the computational load on connected computer nodes, referred to as a cluster. In Bioinformatics, MapReduce has already been adopted to various case scenarios such as mapping next generation sequencing data to a reference genome, finding SNPs from short read data or matching strings in genotype files. Nevertheless, tasks like installing and maintaining MapReduce on a cluster system, importing data into its distributed file system or executing MapReduce programs require advanced knowledge in computer science and could thus prevent scientists from usage of currently available and useful software solutions. Results Here we present Cloudgene, a freely available platform to improve the usability of MapReduce programs in Bioinformatics by providing a graphical user interface for the execution, the import and export of data and the reproducibility of workflows on in-house (private clouds) and rented clusters (public clouds). The aim of Cloudgene is to build a standardized graphical execution environment for currently available and future MapReduce programs, which can all be integrated by using its plug-in interface. Since Cloudgene can be executed on private clusters, sensitive datasets can be kept in house at all time and data transfer times are therefore minimized. Conclusions Our results show that MapReduce programs can be integrated into Cloudgene with little effort and without adding any computational overhead to existing programs. This platform gives developers the opportunity to focus on the actual implementation task and provides scientists a platform with the aim to hide the complexity of MapReduce. In addition to MapReduce programs, Cloudgene can also be used to launch predefined systems (e.g. Cloud BioLinux, RStudio) in public clouds. Currently, five different bioinformatic programs using MapReduce and two systems are integrated and have been successfully deployed. Cloudgene is freely available at http://cloudgene.uibk.ac.at. PMID:22888776

  16. C-SAFE: A Computer-Delivered Sexual Health Promotion Program for Latinas.

    PubMed

    Klein, Charles H; Kuhn, Tamara; Altamirano, Midori; Lomonaco, Carmela

    2017-07-01

    This article describes the development and evaluation of C-SAFE (Sexual Awareness for Everyone), a computer-delivered sexual health promotion program for Latinas. We first describe the process of adapting an evidence-based, group-level intervention into an individually administered computer-delivered program. We then present the methods and results of a randomized control trial with 321 Latinas in California and Florida to test C-SAFE's preliminary efficacy in reducing sexual health risk. We found no statistically significant differences between the two conditions at a six-month follow-up in terms of sexual behaviors or attitudes toward sexually transmitted infections and condoms, although C-SAFE women reported fewer days in the past month when their mental health was not good (p = .02). C-SAFE condition women also reported more satisfaction than control condition women in their assessment of information presentation (on a scale of 1 = poor and 5 = excellent; C-SAFE = 4.45 vs. control = 4.25, p = .053) and having learned something new (C-SAFE = 95.1% vs. control = 79.3%, χ 2 < 0.001), with utility of content for Latinas approaching significance (C-SAFE = 4.50 vs. control = 4.31, p = .058). In conclusion we discuss the importance of teachable moments, matching of delivery modalities to implementation contexts, and possible directions for evidence-based sexual health promotion programs given the current sexual health landscape.

  17. 20 CFR 10.527 - Does OWCP verify reports of earnings?

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ... to computer matches with the Office of Personnel Management and inquiries to the Social Security Administration. Also, OWCP may perform computer matches with records of State agencies, including but not limited...

  18. 20 CFR 10.527 - Does OWCP verify reports of earnings?

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ... to computer matches with the Office of Personnel Management and inquiries to the Social Security Administration. Also, OWCP may perform computer matches with records of State agencies, including but not limited...

  19. 20 CFR 10.527 - Does OWCP verify reports of earnings?

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ... to computer matches with the Office of Personnel Management and inquiries to the Social Security Administration. Also, OWCP may perform computer matches with records of State agencies, including but not limited...

  20. 20 CFR 10.527 - Does OWCP verify reports of earnings?

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... to computer matches with the Office of Personnel Management and inquiries to the Social Security Administration. Also, OWCP may perform computer matches with records of State agencies, including but not limited...

  1. 20 CFR 10.527 - Does OWCP verify reports of earnings?

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ... to computer matches with the Office of Personnel Management and inquiries to the Social Security Administration. Also, OWCP may perform computer matches with records of State agencies, including but not limited...

  2. Man-Computer Interactive Data Access System (McIDAS). Continued development of McIDAS and operation in the GARP Atlantic tropical experiment

    NASA Technical Reports Server (NTRS)

    Suomi, V. E.

    1975-01-01

    The complete output of the Synchronous Meteorological Satellite was recorded on one inch magnetic tape. A quality control subsystem tests cloud track vectors against four sets of criteria: (1) rejection if best match occurs on correlation boundary; (2) rejection if major correlation peak is not distinct and significantly greater than secondary peak; (3) rejection if correlation is not persistent; and (4) rejection if acceleration is too great. A cloud height program determines cloud optical thickness from visible data and computer infrared emissivity. From infrared data and temperature profile, cloud height is determined. A functional description and electronic schematics of equipment are given.

  3. Computer face-matching technology using two-dimensional photographs accurately matches the facial gestalt of unrelated individuals with the same syndromic form of intellectual disability.

    PubMed

    Dudding-Byth, Tracy; Baxter, Anne; Holliday, Elizabeth G; Hackett, Anna; O'Donnell, Sheridan; White, Susan M; Attia, John; Brunner, Han; de Vries, Bert; Koolen, David; Kleefstra, Tjitske; Ratwatte, Seshika; Riveros, Carlos; Brain, Steve; Lovell, Brian C

    2017-12-19

    Massively parallel genetic sequencing allows rapid testing of known intellectual disability (ID) genes. However, the discovery of novel syndromic ID genes requires molecular confirmation in at least a second or a cluster of individuals with an overlapping phenotype or similar facial gestalt. Using computer face-matching technology we report an automated approach to matching the faces of non-identical individuals with the same genetic syndrome within a database of 3681 images [1600 images of one of 10 genetic syndrome subgroups together with 2081 control images]. Using the leave-one-out method, two research questions were specified: 1) Using two-dimensional (2D) photographs of individuals with one of 10 genetic syndromes within a database of images, did the technology correctly identify more than expected by chance: i) a top match? ii) at least one match within the top five matches? or iii) at least one in the top 10 with an individual from the same syndrome subgroup? 2) Was there concordance between correct technology-based matches and whether two out of three clinical geneticists would have considered the diagnosis based on the image alone? The computer face-matching technology correctly identifies a top match, at least one correct match in the top five and at least one in the top 10 more than expected by chance (P < 0.00001). There was low agreement between the technology and clinicians, with higher accuracy of the technology when results were discordant (P < 0.01) for all syndromes except Kabuki syndrome. Although the accuracy of the computer face-matching technology was tested on images of individuals with known syndromic forms of intellectual disability, the results of this pilot study illustrate the potential utility of face-matching technology within deep phenotyping platforms to facilitate the interpretation of DNA sequencing data for individuals who remain undiagnosed despite testing the known developmental disorder genes.

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-07-15

    ... with the Department of Defense (DoD), Defense Manpower Data Center (DMDC). We have provided background... & Medicaid Services and the Department of Defense, Defense Manpower Data Center for the Determination of...), Centers for Medicare & Medicaid Services (CMS), and Department of Defense (DoD), Defense Manpower Data...

  5. Laboratory manual: mineral X-ray diffraction data retrieval/plot computer program

    USGS Publications Warehouse

    Hauff, Phoebe L.; VanTrump, George

    1976-01-01

    The Mineral X-Ray Diffraction Data Retrieval/Plot Computer Program--XRDPLT (VanTrump and Hauff, 1976a) is used to retrieve and plot mineral X-ray diffraction data. The program operates on a file of mineral powder diffraction data (VanTrump and Hauff, 1976b) which contains two-theta or 'd' values, and intensities, chemical formula, mineral name, identification number, and mineral group code. XRDPLT is a machine-independent Fortran program which operates in time-sharing mode on a DEC System i0 computer and the Gerber plotter (Evenden, 1974). The program prompts the user to respond from a time-sharing terminal in a conversational format with the required input information. The program offers two major options: retrieval only; retrieval and plot. The first option retrieves mineral names, formulas, and groups from the file by identification number, by the mineral group code (a classification by chemistry or structure), or by searches based on the formula components. For example, it enables the user to search for minerals by major groups (i.e., feldspars, micas, amphiboles, oxides, phosphates, carbonates) by elemental composition (i.e., Fe, Cu, AI, Zn), or by a combination of these (i.e., all copper-bearing arsenates). The second option retrieves as the first, but also plots the retrieved 2-theta and intensity values as diagrammatic X-ray powder patterns on mylar sheets or overlays. These plots can be made using scale combinations compatible with chart recorder diffractograms and 114.59 mm powder camera films. The overlays are then used to separate or sieve out unrelated minerals until unknowns are matched and identified.

  6. RPM-WEBBSYS: A web-based computer system to apply the rational polynomial method for estimating static formation temperatures of petroleum and geothermal wells

    NASA Astrophysics Data System (ADS)

    Wong-Loya, J. A.; Santoyo, E.; Andaverde, J. A.; Quiroz-Ruiz, A.

    2015-12-01

    A Web-Based Computer System (RPM-WEBBSYS) has been developed for the application of the Rational Polynomial Method (RPM) to estimate static formation temperatures (SFT) of geothermal and petroleum wells. The system is also capable to reproduce the full thermal recovery processes occurred during the well completion. RPM-WEBBSYS has been programmed using advances of the information technology to perform more efficiently computations of SFT. RPM-WEBBSYS may be friendly and rapidly executed by using any computing device (e.g., personal computers and portable computing devices such as tablets or smartphones) with Internet access and a web browser. The computer system was validated using bottomhole temperature (BHT) measurements logged in a synthetic heat transfer experiment, where a good matching between predicted and true SFT was achieved. RPM-WEBBSYS was finally applied to BHT logs collected from well drilling and shut-in operations, where the typical problems of the under- and over-estimation of the SFT (exhibited by most of the existing analytical methods) were effectively corrected.

  7. Construction of pore network models for Berea and Fontainebleau sandstones using non-linear programing and optimization techniques

    NASA Astrophysics Data System (ADS)

    Sharqawy, Mostafa H.

    2016-12-01

    Pore network models (PNM) of Berea and Fontainebleau sandstones were constructed using nonlinear programming (NLP) and optimization methods. The constructed PNMs are considered as a digital representation of the rock samples which were based on matching the macroscopic properties of the porous media and used to conduct fluid transport simulations including single and two-phase flow. The PNMs consisted of cubic networks of randomly distributed pores and throats sizes and with various connectivity levels. The networks were optimized such that the upper and lower bounds of the pore sizes are determined using the capillary tube bundle model and the Nelder-Mead method instead of guessing them, which reduces the optimization computational time significantly. An open-source PNM framework was employed to conduct transport and percolation simulations such as invasion percolation and Darcian flow. The PNM model was subsequently used to compute the macroscopic properties; porosity, absolute permeability, specific surface area, breakthrough capillary pressure, and primary drainage curve. The pore networks were optimized to allow for the simulation results of the macroscopic properties to be in excellent agreement with the experimental measurements. This study demonstrates that non-linear programming and optimization methods provide a promising method for pore network modeling when computed tomography imaging may not be readily available.

  8. Datagram: Results of the NRMP for 1986.

    ERIC Educational Resources Information Center

    Graettinger, John S.

    1986-01-01

    The number of U.S. seniors who enrolled in the National Resident Matching Program in 1986 decreased. The most competitive programs were in emergency medicine, obstetrics/gynecology, orthopedic surgery, and diagnostic radiology. A new match, called the Medical Specialties Matching Program, is underway for fellowships. (MLW)

  9. WINPEPI updated: computer programs for epidemiologists, and their teaching potential

    PubMed Central

    2011-01-01

    Background The WINPEPI computer programs for epidemiologists are designed for use in practice and research in the health field and as learning or teaching aids. The programs are free, and can be downloaded from the Internet. Numerous additions have been made in recent years. Implementation There are now seven WINPEPI programs: DESCRIBE, for use in descriptive epidemiology; COMPARE2, for use in comparisons of two independent groups or samples; PAIRSetc, for use in comparisons of paired and other matched observations; LOGISTIC, for logistic regression analysis; POISSON, for Poisson regression analysis; WHATIS, a "ready reckoner" utility program; and ETCETERA, for miscellaneous other procedures. The programs now contain 122 modules, each of which provides a number, sometimes a large number, of statistical procedures. The programs are accompanied by a Finder that indicates which modules are appropriate for different purposes. The manuals explain the uses, limitations and applicability of the procedures, and furnish formulae and references. Conclusions WINPEPI is a handy resource for a wide variety of statistical routines used by epidemiologists. Because of its ready availability, portability, ease of use, and versatility, WINPEPI has a considerable potential as a learning and teaching aid, both with respect to practical procedures in the planning and analysis of epidemiological studies, and with respect to important epidemiological concepts. It can also be used as an aid in the teaching of general basic statistics. PMID:21288353

  10. Supporting Mentoring Relationships of Youth in Foster Care: Do Program Practices Predict Match Length?

    PubMed

    Stelter, Rebecca L; Kupersmidt, Janis B; Stump, Kathryn N

    2018-04-15

    Implementation of research- and safety-based program practices enhance the longevity of mentoring relationships, in general; however, little is known about how mentoring programs might support the relationships of mentees in foster care. Benchmark program practices and Standards in the Elements of Effective Practice for Mentoring, 3rd Edition (MENTOR, 2009) were assessed in the current study as predictors of match longevity. Secondary data analyses were conducted on a national agency information management database from 216 Big Brothers Big Sisters agencies serving 641 youth in foster care and 70,067 youth not in care from across the United States (Mean = 11.59 years old at the beginning of their matches) in one-to-one, community-based (55.06%) and school- or site-based (44.94%) matches. Mentees in foster care had shorter matches and matches that were more likely to close prematurely than mentees who were not in foster care. Agency leaders from 32 programs completed a web-based survey describing their policies and practices. The sum total numbers of Benchmark program practices and Standards were associated with match length for 208 mentees in foster care; however, neither predicted premature match closure. Results are discussed in terms of how mentoring programs and their staff can support the mentoring relationships of high-risk youth in foster care. © Society for Community Research and Action 2018.

  11. Post-Interview Communication During Application to Orthopaedic Surgery Residency Programs.

    PubMed

    Brooks, Jaysson T; Reidler, Jay S; Jain, Amit; LaPorte, Dawn M; Sterling, Robert S

    2016-10-05

    Post-interview communication from residency programs to applicants is common during the U.S. residency match process. The goals of this study were to understand the frequency and type of post-interview communication, how this communication influences applicants' ranking of programs, whether programs use "second-look" visits to gauge or to encourage applicant interest, and the financial costs to applicants of second-look visits. A post-match survey was sent to 1,198 applicants to one academic orthopaedic residency program over 2 years. The response rates were 15% in 2014 and 31% in 2015, totaling 293 responses used for analysis. Sixty-four percent of applicants reported having post-interview communication with one or more programs. Seventeen percent said that communication caused them to rank the contacting program higher or to keep the program ranked as number 1. Twenty percent felt pressured to reveal their rank position, and 8% were asked to rank a program first in exchange for the program's promise to rank the applicant first. Applicants who received post-interview communication had odds that were 13.5 times higher (95% confidence interval, 6.2 to 30 times higher) of matching to the programs that contacted them. Ninety percent of applicants said that communication from a program did not change how they ranked the program with which they eventually matched. Seventeen percent were encouraged to attend second-look visits, incurring a mean cost of $600 (range, $20 to $8,000). Orthopaedic residency programs continue to communicate with applicants in ways that violate the National Resident Matching Program's Match Communication Code of Conduct, and they continue to encourage second-look visits. To improve the integrity of the match, we suggest that programs use no-reply e-mails to minimize influence and pressure on applicants, interviewers and applicants review the Code of Conduct on interview day and provide instructions on reporting violations to the National Resident Matching Program, all post-interview communication be directed to a standardized or neutral third party, and programs actively discourage second-look visits and stop requiring second-look visits. Copyright © 2016 by The Journal of Bone and Joint Surgery, Incorporated.

  12. 2015 Final Reports from the Los Alamos National Laboratory Computational Physics Student Summer Workshop

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Runnels, Scott Robert; Caldwell, Wendy; Brown, Barton Jed

    The two primary purposes of LANL’s Computational Physics Student Summer Workshop are (1) To educate graduate and exceptional undergraduate students in the challenges and applications of computational physics of interest to LANL, and (2) Entice their interest toward those challenges. Computational physics is emerging as a discipline in its own right, combining expertise in mathematics, physics, and computer science. The mathematical aspects focus on numerical methods for solving equations on the computer as well as developing test problems with analytical solutions. The physics aspects are very broad, ranging from low-temperature material modeling to extremely high temperature plasma physics, radiation transportmore » and neutron transport. The computer science issues are concerned with matching numerical algorithms to emerging architectures and maintaining the quality of extremely large codes built to perform multi-physics calculations. Although graduate programs associated with computational physics are emerging, it is apparent that the pool of U.S. citizens in this multi-disciplinary field is relatively small and is typically not focused on the aspects that are of primary interest to LANL. Furthermore, more structured foundations for LANL interaction with universities in computational physics is needed; historically interactions rely heavily on individuals’ personalities and personal contacts. Thus a tertiary purpose of the Summer Workshop is to build an educational network of LANL researchers, university professors, and emerging students to advance the field and LANL’s involvement in it. This report includes both the background for the program and the reports from the students.« less

  13. 76 FR 30243 - Community Volunteer Income Tax Assistance (VITA) Matching Grant Program-Availability of...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-05-24

    ... DEPARTMENT OF THE TREASURY Internal Revenue Service Community Volunteer Income Tax Assistance... application packages for the 2012 Community Volunteer Income Tax Assistance (VITA) Matching Grant Program... Community Volunteer Income Tax Assistance (VITA) Matching Grant Program is contained in the Department of...

  14. 77 FR 20694 - Community Volunteer Income Tax Assistance (VITA) Matching Grant Program-Availability of...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-04-05

    ... DEPARTMENT OF THE TREASURY Internal Revenue Service Community Volunteer Income Tax Assistance... application package for the 2013 Community Volunteer Income Tax Assistance (VITA) Matching Grant Program... the Community Volunteer Income Tax Assistance (VITA) Matching Grant Program is contained in the...

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

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-04-28

    ... DEPARTMENT OF THE TREASURY Internal Revenue Service Community Volunteer Income Tax Assistance... application packages for the 2011 Community Volunteer Income Tax Assistance (VITA) Matching Grant Program... for the 2011 Community Volunteer Income Tax Assistance (VITA) Matching Grant Demonstration Program for...

  16. 7 CFR 1740.5 - Matching funds.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 11 2011-01-01 2011-01-01 false Matching funds. 1740.5 Section 1740.5 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE... Grant Program § 1740.5 Matching funds. No matching funds are required in this program. ...

  17. Research on three-dimensional reconstruction method based on binocular vision

    NASA Astrophysics Data System (ADS)

    Li, Jinlin; Wang, Zhihui; Wang, Minjun

    2018-03-01

    As the hot and difficult issue in computer vision, binocular stereo vision is an important form of computer vision,which has a broad application prospects in many computer vision fields,such as aerial mapping,vision navigation,motion analysis and industrial inspection etc.In this paper, a research is done into binocular stereo camera calibration, image feature extraction and stereo matching. In the binocular stereo camera calibration module, the internal parameters of a single camera are obtained by using the checkerboard lattice of zhang zhengyou the field of image feature extraction and stereo matching, adopted the SURF operator in the local feature operator and the SGBM algorithm in the global matching algorithm are used respectively, and the performance are compared. After completed the feature points matching, we can build the corresponding between matching points and the 3D object points using the camera parameters which are calibrated, which means the 3D information.

  18. Fast adaptive diamond search algorithm for block-matching motion estimation using spatial correlation

    NASA Astrophysics Data System (ADS)

    Park, Sang-Gon; Jeong, Dong-Seok

    2000-12-01

    In this paper, we propose a fast adaptive diamond search algorithm (FADS) for block matching motion estimation. Many fast motion estimation algorithms reduce the computational complexity by the UESA (Unimodal Error Surface Assumption) where the matching error monotonically increases as the search moves away from the global minimum point. Recently, many fast BMAs (Block Matching Algorithms) make use of the fact that global minimum points in real world video sequences are centered at the position of zero motion. But these BMAs, especially in large motion, are easily trapped into the local minima and result in poor matching accuracy. So, we propose a new motion estimation algorithm using the spatial correlation among the neighboring blocks. We move the search origin according to the motion vectors of the spatially neighboring blocks and their MAEs (Mean Absolute Errors). The computer simulation shows that the proposed algorithm has almost the same computational complexity with DS (Diamond Search), but enhances PSNR. Moreover, the proposed algorithm gives almost the same PSNR as that of FS (Full Search), even for the large motion with half the computational load.

  19. Factors associated with successful matching to dermatology residency programs by reapplicants and other applicants who previously graduated from medical school.

    PubMed

    Stratman, Erik J; Ness, Rachel M

    2011-02-01

    To identify factors associated with and not associated with successful matching and matriculation (hereinafter "matching") to dermatology residency programs for applicants who previously graduated from medical school and to distinguish which factors are within applicants' control. Observational cohort study. Six accredited academic dermatology residency training programs in the United States. A total of 221 residency applicants who previously graduated from medical school and who applied through standardized electronic application to 1 or more of the participating residency training programs. Matriculation to a dermatology residency program by August 2008 following the 2006 residency application period. Forty-six of 221 former medical school graduates included in this study matched to a dermatology residency program. Factors strongly associated with matching included United States Medical Licensing Examination Step 3 score; submission of letters written by dermatologists from institutions that train dermatology residents; completion of preliminary medicine internships rather than transitional or other internship types; listing of research experience; publishing of medical manuscripts; and completion of non-Accreditation Council for Graduate Medical Examination dermatology fellowships. Factors not associated with increased matching included volunteer work; PhD status; sex; number of posters or presentations at dermatology conferences; quality of journal publications; and first authorship. Most successful applicants limited personal statements to 1 page and did not mention previously failing to match. The study sample represented at least 86% of such nontraditional applicants who matched in 2006. For candidates seeking to match into dermatology residency programs after graduating from medical school, there are factors within their control that are associated with higher rates of match success. This study provides evidence to assist mentors who counsel such candidates. ©2011 American Medical Association. All rights reserved.

  20. Select Government Matching Fund Programs: An Examination of Characteristics and Effectiveness

    ERIC Educational Resources Information Center

    Council for Advancement and Support of Education (NJ1), 2004

    2004-01-01

    Government matching fund programs, at their most fundamental level, are state-based initiatives that match private donations to colleges and universities with public funds. These programs have proven to be effective methods of improving public colleges and universities and successful examples of public-private partnerships, which are key…

  1. Practical Considerations for Clinical PET/MR Imaging.

    PubMed

    Galgano, Samuel; Viets, Zachary; Fowler, Kathryn; Gore, Lael; Thomas, John V; McNamara, Michelle; McConathy, Jonathan

    2018-01-01

    Clinical PET/MR imaging is currently performed at a number of centers around the world as part of routine standard of care. This article focuses on issues and considerations for a clinical PET/MR imaging program, focusing on routine standard-of-care studies. Although local factors influence how clinical PET/MR imaging is implemented, the approaches and considerations described here intend to apply to most clinical programs. PET/MR imaging provides many more options than PET/computed tomography with diagnostic advantages for certain clinical applications but with added complexity. A recurring theme is matching the PET/MR imaging protocol to the clinical application to balance diagnostic accuracy with efficiency. Copyright © 2017 Elsevier Inc. All rights reserved.

  2. Practical Considerations for Clinical PET/MR Imaging.

    PubMed

    Galgano, Samuel; Viets, Zachary; Fowler, Kathryn; Gore, Lael; Thomas, John V; McNamara, Michelle; McConathy, Jonathan

    2017-05-01

    Clinical PET/MR imaging is currently performed at a number of centers around the world as part of routine standard of care. This article focuses on issues and considerations for a clinical PET/MR imaging program, focusing on routine standard-of-care studies. Although local factors influence how clinical PET/MR imaging is implemented, the approaches and considerations described here intend to apply to most clinical programs. PET/MR imaging provides many more options than PET/computed tomography with diagnostic advantages for certain clinical applications but with added complexity. A recurring theme is matching the PET/MR imaging protocol to the clinical application to balance diagnostic accuracy with efficiency. Copyright © 2016 Elsevier Inc. All rights reserved.

  3. Exploring Robust Methods for Evaluating Treatment and Comparison Groups in Chronic Care Management Programs

    PubMed Central

    Hamar, Brent; Bradley, Chastity; Gandy, William M.; Harrison, Patricia L.; Sidney, James A.; Coberley, Carter R.; Rula, Elizabeth Y.; Pope, James E.

    2013-01-01

    Abstract Evaluation of chronic care management (CCM) programs is necessary to determine the behavioral, clinical, and financial value of the programs. Financial outcomes of members who are exposed to interventions (treatment group) typically are compared to those not exposed (comparison group) in a quasi-experimental study design. However, because member assignment is not randomized, outcomes reported from these designs may be biased or inefficient if study groups are not comparable or balanced prior to analysis. Two matching techniques used to achieve balanced groups are Propensity Score Matching (PSM) and Coarsened Exact Matching (CEM). Unlike PSM, CEM has been shown to yield estimates of causal (program) effects that are lowest in variance and bias for any given sample size. The objective of this case study was to provide a comprehensive comparison of these 2 matching methods within an evaluation of a CCM program administered to a large health plan during a 2-year time period. Descriptive and statistical methods were used to assess the level of balance between comparison and treatment members pre matching. Compared with PSM, CEM retained more members, achieved better balance between matched members, and resulted in a statistically insignificant Wald test statistic for group aggregation. In terms of program performance, the results showed an overall higher medical cost savings among treatment members matched using CEM compared with those matched using PSM (-$25.57 versus -$19.78, respectively). Collectively, the results suggest CEM is a viable alternative, if not the most appropriate matching method, to apply when evaluating CCM program performance. (Population Health Management 2013;16:35–45) PMID:22788834

  4. Exploring robust methods for evaluating treatment and comparison groups in chronic care management programs.

    PubMed

    Wells, Aaron R; Hamar, Brent; Bradley, Chastity; Gandy, William M; Harrison, Patricia L; Sidney, James A; Coberley, Carter R; Rula, Elizabeth Y; Pope, James E

    2013-02-01

    Evaluation of chronic care management (CCM) programs is necessary to determine the behavioral, clinical, and financial value of the programs. Financial outcomes of members who are exposed to interventions (treatment group) typically are compared to those not exposed (comparison group) in a quasi-experimental study design. However, because member assignment is not randomized, outcomes reported from these designs may be biased or inefficient if study groups are not comparable or balanced prior to analysis. Two matching techniques used to achieve balanced groups are Propensity Score Matching (PSM) and Coarsened Exact Matching (CEM). Unlike PSM, CEM has been shown to yield estimates of causal (program) effects that are lowest in variance and bias for any given sample size. The objective of this case study was to provide a comprehensive comparison of these 2 matching methods within an evaluation of a CCM program administered to a large health plan during a 2-year time period. Descriptive and statistical methods were used to assess the level of balance between comparison and treatment members pre matching. Compared with PSM, CEM retained more members, achieved better balance between matched members, and resulted in a statistically insignificant Wald test statistic for group aggregation. In terms of program performance, the results showed an overall higher medical cost savings among treatment members matched using CEM compared with those matched using PSM (-$25.57 versus -$19.78, respectively). Collectively, the results suggest CEM is a viable alternative, if not the most appropriate matching method, to apply when evaluating CCM program performance.

  5. Evaluation of a National E-Mentoring Program for Ethnically Diverse Student Nurse-Midwives and Student Midwives.

    PubMed

    Valentin-Welch, Maria

    2016-11-01

    The US racial profile is changing rapidly, yet the nursing and midwifery professions are not evolving accordingly. The lack of racial and ethnic diversity within these health professions negatively affects efforts to eliminate persistent health disparities. To address this issue, the Midwives of Color Committee (MOCC) of the American College of Nurse-Midwives (ACNM) created a national online mentoring program in 2011 to support midwifery students of color. An evaluation of the program is reported here. This was a descriptive study conducted via online surveys mailed to 44 mentors and 42 mentees who participated in the program during 2012. Categorical survey responses were compared between groups, and open-ended responses were evaluated for common themes. Response rates differed across groups. Half of the mentors responded (50%), while only 38.1% of the mentees responded. The majority of mentors and mentees rated the program as either excellent or good and felt the program should continue. Both mentors and mentees shared similar positive ratings about the effectiveness of the application, speed with which matching occurred, and satisfaction with mentee-mentor match; they also share less favorable ratings regarding frequency of communication, impact of geographic proximity, and academic support need and response. Both groups desired to live closer to one another and communicate more. This study suggests that the online mentoring program for student midwives of color currently being offered should continue but with enhancements to improve the face-to-face mentoring experience, including the use of computer-based technology. Other program improvements are also recommended. To be truly effective, mentoring programs must meet the needs of mentors and mentees; future evaluations should clarify their potential as an important tool for increasing diversity. © 2016 by the American College of Nurse-Midwives.

  6. Fast Legendre moment computation for template matching

    NASA Astrophysics Data System (ADS)

    Li, Bing C.

    2017-05-01

    Normalized cross correlation (NCC) based template matching is insensitive to intensity changes and it has many applications in image processing, object detection, video tracking and pattern recognition. However, normalized cross correlation implementation is computationally expensive since it involves both correlation computation and normalization implementation. In this paper, we propose Legendre moment approach for fast normalized cross correlation implementation and show that the computational cost of this proposed approach is independent of template mask sizes which is significantly faster than traditional mask size dependent approaches, especially for large mask templates. Legendre polynomials have been widely used in solving Laplace equation in electrodynamics in spherical coordinate systems, and solving Schrodinger equation in quantum mechanics. In this paper, we extend Legendre polynomials from physics to computer vision and pattern recognition fields, and demonstrate that Legendre polynomials can help to reduce the computational cost of NCC based template matching significantly.

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

    PubMed

    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.

  8. 75 FR 59800 - Privacy Act of 1974; Report of Matching Program

    Federal Register 2010, 2011, 2012, 2013, 2014

    2010-09-28

    ... beneficiaries who are receiving VA benefits, and to reduce or terminate benefits, if appropriate. The match will... beneficiaries and adjust VA benefit payments as prescribed by law. The proposed matching program will enable VA... matching Railroad Retirement Board (RRB), retirement and survivor benefits records with VA pension...

  9. Effects of Differential Reinforcement and Rules With Feedback on Preference for Choice and Verbal Reports

    PubMed Central

    Karsina, Allen; Thompson, Rachel H; Rodriguez, Nicole M; Vanselow, Nicholas R

    2012-01-01

    We evaluated the effects of differential reinforcement and accurate verbal rules with feedback on the preference for choice and the verbal reports of 6 adults. Participants earned points on a probabilistic schedule by completing the terminal links of a concurrent-chains arrangement in a computer-based game of chance. In free-choice terminal links, participants selected 3 numbers from an 8-number array; in restricted-choice terminal links participants selected the order of 3 numbers preselected by a computer program. A pop-up box then informed the participants if the numbers they selected or ordered matched or did not match numbers generated by the computer but not displayed; matching in a trial resulted in one point earned. In baseline sessions, schedules of reinforcement were equal across free- and restricted-choice arrangements and a running tally of points earned was shown each trial. The effects of differentially reinforcing restricted-choice selections were evaluated using a reversal design. For 4 participants, the effects of providing a running tally of points won by arrangement and verbal rules regarding the schedule of reinforcement were also evaluated using a nonconcurrent multiple-baseline-across-participants design. Results varied across participants but generally demonstrated that (a) preference for choice corresponded more closely to verbal reports of the odds of winning than to reinforcement schedules, (b) rules and feedback were correlated with more accurate verbal reports, and (c) preference for choice corresponded more highly to the relative number of reinforcements obtained across free- and restricted-choice arrangements in a session than to the obtained probability of reinforcement or to verbal reports of the odds of winning. PMID:22754103

  10. Effects of differential reinforcement and rules with feedback on preference for choice and verbal reports.

    PubMed

    Karsina, Allen; Thompson, Rachel H; Rodriguez, Nicole M; Vanselow, Nicholas R

    2012-01-01

    We evaluated the effects of differential reinforcement and accurate verbal rules with feedback on the preference for choice and the verbal reports of 6 adults. Participants earned points on a probabilistic schedule by completing the terminal links of a concurrent-chains arrangement in a computer-based game of chance. In free-choice terminal links, participants selected 3 numbers from an 8-number array; in restricted-choice terminal links participants selected the order of 3 numbers preselected by a computer program. A pop-up box then informed the participants if the numbers they selected or ordered matched or did not match numbers generated by the computer but not displayed; matching in a trial resulted in one point earned. In baseline sessions, schedules of reinforcement were equal across free- and restricted-choice arrangements and a running tally of points earned was shown each trial. The effects of differentially reinforcing restricted-choice selections were evaluated using a reversal design. For 4 participants, the effects of providing a running tally of points won by arrangement and verbal rules regarding the schedule of reinforcement were also evaluated using a nonconcurrent multiple-baseline-across-participants design. Results varied across participants but generally demonstrated that (a) preference for choice corresponded more closely to verbal reports of the odds of winning than to reinforcement schedules, (b) rules and feedback were correlated with more accurate verbal reports, and (c) preference for choice corresponded more highly to the relative number of reinforcements obtained across free- and restricted-choice arrangements in a session than to the obtained probability of reinforcement or to verbal reports of the odds of winning.

  11. Multiaxial Cyclic Thermoplasticity Analysis with Besseling's Subvolume Method

    NASA Technical Reports Server (NTRS)

    Mcknight, R. L.

    1983-01-01

    A modification was formulated to Besseling's Subvolume Method to allow it to use multilinear stress-strain curves which are temperature dependent to perform cyclic thermoplasticity analyses. This method automotically reproduces certain aspects of real material behavior important in the analysis of Aircraft Gas Turbine Engine (AGTE) components. These include the Bauschinger effect, cross-hardening, and memory. This constitutive equation was implemented in a finite element computer program called CYANIDE. Subsequently, classical time dependent plasticity (creep) was added to the program. Since its inception, this program was assessed against laboratory and component testing and engine experience. The ability of this program to simulate AGTE material response characteristics was verified by this experience and its utility in providing data for life analyses was demonstrated. In this area of life analysis, the multiaxial thermoplasticity capabilities of the method have proved a match for the actual AGTE life experience.

  12. PSC algorithm description

    NASA Technical Reports Server (NTRS)

    Nobbs, Steven G.

    1995-01-01

    An overview of the performance seeking control (PSC) algorithm and details of the important components of the algorithm are given. The onboard propulsion system models, the linear programming optimization, and engine control interface are described. The PSC algorithm receives input from various computers on the aircraft including the digital flight computer, digital engine control, and electronic inlet control. The PSC algorithm contains compact models of the propulsion system including the inlet, engine, and nozzle. The models compute propulsion system parameters, such as inlet drag and fan stall margin, which are not directly measurable in flight. The compact models also compute sensitivities of the propulsion system parameters to change in control variables. The engine model consists of a linear steady state variable model (SSVM) and a nonlinear model. The SSVM is updated with efficiency factors calculated in the engine model update logic, or Kalman filter. The efficiency factors are used to adjust the SSVM to match the actual engine. The propulsion system models are mathematically integrated to form an overall propulsion system model. The propulsion system model is then optimized using a linear programming optimization scheme. The goal of the optimization is determined from the selected PSC mode of operation. The resulting trims are used to compute a new operating point about which the optimization process is repeated. This process is continued until an overall (global) optimum is reached before applying the trims to the controllers.

  13. An algorithm for automating the registration of USDA segment ground data to LANDSAT MSS data

    NASA Technical Reports Server (NTRS)

    Graham, M. H. (Principal Investigator)

    1981-01-01

    The algorithm is referred to as the Automatic Segment Matching Algorithm (ASMA). The ASMA uses control points or the annotation record of a P-format LANDSAT compter compatible tape as the initial registration to relate latitude and longitude to LANDSAT rows and columns. It searches a given area of LANDSAT data with a 2x2 sliding window and computes gradient values for bands 5 and 7 to match the segment boundaries. The gradient values are held in memory during the shifting (or matching) process. The reconstructed segment array, containing ones (1's) for boundaries and zeros elsewhere are computer compared to the LANDSAT array and the best match computed. Initial testing of the ASMA indicates that it has good potential for replacing the manual technique.

  14. reCAPTCHA: human-based character recognition via Web security measures.

    PubMed

    von Ahn, Luis; Maurer, Benjamin; McMillen, Colin; Abraham, David; Blum, Manuel

    2008-09-12

    CAPTCHAs (Completely Automated Public Turing test to tell Computers and Humans Apart) are widespread security measures on the World Wide Web that prevent automated programs from abusing online services. They do so by asking humans to perform a task that computers cannot yet perform, such as deciphering distorted characters. Our research explored whether such human effort can be channeled into a useful purpose: helping to digitize old printed material by asking users to decipher scanned words from books that computerized optical character recognition failed to recognize. We showed that this method can transcribe text with a word accuracy exceeding 99%, matching the guarantee of professional human transcribers. Our apparatus is deployed in more than 40,000 Web sites and has transcribed over 440 million words.

  15. Numerical simulation of the helium gas spin-up channel performance of the relativity gyroscope

    NASA Technical Reports Server (NTRS)

    Karr, Gerald R.; Edgell, Josephine; Zhang, Burt X.

    1991-01-01

    The dependence of the spin-up system efficiency on each geometrical parameter of the spin-up channel and the exhaust passage of the Gravity Probe-B (GPB) is individually investigated. The spin-up model is coded into a computer program which simulates the spin-up process. Numerical results reveal optimal combinations of the geometrical parameters for the ultimate spin-up performance. Comparisons are also made between the numerical results and experimental data. The experimental leakage rate can only be reached when the gap between the channel lip and the rotor surface increases beyond physical limit. The computed rotating frequency is roughly twice as high as the measured ones although the spin-up torques fairly match.

  16. Real-time line matching from stereo images using a nonparametric transform of spatial relations and texture information

    NASA Astrophysics Data System (ADS)

    Park, Jonghee; Yoon, Kuk-Jin

    2015-02-01

    We propose a real-time line matching method for stereo systems. To achieve real-time performance while retaining a high level of matching precision, we first propose a nonparametric transform to represent the spatial relations between neighboring lines and nearby textures as a binary stream. Since the length of a line can vary across images, the matching costs between lines are computed within an overlap area (OA) based on the binary stream. The OA is determined for each line pair by employing the properties of a rectified image pair. Finally, the line correspondence is determined using a winner-takes-all method with a left-right consistency check. To reduce the computational time requirements further, we filter out unreliable matching candidates in advance based on their rectification properties. The performance of the proposed method was compared with state-of-the-art methods in terms of the computational time, matching precision, and recall. The proposed method required 47 ms to match lines from an image pair in the KITTI dataset with an average precision of 95%. We also verified the proposed method under image blur, illumination variation, and viewpoint changes.

  17. Provider-Independent Use of the Cloud

    NASA Astrophysics Data System (ADS)

    Harmer, Terence; Wright, Peter; Cunningham, Christina; Perrott, Ron

    Utility computing offers researchers and businesses the potential of significant cost-savings, making it possible for them to match the cost of their computing and storage to their demand for such resources. A utility compute provider enables the purchase of compute infrastructures on-demand; when a user requires computing resources a provider will provision a resource for them and charge them only for their period of use of that resource. There has been a significant growth in the number of cloud computing resource providers and each has a different resource usage model, application process and application programming interface (API)-developing generic multi-resource provider applications is thus difficult and time consuming. We have developed an abstraction layer that provides a single resource usage model, user authentication model and API for compute providers that enables cloud-provider neutral applications to be developed. In this paper we outline the issues in using external resource providers, give examples of using a number of the most popular cloud providers and provide examples of developing provider neutral applications. In addition, we discuss the development of the API to create a generic provisioning model based on a common architecture for cloud computing providers.

  18. Automatic gender detection of dream reports: A promising approach.

    PubMed

    Wong, Christina; Amini, Reza; De Koninck, Joseph

    2016-08-01

    A computer program was developed in an attempt to differentiate the dreams of males from females. Hypothesized gender predictors were based on previous literature concerning both dream content and written language features. Dream reports from home-collected dream diaries of 100 male (144 dreams) and 100 female (144 dreams) adolescent Anglophones were matched for equal length. They were first scored with the Hall and Van de Castle (HVDC) scales and quantified using DreamSAT. Two male and two female undergraduate students were asked to read all dreams and predict the dreamer's gender. They averaged a pairwise percent correct gender prediction of 75.8% (κ=0.516), while the Automatic Analysis showed that the computer program's accuracy was 74.5% (κ=0.492), both of which were higher than chance of 50% (κ=0.00). The prediction levels were maintained when dreams containing obvious gender identifiers were eliminated and integration of HVDC scales did not improve prediction. Copyright © 2016 Elsevier Inc. All rights reserved.

  19. Three-dimensional particle tracking velocimetry algorithm based on tetrahedron vote

    NASA Astrophysics Data System (ADS)

    Cui, Yutong; Zhang, Yang; Jia, Pan; Wang, Yuan; Huang, Jingcong; Cui, Junlei; Lai, Wing T.

    2018-02-01

    A particle tracking velocimetry algorithm based on tetrahedron vote, which is named TV-PTV, is proposed to overcome the limited selection problem of effective algorithms for 3D flow visualisation. In this new cluster-matching algorithm, tetrahedrons produced by the Delaunay tessellation are used as the basic units for inter-frame matching, which results in a simple algorithmic structure of only two independent preset parameters. Test results obtained using the synthetic test image data from the Visualisation Society of Japan show that TV-PTV presents accuracy comparable to that of the classical algorithm based on new relaxation method (NRX). Compared with NRX, TV-PTV possesses a smaller number of loops in programming and thus a shorter computing time, especially for large particle displacements and high particle concentration. TV-PTV is confirmed practically effective using an actual 3D wake flow.

  20. Predictors of Premature Match Closure in Youth Mentoring Relationships.

    PubMed

    Kupersmidt, Janis B; Stump, Kathryn N; Stelter, Rebecca L; Rhodes, Jean E

    2017-03-01

    Although mentoring is a popular and effective means of intervention with youth, the positive effects of mentoring can be diminished by premature match closure of relationships. Program, mentor, and mentee characteristics were examined as predictors of premature match closure. Secondary data analyses were conducted on a large national database of mentoring programs consisting of match and youth risk information from 170 mentoring programs and 6468 matches from across the U.S. Premature closure was associated with mentee age at match inception and 19 individual mentee characteristics. The set of mentee characteristics were examined as part of a cumulative risk index encompassing seven conceptually combined categories including family background characteristics, school functioning problems, engagement in risky health behaviors, self-regulation difficulties, engagement in illegal or criminal activities, and internalizing and externalizing behavior problems. Both the age of mentees when matched and the cumulative risk index score significantly predicted premature closure. Results are discussed in terms of directions for future research and suggestions for enhancing mentoring program practices. © Society for Community Research and Action 2017.

  1. CGI: Java Software for Mapping and Visualizing Data from Array-based Comparative Genomic Hybridization and Expression Profiling

    PubMed Central

    Gu, Joyce Xiuweu-Xu; Wei, Michael Yang; Rao, Pulivarthi H.; Lau, Ching C.; Behl, Sanjiv; Man, Tsz-Kwong

    2007-01-01

    With the increasing application of various genomic technologies in biomedical research, there is a need to integrate these data to correlate candidate genes/regions that are identified by different genomic platforms. Although there are tools that can analyze data from individual platforms, essential software for integration of genomic data is still lacking. Here, we present a novel Java-based program called CGI (Cytogenetics-Genomics Integrator) that matches the BAC clones from array-based comparative genomic hybridization (aCGH) to genes from RNA expression profiling datasets. The matching is computed via a fast, backend MySQL database containing UCSC Genome Browser annotations. This program also provides an easy-to-use graphical user interface for visualizing and summarizing the correlation of DNA copy number changes and RNA expression patterns from a set of experiments. In addition, CGI uses a Java applet to display the copy number values of a specific BAC clone in aCGH experiments side by side with the expression levels of genes that are mapped back to that BAC clone from the microarray experiments. The CGI program is built on top of extensible, reusable graphic components specifically designed for biologists. It is cross-platform compatible and the source code is freely available under the General Public License. PMID:19936083

  2. CGI: Java software for mapping and visualizing data from array-based comparative genomic hybridization and expression profiling.

    PubMed

    Gu, Joyce Xiuweu-Xu; Wei, Michael Yang; Rao, Pulivarthi H; Lau, Ching C; Behl, Sanjiv; Man, Tsz-Kwong

    2007-10-06

    With the increasing application of various genomic technologies in biomedical research, there is a need to integrate these data to correlate candidate genes/regions that are identified by different genomic platforms. Although there are tools that can analyze data from individual platforms, essential software for integration of genomic data is still lacking. Here, we present a novel Java-based program called CGI (Cytogenetics-Genomics Integrator) that matches the BAC clones from array-based comparative genomic hybridization (aCGH) to genes from RNA expression profiling datasets. The matching is computed via a fast, backend MySQL database containing UCSC Genome Browser annotations. This program also provides an easy-to-use graphical user interface for visualizing and summarizing the correlation of DNA copy number changes and RNA expression patterns from a set of experiments. In addition, CGI uses a Java applet to display the copy number values of a specific BAC clone in aCGH experiments side by side with the expression levels of genes that are mapped back to that BAC clone from the microarray experiments. The CGI program is built on top of extensible, reusable graphic components specifically designed for biologists. It is cross-platform compatible and the source code is freely available under the General Public License.

  3. 39 CFR 266.10 - Computer matching.

    Code of Federal Regulations, 2012 CFR

    2012-07-01

    ... Service UNITED STATES POSTAL SERVICE ORGANIZATION AND ADMINISTRATION PRIVACY OF INFORMATION § 266.10... matching proposals. A proposal must include information required for the matching agreement discussed in... matching proposals, whether from postal organizations or other government agencies, must be mailed directly...

  4. 39 CFR 266.10 - Computer matching.

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ... Service UNITED STATES POSTAL SERVICE ORGANIZATION AND ADMINISTRATION PRIVACY OF INFORMATION § 266.10... matching proposals. A proposal must include information required for the matching agreement discussed in... matching proposals, whether from postal organizations or other government agencies, must be mailed directly...

  5. 39 CFR 266.10 - Computer matching.

    Code of Federal Regulations, 2014 CFR

    2014-07-01

    ... Service UNITED STATES POSTAL SERVICE ORGANIZATION AND ADMINISTRATION PRIVACY OF INFORMATION § 266.10... matching proposals. A proposal must include information required for the matching agreement discussed in... matching proposals, whether from postal organizations or other government agencies, must be mailed directly...

  6. 39 CFR 266.10 - Computer matching.

    Code of Federal Regulations, 2011 CFR

    2011-07-01

    ... Service UNITED STATES POSTAL SERVICE ORGANIZATION AND ADMINISTRATION PRIVACY OF INFORMATION § 266.10... matching proposals. A proposal must include information required for the matching agreement discussed in... matching proposals, whether from postal organizations or other government agencies, must be mailed directly...

  7. 39 CFR 266.10 - Computer matching.

    Code of Federal Regulations, 2013 CFR

    2013-07-01

    ... Service UNITED STATES POSTAL SERVICE ORGANIZATION AND ADMINISTRATION PRIVACY OF INFORMATION § 266.10... matching proposals. A proposal must include information required for the matching agreement discussed in... matching proposals, whether from postal organizations or other government agencies, must be mailed directly...

  8. Standard model anatomy of WIMP dark matter direct detection. I. Weak-scale matching

    NASA Astrophysics Data System (ADS)

    Hill, Richard J.; Solon, Mikhail P.

    2015-02-01

    We present formalism necessary to determine weak-scale matching coefficients in the computation of scattering cross sections for putative dark matter candidates interacting with the Standard Model. We pay particular attention to the heavy-particle limit. A consistent renormalization scheme in the presence of nontrivial residual masses is implemented. Two-loop diagrams appearing in the matching to gluon operators are evaluated. Details are given for the computation of matching coefficients in the universal limit of WIMP-nucleon scattering for pure states of arbitrary quantum numbers, and for singlet-doublet and doublet-triplet mixed states.

  9. The Effect of Applicant Publication Volume on the Orthopaedic Residency Match.

    PubMed

    Campbell, Sean T; Gupta, Ryan; Avedian, Raffi S

    2016-01-01

    Research is an important factor used in evaluating applicants to orthopaedic training programs. Current reports regarding the publication rate among prospective residents are likely inaccurate. It is unknown whether research productivity is weighted more heavily at programs affiliated with research-driven institutions. To establish accurate baseline data on publication rate among matched applicants to orthopaedic residency programs and to compare publication rates between applicants who matched at research-focused institutions and those who matched elsewhere. We performed a literature search for each U.S. resident in the 2013-2014 intern class. Number of publications: (1) in total, (2) in orthopaedic journals, and (3) as first/last author were recorded. Publication rate at the top 25 programs (according to medical school and departmental National Institutes of Health [NIH] funding and U.S. News ranking) was compared statistically against all others. Average number of publications per intern for all programs was 1.28 ± 0.15. Number of total and first/last author publications was significantly greater for programs affiliated with medical schools and departments in the top 25 for NIH funding, and at schools in the top 25 U.S. News rankings. Publication rate in orthopaedic journals was significantly higher for programs affiliated with departments in the top 25 for NIH funding and at top 25 U.S. News medical schools. The average matched applicant to an orthopaedic residency program publishes in the peer-reviewed literature less frequently than previously reported. Matched applicants at research-focused institutions tended to have more publications than those who matched at other programs. Copyright © 2016 Association of Program Directors in Surgery. Published by Elsevier Inc. All rights reserved.

  10. Send-side matching of data communications messages

    DOEpatents

    Archer, Charles J.; Blocksome, Michael A.; Ratterman, Joseph D.; Smith, Brian E.

    2014-06-17

    Send-side matching of data communications messages in a distributed computing system comprising a plurality of compute nodes, including: issuing by a receiving node to source nodes a receive message that specifies receipt of a single message to be sent from any source node, the receive message including message matching information, a specification of a hardware-level mutual exclusion device, and an identification of a receive buffer; matching by two or more of the source nodes the receive message with pending send messages in the two or more source nodes; operating by one of the source nodes having a matching send message the mutual exclusion device, excluding messages from other source nodes with matching send messages and identifying to the receiving node the source node operating the mutual exclusion device; and sending to the receiving node from the source node operating the mutual exclusion device a matched pending message.

  11. Coupled rotor/airframe vibration analysis

    NASA Technical Reports Server (NTRS)

    Sopher, R.; Studwell, R. E.; Cassarino, S.; Kottapalli, S. B. R.

    1982-01-01

    A coupled rotor/airframe vibration analysis developed as a design tool for predicting helicopter vibrations and a research tool to quantify the effects of structural properties, aerodynamic interactions, and vibration reduction devices on vehicle vibration levels is described. The analysis consists of a base program utilizing an impedance matching technique to represent the coupled rotor/airframe dynamics of the system supported by inputs from several external programs supplying sophisticated rotor and airframe aerodynamic and structural dynamic representation. The theoretical background, computer program capabilities and limited correlation results are presented in this report. Correlation results using scale model wind tunnel results show that the analysis can adequately predict trends of vibration variations with airspeed and higher harmonic control effects. Predictions of absolute values of vibration levels were found to be very sensitive to modal characteristics and results were not representative of measured values.

  12. Probabilistic arithmetic automata and their applications.

    PubMed

    Marschall, Tobias; Herms, Inke; Kaltenbach, Hans-Michael; Rahmann, Sven

    2012-01-01

    We present a comprehensive review on probabilistic arithmetic automata (PAAs), a general model to describe chains of operations whose operands depend on chance, along with two algorithms to numerically compute the distribution of the results of such probabilistic calculations. PAAs provide a unifying framework to approach many problems arising in computational biology and elsewhere. We present five different applications, namely 1) pattern matching statistics on random texts, including the computation of the distribution of occurrence counts, waiting times, and clump sizes under hidden Markov background models; 2) exact analysis of window-based pattern matching algorithms; 3) sensitivity of filtration seeds used to detect candidate sequence alignments; 4) length and mass statistics of peptide fragments resulting from enzymatic cleavage reactions; and 5) read length statistics of 454 and IonTorrent sequencing reads. The diversity of these applications indicates the flexibility and unifying character of the presented framework. While the construction of a PAA depends on the particular application, we single out a frequently applicable construction method: We introduce deterministic arithmetic automata (DAAs) to model deterministic calculations on sequences, and demonstrate how to construct a PAA from a given DAA and a finite-memory random text model. This procedure is used for all five discussed applications and greatly simplifies the construction of PAAs. Implementations are available as part of the MoSDi package. Its application programming interface facilitates the rapid development of new applications based on the PAA framework.

  13. Evaluation of the content and accessibility of microsurgery fellowship program websites.

    PubMed

    Silvestre, Jason; Vargas, Christina R; Ho, Olivia; Lee, Bernard T

    2015-10-01

    Microsurgery fellowship applicants utilize Internet-based resources such as the San Francisco Match (SF Match) to manage their applications. In deciding where to apply, applicants rely on advice from mentors and online resources including microsurgery fellowship websites (MFWs). The purpose of this study was to evaluate the content and accessibility of MFWs. While microsurgery is practiced by many surgical specialties, this study focused on MFWs for programs available in the 2014 Microsurgery Fellowship Match. Program lists from the American Society for Reconstructive Microsurgery (ASRM) and the San Francisco Match (SF Match) were analyzed for the accessibility of MFW links. MFWs were evaluated for education and recruitment content, and MFW comprehensiveness was compared on the basis of program characteristics using chi square tests. Of the 25 fellowships available, only 18 had websites (72%). SF Match and ASRM listed similar programs (96% overlap) and provided website links (89%, 76%), but only a minority connected directly to the MFW (38%, 23%). A minority of programs were responsive via email inquiry (36%). MFWs maintained minimal education and recruitment content. MFW comprehensiveness was not associated with program characteristics. MFWs are often not readily accessible and contain limited information for fellowship applicants. Given the relative low-cost of website development, MFWs may be improved to facilitate fellow recruitment. © 2015 Wiley Periodicals, Inc.

  14. FX-87 performance measurements: data-flow implementation. Technical report

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Hammel, R.T.; Gifford, D.K.

    1988-11-01

    This report documents a series of experiments performed to explore the thesis that the FX-87 effect system permits a compiler to schedule imperative programs (i.e., programs that may contain side-effects) for execution on a parallel computer. The authors analyze how much the FX-87 static effect system can improve the execution times of five benchmark programs on a parallel graph interpreter. Three of their benchmark programs do not use side-effects (factorial, fibonacci, and polynomial division) and thus did not have any effect-induced constraints. Their FX-87 performance was comparable to their performance in a purely functional language. Two of the benchmark programsmore » use side effects (DNA sequence matching and Scheme interpretation) and the compiler was able to use effect information to reduce their execution times by factors of 1.7 to 5.4 when compared with sequential execution times. These results support the thesis that a static effect system is a powerful tool for compilation to multiprocessor computers. However, the graph interpreter we used was based on unrealistic assumptions, and thus our results may not accurately reflect the performance of a practical FX-87 implementation. The results also suggest that conventional loop analysis would complement the FX-87 effect system« less

  15. Satellite Image Mosaic Engine

    NASA Technical Reports Server (NTRS)

    Plesea, Lucian

    2006-01-01

    A computer program automatically builds large, full-resolution mosaics of multispectral images of Earth landmasses from images acquired by Landsat 7, complete with matching of colors and blending between adjacent scenes. While the code has been used extensively for Landsat, it could also be used for other data sources. A single mosaic of as many as 8,000 scenes, represented by more than 5 terabytes of data and the largest set produced in this work, demonstrated what the code could do to provide global coverage. The program first statistically analyzes input images to determine areas of coverage and data-value distributions. It then transforms the input images from their original universal transverse Mercator coordinates to other geographical coordinates, with scaling. It applies a first-order polynomial brightness correction to each band in each scene. It uses a data-mask image for selecting data and blending of input scenes. Under control by a user, the program can be made to operate on small parts of the output image space, with check-point and restart capabilities. The program runs on SGI IRIX computers. It is capable of parallel processing using shared-memory code, large memories, and tens of central processing units. It can retrieve input data and store output data at locations remote from the processors on which it is executed.

  16. Ant Lion Optimization algorithm for kidney exchanges.

    PubMed

    Hamouda, Eslam; El-Metwally, Sara; Tarek, Mayada

    2018-01-01

    The kidney exchange programs bring new insights in the field of organ transplantation. They make the previously not allowed surgery of incompatible patient-donor pairs easier to be performed on a large scale. Mathematically, the kidney exchange is an optimization problem for the number of possible exchanges among the incompatible pairs in a given pool. Also, the optimization modeling should consider the expected quality-adjusted life of transplant candidates and the shortage of computational and operational hospital resources. In this article, we introduce a bio-inspired stochastic-based Ant Lion Optimization, ALO, algorithm to the kidney exchange space to maximize the number of feasible cycles and chains among the pool pairs. Ant Lion Optimizer-based program achieves comparable kidney exchange results to the deterministic-based approaches like integer programming. Also, ALO outperforms other stochastic-based methods such as Genetic Algorithm in terms of the efficient usage of computational resources and the quantity of resulting exchanges. Ant Lion Optimization algorithm can be adopted easily for on-line exchanges and the integration of weights for hard-to-match patients, which will improve the future decisions of kidney exchange programs. A reference implementation for ALO algorithm for kidney exchanges is written in MATLAB and is GPL licensed. It is available as free open-source software from: https://github.com/SaraEl-Metwally/ALO_algorithm_for_Kidney_Exchanges.

  17. 77 FR 23491 - Notice of Submission of Proposed Information Collection to OMB; Continuum of Care Homeless...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-04-19

    ... Program, and changed to match the new inclusive program name created through the HEARTH Act. DATES... Occupancy Program, and changed to match the new inclusive program name created through the HEARTH Act...

  18. 39 CFR 262.5 - Systems (Privacy).

    Code of Federal Regulations, 2010 CFR

    2010-07-01

    ..., partnerships or corporations. A business firm identified by the name of one or more persons is not an... computer matches are specifically excluded from the term “matching program”: (i) Statistical matches whose purpose is solely to produce aggregate data stripped of personal identifiers. (ii) Statistical matches...

  19. The Gastroenterology Fellowship Match: A Decade Later.

    PubMed

    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. Openlobby: an open game server for lobby and matchmaking

    NASA Astrophysics Data System (ADS)

    Zamzami, E. M.; Tarigan, J. T.; Jaya, I.; Hardi, S. M.

    2018-03-01

    Online Multiplayer is one of the most essential feature in modern games. However, while developing a multiplayer feature can be done with a simple computer networking programming, creating a balanced multiplayer session requires more player management components such as game lobby and matchmaking system. Our objective is to develop OpenLobby, a server that available to be used by other developers to support their multiplayer application. The proposed system acts as a lobby and matchmaker where queueing players will be matched to other player according to a certain criteria defined by developer. The solution provides an application programing interface that can be used by developer to interact with the server. For testing purpose, we developed a game that uses the server as their multiplayer server.

  1. Fast group matching for MR fingerprinting reconstruction.

    PubMed

    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.

  2. Analysis of User Interaction with a Brain-Computer Interface Based on Steady-State Visually Evoked Potentials: Case Study of a Game

    PubMed Central

    de Carvalho, Sarah Negreiros; Costa, Thiago Bulhões da Silva; Attux, Romis; Hornung, Heiko Horst; Arantes, Dalton Soares

    2018-01-01

    This paper presents a systematic analysis of a game controlled by a Brain-Computer Interface (BCI) based on Steady-State Visually Evoked Potentials (SSVEP). The objective is to understand BCI systems from the Human-Computer Interface (HCI) point of view, by observing how the users interact with the game and evaluating how the interface elements influence the system performance. The interactions of 30 volunteers with our computer game, named “Get Coins,” through a BCI based on SSVEP, have generated a database of brain signals and the corresponding responses to a questionnaire about various perceptual parameters, such as visual stimulation, acoustic feedback, background music, visual contrast, and visual fatigue. Each one of the volunteers played one match using the keyboard and four matches using the BCI, for comparison. In all matches using the BCI, the volunteers achieved the goals of the game. Eight of them achieved a perfect score in at least one of the four matches, showing the feasibility of the direct communication between the brain and the computer. Despite this successful experiment, adaptations and improvements should be implemented to make this innovative technology accessible to the end user. PMID:29849549

  3. Analysis of User Interaction with a Brain-Computer Interface Based on Steady-State Visually Evoked Potentials: Case Study of a Game.

    PubMed

    Leite, Harlei Miguel de Arruda; de Carvalho, Sarah Negreiros; Costa, Thiago Bulhões da Silva; Attux, Romis; Hornung, Heiko Horst; Arantes, Dalton Soares

    2018-01-01

    This paper presents a systematic analysis of a game controlled by a Brain-Computer Interface (BCI) based on Steady-State Visually Evoked Potentials (SSVEP). The objective is to understand BCI systems from the Human-Computer Interface (HCI) point of view, by observing how the users interact with the game and evaluating how the interface elements influence the system performance. The interactions of 30 volunteers with our computer game, named "Get Coins," through a BCI based on SSVEP, have generated a database of brain signals and the corresponding responses to a questionnaire about various perceptual parameters, such as visual stimulation, acoustic feedback, background music, visual contrast, and visual fatigue. Each one of the volunteers played one match using the keyboard and four matches using the BCI, for comparison. In all matches using the BCI, the volunteers achieved the goals of the game. Eight of them achieved a perfect score in at least one of the four matches, showing the feasibility of the direct communication between the brain and the computer. Despite this successful experiment, adaptations and improvements should be implemented to make this innovative technology accessible to the end user.

  4. 76 FR 59109 - Agency Information Collection Activities: Proposed Collection; Comment Request-Supplemental...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2011-09-23

    ... Nutrition Assistance Program Prisoner and Death Match Requirements AGENCY: Food and Nutrition Service (FNS.... SUPPLEMENTARY INFORMATION: Title: Supplemental Nutrition Assistance Program Prisoner and Death Match... verification and death matching procedures as mandated by legislation and previously implemented through agency...

  5. 24 CFR 92.219 - Recognition of matching contribution.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ... 24 Housing and Urban Development 1 2010-04-01 2010-04-01 false Recognition of matching contribution. 92.219 Section 92.219 Housing and Urban Development Office of the Secretary, Department of Housing and Urban Development HOME INVESTMENT PARTNERSHIPS PROGRAM Program Requirements Matching...

  6. Predictors of matching in an ophthalmology residency program.

    PubMed

    Loh, Allison R; Joseph, Damien; Keenan, Jeremy D; Lietman, Thomas M; Naseri, Ayman

    2013-04-01

    To examine the characteristics of US medical students applying for ophthalmology residency and to determine the predictors of matching. A retrospective case series. A total of 3435 medical students from the United States who applied to an ophthalmology residency program from 2003 to 2008 were included. Matched and unmatched applicants were compared and stratified by predictor variables, including United States Medical Licensing Examination (USMLE) Step 1 score, Alpha Omega Alpha (AOA) status, medical school reputation, and medical school geographic region. Differences in proportions were analyzed using the Fisher exact test. Logistic regression was used to determine the predictors of successful matching. Successful matching to an ophthalmology program. The majority of applicants (72%, 2486/3435) matched in ophthalmology. In multivariate analysis, AOA membership (odds ratio [OR], 2.6, P<0.0001), USMLE score (OR, 1.6; P<0.0001), presence of an ophthalmology residency at medical school (OR, 1.4; P = 0.01), top 25 medical school (OR, 1.4; P<0.03), top 10 medical school (OR, 1.6; P<0.02), and allopathic degree (OR, 4.0; P<0.0001) were statistically significant predictors of matching. Approximately 60% (1442/2486) of applicants matched to the same geographic region as their medical school. Applicants were more likely to match at a program in the same geographic region as their medical school than would be predicted by chance alone (P<0.0001). In multivariate analysis, higher USMLE score (OR, 0.9; P<0.0001) and top 10 medical school (OR, 0.7; P = 0.027) were statistically significant predictors of matching to outside the geographic region as one's medical school. The majority of applicants applying for an ophthalmology residency position match successfully. Higher performance on quantitative metrics seems to confer an advantage for matching. The majority of applicants match at a residency program within the same geographic region as one's medical school. Copyright © 2013 American Academy of Ophthalmology. Published by Elsevier Inc. All rights reserved.

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

    PubMed Central

    Nagler, Alisa; Engle, Deborah L.; Rudd, Mariah; Chudgar, Saumil M.; Weinerth, John L.; Kuhn, Catherine M.; Buckley, Edward; Grochowski, Colleen O’Connor

    2016-01-01

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

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

    PubMed

    Nagler, Alisa; Engle, Deborah L; Rudd, Mariah; Chudgar, Saumil M; Weinerth, John L; Kuhn, Catherine M; Buckley, Edward; Grochowski, Colleen O'Connor

    2016-01-01

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

  9. Python-Based Applications for Hydrogeological Modeling

    NASA Astrophysics Data System (ADS)

    Khambhammettu, P.

    2013-12-01

    Python is a general-purpose, high-level programming language whose design philosophy emphasizes code readability. Add-on packages supporting fast array computation (numpy), plotting (matplotlib), scientific /mathematical Functions (scipy), have resulted in a powerful ecosystem for scientists interested in exploratory data analysis, high-performance computing and data visualization. Three examples are provided to demonstrate the applicability of the Python environment in hydrogeological applications. Python programs were used to model an aquifer test and estimate aquifer parameters at a Superfund site. The aquifer test conducted at a Groundwater Circulation Well was modeled with the Python/FORTRAN-based TTIM Analytic Element Code. The aquifer parameters were estimated with PEST such that a good match was produced between the simulated and observed drawdowns. Python scripts were written to interface with PEST and visualize the results. A convolution-based approach was used to estimate source concentration histories based on observed concentrations at receptor locations. Unit Response Functions (URFs) that relate the receptor concentrations to a unit release at the source were derived with the ATRANS code. The impact of any releases at the source could then be estimated by convolving the source release history with the URFs. Python scripts were written to compute and visualize receptor concentrations for user-specified source histories. The framework provided a simple and elegant way to test various hypotheses about the site. A Python/FORTRAN-based program TYPECURVEGRID-Py was developed to compute and visualize groundwater elevations and drawdown through time in response to a regional uniform hydraulic gradient and the influence of pumping wells using either the Theis solution for a fully-confined aquifer or the Hantush-Jacob solution for a leaky confined aquifer. The program supports an arbitrary number of wells that can operate according to arbitrary schedules. The python wrapper invokes the underlying FORTRAN layer to compute transient groundwater elevations and processes this information to create time-series and 2D plots.

  10. Organ doses for reference adult male and female undergoing computed tomography estimated by Monte Carlo simulations

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Lee, Choonsik; Kim, Kwang Pyo; Long, Daniel

    2011-03-15

    Purpose: To develop a computed tomography (CT) organ dose estimation method designed to readily provide organ doses in a reference adult male and female for different scan ranges to investigate the degree to which existing commercial programs can reasonably match organ doses defined in these more anatomically realistic adult hybrid phantomsMethods: The x-ray fan beam in the SOMATOM Sensation 16 multidetector CT scanner was simulated within the Monte Carlo radiation transport code MCNPX2.6. The simulated CT scanner model was validated through comparison with experimentally measured lateral free-in-air dose profiles and computed tomography dose index (CTDI) values. The reference adult malemore » and female hybrid phantoms were coupled with the established CT scanner model following arm removal to simulate clinical head and other body region scans. A set of organ dose matrices were calculated for a series of consecutive axial scans ranging from the top of the head to the bottom of the phantoms with a beam thickness of 10 mm and the tube potentials of 80, 100, and 120 kVp. The organ doses for head, chest, and abdomen/pelvis examinations were calculated based on the organ dose matrices and compared to those obtained from two commercial programs, CT-EXPO and CTDOSIMETRY. Organ dose calculations were repeated for an adult stylized phantom by using the same simulation method used for the adult hybrid phantom. Results: Comparisons of both lateral free-in-air dose profiles and CTDI values through experimental measurement with the Monte Carlo simulations showed good agreement to within 9%. Organ doses for head, chest, and abdomen/pelvis scans reported in the commercial programs exceeded those from the Monte Carlo calculations in both the hybrid and stylized phantoms in this study, sometimes by orders of magnitude. Conclusions: The organ dose estimation method and dose matrices established in this study readily provides organ doses for a reference adult male and female for different CT scan ranges and technical parameters. Organ doses from existing commercial programs do not reasonably match organ doses calculated for the hybrid phantoms due to differences in phantom anatomy, as well as differences in organ dose scaling parameters. The organ dose matrices developed in this study will be extended to cover different technical parameters, CT scanner models, and various age groups.« less

  11. Cosmic Reionization on Computers: Properties of the Post-reionization IGM

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Gnedin, Nickolay Y.; Becker, George D.; Fan, Xiaohui

    Here, we present a comparison between several observational tests of the post-reionization IGM and the numerical simulations of reionization completed under the Cosmic Reionization On Computers (CROC) project. The CROC simulations match the gap distribution reasonably well, and also provide a good match for the distribution of peak heights, but there is a notable lack of wide peaks in the simulated spectra and the flux PDFs are poorly matched in the narrow redshift interval 5.5 < z < 5.7, with the match at other redshifts being significantly better, albeit not exact. Both discrepancies are related: simulations show more opacity thanmore » the data.« less

  12. Cosmic Reionization on Computers: Properties of the Post-reionization IGM

    DOE PAGES

    Gnedin, Nickolay Y.; Becker, George D.; Fan, Xiaohui

    2017-05-19

    Here, we present a comparison between several observational tests of the post-reionization IGM and the numerical simulations of reionization completed under the Cosmic Reionization On Computers (CROC) project. The CROC simulations match the gap distribution reasonably well, and also provide a good match for the distribution of peak heights, but there is a notable lack of wide peaks in the simulated spectra and the flux PDFs are poorly matched in the narrow redshift interval 5.5 < z < 5.7, with the match at other redshifts being significantly better, albeit not exact. Both discrepancies are related: simulations show more opacity thanmore » the data.« less

  13. 7 CFR 3405.5 - Matching funds.

    Code of Federal Regulations, 2012 CFR

    2012-01-01

    ... 7 Agriculture 15 2012-01-01 2012-01-01 false Matching funds. 3405.5 Section 3405.5 Agriculture Regulations of the Department of Agriculture (Continued) NATIONAL INSTITUTE OF FOOD AND AGRICULTURE HIGHER EDUCATION CHALLENGE GRANTS PROGRAM Program Description § 3405.5 Matching funds. Each application must...

  14. 7 CFR 3405.5 - Matching funds.

    Code of Federal Regulations, 2011 CFR

    2011-01-01

    ... 7 Agriculture 15 2011-01-01 2011-01-01 false Matching funds. 3405.5 Section 3405.5 Agriculture Regulations of the Department of Agriculture (Continued) NATIONAL INSTITUTE OF FOOD AND AGRICULTURE HIGHER EDUCATION CHALLENGE GRANTS PROGRAM Program Description § 3405.5 Matching funds. Each application must...

  15. 7 CFR 3405.5 - Matching funds.

    Code of Federal Regulations, 2013 CFR

    2013-01-01

    ... 7 Agriculture 15 2013-01-01 2013-01-01 false Matching funds. 3405.5 Section 3405.5 Agriculture Regulations of the Department of Agriculture (Continued) NATIONAL INSTITUTE OF FOOD AND AGRICULTURE HIGHER EDUCATION CHALLENGE GRANTS PROGRAM Program Description § 3405.5 Matching funds. Each application must...

  16. 7 CFR 3405.5 - Matching funds.

    Code of Federal Regulations, 2014 CFR

    2014-01-01

    ... 7 Agriculture 15 2014-01-01 2014-01-01 false Matching funds. 3405.5 Section 3405.5 Agriculture Regulations of the Department of Agriculture (Continued) NATIONAL INSTITUTE OF FOOD AND AGRICULTURE HIGHER EDUCATION CHALLENGE GRANTS PROGRAM Program Description § 3405.5 Matching funds. Each application must...

  17. Accessibility and quality of online information for pediatric orthopaedic surgery fellowships.

    PubMed

    Davidson, Austin R; Murphy, Robert F; Spence, David D; Kelly, Derek M; Warner, William C; Sawyer, Jeffrey R

    2014-12-01

    Pediatric orthopaedic fellowship applicants commonly use online-based resources for information on potential programs. Two primary sources are the San Francisco Match (SF Match) database and the Pediatric Orthopaedic Society of North America (POSNA) database. We sought to determine the accessibility and quality of information that could be obtained by using these 2 sources. The online databases of the SF Match and POSNA were reviewed to determine the availability of embedded program links or external links for the included programs. If not available in the SF Match or POSNA data, Web sites for listed programs were located with a Google search. All identified Web sites were analyzed for accessibility, content volume, and content quality. At the time of online review, 50 programs, offering 68 positions, were listed in the SF Match database. Although 46 programs had links included with their information, 36 (72%) of them simply listed http://www.sfmatch.org as their unique Web site. Ten programs (20%) had external links listed, but only 2 (4%) linked directly to the fellowship web page. The POSNA database does not list any links to the 47 programs it lists, which offer 70 positions. On the basis of a Google search of the 50 programs listed in the SF Match database, web pages were found for 35. Of programs with independent web pages, all had a description of the program and 26 (74%) described their application process. Twenty-nine (83%) listed research requirements, 22 (63%) described the rotation schedule, and 12 (34%) discussed the on-call expectations. A contact telephone number and/or email address was provided by 97% of programs. Twenty (57%) listed both the coordinator and fellowship director, 9 (26%) listed the coordinator only, 5 (14%) listed the fellowship director only, and 1 (3%) had no contact information given. The SF Match and POSNA databases provide few direct links to fellowship Web sites, and individual program Web sites either do not exist or do not effectively convey information about the programs. Improved accessibility and accurate information online would allow potential applicants to obtain information about pediatric fellowships in a more efficient manner.

  18. Minimum-complexity helicopter simulation math model

    NASA Technical Reports Server (NTRS)

    Heffley, Robert K.; Mnich, Marc A.

    1988-01-01

    An example of a minimal complexity simulation helicopter math model is presented. Motivating factors are the computational delays, cost, and inflexibility of the very sophisticated math models now in common use. A helicopter model form is given which addresses each of these factors and provides better engineering understanding of the specific handling qualities features which are apparent to the simulator pilot. The technical approach begins with specification of features which are to be modeled, followed by a build up of individual vehicle components and definition of equations. Model matching and estimation procedures are given which enable the modeling of specific helicopters from basic data sources such as flight manuals. Checkout procedures are given which provide for total model validation. A number of possible model extensions and refinement are discussed. Math model computer programs are defined and listed.

  19. Application of Approximate Pattern Matching in Two Dimensional Spaces to Grid Layout for Biochemical Network Maps

    PubMed Central

    Inoue, Kentaro; Shimozono, Shinichi; Yoshida, Hideaki; Kurata, Hiroyuki

    2012-01-01

    Background For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. Results We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor) algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. Conclusions Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html. PMID:22679486

  20. Application of approximate pattern matching in two dimensional spaces to grid layout for biochemical network maps.

    PubMed

    Inoue, Kentaro; Shimozono, Shinichi; Yoshida, Hideaki; Kurata, Hiroyuki

    2012-01-01

    For visualizing large-scale biochemical network maps, it is important to calculate the coordinates of molecular nodes quickly and to enhance the understanding or traceability of them. The grid layout is effective in drawing compact, orderly, balanced network maps with node label spaces, but existing grid layout algorithms often require a high computational cost because they have to consider complicated positional constraints through the entire optimization process. We propose a hybrid grid layout algorithm that consists of a non-grid, fast layout (preprocessor) algorithm and an approximate pattern matching algorithm that distributes the resultant preprocessed nodes on square grid points. To demonstrate the feasibility of the hybrid layout algorithm, it is characterized in terms of the calculation time, numbers of edge-edge and node-edge crossings, relative edge lengths, and F-measures. The proposed algorithm achieves outstanding performances compared with other existing grid layouts. Use of an approximate pattern matching algorithm quickly redistributes the laid-out nodes by fast, non-grid algorithms on the square grid points, while preserving the topological relationships among the nodes. The proposed algorithm is a novel use of the pattern matching, thereby providing a breakthrough for grid layout. This application program can be freely downloaded from http://www.cadlive.jp/hybridlayout/hybridlayout.html.

  1. Analysis of a disk-on-rod surface wave element inside a corrugated horn using the mode-matching technique

    NASA Technical Reports Server (NTRS)

    Chen, J. C.

    1995-01-01

    A disk-on-rod inside a corrugated horn is one of the horn configurations for dual-frequency or wide-band operation. A mode-matching analysis method is described. A disk-on-rod inside a corrugated horn is represented as a series of coaxial waveguide sections and circular waveguide sections connected to each other. Three kinds of junctions need to be considered: coaxial-to-coaxial, coaxial-to-circular, and circular-to-circular. A computer program was developed to calculate the scattering matrix and the radiation pattern of a disk-on-rod inside a corrugated horn. The software as verified by experiment, and good agreement between calculation and measurement was obtained. The disk-on-rod inside a corrugated horn design gives an option to the Deep Space Network dual-frequency operation system, which currently is a two-horn/one-dichroic plate system.

  2. 24 CFR 5.234 - Requests for information from SWICAs and Federal agencies; restrictions on use.

    Code of Federal Regulations, 2013 CFR

    2013-04-01

    ...; WAIVERS Disclosure and Verification of Social Security Numbers and Employer Identification Numbers... obtained through computer matching agreements between HUD and a SWICA or Federal agency, or between a PHA... Privacy Act notice is required, as follows: (1) When HUD requests the computer match, the processing...

  3. 24 CFR 5.234 - Requests for information from SWICAs and Federal agencies; restrictions on use.

    Code of Federal Regulations, 2010 CFR

    2010-04-01

    ...; WAIVERS Disclosure and Verification of Social Security Numbers and Employer Identification Numbers... obtained through computer matching agreements between HUD and a SWICA or Federal agency, or between a PHA... Privacy Act notice is required, as follows: (1) When HUD requests the computer match, the processing...

  4. 24 CFR 5.234 - Requests for information from SWICAs and Federal agencies; restrictions on use.

    Code of Federal Regulations, 2011 CFR

    2011-04-01

    ...; WAIVERS Disclosure and Verification of Social Security Numbers and Employer Identification Numbers... obtained through computer matching agreements between HUD and a SWICA or Federal agency, or between a PHA... Privacy Act notice is required, as follows: (1) When HUD requests the computer match, the processing...

  5. 24 CFR 5.234 - Requests for information from SWICAs and Federal agencies; restrictions on use.

    Code of Federal Regulations, 2012 CFR

    2012-04-01

    ...; WAIVERS Disclosure and Verification of Social Security Numbers and Employer Identification Numbers... obtained through computer matching agreements between HUD and a SWICA or Federal agency, or between a PHA... Privacy Act notice is required, as follows: (1) When HUD requests the computer match, the processing...

  6. 24 CFR 5.234 - Requests for information from SWICAs and Federal agencies; restrictions on use.

    Code of Federal Regulations, 2014 CFR

    2014-04-01

    ...; WAIVERS Disclosure and Verification of Social Security Numbers and Employer Identification Numbers... obtained through computer matching agreements between HUD and a SWICA or Federal agency, or between a PHA... Privacy Act notice is required, as follows: (1) When HUD requests the computer match, the processing...

  7. Mentoring Program Enhancements Supporting Effective Mentoring of Children of Incarcerated Parents.

    PubMed

    Stump, Kathryn N; Kupersmidt, Janis B; Stelter, Rebecca L; Rhodes, Jean E

    2018-04-26

    Children of incarcerated parents (COIP) are at risk for a range of negative outcomes; however, participating in a mentoring relationship can be a promising intervention for these youth. This study examined the impact of mentoring and mentoring program enhancements on COIP. Secondary data analyses were conducted on an archival database consisting of 70,729 matches from 216 Big Brothers Big Sisters (BBBS) local agencies to establish the differential effects of mentoring on COIP. A subset of 45 BBBS agencies, representing 25,252 matches, participated in a telephone interview about program enhancements for better serving COIP. Results revealed that enhanced program practices, including having specific program goals, providing specialized mentor training, and receiving additional funding resulted in better outcomes for COIP matches. Specifically, specialized mentor training and receiving additional funding for serving matches containing COIP were associated with longer and stronger matches. Having specific goals for serving COIP was associated with higher educational expectations in COIP. Results are discussed in terms of benefits of a relationship-based intervention for addressing the needs of COIP and suggestions for program improvements when mentoring programs are serving this unique population of youth. © Society for Community Research and Action 2018.

  8. Computer-automated tinnitus assessment: noise-band matching, maskability, and residual inhibition.

    PubMed

    Henry, James A; Roberts, Larry E; Ellingson, Roger M; Thielman, Emily J

    2013-06-01

    Psychoacoustic measures of tinnitus typically include loudness and pitch match, minimum masking level (MML), and residual inhibition (RI). We previously developed and documented a computer-automated tinnitus evaluation system (TES) capable of subject-guided loudness and pitch matching. The TES was further developed to conduct computer-aided, subject-guided testing for noise-band matching (NBM), MML, and RI. The purpose of the present study was to document the capability of the upgraded TES to obtain measures of NBM, MML, and RI, and to determine the test-retest reliability of the responses obtained. Three subject-guided, computer-automated testing protocols were developed to conduct NBM. For MML and RI testing, a 2-12 kHz band of noise was used. All testing was repeated during a second session. Subjects meeting study criteria were selected from those who had previously been tested for loudness and pitch matching in our laboratory. A total of 21 subjects completed testing, including seven females and 14 males. The upgraded TES was found to be fairly time efficient. Subjects were generally reliable, both within and between sessions, with respect to the type of stimulus they chose as the best match to their tinnitus. Matching to bandwidth was more variable between measurements, with greater consistency seen for subjects reporting tonal tinnitus or wide-band noisy tinnitus than intermediate types. Between-session repeated MMLs were within 10 dB of each other for all but three of the subjects. Subjects who experienced RI during Session 1 tended to be those who experienced it during Session 2. This study may represent the first time that NBM, MML, and RI audiometric testing results have been obtained entirely through a self-contained, computer-automated system designed specifically for use in the clinic. Future plans include refinements to achieve greater testing efficiency. American Academy of Audiology.

  9. Fast template matching with polynomials.

    PubMed

    Omachi, Shinichiro; Omachi, Masako

    2007-08-01

    Template matching is widely used for many applications in image and signal processing. This paper proposes a novel template matching algorithm, called algebraic template matching. Given a template and an input image, algebraic template matching efficiently calculates similarities between the template and the partial images of the input image, for various widths and heights. The partial image most similar to the template image is detected from the input image for any location, width, and height. In the proposed algorithm, a polynomial that approximates the template image is used to match the input image instead of the template image. The proposed algorithm is effective especially when the width and height of the template image differ from the partial image to be matched. An algorithm using the Legendre polynomial is proposed for efficient approximation of the template image. This algorithm not only reduces computational costs, but also improves the quality of the approximated image. It is shown theoretically and experimentally that the computational cost of the proposed algorithm is much smaller than the existing methods.

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

    NASA Astrophysics Data System (ADS)

    Zeng, Luan; Xiong, Wei; Zhai, You

    2013-01-01

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

  11. On Parallel Push-Relabel based Algorithms for Bipartite Maximum Matching

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Langguth, Johannes; Azad, Md Ariful; Halappanavar, Mahantesh

    2014-07-01

    We study multithreaded push-relabel based algorithms for computing maximum cardinality matching in bipartite graphs. Matching is a fundamental combinatorial (graph) problem with applications in a wide variety of problems in science and engineering. We are motivated by its use in the context of sparse linear solvers for computing maximum transversal of a matrix. We implement and test our algorithms on several multi-socket multicore systems and compare their performance to state-of-the-art augmenting path-based serial and parallel algorithms using a testset comprised of a wide range of real-world instances. Building on several heuristics for enhancing performance, we demonstrate good scaling for themore » parallel push-relabel algorithm. We show that it is comparable to the best augmenting path-based algorithms for bipartite matching. To the best of our knowledge, this is the first extensive study of multithreaded push-relabel based algorithms. In addition to a direct impact on the applications using matching, the proposed algorithmic techniques can be extended to preflow-push based algorithms for computing maximum flow in graphs.« less

  12. A Parallel Point Matching Algorithm for Landmark Based Image Registration Using Multicore Platform

    PubMed Central

    Yang, Lin; Gong, Leiguang; Zhang, Hong; Nosher, John L.; Foran, David J.

    2013-01-01

    Point matching is crucial for many computer vision applications. Establishing the correspondence between a large number of data points is a computationally intensive process. Some point matching related applications, such as medical image registration, require real time or near real time performance if applied to critical clinical applications like image assisted surgery. In this paper, we report a new multicore platform based parallel algorithm for fast point matching in the context of landmark based medical image registration. We introduced a non-regular data partition algorithm which utilizes the K-means clustering algorithm to group the landmarks based on the number of available processing cores, which optimize the memory usage and data transfer. We have tested our method using the IBM Cell Broadband Engine (Cell/B.E.) platform. The results demonstrated a significant speed up over its sequential implementation. The proposed data partition and parallelization algorithm, though tested only on one multicore platform, is generic by its design. Therefore the parallel algorithm can be extended to other computing platforms, as well as other point matching related applications. PMID:24308014

  13. 7 CFR 210.17 - Matching Federal funds.

    Code of Federal Regulations, 2010 CFR

    2010-01-01

    ... AGRICULTURE CHILD NUTRITION PROGRAMS NATIONAL SCHOOL LUNCH PROGRAM Requirements for State Agency Participation § 210.17 Matching Federal funds. (a) State revenue matching. For each school year, the amount of State... percent of the funds received by such State under section 4 of the National School Lunch Act during the...

  14. Analysis of satellite servicing cost benefits

    NASA Technical Reports Server (NTRS)

    Builteman, H. O.

    1982-01-01

    Under the auspices of NASA/JSC a methodology was developed to estimate the value of satellite servicing to the user community. Time and funding precluded the development of an exhaustive computer model; instead, the concept of Design Reference Missions was involved. In this approach, three space programs were analyzed for various levels of servicing. The programs selected fall into broad categories which include 80 to 90% of the missions planned between now and the end of the century. Of necessity, the extrapolation of the three program analyses to the user community as a whole depends on an average mission model and equivalency projections. The value of the estimated cost benefits based on this approach depends largely on how well the equivalency assumptions and the mission model match the real world. A careful definition of all assumptions permits the analysis to be extended to conditions beyond the scope of this study.

  15. Model verification of large structural systems. [space shuttle model response

    NASA Technical Reports Server (NTRS)

    Lee, L. T.; Hasselman, T. K.

    1978-01-01

    A computer program for the application of parameter identification on the structural dynamic models of space shuttle and other large models with hundreds of degrees of freedom is described. Finite element, dynamic, analytic, and modal models are used to represent the structural system. The interface with math models is such that output from any structural analysis program applied to any structural configuration can be used directly. Processed data from either sine-sweep tests or resonant dwell tests are directly usable. The program uses measured modal data to condition the prior analystic model so as to improve the frequency match between model and test. A Bayesian estimator generates an improved analytical model and a linear estimator is used in an iterative fashion on highly nonlinear equations. Mass and stiffness scaling parameters are generated for an improved finite element model, and the optimum set of parameters is obtained in one step.

  16. Development of a statewide trauma registry using multiple linked sources of data.

    PubMed Central

    Clark, D. E.

    1993-01-01

    In order to develop a cost-effective method of injury surveillance and trauma system evaluation in a rural state, computer programs were written linking records from two major hospital trauma registries, a statewide trauma tracking study, hospital discharge abstracts, death certificates, and ambulance run reports. A general-purpose database management system, programming language, and operating system were used. Data from 1991 appeared to be successfully linked using only indirect identifying information. Familiarity with local geography and the idiosyncracies of each data source were helpful in programming for effective matching of records. For each individual case identified in this way, data from all available sources were then merged and imported into a standard database format. This inexpensive, population-based approach, maintaining flexibility for end-users with some database training, may be adaptable for other regions. There is a need for further improvement and simplification of the record-linkage process for this and similar purposes. PMID:8130556

  17. Auto-tuning system for NMR probe with LabView

    NASA Astrophysics Data System (ADS)

    Quen, Carmen; Mateo, Olivia; Bernal, Oscar

    2013-03-01

    Typical manual NMR-tuning method is not suitable for broadband spectra spanning several megahertz linewidths. Among the main problems encountered during manual tuning are pulse-power reproducibility, baselines, and transmission line reflections, to name a few. We present a design of an auto-tuning system using graphic programming language, LabVIEW, to minimize these problems. The program is designed to analyze the detected power signal of an antenna near the NMR probe and use this analysis to automatically tune the sample coil to match the impedance of the spectrometer (50 Ω). The tuning capacitors of the probe are controlled by a stepper motor through a LabVIEW/computer interface. Our program calculates the area of the power signal as an indicator to control the motor so disconnecting the coil to tune it through a network analyzer is unnecessary. Work supported by NSF-DMR 1105380

  18. Current Interview Trail Metrics in the Otolaryngology Match.

    PubMed

    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.

  19. Does Matching Quality Matter in Mode Comparison Studies?

    ERIC Educational Resources Information Center

    Zeng, Ji; Yin, Ping; Shedden, Kerby A.

    2015-01-01

    This article provides a brief overview and comparison of three matching approaches in forming comparable groups for a study comparing test administration modes (i.e., computer-based tests [CBT] and paper-and-pencil tests [PPT]): (a) a propensity score matching approach proposed in this article, (b) the propensity score matching approach used by…

  20. Multisensory Information Boosts Numerical Matching Abilities in Young Children

    ERIC Educational Resources Information Center

    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…

  1. Design of a fault tolerant airborne digital computer. Volume 1: Architecture

    NASA Technical Reports Server (NTRS)

    Wensley, J. H.; Levitt, K. N.; Green, M. W.; Goldberg, J.; Neumann, P. G.

    1973-01-01

    This volume is concerned with the architecture of a fault tolerant digital computer for an advanced commercial aircraft. All of the computations of the aircraft, including those presently carried out by analogue techniques, are to be carried out in this digital computer. Among the important qualities of the computer are the following: (1) The capacity is to be matched to the aircraft environment. (2) The reliability is to be selectively matched to the criticality and deadline requirements of each of the computations. (3) The system is to be readily expandable. contractible, and (4) The design is to appropriate to post 1975 technology. Three candidate architectures are discussed and assessed in terms of the above qualities. Of the three candidates, a newly conceived architecture, Software Implemented Fault Tolerance (SIFT), provides the best match to the above qualities. In addition SIFT is particularly simple and believable. The other candidates, Bus Checker System (BUCS), also newly conceived in this project, and the Hopkins multiprocessor are potentially more efficient than SIFT in the use of redundancy, but otherwise are not as attractive.

  2. Forensic Odontology: Automatic Identification of Persons Comparing Antemortem and Postmortem Panoramic Radiographs Using Computer Vision.

    PubMed

    Heinrich, Andreas; Güttler, Felix; Wendt, Sebastian; Schenkl, Sebastian; Hubig, Michael; Wagner, Rebecca; Mall, Gita; Teichgräber, Ulf

    2018-06-18

     In forensic odontology the comparison between antemortem and postmortem panoramic radiographs (PRs) is a reliable method for person identification. The purpose of this study was to improve and automate identification of unknown people by comparison between antemortem and postmortem PR using computer vision.  The study includes 43 467 PRs from 24 545 patients (46 % females/54 % males). All PRs were filtered and evaluated with Matlab R2014b including the toolboxes image processing and computer vision system. The matching process used the SURF feature to find the corresponding points between two PRs (unknown person and database entry) out of the whole database.  From 40 randomly selected persons, 34 persons (85 %) could be reliably identified by corresponding PR matching points between an already existing scan in the database and the most recent PR. The systematic matching yielded a maximum of 259 points for a successful identification between two different PRs of the same person and a maximum of 12 corresponding matching points for other non-identical persons in the database. Hence 12 matching points are the threshold for reliable assignment.  Operating with an automatic PR system and computer vision could be a successful and reliable tool for identification purposes. The applied method distinguishes itself by virtue of its fast and reliable identification of persons by PR. This Identification method is suitable even if dental characteristics were removed or added in the past. The system seems to be robust for large amounts of data.   · Computer vision allows an automated antemortem and postmortem comparison of panoramic radiographs (PRs) for person identification.. · The present method is able to find identical matching partners among huge datasets (big data) in a short computing time.. · The identification method is suitable even if dental characteristics were removed or added.. · Heinrich A, Güttler F, Wendt S et al. Forensic Odontology: Automatic Identification of Persons Comparing Antemortem and Postmortem Panoramic Radiographs Using Computer Vision. Fortschr Röntgenstr 2018; DOI: 10.1055/a-0632-4744. © Georg Thieme Verlag KG Stuttgart · New York.

  3. The Use of Computer-Generated Fading Materials to Teach Visual-Visual Non-Identity Matching Tasks

    ERIC Educational Resources Information Center

    Murphy, Colleen; Figueroa, Maria; Martin, Garry L.; Yu, C. T.; Figueroa, Josue

    2008-01-01

    Many everyday matching tasks taught to persons with developmental disabilities are visual-visual non-identity matching (VVNM) tasks, such as matching the printed word DOG to a picture of a dog, or matching a sock to a shoe. Research has shown that, for participants who have failed a VVNM prototype task, it is very difficult to teach them various…

  4. Novel techniques for data decomposition and load balancing for parallel processing of vision systems: Implementation and evaluation using a motion estimation system

    NASA Technical Reports Server (NTRS)

    Choudhary, Alok Nidhi; Leung, Mun K.; Huang, Thomas S.; Patel, Janak H.

    1989-01-01

    Computer vision systems employ a sequence of vision algorithms in which the output of an algorithm is the input of the next algorithm in the sequence. Algorithms that constitute such systems exhibit vastly different computational characteristics, and therefore, require different data decomposition techniques and efficient load balancing techniques for parallel implementation. However, since the input data for a task is produced as the output data of the previous task, this information can be exploited to perform knowledge based data decomposition and load balancing. Presented here are algorithms for a motion estimation system. The motion estimation is based on the point correspondence between the involved images which are a sequence of stereo image pairs. Researchers propose algorithms to obtain point correspondences by matching feature points among stereo image pairs at any two consecutive time instants. Furthermore, the proposed algorithms employ non-iterative procedures, which results in saving considerable amounts of computation time. The system consists of the following steps: (1) extraction of features; (2) stereo match of images in one time instant; (3) time match of images from consecutive time instants; (4) stereo match to compute final unambiguous points; and (5) computation of motion parameters.

  5. Learning directed acyclic graphs from large-scale genomics data.

    PubMed

    Nikolay, Fabio; Pesavento, Marius; Kritikos, George; Typas, Nassos

    2017-09-20

    In this paper, we consider the problem of learning the genetic interaction map, i.e., the topology of a directed acyclic graph (DAG) of genetic interactions from noisy double-knockout (DK) data. Based on a set of well-established biological interaction models, we detect and classify the interactions between genes. We propose a novel linear integer optimization program called the Genetic-Interactions-Detector (GENIE) to identify the complex biological dependencies among genes and to compute the DAG topology that matches the DK measurements best. Furthermore, we extend the GENIE program by incorporating genetic interaction profile (GI-profile) data to further enhance the detection performance. In addition, we propose a sequential scalability technique for large sets of genes under study, in order to provide statistically significant results for real measurement data. Finally, we show via numeric simulations that the GENIE program and the GI-profile data extended GENIE (GI-GENIE) program clearly outperform the conventional techniques and present real data results for our proposed sequential scalability technique.

  6. Matching by linear programming and successive convexification.

    PubMed

    Jiang, Hao; Drew, Mark S; Li, Ze-Nian

    2007-06-01

    We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. Matching is formulated as metric labeling with L1 regularization terms, for which we propose a novel linear programming relaxation method and an efficient successive convexification implementation. The unique feature of the proposed relaxation scheme is that a much smaller set of basis labels is used to represent the original label space. This greatly reduces the size of the searching space. A successive convexification scheme solves the labeling problem in a coarse to fine manner. Importantly, the original cost function is reconvexified at each stage, in the new focus region only, and the focus region is updated so as to refine the searching result. This makes the method well-suited for large label set matching. Experiments demonstrate successful applications of the proposed matching scheme in object detection, motion estimation, and tracking.

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

    ERIC Educational Resources Information Center

    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…

  8. User documentation for the FHWA Carpool Matching Program (second edition)

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Not Available

    1975-01-01

    This document provides persons interested in computerized carpool/buspool matching programs a complete description of the user documentation for the FHWA Carpool Matching Program. The FHWA program is written in American National Standard COBOL and thus should be readily transferable to environments other than the IBM 360/65 (OS) under which it has been developed and tested. The program has a compiled time core requirement of 110K and a maximum execution time core requirement of 110K. While considerable effort has been made to test the program in several applications and to achieve accuracy and completeness in the program and supporting documentation, themore » FHWA cannot guarantee the proper operation of this program by any user nor can it assume liability for any damage, loss, or inconvenience resulting from the operation of this program or the results obtained thereby. This present version of the carpool matching program represents the latest version of the first generation of an ongoing multi-phase process of improvements and refinements. The ultimate goal is an effective carpool and transit information system that will produce individualized information covering not only carpooling opportunities, but also transit routing, scheduling, and other identifying information for the commuter. (MCW)« less

  9. Developing a multimodal biometric authentication system using soft computing methods.

    PubMed

    Malcangi, Mario

    2015-01-01

    Robust personal authentication is becoming ever more important in computer-based applications. Among a variety of methods, biometric offers several advantages, mainly in embedded system applications. Hard and soft multi-biometric, combined with hard and soft computing methods, can be applied to improve the personal authentication process and to generalize the applicability. This chapter describes the embedded implementation of a multi-biometric (voiceprint and fingerprint) multimodal identification system based on hard computing methods (DSP) for feature extraction and matching, an artificial neural network (ANN) for soft feature pattern matching, and a fuzzy logic engine (FLE) for data fusion and decision.

  10. Circulation control propellers for general aviation, including a BASIC computer program

    NASA Technical Reports Server (NTRS)

    Taback, I.; Braslow, A. L.; Butterfield, A. J.

    1983-01-01

    The feasibility of replacing variable pitch propeller mechanisms with circulation control (Coanada effect) propellers on general aviation airplanes was examined. The study used a specially developed computer program written in BASIC which could compare the aerodynamic performance of circulation control propellers with conventional propellers. The comparison of aerodynamic performance for circulation control, fixed pitch and variable pitch propellers is based upon the requirements for a 1600 kg (3600 lb) single engine general aviation aircraft. A circulation control propeller using a supercritical airfoil was shown feasible over a representative range of design conditions. At a design condition for high speed cruise, all three types of propellers showed approximately the same performance. At low speed, the performance of the circulation control propeller exceeded the performance for a fixed pitch propeller, but did not match the performance available from a variable pitch propeller. It appears feasible to consider circulation control propellers for single engine aircraft or multiengine aircraft which have their propellers on a common axis (tractor pusher). The economics of the replacement requires a study for each specific airplane application.

  11. WaveJava: Wavelet-based network computing

    NASA Astrophysics Data System (ADS)

    Ma, Kun; Jiao, Licheng; Shi, Zhuoer

    1997-04-01

    Wavelet is a powerful theory, but its successful application still needs suitable programming tools. Java is a simple, object-oriented, distributed, interpreted, robust, secure, architecture-neutral, portable, high-performance, multi- threaded, dynamic language. This paper addresses the design and development of a cross-platform software environment for experimenting and applying wavelet theory. WaveJava, a wavelet class library designed by the object-orient programming, is developed to take advantage of the wavelets features, such as multi-resolution analysis and parallel processing in the networking computing. A new application architecture is designed for the net-wide distributed client-server environment. The data are transmitted with multi-resolution packets. At the distributed sites around the net, these data packets are done the matching or recognition processing in parallel. The results are fed back to determine the next operation. So, the more robust results can be arrived quickly. The WaveJava is easy to use and expand for special application. This paper gives a solution for the distributed fingerprint information processing system. It also fits for some other net-base multimedia information processing, such as network library, remote teaching and filmless picture archiving and communications.

  12. What Makes a Plastic Surgery Residency Program Attractive? An Applicant's Perspective.

    PubMed

    Atashroo, David A; Luan, Anna; Vyas, Krishna S; Zielins, Elizabeth R; Maan, Zeshaan; Duscher, Dominik; Walmsley, Graham G; Lynch, Michael P; Davenport, Daniel L; Wan, Derrick C; Longaker, Michael T; Vasconez, Henry C

    2015-07-01

    Plastic surgery is among the most competitive specialties in medicine, but little is known about the attributes of programs that are most attractive to successful applicants. This study aimed to understand and provide insights regarding program characteristics that are most influential to students when ranking plastic surgery programs. An anonymous online survey was conducted with newly matched plastic surgery residents for the integrated and combined Match in 2012 and 2013. Subjects were queried regarding their demographics, qualifications, application experiences, and motivations for residency program selection. A total of 92 of 245 matched plastic surgery residents (38 percent) responded to the survey. The perception of resident happiness was the most positive factor influencing program ranking, followed by high operative volume, faculty mentorship, and strong research infrastructure. Perception of a program as "malignant" was the most negative attribute. Applicants with Step 1 scores greater than 245 received significantly more interviews (p =0.001) and considered resident benefits less important (p < 0.05), but geographic location more important (p =0.005). Applicants who published more than two articles also received more interviews (p =0.001) and ranked a strong research infrastructure and program reputation as significantly more important (p < 0.05). Forty-two percent of applicants completed an away rotation at the program with which they matched, and these applicants were more likely to match at their number one ranked program (p = 0.001). Plastic surgery applicants have differing preferences regarding the ideal training program, but some attributes resonate. These trends can guide programs for improvement in attracting the best applicants.

  13. Is random access memory random?

    NASA Technical Reports Server (NTRS)

    Denning, P. J.

    1986-01-01

    Most software is contructed on the assumption that the programs and data are stored in random access memory (RAM). Physical limitations on the relative speeds of processor and memory elements lead to a variety of memory organizations that match processor addressing rate with memory service rate. These include interleaved and cached memory. A very high fraction of a processor's address requests can be satified from the cache without reference to the main memory. The cache requests information from main memory in blocks that can be transferred at the full memory speed. Programmers who organize algorithms for locality can realize the highest performance from these computers.

  14. Simulation of 3-D Nonequilibrium Seeded Air Flow in the NASA-Ames MHD Channel

    NASA Technical Reports Server (NTRS)

    Gupta, Sumeet; Tannehill, John C.; Mehta, Unmeel B.

    2004-01-01

    The 3-D nonequilibrium seeded air flow in the NASA-Ames experimental MHD channel has been numerically simulated. The channel contains a nozzle section, a center section, and an accelerator section where magnetic and electric fields can be imposed on the flow. In recent tests, velocity increases of up to 40% have been achieved in the accelerator section. The flow in the channel is numerically computed us ing a 3-D parabolized Navier-Stokes (PNS) algorithm that has been developed to efficiently compute MHD flows in the low magnetic Reynolds number regime: The MHD effects are modeled by introducing source terms into the PNS equations which can then be solved in a very efficient manner. The algorithm has been extended in the present study to account for nonequilibrium seeded air flows. The electrical conductivity of the flow is determined using the program of Park. The new algorithm has been used to compute two test cases that match the experimental conditions. In both cases, magnetic and electric fields are applied to the seeded flow. The computed results are in good agreement with the experimental data.

  15. MATLAB as an incentive for student learning of skills

    NASA Astrophysics Data System (ADS)

    Bank, C. G.; Ghent, R. R.

    2016-12-01

    Our course "Computational Geology" takes a holistic approach to student learning by using MATLAB as a focal point to increase students' computing, quantitative reasoning, data analysis, report writing, and teamwork skills. The course, taught since 2007 with recent enrollments around 35 and aimed at 2nd to 3rd-year students, is required for the Geology and Earth and Environmental Systems major programs, and can be chosen as elective in our other programs, including Geophysics. The course is divided into five projects: Pacific plate velocity from the Hawaiian hotspot track, predicting CO2 concentration in the atmosphere, volume of Earth's oceans and sea-level rise, comparing wind directions for Vancouver and Squamish, and groundwater flow. Each project is based on real data, focusses on a mathematical concept (linear interpolation, gradients, descriptive statistics, differential equations) and highlights a programming task (arrays, functions, text file input/output, curve fitting). Working in teams of three, students need to develop a conceptional model to explain the data, and write MATLAB code to visualize the data and match it to their conceptional model. The programming is guided, and students work individually on different aspects (for example: reading the data, fitting a function, unit conversion) which they need to put together to solve the problem. They then synthesize their thought process in a paper. Anecdotal evidence shows that students continue using MATLAB in other courses.

  16. 78 FR 16862 - Notice of Submission of Proposed Information Collection to OMB: Emergency Shelter Grants Program...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-03-19

    ... changed to match the new program name created through the HEARTH Act. To see the regulations for the new... match the new program name created through the HEARTH Act. To see the regulations for the new ESG...

  17. A Single Mechanism Can Account for Human Perception of Depth in Mixed Correlation Random Dot Stereograms

    PubMed Central

    Cumming, Bruce G.

    2016-01-01

    In order to extract retinal disparity from a visual scene, the brain must match corresponding points in the left and right retinae. This computationally demanding task is known as the stereo correspondence problem. The initial stage of the solution to the correspondence problem is generally thought to consist of a correlation-based computation. However, recent work by Doi et al suggests that human observers can see depth in a class of stimuli where the mean binocular correlation is 0 (half-matched random dot stereograms). Half-matched random dot stereograms are made up of an equal number of correlated and anticorrelated dots, and the binocular energy model—a well-known model of V1 binocular complex cells—fails to signal disparity here. This has led to the proposition that a second, match-based computation must be extracting disparity in these stimuli. Here we show that a straightforward modification to the binocular energy model—adding a point output nonlinearity—is by itself sufficient to produce cells that are disparity-tuned to half-matched random dot stereograms. We then show that a simple decision model using this single mechanism can reproduce psychometric functions generated by human observers, including reduced performance to large disparities and rapidly updating dot patterns. The model makes predictions about how performance should change with dot size in half-matched stereograms and temporal alternation in correlation, which we test in human observers. We conclude that a single correlation-based computation, based directly on already-known properties of V1 neurons, can account for the literature on mixed correlation random dot stereograms. PMID:27196696

  18. Robust stereo matching with trinary cross color census and triple image-based refinements

    NASA Astrophysics Data System (ADS)

    Chang, Ting-An; Lu, Xiao; Yang, Jar-Ferr

    2017-12-01

    For future 3D TV broadcasting systems and navigation applications, it is necessary to have accurate stereo matching which could precisely estimate depth map from two distanced cameras. In this paper, we first suggest a trinary cross color (TCC) census transform, which can help to achieve accurate disparity raw matching cost with low computational cost. The two-pass cost aggregation (TPCA) is formed to compute the aggregation cost, then the disparity map can be obtained by a range winner-take-all (RWTA) process and a white hole filling procedure. To further enhance the accuracy performance, a range left-right checking (RLRC) method is proposed to classify the results as correct, mismatched, or occluded pixels. Then, the image-based refinements for the mismatched and occluded pixels are proposed to refine the classified errors. Finally, the image-based cross voting and a median filter are employed to complete the fine depth estimation. Experimental results show that the proposed semi-global stereo matching system achieves considerably accurate disparity maps with reasonable computation cost.

  19. High performance in silico virtual drug screening on many-core processors.

    PubMed

    McIntosh-Smith, Simon; Price, James; Sessions, Richard B; Ibarra, Amaurys A

    2015-05-01

    Drug screening is an important part of the drug development pipeline for the pharmaceutical industry. Traditional, lab-based methods are increasingly being augmented with computational methods, ranging from simple molecular similarity searches through more complex pharmacophore matching to more computationally intensive approaches, such as molecular docking. The latter simulates the binding of drug molecules to their targets, typically protein molecules. In this work, we describe BUDE, the Bristol University Docking Engine, which has been ported to the OpenCL industry standard parallel programming language in order to exploit the performance of modern many-core processors. Our highly optimized OpenCL implementation of BUDE sustains 1.43 TFLOP/s on a single Nvidia GTX 680 GPU, or 46% of peak performance. BUDE also exploits OpenCL to deliver effective performance portability across a broad spectrum of different computer architectures from different vendors, including GPUs from Nvidia and AMD, Intel's Xeon Phi and multi-core CPUs with SIMD instruction sets.

  20. High performance in silico virtual drug screening on many-core processors

    PubMed Central

    Price, James; Sessions, Richard B; Ibarra, Amaurys A

    2015-01-01

    Drug screening is an important part of the drug development pipeline for the pharmaceutical industry. Traditional, lab-based methods are increasingly being augmented with computational methods, ranging from simple molecular similarity searches through more complex pharmacophore matching to more computationally intensive approaches, such as molecular docking. The latter simulates the binding of drug molecules to their targets, typically protein molecules. In this work, we describe BUDE, the Bristol University Docking Engine, which has been ported to the OpenCL industry standard parallel programming language in order to exploit the performance of modern many-core processors. Our highly optimized OpenCL implementation of BUDE sustains 1.43 TFLOP/s on a single Nvidia GTX 680 GPU, or 46% of peak performance. BUDE also exploits OpenCL to deliver effective performance portability across a broad spectrum of different computer architectures from different vendors, including GPUs from Nvidia and AMD, Intel’s Xeon Phi and multi-core CPUs with SIMD instruction sets. PMID:25972727

  1. The Cost of Getting Into Orthopedic Residency: Analysis of Applicant Demographics, Expenditures, and the Value of Away Rotations.

    PubMed

    Camp, Christopher L; Sousa, Paul L; Hanssen, Arlen D; Karam, Matthew D; Haidukewych, George J; Oakes, Daniel A; Turner, Norman S

    2016-01-01

    Little is known about the demographics and expenditures of applicants attempting to match into the competitive field of orthopedic surgery. In attempt to better inform potential applicants, the purposes of this work are to (1) better understand the demographics of successfully matched applicants, (2) determine the monetary cost of applying, and (3) assess the value of away rotations for improving chances of a successful match. Prospective comparative survey. Mayo Clinic Department of Orthopedic Surgery, Rochester, MN. A week following the 2015 Orthopedic Surgery Residency Match, a survey was sent to 1,091. The survey focused on applicant demographics, number of programs applied to, cost of applying, and the value of away rotations. A total of 408 applicants completed the survey (response rate = 37%). Of these, 312 (76%) matched and 96 (24%) did not match into a US Orthopedic Surgery Residency. Of the matched applicants, 300 (96%) were from US allopathic medical schools, 9 (3%) US Osteopathic Schools, and 3 (1%) were international graduates. Males comprised 84% of these applicants whereas 16% were female. The mean number of programs applied to was 71 (range: 20-140). On average, applicants were offered 16 interviews (range: 1-53) and they attended 11 (range: 0-12). Completing a rotation at a program increased an applicant׳s chances of matching into that program by a factor of 1.5 (60% vs 40%). Of the applicants who matched, most applicants matched to an orthopedic residency in the same region where the applicant attended medical school (58%). The average cost of the application was $1,664 (range: $100-$5,000) whereas the cost of interviews (travel, food, etc.) was $3,656 (range: $15-$20,000). Total expenditures ranged from $450 to $25,000 (mean = $5,415). Over 8% of matched applicants spent >$10,000. Gaining acceptance into orthopedic surgery residency remains a very competitive process. Away rotations appear to correlate strongly with match status; however, the process remains quite expensive for applicants. Copyright © 2016 Association of Program Directors in Surgery. Published by Elsevier Inc. All rights reserved.

  2. Optical cell tracking analysis using a straight-forward approach to minimize processing time for high frame rate data

    NASA Astrophysics Data System (ADS)

    Seeto, Wen Jun; Lipke, Elizabeth Ann

    2016-03-01

    Tracking of rolling cells via in vitro experiment is now commonly performed using customized computer programs. In most cases, two critical challenges continue to limit analysis of cell rolling data: long computation times due to the complexity of tracking algorithms and difficulty in accurately correlating a given cell with itself from one frame to the next, which is typically due to errors caused by cells that either come close in proximity to each other or come in contact with each other. In this paper, we have developed a sophisticated, yet simple and highly effective, rolling cell tracking system to address these two critical problems. This optical cell tracking analysis (OCTA) system first employs ImageJ for cell identification in each frame of a cell rolling video. A custom MATLAB code was written to use the geometric and positional information of all cells as the primary parameters for matching each individual cell with itself between consecutive frames and to avoid errors when tracking cells that come within close proximity to one another. Once the cells are matched, rolling velocity can be obtained for further analysis. The use of ImageJ for cell identification eliminates the need for high level MATLAB image processing knowledge. As a result, only fundamental MATLAB syntax is necessary for cell matching. OCTA has been implemented in the tracking of endothelial colony forming cell (ECFC) rolling under shear. The processing time needed to obtain tracked cell data from a 2 min ECFC rolling video recorded at 70 frames per second with a total of over 8000 frames is less than 6 min using a computer with an Intel® Core™ i7 CPU 2.80 GHz (8 CPUs). This cell tracking system benefits cell rolling analysis by substantially reducing the time required for post-acquisition data processing of high frame rate video recordings and preventing tracking errors when individual cells come in close proximity to one another.

  3. Trajectory Segmentation Map-Matching Approach for Large-Scale, High-Resolution GPS Data

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Zhu, Lei; Holden, Jacob R.; Gonder, Jeffrey D.

    With the development of smartphones and portable GPS devices, large-scale, high-resolution GPS data can be collected. Map matching is a critical step in studying vehicle driving activity and recognizing network traffic conditions from the data. A new trajectory segmentation map-matching algorithm is proposed to deal accurately and efficiently with large-scale, high-resolution GPS trajectory data. The new algorithm separated the GPS trajectory into segments. It found the shortest path for each segment in a scientific manner and ultimately generated a best-matched path for the entire trajectory. The similarity of a trajectory segment and its matched path is described by a similaritymore » score system based on the longest common subsequence. The numerical experiment indicated that the proposed map-matching algorithm was very promising in relation to accuracy and computational efficiency. Large-scale data set applications verified that the proposed method is robust and capable of dealing with real-world, large-scale GPS data in a computationally efficient and accurate manner.« less

  4. Wide baseline stereo matching based on double topological relationship consistency

    NASA Astrophysics Data System (ADS)

    Zou, Xiaohong; Liu, Bin; Song, Xiaoxue; Liu, Yang

    2009-07-01

    Stereo matching is one of the most important branches in computer vision. In this paper, an algorithm is proposed for wide-baseline stereo vision matching. Here, a novel scheme is presented called double topological relationship consistency (DCTR). The combination of double topological configuration includes the consistency of first topological relationship (CFTR) and the consistency of second topological relationship (CSTR). It not only sets up a more advanced model on matching, but discards mismatches by iteratively computing the fitness of the feature matches and overcomes many problems of traditional methods depending on the powerful invariance to changes in the scale, rotation or illumination across large view changes and even occlusions. Experimental examples are shown where the two cameras have been located in very different orientations. Also, epipolar geometry can be recovered using RANSAC by far the most widely method adopted possibly. By the method, we can obtain correspondences with high precision on wide baseline matching problems. Finally, the effectiveness and reliability of this method are demonstrated in wide-baseline experiments on the image pairs.

  5. Trajectory Segmentation Map-Matching Approach for Large-Scale, High-Resolution GPS Data

    DOE PAGES

    Zhu, Lei; Holden, Jacob R.; Gonder, Jeffrey D.

    2017-01-01

    With the development of smartphones and portable GPS devices, large-scale, high-resolution GPS data can be collected. Map matching is a critical step in studying vehicle driving activity and recognizing network traffic conditions from the data. A new trajectory segmentation map-matching algorithm is proposed to deal accurately and efficiently with large-scale, high-resolution GPS trajectory data. The new algorithm separated the GPS trajectory into segments. It found the shortest path for each segment in a scientific manner and ultimately generated a best-matched path for the entire trajectory. The similarity of a trajectory segment and its matched path is described by a similaritymore » score system based on the longest common subsequence. The numerical experiment indicated that the proposed map-matching algorithm was very promising in relation to accuracy and computational efficiency. Large-scale data set applications verified that the proposed method is robust and capable of dealing with real-world, large-scale GPS data in a computationally efficient and accurate manner.« less

  6. Lightness of an object under two illumination levels.

    PubMed

    Zdravković, Suncica; Economou, Elias; Gilchrist, Alan

    2006-01-01

    Anchoring theory (Gilchrist et al, 1999 Psychological Review 106 795-834) predicts a wide range of lightness errors, including failures of constancy in multi-illumination scenes and a long list of well-known lightness illusions seen under homogeneous illumination. Lightness values are computed both locally and globally and then averaged together. Local values are computed within a given region of homogeneous illumination. Thus, for an object that extends through two different illumination levels, anchoring theory produces two values, one for the patch in brighter illumination and one for the patch in dimmer illumination. Observers can give matches for these patches separately, but they can also give a single match for the whole object. Anchoring theory in its current form is unable to predict these object matches. We report eight experiments in which we studied the relationship between patch matches and object matches. The results show that the object match represents a compromise between the match for the patch in the field of highest illumination and the patch in the largest field of illumination. These two principles are parallel to the rules found for anchoring lightness: highest luminance rule and area rule.

  7. A comparison of semiglobal and local dense matching algorithms for surface reconstruction

    NASA Astrophysics Data System (ADS)

    Dall'Asta, E.; Roncella, R.

    2014-06-01

    Encouraged by the growing interest in automatic 3D image-based reconstruction, the development and improvement of robust stereo matching techniques is one of the most investigated research topic of the last years in photogrammetry and computer vision. The paper is focused on the comparison of some stereo matching algorithms (local and global) which are very popular both in photogrammetry and computer vision. In particular, the Semi-Global Matching (SGM), which realizes a pixel-wise matching and relies on the application of consistency constraints during the matching cost aggregation, will be discussed. The results of some tests performed on real and simulated stereo image datasets, evaluating in particular the accuracy of the obtained digital surface models, will be presented. Several algorithms and different implementation are considered in the comparison, using freeware software codes like MICMAC and OpenCV, commercial software (e.g. Agisoft PhotoScan) and proprietary codes implementing Least Square e Semi-Global Matching algorithms. The comparisons will also consider the completeness and the level of detail within fine structures, and the reliability and repeatability of the obtainable data.

  8. Estimation of High-Dimensional Graphical Models Using Regularized Score Matching

    PubMed Central

    Lin, Lina; Drton, Mathias; Shojaie, Ali

    2017-01-01

    Graphical models are widely used to model stochastic dependences among large collections of variables. We introduce a new method of estimating undirected conditional independence graphs based on the score matching loss, introduced by Hyvärinen (2005), and subsequently extended in Hyvärinen (2007). The regularized score matching method we propose applies to settings with continuous observations and allows for computationally efficient treatment of possibly non-Gaussian exponential family models. In the well-explored Gaussian setting, regularized score matching avoids issues of asymmetry that arise when applying the technique of neighborhood selection, and compared to existing methods that directly yield symmetric estimates, the score matching approach has the advantage that the considered loss is quadratic and gives piecewise linear solution paths under ℓ1 regularization. Under suitable irrepresentability conditions, we show that ℓ1-regularized score matching is consistent for graph estimation in sparse high-dimensional settings. Through numerical experiments and an application to RNAseq data, we confirm that regularized score matching achieves state-of-the-art performance in the Gaussian case and provides a valuable tool for computationally efficient estimation in non-Gaussian graphical models. PMID:28638498

  9. A multiprocessor computer simulation model employing a feedback scheduler/allocator for memory space and bandwidth matching and TMR processing

    NASA Technical Reports Server (NTRS)

    Bradley, D. B.; Irwin, J. D.

    1974-01-01

    A computer simulation model for a multiprocessor computer is developed that is useful for studying the problem of matching multiprocessor's memory space, memory bandwidth and numbers and speeds of processors with aggregate job set characteristics. The model assumes an input work load of a set of recurrent jobs. The model includes a feedback scheduler/allocator which attempts to improve system performance through higher memory bandwidth utilization by matching individual job requirements for space and bandwidth with space availability and estimates of bandwidth availability at the times of memory allocation. The simulation model includes provisions for specifying precedence relations among the jobs in a job set, and provisions for specifying precedence execution of TMR (Triple Modular Redundant and SIMPLEX (non redundant) jobs.

  10. Improved Feature Matching for Mobile Devices with IMU.

    PubMed

    Masiero, Andrea; Vettore, Antonio

    2016-08-05

    Thanks to the recent diffusion of low-cost high-resolution digital cameras and to the development of mostly automated procedures for image-based 3D reconstruction, the popularity of photogrammetry for environment surveys is constantly increasing in the last years. Automatic feature matching is an important step in order to successfully complete the photogrammetric 3D reconstruction: this step is the fundamental basis for the subsequent estimation of the geometry of the scene. This paper reconsiders the feature matching problem when dealing with smart mobile devices (e.g., when using the standard camera embedded in a smartphone as imaging sensor). More specifically, this paper aims at exploiting the information on camera movements provided by the inertial navigation system (INS) in order to make the feature matching step more robust and, possibly, computationally more efficient. First, a revised version of the affine scale-invariant feature transform (ASIFT) is considered: this version reduces the computational complexity of the original ASIFT, while still ensuring an increase of correct feature matches with respect to the SIFT. Furthermore, a new two-step procedure for the estimation of the essential matrix E (and the camera pose) is proposed in order to increase its estimation robustness and computational efficiency.

  11. The effect of scopolamine on matching behavior and the estimation of relative reward magnitude.

    PubMed

    Leon, Matthew I; Rodriguez-Barrera, Vanessa; Amaya, Aldo

    2017-10-01

    We investigated the behavioral effects of scopolamine on rats that bar pressed for trains of electrically stimulating pulses under concurrent variable interval schedules of reward. For the first half of the session (30 min) a 1:4 ratio in the programmed number of stimulation trains delivered at each option was in effect. At the start of the second half of the session, an unsignaled reversal in the relative train number (4:1) occurred. We tracked the relative magnitude of reward estimated for each contiguous pair of reinforced visits to competing options. Scopolamine hydrobromide led to a reduction in the relative magnitude of reward. A similar result was obtained in a follow-up test in which relative magnitude was manipulated by varying the pulse frequency of stimulation, while equating the train number at each option. The effect of scopolamine hydrobromide could not be attributed to undermatching, side bias, nor to an effect of scopolamine on the reward integration process. When the same rats were treated with scopolamine methylbromide, no effects on matching behavior were observed. Our results suggest a cholinergic basis for the computation of choice variables related to matching behavior. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

  12. Overview of Space Science and Information Research Opportunities at NASA

    NASA Technical Reports Server (NTRS)

    Green, James L.

    2000-01-01

    It is not possible to review all the opportunities that NASA provides to support the Space Science Enterprise, in the short amount of time allotted for this presentation. Therefore, only a few key programs will be discussed. The programs that I will discuss will concentrate on research opportunities for faculty, graduate and postdoctoral candidates in Space Science research and information technologies at NASA. One of the most important programs for research opportunities is the NASA Research Announcement or NRA. NASA Headquarters issues NRA's on a regular basis and these cover space science and computer science activities relating to NASA missions and programs. In the Space Sciences, the most important NRA is called the "Research Opportunities in Space Science or the ROSS NRA. The ROSS NRA is composed of multiple announcements in the areas of structure and evolution of the Universe, Solar System exploration, Sun-Earth connections, and applied information systems. Another important opportunity is the Graduate Student Research Program (GSRP). The GSRP is designed to cultivate research ties between a NASA Center and the academic community through the award of fellowships to promising students in science and engineering. This program is unique since it matches the student's area of research interest with existing work being carried out at NASA. This program is for U.S. citizens who are full-time graduate students. Students who are successful have made the match between their research and the NASA employee who will act as their NASA Advisor/ Mentor. In this program, the student's research is primarily accomplished under the supervision of his faculty advisor with periodic or frequent interactions with the NASA Mentor. These interactions typically involve travel to the sponsoring NASA Center on a regular basis. The one-year fellowships are renewable for up to three years and over $20,000 per year. These and other important opportunities will be discussed.

  13. Learning graph matching.

    PubMed

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

    2009-06-01

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

  14. Anticipated Supply and Demand for Independent Interventional Radiology Residency Positions: A Survey of Department Chairs.

    PubMed

    Herwald, Sanna E; Spies, James B; Yucel, E Kent

    2017-02-01

    The first participants in the independent interventional radiology (IR) residency match will begin prerequisite diagnostic radiology (DR) residencies before the anticipated launch of the independent IR programs in 2020. The aim of this study was to estimate the competitiveness level of the first independent IR residency matches before these applicants have already committed to DR residencies and possibly early specialization in IR (ESIR) programs. The Society of Chairs of Academic Radiology Departments (SCARD) Task Force on the IR Residency distributed a survey to all active SCARD members using SurveyMonkey. The survey requested the number of planned IR residency and ESIR positions. The average, minimum, and maximum of the range of planned independent IR residency positions were compared with the average, maximum, and minimum, respectively, of the range of planned ESIR positions, to model matches of average, high, and low competitiveness. Seventy-four active SCARD members (56%) answered at least one survey question. The respondents' programs planned to fill, in total, 98 to 102 positions in integrated IR residency programs, 61 to 76 positions in independent IR residency programs, and 50 to 77 positions in ESIR DR residency programs each year. The ranges indicate the uncertainty of some programs regarding the number of positions. The survey suggests that participating programs will fill sufficient independent IR residency positions to accommodate all ESIR applicants in a match year of average or low competitiveness, but not in a match year of high competitiveness. This suggestion does not account for certain difficult-to-predict factors that may affect the independent IR residency match. Copyright © 2016 American College of Radiology. Published by Elsevier Inc. All rights reserved.

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

    PubMed Central

    2012-01-01

    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 records, particularly for extracting the cause of death. PMID:22870911

  16. Disease Profiling for Computerized Peer Support of Ménière's Disease

    PubMed Central

    Kentala, Erna

    2015-01-01

    Background Peer support is an emerging form of person-driven active health care. Chronic conditions such as Ménière’s disease (a disorder of the inner ear) need continuing rehabilitation and support that is beyond the scope of routine clinical medical practice. Hence, peer-support programs can be helpful in supplementing some of the rehabilitation aspects. Objective The aim of this study was to design a computerized data collection system for the peer support of Menière’s disease that is capable in profiling the subject for diagnosis and in assisting with problem solving. Methods The expert program comprises several data entries focusing on symptoms, activity limitations, participation restrictions, quality of life, attitude and personality trait, and an evaluation of disease-specific impact. Data was collected from 740 members of the Finnish Ménière’s Federation and utilized in the construction and evaluation of the program. Results The program verifies the diagnosis of a person by using an expert system, and the inference engine selects 50 cases with matched symptom severity by using a nearest neighbor algorithm. These cases are then used as a reference group to compare with the person’s attitude, sense of coherence, and anxiety. The program provides feedback for the person and uses this information to guide the person through the problem-solving process. Conclusions This computer-based peer-support program is the first example of an advanced computer-oriented approach using artificial intelligence, both in the profiling of the disease and in profiling the person’s complaints for hearing loss, tinnitus, and vertigo. PMID:28582248

  17. Software for Better Documentation of Other Software

    NASA Technical Reports Server (NTRS)

    Pinedo, John

    2003-01-01

    The Literate Programming Extraction Engine is a Practical Extraction and Reporting Language- (PERL-)based computer program that facilitates and simplifies the implementation of a concept of self-documented literate programming in a fashion tailored to the typical needs of scientists. The advantage for the programmer is that documentation and source code are written side-by-side in the same file, reducing the likelihood that the documentation will be inconsistent with the code and improving the verification that the code performs its intended functions. The advantage for the user is the knowledge that the documentation matches the software because they come from the same file. This program unifies the documentation process for a variety of programming languages, including C, C++, and several versions of FORTRAN. This program can process the documentation in any markup language, and incorporates the LaTeX typesetting software. The program includes sample Makefile scripts for automating both the code-compilation (when appropriate) and documentation-generation processes into a single command-line statement. Also included are macro instructions for the Emacs display-editor software, making it easy for a programmer to toggle between editing in a code or a documentation mode.

  18. Corporate Matching-Gift Programs--1980: Some Details and Variations.

    ERIC Educational Resources Information Center

    Council for Financial Aid to Education, New York, NY.

    Employee matching-gift programs are examined as corporations develop and administer educational financial aid programs that advance corporate objectives and reflect their concerns for the financial health of colleges and universities. The Council for Financial Aid to Education (CFAE) annually surveys 972 colleges and universities on voluntary…

  19. Scaling to Nanotechnology Limits with the PIMS Computer Architecture and a new Scaling Rule

    DOE Office of Scientific and Technical Information (OSTI.GOV)

    Debenedictis, Erik P.

    2015-02-01

    We describe a new approach to computing that moves towards the limits of nanotechnology using a newly formulated sc aling rule. This is in contrast to the current computer industry scali ng away from von Neumann's original computer at the rate of Moore's Law. We extend Moore's Law to 3D, which l eads generally to architectures that integrate logic and memory. To keep pow er dissipation cons tant through a 2D surface of the 3D structure requires using adiabatic principles. We call our newly proposed architecture Processor In Memory and Storage (PIMS). We propose a new computational model that integratesmore » processing and memory into "tiles" that comprise logic, memory/storage, and communications functions. Since the programming model will be relatively stable as a system scales, programs repr esented by tiles could be executed in a PIMS system built with today's technology or could become the "schematic diagram" for implementation in an ultimate 3D nanotechnology of the future. We build a systems software approach that offers advantages over and above the technological and arch itectural advantages. Firs t, the algorithms may be more efficient in the conventional sens e of having fewer steps. Second, the algorithms may run with higher power efficiency per operation by being a better match for the adiabatic scaling ru le. The performance analysis based on demonstrated ideas in physical science suggests 80,000 x improvement in cost per operation for the (arguably) gene ral purpose function of emulating neurons in Deep Learning.« less

  20. Using the Multiple-Matched-Sample and Statistical Controls to Examine the Effects of Magnet School Programs on the Reading and Mathematics Performance of Students

    ERIC Educational Resources Information Center

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

    2005-01-01

    This summative evaluation of magnet programs employed a quasi-experimental design to investigate whether or not students enrolled in magnet programs gained any achievement advantage over students who were not enrolled in a magnet program. Researchers used Zero-One Linear Programming to draw multiple sets of matched samples from the non-magnet…

Some links on this page may take you to non-federal websites. Their policies may differ from this site.
Top