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

Directory of Open Access Journals (Sweden)

Andri Anto Tri Susilo

2018-01-01

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

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

Science.gov (United States)

2010-11-05

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

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

Science.gov (United States)

2012-04-25

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

Fabrication of rigid and flexible refractive-index-matched flow phantoms for flow visualisation and optical flow measurements

Science.gov (United States)

Geoghegan, P. H.; Buchmann, N. A.; Spence, C. J. T.; Moore, S.; Jermy, M.

2012-05-01

A method for the construction of both rigid and compliant (flexible) transparent flow phantoms of biological flow structures, suitable for PIV and other optical flow methods with refractive-index-matched working fluid is described in detail. Methods for matching the in vivo compliance and elastic wave propagation wavelength are presented. The manipulation of MRI and CT scan data through an investment casting mould is described. A method for the casting of bubble-free phantoms in silicone elastomer is given. The method is applied to fabricate flexible phantoms of the carotid artery (with and without stenosis), the carotid artery bifurcation (idealised and patient-specific) and the human upper airway (nasal cavity). The fidelity of the phantoms to the original scan data is measured, and it is shown that the cross-sectional error is less than 5% for phantoms of simple shape but up to 16% for complex cross-sectional shapes such as the nasal cavity. This error is mainly due to the application of a PVA coating to the inner mould and can be reduced by shrinking the digital model. Sixteen per cent variation in area is less than the natural patient to patient variation of the physiological geometries. The compliance of the phantom walls is controlled within physiologically realistic ranges, by choice of the wall thickness, transmural pressure and Young's modulus of the elastomer. Data for the dependence of Young's modulus on curing temperature are given for Sylgard 184. Data for the temperature dependence of density, viscosity and refractive index of the refractive-index-matched working liquid (i.e. water-glycerol mixtures) are also presented.

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

Science.gov (United States)

2012-04-25

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

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

Science.gov (United States)

2013-01-08

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

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

Science.gov (United States)

2013-03-12

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

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

Science.gov (United States)

2012-02-08

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

A Technology Based Program That Matches Enrichment Resources With Student Strengths

Directory of Open Access Journals (Sweden)

J.S. Renzulli

2007-09-01

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

Object-based connectedness facilitates matching

NARCIS (Netherlands)

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

2003-01-01

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

Hybrid-Based Dense Stereo Matching

Science.gov (United States)

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

2016-06-01

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

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

NARCIS (Netherlands)

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

2013-01-01

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

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

NARCIS (Netherlands)

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

2013-01-01

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

Flow Formulations for Curriculum-based Course Timetabling

DEFF Research Database (Denmark)

Bagger, Niels-Christian Fink; Kristiansen, Simon; Sørensen, Matias

2017-01-01

lower bound on one data instance in the benchmark data set from the second international timetabling competition. Regarding upper bounds, the formulation based on the minimum cost flow problem performs better on average than other mixed integer programming approaches for the CTT.......In this paper we present two mixed-integer programming formulations for the Curriculum based Course Timetabling Problem (CTT). We show that the formulations contain underlying network structures by dividing the CTT into two separate models and then connect the two models using flow formulation...... techniques. The first mixed-integer programming formulation is based on an underlying minimum cost flow problem, which decreases the number of integer variables significantly and improves the performance compared to an intuitive mixed-integer programming formulation. The second formulation is based...

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

Science.gov (United States)

2011-08-15

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

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

DEFF Research Database (Denmark)

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

2008-01-01

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

Petri Nets Based Modelling of Control Flow for Memory-Aid Interactive Programs in Telemedicine

CERN Document Server

Khoromskaia, V K

2004-01-01

Petri Nets (PN) based modelling of the control flow for the interactive memory assistance programs designed for personal pocket computers and having special requirements for robustness is considered. The proposed concept allows one to elaborate the programs which can give users a variety of possibilities for a day-time planning in the presence of environmental and time restrictions. First, a PN model for a known simple algorithm is constructed and analyzed using the corresponding state equations and incidence matrix. Then a PN graph for a complicated algorithm with overlapping actions and choice possibilities is designed, supplemented by an example of its analysis. Dynamic behaviour of this graph is tested by tracing of all possible paths of the flow of control using the PN simulator. It is shown that PN based modelling provides reliably predictable performance of interactive algorithms with branched structures and concurrency requirements.

Image matching navigation based on fuzzy information

Institute of Scientific and Technical Information of China (English)

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

2003-01-01

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

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

Science.gov (United States)

Walvoord, Mark E.; Pleitz, Jacob D.

2016-01-01

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

Subchannel analysis program for boiling water reactor fuel bundles based on five conservation equations of two-phase flow

International Nuclear Information System (INIS)

Bessho, Y.; Uchikawa, S.

1985-01-01

A subchannel analysis program, MENUETT, is developed for evaluation of thermal-hydraulic characteristics in boiling water reactor fuel bundles. This program is based on five conservation equations of two-phase flow with the drift-flux correlation. The cross flows are calculated separately for liquid and vapor phases from the lateral momentum conservation equation. The effects of turbulent mixing and void drift are accounted for in the program. The conservation equations are implicitly differentiated with the convective terms by the donor-cell method, and are solved iteratively in the axial and lateral directions. Data of the 3 X 3 rod bundle experiments are used for program verification. The lateral distributions of equilibrium quality and mass flow rate at the bundle exit calculated by the program compare satisfactorily with the experimental results

Second Order Cone Programming (SOCP) Relaxation Based Optimal Power Flow with Hybrid VSC-HVDC Transmission and Active Distribution Networks

DEFF Research Database (Denmark)

Ding, Tao; Li, Cheng; Yang, Yongheng

2017-01-01

The detailed topology of renewable resource bases may have the impact on the optimal power flow of the VSC-HVDC transmission network. To address this issue, this paper develops an optimal power flow with the hybrid VSC-HVDC transmission and active distribution networks to optimally schedule...... the generation output and voltage regulation of both networks, which leads to a non-convex programming model. Furthermore, the non-convex power flow equations are based on the Second Order Cone Programming (SOCP) relaxation approach. Thus, the proposed model can be relaxed to a SOCP that can be tractably solved...

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

Science.gov (United States)

2013-03-12

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

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

Science.gov (United States)

2012-12-20

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

Learning Based Approach for Optimal Clustering of Distributed Program's Call Flow Graph

Science.gov (United States)

Abofathi, Yousef; Zarei, Bager; Parsa, Saeed

Optimal clustering of call flow graph for reaching maximum concurrency in execution of distributable components is one of the NP-Complete problems. Learning automatas (LAs) are search tools which are used for solving many NP-Complete problems. In this paper a learning based algorithm is proposed to optimal clustering of call flow graph and appropriate distributing of programs in network level. The algorithm uses learning feature of LAs to search in state space. It has been shown that the speed of reaching to solution increases remarkably using LA in search process, and it also prevents algorithm from being trapped in local minimums. Experimental results show the superiority of proposed algorithm over others.

Fractional Order Element Based Impedance Matching

KAUST Repository

Radwan, Ahmed Gomaa

2014-06-24

Disclosed are various embodiments of methods and systems related to fractional order element based impedance matching. In one embodiment, a method includes aligning a traditional Smith chart (|.alpha.|=1) with a fractional order Smith chart (|.alpha.|.noteq.1). A load impedance is located on the traditional Smith chart and projected onto the fractional order Smith chart. A fractional order matching element is determined by transitioning along a matching circle of the fractional order Smith chart based at least in part upon characteristic line impedance. In another embodiment, a system includes a fractional order impedance matching application executed in a computing device. The fractional order impedance matching application includes logic that obtains a first set of Smith chart coordinates at a first order, determines a second set of Smith chart coordinates at a second order, and determines a fractional order matching element from the second set of Smith chart coordinates.

MATCH package for the ANL three-view geometry program

International Nuclear Information System (INIS)

Gieraltowski, G.F.

1976-02-01

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

Matching score based face recognition

NARCIS (Netherlands)

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

2006-01-01

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

Effective flow-accelerated corrosion programs in nuclear facilities

International Nuclear Information System (INIS)

Esselman, Thomas C.; McBrine, William J.

2004-01-01

Piping Flow-Accelerated Corrosion Programs in nuclear power generation facilities are classically comprised of the selection of inspection locations with the assistance of a predictive methodology such as the Electric Power Research Institute computer codes CHECMATE or CHECWORKS, performing inspections, conducting structural evaluations on the inspected components, and implementing the appropriate sample expansion and corrective actions. Performing such a sequence of steps can be effective in identifying thinned components and implementing appropriate short term and long term actions necessary to resolve flow-accelerated corrosion related problems. A maximally effective flow-accelerated corrosion (FAC) program requires an understanding of many programmatic details. These include the procedural control of the program, effective use of historical information, managing the activities performed during a limited duration outage, allocating resources based on risk allocation, having an acute awareness of how the plant is operated, investigating components removed from the plant, and several others. This paper will describe such details and methods that will lead to a flow-accelerated corrosion program that effectively minimizes the risk of failure due to flow-accelerated corrosion and provide full and complete documentation of the program. (author)

Fast image matching algorithm based on projection characteristics

Science.gov (United States)

Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun

2011-06-01

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

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

International Nuclear Information System (INIS)

Jack S. Brenizer, Jr.

2003-01-01

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

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

Science.gov (United States)

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

2015-01-01

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

Landmark matching based retinal image alignment by enforcing sparsity in correspondence matrix.

Science.gov (United States)

Zheng, Yuanjie; Daniel, Ebenezer; Hunter, Allan A; Xiao, Rui; Gao, Jianbin; Li, Hongsheng; Maguire, Maureen G; Brainard, David H; Gee, James C

2014-08-01

Retinal image alignment is fundamental to many applications in diagnosis of eye diseases. In this paper, we address the problem of landmark matching based retinal image alignment. We propose a novel landmark matching formulation by enforcing sparsity in the correspondence matrix and offer its solutions based on linear programming. The proposed formulation not only enables a joint estimation of the landmark correspondences and a predefined transformation model but also combines the benefits of the softassign strategy (Chui and Rangarajan, 2003) and the combinatorial optimization of linear programming. We also introduced a set of reinforced self-similarities descriptors which can better characterize local photometric and geometric properties of the retinal image. Theoretical analysis and experimental results with both fundus color images and angiogram images show the superior performances of our algorithms to several state-of-the-art techniques. Copyright © 2013 Elsevier B.V. All rights reserved.

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

Science.gov (United States)

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

2017-07-01

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

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

Science.gov (United States)

Ronald E. Coleman

1977-01-01

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

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

Science.gov (United States)

2012-06-01

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

Efficient line matching with homography

Science.gov (United States)

Shen, Yan; Dai, Yuxing; Zhu, Zhiliang

2018-03-01

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

PIV study of flow through porous structure using refractive index matching

Science.gov (United States)

Häfeli, Richard; Altheimer, Marco; Butscher, Denis; Rudolf von Rohr, Philipp

2014-05-01

An aqueous solution of sodium iodide and zinc iodide is proposed as a fluid that matches the refractive index of a solid manufactured by rapid prototyping. This enabled optical measurements in single-phase flow through porous structures. Experiments were also done with an organic index-matching fluid (anisole) in porous structures of different dimensions. To compare experiments with different viscosities and dimensions, we employed Reynolds similarity to deduce the scaling laws. One of the target quantities of our investigation was the dissipation rate of turbulent kinetic energy. Different models for the dissipation rate estimation were evaluated by comparing isotropy ratios. As in many other studies also, our experiments were not capable of resolving the velocity field down to the Kolmogorov length scale, and therefore, the dissipation rate has to be considered as underestimated. This is visible in experiments of different relative resolutions. However, being near the Kolmogorov scale allows estimating a reproducible, yet underestimated spatial distribution of dissipation rate inside the porous structure. Based on these results, the model was used to estimate the turbulent diffusivity. Comparing it to the dispersion coefficient obtained in the same porous structure, we conclude that even at the turbulent diffusivity makes up only a small part of mass transfer in axial direction. The main part is therefore attributed to Taylor dispersion.

Analysis of an Online Match Discussion Board: Improving the Otolaryngology—Head and Neck Surgery Match

Science.gov (United States)

Kozin, Elliott D.; Sethi, Rosh; Lehmann, Ashton; Remenschneider, Aaron K.; Golub, Justin S.; Reyes, Samuel A.; Emerick, Kevin; Lee, Daniel J.; Gray, Stacey T.

2015-01-01

Introduction “The Match” has become the accepted selection process for graduate medical education. Otomatch.com has provided an online forum for Otolaryngology-Head and Neck Surgery (OHNS) Match-related questions for over a decade. Herein, we aim to 1) delineate the types of posts on Otomatch to better understand the perspective of medical students applying for residency and 2) provide recommendations to potentially improve the Match process. Methods Discussion forum posts on Otomatch between December 2001 and April 2014 were reviewed. The title of each thread and total number of views were recorded for quantitative analysis. Each thread was organized into one of six major categories and one of eighteen subcategories, based on chronology within the application cycle and topic. National Resident Matching Program (NRMP) data were utilized for comparison. Results We identified 1,921 threads corresponding to over 2 million page views. Over 40% of threads related to questions about specific programs, and 27% were discussions about interviews. Views, a surrogate measure for popularity, reflected different trends. The majority of individuals viewed posts on interviews (42%), program specific questions (20%) and how to rank programs (11%). Increase in viewership tracked with a rise in applicant numbers based on NRMP data. Conclusions Our study provides an in depth analysis of a popular discussion forum for medical students interested in the OHNS Match. The most viewed posts are about interview dates and questions regarding specific programs. We provide suggestions to address unmet needs for medical students and potentially improve the Match process. PMID:25550223

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

Directory of Open Access Journals (Sweden)

Michael A. Gisondi

2017-05-01

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

Design and development of PLC based offline impedance matching system for ICRH experiment

International Nuclear Information System (INIS)

Joshi, Ramesh; Jadav, H.M.; Mali, Aniruddh; Kulkarni, S.V.

2015-01-01

Ion Cyclotron Resonance Heating (ICRH) transmission line has two impedance matching networks, one for offline matching which has been employed before experimental shot. Another is online impedance matching which has been employed during experimental shot. Offline matching network consists of two static stubs, coarse tuner and coarse phase shifter identical in both transmission lines. There are motorized arrangement installed in each stubs and phase shifters. Both stubs are being used to vary transmission line length. Phase shifter is used to match the frequency of generated RF power. Programmable Logic Controller (PLC) based automation and control technique has been designed and developed for the system. Offline matching should be operated below 1 kHz frequency in order to move stepper motors. Program generates required square pulses which employed to motor controller to move either in upward or downward direction. In existing system this operation has been carried out using VME. To reduce the load on VME, PLC based system has been designed and integrated with main DAC system. WinCC software has been used (as SCADA/HMI) to develop front end GUI which communicates with OPC server. Further, OPC communicates with PLC for control of motorized arrangement. This paper describes technical details,design and development of PLC based offline matching system using WinCC as user interface. The communication between WinCC application and hardware devices was realized by OPC technique. The developed system has friendly graphical user interface, high-level automation and comprehensive function such as experimental process control. The system was proved to be reliable and accurate in practical application. (author)

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

Science.gov (United States)

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

2016-01-01

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

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

Science.gov (United States)

2010-08-30

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

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

Science.gov (United States)

2013-11-27

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

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

Science.gov (United States)

2010-08-30

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

Linear Programming and Network Flows

CERN Document Server

Bazaraa, Mokhtar S; Sherali, Hanif D

2011-01-01

The authoritative guide to modeling and solving complex problems with linear programming-extensively revised, expanded, and updated The only book to treat both linear programming techniques and network flows under one cover, Linear Programming and Network Flows, Fourth Edition has been completely updated with the latest developments on the topic. This new edition continues to successfully emphasize modeling concepts, the design and analysis of algorithms, and implementation strategies for problems in a variety of fields, including industrial engineering, management science, operations research

Options for refractive index and viscosity matching to study variable density flows

Science.gov (United States)

Clément, Simon A.; Guillemain, Anaïs; McCleney, Amy B.; Bardet, Philippe M.

2018-02-01

Variable density flows are often studied by mixing two miscible aqueous solutions of different densities. To perform optical diagnostics in such environments, the refractive index of the fluids must be matched, which can be achieved by carefully choosing the two solutes and the concentration of the solutions. To separate the effects of buoyancy forces and viscosity variations, it is desirable to match the viscosity of the two solutions in addition to their refractive index. In this manuscript, several pairs of index matched fluids are compared in terms of viscosity matching, monetary cost, and practical use. Two fluid pairs are studied in detail, with two aqueous solutions (binary solutions of water and a salt or alcohol) mixed into a ternary solution. In each case: an aqueous solution of isopropanol mixed with an aqueous solution of sodium chloride (NaCl) and an aqueous solution of glycerol mixed with an aqueous solution of sodium sulfate (Na_2SO_4). The first fluid pair allows reaching high-density differences at low cost, but brings a large difference in dynamic viscosity. The second allows matching dynamic viscosity and refractive index simultaneously, at reasonable cost. For each of these four solutes, the density, kinematic viscosity, and refractive index are measured versus concentration and temperature, as well as wavelength for the refractive index. To investigate non-linear effects when two index-matched, binary solutions are mixed, the ternary solutions formed are also analyzed. Results show that density and refractive index follow a linear variation with concentration. However, the viscosity of the isopropanol and NaCl pair deviates from the linear law and has to be considered. Empirical correlations and their coefficients are given to create index-matched fluids at a chosen temperature and wavelength. Finally, the effectiveness of the refractive index matching is illustrated with particle image velocimetry measurements performed for a buoyant jet in a

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

Science.gov (United States)

2013-06-10

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

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

Science.gov (United States)

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

2012-03-01

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

Computer program for compressible flow network analysis

Science.gov (United States)

Wilton, M. E.; Murtaugh, J. P.

1973-01-01

Program solves problem of an arbitrarily connected one dimensional compressible flow network with pumping in the channels and momentum balancing at flow junctions. Program includes pressure drop calculations for impingement flow and flow through pin fin arrangements, as currently found in many air cooled turbine bucket and vane cooling configurations.

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

Directory of Open Access Journals (Sweden)

Holly Cronau

2004-02-01

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

Theory of fractional order elements based impedance matching networks

KAUST Repository

Radwan, Ahmed G.

2011-03-01

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

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

International Nuclear Information System (INIS)

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

2015-01-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2015-07-01

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

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

Science.gov (United States)

2010-02-01

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

Semantic Data Matching: Principles and Performance

Science.gov (United States)

Deaton, Russell; Doan, Thao; Schweiger, Tom

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

DOE Matching Grant Program

International Nuclear Information System (INIS)

Tsoukalas, L.

2002-01-01

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

Different elution modes and field programming in gravitational field-flow fractionation. III. Field programming by flow-rate gradient generated by a programmable pump.

Science.gov (United States)

Plocková, J; Chmelík, J

2001-05-25

Gravitational field-flow fractionation (GFFF) utilizes the Earth's gravitational field as an external force that causes the settlement of particles towards the channel accumulation wall. Hydrodynamic lift forces oppose this action by elevating particles away from the channel accumulation wall. These two counteracting forces enable modulation of the resulting force field acting on particles in GFFF. In this work, force-field programming based on modulating the magnitude of hydrodynamic lift forces was implemented via changes of flow-rate, which was accomplished by a programmable pump. Several flow-rate gradients (step gradients, linear gradients, parabolic, and combined gradients) were tested and evaluated as tools for optimization of the separation of a silica gel particle mixture. The influence of increasing amount of sample injected on the peak resolution under flow-rate gradient conditions was also investigated. This is the first time that flow-rate gradients have been implemented for programming of the resulting force field acting on particles in GFFF.

Base Flow Model Validation, Phase II

Data.gov (United States)

National Aeronautics and Space Administration — The program focuses on turbulence modeling enhancements for predicting high-speed rocket base flows. A key component of the effort is the collection of high-fidelity...

Home-based intermediate care program vs hospitalization

Science.gov (United States)

Armstrong, Catherine Deri; Hogg, William E.; Lemelin, Jacques; Dahrouge, Simone; Martin, Carmel; Viner, Gary S.; Saginur, Raphael

2008-01-01

OBJECTIVE To explore whether a home-based intermediate care program in a large Canadian city lowers the cost of care and to look at whether such home-based programs could be a solution to the increasing demands on Canadian hospitals. DESIGN Single-arm study with historical controls. SETTING Department of Family Medicine at the Ottawa Hospital (Civic campus) in Ontario. PARTICIPANTS Patients requiring hospitalization for acute care. Participants were matched with historical controls based on case-mix, most responsible diagnosis, and level of complexity. INTERVENTIONS Placement in the home-based intermediate care program. Daily home visits from the nurse practitioner and 24-hour access to care by telephone. MAIN OUTCOME MEASURES Multivariate regression models were used to estimate the effect of the program on 5 outcomes: length of stay in hospital, cost of care substituted for hospitalization (Canadian dollars), readmission for a related diagnosis, readmission for any diagnosis, and costs incurred by community home-care services for patients following discharge from hospital. RESULTS The outcomes of 43 hospital admissions were matched with those of 363 controls. Patients enrolled in the program stayed longer in hospital (coefficient 3.3 days, P costs of home-based care were not significantly different from the costs of hospitalization (coefficient -$501, P = .11). CONCLUSION While estimated cost savings were not statistically significant, the limitations of our study suggest that we underestimated these savings. In particular, the economic inefficiencies of a small immature program and the inability to control for certain factors when selecting historical controls affected our results. Further research is needed to determine the economic effect of mature home-based programs. PMID:18208958

Graph configuration model based evaluation of the education-occupation match.

Science.gov (United States)

Gadar, Laszlo; Abonyi, Janos

2018-01-01

To study education-occupation matchings we developed a bipartite network model of education to work transition and a graph configuration model based metric. We studied the career paths of 15 thousand Hungarian students based on the integrated database of the National Tax Administration, the National Health Insurance Fund, and the higher education information system of the Hungarian Government. A brief analysis of gender pay gap and the spatial distribution of over-education is presented to demonstrate the background of the research and the resulted open dataset. We highlighted the hierarchical and clustered structure of the career paths based on the multi-resolution analysis of the graph modularity. The results of the cluster analysis can support policymakers to fine-tune the fragmented program structure of higher education.

Towards Domain-specific Flow-based Languages

DEFF Research Database (Denmark)

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

2018-01-01

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

The open-pit truck dispatching method based on the completion of production target and the truck flow saturation

Energy Technology Data Exchange (ETDEWEB)

Xing, J.; Sun, X. [Northeastern University, Shenyang (China)

2007-05-15

To address current problems in the 'modular dispatch' dynamic programming system widely used in open-pit truck real-time dispatching, two concepts for meeting production targets and truck flow saturation were proposed. Using truck flow programming and taking into account stochastic factors and transportation distance, truck real-time dispatching was optimised. The method is applicable to both shovel-truck match and mismatching and also to empty and heavy truck dispatching. In an open-pit mine the production efficiency could be increased by between 8% and 18%. 6 refs.

Image Relaxation Matching Based on Feature Points for DSM Generation

Institute of Scientific and Technical Information of China (English)

ZHENG Shunyi; ZHANG Zuxun; ZHANG Jianqing

2004-01-01

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

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

Science.gov (United States)

2012-12-18

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

3-D FEATURE-BASED MATCHING BY RSTG APPROACH

Directory of Open Access Journals (Sweden)

J.-J. Jaw

2012-07-01

Full Text Available 3-D feature matching is the essential kernel in a fully automated feature-based LiDAR point cloud registration. After feasible procedures of feature acquisition, connecting corresponding features in different data frames is imperative to be solved. The objective addressed in this paper is developing an approach coined RSTG to retrieve corresponding counterparts of unsorted multiple 3-D features extracted from sets of LiDAR point clouds. RSTG stands for the four major processes, "Rotation alignment"; "Scale estimation"; "Translation alignment" and "Geometric check," strategically formulated towards finding out matching solution with high efficiency and leading to accomplishing the 3-D similarity transformation among all sets. The workable types of features to RSTG comprise points, lines, planes and clustered point groups. Each type of features can be employed exclusively or combined with others, if sufficiently supplied, throughout the matching scheme. The paper gives a detailed description of the matching methodology and discusses on the matching effects based on the statistical assessment which revealed that the RSTG approach reached an average matching rate of success up to 93% with around 6.6% of statistical type 1 error. Notably, statistical type 2 error, the critical indicator of matching reliability, was kept 0% throughout all the experiments.

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

Science.gov (United States)

2013-07-29

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

A coarse to fine minutiae-based latent palmprint matching.

Science.gov (United States)

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

2013-10-01

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

Semantic Edge Based Disparity Estimation Using Adaptive Dynamic Programming for Binocular Sensors.

Science.gov (United States)

Zhu, Dongchen; Li, Jiamao; Wang, Xianshun; Peng, Jingquan; Shi, Wenjun; Zhang, Xiaolin

2018-04-03

Disparity calculation is crucial for binocular sensor ranging. The disparity estimation based on edges is an important branch in the research of sparse stereo matching and plays an important role in visual navigation. In this paper, we propose a robust sparse stereo matching method based on the semantic edges. Some simple matching costs are used first, and then a novel adaptive dynamic programming algorithm is proposed to obtain optimal solutions. This algorithm makes use of the disparity or semantic consistency constraint between the stereo images to adaptively search parameters, which can improve the robustness of our method. The proposed method is compared quantitatively and qualitatively with the traditional dynamic programming method, some dense stereo matching methods, and the advanced edge-based method respectively. Experiments show that our method can provide superior performance on the above comparison.

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

Science.gov (United States)

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

2016-04-01

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

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

Science.gov (United States)

2013-01-16

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

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

Science.gov (United States)

2011-11-17

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

Retrospective Analysis of T and B Cells Flow-Cross Matches in Renal Transplant Recipients

Directory of Open Access Journals (Sweden)

Lakshmi Kiran C

2008-01-01

Full Text Available Complement-mediated cytotoxic antibodies in conventional cross match, often result in misappropriation of true positives and borderline positives which are detrimental to allograft survival. Flow cross matches (FCXM are sensitive to capture even non comple-ment fixing cytotoxic antibodies. This retrospective study evaluates the utility of FCXM in effectively predicting acute allograft rejection. A total of 17 cases were processed for FCXM (T and B cell of whom seven had no rejection episodes, while the remaining 11 had acute rejection despite negative cross match and panel reacting antibodies being ne-gative (less than 20%. The sensitivity and specificity of the FCXM outcome demons-trated that positive B-cell FCXM has potential to be a good tool in pre-transplant scree-ning. The current analysis proposes the possible utility of B-cell positive FCXM as a more sensitive parameter in predicting acute allograft rejection prior to transplantation.

Computing Programs for Determining Traffic Flows from Roundabouts

Science.gov (United States)

Boroiu, A. A.; Tabacu, I.; Ene, A.; Neagu, E.; Boroiu, A.

2017-10-01

For modelling road traffic at the level of a road network it is necessary to specify the flows of all traffic currents at each intersection. These data can be obtained by direct measurements at the traffic light intersections, but in the case of a roundabout this is not possible directly and the literature as well as the traffic modelling software doesn’t offer ways to solve this issue. Two sets of formulas are proposed by which all traffic flows from the roundabouts with 3 or 4 arms are calculated based on the streams that can be measured. The objective of this paper is to develop computational programs to operate with these formulas. For each of the two sets of analytical relations, a computational program was developed in the Java operating language. The obtained results fully confirm the applicability of the calculation programs. The final stage for capitalizing these programs will be to make them web pages in HTML format, so that they can be accessed and used on the Internet. The achievements presented in this paper are an important step to provide a necessary tool for traffic modelling because these computational programs can be easily integrated into specialized software.

Enhancing phonon flow through one-dimensional interfaces by impedance matching

Science.gov (United States)

Polanco, Carlos A.; Ghosh, Avik W.

2014-08-01

We extend concepts from microwave engineering to thermal interfaces and explore the principles of impedance matching in 1D. The extension is based on the generalization of acoustic impedance to nonlinear dispersions using the contact broadening matrix Γ(ω), extracted from the phonon self energy. For a single junction, we find that for coherent and incoherent phonons, the optimal thermal conductance occurs when the matching Γ(ω) equals the Geometric Mean of the contact broadenings. This criterion favors the transmission of both low and high frequency phonons by requiring that (1) the low frequency acoustic impedance of the junction matches that of the two contacts by minimizing the sum of interfacial resistances and (2) the cut-off frequency is near the minimum of the two contacts, thereby reducing the spillage of the states into the tunneling regime. For an ultimately scaled single atom/spring junction, the matching criterion transforms to the arithmetic mean for mass and the harmonic mean for spring constant. The matching can be further improved using a composite graded junction with an exponential varying broadening that functions like a broadband antireflection coating. There is, however, a trade off as the increased length of the interface brings in additional intrinsic sources of scattering.

Constructed-Response Matching to Sample and Spelling Instruction.

Science.gov (United States)

Dube, William V.; And Others

1991-01-01

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

DOE/Industry Matching Grant Program

International Nuclear Information System (INIS)

Lee, John C.

2003-01-01

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

A feasibility Study: The Succinct Solver v2.0, XSB Prolog v2.6, and Flow-Logic Based Program Analysis for Carmel

DEFF Research Database (Denmark)

Pilegaard, Henrik

2003-01-01

We perform a direct comparison of the {Succinct Solver v2.0} and {XSB Prolog v2.6} based on experiments with {Control Flow Analyses} of scalable {Discretionary Ambient programs} and {Carmel programs}. To facilitate this comparison we expand ALFP clauses accepted by the Succinct Solver into more g...

Geographic Trends in the Plastic Surgery Match.

Science.gov (United States)

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

2016-01-01

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

Flow-based model of computer hackers' motivation.

Science.gov (United States)

Voiskounsky, Alexander E; Smyslova, Olga V

2003-04-01

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

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

Science.gov (United States)

Knowles, John K.

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

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

Science.gov (United States)

2010-10-12

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

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

Science.gov (United States)

2010-04-09

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

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

Science.gov (United States)

2010-09-28

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

Fractional Order Element Based Impedance Matching

KAUST Repository

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

2014-01-01

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

Unsupervised image matching based on manifold alignment.

Science.gov (United States)

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

2012-08-01

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

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

Science.gov (United States)

2013-11-21

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

An adaptive clustering algorithm for image matching based on corner feature

Science.gov (United States)

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.

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

Science.gov (United States)

2013-02-21

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

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

Science.gov (United States)

2010-06-09

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

Current Interview Trail Metrics in the Otolaryngology Match.

Science.gov (United States)

Cabrera-Muffly, Cristina; Chang, C W David; Puscas, Liana

2017-06-01

Objectives To identify how applicants to otolaryngology residency determine how to apply to, interview with, and rank programs on the interview trail and to determine the extent of the financial burden of the otolaryngology interview trail. Study Design Web-based survey distributed in March and April 2016. Setting Otolaryngology residency applicants throughout the United States. Subjects and Methods Applicants to otolaryngology residency during the 2016 match cycle and current otolaryngology residents were surveyed. Results Median number of applications, interview offers, interviews attended, and programs ranked was not different during the 2016 match and the previous 5 match years. The most important factor affecting the number of applications was the need to apply widely to ensure sufficient interview offers. The most common reason for declining an interview offer was scheduling conflict. Applicants during the 2016 match spent a median of $5400 applying and interviewing for otolaryngology residency. Conclusions Median number of applications, interview offers, interviews attended, and programs ranked has not changed. The most cited reason for applying to many programs was to increase the chances of matching, but this is not statistically likely to increase match success. We advocate for continued attempts to make the otolaryngology match process more transparent for both applicants and resident selection committees, but recognize that applicants are likely to continue to overapply for otolaryngology residency positions.

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

NARCIS (Netherlands)

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

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

Rethinking the Match: A Proposal for Modern Matchmaking.

Science.gov (United States)

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

2018-01-01

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

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

Science.gov (United States)

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…

An Image Matching Method Based on Fourier and LOG-Polar Transform

Directory of Open Access Journals (Sweden)

Zhijia Zhang

2014-04-01

Full Text Available This Traditional template matching methods are not appropriate for the situation of large angle rotation between two images in the online detection for industrial production. Aiming at this problem, Fourier transform algorithm was introduced to correct image rotation angle based on its rotatary invariance in time-frequency domain, orienting image under test in the same direction with reference image, and then match these images using matching algorithm based on log-polar transform. Compared with the current matching algorithms, experimental results show that the proposed algorithm can not only match two images with rotation of arbitrary angle, but also possess a high matching accuracy and applicability. In addition, the validity and reliability of algorithm was verified by simulated matching experiment targeting circular images.

Space shuttle booster multi-engine base flow analysis

Science.gov (United States)

Tang, H. H.; Gardiner, C. R.; Anderson, W. A.; Navickas, J.

1972-01-01

A comprehensive review of currently available techniques pertinent to several prominent aspects of the base thermal problem of the space shuttle booster is given along with a brief review of experimental results. A tractable engineering analysis, capable of predicting the power-on base pressure, base heating, and other base thermal environmental conditions, such as base gas temperature, is presented and used for an analysis of various space shuttle booster configurations. The analysis consists of a rational combination of theoretical treatments of the prominent flow interaction phenomena in the base region. These theories consider jet mixing, plume flow, axisymmetric flow effects, base injection, recirculating flow dynamics, and various modes of heat transfer. Such effects as initial boundary layer expansion at the nozzle lip, reattachment, recompression, choked vent flow, and nonisoenergetic mixing processes are included in the analysis. A unified method was developed and programmed to numerically obtain compatible solutions for the various flow field components in both flight and ground test conditions. Preliminary prediction for a 12-engine space shuttle booster base thermal environment was obtained for a typical trajectory history. Theoretical predictions were also obtained for some clustered-engine experimental conditions. Results indicate good agreement between the data and theoretical predicitons.

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

OpenAIRE

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

2004-01-01

In this report, we analyze the problem of personal schema matching. We define the ingredients of the XML schema matching problem using constraint logic programming. This allows us to thourougly investigate specific matching problems. We do not have the ambition to provide for a formalism that covers all kinds of schema matching problems. The target is specifically personal schema matching using XML. The report is organized as follows. Chapter 2 provides a detailed description of our research ...

Variable disparity estimation based intermediate view reconstruction in dynamic flow allocation over EPON-based access networks

Science.gov (United States)

Bae, Kyung-Hoon; Lee, Jungjoon; Kim, Eun-Soo

2008-06-01

In this paper, a variable disparity estimation (VDE)-based intermediate view reconstruction (IVR) in dynamic flow allocation (DFA) over an Ethernet passive optical network (EPON)-based access network is proposed. In the proposed system, the stereoscopic images are estimated by a variable block-matching algorithm (VBMA), and they are transmitted to the receiver through DFA over EPON. This scheme improves a priority-based access network by converting it to a flow-based access network with a new access mechanism and scheduling algorithm, and then 16-view images are synthesized by the IVR using VDE. Some experimental results indicate that the proposed system improves the peak-signal-to-noise ratio (PSNR) to as high as 4.86 dB and reduces the processing time to 3.52 s. Additionally, the network service provider can provide upper limits of transmission delays by the flow. The modeling and simulation results, including mathematical analyses, from this scheme are also provided.

Target matching based on multi-view tracking

Science.gov (United States)

Liu, Yahui; Zhou, Changsheng

2011-01-01

A feature matching method is proposed based on Maximally Stable Extremal Regions (MSER) and Scale Invariant Feature Transform (SIFT) to solve the problem of the same target matching in multiple cameras. Target foreground is extracted by using frame difference twice and bounding box which is regarded as target regions is calculated. Extremal regions are got by MSER. After fitted into elliptical regions, those regions will be normalized into unity circles and represented with SIFT descriptors. Initial matching is obtained from the ratio of the closest distance to second distance less than some threshold and outlier points are eliminated in terms of RANSAC. Experimental results indicate the method can reduce computational complexity effectively and is also adapt to affine transformation, rotation, scale and illumination.

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

Science.gov (United States)

2012-07-25

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

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

Science.gov (United States)

2012-09-06

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

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

Science.gov (United States)

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

2018-12-01

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

Ontology-based composition and matching for dynamic service coordination

OpenAIRE

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

2011-01-01

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

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

Directory of Open Access Journals (Sweden)

Sungwoo Lim

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

Study on the Matching Relationship between Polymer Hydrodynamic Characteristic Size and Pore Throat Radius of Target Block S Based on the Microporous Membrane Filtration Method

Directory of Open Access Journals (Sweden)

Li Yiqiang

2014-01-01

Full Text Available The concept of the hydrodynamic characteristic size of polymer was proposed in this study, to characterize the size of aggregates of many polymer molecules in the polymer percolation process. The hydrodynamic characteristic sizes of polymers used in the target block S were examined by employing microporous membrane filtration method, and the factors were studied. Natural core flow experiments were conducted in order to set up the flow matching relationship plate. According to the flow matching plate, the relationship between the hydrodynamic characteristic size of polymer and pore throat radius obtained from core mercury injection data was found. And several suitable polymers for different reservoirs permeability were given. The experimental results of microporous membrane filtration indicated that the hydrodynamic characteristic size of polymer maintained a good nonlinear relationship with polymer viscosity; the value increased as the molecular weight and concentration of the polymer increased and increased as the salinity of dilution water decreased. Additionally, the hydrodynamic characteristic size decreased as the pressure increased, so the hydrodynamic characteristic size ought to be determined based on the pressure of the target block. In the core flow studies, good matching of polymer and formation was identified as polymer flow pressure gradient lower than the fracture pressure gradient of formation. In this case, good matching that was the pore throat radius should be larger than 10 times the hydrodynamic characteristic size of polymer in this study. Using relationship, more matching relationship between the hydrodynamic characteristic sizes of polymer solutions and the pore throat radius of target block was determined.

Program Transformation to Identify List-Based Parallel Skeletons

Directory of Open Access Journals (Sweden)

Venkatesh Kannan

2016-07-01

Full Text Available Algorithmic skeletons are used as building-blocks to ease the task of parallel programming by abstracting the details of parallel implementation from the developer. Most existing libraries provide implementations of skeletons that are defined over flat data types such as lists or arrays. However, skeleton-based parallel programming is still very challenging as it requires intricate analysis of the underlying algorithm and often uses inefficient intermediate data structures. Further, the algorithmic structure of a given program may not match those of list-based skeletons. In this paper, we present a method to automatically transform any given program to one that is defined over a list and is more likely to contain instances of list-based skeletons. This facilitates the parallel execution of a transformed program using existing implementations of list-based parallel skeletons. Further, by using an existing transformation called distillation in conjunction with our method, we produce transformed programs that contain fewer inefficient intermediate data structures.

A Polygon and Point-Based Approach to Matching Geospatial Features

Directory of Open Access Journals (Sweden)

Juan J. Ruiz-Lendínez

2017-12-01

Full Text Available A methodology for matching bidimensional entities is presented in this paper. The matching is proposed for both area and point features extracted from geographical databases. The procedure used to obtain homologous entities is achieved in a two-step process: The first matching, polygon to polygon matching (inter-element matching, is obtained by means of a genetic algorithm that allows the classifying of area features from two geographical databases. After this, we apply a point to point matching (intra-element matching based on the comparison of changes in their turning functions. This study shows that genetic algorithms are suitable for matching polygon features even if these features are quite different. Our results show up to 40% of matched polygons with differences in geometrical attributes. With regards to point matching, the vertex from homologous polygons, the function and threshold values proposed in this paper show a useful method for obtaining precise vertex matching.

Fast and accurate phylogeny reconstruction using filtered spaced-word matches

Science.gov (United States)

Sohrabi-Jahromi, Salma; Morgenstern, Burkhard

2017-01-01

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

A FPGA-based architecture for real-time image matching

Science.gov (United States)

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.

A dual-adaptive support-based stereo matching algorithm

Science.gov (United States)

Zhang, Yin; Zhang, Yun

2017-07-01

Many stereo matching algorithms use fixed color thresholds and a rigid cross skeleton to segment supports (viz., Cross method), which, however, does not work well for different images. To address this issue, this paper proposes a novel dual adaptive support (viz., DAS)-based stereo matching method, which uses both appearance and shape information of a local region to segment supports automatically, and, then, integrates the DAS-based cost aggregation with the absolute difference plus census transform cost, scanline optimization and disparity refinement to develop a stereo matching system. The performance of the DAS method is also evaluated in the Middlebury benchmark and by comparing with the Cross method. The results show that the average error for the DAS method 25.06% lower than that for the Cross method, indicating that the proposed method is more accurate, with fewer parameters and suitable for parallel computing.

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

DEFF Research Database (Denmark)

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

2012-01-01

Microfluidic biochips are replacing the conventional biochemical analyzers and are able to integrate the necessary functions for biochemical analysis on-chip. In this paper we are interested in flow-based biochips, in which the flow of liquid is manipulated using integrated microvalves. By combin...

LINE-BASED MULTI-IMAGE MATCHING FOR FAÇADE RECONSTRUCTION

Directory of Open Access Journals (Sweden)

T. A. Teo

2012-07-01

Full Text Available This research integrates existing LOD 2 building models and multiple close-range images for façade structural lines extraction. The major works are orientation determination and multiple image matching. In the orientation determination, Speeded Up Robust Features (SURF is applied to extract tie points automatically. Then, tie points and control points are combined for block adjustment. An object-based multi-images matching is proposed to extract the façade structural lines. The 2D lines in image space are extracted by Canny operator followed by Hough transform. The role of LOD 2 building models is to correct the tilt displacement of image from different views. The wall of LOD 2 model is also used to generate hypothesis planes for similarity measurement. Finally, average normalized cross correlation is calculated to obtain the best location in object space. The test images are acquired by a nonmetric camera Nikon D2X. The total number of image is 33. The experimental results indicate that the accuracy of orientation determination is about 1 pixel from 2515 tie points and 4 control points. It also indicates that line-based matching is more flexible than point-based matching.

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

Science.gov (United States)

2010-04-01

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

Fractured reservoir history matching improved based on artificial intelligent

Directory of Open Access Journals (Sweden)

Sayyed Hadi Riazi

2016-12-01

Full Text Available In this paper, a new robust approach based on Least Square Support Vector Machine (LSSVM as a proxy model is used for an automatic fractured reservoir history matching. The proxy model is made to model the history match objective function (mismatch values based on the history data of the field. This model is then used to minimize the objective function through Particle Swarm Optimization (PSO and Imperialist Competitive Algorithm (ICA. In automatic history matching, sensitive analysis is often performed on full simulation model. In this work, to get new range of the uncertain parameters (matching parameters in which the objective function has a minimum value, sensitivity analysis is also performed on the proxy model. By applying the modified ranges to the optimization methods, optimization of the objective function will be faster and outputs of the optimization methods (matching parameters are produced in less time and with high precision. This procedure leads to matching of history of the field in which a set of reservoir parameters is used. The final sets of parameters are then applied for the full simulation model to validate the technique. The obtained results show that the present procedure in this work is effective for history matching process due to its robust dependability and fast convergence speed. Due to high speed and need for small data sets, LSSVM is the best tool to build a proxy model. Also the comparison of PSO and ICA shows that PSO is less time-consuming and more effective.

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

Science.gov (United States)

2011-03-07

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

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

Science.gov (United States)

2011-03-07

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

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

Science.gov (United States)

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

2013-08-16

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

Content Based Image Matching for Planetary Science

Science.gov (United States)

Deans, M. C.; Meyer, C.

2006-12-01

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

A Computer Program for Flow-Log Analysis of Single Holes (FLASH)

Science.gov (United States)

Day-Lewis, F. D.; Johnson, C.D.; Paillet, Frederick L.; Halford, K.J.

2011-01-01

A new computer program, FLASH (Flow-Log Analysis of Single Holes), is presented for the analysis of borehole vertical flow logs. The code is based on an analytical solution for steady-state multilayer radial flow to a borehole. The code includes options for (1) discrete fractures and (2) multilayer aquifers. Given vertical flow profiles collected under both ambient and stressed (pumping or injection) conditions, the user can estimate fracture (or layer) transmissivities and far-field hydraulic heads. FLASH is coded in Microsoft Excel with Visual Basic for Applications routines. The code supports manual and automated model calibration. ?? 2011, The Author(s). Ground Water ?? 2011, National Ground Water Association.

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

Science.gov (United States)

2012-06-29

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

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

Science.gov (United States)

2010-02-22

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

Application of Genetic Programing to Develop a Modular Model for the Simulation of Stream Flow Time Series

Science.gov (United States)

Meshgi, A.; Babovic, V.; Chui, T. F. M.; Schmitter, P.

2014-12-01

Developing reliable methods to estimate stream flow has been a subject of interest due to its importance in planning, design and management of water resources within a basin. Machine learning tools such as Artificial Neural Network (ANN) and Genetic Programming (GP) have been widely applied for rainfall-runoff modeling as they require less computational time as compared to physically-based models. As GP is able to generate a function with understandable structure, it may offer advantages over other data driven techniques and therefore has been used in different studies to generate rainfall-runoff functions. However, to date, proposed formulations only contain rainfall and/or streamflow data and consequently are local and cannot be generalized and adopted in other catchments which have different physical characteristics. This study investigated the capability of GP in developing a physically interpretable model with understandable structure to simulate stream flow based on hydrological parameters (e.g. precipitation) and catchment conditions (e.g., initial groundwater table elevation and area of the catchment) by following a modular approach. The modular model resulted in two sub-models where the baseflow was first predicted and the direct runoff was then estimated for a semi-urban catchment in Singapore. The simulated results matched very well with observed data in both the training and the testing of data sets, giving NSEs of 0.97 and 0.96 respectively demonstrated the successful estimation of stream flow using the modular model derived in this study. The results of this study indicate that GP is an effective tool in developing a physically interpretable model with understandable structure to simulate stream flow that can be transferred to other catchments.

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

Science.gov (United States)

2010-07-26

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

Personnel Selection Method Based on Personnel-Job Matching

OpenAIRE

Li Wang; Xilin Hou; Lili Zhang

2013-01-01

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

Adapting high-level language programs for parallel processing using data flow

Science.gov (United States)

Standley, Hilda M.

1988-01-01

EASY-FLOW, a very high-level data flow language, is introduced for the purpose of adapting programs written in a conventional high-level language to a parallel environment. The level of parallelism provided is of the large-grained variety in which parallel activities take place between subprograms or processes. A program written in EASY-FLOW is a set of subprogram calls as units, structured by iteration, branching, and distribution constructs. A data flow graph may be deduced from an EASY-FLOW program.

A Multi-Scale Settlement Matching Algorithm Based on ARG

Science.gov (United States)

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

2016-06-01

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

Use and utility of Web-based residency program information: a survey of residency applicants.

Science.gov (United States)

Embi, Peter J; Desai, Sima; Cooney, Thomas G

2003-01-01

The Internet has become essential to the residency application process. In recent years, applicants and residency programs have used the Internet-based tools of the National Residency Matching Program (NRMP, the Match) and the Electronic Residency Application Service (ERAS) to process and manage application and Match information. In addition, many residency programs have moved their recruitment information from printed brochures to Web sites. Despite this change, little is known about how applicants use residency program Web sites and what constitutes optimal residency Web site content, information that is critical to developing and maintaining such sites. To study the use and perceived utility of Web-based residency program information by surveying applicants to an internal medicine program. Our sample population was the applicants to the Oregon Health & Science University Internal Medicine Residency Program who were invited for an interview. We solicited participation using the group e-mail feature available through the Electronic Residency Application Service Post-Office application. To minimize the possibility for biased responses, the study was confined to the period between submission of National Residency Matching Program rank-order lists and release of Match results. Applicants could respond using an anonymous Web-based form or by reply to the e-mail solicitation. We tabulated responses, calculated percentages for each, and performed a qualitative analysis of comments. Of the 431 potential participants, 218 responded (51%) during the study period. Ninety-nine percent reported comfort browsing the Web; 52% accessed the Web primarily from home. Sixty-nine percent learned about residency Web sites primarily from residency-specific directories while 19% relied on general directories. Eighty percent found these sites helpful when deciding where to apply, 69% when deciding where to interview, and 36% when deciding how to rank order programs for the Match. Forty

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

Science.gov (United States)

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

2015-12-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2015-12-01

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

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

Science.gov (United States)

Ross, David A; Moore, Edward Z

2013-09-01

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

PACTOLUS, Nuclear Power Plant Cost and Economics by Discounted Cash Flow Method. CLOTHO, Mass Flow Data Calculation for Program PACTOLUS

International Nuclear Information System (INIS)

Haffner, D.R.

1976-01-01

1 - Description of problem or function: PACTOLUS is a code for computing nuclear power costs using the discounted cash flow method. The cash flows are generated from input unit costs, time schedules and burnup data. CLOTHO calculates and communicates to PACTOLUS mass flow data to match a specified load factor history. 2 - Method of solution: Plant lifetime power costs are calculated using the discounted cash flow method. 3 - Restrictions on the complexity of the problem - Maxima of: 40 annual time periods into which all costs and mass flows are accumulated, 20 isotopic mass flows charged into and discharged from the reactor model

MR angiography with a matched filter

International Nuclear Information System (INIS)

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

1987-01-01

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

A Multi-Scale Settlement Matching Algorithm Based on ARG

Directory of Open Access Journals (Sweden)

H. Yue

2016-06-01

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

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

Science.gov (United States)

Linden, Ariel; Yarnold, Paul R

2016-12-01

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

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

Science.gov (United States)

Jones, Kelly W; Lewis, David J

2015-01-01

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

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

Directory of Open Access Journals (Sweden)

Kelly W Jones

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

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

Science.gov (United States)

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

2014-01-01

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

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

Science.gov (United States)

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

2014-01-01

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

Toward Practical Secure Stable Matching

Directory of Open Access Journals (Sweden)

Riazi M. Sadegh

2017-01-01

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

Matching biomedical ontologies based on formal concept analysis.

Science.gov (United States)

Zhao, Mengyi; Zhang, Songmao; Li, Weizhuo; Chen, Guowei

2018-03-19

The goal of ontology matching is to identify correspondences between entities from different yet overlapping ontologies so as to facilitate semantic integration, reuse and interoperability. As a well developed mathematical model for analyzing individuals and structuring concepts, Formal Concept Analysis (FCA) has been applied to ontology matching (OM) tasks since the beginning of OM research, whereas ontological knowledge exploited in FCA-based methods is limited. This motivates the study in this paper, i.e., to empower FCA with as much as ontological knowledge as possible for identifying mappings across ontologies. We propose a method based on Formal Concept Analysis to identify and validate mappings across ontologies, including one-to-one mappings, complex mappings and correspondences between object properties. Our method, called FCA-Map, incrementally generates a total of five types of formal contexts and extracts mappings from the lattices derived. First, the token-based formal context describes how class names, labels and synonyms share lexical tokens, leading to lexical mappings (anchors) across ontologies. Second, the relation-based formal context describes how classes are in taxonomic, partonomic and disjoint relationships with the anchors, leading to positive and negative structural evidence for validating the lexical matching. Third, the positive relation-based context can be used to discover structural mappings. Afterwards, the property-based formal context describes how object properties are used in axioms to connect anchor classes across ontologies, leading to property mappings. Last, the restriction-based formal context describes co-occurrence of classes across ontologies in anonymous ancestors of anchors, from which extended structural mappings and complex mappings can be identified. Evaluation on the Anatomy, the Large Biomedical Ontologies, and the Disease and Phenotype track of the 2016 Ontology Alignment Evaluation Initiative campaign

FINGERPRINT MATCHING BASED ON PORE CENTROIDS

Directory of Open Access Journals (Sweden)

S. Malathi

2011-05-01

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

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

Science.gov (United States)

2010-05-07

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

Potential effects of elevated base flow and midsummer spike flow experiments on riparian vegetation along the Green River

Science.gov (United States)

Friedman, Jonathan M.

2018-01-01

The Upper Colorado River Endangered Fish Recovery Program has requested experimental flow releases from Flaming Gorge Dam for (1) elevated summer base flows to promote larval endangered Colorado pikeminnow, and (2) midsummer spike flows to disadvantage spawning invasive smallmouth bass. This white paper explores the effects of these proposed flow modifications on riparian vegetation and sediment deposition downstream along the Green River. Although modest in magnitude, the elevated base flows and possible associated reductions in magnitude or duration of peak flows would exacerbate a long-term trend of flow stabilization on the Green River that is already leading to proliferation of vegetation including invasive tamarisk along the channel and associated sediment deposition, channel narrowing and channel simplification. Midsummer spike flows could promote establishment of late-flowering plants like tamarisk. Because channel narrowing and simplification threaten persistence and quality of backwater and side channel features needed by endangered fish, the proposed flow modifications could lead to degradation of fish habitat. Channel narrowing and vegetation encroachment could be countered by increases in peak flows or reductions in base flows in some years and by prescription of rapid flow declines following midsummer spike flows. These strategies for reducing vegetation encroachment would need to be balanced with flow

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

Science.gov (United States)

2012-06-06

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

Venturi Wet Gas Flow Modeling Based on Homogeneous and Separated Flow Theory

Directory of Open Access Journals (Sweden)

Xu Ying

2008-10-01

Full Text Available When Venturi meters are used in wet gas, the measured differential pressure is higher than it would be in gas phases flowing alone. This phenomenon is called over-reading. Eight famous over-reading correlations have been studied by many researchers under low- and high-pressure conditions, the conclusion is separated flow model and homogeneous flow model performing well both under high and low pressures. In this study, a new metering method is presented based on homogeneous and separated flow theory; the acceleration pressure drop and the friction pressure drop of Venturi under two-phase flow conditions are considered in new correlation, and its validity is verified through experiment. For low pressure, a new test program has been implemented in Tianjin University’s low-pressure wet gas loop. For high pressure, the National Engineering Laboratory offered their reports on the web, so the coefficients of the new proposed correlation are fitted with all independent data both under high and low pressures. Finally, the applicability and errors of new correlation are analyzed.

SAD-Based Stereo Matching Using FPGAs

Science.gov (United States)

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

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

Improved artificial bee colony algorithm based gravity matching navigation method.

Science.gov (United States)

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

2014-07-18

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

Commentary: the postdoctoral residency match in clinical neuropsychology.

Science.gov (United States)

Bodin, Doug; Grote, Christopher L

2016-07-01

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

45 CFR 2516.700 - What matching funds are required?

Science.gov (United States)

2010-10-01

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

An Matching Method for Vehicle-borne Panoramic Image Sequence Based on Adaptive Structure from Motion Feature

Directory of Open Access Journals (Sweden)

ZHANG Zhengpeng

2015-10-01

Full Text Available Panoramic image matching method with the constraint condition of local structure from motion similarity feature is an important method, the process requires multivariable kernel density estimations for the structure from motion feature used nonparametric mean shift. Proper selection of the kernel bandwidth is a critical step for convergence speed and accuracy of matching method. Variable bandwidth with adaptive structure from motion feature for panoramic image matching method has been proposed in this work. First the bandwidth matrix is defined using the locally adaptive spatial structure of the sampling point in spatial domain and optical flow domain. The relaxation diffusion process of structure from motion similarity feature is described by distance weighting method of local optical flow feature vector. Then the expression form of adaptive multivariate kernel density function is given out, and discusses the solution of the mean shift vector, termination conditions, and the seed point selection method. The final fusions of multi-scale SIFT the features and structure features to establish a unified panoramic image matching framework. The sphere panoramic images from vehicle-borne mobile measurement system are chosen such that a comparison analysis between fixed bandwidth and adaptive bandwidth is carried out in detail. The results show that adaptive bandwidth is good for case with the inlier ratio changes and the object space scale changes. The proposed method can realize the adaptive similarity measure of structure from motion feature, improves the correct matching points and matching rate, experimental results have shown our method to be robust.

Local coding based matching kernel method for image classification.

Directory of Open Access Journals (Sweden)

Yan Song

Full Text Available This paper mainly focuses on how to effectively and efficiently measure visual similarity for local feature based representation. Among existing methods, metrics based on Bag of Visual Word (BoV techniques are efficient and conceptually simple, at the expense of effectiveness. By contrast, kernel based metrics are more effective, but at the cost of greater computational complexity and increased storage requirements. We show that a unified visual matching framework can be developed to encompass both BoV and kernel based metrics, in which local kernel plays an important role between feature pairs or between features and their reconstruction. Generally, local kernels are defined using Euclidean distance or its derivatives, based either explicitly or implicitly on an assumption of Gaussian noise. However, local features such as SIFT and HoG often follow a heavy-tailed distribution which tends to undermine the motivation behind Euclidean metrics. Motivated by recent advances in feature coding techniques, a novel efficient local coding based matching kernel (LCMK method is proposed. This exploits the manifold structures in Hilbert space derived from local kernels. The proposed method combines advantages of both BoV and kernel based metrics, and achieves a linear computational complexity. This enables efficient and scalable visual matching to be performed on large scale image sets. To evaluate the effectiveness of the proposed LCMK method, we conduct extensive experiments with widely used benchmark datasets, including 15-Scenes, Caltech101/256, PASCAL VOC 2007 and 2011 datasets. Experimental results confirm the effectiveness of the relatively efficient LCMK method.

World wide matching of registration metrology tools of various generations

Science.gov (United States)

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

2008-10-01

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

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

Science.gov (United States)

2011-09-14

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

Gun bore flaw image matching based on improved SIFT descriptor

Science.gov (United States)

Zeng, Luan; Xiong, Wei; Zhai, You

2013-01-01

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

MP Salsa: a finite element computer program for reacting flow problems. Part 1--theoretical development

Energy Technology Data Exchange (ETDEWEB)

Shadid, J.N.; Moffat, H.K.; Hutchinson, S.A.; Hennigan, G.L.; Devine, K.D.; Salinger, A.G.

1996-05-01

The theoretical background for the finite element computer program, MPSalsa, is presented in detail. MPSalsa is designed to solve laminar, low Mach number, two- or three-dimensional incompressible and variable density reacting fluid flows on massively parallel computers, using a Petrov-Galerkin finite element formulation. The code has the capability to solve coupled fluid flow, heat transport, multicomponent species transport, and finite-rate chemical reactions, and to solver coupled multiple Poisson or advection-diffusion- reaction equations. The program employs the CHEMKIN library to provide a rigorous treatment of multicomponent ideal gas kinetics and transport. Chemical reactions occurring in the gas phase and on surfaces are treated by calls to CHEMKIN and SURFACE CHEMKIN, respectively. The code employs unstructured meshes, using the EXODUS II finite element data base suite of programs for its input and output files. MPSalsa solves both transient and steady flows by using fully implicit time integration, an inexact Newton method and iterative solvers based on preconditioned Krylov methods as implemented in the Aztec solver library.

MATCHING AERIAL IMAGES TO 3D BUILDING MODELS BASED ON CONTEXT-BASED GEOMETRIC HASHING

Directory of Open Access Journals (Sweden)

J. Jung

2016-06-01

Full Text Available In this paper, a new model-to-image framework to automatically align a single airborne image with existing 3D building models using geometric hashing is proposed. As a prerequisite process for various applications such as data fusion, object tracking, change detection and texture mapping, the proposed registration method is used for determining accurate exterior orientation parameters (EOPs of a single image. This model-to-image matching process consists of three steps: 1 feature extraction, 2 similarity measure and matching, and 3 adjustment of EOPs of a single image. For feature extraction, we proposed two types of matching cues, edged corner points representing the saliency of building corner points with associated edges and contextual relations among the edged corner points within an individual roof. These matching features are extracted from both 3D building and a single airborne image. A set of matched corners are found with given proximity measure through geometric hashing and optimal matches are then finally determined by maximizing the matching cost encoding contextual similarity between matching candidates. Final matched corners are used for adjusting EOPs of the single airborne image by the least square method based on co-linearity equations. The result shows that acceptable accuracy of single image's EOP can be achievable by the proposed registration approach as an alternative to labour-intensive manual registration process.

Robust, Efficient Depth Reconstruction With Hierarchical Confidence-Based Matching.

Science.gov (United States)

Sun, Li; Chen, Ke; Song, Mingli; Tao, Dacheng; Chen, Gang; Chen, Chun

2017-07-01

In recent years, taking photos and capturing videos with mobile devices have become increasingly popular. Emerging applications based on the depth reconstruction technique have been developed, such as Google lens blur. However, depth reconstruction is difficult due to occlusions, non-diffuse surfaces, repetitive patterns, and textureless surfaces, and it has become more difficult due to the unstable image quality and uncontrolled scene condition in the mobile setting. In this paper, we present a novel hierarchical framework with multi-view confidence-based matching for robust, efficient depth reconstruction in uncontrolled scenes. Particularly, the proposed framework combines local cost aggregation with global cost optimization in a complementary manner that increases efficiency and accuracy. A depth map is efficiently obtained in a coarse-to-fine manner by using an image pyramid. Moreover, confidence maps are computed to robustly fuse multi-view matching cues, and to constrain the stereo matching on a finer scale. The proposed framework has been evaluated with challenging indoor and outdoor scenes, and has achieved robust and efficient depth reconstruction.

Physics-based shape matching for intraoperative image guidance

Energy Technology Data Exchange (ETDEWEB)

Suwelack, Stefan, E-mail: suwelack@kit.edu; Röhl, Sebastian; Bodenstedt, Sebastian; Reichard, Daniel; Dillmann, Rüdiger; Speidel, Stefanie [Institute for Anthropomatics and Robotics, Karlsruhe Institute of Technology, Adenauerring 2, Karlsruhe 76131 (Germany); Santos, Thiago dos; Maier-Hein, Lena [Computer-assisted Interventions, German Cancer Research Center (DKFZ), Im Neuenheimer Feld 280, Heidelberg 69120 (Germany); Wagner, Martin; Wünscher, Josephine; Kenngott, Hannes; Müller, Beat P. [General, Visceral and Transplantation Surgery, Heidelberg University Hospital, Im Neuenheimer Feld 110, Heidelberg 69120 (Germany)

2014-11-01

Purpose: Soft-tissue deformations can severely degrade the validity of preoperative planning data during computer assisted interventions. Intraoperative imaging such as stereo endoscopic, time-of-flight or, laser range scanner data can be used to compensate these movements. In this context, the intraoperative surface has to be matched to the preoperative model. The shape matching is especially challenging in the intraoperative setting due to noisy sensor data, only partially visible surfaces, ambiguous shape descriptors, and real-time requirements. Methods: A novel physics-based shape matching (PBSM) approach to register intraoperatively acquired surface meshes to preoperative planning data is proposed. The key idea of the method is to describe the nonrigid registration process as an electrostatic–elastic problem, where an elastic body (preoperative model) that is electrically charged slides into an oppositely charged rigid shape (intraoperative surface). It is shown that the corresponding energy functional can be efficiently solved using the finite element (FE) method. It is also demonstrated how PBSM can be combined with rigid registration schemes for robust nonrigid registration of arbitrarily aligned surfaces. Furthermore, it is shown how the approach can be combined with landmark based methods and outline its application to image guidance in laparoscopic interventions. Results: A profound analysis of the PBSM scheme based on in silico and phantom data is presented. Simulation studies on several liver models show that the approach is robust to the initial rigid registration and to parameter variations. The studies also reveal that the method achieves submillimeter registration accuracy (mean error between 0.32 and 0.46 mm). An unoptimized, single core implementation of the approach achieves near real-time performance (2 TPS, 7–19 s total registration time). It outperforms established methods in terms of speed and accuracy. Furthermore, it is shown that the

The Gastroenterology Fellowship Match: A Decade Later.

Science.gov (United States)

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

2017-06-01

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

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

Science.gov (United States)

Jones, Kelly W.; Lewis, David J.

2015-01-01

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

New Power Sharing Control for Inverter-Dominated Microgrid Based on Impedance Match Concept

Science.gov (United States)

Gu, Herong; Wang, Deyu; Shen, Hong; Zhao, Wei; Guo, Xiaoqiang

2013-01-01

Power flow control is one of the most important issues for operating the inverter-dominated autonomous microgrid. A technical challenge is how to achieve the accurate active/reactive power sharing of inverters. P-F and Q-V droop control schemes have been widely used for power sharing in the past decades. But they suffer from the poor power sharing in the presence of unequal line impedance. In order to solve the problem, a comprehensive analysis of the power droop control is presented, and a new droop control based on the impedance match concept is proposed in this paper. In addition, the design guidelines of control coefficients and virtual impedance are provided. Finally, the performance evaluation is carried out, and the evaluation results verify the effectiveness of the proposed method. PMID:24453910

New power sharing control for inverter-dominated microgrid based on impedance match concept.

Science.gov (United States)

Gu, Herong; Wang, Deyu; Shen, Hong; Zhao, Wei; Guo, Xiaoqiang

2013-01-01

Power flow control is one of the most important issues for operating the inverter-dominated autonomous microgrid. A technical challenge is how to achieve the accurate active/reactive power sharing of inverters. P-F and Q-V droop control schemes have been widely used for power sharing in the past decades. But they suffer from the poor power sharing in the presence of unequal line impedance. In order to solve the problem, a comprehensive analysis of the power droop control is presented, and a new droop control based on the impedance match concept is proposed in this paper. In addition, the design guidelines of control coefficients and virtual impedance are provided. Finally, the performance evaluation is carried out, and the evaluation results verify the effectiveness of the proposed method.

A Spherical Model Based Keypoint Descriptor and Matching Algorithm for Omnidirectional Images

Directory of Open Access Journals (Sweden)

Guofeng Tong

2014-04-01

Full Text Available Omnidirectional images generally have nonlinear distortion in radial direction. Unfortunately, traditional algorithms such as scale-invariant feature transform (SIFT and Descriptor-Nets (D-Nets do not work well in matching omnidirectional images just because they are incapable of dealing with the distortion. In order to solve this problem, a new voting algorithm is proposed based on the spherical model and the D-Nets algorithm. Because the spherical-based keypoint descriptor contains the distortion information of omnidirectional images, the proposed matching algorithm is invariant to distortion. Keypoint matching experiments are performed on three pairs of omnidirectional images, and comparison is made among the proposed algorithm, the SIFT and the D-Nets. The result shows that the proposed algorithm is more robust and more precise than the SIFT, and the D-Nets in matching omnidirectional images. Comparing with the SIFT and the D-Nets, the proposed algorithm has two main advantages: (a there are more real matching keypoints; (b the coverage range of the matching keypoints is wider, including the seriously distorted areas.

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

Science.gov (United States)

2010-02-26

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

Spectral matching research for light-emitting diode-based neonatal jaundice therapeutic device light source

Science.gov (United States)

Gan, Ruting; Guo, Zhenning; Lin, Jieben

2015-09-01

To decrease the risk of bilirubin encephalopathy and minimize the need for exchange transfusions, we report a novel design for light source of light-emitting diode (LED)-based neonatal jaundice therapeutic device (NJTD). The bilirubin absorption spectrum in vivo was regarded as target. Based on spectral constructing theory, we used commercially available LEDs with different peak wavelengths and full width at half maximum as matching light sources. Simple genetic algorithm was first proposed as the spectral matching method. The required LEDs number at each peak wavelength was calculated, and then, the commercial light source sample model of the device was fabricated to confirm the spectral matching technology. In addition, the corresponding spectrum was measured and the effect was analyzed finally. The results showed that fitted spectrum was very similar to the target spectrum with 98.86 % matching degree, and the actual device model has a spectrum close to the target with 96.02 % matching degree. With higher fitting degree and efficiency, this matching algorithm is very suitable for light source matching technology of LED-based spectral distribution, and bilirubin absorption spectrum in vivo will be auspicious candidate for the target spectrum of new LED-based NJTD light source.

Unsteady fluid flow in a slightly curved pipe: A comparative study of a matched asymptotic expansions solution with a single analytical solution

Energy Technology Data Exchange (ETDEWEB)

Messaris, Gerasimos A. T., E-mail: messaris@upatras.gr [Department of Physics, Division of Theoretical Physics, University of Patras, GR 265 04 Rion (Greece); School of Science and Technology, Hellenic Open University, 11 Sahtouri Street, GR 262 22 Patras (Greece); Hadjinicolaou, Maria [School of Science and Technology, Hellenic Open University, 11 Sahtouri Street, GR 262 22 Patras (Greece); Karahalios, George T. [Department of Physics, Division of Theoretical Physics, University of Patras, GR 265 04 Rion (Greece)

2016-08-15

The present work is motivated by the fact that blood flow in the aorta and the main arteries is governed by large finite values of the Womersley number α and for such values of α there is not any analytical solution in the literature. The existing numerical solutions, although accurate, give limited information about the factors that affect the flow, whereas an analytical approach has an advantage in that it can provide physical insight to the flow mechanism. Having this in mind, we seek analytical solution to the equations of the fluid flow driven by a sinusoidal pressure gradient in a slightly curved pipe of circular cross section when the Womersley number varies from small finite to infinite values. Initially the equations of motion are expanded in terms of the curvature ratio δ and the resulting linearized equations are solved analytically in two ways. In the first, we match the solution for the main core to that for the Stokes boundary layer. This solution is valid for very large values of α. In the second, we derive a straightforward single solution valid to the entire flow region and for 8 ≤ α < ∞, a range which includes the values of α that refer to the physiological flows. Each solution contains expressions for the axial velocity, the stream function, and the wall stresses and is compared to the analogous forms presented in other studies. The two solutions give identical results to each other regarding the axial flow but differ in the secondary flow and the circumferential wall stress, due to the approximations employed in the matched asymptotic expansion process. The results on the stream function from the second solution are in agreement with analogous results from other numerical solutions. The second solution predicts that the atherosclerotic plaques may develop in any location around the cross section of the aortic wall unlike to the prescribed locations predicted by the first solution. In addition, it gives circumferential wall stresses

Unsteady fluid flow in a slightly curved pipe: A comparative study of a matched asymptotic expansions solution with a single analytical solution

International Nuclear Information System (INIS)

Messaris, Gerasimos A. T.; Hadjinicolaou, Maria; Karahalios, George T.

2016-01-01

The present work is motivated by the fact that blood flow in the aorta and the main arteries is governed by large finite values of the Womersley number α and for such values of α there is not any analytical solution in the literature. The existing numerical solutions, although accurate, give limited information about the factors that affect the flow, whereas an analytical approach has an advantage in that it can provide physical insight to the flow mechanism. Having this in mind, we seek analytical solution to the equations of the fluid flow driven by a sinusoidal pressure gradient in a slightly curved pipe of circular cross section when the Womersley number varies from small finite to infinite values. Initially the equations of motion are expanded in terms of the curvature ratio δ and the resulting linearized equations are solved analytically in two ways. In the first, we match the solution for the main core to that for the Stokes boundary layer. This solution is valid for very large values of α. In the second, we derive a straightforward single solution valid to the entire flow region and for 8 ≤ α < ∞, a range which includes the values of α that refer to the physiological flows. Each solution contains expressions for the axial velocity, the stream function, and the wall stresses and is compared to the analogous forms presented in other studies. The two solutions give identical results to each other regarding the axial flow but differ in the secondary flow and the circumferential wall stress, due to the approximations employed in the matched asymptotic expansion process. The results on the stream function from the second solution are in agreement with analogous results from other numerical solutions. The second solution predicts that the atherosclerotic plaques may develop in any location around the cross section of the aortic wall unlike to the prescribed locations predicted by the first solution. In addition, it gives circumferential wall stresses

Unsteady fluid flow in a slightly curved pipe: A comparative study of a matched asymptotic expansions solution with a single analytical solution

Science.gov (United States)

Messaris, Gerasimos A. T.; Hadjinicolaou, Maria; Karahalios, George T.

2016-08-01

The present work is motivated by the fact that blood flow in the aorta and the main arteries is governed by large finite values of the Womersley number α and for such values of α there is not any analytical solution in the literature. The existing numerical solutions, although accurate, give limited information about the factors that affect the flow, whereas an analytical approach has an advantage in that it can provide physical insight to the flow mechanism. Having this in mind, we seek analytical solution to the equations of the fluid flow driven by a sinusoidal pressure gradient in a slightly curved pipe of circular cross section when the Womersley number varies from small finite to infinite values. Initially the equations of motion are expanded in terms of the curvature ratio δ and the resulting linearized equations are solved analytically in two ways. In the first, we match the solution for the main core to that for the Stokes boundary layer. This solution is valid for very large values of α. In the second, we derive a straightforward single solution valid to the entire flow region and for 8 ≤ α flows. Each solution contains expressions for the axial velocity, the stream function, and the wall stresses and is compared to the analogous forms presented in other studies. The two solutions give identical results to each other regarding the axial flow but differ in the secondary flow and the circumferential wall stress, due to the approximations employed in the matched asymptotic expansion process. The results on the stream function from the second solution are in agreement with analogous results from other numerical solutions. The second solution predicts that the atherosclerotic plaques may develop in any location around the cross section of the aortic wall unlike to the prescribed locations predicted by the first solution. In addition, it gives circumferential wall stresses augmented by approximately 100% with respect to the matched asymptotic expansions

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

Science.gov (United States)

Lampa, Samuel; Alvarsson, Jonathan; Spjuth, Ola

2016-01-01

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

CP-ABE Based Privacy-Preserving User Profile Matching in Mobile Social Networks.

Directory of Open Access Journals (Sweden)

Weirong Cui

Full Text Available Privacy-preserving profile matching, a challenging task in mobile social networks, is getting more attention in recent years. In this paper, we propose a novel scheme that is based on ciphertext-policy attribute-based encryption to tackle this problem. In our scheme, a user can submit a preference-profile and search for users with matching-profile in decentralized mobile social networks. In this process, no participant's profile and the submitted preference-profile is exposed. Meanwhile, a secure communication channel can be established between the pair of successfully matched users. In contrast to existing related schemes which are mainly based on the secure multi-party computation, our scheme can provide verifiability (both the initiator and any unmatched user cannot cheat each other to pretend to be matched, and requires few interactions among users. We provide thorough security analysis and performance evaluation on our scheme, and show its advantages in terms of security, efficiency and usability over state-of-the-art schemes.

CP-ABE Based Privacy-Preserving User Profile Matching in Mobile Social Networks.

Science.gov (United States)

Cui, Weirong; Du, Chenglie; Chen, Jinchao

2016-01-01

Privacy-preserving profile matching, a challenging task in mobile social networks, is getting more attention in recent years. In this paper, we propose a novel scheme that is based on ciphertext-policy attribute-based encryption to tackle this problem. In our scheme, a user can submit a preference-profile and search for users with matching-profile in decentralized mobile social networks. In this process, no participant's profile and the submitted preference-profile is exposed. Meanwhile, a secure communication channel can be established between the pair of successfully matched users. In contrast to existing related schemes which are mainly based on the secure multi-party computation, our scheme can provide verifiability (both the initiator and any unmatched user cannot cheat each other to pretend to be matched), and requires few interactions among users. We provide thorough security analysis and performance evaluation on our scheme, and show its advantages in terms of security, efficiency and usability over state-of-the-art schemes.

Sparse calibration of subsurface flow models using nonlinear orthogonal matching pursuit and an iterative stochastic ensemble method

KAUST Repository

Elsheikh, Ahmed H.

2013-06-01

We introduce a nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of subsurface flow models. Sparse calibration is a challenging problem as the unknowns are both the non-zero components of the solution and their associated weights. NOMP is a greedy algorithm that discovers at each iteration the most correlated basis function with the residual from a large pool of basis functions. The discovered basis (aka support) is augmented across the nonlinear iterations. Once a set of basis functions are selected, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on stochastically approximated gradient using an iterative stochastic ensemble method (ISEM). In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm. The proposed algorithm is the first ensemble based algorithm that tackels the sparse nonlinear parameter estimation problem. © 2013 Elsevier Ltd.

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

Science.gov (United States)

2010-04-01

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

Robust Point Matching for Non-Rigid Shapes: A Relaxation Labeling Based Approach

National Research Council Canada - National Science Library

Zheng, Yefeng; Doermann, David S

2004-01-01

.... Based on this observation, we formulate point matching as a graph matching problem. Each point is a node in the graph, and two nodes are connected by an edge if their Euclidean distance is less...

Planning Student Flow with Linear Programming: A Tunisian Case Study.

Science.gov (United States)

Bezeau, Lawrence

A student flow model in linear programming format, designed to plan the movement of students into secondary and university programs in Tunisia, is described. The purpose of the plan is to determine a sufficient number of graduating students that would flow back into the system as teachers or move into the labor market to meet fixed manpower…

Stereo matching based on SIFT descriptor with illumination and camera invariance

Science.gov (United States)

Niu, Haitao; Zhao, Xunjie; Li, Chengjin; Peng, Xiang

2010-10-01

Stereo matching is the process of finding corresponding points in two or more images. The description of interest points is a critical aspect of point correspondence which is vital in stereo matching. SIFT descriptor has been proven to be better on the distinctiveness and robustness than other local descriptors. However, SIFT descriptor does not involve color information of feature point which provides powerfully distinguishable feature in matching tasks. Furthermore, in a real scene, image color are affected by various geometric and radiometric factors,such as gamma correction and exposure. These situations are very common in stereo images. For this reason, the color recorded by a camera is not a reliable cue, and the color consistency assumption is no longer valid between stereo images in real scenes. Hence the performance of other SIFT-based stereo matching algorithms can be severely degraded under the radiometric variations. In this paper, we present a new improved SIFT stereo matching algorithms that is invariant to various radiometric variations between left and right images. Unlike other improved SIFT stereo matching algorithms, we explicitly employ the color formation model with the parameters of lighting geometry, illuminant color and camera gamma in SIFT descriptor. Firstly, we transform the input color images to log-chromaticity color space, thus a linear relationship can be established. Then, we use a log-polar histogram to build three color invariance components for SIFT descriptor. So that our improved SIFT descriptor is invariant to lighting geometry, illuminant color and camera gamma changes between left and right images. Then we can match feature points between two images and use SIFT descriptor Euclidean distance as a geometric measure in our data sets to make it further accurate and robust. Experimental results show that our method is superior to other SIFT-based algorithms including conventional stereo matching algorithms under various

Flow Induced Vibration Program at Argonne National Laboratory

International Nuclear Information System (INIS)

1984-01-01

Argonne National Laboratory has had a Flow Induced Vibration Program since 1967; the Program currently resides in the Laboratory's Components Technology Division. Throughout its existence, the overall objective of the program has been to develop and apply new and/or improved methods of analysis and testing for the design evaluation of nuclear reactor plant components and heat exchange equipment from the standpoint of flow induced vibration. Historically, the majority of the program activities have been funded by the US Atomic Energy Commission (AEC), Energy Research and Development Administration (ERDA), and Department of Energy (DOE). Current DOE funding is from the Breeder Mechanical Component Development Division, Office of Breeder Technology Projects; Energy Conversion and Utilization Technology (ECUT) Program, Office of Energy Systems Research; and Division of Engineering, Mathematical and Geosciences, Office of Basic Energy Sciences. Testing of Clinch River Breeder Reactor upper plenum components has been funded by the Clinch River Breeder Reactor Plant (CRBRP) Project Office. Work has also been performed under contract with Foster Wheeler, General Electric, Duke Power Company, US Nuclear Regulatory Commission, and Westinghouse

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

Science.gov (United States)

Narayan, Deepak

2013-01-01

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

MatchGUI: A Graphical MATLAB-Based Tool for Automatic Image Co-Registration

Science.gov (United States)

Ansar, Adnan I.

2011-01-01

MatchGUI software, based on MATLAB, automatically matches two images and displays the match result by superimposing one image on the other. A slider bar allows focus to shift between the two images. There are tools for zoom, auto-crop to overlap region, and basic image markup. Given a pair of ortho-rectified images (focused primarily on Mars orbital imagery for now), this software automatically co-registers the imagery so that corresponding image pixels are aligned. MatchGUI requires minimal user input, and performs a registration over scale and inplane rotation fully automatically

Approximate labeling via graph cuts based on linear programming.

Science.gov (United States)

Komodakis, Nikos; Tziritas, Georgios

2007-08-01

A new framework is presented for both understanding and developing graph-cut-based combinatorial algorithms suitable for the approximate optimization of a very wide class of Markov Random Fields (MRFs) that are frequently encountered in computer vision. The proposed framework utilizes tools from the duality theory of linear programming in order to provide an alternative and more general view of state-of-the-art techniques like the \\alpha-expansion algorithm, which is included merely as a special case. Moreover, contrary to \\alpha-expansion, the derived algorithms generate solutions with guaranteed optimality properties for a much wider class of problems, for example, even for MRFs with nonmetric potentials. In addition, they are capable of providing per-instance suboptimality bounds in all occasions, including discrete MRFs with an arbitrary potential function. These bounds prove to be very tight in practice (that is, very close to 1), which means that the resulting solutions are almost optimal. Our algorithms' effectiveness is demonstrated by presenting experimental results on a variety of low-level vision tasks, such as stereo matching, image restoration, image completion, and optical flow estimation, as well as on synthetic problems.

Flow Induced Vibration Program at Argonne National Laboratory

Science.gov (United States)

1984-01-01

The Argonne National Laboratory's Flow Induced Vibration Program, currently residing in the Laboratory's Components Technology Division is discussed. Throughout its existence, the overall objective of the program was to develop and apply new and/or improved methods of analysis and testing for the design evaluation of nuclear reactor plant components and heat exchange equipment from the standpoint of flow induced vibration. Historically, the majority of the program activities were funded by the US Atomic Energy Commission, the Energy Research and Development Administration, and the Department of Energy. Current DOE funding is from the Breeder Mechanical Component Development Division, Office of Breeder Technology Projects; Energy Conversion and Utilization Technology Program, Office of Energy Systems Research; and Division of Engineering, Mathematical and Geosciences, office of Basic Energy Sciences. Testing of Clinch River Breeder Reactor upper plenum components was funded by the Clinch River Breeder Reactor Plant Project Office. Work was also performed under contract with Foster Wheeler, General Electric, Duke Power Company, US Nuclear Regulatory Commission, and Westinghouse.

Interfacing a General Purpose Fluid Network Flow Program with the SINDA/G Thermal Analysis Program

Science.gov (United States)

Schallhorn, Paul; Popok, Daniel

1999-01-01

A general purpose, one dimensional fluid flow code is currently being interfaced with the thermal analysis program Systems Improved Numerical Differencing Analyzer/Gaski (SINDA/G). The flow code, Generalized Fluid System Simulation Program (GFSSP), is capable of analyzing steady state and transient flow in a complex network. The flow code is capable of modeling several physical phenomena including compressibility effects, phase changes, body forces (such as gravity and centrifugal) and mixture thermodynamics for multiple species. The addition of GFSSP to SINDA/G provides a significant improvement in convective heat transfer modeling for SINDA/G. The interface development is conducted in multiple phases. This paper describes the first phase of the interface which allows for steady and quasi-steady (unsteady solid, steady fluid) conjugate heat transfer modeling.

Thermal-depth matching in dynamic scene based on affine projection and feature registration

Science.gov (United States)

Wang, Hongyu; Jia, Tong; Wu, Chengdong; Li, Yongqiang

2018-03-01

This paper aims to study the construction of 3D temperature distribution reconstruction system based on depth and thermal infrared information. Initially, a traditional calibration method cannot be directly used, because the depth and thermal infrared camera is not sensitive to the color calibration board. Therefore, this paper aims to design a depth and thermal infrared camera calibration board to complete the calibration of the depth and thermal infrared camera. Meanwhile a local feature descriptors in thermal and depth images is proposed. The belief propagation matching algorithm is also investigated based on the space affine transformation matching and local feature matching. The 3D temperature distribution model is built based on the matching of 3D point cloud and 2D thermal infrared information. Experimental results show that the method can accurately construct the 3D temperature distribution model, and has strong robustness.

FLOWNET: A Computer Program for Calculating Secondary Flow Conditions in a Network of Turbomachinery

Science.gov (United States)

Rose, J. R.

1978-01-01

The program requires the network parameters, the flow component parameters, the reservoir conditions, and the gas properties as input. It will then calculate all unknown pressures and the mass flow rate in each flow component in the network. The program can treat networks containing up to fifty flow components and twenty-five unknown network pressures. The types of flow components that can be treated are face seals, narrow slots, and pipes. The program is written in both structured FORTRAN (SFTRAN) and FORTRAN 4. The program must be run in an interactive (conversational) mode.

WNetKAT: A Weighted SDN Programming and Verification Language

DEFF Research Database (Denmark)

Larsen, Kim Guldstrand; Schmid, Stefan; Xue, Bingtian

2017-01-01

Programmability and verifiability lie at the heart of the software-defined networking paradigm. While OpenFlow and its match-action concept provide primitive operations to manipulate hardware configurations, over the last years, several more expressive network programming languages have been...... developed. This paper presents WNetKAT, the first network programming language accounting for the fact that networks are inherently weighted, and communications subject to capacity constraints (e.g., in terms of bandwidth) and costs (e.g., latency or monetary costs). WNetKAT is based on a syntactic...... generalize to more complex (and stateful) network functions and service chains. For example, WNetKAT allows to model flows which need to traverse certain waypoint functions, which can change the traffic rate. This paper also shows the relationship between the equivalence problem of WNet...

State of otolaryngology match: has competition increased since the "early" match?

Science.gov (United States)

Cabrera-Muffly, Cristina; Sheeder, Jeanelle; Abaza, Mona

2015-05-01

To examine fluctuations in supply and demand of otolaryngology residency positions after the shift from an "early match" coordinated by the San Francisco match to a "conventional" matching process through the National Residency Matching Program (NRMP). To determine whether competition among otolaryngology residency positions have changed during this time frame. Database analysis. Matching statistics from 1998 to 2013 were obtained for all first-year residency positions through the NRMP. Matching statistics from 1998 to 2005 were obtained for otolaryngology residency positions through the San Francisco match. Univariate analysis was performed, with a P value less than .05 determined as significant. The number of otolaryngology positions and applicants remained proportional to the overall number of positions and applicants in the NRMP match. Otolaryngology applicants per position and the matching rate of all applicants did not change between the 2 time periods studied. The overall match rate of US seniors applying to otolaryngology did not change, while the match rate of non-US seniors decreased significantly following initiation of the conventional match. There was no significant change in United States Medical Licensing Exam step 1 scores or percentage of unfilled otolaryngology residency positions between the 2 time periods. When comparing the early versus conventional otolaryngology match time periods, the only major change was the decreased percentage of matching among non-US senior applicants. Despite a significant shift in match timing after 2006, the supply, demand, and competitiveness of otolaryngology residency positions have not changed significantly. © American Academy of Otolaryngology—Head and Neck Surgery Foundation 2015.

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

DEFF Research Database (Denmark)

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

2013-01-01

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

A Matlab-Based Testbed for Integration, Evaluation and Comparison of Heterogeneous Stereo Vision Matching Algorithms

Directory of Open Access Journals (Sweden)

Raul Correal

2016-11-01

Full Text Available Stereo matching is a heavily researched area with a prolific published literature and a broad spectrum of heterogeneous algorithms available in diverse programming languages. This paper presents a Matlab-based testbed that aims to centralize and standardize this variety of both current and prospective stereo matching approaches. The proposed testbed aims to facilitate the application of stereo-based methods to real situations. It allows for configuring and executing algorithms, as well as comparing results, in a fast, easy and friendly setting. Algorithms can be combined so that a series of processes can be chained and executed consecutively, using the output of a process as input for the next; some additional filtering and image processing techniques have been included within the testbed for this purpose. A use case is included to illustrate how these processes are sequenced and its effect on the results for real applications. The testbed has been conceived as a collaborative and incremental open-source project, where its code is accessible and modifiable, with the objective of receiving contributions and releasing future versions to include new algorithms and features. It is currently available online for the research community.

DESIGN OF WIRE-WRAPPED ROD BUNDLE MATCHED INDEX-OF-REFRACTION EXPERIMENTS

Energy Technology Data Exchange (ETDEWEB)

Hugh McIlroy; Hongbin Zhang; Kurt Hamman

2008-05-01

Experiments will be conducted in the Idaho National Laboratory (INL) Matched Index-of-Refraction (MIR) Flow Facility [1] to characterize the three-dimensional velocity and turbulence fields in a wire-wrapped rod bundle typically employed in liquid-metal cooled fast reactors and to provide benchmark data for computer code validation. Sodium cooled fast reactors are under consideration for use in the U.S. Department of Energy (DOE) Global Nuclear Energy Partnership (GNEP) program. The experiment model will be constructed of quartz components and the working fluid will be mineral oil. Accurate temperature control (to within 0.05 oC) matches the index-of-refraction of mineral oil with that of quartz and renders the model transparent to the wavelength of laser light employed for optical measurements. The model will be a scaled 7-pin rod bundle enclosed in a hexagonal canister. Flow field measurements will be obtained with a LaVision 3-D particle image velocimeter (PIV) and complimented by near-wall velocity measurements obtained from a 2-D laser Doppler velocimeter (LDV). These measurements will be used as benchmark data for computational fluid dynamics (CFD) validation. The rod bundle model dimensions will be scaled up from the typical dimensions of a fast reactor fuel assembly to provide the maximum Reynolds number achievable in the MIR flow loop. A range of flows from laminar to fully-turbulent will be available with a maximum Reynolds number, based on bundle hydraulic diameter, of approximately 22,000. The fuel pins will be simulated by 85 mm diameter quartz tubes (closed on the inlet ends) and the wire-wrap will be simulated by 25 mm diameter quartz rods. The canister walls will be constructed from quartz plates. The model will be approximately 2.13 m in length. Bundle pressure losses will also be measured and the data recorded for code comparisons. The experiment design and preliminary CFD calculations, which will be used to provide qualitative hydrodynamic

Fuzzy Matching Based on Gray-scale Difference for Quantum Images

Science.gov (United States)

Luo, GaoFeng; Zhou, Ri-Gui; Liu, XingAo; Hu, WenWen; Luo, Jia

2018-05-01

Quantum image processing has recently emerged as an essential problem in practical tasks, e.g. real-time image matching. Previous studies have shown that the superposition and entanglement of quantum can greatly improve the efficiency of complex image processing. In this paper, a fuzzy quantum image matching scheme based on gray-scale difference is proposed to find out the target region in a reference image, which is very similar to the template image. Firstly, we employ the proposed enhanced quantum representation (NEQR) to store digital images. Then some certain quantum operations are used to evaluate the gray-scale difference between two quantum images by thresholding. If all of the obtained gray-scale differences are not greater than the threshold value, it indicates a successful fuzzy matching of quantum images. Theoretical analysis and experiments show that the proposed scheme performs fuzzy matching at a low cost and also enables exponentially significant speedup via quantum parallel computation.

Multi Data Reservoir History Matching using the Ensemble Kalman Filter

KAUST Repository

Katterbauer, Klemens

2015-05-01

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

Provably Correct Control-Flow Graphs from Java Programs with Exceptions

NARCIS (Netherlands)

Amighi, A.; de Carvalho Gomes, Pedro; Huisman, Marieke

2011-01-01

We present an algorithm to extract flow graphs from Java bytecode, focusing on exceptional control flows. We prove its correctness, meaning that the behaviour of the extracted control-flow graph is an over-approximation of the behaviour of the original program. Thus any safety property that holds

Stereo Matching Based On Election Campaign Algorithm

Directory of Open Access Journals (Sweden)

Xie Qing Hua

2016-01-01

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

A long baseline global stereo matching based upon short baseline estimation

Science.gov (United States)

Li, Jing; Zhao, Hong; Li, Zigang; Gu, Feifei; Zhao, Zixin; Ma, Yueyang; Fang, Meiqi

2018-05-01

In global stereo vision, balancing the matching efficiency and computing accuracy seems to be impossible because they contradict each other. In the case of a long baseline, this contradiction becomes more prominent. In order to solve this difficult problem, this paper proposes a novel idea to improve both the efficiency and accuracy in global stereo matching for a long baseline. In this way, the reference images located between the long baseline image pairs are firstly chosen to form the new image pairs with short baselines. The relationship between the disparities of pixels in the image pairs with different baselines is revealed by considering the quantized error so that the disparity search range under the long baseline can be reduced by guidance of the short baseline to gain matching efficiency. Then, the novel idea is integrated into the graph cuts (GCs) to form a multi-step GC algorithm based on the short baseline estimation, by which the disparity map under the long baseline can be calculated iteratively on the basis of the previous matching. Furthermore, the image information from the pixels that are non-occluded under the short baseline but are occluded for the long baseline can be employed to improve the matching accuracy. Although the time complexity of the proposed method depends on the locations of the chosen reference images, it is usually much lower for a long baseline stereo matching than when using the traditional GC algorithm. Finally, the validity of the proposed method is examined by experiments based on benchmark datasets. The results show that the proposed method is superior to the traditional GC method in terms of efficiency and accuracy, and thus it is suitable for long baseline stereo matching.

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

Science.gov (United States)

2010-06-02

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

Programming heterogeneous MPSoCs tool flows to close the software productivity gap

CERN Document Server

Castrillón Mazo, Jerónimo

2014-01-01

This book provides embedded software developers with techniques for programmingheterogeneous Multi-Processor Systems-on-Chip (MPSoCs), capable of executing multiple applications simultaneously. It describes a set of algorithms and methodologies to narrow the software productivity gap, as well as an in-depth description of the underlying problems and challenges of today’s programming practices. The authors present four different tool flows: A parallelism extraction flow for applications writtenusing the C programming language, a mapping and scheduling flow for parallel applications, a special mapping flow for baseband applications in the context of Software Defined Radio (SDR) and a final flow for analyzing multiple applications at design time. The tool flows are evaluated on Virtual Platforms (VPs), which mimic different characteristics of state-of-the-art heterogeneous MPSoCs.   • Provides a novel set of algorithms and methodologies for programming heterogeneous Multi-Processor Systems-on-Chip (MPSoCs)...

AN INTEGRATED RANSAC AND GRAPH BASED MISMATCH ELIMINATION APPROACH FOR WIDE-BASELINE IMAGE MATCHING

Directory of Open Access Journals (Sweden)

M. Hasheminasab

2015-12-01

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

Program Computes Flows Of Fluids And Heat

Science.gov (United States)

Cullimore, Brent; Ring, Steven; Welch, Mark

1993-01-01

SINDA'85/FLUINT incorporates lumped-parameter-network and one-dimensional-flow mathematical models. System enables analysis of mutual influences of thermal and flow phenomena. Offers two finite-difference numerical solution techniques: forward-difference explicit approximation and Crank-Nicholson approximation. Enables simulation of nonuniform heating and facilitates mathematical modeling of thin-walled heat exchangers. Ability to model nonequilibrium behavior within two-phase volumes included. Recent changes in program improve modeling of real evaporator pumps and other capillary-assist evaporators. Written in FORTRAN 77.

A Learning-Based Steganalytic Method against LSB Matching Steganography

Directory of Open Access Journals (Sweden)

Z. Xia

2011-04-01

Full Text Available This paper considers the detection of spatial domain least significant bit (LSB matching steganography in gray images. Natural images hold some inherent properties, such as histogram, dependence between neighboring pixels, and dependence among pixels that are not adjacent to each other. These properties are likely to be disturbed by LSB matching. Firstly, histogram will become smoother after LSB matching. Secondly, the two kinds of dependence will be weakened by the message embedding. Accordingly, three features, which are respectively based on image histogram, neighborhood degree histogram and run-length histogram, are extracted at first. Then, support vector machine is utilized to learn and discriminate the difference of features between cover and stego images. Experimental results prove that the proposed method possesses reliable detection ability and outperforms the two previous state-of-the-art methods. Further more, the conclusions are drawn by analyzing the individual performance of three features and their fused feature.

Visual Localization across Seasons Using Sequence Matching Based on Multi-Feature Combination.

Science.gov (United States)

Qiao, Yongliang

2017-10-25

Visual localization is widely used in autonomous navigation system and Advanced Driver Assistance Systems (ADAS). However, visual-based localization in seasonal changing situations is one of the most challenging topics in computer vision and the intelligent vehicle community. The difficulty of this task is related to the strong appearance changes that occur in scenes due to weather or season changes. In this paper, a place recognition based visual localization method is proposed, which realizes the localization by identifying previously visited places using the sequence matching method. It operates by matching query image sequences to an image database acquired previously (video acquired during traveling period). In this method, in order to improve matching accuracy, multi-feature is constructed by combining a global GIST descriptor and local binary feature CSLBP (Center-symmetric local binary patterns) to represent image sequence. Then, similarity measurement according to Chi-square distance is used for effective sequences matching. For experimental evaluation, the relationship between image sequence length and sequences matching performance is studied. To show its effectiveness, the proposed method is tested and evaluated in four seasons outdoor environments. The results have shown improved precision-recall performance against the state-of-the-art SeqSLAM algorithm.

Age-matched normal values and topographic maps for regional cerebral blood flow measurements by Xe-133 inhalation

International Nuclear Information System (INIS)

Matsuda, H.; Maeda, T.; Yamada, M.; Gui, L.X.; Tonami, N.; Hisada, K.

1984-01-01

The relationship between normal aging and regional cerebral blood flow (rCBF) computed as initial slope index (ISI) by Fourier method was investigated in 105 right-handed healthy volunteers (132 measurements) by Xe-133 inhalation method, and age-matched normal values were calculated. Mean brain ISI values showed significant negative correlation with advancing age (r . 0.70, p less than 0.001), and the regression line and its 95% confidence interval was Y . -0.32 (X - 19) + 63.5 +/- 11.2 (19 less than or equal to X less than or equal to 80). Regional ISI values also showed significant negative correlations for the entire brain (p less than 0.001). The regional reductions of ISI values with advancing age were significantly greater in the regional distribution of the middle cerebral arteries bilaterally, compared with regions in the distribution of the other arteries (p less than 0.05). Therefore, measured rCBF values for patients must be compared to age-matched normal values for mean hemispheric and each region examined. Two kinds of topographic maps, brain map showing rCBF compared to age-matched normal values and showing hemispheric differences were made by dividing patient's values by the 95% confidence limits for age-matched normal values and displaying laterality index calculated as follows, respectively. (formula; see text) These maps were useful for evaluating significantly decreased or increased regions and regional hemispheric differences

MOCC: A Fast and Robust Correlation-Based Method for Interest Point Matching under Large Scale Changes

Science.gov (United States)

Zhao, Feng; Huang, Qingming; Wang, Hao; Gao, Wen

2010-12-01

Similarity measures based on correlation have been used extensively for matching tasks. However, traditional correlation-based image matching methods are sensitive to rotation and scale changes. This paper presents a fast correlation-based method for matching two images with large rotation and significant scale changes. Multiscale oriented corner correlation (MOCC) is used to evaluate the degree of similarity between the feature points. The method is rotation invariant and capable of matching image pairs with scale changes up to a factor of 7. Moreover, MOCC is much faster in comparison with the state-of-the-art matching methods. Experimental results on real images show the robustness and effectiveness of the proposed method.

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

International Nuclear Information System (INIS)

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

1975-01-01

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

Field research program for unsaturated flow and transport experimentation

International Nuclear Information System (INIS)

Tidwell, V.C.; Rautman, C.A.; Glass, R.J.

1992-01-01

As part of the Yucca Mountain Site Characterization Project, a field research program has been developed to refine and validate models for flow and transport through unsaturated fractured rock. Validation of these models within the range of their application for performance assessment requires a more sophisticated understanding of the processes that govern flow and transport within fractured porous media than currently exists. In particular, our research is prioritized according to understanding and modeling processes that, if not accurately incorporated into performance assessment models, would adversely impact the project's ability to evaluate repository performance. For this reason, we have oriented our field program toward enhancing our understanding of scaling processes as they relate to effective media property modeling, as well as to the conceptual modeling of complex flow and transport phenomena

Visual color matching system based on RGB LED light source

Science.gov (United States)

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

2018-01-01

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

Multiple Constraints Based Robust Matching of Poor-Texture Close-Range Images for Monitoring a Simulated Landslide

Directory of Open Access Journals (Sweden)

Gang Qiao

2016-05-01

Full Text Available Landslides are one of the most destructive geo-hazards that can bring about great threats to both human lives and infrastructures. Landslide monitoring has been always a research hotspot. In particular, landslide simulation experimentation is an effective tool in landslide research to obtain critical parameters that help understand the mechanism and evaluate the triggering and controlling factors of slope failure. Compared with other traditional geotechnical monitoring approaches, the close-range photogrammetry technique shows potential in tracking and recording the 3D surface deformation and failure processes. In such cases, image matching usually plays a critical role in stereo image processing for the 3D geometric reconstruction. However, the complex imaging conditions such as rainfall, mass movement, illumination, and ponding will reduce the texture quality of the stereo images, bringing about difficulties in the image matching process and resulting in very sparse matches. To address this problem, this paper presents a multiple-constraints based robust image matching approach for poor-texture close-range images particularly useful in monitoring a simulated landslide. The Scale Invariant Feature Transform (SIFT algorithm was first applied to the stereo images for generation of scale-invariate feature points, followed by a two-step matching process: feature-based image matching and area-based image matching. In the first feature-based matching step, the triangulation process was performed based on the SIFT matches filtered by the Fundamental Matrix (FM and a robust checking procedure, to serve as the basic constraints for feature-based iterated matching of all the non-matched SIFT-derived feature points inside each triangle. In the following area-based image-matching step, the corresponding points of the non-matched features in each triangle of the master image were predicted in the homologous triangle of the searching image by using geometric

Analysis of a mammography teaching program based on an affordance design model.

Science.gov (United States)

Luo, Ping; Eikman, Edward A; Kealy, William; Qian, Wei

2006-12-01

The wide use of computer technology in education, particularly in mammogram reading, asks for e-learning evaluation. The existing media comparative studies, learner attitude evaluations, and performance tests are problematic. Based on an affordance design model, this study examined an existing e-learning program on mammogram reading. The selection criteria include content relatedness, representativeness, e-learning orientation, image quality, program completeness, and accessibility. A case study was conducted to examine the affordance features, functions, and presentations of the selected software. Data collection and analysis methods include interviews, protocol-based document analysis, and usability tests and inspection. Also some statistics were calculated. The examination of PBE identified that this educational software designed and programmed some tools. The learner can use these tools in the process of optimizing displays, scanning images, comparing different projections, marking the region of interests, constructing a descriptive report, assessing one's learning outcomes, and comparing one's decisions with the experts' decisions. Further, PBE provides some resources for the learner to construct one's knowledge and skills, including a categorized image library, a term-searching function, and some teaching links. Besides, users found it easy to navigate and carry out tasks. The users also reacted positively toward PBE's navigation system, instructional aids, layout, pace and flow of information, graphics, and other presentation design. The software provides learners with some cognitive tools, supporting their perceptual problem-solving processes and extending their capabilities. Learners can internalize the mental models in mammogram reading through multiple perceptual triangulations, sensitization of related features, semantic description of mammogram findings, and expert-guided semantic report construction. The design of these cognitive tools and the

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

Science.gov (United States)

2011-03-02

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

Matching Aerial Images to 3D Building Models Using Context-Based Geometric Hashing

Directory of Open Access Journals (Sweden)

Jaewook Jung

2016-06-01

Full Text Available A city is a dynamic entity, which environment is continuously changing over time. Accordingly, its virtual city models also need to be regularly updated to support accurate model-based decisions for various applications, including urban planning, emergency response and autonomous navigation. A concept of continuous city modeling is to progressively reconstruct city models by accommodating their changes recognized in spatio-temporal domain, while preserving unchanged structures. A first critical step for continuous city modeling is to coherently register remotely sensed data taken at different epochs with existing building models. This paper presents a new model-to-image registration method using a context-based geometric hashing (CGH method to align a single image with existing 3D building models. This model-to-image registration process consists of three steps: (1 feature extraction; (2 similarity measure; and matching, and (3 estimating exterior orientation parameters (EOPs of a single image. For feature extraction, we propose two types of matching cues: edged corner features representing the saliency of building corner points with associated edges, and contextual relations among the edged corner features within an individual roof. A set of matched corners are found with given proximity measure through geometric hashing, and optimal matches are then finally determined by maximizing the matching cost encoding contextual similarity between matching candidates. Final matched corners are used for adjusting EOPs of the single airborne image by the least square method based on collinearity equations. The result shows that acceptable accuracy of EOPs of a single image can be achievable using the proposed registration approach as an alternative to a labor-intensive manual registration process.

Visual Localization across Seasons Using Sequence Matching Based on Multi-Feature Combination

Directory of Open Access Journals (Sweden)

Yongliang Qiao

2017-10-01

Full Text Available Visual localization is widely used in autonomous navigation system and Advanced Driver Assistance Systems (ADAS. However, visual-based localization in seasonal changing situations is one of the most challenging topics in computer vision and the intelligent vehicle community. The difficulty of this task is related to the strong appearance changes that occur in scenes due to weather or season changes. In this paper, a place recognition based visual localization method is proposed, which realizes the localization by identifying previously visited places using the sequence matching method. It operates by matching query image sequences to an image database acquired previously (video acquired during traveling period. In this method, in order to improve matching accuracy, multi-feature is constructed by combining a global GIST descriptor and local binary feature CSLBP (Center-symmetric local binary patterns to represent image sequence. Then, similarity measurement according to Chi-square distance is used for effective sequences matching. For experimental evaluation, the relationship between image sequence length and sequences matching performance is studied. To show its effectiveness, the proposed method is tested and evaluated in four seasons outdoor environments. The results have shown improved precision–recall performance against the state-of-the-art SeqSLAM algorithm.

MOCC: A Fast and Robust Correlation-Based Method for Interest Point Matching under Large Scale Changes

Directory of Open Access Journals (Sweden)

Wang Hao

2010-01-01

Full Text Available Similarity measures based on correlation have been used extensively for matching tasks. However, traditional correlation-based image matching methods are sensitive to rotation and scale changes. This paper presents a fast correlation-based method for matching two images with large rotation and significant scale changes. Multiscale oriented corner correlation (MOCC is used to evaluate the degree of similarity between the feature points. The method is rotation invariant and capable of matching image pairs with scale changes up to a factor of 7. Moreover, MOCC is much faster in comparison with the state-of-the-art matching methods. Experimental results on real images show the robustness and effectiveness of the proposed method.

Different elution modes and field programming in gravitational field-flow fractionation. III. Field programming by flow-rate gradient generated by a programmable pump

Czech Academy of Sciences Publication Activity Database

Plocková, Jana; Chmelík, Josef

2001-01-01

Roč. 918, č. 2 (2001), s. 361-370 ISSN 0021-9673 R&D Projects: GA AV ČR IAA4031805 Institutional research plan: CEZ:AV0Z4031919 Keywords : field-flow fractionation * field programming * flow-rate gradients Subject RIV: CB - Analytical Chemistry, Separation Impact factor: 2.793, year: 2001

A Line-Based Adaptive-Weight Matching Algorithm Using Loopy Belief Propagation

Directory of Open Access Journals (Sweden)

Hui Li

2015-01-01

Full Text Available In traditional adaptive-weight stereo matching, the rectangular shaped support region requires excess memory consumption and time. We propose a novel line-based stereo matching algorithm for obtaining a more accurate disparity map with low computation complexity. This algorithm can be divided into two steps: disparity map initialization and disparity map refinement. In the initialization step, a new adaptive-weight model based on the linear support region is put forward for cost aggregation. In this model, the neural network is used to evaluate the spatial proximity, and the mean-shift segmentation method is used to improve the accuracy of color similarity; the Birchfield pixel dissimilarity function and the census transform are adopted to establish the dissimilarity measurement function. Then the initial disparity map is obtained by loopy belief propagation. In the refinement step, the disparity map is optimized by iterative left-right consistency checking method and segmentation voting method. The parameter values involved in this algorithm are determined with many simulation experiments to further improve the matching effect. Simulation results indicate that this new matching method performs well on standard stereo benchmarks and running time of our algorithm is remarkably lower than that of algorithm with rectangle-shaped support region.

Fan fault diagnosis based on symmetrized dot pattern analysis and image matching

Science.gov (United States)

Xu, Xiaogang; Liu, Haixiao; Zhu, Hao; Wang, Songling

2016-07-01

To detect the mechanical failure of fans, a new diagnostic method based on the symmetrized dot pattern (SDP) analysis and image matching is proposed. Vibration signals of 13 kinds of running states are acquired on a centrifugal fan test bed and reconstructed by the SDP technique. The SDP pattern templates of each running state are established. An image matching method is performed to diagnose the fault. In order to improve the diagnostic accuracy, the single template, multiple templates and clustering fault templates are used to perform the image matching.

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

Science.gov (United States)

2012-03-06

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

Hybrid Information Flow Analysis for Programs with Arrays

Directory of Open Access Journals (Sweden)

Gergö Barany

2016-07-01

Full Text Available Information flow analysis checks whether certain pieces of (confidential data may affect the results of computations in unwanted ways and thus leak information. Dynamic information flow analysis adds instrumentation code to the target software to track flows at run time and raise alarms if a flow policy is violated; hybrid analyses combine this with preliminary static analysis. Using a subset of C as the target language, we extend previous work on hybrid information flow analysis that handled pointers to scalars. Our extended formulation handles arrays, pointers to array elements, and pointer arithmetic. Information flow through arrays of pointers is tracked precisely while arrays of non-pointer types are summarized efficiently. A prototype of our approach is implemented using the Frama-C program analysis and transformation framework. Work on a full machine-checked proof of the correctness of our approach using Isabelle/HOL is well underway; we present the existing parts and sketch the rest of the correctness argument.

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

Science.gov (United States)

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

2018-02-01

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

MOCC: A Fast and Robust Correlation-Based Method for Interest Point Matching under Large Scale Changes

OpenAIRE

Wang Hao; Gao Wen; Huang Qingming; Zhao Feng

2010-01-01

Similarity measures based on correlation have been used extensively for matching tasks. However, traditional correlation-based image matching methods are sensitive to rotation and scale changes. This paper presents a fast correlation-based method for matching two images with large rotation and significant scale changes. Multiscale oriented corner correlation (MOCC) is used to evaluate the degree of similarity between the feature points. The method is rotation invariant and capable of matchin...

Flow discharge prediction in compound channels using linear genetic programming

Science.gov (United States)

Azamathulla, H. Md.; Zahiri, A.

2012-08-01

SummaryFlow discharge determination in rivers is one of the key elements in mathematical modelling in the design of river engineering projects. Because of the inundation of floodplains and sudden changes in river geometry, flow resistance equations are not applicable for compound channels. Therefore, many approaches have been developed for modification of flow discharge computations. Most of these methods have satisfactory results only in laboratory flumes. Due to the ability to model complex phenomena, the artificial intelligence methods have recently been employed for wide applications in various fields of water engineering. Linear genetic programming (LGP), a branch of artificial intelligence methods, is able to optimise the model structure and its components and to derive an explicit equation based on the variables of the phenomena. In this paper, a precise dimensionless equation has been derived for prediction of flood discharge using LGP. The proposed model was developed using published data compiled for stage-discharge data sets for 394 laboratories, and field of 30 compound channels. The results indicate that the LGP model has a better performance than the existing models.

SNPsnap: a Web-based tool for identification and annotation of matched SNPs

DEFF Research Database (Denmark)

Pers, Tune Hannes; Timshel, Pascal; Hirschhorn, Joel N.

2015-01-01

-localization of GWAS signals to gene-dense and high linkage disequilibrium (LD) regions, and correlations of gene size, location and function. The SNPsnap Web server enables SNP-based enrichment analysis by providing matched sets of SNPs that can be used to calibrate background expectations. Specifically, SNPsnap...... efficiently identifies sets of randomly drawn SNPs that are matched to a set of query SNPs based on allele frequency, number of SNPs in LD, distance to nearest gene and gene density. Availability and implementation : SNPsnap server is available at http://www.broadinstitute.org/mpg/snpsnap/. Contact: joelh...

Object-Based Dense Matching Method for Maintaining Structure Characteristics of Linear Buildings.

Science.gov (United States)

Su, Nan; Yan, Yiming; Qiu, Mingjie; Zhao, Chunhui; Wang, Liguo

2018-03-29

In this paper, we proposed a novel object-based dense matching method specially for the high-precision disparity map of building objects in urban areas, which can maintain accurate object structure characteristics. The proposed framework mainly includes three stages. Firstly, an improved edge line extraction method is proposed for the edge segments to fit closely to building outlines. Secondly, a fusion method is proposed for the outlines under the constraint of straight lines, which can maintain the building structural attribute with parallel or vertical edges, which is very useful for the dense matching method. Finally, we proposed an edge constraint and outline compensation (ECAOC) dense matching method to maintain building object structural characteristics in the disparity map. In the proposed method, the improved edge lines are used to optimize matching search scope and matching template window, and the high-precision building outlines are used to compensate the shape feature of building objects. Our method can greatly increase the matching accuracy of building objects in urban areas, especially at building edges. For the outline extraction experiments, our fusion method verifies the superiority and robustness on panchromatic images of different satellites and different resolutions. For the dense matching experiments, our ECOAC method shows great advantages for matching accuracy of building objects in urban areas compared with three other methods.

Object-Based Dense Matching Method for Maintaining Structure Characteristics of Linear Buildings

Directory of Open Access Journals (Sweden)

Nan Su

2018-03-01

Full Text Available In this paper, we proposed a novel object-based dense matching method specially for the high-precision disparity map of building objects in urban areas, which can maintain accurate object structure characteristics. The proposed framework mainly includes three stages. Firstly, an improved edge line extraction method is proposed for the edge segments to fit closely to building outlines. Secondly, a fusion method is proposed for the outlines under the constraint of straight lines, which can maintain the building structural attribute with parallel or vertical edges, which is very useful for the dense matching method. Finally, we proposed an edge constraint and outline compensation (ECAOC dense matching method to maintain building object structural characteristics in the disparity map. In the proposed method, the improved edge lines are used to optimize matching search scope and matching template window, and the high-precision building outlines are used to compensate the shape feature of building objects. Our method can greatly increase the matching accuracy of building objects in urban areas, especially at building edges. For the outline extraction experiments, our fusion method verifies the superiority and robustness on panchromatic images of different satellites and different resolutions. For the dense matching experiments, our ECOAC method shows great advantages for matching accuracy of building objects in urban areas compared with three other methods.

The established mega watt linear programming-based optimal power flow model applied to the real power 56-bus system in eastern province of Saudi Arabia

International Nuclear Information System (INIS)

Al-Muhawesh, Tareq A.; Qamber, Isa S.

2008-01-01

A current trend in electric power industries is the deregulation around the world. One of the questions arise during any deregulation process is: where will be the future generation expansion? In the present paper, the study is concentrated on the wheeling computational method as a part of mega watt (MW) linear programming-based optimal power flow (LP-based OPF) method. To observe the effects of power wheeling on the power system operations, the paper uses linear interactive and discrete optimizer (LINDO) optimizer software as a powerful tool for solving linear programming problems to evaluate the influence of the power wheeling. As well, the paper uses the optimization tool to solve the economic generation dispatch and transmission management problems. The transmission line flow was taken in consideration with some constraints discussed in this paper. The complete linear model of the MW LP-based OPF, which is used to know the future generation potential areas in any utility is proposed. The paper also explains the available economic load dispatch (ELD) as the basic optimization tool to dispatch the power system. It can be concluded in the present study that accuracy is expensive in terms of money and time and in the competitive market enough accuracy is needed without paying much

A Study on Data Base for the Pyroprocessing Material Flow and MUF Uncertainty Simulation

International Nuclear Information System (INIS)

Sitompul, Yos Panagaman; Shin, Heesung; Han, Boyoung; Kim, Hodong

2011-01-01

The data base for the pyroprocessing material flow and MUF uncertainty simulation has been implemented well. There is no error in the data base processing and it is relatively fast by using OLEDB and MySQL. The important issue is the data base size. In OLEDB the data base size is limited to 2 Gb. To reduce the data base size, we give an option for users to filter the input nuclides based on their masses and activities. A simulation program called PYMUS has been developed to study the pyroprocessing material flow and MUF. In the program, there is a data base system that controls the data processing in the simulation. The data base system consists of input data base, data processing, and output data base. The data base system has been designed in such a way to be efficient. One example is using the OLEDB and MySQL. The data base system is explained in detail in this paper. The result shows that the data base system works well in the simulation

Athermalization in atomic force microscope based force spectroscopy using matched microstructure coupling.

Science.gov (United States)

Torun, H; Finkler, O; Degertekin, F L

2009-07-01

The authors describe a method for athermalization in atomic force microscope (AFM) based force spectroscopy applications using microstructures that thermomechanically match the AFM probes. The method uses a setup where the AFM probe is coupled with the matched structure and the displacements of both structures are read out simultaneously. The matched structure displaces with the AFM probe as temperature changes, thus the force applied to the sample can be kept constant without the need for a separate feedback loop for thermal drift compensation, and the differential signal can be used to cancel the shift in zero-force level of the AFM.

Robust Automatic Target Recognition via HRRP Sequence Based on Scatterer Matching

Directory of Open Access Journals (Sweden)

Yuan Jiang

2018-02-01

Full Text Available High resolution range profile (HRRP plays an important role in wideband radar automatic target recognition (ATR. In order to alleviate the sensitivity to clutter and target aspect, employing a sequence of HRRP is a promising approach to enhance the ATR performance. In this paper, a novel HRRP sequence-matching method based on singular value decomposition (SVD is proposed. First, the HRRP sequence is decoupled into the angle space and the range space via SVD, which correspond to the span of the left and the right singular vectors, respectively. Second, atomic norm minimization (ANM is utilized to estimate dominant scatterers in the range space and the Hausdorff distance is employed to measure the scatter similarity between the test and training data. Next, the angle space similarity between the test and training data is evaluated based on the left singular vector correlations. Finally, the range space matching result and the angle space correlation are fused with the singular values as weights. Simulation and outfield experimental results demonstrate that the proposed matching metric is a robust similarity measure for HRRP sequence recognition.

Sensor-based vibration signal feature extraction using an improved composite dictionary matching pursuit algorithm.

Science.gov (United States)

Cui, Lingli; Wu, Na; Wang, Wenjing; Kang, Chenhui

2014-09-09

This paper presents a new method for a composite dictionary matching pursuit algorithm, which is applied to vibration sensor signal feature extraction and fault diagnosis of a gearbox. Three advantages are highlighted in the new method. First, the composite dictionary in the algorithm has been changed from multi-atom matching to single-atom matching. Compared to non-composite dictionary single-atom matching, the original composite dictionary multi-atom matching pursuit (CD-MaMP) algorithm can achieve noise reduction in the reconstruction stage, but it cannot dramatically reduce the computational cost and improve the efficiency in the decomposition stage. Therefore, the optimized composite dictionary single-atom matching algorithm (CD-SaMP) is proposed. Second, the termination condition of iteration based on the attenuation coefficient is put forward to improve the sparsity and efficiency of the algorithm, which adjusts the parameters of the termination condition constantly in the process of decomposition to avoid noise. Third, composite dictionaries are enriched with the modulation dictionary, which is one of the important structural characteristics of gear fault signals. Meanwhile, the termination condition of iteration settings, sub-feature dictionary selections and operation efficiency between CD-MaMP and CD-SaMP are discussed, aiming at gear simulation vibration signals with noise. The simulation sensor-based vibration signal results show that the termination condition of iteration based on the attenuation coefficient enhances decomposition sparsity greatly and achieves a good effect of noise reduction. Furthermore, the modulation dictionary achieves a better matching effect compared to the Fourier dictionary, and CD-SaMP has a great advantage of sparsity and efficiency compared with the CD-MaMP. The sensor-based vibration signals measured from practical engineering gearbox analyses have further shown that the CD-SaMP decomposition and reconstruction algorithm

Sensor-Based Vibration Signal Feature Extraction Using an Improved Composite Dictionary Matching Pursuit Algorithm

Directory of Open Access Journals (Sweden)

Lingli Cui

2014-09-01

Full Text Available This paper presents a new method for a composite dictionary matching pursuit algorithm, which is applied to vibration sensor signal feature extraction and fault diagnosis of a gearbox. Three advantages are highlighted in the new method. First, the composite dictionary in the algorithm has been changed from multi-atom matching to single-atom matching. Compared to non-composite dictionary single-atom matching, the original composite dictionary multi-atom matching pursuit (CD-MaMP algorithm can achieve noise reduction in the reconstruction stage, but it cannot dramatically reduce the computational cost and improve the efficiency in the decomposition stage. Therefore, the optimized composite dictionary single-atom matching algorithm (CD-SaMP is proposed. Second, the termination condition of iteration based on the attenuation coefficient is put forward to improve the sparsity and efficiency of the algorithm, which adjusts the parameters of the termination condition constantly in the process of decomposition to avoid noise. Third, composite dictionaries are enriched with the modulation dictionary, which is one of the important structural characteristics of gear fault signals. Meanwhile, the termination condition of iteration settings, sub-feature dictionary selections and operation efficiency between CD-MaMP and CD-SaMP are discussed, aiming at gear simulation vibration signals with noise. The simulation sensor-based vibration signal results show that the termination condition of iteration based on the attenuation coefficient enhances decomposition sparsity greatly and achieves a good effect of noise reduction. Furthermore, the modulation dictionary achieves a better matching effect compared to the Fourier dictionary, and CD-SaMP has a great advantage of sparsity and efficiency compared with the CD-MaMP. The sensor-based vibration signals measured from practical engineering gearbox analyses have further shown that the CD-SaMP decomposition and

Artificial intelligence (AI)-based relational matching and multimodal medical image fusion: generalized 3D approaches

Science.gov (United States)

Vajdic, Stevan M.; Katz, Henry E.; Downing, Andrew R.; Brooks, Michael J.

1994-09-01

A 3D relational image matching/fusion algorithm is introduced. It is implemented in the domain of medical imaging and is based on Artificial Intelligence paradigms--in particular, knowledge base representation and tree search. The 2D reference and target images are selected from 3D sets and segmented into non-touching and non-overlapping regions, using iterative thresholding and/or knowledge about the anatomical shapes of human organs. Selected image region attributes are calculated. Region matches are obtained using a tree search, and the error is minimized by evaluating a `goodness' of matching function based on similarities of region attributes. Once the matched regions are found and the spline geometric transform is applied to regional centers of gravity, images are ready for fusion and visualization into a single 3D image of higher clarity.

Coalition-based multimedia peer matching strategies for P2P networks

Science.gov (United States)

Park, Hyunggon; van der Schaar, Mihaela

2008-01-01

In this paper, we consider the problem of matching users for multimedia transmission in peer-to-peer (P2P) networks and identify strategies for fair resource division among the matched multimedia peers. We propose a framework for coalition formation, which enables users to form a group of matched peers where they can interact cooperatively and negotiate resources based on their satisfaction with the coalition, determined by explicitly considering the peer's multimedia attributes. In addition, our proposed approach goes a step further by introducing the concept of marginal contribution, which is the value improvement of the coalition induced by an incoming peer. We show that the best way for a peer to select a coalition is to choose the coalition that provides the largest division of marginal contribution given a deployed value-division scheme. Moreover, we model the utility function by explicitly considering each peer's attributes as well as the cost for uploading content. To quantify the benefit that users derive from a coalition, we define the value of a coalition based on the total utility that all peers can achieve jointly in the coalition. Based on this definition of the coalition value, we use an axiomatic bargaining solution in order to fairly negotiate the value division of the upload bandwidth given each peer's attributes.

Hybrid Video Coding Based on Bidimensional Matching Pursuit

Directory of Open Access Journals (Sweden)

Lorenzo Granai

2004-12-01

Full Text Available Hybrid video coding combines together two stages: first, motion estimation and compensation predict each frame from the neighboring frames, then the prediction error is coded, reducing the correlation in the spatial domain. In this work, we focus on the latter stage, presenting a scheme that profits from some of the features introduced by the standard H.264/AVC for motion estimation and replaces the transform in the spatial domain. The prediction error is so coded using the matching pursuit algorithm which decomposes the signal over an appositely designed bidimensional, anisotropic, redundant dictionary. Comparisons are made among the proposed technique, H.264, and a DCT-based coding scheme. Moreover, we introduce fast techniques for atom selection, which exploit the spatial localization of the atoms. An adaptive coding scheme aimed at optimizing the resource allocation is also presented, together with a rate-distortion study for the matching pursuit algorithm. Results show that the proposed scheme outperforms the standard DCT, especially at very low bit rates.

Sound Control-Flow Graph Extraction for Java Programs with Exceptions

NARCIS (Netherlands)

Amighi, A.; de Carvalho Gomes, Pedro; Gurov, Dilian; Huisman, Marieke; Eleftherakis, George; Hinchey, Mike; Holcombe, Mike

2012-01-01

We present an algorithm to extract control-flow graphs from Java bytecode, considering exceptional flows. We then establish its correctness: the behavior of the extracted graphs is shown to be a sound over-approximation of the behavior of the original programs. Thus, any temporal safety property

Effectiveness of Structured Teacher Adaptations to an Evidence-Based Summer Literacy Program

Science.gov (United States)

Kim, James S.; Burkhauser, Mary A.; Quinn, David M.; Guryan, Jonathan; Kingston, Helen Chen; Aleman, Kirsten

2017-01-01

The authors conducted a cluster-randomized trial to examine the effectiveness of structured teacher adaptations to the implementation of an evidence-based summer literacy program that provided students with (a) books matched to their reading level and interests and (b) teacher scaffolding for summer reading in the form of end-of-year comprehension…

POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY

Directory of Open Access Journals (Sweden)

S. Chen

2016-06-01

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

Dimensions of flow during an experiential wilderness science program

Science.gov (United States)

Wang, Robert

Over the past twenty-five years, there has been an alarming decline in academic performance among American students. This trend is seen in failing test scores, poor attendance, and low first-year retention rates at post-secondary institutions. There have been numerous studies that have examined this issue but few to offer solutions. Mihalyi Csikszentmihalyi, the originator of flow theory, suggests that poor academic performance might be best explained in terms of lack of student motivation and engagement (flow) rather than a lack of cognitive abilities. This study was designed to examine a series of activities conducted during an Experiential Wilderness Science Program at a college located in the Rocky Mountain region. Specifically, this study measured student engagement for each activity and described the dimensions (phenomenological, instructional, etc.) that were present when there was a high frequency of engagement among program participants. A combined quantitative and qualitative research methodology was utilized. The Experience Sampling Form (ESF) was administered to 41 freshman students participating in a 3-day wilderness science program to measure the frequency of engagement (flow) for nine different activities. A qualitative investigation using journals, participant interviews, and focus groups was used to describe the dimensions that were present when a high frequency of engagement among program participants was observed. Results revealed that engagement (flow) was highest during two challenge education activities and during a river sampling activity. Dimensions common among these activities included: an environment dimension, a motivation dimension, and an instruction dimension. The environment dimension included: incorporating novel learning activities, creating student interests, and introducing an element of perceived risk. The motivation dimension included: developing internal loci of control, facilitating high levels of self-efficacy, and

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

Directory of Open Access Journals (Sweden)

Jill A Hollenbach

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

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

Science.gov (United States)

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

2015-01-01

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

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

Science.gov (United States)

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

2014-01-01

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

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

CSIR Research Space (South Africa)

Mlambo, CS

2016-12-01

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

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

Science.gov (United States)

2013-01-23

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

Conceptual plan: Two-Phase Flow Laboratory Program for the Waste Isolation Pilot Plant

International Nuclear Information System (INIS)

Howarth, S.M.

1993-07-01

The Salado Two-Phase Flow Laboratory Program was established to address concerns regarding two-phase flow properties and to provide WIPP-specific, geologically consistent experimental data to develop more appropriate correlations for Salado rock to replace those currently used in Performance Assessment models. Researchers in Sandia's Fluid Flow and Transport Department originally identified and emphasized the need for laboratory measurements of Salado threshold pressure and relative permeability. The program expanded to include the measurement of capillary pressure, rock compressibility, porosity, and intrinsic permeability and the assessment of core damage. Sensitivity analyses identified the anhydrite interbed layers as the most likely path for the dissipation of waste-generated gas from waste-storage rooms because of their relatively high permeability. Due to this the program will initially focus on the anhydrite interbed material. The program may expand to include similar rock and flow measurements on other WIPP materials including impure halite, pure halite, and backfill and seal materials. This conceptual plan presents the scope, objectives, and historical documentation of the development of the Salado Two-Phase Flow Program through January 1993. Potential laboratory techniques for assessing core damage and measuring porosity, rock compressibility, capillary and threshold pressure, permeability as a function of stress, and relative permeability are discussed. Details of actual test designs, test procedures, and data analysis are not included in this report, but will be included in the Salado Two-Phase Flow Laboratory Program Test Plan pending the results of experimental and other scoping activities in FY93

Data-flow Analysis of Programs with Associative Arrays

Directory of Open Access Journals (Sweden)

David Hauzar

2014-05-01

Full Text Available Dynamic programming languages, such as PHP, JavaScript, and Python, provide built-in data structures including associative arrays and objects with similar semantics—object properties can be created at run-time and accessed via arbitrary expressions. While a high level of security and safety of applications written in these languages can be of a particular importance (consider a web application storing sensitive data and providing its functionality worldwide, dynamic data structures pose significant challenges for data-flow analysis making traditional static verification methods both unsound and imprecise. In this paper, we propose a sound and precise approach for value and points-to analysis of programs with associative arrays-like data structures, upon which data-flow analyses can be built. We implemented our approach in a web-application domain—in an analyzer of PHP code.

A Featured-Based Strategy for Stereovision Matching in Sensors with Fish-Eye Lenses for Forest Environments

Science.gov (United States)

Herrera, Pedro Javier; Pajares, Gonzalo; Guijarro, Maria; Ruz, José J.; Cruz, Jesús M.; Montes, Fernando

2009-01-01

This paper describes a novel feature-based stereovision matching process based on a pair of omnidirectional images in forest stands acquired with a stereovision sensor equipped with fish-eye lenses. The stereo analysis problem consists of the following steps: image acquisition, camera modelling, feature extraction, image matching and depth determination. Once the depths of significant points on the trees are obtained, the growing stock volume can be estimated by considering the geometrical camera modelling, which is the final goal. The key steps are feature extraction and image matching. This paper is devoted solely to these two steps. At a first stage a segmentation process extracts the trunks, which are the regions used as features, where each feature is identified through a set of attributes of properties useful for matching. In the second step the features are matched based on the application of the following four well known matching constraints, epipolar, similarity, ordering and uniqueness. The combination of the segmentation and matching processes for this specific kind of sensors make the main contribution of the paper. The method is tested with satisfactory results and compared against the human expert criterion. PMID:22303134

A stochastic programming approach to manufacturing flow control

OpenAIRE

Haurie, Alain; Moresino, Francesco

2012-01-01

This paper proposes and tests an approximation of the solution of a class of piecewise deterministic control problems, typically used in the modeling of manufacturing flow processes. This approximation uses a stochastic programming approach on a suitably discretized and sampled system. The method proceeds through two stages: (i) the Hamilton-Jacobi-Bellman (HJB) dynamic programming equations for the finite horizon continuous time stochastic control problem are discretized over a set of sample...

Research on the fundamental process of thermal-hydraulic behaviors in severe accident. Behavior of fine droplet flow. JAERI's nuclear research promotion program, H10-027-7. Contract research

International Nuclear Information System (INIS)

Kataoka, Isao; Yoshida, Kenji; Matsuura, Keizo

2002-03-01

Analytical and experimental researches were carried out on the behavior of fine droplet flow in relation to the fundamental phenomena of thermohydraulics in severe accident. Simulation program of fine droplet behavior in turbulent gas flow was developed based on the eddy interaction model with improvement of Graham's stochastic model on eddy lifetime and eddy size. Furthermore, the developed program are capable of simulating the droplet behavior in annular dispersed flow based on the models of droplet entrainment from liquid film and turbulence modification of gas phase by liquid film. This program was confirmed by the various experimental data on droplet diffusion, deposition. Furthermore, this program was applied to the three dimensional droplet flow with the satisfactory agreement of experimental data. This means the developed program can be used as a simulation program for analysis of severe accident. Experimental research was carried out on the effect of liquid film on the turbulence field of gas flow in annular and annular dispersed flow. Averaged and turbulent velocity of gas phase were measured under various gas and liquid film flow rates. Turbulent velocity of gas phase in annular flow increased compared with single phase gas flow. This is due to turbulence generation by waves in liquid film. Corresponding to the turbulence modification by liquid film, distribution of averaged velocity of gas phase became flattened compared with single phase gas flow. (author)

A review of solid-fluid selection options for optical-based measurements in single-phase liquid, two-phase liquid-liquid and multiphase solid-liquid flows

Science.gov (United States)

Wright, Stuart F.; Zadrazil, Ivan; Markides, Christos N.

2017-09-01

Experimental techniques based on optical measurement principles have experienced significant growth in recent decades. They are able to provide detailed information with high-spatiotemporal resolution on important scalar (e.g., temperature, concentration, and phase) and vector (e.g., velocity) fields in single-phase or multiphase flows, as well as interfacial characteristics in the latter, which has been instrumental to step-changes in our fundamental understanding of these flows, and the development and validation of advanced models with ever-improving predictive accuracy and reliability. Relevant techniques rely upon well-established optical methods such as direct photography, laser-induced fluorescence, laser Doppler velocimetry/phase Doppler anemometry, particle image/tracking velocimetry, and variants thereof. The accuracy of the resulting data depends on numerous factors including, importantly, the refractive indices of the solids and liquids used. The best results are obtained when the observational materials have closely matched refractive indices, including test-section walls, liquid phases, and any suspended particles. This paper reviews solid-liquid and solid-liquid-liquid refractive-index-matched systems employed in different fields, e.g., multiphase flows, turbomachinery, bio-fluid flows, with an emphasis on liquid-liquid systems. The refractive indices of various aqueous and organic phases found in the literature span the range 1.330-1.620 and 1.251-1.637, respectively, allowing the identification of appropriate combinations to match selected transparent or translucent plastics/polymers, glasses, or custom materials in single-phase liquid or multiphase liquid-liquid flow systems. In addition, the refractive indices of fluids can be further tuned with the use of additives, which also allows for the matching of important flow similarity parameters such as density and viscosity.

Semi-Automatic Anatomical Tree Matching for Landmark-Based Elastic Registration of Liver Volumes

Directory of Open Access Journals (Sweden)

Klaus Drechsler

2010-01-01

Full Text Available One promising approach to register liver volume acquisitions is based on the branching points of the vessel trees as anatomical landmarks inherently available in the liver. Automated tree matching algorithms were proposed to automatically find pair-wise correspondences between two vessel trees. However, to the best of our knowledge, none of the existing automatic methods are completely error free. After a review of current literature and methodologies on the topic, we propose an efficient interaction method that can be employed to support tree matching algorithms with important pre-selected correspondences or after an automatic matching to manually correct wrongly matched nodes. We used this method in combination with a promising automatic tree matching algorithm also presented in this work. The proposed method was evaluated by 4 participants and a CT dataset that we used to derive multiple artificial datasets.

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

Science.gov (United States)

2010-06-23

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

Theoretical investigation into negative differential resistance characteristics of resonant tunneling diodes based on lattice-matched and polarization-matched AlInN/GaN heterostructures

Science.gov (United States)

Rong, Taotao; Yang, Lin-An; Yang, Lin; Hao, Yue

2018-01-01

In this work, we report an investigation of resonant tunneling diodes (RTDs) with lattice-matched and polarization-matched AlInN/GaN heterostructures using the numerical simulation. Compared with the lattice-matched AlInN/GaN RTDs, the RTDs based on polarization-matched AlInN/GaN hetero-structures exhibit symmetrical conduction band profiles due to eliminating the polarization charge discontinuity, which achieve the equivalence of double barrier transmission coefficients, thereby the relatively high driving current, the high symmetry of current density, and the high peak-to-valley current ratio (PVCR) under the condition of the positive and the negative sweeping voltages. Simulations show that the peak current density approaches 1.2 × 107 A/cm2 at the bias voltage of 0.72 V and the PVCR approaches 1.37 at both sweeping voltages. It also shows that under the condition of the same shallow energy level, when the trap density reaches 1 × 1019 cm-3, the polarization-matched RTDs still have acceptable negative differential resistance (NDR) characteristics, while the NDR characteristics of lattice-matched RTDs become irregular. After introducing the deeper energy level of 1 eV into the polarization-matched and lattice-matched RTDs, 60 scans are performed under the same trap density. Simulation results show that the degradation of the polarization-matched RTDs is 22%, while lattice-matched RTDs have a degradation of 55%. It can be found that the polarization-matched RTDs have a greater defect tolerance than the lattice-matched RTDs, which is beneficial to the available manufacture of actual terahertz RTD devices.

Iris Matching Based on Personalized Weight Map.

Science.gov (United States)

Dong, Wenbo; Sun, Zhenan; Tan, Tieniu

2011-09-01

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

Geomagnetic matching navigation algorithm based on robust estimation

Science.gov (United States)

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

2017-08-01

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

IDAHO NATIONAL LABORATORY PROGRAM TO OBTAIN BENCHMARK DATA ON THE FLOW PHENOMENA IN A SCALED MODEL OF A PRISMATIC GAS-COOLED REACTOR LOWER PLENUM FOR THE VALIDATION OF CFD CODES

International Nuclear Information System (INIS)

Hugh M. McIlroy Jr.; Donald M. McEligot; Robert J. Pink

2008-01-01

The experimental program that is being conducted at the Matched Index-of-Refraction (MIR) Flow Facility at Idaho National Laboratory (INL) to obtain benchmark data on measurements of flow phenomena in a scaled model of a typical prismatic gas-cooled (GCR) reactor lower plenum using 3-D Particle Image Velocimetry (PIV) is presented. A detailed description of the model, scaling, the experimental facility, 3-D PIV system, measurement uncertainties and analysis, experimental procedures and samples of the data sets that have been obtained are included. Samples of the data set that are presented include mean-velocity-field and turbulence data in an approximately 1:7 scale model of a region of the lower plenum of a typical prismatic GCR design. This experiment has been selected as the first Standard Problem endorsed by the Generation IV International Forum. Results concentrate on the region of the lower plenum near its far reflector wall (away from the outlet duct). Inlet jet Reynolds numbers (based on the jet diameter and the time-mean average flow rate) are approximately 4,300 and 12,400. The measurements reveal undeveloped, non-uniform flow in the inlet jets and complicated flow patterns in the model lower plenum. Data include three-dimensional vector plots, data displays along the coordinate planes (slices) and charts that describe the component flows at specific regions in the model. Information on inlet flow is also presented

An effective approach for iris recognition using phase-based image matching.

Science.gov (United States)

Miyazawa, Kazuyuki; Ito, Koichi; Aoki, Takafumi; Kobayashi, Koji; Nakajima, Hiroshi

2008-10-01

This paper presents an efficient algorithm for iris recognition using phase-based image matching--an image matching technique using phase components in 2D Discrete Fourier Transforms (DFTs) of given images. Experimental evaluation using CASIA iris image databases (versions 1.0 and 2.0) and Iris Challenge Evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris images makes possible to achieve highly accurate iris recognition with a simple matching algorithm. This paper also discusses major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris images, we introduce the idea of 2D Fourier Phase Code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art Digital Signal Processing (DSP) technology.

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

DEFF Research Database (Denmark)

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

2009-01-01

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

Matching fully differential NNLO calculations and parton showers

International Nuclear Information System (INIS)

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

2013-11-01

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

Flow processes in electric discharge drivers

Science.gov (United States)

Baganoff, D.

1975-01-01

The performance of an electric discharge shock tube is discussed from the point of view that the conditions at the sonic station are the primary controlling variables (likewise in comparing designs), and that the analysis of the flow on either side of the sonic station should be done separately. The importance of considering mass-flow rate in matching a given driver design to the downstream flow required for a particular shock-wave speed is stressed. It is shown that a driver based on the principle of liquid injection (of H2) is superior to one based on the Ludwieg tube, because of the greater mass-flow rate and the absence of a massive diaphragm.

Forecasting freight flows

DEFF Research Database (Denmark)

Lyk-Jensen, Stéphanie

2011-01-01

Trade patterns and transport markets are changing as a result of the growth and globalization of international trade, and forecasting future freight flow has to rely on trade forecasts. Forecasting freight flows is critical for matching infrastructure supply to demand and for assessing investment...... constitute a valuable input to freight models for forecasting future capacity problems.......Trade patterns and transport markets are changing as a result of the growth and globalization of international trade, and forecasting future freight flow has to rely on trade forecasts. Forecasting freight flows is critical for matching infrastructure supply to demand and for assessing investment...

Physically-based interactive Schlieren flow visualization

Energy Technology Data Exchange (ETDEWEB)

Mccormick, Patrick S [Los Alamos National Laboratory; Brownlee, Carson S [Los Alamos National Laboratory; Pegoraro, Vincent [UNIV OF UTAH; Shankar, Siddharth [UNIV OF UTAH; Hansen, Charles D [UNIV OF UTAH

2009-01-01

Understanding fluid flow is a difficult problem and of increasing importance as computational fluid dynamics produces an abundance of simulation data. Experimental flow analysis has employed techniques such as shadowgraph and schlieren imaging for centuries which allow empirical observation of inhomogeneous flows. Shadowgraphs provide an intuitive way of looking at small changes in flow dynamics through caustic effects while schlieren cutoffs introduce an intensity gradation for observing large scale directional changes in the flow. The combination of these shading effects provides an informative global analysis of overall fluid flow. Computational solutions for these methods have proven too complex until recently due to the fundamental physical interaction of light refracting through the flow field. In this paper, we introduce a novel method to simulate the refraction of light to generate synthetic shadowgraphs and schlieren images of time-varying scalar fields derived from computational fluid dynamics (CFD) data. Our method computes physically accurate schlieren and shadowgraph images at interactive rates by utilizing a combination of GPGPU programming, acceleration methods, and data-dependent probabilistic schlieren cutoffs. Results comparing this method to previous schlieren approximations are presented.

Color-weak compensation using local affine isometry based on discrimination threshold matching

OpenAIRE

Mochizuki, Rika; Kojima, Takanori; Lenz, Reiner; Chao, Jinhui

2015-01-01

We develop algorithms for color-weak compensation and color-weak simulation based on Riemannian geometry models of color spaces. The objective function introduced measures the match of color discrimination thresholds of average normal observers and a color-weak observer. The developed matching process makes use of local affine maps between color spaces of color-normal and color-weak observers. The method can be used to generate displays of images that provide color-normal and color-weak obser...

NAMMU: finite element program for coupled heat and groundwater flow problems

International Nuclear Information System (INIS)

Rae, J.; Robinson, P.C.

1979-11-01

NAMMU is a computer program which will calculate the evolution in time of coupled water and heat flow in a porous medium. It is intended to be used primarily for modelling studies of underground nuclear waste repositories. NAMMU is based on the Galerkin-Finite-element method and has self-adjusting time stepping. The present version is written for 2-dimensional cartesian or cylindrical coordinate systems. It has been checked against two calculations from the KBS study and an exact solution by Hodgkinson for a very idealised repository design. (author)

Stereo matching and view interpolation based on image domain triangulation.

Science.gov (United States)

Fickel, Guilherme Pinto; Jung, Claudio R; Malzbender, Tom; Samadani, Ramin; Culbertson, Bruce

2013-09-01

This paper presents a new approach for stereo matching and view interpolation problems based on triangular tessellations suitable for a linear array of rectified cameras. The domain of the reference image is initially partitioned into triangular regions using edge and scale information, aiming to place vertices along image edges and increase the number of triangles in textured regions. A region-based matching algorithm is then used to find an initial disparity for each triangle, and a refinement stage is applied to change the disparity at the vertices of the triangles, generating a piecewise linear disparity map. A simple post-processing procedure is applied to connect triangles with similar disparities generating a full 3D mesh related to each camera (view), which are used to generate new synthesized views along the linear camera array. With the proposed framework, view interpolation reduces to the trivial task of rendering polygonal meshes, which can be done very fast, particularly when GPUs are employed. Furthermore, the generated views are hole-free, unlike most point-based view interpolation schemes that require some kind of post-processing procedures to fill holes.

Forecasting Shaharchay River Flow in Lake Urmia Basin using Genetic Programming and M5 Model Tree

Directory of Open Access Journals (Sweden)

S. Samadianfard

2017-01-01

data were used for calibration and the rest were used for validation of study models including genetic programming and M5 model trees. It should be noted that for prediction of Shaharchay river flows, previous data of mentioned river in 1, 2 and 3 months ago (Q, Q, Q were used. Genetic programming: was first proposed by Koza (17. It is a generalization of genetic algorithms. The fundamental difference between genetic programming and genetic algorithm is due to the nature of the individuals. In genetic algorithm, the individuals are linear strings of fixed length (chromosomes. In genetic programming, the individuals are nonlinear entities of different sizes and shapes (parse trees. Genetic programming applies genetic algorithms to a “population” of programs, typically encoded as tree-structures. Trial programs are evaluated against a “fitness function”. Then the best solutions are selected for modification and re-evaluation. This modification-evaluation cycle is repeated until a “correct” program is produced. Model trees generalize the concepts of regression trees, which have constant values at their leaves. So, they are analogous to piece-wise linear functions. M5 model tree is a binary decision tree having linear regression function at the terminal nodes, which can predict continuous numerical attributes. Tree-based models are constructed by a divide-and-conquer method. Results and Discussion: In order to investigate the probability of using different mathematical functions in genetic programming method, three combinations of the functions were used in the current study. The results showed that in the case of predicting river flows with Q, M5 model trees with root mean squared error of 4.7907 in comparison with genetic programming by the best mathematical functions and root mean squared error of 4.8233 had better performances. Obtained results indicated that adding more mathematical functions to the genetic programming and producing more complicated

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

Science.gov (United States)

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

2016-01-01

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

Scene matching based on non-linear pre-processing on reference image and sensed image

Institute of Scientific and Technical Information of China (English)

Zhong Sheng; Zhang Tianxu; Sang Nong

2005-01-01

To solve the heterogeneous image scene matching problem, a non-linear pre-processing method for the original images before intensity-based correlation is proposed. The result shows that the proper matching probability is raised greatly. Especially for the low S/N image pairs, the effect is more remarkable.

Recharge Area, Base-Flow and Quick-Flow Discharge Rates and Ages, and General Water Quality of Big Spring in Carter County, Missouri, 2000-04

Science.gov (United States)

Imes, Jeffrey L.; Plummer, Niel; Kleeschulte, Michael J.; Schumacher, John G.

2007-01-01

during the period of record (water years 1922 through 2004) was 1,170 cubic feet per second on December 7, 1982. The daily mean water temperature of Big Spring was monitored during water years 2001 through 2004 and showed little variability, ranging from 13 to 15? C (degree Celsius). Water temperatures generally vary less than 1? C throughout the year. The warmest temperatures occur during October and November and decrease until April, indicating Big Spring water temperature does show a slight seasonal variation. The use of the traditional hydrograph separation program HYSEP to determine the base flow and quick flow or runoff components at Big Spring failed to yield base-flow and quick-flow discharge curves that matched observations of spring characteristics. Big Spring discharge data were used in combination with specific conductance data to develop an improved hydrograph separation method for the spring. The estimated annual mean quick flow ranged from 15 to 48 cubic feet per second for the HYSEP analysis and ranged from 26 to 154 cubic feet per second for the discharge and specific conductance method for water years 2001 to 2004. Using the discharge and specific conductance method, the estimated base-flow component rises abruptly as the spring hydrograph rises, attains a peak value on the same day as the discharge peak, and then declines abruptly from its peak value. Several days later, base flow begins to increase again at an approximately linear trend, coinciding with the time at which the percentage of quick flow has reached a maximum after each recharge-induced discharge peak. The interval between the discharge peak and the peak in percentage quick flow ranges from 8 to 11 days for seven hydrograph peaks, consistent with quick-flow traveltime estimates by dye-trace tests from the mature karst Hurricane Creek Basin in the central part of the recharge area. Concentrations of environmental tracers chlorofluorocarbons (CFCs: CFC-11, CFC-12, CFC-113)

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

Science.gov (United States)

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

2015-11-01

Few studies have documented the value of mentoring for medical students, and research has been limited to more subjective (e.g., job satisfaction, perceived career preparation) rather than objective outcomes. This study examined whether having a mentor is associated with match outcome (where a student matched based on their rank order list [ROL]). We sent a survey link to all emergency medicine (EM) program coordinators to distribute to their residents. EM residents were surveyed about whether they had a mentor during medical school. Match outcome was assessed by asking residents where they matched on their ROL (e.g., first choice, fifth choice). They were also asked about rank in medical school, type of degree (MD vs. DO), and performance on standardized tests. Residents who indicated having a mentor completed the Mentorship Effectiveness Scale (MES), which evaluates behavioral characteristics of the mentor and yields a total score. We assessed correlations among these variables using Pearson's correlation coefficient. Post-hoc analysis using independent sample t-test was conducted to compare differences in the MES score between those who matched to their first or second choice vs. third or higher choice. Participants were a convenience sample of 297 EM residents. Of those, 199 (67%) reported having a mentor during medical school. Contrary to our hypothesis, there was no significant correlation between having a mentor and match outcome (r=0.06, p=0.29). Match outcome was associated with class rank (r=0.13, p=0.03), satisfaction with match outcome (r= -0.37, pmentors, a t-test revealed that the MES score was significantly higher among those who matched to their first or second choice (M=51.31, SD=10.13) compared to those who matched to their third or higher choice (M=43.59, SD=17.12), t(194)=3.65, pmentor during medical school does not impact match outcome, but having an effective mentor is associated with a more favorable match outcome among medical students

Research on the fundamental process of thermal-hydraulic behaviors in severe accident. Behavior of fine droplet flow. JAERI's nuclear research promotion program, H10-027-7. Contract research

Energy Technology Data Exchange (ETDEWEB)

Kataoka, Isao; Yoshida, Kenji [Osaka Univ., Graduate School of Engineering, Osaka (Japan); Matsuura, Keizo [Nuclear Fuel Industry, Co., Ltd., Tokyo (Japan)

2002-03-01

Analytical and experimental researches were carried out on the behavior of fine droplet flow in relation to the fundamental phenomena of thermohydraulics in severe accident. Simulation program of fine droplet behavior in turbulent gas flow was developed based on the eddy interaction model with improvement of Graham's stochastic model on eddy lifetime and eddy size. Furthermore, the developed program are capable of simulating the droplet behavior in annular dispersed flow based on the models of droplet entrainment from liquid film and turbulence modification of gas phase by liquid film. This program was confirmed by the various experimental data on droplet diffusion, deposition. Furthermore, this program was applied to the three dimensional droplet flow with the satisfactory agreement of experimental data. This means the developed program can be used as a simulation program for analysis of severe accident. Experimental research was carried out on the effect of liquid film on the turbulence field of gas flow in annular and annular dispersed flow. Averaged and turbulent velocity of gas phase were measured under various gas and liquid film flow rates. Turbulent velocity of gas phase in annular flow increased compared with single phase gas flow. This is due to turbulence generation by waves in liquid film. Corresponding to the turbulence modification by liquid film, distribution of averaged velocity of gas phase became flattened compared with single phase gas flow. (author)

Modeling of Compressible Flow with Friction and Heat Transfer Using the Generalized Fluid System Simulation Program (GFSSP)

Science.gov (United States)

Bandyopadhyay, Alak; Majumdar, Alok

2007-01-01

The present paper describes the verification and validation of a quasi one-dimensional pressure based finite volume algorithm, implemented in Generalized Fluid System Simulation Program (GFSSP), for predicting compressible flow with friction, heat transfer and area change. The numerical predictions were compared with two classical solutions of compressible flow, i.e. Fanno and Rayleigh flow. Fanno flow provides an analytical solution of compressible flow in a long slender pipe where incoming subsonic flow can be choked due to friction. On the other hand, Raleigh flow provides analytical solution of frictionless compressible flow with heat transfer where incoming subsonic flow can be choked at the outlet boundary with heat addition to the control volume. Nonuniform grid distribution improves the accuracy of numerical prediction. A benchmark numerical solution of compressible flow in a converging-diverging nozzle with friction and heat transfer has been developed to verify GFSSP's numerical predictions. The numerical predictions compare favorably in all cases.

Otolaryngology externships and the match: Productive or futile?

Science.gov (United States)

Thomas, Carissa M; Cabrera-Muffly, Cristina

2017-10-01

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

Ontology Based Vocabulary Matching for Oceanographic Instruments

Science.gov (United States)

Chen, Yu; Shepherd, Adam; Chandler, Cyndy; Arko, Robert; Leadbetter, Adam

2014-05-01

Data integration act as the preliminary entry point as we enter the era of big data in many scientific domains. However the reusefulness of various dataset has met the hurdle due to different initial of interests of different parties, therefore different vocabularies in describing similar or semantically related concepts. In this scenario it is vital to devise an automatic or semi-supervised algorithm to facilitate the convergence of different vocabularies. The Ocean Data Interoperability Platform (ODIP) seeks to increase data sharing across scientific domains and international boundaries by providing a forum to harmonize diverse regional data systems. ODIP participants from the US include the Rolling Deck to Repository (R2R) program, whose mission is to capture, catalog, and describe the underway/environmental sensor data from US oceanographic research vessels and submit the data to public long-term archives. In an attempt to harmonize these regional data systems, especially vocabularies, R2R recognizes the value of the SeaDataNet vocabularies served by the NERC Vocabulary Server (NVS) hosted at the British Oceanographic Data Centre as a trusted, authoritative source for describing many oceanographic research concepts such as instrumentation. In this work, we make use of the semantic relations in the vocabularies served by NVS to build a Bayesian network and take advantage of the idea of entropy in evaluating the correlation between different concepts and keywords. The performance of the model is evaluated against matching instruments from R2R against the SeaDataNet instrument vocabularies based on calculated confidence scores in the instrument pairings. These pairings with their scores can then be analyzed for assertion growing the interoperability of the R2R vocabulary through its links to the SeaDataNet entities.

Research program to develop and validate conceptual models for flow and transport through unsaturated, fractured rock

International Nuclear Information System (INIS)

Glass, R.J.; Tidwell, V.C.

1991-01-01

As part of the Yucca Mountain Project, our research program to develop and validate conceptual models for flow and transport through unsaturated fractured rock integrates fundamental physical experimentation with conceptual model formulation and mathematical modeling. Our research is directed toward developing and validating macroscopic, continuum-based models and supporting effective property models because of their widespread utility within the context of this project. Success relative to the development and validation of effective property models is predicated on a firm understanding of the basic physics governing flow through fractured media, specifically in the areas of unsaturated flow and transport in a single fracture and fracture-matrix interaction. 43 refs

Research program to develop and validate conceptual models for flow and transport through unsaturated, fractured rock

International Nuclear Information System (INIS)

Glass, R.J.; Tidwell, V.C.

1991-09-01

As part of the Yucca Mountain Project, our research program to develop and validate conceptual models for flow and transport through unsaturated fractured rock integrates fundamental physical experimentation with conceptual model formulation and mathematical modeling. Our research is directed toward developing and validating macroscopic, continuum-based models and supporting effective property models because of their widespread utility within the context of this project. Success relative to the development and validation of effective property models is predicted on a firm understanding of the basic physics governing flow through fractured media, specifically in the areas of unsaturated flow and transport in a single fracture and fracture-matrix interaction

Research program to develop and validate conceptual models for flow and transport through unsaturated, fractured rock

International Nuclear Information System (INIS)

Glass, R.J.; Tidwell, V.C.

1991-01-01

As part of the Yucca Mountain Project, our research program to develop and validate conceptual models for flow and transport through unsaturated fractured rock integrates fundamental physical experimentation with conceptual model formulation and mathematical modeling. Our research is directed toward developing and validating macroscopic, continuum-based models and supporting effective property models because of their widespread utility within the context of this project. Success relative to the development and validation of effective property models is predicted on a firm understanding of the basic physics governing flow through fractured media, specifically in the areas of unsaturated flow and transport in a single fracture and fracture-matrix interaction

Invariant Feature Matching for Image Registration Application Based on New Dissimilarity of Spatial Features

Science.gov (United States)

Mousavi Kahaki, Seyed Mostafa; Nordin, Md Jan; Ashtari, Amir H.; J. Zahra, Sophia

2016-01-01

An invariant feature matching method is proposed as a spatially invariant feature matching approach. Deformation effects, such as affine and homography, change the local information within the image and can result in ambiguous local information pertaining to image points. New method based on dissimilarity values, which measures the dissimilarity of the features through the path based on Eigenvector properties, is proposed. Evidence shows that existing matching techniques using similarity metrics—such as normalized cross-correlation, squared sum of intensity differences and correlation coefficient—are insufficient for achieving adequate results under different image deformations. Thus, new descriptor’s similarity metrics based on normalized Eigenvector correlation and signal directional differences, which are robust under local variation of the image information, are proposed to establish an efficient feature matching technique. The method proposed in this study measures the dissimilarity in the signal frequency along the path between two features. Moreover, these dissimilarity values are accumulated in a 2D dissimilarity space, allowing accurate corresponding features to be extracted based on the cumulative space using a voting strategy. This method can be used in image registration applications, as it overcomes the limitations of the existing approaches. The output results demonstrate that the proposed technique outperforms the other methods when evaluated using a standard dataset, in terms of precision-recall and corner correspondence. PMID:26985996

Invariant Feature Matching for Image Registration Application Based on New Dissimilarity of Spatial Features.

Directory of Open Access Journals (Sweden)

Seyed Mostafa Mousavi Kahaki

Full Text Available An invariant feature matching method is proposed as a spatially invariant feature matching approach. Deformation effects, such as affine and homography, change the local information within the image and can result in ambiguous local information pertaining to image points. New method based on dissimilarity values, which measures the dissimilarity of the features through the path based on Eigenvector properties, is proposed. Evidence shows that existing matching techniques using similarity metrics--such as normalized cross-correlation, squared sum of intensity differences and correlation coefficient--are insufficient for achieving adequate results under different image deformations. Thus, new descriptor's similarity metrics based on normalized Eigenvector correlation and signal directional differences, which are robust under local variation of the image information, are proposed to establish an efficient feature matching technique. The method proposed in this study measures the dissimilarity in the signal frequency along the path between two features. Moreover, these dissimilarity values are accumulated in a 2D dissimilarity space, allowing accurate corresponding features to be extracted based on the cumulative space using a voting strategy. This method can be used in image registration applications, as it overcomes the limitations of the existing approaches. The output results demonstrate that the proposed technique outperforms the other methods when evaluated using a standard dataset, in terms of precision-recall and corner correspondence.

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

Science.gov (United States)

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

2008-10-01

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

Implementation of Finite Volume based Navier Stokes Algorithm Within General Purpose Flow Network Code

Science.gov (United States)

Schallhorn, Paul; Majumdar, Alok

2012-01-01

This paper describes a finite volume based numerical algorithm that allows multi-dimensional computation of fluid flow within a system level network flow analysis. There are several thermo-fluid engineering problems where higher fidelity solutions are needed that are not within the capacity of system level codes. The proposed algorithm will allow NASA's Generalized Fluid System Simulation Program (GFSSP) to perform multi-dimensional flow calculation within the framework of GFSSP s typical system level flow network consisting of fluid nodes and branches. The paper presents several classical two-dimensional fluid dynamics problems that have been solved by GFSSP's multi-dimensional flow solver. The numerical solutions are compared with the analytical and benchmark solution of Poiseulle, Couette and flow in a driven cavity.

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

Science.gov (United States)

2013-08-07

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

Program for Analyzing Flows in a Complex Network

Science.gov (United States)

Majumdar, Alok Kumar

2006-01-01

Generalized Fluid System Simulation Program (GFSSP) version 4 is a general-purpose computer program for analyzing steady-state and transient flows in a complex fluid network. The program is capable of modeling compressibility, fluid transients (e.g., water hammers), phase changes, mixtures of chemical species, and such externally applied body forces as gravitational and centrifugal ones. A graphical user interface enables the user to interactively develop a simulation of a fluid network consisting of nodes and branches. The user can also run the simulation and view the results in the interface. The system of equations for conservation of mass, energy, chemical species, and momentum is solved numerically by a combination of the Newton-Raphson and successive-substitution methods.

Fingerprint matching algorithm for poor quality images

Directory of Open Access Journals (Sweden)

Vedpal Singh

2015-04-01

Full Text Available The main aim of this study is to establish an efficient platform for fingerprint matching for low-quality images. Generally, fingerprint matching approaches use the minutiae points for authentication. However, it is not such a reliable authentication method for low-quality images. To overcome this problem, the current study proposes a fingerprint matching methodology based on normalised cross-correlation, which would improve the performance and reduce the miscalculations during authentication. It would decrease the computational complexities. The error rate of the proposed method is 5.4%, which is less than the two-dimensional (2D dynamic programming (DP error rate of 5.6%, while Lee's method produces 5.9% and the combined method has 6.1% error rate. Genuine accept rate at 1% false accept rate is 89.3% but at 0.1% value it is 96.7%, which is higher. The outcome of this study suggests that the proposed methodology has a low error rate with minimum computational effort as compared with existing methods such as Lee's method and 2D DP and the combined method.

A method for matching the refractive index and kinematic viscosity of a blood analog for flow visualization in hydraulic cardiovascular models.

Science.gov (United States)

Nguyen, T T; Biadillah, Y; Mongrain, R; Brunette, J; Tardif, J C; Bertrand, O F

2004-08-01

In this work, we propose a simple method to simultaneously match the refractive index and kinematic viscosity of a circulating blood analog in hydraulic models for optical flow measurement techniques (PIV, PMFV, LDA, and LIF). The method is based on the determination of the volumetric proportions and temperature at which two transparent miscible liquids should be mixed to reproduce the targeted fluid characteristics. The temperature dependence models are a linear relation for the refractive index and an Arrhenius relation for the dynamic viscosity of each liquid. Then the dynamic viscosity of the mixture is represented with a Grunberg-Nissan model of type 1. Experimental tests for acrylic and blood viscosity were found to be in very good agreement with the targeted values (measured refractive index of 1.486 and kinematic viscosity of 3.454 milli-m2/s with targeted values of 1.47 and 3.300 milli-m2/s).

Is there a survival benefit within a German primary care-based disease management program?

Science.gov (United States)

Miksch, Antje; Laux, Gunter; Ose, Dominik; Joos, Stefanie; Campbell, Stephen; Riens, Burgi; Szecsenyi, Joachim

2010-01-01

To compare the mortality rate of patients with type 2 diabetes who were enrolled in the German diabetes disease management program (DMP) with the mortality rate of those who were not enrolled. This observational study was part of the ELSID study (Evaluation of a Large Scale Implementation of disease management programs) in Germany. Participants had type 2 diabetes and were either enrolled or not enrolled in the DMP. The DMP provides systems-based, multifaceted, and patient-centered interventions. To reduce imbalances between the groups, a matched sample was created using sex, age, retirement status, federal state, pharmacy-based cost groups, and diagnostic-cost groups as matching criteria. Cox proportional hazards regression model and the Kaplan-Meier method were used to assess overall mortality. The observation period was 3 years beginning on January 1, 2006. A total of 11,079 patients were included in the analysis. As of January 1, 2006, 2300 patients were enrolled in the DMP and 8779 were receiving routine care. There were 1927 matched pairs of patients in the DMP group and the non-DMP group. The overall mortality rate was 11.3% in the DMP and 14.4% in the non-DMP group (log-rank test P German diabetes DMP and reduced mortality. This reduced mortality cannot be attributed directly to the DMP. However, further research should evaluate whether a primary care-based DMP contributes to increased life expectancy in patients with diabetes.

Research on vehicles and cargos matching model based on virtual logistics platform

Science.gov (United States)

Zhuang, Yufeng; Lu, Jiang; Su, Zhiyuan

2018-04-01

Highway less than truckload (LTL) transportation vehicles and cargos matching problem is a joint optimization problem of typical vehicle routing and loading, which is also a hot issue of operational research. This article based on the demand of virtual logistics platform, for the problem of the highway LTL transportation, the matching model of the idle vehicle and the transportation order is set up and the corresponding genetic algorithm is designed. Then the algorithm is implemented by Java. The simulation results show that the solution is satisfactory.

Mobile Visual Search Based on Histogram Matching and Zone Weight Learning

Science.gov (United States)

Zhu, Chuang; Tao, Li; Yang, Fan; Lu, Tao; Jia, Huizhu; Xie, Xiaodong

2018-01-01

In this paper, we propose a novel image retrieval algorithm for mobile visual search. At first, a short visual codebook is generated based on the descriptor database to represent the statistical information of the dataset. Then, an accurate local descriptor similarity score is computed by merging the tf-idf weighted histogram matching and the weighting strategy in compact descriptors for visual search (CDVS). At last, both the global descriptor matching score and the local descriptor similarity score are summed up to rerank the retrieval results according to the learned zone weights. The results show that the proposed approach outperforms the state-of-the-art image retrieval method in CDVS.

Matching fully differential NNLO calculations and parton showers

Energy Technology Data Exchange (ETDEWEB)

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

2013-11-15

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

Contribution of Fuzzy Minimal Cost Flow Problem by Possibility Programming

OpenAIRE

S. Fanati Rashidi; A. A. Noora

2010-01-01

Using the concept of possibility proposed by zadeh, luhandjula ([4,8]) and buckley ([1]) have proposed the possibility programming. The formulation of buckley results in nonlinear programming problems. Negi [6]re-formulated the approach of Buckley by the use of trapezoidal fuzzy numbers and reduced the problem into fuzzy linear programming problem. Shih and Lee ([7]) used the Negi approach to solve a minimum cost flow problem, whit fuzzy costs and the upper and lower bound. ...

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

Science.gov (United States)

Kwok, Jason; Liao, Walter; Baxter, Stephanie

2017-10-01

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

Regular Expression Matching and Operational Semantics

Directory of Open Access Journals (Sweden)

Asiri Rathnayake

2011-08-01

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

Magnetic safety matches

Science.gov (United States)

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

2017-07-01

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

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

International Nuclear Information System (INIS)

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

1985-01-01

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

PHAST Version 2-A Program for Simulating Groundwater Flow, Solute Transport, and Multicomponent Geochemical Reactions

Science.gov (United States)

Parkhurst, David L.; Kipp, Kenneth L.; Charlton, Scott R.

2010-01-01

The computer program PHAST (PHREEQC And HST3D) simulates multicomponent, reactive solute transport in three-dimensional saturated groundwater flow systems. PHAST is a versatile groundwater flow and solute-transport simulator with capabilities to model a wide range of equilibrium and kinetic geochemical reactions. The flow and transport calculations are based on a modified version of HST3D that is restricted to constant fluid density and constant temperature. The geochemical reactions are simulated with the geochemical model PHREEQC, which is embedded in PHAST. Major enhancements in PHAST Version 2 allow spatial data to be defined in a combination of map and grid coordinate systems, independent of a specific model grid (without node-by-node input). At run time, aquifer properties are interpolated from the spatial data to the model grid; regridding requires only redefinition of the grid without modification of the spatial data. PHAST is applicable to the study of natural and contaminated groundwater systems at a variety of scales ranging from laboratory experiments to local and regional field scales. PHAST can be used in studies of migration of nutrients, inorganic and organic contaminants, and radionuclides; in projects such as aquifer storage and recovery or engineered remediation; and in investigations of the natural rock/water interactions in aquifers. PHAST is not appropriate for unsaturated-zone flow, multiphase flow, or density-dependent flow. A variety of boundary conditions are available in PHAST to simulate flow and transport, including specified-head, flux (specified-flux), and leaky (head-dependent) conditions, as well as the special cases of rivers, drains, and wells. Chemical reactions in PHAST include (1) homogeneous equilibria using an ion-association or Pitzer specific interaction thermodynamic model; (2) heterogeneous equilibria between the aqueous solution and minerals, ion exchange sites, surface complexation sites, solid solutions, and gases; and

Best matching theory & applications

CERN Document Server

Moghaddam, Mohsen

2017-01-01

Mismatch or best match? This book demonstrates that best matching of individual entities to each other is essential to ensure smooth conduct and successful competitiveness in any distributed system, natural and artificial. Interactions must be optimized through best matching in planning and scheduling, enterprise network design, transportation and construction planning, recruitment, problem solving, selective assembly, team formation, sensor network design, and more. Fundamentals of best matching in distributed and collaborative systems are explained by providing: § Methodical analysis of various multidimensional best matching processes § Comprehensive taxonomy, comparing different best matching problems and processes § Systematic identification of systems’ hierarchy, nature of interactions, and distribution of decision-making and control functions § Practical formulation of solutions based on a library of best matching algorithms and protocols, ready for direct applications and apps development. Design...

Graphical matching rules for cardinality based service feature diagrams

Directory of Open Access Journals (Sweden)

Faiza Kanwal

2017-03-01

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

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

Science.gov (United States)

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

2016-08-01

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

Stakeholder Participation in Freshwater Monitoring and Evaluation Programs: Applying Thresholds of Potential Concern within Environmental Flows

Science.gov (United States)

Conallin, John; McLoughlin, Craig A.; Campbell, Josh; Knight, Roger; Bright, Troy; Fisher, Ian

2018-03-01

The complex nature of freshwater systems provides challenges for incorporating evidence-based techniques into management. This paper investigates the potential of participatory evidence-based techniques to involve local stakeholders and make decisions based on different "knowledge" sources within adaptive management programs. It focuses on the application of thresholds of potential concern (TPC) within strategic adaptive management (SAM) for facilitating inclusive decision-making. The study is based on the case of the Edward-Wakool (E-W) "Fish and Flows" SAM project in the Murray-Darling River Basin, Australia. We demonstrate the application of TPCs for improving collaborative decision-making within the E-W, associated with environmental watering requirements, and other natural resource management programs such as fish stocking. The development of TPCs in the E-W fish and flows SAM project helped improve stakeholder involvement and understanding of the system, and also the effectiveness of the implemented management interventions. TPCs ultimately helped inform environmental flow management activities. The TPC process complemented monitoring that was already occurring in the system and provided a mechanism for linking formal and informal knowledge to form explicit and measurable endpoints from objectives. The TPC process faced challenges due to the perceived reduction in scientific rigor within initial TPC development and use. However, TPCs must remain tangible to managers and other stakeholders, in order to aid in the implementation of adaptive management. Once accepted by stakeholders, over time TPCs should be reviewed and refined in order to increase their scientific rigor, as new information is generated.

SWEEP - Save Water & Energy Education Program

Energy Technology Data Exchange (ETDEWEB)

Sullivan, Gregory P.; Elliott, Douglas B.; Hillman, Tim C.; Hadley, Adam; Ledbetter, Marc R.; Payson, David R.

2001-05-03

The objective of this study was to develop, monitor, analyze, and report on an integrated resource-conservation program highlighting efficient residential appliances and fixtures. The sites of study were 50 homes in two water-constrained communities located in Oregon. The program was designed to maximize water savings to these communities and to serve as a model for other communities seeking an integrated approach to energy and water resource efficiency. The program included the installation and in-place evaluation of energy- and water-efficient devices including the following: horizontal axis clothes washers (and the matching clothes dryers), resource-efficient dishwashers, an innovative dual flush low-flow toilet, low-flow showerheads, and faucet aerators. The significance of this activity lies in its integrated approach and unique metering evaluation of individual end-use, aggregated residential total use, and system-wide energy and water benefits.

Urban base flow with low impact development

Science.gov (United States)

Bhaskar, Aditi; Hogan, Dianna M.; Archfield, Stacey A.

2016-01-01

A novel form of urbanization, low impact development (LID), aims to engineer systems that replicate natural hydrologic functioning, in part by infiltrating stormwater close to the impervious surfaces that generate it. We sought to statistically evaluate changes in a base flow regime because of urbanization with LID, specifically changes in base flow magnitude, seasonality, and rate of change. We used a case study watershed in Clarksburg, Maryland, in which streamflow was monitored during whole-watershed urbanization from forest and agricultural to suburban residential development using LID. The 1.11-km2 watershed contains 73 infiltration-focused stormwater facilities, including bioretention facilities, dry wells, and dry swales. We examined annual and monthly flow during and after urbanization (2004–2014) and compared alterations to nearby forested and urban control watersheds. We show that total streamflow and base flow increased in the LID watershed during urbanization as compared with control watersheds. The LID watershed had more gradual storm recessions after urbanization and attenuated seasonality in base flow. These flow regime changes may be because of a reduction in evapotranspiration because of the overall decrease in vegetative cover with urbanization and the increase in point sources of recharge. Precipitation that may once have infiltrated soil, been stored in soil moisture to be eventually transpired in a forested landscape, may now be recharged and become base flow. The transfer of evapotranspiration to base flow is an unintended consequence to the water balance of LID.

Galois Connections for Flow Algebras

DEFF Research Database (Denmark)

Filipiuk, Piotr; Terepeta, Michal Tomasz; Nielson, Hanne Riis

2011-01-01

to the approach taken by Monotone Frameworks and other classical analyses. We present a generic framework for static analysis based on flow algebras and program graphs. Program graphs are often used in Model Checking to model concurrent and distributed systems. The framework allows to induce new flow algebras...

PIV Measurement of Pulsatile Flows in 3D Curved Tubes Using Refractive Index Matching Method

Energy Technology Data Exchange (ETDEWEB)

Hong, Hyeon Ji; Ji, Ho Seong; Kim, Kyung Chun [Pusan Nat’l Univ., Busan (Korea, Republic of)

2016-08-15

Three-dimensional models of stenosis blood vessels were prepared using a 3D printer. The models included a straight pipe with axisymmetric stenosis and a pipe that was bent 10° from the center of stenosis. A refractive index matching method was utilized to measure accurate velocity fields inside the 3D tubes. Three different pulsatile flows were generated and controlled by changing the rotational speed frequency of the peristaltic pump. Unsteady velocity fields were measured by a time-resolved particle image velocimetry method. Periodic shedding of vortices occurred and moves depended on the maximum velocity region. The sizes and the positions of the vortices and symmetry are influenced by mean Reynolds number and tube geometry. In the case of the bent pipe, a recirculation zone observed at the post-stenosis could explain the possibility of blood clot formation and blood clot adhesion in view of hemodynamics.

PIV Measurement of Pulsatile Flows in 3D Curved Tubes Using Refractive Index Matching Method

International Nuclear Information System (INIS)

Hong, Hyeon Ji; Ji, Ho Seong; Kim, Kyung Chun

2016-01-01

Three-dimensional models of stenosis blood vessels were prepared using a 3D printer. The models included a straight pipe with axisymmetric stenosis and a pipe that was bent 10° from the center of stenosis. A refractive index matching method was utilized to measure accurate velocity fields inside the 3D tubes. Three different pulsatile flows were generated and controlled by changing the rotational speed frequency of the peristaltic pump. Unsteady velocity fields were measured by a time-resolved particle image velocimetry method. Periodic shedding of vortices occurred and moves depended on the maximum velocity region. The sizes and the positions of the vortices and symmetry are influenced by mean Reynolds number and tube geometry. In the case of the bent pipe, a recirculation zone observed at the post-stenosis could explain the possibility of blood clot formation and blood clot adhesion in view of hemodynamics.

3D-SIFT-Flow for atlas-based CT liver image segmentation.

Science.gov (United States)

Xu, Yan; Xu, Chenchao; Kuang, Xiao; Wang, Hongkai; Chang, Eric I-Chao; Huang, Weimin; Fan, Yubo

2016-05-01

In this paper, the authors proposed a new 3D registration algorithm, 3D-scale invariant feature transform (SIFT)-Flow, for multiatlas-based liver segmentation in computed tomography (CT) images. In the registration work, the authors developed a new registration method that takes advantage of dense correspondence using the informative and robust SIFT feature. The authors computed the dense SIFT features for the source image and the target image and designed an objective function to obtain the correspondence between these two images. Labeling of the source image was then mapped to the target image according to the former correspondence, resulting in accurate segmentation. In the fusion work, the 2D-based nonparametric label transfer method was extended to 3D for fusing the registered 3D atlases. Compared with existing registration algorithms, 3D-SIFT-Flow has its particular advantage in matching anatomical structures (such as the liver) that observe large variation/deformation. The authors observed consistent improvement over widely adopted state-of-the-art registration methods such as ELASTIX, ANTS, and multiatlas fusion methods such as joint label fusion. Experimental results of liver segmentation on the MICCAI 2007 Grand Challenge are encouraging, e.g., Dice overlap ratio 96.27% ± 0.96% by our method compared with the previous state-of-the-art result of 94.90% ± 2.86%. Experimental results show that 3D-SIFT-Flow is robust for segmenting the liver from CT images, which has large tissue deformation and blurry boundary, and 3D label transfer is effective and efficient for improving the registration accuracy.

Flow Logic for Process Calculi

DEFF Research Database (Denmark)

Nielson, Hanne Riis; Nielson, Flemming; Pilegaard, Henrik

2012-01-01

Flow Logic is an approach to statically determining the behavior of programs and processes. It borrows methods and techniques from Abstract Interpretation, Data Flow Analysis and Constraint Based Analysis while presenting the analysis in a style more reminiscent of Type Systems. Traditionally...... developed for programming languages, this article provides a tutorial development of the approach of Flow Logic for process calculi based on a decade of research. We first develop a simple analysis for the π-calculus; this consists of the specification, semantic soundness (in the form of subject reduction......, and finally, we extend it to a relational analysis. A Flow Logic is a program logic---in the same sense that a Hoare’s logic is. We conclude with an executive summary presenting the highlights of the approach from this perspective including a discussion of theoretical properties as well as implementation...

Length-Bounded Hybrid CPU/GPU Pattern Matching Algorithm for Deep Packet Inspection

Directory of Open Access Journals (Sweden)

Yi-Shan Lin

2017-01-01

Full Text Available Since frequent communication between applications takes place in high speed networks, deep packet inspection (DPI plays an important role in the network application awareness. The signature-based network intrusion detection system (NIDS contains a DPI technique that examines the incoming packet payloads by employing a pattern matching algorithm that dominates the overall inspection performance. Existing studies focused on implementing efficient pattern matching algorithms by parallel programming on software platforms because of the advantages of lower cost and higher scalability. Either the central processing unit (CPU or the graphic processing unit (GPU were involved. Our studies focused on designing a pattern matching algorithm based on the cooperation between both CPU and GPU. In this paper, we present an enhanced design for our previous work, a length-bounded hybrid CPU/GPU pattern matching algorithm (LHPMA. In the preliminary experiment, the performance and comparison with the previous work are displayed, and the experimental results show that the LHPMA can achieve not only effective CPU/GPU cooperation but also higher throughput than the previous method.

EPRI flow-loop/in situ test program for motor-operated valves

International Nuclear Information System (INIS)

Hosler, J.F.; Dorfman, L.S.

1994-01-01

The Electric Power Research Institute is undertaking a comprehensive research program to develop and validate methods for predicting the performance of common motor-operated gate, global, and butterfly valves. To assess motor-operated valve (MOV) performance characteristics and provide a basis for methods validation, full-scale testing was conducted on 62 MOVs. Tests were performed in four flow-loop facilities and in nine nuclear units. Forty-seven gate, five globe, and 10 butterfly valves were tested under a wide range of flow and differential pressure conditions. The paper describes the test program scope, test configurations, instrumentation and data acquisition, testing approach, and data analysis methods. Key results are summarized

MULTI-TEMPORAL AND MULTI-SENSOR IMAGE MATCHING BASED ON LOCAL FREQUENCY INFORMATION

Directory of Open Access Journals (Sweden)

X. Liu

2012-08-01

Full Text Available Image Matching is often one of the first tasks in many Photogrammetry and Remote Sensing applications. This paper presents an efficient approach to automated multi-temporal and multi-sensor image matching based on local frequency information. Two new independent image representations, Local Average Phase (LAP and Local Weighted Amplitude (LWA, are presented to emphasize the common scene information, while suppressing the non-common illumination and sensor-dependent information. In order to get the two representations, local frequency information is firstly obtained from Log-Gabor wavelet transformation, which is similar to that of the human visual system; then the outputs of odd and even symmetric filters are used to construct the LAP and LWA. The LAP and LWA emphasize on the phase and amplitude information respectively. As these two representations are both derivative-free and threshold-free, they are robust to noise and can keep as much of the image details as possible. A new Compositional Similarity Measure (CSM is also presented to combine the LAP and LWA with the same weight for measuring the similarity of multi-temporal and multi-sensor images. The CSM can make the LAP and LWA compensate for each other and can make full use of the amplitude and phase of local frequency information. In many image matching applications, the template is usually selected without consideration of its matching robustness and accuracy. In order to overcome this problem, a local best matching point detection is presented to detect the best matching template. In the detection method, we employ self-similarity analysis to identify the template with the highest matching robustness and accuracy. Experimental results using some real images and simulation images demonstrate that the presented approach is effective for matching image pairs with significant scene and illumination changes and that it has advantages over other state-of-the-art approaches, which include: the

Mentoring During Medical School and Match Outcome Among Emergency Medicine Residents

Directory of Open Access Journals (Sweden)

Erin Dehon

2015-11-01

Full Text Available Introduction: Few studies have documented the value of mentoring for medical students, and research has been limited to more subjective (e.g., job satisfaction, perceived career preparation rather than objective outcomes. This study examined whether having a mentor is associated with match outcome (where a student matched based on their rank order list [ROL]. Methods: We sent a survey link to all emergency medicine (EM program coordinators to distribute to their residents. EM residents were surveyed about whether they had a mentor during medical school. Match outcome was assessed by asking residents where they matched on their ROL (e.g., first choice, fifth choice. They were also asked about rank in medical school, type of degree (MD vs. DO, and performance on standardized tests. Residents who indicated having a mentor completed the Mentorship Effectiveness Scale (MES, which evaluates behavioral characteristics of the mentor and yields a total score. We assessed correlations among these variables using Pearson’s correlation coefficient. Post-hoc analysis using independent sample t-test was conducted to compare differences in the MES score between those who matched to their first or second choice vs. third or higher choice. Results: Participants were a convenience sample of 297 EM residents. Of those, 199 (67% reported having a mentor during medical school. Contrary to our hypothesis, there was no significant correlation between having a mentor and match outcome (r=0.06, p=0.29. Match outcome was associated with class rank (r=0.13, p=0.03, satisfaction with match outcome (r= -0.37, p<0.001, and type of degree (r=0.12, p=0.04. Among those with mentors, a t-test revealed that the MES score was significantly higher among those who matched to their first or second choice (M=51.31, SD=10.13 compared to those who matched to their third or higher choice (M=43.59, SD=17.12, t(194=3.65, p<0.001, d=0.55. Conclusion: Simply having a mentor during medical

PHAST--a program for simulating ground-water flow, solute transport, and multicomponent geochemical reactions

Science.gov (United States)

Parkhurst, David L.; Kipp, Kenneth L.; Engesgaard, Peter; Charlton, Scott R.

2004-01-01

The computer program PHAST simulates multi-component, reactive solute transport in three-dimensional saturated ground-water flow systems. PHAST is a versatile ground-water flow and solute-transport simulator with capabilities to model a wide range of equilibrium and kinetic geochemical reactions. The flow and transport calculations are based on a modified version of HST3D that is restricted to constant fluid density and constant temperature. The geochemical reactions are simulated with the geochemical model PHREEQC, which is embedded in PHAST. PHAST is applicable to the study of natural and contaminated ground-water systems at a variety of scales ranging from laboratory experiments to local and regional field scales. PHAST can be used in studies of migration of nutrients, inorganic and organic contaminants, and radionuclides; in projects such as aquifer storage and recovery or engineered remediation; and in investigations of the natural rock-water interactions in aquifers. PHAST is not appropriate for unsaturated-zone flow, multiphase flow, density-dependent flow, or waters with high ionic strengths. A variety of boundary conditions are available in PHAST to simulate flow and transport, including specified-head, flux, and leaky conditions, as well as the special cases of rivers and wells. Chemical reactions in PHAST include (1) homogeneous equilibria using an ion-association thermodynamic model; (2) heterogeneous equilibria between the aqueous solution and minerals, gases, surface complexation sites, ion exchange sites, and solid solutions; and (3) kinetic reactions with rates that are a function of solution composition. The aqueous model (elements, chemical reactions, and equilibrium constants), minerals, gases, exchangers, surfaces, and rate expressions may be defined or modified by the user. A number of options are available to save results of simulations to output files. The data may be saved in three formats: a format suitable for viewing with a text editor; a

Using linear programming to analyze and optimize stochastic flow lines

DEFF Research Database (Denmark)

Helber, Stefan; Schimmelpfeng, Katja; Stolletz, Raik

2011-01-01

This paper presents a linear programming approach to analyze and optimize flow lines with limited buffer capacities and stochastic processing times. The basic idea is to solve a huge but simple linear program that models an entire simulation run of a multi-stage production process in discrete time...... programming and hence allows us to solve buffer allocation problems. We show under which conditions our method works well by comparing its results to exact values for two-machine models and approximate simulation results for longer lines....

Robust stereo matching with trinary cross color census and triple image-based refinements

Science.gov (United States)

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 NASA Low-Pressure Turbine Flow Physics Program: A Review

Science.gov (United States)

Ashpis, David E.

2002-01-01

An overview of the NASA Glenn Low-Pressure Turbine (LPT) Flow Physics Program will be presented. The flow in the LPT is unique for the gas turbine. It is characterized by low Reynolds number and high freestream turbulence intensity and is dominated by interplay of three basic mechanisms: transition, separation and wake interaction. The flow of most interest is on the suction surface, where large losses are generated due to separation. The LPT is a large, multistage, heavy, jet engine component that suffers efficiency degradation between takeoff and cruise conditions due to decrease in Reynolds number with altitude. The performance penalty is around 2 points for large commercial bypass engines and as much as 7 points for small, high cruise altitude, military engines. The gas-turbine industry is very interested in improving the performance of the LPT and in reducing its weight, part count and cost. Many improvements can be accomplished by improved airfoil design, mainly by increasing the airfoil loading that can yield reduction of airfoils and improved performance. In addition, there is a strong interest in reducing the design cycle time and cost. Key enablers of the needed improvements are computational tools that can accurately predict LPT flows. Current CFD tools in use cannot yet satisfactorily predict the unsteady, transitional and separated flow in the LPT. The main reasons are inadequate transition & turbulence models and incomplete understanding of the LPT flow physics. NASA Glenn has established its LPT program to answer these needs. The main goal of the program is to develop and assess models for unsteady CFD of LPT flows. An approach that consists of complementing and augmenting experimental and computational work elements has been adopted. The work is performed in-house and by several academic institutions, in cooperation and interaction with industry. The program was reviewed at the Minnowbrook II meeting in 1997. This review will summarize the progress

Probabilistic active recognition of multiple objects using Hough-based geometric matching features

CSIR Research Space (South Africa)

Govender, N

2015-01-01

Full Text Available be recognized simultaneously, and occlusion and clutter (through distracter objects) is common. We propose a representation for object viewpoints using Hough transform based geometric matching features, which are robust in such circumstances. We show how...

6d, Coulomb branch anomaly matching

Science.gov (United States)

Intriligator, Kenneth

2014-10-01

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

Applications of the soft computing in the automated history matching

Energy Technology Data Exchange (ETDEWEB)

Silva, P.C.; Maschio, C.; Schiozer, D.J. [Unicamp (Brazil)

2006-07-01

Reservoir management is a research field in petroleum engineering that optimizes reservoir performance based on environmental, political, economic and technological criteria. Reservoir simulation is based on geological models that simulate fluid flow. Models must be constantly corrected to yield the observed production behaviour. The process of history matching is controlled by the comparison of production data, well test data and measured data from simulations. Parametrization, objective function analysis, sensitivity analysis and uncertainty analysis are important steps in history matching. One of the main challenges facing automated history matching is to develop algorithms that find the optimal solution in multidimensional search spaces. Optimization algorithms can be either global optimizers that work with noisy multi-modal functions, or local optimizers that cannot work with noisy multi-modal functions. The problem with global optimizers is the very large number of function calls, which is an inconvenience due to the long reservoir simulation time. For that reason, techniques such as least squared, thin plane spline, kriging and artificial neural networks (ANN) have been used as substitutes to reservoir simulators. This paper described the use of optimization algorithms to find optimal solution in automated history matching. Several ANN were used, including the generalized regression neural network, fuzzy system with subtractive clustering and radial basis network. The UNIPAR soft computing method was used along with a modified Hooke- Jeeves optimization method. Two case studies with synthetic and real reservoirs are examined. It was concluded that the combination of global and local optimization has the potential to improve the history matching process and that the use of substitute models can reduce computational efforts. 15 refs., 11 figs.

Match properties of heat transfer and coupled heat and mass transfer processes in air-conditioning system

International Nuclear Information System (INIS)

Zhang Tao; Liu Xiaohua; Zhang Lun; Jiang Yi

2012-01-01

Highlights: ► Investigates match properties of heat or mass transfer processes in HVAC system. ► Losses are caused by limited transfer ability, flow and parameter mismatching. ► Condition of flow matching is the same heat capacity of the fluids. ► Parameter matching is only reached along the saturation line in air–water system. ► Analytical solutions of heat and mass transfer resistance are derived. - Abstract: Sensible heat exchangers and coupled heat and mass transfer devices between humid air and water/desiccant are commonly used devices in air-conditioning systems. This paper focuses on the match properties of sensible heat transfer processes and coupled heat and mass transfer processes in an effort to understand the reasons for performance limitations in order to optimize system performance. Limited heat transfer capability and flow mismatching resulted in heat resistance of the sensible heat transfer process. Losses occurred during the heat and mass transfer processes due to limited transfer capability, flow mismatching, and parameter mismatching. Flow matching was achieved when the heat capacities of the fluids were identical, and parameter matching could only be reached along the saturation line in air–water systems or the iso-concentration line in air–desiccant systems. Analytical solutions of heat transfer resistance and mass transfer resistance were then derived. The heat and mass transfer process close to the saturation line is recommended, and heating sprayed water resulted in better humidification performance than heating inlet air in the air humidifier.

36 CFR 72.32 - Funding and matching share.

Science.gov (United States)

2010-07-01

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

Rapid matching of stereo vision based on fringe projection profilometry

Science.gov (United States)

Zhang, Ruihua; Xiao, Yi; Cao, Jian; Guo, Hongwei

2016-09-01

As the most important core part of stereo vision, there are still many problems to solve in stereo matching technology. For smooth surfaces on which feature points are not easy to extract, this paper adds a projector into stereo vision measurement system based on fringe projection techniques, according to the corresponding point phases which extracted from the left and right camera images are the same, to realize rapid matching of stereo vision. And the mathematical model of measurement system is established and the three-dimensional (3D) surface of the measured object is reconstructed. This measurement method can not only broaden application fields of optical 3D measurement technology, and enrich knowledge achievements in the field of optical 3D measurement, but also provide potential possibility for the commercialized measurement system in practical projects, which has very important scientific research significance and economic value.

A review of ANL base technology studies in support of the U.S. LMFBR vibration program

International Nuclear Information System (INIS)

Wambsganss, M.W.; Chen, S.S.; Mulcahy, T.M.; Shin, Y.S.

1977-01-01

Argonne National Laboratory (ANL) is the center for base technology studies of flow induced vibration for the U.S. LMFBR Program. This paper reviews and summarizes published results, reports on the status of ongoing programs, and discusses future needs as outlined in the U.S. LMFBR Vibrations Program Plan. (author)

A review of ANL base technology studies in support of the U.S. LMFBR vibration program

Energy Technology Data Exchange (ETDEWEB)

Wambsganss, M W; Chen, S S [Components Technology Division, Argonne National Laboratory, Argonne, IL (United States); Mulcahy, T M; Shin, Y S

1977-12-01

Argonne National Laboratory (ANL) is the center for base technology studies of flow induced vibration for the U.S. LMFBR Program. This paper reviews and summarizes published results, reports on the status of ongoing programs, and discusses future needs as outlined in the U.S. LMFBR Vibrations Program Plan. (author)

Accurate recapture identification for genetic mark–recapture studies with error-tolerant likelihood-based match calling and sample clustering

Science.gov (United States)

Sethi, Suresh; Linden, Daniel; Wenburg, John; Lewis, Cara; Lemons, Patrick R.; Fuller, Angela K.; Hare, Matthew P.

2016-01-01

Error-tolerant likelihood-based match calling presents a promising technique to accurately identify recapture events in genetic mark–recapture studies by combining probabilities of latent genotypes and probabilities of observed genotypes, which may contain genotyping errors. Combined with clustering algorithms to group samples into sets of recaptures based upon pairwise match calls, these tools can be used to reconstruct accurate capture histories for mark–recapture modelling. Here, we assess the performance of a recently introduced error-tolerant likelihood-based match-calling model and sample clustering algorithm for genetic mark–recapture studies. We assessed both biallelic (i.e. single nucleotide polymorphisms; SNP) and multiallelic (i.e. microsatellite; MSAT) markers using a combination of simulation analyses and case study data on Pacific walrus (Odobenus rosmarus divergens) and fishers (Pekania pennanti). A novel two-stage clustering approach is demonstrated for genetic mark–recapture applications. First, repeat captures within a sampling occasion are identified. Subsequently, recaptures across sampling occasions are identified. The likelihood-based matching protocol performed well in simulation trials, demonstrating utility for use in a wide range of genetic mark–recapture studies. Moderately sized SNP (64+) and MSAT (10–15) panels produced accurate match calls for recaptures and accurate non-match calls for samples from closely related individuals in the face of low to moderate genotyping error. Furthermore, matching performance remained stable or increased as the number of genetic markers increased, genotyping error notwithstanding.

Handheld Fluorescence Microscopy based Flow Analyzer.

Science.gov (United States)

Saxena, Manish; Jayakumar, Nitin; Gorthi, Sai Siva

2016-03-01

Fluorescence microscopy has the intrinsic advantages of favourable contrast characteristics and high degree of specificity. Consequently, it has been a mainstay in modern biological inquiry and clinical diagnostics. Despite its reliable nature, fluorescence based clinical microscopy and diagnostics is a manual, labour intensive and time consuming procedure. The article outlines a cost-effective, high throughput alternative to conventional fluorescence imaging techniques. With system level integration of custom-designed microfluidics and optics, we demonstrate fluorescence microscopy based imaging flow analyzer. Using this system we have imaged more than 2900 FITC labeled fluorescent beads per minute. This demonstrates high-throughput characteristics of our flow analyzer in comparison to conventional fluorescence microscopy. The issue of motion blur at high flow rates limits the achievable throughput in image based flow analyzers. Here we address the issue by computationally deblurring the images and show that this restores the morphological features otherwise affected by motion blur. By further optimizing concentration of the sample solution and flow speeds, along with imaging multiple channels simultaneously, the system is capable of providing throughput of about 480 beads per second.

Improving ecological response monitoring of environmental flows.

Science.gov (United States)

King, Alison J; Gawne, Ben; Beesley, Leah; Koehn, John D; Nielsen, Daryl L; Price, Amina

2015-05-01

Environmental flows are now an important restoration technique in flow-degraded rivers, and with the increasing public scrutiny of their effectiveness and value, the importance of undertaking scientifically robust monitoring is now even more critical. Many existing environmental flow monitoring programs have poorly defined objectives, nonjustified indicator choices, weak experimental designs, poor statistical strength, and often focus on outcomes from a single event. These negative attributes make them difficult to learn from. We provide practical recommendations that aim to improve the performance, scientific robustness, and defensibility of environmental flow monitoring programs. We draw on the literature and knowledge gained from working with stakeholders and managers to design, implement, and monitor a range of environmental flow types. We recommend that (1) environmental flow monitoring programs should be implemented within an adaptive management framework; (2) objectives of environmental flow programs should be well defined, attainable, and based on an agreed conceptual understanding of the system; (3) program and intervention targets should be attainable, measurable, and inform program objectives; (4) intervention monitoring programs should improve our understanding of flow-ecological responses and related conceptual models; (5) indicator selection should be based on conceptual models, objectives, and prioritization approaches; (6) appropriate monitoring designs and statistical tools should be used to measure and determine ecological response; (7) responses should be measured within timeframes that are relevant to the indicator(s); (8) watering events should be treated as replicates of a larger experiment; (9) environmental flow outcomes should be reported using a standard suite of metadata. Incorporating these attributes into future monitoring programs should ensure their outcomes are transferable and measured with high scientific credibility.

Improving Ecological Response Monitoring of Environmental Flows

Science.gov (United States)

King, Alison J.; Gawne, Ben; Beesley, Leah; Koehn, John D.; Nielsen, Daryl L.; Price, Amina

2015-05-01

Environmental flows are now an important restoration technique in flow-degraded rivers, and with the increasing public scrutiny of their effectiveness and value, the importance of undertaking scientifically robust monitoring is now even more critical. Many existing environmental flow monitoring programs have poorly defined objectives, nonjustified indicator choices, weak experimental designs, poor statistical strength, and often focus on outcomes from a single event. These negative attributes make them difficult to learn from. We provide practical recommendations that aim to improve the performance, scientific robustness, and defensibility of environmental flow monitoring programs. We draw on the literature and knowledge gained from working with stakeholders and managers to design, implement, and monitor a range of environmental flow types. We recommend that (1) environmental flow monitoring programs should be implemented within an adaptive management framework; (2) objectives of environmental flow programs should be well defined, attainable, and based on an agreed conceptual understanding of the system; (3) program and intervention targets should be attainable, measurable, and inform program objectives; (4) intervention monitoring programs should improve our understanding of flow-ecological responses and related conceptual models; (5) indicator selection should be based on conceptual models, objectives, and prioritization approaches; (6) appropriate monitoring designs and statistical tools should be used to measure and determine ecological response; (7) responses should be measured within timeframes that are relevant to the indicator(s); (8) watering events should be treated as replicates of a larger experiment; (9) environmental flow outcomes should be reported using a standard suite of metadata. Incorporating these attributes into future monitoring programs should ensure their outcomes are transferable and measured with high scientific credibility.

A flexible simulation program for multitasking operating systems to investigate controllers in thermal solar systems

Energy Technology Data Exchange (ETDEWEB)

Wittwer, C.; Horlitz, O.; Rommel, M. [Fraunhofer Inst. for Solar Energy Systems ISE, Freiburg (Germany)

1996-12-31

This paper describes a new program CoISim to simulate systems with complex controllers which is based on a principle similar to the wide-spread modular program TRNSYS. To get an accurate response of this dynamic system, small time are used steps. A numerical integration algorithm is used which is especially suitable for solving a system of nonlinear equations. With time steps of 1 second, it is possible to observe the dynamic effect of ``matched flow systems`` where the flow is a continous function of the state. An important motivation for the development of this dynamic simulation model is the validation of system models. This will be possible by comparing simulations with real measurement data having different time steps. One of the main aims is to determine the dependence of the heat transfer in the collector and the heat exchanger and the flow speed of the fluid. The energy demand of the pump is greatly influenced very much by this dependency. The mass flow controller can be a simple ``two-position controller`` or, as well, a complex ``fuzzy controller``. To describe the fuzzy controller, a separate, commercially available development program may be used. The controller is usually implemented in ANSI-C. (orig.)

Latent palmprint matching.

Science.gov (United States)

Jain, Anil K; Feng, Jianjiang

2009-06-01

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

Speed-up Template Matching through Integral Image based Weak Classifiers

NARCIS (Netherlands)

Wu, t.; Toet, A.

2014-01-01

Template matching is a widely used pattern recognition method, especially in industrial inspection. However, the computational costs of traditional template matching increase dramatically with both template-and scene imagesize. This makes traditional template matching less useful for many (e.g.

Matching algorithm of missile tail flame based on back-propagation neural network

Science.gov (United States)

Huang, Da; Huang, Shucai; Tang, Yidong; Zhao, Wei; Cao, Wenhuan

2018-02-01

This work presents a spectral matching algorithm of missile plume detection that based on neural network. The radiation value of the characteristic spectrum of the missile tail flame is taken as the input of the network. The network's structure including the number of nodes and layers is determined according to the number of characteristic spectral bands and missile types. We can get the network weight matrixes and threshold vectors through training the network using training samples, and we can determine the performance of the network through testing the network using the test samples. A small amount of data cause the network has the advantages of simple structure and practicality. Network structure composed of weight matrix and threshold vector can complete task of spectrum matching without large database support. Network can achieve real-time requirements with a small quantity of data. Experiment results show that the algorithm has the ability to match the precise spectrum and strong robustness.

LipidMatch: an automated workflow for rule-based lipid identification using untargeted high-resolution tandem mass spectrometry data.

Science.gov (United States)

Koelmel, Jeremy P; Kroeger, Nicholas M; Ulmer, Candice Z; Bowden, John A; Patterson, Rainey E; Cochran, Jason A; Beecher, Christopher W W; Garrett, Timothy J; Yost, Richard A

2017-07-10

Lipids are ubiquitous and serve numerous biological functions; thus lipids have been shown to have great potential as candidates for elucidating biomarkers and pathway perturbations associated with disease. Methods expanding coverage of the lipidome increase the likelihood of biomarker discovery and could lead to more comprehensive understanding of disease etiology. We introduce LipidMatch, an R-based tool for lipid identification for liquid chromatography tandem mass spectrometry workflows. LipidMatch currently has over 250,000 lipid species spanning 56 lipid types contained in in silico fragmentation libraries. Unique fragmentation libraries, compared to other open source software, include oxidized lipids, bile acids, sphingosines, and previously uncharacterized adducts, including ammoniated cardiolipins. LipidMatch uses rule-based identification. For each lipid type, the user can select which fragments must be observed for identification. Rule-based identification allows for correct annotation of lipids based on the fragments observed, unlike typical identification based solely on spectral similarity scores, where over-reporting structural details that are not conferred by fragmentation data is common. Another unique feature of LipidMatch is ranking lipid identifications for a given feature by the sum of fragment intensities. For each lipid candidate, the intensities of experimental fragments with exact mass matches to expected in silico fragments are summed. The lipid identifications with the greatest summed intensity using this ranking algorithm were comparable to other lipid identification software annotations, MS-DIAL and Greazy. For example, for features with identifications from all 3 software, 92% of LipidMatch identifications by fatty acyl constituents were corroborated by at least one other software in positive mode and 98% in negative ion mode. LipidMatch allows users to annotate lipids across a wide range of high resolution tandem mass spectrometry

MEDUSA - An overset grid flow solver for network-based parallel computer systems

Science.gov (United States)

Smith, Merritt H.; Pallis, Jani M.

1993-01-01

Continuing improvement in processing speed has made it feasible to solve the Reynolds-Averaged Navier-Stokes equations for simple three-dimensional flows on advanced workstations. Combining multiple workstations into a network-based heterogeneous parallel computer allows the application of programming principles learned on MIMD (Multiple Instruction Multiple Data) distributed memory parallel computers to the solution of larger problems. An overset-grid flow solution code has been developed which uses a cluster of workstations as a network-based parallel computer. Inter-process communication is provided by the Parallel Virtual Machine (PVM) software. Solution speed equivalent to one-third of a Cray-YMP processor has been achieved from a cluster of nine commonly used engineering workstation processors. Load imbalance and communication overhead are the principal impediments to parallel efficiency in this application.

Matching Students to Schools

Directory of Open Access Journals (Sweden)

Dejan Trifunovic

2017-08-01

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

Keyframes Global Map Establishing Method for Robot Localization through Content-Based Image Matching

Directory of Open Access Journals (Sweden)

Tianyang Cao

2017-01-01

Full Text Available Self-localization and mapping are important for indoor mobile robot. We report a robust algorithm for map building and subsequent localization especially suited for indoor floor-cleaning robots. Common methods, for example, SLAM, can easily be kidnapped by colliding or disturbed by similar objects. Therefore, keyframes global map establishing method for robot localization in multiple rooms and corridors is needed. Content-based image matching is the core of this method. It is designed for the situation, by establishing keyframes containing both floor and distorted wall images. Image distortion, caused by robot view angle and movement, is analyzed and deduced. And an image matching solution is presented, consisting of extraction of overlap regions of keyframes extraction and overlap region rebuild through subblocks matching. For improving accuracy, ceiling points detecting and mismatching subblocks checking methods are incorporated. This matching method can process environment video effectively. In experiments, less than 5% frames are extracted as keyframes to build global map, which have large space distance and overlap each other. Through this method, robot can localize itself by matching its real-time vision frames with our keyframes map. Even with many similar objects/background in the environment or kidnapping robot, robot localization is achieved with position RMSE <0.5 m.

Automatic Matching of Large Scale Images and Terrestrial LIDAR Based on App Synergy of Mobile Phone

Science.gov (United States)

Xia, G.; Hu, C.

2018-04-01

The digitalization of Cultural Heritage based on ground laser scanning technology has been widely applied. High-precision scanning and high-resolution photography of cultural relics are the main methods of data acquisition. The reconstruction with the complete point cloud and high-resolution image requires the matching of image and point cloud, the acquisition of the homonym feature points, the data registration, etc. However, the one-to-one correspondence between image and corresponding point cloud depends on inefficient manual search. The effective classify and management of a large number of image and the matching of large image and corresponding point cloud will be the focus of the research. In this paper, we propose automatic matching of large scale images and terrestrial LiDAR based on APP synergy of mobile phone. Firstly, we develop an APP based on Android, take pictures and record related information of classification. Secondly, all the images are automatically grouped with the recorded information. Thirdly, the matching algorithm is used to match the global and local image. According to the one-to-one correspondence between the global image and the point cloud reflection intensity image, the automatic matching of the image and its corresponding laser radar point cloud is realized. Finally, the mapping relationship between global image, local image and intensity image is established according to homonym feature point. So we can establish the data structure of the global image, the local image in the global image, the local image corresponding point cloud, and carry on the visualization management and query of image.

Fluid Flow Programming in Paper-Derived Silica-Polymer Hybrids.

Science.gov (United States)

Dubois, Christelle; Herzog, Nicole; Rüttiger, Christian; Geißler, Andreas; Grange, Eléonor; Kunz, Ulrike; Kleebe, Hans-Joachim; Biesalski, Markus; Meckel, Tobias; Gutmann, Torsten; Gallei, Markus; Andrieu-Brunsen, Annette

2017-01-10

In paper-based devices, capillary fluid flow is based on length-scale selective functional control within a hierarchical porous system. The fluid flow can be tuned by altering the paper preparation process, which controls parameters such as the paper grammage. Interestingly, the fiber morphology and nanoporosity are often neglected. In this work, porous voids are incorporated into paper by the combination of dense or mesoporous ceramic silica coatings with hierarchically porous cotton linter paper. Varying the silica coating leads to significant changes in the fluid flow characteristics, up to the complete water exclusion without any further fiber surface hydrophobization, providing new approaches to control fluid flow. Additionally, functionalization with redox-responsive polymers leads to reversible, dynamic gating of fluid flow in these hybrid paper materials, demonstrating the potential of length scale specific, dynamic, and external transport control.

Microcomputer based program for predicting heat transfer under reactor accident conditions. Volume I

International Nuclear Information System (INIS)

Cheng, S.C.; Groeneveld, D.C.; Leung, L.K.H.; Wong, Y.L.; Nguyen, C.

1987-07-01

A microcomputer based program called Heat Transfer Prediction Software (HTPS) has been developed. It calculates the heat transfer for the tube and bundle geometries for steady state and transient conditions. This program is capable of providing the best estimated of the hot pin temperatures during slow transients for 37- and 28-element CANDU type fuel bundles. The program is designed for an IBM-PC AT/XT (or IBM-PC compatible computer) equipped with a Math Co-processor. The following input parameters are required: pressure, mass flux, hydraulic diameter, and quality. For the steady state case, the critical heat flux (CHF), the critical heat flux temperature, the minimum film boiling temperature, and the minimum film boiling heat flux are the primary outputs. With either the surface heat flux or wall temperature specified, the program determines the heat transfer regime and calculates the surface heat flux, wall temperatures and heat transfer coefficient. For the slow transient case, the pressure, mass flux, quality, and volumetric heat generation rate are the time dependent input parameters required to calculate the hot pin sheath temperatures and surface heat fluxes. A simple routine for generating properties has been developed for light water to support the above program. It contains correlations that have been verified for pressures ranging from 0.6kPa to 30 MPa, and temperatures up to 1100 degrees Celcius. The thermodynamic and transport properties that can be generated from this routine are: density, specific volume, enthalpy, specific heat capacity, conductivity, viscosity, surface tension and Prandtl number for saturated liquid, saturated vapour, subcooled liquid for superheated vapour. A software for predicting flow regime has also been developed. It determines the flow pattern at specific flow conditions, and provides a correction factor for calculating the CHF during partially stratified horizontal flow. The technical bases for the program and its

Microcomputer based program for predicting heat transfer under reactor accident conditions. Volume II

International Nuclear Information System (INIS)

Cheng, S.C.; Groeneveld, D.C.; Leung, L.K.H.; Wong, Y.L.; Nguyen, C.

1987-07-01

A microcomputer based program called Heat Transfer Prediction Software (HTPS) has been developed. It calculates the heat transfer for tube and bundle geometries for steady state and transient conditions. This program is capable of providing the best estimated of the hot pin temperatures during slow transients for 37- and 28-element CANDU type fuel bundles. The program is designed for an IBM-PC AT/XT (or IBM-PC compatible computer) equipped with a Math Co-processor. The following input parameters are required: pressure, mass flux, hydraulic diameter, and quality. For the steady state case, the critical heat flux (CHF), the critical heat flux temperature, the minimum film boiling temperature, and the minimum film boiling heat flux are the primary outputs. With either the surface heat flux or wall temperature specified, the program determines the heat transfer regime and calculates the surface heat flux, wall temperature and heat transfer coefficient. For the slow transient case, the pressure, mass flux, quality, and volumetric heat generation rate are the time dependent input parameters are required to calculate the hot pin sheath temperatures and surface heat fluxes. A simple routine for generating properties has been developed for light water to support the above program. It contains correlations that have been verified for pressures ranging from 0.6kPa to 30 MPa, and temperatures up to 1100 degrees Celcius. The thermodynamic and transport properties that can be generated from this routine are: density, specific volume, enthalpy, specific heat capacity, conductivity, viscosity, surface tension and Prandtle number for saturated liquid, saturated vapour, subcooled liquid of superheated vapour. A software for predicting flow regime has also been developed. It determines the flow pattern at specific flow conditions, and provides a correction factor for calculating the CHF during partially stratified horizontal flow. The technical bases for the program and its structure

Small organic molecule based flow battery

Science.gov (United States)

Huskinson, Brian; Marshak, Michael; Aziz, Michael J.; Gordon, Roy G.; Betley, Theodore A.; Aspuru-Guzik, Alan; Er, Suleyman; Suh, Changwon

2018-05-08

The invention provides an electrochemical cell based on a new chemistry for a flow battery for large scale, e.g., gridscale, electrical energy storage. Electrical energy is stored chemically at an electrochemical electrode by the protonation of small organic molecules called quinones to hydroquinones. The proton is provided by a complementary electrochemical reaction at the other electrode. These reactions are reversed to deliver electrical energy. A flow battery based on this concept can operate as a closed system. The flow battery architecture has scaling advantages over solid electrode batteries for large scale energy storage.

Inverse consistent non-rigid image registration based on robust point set matching

Science.gov (United States)

2014-01-01

Background Robust point matching (RPM) has been extensively used in non-rigid registration of images to robustly register two sets of image points. However, except for the location at control points, RPM cannot estimate the consistent correspondence between two images because RPM is a unidirectional image matching approach. Therefore, it is an important issue to make an improvement in image registration based on RPM. Methods In our work, a consistent image registration approach based on the point sets matching is proposed to incorporate the property of inverse consistency and improve registration accuracy. Instead of only estimating the forward transformation between the source point sets and the target point sets in state-of-the-art RPM algorithms, the forward and backward transformations between two point sets are estimated concurrently in our algorithm. The inverse consistency constraints are introduced to the cost function of RPM and the fuzzy correspondences between two point sets are estimated based on both the forward and backward transformations simultaneously. A modified consistent landmark thin-plate spline registration is discussed in detail to find the forward and backward transformations during the optimization of RPM. The similarity of image content is also incorporated into point matching in order to improve image matching. Results Synthetic data sets, medical images are employed to demonstrate and validate the performance of our approach. The inverse consistent errors of our algorithm are smaller than RPM. Especially, the topology of transformations is preserved well for our algorithm for the large deformation between point sets. Moreover, the distance errors of our algorithm are similar to that of RPM, and they maintain a downward trend as whole, which demonstrates the convergence of our algorithm. The registration errors for image registrations are evaluated also. Again, our algorithm achieves the lower registration errors in same iteration number

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

International Nuclear Information System (INIS)

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

2008-01-01

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

FPFH-based graph matching for 3D point cloud registration

Science.gov (United States)

Zhao, Jiapeng; Li, Chen; Tian, Lihua; Zhu, Jihua

2018-04-01

Correspondence detection is a vital step in point cloud registration and it can help getting a reliable initial alignment. In this paper, we put forward an advanced point feature-based graph matching algorithm to solve the initial alignment problem of rigid 3D point cloud registration with partial overlap. Specifically, Fast Point Feature Histograms are used to determine the initial possible correspondences firstly. Next, a new objective function is provided to make the graph matching more suitable for partially overlapping point cloud. The objective function is optimized by the simulated annealing algorithm for final group of correct correspondences. Finally, we present a novel set partitioning method which can transform the NP-hard optimization problem into a O(n3)-solvable one. Experiments on the Stanford and UWA public data sets indicates that our method can obtain better result in terms of both accuracy and time cost compared with other point cloud registration methods.

On performing of interference technique based on self-adjusting Zernike filters (SA-AVT method) to investigate flows and validate 3D flow numerical simulations

Science.gov (United States)

Pavlov, Al. A.; Shevchenko, A. M.; Khotyanovsky, D. V.; Pavlov, A. A.; Shmakov, A. S.; Golubev, M. P.

2017-10-01

We present a method for and results of determination of the field of integral density in the structure of flow corresponding to the Mach interaction of shock waves at Mach number M = 3. The optical diagnostics of flow was performed using an interference technique based on self-adjusting Zernike filters (SA-AVT method). Numerical simulations were carried out using the CFS3D program package for solving the Euler and Navier-Stokes equations. Quantitative data on the distribution of integral density on the path of probing radiation in one direction of 3D flow transillumination in the region of Mach interaction of shock waves were obtained for the first time.

3D-SIFT-Flow for atlas-based CT liver image segmentation

Energy Technology Data Exchange (ETDEWEB)

Xu, Yan, E-mail: xuyan04@gmail.com [State Key Laboratory of Software Development Environment and Key Laboratory of Biomechanics and Mechanobiology of Ministry of Education, Beihang University, Beijing 100191, China and Research Institute of Beihang University in Shenzhen and Microsoft Research, Beijing 100080 (China); Xu, Chenchao, E-mail: chenchaoxu33@gmail.com; Kuang, Xiao, E-mail: kuangxiao.ace@gmail.com [School of Biological Science and Medical Engineering, Beihang University, Beijing 100191 (China); Wang, Hongkai, E-mail: wang.hongkai@gmail.com [Department of Biomedical Engineering, Dalian University of Technology, Dalian 116024 (China); Chang, Eric I-Chao, E-mail: eric.chang@microsoft.com [Microsoft Research, Beijing 100080 (China); Huang, Weimin, E-mail: wmhuang@i2r.a-star.edu.sg [Institute for Infocomm Research (I2R), Singapore 138632 (Singapore); Fan, Yubo, E-mail: yubofan@buaa.edu.cn [Key Laboratory of Biomechanics and Mechanobiology of Ministry of Education, Beihang University, Beijing 100191 (China)

2016-05-15

Purpose: In this paper, the authors proposed a new 3D registration algorithm, 3D-scale invariant feature transform (SIFT)-Flow, for multiatlas-based liver segmentation in computed tomography (CT) images. Methods: In the registration work, the authors developed a new registration method that takes advantage of dense correspondence using the informative and robust SIFT feature. The authors computed the dense SIFT features for the source image and the target image and designed an objective function to obtain the correspondence between these two images. Labeling of the source image was then mapped to the target image according to the former correspondence, resulting in accurate segmentation. In the fusion work, the 2D-based nonparametric label transfer method was extended to 3D for fusing the registered 3D atlases. Results: Compared with existing registration algorithms, 3D-SIFT-Flow has its particular advantage in matching anatomical structures (such as the liver) that observe large variation/deformation. The authors observed consistent improvement over widely adopted state-of-the-art registration methods such as ELASTIX, ANTS, and multiatlas fusion methods such as joint label fusion. Experimental results of liver segmentation on the MICCAI 2007 Grand Challenge are encouraging, e.g., Dice overlap ratio 96.27% ± 0.96% by our method compared with the previous state-of-the-art result of 94.90% ± 2.86%. Conclusions: Experimental results show that 3D-SIFT-Flow is robust for segmenting the liver from CT images, which has large tissue deformation and blurry boundary, and 3D label transfer is effective and efficient for improving the registration accuracy.

3D-SIFT-Flow for atlas-based CT liver image segmentation

International Nuclear Information System (INIS)

Xu, Yan; Xu, Chenchao; Kuang, Xiao; Wang, Hongkai; Chang, Eric I-Chao; Huang, Weimin; Fan, Yubo

2016-01-01

Purpose: In this paper, the authors proposed a new 3D registration algorithm, 3D-scale invariant feature transform (SIFT)-Flow, for multiatlas-based liver segmentation in computed tomography (CT) images. Methods: In the registration work, the authors developed a new registration method that takes advantage of dense correspondence using the informative and robust SIFT feature. The authors computed the dense SIFT features for the source image and the target image and designed an objective function to obtain the correspondence between these two images. Labeling of the source image was then mapped to the target image according to the former correspondence, resulting in accurate segmentation. In the fusion work, the 2D-based nonparametric label transfer method was extended to 3D for fusing the registered 3D atlases. Results: Compared with existing registration algorithms, 3D-SIFT-Flow has its particular advantage in matching anatomical structures (such as the liver) that observe large variation/deformation. The authors observed consistent improvement over widely adopted state-of-the-art registration methods such as ELASTIX, ANTS, and multiatlas fusion methods such as joint label fusion. Experimental results of liver segmentation on the MICCAI 2007 Grand Challenge are encouraging, e.g., Dice overlap ratio 96.27% ± 0.96% by our method compared with the previous state-of-the-art result of 94.90% ± 2.86%. Conclusions: Experimental results show that 3D-SIFT-Flow is robust for segmenting the liver from CT images, which has large tissue deformation and blurry boundary, and 3D label transfer is effective and efficient for improving the registration accuracy.

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

Science.gov (United States)

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

2016-08-01

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

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

Energy Technology Data Exchange (ETDEWEB)

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

2013-05-15

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

Matching Index-of-Refraction for 3D Printing Model Using Mixture of Herb Essential Oil and Light Mineral Oil

International Nuclear Information System (INIS)

Song, Min Seop; Choi, Hae Yoon; Kim, Eung Soo

2013-01-01

This study has extensively investigated the emerging 3-D printing technologies for use of MIR-based flow field visualization methods such as PIV and LDV. As a result, mixture of Herb essential oil and light mineral oil has been evaluated to be great working fluid due to its adequate properties. Using this combination, the RIs between 1.45 and 1.55 can be accurately matched, and most of the transparent materials are found to be ranged in here. Conclusively, the proposed MIR method are expected to provide large flexibility of model materials and geometries for laser based optical measurements. Particle Image Velocimetry (PIV) and Laser Doppler Velocimetry (LDV) are the two major optical technologies used for flow field visualization in the latest fundamental thermal-hydraulics researches. Those techniques seriously require minimizing optical distortions for enabling high quality data. Therefore, matching index of refraction (MIR) between model materials and working fluids are an essential part of minimizing measurement uncertainty. This paper proposes to use 3-D Printing technology for manufacturing models for the MIR-based optical measurements. Because of the large flexibility in geometries and materials of the 3-D Printing, its application is obviously expected to provide tremendous advantages over the traditional MIR-based optical measurements. This study focuses on the 3-D printing models and investigates their optical properties, transparent printing techniques, and index-matching fluids

Matching Index-of-Refraction for 3D Printing Model Using Mixture of Herb Essential Oil and Light Mineral Oil

Energy Technology Data Exchange (ETDEWEB)

Song, Min Seop; Choi, Hae Yoon; Kim, Eung Soo [Seoul National Univ., Seoul (Korea, Republic of)

2013-10-15

This study has extensively investigated the emerging 3-D printing technologies for use of MIR-based flow field visualization methods such as PIV and LDV. As a result, mixture of Herb essential oil and light mineral oil has been evaluated to be great working fluid due to its adequate properties. Using this combination, the RIs between 1.45 and 1.55 can be accurately matched, and most of the transparent materials are found to be ranged in here. Conclusively, the proposed MIR method are expected to provide large flexibility of model materials and geometries for laser based optical measurements. Particle Image Velocimetry (PIV) and Laser Doppler Velocimetry (LDV) are the two major optical technologies used for flow field visualization in the latest fundamental thermal-hydraulics researches. Those techniques seriously require minimizing optical distortions for enabling high quality data. Therefore, matching index of refraction (MIR) between model materials and working fluids are an essential part of minimizing measurement uncertainty. This paper proposes to use 3-D Printing technology for manufacturing models for the MIR-based optical measurements. Because of the large flexibility in geometries and materials of the 3-D Printing, its application is obviously expected to provide tremendous advantages over the traditional MIR-based optical measurements. This study focuses on the 3-D printing models and investigates their optical properties, transparent printing techniques, and index-matching fluids.

Optimal likelihood-based matching of volcanic sources and deposits in the Auckland Volcanic Field

Science.gov (United States)

Kawabata, Emily; Bebbington, Mark S.; Cronin, Shane J.; Wang, Ting

2016-09-01

In monogenetic volcanic fields, where each eruption forms a new volcano, focusing and migration of activity over time is a very real possibility. In order for hazard estimates to reflect future, rather than past, behavior, it is vital to assemble as much reliable age data as possible on past eruptions. Multiple swamp/lake records have been extracted from the Auckland Volcanic Field, underlying the 1.4 million-population city of Auckland. We examine here the problem of matching these dated deposits to the volcanoes that produced them. The simplest issue is separation in time, which is handled by simulating prior volcano age sequences from direct dates where known, thinned via ordering constraints between the volcanoes. The subproblem of varying deposition thicknesses (which may be zero) at five locations of known distance and azimuth is quantified using a statistical attenuation model for the volcanic ash thickness. These elements are combined with other constraints, from widespread fingerprinted ash layers that separate eruptions and time-censoring of the records, into a likelihood that was optimized via linear programming. A second linear program was used to optimize over the Monte-Carlo simulated set of prior age profiles to determine the best overall match and consequent volcano age assignments. Considering all 20 matches, and the multiple factors of age, direction, and size/distance simultaneously, results in some non-intuitive assignments which would not be produced by single factor analyses. Compared with earlier work, the results provide better age control on a number of smaller centers such as Little Rangitoto, Otuataua, Taylors Hill, Wiri Mountain, Green Hill, Otara Hill, Hampton Park and Mt Cambria. Spatio-temporal hazard estimates are updated on the basis of the new ordering, which suggest that the scale of the 'flare-up' around 30 ka, while still highly significant, was less than previously thought.

A Data-Driven Approach to Develop Physically Sound Predictors: Application to Depth-Averaged Velocities and Drag Coefficients on Vegetated Flows

Science.gov (United States)

Tinoco, R. O.; Goldstein, E. B.; Coco, G.

2016-12-01

We use a machine learning approach to seek accurate, physically sound predictors, to estimate two relevant flow parameters for open-channel vegetated flows: mean velocities and drag coefficients. A genetic programming algorithm is used to find a robust relationship between properties of the vegetation and flow parameters. We use data published from several laboratory experiments covering a broad range of conditions to obtain: a) in the case of mean flow, an equation that matches the accuracy of other predictors from recent literature while showing a less complex structure, and b) for drag coefficients, a predictor that relies on both single element and array parameters. We investigate different criteria for dataset size and data selection to evaluate their impact on the resulting predictor, as well as simple strategies to obtain only dimensionally consistent equations, and avoid the need for dimensional coefficients. The results show that a proper methodology can deliver physically sound models representative of the processes involved, such that genetic programming and machine learning techniques can be used as powerful tools to study complicated phenomena and develop not only purely empirical, but "hybrid" models, coupling results from machine learning methodologies into physics-based models.

A Fast and Robust Feature-Based Scan-Matching Method in 3D SLAM and the Effect of Sampling Strategies

Directory of Open Access Journals (Sweden)

Cihan Ulas

2013-11-01

Full Text Available Simultaneous localization and mapping (SLAM plays an important role in fully autonomous systems when a GNSS (global navigation satellite system is not available. Studies in both 2D indoor and 3D outdoor SLAM are based on the appearance of environments and utilize scan-matching methods to find rigid body transformation parameters between two consecutive scans. In this study, a fast and robust scan-matching method based on feature extraction is introduced. Since the method is based on the matching of certain geometric structures, like plane segments, the outliers and noise in the point cloud are considerably eliminated. Therefore, the proposed scan-matching algorithm is more robust than conventional methods. Besides, the registration time and the number of iterations are significantly reduced, since the number of matching points is efficiently decreased. As a scan-matching framework, an improved version of the normal distribution transform (NDT is used. The probability density functions (PDFs of the reference scan are generated as in the traditional NDT, and the feature extraction - based on stochastic plane detection - is applied to the only input scan. By using experimental dataset belongs to an outdoor environment like a university campus, we obtained satisfactory performance results. Moreover, the feature extraction part of the algorithm is considered as a special sampling strategy for scan-matching and compared to other sampling strategies, such as random sampling and grid-based sampling, the latter of which is first used in the NDT. Thus, this study also shows the effect of the subsampling on the performance of the NDT.

Characteristics-based modelling of flow problems

International Nuclear Information System (INIS)

Saarinen, M.

1994-02-01

The method of characteristics is an exact way to proceed to the solution of hyperbolic partial differential equations. The numerical solutions, however, are obtained in the fixed computational grid where interpolations of values between the mesh points cause numerical errors. The Piecewise Linear Interpolation Method, PLIM, the utilization of which is based on the method of characteristics, has been developed to overcome these deficiencies. The thesis concentrates on the computer simulation of the two-phase flow. The main topics studied are: (1) the PLIM method has been applied to study the validity of the numerical scheme through solving various flow problems to achieve knowledge for the further development of the method, (2) the mathematical and physical validity and applicability of the two-phase flow equations based on the SFAV (Separation of the two-phase Flow According to Velocities) approach has been studied, and (3) The SFAV approach has been further developed for particular cases such as stratified horizontal two-phase flow. (63 refs., 4 figs.)

Computer programs for the numerical modelling of water flow in rock masses

International Nuclear Information System (INIS)

Croney, P.; Richards, L.R.

1985-08-01

Water flow in rock joints provides a very important possible route for the migration of radio-nuclides from radio-active waste within a repository back to the biosphere. Two computer programs DAPHNE and FPM have been developed to model two dimensional fluid flow in jointed rock masses. They have been developed to run on microcomputer systems suitable for field locations. The fluid flows in a number of jointed rock systems have been examined and certain controlling functions identified. A methodology has been developed for assessing the anisotropic permeability of jointed rock. A number of examples of unconfined flow into surface and underground openings have been analysed and ground water lowering, pore water pressures and flow quantities predicted. (author)

A new template matching method based on contour information

Science.gov (United States)

Cai, Huiying; Zhu, Feng; Wu, Qingxiao; Li, Sicong

2014-11-01

Template matching is a significant approach in machine vision due to its effectiveness and robustness. However, most of the template matching methods are so time consuming that they can't be used to many real time applications. The closed contour matching method is a popular kind of template matching methods. This paper presents a new closed contour template matching method which is suitable for two dimensional objects. Coarse-to-fine searching strategy is used to improve the matching efficiency and a partial computation elimination scheme is proposed to further speed up the searching process. The method consists of offline model construction and online matching. In the process of model construction, triples and distance image are obtained from the template image. A certain number of triples which are composed by three points are created from the contour information that is extracted from the template image. The rule to select the three points is that the template contour is divided equally into three parts by these points. The distance image is obtained here by distance transform. Each point on the distance image represents the nearest distance between current point and the points on the template contour. During the process of matching, triples of the searching image are created with the same rule as the triples of the model. Through the similarity that is invariant to rotation, translation and scaling between triangles, the triples corresponding to the triples of the model are found. Then we can obtain the initial RST (rotation, translation and scaling) parameters mapping the searching contour to the template contour. In order to speed up the searching process, the points on the searching contour are sampled to reduce the number of the triples. To verify the RST parameters, the searching contour is projected into the distance image, and the mean distance can be computed rapidly by simple operations of addition and multiplication. In the fine searching process

AN EVOLUTIONARY ALGORITHM FOR FAST INTENSITY BASED IMAGE MATCHING BETWEEN OPTICAL AND SAR SATELLITE IMAGERY

Directory of Open Access Journals (Sweden)

P. Fischer

2018-04-01

Full Text Available This paper presents a hybrid evolutionary algorithm for fast intensity based matching between satellite imagery from SAR and very high-resolution (VHR optical sensor systems. The precise and accurate co-registration of image time series and images of different sensors is a key task in multi-sensor image processing scenarios. The necessary preprocessing step of image matching and tie-point detection is divided into a search problem and a similarity measurement. Within this paper we evaluate the use of an evolutionary search strategy for establishing the spatial correspondence between satellite imagery of optical and radar sensors. The aim of the proposed algorithm is to decrease the computational costs during the search process by formulating the search as an optimization problem. Based upon the canonical evolutionary algorithm, the proposed algorithm is adapted for SAR/optical imagery intensity based matching. Extensions are drawn using techniques like hybridization (e.g. local search and others to lower the number of objective function calls and refine the result. The algorithm significantely decreases the computational costs whilst finding the optimal solution in a reliable way.

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

Science.gov (United States)

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

2018-02-01

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

Global rotational motion and displacement estimation of digital image stabilization based on the oblique vectors matching algorithm

Science.gov (United States)

Yu, Fei; Hui, Mei; Zhao, Yue-jin

2009-08-01

The image block matching algorithm based on motion vectors of correlative pixels in oblique direction is presented for digital image stabilization. The digital image stabilization is a new generation of image stabilization technique which can obtains the information of relative motion among frames of dynamic image sequences by the method of digital image processing. In this method the matching parameters are calculated from the vectors projected in the oblique direction. The matching parameters based on the vectors contain the information of vectors in transverse and vertical direction in the image blocks at the same time. So the better matching information can be obtained after making correlative operation in the oblique direction. And an iterative weighted least square method is used to eliminate the error of block matching. The weights are related with the pixels' rotational angle. The center of rotation and the global emotion estimation of the shaking image can be obtained by the weighted least square from the estimation of each block chosen evenly from the image. Then, the shaking image can be stabilized with the center of rotation and the global emotion estimation. Also, the algorithm can run at real time by the method of simulated annealing in searching method of block matching. An image processing system based on DSP was used to exam this algorithm. The core processor in the DSP system is TMS320C6416 of TI, and the CCD camera with definition of 720×576 pixels was chosen as the input video signal. Experimental results show that the algorithm can be performed at the real time processing system and have an accurate matching precision.

Simple and ultra-fast recognition and quantitation of compounded monoclonal antibodies: Application to flow injection analysis combined to UV spectroscopy and matching method.

Science.gov (United States)

Jaccoulet, E; Schweitzer-Chaput, A; Toussaint, B; Prognon, P; Caudron, E

2018-09-01

Compounding of monoclonal antibody (mAbs) constantly increases in hospital. Quality control (QC) of the compounded mAbs based on quantification and identification is required to prevent potential errors and fast method is needed to manage outpatient chemotherapy administration. A simple and ultra-fast (less than 30 s) method using flow injection analysis associated to least square matching method issued from the analyzer software was performed and evaluated for the routine hospital QC of three compounded mAbs: bevacizumab, infliximab and rituximab. The method was evaluated through qualitative and quantitative parameters. Preliminary analysis of the UV absorption and second derivative spectra of the mAbs allowed us to adapt analytical conditions according to the therapeutic range of the mAbs. In terms of quantitative QC, linearity, accuracy and precision were assessed as specified in ICH guidelines. Very satisfactory recovery was achieved and the RSD (%) of the intermediate precision were less than 1.1%. Qualitative analytical parameters were also evaluated in terms of specificity, sensitivity and global precision through a matrix of confusion. Results showed to be concentration and mAbs dependant and excellent (100%) specificity and sensitivity were reached within specific concentration range. Finally, routine application on "real life" samples (n = 209) from different batch of the three mAbs complied with the specifications of the quality control i.e. excellent identification (100%) and ± 15% of targeting concentration belonging to the calibration range. The successful use of the combination of second derivative spectroscopy and partial least square matching method demonstrated the interest of FIA for the ultra-fast QC of mAbs after compounding using matching method. Copyright © 2018 Elsevier B.V. All rights reserved.

End-use matching for solar industrial process heat. Final report

Energy Technology Data Exchange (ETDEWEB)

Brown, K.C.; Hooker, D.W.; Rabl, A.; Stadjuhar, S.A.; West, R.E.

1980-01-01

Because of the large energy demand of industry (37% of US demand) and the wide spectrum of temperatures at which heat is required, the industrial sector appears to be very suitable for the matching of solar thermal technology with industrial process heat (IPH) requirements. A methodology for end-use matching has been devised, complete with required data bases and an evaluation program PROSYS/ECONMAT. Six cities in the United States were selected for an analysis of solar applications to IPH. Typical process heat requirements for 70% of the industrial plants in each city were identified and evaluated in conjunction with meteorological and economic data for each site to determine lowest-cost solar systems for each application. The flexibility and scope of PROSYS/ECONMAT is shown in a variety of sensitivity studies that expand the results of the six-city analysis. Case studies of two industrial plants were performed to evaluate the end-use matching procedure; these results are reported.

Mathematical Model and Program for the Sizing of Counter-flow Natural Draft Wet Cooling Towers

Directory of Open Access Journals (Sweden)

Victor-Eduard Cenușă

2017-08-01

Full Text Available Assuring the necessary temperature and mass flow rate of the cooling water to the condenser represents an essential condition for the efficient operation of a steam power plant. The paper presents equations which describe the physical phenomena and the mathematical model for the design of counter-flow natural draft wet cooling towers. Following is given the flow-chart of the associated computer program. A case study is made to show the results of the computer program and emphasize the interdependence between the main design parameters.

SWEEP - Save Water and Energy Education Program; FINAL

International Nuclear Information System (INIS)

Sullivan, Gregory P; Elliott, Douglas B; Hillman, Tim C; Hadley, Adam; Ledbetter, Marc R; Payson, David R

2001-01-01

The objective of this study was to develop, monitor, analyze, and report on an integrated resource-conservation program highlighting efficient residential appliances and fixtures. The sites of study were 50 homes in two water-constrained communities located in Oregon. The program was designed to maximize water savings to these communities and to serve as a model for other communities seeking an integrated approach to energy and water resource efficiency. The program included the installation and in-place evaluation of energy- and water-efficient devices including the following: horizontal axis clothes washers (and the matching clothes dryers), resource-efficient dishwashers, an innovative dual flush low-flow toilet, low-flow showerheads, and faucet aerators. The significance of this activity lies in its integrated approach and unique metering evaluation of individual end-use, aggregated residential total use, and system-wide energy and water benefits

When should I attempt my centrally administered summative assessments in the RANZCP competency-based training program?

Science.gov (United States)

Kealy-Bateman, Warren; Kotze, Beth; Lampe, Lisa

2016-12-01

To provide information relevant to decision-making around the timing of attempting the centrally administered summative assessments in the Royal Australian and New Zealand College of Psychiatrists (RANZCP) 2012 Fellowship Program. We consider the new Competency-Based Fellowship Program of the RANZCP and its underlying philosophy, the trainee trajectory within the program and the role of the supervisor. The relationship between workplace-based and external assessments is discussed. The timing of attempting centrally administered summative assessments is considered within the pedagogical framework of medical competencies development. Although successful completion of all the centrally administered summative assessments requires demonstration of a junior consultant standard of competency, the timing at which this standard will most commonly be achieved is likely to vary from assessment to assessment. There are disadvantages attendant upon prematurely attempting assessments, and trainees are advised to carefully consider the requirements of each assessment and match this against their current level of knowledge and skills. Trainees and supervisors need to be clear about the competencies required for each of the external assessments and match this against the trainee's current competencies to assist in decision-making about the timing of assessments and planning for future learning. © The Royal Australian and New Zealand College of Psychiatrists 2016.

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

Science.gov (United States)

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

2011-01-01

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

Far-Infrared Based Pedestrian Detection for Driver-Assistance Systems Based on Candidate Filters, Gradient-Based Feature and Multi-Frame Approval Matching.

Science.gov (United States)

Wang, Guohua; Liu, Qiong

2015-12-21

Far-infrared pedestrian detection approaches for advanced driver-assistance systems based on high-dimensional features fail to simultaneously achieve robust and real-time detection. We propose a robust and real-time pedestrian detection system characterized by novel candidate filters, novel pedestrian features and multi-frame approval matching in a coarse-to-fine fashion. Firstly, we design two filters based on the pedestrians' head and the road to select the candidates after applying a pedestrian segmentation algorithm to reduce false alarms. Secondly, we propose a novel feature encapsulating both the relationship of oriented gradient distribution and the code of oriented gradient to deal with the enormous variance in pedestrians' size and appearance. Thirdly, we introduce a multi-frame approval matching approach utilizing the spatiotemporal continuity of pedestrians to increase the detection rate. Large-scale experiments indicate that the system works in real time and the accuracy has improved about 9% compared with approaches based on high-dimensional features only.

Far-Infrared Based Pedestrian Detection for Driver-Assistance Systems Based on Candidate Filters, Gradient-Based Feature and Multi-Frame Approval Matching

Directory of Open Access Journals (Sweden)

Guohua Wang

2015-12-01

Full Text Available Far-infrared pedestrian detection approaches for advanced driver-assistance systems based on high-dimensional features fail to simultaneously achieve robust and real-time detection. We propose a robust and real-time pedestrian detection system characterized by novel candidate filters, novel pedestrian features and multi-frame approval matching in a coarse-to-fine fashion. Firstly, we design two filters based on the pedestrians’ head and the road to select the candidates after applying a pedestrian segmentation algorithm to reduce false alarms. Secondly, we propose a novel feature encapsulating both the relationship of oriented gradient distribution and the code of oriented gradient to deal with the enormous variance in pedestrians’ size and appearance. Thirdly, we introduce a multi-frame approval matching approach utilizing the spatiotemporal continuity of pedestrians to increase the detection rate. Large-scale experiments indicate that the system works in real time and the accuracy has improved about 9% compared with approaches based on high-dimensional features only.

An improved principal component analysis based region matching method for fringe direction estimation

Science.gov (United States)

He, A.; Quan, C.

2018-04-01

The principal component analysis (PCA) and region matching combined method is effective for fringe direction estimation. However, its mask construction algorithm for region matching fails in some circumstances, and the algorithm for conversion of orientation to direction in mask areas is computationally-heavy and non-optimized. We propose an improved PCA based region matching method for the fringe direction estimation, which includes an improved and robust mask construction scheme, and a fast and optimized orientation-direction conversion algorithm for the mask areas. Along with the estimated fringe direction map, filtered fringe pattern by automatic selective reconstruction modification and enhanced fast empirical mode decomposition (ASRm-EFEMD) is used for Hilbert spiral transform (HST) to demodulate the phase. Subsequently, windowed Fourier ridge (WFR) method is used for the refinement of the phase. The robustness and effectiveness of proposed method are demonstrated by both simulated and experimental fringe patterns.

Contribution of Fuzzy Minimal Cost Flow Problem by Possibility Programming

Directory of Open Access Journals (Sweden)

S. Fanati Rashidi

2010-06-01

Full Text Available Using the concept of possibility proposed by zadeh, luhandjula ([4,8] and buckley ([1] have proposed the possibility programming. The formulation of buckley results in nonlinear programming problems. Negi [6]re-formulated the approach of Buckley by the use of trapezoidal fuzzy numbers and reduced the problem into fuzzy linear programming problem. Shih and Lee ([7] used the Negi approach to solve a minimum cost flow problem, whit fuzzy costs and the upper and lower bound. In this paper we shall consider the general form of this problem where all of the parameters and variables are fuzzy and also a model for solving is proposed

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

Science.gov (United States)

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

2016-06-01

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

IGDS/TRAP Interface Program (ITIP). Software User Manual (SUM). [network flow diagrams for coal gasification studies

Science.gov (United States)

Jefferys, S.; Johnson, W.; Lewis, R.; Rich, R.

1981-01-01

This specification establishes the requirements, concepts, and preliminary design for a set of software known as the IGDS/TRAP Interface Program (ITIP). This software provides the capability to develop at an Interactive Graphics Design System (IGDS) design station process flow diagrams for use by the NASA Coal Gasification Task Team. In addition, ITIP will use the Data Management and Retrieval System (DMRS) to maintain a data base from which a properly formatted input file to the Time-Line and Resources Analysis Program (TRAP) can be extracted. This set of software will reside on the PDP-11/70 and will become the primary interface between the Coal Gasification Task Team and IGDS, DMRS, and TRAP. The user manual for the computer program is presented.

Areal Feature Matching Based on Similarity Using Critic Method

Science.gov (United States)

Kim, J.; Yu, K.

2015-10-01

In this paper, we propose an areal feature matching method that can be applied for many-to-many matching, which involves matching a simple entity with an aggregate of several polygons or two aggregates of several polygons with fewer user intervention. To this end, an affine transformation is applied to two datasets by using polygon pairs for which the building name is the same. Then, two datasets are overlaid with intersected polygon pairs that are selected as candidate matching pairs. If many polygons intersect at this time, we calculate the inclusion function between such polygons. When the value is more than 0.4, many of the polygons are aggregated as single polygons by using a convex hull. Finally, the shape similarity is calculated between the candidate pairs according to the linear sum of the weights computed in CRITIC method and the position similarity, shape ratio similarity, and overlap similarity. The candidate pairs for which the value of the shape similarity is more than 0.7 are determined as matching pairs. We applied the method to two geospatial datasets: the digital topographic map and the KAIS map in South Korea. As a result, the visual evaluation showed two polygons that had been well detected by using the proposed method. The statistical evaluation indicates that the proposed method is accurate when using our test dataset with a high F-measure of 0.91.

Histogram Curve Matching Approaches for Object-based Image Classification of Land Cover and Land Use

Science.gov (United States)

Toure, Sory I.; Stow, Douglas A.; Weeks, John R.; Kumar, Sunil

2013-01-01

The classification of image-objects is usually done using parametric statistical measures of central tendency and/or dispersion (e.g., mean or standard deviation). The objectives of this study were to analyze digital number histograms of image objects and evaluate classifications measures exploiting characteristic signatures of such histograms. Two histograms matching classifiers were evaluated and compared to the standard nearest neighbor to mean classifier. An ADS40 airborne multispectral image of San Diego, California was used for assessing the utility of curve matching classifiers in a geographic object-based image analysis (GEOBIA) approach. The classifications were performed with data sets having 0.5 m, 2.5 m, and 5 m spatial resolutions. Results show that histograms are reliable features for characterizing classes. Also, both histogram matching classifiers consistently performed better than the one based on the standard nearest neighbor to mean rule. The highest classification accuracies were produced with images having 2.5 m spatial resolution. PMID:24403648

VNAP2: a computer program for computation of two-dimensional, time-dependent, compressible, turbulent flow

Energy Technology Data Exchange (ETDEWEB)

Cline, M.C.

1981-08-01

VNAP2 is a computer program for calculating turbulent (as well as laminar and inviscid), steady, and unsteady flow. VNAP2 solves the two-dimensional, time-dependent, compressible Navier-Stokes equations. The turbulence is modeled with either an algebraic mixing-length model, a one-equation model, or the Jones-Launder two-equation model. The geometry may be a single- or a dual-flowing stream. The interior grid points are computed using the unsplit MacCormack scheme. Two options to speed up the calculations for high Reynolds number flows are included. The boundary grid points are computed using a reference-plane-characteristic scheme with the viscous terms treated as source functions. An explicit artificial viscosity is included for shock computations. The fluid is assumed to be a perfect gas. The flow boundaries may be arbitrary curved solid walls, inflow/outflow boundaries, or free-jet envelopes. Typical problems that can be solved concern nozzles, inlets, jet-powered afterbodies, airfoils, and free-jet expansions. The accuracy and efficiency of the program are shown by calculations of several inviscid and turbulent flows. The program and its use are described completely, and six sample cases and a code listing are included.

Design and Numerical Study of Micropump Based on Induced Electroosmotic Flow

Directory of Open Access Journals (Sweden)

Kai Zhang

2018-01-01

Full Text Available Induced charge electroosmotic flow is a new electric driving mode. Based on the Navier–Stokes equations and the Poisson–Nernst–Planck (PNP ion transport equations, the finite volume method is adopted to calculate the equations and boundary conditions of the induced charge electroosmotic flow. In this paper, the formula of the induced zeta potential of the polarized solid surface is proposed, and a UDF program suitable for the simulation of the induced charge electroosmotic is prepared according to this theory. At the same time, on the basis of this theory, a cross micropump driven by induced charge electroosmotic flow is designed, and the voltage, electric potential, charge density, and streamline of the induced electroosmotic micropump are obtained. Studies have shown that when the cross-shaped micropump is energized, in the center of the induction electrode near the formation of a dense electric double layer, there exist four symmetrical vortices at the four corners, and they push the solution towards both outlets; it can be found that the average velocity of the solution in the cross-flow microfluidic pump is nonlinear with the applied electric field, which maybe helpful for the practical application of induced electroosmotic flow in the field of micropump.

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

Directory of Open Access Journals (Sweden)

M. Adamec

2009-01-01

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

Standardized letters of recommendation and successful match into otolaryngology.

Science.gov (United States)

Kimple, Adam J; McClurg, Stanley W; Del Signore, Anthony G; Tomoum, Mohamed O; Lin, Feng-Chang; Senior, Brent A

2016-05-01

Historically, narrative letters of recommendation have been utilized in the selection of applicants for otolaryngology residency programs. In the last two application cycles, our specialty adopted a standardized letter of recommendation (SLOR). The intent was to decrease time burden for letter writers and to provide readers with an objective evaluation of applicants. The objective of this study was to determine attributes in the SLOR that correlate with matching into a residency program. We performed a retrospective study using SLOR, United States Medical Licensing Examination (USMLE) step 1 scores, and matched outcomes of applicants who applied to our institution for the 2013 and 2014 match cycle. We included the following variables from the SLOR in the statistical analysis to determine which ones were associated with matching: patient care, medical knowledge, communication skills, procedural skills, research, initiative and drive, commitment to otolaryngology, commitment to academic medicine, match potential, and USMLE1 scores. We identified 532 applicants and 963 SLOR. In successful applicants, scores for patient care, medical knowledge, communication skills, initiative and drive, and match potential were statistically higher (P otolaryngology, commitment to academic medicine, and USMLE step 1 scores were not higher among successfully matched applicants. Although SLOR can save time for letter writers and provide an objective description of applicants, the utility of individual domains within the SLOR is questionable. Additionally, it is concerning that applicants' professionalism and procedural skills are not correlated with matching in our specialty. NA. Laryngoscope, 126:1071-1076, 2016. © 2016 The American Laryngological, Rhinological and Otological Society, Inc.

Patients with type 2 diabetes benefit from primary care-based disease management: a propensity score matched survival time analysis.

Science.gov (United States)

Drabik, Anna; Büscher, Guido; Thomas, Karsten; Graf, Christian; Müller, Dirk; Stock, Stephanie

2012-08-01

This study aimed to assess the impact of a nationwide German diabetes mellitus disease management program (DMP) on survival time and costs in comparison to routine care. The authors conducted a retrospective observational cohort study using routine administration data from Germany's largest sickness fund to identify insured suffering from diabetes in 2002. A total of 95,443 insured with type 2 diabetes mellitus who were born before January 1, 1962 met the defined inclusion criteria, resulting in 19,888 pairs of DMP participants and nonparticipants matched for socioeconomic and health status using propensity score matching methods. This is the first time propensity score matching has been used to evaluate a survival benefit of DMPs. In the time frame analyzed (3 years), mean survival time for the DMP group was 1045 days vs. 985 days for the routine care group (Ptime. They also incurred lower costs compared to propensity score matched insured in routine care.

Development of a 3-D flow analysis computer program for integral reactor

International Nuclear Information System (INIS)

Youn, H. Y.; Lee, K. H.; Kim, H. K.; Whang, Y. D.; Kim, H. C.

2003-01-01

A 3-D computational fluid dynamics program TASS-3D is being developed for the flow analysis of primary coolant system consists of complex geometries such as SMART. A pre/post processor also is being developed to reduce the pre/post processing works such as a computational grid generation, set-up the analysis conditions and analysis of the calculated results. TASS-3D solver employs a non-orthogonal coordinate system and FVM based on the non-staggered grid system. The program includes the various models to simulate the physical phenomena expected to be occurred in the integral reactor and will be coupled with core dynamics code, core T/H code and the secondary system code modules. Currently, the application of TASS-3D is limited to the single phase of liquid, but the code will be further developed including 2-phase phenomena expected for the normal operation and the various transients of the integrator reactor in the next stage

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

Science.gov (United States)

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

2018-02-01

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

An Arduino microcontroller based digitalization of a vertical traversing mechanism used for the analysis of jet flows

Science.gov (United States)

Rahman, S. M. Rakibur; Roshid, S. M. Al Mamun Or; Nishan, Ishtiaque Ahmed

2017-12-01

This paper deals with the design of a drive system of traversing mechanism used to position the pitot tube in desired position of the jet flow field. In this system a stepper motor is driven by a `dual H bridge' motor driver and programmed Arduino microcontroller. The stepper motor is made to move in precise steps to obtain desired movement of the traversing mechanism. The jet flow is characterized in three distinct zones - initial zone, transition zone and developed zone. Each zone can be divided into required number of segments based on variation of velocity. By assigning number of segments, step range and number of steps in each segment as inputs, it is possible to collect data in all the flow zones according to our programmed schedule. The system will allow taking a large number of readings automatically.

Magnetic particle movement program to calculate particle paths in flow and magnetic fields

International Nuclear Information System (INIS)

Inaba, Toru; Sakazume, Taku; Yamashita, Yoshihiro; Matsuoka, Shinya

2014-01-01

We developed an analysis program for predicting the movement of magnetic particles in flow and magnetic fields. This magnetic particle movement simulation was applied to a capturing process in a flow cell and a magnetic separation process in a small vessel of an in-vitro diagnostic system. The distributions of captured magnetic particles on a wall were calculated and compared with experimentally obtained distributions. The calculations involved evaluating not only the drag, pressure gradient, gravity, and magnetic force in a flow field but also the friction force between the particle and the wall, and the calculated particle distributions were in good agreement with the experimental distributions. Friction force was simply modeled as static and kinetic friction forces. The coefficients of friction were determined by comparing the calculated and measured results. This simulation method for solving multiphysics problems is very effective at predicting the movements of magnetic particles and is an excellent tool for studying the design and application of devices. - Highlights: ●We developed magnetic particles movement program in flow and magnetic fields. ●Friction force on wall is simply modeled as static and kinetic friction force. ●This program was applied for capturing and separation of an in-vitro diagnostic system. ●Predicted particle distributions on wall were agreed with experimental ones. ●This method is very effective at predicting movements of magnetic particles

Feature Matching for SAR and Optical Images Based on Gaussian-Gamma-shaped Edge Strength Map

Directory of Open Access Journals (Sweden)

CHEN Min

2016-03-01

Full Text Available A matching method for SAR and optical images, robust to pixel noise and nonlinear grayscale differences, is presented. Firstly, a rough correction to eliminate rotation and scale change between images is performed. Secondly, features robust to speckle noise of SAR image are detected by improving the original phase congruency based method. Then, feature descriptors are constructed on the Gaussian-Gamma-shaped edge strength map according to the histogram of oriented gradient pattern. Finally, descriptor similarity and geometrical relationship are combined to constrain the matching processing.The experimental results demonstrate that the proposed method provides significant improvement in correct matches number and image registration accuracy compared with other traditional methods.

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

Science.gov (United States)

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

2017-08-01

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

AREAL FEATURE MATCHING BASED ON SIMILARITY USING CRITIC METHOD

Directory of Open Access Journals (Sweden)

J. Kim

2015-10-01

Full Text Available In this paper, we propose an areal feature matching method that can be applied for many-to-many matching, which involves matching a simple entity with an aggregate of several polygons or two aggregates of several polygons with fewer user intervention. To this end, an affine transformation is applied to two datasets by using polygon pairs for which the building name is the same. Then, two datasets are overlaid with intersected polygon pairs that are selected as candidate matching pairs. If many polygons intersect at this time, we calculate the inclusion function between such polygons. When the value is more than 0.4, many of the polygons are aggregated as single polygons by using a convex hull. Finally, the shape similarity is calculated between the candidate pairs according to the linear sum of the weights computed in CRITIC method and the position similarity, shape ratio similarity, and overlap similarity. The candidate pairs for which the value of the shape similarity is more than 0.7 are determined as matching pairs. We applied the method to two geospatial datasets: the digital topographic map and the KAIS map in South Korea. As a result, the visual evaluation showed two polygons that had been well detected by using the proposed method. The statistical evaluation indicates that the proposed method is accurate when using our test dataset with a high F-measure of 0.91.

The Combination of Micro Diaphragm Pumps and Flow Sensors for Single Stroke Based Liquid Flow Control.

Science.gov (United States)

Jenke, Christoph; Pallejà Rubio, Jaume; Kibler, Sebastian; Häfner, Johannes; Richter, Martin; Kutter, Christoph

2017-04-03

With the combination of micropumps and flow sensors, highly accurate and secure closed-loop controlled micro dosing systems for liquids are possible. Implementing a single stroke based control mode with piezoelectrically driven micro diaphragm pumps can provide a solution for dosing of volumes down to nanoliters or variable average flow rates in the range of nL/min to μL/min. However, sensor technologies feature a yet undetermined accuracy for measuring highly pulsatile micropump flow. Two miniaturizable in-line sensor types providing electrical readout-differential pressure based flow sensors and thermal calorimetric flow sensors-are evaluated for their suitability of combining them with mircopumps. Single stroke based calibration of the sensors was carried out with a new method, comparing displacement volumes and sensor flow volumes. Limitations of accuracy and performance for single stroke based flow control are described. Results showed that besides particle robustness of sensors, controlling resistive and capacitive damping are key aspects for setting up reproducible and reliable liquid dosing systems. Depending on the required average flow or defined volume, dosing systems with an accuracy of better than 5% for the differential pressure based sensor and better than 6.5% for the thermal calorimeter were achieved.