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

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

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

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

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

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

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

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

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

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

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

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

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

21 CFR 1311.116 - Additional requirements for biometrics.

Code of Federal Regulations, 2013 CFR

2013-04-01

... subsystem must operate at a false match rate of 0.001 or lower. (c) The biometric subsystem must use matching software that has demonstrated performance at the operating point corresponding with the false... co-located with a computer or PDA that the practitioner uses to issue electronic prescriptions for...

A Robust False Matching Points Detection Method for Remote Sensing Image Registration

NASA Astrophysics Data System (ADS)

Shan, X. J.; Tang, P.

2015-04-01

Given the influences of illumination, imaging angle, and geometric distortion, among others, false matching points still occur in all image registration algorithms. Therefore, false matching points detection is an important step in remote sensing image registration. Random Sample Consensus (RANSAC) is typically used to detect false matching points. However, RANSAC method cannot detect all false matching points in some remote sensing images. Therefore, a robust false matching points detection method based on Knearest- neighbour (K-NN) graph (KGD) is proposed in this method to obtain robust and high accuracy result. The KGD method starts with the construction of the K-NN graph in one image. K-NN graph can be first generated for each matching points and its K nearest matching points. Local transformation model for each matching point is then obtained by using its K nearest matching points. The error of each matching point is computed by using its transformation model. Last, L matching points with largest error are identified false matching points and removed. This process is iterative until all errors are smaller than the given threshold. In addition, KGD method can be used in combination with other methods, such as RANSAC. Several remote sensing images with different resolutions and terrains are used in the experiment. We evaluate the performance of KGD method, RANSAC + KGD method, RANSAC, and Graph Transformation Matching (GTM). The experimental results demonstrate the superior performance of the KGD and RANSAC + KGD methods.

Automated matching of supine and prone colonic polyps based on PCA and SVMs

NASA Astrophysics Data System (ADS)

Wang, Shijun; Van Uitert, Robert L.; Summers, Ronald M.

2008-03-01

Computed tomographic colonography (CTC) is a feasible and minimally invasive method for the detection of colorectal polyps and cancer screening. In current practice, a patient will be scanned twice during the CTC examination - once supine and once prone. In order to assist the radiologists in evaluating colon polyp candidates in both scans, we expect the computer aided detection (CAD) system can provide not only the locations of suspicious polyps, but also the possible matched pairs of polyps in two scans. In this paper, we propose a new automated matching method based on the extracted features of polyps by using principal component analysis (PCA) and Support Vector Machines (SVMs). Our dataset comes from the 104 CT scans of 52 patients with supine and prone positions collected from three medical centers. From it we constructed two groups of matched polyp candidates according to the size of true polyps: group A contains 12 true polyp pairs (> 9 mm) and 454 false pairs; group B contains 24 true polyp pairs (6-9 mm) and 514 false pairs. By using PCA, we reduced the dimensions of original data (with 157 attributes) to 30 dimensions. We did leave-one-patient-out test on the two groups of data. ROC analysis shows that it is easier to match bigger polyps than that of smaller polyps. On group A data, when false alarm probability is 0.18, the sensitivity of SVM achieves 0.83 which shows that automated matching of polyp candidates is practicable for clinical applications.

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

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

Computer-assisted polyp matching between optical colonoscopy and CT colonography: a phantom study

NASA Astrophysics Data System (ADS)

Roth, Holger R.; Hampshire, Thomas E.; Helbren, Emma; Hu, Mingxing; Vega, Roser; Halligan, Steve; Hawkes, David J.

2014-03-01

Potentially precancerous polyps detected with CT colonography (CTC) need to be removed subsequently, using an optical colonoscope (OC). Due to large colonic deformations induced by the colonoscope, even very experienced colonoscopists find it difficult to pinpoint the exact location of the colonoscope tip in relation to polyps reported on CTC. This can cause unduly prolonged OC examinations that are stressful for the patient, colonoscopist and supporting staff. We developed a method, based on monocular 3D reconstruction from OC images, that automatically matches polyps observed in OC with polyps reported on prior CTC. A matching cost is computed, using rigid point-based registration between surface point clouds extracted from both modalities. A 3D printed and painted phantom of a 25 cm long transverse colon segment was used to validate the method on two medium sized polyps. Results indicate that the matching cost is smaller at the correct corresponding polyp between OC and CTC: the value is 3.9 times higher at the incorrect polyp, comparing the correct match between polyps to the incorrect match. Furthermore, we evaluate the matching of the reconstructed polyp from OC with other colonic endoluminal surface structures such as haustral folds and show that there is a minimum at the correct polyp from CTC. Automated matching between polyps observed at OC and prior CTC would facilitate the biopsy or removal of true-positive pathology or exclusion of false-positive CTC findings, and would reduce colonoscopy false-negative (missed) polyps. Ultimately, such a method might reduce healthcare costs, patient inconvenience and discomfort.

Virtual Tool Mark Generation for Efficient Striation Analysis

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

Ekstrand, Laura; Zhang, Song; Grieve, Taylor

2014-02-16

This study introduces a tool mark analysis approach based upon 3D scans of screwdriver tip and marked plate surfaces at the micrometer scale from an optical microscope. An open-source 3D graphics software package is utilized to simulate the marking process as the projection of the tip's geometry in the direction of tool travel. The edge of this projection becomes a virtual tool mark that is compared to cross-sections of the marked plate geometry using the statistical likelihood algorithm introduced by Chumbley et al. In a study with both sides of six screwdriver tips and 34 corresponding marks, the method distinguishedmore » known matches from known nonmatches with zero false-positive matches and two false-negative matches. For matches, it could predict the correct marking angle within ±5–10°. Individual comparisons could be made in seconds on a desktop computer, suggesting that the method could save time for examiners.« less

Efficient Privacy-Aware Record Integration.

PubMed

Kuzu, Mehmet; Kantarcioglu, Murat; Inan, Ali; Bertino, Elisa; Durham, Elizabeth; Malin, Bradley

2013-01-01

The integration of information dispersed among multiple repositories is a crucial step for accurate data analysis in various domains. In support of this goal, it is critical to devise procedures for identifying similar records across distinct data sources. At the same time, to adhere to privacy regulations and policies, such procedures should protect the confidentiality of the individuals to whom the information corresponds. Various private record linkage (PRL) protocols have been proposed to achieve this goal, involving secure multi-party computation (SMC) and similarity preserving data transformation techniques. SMC methods provide secure and accurate solutions to the PRL problem, but are prohibitively expensive in practice, mainly due to excessive computational requirements. Data transformation techniques offer more practical solutions, but incur the cost of information leakage and false matches. In this paper, we introduce a novel model for practical PRL, which 1) affords controlled and limited information leakage, 2) avoids false matches resulting from data transformation. Initially, we partition the data sources into blocks to eliminate comparisons for records that are unlikely to match. Then, to identify matches, we apply an efficient SMC technique between the candidate record pairs. To enable efficiency and privacy, our model leaks a controlled amount of obfuscated data prior to the secure computations. Applied obfuscation relies on differential privacy which provides strong privacy guarantees against adversaries with arbitrary background knowledge. In addition, we illustrate the practical nature of our approach through an empirical analysis with data derived from public voter records.

Automated Point Cloud Correspondence Detection for Underwater Mapping Using AUVs

NASA Technical Reports Server (NTRS)

Hammond, Marcus; Clark, Ashley; Mahajan, Aditya; Sharma, Sumant; Rock, Stephen

2015-01-01

An algorithm for automating correspondence detection between point clouds composed of multibeam sonar data is presented. This allows accurate initialization for point cloud alignment techniques even in cases where accurate inertial navigation is not available, such as iceberg profiling or vehicles with low-grade inertial navigation systems. Techniques from computer vision literature are used to extract, label, and match keypoints between "pseudo-images" generated from these point clouds. Image matches are refined using RANSAC and information about the vehicle trajectory. The resulting correspondences can be used to initialize an iterative closest point (ICP) registration algorithm to estimate accumulated navigation error and aid in the creation of accurate, self-consistent maps. The results presented use multibeam sonar data obtained from multiple overlapping passes of an underwater canyon in Monterey Bay, California. Using strict matching criteria, the method detects 23 between-swath correspondence events in a set of 155 pseudo-images with zero false positives. Using less conservative matching criteria doubles the number of matches but introduces several false positive matches as well. Heuristics based on known vehicle trajectory information are used to eliminate these.

Recognition of partially occluded threat objects using the annealed Hopefield network

NASA Technical Reports Server (NTRS)

Kim, Jung H.; Yoon, Sung H.; Park, Eui H.; Ntuen, Celestine A.

1992-01-01

Recognition of partially occluded objects has been an important issue to airport security because occlusion causes significant problems in identifying and locating objects during baggage inspection. The neural network approach is suitable for the problems in the sense that the inherent parallelism of neural networks pursues many hypotheses in parallel resulting in high computation rates. Moreover, they provide a greater degree of robustness or fault tolerance than conventional computers. The annealed Hopfield network which is derived from the mean field annealing (MFA) has been developed to find global solutions of a nonlinear system. In the study, it has been proven that the system temperature of MFA is equivalent to the gain of the sigmoid function of a Hopfield network. In our early work, we developed the hybrid Hopfield network (HHN) for fast and reliable matching. However, HHN doesn't guarantee global solutions and yields false matching under heavily occluded conditions because HHN is dependent on initial states by its nature. In this paper, we present the annealed Hopfield network (AHN) for occluded object matching problems. In AHN, the mean field theory is applied to the hybird Hopfield network in order to improve computational complexity of the annealed Hopfield network and provide reliable matching under heavily occluded conditions. AHN is slower than HHN. However, AHN provides near global solutions without initial restrictions and provides less false matching than HHN. In conclusion, a new algorithm based upon a neural network approach was developed to demonstrate the feasibility of the automated inspection of threat objects from x-ray images. The robustness of the algorithm is proved by identifying occluded target objects with large tolerance of their features.

Neural Global Pattern Similarity Underlies True and False Memories.

PubMed

Ye, Zhifang; Zhu, Bi; Zhuang, Liping; Lu, Zhonglin; Chen, Chuansheng; Xue, Gui

2016-06-22

The neural processes giving rise to human memory strength signals remain poorly understood. Inspired by formal computational models that posit a central role of global matching in memory strength, we tested a novel hypothesis that the strengths of both true and false memories arise from the global similarity of an item's neural activation pattern during retrieval to that of all the studied items during encoding (i.e., the encoding-retrieval neural global pattern similarity [ER-nGPS]). We revealed multiple ER-nGPS signals that carried distinct information and contributed differentially to true and false memories: Whereas the ER-nGPS in the parietal regions reflected semantic similarity and was scaled with the recognition strengths of both true and false memories, ER-nGPS in the visual cortex contributed solely to true memory. Moreover, ER-nGPS differences between the parietal and visual cortices were correlated with frontal monitoring processes. By combining computational and neuroimaging approaches, our results advance a mechanistic understanding of memory strength in recognition. What neural processes give rise to memory strength signals, and lead to our conscious feelings of familiarity? Using fMRI, we found that the memory strength of a given item depends not only on how it was encoded during learning, but also on the similarity of its neural representation with other studied items. The global neural matching signal, mainly in the parietal lobule, could account for the memory strengths of both studied and unstudied items. Interestingly, a different global matching signal, originated from the visual cortex, could distinguish true from false memories. The findings reveal multiple neural mechanisms underlying the memory strengths of events registered in the brain. Copyright © 2016 the authors 0270-6474/16/366792-11$15.00/0.

On the integral use of foundational concepts in verifying validity during skull-photo superimposition.

PubMed

Jayaprakash, Paul T

2017-09-01

Often cited reliability test on video superimposition method integrated scaling face-images in relation to skull-images, tragus-auditory meatus relationship in addition to exocanthion-Whitnall's tubercle relationship when orientating the skull-image and wipe mode imaging in addition to mix mode imaging when obtaining skull-face image overlay and evaluating the goodness of match. However, a report that found higher false positive matches in computer assisted superimposition method transited from the above foundational concepts and relied on images of unspecified sizes that are lesser than 'life-size', frontal plane landmarks in the skull- and face- images alone for orientating the skull-image and mix images alone for evaluating the goodness of match. Recently, arguing the use of 'life-size' images as 'archaic', the authors who tested the reliability in the computer assisted superimposition method have denied any method transition. This article describes that the use of images of unspecified sizes at lesser than 'life-size' eliminates the only possibility to quantify parameters during superimposition which alone enables dynamic skull orientation when overlaying a skull-image with a face-image in an anatomically acceptable orientation. The dynamic skull orientation process mandatorily requires aligning the tragus in the 2D face-image with the auditory meatus in the 3D skull-image for anatomically orientating the skull-image in relation to the posture in the face-image, a step not mentioned by the authors describing the computer assisted superimposition method. Furthermore, mere reliance on mix type images during image overlay eliminates the possibility to assess the relationship between the leading edges of the skull- and face-image outlines as also specific area match among the corresponding craniofacial organs during superimposition. Indicating the possibility of increased false positive matches as a consequence of the above method transitions, the need for testing the reliability in the superimposition method adopting concepts that are considered safe is stressed. Copyright © 2017 Elsevier B.V. All rights reserved.

Weighted parallel contributions of binocular correlation and match signals to conscious perception of depth

PubMed Central

2016-01-01

Binocular disparity is detected in the primary visual cortex by a process similar to calculation of local cross-correlation between left and right retinal images. As a consequence, correlation-based neural signals convey information about false disparities as well as the true disparity. The false responses in the initial disparity detectors are eliminated at later stages in order to encode only disparities of the features correctly matched between the two eyes. For a simple stimulus configuration, a feed-forward nonlinear process can transform the correlation signal into the match signal. For human observers, depth judgement is determined by a weighted sum of the correlation and match signals rather than depending solely on the latter. The relative weight changes with spatial and temporal parameters of the stimuli, allowing adaptive recruitment of the two computations under different visual circumstances. A full transformation from correlation-based to match-based representation occurs at the neuronal population level in cortical area V4 and manifests in single-neuron responses of inferior temporal and posterior parietal cortices. Neurons in area V5/MT represent disparity in a manner intermediate between the correlation and match signals. We propose that the correlation and match signals in these areas contribute to depth perception in a weighted, parallel manner. This article is part of the themed issue ‘Vision in our three-dimensional world’. PMID:27269600

Weighted parallel contributions of binocular correlation and match signals to conscious perception of depth.

PubMed

Fujita, Ichiro; Doi, Takahiro

2016-06-19

Binocular disparity is detected in the primary visual cortex by a process similar to calculation of local cross-correlation between left and right retinal images. As a consequence, correlation-based neural signals convey information about false disparities as well as the true disparity. The false responses in the initial disparity detectors are eliminated at later stages in order to encode only disparities of the features correctly matched between the two eyes. For a simple stimulus configuration, a feed-forward nonlinear process can transform the correlation signal into the match signal. For human observers, depth judgement is determined by a weighted sum of the correlation and match signals rather than depending solely on the latter. The relative weight changes with spatial and temporal parameters of the stimuli, allowing adaptive recruitment of the two computations under different visual circumstances. A full transformation from correlation-based to match-based representation occurs at the neuronal population level in cortical area V4 and manifests in single-neuron responses of inferior temporal and posterior parietal cortices. Neurons in area V5/MT represent disparity in a manner intermediate between the correlation and match signals. We propose that the correlation and match signals in these areas contribute to depth perception in a weighted, parallel manner.This article is part of the themed issue 'Vision in our three-dimensional world'. © 2016 The Author(s).

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

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

Robust efficient video fingerprinting

NASA Astrophysics Data System (ADS)

Puri, Manika; Lubin, Jeffrey

2009-02-01

We have developed a video fingerprinting system with robustness and efficiency as the primary and secondary design criteria. In extensive testing, the system has shown robustness to cropping, letter-boxing, sub-titling, blur, drastic compression, frame rate changes, size changes and color changes, as well as to the geometric distortions often associated with camcorder capture in cinema settings. Efficiency is afforded by a novel two-stage detection process in which a fast matching process first computes a number of likely candidates, which are then passed to a second slower process that computes the overall best match with minimal false alarm probability. One key component of the algorithm is a maximally stable volume computation - a three-dimensional generalization of maximally stable extremal regions - that provides a content-centric coordinate system for subsequent hash function computation, independent of any affine transformation or extensive cropping. Other key features include an efficient bin-based polling strategy for initial candidate selection, and a final SIFT feature-based computation for final verification. We describe the algorithm and its performance, and then discuss additional modifications that can provide further improvement to efficiency and accuracy.

Fast correspondences search in anatomical trees

NASA Astrophysics Data System (ADS)

dos Santos, Thiago R.; Gergel, Ingmar; Meinzer, Hans-Peter; Maier-Hein, Lena

2010-03-01

Registration of multiple medical images commonly comprises the steps feature extraction, correspondences search and transformation computation. In this paper, we present a new method for a fast and pose independent search of correspondences using as features anatomical trees such as the bronchial system in the lungs or the vessel system in the liver. Our approach scores the similarities between the trees' nodes (bifurcations) taking into account both, topological properties extracted from their graph representations and anatomical properties extracted from the trees themselves. The node assignment maximizes the global similarity (sum of the scores of each pair of assigned nodes), assuring that the matches are distributed throughout the trees. Furthermore, the proposed method is able to deal with distortions in the data, such as noise, motion, artifacts, and problems associated with the extraction method, such as missing or false branches. According to an evaluation on swine lung data sets, the method requires less than one second on average to compute the matching and yields a high rate of correct matches compared to state of the art work.

Unsupervised learning of discriminative edge measures for vehicle matching between nonoverlapping cameras.

PubMed

Shan, Ying; Sawhney, Harpreet S; Kumar, Rakesh

2008-04-01

This paper proposes a novel unsupervised algorithm learning discriminative features in the context of matching road vehicles between two non-overlapping cameras. The matching problem is formulated as a same-different classification problem, which aims to compute the probability of vehicle images from two distinct cameras being from the same vehicle or different vehicle(s). We employ a novel measurement vector that consists of three independent edge-based measures and their associated robust measures computed from a pair of aligned vehicle edge maps. The weight of each measure is determined by an unsupervised learning algorithm that optimally separates the same-different classes in the combined measurement space. This is achieved with a weak classification algorithm that automatically collects representative samples from same-different classes, followed by a more discriminative classifier based on Fisher' s Linear Discriminants and Gibbs Sampling. The robustness of the match measures and the use of unsupervised discriminant analysis in the classification ensures that the proposed method performs consistently in the presence of missing/false features, temporally and spatially changing illumination conditions, and systematic misalignment caused by different camera configurations. Extensive experiments based on real data of over 200 vehicles at different times of day demonstrate promising results.

On combining multi-normalization and ancillary measures for the optimal score level fusion of fingerprint and voice biometrics

NASA Astrophysics Data System (ADS)

Mohammed Anzar, Sharafudeen Thaha; Sathidevi, Puthumangalathu Savithri

2014-12-01

In this paper, we have considered the utility of multi-normalization and ancillary measures, for the optimal score level fusion of fingerprint and voice biometrics. An efficient matching score preprocessing technique based on multi-normalization is employed for improving the performance of the multimodal system, under various noise conditions. Ancillary measures derived from the feature space and the score space are used in addition to the matching score vectors, for weighing the modalities, based on their relative degradation. Reliability (dispersion) and the separability (inter-/intra-class distance and d-prime statistics) measures under various noise conditions are estimated from the individual modalities, during the training/validation stage. The `best integration weights' are then computed by algebraically combining these measures using the weighted sum rule. The computed integration weights are then optimized against the recognition accuracy using techniques such as grid search, genetic algorithm and particle swarm optimization. The experimental results show that, the proposed biometric solution leads to considerable improvement in the recognition performance even under low signal-to-noise ratio (SNR) conditions and reduces the false acceptance rate (FAR) and false rejection rate (FRR), making the system useful for security as well as forensic applications.

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

On the feasibility of linking census samples to the National Death Index for epidemiologic studies: a progress report.

PubMed Central

Rogot, E; Feinleib, M; Ockay, K A; Schwartz, S H; Bilgrad, R; Patterson, J E

1983-01-01

To test the feasibility of using large national probability samples provided by the US Census Bureau, a pilot project was initiated to link 230,000 Census-type records to the National Death Index (NDI). Using strict precautions to maintain the complete confidentiality of individual records, the Current Population Survey files of one month in 1973 and one month in 1978 were matched by computer to the 1979 NDI file. The basic question to be addressed was whether deaths so obtained are seriously underestimated when there is no Social Security Number (SSN) in the Census record. The search of the NDI file resulted in 5,542 matches of which about 1,800 appear to be "true positives" representing deaths, the remainder are "false positives." Of the deaths, 80 per cent would still have been detected without SSN in the Census record. The main reasons for missing deaths (false negatives) were discrepancies in the year of birth and in the given name. Assuming certain changes in the NDI matching algorithm, the 80 per cent figure could increase to 85 per cent or higher; however, this could also cause significant increases in the number of false positives. The National Heart, Lung and Blood Institute (NHLBI) and Census Bureau staff are currently developing a probabilistic method to eliminate false positives from the NDI output tape. The results of the pilot study indicate that a larger research project is clearly feasible. PMID:6625029

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

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

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

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

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

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

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

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

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

Homographic Patch Feature Transform: A Robustness Registration for Gastroscopic Surgery.

PubMed

Hu, Weiling; Zhang, Xu; Wang, Bin; Liu, Jiquan; Duan, Huilong; Dai, Ning; Si, Jianmin

2016-01-01

Image registration is a key component of computer assistance in image guided surgery, and it is a challenging topic in endoscopic environments. In this study, we present a method for image registration named Homographic Patch Feature Transform (HPFT) to match gastroscopic images. HPFT can be used for tracking lesions and augmenting reality applications during gastroscopy. Furthermore, an overall evaluation scheme is proposed to validate the precision, robustness and uniformity of the registration results, which provides a standard for rejection of false matching pairs from corresponding results. Finally, HPFT is applied for processing in vivo gastroscopic data. The experimental results show that HPFT has stable performance in gastroscopic applications.

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

Improving and Assessing Planet Sensitivity of the GPI Exoplanet Survey with a Forward Model Matched Filter

NASA Astrophysics Data System (ADS)

Ruffio, Jean-Baptiste; Macintosh, Bruce; Wang, Jason J.; Pueyo, Laurent; Nielsen, Eric L.; De Rosa, Robert J.; Czekala, Ian; Marley, Mark S.; Arriaga, Pauline; Bailey, Vanessa P.; Barman, Travis; Bulger, Joanna; Chilcote, Jeffrey; Cotten, Tara; Doyon, Rene; Duchêne, Gaspard; Fitzgerald, Michael P.; Follette, Katherine B.; Gerard, Benjamin L.; Goodsell, Stephen J.; Graham, James R.; Greenbaum, Alexandra Z.; Hibon, Pascale; Hung, Li-Wei; Ingraham, Patrick; Kalas, Paul; Konopacky, Quinn; Larkin, James E.; Maire, Jérôme; Marchis, Franck; Marois, Christian; Metchev, Stanimir; Millar-Blanchaer, Maxwell A.; Morzinski, Katie M.; Oppenheimer, Rebecca; Palmer, David; Patience, Jennifer; Perrin, Marshall; Poyneer, Lisa; Rajan, Abhijith; Rameau, Julien; Rantakyrö, Fredrik T.; Savransky, Dmitry; Schneider, Adam C.; Sivaramakrishnan, Anand; Song, Inseok; Soummer, Remi; Thomas, Sandrine; Wallace, J. Kent; Ward-Duong, Kimberly; Wiktorowicz, Sloane; Wolff, Schuyler

2017-06-01

We present a new matched-filter algorithm for direct detection of point sources in the immediate vicinity of bright stars. The stellar point-spread function (PSF) is first subtracted using a Karhunen-Loéve image processing (KLIP) algorithm with angular and spectral differential imaging (ADI and SDI). The KLIP-induced distortion of the astrophysical signal is included in the matched-filter template by computing a forward model of the PSF at every position in the image. To optimize the performance of the algorithm, we conduct extensive planet injection and recovery tests and tune the exoplanet spectra template and KLIP reduction aggressiveness to maximize the signal-to-noise ratio (S/N) of the recovered planets. We show that only two spectral templates are necessary to recover any young Jovian exoplanets with minimal S/N loss. We also developed a complete pipeline for the automated detection of point-source candidates, the calculation of receiver operating characteristics (ROC), contrast curves based on false positives, and completeness contours. We process in a uniform manner more than 330 data sets from the Gemini Planet Imager Exoplanet Survey and assess GPI typical sensitivity as a function of the star and the hypothetical companion spectral type. This work allows for the first time a comparison of different detection algorithms at a survey scale accounting for both planet completeness and false-positive rate. We show that the new forward model matched filter allows the detection of 50% fainter objects than a conventional cross-correlation technique with a Gaussian PSF template for the same false-positive rate.

Position and volume estimation of atmospheric nuclear detonations from video reconstruction

NASA Astrophysics Data System (ADS)

Schmitt, Daniel T.

Recent work in digitizing films of foundational atmospheric nuclear detonations from the 1950s provides an opportunity to perform deeper analysis on these historical tests. This work leverages multi-view geometry and computer vision techniques to provide an automated means to perform three-dimensional analysis of the blasts for several points in time. The accomplishment of this requires careful alignment of the films in time, detection of features in the images, matching of features, and multi-view reconstruction. Sub-explosion features can be detected with a 67% hit rate and 22% false alarm rate. Hotspot features can be detected with a 71.95% hit rate, 86.03% precision and a 0.015% false positive rate. Detected hotspots are matched across 57-109 degree viewpoints with 76.63% average correct matching by defining their location relative to the center of the explosion, rotating them to the alternative viewpoint, and matching them collectively. When 3D reconstruction is applied to the hotspot matching it completes an automated process that has been used to create 168 3D point clouds with 31.6 points per reconstruction with each point having an accuracy of 0.62 meters with 0.35, 0.24, and 0.34 meters of accuracy in the x-, y- and z-direction respectively. As a demonstration of using the point clouds for analysis, volumes are estimated and shown to be consistent with radius-based models and in some cases improve on the level of uncertainty in the yield calculation.

The correct estimate of the probability of false detection of the matched filter in weak-signal detection problems . II. Further results with application to a set of ALMA and ATCA data

NASA Astrophysics Data System (ADS)

Vio, R.; Vergès, C.; Andreani, P.

2017-08-01

The matched filter (MF) is one of the most popular and reliable techniques to the detect signals of known structure and amplitude smaller than the level of the contaminating noise. Under the assumption of stationary Gaussian noise, MF maximizes the probability of detection subject to a constant probability of false detection or false alarm (PFA). This property relies upon a priori knowledge of the position of the searched signals, which is usually not available. Recently, it has been shown that when applied in its standard form, MF may severely underestimate the PFA. As a consequence the statistical significance of features that belong to noise is overestimated and the resulting detections are actually spurious. For this reason, an alternative method of computing the PFA has been proposed that is based on the probability density function (PDF) of the peaks of an isotropic Gaussian random field. In this paper we further develop this method. In particular, we discuss the statistical meaning of the PFA and show that, although useful as a preliminary step in a detection procedure, it is not able to quantify the actual reliability of a specific detection. For this reason, a new quantity is introduced called the specific probability of false alarm (SPFA), which is able to carry out this computation. We show how this method works in targeted simulations and apply it to a few interferometric maps taken with the Atacama Large Millimeter/submillimeter Array (ALMA) and the Australia Telescope Compact Array (ATCA). We select a few potential new point sources and assign an accurate detection reliability to these sources.

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

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

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

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

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

Face identification with frequency domain matched filtering in mobile environments

NASA Astrophysics Data System (ADS)

Lee, Dong-Su; Woo, Yong-Hyun; Yeom, Seokwon; Kim, Shin-Hwan

2012-06-01

Face identification at a distance is very challenging since captured images are often degraded by blur and noise. Furthermore, the computational resources and memory are often limited in the mobile environments. Thus, it is very challenging to develop a real-time face identification system on the mobile device. This paper discusses face identification based on frequency domain matched filtering in the mobile environments. Face identification is performed by the linear or phase-only matched filter and sequential verification stages. The candidate window regions are decided by the major peaks of the linear or phase-only matched filtering outputs. The sequential stages comprise a skin-color test and an edge mask filtering test, which verify color and shape information of the candidate regions in order to remove false alarms. All algorithms are built on the mobile device using Android platform. The preliminary results show that face identification of East Asian people can be performed successfully in the mobile environments.

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

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

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

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

Improving and Assessing Planet Sensitivity of the GPI Exoplanet Survey with a Forward Model Matched Filter

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

Ruffio, Jean-Baptiste; Macintosh, Bruce; Nielsen, Eric L.

We present a new matched-filter algorithm for direct detection of point sources in the immediate vicinity of bright stars. The stellar point-spread function (PSF) is first subtracted using a Karhunen-Loéve image processing (KLIP) algorithm with angular and spectral differential imaging (ADI and SDI). The KLIP-induced distortion of the astrophysical signal is included in the matched-filter template by computing a forward model of the PSF at every position in the image. To optimize the performance of the algorithm, we conduct extensive planet injection and recovery tests and tune the exoplanet spectra template and KLIP reduction aggressiveness to maximize the signal-to-noise ratiomore » (S/N) of the recovered planets. We show that only two spectral templates are necessary to recover any young Jovian exoplanets with minimal S/N loss. We also developed a complete pipeline for the automated detection of point-source candidates, the calculation of receiver operating characteristics (ROC), contrast curves based on false positives, and completeness contours. We process in a uniform manner more than 330 data sets from the Gemini Planet Imager Exoplanet Survey and assess GPI typical sensitivity as a function of the star and the hypothetical companion spectral type. This work allows for the first time a comparison of different detection algorithms at a survey scale accounting for both planet completeness and false-positive rate. We show that the new forward model matched filter allows the detection of 50% fainter objects than a conventional cross-correlation technique with a Gaussian PSF template for the same false-positive rate.« less

Validation of SmartRank: A likelihood ratio software for searching national DNA databases with complex DNA profiles.

PubMed

Benschop, Corina C G; van de Merwe, Linda; de Jong, Jeroen; Vanvooren, Vanessa; Kempenaers, Morgane; Kees van der Beek, C P; Barni, Filippo; Reyes, Eusebio López; Moulin, Léa; Pene, Laurent; Haned, Hinda; Sijen, Titia

2017-07-01

Searching a national DNA database with complex and incomplete profiles usually yields very large numbers of possible matches that can present many candidate suspects to be further investigated by the forensic scientist and/or police. Current practice in most forensic laboratories consists of ordering these 'hits' based on the number of matching alleles with the searched profile. Thus, candidate profiles that share the same number of matching alleles are not differentiated and due to the lack of other ranking criteria for the candidate list it may be difficult to discern a true match from the false positives or notice that all candidates are in fact false positives. SmartRank was developed to put forward only relevant candidates and rank them accordingly. The SmartRank software computes a likelihood ratio (LR) for the searched profile and each profile in the DNA database and ranks database entries above a defined LR threshold according to the calculated LR. In this study, we examined for mixed DNA profiles of variable complexity whether the true donors are retrieved, what the number of false positives above an LR threshold is and the ranking position of the true donors. Using 343 mixed DNA profiles over 750 SmartRank searches were performed. In addition, the performance of SmartRank and CODIS were compared regarding DNA database searches and SmartRank was found complementary to CODIS. We also describe the applicable domain of SmartRank and provide guidelines. The SmartRank software is open-source and freely available. Using the best practice guidelines, SmartRank enables obtaining investigative leads in criminal cases lacking a suspect. Copyright © 2017 Elsevier B.V. All rights reserved.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Block-suffix shifting: fast, simultaneous medical concept set identification in large medical record corpora.

PubMed

Liu, Ying; Lita, Lucian Vlad; Niculescu, Radu Stefan; Mitra, Prasenjit; Giles, C Lee

2008-11-06

Owing to new advances in computer hardware, large text databases have become more prevalent than ever.Automatically mining information from these databases proves to be a challenge due to slow pattern/string matching techniques. In this paper we present a new, fast multi-string pattern matching method based on the well known Aho-Chorasick algorithm. Advantages of our algorithm include:the ability to exploit the natural structure of text, the ability to perform significant character shifting, avoiding backtracking jumps that are not useful, efficiency in terms of matching time and avoiding the typical "sub-string" false positive errors.Our algorithm is applicable to many fields with free text, such as the health care domain and the scientific document field. In this paper, we apply the BSS algorithm to health care data and mine hundreds of thousands of medical concepts from a large Electronic Medical Record (EMR) corpora simultaneously and efficiently. Experimental results show the superiority of our algorithm when compared with the top of the line multi-string matching algorithms.

False match elimination for face recognition based on SIFT algorithm

NASA Astrophysics Data System (ADS)

Gu, Xuyuan; Shi, Ping; Shao, Meide

2011-06-01

The SIFT (Scale Invariant Feature Transform) is a well known algorithm used to detect and describe local features in images. It is invariant to image scale, rotation and robust to the noise and illumination. In this paper, a novel method used for face recognition based on SIFT is proposed, which combines the optimization of SIFT, mutual matching and Progressive Sample Consensus (PROSAC) together and can eliminate the false matches of face recognition effectively. Experiments on ORL face database show that many false matches can be eliminated and better recognition rate is achieved.

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

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

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

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

A novel image registration approach via combining local features and geometric invariants

PubMed Central

Lu, Yan; Gao, Kun; Zhang, Tinghua; Xu, Tingfa

2018-01-01

Image registration is widely used in many fields, but the adaptability of the existing methods is limited. This work proposes a novel image registration method with high precision for various complex applications. In this framework, the registration problem is divided into two stages. First, we detect and describe scale-invariant feature points using modified computer vision-oriented fast and rotated brief (ORB) algorithm, and a simple method to increase the performance of feature points matching is proposed. Second, we develop a new local constraint of rough selection according to the feature distances. Evidence shows that the existing matching techniques based on image features are insufficient for the images with sparse image details. Then, we propose a novel matching algorithm via geometric constraints, and establish local feature descriptions based on geometric invariances for the selected feature points. Subsequently, a new price function is constructed to evaluate the similarities between points and obtain exact matching pairs. Finally, we employ the progressive sample consensus method to remove wrong matches and calculate the space transform parameters. Experimental results on various complex image datasets verify that the proposed method is more robust and significantly reduces the rate of false matches while retaining more high-quality feature points. PMID:29293595

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

A method for automatic matching of multi-timepoint findings for enhanced clinical workflow

NASA Astrophysics Data System (ADS)

Raghupathi, Laks; Dinesh, MS; Devarakota, Pandu R.; Valadez, Gerardo Hermosillo; Wolf, Matthias

2013-03-01

Non-interventional diagnostics (CT or MR) enables early identification of diseases like cancer. Often, lesion growth assessment done during follow-up is used to distinguish between benign and malignant ones. Thus correspondences need to be found for lesions localized at each time point. Manually matching the radiological findings can be time consuming as well as tedious due to possible differences in orientation and position between scans. Also, the complicated nature of the disease makes the physicians to rely on multiple modalities (PETCT, PET-MR) where it is even more challenging. Here, we propose an automatic feature-based matching that is robust to change in organ volume, subpar or no registration that can be done with very less computations. Traditional matching methods rely mostly on accurate image registration and applying the resulting deformation map on the findings coordinates. This has disadvantages when accurate registration is time-consuming or may not be possible due to vast organ volume differences between scans. Our novel matching proposes supervised learning by taking advantage of the underlying CAD features that are already present and considering the matching as a classification problem. In addition, the matching can be done extremely fast and at reasonable accuracy even when the image registration fails for some reason. Experimental results∗ on real-world multi-time point thoracic CT data showed an accuracy of above 90% with negligible false positives on a variety of registration scenarios.

Assessing False-Belief Understanding in Children with Autism Using a Computer Application: A Pilot Study.

PubMed

Carlsson, Emilia; Miniscalco, Carmela; Gillberg, Christopher; Åsberg Johnels, Jakob

2018-03-26

We have developed a False-Belief (FB) understanding task for use on a computer tablet, trying to assess FB understanding in a less social way. It is based on classical FB protocols, and additionally includes a manipulation of language in an attempt to explore the facilitating effect of linguistic support during FB processing. Specifically, the FB task was presented in three auditory conditions: narrative, silent, and interference. The task was assumed to shed new light on the FB difficulties often observed in Autism Spectrum Disorder (ASD). Sixty-eight children with ASD (M = 7.5 years) and an age matched comparison group with 98 typically developing (TD) children were assessed with the FB task. The children with ASD did not perform above chance level in any condition, and significant differences in success rates were found between the groups in two conditions (silent and narrative), with TD children performing better. We discuss implications, limitations, and further developments.

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.

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

How many genetic markers to tag an individual? An empirical assessment of false matching rates among close relatives.

PubMed

Rew, Mary Beth; Robbins, Jooke; Mattila, David; Palsbøll, Per J; Bérube, Martine

2011-04-01

Genetic identification of individuals is now commonplace, enabling the application of tagging methods to elusive species or species that cannot be tagged by traditional methods. A key aspect is determining the number of loci required to ensure that different individuals have non-matching multi-locus genotypes. Closely related individuals are of particular concern because of elevated matching probabilities caused by their recent co-ancestry. This issue may be addressed by increasing the number of loci to a level where full siblings (the relatedness category with the highest matching probability) are expected to have non-matching multi-locus genotypes. However, increasing the number of loci to meet this "full-sib criterion" greatly increases the laboratory effort, which in turn may increase the genotyping error rate resulting in an upward-biased mark-recapture estimate of abundance as recaptures are missed due to genotyping errors. We assessed the contribution of false matches from close relatives among 425 maternally related humpback whales, each genotyped at 20 microsatellite loci. We observed a very low (0.5-4%) contribution to falsely matching samples from pairs of first-order relatives (i.e., parent and offspring or full siblings). The main contribution to falsely matching individuals from close relatives originated from second-order relatives (e.g., half siblings), which was estimated at 9%. In our study, the total number of observed matches agreed well with expectations based upon the matching probability estimated for unrelated individuals, suggesting that the full-sib criterion is overly conservative, and would have required a 280% relative increase in effort. We suggest that, under most circumstances, the overall contribution to falsely matching samples from close relatives is likely to be low, and hence applying the full-sib criterion is unnecessary. In those cases where close relatives may present a significant issue, such as unrepresentative sampling, we propose three different genotyping strategies requiring only a modest increase in effort, which will greatly reduce the number of false matches due to the presence of related individuals.

A survey of computational methods and error rate estimation procedures for peptide and protein identification in shotgun proteomics

PubMed Central

Nesvizhskii, Alexey I.

2010-01-01

This manuscript provides a comprehensive review of the peptide and protein identification process using tandem mass spectrometry (MS/MS) data generated in shotgun proteomic experiments. The commonly used methods for assigning peptide sequences to MS/MS spectra are critically discussed and compared, from basic strategies to advanced multi-stage approaches. A particular attention is paid to the problem of false-positive identifications. Existing statistical approaches for assessing the significance of peptide to spectrum matches are surveyed, ranging from single-spectrum approaches such as expectation values to global error rate estimation procedures such as false discovery rates and posterior probabilities. The importance of using auxiliary discriminant information (mass accuracy, peptide separation coordinates, digestion properties, and etc.) is discussed, and advanced computational approaches for joint modeling of multiple sources of information are presented. This review also includes a detailed analysis of the issues affecting the interpretation of data at the protein level, including the amplification of error rates when going from peptide to protein level, and the ambiguities in inferring the identifies of sample proteins in the presence of shared peptides. Commonly used methods for computing protein-level confidence scores are discussed in detail. The review concludes with a discussion of several outstanding computational issues. PMID:20816881

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

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

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

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

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

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

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

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

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

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

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

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.

A fast image matching algorithm based on key points

NASA Astrophysics Data System (ADS)

Wang, Huilin; Wang, Ying; An, Ru; Yan, Peng

2014-05-01

Image matching is a very important technique in image processing. It has been widely used for object recognition and tracking, image retrieval, three-dimensional vision, change detection, aircraft position estimation, and multi-image registration. Based on the requirements of matching algorithm for craft navigation, such as speed, accuracy and adaptability, a fast key point image matching method is investigated and developed. The main research tasks includes: (1) Developing an improved celerity key point detection approach using self-adapting threshold of Features from Accelerated Segment Test (FAST). A method of calculating self-adapting threshold was introduced for images with different contrast. Hessian matrix was adopted to eliminate insecure edge points in order to obtain key points with higher stability. This approach in detecting key points has characteristics of small amount of computation, high positioning accuracy and strong anti-noise ability; (2) PCA-SIFT is utilized to describe key point. 128 dimensional vector are formed based on the SIFT method for the key points extracted. A low dimensional feature space was established by eigenvectors of all the key points, and each eigenvector was projected onto the feature space to form a low dimensional eigenvector. These key points were re-described by dimension-reduced eigenvectors. After reducing the dimension by the PCA, the descriptor was reduced to 20 dimensions from the original 128. This method can reduce dimensions of searching approximately near neighbors thereby increasing overall speed; (3) Distance ratio between the nearest neighbour and second nearest neighbour searching is regarded as the measurement criterion for initial matching points from which the original point pairs matched are obtained. Based on the analysis of the common methods (e.g. RANSAC (random sample consensus) and Hough transform cluster) used for elimination false matching point pairs, a heuristic local geometric restriction strategy is adopted to discard false matched point pairs further; and (4) Affine transformation model is introduced to correct coordinate difference between real-time image and reference image. This resulted in the matching of the two images. SPOT5 Remote sensing images captured at different date and airborne images captured with different flight attitude were used to test the performance of the method from matching accuracy, operation time and ability to overcome rotation. Results show the effectiveness of the approach.

Content Based Image Matching for Planetary Science

NASA Astrophysics Data System (ADS)

Deans, M. C.; Meyer, C.

2006-12-01

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

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

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

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

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

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

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

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

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

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.

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

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

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

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

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

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

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

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

Efficient structure from motion on large scenes using UAV with position and pose information

NASA Astrophysics Data System (ADS)

Teng, Xichao; Yu, Qifeng; Shang, Yang; Luo, Jing; Wang, Gang

2018-04-01

In this paper, we exploit prior information from global positioning systems and inertial measurement units to speed up the process of large scene reconstruction from images acquired by Unmanned Aerial Vehicles. We utilize weak pose information and intrinsic parameter to obtain the projection matrix for each view. As compared to unmanned aerial vehicles' flight altitude, topographic relief can usually be ignored, we assume that the scene is flat and use weak perspective camera to get projective transformations between two views. Furthermore, we propose an overlap criterion and select potentially matching view pairs between projective transformed views. A robust global structure from motion method is used for image based reconstruction. Our real world experiments show that the approach is accurate, scalable and computationally efficient. Moreover, projective transformations between views can also be used to eliminate false matching.

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

An Integrated Ransac and Graph Based Mismatch Elimination Approach for Wide-Baseline Image Matching

NASA Astrophysics Data System (ADS)

Hasheminasab, M.; Ebadi, H.; Sedaghat, A.

2015-12-01

In this paper we propose an integrated approach in order to increase the precision of feature point matching. Many different algorithms have been developed as to optimizing the short-baseline image matching while because of illumination differences and viewpoints changes, wide-baseline image matching is so difficult to handle. Fortunately, the recent developments in the automatic extraction of local invariant features make wide-baseline image matching possible. The matching algorithms which are based on local feature similarity principle, using feature descriptor as to establish correspondence between feature point sets. To date, the most remarkable descriptor is the scale-invariant feature transform (SIFT) descriptor , which is invariant to image rotation and scale, and it remains robust across a substantial range of affine distortion, presence of noise, and changes in illumination. The epipolar constraint based on RANSAC (random sample consensus) method is a conventional model for mismatch elimination, particularly in computer vision. Because only the distance from the epipolar line is considered, there are a few false matches in the selected matching results based on epipolar geometry and RANSAC. Aguilariu et al. proposed Graph Transformation Matching (GTM) algorithm to remove outliers which has some difficulties when the mismatched points surrounded by the same local neighbor structure. In this study to overcome these limitations, which mentioned above, a new three step matching scheme is presented where the SIFT algorithm is used to obtain initial corresponding point sets. In the second step, in order to reduce the outliers, RANSAC algorithm is applied. Finally, to remove the remained mismatches, based on the adjacent K-NN graph, the GTM is implemented. Four different close range image datasets with changes in viewpoint are utilized to evaluate the performance of the proposed method and the experimental results indicate its robustness and capability.

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

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

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

Veridical and False Pictorial Memory in Individuals with and without Mental Retardation

ERIC Educational Resources Information Center

Carlin, Michael T.; Toglia, Michael P.; Wakeford, Yvonne; Jakway, Allison; Sullivan, Kate; Hasel, Lisa

2008-01-01

Veridical and false pictorial recognition were assessed in individuals with mental retardation; groups were matched for MA and CA. Pictures were viewed in either a generative or static format at acquisition. The individuals with mental retardation and those in the MA-matched group had higher rates of false memories for critical items and lower hit…

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

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

The correct estimate of the probability of false detection of the matched filter in weak-signal detection problems

NASA Astrophysics Data System (ADS)

Vio, R.; Andreani, P.

2016-05-01

The reliable detection of weak signals is a critical issue in many astronomical contexts and may have severe consequences for determining number counts and luminosity functions, but also for optimizing the use of telescope time in follow-up observations. Because of its optimal properties, one of the most popular and widely-used detection technique is the matched filter (MF). This is a linear filter designed to maximise the detectability of a signal of known structure that is buried in additive Gaussian random noise. In this work we show that in the very common situation where the number and position of the searched signals within a data sequence (e.g. an emission line in a spectrum) or an image (e.g. a point-source in an interferometric map) are unknown, this technique, when applied in its standard form, may severely underestimate the probability of false detection. This is because the correct use of the MF relies upon a priori knowledge of the position of the signal of interest. In the absence of this information, the statistical significance of features that are actually noise is overestimated and detections claimed that are actually spurious. For this reason, we present an alternative method of computing the probability of false detection that is based on the probability density function (PDF) of the peaks of a random field. It is able to provide a correct estimate of the probability of false detection for the one-, two- and three-dimensional case. We apply this technique to a real two-dimensional interferometric map obtained with ALMA.

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.

Computer-aided diagnosis of cavernous malformations in brain MR images.

PubMed

Wang, Huiquan; Ahmed, S Nizam; Mandal, Mrinal

2018-06-01

Cavernous malformation or cavernoma is one of the most common epileptogenic lesions. It is a type of brain vessel abnormality that can cause serious symptoms such as seizures, intracerebral hemorrhage, and various neurological disorders. Manual detection of cavernomas by physicians in a large set of brain MRI slices is a time-consuming and labor-intensive task and often delays diagnosis. In this paper, we propose a computer-aided diagnosis (CAD) system for cavernomas based on T2-weighted axial plane MRI image analysis. The proposed technique first extracts the brain area based on atlas registration and active contour model, and then performs template matching to obtain candidate cavernoma regions. Texture, the histogram of oriented gradients and local binary pattern features of each candidate region are calculated, and principal component analysis is applied to reduce the feature dimensionality. Support vector machines (SVMs) are finally used to classify each region into cavernoma or non-cavernoma so that most of the false positives (obtained by template matching) are eliminated. The performance of the proposed CAD system is evaluated and experimental results show that it provides superior performance in cavernoma detection compared to existing techniques. Copyright © 2018 Elsevier Ltd. All rights reserved.

Improved initial guess with semi-subpixel level accuracy in digital image correlation by feature-based method

NASA Astrophysics Data System (ADS)

Zhang, Yunlu; Yan, Lei; Liou, Frank

2018-05-01

The quality initial guess of deformation parameters in digital image correlation (DIC) has a serious impact on convergence, robustness, and efficiency of the following subpixel level searching stage. In this work, an improved feature-based initial guess (FB-IG) scheme is presented to provide initial guess for points of interest (POIs) inside a large region. Oriented FAST and Rotated BRIEF (ORB) features are semi-uniformly extracted from the region of interest (ROI) and matched to provide initial deformation information. False matched pairs are eliminated by the novel feature guided Gaussian mixture model (FG-GMM) point set registration algorithm, and nonuniform deformation parameters of the versatile reproducing kernel Hilbert space (RKHS) function are calculated simultaneously. Validations on simulated images and real-world mini tensile test verify that this scheme can robustly and accurately compute initial guesses with semi-subpixel level accuracy in cases with small or large translation, deformation, or rotation.

A two-step database search method improves sensitivity in peptide sequence matches for metaproteomics and proteogenomics studies.

PubMed

Jagtap, Pratik; Goslinga, Jill; Kooren, Joel A; McGowan, Thomas; Wroblewski, Matthew S; Seymour, Sean L; Griffin, Timothy J

2013-04-01

Large databases (>10(6) sequences) used in metaproteomic and proteogenomic studies present challenges in matching peptide sequences to MS/MS data using database-search programs. Most notably, strict filtering to avoid false-positive matches leads to more false negatives, thus constraining the number of peptide matches. To address this challenge, we developed a two-step method wherein matches derived from a primary search against a large database were used to create a smaller subset database. The second search was performed against a target-decoy version of this subset database merged with a host database. High confidence peptide sequence matches were then used to infer protein identities. Applying our two-step method for both metaproteomic and proteogenomic analysis resulted in twice the number of high confidence peptide sequence matches in each case, as compared to the conventional one-step method. The two-step method captured almost all of the same peptides matched by the one-step method, with a majority of the additional matches being false negatives from the one-step method. Furthermore, the two-step method improved results regardless of the database search program used. Our results show that our two-step method maximizes the peptide matching sensitivity for applications requiring large databases, especially valuable for proteogenomics and metaproteomics studies. © 2013 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

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.

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.

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

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

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

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…

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

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.

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.

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…

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

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

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

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

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

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

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

Selecting foils for identification lineups: matching suspects or descriptions?

PubMed

Tunnicliff, J L; Clark, S E

2000-04-01

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

Fired Cartridge Case Identification Using Optical Images and the Congruent Matching Cells (CMC) Method

PubMed Central

Tong, Mingsi; Song, John; Chu, Wei; Thompson, Robert M

2014-01-01

The Congruent Matching Cells (CMC) method for ballistics identification was invented at the National Institute of Standards and Technology (NIST). The CMC method is based on the correlation of pairs of small correlation cells instead of the correlation of entire images. Four identification parameters – TCCF, Tθ, Tx and Ty are proposed for identifying correlated cell pairs originating from the same firearm. The correlation conclusion (matching or non-matching) is determined by whether the number of CMC is ≥ 6. This method has been previously validated using a set of 780 pair-wise 3D topography images. However, most ballistic images stored in current local and national databases are in an optical intensity (grayscale) format. As a result, the reliability of applying the CMC method on optical intensity images is an important issue. In this paper, optical intensity images of breech face impressions captured on the same set of 40 cartridge cases are correlated and analyzed for the validation test of CMC method using optical images. This includes correlations of 63 pairs of matching images and 717 pairs of non-matching images under top ring lighting. Tests of the method do not produce any false identification (false positive) or false exclusion (false negative) results, which support the CMC method and the proposed identification criterion, C = 6, for firearm breech face identifications using optical intensity images. PMID:26601045

Fired Cartridge Case Identification Using Optical Images and the Congruent Matching Cells (CMC) Method.

PubMed

Tong, Mingsi; Song, John; Chu, Wei; Thompson, Robert M

2014-01-01

The Congruent Matching Cells (CMC) method for ballistics identification was invented at the National Institute of Standards and Technology (NIST). The CMC method is based on the correlation of pairs of small correlation cells instead of the correlation of entire images. Four identification parameters - T CCF, T θ, T x and T y are proposed for identifying correlated cell pairs originating from the same firearm. The correlation conclusion (matching or non-matching) is determined by whether the number of CMC is ≥ 6. This method has been previously validated using a set of 780 pair-wise 3D topography images. However, most ballistic images stored in current local and national databases are in an optical intensity (grayscale) format. As a result, the reliability of applying the CMC method on optical intensity images is an important issue. In this paper, optical intensity images of breech face impressions captured on the same set of 40 cartridge cases are correlated and analyzed for the validation test of CMC method using optical images. This includes correlations of 63 pairs of matching images and 717 pairs of non-matching images under top ring lighting. Tests of the method do not produce any false identification (false positive) or false exclusion (false negative) results, which support the CMC method and the proposed identification criterion, C = 6, for firearm breech face identifications using optical intensity images.

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

A citizen science approach to optimising computer aided detection (CAD) in mammography

NASA Astrophysics Data System (ADS)

Ionescu, Georgia V.; Harkness, Elaine F.; Hulleman, Johan; Astley, Susan M.

2018-03-01

Computer aided detection (CAD) systems assist medical experts during image interpretation. In mammography, CAD systems prompt suspicious regions which help medical experts to detect early signs of cancer. This is a challenging task and prompts may appear in regions that are actually normal, whilst genuine cancers may be missed. The effect prompting has on readers performance is not fully known. In order to explore the effects of prompting errors, we have created an online game (Bat Hunt), designed for non-experts, that mirrors mammographic CAD. This allows us to explore a wider parameter space. Users are required to detect bats in images of flocks of birds, with image difficulty matched to the proportions of screening mammograms in different BI-RADS density categories. Twelve prompted conditions were investigated, along with unprompted detection. On average, players achieved a sensitivity of 0.33 for unprompted detection, and sensitivities of 0.75, 0.83, and 0.92 respectively for 70%, 80%, and 90% of targets prompted, regardless of CAD specificity. False prompts distract players from finding unprompted targets if they appear in the same image. Player performance decreases when the number of false prompts increases, and increases proportionally with prompting sensitivity. Median lowest d' was for unprompted condition (1.08) and the highest for sensitivity 90% and 0.5 false prompts per image (d'=4.48).

12 CFR 1805.500 - Matching funds-general.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 12 Banks and Banking 7 2010-01-01 2010-01-01 false Matching funds-general. 1805.500 Section 1805.500 Banks and Banking COMMUNITY DEVELOPMENT FINANCIAL INSTITUTIONS FUND, DEPARTMENT OF THE TREASURY COMMUNITY DEVELOPMENT FINANCIAL INSTITUTIONS PROGRAM Matching Funds Requirements § 1805.500 Matching funds...

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

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

Biased lineup instructions and face identification from video images.

PubMed

Thompson, W Burt; Johnson, Jaime

2008-01-01

Previous eyewitness memory research has shown that biased lineup instructions reduce identification accuracy, primarily by increasing false-positive identifications in target-absent lineups. Because some attempts at identification do not rely on a witness's memory of the perpetrator but instead involve matching photos to images on surveillance video, the authors investigated the effects of biased instructions on identification accuracy in a matching task. In Experiment 1, biased instructions did not affect the overall accuracy of participants who used video images as an identification aid, but nearly all correct decisions occurred with target-present photo spreads. Both biased and unbiased instructions resulted in high false-positive rates. In Experiment 2, which focused on video-photo matching accuracy with target-absent photo spreads, unbiased instructions led to more correct responses (i.e., fewer false positives). These findings suggest that investigators should not relax precautions against biased instructions when people attempt to match photos to an unfamiliar person recorded on video.

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

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

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

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

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

Testing the domain-specificity of a theory of mind deficit in brain-injured patients: evidence for consistent performance on non-verbal, "reality-unknown" false belief and false photograph tasks.

PubMed

Apperly, Ian A; Samson, Dana; Chiavarino, Claudia; Bickerton, Wai-Ling; Humphreys, Glyn W

2007-05-01

To test the domain-specificity of "theory of mind" abilities we compared the performance of a case-series of 11 brain-lesioned patients on a recently developed test of false belief reasoning () and on a matched false photograph task, which did not require belief reasoning and which addressed problems with existing false photograph methods. A strikingly similar pattern of performance was shown across the false belief and false photograph tests. Patients who were selectively impaired on false belief tasks were also impaired on false photograph tasks; patients spared on false belief tasks also showed preserved performance with false photographs. In some cases the impairment on false belief and false photograph tasks coincided with good performance on control tasks matched for executive demands. We discuss whether the patients have a domain-specific deficit in reasoning about representations common to both false belief and false photograph tasks.

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.

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

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

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

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

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

26 CFR 1.401(m)-1 - Employee contributions and matching contributions.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 26 Internal Revenue 5 2010-04-01 2010-04-01 false Employee contributions and matching.... § 1.401(m)-1 Employee contributions and matching contributions. (a) General nondiscrimination rules—(1... not satisfy section 401(a) for a plan year unless the amount of employee contributions and matching...

12 CFR 1805.503 - Time frame for raising match.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 12 Banks and Banking 7 2010-01-01 2010-01-01 false Time frame for raising match. 1805.503 Section 1805.503 Banks and Banking COMMUNITY DEVELOPMENT FINANCIAL INSTITUTIONS FUND, DEPARTMENT OF THE... frame for raising match. Applicants shall satisfy matching funds requirements within the period set...

44 CFR 361.4 - Matching contributions.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 44 Emergency Management and Assistance 1 2010-10-01 2010-10-01 false Matching contributions. 361.4 Section 361.4 Emergency Management and Assistance FEDERAL EMERGENCY MANAGEMENT AGENCY, DEPARTMENT OF... to match the Federal funds on a 50 percent cash match basis. (b) States which did not receive a grant...

11 CFR 9033.4 - Matching payment eligibility threshold requirements.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 11 Federal Elections 1 2014-01-01 2014-01-01 false Matching payment eligibility threshold requirements. 9033.4 Section 9033.4 Federal Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: PRESIDENTIAL PRIMARY MATCHING FUND ELIGIBILITY FOR PAYMENTS § 9033.4 Matching payment eligibility threshold requirements. (a) The...

11 CFR 9033.4 - Matching payment eligibility threshold requirements.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 11 Federal Elections 1 2010-01-01 2010-01-01 false Matching payment eligibility threshold requirements. 9033.4 Section 9033.4 Federal Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: PRESIDENTIAL PRIMARY MATCHING FUND ELIGIBILITY FOR PAYMENTS § 9033.4 Matching payment eligibility threshold requirements. (a) The...

11 CFR 9033.4 - Matching payment eligibility threshold requirements.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 11 Federal Elections 1 2011-01-01 2011-01-01 false Matching payment eligibility threshold requirements. 9033.4 Section 9033.4 Federal Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: PRESIDENTIAL PRIMARY MATCHING FUND ELIGIBILITY FOR PAYMENTS § 9033.4 Matching payment eligibility threshold requirements. (a) The...

11 CFR 9033.4 - Matching payment eligibility threshold requirements.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 11 Federal Elections 1 2012-01-01 2012-01-01 false Matching payment eligibility threshold requirements. 9033.4 Section 9033.4 Federal Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: PRESIDENTIAL PRIMARY MATCHING FUND ELIGIBILITY FOR PAYMENTS § 9033.4 Matching payment eligibility threshold requirements. (a) The...

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

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.

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

Nonrigid synthetic aperture radar and optical image coregistration by combining local rigid transformations using a Kohonen network.

PubMed

Salehpour, Mehdi; Behrad, Alireza

2017-10-01

This study proposes a new algorithm for nonrigid coregistration of synthetic aperture radar (SAR) and optical images. The proposed algorithm employs point features extracted by the binary robust invariant scalable keypoints algorithm and a new method called weighted bidirectional matching for initial correspondence. To refine false matches, we assume that the transformation between SAR and optical images is locally rigid. This property is used to refine false matches by assigning scores to matched pairs and clustering local rigid transformations using a two-layer Kohonen network. Finally, the thin plate spline algorithm and mutual information are used for nonrigid coregistration of SAR and optical images.

50 CFR 401.11 - Property as matching funds.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 50 Wildlife and Fisheries 9 2011-10-01 2011-10-01 false Property as matching funds. 401.11 Section... FISHERIES CONSERVATION, DEVELOPMENT AND ENHANCEMENT § 401.11 Property as matching funds. The non-Federal... used by grantees in placing the value on real or personal property for matching funds are set forth in...

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.

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.

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.

7 CFR 1703.122 - Matching contributions.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 11 2010-01-01 2010-01-01 false Matching contributions. 1703.122 Section 1703.122 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE RURAL DEVELOPMENT Distance Learning and Telemedicine Grant Program § 1703.122 Matching...

7 CFR 1703.122 - Matching contributions.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 7 Agriculture 11 2014-01-01 2014-01-01 false Matching contributions. 1703.122 Section 1703.122 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE RURAL DEVELOPMENT Distance Learning and Telemedicine Grant Program § 1703.122 Matching...

7 CFR 1703.122 - Matching contributions.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 7 Agriculture 11 2013-01-01 2013-01-01 false Matching contributions. 1703.122 Section 1703.122 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE RURAL DEVELOPMENT Distance Learning and Telemedicine Grant Program § 1703.122 Matching...

7 CFR 1703.122 - Matching contributions.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 7 Agriculture 11 2012-01-01 2012-01-01 false Matching contributions. 1703.122 Section 1703.122 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE RURAL DEVELOPMENT Distance Learning and Telemedicine Grant Program § 1703.122 Matching...

Applying Tandem Mass Spectral Libraries for Solving the Critical Assessment of Small Molecule Identification (CASMI) LC/MS Challenge 2012

PubMed Central

Oberacher, Herbert

2013-01-01

The “Critical Assessment of Small Molecule Identification” (CASMI) contest was aimed in testing strategies for small molecule identification that are currently available in the experimental and computational mass spectrometry community. We have applied tandem mass spectral library search to solve Category 2 of the CASMI Challenge 2012 (best identification for high resolution LC/MS data). More than 230,000 tandem mass spectra part of four well established libraries (MassBank, the collection of tandem mass spectra of the “NIST/NIH/EPA Mass Spectral Library 2012”, METLIN, and the ‘Wiley Registry of Tandem Mass Spectral Data, MSforID’) were searched. The sample spectra acquired in positive ion mode were processed. Seven out of 12 challenges did not produce putative positive matches, simply because reference spectra were not available for the compounds searched. This suggests that to some extent the limited coverage of chemical space with high-quality reference spectra is still a problem encountered in tandem mass spectral library search. Solutions were submitted for five challenges. Three compounds were correctly identified (kanamycin A, benzyldiphenylphosphine oxide, and 1-isopropyl-5-methyl-1H-indole-2,3-dione). In the absence of any reference spectrum, a false positive identification was obtained for 1-aminoanthraquinone by matching the corresponding sample spectrum to the structurally related compounds N-phenylphthalimide and 2-aminoanthraquinone. Another false positive result was submitted for 1H-benz[g]indole; for the 1H-benz[g]indole-specific sample spectra provided, carbazole was listed as the best matching compound. In this case, the quality of the available 1H-benz[g]indole-specific reference spectra was found to hamper unequivocal identification. PMID:24957994

Discovering functional interdependence relationship in PPI networks for protein complex identification.

PubMed

Lam, Winnie W M; Chan, Keith C C

2012-04-01

Protein molecules interact with each other in protein complexes to perform many vital functions, and different computational techniques have been developed to identify protein complexes in protein-protein interaction (PPI) networks. These techniques are developed to search for subgraphs of high connectivity in PPI networks under the assumption that the proteins in a protein complex are highly interconnected. While these techniques have been shown to be quite effective, it is also possible that the matching rate between the protein complexes they discover and those that are previously determined experimentally be relatively low and the "false-alarm" rate can be relatively high. This is especially the case when the assumption of proteins in protein complexes being more highly interconnected be relatively invalid. To increase the matching rate and reduce the false-alarm rate, we have developed a technique that can work effectively without having to make this assumption. The name of the technique called protein complex identification by discovering functional interdependence (PCIFI) searches for protein complexes in PPI networks by taking into consideration both the functional interdependence relationship between protein molecules and the network topology of the network. The PCIFI works in several steps. The first step is to construct a multiple-function protein network graph by labeling each vertex with one or more of the molecular functions it performs. The second step is to filter out protein interactions between protein pairs that are not functionally interdependent of each other in the statistical sense. The third step is to make use of an information-theoretic measure to determine the strength of the functional interdependence between all remaining interacting protein pairs. Finally, the last step is to try to form protein complexes based on the measure of the strength of functional interdependence and the connectivity between proteins. For performance evaluation, PCIFI was used to identify protein complexes in real PPI network data and the protein complexes it found were matched against those that were previously known in MIPS. The results show that PCIFI can be an effective technique for the identification of protein complexes. The protein complexes it found can match more known protein complexes with a smaller false-alarm rate and can provide useful insights into the understanding of the functional interdependence relationships between proteins in protein complexes.

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.

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

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

7 CFR 3419.2 - Matching funds.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 15 2010-01-01 2010-01-01 false Matching funds. 3419.2 Section 3419.2 Agriculture... SERVICE, DEPARTMENT OF AGRICULTURE MATCHING FUNDS REQUIREMENT FOR AGRICULTURAL RESEARCH AND EXTENSION FORMULA FUNDS AT 1890 LAND-GRANT INSTITUTIONS, INCLUDING TUSKEGEE UNIVERSITY, AND AT 1862 LAND-GRANT...

A comment on the PCAST report: Skip the "match"/"non-match" stage.

PubMed

Morrison, Geoffrey Stewart; Kaye, David H; Balding, David J; Taylor, Duncan; Dawid, Philip; Aitken, Colin G G; Gittelson, Simone; Zadora, Grzegorz; Robertson, Bernard; Willis, Sheila; Pope, Susan; Neil, Martin; Martire, Kristy A; Hepler, Amanda; Gill, Richard D; Jamieson, Allan; de Zoete, Jacob; Ostrum, R Brent; Caliebe, Amke

2017-03-01

This letter comments on the report "Forensic science in criminal courts: Ensuring scientific validity of feature-comparison methods" recently released by the President's Council of Advisors on Science and Technology (PCAST). The report advocates a procedure for evaluation of forensic evidence that is a two-stage procedure in which the first stage is "match"/"non-match" and the second stage is empirical assessment of sensitivity (correct acceptance) and false alarm (false acceptance) rates. Almost always, quantitative data from feature-comparison methods are continuously-valued and have within-source variability. We explain why a two-stage procedure is not appropriate for this type of data, and recommend use of statistical procedures which are appropriate. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.

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.

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.

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.

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

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

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

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

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

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

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

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

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

Coregistration refinement of hyperspectral images and DSM: An object-based approach using spectral information

NASA Astrophysics Data System (ADS)

Avbelj, Janja; Iwaszczuk, Dorota; Müller, Rupert; Reinartz, Peter; Stilla, Uwe

2015-02-01

For image fusion in remote sensing applications the georeferencing accuracy using position, attitude, and camera calibration measurements can be insufficient. Thus, image processing techniques should be employed for precise coregistration of images. In this article a method for multimodal object-based image coregistration refinement between hyperspectral images (HSI) and digital surface models (DSM) is presented. The method is divided in three parts: object outline detection in HSI and DSM, matching, and determination of transformation parameters. The novelty of our proposed coregistration refinement method is the use of material properties and height information of urban objects from HSI and DSM, respectively. We refer to urban objects as objects which are typical in urban environments and focus on buildings by describing them with 2D outlines. Furthermore, the geometric accuracy of these detected building outlines is taken into account in the matching step and for the determination of transformation parameters. Hence, a stochastic model is introduced to compute optimal transformation parameters. The feasibility of the method is shown by testing it on two aerial HSI of different spatial and spectral resolution, and two DSM of different spatial resolution. The evaluation is carried out by comparing the accuracies of the transformations parameters to the reference parameters, determined by considering object outlines at much higher resolution, and also by computing the correctness and the quality rate of the extracted outlines before and after coregistration refinement. Results indicate that using outlines of objects instead of only line segments is advantageous for coregistration of HSI and DSM. The extraction of building outlines in comparison to the line cue extraction provides a larger amount of assigned lines between the images and is more robust to outliers, i.e. false matches.

20 CFR 645.315 - What actions are to be taken if a State fails to make the required matching expenditures?

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false What actions are to be taken if a State fails to make the required matching expenditures? 645.315 Section 645.315 Employees' Benefits EMPLOYMENT... State fails to make the required matching expenditures? (a) If State match expenditures do not satisfy...

20 CFR 645.315 - What actions are to be taken if a State fails to make the required matching expenditures?

Code of Federal Regulations, 2011 CFR

2011-04-01

... 20 Employees' Benefits 3 2011-04-01 2011-04-01 false What actions are to be taken if a State fails to make the required matching expenditures? 645.315 Section 645.315 Employees' Benefits EMPLOYMENT... State fails to make the required matching expenditures? (a) If State match expenditures do not satisfy...

20 CFR 645.315 - What actions are to be taken if a State fails to make the required matching expenditures?

Code of Federal Regulations, 2013 CFR

2013-04-01

... 20 Employees' Benefits 3 2013-04-01 2013-04-01 false What actions are to be taken if a State fails to make the required matching expenditures? 645.315 Section 645.315 Employees' Benefits EMPLOYMENT... State fails to make the required matching expenditures? (a) If State match expenditures do not satisfy...

20 CFR 645.315 - What actions are to be taken if a State fails to make the required matching expenditures?

Code of Federal Regulations, 2014 CFR

2014-04-01

... 20 Employees' Benefits 3 2014-04-01 2014-04-01 false What actions are to be taken if a State fails to make the required matching expenditures? 645.315 Section 645.315 Employees' Benefits EMPLOYMENT... State fails to make the required matching expenditures? (a) If State match expenditures do not satisfy...

45 CFR 2517.700 - Are matching funds required?

Code of Federal Regulations, 2010 CFR

2010-10-01

... 45 Public Welfare 4 2010-10-01 2010-10-01 false Are matching funds required? 2517.700 Section 2517.700 Public Welfare Regulations Relating to Public Welfare (Continued) CORPORATION FOR NATIONAL AND COMMUNITY SERVICE COMMUNITY-BASED SERVICE-LEARNING PROGRAMS Funding Requirements § 2517.700 Are matching...

45 CFR 2517.700 - Are matching funds required?

Code of Federal Regulations, 2011 CFR

2011-10-01

... 45 Public Welfare 4 2011-10-01 2011-10-01 false Are matching funds required? 2517.700 Section 2517.700 Public Welfare Regulations Relating to Public Welfare (Continued) CORPORATION FOR NATIONAL AND COMMUNITY SERVICE COMMUNITY-BASED SERVICE-LEARNING PROGRAMS Funding Requirements § 2517.700 Are matching...

7 CFR 3419.2 - Matching funds.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 7 Agriculture 15 2011-01-01 2011-01-01 false Matching funds. 3419.2 Section 3419.2 Agriculture... FUNDS REQUIREMENT FOR AGRICULTURAL RESEARCH AND EXTENSION FORMULA FUNDS AT 1890 LAND-GRANT INSTITUTIONS, INCLUDING TUSKEGEE UNIVERSITY, AND AT 1862 LAND-GRANT INSTITUTIONS IN INSULAR AREAS § 3419.2 Matching funds...

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.

A novel spectral library workflow to enhance protein identifications.

PubMed

Li, Haomin; Zong, Nobel C; Liang, Xiangbo; Kim, Allen K; Choi, Jeong Ho; Deng, Ning; Zelaya, Ivette; Lam, Maggie; Duan, Huilong; Ping, Peipei

2013-04-09

The innovations in mass spectrometry-based investigations in proteome biology enable systematic characterization of molecular details in pathophysiological phenotypes. However, the process of delineating large-scale raw proteomic datasets into a biological context requires high-throughput data acquisition and processing. A spectral library search engine makes use of previously annotated experimental spectra as references for subsequent spectral analyses. This workflow delivers many advantages, including elevated analytical efficiency and specificity as well as reduced demands in computational capacity. In this study, we created a spectral matching engine to address challenges commonly associated with a library search workflow. Particularly, an improved sliding dot product algorithm, that is robust to systematic drifts of mass measurement in spectra, is introduced. Furthermore, a noise management protocol distinguishes spectra correlation attributed from noise and peptide fragments. It enables elevated separation between target spectral matches and false matches, thereby suppressing the possibility of propagating inaccurate peptide annotations from library spectra to query spectra. Moreover, preservation of original spectra also accommodates user contributions to further enhance the quality of the library. Collectively, this search engine supports reproducible data analyses using curated references, thereby broadening the accessibility of proteomics resources to biomedical investigators. This article is part of a Special Issue entitled: From protein structures to clinical applications. Copyright © 2013 Elsevier B.V. All rights reserved.

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.

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.

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

10 CFR 420.34 - Matching contributions or cost-sharing.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 10 Energy 3 2013-01-01 2013-01-01 false Matching contributions or cost-sharing. 420.34 Section 420.34 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION STATE ENERGY PROGRAM Implementation of Special Projects Financial Assistance § 420.34 Matching contributions or cost-sharing. DOE may require (as set...

10 CFR 420.34 - Matching contributions or cost-sharing.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 10 Energy 3 2011-01-01 2011-01-01 false Matching contributions or cost-sharing. 420.34 Section 420.34 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION STATE ENERGY PROGRAM Implementation of Special Projects Financial Assistance § 420.34 Matching contributions or cost-sharing. DOE may require (as set...

10 CFR 420.34 - Matching contributions or cost-sharing.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 10 Energy 3 2012-01-01 2012-01-01 false Matching contributions or cost-sharing. 420.34 Section 420.34 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION STATE ENERGY PROGRAM Implementation of Special Projects Financial Assistance § 420.34 Matching contributions or cost-sharing. DOE may require (as set...

10 CFR 420.34 - Matching contributions or cost-sharing.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 10 Energy 3 2014-01-01 2014-01-01 false Matching contributions or cost-sharing. 420.34 Section 420.34 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION STATE ENERGY PROGRAM Implementation of Special Projects Financial Assistance § 420.34 Matching contributions or cost-sharing. DOE may require (as set...

10 CFR 420.34 - Matching contributions or cost-sharing.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 10 Energy 3 2010-01-01 2010-01-01 false Matching contributions or cost-sharing. 420.34 Section 420.34 Energy DEPARTMENT OF ENERGY ENERGY CONSERVATION STATE ENERGY PROGRAM Implementation of Special Projects Financial Assistance § 420.34 Matching contributions or cost-sharing. DOE may require (as set...

45 CFR 2516.700 - What matching funds are required?

Code of Federal Regulations, 2010 CFR

2010-10-01

... 45 Public Welfare 4 2010-10-01 2010-10-01 false What matching funds are required? 2516.700 Section 2516.700 Public Welfare Regulations Relating to Public Welfare (Continued) CORPORATION FOR NATIONAL AND COMMUNITY SERVICE SCHOOL-BASED SERVICE-LEARNING PROGRAMS Funding Requirements § 2516.700 What matching funds...

45 CFR 2516.700 - What matching funds are required?

Code of Federal Regulations, 2011 CFR

2011-10-01

... 45 Public Welfare 4 2011-10-01 2011-10-01 false What matching funds are required? 2516.700 Section 2516.700 Public Welfare Regulations Relating to Public Welfare (Continued) CORPORATION FOR NATIONAL AND COMMUNITY SERVICE SCHOOL-BASED SERVICE-LEARNING PROGRAMS Funding Requirements § 2516.700 What matching funds...

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

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

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.

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

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.

Mixture-Tuned, Clutter Matched Filter for Remote Detection of Subpixel Spectral Signals

NASA Technical Reports Server (NTRS)

Thompson, David R.; Mandrake, Lukas; Green, Robert O.

2013-01-01

Mapping localized spectral features in large images demands sensitive and robust detection algorithms. Two aspects of large images that can harm matched-filter detection performance are addressed simultaneously. First, multimodal backgrounds may thwart the typical Gaussian model. Second, outlier features can trigger false detections from large projections onto the target vector. Two state-of-the-art approaches are combined that independently address outlier false positives and multimodal backgrounds. The background clustering models multimodal backgrounds, and the mixture tuned matched filter (MT-MF) addresses outliers. Combining the two methods captures significant additional performance benefits. The resulting mixture tuned clutter matched filter (MT-CMF) shows effective performance on simulated and airborne datasets. The classical MNF transform was applied, followed by k-means clustering. Then, each cluster s mean, covariance, and the corresponding eigenvalues were estimated. This yields a cluster-specific matched filter estimate as well as a cluster- specific feasibility score to flag outlier false positives. The technology described is a proof of concept that may be employed in future target detection and mapping applications for remote imaging spectrometers. It is of most direct relevance to JPL proposals for airborne and orbital hyperspectral instruments. Applications include subpixel target detection in hyperspectral scenes for military surveillance. Earth science applications include mineralogical mapping, species discrimination for ecosystem health monitoring, and land use classification.

Doubling down on phosphorylation as a variable peptide modification.

PubMed

Cooper, Bret

2016-09-01

Some mass spectrometrists believe that searching for variable PTMs like phosphorylation of serine or threonine when using database-search algorithms to interpret peptide tandem mass spectra will increase false-positive matching. The basis for this is the premise that the algorithm compares a spectrum to both a nonphosphorylated peptide candidate and a phosphorylated candidate, which is double the number of candidates compared to a search with no possible phosphorylation. Hence, if the search space doubles, false-positive matching could increase accordingly as the algorithm considers more candidates to which false matches could be made. In this study, it is shown that the search for variable phosphoserine and phosphothreonine modifications does not always double the search space or unduly impinge upon the FDR. A breakdown of how one popular database-search algorithm deals with variable phosphorylation is presented. Published 2016. This article is a U.S. Government work and is in the public domain in the USA.

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

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

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

45 CFR 264.82 - What expenditures qualify for meeting the Matching Grant FAG amount requirement?

Code of Federal Regulations, 2010 CFR

2010-10-01

... 45 Public Welfare 2 2010-10-01 2010-10-01 false What expenditures qualify for meeting the Matching..., DEPARTMENT OF HEALTH AND HUMAN SERVICES OTHER ACCOUNTABILITY PROVISIONS What Rules Pertain Specifically to the Spending Levels of the Territories? § 264.82 What expenditures qualify for meeting the Matching...

45 CFR 264.82 - What expenditures qualify for meeting the Matching Grant FAG amount requirement?

Code of Federal Regulations, 2011 CFR

2011-10-01

... 45 Public Welfare 2 2011-10-01 2011-10-01 false What expenditures qualify for meeting the Matching..., DEPARTMENT OF HEALTH AND HUMAN SERVICES OTHER ACCOUNTABILITY PROVISIONS What Rules Pertain Specifically to the Spending Levels of the Territories? § 264.82 What expenditures qualify for meeting the Matching...

45 CFR 264.82 - What expenditures qualify for meeting the Matching Grant FAG amount requirement?

Code of Federal Regulations, 2012 CFR

2012-10-01

... 45 Public Welfare 2 2012-10-01 2012-10-01 false What expenditures qualify for meeting the Matching..., DEPARTMENT OF HEALTH AND HUMAN SERVICES OTHER ACCOUNTABILITY PROVISIONS What Rules Pertain Specifically to the Spending Levels of the Territories? § 264.82 What expenditures qualify for meeting the Matching...

45 CFR 98.63 - Allotments from the Matching Fund.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 45 Public Welfare 1 2013-10-01 2013-10-01 false Allotments from the Matching Fund. 98.63 Section 98.63 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION CHILD CARE AND DEVELOPMENT FUND Financial Management § 98.63 Allotments from the Matching Fund. (a) To each of the 50 States...

45 CFR 98.63 - Allotments from the Matching Fund.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 45 Public Welfare 1 2012-10-01 2012-10-01 false Allotments from the Matching Fund. 98.63 Section 98.63 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION CHILD CARE AND DEVELOPMENT FUND Financial Management § 98.63 Allotments from the Matching Fund. (a) To each of the 50 States...

45 CFR 98.63 - Allotments from the Matching Fund.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 45 Public Welfare 1 2010-10-01 2010-10-01 false Allotments from the Matching Fund. 98.63 Section 98.63 Public Welfare DEPARTMENT OF HEALTH AND HUMAN SERVICES GENERAL ADMINISTRATION CHILD CARE AND DEVELOPMENT FUND Financial Management § 98.63 Allotments from the Matching Fund. (a) To each of the 50 States...

34 CFR Appendix C to Part 379 - Calculating Required Matching Amount

Code of Federal Regulations, 2013 CFR

2013-07-01

... 34 Education 2 2013-07-01 2013-07-01 false Calculating Required Matching Amount C Appendix C to Part 379 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF.... C Appendix C to Part 379—Calculating Required Matching Amount 1. The method for calculating the...

34 CFR 389.40 - What are the matching requirements?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 2 2010-07-01 2010-07-01 false What are the matching requirements? 389.40 Section 389.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF SPECIAL... What Conditions Must Be Met by a Grantee? § 389.40 What are the matching requirements? A grantee must...

34 CFR 367.40 - What matching requirements apply?

Code of Federal Regulations, 2012 CFR

2012-07-01

... 34 Education 2 2012-07-01 2012-07-01 false What matching requirements apply? 367.40 Section 367.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF SPECIAL EDUCATION... WHO ARE BLIND What Conditions Must Be Met After an Award? § 367.40 What matching requirements apply...

34 CFR 367.40 - What matching requirements apply?

Code of Federal Regulations, 2013 CFR

2013-07-01

... 34 Education 2 2013-07-01 2013-07-01 false What matching requirements apply? 367.40 Section 367.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF SPECIAL EDUCATION... WHO ARE BLIND What Conditions Must Be Met After an Award? § 367.40 What matching requirements apply...

False-belief understanding in 2.5-year-olds: Evidence from two novel verbal spontaneous-response tasks

PubMed Central

Scott, Rose M.; He, Zijing; Baillargeon, Renée; Cummins, Denise

2011-01-01

Recent research indicates that toddlers and infants succeed at various non-verbal spontaneous-response false-belief tasks; here we asked whether toddlers would also succeed at verbal spontaneous-response false-belief tasks that imposed significant linguistic demands. 2.5-year-olds were tested using two novel tasks: a preferential-looking task in which children listened to a false-belief story while looking at a picture book (with matching and non-matching pictures), and a violation-of-expectation task in which children watched an adult “Subject” answer (correctly or incorrectly) a standard false-belief question. Positive results were obtained with both tasks, despite their linguistic demands. These results (1) support the distinction between spontaneous-and elicited-response tasks by showing that toddlers succeed at verbal false-belief tasks that do not require them to answer direct questions about agents’ false beliefs, (2) reinforce claims of robust continuity in early false-belief understanding as assessed by spontaneous-response tasks, and (3) provide researchers with new experimental tasks for exploring early false-belief understanding in neurotypical and autistic populations. PMID:22356174

False-belief understanding in 2.5-year-olds: evidence from two novel verbal spontaneous-response tasks.

PubMed

Scott, Rose M; He, Zijing; Baillargeon, Renée; Cummins, Denise

2012-03-01

Recent research indicates that toddlers and infants succeed at various non-verbal spontaneous-response false-belief tasks; here we asked whether toddlers would also succeed at verbal spontaneous-response false-belief tasks that imposed significant linguistic demands. We tested 2.5-year-olds using two novel tasks: a preferential-looking task in which children listened to a false-belief story while looking at a picture book (with matching and non-matching pictures), and a violation-of-expectation task in which children watched an adult 'Subject' answer (correctly or incorrectly) a standard false-belief question. Positive results were obtained with both tasks, despite their linguistic demands. These results (1) support the distinction between spontaneous- and elicited-response tasks by showing that toddlers succeed at verbal false-belief tasks that do not require them to answer direct questions about agents' false beliefs, (2) reinforce claims of robust continuity in early false-belief understanding as assessed by spontaneous-response tasks, and (3) provide researchers with new experimental tasks for exploring early false-belief understanding in neurotypical and autistic populations. © 2011 Blackwell Publishing Ltd.

A Non-parametric Cutout Index for Robust Evaluation of Identified Proteins*

PubMed Central

Serang, Oliver; Paulo, Joao; Steen, Hanno; Steen, Judith A.

2013-01-01

This paper proposes a novel, automated method for evaluating sets of proteins identified using mass spectrometry. The remaining peptide-spectrum match score distributions of protein sets are compared to an empirical absent peptide-spectrum match score distribution, and a Bayesian non-parametric method reminiscent of the Dirichlet process is presented to accurately perform this comparison. Thus, for a given protein set, the process computes the likelihood that the proteins identified are correctly identified. First, the method is used to evaluate protein sets chosen using different protein-level false discovery rate (FDR) thresholds, assigning each protein set a likelihood. The protein set assigned the highest likelihood is used to choose a non-arbitrary protein-level FDR threshold. Because the method can be used to evaluate any protein identification strategy (and is not limited to mere comparisons of different FDR thresholds), we subsequently use the method to compare and evaluate multiple simple methods for merging peptide evidence over replicate experiments. The general statistical approach can be applied to other types of data (e.g. RNA sequencing) and generalizes to multivariate problems. PMID:23292186

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)

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…

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

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

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

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

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

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

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

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

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

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

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.

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.

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

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

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

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.

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…

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…

Crescendo: A Protein Sequence Database Search Engine for Tandem Mass Spectra.

PubMed

Wang, Jianqi; Zhang, Yajie; Yu, Yonghao

2015-07-01

A search engine that discovers more peptides reliably is essential to the progress of the computational proteomics. We propose two new scoring functions (L- and P-scores), which aim to capture similar characteristics of a peptide-spectrum match (PSM) as Sequest and Comet do. Crescendo, introduced here, is a software program that implements these two scores for peptide identification. We applied Crescendo to test datasets and compared its performance with widely used search engines, including Mascot, Sequest, and Comet. The results indicate that Crescendo identifies a similar or larger number of peptides at various predefined false discovery rates (FDR). Importantly, it also provides a better separation between the true and decoy PSMs, warranting the future development of a companion post-processing filtering algorithm.

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

Code of Federal Regulations, 2010 CFR

2010-07-01

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

46 CFR 35.30-5 - Fires, matches, and smoking-TB/ALL.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 46 Shipping 1 2013-10-01 2013-10-01 false Fires, matches, and smoking-TB/ALL. 35.30-5 Section 35... Rules § 35.30-5 Fires, matches, and smoking—TB/ALL. (a) General. In making the determinations required... reasonable safety during the loading operation. (c) Smoking. Smoking is prohibited on the weather decks of...

46 CFR 35.30-5 - Fires, matches, and smoking-TB/ALL.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 1 2014-10-01 2014-10-01 false Fires, matches, and smoking-TB/ALL. 35.30-5 Section 35... Rules § 35.30-5 Fires, matches, and smoking—TB/ALL. (a) General. In making the determinations required... reasonable safety during the loading operation. (c) Smoking. Smoking is prohibited on the weather decks of...

46 CFR 35.30-5 - Fires, matches, and smoking-TB/ALL.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 46 Shipping 1 2012-10-01 2012-10-01 false Fires, matches, and smoking-TB/ALL. 35.30-5 Section 35... Rules § 35.30-5 Fires, matches, and smoking—TB/ALL. (a) General. In making the determinations required... reasonable safety during the loading operation. (c) Smoking. Smoking is prohibited on the weather decks of...

46 CFR 35.30-5 - Fires, matches, and smoking-TB/ALL.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 1 2010-10-01 2010-10-01 false Fires, matches, and smoking-TB/ALL. 35.30-5 Section 35... Rules § 35.30-5 Fires, matches, and smoking—TB/ALL. (a) General. In making the determinations required... reasonable safety during the loading operation. (c) Smoking. Smoking is prohibited on the weather decks of...

46 CFR 35.30-5 - Fires, matches, and smoking-TB/ALL.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 1 2011-10-01 2011-10-01 false Fires, matches, and smoking-TB/ALL. 35.30-5 Section 35... Rules § 35.30-5 Fires, matches, and smoking—TB/ALL. (a) General. In making the determinations required... reasonable safety during the loading operation. (c) Smoking. Smoking is prohibited on the weather decks of...

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.

Diurnal rhythm and concordance between objective and subjective hot flashes: the Hilo Women's Health Study.

PubMed

Sievert, Lynnette L; Reza, Angela; Mills, Phoebe; Morrison, Lynn; Rahberg, Nichole; Goodloe, Amber; Sutherland, Michael; Brown, Daniel E

2010-01-01

The aims of this study were to test for a diurnal pattern in hot flashes in a multiethnic population living in a hot, humid environment and to examine the rates of concordance between objective and subjective measures of hot flashes using ambulatory and laboratory measures. Study participants aged 45 to 55 years were recruited from the general population of Hilo, HI. Women wore a Biolog hot flash monitor (UFI, Morro Bay, CA), kept a diary for 24 hours, and also participated in 3-hour laboratory measures (n = 199). Diurnal patterns were assessed using polynomial regression. For each woman, objectively recorded hot flashes that matched subjective experience were treated as true-positive readings. Subjective hot flashes were considered the standard for computing false-positive and false-negative readings. True-positive, false-positive, and false-negative readings were compared across ethnic groups by chi analyses. Frequencies of sternal, nuchal, and subjective hot flashes peaked at 1500 +/- 1 hours with no difference by ethnicity. Laboratory results supported the pattern seen in ambulatory monitoring. Sternal and nuchal monitoring showed the same frequency of true-positive measures, but nonsternal electrodes picked up more false-positive readings. Laboratory monitoring showed very low frequencies of false negatives. There were no ethnic differences in the frequency of true-positive or false-positive measures. Women of European descent were more likely to report hot flashes that were not objectively demonstrated (false-negative measures). The diurnal pattern and peak in hot flash occurrence in the hot humid environment of Hilo were similar to results from more temperate environments. Lack of variation in sternal versus nonsternal measures and in true-positive measures across ethnicities suggests no appreciable effect of population variation in sweating patterns.

Diurnal rhythm and concordance between objective and subjective hot flashes: The Hilo Women’s Health Study

PubMed Central

Sievert, Lynnette L.; Reza, Angela; Mills, Phoebe; Morrison, Lynn; Rahberg, Nichole; Goodloe, Amber; Sutherland, Michael; Brown, Daniel E.

2010-01-01

Objective To test for a diurnal pattern in hot flashes in a multi-ethnic population living in a hot, humid environment. To examine rates of concordance between objective and subjective measures of hot flashes using ambulatory and laboratory measures. Methods Study participants aged 45–55 were recruited from the general population of Hilo, Hawaii. Women wore a Biolog hot flash monitor, kept a diary for 24-hours, and also participated in 3-hour laboratory measures (n=199). Diurnal patterns were assessed using polynomial regression. For each woman, objectively recorded hot flashes that matched subjective experience were treated as true positive readings. Subjective hot flashes were considered the standard for computing false positive and false negative readings. True positive, false positive, and false negative readings were compared across ethnic groups by chi-square analyses. Results Frequencies of sternal, nuchal and subjective hot flashes peaked at 15:00 ± 1 hour with no difference by ethnicity. Laboratory results supported the pattern seen in ambulatory monitoring. Sternal and nuchal monitoring showed the same frequency of true positive measures, but non-sternal electrodes picked up more false positive readings. Laboratory monitoring showed very low frequencies of false negatives. There were no ethnic differences in the frequency of true positive or false positive measures. Women of European descent were more likely to report hot flashes that were not objectively demonstrated (false negative measures). Conclusions The diurnal pattern and peak in hot flash occurrence in the hot humid environment of Hilo was similar to results from more temperate environments. Lack of variation in sternal vs. non-sternal measures, and in true positive measures across ethnicities suggests no appreciable effect of population variation in sweating patterns. PMID:20220538

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.

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…

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.

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

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

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.

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.

Multiple template-based image matching using alpha-rooted quaternion phase correlation

NASA Astrophysics Data System (ADS)

DelMarco, Stephen

2010-04-01

In computer vision applications, image matching performed on quality-degraded imagery is difficult due to image content distortion and noise effects. State-of-the art keypoint based matchers, such as SURF and SIFT, work very well on clean imagery. However, performance can degrade significantly in the presence of high noise and clutter levels. Noise and clutter cause the formation of false features which can degrade recognition performance. To address this problem, previously we developed an extension to the classical amplitude and phase correlation forms, which provides improved robustness and tolerance to image geometric misalignments and noise. This extension, called Alpha-Rooted Phase Correlation (ARPC), combines Fourier domain-based alpha-rooting enhancement with classical phase correlation. ARPC provides tunable parameters to control the alpha-rooting enhancement. These parameter values can be optimized to tradeoff between high narrow correlation peaks, and more robust wider, but smaller peaks. Previously, we applied ARPC in the radon transform domain for logo image recognition in the presence of rotational image misalignments. In this paper, we extend ARPC to incorporate quaternion Fourier transforms, thereby creating Alpha-Rooted Quaternion Phase Correlation (ARQPC). We apply ARQPC to the logo image recognition problem. We use ARQPC to perform multiple-reference logo template matching by representing multiple same-class reference templates as quaternion-valued images. We generate recognition performance results on publicly-available logo imagery, and compare recognition results to results generated from standard approaches. We show that small deviations in reference templates of sameclass logos can lead to improved recognition performance using the joint matching inherent in ARQPC.

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

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

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

7 CFR 3430.206 - Matching requirements.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 7 Agriculture 15 2011-01-01 2011-01-01 false Matching requirements. 3430.206 Section 3430.206 Agriculture Regulations of the Department of Agriculture (Continued) NATIONAL INSTITUTE OF FOOD AND AGRICULTURE COMPETITIVE AND NONCOMPETITIVE NON-FORMULA FEDERAL ASSISTANCE PROGRAMS-GENERAL AWARD...

7 CFR 3430.906 - Matching requirements.

Code of Federal Regulations, 2010 CFR

2010-01-01

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

20 CFR 645.310 - What assurance must a State provide that it will make the required matching expenditures?

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 3 2010-04-01 2010-04-01 false What assurance must a State provide that it will make the required matching expenditures? 645.310 Section 645.310 Employees' Benefits EMPLOYMENT... provide that it will make the required matching expenditures? In its State plan, a State must provide a...

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.

The impact of human-technology cooperation and distributed cognition in forensic science: biasing effects of AFIS contextual information on human experts.

PubMed

Dror, Itiel E; Wertheim, Kasey; Fraser-Mackenzie, Peter; Walajtys, Jeff

2012-03-01

Experts play a critical role in forensic decision making, even when cognition is offloaded and distributed between human and machine. In this paper, we investigated the impact of using Automated Fingerprint Identification Systems (AFIS) on human decision makers. We provided 3680 AFIS lists (a total of 55,200 comparisons) to 23 latent fingerprint examiners as part of their normal casework. We manipulated the position of the matching print in the AFIS list. The data showed that latent fingerprint examiners were affected by the position of the matching print in terms of false exclusions and false inconclusives. Furthermore, the data showed that false identification errors were more likely at the top of the list and that such errors occurred even when the correct match was present further down the list. These effects need to be studied and considered carefully, so as to optimize human decision making when using technologies such as AFIS. © 2011 American Academy of Forensic Sciences.

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

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.

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

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.

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.

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

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.

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.

7 CFR 1740.5 - Matching funds.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 11 2010-01-01 2010-01-01 false Matching funds. 1740.5 Section 1740.5 Agriculture Regulations of the Department of Agriculture (Continued) RURAL UTILITIES SERVICE, DEPARTMENT OF AGRICULTURE PUBLIC TELEVISION STATION DIGITAL TRANSITION GRANT PROGRAM Public Television Station Digital Transition...

Suggestibility and compliance among alleged false confessors and resisters in criminal trials.

PubMed

Gudjonsson, G H

1991-04-01

This paper describes a study which compares the interrogative suggestibility and compliance scores of 20 alleged false confessors and 20 subjects who had persistently denied their involvement in the crime they were charged with in spite of forensic evidence against them (labelled 'resisters'). The two groups were 'matched' for age, sex, intelligence, memory recall capacity, and the seriousness of the offence. It was hypothesized that the resisters would score significantly lower on tests of suggestibility and compliance than the alleged false confessors. The findings were confirmed at a high level of significance. A separate analysis of 14 resisters and 72 alleged false confessors, where IQ and memory were used as covariates rather than 'matching' the two groups on the relevant variables, gave almost identical results. The clinical implications of the findings are discussed.

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

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.

Document Image Parsing and Understanding using Neuromorphic Architecture

DTIC Science & Technology

2015-03-01

processing speed at different layers. In the pattern matching layer, the computing power of multicore processors is explored to reduce the processing...developed to reduce the processing speed at different layers. In the pattern matching layer, the computing power of multicore processors is explored... cortex where the complex data is reduced to abstract representations. The abstract representation is compared to stored patterns in massively parallel

Developing Singing in Third-Grade Music Classrooms: The Effect of a Concurrent-Feedback Computer Game on Pitch-Matching Skills

ERIC Educational Resources Information Center

Paney, Andrew S.; Kay, Ann C.

2015-01-01

The purpose of this study was to measure the effect of concurrent visual feedback on pitch-matching skill development in third-grade students. Participants played a computer game, "SingingCoach," which scored the accuracy of their singing of the song "America." They followed the contour of the melody on the screen as the…

Scalable Nearest Neighbor Algorithms for High Dimensional Data.

PubMed

Muja, Marius; Lowe, David G

2014-11-01

For many computer vision and machine learning problems, large training sets are key for good performance. However, the most computationally expensive part of many computer vision and machine learning algorithms consists of finding nearest neighbor matches to high dimensional vectors that represent the training data. We propose new algorithms for approximate nearest neighbor matching and evaluate and compare them with previous algorithms. For matching high dimensional features, we find two algorithms to be the most efficient: the randomized k-d forest and a new algorithm proposed in this paper, the priority search k-means tree. We also propose a new algorithm for matching binary features by searching multiple hierarchical clustering trees and show it outperforms methods typically used in the literature. We show that the optimal nearest neighbor algorithm and its parameters depend on the data set characteristics and describe an automated configuration procedure for finding the best algorithm to search a particular data set. In order to scale to very large data sets that would otherwise not fit in the memory of a single machine, we propose a distributed nearest neighbor matching framework that can be used with any of the algorithms described in the paper. All this research has been released as an open source library called fast library for approximate nearest neighbors (FLANN), which has been incorporated into OpenCV and is now one of the most popular libraries for nearest neighbor matching.

7 CFR 3430.52 - Cost sharing and matching.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 7 Agriculture 15 2011-01-01 2011-01-01 false Cost sharing and matching. 3430.52 Section 3430.52 Agriculture Regulations of the Department of Agriculture (Continued) NATIONAL INSTITUTE OF FOOD AND AGRICULTURE COMPETITIVE AND NONCOMPETITIVE NON-FORMULA FEDERAL ASSISTANCE PROGRAMS-GENERAL AWARD...

7 CFR 3405.5 - Matching funds.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 15 2010-01-01 2010-01-01 false Matching funds. 3405.5 Section 3405.5 Agriculture Regulations of the Department of Agriculture (Continued) COOPERATIVE STATE RESEARCH, EDUCATION, AND EXTENSION SERVICE, DEPARTMENT OF AGRICULTURE HIGHER EDUCATION CHALLENGE GRANTS PROGRAM Program Description § 3405.5...

False Belief Reasoning in Adults with and without Autistic Spectrum Disorder: Similarities and Differences.

PubMed

Sommer, Monika; Döhnel, Katrin; Jarvers, Irina; Blaas, Lore; Singer, Manuela; Nöth, Victoria; Schuwerk, Tobias; Rupprecht, Rainer

2018-01-01

A central diagnostic criteria for autism spectrum disorder (ASD) is the qualitative impairment in reciprocal social interaction and a prominent hypotheses that tried to explain this impairment is the Theory of Mind (ToM) deficit hypotheses. On a behavioral level the critical test for having a ToM, the understanding of false beliefs (FB), is often used for testing ToM abilities in individuals with ASD. Investigating the neural underpinnings several neuroimaging studies revealed a network of areas involved in FB reasoning in neurotypical individuals. For ASD individuals the neural correlates of false belief processing are largely unknown. Using functional magnetic resonance imaging and an adapted unexpected transfer task, that makes it possible to distinguish between the computation of diverging beliefs and the selection of a belief-associated response, we investigated a group of adult high-functioning individuals with ASD ( N = 15) and an age and IQ matched group of neurotypical adults (NT; N = 15). On the behavioral level we found no group differences. On the neural level, results were two-fold: In the story phase, in which participants had to compute whether the character's belief is congruent or incongruent to their own belief, there were no differences between neurotypical participants and those diagnosed with ASD. But, in the subsequent question phase, participants with ASD showed increased activity in the bilateral anterior prefrontal cortex, the left posterior frontal cortex, the left superior temporal gyrus, and the left temporoparietal area. These results suggest that during the story phase in which the participants processed observable actions the neural correlates do not differ between adult individuals with ASD and NT individuals. But in the question phase in which participants had to infer an unobservable mental state results revealed neural differences between the two groups. Possibly, these subtle neural processing differences may contribute to the fact that adult ASD individuals are able to master explicit false belief tasks but fail to apply their strategies during everyday social interaction.

False Belief Reasoning in Adults with and without Autistic Spectrum Disorder: Similarities and Differences

PubMed Central

Sommer, Monika; Döhnel, Katrin; Jarvers, Irina; Blaas, Lore; Singer, Manuela; Nöth, Victoria; Schuwerk, Tobias; Rupprecht, Rainer

2018-01-01

A central diagnostic criteria for autism spectrum disorder (ASD) is the qualitative impairment in reciprocal social interaction and a prominent hypotheses that tried to explain this impairment is the Theory of Mind (ToM) deficit hypotheses. On a behavioral level the critical test for having a ToM, the understanding of false beliefs (FB), is often used for testing ToM abilities in individuals with ASD. Investigating the neural underpinnings several neuroimaging studies revealed a network of areas involved in FB reasoning in neurotypical individuals. For ASD individuals the neural correlates of false belief processing are largely unknown. Using functional magnetic resonance imaging and an adapted unexpected transfer task, that makes it possible to distinguish between the computation of diverging beliefs and the selection of a belief-associated response, we investigated a group of adult high-functioning individuals with ASD (N = 15) and an age and IQ matched group of neurotypical adults (NT; N = 15). On the behavioral level we found no group differences. On the neural level, results were two-fold: In the story phase, in which participants had to compute whether the character's belief is congruent or incongruent to their own belief, there were no differences between neurotypical participants and those diagnosed with ASD. But, in the subsequent question phase, participants with ASD showed increased activity in the bilateral anterior prefrontal cortex, the left posterior frontal cortex, the left superior temporal gyrus, and the left temporoparietal area. These results suggest that during the story phase in which the participants processed observable actions the neural correlates do not differ between adult individuals with ASD and NT individuals. But in the question phase in which participants had to infer an unobservable mental state results revealed neural differences between the two groups. Possibly, these subtle neural processing differences may contribute to the fact that adult ASD individuals are able to master explicit false belief tasks but fail to apply their strategies during everyday social interaction. PMID:29503627

An investigation of the information propagation and entropy transport aspects of Stirling machine numerical simulation

NASA Technical Reports Server (NTRS)

Goldberg, Louis F.

1992-01-01

Aspects of the information propagation modeling behavior of integral machine computer simulation programs are investigated in terms of a transmission line. In particular, the effects of pressure-linking and temporal integration algorithms on the amplitude ratio and phase angle predictions are compared against experimental and closed-form analytic data. It is concluded that the discretized, first order conservation balances may not be adequate for modeling information propagation effects at characteristic numbers less than about 24. An entropy transport equation suitable for generalized use in Stirling machine simulation is developed. The equation is evaluated by including it in a simulation of an incompressible oscillating flow apparatus designed to demonstrate the effect of flow oscillations on the enhancement of thermal diffusion. Numerical false diffusion is found to be a major factor inhibiting validation of the simulation predictions with experimental and closed-form analytic data. A generalized false diffusion correction algorithm is developed which allows the numerical results to match their analytic counterparts. Under these conditions, the simulation yields entropy predictions which satisfy Clausius' inequality.

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)

Dual boundary conditions in 3d SCFT's

NASA Astrophysics Data System (ADS)

Dimofte, Tudor; Gaiotto, Davide; Paquette, Natalie M.

2018-05-01

We propose matching pairs of half-BPS boundary conditions related by IR dualities of 3d N=2 gauge theories. From these matching pairs we construct duality interfaces. We test our proposals by anomaly matching and the computation of supersymmetric indices. Examples include basic abelian dualities, level-rank dualities, and Aharony dualities.

Parallel implementation and evaluation of motion estimation system algorithms on a distributed memory multiprocessor using knowledge based mappings

NASA Technical Reports Server (NTRS)

Choudhary, Alok Nidhi; Leung, Mun K.; Huang, Thomas S.; Patel, Janak H.

1989-01-01

Several techniques to perform static and dynamic load balancing techniques for vision systems are presented. These techniques are novel in the sense that they capture the computational requirements of a task by examining the data when it is produced. Furthermore, they can be applied to many vision systems because many algorithms in different systems are either the same, or have similar computational characteristics. These techniques are evaluated by applying them on a parallel implementation of the algorithms in a motion estimation system on a hypercube multiprocessor system. The motion estimation 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 different time instants; (4) stereo match to compute final unambiguous points; and (5) computation of motion parameters. It is shown that the performance gains when these data decomposition and load balancing techniques are used are significant and the overhead of using these techniques is minimal.

Robust and Effective Component-based Banknote Recognition for the Blind

PubMed Central

Hasanuzzaman, Faiz M.; Yang, Xiaodong; Tian, YingLi

2012-01-01

We develop a novel camera-based computer vision technology to automatically recognize banknotes for assisting visually impaired people. Our banknote recognition system is robust and effective with the following features: 1) high accuracy: high true recognition rate and low false recognition rate, 2) robustness: handles a variety of currency designs and bills in various conditions, 3) high efficiency: recognizes banknotes quickly, and 4) ease of use: helps blind users to aim the target for image capture. To make the system robust to a variety of conditions including occlusion, rotation, scaling, cluttered background, illumination change, viewpoint variation, and worn or wrinkled bills, we propose a component-based framework by using Speeded Up Robust Features (SURF). Furthermore, we employ the spatial relationship of matched SURF features to detect if there is a bill in the camera view. This process largely alleviates false recognition and can guide the user to correctly aim at the bill to be recognized. The robustness and generalizability of the proposed system is evaluated on a dataset including both positive images (with U.S. banknotes) and negative images (no U.S. banknotes) collected under a variety of conditions. The proposed algorithm, achieves 100% true recognition rate and 0% false recognition rate. Our banknote recognition system is also tested by blind users. PMID:22661884

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.

45 CFR 1301.20 - Matching requirements.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 45 Public Welfare 4 2013-10-01 2013-10-01 false Matching requirements. 1301.20 Section 1301.20 Public Welfare Regulations Relating to Public Welfare (Continued) OFFICE OF HUMAN DEVELOPMENT SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES THE ADMINISTRATION FOR CHILDREN, YOUTH AND FAMILIES, HEAD START...

45 CFR 1301.20 - Matching requirements.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 45 Public Welfare 4 2014-10-01 2014-10-01 false Matching requirements. 1301.20 Section 1301.20 Public Welfare Regulations Relating to Public Welfare (Continued) OFFICE OF HUMAN DEVELOPMENT SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES THE ADMINISTRATION FOR CHILDREN, YOUTH AND FAMILIES, HEAD START...

45 CFR 1301.20 - Matching requirements.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 45 Public Welfare 4 2012-10-01 2012-10-01 false Matching requirements. 1301.20 Section 1301.20 Public Welfare Regulations Relating to Public Welfare (Continued) OFFICE OF HUMAN DEVELOPMENT SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES THE ADMINISTRATION FOR CHILDREN, YOUTH AND FAMILIES, HEAD START...

34 CFR 609.40 - What are the matching requirements?

Code of Federal Regulations, 2011 CFR

2011-07-01

... 34 Education 3 2011-07-01 2011-07-01 false What are the matching requirements? 609.40 Section 609.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION STRENGTHENING HISTORICALLY BLACK GRADUATE INSTITUTIONS PROGRAM...

34 CFR 609.40 - What are the matching requirements?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 3 2010-07-01 2010-07-01 false What are the matching requirements? 609.40 Section 609.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION STRENGTHENING HISTORICALLY BLACK GRADUATE INSTITUTIONS PROGRAM...

34 CFR 609.40 - What are the matching requirements?

Code of Federal Regulations, 2012 CFR

2012-07-01

... 34 Education 3 2012-07-01 2012-07-01 false What are the matching requirements? 609.40 Section 609.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION STRENGTHENING HISTORICALLY BLACK GRADUATE INSTITUTIONS PROGRAM...

28 CFR 90.55 - Matching requirements.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 28 Judicial Administration 2 2010-07-01 2010-07-01 false Matching requirements. 90.55 Section 90.55 Judicial Administration DEPARTMENT OF JUSTICE (CONTINUED) VIOLENCE AGAINST WOMEN Indian Tribal... the same uses as the Violence Against Women Program funds and must be expended within the grant period...

50 CFR 401.11 - Property as matching funds.

Code of Federal Regulations, 2010 CFR

2010-10-01

... ADMINISTRATION, DEPARTMENT OF COMMERCE); ENDANGERED SPECIES COMMITTEE REGULATIONS SUBCHAPTER A ANADROMOUS... 50 Wildlife and Fisheries 7 2010-10-01 2010-10-01 false Property as matching funds. 401.11 Section 401.11 Wildlife and Fisheries JOINT REGULATIONS (UNITED STATES FISH AND WILDLIFE SERVICE, DEPARTMENT...

34 CFR 609.40 - What are the matching requirements?

Code of Federal Regulations, 2013 CFR

2013-07-01

... 34 Education 3 2013-07-01 2013-07-01 false What are the matching requirements? 609.40 Section 609.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION STRENGTHENING HISTORICALLY BLACK GRADUATE INSTITUTIONS PROGRAM...

34 CFR 609.40 - What are the matching requirements?

Code of Federal Regulations, 2014 CFR

2014-07-01

... 34 Education 3 2014-07-01 2014-07-01 false What are the matching requirements? 609.40 Section 609.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION STRENGTHENING HISTORICALLY BLACK GRADUATE INSTITUTIONS PROGRAM...

45 CFR 1301.20 - Matching requirements.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 45 Public Welfare 4 2011-10-01 2011-10-01 false Matching requirements. 1301.20 Section 1301.20 Public Welfare Regulations Relating to Public Welfare (Continued) OFFICE OF HUMAN DEVELOPMENT SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES THE ADMINISTRATION FOR CHILDREN, YOUTH AND FAMILIES, HEAD START...

45 CFR 1301.20 - Matching requirements.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 45 Public Welfare 4 2010-10-01 2010-10-01 false Matching requirements. 1301.20 Section 1301.20 Public Welfare Regulations Relating to Public Welfare (Continued) OFFICE OF HUMAN DEVELOPMENT SERVICES, DEPARTMENT OF HEALTH AND HUMAN SERVICES THE ADMINISTRATION FOR CHILDREN, YOUTH AND FAMILIES, HEAD START...

Veridical and False Recall in Adults Who Stutter

ERIC Educational Resources Information Center

Byrd, Courtney T.; Sheng, Li; Ratner, Nan Bernstein; Gkalitsiou, Zoi

2015-01-01

Purpose: This study used a false memory paradigm to explore the veridical and false recall of adults who stutter. Method: Twelve adults who stutter and 12 age-matched typically fluent peers listened to and then verbally recalled lists of words that consisted of either semantic or phonological associates or an equal number of semantic and…

Optimizing Approximate Weighted Matching on Nvidia Kepler K40

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

Naim, Md; Manne, Fredrik; Halappanavar, Mahantesh

Matching is a fundamental graph problem with numerous applications in science and engineering. While algorithms for computing optimal matchings are difficult to parallelize, approximation algorithms on the other hand generally compute high quality solutions and are amenable to parallelization. In this paper, we present efficient implementations of the current best algorithm for half-approximate weighted matching, the Suitor algorithm, on Nvidia Kepler K-40 platform. We develop four variants of the algorithm that exploit hardware features to address key challenges for a GPU implementation. We also experiment with different combinations of work assigned to a warp. Using an exhaustive set ofmore » $269$ inputs, we demonstrate that the new implementation outperforms the previous best GPU algorithm by $10$ to $$100\\times$$ for over $100$ instances, and from $100$ to $$1000\\times$$ for $15$ instances. We also demonstrate up to $$20\\times$$ speedup relative to $2$ threads, and up to $$5\\times$$ relative to $16$ threads on Intel Xeon platform with $16$ cores for the same algorithm. The new algorithms and implementations provided in this paper will have a direct impact on several applications that repeatedly use matching as a key compute kernel. Further, algorithm designs and insights provided in this paper will benefit other researchers implementing graph algorithms on modern GPU architectures.« less

Data analysis of gravitational-wave signals from spinning neutron stars. III. Detection statistics and computational requirements

NASA Astrophysics Data System (ADS)

Jaranowski, Piotr; Królak, Andrzej

2000-03-01

We develop the analytic and numerical tools for data analysis of the continuous gravitational-wave signals from spinning neutron stars for ground-based laser interferometric detectors. The statistical data analysis method that we investigate is maximum likelihood detection which for the case of Gaussian noise reduces to matched filtering. We study in detail the statistical properties of the optimum functional that needs to be calculated in order to detect the gravitational-wave signal and estimate its parameters. We find it particularly useful to divide the parameter space into elementary cells such that the values of the optimal functional are statistically independent in different cells. We derive formulas for false alarm and detection probabilities both for the optimal and the suboptimal filters. We assess the computational requirements needed to do the signal search. We compare a number of criteria to build sufficiently accurate templates for our data analysis scheme. We verify the validity of our concepts and formulas by means of the Monte Carlo simulations. We present algorithms by which one can estimate the parameters of the continuous signals accurately. We find, confirming earlier work of other authors, that given a 100 Gflops computational power an all-sky search for observation time of 7 days and directed search for observation time of 120 days are possible whereas an all-sky search for 120 days of observation time is computationally prohibitive.

Template match using local feature with view invariance

NASA Astrophysics Data System (ADS)

Lu, Cen; Zhou, Gang

2013-10-01

Matching the template image in the target image is the fundamental task in the field of computer vision. Aiming at the deficiency in the traditional image matching methods and inaccurate matching in scene image with rotation, illumination and view changing, a novel matching algorithm using local features are proposed in this paper. The local histograms of the edge pixels (LHoE) are extracted as the invariable feature to resist view and brightness changing. The merits of the LHoE is that the edge points have been little affected with view changing, and the LHoE can resist not only illumination variance but also the polution of noise. For the process of matching are excuded only on the edge points, the computation burden are highly reduced. Additionally, our approach is conceptually simple, easy to implement and do not need the training phase. The view changing can be considered as the combination of rotation, illumination and shear transformation. Experimental results on simulated and real data demonstrated that the proposed approach is superior to NCC(Normalized cross-correlation) and Histogram-based methods with view changing.

Component extraction on CT volumes of assembled products using geometric template matching

NASA Astrophysics Data System (ADS)

Muramatsu, Katsutoshi; Ohtake, Yutaka; Suzuki, Hiromasa; Nagai, Yukie

2017-03-01

As a method of non-destructive internal inspection, X-ray computed tomography (CT) is used not only in medical applications but also for product inspection. Some assembled products can be divided into separate components based on density, which is known to be approximately proportional to CT values. However, components whose densities are similar cannot be distinguished using the CT value driven approach. In this study, we proposed a new component extraction algorithm from the CT volume, using a set of voxels with an assigned CT value with the surface mesh as the template rather than the density. The method has two main stages: rough matching and fine matching. At the rough matching stage, the position of candidate targets is identified roughly from the CT volume, using the template of the target component. At the fine matching stage, these candidates are precisely matched with the templates, allowing the correct position of the components to be detected from the CT volume. The results of two computational experiments showed that the proposed algorithm is able to extract components with similar density within the assembled products on CT volumes.

Depth estimation of features in video frames with improved feature matching technique using Kinect sensor

NASA Astrophysics Data System (ADS)

Sharma, Kajal; Moon, Inkyu; Kim, Sung Gaun

2012-10-01

Estimating depth has long been a major issue in the field of computer vision and robotics. The Kinect sensor's active sensing strategy provides high-frame-rate depth maps and can recognize user gestures and human pose. This paper presents a technique to estimate the depth of features extracted from video frames, along with an improved feature-matching method. In this paper, we used the Kinect camera developed by Microsoft, which captured color and depth images for further processing. Feature detection and selection is an important task for robot navigation. Many feature-matching techniques have been proposed earlier, and this paper proposes an improved feature matching between successive video frames with the use of neural network methodology in order to reduce the computation time of feature matching. The features extracted are invariant to image scale and rotation, and different experiments were conducted to evaluate the performance of feature matching between successive video frames. The extracted features are assigned distance based on the Kinect technology that can be used by the robot in order to determine the path of navigation, along with obstacle detection applications.

Inspection of aeronautical mechanical parts with a pan-tilt-zoom camera: an approach guided by the computer-aided design model

NASA Astrophysics Data System (ADS)

Viana, Ilisio; Orteu, Jean-José; Cornille, Nicolas; Bugarin, Florian

2015-11-01

We focus on quality control of mechanical parts in aeronautical context using a single pan-tilt-zoom (PTZ) camera and a computer-aided design (CAD) model of the mechanical part. We use the CAD model to create a theoretical image of the element to be checked, which is further matched with the sensed image of the element to be inspected, using a graph theory-based approach. The matching is carried out in two stages. First, the two images are used to create two attributed graphs representing the primitives (ellipses and line segments) in the images. In the second stage, the graphs are matched using a similarity function built from the primitive parameters. The similarity scores of the matching are injected in the edges of a bipartite graph. A best-match-search procedure in the bipartite graph guarantees the uniqueness of the match solution. The method achieves promising performance in tests with synthetic data including missing elements, displaced elements, size changes, and combinations of these cases. The results open good prospects for using the method with realistic data.

20 CFR 437.24 - Matching or cost sharing.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 20 Employees' Benefits 2 2010-04-01 2010-04-01 false Matching or cost sharing. 437.24 Section 437.24 Employees' Benefits SOCIAL SECURITY ADMINISTRATION UNIFORM ADMINISTRATIVE REQUIREMENTS FOR GRANTS... grant or subgrant, as follows: (1) Awards for capital expenditures. If the purpose of the grant or...

34 CFR 367.40 - What matching requirements apply?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 2 2010-07-01 2010-07-01 false What matching requirements apply? 367.40 Section 367.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF SPECIAL EDUCATION AND REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION INDEPENDENT LIVING SERVICES FOR OLDER INDIVIDUALS...

34 CFR 661.40 - What are the matching requirements?

Code of Federal Regulations, 2011 CFR

2011-07-01

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

34 CFR 376.40 - What are the matching requirements?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 2 2010-07-01 2010-07-01 false What are the matching requirements? 376.40 Section 376.40 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF SPECIAL EDUCATION AND REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION SPECIAL PROJECTS AND DEMONSTRATIONS FOR...

34 CFR 373.20 - What are the matching requirements?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 2 2010-07-01 2010-07-01 false What are the matching requirements? 373.20 Section 373.20 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF SPECIAL EDUCATION AND REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION SPECIAL DEMONSTRATION PROGRAMS What...

34 CFR 661.40 - What are the matching requirements?

Code of Federal Regulations, 2010 CFR

2010-07-01

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

45 CFR 2519.700 - Are matching funds required?

Code of Federal Regulations, 2010 CFR

2010-10-01

... 45 Public Welfare 4 2010-10-01 2010-10-01 false Are matching funds required? 2519.700 Section 2519.700 Public Welfare Regulations Relating to Public Welfare (Continued) CORPORATION FOR NATIONAL AND COMMUNITY SERVICE HIGHER EDUCATION INNOVATIVE PROGRAMS FOR COMMUNITY SERVICE Funding Requirements § 2519.700...

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

Gaia Data Release 1. Cross-match with external catalogues. Algorithm and results

NASA Astrophysics Data System (ADS)

Marrese, P. M.; Marinoni, S.; Fabrizio, M.; Giuffrida, G.

2017-11-01

Context. Although the Gaia catalogue on its own will be a very powerful tool, it is the combination of this highly accurate archive with other archives that will truly open up amazing possibilities for astronomical research. The advanced interoperation of archives is based on cross-matching, leaving the user with the feeling of working with one single data archive. The data retrieval should work not only across data archives, but also across wavelength domains. The first step for seamless data access is the computation of the cross-match between Gaia and external surveys. Aims: The matching of astronomical catalogues is a complex and challenging problem both scientifically and technologically (especially when matching large surveys like Gaia). We describe the cross-match algorithm used to pre-compute the match of Gaia Data Release 1 (DR1) with a selected list of large publicly available optical and IR surveys. Methods: The overall principles of the adopted cross-match algorithm are outlined. Details are given on the developed algorithm, including the methods used to account for position errors, proper motions, and environment; to define the neighbours; and to define the figure of merit used to select the most probable counterpart. Results: Statistics on the results are also given. The results of the cross-match are part of the official Gaia DR1 catalogue.

Dynamic Target Match Signals in Perirhinal Cortex Can Be Explained by Instantaneous Computations That Act on Dynamic Input from Inferotemporal Cortex

PubMed Central

Pagan, Marino

2014-01-01

Finding sought objects requires the brain to combine visual and target signals to determine when a target is in view. To investigate how the brain implements these computations, we recorded neural responses in inferotemporal cortex (IT) and perirhinal cortex (PRH) as macaque monkeys performed a delayed-match-to-sample target search task. Our data suggest that visual and target signals were combined within or before IT in the ventral visual pathway and then passed onto PRH, where they were reformatted into a more explicit target match signal over ∼10–15 ms. Accounting for these dynamics in PRH did not require proposing dynamic computations within PRH itself but, rather, could be attributed to instantaneous PRH computations performed upon an input representation from IT that changed with time. We found that the dynamics of the IT representation arose from two commonly observed features: individual IT neurons whose response preferences were not simply rescaled with time and variable response latencies across the population. Our results demonstrate that these types of time-varying responses have important consequences for downstream computation and suggest that dynamic representations can arise within a feedforward framework as a consequence of instantaneous computations performed upon time-varying inputs. PMID:25122904

Precise detection of de novo single nucleotide variants in human genomes.

PubMed

Gómez-Romero, Laura; Palacios-Flores, Kim; Reyes, José; García, Delfino; Boege, Margareta; Dávila, Guillermo; Flores, Margarita; Schatz, Michael C; Palacios, Rafael

2018-05-22

The precise determination of de novo genetic variants has enormous implications across different fields of biology and medicine, particularly personalized medicine. Currently, de novo variations are identified by mapping sample reads from a parent-offspring trio to a reference genome, allowing for a certain degree of differences. While widely used, this approach often introduces false-positive (FP) results due to misaligned reads and mischaracterized sequencing errors. In a previous study, we developed an alternative approach to accurately identify single nucleotide variants (SNVs) using only perfect matches. However, this approach could be applied only to haploid regions of the genome and was computationally intensive. In this study, we present a unique approach, coverage-based single nucleotide variant identification (COBASI), which allows the exploration of the entire genome using second-generation short sequence reads without extensive computing requirements. COBASI identifies SNVs using changes in coverage of exactly matching unique substrings, and is particularly suited for pinpointing de novo SNVs. Unlike other approaches that require population frequencies across hundreds of samples to filter out any methodological biases, COBASI can be applied to detect de novo SNVs within isolated families. We demonstrate this capability through extensive simulation studies and by studying a parent-offspring trio we sequenced using short reads. Experimental validation of all 58 candidate de novo SNVs and a selection of non-de novo SNVs found in the trio confirmed zero FP calls. COBASI is available as open source at https://github.com/Laura-Gomez/COBASI for any researcher to use. Copyright © 2018 the Author(s). Published by PNAS.

34 CFR 614.5 - What are the matching requirements for the consortia?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 3 2010-07-01 2010-07-01 false What are the matching requirements for the consortia? 614.5 Section 614.5 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION PREPARING TOMORROW'S TEACHERS TO USE...

50 CFR 86.43 - May someone else supply the match?

Code of Federal Regulations, 2010 CFR

2010-10-01

... 50 Wildlife and Fisheries 6 2010-10-01 2010-10-01 false May someone else supply the match? 86.43 Section 86.43 Wildlife and Fisheries UNITED STATES FISH AND WILDLIFE SERVICE, DEPARTMENT OF THE INTERIOR (CONTINUED) FINANCIAL ASSISTANCE-WILDLIFE SPORT FISH RESTORATION PROGRAM BOATING INFRASTRUCTURE GRANT (BIG...

50 CFR 86.42 - What are the match requirements?

Code of Federal Regulations, 2010 CFR

2010-10-01

... 50 Wildlife and Fisheries 6 2010-10-01 2010-10-01 false What are the match requirements? 86.42 Section 86.42 Wildlife and Fisheries UNITED STATES FISH AND WILDLIFE SERVICE, DEPARTMENT OF THE INTERIOR (CONTINUED) FINANCIAL ASSISTANCE-WILDLIFE SPORT FISH RESTORATION PROGRAM BOATING INFRASTRUCTURE GRANT (BIG...

34 CFR Appendix C to Part 379 - Calculating Required Matching Amount

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 2 2010-07-01 2010-07-01 false Calculating Required Matching Amount C Appendix C to Part 379 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF SPECIAL EDUCATION AND REHABILITATIVE SERVICES, DEPARTMENT OF EDUCATION PROJECTS WITH INDUSTRY Pt. 379, App...

32 CFR 32.23 - Cost sharing or matching.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 32 National Defense 1 2014-07-01 2014-07-01 false Cost sharing or matching. 32.23 Section 32.23 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... efficient accomplishment of project or program objectives. (4) Are allowable under the applicable cost...

32 CFR 32.23 - Cost sharing or matching.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 32 National Defense 1 2010-07-01 2010-07-01 false Cost sharing or matching. 32.23 Section 32.23 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... efficient accomplishment of project or program objectives. (4) Are allowable under the applicable cost...

32 CFR 32.23 - Cost sharing or matching.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 32 National Defense 1 2011-07-01 2011-07-01 false Cost sharing or matching. 32.23 Section 32.23 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... efficient accomplishment of project or program objectives. (4) Are allowable under the applicable cost...

32 CFR 32.23 - Cost sharing or matching.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 32 National Defense 1 2012-07-01 2012-07-01 false Cost sharing or matching. 32.23 Section 32.23 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... efficient accomplishment of project or program objectives. (4) Are allowable under the applicable cost...

32 CFR 32.23 - Cost sharing or matching.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 32 National Defense 1 2013-07-01 2013-07-01 false Cost sharing or matching. 32.23 Section 32.23 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... efficient accomplishment of project or program objectives. (4) Are allowable under the applicable cost...

15 CFR 24.24 - Matching or cost sharing.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 15 Commerce and Foreign Trade 1 2010-01-01 2010-01-01 false Matching or cost sharing. 24.24 Section 24.24 Commerce and Foreign Trade Office of the Secretary of Commerce UNIFORM ADMINISTRATIVE... other employers for similar work in the same labor market. In either case, a reasonable amount for...

34 CFR 611.62 - What are a grantee's matching requirements?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 3 2010-07-01 2010-07-01 false What are a grantee's matching requirements? 611.62 Section 611.62 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION TEACHER QUALITY ENHANCEMENT GRANTS PROGRAM Other Grant...

11 CFR 9036.1 - Threshold submission.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 11 Federal Elections 1 2010-01-01 2010-01-01 false Threshold submission. 9036.1 Section 9036.1 Federal Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: PRESIDENTIAL PRIMARY MATCHING FUND REVIEW OF MATCHING FUND SUBMISSIONS AND CERTIFICATION OF PAYMENTS BY COMMISSION § 9036.1 Threshold submission. (a) Time for submission...

11 CFR 9036.1 - Threshold submission.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 11 Federal Elections 1 2012-01-01 2012-01-01 false Threshold submission. 9036.1 Section 9036.1 Federal Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: PRESIDENTIAL PRIMARY MATCHING FUND REVIEW OF MATCHING FUND SUBMISSIONS AND CERTIFICATION OF PAYMENTS BY COMMISSION § 9036.1 Threshold submission. (a) Time for submission...

11 CFR 9036.1 - Threshold submission.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 11 Federal Elections 1 2014-01-01 2014-01-01 false Threshold submission. 9036.1 Section 9036.1 Federal Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: PRESIDENTIAL PRIMARY MATCHING FUND REVIEW OF MATCHING FUND SUBMISSIONS AND CERTIFICATION OF PAYMENTS BY COMMISSION § 9036.1 Threshold submission. (a) Time for submission...

11 CFR 9036.1 - Threshold submission.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 11 Federal Elections 1 2011-01-01 2011-01-01 false Threshold submission. 9036.1 Section 9036.1 Federal Elections FEDERAL ELECTION COMMISSION PRESIDENTIAL ELECTION CAMPAIGN FUND: PRESIDENTIAL PRIMARY MATCHING FUND REVIEW OF MATCHING FUND SUBMISSIONS AND CERTIFICATION OF PAYMENTS BY COMMISSION § 9036.1 Threshold submission. (a) Time for submission...

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

7 CFR 272.14 - Deceased matching system.

Code of Federal Regulations, 2014 CFR

2014-01-01

... Master File, obtained through the State Verification and Exchange System (SVES) and enter into a computer... comparison of matched data at the time of application and no less frequently than once a year. (2) The...

7 CFR 272.14 - Deceased matching system.

Code of Federal Regulations, 2013 CFR

2013-01-01

... Master File, obtained through the State Verification and Exchange System (SVES) and enter into a computer... comparison of matched data at the time of application and no less frequently than once a year. (2) The...

Secure and Efficient k-NN Queries⋆

PubMed Central

Asif, Hafiz; Vaidya, Jaideep; Shafiq, Basit; Adam, Nabil

2017-01-01

Given the morass of available data, ranking and best match queries are often used to find records of interest. As such, k-NN queries, which give the k closest matches to a query point, are of particular interest, and have many applications. We study this problem in the context of the financial sector, wherein an investment portfolio database is queried for matching portfolios. Given the sensitivity of the information involved, our key contribution is to develop a secure k-NN computation protocol that can enable the computation k-NN queries in a distributed multi-party environment while taking domain semantics into account. The experimental results show that the proposed protocols are extremely efficient. PMID:29218333

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.

Testing the Domain-Specificity of a Theory of Mind Deficit in Brain-Injured Patients: Evidence for Consistent Performance on Non-Verbal, ''Reality-Unknown'' False Belief and False Photograph Tasks

ERIC Educational Resources Information Center

Apperly, Ian A.; Samson, Dana; Chiavarino, Claudia; Bickerton, Wai-Ling; Humphreys, Glyn W.

2007-01-01

To test the domain-specificity of ''theory of mind'' abilities we compared the performance of a case-series of 11 brain-lesioned patients on a recently developed test of false belief reasoning (Apperly, Samson, Chiavarino, & Humphreys, 2004) and on a matched false photograph task, which did not require belief reasoning and which addressed problems…

Active Site Detection by Spatial Conformity and Electrostatic Analysis—Unravelling a Proteolytic Function in Shrimp Alkaline Phosphatase

PubMed Central

Chakraborty, Sandeep; Minda, Renu; Salaye, Lipika; Bhattacharjee, Swapan K.; Rao, Basuthkar J.

2011-01-01

Computational methods are increasingly gaining importance as an aid in identifying active sites. Mostly these methods tend to have structural information that supplement sequence conservation based analyses. Development of tools that compute electrostatic potentials has further improved our ability to better characterize the active site residues in proteins. We have described a computational methodology for detecting active sites based on structural and electrostatic conformity - C ata L ytic A ctive S ite P rediction (CLASP). In our pipelined model, physical 3D signature of any particular enzymatic function as defined by its active sites is used to obtain spatially congruent matches. While previous work has revealed that catalytic residues have large pKa deviations from standard values, we show that for a given enzymatic activity, electrostatic potential difference (PD) between analogous residue pairs in an active site taken from different proteins of the same family are similar. False positives in spatially congruent matches are further pruned by PD analysis where cognate pairs with large deviations are rejected. We first present the results of active site prediction by CLASP for two enzymatic activities - β-lactamases and serine proteases, two of the most extensively investigated enzymes. The results of CLASP analysis on motifs extracted from Catalytic Site Atlas (CSA) are also presented in order to demonstrate its ability to accurately classify any protein, putative or otherwise, with known structure. The source code and database is made available at www.sanchak.com/clasp/. Subsequently, we probed alkaline phosphatases (AP), one of the well known promiscuous enzymes, for additional activities. Such a search has led us to predict a hitherto unknown function of shrimp alkaline phosphatase (SAP), where the protein acts as a protease. Finally, we present experimental evidence of the prediction by CLASP by showing that SAP indeed has protease activity in vitro. PMID:22174814

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)

Shape-matching soft mechanical metamaterials.

PubMed

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

2018-01-17

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

Mathematics skills in good readers with hydrocephalus.

PubMed

Barnes, Marcia A; Pengelly, Sarah; Dennis, Maureen; Wilkinson, Margaret; Rogers, Tracey; Faulkner, Heather

2002-01-01

Children with hydrocephalus have poor math skills. We investigated the nature of their arithmetic computation errors by comparing written subtraction errors in good readers with hydrocephalus, typically developing good readers of the same age, and younger children matched for math level to the children with hydrocephalus. Children with hydrocephalus made more procedural errors (although not more fact retrieval or visual-spatial errors) than age-matched controls; they made the same number of procedural errors as younger, math-level matched children. We also investigated a broad range of math abilities, and found that children with hydrocephalus performed more poorly than age-matched controls on tests of geometry and applied math skills such as estimation and problem solving. Computation deficits in children with hydrocephalus reflect delayed development of procedural knowledge. Problems in specific math domains such as geometry and applied math, were associated with deficits in constituent cognitive skills such as visual spatial competence, memory, and general knowledge.

Soft evolution of multi-jet final states

DOE PAGES

Gerwick, Erik; Schumann, Steffen; Höche, Stefan; ...

2015-02-16

We present a new framework for computing resummed and matched distributions in processes with many hard QCD jets. The intricate color structure of soft gluon emission at large angles renders resummed calculations highly non-trivial in this case. We automate all ingredients necessary for the color evolution of the soft function at next-to-leading-logarithmic accuracy, namely the selection of the color bases and the projections of color operators and Born amplitudes onto those bases. Explicit results for all QCD processes with up to 2 → 5 partons are given. We also devise a new tree-level matching scheme for resummed calculations which exploitsmore » a quasi-local subtraction based on the Catani-Seymour dipole formalism. We implement both resummation and matching in the Sherpa event generator. As a proof of concept, we compute the resummed and matched transverse-thrust distribution for hadronic collisions.« less

A robust fingerprint matching algorithm based on compatibility of star structures

NASA Astrophysics Data System (ADS)

Cao, Jia; Feng, Jufu

2009-10-01

In fingerprint verification or identification systems, most minutiae-based matching algorithms suffered from the problems of non-linear distortion and missing or faking minutiae. Local structures such as triangle or k-nearest structure are widely used to reduce the impact of non-linear distortion, but are suffered from missing and faking minutiae. In our proposed method, star structure is used to present local structure. A star structure contains various number of minutiae, thus, it is more robust with missing and faking minutiae. Our method consists of four steps: 1) Constructing star structures at minutia level; 2) Computing similarity score for each structure pair, and eliminating impostor matched pairs which have the low scores. As it is generally assumed that there is only linear distortion in local area, the similarity is defined by rotation and shifting. 3) Voting for remained matched pairs according to the compatibility between them, and eliminating impostor matched pairs which gain few votes. The concept of compatibility is first introduced by Yansong Feng [4], the original definition is only based on triangles. We define the compatibility for star structures to adjust to our proposed algorithm. 4) Computing the matching score, based on the number of matched structures and their voting scores. The score also reflects the fact that, it should get higher score if minutiae match in more intensive areas. Experiments evaluated on FVC 2004 show both effectiveness and efficiency of our methods.

Good match exploration for infrared face recognition

NASA Astrophysics Data System (ADS)

Yang, Changcai; Zhou, Huabing; Sun, Sheng; Liu, Renfeng; Zhao, Ji; Ma, Jiayi

2014-11-01

Establishing good feature correspondence is a critical prerequisite and a challenging task for infrared (IR) face recognition. Recent studies revealed that the scale invariant feature transform (SIFT) descriptor outperforms other local descriptors for feature matching. However, it only uses local appearance information for matching, and hence inevitably leads to a number of false matches. To address this issue, this paper explores global structure information (GSI) among SIFT correspondences, and proposes a new method SIFT-GSI for good match exploration. This is achieved by fitting a smooth mapping function for the underlying correct matches, which involves softassign and deterministic annealing. Quantitative comparisons with state-of-the-art methods on a publicly available IR human face database demonstrate that SIFT-GSI significantly outperforms other methods for feature matching, and hence it is able to improve the reliability of IR face recognition systems.

On the classic and modern theories of matching.

PubMed

McDowell, J J

2005-07-01

Classic matching theory, which is based on Herrnstein's (1961) original matching equation and includes the well-known quantitative law of effect, is almost certainly false. The theory is logically inconsistent with known experimental findings, and experiments have shown that its central constant-k assumption is not tenable. Modern matching theory, which is based on the power function version of the original matching equation, remains tenable, although it has not been discussed or studied extensively. The modern theory is logically consistent with known experimental findings, it predicts the fact and details of the violation of the classic theory's constant-k assumption, and it accurately describes at least some data that are inconsistent with the classic theory.

A coarse to fine minutiae-based latent palmprint matching.

PubMed

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

2013-10-01

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

Euler Flow Computations on Non-Matching Unstructured Meshes

NASA Technical Reports Server (NTRS)

Gumaste, Udayan

1999-01-01

Advanced fluid solvers to predict aerodynamic performance-coupled treatment of multiple fields are described. The interaction between the fluid and structural components in the bladed regions of the engine is investigated with respect to known blade failures caused by either flutter or forced vibrations. Methods are developed to describe aeroelastic phenomena for internal flows in turbomachinery by accounting for the increased geometric complexity, mutual interaction between adjacent structural components and presence of thermal and geometric loading. The computer code developed solves the full three dimensional aeroelastic problem of-stage. The results obtained show that flow computations can be performed on non-matching finite-volume unstructured meshes with second order spatial accuracy.

34 CFR 648.7 - What is the institutional matching contribution?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 3 2010-07-01 2010-07-01 false What is the institutional matching contribution? 648.7 Section 648.7 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION GRADUATE ASSISTANCE IN AREAS OF NATIONAL NEED General § 648.7...

34 CFR 648.7 - What is the institutional matching contribution?

Code of Federal Regulations, 2011 CFR

2011-07-01

... 34 Education 3 2011-07-01 2011-07-01 false What is the institutional matching contribution? 648.7 Section 648.7 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION GRADUATE ASSISTANCE IN AREAS OF NATIONAL NEED General § 648.7...

34 CFR 648.7 - What is the institutional matching contribution?

Code of Federal Regulations, 2014 CFR

2014-07-01

... 34 Education 3 2014-07-01 2014-07-01 false What is the institutional matching contribution? 648.7 Section 648.7 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION GRADUATE ASSISTANCE IN AREAS OF NATIONAL NEED General § 648.7...

34 CFR 648.7 - What is the institutional matching contribution?

Code of Federal Regulations, 2013 CFR

2013-07-01

... 34 Education 3 2013-07-01 2013-07-01 false What is the institutional matching contribution? 648.7 Section 648.7 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION GRADUATE ASSISTANCE IN AREAS OF NATIONAL NEED General § 648.7...

34 CFR 648.7 - What is the institutional matching contribution?

Code of Federal Regulations, 2012 CFR

2012-07-01

... 34 Education 3 2012-07-01 2012-07-01 false What is the institutional matching contribution? 648.7 Section 648.7 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION GRADUATE ASSISTANCE IN AREAS OF NATIONAL NEED General § 648.7...

Theory of Mind in Williams Syndrome Assessed Using a Nonverbal Task

ERIC Educational Resources Information Center

Porter, Melanie A.; Coltheart, Max; Langdon, Robyn

2008-01-01

This study examined Theory of Mind in Williams syndrome (WS) and in normal chronological age-matched and mental age-matched control groups, using a picture sequencing task. This task assesses understanding of pretence, intention and false belief, while controlling for social-script knowledge and physical cause-and-effect reasoning. The task was…

24 CFR 92.221 - Match credit.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 24 Housing and Urban Development 1 2010-04-01 2010-04-01 false Match credit. 92.221 Section 92.221 Housing and Urban Development Office of the Secretary, Department of Housing and Urban Development HOME... grant equivalent of a below-market interest rate loan is credited at the time of the loan closing. (3...

32 CFR 34.13 - Cost sharing or matching.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 32 National Defense 1 2013-07-01 2013-07-01 false Cost sharing or matching. 34.13 Section 34.13 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... proper and efficient accomplishment of project or program objectives. (4) They are allowable under § 34...

32 CFR 34.13 - Cost sharing or matching.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 32 National Defense 1 2014-07-01 2014-07-01 false Cost sharing or matching. 34.13 Section 34.13 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... proper and efficient accomplishment of project or program objectives. (4) They are allowable under § 34...

32 CFR 34.13 - Cost sharing or matching.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 32 National Defense 1 2012-07-01 2012-07-01 false Cost sharing or matching. 34.13 Section 34.13 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... proper and efficient accomplishment of project or program objectives. (4) They are allowable under § 34...

32 CFR 34.13 - Cost sharing or matching.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 32 National Defense 1 2011-07-01 2011-07-01 false Cost sharing or matching. 34.13 Section 34.13 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... proper and efficient accomplishment of project or program objectives. (4) They are allowable under § 34...

32 CFR 34.13 - Cost sharing or matching.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 32 National Defense 1 2010-07-01 2010-07-01 false Cost sharing or matching. 34.13 Section 34.13 National Defense Department of Defense OFFICE OF THE SECRETARY OF DEFENSE DoD GRANT AND AGREEMENT... proper and efficient accomplishment of project or program objectives. (4) They are allowable under § 34...

34 CFR 694.7 - What are the matching requirements for a GEAR UP Partnership?

Code of Federal Regulations, 2010 CFR

2010-07-01

... 34 Education 3 2010-07-01 2010-07-01 false What are the matching requirements for a GEAR UP Partnership? 694.7 Section 694.7 Education Regulations of the Offices of the Department of Education (Continued) OFFICE OF POSTSECONDARY EDUCATION, DEPARTMENT OF EDUCATION GAINING EARLY AWARENESS AND READINESS...

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.

Theory of mind in Williams syndrome assessed using a nonverbal task.

PubMed

Porter, Melanie A; Coltheart, Max; Langdon, Robyn

2008-05-01

This study examined Theory of Mind in Williams syndrome (WS) and in normal chronological age-matched and mental age-matched control groups, using a picture sequencing task. This task assesses understanding of pretence, intention and false belief, while controlling for social-script knowledge and physical cause-and-effect reasoning. The task was selected because it is entirely non-verbal, so that the WS individuals could not rely on their good verbal skills when performing the task. Results indicated a specific deficit in understanding of false belief within the WS group. There was also evidence of heterogeneity in the WS group, with the false belief impairment restricted to only a particular subgroup of WS individuals identified originally by Porter, M., & Coltheart, M. (2005). Cognitive heterogeneity in Williams syndrome. Developmental Neuropsychology, 27(2), 275-306.

Rapid and Robust Cross-Correlation-Based Seismic Phase Identification Using an Approximate Nearest Neighbor Method

NASA Astrophysics Data System (ADS)

Tibi, R.; Young, C. J.; Gonzales, A.; Ballard, S.; Encarnacao, A. V.

2016-12-01

The matched filtering technique involving the cross-correlation of a waveform of interest with archived signals from a template library has proven to be a powerful tool for detecting events in regions with repeating seismicity. However, waveform correlation is computationally expensive, and therefore impractical for large template sets unless dedicated distributed computing hardware and software are used. In this study, we introduce an Approximate Nearest Neighbor (ANN) approach that enables the use of very large template libraries for waveform correlation without requiring a complex distributed computing system. Our method begins with a projection into a reduced dimensionality space based on correlation with a randomized subset of the full template archive. Searching for a specified number of nearest neighbors is accomplished by using randomized K-dimensional trees. We used the approach to search for matches to each of 2700 analyst-reviewed signal detections reported for May 2010 for the IMS station MKAR. The template library in this case consists of a dataset of more than 200,000 analyst-reviewed signal detections for the same station from 2002-2014 (excluding May 2010). Of these signal detections, 60% are teleseismic first P, and 15% regional phases (Pn, Pg, Sn, and Lg). The analyses performed on a standard desktop computer shows that the proposed approach performs the search of the large template libraries about 20 times faster than the standard full linear search, while achieving recall rates greater than 80%, with the recall rate increasing for higher correlation values. To decide whether to confirm a match, we use a hybrid method involving a cluster approach for queries with two or more matches, and correlation score for single matches. Of the signal detections that passed our confirmation process, 52% were teleseismic first P, and 30% were regional phases.

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.

Application of Template Matching for Improving Classification of Urban Railroad Point Clouds

PubMed Central

Arastounia, Mostafa; Oude Elberink, Sander

2016-01-01

This study develops an integrated data-driven and model-driven approach (template matching) that clusters the urban railroad point clouds into three classes of rail track, contact cable, and catenary cable. The employed dataset covers 630 m of the Dutch urban railroad corridors in which there are four rail tracks, two contact cables, and two catenary cables. The dataset includes only geometrical information (three dimensional (3D) coordinates of the points) with no intensity data and no RGB data. The obtained results indicate that all objects of interest are successfully classified at the object level with no false positives and no false negatives. The results also show that an average 97.3% precision and an average 97.7% accuracy at the point cloud level are achieved. The high precision and high accuracy of the rail track classification (both greater than 96%) at the point cloud level stems from the great impact of the employed template matching method on excluding the false positives. The cables also achieve quite high average precision (96.8%) and accuracy (98.4%) due to their high sampling and isolated position in the railroad corridor. PMID:27973452

Nonparametric Bayesian Modeling for Automated Database Schema Matching

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

Ferragut, Erik M; Laska, Jason A

2015-01-01

The problem of merging databases arises in many government and commercial applications. Schema matching, a common first step, identifies equivalent fields between databases. We introduce a schema matching framework that builds nonparametric Bayesian models for each field and compares them by computing the probability that a single model could have generated both fields. Our experiments show that our method is more accurate and faster than the existing instance-based matching algorithms in part because of the use of nonparametric Bayesian models.

Recognition and use of line drawings by children with severe intellectual disabilities: the effects of color and outline shape.

PubMed

Stephenson, Jennifer

2009-03-01

Communication symbols for students with severe intellectual disabilities often take the form of computer-generated line drawings. This study investigated the effects of the match between color and shape of line drawings and the objects they represented on drawing recognition and use. The match or non-match between color and shape of the objects and drawings did not have an effect on participants' ability to match drawings to objects, or to use drawings to make choices.

Evaluation of Content-Matched Range Monitoring Queries over Moving Objects in Mobile Computing Environments.

PubMed

Jung, HaRim; Song, MoonBae; Youn, Hee Yong; Kim, Ung Mo

2015-09-18

A content-matched (CM) rangemonitoring query overmoving objects continually retrieves the moving objects (i) whose non-spatial attribute values are matched to given non-spatial query values; and (ii) that are currently located within a given spatial query range. In this paper, we propose a new query indexing structure, called the group-aware query region tree (GQR-tree) for efficient evaluation of CMrange monitoring queries. The primary role of the GQR-tree is to help the server leverage the computational capabilities of moving objects in order to improve the system performance in terms of the wireless communication cost and server workload. Through a series of comprehensive simulations, we verify the superiority of the GQR-tree method over the existing methods.

A Simple and Robust Method for Partially Matched Samples Using the P-Values Pooling Approach

PubMed Central

Kuan, Pei Fen; Huang, Bo

2013-01-01

This paper focuses on statistical analyses in scenarios where some samples from the matched pairs design are missing, resulting in partially matched samples. Motivated by the idea of meta-analysis, we recast the partially matched samples as coming from two experimental designs, and propose a simple yet robust approach based on the weighted Z-test to integrate the p-values computed from these two designs. We show that the proposed approach achieves better operating characteristics in simulations and a case study, compared to existing methods for partially matched samples. PMID:23417968

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

Dense Matching Comparison Between Census and a Convolutional Neural Network Algorithm for Plant Reconstruction

NASA Astrophysics Data System (ADS)

Xia, Y.; Tian, J.; d'Angelo, P.; Reinartz, P.

2018-05-01

3D reconstruction of plants is hard to implement, as the complex leaf distribution highly increases the difficulty level in dense matching. Semi-Global Matching has been successfully applied to recover the depth information of a scene, but may perform variably when different matching cost algorithms are used. In this paper two matching cost computation algorithms, Census transform and an algorithm using a convolutional neural network, are tested for plant reconstruction based on Semi-Global Matching. High resolution close-range photogrammetric images from a handheld camera are used for the experiment. The disparity maps generated based on the two selected matching cost methods are comparable with acceptable quality, which shows the good performance of Census and the potential of neural networks to improve the dense matching.

A fuzzy structural matching scheme for space robotics vision

NASA Technical Reports Server (NTRS)

Naka, Masao; Yamamoto, Hiromichi; Homma, Khozo; Iwata, Yoshitaka

1994-01-01

In this paper, we propose a new fuzzy structural matching scheme for space stereo vision which is based on the fuzzy properties of regions of images and effectively reduces the computational burden in the following low level matching process. Three dimensional distance images of a space truss structural model are estimated using this scheme from stereo images sensed by Charge Coupled Device (CCD) TV cameras.

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.

Processing of false belief passages during natural story comprehension: An fMRI study.

PubMed

Kandylaki, Katerina D; Nagels, Arne; Tune, Sarah; Wiese, Richard; Bornkessel-Schlesewsky, Ina; Kircher, Tilo

2015-11-01

The neural correlates of theory of mind (ToM) are typically studied using paradigms which require participants to draw explicit, task-related inferences (e.g., in the false belief task). In a natural setup, such as listening to stories, false belief mentalizing occurs incidentally as part of narrative processing. In our experiment, participants listened to auditorily presented stories with false belief passages (implicit false belief processing) and immediately after each story answered comprehension questions (explicit false belief processing), while neural responses were measured with functional magnetic resonance imaging (fMRI). All stories included (among other situations) one false belief condition and one closely matched control condition. For the implicit ToM processing, we modeled the hemodynamic response during the false belief passages in the story and compared it to the hemodynamic response during the closely matched control passages. For implicit mentalizing, we found activation in typical ToM processing regions, that is the angular gyrus (AG), superior medial frontal gyrus (SmFG), precuneus (PCUN), middle temporal gyrus (MTG) as well as in the inferior frontal gyrus (IFG) billaterally. For explicit ToM, we only found AG activation. The conjunction analysis highlighted the left AG and MTG as well as the bilateral IFG as overlapping ToM processing regions for both implicit and explicit modes. Implicit ToM processing during listening to false belief passages, recruits the left SmFG and billateral PCUN in addition to the "mentalizing network" known form explicit processing tasks. © 2015 Wiley Periodicals, Inc.

Chippy's Computer Words.

ERIC Educational Resources Information Center

Willing, Kathlene R.; Girard, Suzanne

Intended for young children just becoming familiar with computers, this naming book introduces and reinforces new computer vocabulary and concepts. The 20 words are presented alphabetically, along with illustrations, providing room for different activities in which children can match and name the pictures and words. The 20 vocabulary items are…

A Fast Approach to Automatic Detection of Brain Lesions

PubMed Central

Koley, Subhranil; Chakraborty, Chandan; Mainero, Caterina; Fischl, Bruce; Aganj, Iman

2017-01-01

Template matching is a popular approach to computer-aided detection of brain lesions from magnetic resonance (MR) images. The outcomes are often sufficient for localizing lesions and assisting clinicians in diagnosis. However, processing large MR volumes with three-dimensional (3D) templates is demanding in terms of computational resources, hence the importance of the reduction of computational complexity of template matching, particularly in situations in which time is crucial (e.g. emergent stroke). In view of this, we make use of 3D Gaussian templates with varying radii and propose a new method to compute the normalized cross-correlation coefficient as a similarity metric between the MR volume and the template to detect brain lesions. Contrary to the conventional fast Fourier transform (FFT) based approach, whose runtime grows as O(N logN) with the number of voxels, the proposed method computes the cross-correlation in O(N). We show through our experiments that the proposed method outperforms the FFT approach in terms of computational time, and retains comparable accuracy. PMID:29082383

Forensic print extraction using 3D technology and its processing

NASA Astrophysics Data System (ADS)

Rajeev, Srijith; Shreyas, Kamath K. M.; Panetta, Karen; Agaian, Sos S.

2017-05-01

Biometric evidence plays a crucial role in criminal scene analysis. Forensic prints can be extracted from any solid surface such as firearms, doorknobs, carpets and mugs. Prints such as fingerprints, palm prints, footprints and lip-prints can be classified into patent, latent, and three-dimensional plastic prints. Traditionally, law enforcement officers capture these forensic traits using an electronic device or extract them manually, and save the data electronically using special scanners. The reliability and accuracy of the method depends on the ability of the officer or the electronic device to extract and analyze the data. Furthermore, the 2-D acquisition and processing system is laborious and cumbersome. This can lead to the increase in false positive and true negative rates in print matching. In this paper, a method and system to extract forensic prints from any surface, irrespective of its shape, is presented. First, a suitable 3-D camera is used to capture images of the forensic print, and then the 3-D image is processed and unwrapped to obtain 2-D equivalent biometric prints. Computer simulations demonstrate the effectiveness of using 3-D technology for biometric matching of fingerprints, palm prints, and lip-prints. This system can be further extended to other biometric and non-biometric modalities.

The planum temporale as a computational hub.

PubMed

Griffiths, Timothy D; Warren, Jason D

2002-07-01

It is increasingly recognized that the human planum temporale is not a dedicated language processor, but is in fact engaged in the analysis of many types of complex sound. We propose a model of the human planum temporale as a computational engine for the segregation and matching of spectrotemporal patterns. The model is based on segregating the components of the acoustic world and matching these components with learned spectrotemporal representations. Spectrotemporal information derived from such a 'computational hub' would be gated to higher-order cortical areas for further processing, leading to object recognition and the perception of auditory space. We review the evidence for the model and specific predictions that follow from it.

Graph edit distance from spectral seriation.

PubMed

Robles-Kelly, Antonio; Hancock, Edwin R

2005-03-01

This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this, we use a graph spectral seriation method to convert the adjacency matrix into a string or sequence order. We show how the serial ordering can be established using the leading eigenvector of the graph adjacency matrix. We pose the problem of graph-matching as a maximum a posteriori probability (MAP) alignment of the seriation sequences for pairs of graphs. This treatment leads to an expression in which the edit cost is the negative logarithm of the a posteriori sequence alignment probability. We compute the edit distance by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice. The edit costs are determined by the components of the leading eigenvectors of the adjacency matrix and by the edge densities of the graphs being matched. We demonstrate the utility of the edit distance on a number of graph clustering problems.

Efficient and Scalable Cross-Matching of (Very) Large Catalogs

NASA Astrophysics Data System (ADS)

Pineau, F.-X.; Boch, T.; Derriere, S.

2011-07-01

Whether it be for building multi-wavelength datasets from independent surveys, studying changes in objects luminosities, or detecting moving objects (stellar proper motions, asteroids), cross-catalog matching is a technique widely used in astronomy. The need for efficient, reliable and scalable cross-catalog matching is becoming even more pressing with forthcoming projects which will produce huge catalogs in which astronomers will dig for rare objects, perform statistical analysis and classification, or real-time transients detection. We have developed a formalism and the corresponding technical framework to address the challenge of fast cross-catalog matching. Our formalism supports more than simple nearest-neighbor search, and handles elliptical positional errors. Scalability is improved by partitioning the sky using the HEALPix scheme, and processing independently each sky cell. The use of multi-threaded two-dimensional kd-trees adapted to managing equatorial coordinates enables efficient neighbor search. The whole process can run on a single computer, but could also use clusters of machines to cross-match future very large surveys such as GAIA or LSST in reasonable times. We already achieve performances where the 2MASS (˜470M sources) and SDSS DR7 (˜350M sources) can be matched on a single machine in less than 10 minutes. We aim at providing astronomers with a catalog cross-matching service, available on-line and leveraging on the catalogs present in the VizieR database. This service will allow users both to access pre-computed cross-matches across some very large catalogs, and to run customized cross-matching operations. It will also support VO protocols for synchronous or asynchronous queries.

Coupled binary embedding for large-scale image retrieval.

PubMed

Zheng, Liang; Wang, Shengjin; Tian, Qi

2014-08-01

Visual matching is a crucial step in image retrieval based on the bag-of-words (BoW) model. In the baseline method, two keypoints are considered as a matching pair if their SIFT descriptors are quantized to the same visual word. However, the SIFT visual word has two limitations. First, it loses most of its discriminative power during quantization. Second, SIFT only describes the local texture feature. Both drawbacks impair the discriminative power of the BoW model and lead to false positive matches. To tackle this problem, this paper proposes to embed multiple binary features at indexing level. To model correlation between features, a multi-IDF scheme is introduced, through which different binary features are coupled into the inverted file. We show that matching verification methods based on binary features, such as Hamming embedding, can be effectively incorporated in our framework. As an extension, we explore the fusion of binary color feature into image retrieval. The joint integration of the SIFT visual word and binary features greatly enhances the precision of visual matching, reducing the impact of false positive matches. Our method is evaluated through extensive experiments on four benchmark datasets (Ukbench, Holidays, DupImage, and MIR Flickr 1M). We show that our method significantly improves the baseline approach. In addition, large-scale experiments indicate that the proposed method requires acceptable memory usage and query time compared with other approaches. Further, when global color feature is integrated, our method yields competitive performance with the state-of-the-arts.

Fixed-interval matching-to-sample: intermatching time and intermatching error runs1

PubMed Central

Nelson, Thomas D.

1978-01-01

Four pigeons were trained on a matching-to-sample task in which reinforcers followed either the first matching response (fixed interval) or the fifth matching response (tandem fixed-interval fixed-ratio) that occurred 80 seconds or longer after the last reinforcement. Relative frequency distributions of the matching-to-sample responses that concluded intermatching times and runs of mismatches (intermatching error runs) were computed for the final matching responses directly followed by grain access and also for the three matching responses immediately preceding the final match. Comparison of these two distributions showed that the fixed-interval schedule arranged for the preferential reinforcement of matches concluding relatively extended intermatching times and runs of mismatches. Differences in matching accuracy and rate during the fixed interval, compared to the tandem fixed-interval fixed-ratio, suggested that reinforcers following matches concluding various intermatching times and runs of mismatches influenced the rate and accuracy of the last few matches before grain access, but did not control rate and accuracy throughout the entire fixed-interval period. PMID:16812032

Focusing attention on objects of interest using multiple matched filters.

PubMed

Stough, T M; Brodley, C E

2001-01-01

In order to be of use to scientists, large image databases need to be analyzed to create a catalog of the objects of interest. One approach is to apply a multiple tiered search algorithm that uses reduction techniques of increasing computational complexity to select the desired objects from the database. The first tier of this type of algorithm, often called a focus of attention (FOA) algorithm, selects candidate regions from the image data and passes them to the next tier of the algorithm. In this paper we present a new approach to FOA that employs multiple matched filters (MMF), one for each object prototype, to detect the regions of interest. The MMFs are formed using k-means clustering on a set of image patches identified by domain experts as positive examples of objects of interest. An innovation of the approach is to radically reduce the dimensionality of the feature space, used by the k-means algorithm, by taking block averages (spoiling) the sample image patches. The process of spoiling is analyzed and its applicability to other domains is discussed. The combination of the output of the MMFs is achieved through the projection of the detections back into an empty image and then thresholding. This research was motivated by the need to detect small volcanos in the Magellan probe data from Venus. An empirical evaluation of the approach illustrates that a combination of the MMF plus the average filter results in a higher likelihood of 100% detection of the objects of interest at a lower false positive rate than a single matched filter alone.

Learning Optimized Local Difference Binaries for Scalable Augmented Reality on Mobile Devices.

PubMed

Xin Yang; Kwang-Ting Cheng

2014-06-01

The efficiency, robustness and distinctiveness of a feature descriptor are critical to the user experience and scalability of a mobile augmented reality (AR) system. However, existing descriptors are either too computationally expensive to achieve real-time performance on a mobile device such as a smartphone or tablet, or not sufficiently robust and distinctive to identify correct matches from a large database. As a result, current mobile AR systems still only have limited capabilities, which greatly restrict their deployment in practice. In this paper, we propose a highly efficient, robust and distinctive binary descriptor, called Learning-based Local Difference Binary (LLDB). LLDB directly computes a binary string for an image patch using simple intensity and gradient difference tests on pairwise grid cells within the patch. To select an optimized set of grid cell pairs, we densely sample grid cells from an image patch and then leverage a modified AdaBoost algorithm to automatically extract a small set of critical ones with the goal of maximizing the Hamming distance between mismatches while minimizing it between matches. Experimental results demonstrate that LLDB is extremely fast to compute and to match against a large database due to its high robustness and distinctiveness. Compared to the state-of-the-art binary descriptors, primarily designed for speed, LLDB has similar efficiency for descriptor construction, while achieving a greater accuracy and faster matching speed when matching over a large database with 2.3M descriptors on mobile devices.

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

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

Azad, Ariful; Buluc, Aydn; Pothen, Alex

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting pathmore » is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.« less

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

DOE PAGES

Azad, Ariful; Buluc, Aydn; Pothen, Alex

2016-03-24

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting pathmore » is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.« less

Using Computer Technology To Aid the Disabled Reader.

ERIC Educational Resources Information Center

Balajthy, Ernest

When matched for achievement level and educational objectives, computer technology can be particularly effective with at-risk students. Computer-assisted instructional software is the most widely available type of software. An exciting development pertinent to literacy education is the development of the "electronic book" (also called…

Impact of topographic mask models on scanner matching solutions

NASA Astrophysics Data System (ADS)

Tyminski, Jacek K.; Pomplun, Jan; Renwick, Stephen P.

2014-03-01

Of keen interest to the IC industry are advanced computational lithography applications such as Optical Proximity Correction of IC layouts (OPC), scanner matching by optical proximity effect matching (OPEM), and Source Optimization (SO) and Source-Mask Optimization (SMO) used as advanced reticle enhancement techniques. The success of these tasks is strongly dependent on the integrity of the lithographic simulators used in computational lithography (CL) optimizers. Lithographic mask models used by these simulators are key drivers impacting the accuracy of the image predications, and as a consequence, determine the validity of these CL solutions. Much of the CL work involves Kirchhoff mask models, a.k.a. thin masks approximation, simplifying the treatment of the mask near-field images. On the other hand, imaging models for hyper-NA scanner require that the interactions of the illumination fields with the mask topography be rigorously accounted for, by numerically solving Maxwell's Equations. The simulators used to predict the image formation in the hyper-NA scanners must rigorously treat the masks topography and its interaction with the scanner illuminators. Such imaging models come at a high computational cost and pose challenging accuracy vs. compute time tradeoffs. Additional complication comes from the fact that the performance metrics used in computational lithography tasks show highly non-linear response to the optimization parameters. Finally, the number of patterns used for tasks such as OPC, OPEM, SO, or SMO range from tens to hundreds. These requirements determine the complexity and the workload of the lithography optimization tasks. The tools to build rigorous imaging optimizers based on first-principles governing imaging in scanners are available, but the quantifiable benefits they might provide are not very well understood. To quantify the performance of OPE matching solutions, we have compared the results of various imaging optimization trials obtained with Kirchhoff mask models to those obtained with rigorous models involving solutions of Maxwell's Equations. In both sets of trials, we used sets of large numbers of patterns, with specifications representative of CL tasks commonly encountered in hyper-NA imaging. In this report we present OPEM solutions based on various mask models and discuss the models' impact on hyper- NA scanner matching accuracy. We draw conclusions on the accuracy of results obtained with thin mask models vs. the topographic OPEM solutions. We present various examples representative of the scanner image matching for patterns representative of the current generation of IC designs.

Image Understanding Research

DTIC Science & Technology

1981-09-30

to perform a variety of local arithmetic operations. Our initial task will be to use it for computing 5X5 convolutions common to many low level...report presents the results of applying our relaxation based scene matching systein I1] to a new domain - automatic matching of pairs of images. The task...objects (corners of buildings) within the large image. But we did demonstrate the ability of our system to automatically segment, describe, and match

Evaluation of Deep Learning Based Stereo Matching Methods: from Ground to Aerial Images

NASA Astrophysics Data System (ADS)

Liu, J.; Ji, S.; Zhang, C.; Qin, Z.

2018-05-01

Dense stereo matching has been extensively studied in photogrammetry and computer vision. In this paper we evaluate the application of deep learning based stereo methods, which were raised from 2016 and rapidly spread, on aerial stereos other than ground images that are commonly used in computer vision community. Two popular methods are evaluated. One learns matching cost with a convolutional neural network (known as MC-CNN); the other produces a disparity map in an end-to-end manner by utilizing both geometry and context (known as GC-net). First, we evaluate the performance of the deep learning based methods for aerial stereo images by a direct model reuse. The models pre-trained on KITTI 2012, KITTI 2015 and Driving datasets separately, are directly applied to three aerial datasets. We also give the results of direct training on target aerial datasets. Second, the deep learning based methods are compared to the classic stereo matching method, Semi-Global Matching(SGM), and a photogrammetric software, SURE, on the same aerial datasets. Third, transfer learning strategy is introduced to aerial image matching based on the assumption of a few target samples available for model fine tuning. It experimentally proved that the conventional methods and the deep learning based methods performed similarly, and the latter had greater potential to be explored.

Efficient Approximation Algorithms for Weighted $b$-Matching

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

Khan, Arif; Pothen, Alex; Mostofa Ali Patwary, Md.

2016-01-01

We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a specified number b(v) of edges in M are incident on each vertex v. Subject to this restriction we maximize the sum of the weights of the edges in M. We prove that the b-Suitor algorithm computes the same b-Matching as the one obtained by the greedy algorithm for themore » problem. We implement the algorithm on serial and shared-memory parallel processors, and compare its performance against a collection of approximation algorithms that have been proposed for the Matching problem. Our results show that the b-Suitor algorithm outperforms the Greedy and Locally Dominant edge algorithms by one to two orders of magnitude on a serial processor. The b-Suitor algorithm has a high degree of concurrency, and it scales well up to 240 threads on a shared memory multiprocessor. The b-Suitor algorithm outperforms the Locally Dominant edge algorithm by a factor of fourteen on 16 cores of an Intel Xeon multiprocessor.« less

An efficient photogrammetric stereo matching method for high-resolution images

NASA Astrophysics Data System (ADS)

Li, Yingsong; Zheng, Shunyi; Wang, Xiaonan; Ma, Hao

2016-12-01

Stereo matching of high-resolution images is a great challenge in photogrammetry. The main difficulty is the enormous processing workload that involves substantial computing time and memory consumption. In recent years, the semi-global matching (SGM) method has been a promising approach for solving stereo problems in different data sets. However, the time complexity and memory demand of SGM are proportional to the scale of the images involved, which leads to very high consumption when dealing with large images. To solve it, this paper presents an efficient hierarchical matching strategy based on the SGM algorithm using single instruction multiple data instructions and structured parallelism in the central processing unit. The proposed method can significantly reduce the computational time and memory required for large scale stereo matching. The three-dimensional (3D) surface is reconstructed by triangulating and fusing redundant reconstruction information from multi-view matching results. Finally, three high-resolution aerial date sets are used to evaluate our improvement. Furthermore, precise airborne laser scanner data of one data set is used to measure the accuracy of our reconstruction. Experimental results demonstrate that our method remarkably outperforms in terms of time and memory savings while maintaining the density and precision of the 3D cloud points derived.

Using Bayesian Networks for Candidate Generation in Consistency-based Diagnosis

NASA Technical Reports Server (NTRS)

Narasimhan, Sriram; Mengshoel, Ole

2008-01-01

Consistency-based diagnosis relies heavily on the assumption that discrepancies between model predictions and sensor observations can be detected accurately. When sources of uncertainty like sensor noise and model abstraction exist robust schemes have to be designed to make a binary decision on whether predictions are consistent with observations. This risks the occurrence of false alarms and missed alarms when an erroneous decision is made. Moreover when multiple sensors (with differing sensing properties) are available the degree of match between predictions and observations can be used to guide the search for fault candidates. In this paper we propose a novel approach to handle this problem using Bayesian networks. In the consistency- based diagnosis formulation, automatically generated Bayesian networks are used to encode a probabilistic measure of fit between predictions and observations. A Bayesian network inference algorithm is used to compute most probable fault candidates.

Fluid flow through the larynx channel

NASA Astrophysics Data System (ADS)

Miller, J. A.; Pereira, J. C.; Thomas, D. W.

1988-03-01

The classic two-mass model of the larynx channel is extended by including the false vocal folds and the laryngeal ventricle. Several glottis profiles are postulated to exist which are the result of the forces applied to the mucus membrane due to intraglottal pressure variation. These profiles constrain the air flow which allows the formation of one or two "venae contractae". The location of these influences the pressure in the glottis and layrngeal ventricle and also gives rise to additional viscous losses as well as losses due to flow enlargement. Sampled waveforms are calculated from the model for volume velocity, glottal area, Reynolds number and fluid forces over the vocal folds for various profiles. Results show that the computed waveforms agree with physiological data [1,2] and that it is not necessary to use any empirical constants to match the simulation results. Also, the onset of phonation is shown to be possible either with abduction or adduction of the vocal folds.

An adaptive clustering algorithm for image matching based on corner feature

NASA Astrophysics Data System (ADS)

Wang, Zhe; Dong, Min; Mu, Xiaomin; Wang, Song

2018-04-01

The traditional image matching algorithm always can not balance the real-time and accuracy better, to solve the problem, an adaptive clustering algorithm for image matching based on corner feature is proposed in this paper. The method is based on the similarity of the matching pairs of vector pairs, and the adaptive clustering is performed on the matching point pairs. Harris corner detection is carried out first, the feature points of the reference image and the perceived image are extracted, and the feature points of the two images are first matched by Normalized Cross Correlation (NCC) function. Then, using the improved algorithm proposed in this paper, the matching results are clustered to reduce the ineffective operation and improve the matching speed and robustness. Finally, the Random Sample Consensus (RANSAC) algorithm is used to match the matching points after clustering. The experimental results show that the proposed algorithm can effectively eliminate the most wrong matching points while the correct matching points are retained, and improve the accuracy of RANSAC matching, reduce the computation load of whole matching process at the same time.

An Absorbing Boundary Condition for the Lattice Boltzmann Method Based on the Perfectly Matched Layer

PubMed Central

Najafi-Yazdi, A.; Mongeau, L.

2012-01-01

The Lattice Boltzmann Method (LBM) is a well established computational tool for fluid flow simulations. This method has been recently utilized for low Mach number computational aeroacoustics. Robust and nonreflective boundary conditions, similar to those used in Navier-Stokes solvers, are needed for LBM-based aeroacoustics simulations. The goal of the present study was to develop an absorbing boundary condition based on the perfectly matched layer (PML) concept for LBM. The derivation of formulations for both two and three dimensional problems are presented. The macroscopic behavior of the new formulation is discussed. The new formulation was tested using benchmark acoustic problems. The perfectly matched layer concept appears to be very well suited for LBM, and yielded very low acoustic reflection factor. PMID:23526050

Rigid shape matching by segmentation averaging.

PubMed

Wang, Hongzhi; Oliensis, John

2010-04-01

We use segmentations to match images by shape. The new matching technique does not require point-to-point edge correspondence and is robust to small shape variations and spatial shifts. To address the unreliability of segmentations computed bottom-up, we give a closed form approximation to an average over all segmentations. Our method has many extensions, yielding new algorithms for tracking, object detection, segmentation, and edge-preserving smoothing. For segmentation, instead of a maximum a posteriori approach, we compute the "central" segmentation minimizing the average distance to all segmentations of an image. For smoothing, instead of smoothing images based on local structures, we smooth based on the global optimal image structures. Our methods for segmentation, smoothing, and object detection perform competitively, and we also show promising results in shape-based tracking.

Research on rolling element bearing fault diagnosis based on genetic algorithm matching pursuit

NASA Astrophysics Data System (ADS)

Rong, R. W.; Ming, T. F.

2017-12-01

In order to solve the problem of slow computation speed, matching pursuit algorithm is applied to rolling bearing fault diagnosis, and the improvement are conducted from two aspects that are the construction of dictionary and the way to search for atoms. To be specific, Gabor function which can reflect time-frequency localization characteristic well is used to construct the dictionary, and the genetic algorithm to improve the searching speed. A time-frequency analysis method based on genetic algorithm matching pursuit (GAMP) algorithm is proposed. The way to set property parameters for the improvement of the decomposition results is studied. Simulation and experimental results illustrate that the weak fault feature of rolling bearing can be extracted effectively by this proposed method, at the same time, the computation speed increases obviously.

Three-dimensional object surface identification

NASA Astrophysics Data System (ADS)

Celenk, Mehmet

1995-03-01

This paper describes a computationally efficient matching method for inspecting 3D objects using their serial cross sections. Object regions of interest in cross-sectional binary images of successive slices are aligned with those of the models. Cross-sectional differences between the object and the models are measured in the direction of the gradient of the cross section boundary. This is repeated in all the cross-sectional images. The model with minimum average cross-sectional difference is selected as the best match to the given object (i.e., no defect). The method is tested using various computer generated surfaces and matching results are presented. It is also demonstrated using Symult S-2010 16-node system that the method is suitable for parallel implementation in massage passing processors with the maximum attainable speedup (close to 16 for S-2010).

Evaluation of Content-Matched Range Monitoring Queries over Moving Objects in Mobile Computing Environments

PubMed Central

Jung, HaRim; Song, MoonBae; Youn, Hee Yong; Kim, Ung Mo

2015-01-01

A content-matched (CM) range monitoring query over moving objects continually retrieves the moving objects (i) whose non-spatial attribute values are matched to given non-spatial query values; and (ii) that are currently located within a given spatial query range. In this paper, we propose a new query indexing structure, called the group-aware query region tree (GQR-tree) for efficient evaluation of CM range monitoring queries. The primary role of the GQR-tree is to help the server leverage the computational capabilities of moving objects in order to improve the system performance in terms of the wireless communication cost and server workload. Through a series of comprehensive simulations, we verify the superiority of the GQR-tree method over the existing methods. PMID:26393613

Cross-matching: a modified cross-correlation underlying threshold energy model and match-based depth perception

PubMed Central

Doi, Takahiro; Fujita, Ichiro

2014-01-01

Three-dimensional visual perception requires correct matching of images projected to the left and right eyes. The matching process is faced with an ambiguity: part of one eye's image can be matched to multiple parts of the other eye's image. This stereo correspondence problem is complicated for random-dot stereograms (RDSs), because dots with an identical appearance produce numerous potential matches. Despite such complexity, human subjects can perceive a coherent depth structure. A coherent solution to the correspondence problem does not exist for anticorrelated RDSs (aRDSs), in which luminance contrast is reversed in one eye. Neurons in the visual cortex reduce disparity selectivity for aRDSs progressively along the visual processing hierarchy. A disparity-energy model followed by threshold nonlinearity (threshold energy model) can account for this reduction, providing a possible mechanism for the neural matching process. However, the essential computation underlying the threshold energy model is not clear. Here, we propose that a nonlinear modification of cross-correlation, which we term “cross-matching,” represents the essence of the threshold energy model. We placed half-wave rectification within the cross-correlation of the left-eye and right-eye images. The disparity tuning derived from cross-matching was attenuated for aRDSs. We simulated a psychometric curve as a function of graded anticorrelation (graded mixture of aRDS and normal RDS); this simulated curve reproduced the match-based psychometric function observed in human near/far discrimination. The dot density was 25% for both simulation and observation. We predicted that as the dot density increased, the performance for aRDSs should decrease below chance (i.e., reversed depth), and the level of anticorrelation that nullifies depth perception should also decrease. We suggest that cross-matching serves as a simple computation underlying the match-based disparity signals in stereoscopic depth perception. PMID:25360107

Maximized gust loads for a nonlinear airplane using matched filter theory and constrained optimization

NASA Technical Reports Server (NTRS)

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

1991-01-01

Two matched filter theory based schemes are described and illustrated for obtaining maximized and time correlated gust loads for a nonlinear aircraft. The first scheme is computationally fast because it uses a simple 1-D search procedure to obtain its answers. The second scheme is computationally slow because it uses a more complex multi-dimensional search procedure to obtain its answers, but it consistently provides slightly higher maximum loads than the first scheme. Both schemes are illustrated with numerical examples involving a nonlinear control system.

Maximized gust loads for a nonlinear airplane using matched filter theory and constrained optimization

NASA Technical Reports Server (NTRS)

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

1991-01-01

This paper describes and illustrates two matched-filter-theory based schemes for obtaining maximized and time-correlated gust-loads for a nonlinear airplane. The first scheme is computationally fast because it uses a simple one-dimensional search procedure to obtain its answers. The second scheme is computationally slow because it uses a more complex multidimensional search procedure to obtain its answers, but it consistently provides slightly higher maximum loads than the first scheme. Both schemes are illustrated with numerical examples involving a nonlinear control system.

Concentrating on beauty: sexual selection and sociospatial memory.

PubMed

Becker, D Vaughn; Kenrick, Douglas T; Guerin, Stephen; Maner, Jon K

2005-12-01

In three experiments, location memory for faces was examined using a computer version of the matching game Concentration. Findings suggested that physical attractiveness led to more efficient matching for female faces but not for male faces. Study 3 revealed this interaction despite allowing participants to initially see, attend to, and match the attractive male faces in the first few turns. Analysis of matching errors suggested that, compared to other targets, attractive women were less confusable with one another. Results are discussed in terms of the different functions that attractiveness serves for men and women.

SU-E-T-399: Evaluation of Selection Criteria for Computational Human Phantoms for Use in Out-Of-Field Organ Dosimetry for Radiotherapy Patients

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

Pelletier, C; Jung, J; Lee, C

2015-06-15

Purpose: To quantify the dosimetric uncertainty due to organ position errors when using height and weight as phantom selection criteria in the UF/NCI Hybrid Phantom Library for the purpose of out-of-field organ dose reconstruction. Methods: Four diagnostic patient CT images were used to create 7-field IMRT plans. For each patient, dose to the liver, right lung, and left lung were calculated using the XVMC Monte Carlo code. These doses were taken to be the ground truth. For each patient, the phantom with the most closely matching height and weight was selected from the body size dependent phantom library. The patientmore » plans were then transferred to the computational phantoms and organ doses were recalculated. Each plan was also run on 4 additional phantoms with reference heights and or weights. Maximum and mean doses for the three organs were computed, and the DVHs were extracted and compared. One sample t-tests were performed to compare the accuracy of the height and weight matched phantoms against the additional phantoms in regards to both maximum and mean dose. Results: For one of the patients, the height and weight matched phantom yielded the most accurate results across all three organs for both maximum and mean doses. For two additional patients, the matched phantom yielded the best match for one organ only. In 13 of the 24 cases, the matched phantom yielded better results than the average of the other four phantoms, though the results were only statistically significant at the .05 level for three cases. Conclusion: Using height and weight matched phantoms does yield better results in regards to out-of-field dosimetry than using average phantoms. Height and weight appear to be moderately good selection criteria, though this selection criteria failed to yield any better results for one patient.« less

Development of a laser-guided embedded-computer-controlled air-assisted precision sprayer

USDA-ARS?s Scientific Manuscript database

An embedded computer-controlled, laser-guided, air-assisted, variable-rate precision sprayer was developed to automatically adjust spray outputs on both sides of the sprayer to match presence, size, shape, and foliage density of tree crops. The sprayer was the integration of an embedded computer, a ...