Local Search Approaches in Stable Matching Problems
Directory of Open Access Journals (Sweden)
Toby Walsh
2013-10-01
Full Text Available The stable marriage (SM problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical formulation, n men and n women express their preferences (via a strict total order over the members of the other sex. Solving an SM problem means finding a stable marriage where stability is an envy-free notion: no man and woman who are not married to each other would both prefer each other to their partners or to being single. We consider both the classical stable marriage problem and one of its useful variations (denoted SMTI (Stable Marriage with Ties and Incomplete lists where the men and women express their preferences in the form of an incomplete preference list with ties over a subset of the members of the other sex. Matchings are permitted only with people who appear in these preference lists, and we try to find a stable matching that marries as many people as possible. Whilst the SM problem is polynomial to solve, the SMTI problem is NP-hard. We propose to tackle both problems via a local search approach, which exploits properties of the problems to reduce the size of the neighborhood and to make local moves efficiently. We empirically evaluate our algorithm for SM problems by measuring its runtime behavior and its ability to sample the lattice of all possible stable marriages. We evaluate our algorithm for SMTI problems in terms of both its runtime behavior and its ability to find a maximum cardinality stable marriage. Experimental results suggest that for SM problems, the number of steps of our algorithm grows only as O(n log(n, and that it samples very well the set of all stable marriages. It is thus a fair and efficient approach to generate stable marriages. Furthermore, our approach for SMTI problems is able to solve large problems, quickly returning stable matchings of large and often optimal size, despite the
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.
Sex-oriented stable matchings of the marriage problem with correlated and incomplete information
Caldarelli, Guido; Capocci, Andrea; Laureti, Paolo
2001-10-01
In the stable marriage problem two sets of agents must be paired according to mutual preferences, which may happen to conflict. We present two generalizations of its sex-oriented version, aiming to take into account correlations between the preferences of agents and costly information. Their effects are investigated both numerically and analytically.
User Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networks
Hamza, Doha R.
2017-03-20
We consider a network comprised of multiple primary users (PUs) and multiple secondary users (SUs), where the SUs seek access to a set of orthogonal channels each occupied by one PU. Only one SU is allowed to coexist with a given PU. We propose a distributed matching algorithm to pair the network users, where a Stackelberg game model is assumed for the interaction between the paired PU and SU. The selected secondary is given access in exchange for monetary compensation to the primary. The PU optimizes the interference price it charges to a given SU and the power allocation to maintain communication. The SU optimizes its power demand so as to maximize its utility. Our algorithm provides a unique stable matching. Numerical results indicate the advantage of the proposed algorithm over other reference schemes.
Faster and Simpler Approximation of Stable Matchings
Directory of Open Access Journals (Sweden)
Katarzyna Paluch
2014-04-01
Full Text Available We give a 3 2 -approximation algorithm for finding stable matchings that runs in O(m time. The previous most well-known algorithm, by McDermid, has the same approximation ratio but runs in O(n3/2m time, where n denotes the number of people andm is the total length of the preference lists in a given instance. In addition, the algorithm and the analysis are much simpler. We also give the extension of the algorithm for computing stable many-to-many matchings.
Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching
2013-01-01
REPORT Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching 14. ABSTRACT 16. SECURITY CLASSIFICATION OF: The stable matching...Franceschetti 858-822-2284 3. DATES COVERED (From - To) Standard Form 298 (Rev 8/98) Prescribed by ANSI Std. Z39.18 - Jealousy Graphs: Structure and...market. Using this structure, we are able to provide a ner analysis of the complexity of a subclass of decentralized matching markets. Jealousy
Solutions for the stable roommates problem with payments
Biró, Péter; Bomhoff, M.J.; Golovach, Petr A.; Kern, Walter
2014-01-01
The stable roommates problem with payments has as input a graph G = (V , E ) with an edge weighting w : E → R≥0 and the problem is to find a stable solution. By pinpointing a relationship to the accessibility of the coalition structure core of matching games, we give a constructive proof for showing
Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences
Directory of Open Access Journals (Sweden)
Maria Silvia Pini
2013-11-01
Full Text Available The stable matching problem (also known as the stable marriage problem is a well-known problem of matching men to women, so that no man and woman, who are not married to each other, both prefer each other. Such a problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market. In the classical stable marriage problem, both men and women express a strict preference order over the members of the other sex, in a qualitative way. Here, we consider stable marriage problems with weighted preferences: each man (resp., woman provides a score for each woman (resp., man. Such problems are more expressive than the classical stable marriage problems. Moreover, in some real-life situations, it is more natural to express scores (to model, for example, profits or costs rather than a qualitative preference ordering. In this context, we define new notions of stability and optimality, and we provide algorithms to find marriages that are stable and/or optimal according to these notions. While expressivity greatly increases by adopting weighted preferences, we show that, in most cases, the desired solutions can be found by adapting existing algorithms for the classical stable marriage problem. We also consider the manipulability properties of the procedures that return such stable marriages. While we know that all procedures are manipulable by modifying the preference lists or by truncating them, here, we consider if manipulation can occur also by just modifying the weights while preserving the ordering and avoiding truncation. It turns out that, by adding weights, in some cases, we may increase the possibility of manipulating, and this cannot be avoided by any reasonable restriction on the weights.
Edge-Matching Problems with Rotations
DEFF Research Database (Denmark)
Ebbesen, Martin; Fischer, Paul; Witt, Carsten
2011-01-01
Edge-matching problems, also called puzzles, are abstractions of placement problems with neighborhood conditions. Pieces with colored edges have to be placed on a board such that adjacent edges have the same color. The problem has gained interest recently with the (now terminated) Eternity II...... puzzle, and new complexity results. In this paper we consider a number of settings which differ in size of the puzzles and the manipulations allowed on the pieces. We investigate the effect of allowing rotations of the pieces on the complexity of the problem, an aspect that is only marginally treated so...
Efficient and stable perfectly matched layer for CEM
Duru, Kenneth
2014-02-01
An efficient unsplit perfectly matched layer for numerical simulation of electromagnetic waves in unbounded domains is derived via a complex change of variables. In order to surround a Cartesian grid with the PML, the time-dependent PML requires only one (scalar) auxiliary variable in two space dimensions and six (scalar) auxiliary variables in three space dimensions. It is therefore cheap and straightforward to implement. We use Fourier and energy methods to prove the stability of the PML. We extend the stability result to a semi-discrete PML approximated by central finite differences of arbitrary order of accuracy and to a fully discrete problem for the \\'Leap-Frog\\' schemes. This makes precise the usefulness of the derived PML model for longtime simulations. Numerical experiments are presented, illustrating the accuracy and stability of the PML. © 2013 IMACS.
Tang, Xiaolan; Hong, Donghui; Chen, Wenlong
2017-06-08
Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services. In this article, we propose a data acquisition model using stable matching of bipartite graph in cooperative vehicle-infrastructure systems, namely, DAS. Contents are distributed to roadside units, while vehicular nodes support supplementary storage. The original distribution problem is formulated as a stable matching problem of bipartite graph, where the data and the storage cells compose two sides of vertices. Regarding the factors relevant with the access ratio and delay, the preference rankings for contents and roadside units are calculated, respectively. With a multi-replica preprocessing algorithm to handle the potential one-to-many mapping, the matching problem is addressed in polynomial time. In addition, vehicular nodes carry and forward assistant contents to deliver the failed packets because of bandwidth competition. Furthermore, an incentive strategy is put forward to boost the vehicle cooperation and to achieve a fair bandwidth allocation at roadside units. Experiments show that DAS achieves a high access ratio and a small storage cost with an acceptable delay.
A Stable-Matching-Based User Linking Method with User Preference Order
Directory of Open Access Journals (Sweden)
Xuzhong Wang
2017-01-01
Full Text Available With the development of social networks, more and more users choose to use multiple accounts from different networks to meet their needs. Linking a particular user’s multiple accounts not only can improve user’s experience of the net-services such as recommender system, but also plays a significant role in network security. However, multiple accounts of the same user are often not directly linked to each other, and further, the privacy policy provided by the service provider makes it harder to find accounts for a particular user. In this paper, we propose a stable-matching-based method with user preference order for the problem of low accuracy of user linking in cross-media sparse data. Different from the traditional way which just calculates the similarity of accounts, we take full account of the mutual influence among multiple accounts by regarding different networks as bilateral (multilateral market and user linking as a stable matching problem in such a market. Based on the combination of Game-Theoretic Machine Learning and Pairwise, a novel user linking method has been proposed. The experiment shows that our method has a 21.6% improvement in accuracy compared with the traditional linking method and a further increase of about 7.8% after adding the prior knowledge.
The stable fixtures problem with payments
Biró, Péter; Kern, Walter; Paulusma, Daniël; Wojuteczky, Péter
2017-01-01
We consider multiple partners matching games (G,b,w), where G is a graph with an integer vertex capacity function b and an edge weighting w. If G is bipartite, these games are called multiple partners assignment games. We give a polynomial-time algorithm that either finds that a given multiple
The stable fixtures problem with payments
Biró, Péter; Kern, Walter; Paulusma, Daniël; Wojuteczky, Péter; Mayr, Ernst W.
2016-01-01
We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph $G=(N,E)$, with an integer vertex capacity function $b$ and an edge weighting $w$. The set $N$ consists of a number of players that are to form a set $M\\subseteq E$ of 2-player
Exact Methods for Solving the Train Departure Matching Problem
DEFF Research Database (Denmark)
Haahr, Jørgen Thorlund; Bull, Simon Henry
In this paper we consider the train departure matching problem which is an important subproblem of the Rolling Stock Unit Management on Railway Sites problem introduced in the ROADEF/EURO Challenge 2014. The subproblem entails matching arriving train units to scheduled departing trains at a railway...... site while respecting multiple physical and operational constraints. In this paper we formally define that subproblem, prove its NP- hardness, and present two exact method approaches for solving the problem. First, we present a compact Mixed Integer Program formulation which we solve using a MIP solver...
Controlled neural network application in track-match problem
International Nuclear Information System (INIS)
Baginyan, S.A.; Ososkov, G.A.
1993-01-01
Track-match problem of high energy physics (HEP) data handling is formulated in terms of incidence matrices. The corresponding Hopfield neural network is developed to solve this type of constraint satisfaction problems (CSP). A special concept of the controlled neural network is proposed as a basis of an algorithm for the effective CSP solution. Results of comparable calculations show the very high performance of this algorithm against conventional search procedures. 8 refs.; 1 fig.; 1 tab
Cellular neural networks for the stereo matching problem
International Nuclear Information System (INIS)
Taraglio, S.; Zanela, A.
1997-03-01
The applicability of the Cellular Neural Network (CNN) paradigm to the problem of recovering information on the tridimensional structure of the environment is investigated. The approach proposed is the stereo matching of video images. The starting point of this work is the Zhou-Chellappa neural network implementation for the same problem. The CNN based system we present here yields the same results as the previous approach, but without the many existing drawbacks
A parallel approach to the stable marriage problem
DEFF Research Database (Denmark)
Larsen, Jesper
1997-01-01
This paper describes two parallel algorithms for the stable marriage problem implemented on a MIMD parallel computer. The algorithms are tested against sequential algorithms on randomly generated and worst-case instances. The results clearly show that the combination fo a very simple problem...... and a commercial MIMD system results in parallel algorithms which are not competitive with sequential algorithms wrt. practical performance. 1 Introduction In 1962 the Stable Marriage Problem was....
Handelman's hierarchy for the maximum stable set problem
Laurent, M.; Sun, Z.
2014-01-01
The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a
Statistical Mechanics of a Simplified Bipartite Matching Problem: An Analytical Treatment
Dell'Erba, Matías Germán
2012-03-01
We perform an analytical study of a simplified bipartite matching problem in which there exists a constant matching energy, and both heterosexual and homosexual pairings are allowed. We obtain the partition function in a closed analytical form and we calculate the corresponding thermodynamic functions of this model. We conclude that the model is favored at high temperatures, for which the probabilities of heterosexual and homosexual pairs tend to become equal. In the limits of low and high temperatures, the system is extensive, however this property is lost in the general case. There exists a relation between the matching energies for which the system becomes more stable under external (thermal) perturbations. As the difference of energies between the two possible matches increases the system becomes more ordered, while the maximum of entropy is achieved when these energies are equal. In this limit, there is a first order phase transition between two phases with constant entropy.
Defining the XML schema matching problem for a personal schema based query answering system
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 ...
Defining the XML schema matching problem for a personal schema based query answering system
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
The tangential breast match plane: Practical problems and solutions
International Nuclear Information System (INIS)
Norris, M.
1989-01-01
The three-field breast set-up, in which tangential oblique opposed fields are joined to an anterior supraclavicular field, has been the method of choice for treatment of breast cancer for many years. In the last several years many authors have suggested refinements to the technique that improve the accuracy with which fields join at a match plane. The three-field breast set-up, using a rotatable half-beam block is the technique used at our institution. In instituting this procedure, several practical problems were encountered. Due to the small collimator rotation angles used it is possible to clinically reverse the collimator angle without observing an error noticeable on fluoroscopy. A second error can occur when the table base angle is used to compensate for the incorrect collimator rotation. These potential sources of error can be avoided if a programmable calculator or computer program is used to assist the dosimetrist during the simulation. Utilization of fluoroscopy, digital table position displays and a caliper provide accurate input for the computer program. This paper will present a hybrid procedure that combines practical set-up procedures with the mathematical calculation of ideal angles to result in an accurate and practical approach to breast simulation
The complexity of the matching-cut problem for planar graphs and other graph classes
Bonsma, P.S.
2009-01-01
The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be -complete when restricted to graphs with maximum degree four. In this paper it
Matching problems in pulse power radial transmission lines
International Nuclear Information System (INIS)
Mittag, K.; Brandelik, A.
1984-12-01
In this report we study the power transfer from a generator along a coaxial transmission line followed by a radial transmission line into a load, which in our application is a pseudo-spark plasma of about one millimeter diameter and about 15 cm in length. First the theoretical background based on transmission line theory is described. Then numerical results are presented. The main conclusion is that when matching the pulse power generator to the pseudo-spark plasma, the effect of the impedance transformation caused by the radial transmission line has to be taken into account. The conditions to obtain an optimal match are described. (orig.) [de
Faria, Luiz; Rosales, Rodolfo
2017-11-01
We introduce an alternative to the method of matched asymptotic expansions. In the ``traditional'' implementation, approximate solutions, valid in different (but overlapping) regions are matched by using ``intermediate'' variables. Here we propose to match at the level of the equations involved, via a ``uniform expansion'' whose equations enfold those of the approximations to be matched. This has the advantage that one does not need to explicitly solve the asymptotic equations to do the matching, which can be quite impossible for some problems. In addition, it allows matching to proceed in certain wave situations where the traditional approach fails because the time behaviors differ (e.g., one of the expansions does not include dissipation). On the other hand, this approach does not provide the fairly explicit approximations resulting from standard matching. In fact, this is not even its aim, which to produce the ``simplest'' set of equations that capture the behavior. Ruben Rosales work was partially supported by NSF Grants DMS-1614043 and DMS-1719637.
Kim, Seungil
2010-01-01
In this paper, we study the spectrum of the operator which results when the Perfectly Matched Layer (PML) is applied in Cartesian geometry to the Laplacian on an unbounded domain. This is often thought of as a complex change of variables or "complex stretching." The reason that such an operator is of interest is that it can be used to provide a very effective domain truncation approach for approximating acoustic scattering problems posed on unbounded domains. Stretching associated with polar or spherical geometry lead to constant coefficient operators outside of a bounded transition layer and so even though they are on unbounded domains, they (and their numerical approximations) can be analyzed by more standard compact perturbation arguments. In contrast, operators associated with Cartesian stretching are non-constant in unbounded regions and hence cannot be analyzed via a compact perturbation approach. Alternatively, to show that the scattering problem PML operator associated with Cartesian geometry is stable for real nonzero wave numbers, we show that the essential spectrum of the higher order part only intersects the real axis at the origin. This enables us to conclude stability of the PML scattering problem from a uniqueness result given in a subsequent publication. © 2009 Elsevier Inc. All rights reserved.
Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.
Moreno-Scott, Jorge Humberto; Ortiz-Bayliss, José Carlos; Terashima-Marín, Hugo; Conant-Pablos, Santiago Enrique
2016-01-01
Constraint satisfaction problems are of special interest for the artificial intelligence and operations research community due to their many applications. Although heuristics involved in solving these problems have largely been studied in the past, little is known about the relation between instances and the respective performance of the heuristics used to solve them. This paper focuses on both the exploration of the instance space to identify relations between instances and good performing heuristics and how to use such relations to improve the search. Firstly, the document describes a methodology to explore the instance space of constraint satisfaction problems and evaluate the corresponding performance of six variable ordering heuristics for such instances in order to find regions on the instance space where some heuristics outperform the others. Analyzing such regions favors the understanding of how these heuristics work and contribute to their improvement. Secondly, we use the information gathered from the first stage to predict the most suitable heuristic to use according to the features of the instance currently being solved. This approach proved to be competitive when compared against the heuristics applied in isolation on both randomly generated and structured instances of constraint satisfaction problems.
Leader Derailment in Academe: Does the Training Match the Problems?
Williams, Feruzan Irani; Campbell, Constance; McCartney, William; Gooding, Carl
2012-01-01
Leader derailment of middle managers in higher education is most often attributable to self-defeating behaviors (SDBs) and problems with interpersonal relationships (PIRs). This study attempted to determine whether training provided for middle managers in Academe sufficiently addresses these issues. Our findings suggest that while little more than…
Applications of stable isotope tracers to air pollution problems
International Nuclear Information System (INIS)
Kelly, W.R.
1985-01-01
One of the fundamental environmental problems facing the United States is how to effect acid rain abatement in the northeast United States and southeastern Canada in a cost effective manner. There are several key scientific questions that must be addressed in order to design an effective strategy. These questions include the following: (1) where do pollutants from a specified source area go., (2) what chemical transformations occur during transport., and (3) where and how are these pollutants deposited. One approach to address these questions is the use of enriched stable isotopes as intentional tracers of aerosol and sulfur emissions. Isotopic tracers can determine the location and pathways of pollutants in the environment and trace pollutants back to their original source. For an element with n isotopes, it is possible to intentionally tag n-2 sources. (For example, Nd, which has seven isotopes, could be used to tag 5 different aerosol sources). To trace sulfur compounds, the two minor isotopes of sulfur, 33 S and 36 S, could be used. Methods developed at NBS using high precision mass spectrometry permits the detection of the small changes in isotopic composition brought about by the intentional tagging at a source. This may make possible the identification of a source at a particular sampling site
DEFF Research Database (Denmark)
Wøhlk, Sanne; Laporte, Gilbert
2017-01-01
The aim of this paper is to computationally compare several algorithms for the Minimum Cost Perfect Matching Problem on an undirected complete graph. Our work is motivated by the need to solve large instances of the Capacitated Arc Routing Problem (CARP) arising in the optimization of garbage...... collection in Denmark. Common heuristics for the CARP involve the optimal matching of the odd-degree nodes of a graph. The algorithms used in the comparison include the CPLEX solution of an exact formulation, the LEDA matching algorithm, a recent implementation of the Blossom algorithm, as well as six...
A Large-Scale Study of Fingerprint Matching Systems for Sensor Interoperability Problem
Directory of Open Access Journals (Sweden)
Helala AlShehri
2018-03-01
Full Text Available The fingerprint is a commonly used biometric modality that is widely employed for authentication by law enforcement agencies and commercial applications. The designs of existing fingerprint matching methods are based on the hypothesis that the same sensor is used to capture fingerprints during enrollment and verification. Advances in fingerprint sensor technology have raised the question about the usability of current methods when different sensors are employed for enrollment and verification; this is a fingerprint sensor interoperability problem. To provide insight into this problem and assess the status of state-of-the-art matching methods to tackle this problem, we first analyze the characteristics of fingerprints captured with different sensors, which makes cross-sensor matching a challenging problem. We demonstrate the importance of fingerprint enhancement methods for cross-sensor matching. Finally, we conduct a comparative study of state-of-the-art fingerprint recognition methods and provide insight into their abilities to address this problem. We performed experiments using a public database (FingerPass that contains nine datasets captured with different sensors. We analyzed the effects of different sensors and found that cross-sensor matching performance deteriorates when different sensors are used for enrollment and verification. In view of our analysis, we propose future research directions for this problem.
A Large-Scale Study of Fingerprint Matching Systems for Sensor Interoperability Problem.
AlShehri, Helala; Hussain, Muhammad; AboAlSamh, Hatim; AlZuair, Mansour
2018-03-28
The fingerprint is a commonly used biometric modality that is widely employed for authentication by law enforcement agencies and commercial applications. The designs of existing fingerprint matching methods are based on the hypothesis that the same sensor is used to capture fingerprints during enrollment and verification. Advances in fingerprint sensor technology have raised the question about the usability of current methods when different sensors are employed for enrollment and verification; this is a fingerprint sensor interoperability problem. To provide insight into this problem and assess the status of state-of-the-art matching methods to tackle this problem, we first analyze the characteristics of fingerprints captured with different sensors, which makes cross-sensor matching a challenging problem. We demonstrate the importance of fingerprint enhancement methods for cross-sensor matching. Finally, we conduct a comparative study of state-of-the-art fingerprint recognition methods and provide insight into their abilities to address this problem. We performed experiments using a public database (FingerPass) that contains nine datasets captured with different sensors. We analyzed the effects of different sensors and found that cross-sensor matching performance deteriorates when different sensors are used for enrollment and verification. In view of our analysis, we propose future research directions for this problem.
A Family of Bipartite |Cardinality Matching Problems Solvable in O(n\\^2) Time
DEFF Research Database (Denmark)
Clausen, Jens; Krarup, J.
1995-01-01
For a given, unweighted bipartite graph G with 2n non isolated vertices, we consider the so called bipartite cardinality matching problem (BCMP) for which the time complexity of the fastest exact algorithm available is O(n/sup 5/2/ ). We devise a greedy algorithm which either finds a perfect...... matching in O(n/sup 2/ ) time or identifies cycle of length 4 in the complement G of G...
DEFF Research Database (Denmark)
Lange, Katrine; Frydendall, Jan; Cordua, Knud Skou
2012-01-01
The frequency matching method defines a closed form expression for a complex prior that quantifies the higher order statistics of a proposed solution model to an inverse problem. While existing solution methods to inverse problems are capable of sampling the solution space while taking into account...... arbitrarily complex a priori information defined by sample algorithms, it is not possible to directly compute the maximum a posteriori model, as the prior probability of a solution model cannot be expressed. We demonstrate how the frequency matching method enables us to compute the maximum a posteriori...... solution model to an inverse problem by using a priori information based on multiple point statistics learned from training images. We demonstrate the applicability of the suggested method on a synthetic tomographic crosshole inverse problem....
Kim, Seungil; Pasciak, Joseph E.
2010-01-01
is stable for real nonzero wave numbers, we show that the essential spectrum of the higher order part only intersects the real axis at the origin. This enables us to conclude stability of the PML scattering problem from a uniqueness result given in a
International Nuclear Information System (INIS)
Wang Yue; Wang Jian-Guo; Chen Zai-Gao
2015-01-01
Based on conformal construction of physical model in a three-dimensional Cartesian grid, an integral-based conformal convolutional perfectly matched layer (CPML) is given for solving the truncation problem of the open port when the enlarged cell technique conformal finite-difference time-domain (ECT-CFDTD) method is used to simulate the wave propagation inside a perfect electric conductor (PEC) waveguide. The algorithm has the same numerical stability as the ECT-CFDTD method. For the long-time propagation problems of an evanescent wave in a waveguide, several numerical simulations are performed to analyze the reflection error by sweeping the constitutive parameters of the integral-based conformal CPML. Our numerical results show that the integral-based conformal CPML can be used to efficiently truncate the open port of the waveguide. (paper)
Transductive and matched-pair machine learning for difficult target detection problems
Theiler, James
2014-06-01
This paper will describe the application of two non-traditional kinds of machine learning (transductive machine learning and the more recently proposed matched-pair machine learning) to the target detection problem. The approach combines explicit domain knowledge to model the target signal with a more agnostic machine-learning approach to characterize the background. The concept is illustrated with simulated data from an elliptically-contoured background distribution, on which a subpixel target of known spectral signature but unknown spatial extent has been implanted.
Okuzono, Sakurako; Fujiwara, Takeo; Kato, Tsuguhiko; Kawachi, Ichiro
2017-07-01
Harsh or frequent spanking in early childhood is an established risk factor for later childhood behavioral problems as well as mental disorder in adulthood in Western societies. However, few studies have been conducted in Asian populations, where corporal punishment is relatively accepted. Moreover, the impacts of occasional spanking on subsequent behavioral problems remain uncertain. This study sought to investigate prospectively the association between the frequency of spanking of toddlers and later behavioral problems in Japanese children using national birth cohort data. We used data from the Longitudinal Survey of Newborns in the 21st Century, a population-based birth cohort data set collected by the Japanese Ministry of Health, Labour, and Welfare (N=29,182). Frequency of spanking ("never", "sometimes" and "always") and child behavioral problems were assessed via a caregiver questionnaire when the child was 3.5 years old and again at 5.5 years. Propensity score matching was used to examine the association between frequency of spanking and child behavioral problems, adjusting for parental socioeconomic status, child temperament and parenting behaviors. Compared to children who were never spanked, occasional spanking ("sometimes") showed a higher number of behavioral problems (on a 6-point scale) (coefficient: 0.11, 95% CI: 0.07-0.15), and frequent spanking ("always") showed an even larger number of behavioral problems compared with "sometimes" (coefficient: 0.08, 95% CI:0.01-0.16). Spanking of any self-reported frequency was associated with an increased risk for later behavioral problems in children. Copyright © 2017 Elsevier Ltd. All rights reserved.
Stable Galerkin versus equal-order Galerkin least-squares elements for the stokes flow problem
International Nuclear Information System (INIS)
Franca, L.P.; Frey, S.L.; Sampaio, R.
1989-11-01
Numerical experiments are performed for the stokes flow problem employing a stable Galerkin method and a Galerkin/Least-squares method with equal-order elements. Error estimates for the methods tested herein are reviewed. The numerical results presented attest the good stability properties of all methods examined herein. (A.C.A.S.) [pt
Tucker, Jalie A; Cheong, JeeWon; Chandler, Susan D; Lambert, Brice H; Pietrzak, Brittney; Kwok, Heather; Davies, Susan L
2016-12-01
As interventions have expanded beyond clinical treatment to include brief interventions for persons with less severe alcohol problems, predicting who can achieve stable moderation drinking has gained importance. Recent behavioral economic (BE) research on natural recovery has shown that active problem drinkers who allocate their monetary expenditures on alcohol and saving for the future over longer time horizons tend to have better subsequent recovery outcomes, including maintenance of stable moderation drinking. This study compared the predictive utility of this money-based "Alcohol-Savings Discretionary Expenditure" (ASDE) index with multiple BE analogue measures of behavioral impulsivity and self-control, which have seldom been investigated together, to predict outcomes of natural recovery attempts. Community-dwelling problem drinkers, enrolled shortly after stopping abusive drinking without treatment, were followed prospectively for up to a year (N = 175 [75.4% male], M age = 50.65 years). They completed baseline assessments of preresolution drinking practices and problems, analogue behavioral choice tasks (Delay Discounting, Melioration-Maximization, and Alcohol Purchase Tasks), and a Timeline Followback interview including expenditures on alcohol compared to voluntary savings (ASDE index) during the preresolution year. Multinomial logistic regression models showed that, among the BE measures, only the ASDE index predicted stable moderation drinking compared to stable abstinence or unstable resolutions involving relapse. As hypothesized, stable moderation was associated with more balanced preresolution allocations to drinking and savings (odds ratio = 1.77, 95% confidence interval = 1.02 to 3.08, p < 0.05), suggesting it is associated with longer-term behavior regulation processes than abstinence. The ASDE's unique predictive utility may rest on its comprehensive representation of contextual elements to support this patterning of behavioral
Tucker, Jalie A.; Cheong, JeeWon; Chandler, Susan D.; Lambert, Brice H.; Pietrzak, Brittney; Kwok, Heather; Davies, Susan L.
2016-01-01
Background As interventions have expanded beyond clinical treatment to include brief interventions for persons with less severe alcohol problems, predicting who can achieve stable moderation drinking has gained importance. Recent behavioral economic (BE) research on natural recovery has shown that active problem drinkers who allocate their monetary expenditures on alcohol and saving for the future over longer time horizons tend to have better subsequent recovery outcomes, including maintenance of stable moderation drinking. The present study compared the predictive utility of this money-based “Alcohol-Savings Discretionary Expenditure” (ASDE) index with multiple BE analogue measures of behavioral impulsivity and self-control, which have seldom been investigated together, to predict outcomes of natural recovery attempts. Methods Community-dwelling problem drinkers, enrolled shortly after stopping abusive drinking without treatment, were followed prospectively for up to a year (N = 175 [75.4% male], M age = 50.65 years). They completed baseline assessments of pre-resolution drinking practices and problems; analogue behavioral choice tasks (Delay Discounting, Melioration-Maximization, and Alcohol Purchase Tasks); and a Timeline Followback interview including expenditures on alcohol compared to voluntary savings (ASDE index) during the pre-resolution year. Results Multinomial logistic regression models showed that, among the BE measures, only the ASDE index predicted stable moderation drinking compared to stable abstinence or unstable resolutions involving relapse. As hypothesized, stable moderation was associated with more balanced pre-resolution allocations to drinking and savings (OR = 1.77, 95% CI = 1.02 ∼ 3.08, p < .05), suggesting it is associated with longer term behavior regulation processes than abstinence. Conclusions The ASDE's unique predictive utility may rest on its comprehensive representation of contextual elements to support this patterning of
Picker, L.J. De; Cornelis, C.; Hulstijn, W.; Dumont, G.J.H.; Fransen, E.; Timmers, M.; Janssens, L.; Morrens, M.; Sabbe, B.G.C.
2014-01-01
Objective: To compare sensorimotor performance and learning in stable schizophrenia patients, healthy age- and sex-matched controls and elderly controls on two variations of the rotary pursuit: circle pursuit (true motor learning) and figure pursuit (motor and sequence learning). Method: In the
Directory of Open Access Journals (Sweden)
Muhammad Yasir
2010-09-01
Full Text Available Virtual organization emerged as a highly flexible structure in response to the rapidly changing environment of 20th century. This organization consists of independently working parties that combine their best possible resources to exploit the emerging market opportunities. There are no formal control and coordination mechanisms employed by the classical hierarchical structures. Parties, therefore, manage their dependencies on each other through mutual understanding and trust.Mathematician John Nash, having significant contributions in Game Theory suggests that in every non-cooperative game there is at least one equilibrium point. At this point, according to him, every strategy of the player represents a response to the others’ strategies. Such equilibria could exist in a virtual organization, at which parties coordinate which each other to optimize their performance.Coordination/Matching problems are likely to arise among game theoretically coordinating parties in a virtual organization, mainly due to lack of binding agreements. By identifying and resolving these matching problems, virtual organizations could achieve efficiency and better coordination among parties.
Plummer, MD
1986-01-01
This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.
Solution matching for a three-point boundary-value problem on atime scale
Directory of Open Access Journals (Sweden)
Martin Eggensperger
2004-07-01
Full Text Available Let $mathbb{T}$ be a time scale such that $t_1, t_2, t_3 in mathbb{T}$. We show the existence of a unique solution for the three-point boundary value problem $$displaylines{ y^{DeltaDeltaDelta}(t = f(t, y(t, y^Delta(t, y^{DeltaDelta}(t, quad t in [t_1, t_3] cap mathbb{T},cr y(t_1 = y_1, quad y(t_2 = y_2, quad y(t_3 = y_3,. }$$ We do this by matching a solution to the first equation satisfying a two-point boundary conditions on $[t_1, t_2] cap mathbb{T}$ with a solution satisfying a two-point boundary conditions on $[t_2, t_3] cap mathbb{T}$.
Polar optical phonons in a semiconductor quantum-well: The complete matching problem
International Nuclear Information System (INIS)
Nieto, J.M.; Comas, F.
2007-01-01
Confined polar optical phonons in a semiconductor quantum-well (QW) are studied by applying a phenomenological theory which was proposed a few years ago and is based on a continuum approach. This theory considers the coupled character of the electromechanical vibrations and takes due account of both the electric and mechanical boundary conditions. In the present work, we have applied the so-called complete matching problem in contrast with all previous published works on the subject, where more restrictive approximate boundary conditions has been applied. We also consider the effects of strains at the interfaces on the phonon spectra. Comparisons with previous works are made, while we focused on the study of a ZnTe/CdTe/ZnTe QW
Frankenstein, Lutz; Zugck, Christian; Nelles, Manfred; Schellberg, Dieter; Katus, Hugo A; Remppis, B Andrew
2009-12-01
To verify whether controlling for indicators of disease severity and confounders represents a solution to the obesity paradox in chronic heart failure (CHF). From a cohort of 1790 patients, we formed 230 nested matched triplets by individually matching patients with body mass index (BMI) > 30 kg/m(2) (Group 3), BMI 20-24.9 k/m(2) (Group 1) and BMI 25-29.9 kg/m(2) (Group 2), according to NT-proBNP, age, sex, and NYHA class (triplet = one matched patient from each group). Although in the pre-matching cohort, BMI group was a significant univariable prognostic indicator, it did not retain significance [heart rate (HR): 0.91, 95% CI: 0.78-1.05, chi(2): 1.67] when controlled for group propensities as covariates. Furthermore, in the matched cohort, 1-year mortality and 3-year mortality did not differ significantly. Here, BMI again failed to reach statistical significance for prognosis, either as a continuous or categorical variable, whether crude or adjusted. This result was confirmed in the patients not selected for matching. NT-proBNP, however, remained statistically significant (log(NT-proBNP): HR: 1.49, 95% CI: 1.13-1.97, chi(2): 7.82) after multivariable adjustment. The obesity paradox does not appear to persist in a matched setting with respect to indicators of disease severity and other confounders. NT-proBNP remains an independent prognostic indicator of adverse outcome irrespective of obesity status.
No shortcut solution to the problem of Y-STR match probability calculation.
Caliebe, Amke; Jochens, Arne; Willuweit, Sascha; Roewer, Lutz; Krawczak, Michael
2015-03-01
Match probability calculation is deemed much more intricate for lineage genetic markers, including Y-chromosomal short tandem repeats (Y-STRs), than for autosomal markers. This is because, owing to the lack of recombination, strong interdependence between markers is likely, which implies that haplotype frequency estimates cannot simply be obtained through the multiplication of allele frequency estimates. As yet, however, the practical relevance of this problem has not been studied in much detail using real data. In fact, such scrutiny appears well warranted because the high mutation rates of Y-STRs and the possibility of backward mutation should have worked against the statistical association of Y-STRs. We examined haplotype data of 21 markers included in the PowerPlex(®)Y23 set (PPY23, Promega Corporation, Madison, WI) originating from six different populations (four European and two Asian). Assessing the conditional entropies of the markers, given different subsets of markers from the same panel, we demonstrate that the PowerPlex(®)Y23 set cannot be decomposed into smaller marker subsets that would be (conditionally) independent. Nevertheless, in all six populations, >94% of the joint entropy of the 21 markers is explained by the seven most rapidly mutating markers. Although this result might render a reduction in marker number a sensible option for practical casework, the partial haplotypes would still be almost as diverse as the full haplotypes. Therefore, match probability calculation remains difficult and calls for the improvement of currently available methods of haplotype frequency estimation. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.
A blind matching algorithm for cognitive radio networks
Hamza, Doha R.; Shamma, Jeff S.
2016-01-01
that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power
On the classification of the spectrally stable standing waves of the Hartree problem
Georgiev, Vladimir; Stefanov, Atanas
2018-05-01
We consider the fractional Hartree model, with general power non-linearity and arbitrary spatial dimension. We construct variationally the "normalized" solutions for the corresponding Choquard-Pekar model-in particular a number of key properties, like smoothness and bell-shapedness are established. As a consequence of the construction, we show that these solitons are spectrally stable as solutions to the time-dependent Hartree model. In addition, we analyze the spectral stability of the Moroz-Van Schaftingen solitons of the classical Hartree problem, in any dimensions and power non-linearity. A full classification is obtained, the main conclusion of which is that only and exactly the "normalized" solutions (which exist only in a portion of the range) are spectrally stable.
The stable problem of the black-hole connected region in the Schwarzschild black hole
Tian, Guihua
2005-01-01
The stability of the Schwarzschild black hole is studied. Using the Painlev\\'{e} coordinate, our region can be defined as the black-hole-connected region(r>2m, see text) of the Schwarzschild black hole or the white-hole-connected region(r>2m, see text) of the Schwarzschild black hole. We study the stable problems of the black-hole-connected region. The conclusions are: (1) in the black-hole-connected region, the initially regular perturbation fields must have real frequency or complex frequen...
Slof, Bert; Erkens, Gijsbert; Kirschner, Paul A.
2011-01-01
Slof, B., Erkens, G., & Kirschner, P. A. (2010, July). Matching representational tools’ ontology to part-task demands to foster problem-solving in business economics. In K. Gomez, L. Lyons, & J. Radinsky (Eds.), Learning in the Disciplines: Proceedings of the 9th International Conference of the
Directory of Open Access Journals (Sweden)
Livia J. De Picker
2014-11-01
Full Text Available Objective: To compare sensorimotor performance and learning in stable schizophrenia patients, healthy age- and sex-matched controls and elderly controls on two variations of the Rotary Pursuit: Circle Pursuit (true motor learning and Figure Pursuit (motor and sequence learning.Method: In the Circle Pursuit a target circle, rotating with increasing speed along a predictable circular path on the computer screen, must be followed by a cursor controlled by a pen on a writing tablet. In the eight-trial Figure Pursuit, subjects learn to draw a complex figure by pursuing the target circle that moves along an invisible trajectory between and around several goals. Tasks were administered thrice (day 1, day 2, day 7 to 30 patients with stable schizophrenia (S, 30 healthy age- and sex-matched controls (C and 30 elderly participants (>65y; E and recorded with a digitizing tablet and pressure-sensitive pen. The outcome measure accuracy (% of time that cursor is within the target was used to assess performance.Results: We observed significant group differences in accuracy, both in Circle and Figure Pursuit tasks (Ematched controls were equal and both were larger than those of the elderly controls. Conclusion: Despite the reduced sensorimotor performance that was found in the schizophrenia patients their sensorimotor learning seems to be preserved. The relevance of this finding for the evaluation of procedural learning in schizophrenia is discussed. The better performance and learning rate of the patients compared to the elderly controls was unexpected and deserves further study.
Hoffman, Lauren J; Chu, Brian C
2015-04-01
Parents and youth often report discrepant target problems upon seeking treatment for youth psychopathology, which can have important impact on therapy processes (e.g., dropout) and treatment outcomes, as entry-level attitudes have been found to be influential in ultimate use and benefit of treatment. The current study examined parent-youth agreement within an anxiety disordered sample by assessing demographic and diagnostic factors that may predict matching, as well as the impact of matching on attrition, treatment outcome, and parental satisfaction. Ninety-five youth with principal anxiety disorders received cognitive-behavioral treatment for anxiety at a university outpatient clinic. Youth and parents independently identified target problems during the pretreatment assessment. Target problems were coded into 25 qualitative categories representing diagnostic, symptom, and functional impairment domains, including diffuse anxiety, social anxiety, academic achievement, oppositional/behavior problems, sleep problems, suicidal ideation, and family functioning. The majority of parent-youth dyads (67.4%) agreed on at least one target problem. Although problems related to diffuse anxiety and social anxiety were reported most frequently, relatively low rates of agreement were found in these domains. Kappa values demonstrated higher levels of agreement for problems with specific fears, school attendance, and panic and lower levels of agreement for difficulties with worry, shame, and self-esteem. Further, youth diagnosed with comorbid externalizing disorders were less likely to agree with their parents on at least one target problem. No effects were found for gender, age, or number of diagnoses in predicting agreement. Target problem agreement did not significantly impact rates of attrition or diagnostic remission, but did predict some measures of parental satisfaction. Results suggest that disagreement on treatment goals exists even within a narrow treatment population and
PRACTICAL APPLICATION OF MATCHING ALGORITHMS IN CASE OF A TASK ALLOCATION PROBLEM
Directory of Open Access Journals (Sweden)
Péter Szikora
2015-04-01
Full Text Available Conflicts between individuals or even groups of people are part of everyday social life. However, when handling conflict situations successfully, conflicts are actually solved. In order to achieve such resolution, parties should separate the conflict from the involved people and try to create a cooperative, nonzero-sum mind set concentrating on interests and not on positions - agreeing on principles like using a fair standard and a fair procedure. In present paper such impartial standards and procedures - namely matching theory algorithms - that concentrate on factual controversies are introduced.
The simplest problem in the collective dynamics of neural networks: is synchrony stable?
International Nuclear Information System (INIS)
Timme, Marc; Wolf, Fred
2008-01-01
For spiking neural networks we consider the stability problem of global synchrony, arguably the simplest non-trivial collective dynamics in such networks. We find that even this simplest dynamical problem—local stability of synchrony—is non-trivial to solve and requires novel methods for its solution. In particular, the discrete mode of pulsed communication together with the complicated connectivity of neural interaction networks requires a non-standard approach. The dynamics in the vicinity of the synchronous state is determined by a multitude of linear operators, in contrast to a single stability matrix in conventional linear stability theory. This unusual property qualitatively depends on network topology and may be neglected for globally coupled homogeneous networks. For generic networks, however, the number of operators increases exponentially with the size of the network. We present methods to treat this multi-operator problem exactly. First, based on the Gershgorin and Perron–Frobenius theorems, we derive bounds on the eigenvalues that provide important information about the synchronization process but are not sufficient to establish the asymptotic stability or instability of the synchronous state. We then present a complete analysis of asymptotic stability for topologically strongly connected networks using simple graph-theoretical considerations. For inhibitory interactions between dissipative (leaky) oscillatory neurons the synchronous state is stable, independent of the parameters and the network connectivity. These results indicate that pulse-like interactions play a profound role in network dynamical systems, and in particular in the dynamics of biological synchronization, unless the coupling is homogeneous and all-to-all. The concepts introduced here are expected to also facilitate the exact analysis of more complicated dynamical network states, for instance the irregular balanced activity in cortical neural networks
A gradient stable scheme for a phase field model for the moving contact line problem
Gao, Min
2012-02-01
In this paper, an efficient numerical scheme is designed for a phase field model for the moving contact line problem, which consists of a coupled system of the Cahn-Hilliard and Navier-Stokes equations with the generalized Navier boundary condition [1,2,4]. The nonlinear version of the scheme is semi-implicit in time and is based on a convex splitting of the Cahn-Hilliard free energy (including the boundary energy) together with a projection method for the Navier-Stokes equations. We show, under certain conditions, the scheme has the total energy decaying property and is unconditionally stable. The linearized scheme is easy to implement and introduces only mild CFL time constraint. Numerical tests are carried out to verify the accuracy and stability of the scheme. The behavior of the solution near the contact line is examined. It is verified that, when the interface intersects with the boundary, the consistent splitting scheme [21,22] for the Navier Stokes equations has the better accuracy for pressure. © 2011 Elsevier Inc.
Directory of Open Access Journals (Sweden)
Kevin M. Beaver
2010-01-01
Full Text Available A body of empirical research has revealed that prenatal exposure to tobacco smoke is related to a host of negative outcomes, including reduced cognitive abilities, later-life health problems, and childhood behavioral problems. While these findings are often interpreted as evidence of the causal role that prenatal exposure to tobacco smoke has on human phenotypes, emerging evidence has suggested that the association between prenatal exposure to tobacco smoke and behavioral phenotypes may be spurious. The current analysis of data from the Early Childhood Longitudinal Study, Birth Cohort (ECLS-B revealed that the association between prenatal exposure to cigarette smoke and externalizing behavioral problems was fully accounted for by confounding factors. The implications that these findings have for policy and research are discussed.
DEFF Research Database (Denmark)
Cordua, Knud Skou; Hansen, Thomas Mejer; Lange, Katrine
In order to move beyond simplified covariance based a priori models, which are typically used for inverse problems, more complex multiple-point-based a priori models have to be considered. By means of marginal probability distributions ‘learned’ from a training image, sequential simulation has...... proven to be an efficient way of obtaining multiple realizations that honor the same multiple-point statistics as the training image. The frequency matching method provides an alternative way of formulating multiple-point-based a priori models. In this strategy the pattern frequency distributions (i.......e. marginals) of the training image and a subsurface model are matched in order to obtain a solution with the same multiple-point statistics as the training image. Sequential Gibbs sampling is a simulation strategy that provides an efficient way of applying sequential simulation based algorithms as a priori...
Generalized relational matching by guinea baboons (Papio papio) in two-by-two-item analogy problems.
Fagot, Joël; Thompson, Roger K R
2011-10-01
Analogical reasoning is considered the hallmark of human reasoning, but some studies have demonstrated that language- and symbol-trained chimpanzees can also reason analogically. Despite the potential adaptive value of this ability, evidence from other studies strongly suggests that other nonhuman primates do not have this capacity for analogical reasoning. In our three experiments, 6 of 29 baboons acquired the ability to perform a relational matching-to-sample (RMTS) task in which pairs of shapes composed relational displays. Five of these 6 monkeys then transferred this ability to RMTS tasks using novel exemplars of identity (elements in a pair are the same) and nonidentity (elements in a pair are different) relations. This transfer occurred even on trials in which the incorrect pair shared an element with the sample pair with which it was being compared. The baboons retained this ability 12 months later. The findings from our study of symbol-naive monkeys indicate that although language and symbol training facilitate conceptual thinking in nonhuman primates, such training is not a prerequisite for analogical reasoning.
DEFF Research Database (Denmark)
Xie, Zhinan; Matzen, René; Cristini, Paul
2016-01-01
A time-domain Legendre spectral-element method is described for full-wave simulation of ocean acoustics models, i.e., coupled fluid-solid problems in unbounded or semi-infinite domains, taking into account shear wave propagation in the ocean bottom. The technique can accommodate range-dependent a......A time-domain Legendre spectral-element method is described for full-wave simulation of ocean acoustics models, i.e., coupled fluid-solid problems in unbounded or semi-infinite domains, taking into account shear wave propagation in the ocean bottom. The technique can accommodate range......-dependent and depth-dependent wave speed and density, as well as steep ocean floor topography. For truncation of the infinite domain, to efficiently absorb outgoing waves, a fluid-solid complex-frequency-shifted unsplit perfectly matched layer is introduced based on the complex coordinate stretching technique....... The complex stretching is rigorously taken into account in the derivation of the fluid-solid matching condition inside the absorbing layer, which has never been done before in the time domain. Two implementations are designed: a convolutional formulation and an auxiliary differential equation formulation...
2017-03-23
information for assignments, whether for certain experiences, skill identifiers, or manner of past performance could be easily incorporated at this point... helper functions to save and load python objects def save obj(obj, name ): with open(’data/’+ name + ’.pkl’, ’wb’) as f: pkl.dump(obj, f, pkl.HIGHEST...http://www.gurobi.com/products/ features-benefits. Accessed: 2016-10-29. 14. M. Fırat, C. Hurkens, and A. Laugier, “Stable multi- skill workforce
International Nuclear Information System (INIS)
Son, H.H.; Luong, P.T.; Loan, N.T.
1990-04-01
The problems of Remote Sensing (passive or active) are investigated on the base of main principle which consists in interpretation of radiometric electromagnetic measurements in such spectral interval where the radiation is sensitive to interested physical property of medium. Those problems such as an analysis of composition and structure of atmosphere using the records of scattered radiation, cloud identification, investigation of thermodynamic state and composition of system, reconstructing the atmospheric temperature profile on the base of data processing of infrared radiation emitted by system Earth-Atmosphere... belong to class of inverse problems of mathematical physics which are often incorrect. Int his paper a new class of regularized solution corresponding to general formulated RATP-problem is considered. (author). 14 refs, 3 figs, 3 tabs
Applications of stable isotopes of 2H, 13C and 15N to clinical problems
International Nuclear Information System (INIS)
Klein, P.D.; Szczepanik, P.A.; Hachey, D.L.
1974-01-01
The function of the Argonne Program is to provide synthetic, analytical instrumental capability in a core facility for the clinical investigator who needs to use 2 H, 13 C, or 15 N labelled compounds for metabolic or clinical research on pregnant women, newborn infants, young children, or for mass screening. To carry out such application development, there were six stages which were recurrent steps in every application. Five fundamental strategies should be adopted to establish the use of stable isotopes in clinical work. The instrument required for measurements was a combined gas chromatograph-mass spectrometer, and its use was schematically illustrated. Some of the successful experiences with compounds labelled by stable isotopes, such as deuterium labelled chenodeoxycholic acid, and respective 13 C and 15 N-labelled glycine were described. Deutrium labelled bile acid enabled easy and safe determination of the size of the bile acid pool and the replacement rate, providing clearer diagnoses for cholestatic liver disease and gallstones. 13 C and 15 N labelled compounds were used in clinical studies, of children with genetic disorders of amino acid metabolism, i.e., non ketotic hyperflycinemia, B 12 -responsive methyl malonic acidemia, and Lesch-Nyhan syndrome. 15 N-labelled glycine was also studied in a child with Lesch-Nyhan syndrome. (Mukohata, S.)
International Nuclear Information System (INIS)
Abgrall, Remi; Mezine, Mohamed
2003-01-01
The aim of this paper is to construct upwind residual distribution schemes for the time accurate solution of hyperbolic conservation laws. To do so, we evaluate a space-time fluctuation based on a space-time approximation of the solution and develop new residual distribution schemes which are extensions of classical steady upwind residual distribution schemes. This method has been applied to the solution of scalar advection equation and to the solution of the compressible Euler equations both in two space dimensions. The first version of the scheme is shown to be, at least in its first order version, unconditionally energy stable and possibly conditionally monotonicity preserving. Using an idea of Csik et al. [Space-time residual distribution schemes for hyperbolic conservation laws, 15th AIAA Computational Fluid Dynamics Conference, Anahein, CA, USA, AIAA 2001-2617, June 2001], we modify the formulation to end up with a scheme that is unconditionally energy stable and unconditionally monotonicity preserving. Several numerical examples are shown to demonstrate the stability and accuracy of the method
Problems and prospects in future applications of stable isotopes in the life sciences and medicine
International Nuclear Information System (INIS)
Matwiyoff, N.A.; Unkefer, C.J.; Walker, T.E.
1982-01-01
In the last decade, there has been a resurgence of interest in the use of stable isotopes of carbon, oxygen, and nitrogen in the life sciences and medicine fueled by the increased availability of the isotopes and isotopically labeled compounds and of instruments for their detection. Accelerated development of 13 C, 15 N, and 17 18 O can be expected in the future for studies of drug bioavailability, nutrition and body protein economy, viability of organs for transplant, and for non-invasive tests of metabolic diseases and dysfunctions. These accelerated developments depend on continued improvements in nmr and ms instrumentation and in methods for the synthesis of isotopically labeled compounds. The main part of this paper explores the possibilities of biosynthesis for the selective enrichment of natural products, especially amino acids, with 13 C
Manipulation and gender neutrality in stable marriage procedures
Pini, Maria; Rossi, Francesca; Venable, Brent; Walsh, Toby
2009-01-01
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a wide variety of practical applications ranging from matching resident doctors to hospitals to matching students to schools. A well-known algorithm to solve this problem is the Gale-Shapley algorithm, which runs in polynomial time. It has been proven that stable marriage procedures can always be manipulated. Whilst ...
Present state and problems of the measures for securing stable supply of uranium resources
International Nuclear Information System (INIS)
Yoneda, Fumishige
1982-01-01
The long-term stable supply of uranium resources must be secured in order to accelerate the development and utilization of nuclear power in Japan. All uranium required in Japan is imported from foreign countries, and depends on small number of suppliers. On the use of uranium, various restrictions have been imposed by bilateral agreements from the viewpoint of nuclear non-proliferation policy. At present, the demand-supply relation in uranium market is not stringent, but in the latter half of 1980s, it is feared that it will be stringent. The prospect of the demand and supply of uranium resources, the state of securing uranium resources, the present policy on uranium resources, the necessity of establishing the new policy, and the active promotion of uranium resource measures are described. The measures to be taken are the promotion of exploration and development of mines, the participation in the management of such foreign projects, the promotion of diversifying the supply sources, the establishment of the structure to accept uranium resources, the promotion of the storage of uranium, and the rearrangement of general coordination and promotion functions for uranium resource procurement. (Kako, I.)
Bobak, Anna Katarzyna; Dowsett, Andrew James; Bate, Sarah
2016-01-01
Photographic identity documents (IDs) are commonly used despite clear evidence that unfamiliar face matching is a difficult and error-prone task. The current study set out to examine the performance of seven individuals with extraordinary face recognition memory, so called "super recognisers" (SRs), on two face matching tasks resembling border control identity checks. In Experiment 1, the SRs as a group outperformed control participants on the "Glasgow Face Matching Test", and some case-by-case comparisons also reached significance. In Experiment 2, a perceptually difficult face matching task was used: the "Models Face Matching Test". Once again, SRs outperformed controls both on group and mostly in case-by-case analyses. These findings suggest that SRs are considerably better at face matching than typical perceivers, and would make proficient personnel for border control agencies.
Directory of Open Access Journals (Sweden)
Anna Katarzyna Bobak
Full Text Available Photographic identity documents (IDs are commonly used despite clear evidence that unfamiliar face matching is a difficult and error-prone task. The current study set out to examine the performance of seven individuals with extraordinary face recognition memory, so called "super recognisers" (SRs, on two face matching tasks resembling border control identity checks. In Experiment 1, the SRs as a group outperformed control participants on the "Glasgow Face Matching Test", and some case-by-case comparisons also reached significance. In Experiment 2, a perceptually difficult face matching task was used: the "Models Face Matching Test". Once again, SRs outperformed controls both on group and mostly in case-by-case analyses. These findings suggest that SRs are considerably better at face matching than typical perceivers, and would make proficient personnel for border control agencies.
International Nuclear Information System (INIS)
Inoue, Tomio
2013-01-01
The shortage of supply of 99 Mo caused by trouble of old nuclear reactors in Canada and Europe caused international problem in the field of nuclear medicine, which has not been completely resolved yet. Because all of 99 Mo/ 99m Tc generator in Japan has been imported, Japan Atomic Energy Commission (JAEC) suggested the necessity of establishment of stable supply chain of 99 Mo ( 99 Mo/ 99m Tc generator). According this suggestion, an ad hoc committee appointed to consider the stable supply chain, which consisted of persons concerned with industry, academic society, Japan Isotope Association, Ministry of Education, Culture, Sports, Science, and Technology-Japan (MEXT), Ministry of Health, Labour and Welfare (MHLW), Japan Atomic Energy Agency (JAEA), National Institute of Radiological Science (NIRS) et al., evaluated and compared several ways of production and purification of 99 Mo from the view point of technological maturity, regulation compatibility, economic suitability, and stability for supply. In this review, the summary of the committee report is introduced. For short term strategy, we need to keep the variable import routes for 99 Mo. As a mid-term goal, we need to establish the supply chain inside Japan as a conclusion of the committee report but it seems to be not easy for utility of nuclear reactor after nuclear accident of Fukushima Daiichi Nuclear Power Plant. The development of the method for 99 Mo/ 99m Tc production using accelerator is also expected for the establishment of stable supply chain. (author)
International Nuclear Information System (INIS)
Korenaga, Takashi
2013-01-01
The multi-stable isotopic analysis method has employed to solve food authenticity problems. Stable isotope ratio of the light elements such as H, C, N, and O in food samples (e.g., rice, beef, and eel) were precisely analyzed by elemental analysis/isotope ratio mass spectrometry. Those samples were mainly taken from four different countries; Japan, United States of America, Australia, and China as comparison. All the rice samples were grown in the presence of either natural and or artificial fertilizer. The beef samples were taken from three different countries; Japan, United States of America, and Australia. Imported beef samples were also presented from the Ministry of Agriculture, Forestry and Fisheries, Japan, and compared with a correlation equation. The eel samples were taken from the three different countries and areas; Japan, China, and Taiwan. δX values showing some differences, all the Japanese food samples were clearly distinctive from the United States of America, Australia, China, and Taiwan samples. The results may be explained by the regional differences in isotope signatures of the climate, utilized nutrition, and/or quality of irrigation water among the farming countries. The statistical distinction could be one of the useful metrics to extract the food samples (rice, meat, fish, etc.) grown in Japan from those grown in the other countries. The dynamics analysis studies on stable isotopic behavior (i.e., Isotopomics) in human metabolism may be looking forward to establish a new science in near future. (author)
Bobak, Anna K.; Dowsett, A.; Bate, Sarah
2016-01-01
Photographic identity documents (IDs) are commonly used despite clear evidence that unfamiliar face matching is a difficult and error-prone task. The current study set out to examine the performance of seven individuals with extraordinary face recognition memory, so called ?super recognisers? (SRs), on two face matching tasks resembling border control identity checks. In Experiment 1, the SRs as a group outperformed control participants on the ?Glasgow Face Matching Test?, and some case-by-ca...
DEFF Research Database (Denmark)
Failla, Virgilio; Melillo, Francesca; Reichstein, Toke
2014-01-01
Is entrepreneurship a more stable career choice for high employment turnover individuals? We find that a transition to entrepreneurship induces a shift towards stayer behavior and identify job matching, job satisfaction and lock-in effects as main drivers. These findings have major implications...
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.
Barrett, David E.; Katsiyannis, Antonis; Zhang, Dalun; Zhang, Dake
2014-01-01
The authors examined the role of early adverse experiences, mental health problems, and disabilities in the prediction of juvenile delinquency and recidivism, using a matched-control group design. The delinquent group comprised 99,602 youth, born between 1981 and 1988, whose cases had been processed by the South Carolina Department of Juvenile…
Monteiro, Angelo Barbosa; Faria, Lucas Del Bianco
2018-06-06
For decades, food web theory has proposed phenomenological models for the underlying structure of ecological networks. Generally, these models rely on latent niche variables that match the feeding behaviour of consumers with their resource traits. In this paper, we used a comprehensive database to evaluate different hypotheses on the best dependency structure of trait-matching patterns between consumers and resource traits. We found that consumer feeding behaviours had complex interactions with resource traits; however, few dimensions (i.e. latent variables) could reproduce the trait-matching patterns. We discuss our findings in the light of three food web models designed to reproduce the multidimensionality of food web data; additionally, we discuss how using species traits clarify food webs beyond species pairwise interactions and enable studies to infer ecological generality at larger scales, despite potential taxonomic differences, variations in ecological conditions and differences in species abundance between communities. © 2018 John Wiley & Sons Ltd/CNRS.
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.
Matchings with Externalities and Attitudes
DEFF Research Database (Denmark)
Branzei, Simina; Michalak, Tomasz; Rahwan, Talal
2013-01-01
Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real-life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas ...... where agents take different attitudes when reasoning about the actions of others. In particular, we study optimistic, neutral and pessimistic attitudes and provide both computational hardness results and polynomial-time algorithms for computing stable outcomes....
A blind matching algorithm for cognitive radio networks
Hamza, Doha R.
2016-08-15
We consider a cognitive radio network where secondary users (SUs) are allowed access time to the spectrum belonging to the primary users (PUs) provided that they relay primary messages. PUs and SUs negotiate over allocations of the secondary power that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power allocations. We stipulate a limited information exchange in the network so that agents only calculate their own utilities but no information is available about the utilities of any other users in the network. We establish convergence to epsilon pairwise stable matchings in finite time. Finally we show that our algorithm exhibits a limited degradation in PU utility when compared with the Pareto optimal results attained using perfect information assumptions. © 2016 IEEE.
Best matching theory & applications
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...
Energy Technology Data Exchange (ETDEWEB)
Hong, Youngjoon, E-mail: hongy@uic.edu; Nicholls, David P., E-mail: davidn@uic.edu
2017-02-01
The accurate numerical simulation of linear waves interacting with periodic layered media is a crucial capability in engineering applications. In this contribution we study the stable and high-order accurate numerical simulation of the interaction of linear, time-harmonic waves with a periodic, triply layered medium with irregular interfaces. In contrast with volumetric approaches, High-Order Perturbation of Surfaces (HOPS) algorithms are inexpensive interfacial methods which rapidly and recursively estimate scattering returns by perturbation of the interface shape. In comparison with Boundary Integral/Element Methods, the stable HOPS algorithm we describe here does not require specialized quadrature rules, periodization strategies, or the solution of dense non-symmetric positive definite linear systems. In addition, the algorithm is provably stable as opposed to other classical HOPS approaches. With numerical experiments we show the remarkable efficiency, fidelity, and accuracy one can achieve with an implementation of this algorithm.
Optimal Packed String Matching
DEFF Research Database (Denmark)
Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany
2011-01-01
In the packed string matching problem, each machine word accommodates – characters, thus an n-character text occupies n/– memory words. We extend the Crochemore-Perrin constantspace O(n)-time string matching algorithm to run in optimal O(n/–) time and even in real-time, achieving a factor – speed...
DEFF Research Database (Denmark)
Karamehmedovic, Mirza; Kirkeby, Adrian; Knudsen, Kim
2018-01-01
setting: From measurements made at a finite set of frequencies we uniquely determine and reconstruct sources in a subspace spanned by finitely many Fourier-Bessel functions. Further, we obtain a constructive criterion for identifying a minimal set of measurement frequencies sufficient for reconstruction......, and under an additional, mild assumption, the reconstruction method is shown to be stable." Our analysis is based on a singular value decomposition of the source-to-measurement forward operators and the distribution of positive zeros of the Bessel functions of the first kind. The reconstruction method...
Niemi, Antti H.; Collier, Nathan; Calo, Victor M.
2013-01-01
We investigate the application of the discontinuous Petrov-Galerkin (DPG) finite element framework to stationary convection-diffusion problems. In particular, we demonstrate how the quasi-optimal test space norm improves the robustness of the DPG method with respect to vanishing diffusion. We numerically compare coarse-mesh accuracy of the approximation when using the quasi-optimal norm, the standard norm, and the weighted norm. Our results show that the quasi-optimal norm leads to more accurate results on three benchmark problems in two spatial dimensions. We address the problems associated to the resolution of the optimal test functions with respect to the quasi-optimal norm by studying their convergence numerically. In order to facilitate understanding of the method, we also include a detailed explanation of the methodology from the algorithmic point of view. © 2013 Elsevier Ltd. All rights reserved.
Niemi, Antti H.
2013-12-01
We investigate the application of the discontinuous Petrov-Galerkin (DPG) finite element framework to stationary convection-diffusion problems. In particular, we demonstrate how the quasi-optimal test space norm improves the robustness of the DPG method with respect to vanishing diffusion. We numerically compare coarse-mesh accuracy of the approximation when using the quasi-optimal norm, the standard norm, and the weighted norm. Our results show that the quasi-optimal norm leads to more accurate results on three benchmark problems in two spatial dimensions. We address the problems associated to the resolution of the optimal test functions with respect to the quasi-optimal norm by studying their convergence numerically. In order to facilitate understanding of the method, we also include a detailed explanation of the methodology from the algorithmic point of view. © 2013 Elsevier Ltd. All rights reserved.
Williams, Judith C.; Alwis, W. A. M.; Rotgans, Jerome I.
2011-01-01
The purpose of this study was to investigate the stability of three distinct tutor behaviors (1) use of subject-matter expertise, (2) social congruence and (3) cognitive congruence, in a problem-based learning (PBL) environment. The data comprised the input from 16,047 different students to a survey of 762 tutors administered in three consecutive…
Wang, Wenrui; Wu, Yaohua; Wu, Yingying
2016-05-01
E-commerce, as an emerging marketing mode, has attracted more and more attention and gradually changed the way of our life. However, the existing layout of distribution centers can't fulfill the storage and picking demands of e-commerce sufficiently. In this paper, a modified miniload automated storage/retrieval system is designed to fit these new characteristics of e-commerce in logistics. Meanwhile, a matching problem, concerning with the improvement of picking efficiency in new system, is studied in this paper. The problem is how to reduce the travelling distance of totes between aisles and picking stations. A multi-stage heuristic algorithm is proposed based on statement and model of this problem. The main idea of this algorithm is, with some heuristic strategies based on similarity coefficients, minimizing the transportations of items which can not arrive in the destination picking stations just through direct conveyors. The experimental results based on the cases generated by computers show that the average reduced rate of indirect transport times can reach 14.36% with the application of multi-stage heuristic algorithm. For the cases from a real e-commerce distribution center, the order processing time can be reduced from 11.20 h to 10.06 h with the help of the modified system and the proposed algorithm. In summary, this research proposed a modified system and a multi-stage heuristic algorithm that can reduce the travelling distance of totes effectively and improve the whole performance of e-commerce distribution center.
Faenza, Y.; Oriolo, G.; Stauffer, G.
2011-01-01
We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(n^3)-time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free graphs, which is also intioduced in the present paper. Despite being weaker than the well-known structure result for claw-free graphs given by Chudnovsky and Seymour, our decomposition theorem is, on the other hand, algorithmic, i.e. it is ...
Directory of Open Access Journals (Sweden)
Dauda GuliburYAKUBU
2012-12-01
Full Text Available Accurate solutions to initial value systems of ordinary differential equations may be approximated efficiently by Runge-Kutta methods or linear multistep methods. Each of these has limitations of one sort or another. In this paper we consider, as a middle ground, the derivation of continuous general linear methods for solution of stiff systems of initial value problems in ordinary differential equations. These methods are designed to combine the advantages of both Runge-Kutta and linear multistep methods. Particularly, methods possessing the property of A-stability are identified as promising methods within this large class of general linear methods. We show that the continuous general linear methods are self-starting and have more ability to solve the stiff systems of ordinary differential equations, than the discrete ones. The initial value systems of ordinary differential equations are solved, for instance, without looking for any other method to start the integration process. This desirable feature of the proposed approach leads to obtaining very high accuracy of the solution of the given problem. Illustrative examples are given to demonstrate the novelty and reliability of the methods.
Fumagalli, Ivan; Parolini, Nicola; Verani, Marco
2018-02-01
We analyze a free-surface problem described by time-dependent Navier-Stokes equations. Surface tension, capillary effects and wall friction are taken into account in the evolution of the system, influencing the motion of the contact line - where the free surface hits the wall - and of the dynamics of the contact angle. The differential equations governing the phenomenon are first derived from the variational principle of minimum reduced dissipation, and then discretized by means of the ALE approach. The numerical properties of the resulting scheme are investigated, drawing a parallel with the physical properties holding at the continuous level. Some instability issues are addressed in detail, in the case of an explicit treatment of the geometry, and novel additional terms are introduced in the discrete formulation in order to damp the instabilities. Numerical tests assess the suitability of the approach, the influence of the parameters, and the effectiveness of the new stabilizing terms.
Zhuang, Xiao Yu; Wong, Daniel Fu Keung; Ng, Ting Kin; Jackson, Alun C; Dowling, Nicki A; Lo, Herman Hay-Ming
2018-01-22
Very few clinical cognitive-behavioural intervention (CBI) studies were conducted with the Chinese gamblers. There is a lack of attention paid to intervening in negative emotions that may also adversely affect PGs in current CBI treatment modality. This study is the first attempt to systematically and rigorously evaluate both the short-term and longer-term effects of a culturally-attuned CBI group treatment with an emotion regulation component for a group of Chinese PGs in Hong Kong. A quasi-experimental matched-pairs design was adopted and 84 participants were allocated to the CBI (N = 42) and social activity groups (N = 42). There are 3 assessment points in the study: baseline at recruitment, post-intervention at the end of CBI and social activity groups, and at 6-month follow-up. When compared to the social activity group and after controlling for general group effects, there were significantly greater decreases in the severity of gambling, gambling-related cognitions (i.e. interpretive bias), negative psychological states (i.e. stress) and money spent on gambling in the past month in the CBI group between pre- and post-intervention and between pre-intervention and 6-month follow-up. Results also indicated that both reduction in gambling-related cognitions and negative psychological states could mediate the treatment effect of the CBI on the reduction of problematic gambling behaviours. The culturally attuned integrated CBI group treatment with an emotional regulation component appeared to be effective in treating Chinese problem gamblers in Hong Kong and the effects could be sustained at 6-month follow-up.
... to know FAQ Living donation What is living donation? Organs Types Being a living donor First steps Being ... brochures What Every Patient Needs to Know Living Donation Multiple Listing Visit UNOS Store Learn more How organs are matched How to become a living donor ...
Matching theory for wireless networks
Han, Zhu; Saad, Walid
2017-01-01
This book provides the fundamental knowledge of the classical matching theory problems. It builds up the bridge between the matching theory and the 5G wireless communication resource allocation problems. The potentials and challenges of implementing the semi-distributive matching theory framework into the wireless resource allocations are analyzed both theoretically and through implementation examples. Academics, researchers, engineers, and so on, who are interested in efficient distributive wireless resource allocation solutions, will find this book to be an exceptional resource. .
Jeuring, J.T.
1995-01-01
The pattern matching problem can be informally specified as follows: given a pattern and a text, find all occurrences of the pattern in the text. The pattern and the text may both be lists, or they may both be trees, or they may both be multi-dimensional arrays, etc. This paper describes a general
Conditions for Model Matching of Switched Asynchronous Sequential Machines with Output Feedback
Jung–Min Yang
2016-01-01
Solvability of the model matching problem for input/output switched asynchronous sequential machines is discussed in this paper. The control objective is to determine the existence condition and design algorithm for a corrective controller that can match the stable-state behavior of the closed-loop system to that of a reference model. Switching operations and correction procedures are incorporated using output feedback so that the controlled switched machine can show the ...
Matching Theory for Channel Allocation in Cognitive Radio Networks
Directory of Open Access Journals (Sweden)
L. Cao
2016-12-01
Full Text Available For a cognitive radio network (CRN in which a set of secondary users (SUs competes for a limited number of channels (spectrum resources belonging to primary users (PUs, the channel allocation is a challenge and dominates the throughput and congestion of the network. In this paper, the channel allocation problem is first formulated as the 0-1 integer programming optimization, with considering the overall utility both of primary system and secondary system. Inspired by matching theory, a many-to-one matching game is used to remodel the channel allocation problem, and the corresponding PU proposing deferred acceptance (PPDA algorithm is also proposed to yield a stable matching. We compare the performance and computation complexity between these two solutions. Numerical results demonstrate the efficiency and obtain the communication overhead of the proposed scheme.
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.
Approaches for Stereo Matching
Directory of Open Access Journals (Sweden)
Takouhi Ozanian
1995-04-01
Full Text Available This review focuses on the last decade's development of the computational stereopsis for recovering three-dimensional information. The main components of the stereo analysis are exposed: image acquisition and camera modeling, feature selection, feature matching and disparity interpretation. A brief survey is given of the well known feature selection approaches and the estimation parameters for this selection are mentioned. The difficulties in identifying correspondent locations in the two images are explained. Methods as to how effectively to constrain the search for correct solution of the correspondence problem are discussed, as are strategies for the whole matching process. Reasons for the occurrence of matching errors are considered. Some recently proposed approaches, employing new ideas in the modeling of stereo matching in terms of energy minimization, are described. Acknowledging the importance of computation time for real-time applications, special attention is paid to parallelism as a way to achieve the required level of performance. The development of trinocular stereo analysis as an alternative to the conventional binocular one, is described. Finally a classification based on the test images for verification of the stereo matching algorithms, is supplied.
Statistical methods for history matching
DEFF Research Database (Denmark)
Johansen, Kent
Denne afhandling beskriver statistiske metoder til history matching af olieproduktion. History matching er en vigtig del af driften af et oliefelt og er ofte forbundet med problemer relateret til kompleksiteten af reservoiret og selve størrelsen af reservoirsimuleringsmodellen. Begrebet history m...
International Nuclear Information System (INIS)
Evans, D.K.
1986-01-01
Seventy-five percent of the world's stable isotope supply comes from one producer, Oak Ridge Nuclear Laboratory (ORNL) in the US. Canadian concern is that foreign needs will be met only after domestic needs, thus creating a shortage of stable isotopes in Canada. This article describes the present situation in Canada (availability and cost) of stable isotopes, the isotope enrichment techniques, and related research programs at Chalk River Nuclear Laboratories (CRNL)
Adaptive Discrete Hypergraph Matching.
Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao
2018-02-01
This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.
Matching games with partial information
Laureti, Paolo; Zhang, Yi-Cheng
2003-06-01
We analyze different ways of pairing agents in a bipartite matching problem, with regard to its scaling properties and to the distribution of individual “satisfactions”. Then we explore the role of partial information and bounded rationality in a generalized Marriage Problem, comparing the benefits obtained by self-searching and by a matchmaker. Finally we propose a modified matching game intended to mimic the way consumers’ information makes firms to enhance the quality of their products in a competitive market.
Using crosswell data to enhance history matching
Ravanelli, Fabio M.; Hoteit, Ibrahim
2014-01-01
of the reality. This problem is mitigated by conditioning the model with data through data assimilation, a process known in the oil industry as history matching. Several recent advances are being used to improve history matching reliability, notably the use
Target matching based on multi-view tracking
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.
Matching Supernovae to Galaxies
Kohler, Susanna
2016-12-01
One of the major challenges for modern supernova surveys is identifying the galaxy that hosted each explosion. Is there an accurate and efficient way to do this that avoids investing significant human resources?Why Identify Hosts?One problem in host galaxy identification. Here, the supernova lies between two galaxies but though the centroid of the galaxy on the right is closer in angular separation, this may be a distant background galaxy that is not actually near the supernova. [Gupta et al. 2016]Supernovae are a critical tool for making cosmological predictions that help us to understand our universe. But supernova cosmology relies on accurately identifying the properties of the supernovae including their redshifts. Since spectroscopic followup of supernova detections often isnt possible, we rely on observations of the supernova host galaxies to obtain redshifts.But how do we identify which galaxy hosted a supernova? This seems like a simple problem, but there are many complicating factors a seemingly nearby galaxy could be a distant background galaxy, for instance, or a supernovas host could be too faint to spot.The authors algorithm takes into account confusion, a measure of how likely the supernova is to be mismatched. In these illustrations of low (left) and high (right) confusion, the supernova is represented by a blue star, and the green circles represent possible host galaxies. [Gupta et al. 2016]Turning to AutomationBefore the era of large supernovae surveys, searching for host galaxies was done primarily by visual inspection. But current projects like the Dark Energy Surveys Supernova Program is finding supernovae by the thousands, and the upcoming Large Synoptic Survey Telescope will likely discover hundreds of thousands. Visual inspection will not be possible in the face of this volume of data so an accurate and efficient automated method is clearly needed!To this end, a team of scientists led by Ravi Gupta (Argonne National Laboratory) has recently
2013-08-01
both MFE and GFV, are often similar in size. As a gross measure of the effect of geometric projection and of the use of quadrature, we also report the...interest MFE ∑(e,ψ) or GFV ∑(e,ψ). Tables 1 and 2 show this using coarse and fine forward solutions. Table 1. The forward problem with solution (4.1) is run...adjoint data components ψu and ψp are constant everywhere and ψξ = 0. adj. grid MFE ∑(e,ψ) ∑MFEi ratio GFV ∑(e,ψ) ∑GFV i ratio 20x20 : 32x32 1.96E−3
Matching by Monotonic Tone Mapping.
Kovacs, Gyorgy
2018-06-01
In this paper, a novel dissimilarity measure called Matching by Monotonic Tone Mapping (MMTM) is proposed. The MMTM technique allows matching under non-linear monotonic tone mappings and can be computed efficiently when the tone mappings are approximated by piecewise constant or piecewise linear functions. The proposed method is evaluated in various template matching scenarios involving simulated and real images, and compared to other measures developed to be invariant to monotonic intensity transformations. The results show that the MMTM technique is a highly competitive alternative of conventional measures in problems where possible tone mappings are close to monotonic.
One-dimensional stable distributions
Zolotarev, V M
1986-01-01
This is the first book specifically devoted to a systematic exposition of the essential facts known about the properties of stable distributions. In addition to its main focus on the analytic properties of stable laws, the book also includes examples of the occurrence of stable distributions in applied problems and a chapter on the problem of statistical estimation of the parameters determining stable laws. A valuable feature of the book is the author's use of several formally different ways of expressing characteristic functions corresponding to these laws.
International Nuclear Information System (INIS)
Samios, N.P.
1993-01-01
I have been asked to review the subject of stable particles, essentially the particles that eventually comprised the meson and baryon octets. with a few more additions -- with an emphasis on the contributions made by experiments utilizing the bubble chamber technique. In this activity, much work had been done by the photographic emulsion technique and cloud chambers-exposed to cosmic rays as well as accelerator based beams. In fact, many if not most of the stable particles were found by these latter two techniques, however, the forte of the bubble chamber (coupled with the newer and more powerful accelerators) was to verify, and reinforce with large statistics, the existence of these states, to find some of the more difficult ones, mainly neutrals and further to elucidate their properties, i.e., spin, parity, lifetimes, decay parameters, etc
MARG1D: One dimensional outer region matching data code
International Nuclear Information System (INIS)
Tokuda, Shinji; Watanabe, Tomoko.
1995-08-01
A code MARG1D has been developed which computes outer region matching data of the one dimensional Newcomb equation. Matching data play an important role in the resistive (and non ideal) Magneto-hydrodynamic (MHD) stability analysis in a tokamak plasma. The MARG1D code computes matching data by using the boundary value method or by the eigenvalue method. Variational principles are derived for the problems to be solved and a finite element method is applied. Except for the case of marginal stability, the eigenvalue method is equivalent to the boundary value method. However, the eigenvalue method has the several advantages: it is a new method of ideal MHD stability analysis for which the marginally stable state can be identified, and it guarantees numerical stability in computing matching data close to marginal stability. We perform detailed numerical experiments for a model equation with analytical solutions and for the Newcomb equation in the m=1 mode theory. Numerical experiments show that MARG1D code gives the matching data with numerical stability and high accuracy. (author)
Fast and compact regular expression matching
DEFF Research Database (Denmark)
Bille, Philip; Farach-Colton, Martin
2008-01-01
We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how...... to improve the space and/or remove a dependency on the alphabet size for each problem using either an improved tabulation technique of an existing algorithm or by combining known algorithms in a new way....
Ashyralyyeva, Maral; Ashyraliyev, Maksat
2016-08-01
In the present paper, a second order of accuracy difference scheme for the approximate solution of a source identification problem for hyperbolic-parabolic equations is constructed. Theorem on stability estimates for the solution of this difference scheme and their first and second order difference derivatives is presented. In applications, this abstract result permits us to obtain the stability estimates for the solutions of difference schemes for approximate solutions of two source identification problems for hyperbolic-parabolic equations.
Energy Technology Data Exchange (ETDEWEB)
Klein, P D; Szczepanik, P A; Hachey, D L [Argonne National Lab., Evanston, Ill. (USA)
1974-08-01
The function of the Argonne Program is to provide synthetic, analytical instrumental capability in a core facility for the clinical investigator who needs to use /sup 2/H, /sup 13/C, or /sup 15/N labelled compounds for metabolic or clinical research on pregnant women, newborn infants, young children, or for mass screening. To carry out such application development, there were six stages which were recurrent steps in every application. Five fundamental strategies should be adopted to establish the use of stable isotopes in clinical work. The instrument required for measurements was a combined gas chromatograph-mass spectrometer, and its use was schematically illustrated. Some of the successful experiences with compounds labelled by stable isotopes, such as deuterium labelled chenodeoxycholic acid, and respective /sup 13/C and /sup 15/N-labelled glycine were described. Deutrium labelled bile acid enabled easy and safe determination of the size of the bile acid pool and the replacement rate, providing clearer diagnoses for cholestatic liver disease and gallstones. /sup 13/C and /sup 15/N labelled compounds were used in clinical studies, of children with genetic disorders of amino acid metabolism, i.e., non ketotic hyperflycinemia, B/sub 12/-responsive methyl malonic acidemia, and Lesch-Nyhan syndrome. /sup 15/N-labelled glycine was also studied in a child with Lesch-Nyhan syndrome.
International Nuclear Information System (INIS)
Brazier, J.L.; Guinamant, J.L.
1995-01-01
According to the progress which has been realised in the technology of separating and measuring isotopes, the stable isotopes are used as preferable 'labelling elements' for big number of applications. The isotopic composition of natural products shows significant variations as a result of different reasons like the climate, the seasons, or their geographic origins. So, it was proved that the same product has a different isotopic composition of alimentary and agriculture products. It is also important in detecting the pharmacological and medical chemicals. This review article deals with the technology, like chromatography and spectrophotometry, adapted to this aim, and some important applications. 17 refs. 6 figs
Energy Technology Data Exchange (ETDEWEB)
Quigg, Chris [Fermilab
2018-04-13
For very heavy quarks, relations derived from heavy-quark symmetry imply novel narrow doubly heavy tetraquark states containing two heavy quarks and two light antiquarks. We predict that double-beauty states will be stable against strong decays, whereas the double-charm states and mixed beauty+charm states will dissociate into pairs of heavy-light mesons. Observing a new double-beauty state through its weak decays would establish the existence of tetraquarks and illuminate the role of heavy color-antitriplet diquarks as hadron constituents.
2015-01-01
Stable beams: two simple words that carry so much meaning at CERN. When LHC page one switched from "squeeze" to "stable beams" at 10.40 a.m. on Wednesday, 3 June, it triggered scenes of jubilation in control rooms around the CERN sites, as the LHC experiments started to record physics data for the first time in 27 months. This is what CERN is here for, and it’s great to be back in business after such a long period of preparation for the next stage in the LHC adventure. I’ve said it before, but I’ll say it again. This was a great achievement, and testimony to the hard and dedicated work of so many people in the global CERN community. I could start to list the teams that have contributed, but that would be a mistake. Instead, I’d simply like to say that an achievement as impressive as running the LHC – a machine of superlatives in every respect – takes the combined effort and enthusiasm of everyone ...
Real-time rideshare matching problem.
2010-01-01
According to the Commuting in America report, more than 88% of American workers commute to work in private vehicles, which accounts for a daily sum of 166 million miles. The report also indicates that more than 76% of the commuters drive alone, resul...
Matching Games with Additive Externalities
DEFF Research Database (Denmark)
Branzei, Simina; Michalak, Tomasz; Rahwan, Talal
2012-01-01
Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas ...
S.J. Roza (Sabine); M.B. Hofstra (Marijke); J. van der Ende (Jan); F.C. Verhulst (Frank)
2003-01-01
textabstractOBJECTIVE: The goal of this study was to predict the onset of mood and anxiety disorders from parent-reported emotional and behavioral problems in childhood across a 14-year period from childhood into young adulthood. METHOD: In 1983, parent reports of behavioral and
Reducing the likelihood of long tennis matches.
Barnett, Tristan; Alan, Brown; Pollard, Graham
2006-01-01
Long matches can cause problems for tournaments. For example, the starting times of subsequent matches can be substantially delayed causing inconvenience to players, spectators, officials and television scheduling. They can even be seen as unfair in the tournament setting when the winner of a very long match, who may have negative aftereffects from such a match, plays the winner of an average or shorter length match in the next round. Long matches can also lead to injuries to the participating players. One factor that can lead to long matches is the use of the advantage set as the fifth set, as in the Australian Open, the French Open and Wimbledon. Another factor is long rallies and a greater than average number of points per game. This tends to occur more frequently on the slower surfaces such as at the French Open. The mathematical method of generating functions is used to show that the likelihood of long matches can be substantially reduced by using the tiebreak game in the fifth set, or more effectively by using a new type of game, the 50-40 game, throughout the match. Key PointsThe cumulant generating function has nice properties for calculating the parameters of distributions in a tennis matchA final tiebreaker set reduces the length of matches as currently being used in the US OpenA new 50-40 game reduces the length of matches whilst maintaining comparable probabilities for the better player to win the match.
Efficient and stable perfectly matched layer for CEM
Duru, Kenneth; Kreiss, Gunilla
2014-01-01
only one (scalar) auxiliary variable in two space dimensions and six (scalar) auxiliary variables in three space dimensions. It is therefore cheap and straightforward to implement. We use Fourier and energy methods to prove the stability of the PML. We
... for Kids ▸ Stinging Insect Matching Game Share | Stinging Insect Matching Game Stinging insects can ruin summer fun for those who are ... the difference between the different kinds of stinging insects in order to keep your summer safe and ...
On Tree-Constrained Matchings and Generalizations
S. Canzar (Stefan); K. Elbassioni; G.W. Klau (Gunnar); J. Mestre
2011-01-01
htmlabstractWe consider the following \\textsc{Tree-Constrained Bipartite Matching} problem: Given two rooted trees $T_1=(V_1,E_1)$, $T_2=(V_2,E_2)$ and a weight function $w: V_1\\times V_2 \\mapsto \\mathbb{R}_+$, find a maximum weight matching $\\mathcal{M}$ between nodes of the two trees, such that
Dynamic Matchings in Convex Bipartite Graphs
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt
2007-01-01
We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...
Ontology Matching Across Domains
2010-05-01
matching include GMO [1], Anchor-Prompt [2], and Similarity Flooding [3]. GMO is an iterative structural matcher, which uses RDF bipartite graphs to...AFRL under contract# FA8750-09-C-0058. References [1] Hu, W., Jian, N., Qu, Y., Wang, Y., “ GMO : a graph matching for ontologies”, in: Proceedings of
Matching of equivalent field regions
DEFF Research Database (Denmark)
Appel-Hansen, Jørgen; Rengarajan, S.B.
2005-01-01
In aperture problems, integral equations for equivalent currents are often found by enforcing matching of equivalent fields. The enforcement is made in the aperture surface region adjoining the two volumes on each side of the aperture. In the case of an aperture in a planar perfectly conducting...... screen, having the same homogeneous medium on both sides and an impressed current on one aide, an alternative procedure is relevant. We make use of the fact that in the aperture the tangential component of the magnetic field due to the induced currents in the screen is zero. The use of such a procedure...... shows that equivalent currents can be found by a consideration of only one of the two volumes into which the aperture plane divides the space. Furthermore, from a consideration of an automatic matching at the aperture, additional information about tangential as well as normal field components...
Myocardium tracking via matching distributions.
Ben Ayed, Ismail; Li, Shuo; Ross, Ian; Islam, Ali
2009-01-01
The goal of this study is to investigate automatic myocardium tracking in cardiac Magnetic Resonance (MR) sequences using global distribution matching via level-set curve evolution. Rather than relying on the pixelwise information as in existing approaches, distribution matching compares intensity distributions, and consequently, is well-suited to the myocardium tracking problem. Starting from a manual segmentation of the first frame, two curves are evolved in order to recover the endocardium (inner myocardium boundary) and the epicardium (outer myocardium boundary) in all the frames. For each curve, the evolution equation is sought following the maximization of a functional containing two terms: (1) a distribution matching term measuring the similarity between the non-parametric intensity distributions sampled from inside and outside the curve to the model distributions of the corresponding regions estimated from the previous frame; (2) a gradient term for smoothing the curve and biasing it toward high gradient of intensity. The Bhattacharyya coefficient is used as a similarity measure between distributions. The functional maximization is obtained by the Euler-Lagrange ascent equation of curve evolution, and efficiently implemented via level-set. The performance of the proposed distribution matching was quantitatively evaluated by comparisons with independent manual segmentations approved by an experienced cardiologist. The method was applied to ten 2D mid-cavity MR sequences corresponding to ten different subjects. Although neither shape prior knowledge nor curve coupling were used, quantitative evaluation demonstrated that the results were consistent with manual segmentations. The proposed method compares well with existing methods. The algorithm also yields a satisfying reproducibility. Distribution matching leads to a myocardium tracking which is more flexible and applicable than existing methods because the algorithm uses only the current data, i.e., does not
National Oceanic and Atmospheric Administration, Department of Commerce — Tissue samples (skin, bone, blood, muscle) are analyzed for stable carbon, stable nitrogen, and stable sulfur analysis. Many samples are used in their entirety for...
Symmetric Circular Matchings and RNA Folding
DEFF Research Database (Denmark)
Hofacker, Ivo L.; Reidys, Christian; Stadler, Peter F.
2012-01-01
RNA secondary structures can be computed as optimal solutions of certain circular matching problems. An accurate treatment of this energy minimization problem has to account for the small --- but non-negligible --- entropic destabilization of secondary structures with non-trivial automorphisms. S...
Many-to-one blind matching for device-to-device communications
Hamza, Doha R.
2018-01-23
We formulate a two-sided many-to-one abstract matching problem defined by a collection of agreement functions. We then propose a blind matching algorithm (BLMA) to solve the problem. Our solution concept is a modified notion of pairwise stability whereby no pair of agents can e-improve their aspiration levels. We show that the random and decentralized process of BLMA converges to e-pairwise stable solutions with probability one. Next, we consider the application of BLMA in the resource and power allocation problem of device-to-device (D2D) links underlaying a cellular network. Only one resource block (RB) can be assigned to a given D2D while D2D links may occupy many RBs at any given time. We cast the D2D allocation problem within our many-to-one matching problem. We then consider a specific instance of BLMA with limited information exchange so that agents know nothing about the value, utility, of their mutual offers. Offers are simply declared and then either accepted or rejected. Despite the market and information decentralization characteristic of the BLMA, we show that agreement of aspiration levels can still be ascertained and that attaining e-pairwise stability is feasible. Numerical results further demonstrate the convergence properties of the BLMA and that the total utility attained by the BLMA is almost equal to the total utility attained by a centralized controller.
Infographic explaining NCI-COG Pediatric MATCH, a cancer treatment clinical trial for children and adolescents, from 1 to 21 years of age, that is testing the use of precision medicine for pediatric cancers.
Data Matching Imputation System
National Oceanic and Atmospheric Administration, Department of Commerce — The DMIS dataset is a flat file record of the matching of several data set collections. Primarily it consists of VTRs, dealer records, Observer data in conjunction...
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.
Semantic Data Matching: Principles and Performance
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.
Linear Time Local Approximation Algorithm for Maximum Stable Marriage
Directory of Open Access Journals (Sweden)
Zoltán Király
2013-08-01
Full Text Available We consider a two-sided market under incomplete preference lists with ties, where the goal is to find a maximum size stable matching. The problem is APX-hard, and a 3/2-approximation was given by McDermid [1]. This algorithm has a non-linear running time, and, more importantly needs global knowledge of all preference lists. We present a very natural, economically reasonable, local, linear time algorithm with the same ratio, using some ideas of Paluch [2]. In this algorithm every person make decisions using only their own list, and some information asked from members of these lists (as in the case of the famous algorithm of Gale and Shapley. Some consequences to the Hospitals/Residents problem are also discussed.
Parikh Matching in the Streaming Model
DEFF Research Database (Denmark)
Lee, Lap-Kei; Lewenstein, Moshe; Zhang, Qin
2012-01-01
Let S be a string over an alphabet Σ = {σ1, σ2, …}. A Parikh-mapping maps a substring S′ of S to a |Σ|-length vector that contains, in location i of the vector, the count of σi in S′. Parikh matching refers to the problem of finding all substrings of a text T which match to a given input |Σ|-leng...
An Inductive Characterization of Matching in Binding Bigraphs
DEFF Research Database (Denmark)
Damgaard, Troels Christoffer; Glenstrup, Arne John; Birkedal, Lars
2010-01-01
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical react...... reactive systems....
Stable convergence and stable limit theorems
Häusler, Erich
2015-01-01
The authors present a concise but complete exposition of the mathematical theory of stable convergence and give various applications in different areas of probability theory and mathematical statistics to illustrate the usefulness of this concept. Stable convergence holds in many limit theorems of probability theory and statistics – such as the classical central limit theorem – which are usually formulated in terms of convergence in distribution. Originated by Alfred Rényi, the notion of stable convergence is stronger than the classical weak convergence of probability measures. A variety of methods is described which can be used to establish this stronger stable convergence in many limit theorems which were originally formulated only in terms of weak convergence. Naturally, these stronger limit theorems have new and stronger consequences which should not be missed by neglecting the notion of stable convergence. The presentation will be accessible to researchers and advanced students at the master's level...
Kempton, Thomas; Sullivan, Courtney; Bilsborough, Johann C; Cordy, Justin; Coutts, Aaron J
2015-01-01
To determine the match-to-match variability in physical activity and technical performance measures in Australian Football, and examine the influence of playing position, time of season, and different seasons on these measures of variability. Longitudinal observational study. Global positioning system, accelerometer and technical performance measures (total kicks, handballs, possessions and Champion Data rank) were collected from 33 players competing in the Australian Football League over 31 matches during 2011-2012 (N=511 observations). The global positioning system data were categorised into total distance, mean speed (mmin(-1)), high-speed running (>14.4 kmh(-1)), very high-speed running (>19.9 kmh(-1)), and sprint (>23.0 kmh(-1)) distance while player load was collected from the accelerometer. The data were log transformed to provide coefficient of variation and the between subject standard deviation (expressed as percentages). Match-to-match variability was increased for higher speed activities (high-speed running, very high-speed running, sprint distance, coefficient of variation %: 13.3-28.6%) compared to global measures (speed, total distance, player load, coefficient of variation %: 5.3-9.2%). The between-match variability was relativity stable for all measures between and within AFL seasons, with only few differences between positions. Higher speed activities (high-speed running, very high-speed running, sprint distance), but excluding mean speed, total distance and player load, were all higher in the final third phase of the season compared to the start of the season. While global measures of physical performance are relatively stable, higher-speed activities and technical measures exhibit a large degree of between-match variability in Australian Football. However, these measures remain relatively stable between positions, and within and between Australian Football League seasons. Copyright © 2013 Sports Medicine Australia. Published by Elsevier Ltd
School Library Media Activities Monthly, 1996
1996-01-01
Giving students a chance to associate numbers with subjects can be useful in speeding their location of desired print or nonprint materials and helping students feel independent when browsing. A matching game for helping students learn the Dewey numbers is presented. Instructions for the library media specialist or teacher, instructions for…
Directory of Open Access Journals (Sweden)
Nima Tabatabaei
2018-04-01
Full Text Available Conventional infrared thermography techniques, including pulsed and lock-in thermography, have shown great potential for non-destructive evaluation of broad spectrum of materials, spanning from metals to polymers to biological tissues. However, performance of these techniques is often limited due to the diffuse nature of thermal wave fields, resulting in an inherent compromise between inspection depth and depth resolution. Recently, matched-filter thermography has been introduced as a means for overcoming this classic limitation to enable depth-resolved subsurface thermal imaging and improving axial/depth resolution. This paper reviews the basic principles and experimental results of matched-filter thermography: first, mathematical and signal processing concepts related to matched-fileting and pulse compression are discussed. Next, theoretical modeling of thermal-wave responses to matched-filter thermography using two categories of pulse compression techniques (linear frequency modulation and binary phase coding are reviewed. Key experimental results from literature demonstrating the maintenance of axial resolution while inspecting deep into opaque and turbid media are also presented and discussed. Finally, the concept of thermal coherence tomography for deconvolution of thermal responses of axially superposed sources and creation of depth-selective images in a diffusion-wave field is reviewed.
DEFF Research Database (Denmark)
Hartelius, Karsten; Carstensen, Jens Michael
2003-01-01
A method for locating distorted grid structures in images is presented. The method is based on the theories of template matching and Bayesian image restoration. The grid is modeled as a deformable template. Prior knowledge of the grid is described through a Markov random field (MRF) model which r...
Gallistel, C. R.; King, Adam Philip; Gottlieb, Daniel; Balci, Fuat; Papachristos, Efstathios B.; Szalecki, Matthew; Carbone, Kimberly S.
2007-01-01
Experimentally naive mice matched the proportions of their temporal investments (visit durations) in two feeding hoppers to the proportions of the food income (pellets per unit session time) derived from them in three experiments that varied the coupling between the behavioral investment and food income, from no coupling to strict coupling.…
History Matching: Towards Geologically Reasonable Models
DEFF Research Database (Denmark)
Melnikova, Yulia; Cordua, Knud Skou; Mosegaard, Klaus
This work focuses on the development of a new method for history matching problem that through a deterministic search finds a geologically feasible solution. Complex geology is taken into account evaluating multiple point statistics from earth model prototypes - training images. Further a function...... that measures similarity between statistics of a training image and statistics of any smooth model is introduced and its analytical gradient is computed. This allows us to apply any gradientbased method to history matching problem and guide a solution until it satisfies both production data and complexity...
[Propensity score matching in SPSS].
Huang, Fuqiang; DU, Chunlin; Sun, Menghui; Ning, Bing; Luo, Ying; An, Shengli
2015-11-01
To realize propensity score matching in PS Matching module of SPSS and interpret the analysis results. The R software and plug-in that could link with the corresponding versions of SPSS and propensity score matching package were installed. A PS matching module was added in the SPSS interface, and its use was demonstrated with test data. Score estimation and nearest neighbor matching was achieved with the PS matching module, and the results of qualitative and quantitative statistical description and evaluation were presented in the form of a graph matching. Propensity score matching can be accomplished conveniently using SPSS software.
Directory of Open Access Journals (Sweden)
Paulo Henrique Siqueira
2004-08-01
Full Text Available O objetivo deste trabalho é mostrar a aplicação do Algoritmo do Matching de peso máximo, na elaboração de jornadas de trabalho para motoristas e cobradores de ônibus. Este problema deve ser resolvido levando-se em consideração o maior aproveitamento possível das tabelas de horários, com o objetivo de minimizar o número de funcionários, de horas extras e de horas ociosas. Desta forma, os custos das companhias de transporte público são minimizados. Na primeira fase do trabalho, supondo-se que as tabelas de horários já estejam divididas em escalas de curta e de longa duração, as escalas de curta duração são combinadas para a formação da jornada diária de trabalho de um funcionário. Esta combinação é feita com o Algoritmo do Matching de peso máximo, no qual as escalas são representadas por vértices de um grafo, e o peso máximo é atribuído às combinações de escalas que não formam horas extras e horas ociosas. Na segunda fase, uma jornada de final de semana é designada para cada jornada semanal de dias úteis. Por meio destas duas fases, as jornadas semanais de trabalho para motoristas e cobradores de ônibus podem ser construídas com custo mínimo. A terceira e última fase deste trabalho consiste na designação das jornadas semanais de trabalho para cada motorista e cobrador de ônibus, considerando-se suas preferências. O Algoritmo do Matching de peso máximo é utilizado para esta fase também. Este trabalho foi aplicado em três empresas de transporte público da cidade de Curitiba - PR, nas quais os algoritmos utilizados anteriormente eram heurísticos, baseados apenas na experiência do encarregado por esta tarefa.The purpose of this paper is to discuss how the maximum weight Matching Algorithm can be applied to schedule the workdays of bus drivers and bus fare collectors. This scheduling should be based on the best possible use of timetables in order to minimize the number of employees, overtime and
National Aeronautics and Space Administration — The code in the stableGP package implements Gaussian process calculations using efficient and numerically stable algorithms. Description of the algorithms is in the...
Angina Pectoris (Stable Angina)
... Peripheral Artery Disease Venous Thromboembolism Aortic Aneurysm More Angina Pectoris (Stable Angina) Updated:Aug 21,2017 You may have heard the term “angina pectoris” or “stable angina” in your doctor’s office, ...
Electromagnetic wave matching device
International Nuclear Information System (INIS)
Hirata, Yosuke; Mitsunaka, Yoshika; Hayashi, Ken-ichi; Ito, Yasuyuki.
1997-01-01
The present invention provides a matching device capable of increasing an efficiency of combining beams of electromagnetic waves outputted from an output window of a gyrotron which is expected for plasma heating of a thermonuclear reactor and an electromagnetic wave transmission system as high as possible. Namely, an electromagnetic wave matching device reflects beams of electromagnetic waves incident from an inlet by a plurality of phase correction mirrors and combines them to an external transmission system through an exit. In this case, the phase correction mirrors change the phase of the beams of electromagnetic waves incident to the phase correction mirrors by a predetermined amount corresponding to the position of the reflection mirrors. Then, the beams of electromagnetic waves outputted, for example, from a gyrotron can properly be shaped as desired for the intensity and the phase. As a result, combination efficiency with the transmission system can be increased. (I.S.)
International Nuclear Information System (INIS)
Tokuda, Shinji; Watanabe, Tomoko.
1996-11-01
A theory and a numerical method are presented for the asymptotic matching analysis of resistive magnetohydrodynamic stability in a negative magnetic shear configuration with two rational surfaces. The theory formulates the problem of solving both the Newcomb equations in the ideal MHD region and the inner-layer equations around rational surfaces as boundary value/eigenvalue problems to which the finite element method and the finite difference method can be applied. Hence, the problem of stability analysis is solved by a numerically stable method. The present numerical method has been applied to model equations having analytic solutions in a negative magnetic shear configuration. Comparison of the numerical solutions with the analytical ones verifies the validity of the numerical method proposed. (author)
Probabilistic evaluation of process model matching techniques
Kuss, Elena; Leopold, Henrik; van der Aa, Han; Stuckenschmidt, Heiner; Reijers, Hajo A.
2016-01-01
Process model matching refers to the automatic identification of corresponding activities between two process models. It represents the basis for many advanced process model analysis techniques such as the identification of similar process parts or process model search. A central problem is how to
Sidescan Sonar Image Matching Using Cross Correlation
DEFF Research Database (Denmark)
Thisen, Erik; Sørensen, Helge Bjarup Dissing; Stage, Bjarne
2003-01-01
When surveying an area for sea mines with a sidescan sonar, the ability to find the same object in two different sonar images is helpful to determine the nature of the object. The main problem with matching two sidescan sonar images is that a scene changes appearance when viewed from different vi...
Matching Subsequences in Trees
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li
2009-01-01
Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new...
Matching with transfer matrices
International Nuclear Information System (INIS)
Perez-Alvarez, R.; Velasco, V.R.; Garcia-Moliner, F.; Rodriguez-Coppola, H.
1987-10-01
An ABC configuration - which corresponds to various systems of physical interest, such as a barrier or a quantum well - is studied by combining a surface Green function matching analysis of the entire system with a description of the intermediate (B) region in terms of a transfer matrix in the sense of Mora et al. (1985). This hybrid approach proves very useful when it is very difficult to construct the corresponding Green function G B . An application is made to the calculation of quantised subband levels in a parabolic quantum well. Further possibilities of extension of this approach are pointed out. (author). 27 refs, 1 tab
Coaxial pulse matching transformer
International Nuclear Information System (INIS)
Ledenev, V.V.; Khimenko, L.T.
1986-01-01
This paper describes a coaxial pulse matching transformer with comparatively simple design, increased mechanical strength, and low stray inductance. The transformer design makes it easy to change the turns ratio. The circuit of the device and an expression for the current multiplication factor are presented; experiments confirm the efficiency of the transformer. Apparatus with a coaxial transformer for producing high-power pulsed magnetic fields is designed (current pulses of 1-10 MA into a load and a natural frequency of 100 kHz)
Privacy‐Preserving Friend Matching Protocol approach for Pre‐match in Social Networks
DEFF Research Database (Denmark)
Ople, Shubhangi S.; Deshmukh, Aaradhana A.; Mihovska, Albena Dimitrova
2016-01-01
Social services make the most use of the user profile matching to help the users to discover friends with similar social attributes (e.g. interests, location, age). However, there are many privacy concerns that prevent to enable this functionality. Privacy preserving encryption is not suitable...... for use in social networks due to its data sharing problems and information leakage. In this paper, we propose a novel framework for privacy–preserving profile matching. We implement both the client and server portion of the secure match and evaluate its performance network dataset. The results show...
Plasma focus matching conditions
International Nuclear Information System (INIS)
Soliman, H.M.; Masoud, M.M.; Elkhalafawy, T.A.
1988-01-01
A snow-plough and slug models have been used to obtain the optimum matching conditions of the plasma in the focus. The dimensions of the plasma focus device are, inner electrode radius = 2 cm, outer electrode radius = 5.5 cm, and its length = 8 cm. It was found that the maximum magnetic energy of 12.26 kJ has to be delivered to plasma focus whose density is 10 19 /cm 3 at focusing time of 2.55 μs and with total external inductance of 24.2 n H. The same method is used to evaluate the optimum matching conditions for the previous coaxial discharge system which had inner electrode radius = 1.6 cm, outer electrode radius = 3.3 cm and its length = 31.5 cm. These conditions are charging voltage = 12 kV, capacity of the condenser bank = 430 μf, plasma focus density = 10 19 /cm 3 focusing time = 8 μs and total external inductance = 60.32 n H.3 fig., 2 tab
Optimal background matching camouflage.
Michalis, Constantine; Scott-Samuel, Nicholas E; Gibson, David P; Cuthill, Innes C
2017-07-12
Background matching is the most familiar and widespread camouflage strategy: avoiding detection by having a similar colour and pattern to the background. Optimizing background matching is straightforward in a homogeneous environment, or when the habitat has very distinct sub-types and there is divergent selection leading to polymorphism. However, most backgrounds have continuous variation in colour and texture, so what is the best solution? Not all samples of the background are likely to be equally inconspicuous, and laboratory experiments on birds and humans support this view. Theory suggests that the most probable background sample (in the statistical sense), at the size of the prey, would, on average, be the most cryptic. We present an analysis, based on realistic assumptions about low-level vision, that estimates the distribution of background colours and visual textures, and predicts the best camouflage. We present data from a field experiment that tests and supports our predictions, using artificial moth-like targets under bird predation. Additionally, we present analogous data for humans, under tightly controlled viewing conditions, searching for targets on a computer screen. These data show that, in the absence of predator learning, the best single camouflage pattern for heterogeneous backgrounds is the most probable sample. © 2017 The Authors.
Quantum learning and universal quantum matching machine
International Nuclear Information System (INIS)
Sasaki, Masahide; Carlini, Alberto
2002-01-01
Suppose that three kinds of quantum systems are given in some unknown states vertical bar f> xN , vertical bar g 1 > xK , and vertical bar g 2 > xK , and we want to decide which template state vertical bar g 1 > or vertical bar g 2 >, each representing the feature of the pattern class C 1 or C 2 , respectively, is closest to the input feature state vertical bar f>. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of K=1, showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process
Job Searchers, Job Matches and the Elasticity of Matching
Broersma, L.; van Ours, J.C.
1998-01-01
This paper stresses the importance of a specification of the matching function in which the measure of job matches corresponds to the measure of job searchers. In many empirical studies on the matching function this requirement has not been fulfilled because it is difficult to find information about
Steeneveld, G.J.
2012-01-01
Understanding and prediction of the stable atmospheric boundary layer is a challenging task. Many physical processes are relevant in the stable boundary layer, i.e. turbulence, radiation, land surface coupling, orographic turbulent and gravity wave drag, and land surface heterogeneity. The development of robust stable boundary layer parameterizations for use in NWP and climate models is hampered by the multiplicity of processes and their unknown interactions. As a result, these models suffer ...
Mark, T A; Gallistel, C R
1994-01-01
Rats responded on concurrent variable interval schedules of brain stimulation reward in 2-trial sessions. Between trials, there was a 16-fold reversal in the relative rate of reward. In successive, narrow time windows, the authors compared the ratio of the times spent on the 2 levers to the ratio of the rewards received. Time-allocation ratios tracked wide, random fluctuations in the reward ratio. The adjustment to the midsession reversal in relative rate of reward was largely completed within 1 interreward interval on the leaner schedule. Both results were unaffected by a 16-fold change in the combined rates of reward. The large, rapid, scale-invariant shifts in time-allocation ratios that underlie matching behavior imply that the subjective relative rate of reward can be determined by a very few of the most recent interreward intervals and that this estimate can directly determine the ratio of the expected stay durations.
Electromagnetic wave matching device
International Nuclear Information System (INIS)
Hirata, Yosuke; Mitsunaka, Yoshika; Hayashi, Ken-ichi; Ito, Yasuyuki.
1997-01-01
The present invention provides an electromagnetic wave matching capable of reducing a cost for the transmission system in a system of using electromagnetic waves for plasma heating of a thermonuclear reactor. Namely, incident electromagnetic waves are reflected by using a plurality of phase correction mirrors. The reflected electromagnetic waves are connected to an external transmission system through an exit. The phase correction mirrors have such a shape to receive a plurality of beam-like electromagnetic waves and output electromagnetic waves by the number different from the number of the received electromagnetic wave beams having a predetermined distribution. Further, at least two of the phase correction mirrors have such a shape to change the phase of the electromagnetic waves beams incident to the reflection surface of the phase correction mirrors by a predetermined amount corresponding to the position of the reflection surface. Then, the cost for transmission system can greatly be reduced. (I.S.)
Quantity precommitment and price matching
DEFF Research Database (Denmark)
Tumennasan, Norovsambuu
We revisit the question of whether price matching is anti-competitive in a capacity constrained duopoly setting. We show that the effect of price matching depends on capacity. Specifically, price matching has no effect when capacity is relatively low, but it benefits the firms when capacity...... is relatively high. Interestingly, when capacity is in an intermediate range, price matching benefits only the small firm but does not affect the large firm in any way. Therefore, one has to consider capacity seriously when evaluating if price matching is anti-competitive. If the firms choose their capacities...... simultaneously before pricing decisions, then the effect of price matching is either pro-competitive or ambiguous. We show that if the cost of capacity is high, then price matching can only (weakly) decrease the market price. On the other hand, if the cost of capacity is low, then the effect of price matching...
DEFF Research Database (Denmark)
Monte, Daniel; Tumennasan, Norovsambuu
2013-01-01
In the problem of allocating workers to different projects, where each project needs a minimum number of workers assigned to it, the serial dictatorship mechanism is neither strategy proof nor Pareto efficient. We therefore propose a strategy-proof and Pareto-efficient mechanism.......In the problem of allocating workers to different projects, where each project needs a minimum number of workers assigned to it, the serial dictatorship mechanism is neither strategy proof nor Pareto efficient. We therefore propose a strategy-proof and Pareto-efficient mechanism....
Periodicity of the stable isotopes
Boeyens, J C A
2003-01-01
It is demonstrated that all stable (non-radioactive) isotopes are formally interrelated as the products of systematically adding alpha particles to four elementary units. The region of stability against radioactive decay is shown to obey a general trend based on number theory and contains the periodic law of the elements as a special case. This general law restricts the number of what may be considered as natural elements to 100 and is based on a proton:neutron ratio that matches the golden ratio, characteristic of biological and crystal growth structures. Different forms of the periodic table inferred at other proton:neutron ratios indicate that the electronic configuration of atoms is variable and may be a function of environmental pressure. Cosmic consequences of this postulate are examined. (author)
Formal derivation of a stable marriage algorithm.
Bijlsma, A.
1991-01-01
In this paper the well-known Stable Marriage Problem is considered once again. The name of this programming problem comes from the terms in which it was first described [2]: A certain community consists of n men and n women. Each person ranks those of the opposite sex in accordance with his or
Spatial competition with intermediated matching
van Raalte, C.L.J.P.; Webers, H.M.
1995-01-01
This paper analyzes the spatial competition in commission fees between two match makers. These match makers serve as middlemen between buyers and sellers who are located uniformly on a circle. The profits of the match makers are determined by their respective market sizes. A limited willingness to
Stable isotopes labelled compounds
International Nuclear Information System (INIS)
1982-09-01
The catalogue on stable isotopes labelled compounds offers deuterium, nitrogen-15, and multiply labelled compounds. It includes: (1) conditions of sale and delivery, (2) the application of stable isotopes, (3) technical information, (4) product specifications, and (5) the complete delivery programme
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 21; Issue 9. Evolutionary Stable Strategy: Application of Nash Equilibrium in Biology. General Article Volume 21 Issue 9 September 2016 pp 803- ... Keywords. Evolutionary game theory, evolutionary stable state, conflict, cooperation, biological games.
Steeneveld, G.J.
2012-01-01
Understanding and prediction of the stable atmospheric boundary layer is a challenging task. Many physical processes are relevant in the stable boundary layer, i.e. turbulence, radiation, land surface coupling, orographic turbulent and gravity wave drag, and land surface heterogeneity. The
Achromatic hues matching in graphic printing
Directory of Open Access Journals (Sweden)
Martinia Ira Glogar
2015-05-01
Full Text Available Some problems in process of dark achromatic hues reproduction and matching in graphic industry, where requests on colour matching are very high, are discussed. When achromatic hues is concerned, in terms of high requests on colour parameter matching, right on time production, quick response and high quality standards requests, the production and moreover the reproduction is subject to many variables and represent the manufacturing process of high complexity. The aim is to achieve a graphic reproduction with defined colour parameters and remission characteristics as close as possible to a standard. In this paper, black and grey hues characterized with average lightness value L*≤ 20, were analysed. Subjective as well as objective colour evaluation have been performed and results of colour differences obtained by two colour difference formulae, CIELAB and CMC(l:c have been compared.
Surface Area Distribution Descriptor for object matching
Directory of Open Access Journals (Sweden)
Mohamed F. Gafar
2010-07-01
Full Text Available Matching 3D objects by their similarity is a fundamental problem in computer vision, computer graphics and many other fields. The main challenge in object matching is to find a suitable shape representation that can be used to accurately and quickly discriminate between similar and dissimilar shapes. In this paper we present a new volumetric descriptor to represent 3D objects. The proposed descriptor is used to match objects under rigid transformations including uniform scaling. The descriptor represents the object by dividing it into shells, acquiring the area distribution of the object through those shells. The computed areas are normalised to make the descriptor scale-invariant in addition to rotation and translation invariant. The effectiveness and stability of the proposed descriptor to noise and variant sampling density as well as the effectiveness of the similarity measures are analysed and demonstrated through experimental results.
Vio, R.; Vergès, C.; Andreani, P.
2017-08-01
The matched filter (MF) is one of the most popular and reliable techniques to the detect signals of known structure and amplitude smaller than the level of the contaminating noise. Under the assumption of stationary Gaussian noise, MF maximizes the probability of detection subject to a constant probability of false detection or false alarm (PFA). This property relies upon a priori knowledge of the position of the searched signals, which is usually not available. Recently, it has been shown that when applied in its standard form, MF may severely underestimate the PFA. As a consequence the statistical significance of features that belong to noise is overestimated and the resulting detections are actually spurious. For this reason, an alternative method of computing the PFA has been proposed that is based on the probability density function (PDF) of the peaks of an isotropic Gaussian random field. In this paper we further develop this method. In particular, we discuss the statistical meaning of the PFA and show that, although useful as a preliminary step in a detection procedure, it is not able to quantify the actual reliability of a specific detection. For this reason, a new quantity is introduced called the specific probability of false alarm (SPFA), which is able to carry out this computation. We show how this method works in targeted simulations and apply it to a few interferometric maps taken with the Atacama Large Millimeter/submillimeter Array (ALMA) and the Australia Telescope Compact Array (ATCA). We select a few potential new point sources and assign an accurate detection reliability to these sources.
An Improved Ant Colony Matching by Using Discrete Curve Evolution
Saadi, Younes; Sari, Eka,; Herawan, Tutut
2014-01-01
Part 1: Information & Communication Technology-EurAsia Conference 2014, ICT-EurAsia 2014; International audience; In this paper we present an improved Ant Colony Optimization (ACO) for contour matching, which can be used to match 2D shapes. Discrete Curve Evolution (DCE) technique is used to simplify the extracted contour. In order to find the best correspondence between shapes, the match process is formulated as a Quadratic Assignment Problem (QAP) and resolved by using Ant Colony Optimizati...
An Implementation of the Frequency Matching Method
DEFF Research Database (Denmark)
Lange, Katrine; Frydendall, Jan; Hansen, Thomas Mejer
During the last decade multiple-point statistics has become in-creasingly popular as a tool for incorporating complex prior infor-mation when solving inverse problems in geosciences. A variety of methods have been proposed but often the implementation of these is not straightforward. One of these......During the last decade multiple-point statistics has become in-creasingly popular as a tool for incorporating complex prior infor-mation when solving inverse problems in geosciences. A variety of methods have been proposed but often the implementation of these is not straightforward. One...... of these methods is the recently proposed Frequency Matching method to compute the maximum a posteriori model of an inverse problem where multiple-point statistics, learned from a training image, is used to formulate a closed form expression for an a priori probability density function. This paper discusses...... aspects of the implementation of the Fre-quency Matching method and the techniques adopted to make it com-putationally feasible also for large-scale inverse problems. The source code is publicly available at GitHub and this paper also provides an example of how to apply the Frequency Matching method...
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
DEFF Research Database (Denmark)
Hazay, Carmit; Toft, Tomas
2014-01-01
for important variations of the secure pattern matching problem that are significantly more efficient than the current state of art solutions: First, we deal with secure pattern matching with wildcards. In this variant the pattern may contain wildcards that match both 0 and 1. Our protocol requires O......We propose a protocol for the problem of secure two-party pattern matching, where Alice holds a text t∈{0,1}∗ of length n, while Bob has a pattern p∈{0,1}∗ of length m. The goal is for Bob to (only) learn where his pattern occurs in Alice’s text, while Alice learns nothing. Private pattern matching...... is an important problem that has many applications in the area of DNA search, computational biology and more. Our construction guarantees full simulation in the presence of malicious, polynomial-time adversaries (assuming the hardness of DDH assumption) and exhibits computation and communication costs of O...
Organizations must match assets
International Nuclear Information System (INIS)
Carley, G.R.
1991-01-01
The unprofitable state of the Canadian oil industry, the adverse economic environment, the difficulty of finding capital, and the diminishing resources of conventional lighter crude oil make it necessary for Canadian oil companies to match their organizations and their financing to their assets. This is illustrated according to the experience of Saskoil, a Saskatchewan oil and gas company. An increasing production of oil and natural gas, and an increasing amount of new oil production as heavy oil, led to organizational changes such as the purchase of an asphalt plant to provide the company with downstream experience, establishing a working group to explore and develop heavy oil resources, and forming a company to manage non-core assets. The latter company, Pasqua Resources, manages assets such as small properties and ownership interests in order to increase the operating efficiency of Saskoil. Pasqua provides Saskoil with a corporate and organizational vehicle to accommodate partnerships and joint venture capital invested in property purchase opportunities, and to manage any of Saskoil's divestiture activities
DEFF Research Database (Denmark)
Monte, Daniel; Tumennasan, Norovsambuu
We study the problem of allocating workers to different projects in which each project requires having a minimum number of workers assigned to it or else it does not open. We show that the well-known serial dictatorship mechanism is neither strategy-proof nor Pareto ecient. Thus, we propose...... an algorithm, denoted as the serial dictatorship with project closures, which is strategy-proof and also Pareto efficient over the set of all feasible allocations....
Boxed Permutation Pattern Matching
DEFF Research Database (Denmark)
Amit, Mika; Bille, Philip; Cording, Patrick Hagge
2016-01-01
the goal is to only find the boxed subsequences of T that are order-isomorphic to P. This problem was introduced by Bruner and Lackner who showed that it can be solved in O(n3) time. Cho et al. [CPM 2015] gave an O(n2m) time algorithm and improved it to O(n2 logm). In this paper we present a solution...
Unsupervised image matching based on manifold alignment.
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.
Approximate semantic matching of music classes on the internet
Aleksovski, Zharko; Kate, Warner Ten; Van Harmelen, Frank
2006-01-01
We address the problem of semantic matching, which concerns the search for semantic agreement between heterogeneous concept hierarchies. We propose a new approximation method to discover and assess the "strength" (preciseness) of a semantic match between concepts from two such concept hierarchies.
Marriage and Divorce in a Model of Matching
Mumcu, Ayse; Saglam, Ismail
2006-01-01
We study the problem of marriage formation and marital distribution in a two-period model of matching, extending the matching with bargaining framework of Crawford and Rochford (1986). We run simulations to find the effects of alimony rate, legal cost of divorce, initial endowments, couple and single productivity parameters on the payoffs and marital status in the society.
Optimization of Parameters of Asymptotically Stable Systems
Directory of Open Access Journals (Sweden)
Anna Guerman
2011-01-01
Full Text Available This work deals with numerical methods of parameter optimization for asymptotically stable systems. We formulate a special mathematical programming problem that allows us to determine optimal parameters of a stabilizer. This problem involves solutions to a differential equation. We show how to chose the mesh in order to obtain discrete problem guaranteeing the necessary accuracy. The developed methodology is illustrated by an example concerning optimization of parameters for a satellite stabilization system.
Normal modified stable processes
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole Eiler; Shephard, N.
2002-01-01
Gaussian (NGIG) laws. The wider framework thus established provides, in particular, for added flexibility in the modelling of the dynamics of financial time series, of importance especially as regards OU based stochastic volatility models for equities. In the special case of the tempered stable OU process......This paper discusses two classes of distributions, and stochastic processes derived from them: modified stable (MS) laws and normal modified stable (NMS) laws. This extends corresponding results for the generalised inverse Gaussian (GIG) and generalised hyperbolic (GH) or normal generalised inverse...
Applications of stable isotopes
International Nuclear Information System (INIS)
Letolle, R.; Mariotti, A.; Bariac, T.
1991-06-01
This report reviews the historical background and the properties of stable isotopes, the methods used for their measurement (mass spectrometry and others), the present technics for isotope enrichment and separation, and at last the various present and foreseeable application (in nuclear energy, physical and chemical research, materials industry and research; tracing in industrial, medical and agronomical tests; the use of natural isotope variations for environmental studies, agronomy, natural resources appraising: water, minerals, energy). Some new possibilities in the use of stable isotope are offered. A last chapter gives the present state and forecast development of stable isotope uses in France and Europe
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
National Research Council Canada - National Science Library
Adler, Robert
1997-01-01
We describe how to take a stable, ARMA, time series through the various stages of model identification, parameter estimation, and diagnostic checking, and accompany the discussion with a goodly number...
Citation Matching in Sanskrit Corpora Using Local Alignment
Prasad, Abhinandan S.; Rao, Shrisha
Citation matching is the problem of finding which citation occurs in a given textual corpus. Most existing citation matching work is done on scientific literature. The goal of this paper is to present methods for performing citation matching on Sanskrit texts. Exact matching and approximate matching are the two methods for performing citation matching. The exact matching method checks for exact occurrence of the citation with respect to the textual corpus. Approximate matching is a fuzzy string-matching method which computes a similarity score between an individual line of the textual corpus and the citation. The Smith-Waterman-Gotoh algorithm for local alignment, which is generally used in bioinformatics, is used here for calculating the similarity score. This similarity score is a measure of the closeness between the text and the citation. The exact- and approximate-matching methods are evaluated and compared. The methods presented can be easily applied to corpora in other Indic languages like Kannada, Tamil, etc. The approximate-matching method can in particular be used in the compilation of critical editions and plagiarism detection in a literary work.
Stability properties of nonlinear dynamical systems and evolutionary stable states
Energy Technology Data Exchange (ETDEWEB)
Gleria, Iram, E-mail: iram@fis.ufal.br [Instituto de Física, Universidade Federal de Alagoas, 57072-970 Maceió-AL (Brazil); Brenig, Leon [Faculté des Sciences, Université Libre de Bruxelles, 1050 Brussels (Belgium); Rocha Filho, Tarcísio M.; Figueiredo, Annibal [Instituto de Física and International Center for Condensed Matter Physics, Universidade de Brasília, 70919-970 Brasília-DF (Brazil)
2017-03-18
Highlights: • We address the problem of equilibrium stability in a general class of non-linear systems. • We link Evolutionary Stable States (ESS) to stable fixed points of square quasi-polynomial (QP) systems. • We show that an interior ES point may be related to stable interior fixed points of QP systems. - Abstract: In this paper we address the problem of stability in a general class of non-linear systems. We establish a link between the concepts of asymptotic stable interior fixed points of square Quasi-Polynomial systems and evolutionary stable states, a property of some payoff matrices arising from evolutionary games.
Probability matching and strategy availability
J. Koehler, Derek; Koehler, Derek J.; James, Greta
2010-01-01
Findings from two experiments indicate that probability matching in sequential choice arises from an asymmetry in strategy availability: The matching strategy comes readily to mind, whereas a superior alternative strategy, maximizing, does not. First, compared with the minority who spontaneously engage in maximizing, the majority of participants endorse maximizing as superior to matching in a direct comparison when both strategies are described. Second, when the maximizing strategy is brought...
An Incentive Theory of Matching
Brown, Alessio J. G.; Merkl, Christian; Snower, Dennis J.
2010-01-01
This paper examines the labour market matching process by distinguishing its two component stages: the contact stage, in which job searchers make contact with employers and the selection stage, in which they decide whether to match. We construct a theoretical model explaining two-sided selection through microeconomic incentives. Firms face adjustment costs in responding to heterogeneous variations in the characteristics of workers and jobs. Matches and separations are described through firms'...
Using crosswell data to enhance history matching
Ravanelli, Fabio M.
2014-01-01
One of the most challenging tasks in the oil industry is the production of reliable reservoir forecast models. Due to different sources of uncertainties in the numerical models and inputs, reservoir simulations are often only crude approximations of the reality. This problem is mitigated by conditioning the model with data through data assimilation, a process known in the oil industry as history matching. Several recent advances are being used to improve history matching reliability, notably the use of time-lapse data and advanced data assimilation techniques. One of the most promising data assimilation techniques employed in the industry is the ensemble Kalman filter (EnKF) because of its ability to deal with non-linear models at reasonable computational cost. In this paper we study the use of crosswell seismic data as an alternative to 4D seismic surveys in areas where it is not possible to re-shoot seismic. A synthetic reservoir model is used in a history matching study designed better estimate porosity and permeability distributions and improve the quality of the model to predict future field performance. This study is divided in three parts: First the use of production data only is evaluated (baseline for benchmark). Second the benefits of using production and 4D seismic data are assessed. Finally, a new conceptual idea is proposed to obtain time-lapse information for history matching. The use of crosswell time-lapse seismic tomography to map velocities in the interwell region is demonstrated as a potential tool to ensure survey reproducibility and low acquisition cost when compared with full scale surface surveys. Our numerical simulations show that the proposed method provides promising history matching results leading to similar estimation error reductions when compared with conventional history matched surface seismic data.
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...
History Matching of 4D Seismic Data Attributes using the Ensemble Kalman Filter
Ravanelli, Fabio M.
2013-01-01
. This problem is tackled by the conditioning of the model with production data through data assimilation. This process is known in the oil industry as history matching. Several recent advances are being used to improve history matching reliability, notably
International Nuclear Information System (INIS)
Axente, Damian
1998-01-01
The most important fields of stable isotope use with examples are presented. These are: 1. Isotope dilution analysis: trace analysis, measurements of volumes and masses; 2. Stable isotopes as tracers: transport phenomena, environmental studies, agricultural research, authentication of products and objects, archaeometry, studies of reaction mechanisms, structure and function determination of complex biological entities, studies of metabolism, breath test for diagnostic; 3. Isotope equilibrium effects: measurement of equilibrium effects, investigation of equilibrium conditions, mechanism of drug action, study of natural processes, water cycle, temperature measurements; 4. Stable isotope for advanced nuclear reactors: uranium nitride with 15 N as nuclear fuel, 157 Gd for reactor control. In spite of some difficulties of stable isotope use, particularly related to the analytical techniques, which are slow and expensive, the number of papers reporting on this subject is steadily growing as well as the number of scientific meetings organized by International Isotope Section and IAEA, Gordon Conferences, and regional meeting in Germany, France, etc. Stable isotope application development on large scale is determined by improving their production technologies as well as those of labeled compound and the analytical techniques. (author)
DOE Matching Grant Program; FINAL
International Nuclear Information System (INIS)
Dr Marvin Adams
2002-01-01
OAK 270 - The DOE Matching Grant Program provided$50,000.00 to the Dept of N.E. at TAMU, matching a gift of$50,000.00 from TXU Electric. The$100,000.00 total was spent on scholarships, departmental labs, and computing network
Matching score based face recognition
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
Platform pricing in matching markets
Goos, M.; van Cayseele, P.; Willekens, B.
2011-01-01
This paper develops a simple model of monopoly platform pricing accounting for two pertinent features of matching markets. 1) The trading process is characterized by search and matching frictions implying limits to positive cross-side network effects and the presence of own-side congestion.
Role model and prototype matching
DEFF Research Database (Denmark)
Lykkegaard, Eva; Ulriksen, Lars
2016-01-01
’ meetings with the role models affected their thoughts concerning STEM students and attending university. The regular self-to-prototype matching process was shown in real-life role-models meetings to be extended to a more complex three-way matching process between students’ self-perceptions, prototype...
Calcium stable isotope geochemistry
Energy Technology Data Exchange (ETDEWEB)
Gausonne, Nikolaus [Muenster Univ. (Germany). Inst. fuer Mineralogie; Schmitt, Anne-Desiree [Strasbourg Univ. (France). LHyGeS/EOST; Heuser, Alexander [Bonn Univ. (Germany). Steinmann-Inst. fuer Geologie, Mineralogie und Palaeontologie; Wombacher, Frank [Koeln Univ. (Germany). Inst. fuer Geologie und Mineralogie; Dietzel, Martin [Technische Univ. Graz (Austria). Inst. fuer Angewandte Geowissenschaften; Tipper, Edward [Cambridge Univ. (United Kingdom). Dept. of Earth Sciences; Schiller, Martin [Copenhagen Univ. (Denmark). Natural History Museum of Denmark
2016-08-01
This book provides an overview of the fundamentals and reference values for Ca stable isotope research, as well as current analytical methodologies including detailed instructions for sample preparation and isotope analysis. As such, it introduces readers to the different fields of application, including low-temperature mineral precipitation and biomineralisation, Earth surface processes and global cycling, high-temperature processes and cosmochemistry, and lastly human studies and biomedical applications. The current state of the art in these major areas is discussed, and open questions and possible future directions are identified. In terms of its depth and coverage, the current work extends and complements the previous reviews of Ca stable isotope geochemistry, addressing the needs of graduate students and advanced researchers who want to familiarize themselves with Ca stable isotope research.
Calcium stable isotope geochemistry
International Nuclear Information System (INIS)
Gausonne, Nikolaus; Schmitt, Anne-Desiree; Heuser, Alexander; Wombacher, Frank; Dietzel, Martin; Tipper, Edward; Schiller, Martin
2016-01-01
This book provides an overview of the fundamentals and reference values for Ca stable isotope research, as well as current analytical methodologies including detailed instructions for sample preparation and isotope analysis. As such, it introduces readers to the different fields of application, including low-temperature mineral precipitation and biomineralisation, Earth surface processes and global cycling, high-temperature processes and cosmochemistry, and lastly human studies and biomedical applications. The current state of the art in these major areas is discussed, and open questions and possible future directions are identified. In terms of its depth and coverage, the current work extends and complements the previous reviews of Ca stable isotope geochemistry, addressing the needs of graduate students and advanced researchers who want to familiarize themselves with Ca stable isotope research.
History Matching in Parallel Computational Environments
Energy Technology Data Exchange (ETDEWEB)
Steven Bryant; Sanjay Srinivasan; Alvaro Barrera; Sharad Yadav
2004-08-31
In the probabilistic approach for history matching, the information from the dynamic data is merged with the prior geologic information in order to generate permeability models consistent with the observed dynamic data as well as the prior geology. The relationship between dynamic response data and reservoir attributes may vary in different regions of the reservoir due to spatial variations in reservoir attributes, fluid properties, well configuration, flow constrains on wells etc. This implies probabilistic approach should then update different regions of the reservoir in different ways. This necessitates delineation of multiple reservoir domains in order to increase the accuracy of the approach. The research focuses on a probabilistic approach to integrate dynamic data that ensures consistency between reservoir models developed from one stage to the next. The algorithm relies on efficient parameterization of the dynamic data integration problem and permits rapid assessment of the updated reservoir model at each stage. The report also outlines various domain decomposition schemes from the perspective of increasing the accuracy of probabilistic approach of history matching. Research progress in three important areas of the project are discussed: {lg_bullet}Validation and testing the probabilistic approach to incorporating production data in reservoir models. {lg_bullet}Development of a robust scheme for identifying reservoir regions that will result in a more robust parameterization of the history matching process. {lg_bullet}Testing commercial simulators for parallel capability and development of a parallel algorithm for history matching.
Pattern recognition and string matching
Cheng, Xiuzhen
2002-01-01
The research and development of pattern recognition have proven to be of importance in science, technology, and human activity. Many useful concepts and tools from different disciplines have been employed in pattern recognition. Among them is string matching, which receives much theoretical and practical attention. String matching is also an important topic in combinatorial optimization. This book is devoted to recent advances in pattern recognition and string matching. It consists of twenty eight chapters written by different authors, addressing a broad range of topics such as those from classifica tion, matching, mining, feature selection, and applications. Each chapter is self-contained, and presents either novel methodological approaches or applications of existing theories and techniques. The aim, intent, and motivation for publishing this book is to pro vide a reference tool for the increasing number of readers who depend upon pattern recognition or string matching in some way. This includes student...
Efficient line matching with homography
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.
A nonlinear oscillatory problem
International Nuclear Information System (INIS)
Zhou Qingqing.
1991-10-01
We have studied the nonlinear oscillatory problem of orthotropic cylindrical shell, we have analyzed the character of the oscillatory system. The stable condition of the oscillatory system has been given. (author). 6 refs
The match-to-match variation of match-running in elite female soccer.
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.
International Nuclear Information System (INIS)
Ishida, T.
1992-01-01
The research has been in four general areas: (1) correlation of isotope effects with molecular forces and molecular structures, (2) correlation of zero-point energy and its isotope effects with molecular structure and molecular forces, (3) vapor pressure isotope effects, and (4) fractionation of stable isotopes. 73 refs, 38 figs, 29 tabs
Interactive Stable Ray Tracing
DEFF Research Database (Denmark)
Dal Corso, Alessandro; Salvi, Marco; Kolb, Craig
2017-01-01
Interactive ray tracing applications running on commodity hardware can suffer from objectionable temporal artifacts due to a low sample count. We introduce stable ray tracing, a technique that improves temporal stability without the over-blurring and ghosting artifacts typical of temporal post-pr...
Kearney, M. Kate
2013-01-01
The concordance genus of a knot is the least genus of any knot in its concordance class. Although difficult to compute, it is a useful invariant that highlights the distinction between the three-genus and four-genus. In this paper we define and discuss the stable concordance genus of a knot, which describes the behavior of the concordance genus under connected sum.
Stable radiographic scanning agents
International Nuclear Information System (INIS)
1976-01-01
Stable compositions which are useful in the preparation of Technetium-99m-based scintigraphic agents are discussed. They are comprised of ascorbic acid or a pharmaceutically acceptable salt or ester thereof in combination with a pertechnetate reducing agent or dissolved in oxidized pertechnetate-99m (sup(99m)TcO 4 - ) solution
Some stable hydromagnetic equilibria
Energy Technology Data Exchange (ETDEWEB)
Johnson, J L; Oberman, C R; Kulsrud, R M; Frieman, E A [Project Matterhorn, Princeton University, Princeton, NJ (United States)
1958-07-01
We have been able to find and investigate the properties of equilibria which are hydromagnetically stable. These equilibria can be obtained, for example, by wrapping conductors helically around the stellarator tube. Systems with I = 3 or 4 are indicated to be optimum for stability purposes. In some cases an admixture of I = 2 fields can be advantageous for achieving equilibrium. (author)
Directory of Open Access Journals (Sweden)
Carlos del Rio Ferretti
2008-01-01
Full Text Available El presente estudio trata del deber de correlación de la sentencia penal y los problemas de su aplicación presentados en la jurisprudencia (y doctrina chilena. El tema es analizado fijando el supuesto técnico previo sobre el cual se construye dicho deber, como es la determinación del objeto del proceso a partir de un preciso concepto del hecho punible desde una perspectiva procesal. Es por ello que se analizan las posiciones teóricas y técnicas sobre el concepto del hecho, más apropiadas para responder a las complejas cuestiones comprendidas en el deber de correlación de la sentencia penal, destinadas a resolver los problemas de aplicación explicados en el estudio. Con ese propósito se analizan las teorías naturalistas y normativas del hecho y se intenta demostrar las repercusiones prácticas de sus respectivas aplicaciones.This research is about the matching duty of the criminal judgement and problems that come along with its application by the Chilean tribunals (and Literature. The topic is analyzed setting the technical support after which builds on that obligation, as in the definition of the subject of the criminal procedure from a precise concept of the punishable act from a procedural perspective. This is the reason why we study the technical and theoretical positions about the concept of «fact» more appropriate to understand the complex issue that involves the matching duty of the criminal judgement, to resolve the problems that come along with is application as we explain in this study. To this purpose we analyze naturalists and normatives theories about the concept of «fact» and intend proving the practical consequence wether you submit to one or another theory.
MATCHING IN INFORMAL FINANCIAL INSTITUTIONS.
Eeckhout, Jan; Munshi, Kaivan
2010-09-01
This paper analyzes an informal financial institution that brings heterogeneous agents together in groups. We analyze decentralized matching into these groups, and the equilibrium composition of participants that consequently arises. We find that participants sort remarkably well across the competing groups, and that they re-sort immediately following an unexpected exogenous regulatory change. These findings suggest that the competitive matching model might have applicability and bite in other settings where matching is an important equilibrium phenomenon. (JEL: O12, O17, G20, D40).
Third-Order Matching in the Polymorphic Lambda Calculus
Springintveld, J.
We show that it is decidable whether a third-order matching problem in the polymorphic lambda calculus has a solution. The proof is constructive in the sense that an algorithm can be extracted from it that, given such a problem, returns a substitution if it has a solution and fail otherwise.
Scientific assessments: Matching the process to the problem
CSIR Research Space (South Africa)
Scholes, RJ
2017-01-01
Full Text Available or estimation of the nature, quality, or ability of someone or something’ (Oxford English Dictionary 2016). Within technical domains, assessments could be defined as a critical evaluation of information, with the aim of guiding decisions on an issue... in complex assessments is for the knowledge- holder participants (authors and expert reviewers) to be unpaid volunteers. Only their out-of-pocket expenses are met, for travel and accommodation to author meetings. This has two advantages: It makes the use...
Scientific assessments: Matching the process to the problem
Directory of Open Access Journals (Sweden)
Robert J. Scholes
2017-03-01
Full Text Available Background: The science–policy interface process – known as a ‘scientific assessment’ – has risen to prominence in the past few decades. Complex assessments are appropriate for issues which are both technically complicated, multifaceted and of high societal interest. There is increasing interest from the research community that studies biological invasions to undertake such an assessment. Objectives: Providing the relevant background and context, the article describes key principles and steps for designing, planning, resourcing and executing such a process, as well as providing evidence of high-impact assessments enhancing scientific careers. Method: Experience from international and national assessments, most recently the South African scientific assessment for the Shale Gas Development in the Central Karoo, was used to develop this guiding generic template for practitioners. Analyses of researcher publication performances were undertaken to determine the benefit of being involved in assessments. Results: The key success factors for assessments mostly relate to adherence to ‘process’ and ‘governance’ aspects, for which scientists are sometimes ill-equipped. As regards publication outputs, authors involved in assessment processes demonstrated higher H-indices than their environmental scientist peers. We have suggested causal explanations for this. Conclusion: Effectively designed and managed assessments provide the platform for the ‘co-production of knowledge’ – an iterative and collaborative process involving scientists, stakeholders and policymakers. This increases scientific impact in the society–policy domain. While scientists seem concerned that effort directed towards assessments comes at the detriment of scientific credibility and productivity, we have presented data that suggest the opposite.
Probabilistic Analysis of Combinatorial Optimization Problems on Hypergraph Matchings
2012-02-01
cliques, !.G/ < k. Let B D f1; : : : ; kg be the index set of partites in G, V D S b2B Vb , and BS denote the set of partites that have a node in S : BS D...CS D [ b2BS CS;b; where BS D B n BS , and CS;b Vb is given by CS;b D [ s2S .Vb \\N.s//; with N.s/ being the set of nodes adjacent to node s. At the...to a partite Vb in G: Zt D [ b2B Zt;b; t D 1; : : : ; k: The sets Zt;b are represented by bitsets of size jVbj. Let Zt;b;i be the i -th bit in Zt;b
Probability matching and strategy availability.
Koehler, Derek J; James, Greta
2010-09-01
Findings from two experiments indicate that probability matching in sequential choice arises from an asymmetry in strategy availability: The matching strategy comes readily to mind, whereas a superior alternative strategy, maximizing, does not. First, compared with the minority who spontaneously engage in maximizing, the majority of participants endorse maximizing as superior to matching in a direct comparison when both strategies are described. Second, when the maximizing strategy is brought to their attention, more participants subsequently engage in maximizing. Third, matchers are more likely than maximizers to base decisions in other tasks on their initial intuitions, suggesting that they are more inclined to use a choice strategy that comes to mind quickly. These results indicate that a substantial subset of probability matchers are victims of "underthinking" rather than "overthinking": They fail to engage in sufficient deliberation to generate a superior alternative to the matching strategy that comes so readily to mind.
Computing solutions for matching games
Biró, Péter; Kern, Walter; Paulusma, Daniël
2012-01-01
A matching game is a cooperative game (N, v) defined on a graph G = (N, E) with an edge weighting w : E → R+. The player set is N and the value of a coalition S ⊆ N is defined as the maximum weight of a matching in the subgraph induced by S. First we present an O(nm+n2 log n) algorithm that tests if
Probability Matching, Fast and Slow
Koehler, Derek J.; James, Greta
2014-01-01
A prominent point of contention among researchers regarding the interpretation of probability-matching behavior is whether it represents a cognitively sophisticated, adaptive response to the inherent uncertainty of the tasks or settings in which it is observed, or whether instead it represents a fundamental shortcoming in the heuristics that support and guide human decision making. Put crudely, researchers disagree on whether probability matching is "smart" or "dumb." Here, we consider eviden...
International Nuclear Information System (INIS)
Tibari, Elghali; Taous, Fouad; Marah, Hamid
2014-01-01
This report presents results related to stable isotopes analysis carried out at the CNESTEN DASTE in Rabat (Morocco), on behalf of Senegal. These analyzes cover 127 samples. These results demonstrate that Oxygen-18 and Deuterium in water analysis were performed by infrared Laser spectroscopy using a LGR / DLT-100 with Autosampler. Also, the results are expressed in δ values (‰) relative to V-SMOW to ± 0.3 ‰ for oxygen-18 and ± 1 ‰ for deuterium.
Forensic Stable Isotope Biogeochemistry
Cerling, Thure E.; Barnette, Janet E.; Bowen, Gabriel J.; Chesson, Lesley A.; Ehleringer, James R.; Remien, Christopher H.; Shea, Patrick; Tipple, Brett J.; West, Jason B.
2016-06-01
Stable isotopes are being used for forensic science studies, with applications to both natural and manufactured products. In this review we discuss how scientific evidence can be used in the legal context and where the scientific progress of hypothesis revisions can be in tension with the legal expectations of widely used methods for measurements. Although this review is written in the context of US law, many of the considerations of scientific reproducibility and acceptance of relevant scientific data span other legal systems that might apply different legal principles and therefore reach different conclusions. Stable isotopes are used in legal situations for comparing samples for authenticity or evidentiary considerations, in understanding trade patterns of illegal materials, and in understanding the origins of unknown decedents. Isotope evidence is particularly useful when considered in the broad framework of physiochemical processes and in recognizing regional to global patterns found in many materials, including foods and food products, drugs, and humans. Stable isotopes considered in the larger spatial context add an important dimension to forensic science.
On Resolution Complexity of Matching Principles
DEFF Research Database (Denmark)
Dantchev, Stefan S.
proof system. The results in the thesis fall in this category. We study the Resolution complexity of some Matching Principles. The three major contributions of the thesis are as follows. Firstly, we develop a general technique of proving resolution lower bounds for the perfect matchingprinciples based...... Chessboard as well as for Tseitin tautologies based on rectangular grid graph. We reduce these problems to Tiling games, a concept introduced by us, which may be of interest on its own. Secondly, we find the exact Tree-Resolution complexity of the Weak Pigeon-Hole Principle. It is the most studied...
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.
2011-01-28
...; Computer Matching Program (SSA Internal Match)--Match Number 1014 AGENCY: Social Security Administration... regarding protections for such persons. The Privacy Act, as amended, regulates the use of computer matching....C. 552a, as amended, and the provisions of the Computer Matching and Privacy Protection Act of 1988...
Ontology-based composition and matching for dynamic service coordination
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...
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.
Effective anisotropy through traveltime and amplitude matching
Wang, Hui
2014-08-05
Introducing anisotropy to seismic wave propagation reveals more realistic physics of our Earth\\'s subsurface as compared to the isotropic assumption. However wavefield modeling, the engine of seismic inverse problems, in anisotropic media still suffers from computational burdens, in particular with complex anisotropy such as transversely isotropic (TI) and Orthorhombic anisotropy. We develop effective isotropic velocity and density models to package the effects of anisotropy such that the wave propagation behavior using these effective models approximate those of the original anisotropic model. We build these effective models through the high frequency asymptotic approximation based on the eikonal and transport equations. We match the geometrical behavior of the wave-fields, given by traveltimes, from the anisotropic and isotropic eikonal equations. This matching yields the effective isotropic velocity that approximates the kinematics of the anisotropic wavefield. Equivalently, we calculate the effective densities by equating the anisotropic and isotropic transport equations. The effective velocities and densities are then fed into the isotropic acoustic variable density wave equation to obtain cheaper anisotropic wavefields. We justify our approach by testing it on an elliptical anisotropic model. The numerical results demonstrate a good matching of both traveltime and amplitude between anisotropic and effective isotropic wavefields.
Topics in combinatorial pattern matching
DEFF Research Database (Denmark)
Vildhøj, Hjalte Wedel
Problem. Given m documents of total length n, we consider the problem of finding a longest string common to at least d ≥ 2 of the documents. This problem is known as the longest common substring (LCS) problem and has a classic O(n) space and O(n) time solution (Weiner [FOCS’73], Hui [CPM’92]). However...
Matching faces with emotional expressions
Directory of Open Access Journals (Sweden)
Wenfeng eChen
2011-08-01
Full Text Available There is some evidence that faces with a happy expression are recognized better than faces with other expressions. However, little is known about whether this happy face advantage also applies to perceptual face matching, and whether similar differences exist among other expressions. Using a sequential matching paradigm, we systematically compared the effects of seven basic facial expressions on identity recognition. Identity matching was quickest when a pair of faces had an identical happy/sad/neutral expression, poorer when they had a fearful/surprise/angry expression, and poorest when they had a disgust expression. Faces with a happy/sad/fear/surprise expression were matched faster than those with an anger/disgust expression when the second face in a pair had a neutral expression. These results demonstrate that effects of facial expression on identity recognition are not limited to happy faces when a learned face is immediately tested. The results suggest different influences of expression in perceptual matching and long-term recognition memory.
Fysh, Matthew C; Bindemann, Markus
2018-05-01
This study presents the Kent Face Matching Test (KFMT), which comprises 200 same-identity and 20 different-identity pairs of unfamiliar faces. Each face pair consists of a photograph from a student ID card and a high-quality portrait that was taken at least three months later. The test is designed to complement existing resources for face-matching research, by providing a more ecologically valid stimulus set that captures the natural variability that can arise in a person's appearance over time. Two experiments are presented to demonstrate that the KFMT provides a challenging measure of face matching but correlates with established tests. Experiment 1 compares a short version of this test with the optimized Glasgow Face Matching Test (GFMT). In Experiment 2, a longer version of the KFMT, with infrequent identity mismatches, is correlated with performance on the Cambridge Face Memory Test (CFMT) and the Cambridge Face Perception Test (CFPT). The KFMT is freely available for use in face-matching research. © 2017 The British Psychological Society.
Unconditionally stable microwave Si-IMPATT amplifiers
International Nuclear Information System (INIS)
Seddik, M.M.
1986-07-01
The purpose of this investigation has been the development of an improved understanding of the design and analysis of microwave reflection amplifiers employing the negative resistance property of the IMPATT devices. Unconditionally stable amplifier circuit using a Silicon IMPATT diode is designed. The problems associated with the design procedures and the stability criterion are discussed. A computer program is developed to perform the computations. The stable characteristics of a reflection-type Si-IMPATT amplifier, such as gain, frequency and bandwidth are examined. It was found that at large signal drive levels, 7 dB gain with bandwidth of 800 MHz at 22,5 mA was obtained. (author)
A Phase Matching, Adiabatic Accelerator
Energy Technology Data Exchange (ETDEWEB)
Lemery, Francois [Hamburg U.; Flöttmann, Klaus [DESY; Kärtner, Franz [CFEL, Hamburg; Piot, Philippe [Northern Illinois U.
2017-05-01
Tabletop accelerators are a thing of the future. Reducing their size will require scaling down electromagnetic wavelengths; however, without correspondingly high field gradients, particles will be more susceptible to phase-slippage – especially at low energy. We investigate how an adiabatically-tapered dielectric-lined waveguide could maintain phase-matching between the accelerating mode and electron bunch. We benchmark our simple model with CST and implement it into ASTRA; finally we provide a first glimpse into the beam dynamics in a phase-matching accelerator.
Peng, Yifan
2017-11-22
Computational caustics and light steering displays offer a wide range of interesting applications, ranging from art works and architectural installations to energy efficient HDR projection. In this work we expand on this concept by encoding several target images into pairs of front and rear phase-distorting surfaces. Different target holograms can be decoded by mixing and matching different front and rear surfaces under specific geometric alignments. Our approach, which we call mix-and-match holography, is made possible by moving from a refractive caustic image formation process to a diffractive, holographic one. This provides the extra bandwidth that is required to multiplex several images into pairing surfaces.
Robust Matching Pursuit Extreme Learning Machines
Directory of Open Access Journals (Sweden)
Zejian Yuan
2018-01-01
Full Text Available Extreme learning machine (ELM is a popular learning algorithm for single hidden layer feedforward networks (SLFNs. It was originally proposed with the inspiration from biological learning and has attracted massive attentions due to its adaptability to various tasks with a fast learning ability and efficient computation cost. As an effective sparse representation method, orthogonal matching pursuit (OMP method can be embedded into ELM to overcome the singularity problem and improve the stability. Usually OMP recovers a sparse vector by minimizing a least squares (LS loss, which is efficient for Gaussian distributed data, but may suffer performance deterioration in presence of non-Gaussian data. To address this problem, a robust matching pursuit method based on a novel kernel risk-sensitive loss (in short KRSLMP is first proposed in this paper. The KRSLMP is then applied to ELM to solve the sparse output weight vector, and the new method named the KRSLMP-ELM is developed for SLFN learning. Experimental results on synthetic and real-world data sets confirm the effectiveness and superiority of the proposed method.
Stable isotope analysis in primatology: a critical review.
Sandberg, Paul A; Loudon, James E; Sponheimer, Matt
2012-11-01
Stable isotope analysis has become an important tool in ecology over the last 25 years. A wealth of ecological information is stored in animal tissues in the relative abundances of the stable isotopes of several elements, particularly carbon and nitrogen, because these isotopes navigate through ecological processes in predictable ways. Stable carbon and nitrogen isotopes have been measured in most primate taxonomic groups and have yielded information about dietary content, dietary variability, and habitat use. Stable isotopes have recently proven useful for addressing more fine-grained questions about niche dynamics and anthropogenic effects on feeding ecology. Here, we discuss stable carbon and nitrogen isotope systematics and critically review the published stable carbon and nitrogen isotope data for modern primates with a focus on the problems and prospects for future stable isotope applications in primatology. © 2012 Wiley Periodicals, Inc.
Attention to internal face features in unfamiliar face matching.
Fletcher, Kingsley I; Butavicius, Marcus A; Lee, Michael D
2008-08-01
Accurate matching of unfamiliar faces is vital in security and forensic applications, yet previous research has suggested that humans often perform poorly when matching unfamiliar faces. Hairstyle and facial hair can strongly influence unfamiliar face matching but are potentially unreliable cues. This study investigated whether increased attention to the more stable internal face features of eyes, nose, and mouth was associated with more accurate face-matching performance. Forty-three first-year psychology students decided whether two simultaneously presented faces were of the same person or not. The faces were displayed for either 2 or 6 seconds, and had either similar or dissimilar hairstyles. The level of attention to internal features was measured by the proportion of fixation time spent on the internal face features and the sensitivity of discrimination to changes in external feature similarity. Increased attention to internal features was associated with increased discrimination in the 2-second display-time condition, but no significant relationship was found in the 6-second condition. Individual differences in eye-movements were highly stable across the experimental conditions.
Canonical Skeletons for Shape Matching
Eede, M. van; Macrini, D.; Telea, A.; Sminchisescu, C.; Dickinson, S.
2006-01-01
Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for shape matching and object recognition. However, it is well known that skeletal structure can be unstable under minor boundary deformation, part articulation, and minor shape deformation (due to, for
Monetary Exchange with Multilateral Matching
DEFF Research Database (Denmark)
Julien, Benoît; Kennes, John; King, Ian
the results with Kiyotaki and Wright (1993), Trejos and Wright (1995), and Lagos and Wright (2005) respectively. We find that the multilateral matching setting generates very simple and intuitive equilibrium allocations that are similar to those in the other papers, but which have important differences...
Towards optimal packed string matching
DEFF Research Database (Denmark)
Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany
2014-01-01
-size string-matching instruction wssm is available in contemporary commodity processors. The other word-size maximum-suffix instruction wslm is only required during the pattern pre-processing. Benchmarks show that our solution can be efficiently implemented, unlike some prior theoretical packed string...
An Implementation of Bigraph Matching
DEFF Research Database (Denmark)
Glenstrup, Arne John; Damgaard, Troels Christoffer; Birkedal, Lars
We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model...
Directory of Open Access Journals (Sweden)
Pantelić Svetlana
2014-01-01
Full Text Available The Swedish Royal Academy awarded the 2012 Nobel Prize in Economics to Lloyd Shapley and Alvin Roth, for the theory of stable allocations and the practice of market design. These two American researchers worked independently from each other, combining basic theory and empirical investigations. Through their experiments and practical design they generated a flourishing field of research and improved the performance of many markets. Born in 1923 in Cambridge, Massachusetts, Shapley defended his doctoral thesis at Princeton University in 1953. For many years he worked at RAND, and for more than thirty years he was a professor at UCLA University. He published numerous scientific papers, either by himself or in cooperation with other economists.
Perturbed asymptotically linear problems
Bartolo, R.; Candela, A. M.; Salvatore, A.
2012-01-01
The aim of this paper is investigating the existence of solutions of some semilinear elliptic problems on open bounded domains when the nonlinearity is subcritical and asymptotically linear at infinity and there is a perturbation term which is just continuous. Also in the case when the problem has not a variational structure, suitable procedures and estimates allow us to prove that the number of distinct crtitical levels of the functional associated to the unperturbed problem is "stable" unde...
Holdener, Fred R.; Boyd, Robert D.
2000-01-01
The present invention is a bi-stable optical actuator device that is depowered in both stable positions. A bearing is used to transfer motion and smoothly transition from one state to another. The optical actuator device may be maintained in a stable position either by gravity or a restraining device.
On the tautology of the matching law in consumer behavior analysis.
Curry, Bruce; Foxall, Gordon R; Sigurdsson, Valdimar
2010-05-01
Matching analysis has often attracted the criticism that it is formally tautological and hence empirically unfalsifiable, a problem that particularly affects translational attempts to extend behavior analysis into new areas. An example is consumer behavior analysis where application of matching in natural settings requires the inference of ratio-based relationships between amount purchased and amount spent. This gives rise to the argument that matching is an artifact of the way in which the alleged independent and dependent variables are defined and measured. We argue that the amount matching law would be tautological only in extreme circumstances (those in which prices or quantities move strictly in proportion); this is because of the presence of an error term in the matching function which arises from aggregation, particularly aggregation over brands. Cost matching is a viable complement of amount matching which avoids this tautology but a complete explanation of consumer choice requires a viable measure of amount matching also. This necessitates a more general solution to the problem of tautology in matching. In general, the fact that there remain doubts about the functional form of the matching equation itself implies the absence of a tautology. In proposing a general solution to the problem of assumed tautology in matching, the paper notes the experiences of matching researchers in another translation field, sports behavior. Copyright (c) 2009 Elsevier B.V. All rights reserved.
Construction of basic match schedules for sports competitions by using graph theory
van Weert, Arjan; Schreuder, J.A.M.; Burke, Edmund; Carter, Michael
1997-01-01
Basic Match Schedules are important for constructing sports timetables. Firstly these schedules guarantee the fairness of the sports competitions and secondly they reduce the complexity of the problem. This paper presents an approach to the problem of finding Basic Match Schedules for sports
A Condition Number for Non-Rigid Shape Matching
Ovsjanikov, Maks
2011-08-01
© 2011 The Author(s). Despite the large amount of work devoted in recent years to the problem of non-rigid shape matching, practical methods that can successfully be used for arbitrary pairs of shapes remain elusive. In this paper, we study the hardness of the problem of shape matching, and introduce the notion of the shape condition number, which captures the intuition that some shapes are inherently more difficult to match against than others. In particular, we make a connection between the symmetry of a given shape and the stability of any method used to match it while optimizing a given distortion measure. We analyze two commonly used classes of methods in deformable shape matching, and show that the stability of both types of techniques can be captured by the appropriate notion of a condition number. We also provide a practical way to estimate the shape condition number and show how it can be used to guide the selection of landmark correspondences between shapes. Thus we shed some light on the reasons why general shape matching remains difficult and provide a way to detect and mitigate such difficulties in practice.
OBJECT-SPACE MULTI-IMAGE MATCHING OF MOBILE-MAPPING-SYSTEM IMAGE SEQUENCES
Directory of Open Access Journals (Sweden)
Y. C. Chen
2012-07-01
Full Text Available This paper proposes an object-space multi-image matching procedure of terrestrial MMS (Mobile Mapping System image sequences to determine the coordinates of an object point automatically and reliably. This image matching procedure can be applied to find conjugate points of MMS image sequences efficiently. Conventional area-based image matching methods are not reliable to deliver accurate matching results for this application due to image scale variations, viewing angle variations, and object occlusions. In order to deal with these three matching problems, an object space multi-image matching is proposed. A modified NCC (Normalized Cross Correlation coefficient is proposed to measure the similarity of image patches. A modified multi-window matching procedure will also be introduced to solve the problem of object occlusion. A coarse-to-fine procedure with a combination of object-space multi-image matching and multi-window matching is adopted. The proposed procedure has been implemented for the purpose of matching terrestrial MMS image sequences. The ratio of correct matches of this experiment was about 80 %. By providing an approximate conjugate point in an overlapping image manually, most of the incorrect matches could be fixed properly and the ratio of correct matches was improved up to 98 %.
2013-12-05
... 1974: CMS Computer Matching Program Match No. 2013-01; HHS Computer Matching Program Match No. 1312 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS... Privacy Act of 1974 (5 U.S.C. 552a), as amended, this notice announces the renewal of a CMP that CMS plans...
LiDAR Scan Matching Aided Inertial Navigation System in GNSS-Denied Environments.
Tang, Jian; Chen, Yuwei; Niu, Xiaoji; Wang, Li; Chen, Liang; Liu, Jingbin; Shi, Chuang; Hyyppä, Juha
2015-07-10
A new scan that matches an aided Inertial Navigation System (INS) with a low-cost LiDAR is proposed as an alternative to GNSS-based navigation systems in GNSS-degraded or -denied environments such as indoor areas, dense forests, or urban canyons. In these areas, INS-based Dead Reckoning (DR) and Simultaneous Localization and Mapping (SLAM) technologies are normally used to estimate positions as separate tools. However, there are critical implementation problems with each standalone system. The drift errors of velocity, position, and heading angles in an INS will accumulate over time, and on-line calibration is a must for sustaining positioning accuracy. SLAM performance is poor in featureless environments where the matching errors can significantly increase. Each standalone positioning method cannot offer a sustainable navigation solution with acceptable accuracy. This paper integrates two complementary technologies-INS and LiDAR SLAM-into one navigation frame with a loosely coupled Extended Kalman Filter (EKF) to use the advantages and overcome the drawbacks of each system to establish a stable long-term navigation process. Static and dynamic field tests were carried out with a self-developed Unmanned Ground Vehicle (UGV) platform-NAVIS. The results prove that the proposed approach can provide positioning accuracy at the centimetre level for long-term operations, even in a featureless indoor environment.
LiDAR Scan Matching Aided Inertial Navigation System in GNSS-Denied Environments
Directory of Open Access Journals (Sweden)
Jian Tang
2015-07-01
Full Text Available A new scan that matches an aided Inertial Navigation System (INS with a low-cost LiDAR is proposed as an alternative to GNSS-based navigation systems in GNSS-degraded or -denied environments such as indoor areas, dense forests, or urban canyons. In these areas, INS-based Dead Reckoning (DR and Simultaneous Localization and Mapping (SLAM technologies are normally used to estimate positions as separate tools. However, there are critical implementation problems with each standalone system. The drift errors of velocity, position, and heading angles in an INS will accumulate over time, and on-line calibration is a must for sustaining positioning accuracy. SLAM performance is poor in featureless environments where the matching errors can significantly increase. Each standalone positioning method cannot offer a sustainable navigation solution with acceptable accuracy. This paper integrates two complementary technologies—INS and LiDAR SLAM—into one navigation frame with a loosely coupled Extended Kalman Filter (EKF to use the advantages and overcome the drawbacks of each system to establish a stable long-term navigation process. Static and dynamic field tests were carried out with a self-developed Unmanned Ground Vehicle (UGV platform—NAVIS. The results prove that the proposed approach can provide positioning accuracy at the centimetre level for long-term operations, even in a featureless indoor environment.
Template matching for auditing hospital cost and quality.
Silber, Jeffrey H; Rosenbaum, Paul R; Ross, Richard N; Ludwig, Justin M; Wang, Wei; Niknam, Bijan A; Mukherjee, Nabanita; Saynisch, Philip A; Even-Shoshan, Orit; Kelz, Rachel R; Fleisher, Lee A
2014-10-01
Develop an improved method for auditing hospital cost and quality. Medicare claims in general, gynecologic and urologic surgery, and orthopedics from Illinois, Texas, and New York between 2004 and 2006. A template of 300 representative patients was constructed and then used to match 300 patients at hospitals that had a minimum of 500 patients over a 3-year study period. From each of 217 hospitals we chose 300 patients most resembling the template using multivariate matching. The matching algorithm found close matches on procedures and patient characteristics, far more balanced than measured covariates would be in a randomized clinical trial. These matched samples displayed little to no differences across hospitals in common patient characteristics yet found large and statistically significant hospital variation in mortality, complications, failure-to-rescue, readmissions, length of stay, ICU days, cost, and surgical procedure length. Similar patients at different hospitals had substantially different outcomes. The template-matched sample can produce fair, directly standardized audits that evaluate hospitals on patients with similar characteristics, thereby making benchmarking more believable. Through examining matched samples of individual patients, administrators can better detect poor performance at their hospitals and better understand why these problems are occurring. © Health Research and Educational Trust.
Steelmaking-Casting of Molten Steel by Decarburization Ladle Matching
Directory of Open Access Journals (Sweden)
Wei Liu
2018-01-01
Full Text Available Steelmaking–continuous casting is a complex process. The method of selecting a ladle, which also functions as a storage device, follows a specific process of the production plan. In ladle matching, several ladle attributes are considered. However, matching objectives are difficult to achieve simultaneously. Different molten steel properties have contributed to the complexity of matching constraints, and, thus, matching optimization is regarded a multiconflict goal problem. In the process of optimization, the first-order rule learning method is first used to extract key ladle attributes (performance indicators, including highest temperature, usage frequency, lowest-level material, and outlet. On the basis of a number of indicators, such as ladle temperature, quantity, material, and usage frequency, as well as skateboard quantity, the ladle matching model is established. Second, the rule of ladle selection is determined by the method of least-generalization rule learning. Third, a simulation experiment is carried out according to various scheduling order strategies and matching priority combinations. Finally, the heuristic ladle matching method based on the rule priority (RP is determined for possible industrial applications. Results show that the accuracy of ladle selection can be improved. In particular, the numbers of ladles and maintenance times are reduced. Consequently, furnace production efficiency is also enhanced.
University Reactor Matching Grants Program
International Nuclear Information System (INIS)
John Valentine; Farzad Rahnema; Said Abdel-Khalik
2003-01-01
During the 2002 Fiscal year, funds from the DOE matching grant program, along with matching funds from the industrial sponsors, have been used to support research in the area of thermal-hydraulics. Both experimental and numerical research projects have been performed. Experimental research focused on two areas: (1) Identification of the root cause mechanism for axial offset anomaly in pressurized water reactors under prototypical reactor conditions, and (2) Fluid dynamic aspects of thin liquid film protection schemes for inertial fusion reactor chambers. Numerical research focused on two areas: (1) Multi-fluid modeling of both two-phase and two-component flows for steam conditioning and mist cooling applications, and (2) Modeling of bounded Rayleigh-Taylor instability with interfacial mass transfer and fluid injection through a porous wall simulating the ''wetted wall'' protection scheme in inertial fusion reactor chambers. Details of activities in these areas are given
PATTERN CLASSIFICATION APPROACHES TO MATCHING BUILDING POLYGONS AT MULTIPLE SCALES
Directory of Open Access Journals (Sweden)
X. Zhang
2012-07-01
Full Text Available Matching of building polygons with different levels of detail is crucial in the maintenance and quality assessment of multi-representation databases. Two general problems need to be addressed in the matching process: (1 Which criteria are suitable? (2 How to effectively combine different criteria to make decisions? This paper mainly focuses on the second issue and views data matching as a supervised pattern classification. Several classifiers (i.e. decision trees, Naive Bayes and support vector machines are evaluated for the matching task. Four criteria (i.e. position, size, shape and orientation are used to extract information for these classifiers. Evidence shows that these classifiers outperformed the weighted average approach.
International Nuclear Information System (INIS)
Lobo, Francisco S N
2006-01-01
The gravastar picture is an alternative model to the concept of a black hole, where there is an effective phase transition at or near where the event horizon is expected to form, and the interior is replaced by a de Sitter condensate. In this work a generalization of the gravastar picture is explored by considering matching of an interior solution governed by the dark energy equation of state, ω ≡ p/ρ < -1/3, to an exterior Schwarzschild vacuum solution at a junction interface. The motivation for implementing this generalization arises from the fact that recent observations have confirmed an accelerated cosmic expansion, for which dark energy is a possible candidate. Several relativistic dark energy stellar configurations are analysed by imposing specific choices for the mass function. The first case considered is that of a constant energy density, and the second choice that of a monotonic decreasing energy density in the star's interior. The dynamical stability of the transition layer of these dark energy stars to linearized spherically symmetric radial perturbations about static equilibrium solutions is also explored. It is found that large stability regions exist that are sufficiently close to where the event horizon is expected to form, so that it would be difficult to distinguish the exterior geometry of the dark energy stars, analysed in this work, from an astrophysical black hole
Peng, Yifan; Dun, Xiong; Sun, Qilin; Heidrich, Wolfgang
2017-01-01
target images into pairs of front and rear phase-distorting surfaces. Different target holograms can be decoded by mixing and matching different front and rear surfaces under specific geometric alignments. Our approach, which we call mixWe derive a detailed image formation model for the setting of holographic projection displays, as well as a multiplexing method based on a combination of phase retrieval methods and complex matrix factorization. We demonstrate several application scenarios in both simulation and physical prototypes.
Impedance-matched Marx generators
Directory of Open Access Journals (Sweden)
W. A. Stygar
2017-04-01
Full Text Available We have conceived a new class of prime-power sources for pulsed-power accelerators: impedance-matched Marx generators (IMGs. The fundamental building block of an IMG is a brick, which consists of two capacitors connected electrically in series with a single switch. An IMG comprises a single stage or several stages distributed axially and connected in series. Each stage is powered by a single brick or several bricks distributed azimuthally within the stage and connected in parallel. The stages of a multistage IMG drive an impedance-matched coaxial transmission line with a conical center conductor. When the stages are triggered sequentially to launch a coherent traveling wave along the coaxial line, the IMG achieves electromagnetic-power amplification by triggered emission of radiation. Hence a multistage IMG is a pulsed-power analogue of a laser. To illustrate the IMG approach to prime power, we have developed conceptual designs of two ten-stage IMGs with LC time constants on the order of 100 ns. One design includes 20 bricks per stage, and delivers a peak electrical power of 1.05 TW to a matched-impedance 1.22-Ω load. The design generates 113 kV per stage and has a maximum energy efficiency of 89%. The other design includes a single brick per stage, delivers 68 GW to a matched-impedance 19-Ω load, generates 113 kV per stage, and has a maximum energy efficiency of 90%. For a given electrical-power-output time history, an IMG is less expensive and slightly more efficient than a linear transformer driver, since an IMG does not use ferromagnetic cores.
Impedance-matched Marx generators
Stygar, W. A.; LeChien, K. R.; Mazarakis, M. G.; Savage, M. E.; Stoltzfus, B. S.; Austin, K. N.; Breden, E. W.; Cuneo, M. E.; Hutsel, B. T.; Lewis, S. A.; McKee, G. R.; Moore, J. K.; Mulville, T. D.; Muron, D. J.; Reisman, D. B.; Sceiford, M. E.; Wisher, M. L.
2017-04-01
We have conceived a new class of prime-power sources for pulsed-power accelerators: impedance-matched Marx generators (IMGs). The fundamental building block of an IMG is a brick, which consists of two capacitors connected electrically in series with a single switch. An IMG comprises a single stage or several stages distributed axially and connected in series. Each stage is powered by a single brick or several bricks distributed azimuthally within the stage and connected in parallel. The stages of a multistage IMG drive an impedance-matched coaxial transmission line with a conical center conductor. When the stages are triggered sequentially to launch a coherent traveling wave along the coaxial line, the IMG achieves electromagnetic-power amplification by triggered emission of radiation. Hence a multistage IMG is a pulsed-power analogue of a laser. To illustrate the IMG approach to prime power, we have developed conceptual designs of two ten-stage IMGs with L C time constants on the order of 100 ns. One design includes 20 bricks per stage, and delivers a peak electrical power of 1.05 TW to a matched-impedance 1.22 -Ω load. The design generates 113 kV per stage and has a maximum energy efficiency of 89%. The other design includes a single brick per stage, delivers 68 GW to a matched-impedance 19 -Ω load, generates 113 kV per stage, and has a maximum energy efficiency of 90%. For a given electrical-power-output time history, an IMG is less expensive and slightly more efficient than a linear transformer driver, since an IMG does not use ferromagnetic cores.
International Nuclear Information System (INIS)
Izmajlov, G.N.; Nikolaev, F.A.; Ozolin, V.V.; Grigor'yants, V.V.; Chamorovskij, Yu.K.
1989-01-01
The problem of construction the long-base Michelson interferometer for gravitational wave detection is discussed. Possible sources of noise and instability are considered. It is shown that evacuation of fiber interferometer, the winding of its arms on the glass ceramic bases, stabilization of radiation source frequency and seismic isolation of the base allow one to reduce its instability to the level, typical of mirror interferometer with the comparable optical base. 10 refs.; 2 figs
Transit Matching for International Safeguards
International Nuclear Information System (INIS)
Gilligan, K.; Whitaker, M.; Oakberg, J.
2015-01-01
In 2013 the U.S. Department of Energy / National Nuclear Security Administration Office of Non-proliferation and International Security (NIS) supported a study of the International Atomic Energy Agency's (IAEA) processes and procedures for ensuring that shipments of nuclear material correspond to (match) their receipts (i.e., transit matching). Under Comprehensive Safeguards Agreements, Member States are obliged to declare such information within certain time frames. Nuclear weapons states voluntarily declare such information under INFCIRC/207. This study was funded by the NIS Next Generation Safeguards Initiative (NGSI) Concepts and Approaches program. Oak Ridge National Laboratory led the research, which included collaboration with the U.S. Nuclear Regulatory Commission, the U.S. Nuclear Material Management and Safeguards System (NMMSS), and the IAEA Section for Declared Information Analysis within the Department of Safeguards. The project studied the current transit matching methodologies, identified current challenges (e.g., level of effort and timeliness), and suggested improvements. This paper presents the recommendations that resulted from the study and discussions with IAEA staff. In particular, it includes a recommendation to collaboratively develop a set of best reporting practices for nuclear weapons states under INFCIRC/207. (author)
A Modified AH-FDTD Unconditionally Stable Method Based on High-Order Algorithm
Directory of Open Access Journals (Sweden)
Zheng Pan
2017-01-01
Full Text Available The unconditionally stable method, Associated-Hermite FDTD, has attracted more and more attentions in computational electromagnetic for its time-frequency compact property. Because of the fewer orders of AH basis needed in signal reconstruction, the computational efficiency can be improved further. In order to further improve the accuracy of the traditional AH-FDTD, a high-order algorithm is introduced. Using this method, the dispersion error induced by the space grid can be reduced, which makes it possible to set coarser grid. The simulation results show that, on the condition of coarse grid, the waveforms obtained from the proposed method are matched well with the analytic result, and the accuracy of the proposed method is higher than the traditional AH-FDTD. And the efficiency of the proposed method is higher than the traditional FDTD method in analysing 2D waveguide problems with fine-structure.
Learning Expressive Linkage Rules for Entity Matching using Genetic Programming
Isele, Robert
2013-01-01
A central problem in data integration and data cleansing is to identify pairs of entities in data sets that describe the same real-world object. Many existing methods for matching entities rely on explicit linkage rules, which specify how two entities are compared for equivalence. Unfortunately, writing accurate linkage rules by hand is a non-trivial problem that requires detailed knowledge of the involved data sets. Another important issue is the efficient execution of link...
Most Recent Match Queries in On-Line Suffix Trees
DEFF Research Database (Denmark)
Larsson, N. Jesper
2014-01-01
A suffix tree is able to efficiently locate a pattern in an indexed string, but not in general the most recent copy of the pattern in an online stream, which is desirable in some applications. We study the most general version of the problem of locating a most recent match: supporting queries...
History Matching with Geostatistical Prior: A Smooth Formulation
DEFF Research Database (Denmark)
Melnikova, Yulia; Lange, Katrine; Zunino, Andrea
2014-01-01
We present a new method for solving the history matching problem by gradient-based optimization within a probabilistic framework. The focus is on minimizing the number of forward simulations and conserving geological realism of the solutions. Geological a priori information is taken into account...
A string matching based algorithm for performance evaluation of ...
Indian Academy of Sciences (India)
In this paper, we have addressed the problem of automated performance evaluation of Mathematical Expression (ME) recognition. Automated evaluation requires that recognition output and ground truth in some editable format like LaTeX, MathML, etc. have to be matched. But standard forms can have extraneous symbols ...
A probabilistic evaluation procedure for process model matching techniques
Kuss, Elena; Leopold, Henrik; van der Aa, Han; Stuckenschmidt, Heiner; Reijers, Hajo A.
2018-01-01
Process model matching refers to the automatic identification of corresponding activities between two process models. It represents the basis for many advanced process model analysis techniques such as the identification of similar process parts or process model search. A central problem is how to
Image Segmentation, Registration, Compression, and Matching
Yadegar, Jacob; Wei, Hai; Yadegar, Joseph; Ray, Nilanjan; Zabuawala, Sakina
2011-01-01
A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity
Wave driven magnetic reconnection in the Taylor problem
International Nuclear Information System (INIS)
Fitzpatrick, Richard; Bhattacharjee, Amitava; Ma Zhiwei; Linde, Timur
2003-01-01
An improved Laplace transform theory is developed in order to investigate the initial response of a stable slab plasma equilibrium enclosed by conducting walls to a suddenly applied wall perturbation in the so-called Taylor problem. The novel feature of this theory is that it does not employ asymptotic matching. If the wall perturbation is switched on slowly compared to the Alfven time then the plasma response eventually asymptotes to that predicted by conventional asymptotic matching theory. However, at early times there is a compressible Alfven wave driven contribution to the magnetic reconnection rate which is not captured by asymptotic matching theory, and leads to a significant increase in the reconnection rate. If the wall perturbation is switched on rapidly compared to the Alfven time then strongly localized compressible Alfven wave-pulses are generated which bounce backward and forward between the walls many times. Each instance these wave-pulses cross the resonant surface they generate a transient surge in the reconnection rate. The maximum pulse driven reconnection rate can be much larger than that predicted by conventional asymptotic matching theory
Wide baseline stereo matching based on double topological relationship consistency
Zou, Xiaohong; Liu, Bin; Song, Xiaoxue; Liu, Yang
2009-07-01
Stereo matching is one of the most important branches in computer vision. In this paper, an algorithm is proposed for wide-baseline stereo vision matching. Here, a novel scheme is presented called double topological relationship consistency (DCTR). The combination of double topological configuration includes the consistency of first topological relationship (CFTR) and the consistency of second topological relationship (CSTR). It not only sets up a more advanced model on matching, but discards mismatches by iteratively computing the fitness of the feature matches and overcomes many problems of traditional methods depending on the powerful invariance to changes in the scale, rotation or illumination across large view changes and even occlusions. Experimental examples are shown where the two cameras have been located in very different orientations. Also, epipolar geometry can be recovered using RANSAC by far the most widely method adopted possibly. By the method, we can obtain correspondences with high precision on wide baseline matching problems. Finally, the effectiveness and reliability of this method are demonstrated in wide-baseline experiments on the image pairs.
BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks
Hamza, Doha R.
2017-01-26
We consider a two-sided one-to-one abstract matching problem with a defined notion of pairwise stability. The formulated problem is shown to encompass the ordinal and cardinal utility markets. We propose a distributed blind matching algorithm (BLMA) to solve the problem. BLMA is characterized by random activations of agents, and by generic negotiation and aspiration (utility) update processes. We prove the solution produced by BLMA will converge to an
BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks
Hamza, Doha R.; Shamma, Jeff S.
2017-01-01
We consider a two-sided one-to-one abstract matching problem with a defined notion of pairwise stability. The formulated problem is shown to encompass the ordinal and cardinal utility markets. We propose a distributed blind matching algorithm (BLMA) to solve the problem. BLMA is characterized by random activations of agents, and by generic negotiation and aspiration (utility) update processes. We prove the solution produced by BLMA will converge to an
Geomagnetic matching navigation algorithm based on robust estimation
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.
York, Valerie K; Brannon, Laura A; Miller, Megan M
2012-01-01
This study addressed the serious problem of college student binge drinking by identifying factors that improve the effectiveness of messages encouraging responsible drinking presented through a website simulation. We tested schema matching (i.e., whether the message matches the person's self-schema type or not) and two types of context matching (i.e., whether the message matches the topic or values of the message context) to determine their relative influence on the effectiveness of the message. We expected that messages matched to any of these factors would be more effective than messages not matched. Schema matching reduced intentions to drink while staying in/home, but topic matching reduced intentions to drink when going out, suggesting that different factors are important for messages targeting drinking behavior in different locations. Significant interactions between topic matching and value matching on message evaluation variables indicated that the message should not match the message context too closely. That is, there appears to be a matching threshold: Increasing the number of factors the message matches does not increase message effectiveness, possibly because it makes the message too redundant with the surrounding content.
An adaptive clustering algorithm for image matching based on corner feature
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.
Stable isotope research pool inventory
International Nuclear Information System (INIS)
1980-12-01
This report contains a listing of electromagnetically separated stable isotopes which are available for distribution within the United States for non-destructive research use from the Oak Ridge National Laboratory on a loan basis. This inventory includes all samples of stable isotopes in the Materials Research Collection and does not designate whether a sample is out on loan or in reprocessing
On the use of INS to improve Feature Matching
Masiero, A.; Guarnieri, A.; Vettore, A.; Pirotti, F.
2014-11-01
The continuous technological improvement of mobile devices opens the frontiers of Mobile Mapping systems to very compact systems, i.e. a smartphone or a tablet. This motivates the development of efficient 3D reconstruction techniques based on the sensors typically embedded in such devices, i.e. imaging sensors, GPS and Inertial Navigation System (INS). Such methods usually exploits photogrammetry techniques (structure from motion) to provide an estimation of the geometry of the scene. Actually, 3D reconstruction techniques (e.g. structure from motion) rely on use of features properly matched in different images to compute the 3D positions of objects by means of triangulation. Hence, correct feature matching is of fundamental importance to ensure good quality 3D reconstructions. Matching methods are based on the appearance of features, that can change as a consequence of variations of camera position and orientation, and environment illumination. For this reason, several methods have been developed in recent years in order to provide feature descriptors robust (ideally invariant) to such variations, e.g. Scale-Invariant Feature Transform (SIFT), Affine SIFT, Hessian affine and Harris affine detectors, Maximally Stable Extremal Regions (MSER). This work deals with the integration of information provided by the INS in the feature matching procedure: a previously developed navigation algorithm is used to constantly estimate the device position and orientation. Then, such information is exploited to estimate the transformation of feature regions between two camera views. This allows to compare regions from different images but associated to the same feature as seen by the same point of view, hence significantly easing the comparison of feature characteristics and, consequently, improving matching. SIFT-like descriptors are used in order to ensure good matching results in presence of illumination variations and to compensate the approximations related to the estimation
Obstacle detection by stereo vision of fast correlation matching
International Nuclear Information System (INIS)
Jeon, Seung Hoon; Kim, Byung Kook
1997-01-01
Mobile robot navigation needs acquiring positions of obstacles in real time. A common method for performing this sensing is through stereo vision. In this paper, indoor images are acquired by binocular vision, which contains various shapes of obstacles. From these stereo image data, in order to obtain distances to obstacles, we must deal with the correspondence problem, or get the region in the other image corresponding to the projection of the same surface region. We present an improved correlation matching method enhancing the speed of arbitrary obstacle detection. The results are faster, simple matching, robustness to noise, and improvement of precision. Experimental results under actual surroundings are presented to reveal the performance. (author)
Shadow Areas Robust Matching Among Image Sequence in Planetary Landing
Ruoyan, Wei; Xiaogang, Ruan; Naigong, Yu; Xiaoqing, Zhu; Jia, Lin
2017-01-01
In this paper, an approach for robust matching shadow areas in autonomous visual navigation and planetary landing is proposed. The approach begins with detecting shadow areas, which are extracted by Maximally Stable Extremal Regions (MSER). Then, an affine normalization algorithm is applied to normalize the areas. Thirdly, a descriptor called Multiple Angles-SIFT (MA-SIFT) that coming from SIFT is proposed, the descriptor can extract more features of an area. Finally, for eliminating the influence of outliers, a method of improved RANSAC based on Skinner Operation Condition is proposed to extract inliers. At last, series of experiments are conducted to test the performance of the approach this paper proposed, the results show that the approach can maintain the matching accuracy at a high level even the differences among the images are obvious with no attitude measurements supplied.
Improved SURF Algorithm and Its Application in Seabed Relief Image Matching
Directory of Open Access Journals (Sweden)
Zhang Hong-Mei
2017-01-01
Full Text Available The matching based on seabed relief image is widely used in underwater relief matching navigation and target recognition, etc. However, being influenced by various factors, some conventional matching algorithms are difficult to obtain an ideal result in the matching of seabed relief image. SURF(Speeded Up Robust Features algorithm is based on feature points pair to achieve matching, and can get good results in the seabed relief image matching. However, in practical applications, the traditional SURF algorithm is easy to get false matching, especially when the area’s features are similar or not obvious, the problem is more seriously. In order to improve the robustness of the algorithm, this paper proposes an improved matching algorithm, which combines the SURF, and RANSAC (Random Sample Consensus algorithms. The new algorithm integrates the two algorithms advantages, firstly, the SURF algorithm is applied to detect and extract the feature points then to pre-match. Secondly, RANSAC algorithm is utilized to eliminate mismatching points, and then the accurate matching is accomplished with the correct matching points. The experimental results show that the improved algorithm overcomes the mismatching problem effectively and have better precision and faster speed than the traditional SURF algorithm.
Self-Similar Spin Images for Point Cloud Matching
Pulido, Daniel
The rapid growth of Light Detection And Ranging (Lidar) technologies that collect, process, and disseminate 3D point clouds have allowed for increasingly accurate spatial modeling and analysis of the real world. Lidar sensors can generate massive 3D point clouds of a collection area that provide highly detailed spatial and radiometric information. However, a Lidar collection can be expensive and time consuming. Simultaneously, the growth of crowdsourced Web 2.0 data (e.g., Flickr, OpenStreetMap) have provided researchers with a wealth of freely available data sources that cover a variety of geographic areas. Crowdsourced data can be of varying quality and density. In addition, since it is typically not collected as part of a dedicated experiment but rather volunteered, when and where the data is collected is arbitrary. The integration of these two sources of geoinformation can provide researchers the ability to generate products and derive intelligence that mitigate their respective disadvantages and combine their advantages. Therefore, this research will address the problem of fusing two point clouds from potentially different sources. Specifically, we will consider two problems: scale matching and feature matching. Scale matching consists of computing feature metrics of each point cloud and analyzing their distributions to determine scale differences. Feature matching consists of defining local descriptors that are invariant to common dataset distortions (e.g., rotation and translation). Additionally, after matching the point clouds they can be registered and processed further (e.g., change detection). The objective of this research is to develop novel methods to fuse and enhance two point clouds from potentially disparate sources (e.g., Lidar and crowdsourced Web 2.0 datasets). The scope of this research is to investigate both scale and feature matching between two point clouds. The specific focus of this research will be in developing a novel local descriptor
Small Vocabulary with Saliency Matching for Video Copy Detection
DEFF Research Database (Denmark)
Ren, Huamin; Moeslund, Thomas B.; Tang, Sheng
2013-01-01
The importance of copy detection has led to a substantial amount of research in recent years, among which Bag of visual Words (BoW) plays an important role due to its ability to effectively handling occlusion and some minor transformations. One crucial issue in BoW approaches is the size of vocab......The importance of copy detection has led to a substantial amount of research in recent years, among which Bag of visual Words (BoW) plays an important role due to its ability to effectively handling occlusion and some minor transformations. One crucial issue in BoW approaches is the size...... matching algorithm based on salient visual words selection. More specifically, the variation of visual words across a given video are represented as trajectories and those containing locally asymptotically stable points are selected as salient visual words. Then we attempt to measure the similarity of two...... videos through saliency matching merely based on the selected salient visual words to remove false positives. Our experiments show that a small codebook with saliency matching is quite competitive in video copy detection. With the incorporation of the proposed saliency matching, the precision can...
Estimation of Initial Position Using Line Segment Matching in Maps
Directory of Open Access Journals (Sweden)
Chongyang Wei
2016-06-01
Full Text Available While navigating in a typical traffic scene, with a drastic drift or sudden jump in its Global Positioning System (GPS position, the localization based on such an initial position is unable to extract precise overlapping data from the prior map in order to match the current data, thus rendering the localization as unfeasible. In this paper, we first propose a new method to estimate an initial position by matching the infrared reflectivity maps. The maps consist of a highly precise prior map, built with the offline simultaneous localization and mapping (SLAM technique, and a smooth current map, built with the integral over velocities. Considering the attributes of the maps, we first propose to exploit the stable, rich line segments to match the lidar maps. To evaluate the consistency of the candidate line pairs in both maps, we propose to adopt the local appearance, pairwise geometric attribute and structural likelihood to construct an affinity graph, as well as employ a spectral algorithm to solve the graph efficiently. The initial position is obtained according to the relationship between the vehicle's current position and matched lines. Experiments on the campus with a GPS error of dozens of metres show that our algorithm can provide an accurate initial value with average longitudinal and lateral errors being 1.68m and 1.04m, respectively.
WORKSHOP: Stable particle motion
International Nuclear Information System (INIS)
Ruggiero, Alessandro G.
1993-01-01
Full text: Particle beam stability is crucial to any accelerator or collider, particularly big ones, such as Brookhaven's RHIC heavy ion collider and the larger SSC and LHC proton collider schemes. A workshop on the Stability of Particle Motion in Storage Rings held at Brookhaven in October dealt with the important issue of determining the short- and long-term stability of single particle motion in hadron storage rings and colliders, and explored new methods for ensuring it. In the quest for realistic environments, the imperfections of superconducting magnets and the effects of field modulation and noise were taken into account. The workshop was divided into three study groups: Short-Term Stability in storage rings, including chromatic and geometric effects and correction strategies; Long-Term Stability, including modulation and random noise effects and slow varying effects; and Methods for determining the stability of particle motion. The first two were run in parallel, but the third was attended by everyone. Each group considered analytical, computational and experimental methods, reviewing work done so far, comparing results and approaches and underlining outstanding issues. By resolving conflicts, it was possible to identify problems of common interest. The workshop reaffirmed the validity of methods proposed several years ago. Major breakthroughs have been in the rapid improvement of computer capacity and speed, in the development of more sophisticated mathematical packages, and in the introduction of more powerful analytic approaches. In a typical storage ring, a particle may be required to circulate for about a billion revolutions. While ten years ago it was only possible to predict accurately stability over about a thousand revolutions, it is now possible to predict over as many as one million turns. If this trend continues, in ten years it could become feasible to predict particle stability over the entire storage period. About ninety participants
Robust matching for voice recognition
Higgins, Alan; Bahler, L.; Porter, J.; Blais, P.
1994-10-01
This paper describes an automated method of comparing a voice sample of an unknown individual with samples from known speakers in order to establish or verify the individual's identity. The method is based on a statistical pattern matching approach that employs a simple training procedure, requires no human intervention (transcription, work or phonetic marketing, etc.), and makes no assumptions regarding the expected form of the statistical distributions of the observations. The content of the speech material (vocabulary, grammar, etc.) is not assumed to be constrained in any way. An algorithm is described which incorporates frame pruning and channel equalization processes designed to achieve robust performance with reasonable computational resources. An experimental implementation demonstrating the feasibility of the concept is described.
Ontology Matching with Semantic Verification.
Jean-Mary, Yves R; Shironoshita, E Patrick; Kabuka, Mansur R
2009-09-01
ASMOV (Automated Semantic Matching of Ontologies with Verification) is a novel algorithm that uses lexical and structural characteristics of two ontologies to iteratively calculate a similarity measure between them, derives an alignment, and then verifies it to ensure that it does not contain semantic inconsistencies. In this paper, we describe the ASMOV algorithm, and then present experimental results that measure its accuracy using the OAEI 2008 tests, and that evaluate its use with two different thesauri: WordNet, and the Unified Medical Language System (UMLS). These results show the increased accuracy obtained by combining lexical, structural and extensional matchers with semantic verification, and demonstrate the advantage of using a domain-specific thesaurus for the alignment of specialized ontologies.
Hu, H.; Wu, B.
2017-07-01
The Narrow-Angle Camera (NAC) on board the Lunar Reconnaissance Orbiter (LRO) comprises of a pair of closely attached high-resolution push-broom sensors, in order to improve the swath coverage. However, the two image sensors do not share the same lenses and cannot be modelled geometrically using a single physical model. Thus, previous works on dense matching of stereo pairs of NAC images would generally create two to four stereo models, each with an irregular and overlapping region of varying size. Semi-Global Matching (SGM) is a well-known dense matching method and has been widely used for image-based 3D surface reconstruction. SGM is a global matching algorithm relying on global inference in a larger context rather than individual pixels to establish stable correspondences. The stereo configuration of LRO NAC images causes severe problem for image matching methods such as SGM, which emphasizes global matching strategy. Aiming at using SGM for image matching of LRO NAC stereo pairs for precision 3D surface reconstruction, this paper presents a coupled epipolar rectification methods for LRO NAC stereo images, which merges the image pair in the disparity space and in this way, only one stereo model will be estimated. For a stereo pair (four) of NAC images, the method starts with the boresight calibration by finding correspondence in the small overlapping stripe between each pair of NAC images and bundle adjustment of the stereo pair, in order to clean the vertical disparities. Then, the dominate direction of the images are estimated by project the center of the coverage area to the reference image and back-projected to the bounding box plane determined by the image orientation parameters iteratively. The dominate direction will determine an affine model, by which the pair of NAC images are warped onto the object space with a given ground resolution and in the meantime, a mask is produced indicating the owner of each pixel. SGM is then used to generate a disparity
Directory of Open Access Journals (Sweden)
H. Hu
2017-07-01
Full Text Available The Narrow-Angle Camera (NAC on board the Lunar Reconnaissance Orbiter (LRO comprises of a pair of closely attached high-resolution push-broom sensors, in order to improve the swath coverage. However, the two image sensors do not share the same lenses and cannot be modelled geometrically using a single physical model. Thus, previous works on dense matching of stereo pairs of NAC images would generally create two to four stereo models, each with an irregular and overlapping region of varying size. Semi-Global Matching (SGM is a well-known dense matching method and has been widely used for image-based 3D surface reconstruction. SGM is a global matching algorithm relying on global inference in a larger context rather than individual pixels to establish stable correspondences. The stereo configuration of LRO NAC images causes severe problem for image matching methods such as SGM, which emphasizes global matching strategy. Aiming at using SGM for image matching of LRO NAC stereo pairs for precision 3D surface reconstruction, this paper presents a coupled epipolar rectification methods for LRO NAC stereo images, which merges the image pair in the disparity space and in this way, only one stereo model will be estimated. For a stereo pair (four of NAC images, the method starts with the boresight calibration by finding correspondence in the small overlapping stripe between each pair of NAC images and bundle adjustment of the stereo pair, in order to clean the vertical disparities. Then, the dominate direction of the images are estimated by project the center of the coverage area to the reference image and back-projected to the bounding box plane determined by the image orientation parameters iteratively. The dominate direction will determine an affine model, by which the pair of NAC images are warped onto the object space with a given ground resolution and in the meantime, a mask is produced indicating the owner of each pixel. SGM is then used to
A straightness error measurement method matched new generation GPS
International Nuclear Information System (INIS)
Zhang, X B; Lu, H; Jiang, X Q; Li, Z
2005-01-01
The axis of the non-diffracting beam produced by an axicon is very stable and can be adopted as the datum line to measure the spatial straightness error in continuous working distance, which may be short, medium or long. Though combining the non-diffracting beam datum-line with LVDT displace detector, a new straightness error measurement method is developed. Because the non-diffracting beam datum-line amends the straightness error gauged by LVDT, the straightness error is reliable and this method is matchs new generation GPS
Transverse two-stream instability in a matched plasma channel
International Nuclear Information System (INIS)
Whlttum, D.H.
1994-01-01
A relativistic electron beam magnetically self-focused in a plasma is subject to a transverse two stream or 'hose' instability. Linear evolution is described in terms of a tune distribution characterizing the beam, and an effective transverse impedance determined by the beam and the plasma profiles. This model is compared to cloud-in-cell simulations of three-dimensional transport of a beam with a Bennett profile, through a matched plasma channel. In the limit of large skin-depth this instability appears to be the primary limitation on stable beam transport. (author)
The Nature of Stable Insomnia Phenotypes
Pillai, Vivek; Roth, Thomas; Drake, Christopher L.
2015-01-01
Study Objectives: We examined the 1-y stability of four insomnia symptom profiles: sleep onset insomnia; sleep maintenance insomnia; combined onset and maintenance insomnia; and neither criterion (i.e., insomnia cases that do not meet quantitative thresholds for onset or maintenance problems). Insomnia cases that exhibited the same symptom profile over a 1-y period were considered to be phenotypes, and were compared in terms of clinical and demographic characteristics. Design: Longitudinal. Setting: Urban, community-based. Participants: Nine hundred fifty-four adults with Diagnostic and Statistical Manual of Mental Disorders, Fifth Edition based current insomnia (46.6 ± 12.6 y; 69.4% female). Interventions: None. Measurements and results: At baseline, participants were divided into four symptom profile groups based on quantitative criteria. Follow-up assessment 1 y later revealed that approximately 60% of participants retained the same symptom profile, and were hence judged to be phenotypes. Stability varied significantly by phenotype, such that sleep onset insomnia (SOI) was the least stable (42%), whereas combined insomnia (CI) was the most stable (69%). Baseline symptom groups (cross-sectionally defined) differed significantly across various clinical indices, including daytime impairment, depression, and anxiety. Importantly, however, a comparison of stable phenotypes (longitudinally defined) did not reveal any differences in impairment or comorbid psychopathology. Another interesting finding was that whereas all other insomnia phenotypes showed evidence of an elevated wake drive both at night and during the day, the “neither criterion” phenotype did not; this latter phenotype exhibited significantly higher daytime sleepiness despite subthreshold onset and maintenance difficulties. Conclusions: By adopting a stringent, stability-based definition, this study offers timely and important data on the longitudinal trajectory of specific insomnia phenotypes. With
Sense of Humor, Stable Affect, and Psychological Well-Being
Directory of Open Access Journals (Sweden)
Arnie Cann
2014-08-01
Full Text Available A good sense of humor has been implicated as a quality that could contribute to psychological well-being. The mechanisms through which sense of humor might operate include helping to reappraise threats, serving as a character strength, or facilitating happiness. The current research attempts to integrate these possibilities by examining whether a good sense of humor might operate globally by helping to maintain a more stable positive affect. Stable positive affect has been shown to facilitate more effective problem solving and to build resilience. However, not all humor is adaptive humor, so we also examine the roles that different styles of humor use might play. Individual differences in humor styles were used to predict stable levels of affect. Then, in a longitudinal design, humor styles and stable affect were used to predict subsequent resilience and psychological health. The results indicated that stable affect was related to resilience and psychological well-being, and that a sense of humor that involves self-enhancing humor, humor based on maintaining a humorous perspective about one’s experiences, was positively related to stable positive affect, negatively related to stable negative affect, and was mediated through stable affect in influencing resilience, well-being and distress. Thus, while a good sense of humor can lead to greater resilience and better psychological health, the current results, focusing on stable affect, find only self-enhancing humor provides reliable benefits.
A multiscale approach to mutual information matching
Pluim, J.P.W.; Maintz, J.B.A.; Viergever, M.A.; Hanson, K.M.
1998-01-01
Methods based on mutual information have shown promising results for matching of multimodal brain images. This paper discusses a multiscale approach to mutual information matching, aiming for an acceleration of the matching process while considering the accuracy and robustness of the method. Scaling
Connections between the matching and chromatic polynomials
Directory of Open Access Journals (Sweden)
E. J. Farrell
1992-01-01
Full Text Available The main results established are (i a connection between the matching and chromatic polynomials and (ii a formula for the matching polynomial of a general complement of a subgraph of a graph. Some deductions on matching and chromatic equivalence and uniqueness are made.
Database crime to crime match rate calculation.
Buckleton, John; Bright, Jo-Anne; Walsh, Simon J
2009-06-01
Guidance exists on how to count matches between samples in a crime sample database but we are unable to locate a definition of how to estimate a match rate. We propose a method that does not proceed from the match counting definition but which has a strong logic.
Personalized trajectory matching in spatial networks
Shang, Shuo
2013-07-31
With the increasing availability of moving-object tracking data, trajectory search and matching is increasingly important. We propose and investigate a novel problem called personalized trajectory matching (PTM). In contrast to conventional trajectory similarity search by spatial distance only, PTM takes into account the significance of each sample point in a query trajectory. A PTM query takes a trajectory with user-specified weights for each sample point in the trajectory as its argument. It returns the trajectory in an argument data set with the highest similarity to the query trajectory. We believe that this type of query may bring significant benefits to users in many popular applications such as route planning, carpooling, friend recommendation, traffic analysis, urban computing, and location-based services in general. PTM query processing faces two challenges: how to prune the search space during the query processing and how to schedule multiple so-called expansion centers effectively. To address these challenges, a novel two-phase search algorithm is proposed that carefully selects a set of expansion centers from the query trajectory and exploits upper and lower bounds to prune the search space in the spatial and temporal domains. An efficiency study reveals that the algorithm explores the minimum search space in both domains. Second, a heuristic search strategy based on priority ranking is developed to schedule the multiple expansion centers, which can further prune the search space and enhance the query efficiency. The performance of the PTM query is studied in extensive experiments based on real and synthetic trajectory data sets. © 2013 Springer-Verlag Berlin Heidelberg.
Robust point matching via vector field consensus.
Jiayi Ma; Ji Zhao; Jinwen Tian; Yuille, Alan L; Zhuowen Tu
2014-04-01
In this paper, we propose an efficient algorithm, called vector field consensus, for establishing robust point correspondences between two sets of points. Our algorithm starts by creating a set of putative correspondences which can contain a very large number of false correspondences, or outliers, in addition to a limited number of true correspondences (inliers). Next, we solve for correspondence by interpolating a vector field between the two point sets, which involves estimating a consensus of inlier points whose matching follows a nonparametric geometrical constraint. We formulate this a maximum a posteriori (MAP) estimation of a Bayesian model with hidden/latent variables indicating whether matches in the putative set are outliers or inliers. We impose nonparametric geometrical constraints on the correspondence, as a prior distribution, using Tikhonov regularizers in a reproducing kernel Hilbert space. MAP estimation is performed by the EM algorithm which by also estimating the variance of the prior model (initialized to a large value) is able to obtain good estimates very quickly (e.g., avoiding many of the local minima inherent in this formulation). We illustrate this method on data sets in 2D and 3D and demonstrate that it is robust to a very large number of outliers (even up to 90%). We also show that in the special case where there is an underlying parametric geometrical model (e.g., the epipolar line constraint) that we obtain better results than standard alternatives like RANSAC if a large number of outliers are present. This suggests a two-stage strategy, where we use our nonparametric model to reduce the size of the putative set and then apply a parametric variant of our approach to estimate the geometric parameters. Our algorithm is computationally efficient and we provide code for others to use it. In addition, our approach is general and can be applied to other problems, such as learning with a badly corrupted training data set.
Stable configurations in social networks
Bronski, Jared C.; DeVille, Lee; Ferguson, Timothy; Livesay, Michael
2018-06-01
We present and analyze a model of opinion formation on an arbitrary network whose dynamics comes from a global energy function. We study the global and local minimizers of this energy, which we call stable opinion configurations, and describe the global minimizers under certain assumptions on the friendship graph. We show a surprising result that the number of stable configurations is not necessarily monotone in the strength of connection in the social network, i.e. the model sometimes supports more stable configurations when the interpersonal connections are made stronger.
Development of Stable Isotope Technology
International Nuclear Information System (INIS)
Jeong, Do Young; Kim, Cheol Jung; Han, Jae Min
2009-03-01
KAERI has obtained an advanced technology with singular originality for laser stable isotope separation. Objectives for this project are to get production technology of Tl-203 stable isotope used for medical application and are to establish the foundation of the pilot system, while we are taking aim at 'Laser Isotope Separation Technology to make resistance to the nuclear proliferation'. And we will contribute to ensuring a nuclear transparency in the world society by taking part in a practical group of NSG and being collaboration with various international groups related to stable isotope separation technology
Complementary Cohort Strategy for Multimodal Face Pair Matching
DEFF Research Database (Denmark)
Sun, Yunlian; Nasrollahi, Kamal; Sun, Zhenan
2016-01-01
Face pair matching is the task of determining whether two face images represent the same person. Due to the limited expressive information embedded in the two face images as well as various sources of facial variations, it becomes a quite difficult problem. Towards the issue of few available images...... provided to represent each face, we propose to exploit an extra cohort set (identities in the cohort set are different from those being compared) by a series of cohort list comparisons. Useful cohort coefficients are then extracted from both sorted cohort identities and sorted cohort images...... for complementary information. To augment its robustness to complicated facial variations, we further employ multiple face modalities owing to their complementary value to each other for the face pair matching task. The final decision is made by fusing the extracted cohort coefficients with the direct matching...
Geographic Trends in the Plastic Surgery Match.
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.
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.
Scanner OPC signatures: automatic vendor-to-vendor OPE matching
Renwick, Stephen P.
2009-03-01
As 193nm lithography continues to be stretched and the k1 factor decreases, optical proximity correction (OPC) has become a vital part of the lithographer's tool kit. Unfortunately, as is now well known, the design variations of lithographic scanners from different vendors cause them to have slightly different optical-proximity effect (OPE) behavior, meaning that they print features through pitch in distinct ways. This in turn means that their response to OPC is not the same, and that an OPC solution designed for a scanner from Company 1 may or may not work properly on a scanner from Company 2. Since OPC is not inexpensive, that causes trouble for chipmakers using more than one brand of scanner. Clearly a scanner-matching procedure is needed to meet this challenge. Previously, automatic matching has only been reported for scanners of different tool generations from the same manufacturer. In contrast, scanners from different companies have been matched using expert tuning and adjustment techniques, frequently requiring laborious test exposures. Automatic matching between scanners from Company 1 and Company 2 has remained an unsettled problem. We have recently solved this problem and introduce a novel method to perform the automatic matching. The success in meeting this challenge required three enabling factors. First, we recognized the strongest drivers of OPE mismatch and are thereby able to reduce the information needed about a tool from another supplier to that information readily available from all modern scanners. Second, we developed a means of reliably identifying the scanners' optical signatures, minimizing dependence on process parameters that can cloud the issue. Third, we carefully employed standard statistical techniques, checking for robustness of the algorithms used and maximizing efficiency. The result is an automatic software system that can predict an OPC matching solution for scanners from different suppliers without requiring expert intervention.
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.
Stable isogeometric analysis of trimmed geometries
Marussig, Benjamin; Zechner, Jürgen; Beer, Gernot; Fries, Thomas-Peter
2017-04-01
We explore extended B-splines as a stable basis for isogeometric analysis with trimmed parameter spaces. The stabilization is accomplished by an appropriate substitution of B-splines that may lead to ill-conditioned system matrices. The construction for non-uniform knot vectors is presented. The properties of extended B-splines are examined in the context of interpolation, potential, and linear elasticity problems and excellent results are attained. The analysis is performed by an isogeometric boundary element formulation using collocation. It is argued that extended B-splines provide a flexible and simple stabilization scheme which ideally suits the isogeometric paradigm.
Source-to-accelerator quadrupole matching section for a compact linear accelerator
Seidl, P. A.; Persaud, A.; Ghiorso, W.; Ji, Q.; Waldron, W. L.; Lal, A.; Vinayakumar, K. B.; Schenkel, T.
2018-05-01
Recently, we presented a new approach for a compact radio-frequency (RF) accelerator structure and demonstrated the functionality of the individual components: acceleration units and focusing elements. In this paper, we combine these units to form a working accelerator structure: a matching section between the ion source extraction grids and the RF-acceleration unit and electrostatic focusing quadrupoles between successive acceleration units. The matching section consists of six electrostatic quadrupoles (ESQs) fabricated using 3D-printing techniques. The matching section enables us to capture more beam current and to match the beam envelope to conditions for stable transport in an acceleration lattice. We present data from an integrated accelerator consisting of the source, matching section, and an ESQ doublet sandwiched between two RF-acceleration units.
Stable isotope research pool inventory
International Nuclear Information System (INIS)
1984-03-01
This report contains a listing of electromagnetically separated stable isotopes which are available at the Oak Ridge National Laboratory for distribution for nondestructive research use on a loan basis. This inventory includes all samples of stable isotopes in the Research Materials Collection and does not designate whether a sample is out on loan or is in reprocessing. For some of the high abundance naturally occurring isotopes, larger amounts can be made available; for example, Ca-40 and Fe-56
French days on stable isotopes
International Nuclear Information System (INIS)
2000-01-01
These first French days on stable isotopes took place in parallel with the 1. French days of environmental chemistry. Both conferences had common plenary sessions. The conference covers all aspects of the use of stable isotopes in the following domains: medicine, biology, environment, tracer techniques, agronomy, food industry, geology, petroleum geochemistry, cosmo-geochemistry, archaeology, bio-geochemistry, hydrology, climatology, nuclear and particle physics, astrophysics, isotope separations etc.. Abstracts available on CD-Rom only. (J.S.)
Stable isotope research pool inventory
International Nuclear Information System (INIS)
1982-01-01
This report contains a listing of electromagnetically separated stable isotopes which are available for distribution within the United States for nondestructive research use from the Oak Ridge National Laboratory on a loan basis. This inventory includes all samples of stable isotopes in the Material Research Collection and does not designate whether a sample is out on loan or in reprocessing. For some of the high abundance naturally occurring isotopes, larger amounts can be made available; for example, Ca-40 and Fe-56
Pharmaceuticals labelled with stable isotopes
International Nuclear Information System (INIS)
Krumbiegel, P.
1986-11-01
The relatively new field of pharmaceuticals labelled with stable isotopes is reviewed. Scientific, juridical, and ethical questions are discussed concerning the application of these pharmaceuticals in human medicine. 13 C, 15 N, and 2 H are the stable isotopes mainly utilized in metabolic function tests. Methodical contributions are given to the application of 2 H, 13 C, and 15 N pharmaceuticals showing new aspects and different states of development in the field under discussion. (author)
Study of Atomic Quasi-Stable States, Decoherence And Cooling of Mesoscale Particles
Zhong, Changchun
Quantum mechanics, since its very beginning, has totally changed the way we understand nature. The past hundred years have seen great successes in the application of quantum physics, including atomic spectra, laser technology, condensed matter physics and the remarkable possibility for quantum computing, etc. This thesis is dedicated to a small regime of quantum physics. In the first part of the thesis, I present the studies of atomic quasi-stable states, which refer to those Rydberg states of an atom that are relatively stable in the presence of strong fields. Through spectrally probing the quasi-stable states, series of survival peaks are found. If the quasi-stable electrons were created by ultraviolet (UV) lasers with two different frequencies, the survival peaks could be modulated by continuously changing the phase difference between the UV and the IR laser. The quantum simulation, through directly solving the Schrodinger equation, matches the experimental results performed with microwave fields, and our studies should provide a guidance for future experiments. Despite the huge achievements in the application of quantum theory, there are still some fundamental problems that remain unresolved. One of them is the so-called quantum-to-classical transition, which refers to the expectation that the system behaves in a more classical manner when the system size increases. This basic question was not well answered until decoherence theory was proposed, which states that the coherence of a quantum system tends to be destroyed by environmental interruptions. Thus, if a system is well isolated from its environment, it is in principle possible to observe macroscopic quantum coherence. Quite recently, testing quantum principles in the macroscale has become a hot topic due to rapic technological developments. A very promising platform for testing macroscale quantum physics is a laser levitated nanoparticle, and cooling its mechanical motion to the ground state is the first
Best Practices for NPT Transit Matching
International Nuclear Information System (INIS)
Gilligan, Kimberly V.; Whitaker, J. Michael; Oakberg, John A.; Snow, Catherine
2016-01-01
Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.
Probabilistic seismic history matching using binary images
Davolio, Alessandra; Schiozer, Denis Jose
2018-02-01
Currently, the goal of history-matching procedures is not only to provide a model matching any observed data but also to generate multiple matched models to properly handle uncertainties. One such approach is a probabilistic history-matching methodology based on the discrete Latin Hypercube sampling algorithm, proposed in previous works, which was particularly efficient for matching well data (production rates and pressure). 4D seismic (4DS) data have been increasingly included into history-matching procedures. A key issue in seismic history matching (SHM) is to transfer data into a common domain: impedance, amplitude or pressure, and saturation. In any case, seismic inversions and/or modeling are required, which can be time consuming. An alternative to avoid these procedures is using binary images in SHM as they allow the shape, rather than the physical values, of observed anomalies to be matched. This work presents the incorporation of binary images in SHM within the aforementioned probabilistic history matching. The application was performed with real data from a segment of the Norne benchmark case that presents strong 4D anomalies, including softening signals due to pressure build up. The binary images are used to match the pressurized zones observed in time-lapse data. Three history matchings were conducted using: only well data, well and 4DS data, and only 4DS. The methodology is very flexible and successfully utilized the addition of binary images for seismic objective functions. Results proved the good convergence of the method in few iterations for all three cases. The matched models of the first two cases provided the best results, with similar well matching quality. The second case provided models presenting pore pressure changes according to the expected dynamic behavior (pressurized zones) observed on 4DS data. The use of binary images in SHM is relatively new with few examples in the literature. This work enriches this discussion by presenting a new
Best Practices for NPT Transit Matching
Energy Technology Data Exchange (ETDEWEB)
Gilligan, Kimberly V. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Whitaker, J. Michael [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Oakberg, John A. [Tetra Tech, Inc., Oak Ridge, TN (United States); Snow, Catherine [Sno Consulting, LLC, Sandy, UT (United States)
2016-09-01
Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.
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.
A MATCHING METHOD TO REDUCE THE INFLUENCE OF SAR GEOMETRIC DEFORMATION
Directory of Open Access Journals (Sweden)
C. Gao
2018-04-01
Full Text Available There are large geometrical deformations in SAR image, including foreshortening, layover, shade，which leads to SAR Image matching with low accuracy. Especially in complex terrain area, the control points are difficult to obtain, and the matching is difficult to achieve. Considering the impact of geometric distortions in SAR image pairs, a matching algorithm with a combination of speeded up robust features (SURF and summed of normalize cross correlation (SNCC was proposed, which can avoid the influence of SAR geometric deformation. Firstly, SURF algorithm was utilized to predict the search area. Then the matching point pairs was selected based on summed of normalized cross correlation. Finally, false match points were eliminated by the bidirectional consistency. SURF algorithm can control the range of matching points, and the matching points extracted from the deformation area are eliminated, and the matching points with stable and even distribution are obtained. The experimental results demonstrated that the proposed algorithm had high precision, and can effectively avoid the effect of geometric distortion on SAR image matching. Meet accuracy requirements of the block adjustment with sparse control points.
Underwater Acoustic Matched Field Imaging Based on Compressed Sensing
Directory of Open Access Journals (Sweden)
Huichen Yan
2015-10-01
Full Text Available Matched field processing (MFP is an effective method for underwater target imaging and localizing, but its performance is not guaranteed due to the nonuniqueness and instability problems caused by the underdetermined essence of MFP. By exploiting the sparsity of the targets in an imaging area, this paper proposes a compressive sensing MFP (CS-MFP model from wave propagation theory by using randomly deployed sensors. In addition, the model’s recovery performance is investigated by exploring the lower bounds of the coherence parameter of the CS dictionary. Furthermore, this paper analyzes the robustness of CS-MFP with respect to the displacement of the sensors. Subsequently, a coherence-excluding coherence optimized orthogonal matching pursuit (CCOOMP algorithm is proposed to overcome the high coherent dictionary problem in special cases. Finally, some numerical experiments are provided to demonstrate the effectiveness of the proposed CS-MFP method.
... often, it could be a sign of a balance problem. Balance problems can make you feel unsteady. You may ... related injuries, such as a hip fracture. Some balance problems are due to problems in the inner ...
Design of Matched Absorbing Layers for Surface Plasmon-Polaritons
Directory of Open Access Journals (Sweden)
Sergio de la Cruz
2012-01-01
Full Text Available We describe a procedure for designing metal-metal boundaries for the strong attenuation of surface plasmon-polaritons without the introduction of reflections or scattering effects. Solutions associated with different sets of matching materials are found. To illustrate the results and the consequences of adopting different solutions, we present calculations based on an integral equation formulation for the scattering problem and the use of a nonlocal impedance boundary condition.
Fast Arc-Annotated Subsequence Matching in Linear Space
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li
2012-01-01
for investigating the function of RNA molecules. Gramm et al. (ACM Trans. Algorithms 2(1): 44-65, 2006) gave an algorithm for this problem using O(nm) time and space, where m and n are the lengths of P and Q, respectively. In this paper we present a new algorithm using O(nm) time and O(n+m) space, thereby matching......-annotated strings. © 2010 Springer Science+Business Media, LLC....
The nature of stable insomnia phenotypes.
Pillai, Vivek; Roth, Thomas; Drake, Christopher L
2015-01-01
We examined the 1-y stability of four insomnia symptom profiles: sleep onset insomnia; sleep maintenance insomnia; combined onset and maintenance insomnia; and neither criterion (i.e., insomnia cases that do not meet quantitative thresholds for onset or maintenance problems). Insomnia cases that exhibited the same symptom profile over a 1-y period were considered to be phenotypes, and were compared in terms of clinical and demographic characteristics. Longitudinal. Urban, community-based. Nine hundred fifty-four adults with Diagnostic and Statistical Manual of Mental Disorders, Fifth Edition based current insomnia (46.6 ± 12.6 y; 69.4% female). None. At baseline, participants were divided into four symptom profile groups based on quantitative criteria. Follow-up assessment 1 y later revealed that approximately 60% of participants retained the same symptom profile, and were hence judged to be phenotypes. Stability varied significantly by phenotype, such that sleep onset insomnia (SOI) was the least stable (42%), whereas combined insomnia (CI) was the most stable (69%). Baseline symptom groups (cross-sectionally defined) differed significantly across various clinical indices, including daytime impairment, depression, and anxiety. Importantly, however, a comparison of stable phenotypes (longitudinally defined) did not reveal any differences in impairment or comorbid psychopathology. Another interesting finding was that whereas all other insomnia phenotypes showed evidence of an elevated wake drive both at night and during the day, the 'neither criterion' phenotype did not; this latter phenotype exhibited significantly higher daytime sleepiness despite subthreshold onset and maintenance difficulties. By adopting a stringent, stability-based definition, this study offers timely and important data on the longitudinal trajectory of specific insomnia phenotypes. With the exception of daytime sleepiness, few clinical differences are apparent across stable phenotypes.
Compressed Subsequence Matching and Packed Tree Coloring
DEFF Research Database (Denmark)
Bille, Philip; Cording, Patrick Hagge; Gørtz, Inge Li
2017-01-01
We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size n compressing a string of size N and a pattern string of size m over an alphabet of size \\(\\sigma \\), our algorithm uses \\(O(n+\\frac{n\\sigma }{w})\\) space and \\(O(n+\\frac{n\\sigma }{w}+m\\log N\\log...... w\\cdot occ)\\) or \\(O(n+\\frac{n\\sigma }{w}\\log w+m\\log N\\cdot occ)\\) time. Here w is the word size and occ is the number of minimal occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for \\(occ=o(\\frac{n}{\\log N})\\) occurrences. The algorithm uses...... a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings....
[Population problem, comprehension problem].
Tallon, F
1993-08-01
Overpopulation of developing countries in general, and Rwanda in particular, is not just their problem but a problem for developed countries as well. Rapid population growth is a key factor in the increase of poverty in sub-Saharan Africa. Population growth outstrips food production. Africa receives more and more foreign food, economic, and family planning aid each year. The Government of Rwanda encourages reduced population growth. Some people criticize it, but this criticism results in mortality and suffering. One must combat this ignorance, but attitudes change slowly. Some of these same people find the government's acceptance of family planning an invasion of their privacy. Others complain that rich countries do not have campaigns to reduce births, so why should Rwanda do so? The rate of schooling does not increase in Africa, even though the number of children in school increases, because of rapid population growth. Education is key to improvements in Africa's socioeconomic growth. Thus, Africa, is underpopulated in terms of potentiality but overpopulated in terms of reality, current conditions, and possibilities of overexploitation. Africa needs to invest in human resources. Families need to save, and to so, they must refrain from having many children. Africa should resist the temptation to waste, as rich countries do, and denounce it. Africa needs to become more independent of these countries, but structural adjustment plans, growing debt, and rapid population growth limit national independence. Food aid is a means for developed countries to dominate developing countries. Modernization through foreign aid has had some positive effects on developing countries (e.g., improved hygiene, mortality reduction), but these also sparked rapid population growth. Rwandan society is no longer traditional, but it is also not yet modern. A change in mentality to fewer births, better quality of life for living infants, better education, and less burden for women must occur
Fsheikh, Ahmed H.
2013-01-01
A nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of reservoir models is presented. 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 components of the basis functions with the residual. The discovered basis (aka support) is augmented across the nonlinear iterations. Once the basis functions are selected from the dictionary, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on approximate gradient estimation using an iterative stochastic ensemble method (ISEM). ISEM utilizes an ensemble of directional derivatives to efficiently approximate gradients. In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm.
Signature detection and matching for document image retrieval.
Zhu, Guangyu; Zheng, Yefeng; Doermann, David; Jaeger, Stefan
2009-11-01
As one of the most pervasive methods of individual identification and document authentication, signatures present convincing evidence and provide an important form of indexing for effective document image processing and retrieval in a broad range of applications. However, detection and segmentation of free-form objects such as signatures from clustered background is currently an open document analysis problem. In this paper, we focus on two fundamental problems in signature-based document image retrieval. First, we propose a novel multiscale approach to jointly detecting and segmenting signatures from document images. Rather than focusing on local features that typically have large variations, our approach captures the structural saliency using a signature production model and computes the dynamic curvature of 2D contour fragments over multiple scales. This detection framework is general and computationally tractable. Second, we treat the problem of signature retrieval in the unconstrained setting of translation, scale, and rotation invariant nonrigid shape matching. We propose two novel measures of shape dissimilarity based on anisotropic scaling and registration residual error and present a supervised learning framework for combining complementary shape information from different dissimilarity metrics using LDA. We quantitatively study state-of-the-art shape representations, shape matching algorithms, measures of dissimilarity, and the use of multiple instances as query in document image retrieval. We further demonstrate our matching techniques in offline signature verification. Extensive experiments using large real-world collections of English and Arabic machine-printed and handwritten documents demonstrate the excellent performance of our approaches.
Fractional Order Element Based Impedance Matching
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.
Matching fields and lattice points of simplices
Loho, Georg; Smith, Ben
2018-01-01
We show that the Chow covectors of a linkage matching field define a bijection of lattice points and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels & Zelevinsky (1993) on linkage matching fields. For this, we give an explicit construction that associates a bipartite incidence graph of an ordered partition of a common set to all lattice points in a dilated simplex. Given a triangulation of a product of two simp...
Online Job Search and Matching Quality
Constantin Mang
2012-01-01
The Internet has fundamentally changed the way workers and firms are matched on the job market. Compared to newspapers and other traditional employment resources, online job boards presumably lead to better matches by providing a wider choice of job advertisements and more sophisticated methods for finding suitable vacancies. This study investigates the association of online job search and matching quality using individual-level data from the German Socio-Economic Panel (SOEP). My results sho...
Anomalous dispersion enhanced Cerenkov phase-matching
Energy Technology Data Exchange (ETDEWEB)
Kowalczyk, T.C.; Singer, K.D. [Case Western Reserve Univ., Cleveland, OH (United States). Dept. of Physics; Cahill, P.A. [Sandia National Labs., Albuquerque, NM (United States)
1993-11-01
The authors report on a scheme for phase-matching second harmonic generation in polymer waveguides based on the use of anomalous dispersion to optimize Cerenkov phase matching. They have used the theoretical results of Hashizume et al. and Onda and Ito to design an optimum structure for phase-matched conversion. They have found that the use of anomalous dispersion in the design results in a 100-fold enhancement in the calculated conversion efficiency. This technique also overcomes the limitation of anomalous dispersion phase-matching which results from absorption at the second harmonic. Experiments are in progress to demonstrate these results.
The Gastroenterology Fellowship Match: A Decade Later.
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.
[Current Treatment of Stable Angina].
Toggweiler, Stefan; Jamshidi, Peiman; Cuculi, Florim
2015-06-17
Current therapy for stable angina includes surgical and percutaneous revascularization, which has been improved tremendously over the last decades. Smoking cessation and regular exercise are the cornerstone for prevention of further cerebrovascular events. Medical treatment includes treatment of cardiovascular risk factors and antithrombotic management, which can be a challenge in some patients. Owing to the fact the coronary revascularization is readily accessible these days in many industrialized countries, the importance of antianginal therapy has decreased over the past years. This article presents a contemporary overview of the management of patients with stable angina in the year 2015.
A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol.
Directory of Open Access Journals (Sweden)
Ping Zeng
Full Text Available In this paper, based on our previous multi-pattern uniform resource locator (URL binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on-all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications.
Stable carbon and nitrogen isotope ratios of sodium and potassium cyanide as a forensic signature.
Kreuzer, Helen W; Horita, Juske; Moran, James J; Tomkins, Bruce A; Janszen, Derek B; Carman, April
2012-01-01
Sodium and potassium cyanide are highly toxic, produced in large amounts by the chemical industry, and linked to numerous high-profile crimes. The U.S. Centers for Disease Control and Prevention has identified cyanide as one of the most probable agents to be used in a chemical terrorism event. We investigated whether stable C and N isotopic content of sodium and potassium cyanide could serve as a forensic signature for sample matching, using a collection of 65 cyanide samples. Upon analysis, a few of the cyanide samples displayed nonhomogeneous isotopic content associated with degradation to a carbonate salt and loss of hydrogen cyanide. Most samples had highly reproducible isotope content. Of the 65 cyanide samples, >95% could be properly matched based on C and N isotope ratios, with a false match rate <3%. These results suggest that stable C and N isotope ratios are a useful forensic signature for matching cyanide samples. © 2011 American Academy of Forensic Sciences.
Directory of Open Access Journals (Sweden)
Bo Wang
2015-01-01
Full Text Available Nonnegative orthogonal matching pursuit (NOMP has been proven to be a more stable encoder for unsupervised sparse representation learning. However, previous research has shown that NOMP is suboptimal in terms of computational cost, as the coefficients selection and refinement using nonnegative least squares (NNLS have been divided into two separate steps. It is found that this problem severely reduces the efficiency of encoding for large-scale image patches. In this work, we study fast nonnegative OMP (FNOMP as an efficient encoder which can be accelerated by the implementation of QR factorization and iterations of coefficients in deep networks for full-size image categorization task. It is analyzed and demonstrated that using relatively simple gain-shape vector quantization for training dictionary, FNOMP not only performs more efficiently than NOMP for encoding but also significantly improves the classification accuracy compared to OMP based algorithm. In addition, FNOMP based algorithm is superior to other state-of-the-art methods on several publicly available benchmarks, that is, Oxford Flowers, UIUC-Sports, and Caltech101.
Possibility of stable quark stars
International Nuclear Information System (INIS)
Bowers, R.L.; Gleeson, A.M.; Pedigo, R.D.
1976-08-01
A recent zero temperature equation of state which contains quark-partons separated from conventional baryons by a phase transition is used to investigate the stability of quark stars. The sensitivity to the input physics is also considered. The conclusions, which are found to be relatively model independent, indicate that a separately identifiable class of stable objects called quark stars does not exist
Radiation-stable polyolefin compositions
International Nuclear Information System (INIS)
Rekers, J.W.
1986-01-01
This invention relates to compositions of olefinic polymers suitable for high energy radiation treatment. In particular, the invention relates to olefinic polymer compositions that are stable to sterilizing dosages of high energy radiation such as a gamma radiation. Stabilizers are described that include benzhydrol and benzhydrol derivatives; these stabilizers may be used alone or in combination with secondary antioxidants or synergists
Matching of Tore Supra ICRH antennas
International Nuclear Information System (INIS)
Ladurelle, L.; Beaumont, B.; Kuus, H.; Lombard, G.
1994-01-01
An automatic matching method is described for Tore Supra ICRH antennas based on impedance variations seen at their feed points. Error signals derived from directional voltage and phase measurements in the feeder allow to control the matching capacitors values for optimal power transmission. (author) 5 refs.; 9 figs
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
Object-based connectedness facilitates matching
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
On solution concepts for matching games
Biro, Peter; Kern, Walter; Paulusma, Daniël; Kratochvil, J.; Li, A.; Fiala, J.; Kolman, P.
A matching game is a cooperative game $(N,v)$ defined on a graph $G = (N,E)$ with an edge weighting $\\omega : E \\to {\\Bbb R}_+$ . The player set is $N$ and the value of a coalition $S \\subseteq N$ is defined as the maximum weight of a matching in the subgraph induced by $S$. First we present an
Equilibrium and matching under price controls
Herings, P.J.J.
2015-01-01
The paper considers a one-to-one matching with contracts model in the presence of price controls. This set-up contains two important streams in the matching literature, those with and those without monetary transfers, as special cases and allows for intermediate cases with some restrictions on the
Competence Matching Tool - Explanations and Implementation
Herder, Eelco; Kärger, Philipp
2010-01-01
Herder, E., Kärger, P. (2009) Competence Matching Tool - Explanations and Implementation. The document contains the technical specification of the competence matching tool. The tool can be found at http://tencompetence.cvs.sourceforge.net/viewvc/tencompetence/wp7/CompetenceMatcher/ and the location
Matching Two-dimensional Gel Electrophoresis' Spots
DEFF Research Database (Denmark)
Dos Anjos, António; AL-Tam, Faroq; Shahbazkia, Hamid Reza
2012-01-01
This paper describes an approach for matching Two-Dimensional Electrophoresis (2-DE) gels' spots, involving the use of image registration. The number of false positive matches produced by the proposed approach is small, when compared to academic and commercial state-of-the-art approaches. This ar...
Local Stereo Matching Using Adaptive Local Segmentation
Damjanovic, S.; van der Heijden, Ferdinand; Spreeuwers, Lieuwe Jan
We propose a new dense local stereo matching framework for gray-level images based on an adaptive local segmentation using a dynamic threshold. We define a new validity domain of the fronto-parallel assumption based on the local intensity variations in the 4-neighborhood of the matching pixel. The
... Staying Safe Videos for Educators Search English Español Speech Problems KidsHealth / For Teens / Speech Problems What's in ... a person's ability to speak clearly. Some Common Speech and Language Disorders Stuttering is a problem that ...
Technical performance and match-to-match variation in elite football teams.
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.
TEXTURE-AWARE DENSE IMAGE MATCHING USING TERNARY CENSUS TRANSFORM
Directory of Open Access Journals (Sweden)
H. Hu
2016-06-01
Full Text Available Textureless and geometric discontinuities are major problems in state-of-the-art dense image matching methods, as they can cause visually significant noise and the loss of sharp features. Binary census transform is one of the best matching cost methods but in textureless areas, where the intensity values are similar, it suffers from small random noises. Global optimization for disparity computation is inherently sensitive to parameter tuning in complex urban scenes, and must compromise between smoothness and discontinuities. The aim of this study is to provide a method to overcome these issues in dense image matching, by extending the industry proven Semi-Global Matching through 1 developing a ternary census transform, which takes three outputs in a single order comparison and encodes the results in two bits rather than one, and also 2 by using texture-information to self-tune the parameters, which both preserves sharp edges and enforces smoothness when necessary. Experimental results using various datasets from different platforms have shown that the visual qualities of the triangulated point clouds in urban areas can be largely improved by these proposed methods.
Security and matching of partial fingerprint recognition systems
Jea, Tsai-Yang; Chavan, Viraj S.; Govindaraju, Venu; Schneider, John K.
2004-08-01
Despite advances in fingerprint identification techniques, matching incomplete or partial fingerprints still poses a difficult challenge. While the introduction of compact silicon chip-based sensors that capture only a part of the fingerprint area have made this problem important from a commercial perspective, there is also considerable interest on the topic for processing partial and latent fingerprints obtained at crime scenes. Attempts to match partial fingerprints using singular ridge structures-based alignment techniques fail when the partial print does not include such structures (e.g., core or delta). We present a multi-path fingerprint matching approach that utilizes localized secondary features derived using only the relative information of minutiae. Since the minutia-based fingerprint representation, is an ANSI-NIST standard, our approach has the advantage of being directly applicable to already existing databases. We also analyze the vulnerability of partial fingerprint identification systems to brute force attacks. The described matching approach has been tested on one of FVC2002"s DB1 database11. The experimental results show that our approach achieves an equal error rate of 1.25% and a total error rate of 1.8% (with FAR at 0.2% and FRR at 1.6%).
Improved Feature Matching for Mobile Devices with IMU
Directory of Open Access Journals (Sweden)
Andrea Masiero
2016-08-01
Full Text Available Thanks to the recent diffusion of low-cost high-resolution digital cameras and to the development of mostly automated procedures for image-based 3D reconstruction, the popularity of photogrammetry for environment surveys is constantly increasing in the last years. Automatic feature matching is an important step in order to successfully complete the photogrammetric 3D reconstruction: this step is the fundamental basis for the subsequent estimation of the geometry of the scene. This paper reconsiders the feature matching problem when dealing with smart mobile devices (e.g., when using the standard camera embedded in a smartphone as imaging sensor. More specifically, this paper aims at exploiting the information on camera movements provided by the inertial navigation system (INS in order to make the feature matching step more robust and, possibly, computationally more efficient. First, a revised version of the affine scale-invariant feature transform (ASIFT is considered: this version reduces the computational complexity of the original ASIFT, while still ensuring an increase of correct feature matches with respect to the SIFT. Furthermore, a new two-step procedure for the estimation of the essential matrix E (and the camera pose is proposed in order to increase its estimation robustness and computational efficiency.
Fiber cavities with integrated mode matching optics.
Gulati, Gurpreet Kaur; Takahashi, Hiroki; Podoliak, Nina; Horak, Peter; Keller, Matthias
2017-07-17
In fiber based Fabry-Pérot Cavities (FFPCs), limited spatial mode matching between the cavity mode and input/output modes has been the main hindrance for many applications. We have demonstrated a versatile mode matching method for FFPCs. Our novel design employs an assembly of a graded-index and large core multimode fiber directly spliced to a single mode fiber. This all-fiber assembly transforms the propagating mode of the single mode fiber to match with the mode of a FFPC. As a result, we have measured a mode matching of 90% for a cavity length of ~400 μm. This is a significant improvement compared to conventional FFPCs coupled with just a single mode fiber, especially at long cavity lengths. Adjusting the parameters of the assembly, the fundamental cavity mode can be matched with the mode of almost any single mode fiber, making this approach highly versatile and integrable.
Net Stable Funding Ratio: Impact on Funding Value Adjustment
Siadat, Medya; Hammarlid, Ola
2017-01-01
In this paper we investigate the relationship between Funding Value Adjustment (FVA) and Net Stable Funding Ratio (NSFR). FVA is defined in a consistent way with NSFR such that the new framework of FVA monitors the costs due to keeping NSFR at an acceptable level, as well. In addition, the problem of choosing the optimal funding strategy is formulated as a shortest path problem where the proposed FVA framework is applied in the optimization process. The solution provides us with the optimal f...
Directory of Open Access Journals (Sweden)
Muhammad Aslam Noor
2004-01-01
Full Text Available We consider a new class of equilibrium problems, known as hemiequilibrium problems. Using the auxiliary principle technique, we suggest and analyze a class of iterative algorithms for solving hemiequilibrium problems, the convergence of which requires either pseudomonotonicity or partially relaxed strong monotonicity. As a special case, we obtain a new method for hemivariational inequalities. Since hemiequilibrium problems include hemivariational inequalities and equilibrium problems as special cases, the results proved in this paper still hold for these problems.
IMPROVED REAL-TIME SCAN MATCHING USING CORNER FEATURES
Directory of Open Access Journals (Sweden)
H. A. Mohamed
2016-06-01
Full Text Available The automation of unmanned vehicle operation has gained a lot of research attention, in the last few years, because of its numerous applications. The vehicle localization is more challenging in indoor environments where absolute positioning measurements (e.g. GPS are typically unavailable. Laser range finders are among the most widely used sensors that help the unmanned vehicles to localize themselves in indoor environments. Typically, automatic real-time matching of the successive scans is performed either explicitly or implicitly by any localization approach that utilizes laser range finders. Many accustomed approaches such as Iterative Closest Point (ICP, Iterative Matching Range Point (IMRP, Iterative Dual Correspondence (IDC, and Polar Scan Matching (PSM handles the scan matching problem in an iterative fashion which significantly affects the time consumption. Furthermore, the solution convergence is not guaranteed especially in cases of sharp maneuvers or fast movement. This paper proposes an automated real-time scan matching algorithm where the matching process is initialized using the detected corners. This initialization step aims to increase the convergence probability and to limit the number of iterations needed to reach convergence. The corner detection is preceded by line extraction from the laser scans. To evaluate the probability of line availability in indoor environments, various data sets, offered by different research groups, have been tested and the mean numbers of extracted lines per scan for these data sets are ranging from 4.10 to 8.86 lines of more than 7 points. The set of all intersections between extracted lines are detected as corners regardless of the physical intersection of these line segments in the scan. To account for the uncertainties of the detected corners, the covariance of the corners is estimated using the extracted lines variances. The detected corners are used to estimate the transformation parameters
The Interaction Between Schema Matching and Record Matching in Data Integration
Gu, Binbin; Li, Zhixu; Zhang, Xiangliang; Liu, An; Liu, Guanfeng; Zheng, Kai; Zhao, Lei; Zhou, Xiaofang
2016-01-01
Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have
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...
Stable isotope geochemistry : definitions, terminology, measurement and some applications
International Nuclear Information System (INIS)
Faure, K.
2004-01-01
Stable isotope measurements have been applied to many fundamental problems in geochemistry, petrology, and paleoclimatology, as well as related fields in archaeology, anthropology, physical chemistry, biology and forensic sciences. These applications can be broadly classified into four main types: thermometry, tracers, reaction mechanisms and chemostratigraphy. 52 refs., 11 figs., 2 tabs
COMBINING SOURCES IN STABLE ISOTOPE MIXING MODELS: ALTERNATIVE METHODS
Stable isotope mixing models are often used to quantify source contributions to a mixture. Examples include pollution source identification; trophic web studies; analysis of water sources for soils, plants, or water bodies; and many others. A common problem is having too many s...
Optimal stability polynomials for numerical integration of initial value problems
Ketcheson, David I.; Ahmadia, Aron
2013-01-01
We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step
Directory of Open Access Journals (Sweden)
Ismail Saglam
2013-03-01
Full Text Available In this paper, we use a two-period one-to-one matching model with incomplete information to examine the effect of changes in divorce costs on marital dissolution. Each individual who has a nontransferable expected utility about the quality of each potential marriage decides whether to marry or to remain single at the beginning of the first period. Individuals married in the first period learn the qualities of their marriages at the beginning of the second period and then decide whether to stay married or to unilaterally divorce. We show that, for any society, there exist matching environments where the probability of the marital dissolution does not reduce divorce costs under gender-optimal matching rules. In such environments, an allocation effect of divorce costs with an ambiguous sign outweighs an incentive effect that is always negative. We also show that these results may also arise under stable matching rules that are not gender optimal.
Shelf-stable foods through irradiation processing
Energy Technology Data Exchange (ETDEWEB)
NONE
1995-11-01
This survey has been produced from a database on analytical reference materials of biological and environmental origin, which is maintained at the International Atomic Energy Agency. It is an updated version of earlier reports, the last published in 1990. The information presented refers mostly to reference materials for trace element constituents; however, information is also included on a number of other selected measurands of relevance to IAEA programmes, i.e. radionuclides, stable isotopes, anions, cations, organometallic compounds and organic contaminants. The database presently contains over 10,000 analyte values for 455 measurands in 650 reference materials produced by 30 different suppliers. Additional information on the cost of the materials, the unit size supplied, and recommended minimum weight of material for analysis is also provided, if this information is available to the authors. It is expected that this survey will help analysts to select reference materials for quality assurance purposes that match as closely as possible, with respect to matrix type and concentrations of the measurands of interest, their samples to be analyzed. 22 refs, 2 tabs.
Shelf-stable foods through irradiation processing
International Nuclear Information System (INIS)
1995-11-01
This survey has been produced from a database on analytical reference materials of biological and environmental origin, which is maintained at the International Atomic Energy Agency. It is an updated version of earlier reports, the last published in 1990. The information presented refers mostly to reference materials for trace element constituents; however, information is also included on a number of other selected measurands of relevance to IAEA programmes, i.e. radionuclides, stable isotopes, anions, cations, organometallic compounds and organic contaminants. The database presently contains over 10,000 analyte values for 455 measurands in 650 reference materials produced by 30 different suppliers. Additional information on the cost of the materials, the unit size supplied, and recommended minimum weight of material for analysis is also provided, if this information is available to the authors. It is expected that this survey will help analysts to select reference materials for quality assurance purposes that match as closely as possible, with respect to matrix type and concentrations of the measurands of interest, their samples to be analyzed. 22 refs, 2 tabs
Stable isotope research pool inventory
International Nuclear Information System (INIS)
1986-08-01
This report contains a listing of electromagnetically separated stable isotopes which are available at the Oak Ridge National Laboratory for distribution for nondestructive research use on a loan basis. This inventory includes all samples of stable isotopes in the Research Materials Collection and does not designate whether a sample is out on loan or is in reprocessing. For some of the high-abundance, naturally occurring isotopes, larger amounts can be made available; for example, Ca-40 and Fe-56. All requests for the loan of samples should be submitted with a summary of the purpose of the loan to: Iotope Distribution Office, Oak Ridge National Laboratory, P.O. Box X, Oak Ridge, Tennessee 37831. Requests from non-DOE contractors and from foreign institutions require DOE approval
Stable isotopes and the environment
International Nuclear Information System (INIS)
Krouse, H.R.
1990-01-01
Whereas traditionally, stable isotope research has been directed towards resource exploration and development, it is finding more frequent applications in helping to assess the impacts of resource utilization upon ecosystems. Among the many pursuits, two themes are evident: tracing the transport and conversions of pollutants in the environment and better understanding of the interplay among environmental receptors, e.g. food web studies. Stable isotope data are used primarily to identify the presence of pollutants in the environment and with a few exceptions, the consequence of their presence must be assessed by other techniques. Increasing attention has been given to the isotopic composition of humans with many potential applications in areas such as paleodiets, medicine, and criminology. In this brief overview examples are used from the Pacific Rim to illustrate the above concepts. 26 refs., 1 tab., 3 figs
Impedance matching wireless power transmission system for biomedical devices.
Lum, Kin Yun; Lindén, Maria; Tan, Tian Swee
2015-01-01
For medical application, the efficiency and transmission distance of the wireless power transfer (WPT) are always the main concern. Research has been showing that the impedance matching is one of the critical factors for dealing with the problem. However, there is not much work performed taking both the source and load sides into consideration. Both sides matching is crucial in achieving an optimum overall performance, and the present work proposes a circuit model analysis for design and implementation. The proposed technique was validated against experiment and software simulation. Result was showing an improvement in transmission distance up to 6 times, and efficiency at this transmission distance had been improved up to 7 times as compared to the impedance mismatch system. The system had demonstrated a near-constant transfer efficiency for an operating range of 2cm-12cm.
Fingerprint recognition system by use of graph matching
Shen, Wei; Shen, Jun; Zheng, Huicheng
2001-09-01
Fingerprint recognition is an important subject in biometrics to identify or verify persons by physiological characteristics, and has found wide applications in different domains. In the present paper, we present a finger recognition system that combines singular points and structures. The principal steps of processing in our system are: preprocessing and ridge segmentation, singular point extraction and selection, graph representation, and finger recognition by graphs matching. Our fingerprint recognition system is implemented and tested for many fingerprint images and the experimental result are satisfactory. Different techniques are used in our system, such as fast calculation of orientation field, local fuzzy dynamical thresholding, algebraic analysis of connections and fingerprints representation and matching by graphs. Wed find that for fingerprint database that is not very large, the recognition rate is very high even without using a prior coarse category classification. This system works well for both one-to-few and one-to-many problems.
Kolmogorov and Zabih’s Graph Cuts Stereo Matching Algorithm
Directory of Open Access Journals (Sweden)
Vladimir Kolmogorov
2014-10-01
Full Text Available Binocular stereovision estimates the three-dimensional shape of a scene from two photographs taken from different points of view. In rectified epipolar geometry, this is equivalent to a matching problem. This article describes a method proposed by Kolmogorov and Zabih in 2001, which puts forward an energy-based formulation. The aim is to minimize a four-term-energy. This energy is not convex and cannot be minimized except among a class of perturbations called expansion moves, in which case an exact minimization can be done with graph cuts techniques. One noteworthy feature of this method is that it handles occlusion: The algorithm detects points that cannot be matched with any point in the other image. In this method displacements are pixel accurate (no subpixel refinement.
Rapid matching of stereo vision based on fringe projection profilometry
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.
Towards stable acceleration in LINACS
Dubrovskiy, A D
2014-01-01
Ultra-stable and -reproducible high-energy particle beams with short bunches are needed in novel linear accelerators and, in particular, in the Compact Linear Collider CLIC. A passive beam phase stabilization system based on a bunch compression with a negative transfer matrix element R56 and acceleration at a positive off-crest phase is proposed. The motivation and expected advantages of the proposed scheme are outlined.
Stable Structures for Distributed Applications
Eugen DUMITRASCU; Ion IVAN
2008-01-01
For distributed applications, we define the linear, tree and graph structure types with different variants and modalities to aggregate them. The distributed applications have assigned structures that through their characteristics influence the costs of stages for developing cycle and the costs for exploitation, transferred to each user. We also present the quality characteristics of a structure for a stable application, which is focused on stability characteristic. For that characteristic we ...
Match-to-match variability in high-speed running activity in a professional soccer team.
Carling, Christopher; Bradley, Paul; McCall, Alan; Dupont, Gregory
2016-12-01
This study investigated variability in competitive high-speed running performance in an elite soccer team. A semi-automated tracking system quantified running performance in 12 players over a season (median 17 matches per player, 207 observations). Variability [coefficient of variation (CV)] was compared for total sprint distance (TSD, >25.2 km/h), high-speed running (HSR, 19.8-25.2 km/h), total high-speed running (THSR, ≥19.8 km/h); THSR when the team was in and out of ball possession, in individual ball possession, in the peak 5 min activity period; and distance run according to individual maximal aerobic speed (MAS). Variability for % declines in THSR and distance covered at ≥80% MAS across halves, at the end of play (final 15 min vs. mean for all 15 min periods) and transiently (5 min period following peak 5 min activity period), was analysed. Collectively, variability was higher for TSD versus HSR and THSR and lowest for distance run at ≥80% MAS (CVs: 37.1%, 18.1%, 19.8% and 11.8%). THSR CVs when the team was in/out of ball possession, in individual ball possession and during the peak 5 min period were 31.5%, 26.1%, 60.1% and 23.9%. Variability in THSR declines across halves, at the end of play and transiently, ranged from 37.1% to 142.6%, while lower CVs were observed in these metrics for running at ≥80% MAS (20.9-53.3%).These results cast doubt on the appropriateness of general measures of high-speed activity for determining variability in an elite soccer team, although individualisation of HSR thresholds according to fitness characteristics might provide more stable indicators of running performance and fatigue occurrence.
Directory of Open Access Journals (Sweden)
Mingzhe Su
Full Text Available The traditional scale invariant feature transform (SIFT method can extract distinctive features for image matching. However, it is extremely time-consuming in SIFT matching because of the use of the Euclidean distance measure. Recently, many binary SIFT (BSIFT methods have been developed to improve matching efficiency; however, none of them is invariant to mirror reflection. To address these problems, in this paper, we present a horizontal or vertical mirror reflection invariant binary descriptor named MBR-SIFT, in addition to a novel image matching approach. First, 16 cells in the local region around the SIFT keypoint are reorganized, and then the 128-dimensional vector of the SIFT descriptor is transformed into a reconstructed vector according to eight directions. Finally, the MBR-SIFT descriptor is obtained after binarization and reverse coding. To improve the matching speed and accuracy, a fast matching algorithm that includes a coarse-to-fine two-step matching strategy in addition to two similarity measures for the MBR-SIFT descriptor are proposed. Experimental results on the UKBench dataset show that the proposed method not only solves the problem of mirror reflection, but also ensures desirable matching accuracy and speed.
Su, Mingzhe; Ma, Yan; Zhang, Xiangfen; Wang, Yan; Zhang, Yuping
2017-01-01
The traditional scale invariant feature transform (SIFT) method can extract distinctive features for image matching. However, it is extremely time-consuming in SIFT matching because of the use of the Euclidean distance measure. Recently, many binary SIFT (BSIFT) methods have been developed to improve matching efficiency; however, none of them is invariant to mirror reflection. To address these problems, in this paper, we present a horizontal or vertical mirror reflection invariant binary descriptor named MBR-SIFT, in addition to a novel image matching approach. First, 16 cells in the local region around the SIFT keypoint are reorganized, and then the 128-dimensional vector of the SIFT descriptor is transformed into a reconstructed vector according to eight directions. Finally, the MBR-SIFT descriptor is obtained after binarization and reverse coding. To improve the matching speed and accuracy, a fast matching algorithm that includes a coarse-to-fine two-step matching strategy in addition to two similarity measures for the MBR-SIFT descriptor are proposed. Experimental results on the UKBench dataset show that the proposed method not only solves the problem of mirror reflection, but also ensures desirable matching accuracy and speed.
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
Stable computation of generalized singular values
Energy Technology Data Exchange (ETDEWEB)
Drmac, Z.; Jessup, E.R. [Univ. of Colorado, Boulder, CO (United States)
1996-12-31
We study floating-point computation of the generalized singular value decomposition (GSVD) of a general matrix pair (A, B), where A and B are real matrices with the same numbers of columns. The GSVD is a powerful analytical and computational tool. For instance, the GSVD is an implicit way to solve the generalized symmetric eigenvalue problem Kx = {lambda}Mx, where K = A{sup {tau}}A and M = B{sup {tau}}B. Our goal is to develop stable numerical algorithms for the GSVD that are capable of computing the singular value approximations with the high relative accuracy that the perturbation theory says is possible. We assume that the singular values are well-determined by the data, i.e., that small relative perturbations {delta}A and {delta}B (pointwise rounding errors, for example) cause in each singular value {sigma} of (A, B) only a small relative perturbation {vert_bar}{delta}{sigma}{vert_bar}/{sigma}.
State of otolaryngology match: has competition increased since the "early" match?
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.
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.
Matching tomographic IMRT fields with static photon fields
International Nuclear Information System (INIS)
Sethi, A.; Leybovich, L.; Dogan, N.; Emami, B.
2001-01-01
The matching of abutting radiation fields presents a challenging problem in radiation therapy. Due to sharp penumbra of linear accelerator beams, small (1-2 mm) errors in field positioning can lead to large (>30%) hot or cold spots in the abutment region. With head and neck immobilization devices (thermoplastic mask/aquaplast) an average setup error of 3 mm has been reported. Therefore hot or cold spots approaching 50% of the prescription dose may occur along the matchline. Although abutting radiation fields have been investigated for static fields, there is no reported study regarding matching of tomographic IMRT and static fields. Compared to static fields, the matching of tomographic IMRT fields with static fields is more complicated. Since IMRT and static fields are planned on separate treatment planning computers, the dose in the abutment region is not specified. In addition, commonly used techniques for matching fields, such as feathering of junctions, are not practical. We have developed a method that substantially reduces dose inhomogeneity in the abutment region. In this method, a 'buffer zone' around the matchline was created and was included as part of the target for both IMRT and static field plans. In both fields, a small dose gradient (≤3%/mm) in the buffer zone was created. In the IMRT plan, the buffer zone was divided into three sections with dose varying from 83% to 25% of prescription dose. The static field dose profile was modified using either a specially designed physical (hard) or a dynamic (soft) wedge. When these modified fields were matched, the combined dose in the abutment region varied by ≤10% in the presence of setup errors spanning 4 mm (±2 mm) when the hard wedge was used and 10 mm (±5 mm) with the soft wedge
Sy, Jolene R.; Borrero, John C.; Borrero, Carrie S. W.
2010-01-01
We assessed problem and appropriate behavior in the natural environment from a matching perspective. Problem and appropriate behavior were conceptualized as concurrently available responses, the occurrence of which was thought to be determined by the relative rates or durations of reinforcement. We also assessed whether response allocation could…
Research on vehicles and cargos matching model based on virtual logistics platform
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.
Reduction of snapshots for MIMO radar detection by block/group orthogonal matching pursuit
Ali, Hussain El Hosiny
2014-10-01
Multiple-input multiple-output (MIMO) radar works on the principle of transmission of independent waveforms at each element of its antenna array and is widely used for surveillance purposes. In this work, we investigate MIMO radar target localization problem with compressive sensing. Specifically, we try to solve the problem of estimation of target location in MIMO radar by group and block sparsity algorithms. It will lead us to a reduced number of snapshots required and also we can achieve better radar resolution. We will use group orthogonal matching pursuit (GOMP) and block orthogonal matching pursuit (BOMP) for our problem. © 2014 IEEE.
Shape-matching soft mechanical metamaterials
Mirzaali Mazandarani, M.; Janbaz, S.; Strano, M.; Vergani, L.; Zadpoor, A.A.
2018-01-01
Architectured materials with rationally designed geometries could be used to create mechanical metamaterials with unprecedented or rare properties and functionalities. Here, we introduce "shape-matching" metamaterials where the geometry of cellular structures comprising auxetic and conventional
The Effectiveness of Advertising Matching Purchase Motivation
J. Loef (Joost); G. Antonides (Gerrit); W.F. van Raaij (Fred)
2001-01-01
textabstractSeveral authors have proposed frameworks to help advertisers predict and plan advertising effectiveness. Rossiter and Percy's advertising grid (1997) recommends that the ad appeal should match the purchase motivation or attitude base. They suggest that for utilitarian brands
Personalized Medicine: Matching Treatments to Your Genes
... Issues Subscribe December 2013 Print this issue Personalized Medicine Matching Treatments to Your Genes Send us your ... for disease, and the ways you respond to medicines are also unique. Medicines that work well for ...
Mobile Application for Pesticide Label Matching
The label matching application will give inspectors the ability to instantly compare pesticide product labels against state and federal label databases via their cell phone, tablet or other mobile device.
Study of matching between HIRFL and CSR
International Nuclear Information System (INIS)
Tang Jingyu; Li Haohu; Yuan Youjin
2001-01-01
'HIRFL-CSR Cooler Storage Ring' makes use of existing HIRFL as its pre-accelerator. In order to take the full capability of HIRFL, the authors have studied in detailed the matching modes between HIRFL and CSR. It is proposed to use two matching modes; direct matching between SFC (HIRFL injector cyclotron) and CSRm (CSR main ring); three-cascade matching of SFC, SSC (HIRFL main cyclotron) and CSRm. With these combinations, better beam transmission efficiency, better beam utilization efficiency of HIRFL-CSR accelerator complex and better operation efficiency of HIRFL can be obtained. In the first case, SSC can be used simultaneously in other purposes, either to accelerate medium energy heavy ions or to accelerate protons combined with another small cyclotron
Matching modes between HIRFL and CSR
International Nuclear Information System (INIS)
Tang, J.Y.; Li, H.H.; Yuan, Y.J.
2001-01-01
National key scientific project 'HIRFL-CSR Cooler Storage Ring' makes use of existing HIRFL as its pre-accelerator. In order to take the full capability of HIRFL, we have studied in detailed the matching modes between HIRFL and CSR. It is proposed to use two matching modes: direct matching between SFC (HIRFL injector cyclotron) and CSRm (CSR main ring), three-cascade matching of SFC, SSC (HIRFL main cyclotron) and CSRm. With these combinations, better beam transmission efficiency, better beam utilization efficiency of HIRFL-CSR accelerator complex and better operation efficiency of HIRFL can be obtained. In the first case, SSC can be used simultaneously in other purposes, either to accelerate medium energy heavy ions or to accelerate protons combined with another small cyclotron
Fractional Order Element Based Impedance Matching
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
Reliability of visual and instrumental color matching.
Igiel, Christopher; Lehmann, Karl Martin; Ghinea, Razvan; Weyhrauch, Michael; Hangx, Ysbrand; Scheller, Herbert; Paravina, Rade D
2017-09-01
The aim of this investigation was to evaluate intra-rater and inter-rater reliability of visual and instrumental shade matching. Forty individuals with normal color perception participated in this study. The right maxillary central incisor of a teaching model was prepared and restored with 10 feldspathic all-ceramic crowns of different shades. A shade matching session consisted of the observer (rater) visually selecting the best match by using VITA classical A1-D4 (VC) and VITA Toothguide 3D Master (3D) shade guides and the VITA Easyshade Advance intraoral spectrophotometer (ES) to obtain both VC and 3D matches. Three shade matching sessions were held with 4 to 6 weeks between sessions. Intra-rater reliability was assessed based on the percentage of agreement for the three sessions for the same observer, whereas the inter-rater reliability was calculated as mean percentage of agreement between different observers. The Fleiss' Kappa statistical analysis was used to evaluate visual inter-rater reliability. The mean intra-rater reliability for the visual shade selection was 64(11) for VC and 48(10) for 3D. The corresponding ES values were 96(4) for both VC and 3D. The percentages of observers who matched the same shade with VC and 3D were 55(10) and 43(12), respectively, while corresponding ES values were 88(8) for VC and 92(4) for 3D. The results for visual shade matching exhibited a high to moderate level of inconsistency for both intra-rater and inter-rater comparisons. The VITA Easyshade Advance intraoral spectrophotometer exhibited significantly better reliability compared with visual shade selection. This study evaluates the ability of observers to consistently match the same shade visually and with a dental spectrophotometer in different sessions. The intra-rater and inter-rater reliability (agreement of repeated shade matching) of visual and instrumental tooth color matching strongly suggest the use of color matching instruments as a supplementary tool in
Explaining the Mind: Problems, Problems
Harnad, Stevan
2001-01-01
The mind/body problem is the feeling/function problem: How and why do feeling systems feel? The problem is not just "hard" but insoluble (unless one is ready to resort to telekinetic dualism). Fortunately, the "easy" problems of cognitive science (such as the how and why of categorization and language) are not insoluble. Five books (by Damasio, Edelman/Tononi...
Unconditionally stable diffusion-acceleration of the transport equation
International Nuclear Information System (INIS)
Larson, E.W.
1982-01-01
The standard iterative procedure for solving fixed-source discrete-ordinates problems converges very slowly for problems in optically thick regions with scattering ratios c near unity. The diffusion-synthetic acceleration method has been proposed to make use of the fact that for this class of problems, the diffusion equation is often an accurate approximation to the transport equation. However, stability difficulties have historically hampered the implementation of this method for general transport differencing schemes. In this article we discuss a recently developed procedure for obtaining unconditionally stable diffusion-synthetic acceleration methods for various transport differencing schemes. We motivate the analysis by first discussing the exact transport equation; then we illustrate the procedure by deriving a new stable acceleration method for the linear discontinuous transport differencing scheme. We also provide some numerical results
Unconditionally stable diffusion-acceleration of the transport equation
International Nuclear Information System (INIS)
Larsen, E.W.
1982-01-01
The standard iterative procedure for solving fixed-source discrete-ordinates problems converges very slowly for problems in optically large regions with scattering ratios c near unity. The diffusion-synthetic acceleration method has been proposed to make use of the fact that for this class of problems the diffusion equation is often an accurate approximation to the transport equation. However, stability difficulties have historically hampered the implementation of this method for general transport differencing schemes. In this article we discuss a recently developed procedure for obtaining unconditionally stable diffusion-synthetic acceleration methods for various transport differencing schemes. We motivate the analysis by first discussing the exact transport equation; then we illustrate the procedure by deriving a new stable acceleration method for the linear discontinuous transport differencing scheme. We also provide some numerical results
Modelling relationships between match events and match outcome in elite football.
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.
Fingerprint Recognition Using Minutia Score Matching
J, Ravi.; Raja, K. B.; R, Venugopal. K.
2010-01-01
The popular Biometric used to authenticate a person is Fingerprint which is unique and permanent throughout a person’s life. A minutia matching is widely used for fingerprint recognition and can be classified as ridge ending and ridge bifurcation. In this paper we projected Fingerprint Recognition using Minutia Score Matching method (FRMSM). For Fingerprint thinning, the Block Filter is used, which scans the image at the boundary to preserves the quality of the image and extract the minutiae ...
Caruso, Raul
2007-01-01
The phenomenon of match-fixing does constitute a constant element of sport contests. This paper presents a simple formal model in order to explain it. The intuition behind is that an asymmetry in the evaluation of the stake is the key factor leading to match-fixing. In sum, this paper considers a partial equilibrium model of contest where two asymmetric, rational and risk-neutral opponents evaluate differently a contested stake. Differently from common contest models, agents have the option ...
INFORMATION SYSTEMS AUDIT CURRICULA CONTENT MATCHING
Vasile-Daniel CARDOȘ; Ildikó Réka CARDOȘ
2014-01-01
Financial and internal auditors must cope with the challenge of performing their mission in technology enhanced environment. In this article we match the information technology description found in the International Federation of Accountants (IFAC) and the Institute of Internal Auditors (IIA) curricula against the Model Curriculum issued by the Information Systems Audit and Control Association (ISACA). By reviewing these three curricula, we matched the content in the ISACA Model Curriculum wi...
Fast group matching for MR fingerprinting reconstruction.
Cauley, Stephen F; Setsompop, Kawin; Ma, Dan; Jiang, Yun; Ye, Huihui; Adalsteinsson, Elfar; Griswold, Mark A; Wald, Lawrence L
2015-08-01
MR fingerprinting (MRF) is a technique for quantitative tissue mapping using pseudorandom measurements. To estimate tissue properties such as T1 , T2 , proton density, and B0 , the rapidly acquired data are compared against a large dictionary of Bloch simulations. This matching process can be a very computationally demanding portion of MRF reconstruction. We introduce a fast group matching algorithm (GRM) that exploits inherent correlation within MRF dictionaries to create highly clustered groupings of the elements. During matching, a group specific signature is first used to remove poor matching possibilities. Group principal component analysis (PCA) is used to evaluate all remaining tissue types. In vivo 3 Tesla brain data were used to validate the accuracy of our approach. For a trueFISP sequence with over 196,000 dictionary elements, 1000 MRF samples, and image matrix of 128 × 128, GRM was able to map MR parameters within 2s using standard vendor computational resources. This is an order of magnitude faster than global PCA and nearly two orders of magnitude faster than direct matching, with comparable accuracy (1-2% relative error). The proposed GRM method is a highly efficient model reduction technique for MRF matching and should enable clinically relevant reconstruction accuracy and time on standard vendor computational resources. © 2014 Wiley Periodicals, Inc.
Hybrid-Based Dense Stereo Matching
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.
Stable propagation of interacting crack systems and modeling of damage
International Nuclear Information System (INIS)
Bazant, Z.P.; Tabbara, M.R.
1989-01-01
This paper presents general thermodynamic criteria for the stable states and stable path of structures with an interacting system of cracks. In combination with numerical finite element results for various cracked structure geometries, these criteria indicate that the crack response path of structures may exhibit bifurcations, after which the symmetry of the crack system is broken and some cracks grow preferentially. The problem is of interest for the prediction of ultimate loads, ductility and energy absorption capability of nuclear concrete structures as well as structures made of composites and ceramics
Stable isotope geochemistry : definitions, terminology, measurement and some applications
International Nuclear Information System (INIS)
Faure, K.
2005-01-01
In 1936, Alfred Nier produced the first precise measurement of isotope abundance ratios and his design still remains the basis of stable isotope mass spectrometry. With this gift from the physicists for routine measurement of isotope ratios, earth scientists began to explore the natural variations of isotopes. Thus began a new era in geoscience research with the hydrological cycle and marine palaeoclimatic research being the first topics to be investigated. Stable isotope measurements have been applied to many fundamental problems in geochemistry, petrology and paleoclimatology, as well as related fields in archaeology, anthropology, physical chemistry, biology and forensic sciences. (author). 52 refs., 11 figs., 2 tabs
Zhang, K.; Sheng, Y. H.; Li, Y. Q.; Han, B.; Liang, Ch.; Sha, W.
2006-10-01
In the field of digital photogrammetry and computer vision, the determination of conjugate points in a stereo image pair, referred to as "image matching," is the critical step to realize automatic surveying and recognition. Traditional matching methods encounter some problems in the digital close-range stereo photogrammetry, because the change of gray-scale or texture is not obvious in the close-range stereo images. The main shortcoming of traditional matching methods is that geometric information of matching points is not fully used, which will lead to wrong matching results in regions with poor texture. To fully use the geometry and gray-scale information, a new stereo image matching algorithm is proposed in this paper considering the characteristics of digital close-range photogrammetry. Compared with the traditional matching method, the new algorithm has three improvements on image matching. Firstly, shape factor, fuzzy maths and gray-scale projection are introduced into the design of synthetical matching measure. Secondly, the topology connecting relations of matching points in Delaunay triangulated network and epipolar-line are used to decide matching order and narrow the searching scope of conjugate point of the matching point. Lastly, the theory of parameter adjustment with constraint is introduced into least square image matching to carry out subpixel level matching under epipolar-line constraint. The new algorithm is applied to actual stereo images of a building taken by digital close-range photogrammetric system. The experimental result shows that the algorithm has a higher matching speed and matching accuracy than pyramid image matching algorithm based on gray-scale correlation.
The hierarchy problem and the cosmological constant problem in the Standard Model
International Nuclear Information System (INIS)
Jegerlehner, Fred
2015-03-01
We argue that the SM in the Higgs phase does not suffer form a ''hierarchy problem'' and that similarly the ''cosmological constant problem'' resolves itself if we understand the SM as a low energy effective theory emerging from a cut-off medium at the Planck scale. We discuss these issues under the condition of a stable Higgs vacuum, which allows to extend the SM up to the Planck length. The bare Higgs boson mass then changes sign below the Planck scale, such the the SM in the early universe is in the symmetric phase. The cut-off enhanced Higgs mass term as well as the quartically enhanced cosmological constant term trigger the inflation of the early universe. The coefficients of the shift between bare and renormalized Higgs mass as well as of the shift between bare and renormalized vacuum energy density exhibit close-by zeros at some point below the Planck scale. The zeros are matching points between short distance and the renormalized low energy quantities. Since inflation tunes the total energy density to take the critical value of a flat universe Ω tot =ρ tot /ρ crit =Ω Λ +Ω matter +Ω radiation =1 it is obvious that Ω Λ today is of order Ω tot given that 1>Ω matter , Ω radiation >0, which saturate the total density to about 26 % only, the dominant part being dark matter(21%).
Organic synthesis with stable isotopes
International Nuclear Information System (INIS)
Daub, G.H.; Kerr, V.N.; Williams, D.L.; Whaley, T.W.
1978-01-01
Some general considerations concerning organic synthesis with stable isotopes are presented. Illustrative examples are described and discussed. The examples include DL-2-amino-3-methyl- 13 C-butanoic-3,4- 13 C 2 acid (DL-valine- 13 C 3 ); methyl oleate-1- 13 C; thymine-2,6- 13 C 2 ; 2-aminoethanesulfonic- 13 C acid (taurine- 13 C); D-glucose-6- 13 C; DL-2-amino-3-methylpentanoic-3,4- 13 C 2 acid (DL-isoleucine- 13 C 2 ); benzidine- 15 N 2 ; and 4-ethylsulfonyl-1-naphthalene-sulfonamide- 15 N
Stable isotopes - separation and application
International Nuclear Information System (INIS)
Lockhart, I.M.
1980-01-01
In this review, methods used for the separation of stable isotopes ( 12 C, 13 C, 14 N, 15 N, 16 O, 17 O, 18 O, 34 S) will be described. The synthesis of labelled compounds, techniques for detection and assay, and areas of application will also be discussed. Particular attention will be paid to the isotopes of carbon, nitrogen, and oxygen; to date, sulphur isotopes have only assumed a minor role. The field of deuterium chemistry is too extensive for adequate treatment; it will therefore be essentially excluded. (author)
Stable agents for imaging investigations
International Nuclear Information System (INIS)
Tofe, A.J.
1976-01-01
This invention concerns highly stable compounds useful in preparing technetium 99m based scintiscanning exploration agents. The compounds of this invention include a pertechnetate reducing agent or a solution of oxidized pertechnetate and an efficient proportion, sufficient to stabilize the compounds in the presence of oxygen and of radiolysis products, of ascorbic acid or a pharmaceutically acceptable salt or ester of this acid. The invention also concerns a perfected process for preparing a technetium based exploration agent, consisting in codissolving the ascorbic acid or a pharmaceutically acceptable salt or ester of such an acid and a pertechnetate reducing agent in a solution of oxidized pertechnetate [fr
... know the exact cause of your prostate problem. Prostatitis The cause of prostatitis depends on whether you ... prostate problem in men older than age 50. Prostatitis If you have a UTI, you may be ...
International Nuclear Information System (INIS)
2005-01-01
This article presents the general problems as natural disasters, consequences of global climate change, public health, the danger of criminal actions, the availability to information about problems of environment
... Staying Safe Videos for Educators Search English Español Learning Problems KidsHealth / For Kids / Learning Problems What's in ... for how to make it better. What Are Learning Disabilities? Learning disabilities aren't contagious, but they ...
... Read MoreDepression in Children and TeensRead MoreBMI Calculator Ankle ProblemsFollow this chart for more information about problems that can cause ankle pain. Our trusted Symptom Checker is written and ...
Social Welfare in One-Sided Matching Mechanisms
DEFF Research Database (Denmark)
Christodoulou, George; Filos-Ratsikas, Aris; Frederiksen, Søren Kristoffer Stiil
2016-01-01
We study the Price of Anarchy of mechanisms for the fundamental problem of social welfare maximization in one-sided matching settings, when agents have general cardinal preferences over a finite set of items. We consider both the complete and incomplete information settings and show that the two...... most well-studied mechanisms in literature, Probabilistic Serial and Random Priority have a Price of Anarchy of $O(\\sqrt{n})$. We complement our results with a lower bound of $\\Omega(\\sqrt{n})$ on the Price of Anarchy of \\emph{all} mechanisms. As a result, we conclude that these mechanisms are optimal....
The Purification Method of Matching Points Based on Principal Component Analysis
Directory of Open Access Journals (Sweden)
DONG Yang
2017-02-01
Full Text Available The traditional purification method of matching points usually uses a small number of the points as initial input. Though it can meet most of the requirements of point constraints, the iterative purification solution is easy to fall into local extreme, which results in the missing of correct matching points. To solve this problem, we introduce the principal component analysis method to use the whole point set as initial input. And thorough mismatching points step eliminating and robust solving, more accurate global optimal solution, which intends to reduce the omission rate of correct matching points and thus reaches better purification effect, can be obtained. Experimental results show that this method can obtain the global optimal solution under a certain original false matching rate, and can decrease or avoid the omission of correct matching points.
A matching approach to communicate through the plasma sheath surrounding a hypersonic vehicle
International Nuclear Information System (INIS)
Gao, Xiaotian; Jiang, Binhao
2015-01-01
In order to overcome the communication blackout problem suffered by hypersonic vehicles, a matching approach has been proposed for the first time in this paper. It utilizes a double-positive (DPS) material layer surrounding a hypersonic vehicle antenna to match with the plasma sheath enclosing the vehicle. Analytical analysis and numerical results indicate a resonance between the matched layer and the plasma sheath will be formed to mitigate the blackout problem in some conditions. The calculated results present a perfect radiated performance of the antenna, when the match is exactly built between these two layers. The effects of the parameters of the plasma sheath have been researched by numerical methods. Based on these results, the proposed approach is easier to realize and more flexible to the varying radiated conditions in hypersonic flight comparing with other methods
Stable nuclear transformation of Eudorina elegans
Directory of Open Access Journals (Sweden)
Lerche Kai
2013-02-01
Full Text Available Abstract Background A fundamental step in evolution was the transition from unicellular to differentiated, multicellular organisms. Volvocine algae have been used for several decades as a model lineage to investigate the evolutionary aspects of multicellularity and cellular differentiation. There are two well-studied volvocine species, a unicellular alga (Chlamydomonas reinhardtii and a multicellular alga with differentiated cell types (Volvox carteri. Species with intermediate characteristics also exist, which blur the boundaries between unicellularity and differentiated multicellularity. These species include the globular alga Eudorina elegans, which is composed of 16–32 cells. However, detailed molecular analyses of E. elegans require genetic manipulation. Unfortunately, genetic engineering has not yet been established for Eudorina, and only limited DNA and/or protein sequence information is available. Results Here, we describe the stable nuclear transformation of E. elegans by particle bombardment using both a chimeric selectable marker and reporter genes from different heterologous sources. Transgenic algae resistant to paromomycin were achieved using the aminoglycoside 3′-phosphotransferase VIII (aphVIII gene of Streptomyces rimosus, an actinobacterium, under the control of an artificial promoter consisting of two V. carteri promoters in tandem. Transformants exhibited an increase in resistance to paromomycin by up to 333-fold. Co-transformation with non-selectable plasmids was achieved with a rate of 50 - 100%. The luciferase (gluc gene from the marine copepod Gaussia princeps, which previously was engineered to match the codon usage of C. reinhardtii, was used as a reporter gene. The expression of gluc was mediated by promoters from C. reinhardtii and V. carteri. Heterologous heat shock promoters induced an increase in luciferase activity (up to 600-fold at elevated temperatures. Long-term stability and both constitutive and
Preimplantation genetic diagnosis with HLA matching.
Rechitsky, Svetlana; Kuliev, Anver; Tur-Kaspa, Illan; Morris, Randy; Verlinsky, Yury
2004-08-01
Preimplantation genetic diagnosis (PGD) has recently been offered in combination with HLA typing, which allowed a successful haematopoietic reconstitution in affected siblings with Fanconi anaemia by transplantation of stem cells obtained from the HLA-matched offspring resulting from PGD. This study presents the results of the first PGD practical experience performed in a group of couples at risk for producing children with genetic disorders. These parents also requested preimplantation HLA typing for treating the affected children in the family, who required HLA-matched stem cell transplantation. Using a standard IVF procedure, oocytes or embryos were tested for causative gene mutations simultaneously with HLA alleles, selecting and transferring only those unaffected embryos, which were HLA matched to the affected siblings. The procedure was performed for patients with children affected by Fanconi anaemia (FANC) A and C, different thalassaemia mutations, Wiscott-Aldrich syndrome, X-linked adrenoleukodystrophy, X-linked hyperimmunoglobulin M syndrome and X-linked hypohidrotic ectodermal displasia with immune deficiency. Overall, 46 PGD cycles were performed for 26 couples, resulting in selection and transfer of 50 unaffected HLA-matched embryos in 33 cycles, yielding six HLA-matched clinical pregnancies and the birth of five unaffected HLA-matched children. Despite the controversy of PGD use for HLA typing, the data demonstrate the usefulness of this approach for at-risk couples, not only to avoid the birth of affected children with an inherited disease, but also for having unaffected children who may also be potential HLA-matched donors of stem cells for treatment of affected siblings.
Stable cosmology in chameleon bigravity
De Felice, Antonio; Mukohyama, Shinji; Oliosi, Michele; Watanabe, Yota
2018-02-01
The recently proposed chameleonic extension of bigravity theory, by including a scalar field dependence in the graviton potential, avoids several fine-tunings found to be necessary in usual massive bigravity. In particular it ensures that the Higuchi bound is satisfied at all scales, that no Vainshtein mechanism is needed to satisfy Solar System experiments, and that the strong coupling scale is always above the scale of cosmological interest all the way up to the early Universe. This paper extends the previous work by presenting a stable example of cosmology in the chameleon bigravity model. We find a set of initial conditions and parameters such that the derived stability conditions on general flat Friedmann background are satisfied at all times. The evolution goes through radiation-dominated, matter-dominated, and de Sitter eras. We argue that the parameter space allowing for such a stable evolution may be large enough to encompass an observationally viable evolution. We also argue that our model satisfies all known constraints due to gravitational wave observations so far and thus can be considered as a unique testing ground of gravitational wave phenomenologies in bimetric theories of gravity.
Mackeprang, Rasmus
2007-01-01
Several extensions to the SM feature heavy long-lived particles with masses of O(10^2-10^3 GeV) and mean lifetimes fulfilling $CT \\geq 10m$. Among such theories are supersymmetric scenarios as well as extra-dimensional models in which the heavy new particles are seen as Kaluza-Klein excitations of the well-known SM particles. Such particles will, from the point of view of a collider experiment be seen as stable. This thesis is concerned with the case where the exotic heavy particles emph{can} be considered stable while traversing the detector. Specifically the case is considered where the particles in question carry the charge of the strong nuclear force, commonly referred to as emph{colour charge}. A simulation kit has been developed using GEANT4. This framework is the current standard in experimental particle physics for the simulation of interactions of particles with matter, and it is used extensively for detector simulation. The simulation describes the interactions of these particles with matter which i...
Wage Differentials in the Presence of Unobserved Worker, Firm, and Match Heterogeneity
Woodcock, Simon
2006-01-01
We consider the problem of estimating and decomposing wage differentials in the presence of unobserved worker, firm, and match heterogeneity. Controlling for these unobservables corrects omitted variable bias in previous studies. It also allows us to measure the contribution of unmeasured characteristics of workers, firms, and worker-firm matches to observed wage differentials. An application to linked employer-employee data shows that decompositions of inter-industry earnings differentials a...
An improved ASIFT algorithm for indoor panorama image matching
Fu, Han; Xie, Donghai; Zhong, Ruofei; Wu, Yu; Wu, Qiong
2017-07-01
The generation of 3D models for indoor objects and scenes is an attractive tool for digital city, virtual reality and SLAM purposes. Panoramic images are becoming increasingly more common in such applications due to their advantages to capture the complete environment in one single image with large field of view. The extraction and matching of image feature points are important and difficult steps in three-dimensional reconstruction, and ASIFT is a state-of-the-art algorithm to implement these functions. Compared with the SIFT algorithm, more feature points can be generated and the matching accuracy of ASIFT algorithm is higher, even for the panoramic images with obvious distortions. However, the algorithm is really time-consuming because of complex operations and performs not very well for some indoor scenes under poor light or without rich textures. To solve this problem, this paper proposes an improved ASIFT algorithm for indoor panoramic images: firstly, the panoramic images are projected into multiple normal perspective images. Secondly, the original ASIFT algorithm is simplified from the affine transformation of tilt and rotation with the images to the only tilt affine transformation. Finally, the results are re-projected to the panoramic image space. Experiments in different environments show that this method can not only ensure the precision of feature points extraction and matching, but also greatly reduce the computing time.
Content Based Image Matching for Planetary Science
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
Dawson, Michael R W; Dupuis, Brian; Spetch, Marcia L; Kelly, Debbie M
2009-08-01
The matching law (Herrnstein 1961) states that response rates become proportional to reinforcement rates; this is related to the empirical phenomenon called probability matching (Vulkan 2000). Here, we show that a simple artificial neural network generates responses consistent with probability matching. This behavior was then used to create an operant procedure for network learning. We use the multiarmed bandit (Gittins 1989), a classic problem of choice behavior, to illustrate that operant training balances exploiting the bandit arm expected to pay off most frequently with exploring other arms. Perceptrons provide a medium for relating results from neural networks, genetic algorithms, animal learning, contingency theory, reinforcement learning, and theories of choice.
Recent Developments in the External Conjugate-T Matching Project at JET
International Nuclear Information System (INIS)
Monakhov, I.; Walden, A.
2007-01-01
The External Conjugate-T (ECT) matching system is planned for installation on two A2 ICRH antenna arrays at JET in 2007. This will enhance the operational capabilities of the RF plant during ELMy plasma scenarios and create new opportunities for ITER-relevant matching studies. The main features of the project are discussed in the paper focusing on the specific challenges of the ECT automatic matching and arc detection in optimized ELM-tolerant configurations. A 'co/counter-clockwise' automatic control mode selection and an Advanced Wave Amplitude Comparison System (AWACS) complementing the existing VSWR monitoring are proposed as simple and viable solutions to the identified problems
Theory and design of broadband matching networks applied electricity and electronics
Chen, Wai-Kai
1976-01-01
Theory and Design of Broadband Matching Networks centers on the network theory and its applications to the design of broadband matching networks and amplifiers. Organized into five chapters, this book begins with a description of the foundation of network theory. Chapter 2 gives a fairly complete exposition of the scattering matrix associated with an n-port network. Chapter 3 considers the approximation problem along with a discussion of the approximating functions. Chapter 4 explains the Youla's theory of broadband matching by illustrating every phase of the theory with fully worked out examp
Optimally Joint Subcarrier Matching and Power Allocation in OFDM Multihop System
Directory of Open Access Journals (Sweden)
Shuyuan Yang
2008-04-01
Full Text Available Orthogonal frequency division multiplexing (OFDM multihop system is a promising way to increase capacity and coverage. In this paper, we propose an optimally joint subcarrier matching and power allocation scheme to further maximize the total channel capacity with the constrained total system power. First, the problem is formulated as a mixed binary integer programming problem, which is prohibitive to find the global optimum in terms of complexity. Second, by making use of the equivalent channel power gain for any matched subcarrier pair, a low complexity scheme is proposed. The optimal subcarrier matching is to match subcarriers by the order of the channel power gains. The optimal power allocation among the matched subcarrier pairs is water-filling. An analytical argument is given to prove that the two steps achieve the optimally joint subcarrier matching and power allocation. The simulation results show that the proposed scheme achieves the largest total channel capacity as compared to the other schemes, where there is no subcarrier matching or no power allocation.
Optimally Joint Subcarrier Matching and Power Allocation in OFDM Multihop System
Directory of Open Access Journals (Sweden)
Wang Wenyi
2008-01-01
Full Text Available Orthogonal frequency division multiplexing (OFDM multihop system is a promising way to increase capacity and coverage. In this paper, we propose an optimally joint subcarrier matching and power allocation scheme to further maximize the total channel capacity with the constrained total system power. First, the problem is formulated as a mixed binary integer programming problem, which is prohibitive to find the global optimum in terms of complexity. Second, by making use of the equivalent channel power gain for any matched subcarrier pair, a low complexity scheme is proposed. The optimal subcarrier matching is to match subcarriers by the order of the channel power gains. The optimal power allocation among the matched subcarrier pairs is water-filling. An analytical argument is given to prove that the two steps achieve the optimally joint subcarrier matching and power allocation. The simulation results show that the proposed scheme achieves the largest total channel capacity as compared to the other schemes, where there is no subcarrier matching or no power allocation.
A review on compressed pattern matching
Directory of Open Access Journals (Sweden)
Surya Prakash Mishra
2016-09-01
Full Text Available Compressed pattern matching (CPM refers to the task of locating all the occurrences of a pattern (or set of patterns inside the body of compressed text. In this type of matching, pattern may or may not be compressed. CPM is very useful in handling large volume of data especially over the network. It has many applications in computational biology, where it is useful in finding similar trends in DNA sequences; intrusion detection over the networks, big data analytics etc. Various solutions have been provided by researchers where pattern is matched directly over the uncompressed text. Such solution requires lot of space and consumes lot of time when handling the big data. Various researchers have proposed the efficient solutions for compression but very few exist for pattern matching over the compressed text. Considering the future trend where data size is increasing exponentially day-by-day, CPM has become a desirable task. This paper presents a critical review on the recent techniques on the compressed pattern matching. The covered techniques includes: Word based Huffman codes, Word Based Tagged Codes; Wavelet Tree Based Indexing. We have presented a comparative analysis of all the techniques mentioned above and highlighted their advantages and disadvantages.
Optimally matching support and perceived spousal sensitivity.
Cutrona, Carolyn E; Shaffer, Philip A; Wesner, Kristin A; Gardner, Kelli A
2007-12-01
Partner sensitivity is an important antecedent of both intimacy (H. T. Reis & P. Shaver, 1988) and attachment (M. D. S. Ainsworth, 1989). On the basis of the optimal matching model of social support (C. E. Cutrona & D. Russell, 1990), support behaviors that "matched" the support goals of the stressed individual were predicted to lead to the perception of partner sensitivity. Predictions were tested with 59 married couples, who engaged in a videotaped self-disclosure task. Matching support was defined as the disclosure of emotions followed by emotional support or a request for information followed by informational support. Partial evidence was found for the predictions. Matching support following the disclosure of emotions was predictive of perceived partner sensitivity. Mismatched support following the disclosure of emotions predicted lower marital satisfaction, through the mediation of partner sensitivity. Matching support following a request for information was not predictive of perceived partner sensitivity, but negative partner responses (e.g., criticism or sarcasm) following a request for information negatively predicted perceptions of partner sensitivity. The importance of considering the context of support transactions is discussed.
Match Analysis in Volleyball: a systematic review
Directory of Open Access Journals (Sweden)
Miguel Silva
2016-03-01
Full Text Available The present article aims to review the available literature on match analysis in adult male Volleyball. Specific key words "performance analysis", "match analysis", "game analysis", "notational analysis", "tactical analysis", "technical analysis", "outcome" and "skills" were used to search relevant databases (PubMed, Web of Science, SportDiscus, Academic Search Complete and the International Journal of Performance Analysis in Sport. The research was conducted according to PRISMA (Preferred Reporting Items for Systematic reviews and Meta analyses guidelines. Of 3407 studies initially identified, only 34 were fully reviewed, and their outcome measures extracted and analyzed. Studies that fit all inclusion criteria were organized into two levels of analysis, according to their research design (comparative or predictive and depending on the type of variables analyzed (skills and their relationship with success, play position and match phase. Results show that from a methodological point of view, comparative studies where currently complemented with some predictive studies. This predictive approach emerged with the aim to identify the relationship between variables, considering their possible interactions and consequently its effect on team performance, contributing to a better understanding of Volleyball game performance through match analysis. Taking into account the limitations of the reviewed studies, future research should provide comprehensive operational definitions for the studied variables, using more recent samples, and consider integrating the player positions and match phase contexts into the analysis of Volleyball.
Iris Matching Based on Personalized Weight Map.
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.
Self-similar anomalous diffusion and Levy-stable laws
International Nuclear Information System (INIS)
Uchaikin, Vladimir V
2003-01-01
Stochastic principles for constructing the process of anomalous diffusion are considered, and corresponding models of random processes are reviewed. The self-similarity and the independent-increments principles are used to extend the notion of diffusion process to the class of Levy-stable processes. Replacing the independent-increments principle with the renewal principle allows us to take the next step in generalizing the notion of diffusion, which results in fractional-order partial space-time differential equations of diffusion. Fundamental solutions to these equations are represented in terms of stable laws, and their relationship to the fractality and memory of the medium is discussed. A new class of distributions, called fractional stable distributions, is introduced. (reviews of topical problems)
High precision and stable structures for particle detectors
Da Mota Silva, S; Hauviller, Claude
1999-01-01
The central detectors used in High Energy Physics Experiments require the use of light and stable structures capable of supporting delicate and precise radiation detection elements. These structures need to be highly stable under environmental conditions where external vibrations, high radiation levels, temperature and humidity gradients should be taken into account. Their main design drivers are high dimension and dynamic stability, high stiffness to mass ratio and large radiation length. For most applications, these constraints lead us to choose Carbon Fiber Reinforced Plastics ( CFRP) as structural element. The construction of light and stable structures with CFRP for these applications can be achieved by careful design engineering and further confirmation at the prototyping phase. However, the experimental environment can influence their characteristics and behavior. In this case, theuse of adaptive structures could become a solution for this problem. We are studying structures in CFRP with bonded piezoel...
PREDICTING THE MATCH OUTCOME IN ONE DAY INTERNATIONAL CRICKET MATCHES, WHILE THE GAME IS IN PROGRESS
Directory of Open Access Journals (Sweden)
Michael Bailey
2006-12-01
Full Text Available Millions of dollars are wagered on the outcome of one day international (ODI cricket matches, with a large percentage of bets occurring after the game has commenced. Using match information gathered from all 2200 ODI matches played prior to January 2005, a range of variables that could independently explain statistically significant proportions of variation associated with the predicted run totals and match outcomes were created. Such variables include home ground advantage, past performances, match experience, performance at the specific venue, performance against the specific opposition, experience at the specific venue and current form. Using a multiple linear regression model, prediction variables were numerically weighted according to statistical significance and used to predict the match outcome. With the use of the Duckworth-Lewis method to determine resources remaining, at the end of each completed over, the predicted run total of the batting team could be updated to provide a more accurate prediction of the match outcome. By applying this prediction approach to a holdout sample of matches, the efficiency of the "in the run" wagering market could be assessed. Preliminary results suggest that the market is prone to overreact to events occurring throughout the course of the match, thus creating brief inefficiencies in the wagering market
New robust stable MPC using linear matrix inequalities
Directory of Open Access Journals (Sweden)
M.A. Rodrigues
2000-03-01
Full Text Available This paper addresses the stability of Model Predictive Control (MPC with output feedback. The proposed controller uses a new state-space formulation of the system, and the control problem is presented as an LMI optimization problem. The stability condition for the closed loop is included as a Lyapunov inequality. The resulting optimization problem becomes nonlinear with the inclusion of the stabilizing condition. A suboptimal solution is developed and the problem reduces to a pair of coupled LMI problems. An iterative solution that converges to a stable output feedback gain is proposed. A polytopic set of process models can be considered. A simulation example is included in the paper and shows that the proposed strategy eliminates the usual practice of enforcing robustness by detuning the MP controller.
Stable isotope mass spectrometry in petroleum exploration
International Nuclear Information System (INIS)
Mathur, Manju
1997-01-01
The stable isotope mass spectrometry plays an important role to evaluate the stable isotopic composition of hydrocarbons. The isotopic ratios of certain elements in petroleum samples reflect certain characteristics which are useful for petroleum exploration
Sparse and stable Markowitz portfolios.
Brodie, Joshua; Daubechies, Ingrid; De Mol, Christine; Giannone, Domenico; Loris, Ignace
2009-07-28
We consider the problem of portfolio selection within the classical Markowitz mean-variance framework, reformulated as a constrained least-squares regression problem. We propose to add to the objective function a penalty proportional to the sum of the absolute values of the portfolio weights. This penalty regularizes (stabilizes) the optimization problem, encourages sparse portfolios (i.e., portfolios with only few active positions), and allows accounting for transaction costs. Our approach recovers as special cases the no-short-positions portfolios, but does allow for short positions in limited number. We implement this methodology on two benchmark data sets constructed by Fama and French. Using only a modest amount of training data, we construct portfolios whose out-of-sample performance, as measured by Sharpe ratio, is consistently and significantly better than that of the naïve evenly weighted portfolio.
Shape-matching soft mechanical metamaterials.
Mirzaali, M J; Janbaz, S; Strano, M; Vergani, L; Zadpoor, A A
2018-01-17
Architectured materials with rationally designed geometries could be used to create mechanical metamaterials with unprecedented or rare properties and functionalities. Here, we introduce "shape-matching" metamaterials where the geometry of cellular structures comprising auxetic and conventional unit cells is designed so as to achieve a pre-defined shape upon deformation. We used computational models to forward-map the space of planar shapes to the space of geometrical designs. The validity of the underlying computational models was first demonstrated by comparing their predictions with experimental observations on specimens fabricated with indirect additive manufacturing. The forward-maps were then used to devise the geometry of cellular structures that approximate the arbitrary shapes described by random Fourier's series. Finally, we show that the presented metamaterials could match the contours of three real objects including a scapula model, a pumpkin, and a Delft Blue pottery piece. Shape-matching materials have potential applications in soft robotics and wearable (medical) devices.
Improved Stereo Matching With Boosting Method
Directory of Open Access Journals (Sweden)
Shiny B
2015-06-01
Full Text Available Abstract This paper presents an approach based on classification for improving the accuracy of stereo matching methods. We propose this method for occlusion handling. This work employs classification of pixels for finding the erroneous disparity values. Due to the wide applications of disparity map in 3D television medical imaging etc the accuracy of disparity map has high significance. An initial disparity map is obtained using local or global stereo matching methods from the input stereo image pair. The various features for classification are computed from the input stereo image pair and the obtained disparity map. Then the computed feature vector is used for classification of pixels by using GentleBoost as the classification method. The erroneous disparity values in the disparity map found by classification are corrected through a completion stage or filling stage. A performance evaluation of stereo matching using AdaBoostM1 RUSBoost Neural networks and GentleBoost is performed.
Covariant diagrams for one-loop matching
International Nuclear Information System (INIS)
Zhang, Zhengkang
2016-10-01
We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative expansion (CDE) are represented by diagrams which, unlike conventional Feynman diagrams, involve gaugecovariant quantities and are thus dubbed ''covariant diagrams.'' The use of covariant diagrams helps organize and simplify one-loop matching calculations, which we illustrate with examples. Of particular interest is the derivation of UV model-independent universal results, which reduce matching calculations of specific UV models to applications of master formulas. We show how such derivation can be done in a more concise manner than the previous literature, and discuss how additional structures that are not directly captured by existing universal results, including mixed heavy-light loops, open covariant derivatives, and mixed statistics, can be easily accounted for.
6d, Coulomb branch anomaly matching
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.
Matching to Openly Innovate with Suppliers
DEFF Research Database (Denmark)
Laursen, Linda Nhu
2017-01-01
heterogeneous suppliers with the internal organisation in order to openly innovate. More specifically, it focuses on a governance mode, recently emerged in practice, by which firms summon their suppliers and their own internal organisation at an event to match them for open innovation activities – innovation......When large firms choose to involve their many suppliers in open innovation, they are faced with a set of challenges pertaining to the governance of several suppliers. Suppliers are heterogeneous, offering heterogeneous materials, products, information, services, and knowledge, which are differently...... organized across functions and hierarchies. To make use of such heterogeneous resources, a critical challenge for open innovation is to pair a supplier resource with a suitable opportunity-for-use from within the firm – a challenge of matching. This dissertation addresses the challenge of matching...
INFORMATION SYSTEMS AUDIT CURRICULA CONTENT MATCHING
Directory of Open Access Journals (Sweden)
Vasile-Daniel CARDOȘ
2014-11-01
Full Text Available Financial and internal auditors must cope with the challenge of performing their mission in technology enhanced environment. In this article we match the information technology description found in the International Federation of Accountants (IFAC and the Institute of Internal Auditors (IIA curricula against the Model Curriculum issued by the Information Systems Audit and Control Association (ISACA. By reviewing these three curricula, we matched the content in the ISACA Model Curriculum with the IFAC International Education Practice Statement 2 and the IIAs’ Global Model Internal Audit Curriculum. In the IFAC and IIA Curriculum there are 16 content elements, out of 19 possible, which match, in their description, the ISACA Model Curriculum’s content. We noticed that a candidate who graduates an IFAC or IIA compliant program acquire IS auditing competences similar to the specific content of the ISACA model curriculum but less than the requirements for a professional information systems auditor.
Covariant diagrams for one-loop matching
Energy Technology Data Exchange (ETDEWEB)
Zhang, Zhengkang [Michigan Center for Theoretical Physics (MCTP), University of Michigan,450 Church Street, Ann Arbor, MI 48109 (United States); Deutsches Elektronen-Synchrotron (DESY),Notkestraße 85, 22607 Hamburg (Germany)
2017-05-30
We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative expansion (CDE) are represented by diagrams which, unlike conventional Feynman diagrams, involve gauge-covariant quantities and are thus dubbed “covariant diagrams.” The use of covariant diagrams helps organize and simplify one-loop matching calculations, which we illustrate with examples. Of particular interest is the derivation of UV model-independent universal results, which reduce matching calculations of specific UV models to applications of master formulas. We show how such derivation can be done in a more concise manner than the previous literature, and discuss how additional structures that are not directly captured by existing universal results, including mixed heavy-light loops, open covariant derivatives, and mixed statistics, can be easily accounted for.
A medium resolution fingerprint matching system
Directory of Open Access Journals (Sweden)
Ayman Mohammad Bahaa-Eldin
2013-09-01
Full Text Available In this paper, a novel minutiae based fingerprint matching system is proposed. The system is suitable for medium resolution fingerprint images obtained by low cost commercial sensors. The paper presents a new thinning algorithm, a new features extraction and representation, and a novel feature distance matching algorithm. The proposed system is rotation and translation invariant and is suitable for complete or partial fingerprint matching. The proposed algorithms are optimized to be executed on low resource environments both in CPU power and memory space. The system was evaluated using a standard fingerprint dataset and good performance and accuracy were achieved under certain image quality requirements. In addition, the proposed system was compared favorably to that of the state of the art systems.
Covariant diagrams for one-loop matching
Energy Technology Data Exchange (ETDEWEB)
Zhang, Zhengkang [Michigan Univ., Ann Arbor, MI (United States). Michigan Center for Theoretical Physics; Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)
2016-10-15
We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative expansion (CDE) are represented by diagrams which, unlike conventional Feynman diagrams, involve gaugecovariant quantities and are thus dubbed ''covariant diagrams.'' The use of covariant diagrams helps organize and simplify one-loop matching calculations, which we illustrate with examples. Of particular interest is the derivation of UV model-independent universal results, which reduce matching calculations of specific UV models to applications of master formulas. We show how such derivation can be done in a more concise manner than the previous literature, and discuss how additional structures that are not directly captured by existing universal results, including mixed heavy-light loops, open covariant derivatives, and mixed statistics, can be easily accounted for.
Matching of ion sources to cyclotron inflectors
International Nuclear Information System (INIS)
Baartman, R.
1988-06-01
In general, cyclotron inflectors strongly couple the two transverse subspaces. This leads to a growth in emittance projections for a beam with no initial correlation between the two transverse subspaces. Only in the case of the Mueller (hyperboloid) inflector is there no emittance growth. We have made calculations using an optimization routine to match a given beam through the axial injection system. We find that in the limit where all the emittance is due to a beam's axial angular momentum (for example, from an ECR source), matching with no emittance growth is possible even in the case of mirror or spiral inflectors. Moreover, any one of the two transverse emittances circulating in the cyclotron can be made smaller than the source emittance while maintaining the sum of the emittances constant. This is achieved by rotating the matching quadrupoles with respect to the inflector and retuning
Covariant diagrams for one-loop matching
International Nuclear Information System (INIS)
Zhang, Zhengkang
2017-01-01
We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative expansion (CDE) are represented by diagrams which, unlike conventional Feynman diagrams, involve gauge-covariant quantities and are thus dubbed “covariant diagrams.” The use of covariant diagrams helps organize and simplify one-loop matching calculations, which we illustrate with examples. Of particular interest is the derivation of UV model-independent universal results, which reduce matching calculations of specific UV models to applications of master formulas. We show how such derivation can be done in a more concise manner than the previous literature, and discuss how additional structures that are not directly captured by existing universal results, including mixed heavy-light loops, open covariant derivatives, and mixed statistics, can be easily accounted for.
Anatomy Ontology Matching Using Markov Logic Networks
Directory of Open Access Journals (Sweden)
Chunhua Li
2016-01-01
Full Text Available The anatomy of model species is described in ontologies, which are used to standardize the annotations of experimental data, such as gene expression patterns. To compare such data between species, we need to establish relationships between ontologies describing different species. Ontology matching is a kind of solutions to find semantic correspondences between entities of different ontologies. Markov logic networks which unify probabilistic graphical model and first-order logic provide an excellent framework for ontology matching. We combine several different matching strategies through first-order logic formulas according to the structure of anatomy ontologies. Experiments on the adult mouse anatomy and the human anatomy have demonstrated the effectiveness of proposed approach in terms of the quality of result alignment.
Inhibitory mechanism of the matching heuristic in syllogistic reasoning.
Tse, Ping Ping; Moreno Ríos, Sergio; García-Madruga, Juan Antonio; Bajo Molina, María Teresa
2014-11-01
A number of heuristic-based hypotheses have been proposed to explain how people solve syllogisms with automatic processes. In particular, the matching heuristic employs the congruency of the quantifiers in a syllogism—by matching the quantifier of the conclusion with those of the two premises. When the heuristic leads to an invalid conclusion, successful solving of these conflict problems requires the inhibition of automatic heuristic processing. Accordingly, if the automatic processing were based on processing the set of quantifiers, no semantic contents would be inhibited. The mental model theory, however, suggests that people reason using mental models, which always involves semantic processing. Therefore, whatever inhibition occurs in the processing implies the inhibition of the semantic contents. We manipulated the validity of the syllogism and the congruency of the quantifier of its conclusion with those of the two premises according to the matching heuristic. A subsequent lexical decision task (LDT) with related words in the conclusion was used to test any inhibition of the semantic contents after each syllogistic evaluation trial. In the LDT, the facilitation effect of semantic priming diminished after correctly solved conflict syllogisms (match-invalid or mismatch-valid), but was intact after no-conflict syllogisms. The results suggest the involvement of an inhibitory mechanism of semantic contents in syllogistic reasoning when there is a conflict between the output of the syntactic heuristic and actual validity. Our results do not support a uniquely syntactic process of syllogistic reasoning but fit with the predictions based on mental model theory. Copyright © 2014 Elsevier B.V. All rights reserved.
Horsetail matching: a flexible approach to optimization under uncertainty
Cook, L. W.; Jarrett, J. P.
2018-04-01
It is important to design engineering systems to be robust with respect to uncertainties in the design process. Often, this is done by considering statistical moments, but over-reliance on statistical moments when formulating a robust optimization can produce designs that are stochastically dominated by other feasible designs. This article instead proposes a formulation for optimization under uncertainty that minimizes the difference between a design's cumulative distribution function and a target. A standard target is proposed that produces stochastically non-dominated designs, but the formulation also offers enough flexibility to recover existing approaches for robust optimization. A numerical implementation is developed that employs kernels to give a differentiable objective function. The method is applied to algebraic test problems and a robust transonic airfoil design problem where it is compared to multi-objective, weighted-sum and density matching approaches to robust optimization; several advantages over these existing methods are demonstrated.
Techniques Used in String Matching for Network Security
Jamuna Bhandari
2014-01-01
String matching also known as pattern matching is one of primary concept for network security. In this area the effectiveness and efficiency of string matching algorithms is important for applications in network security such as network intrusion detection, virus detection, signature matching and web content filtering system. This paper presents brief review on some of string matching techniques used for network security.
Stable rotating dipole solitons in nonlocal media
DEFF Research Database (Denmark)
Lopez-Aguayo, Servando; Skupin, Stefan; Desyatnikov, Anton S.
2006-01-01
We present the first example of stable rotating two-soliton bound states in nonlinear optical media with nonlocal response. We show that, in contrast to media with local response, nonlocality opens possibilities to generate stable azimuthons.......We present the first example of stable rotating two-soliton bound states in nonlinear optical media with nonlocal response. We show that, in contrast to media with local response, nonlocality opens possibilities to generate stable azimuthons....
Tempered stable laws as random walk limits
Chakrabarty, Arijit; Meerschaert, Mark M.
2010-01-01
Stable laws can be tempered by modifying the L\\'evy measure to cool the probability of large jumps. Tempered stable laws retain their signature power law behavior at infinity, and infinite divisibility. This paper develops random walk models that converge to a tempered stable law under a triangular array scheme. Since tempered stable laws and processes are useful in statistical physics, these random walk models can provide a basic physical model for the underlying physical phenomena.
Physiological characteristics of badminton match play.
Faude, Oliver; Meyer, Tim; Rosenberger, Friederike; Fries, Markus; Huber, Günther; Kindermann, Wilfried
2007-07-01
The present study aimed at examining the physiological characteristics and metabolic demands of badminton single match play. Twelve internationally ranked badminton players (eight women and four men) performed an incremental treadmill test [VO(2peak = )50.3 +/- 4.1 ml min(-1) kg(-1) (women) and 61.8 +/- 5.9 ml min(-1) kg(-1) (men), respectively]. On a separate day, they played a simulated badminton match of two 15 min with simultaneous gas exchange (breath-by-breath) and heart rate measurements. Additionally, blood lactate concentrations were determined before, after 15 min and at the end of the match. Furthermore, the duration of rallies and rests in between, the score as well as the number of shots per rally were recorded. A total of 630 rallies was analysed. Mean rally and rest duration were 5.5 +/- 4.4 s and 11.4 +/- 6.0 s, respectively, with an average 5.1 +/- 3.9 shots played per rally. Mean oxygen uptake (VO(2)), heart rate (HR), and blood lactate concentrations during badminton matches were 39.6 +/- 5.7 ml min(-1) kg(-1) (73.3% VO(2peak)), 169 +/- 9 min(-1) (89.0% HR(peak)) and 1.9 +/- 0.7 mmol l(-1), respectively. For a single subject 95% confidence intervals for VO(2) and HR during match play were on average 45.7-100.9% VO(2peak) and 78.3-99.8% HR(peak). High average intensity of badminton match play and considerable variability of several physiological variables demonstrate the importance of anaerobic alactacid and aerobic energy production in competitive badminton. A well-developed aerobic endurance capacity seems necessary for fast recovery between rallies or intensive training workouts.
Stable States of Biological Organisms
Yukalov, V. I.; Sornette, D.; Yukalova, E. P.; Henry, J.-Y.; Cobb, J. P.
2009-04-01
A novel model of biological organisms is advanced, treating an organism as a self-consistent system subject to a pathogen flux. The principal novelty of the model is that it describes not some parts, but a biological organism as a whole. The organism is modeled by a five-dimensional dynamical system. The organism homeostasis is described by the evolution equations for five interacting components: healthy cells, ill cells, innate immune cells, specific immune cells, and pathogens. The stability analysis demonstrates that, in a wide domain of the parameter space, the system exhibits robust structural stability. There always exist four stable stationary solutions characterizing four qualitatively differing states of the organism: alive state, boundary state, critical state, and dead state.
Super-stable Poissonian structures
International Nuclear Information System (INIS)
Eliazar, Iddo
2012-01-01
In this paper we characterize classes of Poisson processes whose statistical structures are super-stable. We consider a flow generated by a one-dimensional ordinary differential equation, and an ensemble of particles ‘surfing’ the flow. The particles start from random initial positions, and are propagated along the flow by stochastic ‘wave processes’ with general statistics and general cross correlations. Setting the initial positions to be Poisson processes, we characterize the classes of Poisson processes that render the particles’ positions—at all times, and invariantly with respect to the wave processes—statistically identical to their initial positions. These Poisson processes are termed ‘super-stable’ and facilitate the generalization of the notion of stationary distributions far beyond the realm of Markov dynamics. (paper)
Super-stable Poissonian structures
Eliazar, Iddo
2012-10-01
In this paper we characterize classes of Poisson processes whose statistical structures are super-stable. We consider a flow generated by a one-dimensional ordinary differential equation, and an ensemble of particles ‘surfing’ the flow. The particles start from random initial positions, and are propagated along the flow by stochastic ‘wave processes’ with general statistics and general cross correlations. Setting the initial positions to be Poisson processes, we characterize the classes of Poisson processes that render the particles’ positions—at all times, and invariantly with respect to the wave processes—statistically identical to their initial positions. These Poisson processes are termed ‘super-stable’ and facilitate the generalization of the notion of stationary distributions far beyond the realm of Markov dynamics.
Stable massive particles at colliders
Energy Technology Data Exchange (ETDEWEB)
Fairbairn, M.; /Stockholm U.; Kraan, A.C.; /Pennsylvania U.; Milstead, D.A.; /Stockholm U.; Sjostrand, T.; /Lund U.; Skands, P.; /Fermilab; Sloan, T.; /Lancaster U.
2006-11-01
We review the theoretical motivations and experimental status of searches for stable massive particles (SMPs) which could be sufficiently long-lived as to be directly detected at collider experiments. The discovery of such particles would address a number of important questions in modern physics including the origin and composition of dark matter in the universe and the unification of the fundamental forces. This review describes the techniques used in SMP-searches at collider experiments and the limits so far obtained on the production of SMPs which possess various colour, electric and magnetic charge quantum numbers. We also describe theoretical scenarios which predict SMPs, the phenomenology needed to model their production at colliders and interactions with matter. In addition, the interplay between collider searches and open questions in cosmology such as dark matter composition are addressed.
Famous face recognition, face matching, and extraversion.
Lander, Karen; Poyarekar, Siddhi
2015-01-01
It has been previously established that extraverts who are skilled at interpersonal interaction perform significantly better than introverts on a face-specific recognition memory task. In our experiment we further investigate the relationship between extraversion and face recognition, focusing on famous face recognition and face matching. Results indicate that more extraverted individuals perform significantly better on an upright famous face recognition task and show significantly larger face inversion effects. However, our results did not find an effect of extraversion on face matching or inverted famous face recognition.
The Myopic Stable Set for Social Environments
Demuynck, Thomas; Herings, P. Jean-Jacques; Saulle, Riccardo; Seel, Christian
2017-01-01
We introduce a new solution concept for models of coalition formation, called the myopic stable set. The myopic stable set is defined for a very general class of social environments and allows for an infinite state space. We show that the myopic stable set exists and is non-empty. Under minor
Effectiveness and risks of stable iodine prophylaxis
International Nuclear Information System (INIS)
Waight, P.J.
1995-01-01
The factors upon which the efficacy of stable iodine prophylaxis depends are reviewed, with particular reference to the dose of stable iodine, the timing of the dose, the influence of dietary iodine and the impact of the other prospective actions. The risks of stable iodine ingestion are estimated, and their application to the principle of Justification in outlined. (Author)
Temperature and Humidity Control in Livestock Stables
DEFF Research Database (Denmark)
Hansen, Michael; Andersen, Palle; Nielsen, Kirsten M.
2010-01-01
The paper describes temperature and humidity control of a livestock stable. It is important to have a correct air flow pattern in the livestock stable in order to achieve proper temperature and humidity control as well as to avoid draught. In the investigated livestock stable the air flow...
DEFF Research Database (Denmark)
Christensen, Anders Bøggild; Rasmussen, Tove; Bundesen, Peter Verner
Sociale problemer kan betragtes som selve udgangspunktet for socialt arbejde, hvor ambitionen er at råde bod på problemerne og sikre, at udsatte borgere får en bedre tilværelse. Det betyder også, at diskussionen af sociale problemer er afgørende for den sociale grundfaglighed. I denne bog sætter en...... række fagfolk på tværs af det danske socialfaglige felt fokus på sociale problemer. Det diskuteres, hvad vi overhovedet forstår ved sociale problemer, hvordan de opstår, hvilke konsekvenser de har, og ikke mindst hvordan man som fagprofessionel håndterer sociale problemer i det daglige arbejde. Bogen er...... skrevet som lærebog til professionsuddannelser, hvor sociale problemer udgør en dimension, bl.a. socialrådgiver-, pædagog- og sygeplejerskeuddannelserne....
Cauchy-perturbative matching reexamined: Tests in spherical symmetry
International Nuclear Information System (INIS)
Zink, Burkhard; Pazos, Enrique; Diener, Peter; Tiglio, Manuel
2006-01-01
During the last few years progress has been made on several fronts making it possible to revisit Cauchy-perturbative matching (CPM) in numerical relativity in a more robust and accurate way. This paper is the first in a series where we plan to analyze CPM in the light of these new results. One of the new developments is an understanding of how to impose constraint-preserving boundary conditions (CPBC); though most of the related research has been driven by outer boundaries, one can use them for matching interface boundaries as well. Another front is related to numerically stable evolutions using multiple patches, which in the context of CPM allows the matching to be performed on a spherical surface, thus avoiding interpolations between Cartesian and spherical grids. One way of achieving stability for such schemes of arbitrary high order is through the use of penalty techniques and discrete derivatives satisfying summation by parts (SBP). Recently, new, very efficient and high-order accurate derivatives satisfying SBP and associated dissipation operators have been constructed. Here we start by testing all these techniques applied to CPM in a setting that is simple enough to study all the ingredients in great detail: Einstein's equations in spherical symmetry, describing a black hole coupled to a massless scalar field. We show that with the techniques described above, the errors introduced by Cauchy-perturbative matching are very small, and that very long-term and accurate CPM evolutions can be achieved. Our tests include the accretion and ring-down phase of a Schwarzschild black hole with CPM, where we find that the discrete evolution introduces, with a low spatial resolution of Δr=M/10, an error of 0.3% after an evolution time of 1,000,000M. For a black hole of solar mass, this corresponds to approximately 5s, and is therefore at the lower end of timescales discussed e.g. in the collapsar model of gamma-ray burst engines
Energy Technology Data Exchange (ETDEWEB)
Jau, P.; Jacob, T. [HP Clairval, Service de medecine nucleaire, 13 - Marseille (France); Lecorff, G.; Bouvier, J.L.; Novella, P.; Bechet, V.; Pelet, V. [HP Clairval, Service de cardiologie, 13 - Marseille (France)
2010-03-15
We study the precise contribution of myocardial scintigraphy in the therapeutic management of stable coronary artery disease. Until recently, treatment was focused on revascularization, often by coronary angioplasty.Recent studies have challenged this practice by showing the absence of superiority of angioplasty compared to optimal medical therapy.The problem now is to define for each stable coronary artery disease, and individually, the best of both treatment options. In this spirit, the functional approach to coronary artery disease by myocardial perfusion scintigraphy is most interesting.The diagnostic performance, including sensitivity and negative predictive value, and the prognostic value of the technique are clearly established. Recent studies show that a therapeutic decision based on a functional approach to the patient is valid.We need to know this development in cardiology for best position in the multidisciplinary discussions, myocardial scintigraphy as a functional approach to stable coronary artery disease. (N.C.)
Hierarchical Matching and Regression with Application to Photometric Redshift Estimation
Murtagh, Fionn
2017-06-01
This work emphasizes that heterogeneity, diversity, discontinuity, and discreteness in data is to be exploited in classification and regression problems. A global a priori model may not be desirable. For data analytics in cosmology, this is motivated by the variety of cosmological objects such as elliptical, spiral, active, and merging galaxies at a wide range of redshifts. Our aim is matching and similarity-based analytics that takes account of discrete relationships in the data. The information structure of the data is represented by a hierarchy or tree where the branch structure, rather than just the proximity, is important. The representation is related to p-adic number theory. The clustering or binning of the data values, related to the precision of the measurements, has a central role in this methodology. If used for regression, our approach is a method of cluster-wise regression, generalizing nearest neighbour regression. Both to exemplify this analytics approach, and to demonstrate computational benefits, we address the well-known photometric redshift or `photo-z' problem, seeking to match Sloan Digital Sky Survey (SDSS) spectroscopic and photometric redshifts.
A New Model for a Carpool Matching Service.
Directory of Open Access Journals (Sweden)
Jizhe Xia
Full Text Available Carpooling is an effective means of reducing traffic. A carpool team shares a vehicle for their commute, which reduces the number of vehicles on the road during rush hour periods. Carpooling is officially sanctioned by most governments, and is supported by the construction of high-occupancy vehicle lanes. A number of carpooling services have been designed in order to match commuters into carpool teams, but it known that the determination of optimal carpool teams is a combinatorially complex problem, and therefore technological solutions are difficult to achieve. In this paper, a model for carpool matching services is proposed, and both optimal and heuristic approaches are tested to find solutions for that model. The results show that different solution approaches are preferred over different ranges of problem instances. Most importantly, it is demonstrated that a new formulation and associated solution procedures can permit the determination of optimal carpool teams and routes. An instantiation of the model is presented (using the street network of Guangzhou city, China to demonstrate how carpool teams can be determined.
Pemberian Kredit Pada Koperasi Menggunakan Metode Profile Matching
Directory of Open Access Journals (Sweden)
Budi Sudradjat
2017-09-01
Abstract Cooperatives is an institution economic have function in the process of the increase in community welfare, Travel cooperatives not easy to reach position like now. The existence of movement cooperatives as an institution economic expected to act as propulsion engine national economic activity as well as soko teachers the country economy. Bhakti BPJS Kesehatan Service Cooperative is a cooperative engaged in services, forms of cooperative services to the community one is to lend funds (credit to help resolve the financial problems in the community. In granting the credit cooperatives need to do proper research and calculations to prospective customers who will take credit cooperatives, to avoid mistakes in decision making required data processing is fast, precise and accurate. With the Application Profile Matching Method For Determining Eligibility Lending In BPJS Kesehatan Service Cooperative Bhakti is the best solution to solve the problems that exist in this company, because with this method the decision taken by the cooperative members have been more thorough and detailed than the previous. Keywords: Decision Support Systems, Profile Matching, The feasibility of the provision of credit.
Stable Beginnings in Engineering Design
McCormick, Mary E.; Hammer, David
2016-01-01
Novel Engineering activities are premised on the integration of engineering and literacy: students identify and engineer solutions to problems that arise for fictional characters in stories they read for class. There are advantages to this integration, for both engineering and literacy goals of instruction: the stories provide ''clients'' to…
Matching of analytical and numerical solutions for neutron stars of arbitrary rotation
International Nuclear Information System (INIS)
Pappas, George
2009-01-01
We demonstrate the results of an attempt to match the two-soliton analytical solution with the numerically produced solutions of the Einstein field equations, that describe the spacetime exterior of rotating neutron stars, for arbitrary rotation. The matching procedure is performed by equating the first four multipole moments of the analytical solution to the multipole moments of the numerical one. We then argue that in order to check the effectiveness of the matching of the analytical with the numerical solution we should compare the metric components, the radius of the innermost stable circular orbit (R ISCO ), the rotation frequency and the epicyclic frequencies Ω ρ , Ω z . Finally we present some results of the comparison.
Matching of analytical and numerical solutions for neutron stars of arbitrary rotation
Energy Technology Data Exchange (ETDEWEB)
Pappas, George, E-mail: gpappas@phys.uoa.g [Section of Astrophysics, Astronomy, and Mechanics, Department of Physics, University of Athens, Panepistimiopolis Zografos GR15783, Athens (Greece)
2009-10-01
We demonstrate the results of an attempt to match the two-soliton analytical solution with the numerically produced solutions of the Einstein field equations, that describe the spacetime exterior of rotating neutron stars, for arbitrary rotation. The matching procedure is performed by equating the first four multipole moments of the analytical solution to the multipole moments of the numerical one. We then argue that in order to check the effectiveness of the matching of the analytical with the numerical solution we should compare the metric components, the radius of the innermost stable circular orbit (R{sub ISCO}), the rotation frequency and the epicyclic frequencies {Omega}{sub {rho}}, {Omega}{sub z}. Finally we present some results of the comparison.
Use of stable isotopes in developing countries: safe markers for nutrition regime study
International Nuclear Information System (INIS)
Klein, P.D.; Klein, E.R.
1987-01-01
Possible use of stable radioisotopes in studies on nutrition and medicine problems that may be used in investigations of babies, children, pregnant women is shown. Attention is paid to behaviour of limited number of elements: hydrogen, carbon, nitrogen, oxygen. The IAEA plans implementation of a new coordinated research program on use of stable isotopes for studying nutrition problems and related diseases. The program emphasis will be placed on protein metabolism measurements and estimation of energy consumption in control population groups in developing countries
Dispersion and betatron matching into the linac
International Nuclear Information System (INIS)
Decker, F.J.; Adolphsen, C.; Corbett, W.J.; Emma, P.; Hsu, I.; Moshammer, H.; Seeman, J.T.; Spence, W.L.
1991-05-01
In high energy linear colliders, the low emittance beam from a damping ring has to be preserved all the way to the linac, in the linac and to the interaction point. In particular, the Ring-To-Linac (RTL) section of the SLAC Linear Collider (SLC) should provide an exact betatron and dispersion match from the damping ring to the linac. A beam with a non-zero dispersion shows up immediately as an increased emittance, while with a betatron mismatch the beam filaments in the linac. Experimental tests and tuning procedures have shown that the linearized beta matching algorithms are insufficient if the actual transport line has some unknown errors not included in the model. Also, adjusting quadrupole strengths steers the beam if it is offset in the quadrupole magnets. These and other effects have lead to a lengthy tuning process, which in the end improves the matching, but is not optimal. Different ideas will be discussed which should improve this matching procedure and make it a more reliable, faster and simpler process. 5 refs., 2 figs
Photon signature analysis using template matching
Energy Technology Data Exchange (ETDEWEB)
Bradley, D.A., E-mail: d.a.bradley@surrey.ac.uk [Department of Physics, University of Surrey, Guildford GU2 7XH (United Kingdom); Hashim, S., E-mail: suhairul@utm.my [Department of Physics, Universiti Teknologi Malaysia, 81310 Skudai, Johor (Malaysia); Saripan, M.I. [Faculty of Engineering, Universiti Putra Malaysia, 43400 Serdang, Selangor (Malaysia); Wells, K. [Centre for Vision, Speech and Signal Processing, University of Surrey, Guildford GU2 7XH (United Kingdom); Dunn, W.L. [Department of Mechanical and Nuclear Engineering, Kansas State University, 3002 Rathbone Hall, Manhattan, KS 66506 (United States)
2011-10-01
We describe an approach to detect improvised explosive devices (IEDs) by using a template matching procedure. This approach relies on the signature due to backstreaming {gamma} photons from various targets. In this work we have simulated cylindrical targets of aluminum, iron, copper, water and ammonium nitrate (nitrogen-rich fertilizer). We simulate 3.5 MeV source photons distributed on a plane inside a shielded area using Monte Carlo N-Particle (MCNP{sup TM}) code version 5 (V5). The 3.5 MeV source gamma rays yield 511 keV peaks due to pair production and scattered gamma rays. In this work, we simulate capture of those photons that backstream, after impinging on the target element, toward a NaI detector. The captured backstreamed photons are expected to produce a unique spectrum that will become part of a simple signal processing recognition system based on the template matching method. Different elements were simulated using different sets of random numbers in the Monte Carlo simulation. To date, the sum of absolute differences (SAD) method has been used to match the template. In the examples investigated, template matching was found to detect all elements correctly.
Decentralized trade with bargaining and voluntary matching
DEFF Research Database (Denmark)
Tranæs, Torben; Sloth, Birgitte; Hendon, Ebbe
1994-01-01
Rubinstein and Wolinsky (1990) study a market with one seller, two buyers, and voluntary matching. Both the competitive outcomepc and the bilateral bargaining outcomepb are possible in subgame perfect equilibrium. We consider two variations. First, if there is a cost larger thanpc−pc to the seller...
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.
Secure matching of Dutch car license plates
Sunil, A.B.; Erkiny, Z.; Veugenyz, T.
2016-01-01
License plate matching plays an important role in applications like law enforcement, traffic management and road pricing, where the plate is first recognized and then compared to a database of authorized vehicle registration plates. Unfortunately, there are several privacy related issues that should
7 CFR 3430.906 - Matching requirements.
2010-01-01
... 7 Agriculture 15 2010-01-01 2010-01-01 false Matching requirements. 3430.906 Section 3430.906 Agriculture Regulations of the Department of Agriculture (Continued) COOPERATIVE STATE RESEARCH, EDUCATION, AND EXTENSION SERVICE, DEPARTMENT OF AGRICULTURE COMPETITIVE AND NONCOMPETITIVE NON-FORMULA FEDERAL...
13 CFR 130.450 - Matching funds.
2010-01-01
... in the budget proposal. Cash sources shall be identified by name and account. All applicants must... agreement. The account containing such cash must be under the direct management of the SBDC Director, or, if... received by the SBDC during the budget period, as long as the total Cash Match provided by the SBDC is 50...
13 CFR 108.2030 - Matching requirements.
2010-01-01
... Section 108.2030 Business Credit and Assistance SMALL BUSINESS ADMINISTRATION NEW MARKETS VENTURE CAPITAL... resources raised by the NMVC Company or SSBIC. (b) Allowable sources. (1) Any source other than SBA is an... this part. (3) A portion of Private Capital may be designated as matching resources if the designated...
Performance Evaluation of Tree Object Matching
DEFF Research Database (Denmark)
Somchaipeng, Kerawit; Sporring, Jon; Kreiborg, Sven
2005-01-01
Multi-Scale Singularity Trees (MSSTs) represents the deep structure of images in scale-space and provide both the connections between image features at different scales and their strengths. In this report we present and evaluate an algorithm that exploits the MSSTs for image matching. Two versions...
Language style matching and police interrogation outcomes
Richardson, Beth H.; Taylor, Paul J; Snook, Brent; Conchie, Stacey M.; Bennell, Craig
2014-01-01
This research examined the coordination of interrogator and suspects’ verbal behavior in interrogations. Sixty-four police interrogations were examined at the aggregate and utterance level using a measure of verbal mimicry known as Language Style Matching. Analyses revealed an interaction between
Matching Expectations for Successful University Student Volunteering
Paull, Megan; Omari, Maryam; MacCallum, Judith; Young, Susan; Walker, Gabrielle; Holmes, Kirsten; Haski-Leventha, Debbie; Scott, Rowena
2017-01-01
Purpose: The purpose of this paper is to demonstrate the importance of expectation formation and matching for university student volunteers and their hosts. Design/methodology/approach: This research involved a multi-stage data collection process including interviews with student volunteers, and university and host representatives from six…
7 CFR 3419.2 - Matching funds.
2010-01-01
... Regulations of the Department of Agriculture (Continued) COOPERATIVE STATE RESEARCH, EDUCATION, AND EXTENSION SERVICE, DEPARTMENT OF AGRICULTURE MATCHING FUNDS REQUIREMENT FOR AGRICULTURAL RESEARCH AND EXTENSION FORMULA FUNDS AT 1890 LAND-GRANT INSTITUTIONS, INCLUDING TUSKEGEE UNIVERSITY, AND AT 1862 LAND-GRANT...
Nonlinear soliton matching between optical fibers
DEFF Research Database (Denmark)
Agger, Christian; Sørensen, Simon Toft; Thomsen, Carsten L.
2011-01-01
In this Letter, we propose a generic nonlinear coupling coefficient, η2 NL ¼ ηjγ=β2jfiber2=jγ=β2jfiber1, which gives a quantitative measure for the efficiency of nonlinear matching of optical fibers by describing how a fundamental soliton couples from one fiber into another. Specifically, we use η...
The Match Quality Gains from Unemployment Insurance
Centeno, Mario
2004-01-01
The benefits of unemployment insurance (UI) by measuring its effect in match quality are assessed. The relationship between post-unemployment job tenure and measures of the state level UI generosity and the unemployment rate at the time of the job is analyzed, using NLSY data.
Cash Management/Data Matching. Training Guide.
Office of Student Financial Assistance (ED), Washington, DC.
This training guide for financial aid staff explains the process of direct loan reconciliation and suggests appropriate cash management accounting practices. Chapter 1 explains the importance of cash management, the role of data matching, and reviews basic reconciliation concepts and terms and direct loan reporting requirements. Chapter 2 reviews…
Fingerprint matching on smart card: A review
CSIR Research Space (South Africa)
Baruni, Kedimotse P
2016-12-01
Full Text Available Fingerprint Match-on-Card (MoC) offers the highest degree of privacy and security to cardholders as the fingerprint never leaves the secure environment of a smart card. The level of security of a biometric system is evaluated by the location where...
On a special case of model matching
Czech Academy of Sciences Publication Activity Database
Zagalak, Petr
2004-01-01
Roč. 77, č. 2 (2004), s. 164-172 ISSN 0020-7179 R&D Projects: GA ČR GA102/01/0608 Institutional research plan: CEZ:AV0Z1075907 Keywords : linear systems * state feedback * model matching Subject RIV: BC - Control Systems Theory Impact factor: 0.702, year: 2004
The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching
International Nuclear Information System (INIS)
Wadlinger, E.A.; Garnett, R.W.
1996-01-01
The issue involved in the simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ / 4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x = β y and α x = α y = 0 at the exit of the RFQ. This matching between the RFQ and DTL is described. (author)
The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching
International Nuclear Information System (INIS)
Wadlinger, E.A.; Garnett, R.W.
1996-01-01
The issue involved in simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ/4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x =β y and α x =α y =0 at the exit of the RFQ. This matching between the RFQ and DTL is described
Stable solutions of nonlocal electron heat transport equations
International Nuclear Information System (INIS)
Prasad, M.K.; Kershaw, D.S.
1991-01-01
Electron heat transport equations with a nonlocal heat flux are in general ill-posed and intrinsically unstable, as proved by the present authors [Phys. Fluids B 1, 2430 (1989)]. A straightforward numerical solution of these equations will therefore lead to absurd results. It is shown here that by imposing a minimal set of constraints on the problem it is possible to arrive at a globally stable, consistent, and energy conserving numerical solution
... Read MoreDepression in Children and TeensRead MoreBMI Calculator Hearing ProblemsLoss in the ability to hear or discriminate ... This flow chart will help direct you if hearing loss is a problem for you or a ...
Haptic spatial matching in near peripersonal space.
Kaas, Amanda L; Mier, Hanneke I van
2006-04-01
Research has shown that haptic spatial matching at intermanual distances over 60 cm is prone to large systematic errors. The error pattern has been explained by the use of reference frames intermediate between egocentric and allocentric coding. This study investigated haptic performance in near peripersonal space, i.e. at intermanual distances of 60 cm and less. Twelve blindfolded participants (six males and six females) were presented with two turn bars at equal distances from the midsagittal plane, 30 or 60 cm apart. Different orientations (vertical/horizontal or oblique) of the left bar had to be matched by adjusting the right bar to either a mirror symmetric (/ \\) or parallel (/ /) position. The mirror symmetry task can in principle be performed accurately in both an egocentric and an allocentric reference frame, whereas the parallel task requires an allocentric representation. Results showed that parallel matching induced large systematic errors which increased with distance. Overall error was significantly smaller in the mirror task. The task difference also held for the vertical orientation at 60 cm distance, even though this orientation required the same response in both tasks, showing a marked effect of task instruction. In addition, men outperformed women on the parallel task. Finally, contrary to our expectations, systematic errors were found in the mirror task, predominantly at 30 cm distance. Based on these findings, we suggest that haptic performance in near peripersonal space might be dominated by different mechanisms than those which come into play at distances over 60 cm. Moreover, our results indicate that both inter-individual differences and task demands affect task performance in haptic spatial matching. Therefore, we conclude that the study of haptic spatial matching in near peripersonal space might reveal important additional constraints for the specification of adequate models of haptic spatial performance.
The urology residency matching program in practice.
Teichman, J M; Anderson, K D; Dorough, M M; Stein, C R; Optenberg, S A; Thompson, I M
2000-06-01
We evaluate behaviors and attitudes among resident applicants and program directors related to the American Urological Association (AUA) residency matching program and recommend changes to improve the match. Written questionnaires were mailed to 519 resident applicants and 112 program directors after the 1999 American Urological Association match. Subjects were asked about their observations, behaviors and opinions towards the match. Questionnaires were returned by 230 resident applicants and 94 program directors (44% and 83% response rates, respectively.) Of the resident applicants 75% spent $1,001 to $5,000 for interviewing. Of the program directors 47% recalled that applicants asked how programs would rank the applicant and 61% of applicants recalled that program directors asked applicants how they would rank programs. Dishonesty was acknowledged by 31% of program directors and 44% of resident applicants. Of program directors 82% thought applicants "lied", while 67% of applicants thought that programs "lied" (quotations indicate questionnaire language). Participants characterized their own dishonesty as "just playing the game" or they "did not feel badly." Of program directors 81% and of applicants 61% were "skeptical" or "did not believe" when informed they were a "high" or "number 1" selection. Being asked about marital status was recalled by 91% of male and 100% of female (p = 0. 02), if they had children by 53% of male and 67% of female, (p = 0. 03), and intent to have children by 25% of male and 62% of female (p match code rules frequently. Program directors and resident applicants are skeptical of each other. Patterns of faculty behavior differ based on applicant gender. Interviews are costly for applicants. We recommend that 1) programs adopt policies to enhance fairness, 2) applications be filed electronically, 3) programs assist resident applicants with interview accommodation to reduce financial burden and 4) a post-interview code of limited or
High-Order Entropy Stable Finite Difference Schemes for Nonlinear Conservation Laws: Finite Domains
Fisher, Travis C.; Carpenter, Mark H.
2013-01-01
Developing stable and robust high-order finite difference schemes requires mathematical formalism and appropriate methods of analysis. In this work, nonlinear entropy stability is used to derive provably stable high-order finite difference methods with formal boundary closures for conservation laws. Particular emphasis is placed on the entropy stability of the compressible Navier-Stokes equations. A newly derived entropy stable weighted essentially non-oscillatory finite difference method is used to simulate problems with shocks and a conservative, entropy stable, narrow-stencil finite difference approach is used to approximate viscous terms.
Improved algorithms for approximate string matching (extended abstract
Directory of Open Access Journals (Sweden)
Papamichail Georgios
2009-01-01
Full Text Available Abstract Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share. Results We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s - |n - m|·min(m, n, s + m + n and linear space, where s is the edit distance between the two strings. This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem. The implementation of our algorithm also excels in practice, especially in cases where the two strings compared differ significantly in length. Conclusion We have provided the design, analysis and implementation of a new algorithm for calculating the edit distance of two strings with both theoretical and practical implications. Source code of our algorithm is available online.
Moltex Energy's stable salt reactors
International Nuclear Information System (INIS)
O'Sullivan, R.; Laurie, J.
2016-01-01
A stable salt reactor is a molten salt reactor in which the molten fuel salt is contained in fuel rods. This concept was invented in 1951 and re-discovered and improved recently by Moltex Energy Company. The main advantage of using molten salt fuel is that the 2 problematic fission products cesium and iodine do not exist in gaseous form but rather in a form of a salt that present no danger in case of accident. Another advantage is the strongly negative temperature coefficient for reactivity which means the reactor self-regulates. The feasibility studies have been performed on a molten salt fuel composed of sodium chloride and plutonium/uranium/lanthanide/actinide trichloride. The coolant fluid is a mix of sodium and zirconium fluoride salts that will need low flow rates. The addition of 1 mol% of metal zirconium to the coolant fluid reduces the risk of corrosion with standard steels and the addition of 2% of hafnium reduces the neutron dose. The temperature of the coolant is expected to reach 650 Celsius degrees at the exit of the core. This reactor is designed to be modular and it will be able to burn actinides. (A.C.)
Rare stable isotopes in meteorites
International Nuclear Information System (INIS)
Wilson, G.C.
1981-01-01
Secondary Ion Mass Spectrometry (SIMS) using accelerators has been applied with success to cosmic ray exposure ages and terrestrial residence times of meteorites by measuring cosmogenic nuclides of Be, Cl, and I. It is proposed to complement this work with experiments on rare stable isotopes, in the hope of setting constraints on the processes of solar nebula/meteoritic formation. The relevant species can be classified as: a) daughter products of extinct nuclides (halflife less than or equal to 2 x 10 8 y) -chronology of the early solar system; b) products of high temperature astrophysical processes - different components incorporated into the solar nebula; and c) products of relatively low temperature processes, stellar winds and cosmic ray reactions - early solar system radiation history. The use of micron-scale primary ion beams will allow detailed sampling of phases within meteorites. Strategies of charge-state selection, molecular disintegration and detection should bring a new set of targets within analytical range. The developing accelerator field is compared to existing (keV energy) ion microprobes
Stable piecewise polynomial vector fields
Directory of Open Access Journals (Sweden)
Claudio Pessoa
2012-09-01
Full Text Available Let $N={y>0}$ and $S={y<0}$ be the semi-planes of $mathbb{R}^2$ having as common boundary the line $D={y=0}$. Let $X$ and $Y$ be polynomial vector fields defined in $N$ and $S$, respectively, leading to a discontinuous piecewise polynomial vector field $Z=(X,Y$. This work pursues the stability and the transition analysis of solutions of $Z$ between $N$ and $S$, started by Filippov (1988 and Kozlova (1984 and reformulated by Sotomayor-Teixeira (1995 in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields $Z_{epsilon}$, defined by averaging $X$ and $Y$. This family approaches $Z$ when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002 providing conditions on $(X,Y$ for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on $mathbb{R}^2$. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.