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.
On Stable Marriages and Greedy Matchings
Energy Technology Data Exchange (ETDEWEB)
Manne, Fredrik; Naim, Md; Lerring, Hakon; Halappanavar, Mahantesh
2016-12-11
Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. In this paper we consider the relationships between these two areas. In particular we show that several problems related to computing greedy matchings can be formulated as stable marriage problems and as a consequence several recently proposed algorithms for computing greedy matchings are in fact special cases of well known algorithms for the stable marriage problem. However, in terms of implementations and practical scalable solutions on modern hardware, the greedy matching community has made considerable progress. We show that due to the strong relationship between these two fields many of these results are also applicable for solving stable marriage problems.
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.
Unconditionally stable perfectly matched layer boundary conditions
De Raedt, H.; Michielsen, K.
2007-01-01
A brief review is given of a systematic, product-formula based approach to construct unconditionally stable algorithms for solving the time-dependent Maxwell equations. The fundamental difficulties that arise when we want to incorporate uniaxial perfectly matched layer boundary conditions into this
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.
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....
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.
The Effects of Matched Filter on Stable Performance of Semistrapdown Inertially Stabilized Platform
Directory of Open Access Journals (Sweden)
Feng Liu
2016-01-01
Full Text Available To enhance the optimization performance of matched filter and further improve line of sight (LOS stability of platform in inertial space, the proposed matched filter algorithm is conducted by adjusting matched filter coefficients of first-order low pass filter utilizing the regional search method based on invariance principle. The coefficients of the fraction molecule and denominator of proposed regional search algorithm are altered instead of denominator coefficients only being modified. Simulations are performed to verify the validity of inside factors performed with stabilization control model and quartz rate sensor (QRS mathematical model. The stable angular error is sharply alleviated, so the decoupling accuracy of airborne semistrapdown inertially stabilized platform is largely promoted. The optimization matched filter can effectively increase stability of LOS in inertial space.
Incorporating Domain Knowledge in Matching Problems via Harmonic Analysis.
Pachauri, Deepti; Collins, Maxwell; Kondor, Risi; Singh, Vikas
2012-01-01
Matching one set of objects to another is a ubiquitous task in machine learning and computer vision that often reduces to some form of the quadratic assignment problem (QAP). The QAP is known to be notoriously hard, both in theory and in practice. Here, we investigate if this difficulty can be mitigated when some additional piece of information is available: (a) that all QAP instances of interest come from the same application, and (b) the correct solution for a set of such QAP instances is given. We propose a new approach to accelerate the solution of QAPs based on learning parameters for a modified objective function from prior QAP instances. A key feature of our approach is that it takes advantage of the algebraic structure of permutations, in conjunction with special methods for optimizing functions over the symmetric group n in Fourier space. Experiments show that in practical domains the new method can outperform existing approaches.
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
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.
Taniman, R.O.; Sikkes, B.; van Bochove, A.C.; de Boer, Pieter-Tjerk
In this paper, an adaptive subcarrier assignment method based on a stable matching algorithm is considered. From the performance comparison with other assignment methods (Hungarian-algorithm-based, contiguous and interleaved), our assignment method, while of relatively low complexity, resulted in a
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.
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. PMID:26949383
Stable families of coalitions for network resource allocation problems
Directory of Open Access Journals (Sweden)
Vladimir Gurvich
2014-02-01
Full Text Available A very common question appearing in resource management is: what is the optimal way of behaviour of the agents and distribution of limited resources. Is any form of cooperation more preferable strategy than pure competition? How cooperation can be treated in the game theoretic framework: just as one of a set of Pareto optimal solutions or cooperative game theory is a more promising approach? This research is based on results proving the existence of a non-empty K -core, that is, the set of allocations acceptable for the family K of all feasible coalitions, for the case when this family is a set of subtrees of a tree. A wide range of real situations in resource management, which include optimal water, gas and electricity allocation problems, can be modeled using this class of games. Thus, the present research is pursuing two goals: 1. optimality and 2. stability.Firstly, we suggest to players to unify their resources and then we optimize the total payoff using some standard LP technique. The same unification and optimization can be done for any coalition of players, not only for the total one. However, players may object unification of resources. It may happen when a feasible coalition can guarantee a better result for every coalitionist. Here we obtain some stability conditions which ensure that this cannot happen for some family K. Such families were characterized by Boros, Gurvich and Vasin [4] as Berge’s normal hypergraphs. Thus, we obtain a solution which is optimal and stable. From practical point of view, we suggest a distribution of profit that would cause no conflict between players.
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...... 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....
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.
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...
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...
A combinatorial approach to the peptide feature matching problem for label-free quantification.
Lin, Hao; He, Lin; Ma, Bin
2013-07-15
Label-free quantification is an important approach to identify biomarkers, as it measures the quantity change of peptides across different biological samples. One of the fundamental steps for label-free quantification is to match the peptide features that are detected in two datasets to each other. Although ad hoc software tools exist for the feature matching, the definition of a combinatorial model for this problem is still not available. A combinatorial model is proposed in this article. Each peptide feature contains a mass value and a retention time value, which are used to calculate a matching weight between a pair of features. The feature matching is to find the maximum-weighted matching between the two sets of features, after applying a to-be-computed time alignment function to all the retention time values of one set of the features. This is similar to the maximum matching problem in a bipartite graph. But we show that the requirement of time alignment makes the problem NP-hard. Practical algorithms are also provided. Experiments on real data show that the algorithm compares favorably with other existing methods. binma@uwaterloo.ca Supplementary data are available at Bioinformatics online.
Lei, Yaguo; Qiao, Zijian; Xu, Xuefang; Lin, Jing; Niu, Shantao
2017-09-01
Most traditional overdamped monostable, bistable and even tristable stochastic resonance (SR) methods have three shortcomings in weak characteristic extraction: (1) their potential structures characterized by single stable-state type are insufficient to match with the complicated and diverse mechanical vibration signals; (2) they vulnerably suffer the interference from multiscale noise and largely depend on the help of highpass filters whose parameters are selected subjectively, probably resulting in false detection; and (3) their rescaling factors are fixed as constants generally, thereby ignoring the synergistic effect among vibration signals, potential structures and rescaling factors. These three shortcomings have limited the enhancement ability of SR. To explore the SR potential, this paper initially investigates the SR in a multistable system by calculating its output spectral amplification, further analyzes its output frequency response numerically, then examines the effect of both damping and rescaling factors on output responses and finally presents a promising underdamped SR method with stable-state matching for incipient bearing fault diagnosis. This method has three advantages: (1) the diversity of stable-state types in a multistable potential makes it easy to match with various vibration signals; (2) the underdamped multistable SR, equivalent to a moving nonlinear bandpass filter that is dependent on the rescaling factors, is able to suppress the multiscale noise; and (3) the synergistic effect among vibration signals, potential structures and rescaling and damping factors is achieved using quantum genetic algorithms whose fitness functions are new weighted signal-to-noise ratio (WSNR) instead of SNR. Therefore, the proposed method is expected to possess good enhancement ability. Simulated and experimental data of rolling element bearings demonstrate its effectiveness. The comparison results show that the proposed method is able to obtain higher
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.
A matching problem revisited for stability analysis of resistive wall modes in flowing plasmas
International Nuclear Information System (INIS)
Shiraishi, J.; Tokuda, S.; Aiba, N.
2010-01-01
The classical matching problem for magnetohydrodynamic stability analysis is revisited to study effects of the plasma flow on the resistive wall modes (RWMs). The Newcomb equation, which describes the marginal states and governs the regions except for the resonant surface, is generalized to analyze the stability of flowing plasmas. When there exists no flow, the singular point of the Newcomb equation and the resonant surface degenerate into the rational surface. The location of the rational surface is prescribed by the equilibrium, hence the inner layer, which must contain the resonant surface, can be set a priori. When the flow exists, the singular point of the Newcomb equation splits in two due to the Doppler shift. Additionally, the resonant surface deviates from the singular points and the rational surface if the resonant eigenmode has a real frequency. Since the location of the resonant surface depends on the unknown real frequency, it can be determined only a posteriori. Hence the classical asymptotic matching method cannot be applied. This paper shows that a new matching method that generalizes the asymptotic one to use the inner layer with finite width works well for the stability analysis of flowing plasmas. If the real frequency is limited in a certain range such as the RWM case, the resonance occurs somewhere in the finite region around the singular points, hence the inner layer with finite width can capture the resonant surface.
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.
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.
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 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 allocation. Stable low-risk drinking, but not abstinence
Padois, Thomas; Berry, Alain
2015-12-01
Microphone arrays and beamforming have become a standard method to localize aeroacoustic sources. Deconvolution techniques have been developed to improve spatial resolution of beamforming maps. The deconvolution approach for the mapping of acoustic sources (DAMAS) is a standard deconvolution technique, which has been enhanced via a sparsity approach called sparsity constrained deconvolution approach for the mapping of acoustic sources (SC-DAMAS). In this paper, the DAMAS inverse problem is solved using the orthogonal matching pursuit (OMP) and compared with beamforming and SC-DAMAS. The resulting noise source maps show that OMP-DAMAS is an efficient source localization technique in the case of uncorrelated or correlated acoustic sources. Moreover, the computation time is clearly reduced as compared to SC-DAMAS.
Gender, sleep problems, and obesity in Taiwan: a propensity-score-matching approach.
Chen, Duan-Rung; Kuan, Ping-Yin
2015-01-01
Obesity has become a major health risk in industrialized countries, with disturbed sleep identified as a correlate. This study used data drawn from Taiwan's 2005 Social Development Trend Survey on Health and Safety and the propensity-score-matching method to shed light on gender-specific associations between sleep problems and obesity among 24,113 adults aged 20-64 years. The average increase in obesity prevalence among respondents with disrupted sleep was 1.85%, as compared to those who did not report disrupted sleep, with similar psycho-social attributes. Similarly, the prevalence of obesity among those who reported restless sleep was increased by an average of 1.40% compared to those who did not report restless sleep with similar psycho-social attributes. We also found gender-specific vulnerability to different types of sleep problems. Among men who reported disrupted sleep, we found a 3.12% increase in the prevalence of obesity. Among women exposed to restless sleep, the increase in obesity prevalence was 1.84%. The observed gender difference in the prevalence of increases in obesity may be attributed to gender-specific behavioral responses to poor sleep. With poor sleep, men may respond to hunger by overeating; women may respond by physical inactivity. Both can contribute to an elevated risk of obesity.
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...
Griffith, Gemma M.; Hastings, Richard P.; Nash, Susie; Hill, Christopher
2010-01-01
Mothers of children with Down syndrome, autism, and mixed etiology intellectual disabilities, matched on child age, gender, and communication skills (n = 19 in each group) completed measures of their child's adaptive and problem behaviors, their own parenting stress, and positive perceptions of their child. Children with autism were rated as…
A stable and optimally convergent LaTIn-CutFEM algorithm for multiple unilateral contact problems
Claus, Susanne; Kerfriden, Pierre
2018-02-01
In this paper, we propose a novel unfitted finite element method for the simulation of multiple body contact. The computational mesh is generated independently of the geometry of the interacting solids, which can be arbitrarily complex. The key novelty of the approach is the combination of elements of the CutFEM technology, namely the enrichment of the solution field via the definition of overlapping fictitious domains with a dedicated penalty-type regularisation of discrete operators, and the LaTIn hybrid-mixed formulation of complex interface conditions. Furthermore, the novel P1-P1 discretisation scheme that we propose for the unfitted LaTIn solver is shown to be stable, robust and optimally convergent with mesh refinement. Finally, the paper introduces a high-performance 3D level-set/CutFEM framework for the versatile and robust solution of contact problems involving multiple bodies of complex geometries, with more than two bodies interacting at a single point.
Banks, J. W.; Henshaw, W. D.; Schwendeman, D. W.; Tang, Qi
2017-08-01
A stable partitioned algorithm is developed for fluid-structure interaction (FSI) problems involving viscous incompressible flow and rigid bodies. This added-mass partitioned (AMP) algorithm remains stable, without sub-iterations, for light and even zero mass rigid bodies when added-mass and viscous added-damping effects are large. The scheme is based on a generalized Robin interface condition for the fluid pressure that includes terms involving the linear acceleration and angular acceleration of the rigid body. Added-mass effects are handled in the Robin condition by inclusion of a boundary integral term that depends on the pressure. Added-damping effects due to the viscous shear forces on the body are treated by inclusion of added-damping tensors that are derived through a linearization of the integrals defining the force and torque. Added-damping effects may be important at low Reynolds number, or, for example, in the case of a rotating cylinder or rotating sphere when the rotational moments of inertia are small. In this first part of a two-part series, the properties of the AMP scheme are motivated and evaluated through the development and analysis of some model problems. The analysis shows when and why the traditional partitioned scheme becomes unstable due to either added-mass or added-damping effects. The analysis also identifies the proper form of the added-damping which depends on the discrete time-step and the grid-spacing normal to the rigid body. The results of the analysis are confirmed with numerical simulations that also demonstrate a second-order accurate implementation of the AMP scheme.
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
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.
1978-05-01
MD-l69 356 AERIAL VISUL SHAPE DISCRIINATION AND / MATCHING-TO-SANPLE PROBLEM SOLVINO.. (U) NAVAL OCEAN SYSTEMS CENTER SAN DIEGO CA N K CHUN MAY 76...ADMINISTRATIVE INFORMATION ’A The research was conducted at the Naval Ocean Systems (enter. Hawaii Laboratory,. and sponsored by Naval Sea Systems Command...reduce well to quantification, and are governed by theories of Gestalt psychology. In applying information theory to the measurement of form parameters
Hardware Architectures for Data-Intensive Computing Problems: A Case Study for String Matching
Energy Technology Data Exchange (ETDEWEB)
Tumeo, Antonino; Villa, Oreste; Chavarría-Miranda, Daniel
2012-12-28
DNA analysis is an emerging application of high performance bioinformatic. Modern sequencing machinery are able to provide, in few hours, large input streams of data, which needs to be matched against exponentially growing databases of known fragments. The ability to recognize these patterns effectively and fastly may allow extending the scale and the reach of the investigations performed by biology scientists. Aho-Corasick is an exact, multiple pattern matching algorithm often at the base of this application. High performance systems are a promising platform to accelerate this algorithm, which is computationally intensive but also inherently parallel. Nowadays, high performance systems also include heterogeneous processing elements, such as Graphic Processing Units (GPUs), to further accelerate parallel algorithms. Unfortunately, the Aho-Corasick algorithm exhibits large performance variability, depending on the size of the input streams, on the number of patterns to search and on the number of matches, and poses significant challenges on current high performance software and hardware implementations. An adequate mapping of the algorithm on the target architecture, coping with the limit of the underlining hardware, is required to reach the desired high throughputs. In this paper, we discuss the implementation of the Aho-Corasick algorithm for GPU-accelerated high performance systems. We present an optimized implementation of Aho-Corasick for GPUs and discuss its tradeoffs on the Tesla T10 and he new Tesla T20 (codename Fermi) GPUs. We then integrate the optimized GPU code, respectively, in a MPI-based and in a pthreads-based load balancer to enable execution of the algorithm on clusters and large sharedmemory multiprocessors (SMPs) accelerated with multiple GPUs.
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.
Problem-Based Learning and Economics – a Match in Heaven or in Hell?
DEFF Research Database (Denmark)
Madsen, Poul Thøis; Ingemann, Jan Holm
theories, and tends to redefine a problem in order to make it fit into the abstract methodological approach. Also, non-mainstream economics might, however, be experienced as being too abstract and arm’s length. The students are, hence, very dependent on their supervisor to navigate in this messy water....
Anderson, Karen L.; Casey, M. Beth; Thompson, William L.; Burrage, Marie S.; Pezaris, Elizabeth; Kosslyn, Stephen M.
2008-01-01
This study investigated the relationship between 3 ability-based cognitive styles (verbal deductive, spatial imagery, and object imagery) and performance on geometry problems that provided different types of clues. The purpose was to determine whether students with a specific cognitive style outperformed other students, when the geometry problems…
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.
Langer, P.; Sepahvand, K.; Guist, C.; Bär, J.; Peplow, A.; Marburg, S.
2018-03-01
The simulation model which examines the dynamic behavior of real structures needs to address the impact of uncertainty in both geometry and material parameters. This article investigates three-dimensional finite element models for structural dynamics problems with respect to both model and parameter uncertainties. The parameter uncertainties are determined via laboratory measurements on several beam-like samples. The parameters are then considered as random variables to the finite element model for exploring the uncertainty effects on the quality of the model outputs, i.e. natural frequencies. The accuracy of the output predictions from the model is compared with the experimental results. To this end, the non-contact experimental modal analysis is conducted to identify the natural frequency of the samples. The results show a good agreement compared with experimental data. Furthermore, it is demonstrated that geometrical uncertainties have more influence on the natural frequencies compared to material parameters and material uncertainties are about two times higher than geometrical uncertainties. This gives valuable insights for improving the finite element model due to various parameter ranges required in a modeling process involving uncertainty.
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 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...... because the latter allows for implementation of high-order time schemes, leading to reduced numerical dispersion and dissipation, a topic of importance, in particular, in long-range ocean acoustics simulations. The method is validated for a two dimensional fluid-solid Pekeris waveguide and for a three...
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
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 ...
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.
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...
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.)
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)
Solution to a gene divergence problem under arbitrary stable nucleotide transition probabilities
Holmquist, R.
1976-01-01
A nucleic acid chain, L nucleotides in length, with the specific base sequence B(1)B(2) ... B(L) is defined by the L-dimensional vector B = (B(1), B(2), ..., B(L)). For twelve given constant non-negative transition probabilities that, in a specified position, the base B is replaced by the base B' in a single step, an exact analytical expression is derived for the probability that the position goes from base B to B' in X steps. Assuming that each base mutates independently of the others, an exact expression is derived for the probability that the initial gene sequence B goes to a sequence B' = (B'(1), B'(2), ..., B'(L)) after X = (X(1), X(2), ..., X(L)) base replacements. The resulting equations allow a more precise accounting for the effects of Darwinian natural selection in molecular evolution than does the idealized (biologically less accurate) assumption that each of the four nucleotides is equally likely to mutate to and be fixed as one of the other three. Illustrative applications of the theory to some problems of biological evolution are given.
Castillo, Edward; Castillo, Richard; Fuentes, David; Guerrero, Thomas
2014-04-01
Block matching is a well-known strategy for estimating corresponding voxel locations between a pair of images according to an image similarity metric. Though robust to issues such as image noise and large magnitude voxel displacements, the estimated point matches are not guaranteed to be spatially accurate. However, the underlying optimization problem solved by the block matching procedure is similar in structure to the class of optimization problem associated with B-spline based registration methods. By exploiting this relationship, the authors derive a numerical method for computing a global minimizer to a constrained B-spline registration problem that incorporates the robustness of block matching with the global smoothness properties inherent to B-spline parameterization. The method reformulates the traditional B-spline registration problem as a basis pursuit problem describing the minimall1-perturbation to block match pairs required to produce a B-spline fitting error within a given tolerance. The sparsity pattern of the optimal perturbation then defines a voxel point cloud subset on which the B-spline fit is a global minimizer to a constrained variant of the B-spline registration problem. As opposed to traditional B-spline algorithms, the optimization step involving the actual image data is addressed by block matching. The performance of the method is measured in terms of spatial accuracy using ten inhale/exhale thoracic CT image pairs (available for download atwww.dir-lab.com) obtained from the COPDgene dataset and corresponding sets of expert-determined landmark point pairs. The results of the validation procedure demonstrate that the method can achieve a high spatial accuracy on a significantly complex image set. The proposed methodology is demonstrated to achieve a high spatial accuracy and is generalizable in that in can employ any displacement field parameterization described as a least squares fit to block match generated estimates. Thus, the framework
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…
Al Nasr, Kamal; Ranjan, Desh; Zubair, Mohammad; Chen, Lin; He, Jing
2014-01-01
Electron cryomicroscopy is becoming a major experimental technique in solving the structures of large molecular assemblies. More and more three-dimensional images have been obtained at the medium resolutions between 5 and 10 Å. At this resolution range, major α-helices can be detected as cylindrical sticks and β-sheets can be detected as plain-like regions. A critical question in de novo modeling from cryo-EM images is to determine the match between the detected secondary structures from the image and those on the protein sequence. We formulate this matching problem into a constrained graph problem and present an O(Δ(2)N(2)2(N)) algorithm to this NP-Hard problem. The algorithm incorporates the dynamic programming approach into a constrained K-shortest path algorithm. Our method, DP-TOSS, has been tested using α-proteins with maximum 33 helices and α-β proteins up to five helices and 12 β-strands. The correct match was ranked within the top 35 for 19 of the 20 α-proteins and all nine α-β proteins tested. The results demonstrate that DP-TOSS improves accuracy, time and memory space in deriving the topologies of the secondary structure elements for proteins with a large number of secondary structures and a complex skeleton.
Directory of Open Access Journals (Sweden)
Will Jones
2017-08-01
Full Text Available Design of matching systems between refugees and states or local areas is emerging as one of the most promising solutions to problems in refugee resettlement. We describe the basics of two-sided matching theory used in a number of allocation problems, such as school choice, where both sides need to agree to the match. We then explain how these insights can be applied to international refugee matching in the context of the European Union and examine how refugee matching might work within the United Kingdom, Canada, and the United States.
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.
Bates, Littisha A; Glick, Jennifer E
2013-09-01
Black youth often lag behind their non-Hispanic white peers in educational outcomes, including teacher-evaluated school performance. Using data from four waves of the Early Childhood Longitudinal Study-Kindergarten Cohort, the analyses presented here identify the extent to which children receive different evaluations from their teachers depending on the racial/ethnic match of teachers and students. This study is distinct from previous work because we examine the assessment of an individual child by multiple teachers. The results indicate that Black children receive worse assessments of their externalizing behaviors (e.g. arguing in class and disrupting instruction) when they have a non-Hispanic white teacher than when they have a Black teacher. Further, these results exist net of school context and the teacher's own ratings of the behavior of the class overall. Copyright © 2013 Elsevier Inc. All rights reserved.
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.
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...
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.
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.
Zhou, Feng; de la Torre, Fernando
2015-11-19
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the use of a path-following optimization algorithm, that leads to improved optimization strategies and matching performance; (3) Given the factorization, it becomes straight-forward to incorporate geometric transformations (rigid and non-rigid) to the GM problem. (4) Using a matrix formulation for the GM problem and the factorization, it is easy to reveal commonalities and differences between different GM methods. The factorization also provides a clean connection with other matching algorithms such as iterative closest point; Experimental results on synthetic and real databases illustrate how FGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.
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 ...
International Nuclear Information System (INIS)
Sikami, Yutaka
1995-01-01
This investigation is concerned with the long term energy demand and supply in the world, which was carried out by the Institute of Energy Economics Japan for the purpose of contributing to the deliberation of the Atomic Energy Commission of Japan. This perspective of the demand and supply took the ultralong period up to 2100 as the object, and two points of the newest information on energy resources and the greenhouse effect problem due to carbon dioxide are included. The model used for the simulation was the modified Edmond Riley model. Energy consumption was estimated from that per one person and the population classified into nine districts. The assumed conditions for energy demand and supply are explained. The simulation of energy demand and supply was carried out for basic case in which the present state continues, carbon dioxide restriction case and restriction and plutonium utilization case. The results of the simulation on energy demand and supply, the effect to environment and the problems of resources are reported. The energy consumption in the world continues to increase hereafter centering around developing countries, and in 2100, the primary energy supply more than three times as much as that in 1990 becomes necessary. Unless the release of carbon dioxide is restricted, the resolution of environmental problems becomes difficult. Nuclear power generation is affected by uranium resource depletion around 2100, and early countermeasures are necessary. (K.I.)
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.
Energy Technology Data Exchange (ETDEWEB)
Theiler, James P [Los Alamos National Laboratory
2009-01-01
Following an analogous distinction in statistical hypothesis testing, we investigate variants of machine learning where the training set comes in matched pairs. We demonstrate that even conventional classifiers can exhibit improved performance when the input data has a matched-pair structure. Online algorithms, in particular, converge quicker when the data is presented in pairs. In some scenarios (such as the weak signal detection problem), matched pairs can be generated from independent samples, with the effect not only doubling the nominal size of the training set, but of providing the structure that leads to better learning. A family of 'dipole' algorithms is introduced that explicitly takes advantage of matched-pair structure in the input data and leads to further performance gains. Finally, we illustrate the application of matched-pair learning to chemical plume detection in hyperspectral imagery.
Williams, Judith C; Alwis, W A M; Rotgans, Jerome I
2011-10-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 semesters. Over the three semesters each tutor taught two of the same course and one different course. A generalizability study was conducted to determine whether the tutor behaviors were generalizable across the three measurement occasions. The results indicate that three semesters are sufficient to make generalizations about all three tutor behaviors. In addition the results show that individual differences between tutors account for the greatest differences in levels of expertise, social congruence and cognitive congruence. The study concludes that tutor behaviors are fairly consistent in PBL and somewhat impervious to change. Implications of these findings for tutor training are discussed.
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.
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 – speedup...... over traditional algorithms that examine each character individually. Our solution can be efficiently implemented, unlike prior theoretical packed string matching work. We adapt the standard RAM model and only use its AC0 instructions (i.e., no multiplication) plus two specialized AC0 packed string...
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. .
Senent, Juan
2011-01-01
The first part of the paper presents some closed-form solutions to the optimal two-impulse transfer between fixed position and velocity vectors on Keplerian orbits when some constraints are imposed on the magnitude of the initial and final impulses. Additionally, a numerically-stable gradient-free algorithm with guaranteed convergence is presented for the minimum delta-v two-impulse transfer. In the second part of the paper, cooperative bargaining theory is used to solve some two-impulse transfer problems when the initial and final impulses are carried by different vehicles or when the goal is to minimize the delta-v and the time-of-flight at the same time.
Jain, Anil K; Feng, Jianjiang
2011-01-01
Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and rolled fingerprint matching, latent fingerprint matching continues to be a difficult problem. Poor quality of ridge impressions, small finger area, and large nonlinear distortion are the main difficulties in latent fingerprint matching compared to plain or rolled fingerprint matching. We propose a system for matching latent fingerprints found at crime scenes to rolled fingerprints enrolled in law enforcement databases. In addition to minutiae, we also use extended features, including singularity, ridge quality map, ridge flow map, ridge wavelength map, and skeleton. We tested our system by matching 258 latents in the NIST SD27 database against a background database of 29,257 rolled fingerprints obtained by combining the NIST SD4, SD14, and SD27 databases. The minutiae-based baseline rank-1 identification rate of 34.9 percent was improved to 74 percent when extended features were used. In order to evaluate the relative importance of each extended feature, these features were incrementally used in the order of their cost in marking by latent experts. The experimental results indicate that singularity, ridge quality map, and ridge flow map are the most effective features in improving the matching accuracy.
Characteristic Evolution and Matching
Directory of Open Access Journals (Sweden)
Winicour Jeffrey
2001-01-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to current 3D codes that simulate binary black holes. A prime application of characteristic evolution is Cauchy-characteristic matching, which is also reviewed.
Characteristic Evolution and Matching
Directory of Open Access Journals (Sweden)
Winicour Jeffrey
1998-05-01
Full Text Available We review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to current 3D black hole codes that run forever. A prime application of characteristic evolution is Cauchy-characteristic matching, which is also reviewed.
International Nuclear Information System (INIS)
Ammari, Amara; Karoui, Abderrazek
2012-01-01
In this paper, we build a stable scheme for the solution of a deconvolution problem of the Abel integral equation type. This scheme is obtained by further developing the orthogonal polynomial-based techniques for solving the Abel integral equation of Ammari and Karoui (2010 Inverse Problems 26 105005). More precisely, this method is based on the simultaneous use of the two families of orthogonal polynomials of the Legendre and Jacobi types. In particular, we provide an explicit formula for the computation of the Legendre expansion coefficients of the solution. This explicit formula is based on some known formulae for the exact computation of the integrals of the product of some Jacobi polynomials with the derivatives of the Legendre polynomials. Besides the explicit and the exact computation of the expansion coefficients of the solution, our proposed method has the advantage of ensuring the stability of the solution under a fairly weak condition on the functional space to which the data function belongs. Finally, we provide the reader with some numerical examples that illustrate the results of this work. (paper)
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.
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...... fully expressive representations of externalities in matchings require exponential space, in this paper we propose a compact model of externalities, in which the influence of a match on each agent is computed additively. Under this framework, we analyze many-to-many matchings and one-to-one matchings...
Anarchy, Stability, and Utopia: Creating Better Matchings
Anshelevich, Elliot; Das, Sanmay; Naamad, Yonatan
We consider the loss in social welfare caused by individual rationality in matching scenarios. We give both theoretical and experimental results comparing stable matchings with socially optimal ones, as well as studying the convergence of various natural algorithms to stable matchings. Our main goal is to design mechanisms that incentivize agents to participate in matchings that are socially desirable. We show that theoretically, the loss in social welfare caused by strategic behavior can be substantial. However, under some natural distributions of utilities, we show experimentally that stable matchings attain close to the optimal social welfare. Furthermore, for certain graph structures, simple greedy algorithms for partner-switching (some without convergence guarantees) converge to stability remarkably quickly in expectation. Even when stable matchings are significantly socially suboptimal, slight changes in incentives can provide good solutions. We derive conditions for the existence of approximately stable matchings that are also close to socially optimal, which demonstrates that adding small switching costs can make socially optimal matchings stable.
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...
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.
Sample evaluation of ontology-matching systems
Hage, W.R. van; Isaac, A.; Aleksovski, Z.
2007-01-01
Ontology matching exists to solve practical problems. Hence, methodologies to find and evaluate solutions for ontology matching should be centered on practical problems. In this paper we propose two statistically-founded evaluation techniques to assess ontology-matching performance that are based on
Characteristic Evolution and Matching
Directory of Open Access Journals (Sweden)
Winicour Jeffrey
2005-12-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. A prime application of characteristic evolution is to compute waveforms via Cauchy-characteristic matching, which is also reviewed.
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...... fully expressive representations of externalities in matchings require exponential space, in this paper we propose a compact model of externalities, in which the influence of a match on each agent is computed additively. In this framework, we analyze many-to-many and one-to-one matchings under neutral...
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)
Chinese license plate character segmentation using multiscale template matching
Tian, Jiangmin; Wang, Guoyou; Liu, Jianguo; Xia, Yuanchun
2016-09-01
Character segmentation (CS) plays an important role in automatic license plate recognition and has been studied for decades. A method using multiscale template matching is proposed to settle the problem of CS for Chinese license plates. It is carried out on a binary image integrated from maximally stable extremal region detection and Otsu thresholding. Afterward, a uniform harrow-shaped template with variable length is designed, by virtue of which a three-dimensional matching space is constructed for searching of candidate segmentations. These segmentations are detected at matches with local minimum responses. Finally, the vertical boundaries of each single character are located for subsequent recognition. Experiments on a data set including 2349 license plate images of different quality levels show that the proposed method can achieve a higher accuracy at comparable time cost and is robust to images in poor conditions.
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
DEFF Research Database (Denmark)
Faust, Sebastian; Hazay, Carmit; Venturi, Daniele
2013-01-01
In secure delegatable computation, computationally weak devices (or clients) wish to outsource their computation and data to an untrusted server in the cloud. While most earlier work considers the general question of how to securely outsource any computation to the cloud server, we focus...... and the client C T in order to learn the positions at which a pattern of length m matches the text (and nothing beyond that). This is called the outsourced pattern matching problem and is highly motivated in the context of delegatable computing since it offers storage alternatives for massive databases...... that contain confidential data (e.g., health related data about patient history). Our constructions offer simulation-based security in the presence of semi-honest and malicious adversaries (in the random oracle model) and limit the communication in the query phase to O(m) bits plus the number of occurrences...
DEFF Research Database (Denmark)
Failla, Virgilio; Melillo, Francesca; Reichstein, Toke
is tested on matched employer-employee data from the entire Danish population. The analysis reveals that self-employed stay longer in their employment status compared to individuals in paid-employment. This effect is not explained by reduced attractiveness to the wage sector (lock-in effect). We interpret......Does entrepreneurship lower the losses associated with labor market mismatching by lowering employment turnover? This paper examines whether a transition to self-employment induces a shift into an individual’s stayer-mover tendency. Using a propensity score-matching technique, the hypothesis...
DEFF Research Database (Denmark)
Failla, Virgilio; Melillo, Francesca; Reichstein, Toke
Does entrepreneurship lower individuals? employment turnover rates? The paper offers two reasons why this is the case - a matching mechanism and a lock-in effect. The paper offers theoretical justifications and seeks to empirically disentangle the two mechanisms. A matched employer-employee data...... due to reduced attractiveness in the wage sector and sunk costs related lock-in effects. Results, however, also indicate that entrepreneurship may resolve mismatches of individuals in the labor market. This counterintuitive finding - self-employment yields greater employment stability - has...
Characteristic Evolution and Matching
Directory of Open Access Journals (Sweden)
Winicour Jeffrey
2009-04-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial value problem. Progress is traced from the early stage of 1D feasibility studies to 2D axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to eliminate the role of this artificial outer boundary via Cauchy-characteristic matching, by which the radiated waveform can be computed at null infinity. Progress in this direction is discussed.
On Tree-Constrained Matchings and Generalizations
Canzar, Stefan; Elbassioni, Khaled; Klau, Gunnar W.; Mestre, Julián
2015-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 none of the matched nodes is an ancestor of another matched node in either of the trees. This generalization of the classical bipartite matching problem appears, for example, in the computational ana...
Parikh Matching in the Streaming Model
DEFF Research Database (Denmark)
Lee, Lap-Kei; Lewenstein, Moshe; Zhang, Qin
2012-01-01
|-length count vector. In the streaming model one seeks space-efficient algorithms for problems in which there is one pass over the data. We consider Parikh matching in the streaming model. To make this viable we search for substrings whose Parikh-mappings approximately match the input vector. In this paper we...... present upper and lower bounds on the problem of approximate Parikh matching in the streaming model....
Parameterized String Matching Algorithms with Application to ...
African Journals Online (AJOL)
In the parameterized string matching problem, a given pattern P is said to match with a sub-string t of the text T, if there exist a bijection from the symbols of P to the symbols of t. Salmela and Tarhio solve the parameterized string matching problem in sub-linear time by applying the concept of q-gram in the Horspool algorithm ...
String matching with variable length gaps
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li; Vildhøj, Hjalte Wedel
2012-01-01
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a specified range), the problem is to find all ending positions of substrings in T that match P. This problem is a basic...
International Nuclear Information System (INIS)
Samios, N.P.
1994-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 foree 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. (orig.)
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
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.
Matching of the Flux Lattice to Geometrically Frustrated Pinning Arrays
Trastoy, J.; Bernard, R.; Briatico, J.; Villegas, J. E.; Lesueur, J.; Ulysse, C.; Faini, G.
2013-03-01
We use vortex dynamics on artificial nanoscale energy landscapes as a model to experimentally investigate a problem inspired by ``spin ice'' systems. In particular, we study the matching of the flux lattice to pinning arrays in which the geometrical frustration is expected to impede a unique stable vortex configuration and to promote metastability. This is done with YBCO films in which the nanoscale vortex energy landscape is fabricated via masked ion irradiation. Surprisingly, we found that minimal changes in the distance between pinning sites lead to the suppression of some of the magneto-resistance matching effects, that is, for certain well-defined vortex densities. This effect strongly depends on the temperature. We argue that this behavior can be explained considering the arrays' geometrical frustration and the thermally activated reconfiguration of the vortex lattice between isoenergetic states. Work supported by the French ANR via SUPERHYRBIDS-II and ``MASTHER,'' and the Galician Fundacion Barrie
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...
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 ...
Characteristic Evolution and Matching
Directory of Open Access Journals (Sweden)
Jeffrey Winicour
2012-01-01
Full Text Available I review the development of numerical evolution codes for general relativity based upon the characteristic initial-value problem. Progress in characteristic evolution is traced from the early stage of 1D feasibility studies to 2D-axisymmetric codes that accurately simulate the oscillations and gravitational collapse of relativistic stars and to current 3D codes that provide pieces of a binary black-hole spacetime. Cauchy codes have now been successful at simulating all aspects of the binary black-hole problem inside an artificially constructed outer boundary. A prime application of characteristic evolution is to extend such simulations to null infinity where the waveform from the binary inspiral and merger can be unambiguously computed. This has now been accomplished by Cauchy-characteristic extraction, where data for the characteristic evolution is supplied by Cauchy data on an extraction worldtube inside the artificial outer boundary. The ultimate application of characteristic evolution is to eliminate the role of this outer boundary by constructing a global solution via Cauchy-characteristic matching. Progress in this direction is discussed.
... 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
Towards optimal packed string matching
DEFF Research Database (Denmark)
Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany
2014-01-01
In the packed string matching problem, it is assumed that each machine word can accommodate up to α characters, thus an n-character string occupies n/α memory words.(a) We extend the Crochemore–Perrin constant-space O(n)-time string-matching algorithm to run in optimal O(n/α) time and even in real......-time, achieving a factor α speedup over traditional algorithms that examine each character individually. Our macro-level algorithm only uses the standard AC0 instructions of the word-RAM model (i.e. no integer multiplication) plus two specialized micro-level AC0 word-size packed-string instructions. The main word...... matching work.(b) We also consider the complexity of the packed string matching problem in the classical word-RAM model in the absence of the specialized micro-level instructions wssm and wslm. We propose micro-level algorithms for the theoretically efficient emulation using parallel algorithms techniques...
Evans, Chris; Ashworth, Mark; Peters, Marilyn
2010-01-01
In straightened times counselling must evidence the changes it promotes on reputable measures. Patient-generated measures complement nomothetic measures and may be nearer the ethos of counselling in eliciting individuals' problems. Scores from such measures from non-clinical samples are rarely reported, making their test-retest stability…
Paweł Strawiński
2011-01-01
Matched sampling is a methodology used to estimate treatment effects. A caliper mechanism is used to achieve better similarity among matched pairs. We investigate finite sample properties of matching with calipers and propose a slight modification to the existing mechanism. The simulation study compares the performance of both methods and shows that a standard caliper performs well only in case of constant treatment or uniform propensity score distribution. Secondly, in a case of non-uniform ...
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
Case-control matching: effects, misconceptions, and recommendations.
Mansournia, Mohammad Ali; Jewell, Nicholas Patrick; Greenland, Sander
2018-01-01
Misconceptions about the impact of case-control matching remain common. We discuss several subtle problems associated with matched case-control studies that do not arise or are minor in matched cohort studies: (1) matching, even for non-confounders, can create selection bias; (2) matching distorts dose-response relations between matching variables and the outcome; (3) unbiased estimation requires accounting for the actual matching protocol as well as for any residual confounding effects; (4) for efficiency, identically matched groups should be collapsed; (5) matching may harm precision and power; (6) matched analyses may suffer from sparse-data bias, even when using basic sparse-data methods. These problems support advice to limit case-control matching to a few strong well-measured confounders, which would devolve to no matching if no such confounders are measured. On the positive side, odds ratio modification by matched variables can be assessed in matched case-control studies without further data, and when one knows either the distribution of the matching factors or their relation to the outcome in the source population, one can estimate and study patterns in absolute rates. Throughout, we emphasize distinctions from the more intuitive impacts of cohort matching.
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...
Face recognition using ensemble string matching.
Chen, Weiping; Gao, Yongsheng
2013-12-01
In this paper, we present a syntactic string matching approach to solve the frontal face recognition problem. String matching is a powerful partial matching technique, but is not suitable for frontal face recognition due to its requirement of globally sequential representation and the complex nature of human faces, containing discontinuous and non-sequential features. Here, we build a compact syntactic Stringface representation, which is an ensemble of strings. A novel ensemble string matching approach that can perform non-sequential string matching between two Stringfaces is proposed. It is invariant to the sequential order of strings and the direction of each string. The embedded partial matching mechanism enables our method to automatically use every piece of non-occluded region, regardless of shape, in the recognition process. The encouraging results demonstrate the feasibility and effectiveness of using syntactic methods for face recognition from a single exemplar image per person, breaking the barrier that prevents string matching techniques from being used for addressing complex image recognition problems. The proposed method not only achieved significantly better performance in recognizing partially occluded faces, but also showed its ability to perform direct matching between sketch faces and photo faces.
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.
REDUCING THE LIKELIHOOD OF LONG TENNIS MATCHES
Directory of Open Access Journals (Sweden)
Tristan Barnett
2006-12-01
Full Text Available 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
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.
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.
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...
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
DEFF Research Database (Denmark)
Bille, Philip; Fagerberg, Rolf; Gørtz, Inge Li
2007-01-01
We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known...... complexities for both problems. In particular, we significantly improve the space bounds. In practical applications the space is likely to be a bottleneck and therefore this is of crucial importance....
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
DEFF Research Database (Denmark)
Bille, Philip; Fagerberg, Rolf; Gørtz, Inge Li
2009-01-01
We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known...... complexities for both problems. In particular, we significantly improve the space bounds, which in practical applications are likely to be a bottleneck....
Dataset Curation through Renders and Ontology Matching
2015-09-01
Dataset Curation through Renders and Ontology Matching Yair Movshovitz-Attias CMU-CS-15-119 September 2015 School of Computer Science Computer...REPORT TYPE 3. DATES COVERED 00-00-2015 to 00-00-2015 4. TITLE AND SUBTITLE Dataset Curation through Renders and Ontology Matching 5a...mapped to an ontology of geographical entities, we are able to extract multiple relevant labels per image. For the viewpoint estimation problem, by
Bellahsene, Zohra; Rahm, Erhard
2011-01-01
Requiring heterogeneous information systems to cooperate and communicate has now become crucial, especially in application areas like e-business, Web-based mash-ups and the life sciences. Such cooperating systems have to automatically and efficiently match, exchange, transform and integrate large data sets from different sources and of different structure in order to enable seamless data exchange and transformation. The book edited by Bellahsene, Bonifati and Rahm provides an overview of the ways in which the schema and ontology matching and mapping tools have addressed the above requirements
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
History Matching: Towards Geologically Reasonable Models
DEFF Research Database (Denmark)
Melnikova, Yulia; Cordua, Knud Skou; Mosegaard, Klaus
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......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...
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.
National Research Council Canada - National Science Library
Keller, Martin G
1999-01-01
In the fields of computational vision and image understanding, the object recognition problem can be formulated as a problem of matching a collection of model features to features extracted from an observed scene...
[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.
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...
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
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...... represents the spatial coordinates of the grid nodes. Knowledge of how grid nodes are depicted in the observed image is described through the observation model. The prior consists of a node prior and an arc (edge) prior, both modeled as Gaussian MRFs. The node prior models variations in the positions of grid...... nodes and the arc prior models variations in row and column spacing across the grid. Grid matching is done by placing an initial rough grid over the image and applying an ensemble annealing scheme to maximize the posterior distribution of the grid. The method can be applied to noisy images with missing...
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.)
A question of matching rather than scheduling
van de Velde, S.L.
1995-01-01
Proper scheduling maintenance for Air Force C-130 aircraft involves the prevention of mismatches concerning the availability of the aircraft and a new wing kit which would prolong its use. Scheduling maintenance problems include the designation of wing kits in the production sequence to match for a
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...
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...
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...
Directory of Open Access Journals (Sweden)
Cristian GEORGESCU
2005-01-01
Full Text Available The goal of this paper is to investigate how such a pattern matching could be performed on models,including the definition of the input language as well as the elaboration of efficient matchingalgorithms. Design patterns can be considered reusable micro-architectures that contribute to anoverall system architecture. Frameworks are also closely related to design patterns. Componentsoffer the possibility to radically change the behaviors and services offered by an application bysubstitution or addition of new components, even a long time after deployment. Software testing isanother aspect of reliable development. Testing activities mainly consist in ensuring that a systemimplementation conforms to its specifications.
An Integer Programming Approach to the Hospital/Residents Problem with Ties
Kwanashie, Augustine; Manlove, David F.
2013-01-01
The classical Hospitals/Residents problem (HR) models the assignment of junior doctors to hospitals based on their preferences over one another. In an instance of this problem, a stable matching M is sought which ensures that no blocking pair can exist in which a resident r and hospital h can improve relative to M by becoming assigned to each other. Such a situation is undesirable as it could naturally lead to r and h forming a private arrangement outside of the matching. The original HR mode...
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
Fast algorithms for approximate circular string matching.
Barton, Carl; Iliopoulos, Costas S; Pissis, Solon P
2014-03-22
Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optimal average-case algorithms for exact circular string matching. Approximate circular string matching is a rather undeveloped area. In this article, we present a suboptimal average-case algorithm for exact circular string matching requiring time O(n). Based on our solution for the exact case, we present two fast average-case algorithms for approximate circular string matching with k-mismatches, under the Hamming distance model, requiring time O(n) for moderate values of k, that is k=O(m/logm). We show how the same results can be easily obtained under the edit distance model. The presented algorithms are also implemented as library functions. Experimental results demonstrate that the functions provided in this library accelerate the computations by more than three orders of magnitude compared to a naïve approach. We present two fast average-case algorithms for approximate circular string matching with k-mismatches; and show that they also perform very well in practice. The importance of our contribution is underlined by the fact that the provided functions may be seamlessly integrated into any biological pipeline. The source code of the library is freely available at http://www.inf.kcl.ac.uk/research/projects/asmf/.
Symmetric Circular Matchings and RNA Folding
DEFF Research Database (Denmark)
Hofacker, Ivo L.; Reidys, Christian; Stadler, Peter F.
2012-01-01
or the co-folding of two or more identical RNAs. Here, we show that the RNA folding problem with symmetry terms can still be solved with polynomial-time algorithms. Empirically, the fraction of symmetric ground state structures decreases with chain length, so that the error introduced by neglecting......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...
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
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....
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.
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...
Vocal matching by orange-fronted conures (Aratinga canicularis)
DEFF Research Database (Denmark)
Balsby, Thorsten J S; Bradbury, Jack W
2009-01-01
The functions of vocal matching have been clarified in territorial songbirds, compositionally stable groups of birds and mammals, and species with multiple alarm or assembly signals. The functions of vocal matching are less well understood in fission/fusion species that are non-territorial, live...... in groups with variable composition, and lack multiple alarm signals. Here we present the results of interactive playbacks in a fission/fusion parrot species, the orange-fronted conjure (Aratinga canicularis), that provide evidence of vocal matching. A randomly selected loud contact call (chee) per trial...
Directory of Open Access Journals (Sweden)
Aleksandr G. Podvesovskii
2017-12-01
Full Text Available The article deals with an approach for modeling and software support of distribution of students between graduate supervisors at large graduate department. The approach is based on the stable matching problem and the Gale-Shapley deferred acceptance algorithm, and takes into account both students and supervisors’ preferences. The formalized description of distribution model is given, and the results of its practical verification are described. The advantages and disadvantages of the proposed approach are discussed, and the problem of preferences manipulation of graduate supervisors are examined. The architecture of the distribution support software system is presented, and some features of its implementation as a Web-service within the complex information system of the graduate department are described.
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)
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
Huang, X.; Hu, K.; Ling, X.; Zhang, Y.; Lu, Z.; Zhou, G.
2017-09-01
This paper introduces a novel global patch matching method that focuses on how to remove fronto-parallel bias and obtain continuous smooth surfaces with assuming that the scenes covered by stereos are piecewise continuous. Firstly, simple linear iterative cluster method (SLIC) is used to segment the base image into a series of patches. Then, a global energy function, which consists of a data term and a smoothness term, is built on the patches. The data term is the second-order Taylor expansion of correlation coefficients, and the smoothness term is built by combing connectivity constraints and the coplanarity constraints are combined to construct the smoothness term. Finally, the global energy function can be built by combining the data term and the smoothness term. We rewrite the global energy function in a quadratic matrix function, and use least square methods to obtain the optimal solution. Experiments on Adirondack stereo and Motorcycle stereo of Middlebury benchmark show that the proposed method can remove fronto-parallel bias effectively, and produce continuous smooth surfaces.
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...... that a secure match can achieve at least one order of accuracy and better computational performance than the techniques that use homomorphic encryption.It can handle and tackle new characteristics and an environment for a particular application in a mobile social network....
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...
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.
Instance-Based Ontology Matching by Instance Enrichment
Schopman, B.; Wang, S.; Isaac, A.H.J.C.A.; Schlobach, K.S.
2012-01-01
The ontology matching (OM) problem is an important barrier to achieve true Semantic Interoperability. Instance-based ontology matching (IBOM) uses the extension of concepts, the instances directly associated with a concept, to determine whether a pair of concepts is related or not. While IBOM has
Pattern classification approaches to matching building polygons at multiple scales
Zhang, X.; Zhao, X.; Molenaar, M.; Stoter, J.; Kraak, M.J.; Ai, T.
2012-01-01
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
36 CFR 72.32 - Funding and matching share.
2010-07-01
... which will address systemwide coordination, management and community resource problems through innovative and cost-effective approaches. (c) Sources of Matching Share—(1) State Incentive. As an incentive... project costs. In addition, two types of Federal funds may be used as part of a local match: General...
A robust line extraction and matching algorithm
Hussien, B.; Sridhar, B.
1993-01-01
This paper presents an algorithm for extracting straight lines from intensity mages and describes a line matching algorithm for solving the line correspondence problem. The line extraction process begins by detecting edges in the intensity image. Next, line support regions are formed where image points (pixels) have similar gradient orientation. A line fitting algorithm is then used to fit a line to the points in the line support region based on a least means square fitting algorithm. Finally, line segments are linked together to form the final lines by using an adaptive line linking method; this results in much stronger lines and a smaller set of lines to be considered. Once the lines are detected in a sequence of images, a line matching algorithm is used to match lines in one image to the lines in the other image. The images are either from a motion or stereo sequence. The matched lines may then be used with the sensor position and orientation data to estimate range to objects corresponding to the lines. We present results based on applying the line extraction and line matching algorithms to a synthetic image and an outdoor scene captured by a camera on a helicopter.
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
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
Indian Academy of Sciences (India)
IAS Admin
After Maynard-Smith and Price [1] mathematically derived why a given behaviour or strategy was adopted by a certain proportion of the population at a given time, it was shown that a strategy which is currently stable in a population need not be stable in evolutionary time (across generations). Additionally it was sug-.
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
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.
Normal modified stable processes
DEFF Research Database (Denmark)
Barndorff-Nielsen, Ole Eiler; Shephard, N.
2002-01-01
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...... 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...
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
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.
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...
Information Theoretic Shape Matching.
Hasanbelliu, Erion; Giraldo, Luis Sanchez; Príncipe, José C
2014-12-01
In this paper, we describe two related algorithms that provide both rigid and non-rigid point set registration with different computational complexity and accuracy. The first algorithm utilizes a nonlinear similarity measure known as correntropy. The measure combines second and high order moments in its decision statistic showing improvements especially in the presence of impulsive noise. The algorithm assumes that the correspondence between the point sets is known, which is determined with the surprise metric. The second algorithm mitigates the need to establish a correspondence by representing the point sets as probability density functions (PDF). The registration problem is then treated as a distribution alignment. The method utilizes the Cauchy-Schwarz divergence to measure the similarity/distance between the point sets and recover the spatial transformation function needed to register them. Both algorithms utilize information theoretic descriptors; however, correntropy works at the realizations level, whereas Cauchy-Schwarz divergence works at the PDF level. This allows correntropy to be less computationally expensive, and for correct correspondence, more accurate. The two algorithms are robust against noise and outliers and perform well under varying levels of distortion. They outperform several well-known and state-of-the-art methods for point set registration.
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
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.
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.
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...
Upper and lower bounds for stochastic processes modern methods and classical problems
Talagrand, Michel
2014-01-01
The book develops modern methods and in particular the "generic chaining" to bound stochastic processes. This methods allows in particular to get optimal bounds for Gaussian and Bernoulli processes. Applications are given to stable processes, infinitely divisible processes, matching theorems, the convergence of random Fourier series, of orthogonal series, and to functional analysis. The complete solution of a number of classical problems is given in complete detail, and an ambitious program for future research is laid out.
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.
Unconditional or Conditional Logistic Regression Model for Age-Matched Case-Control Data?
Kuo, Chia-Ling; Duan, Yinghui; Grady, James
2018-01-01
Matching on demographic variables is commonly used in case-control studies to adjust for confounding at the design stage. There is a presumption that matched data need to be analyzed by matched methods. Conditional logistic regression has become a standard for matched case-control data to tackle the sparse data problem. The sparse data problem, however, may not be a concern for loose-matching data when the matching between cases and controls is not unique, and one case can be matched to other controls without substantially changing the association. Data matched on a few demographic variables are clearly loose-matching data, and we hypothesize that unconditional logistic regression is a proper method to perform. To address the hypothesis, we compare unconditional and conditional logistic regression models by precision in estimates and hypothesis testing using simulated matched case-control data. Our results support our hypothesis; however, the unconditional model is not as robust as the conditional model to the matching distortion that the matching process not only makes cases and controls similar for matching variables but also for the exposure status. When the study design involves other complex features or the computational burden is high, matching in loose-matching data can be ignored for negligible loss in testing and estimation if the distributions of matching variables are not extremely different between cases and controls.
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.
An Efficient Multilinear Optimization Framework for Hypergraph Matching.
Nguyen, Quynh; Tudisco, Francesco; Gautier, Antoine; Hein, Matthias
2017-06-01
Hypergraph matching has recently become a popular approach for solving correspondence problems in computer vision as it allows the use of higher-order geometric information. Hypergraph matching can be formulated as a third-order optimization problem subject to assignment constraints which turns out to be NP-hard. In recent work, we have proposed an algorithm for hypergraph matching which first lifts the third-order problem to a fourth-order problem and then solves the fourth-order problem via optimization of the corresponding multilinear form. This leads to a tensor block coordinate ascent scheme which has the guarantee of providing monotonic ascent in the original matching score function and leads to state-of-the-art performance both in terms of achieved matching score and accuracy. In this paper we show that the lifting step to a fourth-order problem can be avoided yielding a third-order scheme with the same guarantees and performance but being two times faster. Moreover, we introduce a homotopy type method which further improves the performance.
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 ; Daily 1997), a complement to the then prevalent view of nature being a separate domain from people, and the protection of nature from people was an ethical rather than utilitarian imperative. The conceptual framework for the MEA (2005) viewed people... of Enlightenment, about 400 years ago. For the purposes of this article, we define science as an activity that attempts to understand the behaviour of a subject through the development of an explicit and coherent body of theory and its testing against evidence...
Probabilistic Analysis of Combinatorial Optimization Problems on Hypergraph Matchings
2012-02-01
tree when pruning, bt is selected as the partition with the smallest number of nodes: bt 2 arg min b fjCS;bj j b 2 BSg : (72) As long as there is a...bound tree. In other words, C t contains the nodes in CS;b that are not adjacent to node nt : C t D fi 2 CS;b j .i; nt / … E; b 2 BSg : Obviously, after...on is selected as bt 2 arg min b fjZt;bj j b 2 BSg ; (78) where jZt;bj is defined as the number of significant bits in the bitset Zt;b . The forward
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.
Approximate Matching of Hierarchial Data
DEFF Research Database (Denmark)
Augsten, Nikolaus
The goal of this thesis is to design, develop, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard...... formally proof that the pq-gram index can be incrementally updated based on the log of edit operations without reconstructing intermediate tree versions. The incremental update is independent of the data size and scales to a large number of changes in the data. We introduce windowed pq...... as in addition to the data values also the structure must be considered. A well-known measure for comparing trees is the tree edit distance. It is computationally expensive and leads to a prohibitively high run time. Our solution for the approximate matching of hierarchical data are pq-grams. The pq...
Javanmard, Adel; Haridasan, Maya; Zhang, Li
2012-01-01
We study algorithms for matching user tracks, consisting of time-ordered location points, to paths in the road network. Previous work has focused on the scenario where the location data is linearly ordered and consists of fairly dense and regular samples. In this work, we consider the \\emph{multi-track map matching}, where the location data comes from different trips on the same route, each with very sparse samples. This captures the realistic scenario where users repeatedly travel on regular...
Review og pattern matching approaches
DEFF Research Database (Denmark)
Manfaat, D.; Duffy, Alex; Lee, B. S.
1996-01-01
This paper presents a review of pattern matching techniques. The application areas for pattern matching are extensive, ranging from CAD systems to chemical analysis and from manufacturing to image processing. Published techniques and methods are classified and assessed within the context of three...... key issues: pattern classes, similiarity types and mathing methods. It has been shown that the techniques and approaches are as diverse and varied as the applications....
Indian Academy of Sciences (India)
2016-08-26
Aug 26, 2016 ... Home; Journals; Resonance – Journal of Science Education; Volume 21; Issue 9. Evolutionary Stable Strategy: Application of Nash Equilibrium in Biology. General ... Using some examples of classical games, we show how evolutionary game theory can help understand behavioural decisions of animals.
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.
Manifolds admitting stable forms
Czech Academy of Sciences Publication Activity Database
Le, Hong-Van; Panák, Martin; Vanžura, Jiří
2008-01-01
Roč. 49, č. 1 (2008), s. 101-11 ISSN 0010-2628 R&D Projects: GA ČR(CZ) GP201/05/P088 Institutional research plan: CEZ:AV0Z10190503 Keywords : stable forms * automorphism groups Subject RIV: BA - General Mathematics
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...
Directory of Open Access Journals (Sweden)
Behnaz Tolue
2018-07-01
Full Text Available In this paper we introduce stable subgroup graph associated to the group $G$. It is a graph with vertex set all subgroups of $G$ and two distinct subgroups $H_1$ and $H_2$ are adjacent if $St_{G}(H_1\\cap H_2\
Roedersheimer, Mark
2015-01-01
Exhaustive dialysis (ED) of lysed human platelets against dilute HCl yields stable angiogenic activity. Dialysis against a constrained external volume, with subsequent relaxation of the separation upon opening the dialysis bag, produces material able to maintain phenotypes and viability of human cells in culture better than ED material. Significant graded changes in MTT viability measurement tracked with external volume. The presence of elements smaller than the MW cutoff, capable of setting up cycling currents initiated by oriented flow of HCl across the membrane, suggests that maturation of bioactivity occurred through establishment of a novel type of geometric phase. These information-rich bound states fit recent descriptions of topological order and Majorana fermions, suggesting relevance in testing Penrose and Hameroff's theory of Orchestrated Objective Reduction, under conditions more general, and on finer scales, than those dependent on tubulin protein. The Berry curvature appears to be a good tool for building a general field theory of physiologic stress dependent on the quantum Hall effect. A new form of geometric phase, and an associated "geometric" quantum Hall effect underlying memory retrieval, dependent on the rate of path traversal and reduction from more than two initial field influences is described.
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 ...... 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....
Collinear phase matching for second harmonic generation using conoscopic interferometry
De, A.; Puri, A.
2010-04-01
The problem of finding phase-matching directions in noncentrosymmetric biaxial crystals is simplified here by the use of Conoscopic interferometry. Based on vector relations for wave propagation in birefringent media and solutions to phase-matching equations, we show that phase matching directions can be located on the conoscopic interferograms and that fringe numbers for dark-isochromes can be used as a guide to find phase-matching directions for a biaxial crystal. This technique can be generalized and extended to any anisotropic crystal. We have demonstrated this method for the particular case of a biaxial KTiOPO4 crystal, where it is found to be particularly suitable for finding the optimum-phase-matching directions.
Path-following based Point Matching using Similarity Transformation
Lian, Wei
2017-01-01
To address the problem of 3D point matching where the poses of two point sets are unknown, we adapt a recently proposed path following based method to use similarity transformation instead of the original affine transformation. The reduced number of transformation parameters leads to more constrained and desirable matching results. Experimental results demonstrate better robustness of the proposed method over state-of-the-art methods.
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.
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.
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
DEFF Research Database (Denmark)
Hazay, Carmit; Toft, Tomas
2014-01-01
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...... 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......(n+m) communication and O(1) rounds using O(nm) computation. Then we treat secure approximate pattern matching. In this variant the matches may be approximated, i.e., have Hamming distance less than some threshold, τ. Our protocol requires O(nτ) communication in O(1) rounds using O(nm) computation. Third, we have...
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...
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.
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.
Faster catalog matching on Graphics Processing Units
Lee, M. A.; Budavári, T.
2017-07-01
One of the most fundamental problems in observational astronomy is the cross-identification of sources. Observations are made at different times in different wavelengths with separate instruments, resulting in a large set of independent observations. The scientific outcome is often limited by our ability to quickly perform associations across catalogs. The matching, however, is difficult scientifically, statistically as well as computationally. The former two require detailed physical modeling and advanced probabilistic concepts; the latter is due to the large volumes of data and the problem's combinatorial nature. In order to tackle the computational challenge and to prepare for future surveys we developed a new implementation on Graphics Processing Units. Our solution scales across multiple devices and can process hundreds of trillions of crossmatch candidates per second in a single machine.
Generating catalogs of transverse matching solutions
International Nuclear Information System (INIS)
Swain, G.; Busch, P.; Burns, M.
1989-01-01
Programs such as TRANSPORT or TRACE can find transverse beam matching solutions one at a time when given appropriate starting conditions. In the present work, an algorithm is described which rapidly finds a catalog of approximate transverse beam matching solutions. For a given initial beam, the algorithm finds the gradients of four quadrupole magnets such as to get four Twiss parameters (alpha and beta for horizontal and vertical planes) which are close to a set of desired values at the exit of a constant-energy beam line with no horizontal-vertical cross coupling and no space charge. The beam line may contain bending elements with edge corrections and other elements for which the r matrixes are known. The algorithm transforms the entrance and exit beam specifications to waist specifications, and uses the properties of waist-to-waist transport to reduce the problem from a four dimensional search to a two dimensional search. At the Los Alamos Meson Physics Facility (LAMPF) accelerator, transverse matching is important in the low-energy transport lines (0.75 MeV), where beams from the H + , H/sup /minus//, and polarized H/sup /minus// sources must be tailored for injection into the drift-tube linac; and in the transition region (100 MeV), where the beam from the drift-tube linac is injected into the side-coupled linac. Space charge has significant effects in the low-energy transport, but it is still valuable to get no-space-charge matching solutions as a starting point for solutions with space charge. 2 refs
Application of supergeneralized matched filters to target classification
Heidary, Kaveh; Caulfield, H. John
2005-01-01
The matched filter (MF) is the optimum linear operator for distinguishing between a fixed signal and noise, given the noise statistics. A generalized matched filter (GMF) is a linear filter that can handle the more difficult problem of a multiple-example signal set, and it reduces to a MF when the signal set has only one member. A supergeneralized matched filter (SGMF) is a set of GMFs and a procedure to combine their results nonlinearly to handle the multisignal problem even better. Obviously the SGMF contains the GMF as a special case. An algorithm for training SGMFs is presented, and it is shown that the algorithm performs quite well even for extremely difficult classification problems.
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.
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.
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 ...... of a mobile phone system in a bigraphical representation of the polyadic π calculus.......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...
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.
Higher-Order Beta Matching with Solutions in Long Beta-Eta Normal Form
DEFF Research Database (Denmark)
Støvring, Kristian
2006-01-01
Higher-order matching is a special case of unification of simply-typed lambda-terms: in a matching equation, one of the two sides contains no unification variables. Loader has recently shown that higher-order matching up to beta equivalence is undecidable, but decidability of higher-order matching...... up to beta-eta equivalence is a long-standing open problem.We show that higher-order matching up to beta-eta equivalence is decidable if and only if a restricted form of higher-order matching up to beta equivalence is decidable: the restriction is that solutions must be in long beta-eta normal form....
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.
Chip Scale Ultra-Stable Clocks: Miniaturized Phonon Trap Timing Units for PNT of CubeSats
Rais-Zadeh, Mina; Altunc, Serhat; Hunter, Roger C.; Petro, Andrew
2016-01-01
The Chip Scale Ultra-Stable Clocks (CSUSC) project aims to provide a superior alternative to current solutions for low size, weight, and power timing devices. Currently available quartz-based clocks have problems adjusting to the high temperature and extreme acceleration found in space applications, especially when scaled down to match small spacecraft size, weight, and power requirements. The CSUSC project aims to utilize dual-mode resonators on an ovenized platform to achieve the exceptional temperature stability required for these systems. The dual-mode architecture utilizes a temperature sensitive and temperature stable mode simultaneously driven on the same device volume to eliminate ovenization error while maintaining extremely high performance. Using this technology it is possible to achieve parts-per-billion (ppb) levels of temperature stability with multiple orders of magnitude smaller size, weight, and power.
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.
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
Improved Atmospheric Stable Boundary Layer Formulations for Navy Seasonal Forecasting
2012-09-30
Long-term goals are to develop methods, descriptions and parameterizations that will alleviate long-standing problems in basically all large-scale numerical atmospheric models in dealing with statically stable and/or very stable conditions, and to implement these for Navy extended forecasting
Fitted-Stable Finite Difference Method for Singularly Perturbed Two ...
African Journals Online (AJOL)
A fitted-stable central difference method is presented for solving singularly perturbed two point boundary value problems with the boundary layer at one end (left or right) of the interval. A fitting factor is introduced in second order stable central difference scheme (SCD Method) and its value is obtained using the theory of ...
Directory of Open Access Journals (Sweden)
Takahiro eDoi
2014-10-01
Full Text Available Three-dimensional visual perception requires correct matching of images projected to the left and right eyes. The matching process is faced with an ambiguity: part of one eye’s image can be matched to multiple parts of the other eye’s image. This stereo correspondence problem is complicated for random-dot stereograms (RDSs, because dots with an identical appearance produce numerous potential matches. Despite such complexity, human subjects can perceive a coherent depth structure. A coherent solution to the correspondence problem does not exist for anticorrelated RDSs (aRDSs, in which luminance contrast is reversed in one eye. Neurons in the visual cortex reduce disparity selectivity for aRDSs progressively along the visual processing hierarchy. A disparity-energy model followed by threshold nonlinearity (threshold energy model can account for this reduction, providing a possible mechanism for the neural matching process. However, the essential computation underlying the threshold energy model is not clear. Here, we propose that a nonlinear modification of cross-correlation, which we term ‘cross-matching’, represents the essence of the threshold energy model. We placed half-wave rectification within the cross-correlation of the left-eye and right-eye images. The disparity tuning derived from cross-matching was attenuated for aRDSs. We simulated a psychometric curve as a function of graded anticorrelation (graded mixture of aRDS and normal RDS; this simulated curve reproduced the match-based psychometric function observed in human near/far discrimination. The dot density was 25% for both simulation and observation. We predicted that as the dot density increased, the performance for aRDSs should decrease below chance (i.e., reversed depth, and the level of anticorrelation that nullifies depth perception should also decrease. We suggest that cross-matching serves as a simple computation underlying the match-based disparity signals in
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 %.
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-01-01
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. PMID:26184206
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.
Efficient Approximation Algorithms for Weighted $b$-Matching
Energy Technology Data Exchange (ETDEWEB)
Khan, Arif; Pothen, Alex; Mostofa Ali Patwary, Md.; Satish, Nadathur Rajagopalan; Sundaram, Narayanan; Manne, Fredrik; Halappanavar, Mahantesh; Dubey, Pradeep
2016-01-01
We describe a half-approximation algorithm, b-Suitor, for computing a b-Matching of maximum weight in a graph with weights on the edges. b-Matching is a generalization of the well-known Matching problem in graphs, where the objective is to choose a subset of M edges in the graph such that at most a specified number b(v) of edges in M are incident on each vertex v. Subject to this restriction we maximize the sum of the weights of the edges in M. We prove that the b-Suitor algorithm computes the same b-Matching as the one obtained by the greedy algorithm for the problem. We implement the algorithm on serial and shared-memory parallel processors, and compare its performance against a collection of approximation algorithms that have been proposed for the Matching problem. Our results show that the b-Suitor algorithm outperforms the Greedy and Locally Dominant edge algorithms by one to two orders of magnitude on a serial processor. The b-Suitor algorithm has a high degree of concurrency, and it scales well up to 240 threads on a shared memory multiprocessor. The b-Suitor algorithm outperforms the Locally Dominant edge algorithm by a factor of fourteen on 16 cores of an Intel Xeon multiprocessor.
Marginally Stable Nuclear Burning
Strohmayer, Tod E.; Altamirano, D.
2012-01-01
Thermonuclear X-ray bursts result from unstable nuclear burning of the material accreted on neutron stars in some low mass X-ray binaries (LMXBs). Theory predicts that close to the boundary of stability oscillatory burning can occur. This marginally stable regime has so far been identified in only a small number of sources. We present Rossi X-ray Timing Explorer (RXTE) observations of the bursting, high- inclination LMXB 4U 1323-619 that reveal for the first time in this source the signature of marginally stable burning. The source was observed during two successive RXTE orbits for approximately 5 ksec beginning at 10:14:01 UTC on March 28, 2011. Significant mHz quasi- periodic oscillations (QPO) at a frequency of 8.1 mHz are detected for approximately 1600 s from the beginning of the observation until the occurrence of a thermonuclear X-ray burst at 10:42:22 UTC. The mHz oscillations are not detected following the X-ray burst. The average fractional rms amplitude of the mHz QPOs is 6.4% (3 - 20 keV), and the amplitude increases to about 8% below 10 keV.This phenomenology is strikingly similar to that seen in the LMXB 4U 1636-53. Indeed, the frequency of the mHz QPOs in 4U 1323-619 prior to the X-ray burst is very similar to the transition frequency between mHz QPO and bursts found in 4U 1636-53 by Altamirano et al. (2008). These results strongly suggest that the observed QPOs in 4U 1323-619 are, like those in 4U 1636-53, due to marginally stable nuclear burning. We also explore the dependence of the energy spectrum on the oscillation phase, and we place the present observations within the context of the spectral evolution of the accretion-powered flux from the source.
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.
Effects of Sensor Errors on the Performance of Map Matching
Chen, Wu; Li, Zhilin; Yu, Meng; Chen, Yongqi
2005-05-01
Map matching has been widely applied in car navigation systems as an efficient method to display the location of vehicles on maps. Various map-matching algorithms have been proposed. Inevitably, the correctness of the map matching is closely related to the accuracy of positioning sensors, such as GPS or Dead Reckoning (DR), and the complexity of the road network and map, especially in urban areas where the GPS signal may be constantly blocked by buildings and the road network is complicated. The existing map matching algorithms cannot resolve the positioning problems under all circumstances. They sometimes give the wrong position estimates of the car on road; the result is called mismatching. In order to improve the quality of map matching, a deep understand of the accuracy of sensor errors on mismatching is important. This paper analyses various factors that may affect the quality of map matching based on extensive tests in Hong Kong. Suggestions to improve the success rate of map matching are also provided.
How convincing is a matching Y-chromosome profile?
DEFF Research Database (Denmark)
Andersen, Mikkel M; Balding, David J
2017-01-01
patrilineal clans, many of which may not be represented in available databases. The higher mutation rates of modern profiling kits have led to increased discriminatory power but they have also exacerbated the problem of fairly conveying evidential value. Because the relevant population is difficult to define......, yet the number of matching relatives is fixed as population size varies, it is typically infeasible to derive population-based match probabilities relevant to a specific crime. We propose a conceptually simple solution, based on a simulation model and software to approximate the distribution...... of the number of males with a matching Y profile. We show that this distribution is robust to different values for the variance in reproductive success and the population growth rate. We also use importance sampling reweighting to derive the distribution of the number of matching males conditional on a database...
Recognition of Plain Objects Using Local Region Matching
Mansur, Al; Sakata, Katsutoshi; Das, Dipankar; Kuno, Yoshinori
Conventional interest point based matching requires computationally expensive patch preprocessing and is not appropriate for recognition of plain objects with negligible detail. This paper presents a method for extracting distinctive interest regions from images that can be used to perform reliable matching between different views of plain objects or scene. We formulate the correspondence problem in a Naive Bayesian classification framework and a simple correlation based matching, which makes our system fast, simple, efficient, and robust. To facilitate the matching using a very small number of interest regions, we also propose a method to reduce the search area inside a test scene. Using this method, it is possible to robustly identify objects among clutter and occlusion while achieving near real-time performance. Our system performs remarkably well on plain objects where some state-of-the art methods fail. Since our system is particularly suitable for the recognition of plain object, we refer to it as Simple Plane Object Recognizer (SPOR).
Role model and prototype matching
DEFF Research Database (Denmark)
Lykkegaard, Eva; Ulriksen, Lars
2016-01-01
Previous research has found that young people’s prototypes of science students and scientists affect their inclination to choose tertiary STEM programs (Science, Technology, Engineering and Mathematics). Consequently, many recruitment initiatives include role models to challenge these prototypes......’ 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...... images and situation-specific conceptions of role models. Furthermore, the study underlined the positive effect of prolonged role-model contact, the importance of using several role models and that traditional school subjects catered more resistant prototype images than unfamiliar ones did...
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
Matching conditions in relativistic astrophysics
Quevedo, Hernando
2012-01-01
We present an exact electrovacuum solution of Einstein-Maxwell equations with infinite sets of multipole moments which can be used to describe the exterior gravitational field of a rotating charged mass distribution. We show that in the special case of a slowly rotating and slightly deformed body, the exterior solution can be matched to an interior solution belonging to the Hartle-Thorne family of approximate solutions. To search for exact interior solutions, we propose to use the derivatives...
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.
A new method to extract stable feature points based on self-generated simulation images
Long, Fei; Zhou, Bin; Ming, Delie; Tian, Jinwen
2015-10-01
Recently, image processing has got a lot of attention in the field of photogrammetry, medical image processing, etc. Matching two or more images of the same scene taken at different times, by different cameras, or from different viewpoints, is a popular and important problem. Feature extraction plays an important part in image matching. Traditional SIFT detectors reject the unstable points by eliminating the low contrast and edge response points. The disadvantage is the need to set the threshold manually. The main idea of this paper is to get the stable extremums by machine learning algorithm. Firstly we use ASIFT approach coupled with the light changes and blur to generate multi-view simulated images, which make up the set of the simulated images of the original image. According to the way of generating simulated images set, affine transformation of each generated image is also known. Instead of the traditional matching process which contain the unstable RANSAC method to get the affine transformation, this approach is more stable and accurate. Secondly we calculate the stability value of the feature points by the set of image with its affine transformation. Then we get the different feature properties of the feature point, such as DOG features, scales, edge point density, etc. Those two form the training set while stability value is the dependent variable and feature property is the independent variable. At last, a process of training by Rank-SVM is taken. We will get a weight vector. In use, based on the feature properties of each points and weight vector calculated by training, we get the sort value of each feature point which refers to the stability value, then we sort the feature points. In conclusion, we applied our algorithm and the original SIFT detectors to test as a comparison. While in different view changes, blurs, illuminations, it comes as no surprise that experimental results show that our algorithm is more efficient.
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)
Customer and household matching: resolving entity identity in data warehouses
Berndt, Donald J.; Satterfield, Ronald K.
2000-04-01
The data preparation and cleansing tasks necessary to ensure high quality data are among the most difficult challenges faced in data warehousing and data mining projects. The extraction of source data, transformation into new forms, and loading into a data warehouse environment are all time consuming tasks that can be supported by methodologies and tools. This paper focuses on the problem of record linkage or entity matching, tasks that can be very important in providing high quality data. Merging two or more large databases into a single integrated system is a difficult problem in many industries, especially in the wake of acquisitions. For example, managing customer lists can be challenging when duplicate entries, data entry problems, and changing information conspire to make data quality an elusive target. Common tasks with regard to customer lists include customer matching to reduce duplicate entries and household matching to group customers. These often O(n2) problems can consume significant resources, both in computing infrastructure and human oversight, and the goal of high accuracy in the final integrated database can be difficult to assure. This paper distinguishes between attribute corruption and entity corruption, discussing the various impacts on quality. A metajoin operator is proposed and used to organize past and current entity matching techniques. Finally, a logistic regression approach to implementing the metajoin operator is discussed and illustrated with an example. The metajoin can be used to determine whether two records match, don't match, or require further evaluation by human experts. Properly implemented, the metajoin operator could allow the integration of individual databases with greater accuracy and lower cost.
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 ...
How Do Amateur Soccer Referees Destabilize a Match?
Fruchart, Eric; Carton, Annie
2012-01-01
The refereeing system in amateur football is not without weakness. Some referees could be deliberately led to destabilize a match in order to demonstrate their skills in regulating a situation of potential conflict. This has posed an ethical problem to soccer institutions. Our study proposes to focus on this phenomenon by questioning seventy four…
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...
"Living in sin" and marriage : a matching model
Rao Sahib, P. Padma; Gu, X. Xinhua
1999-01-01
This paper develops a two sided matching model of premarital cohabitation and marriage in which premarital cohabitation serves as a period of learning. We solve for the optimal policy to be followed by individuals by treating the model as a three stage dynamic programming problem. We find that
Matching the Market for Heart Transplantation.
Hsich, Eileen M
2016-04-01
Heart transplantation is the most effective therapy for patients with Stage D heart failure with a median life expectancy of ≈10 to 15 years. Unfortunately, many patients die on the waiting list hoping for a chance of survival. The life boat cannot rescue everyone. Over a decade, the donor pool has remained relatively stable, whereas the number of heart transplant candidates has risen. Potential recipients often have many comorbidities and are older because the criteria for heart transplantation has few absolute contraindications. Women, Hispanics, and patients with restrictive heart disease and congenital heart disease are more likely to die while awaiting heart transplantation than men, white patients, and those with either ischemic or dilated cardiomyopathy. To better match the market, we need to (1) increase the donor pool, (2) reduce the waitlist, and (3) improve the allocation system. This review article addresses all 3 options and compares strategies in the United States to those in other countries. © 2016 American Heart Association, Inc.
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
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
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
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
Discriminability limits in spatio-temporal stereo block matching.
Jain, Ankit K; Nguyen, Truong Q
2014-05-01
Disparity estimation is a fundamental task in stereo imaging and is a well-studied problem. Recently, methods have been adapted to the video domain where motion is used as a matching criterion to help disambiguate spatially similar candidates. In this paper, we analyze the validity of the underlying assumptions of spatio-temporal disparity estimation, and determine the extent to which motion aids the matching process. By analyzing the error signal for spatio-temporal block matching under the sum of squared differences criterion and treating motion as a stochastic process, we determine the probability of a false match as a function of image features, motion distribution, image noise, and number of frames in the spatio-temporal patch. This performance quantification provides insight into when spatio-temporal matching is most beneficial in terms of the scene and motion, and can be used as a guide to select parameters for stereo matching algorithms. We validate our results through simulation and experiments on stereo video.
Uyghur Text Matching in Graphic Images for Biomedical Semantic Analysis.
Fang, Shancheng; Xie, Hongtao; Chen, Zhineng; Liu, Yizhi; Li, Yan
2018-01-19
How to read Uyghur text from biomedical graphic images is a challenge problem due to the complex layout and cursive writing of Uyghur. In this paper, we propose a system that extracts text from Uyghur biomedical images, and matches the text in a specific lexicon for semantic analysis. The proposed system possesses following distinctive properties: first, it is an integrated system which firstly detects and crops the Uyghur text lines using a single fully convolutional neural network, and then keywords in the lexicon are matched by a well-designed matching network. Second, to train the matching network effectively an online sampling method is applied, which generates synthetic data continually. Finally, we propose a GPU acceleration scheme for matching network to match a complete Uyghur text line directly rather than a single window. Experimental results on benchmark dataset show our method achieves a good performance of F-measure 74.5%. Besides, our system keeps high efficiency with 0.5s running time for each image due to the GPU acceleration scheme.
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.
Feature extraction of hyperspectral images using wavelet and matching pursuit
Hsu, Pai-Hui
Since hyperspectral images contain rich and fine spectral information, an improvement of land use/cover classification accuracy is highly expected from the utilization of such images. However, the traditional statistics-based classification methods which have been successfully applied to multispectral data in the past are not as effective as to hyperspectral data. One major reason is that the number of spectral bands is too large relative to the number of training samples. This problem is caused by curse of dimensionality, which refers to the fact that the sample size required for training a specific classifier grows exponentially with the number of spectral bands. A simple but sometimes very effective way to overcome this problem is to reduce the dimensionality of hyperspectral images. This can be done by feature extraction that a small number of salient features are extracted from the hyperspectral data when confronted with a limited size of training samples. In this paper, a new feature extraction method based on the matching pursuit (MP) is proposed to extract useful features for the classification of hyperspectral images. The matching pursuit algorithm uses a greedy strategy to find an adaptive and optimal representation of the hyperspectral data iteratively from a highly redundant wavelet packets dictionary. An AVIRIS data set was tested to illustrate the classification performance after matching pursuit method was applied. In addition, some existing feature extraction methods based on the wavelet transform are also compared with the matching pursuit method in terms of the classification accuracies. The experiment results showed that the wavelet and matching pursuit method exactly provide an effective tool for feature extraction. The classification problem caused by curse of dimensionality can be avoided by matching pursuit and wavelet-based dimensionality reduction.
... Infants and Children Chest Pain, Acute Chest Pain, Chronic Cold and Flu Cough Diarrhea Ear Problems Elimination Problems Elimination Problems in Infants and Children Eye Problems Facial Swelling Feeding Problems in Infants ...
... Infants and Children Chest Pain, Acute Chest Pain, Chronic Cold and Flu Cough Diarrhea Ear Problems Elimination Problems Elimination Problems in Infants and Children Eye Problems Facial Swelling Feeding Problems in Infants ...
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
Dynamical attraction to stable processes
Fisher, Albert M.; Talet, Marina
2012-01-01
We apply dynamical ideas within probability theory, proving an almost-sure invariance principle in log density for stable processes. The familiar scaling property (self-similarity) of the stable process has a stronger expression, that the scaling flow on Skorokhod path space is a Bernoulli flow. We prove that typical paths of a random walk with i.i.d. increments in the domain of attraction of a stable law can be paired with paths of a stable process so that, after applying a non-random regula...
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)
GENERATION OF MATCHING CRITERIA: A CASE OF CREATIVE BEHAVIOR
Directory of Open Access Journals (Sweden)
CLAUDIO CARPIO
2006-01-01
Full Text Available Conceiving creative behavior as generation of novel criteria that give rise to different contingencies(Carpio, 1999; 2005, the effects of two levels of variability in the conditions of training were comparedon the effective performance in transference tests and on the generation of matching criteria. 20 universitystudents randomly assigned to 4 experimental groups that distinguished themselves by the level of variabilityin the problems to solve participated. The results indicate that the variability significantly affects theexecution in transference tests and facilitates the generation of matching criteria. Finally, the possibilitiesthat experimental analysis has on the study of creative behavior are discussed.
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.
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.
Matching conditions on capillary ripples
Energy Technology Data Exchange (ETDEWEB)
Rodriguez, Aresky H.; Marin Antuna, J.; Rodriguez Coppola, H. [Universidad de La Habana, La Habana (Cuba)
2001-12-01
The physics of the oscillatory motion in the interface between two immiscible viscous fluids is presented based on a detailed analysis of the matching conditions. These conditions are almost completely derived from the dynamical equations of the system. This unusual approach in graduated courses in hydrodynamics, is proposed as an alternative. The role of viscosity in the modes of oscillation of the interface is also clearly shown. [Spanish] Se explica la fisica de las oscilaciones de la interfase de dos fluidos viscosos no miscibles a partir del analisis detallado de las condiciones de empalme que se derivan casi completamente del sistema de ecuaciones dinamicas que lo rigen. Ese enfoque, no habitual en los cursos de doctorado de esta materia, se propone como alternativa para estos cursos. Se explica tambien de forma clara el posible papel de la viscosidad en los modos de oscilacion de la interfase.
Monetary Exchange with Multilateral Matching
DEFF Research Database (Denmark)
Julien, Benoît; Kennes, John; King, Ian
This paper analyzes monetary exchange in a search model allowing for multilateral matches to be formed, according to a standard urn-ballprocess. We consider three physical environments: indivisible goods and money, divisible goods and indivisible money, and divisible goods and money. We compare....... In particular, surplus maximization can be achieved in this setting, in equilibrium, with a positive money supply. Moreover, with flexible prices and directed search, the first best allocation can be attained through price posting or through auctions with lotteries, but not through auctions without lotteries....... Finally, analysis of the case of divisible goods and money can be performed without the assumption of large families (as in Shi (1997)) or the day and night structure of Lagos and Wright (2005)....
Tang, Jian; Chen, Yuwei; Jaakkola, Anttoni; Liu, Jinbing; Hyyppä, Juha; Hyyppä, Hannu
2014-07-04
Laser scan matching with grid-based maps is a promising tool for real-time indoor positioning of mobile Unmanned Ground Vehicles (UGVs). While there are critical implementation problems, such as the ability to estimate the position by sensing the unknown indoor environment with sufficient accuracy and low enough latency for stable vehicle control, further development work is necessary. Unfortunately, most of the existing methods employ heuristics for quick positioning in which numerous accumulated errors easily lead to loss of positioning accuracy. This severely restricts its applications in large areas and over lengthy periods of time. This paper introduces an efficient real-time mobile UGV indoor positioning system for large-area applications using laser scan matching with an improved probabilistically-motivated Maximum Likelihood Estimation (IMLE) algorithm, which is based on a multi-resolution patch-divided grid likelihood map. Compared with traditional methods, the improvements embodied in IMLE include: (a) Iterative Closed Point (ICP) preprocessing, which adaptively decreases the search scope; (b) a totally brute search matching method on multi-resolution map layers, based on the likelihood value between current laser scan and the grid map within refined search scope, adopted to obtain the global optimum position at each scan matching; and (c) a patch-divided likelihood map supporting a large indoor area. A UGV platform called NAVIS was designed, manufactured, and tested based on a low-cost robot integrating a LiDAR and an odometer sensor to verify the IMLE algorithm. A series of experiments based on simulated data and field tests with NAVIS proved that the proposed IMEL algorithm is a better way to perform local scan matching that can offer a quick and stable positioning solution with high accuracy so it can be part of a large area localization/mapping, application. The NAVIS platform can reach an updating rate of 12 Hz in a feature-rich environment and 2 Hz
24 CFR 576.51 - Matching funds.
2010-04-01
... specific statutory subtitle from which ESG funds are provided), as well as State, local, and private... match a previous ESG grant may not be used to match a subsequent grant award under this part. A grantee...
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
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.
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.
Small sample properties of matching with caliper
Paweł Strawiński
2012-01-01
A caliper mechanism is a common tool used to prevent from inexact matches. The existing literature discusses asymptotic properties of matching with caliper. In this simulation study we investigate properties in small and medium sized samples. We show that caliper causes a significant bias of the ATT estimator and raises its variance in comparison to one-to-one matching.
Image Matching Using Generalized Hough Transforms
Davis, L. S.; Hu, F. P.; Hwang, V.; Kitchen, L.
1983-01-01
An image matching system specifically designed to match dissimilar images is described. A set of blobs and ribbons is first extracted from each image, and then generalized Hough transform techniques are used to match these sets and compute the transformation that best registers the image. An example of the application of the approach to one pair of remotely sensed images is presented.
Robust weighted scan matching with quadtrees
Visser, A.; Slamet, B.A.; Pfingsthorn, M.
2009-01-01
This paper presents the improvement of the robustness and accuracy of the weighted scan matching algorithm matching against the union of earlier acquired scans. The approach allows to reduce the correspondence error, which is explicitly modeled in the weighted scan matching algorithm, by providing a
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.
A Linkage Matching Method for Road and Habitation by Using Urban Skeleton Line Network
Directory of Open Access Journals (Sweden)
LIU Chuang
2016-12-01
Full Text Available Obvious data consistency degree is not high in roads or habitation data, often in the presence of large geometric position deviation, which is not conducive to improve the accuracy and efficiency of road or habitation matching. A linkage matching method for road and habitation by using urban skeleton line network is proposed to solve this problem. The linkage matching imitates the human thinking process of searching for target objects by the signal features and spatial correlation when reading maps, regarding matching as a reasoning process of goal feature searching and information association transmitting. Firstly, urban skeleton line network is constructed by constraint Delaunay triangulation network; then, the topological relationship among road, skeleton line, skeleton line mesh, habitation is constructed; last, matching transmission model is established by the topological relationship. According to this matching transmission model, linkage matching is fulfilled, which contains road matching drives habitation matching or habitation matching drives road matching. The advantage of this method is that as long as there is an element of data consistency is good, can drive another element to obtain a very good matching effect, at the same time conform to the human cognitive process.
Small Vocabulary with Saliency Matching for Video Copy Detection
DEFF Research Database (Denmark)
Ren, Huamin; Moeslund, Thomas B.; Tang, Sheng
2013-01-01
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......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 vocabulary. BoW descriptors under a small vocabulary can be both robust and efficient, while keeping high recall rate compared with large vocabulary. However, the high false positives exists in small vocabulary also limits its application. To address this problem in small vocabulary, we propose a novel...
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...
The impact of matching the patient's vocabulary: a randomized control trial
Williams, N; Ogden, J
2004-01-01
Background. Research in general practice emphasizes the importance of matched models, beliefs and vocabulary in the consultation. Objective. The present study aimed to explore the impact of matched and unmatched vocabulary on patient satisfaction with consultations. Methods. The study took place in one inner city general practice. Patients (n = 62) were randomized to either matched or unmatched vocabulary consultations when consulting for problems relating to sexual or bodily function or anat...
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.
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.
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
DEFF Research Database (Denmark)
Almegaard, Henrik
2014-01-01
The majority of literature on engineering design methods is focused on the processes of fulfilling the design goals as efficiently as possible. This paper will focus on - and discuss - the processes of determining the design goals: the specifications. The purpose is to draw attention to the inher...... to the inherent problems, dilemmas and possibilities in these processes bearing in mind that that the most important decisions in a design project are taken in the beginning of the project....
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.
... 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 ...
How convincing is a matching Y-chromosome profile?
Directory of Open Access Journals (Sweden)
Mikkel M Andersen
2017-11-01
Full Text Available The introduction of forensic autosomal DNA profiles was controversial, but the problems were successfully addressed, and DNA profiling has gone on to revolutionise forensic science. Y-chromosome profiles are valuable when there is a mixture of male-source and female-source DNA, and interest centres on the identity of the male source(s of the DNA. The problem of evaluating evidential weight is even more challenging for Y profiles than for autosomal profiles. Numerous approaches have been proposed, but they fail to deal adequately with the fact that men with matching Y-profiles are related in extended patrilineal clans, many of which may not be represented in available databases. The higher mutation rates of modern profiling kits have led to increased discriminatory power but they have also exacerbated the problem of fairly conveying evidential value. Because the relevant population is difficult to define, yet the number of matching relatives is fixed as population size varies, it is typically infeasible to derive population-based match probabilities relevant to a specific crime. We propose a conceptually simple solution, based on a simulation model and software to approximate the distribution of the number of males with a matching Y profile. We show that this distribution is robust to different values for the variance in reproductive success and the population growth rate. We also use importance sampling reweighting to derive the distribution of the number of matching males conditional on a database frequency, finding that this conditioning typically has only a modest impact. We illustrate the use of our approach to quantify the value of Y profile evidence for a court in a way that is both scientifically valid and easily comprehensible by a judge or juror.
Matching roots to their environment.
White, Philip J; George, Timothy S; Gregory, Peter J; Bengough, A Glyn; Hallett, Paul D; McKenzie, Blair M
2013-07-01
Plants form the base of the terrestrial food chain and provide medicines, fuel, fibre and industrial materials to humans. Vascular land plants rely on their roots to acquire the water and mineral elements necessary for their survival in nature or their yield and nutritional quality in agriculture. Major biogeochemical fluxes of all elements occur through plant roots, and the roots of agricultural crops have a significant role to play in soil sustainability, carbon sequestration, reducing emissions of greenhouse gasses, and in preventing the eutrophication of water bodies associated with the application of mineral fertilizers. This article provides the context for a Special Issue of Annals of Botany on 'Matching Roots to Their Environment'. It first examines how land plants and their roots evolved, describes how the ecology of roots and their rhizospheres contributes to the acquisition of soil resources, and discusses the influence of plant roots on biogeochemical cycles. It then describes the role of roots in overcoming the constraints to crop production imposed by hostile or infertile soils, illustrates root phenotypes that improve the acquisition of mineral elements and water, and discusses high-throughput methods to screen for these traits in the laboratory, glasshouse and field. Finally, it considers whether knowledge of adaptations improving the acquisition of resources in natural environments can be used to develop root systems for sustainable agriculture in the future.
Racial disparities in colon cancer survival: a matched cohort study.
Silber, Jeffrey H; Rosenbaum, Paul R; Ross, Richard N; Niknam, Bijan A; Ludwig, Justin M; Wang, Wei; Clark, Amy S; Fox, Kevin R; Wang, Min; Even-Shoshan, Orit; Giantonio, Bruce J
2014-12-16
Differences in colon cancer survival by race are a recognized problem among Medicare beneficiaries. To determine to what extent the racial disparity in survival is due to disparity in presentation characteristics at diagnosis or disparity in subsequent treatment. Black patients with colon cancer were matched with 3 groups of white patients: a "demographic characteristics" match controlling for age, sex, diagnosis year, and Survey, Epidemiology, and End Results (SEER) site; a "presentation" match controlling for demographic characteristics plus comorbid conditions and tumor characteristics, including stage and grade; and a "treatment" match, including presentation variables plus details of surgery, radiation, and chemotherapy. 16 U.S. SEER sites. 7677 black patients aged 65 years or older diagnosed between 1991 and 2005 in the SEER-Medicare database and 3 sets of 7677 matched white patients, followed until 31 December 2009. 5-year survival. The absolute difference in 5-year survival between black and white patients was 9.9% (95% CI, 8.3% to 11.4%; PRacial disparities in colon cancer survival did not decrease among patients diagnosed between 1991 and 2005. This persistent disparity seemed to be more related to presentation characteristics at diagnosis than to subsequent treatment differences. Agency for Healthcare Research and Quality and National Science Foundation.
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.
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
[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
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.
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.
Stable Imaging and Accuracy Issues of Low-Altitude Unmanned Aerial Vehicle Photogrammetry Systems
Directory of Open Access Journals (Sweden)
Ying Yang
2016-04-01
Full Text Available Stable imaging of an unmanned aerial vehicle (UAV photogrammetry system is an important issue that affects the data processing and application of the system. Compared with traditional aerial images, the large rotation of roll, pitch, and yaw angles of UAV images decrease image quality and result in image deformation, thereby affecting the ground resolution, overlaps, and the consistency of the stereo models. These factors also cause difficulties in automatic tie point matching, image orientation, and accuracy of aerial triangulation (AT. The issues of large-angle photography of UAV photogrammetry system are discussed and analyzed quantitatively in this paper, and a simple and lightweight three-axis stabilization platform that works with a low-precision integrated inertial navigation system and a three-axis mechanical platform is used to reduce this problem. An experiment was carried out with an airship as the flight platform. Another experimental dataset, which was acquired by the same flight platform without a stabilization platform, was utilized for a comparative test. Experimental results show that the system can effectively isolate the swing of the flying platform. To ensure objective and reliable results, another group of experimental datasets, which were acquired using a fixed-wing UAV platform, was also analyzed. Statistical results of the experimental datasets confirm that stable imaging of a UAV platform can help improve the quality of aerial photography imagery and the accuracy of AT, and potentially improve the application of images acquired by a UAV.
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......-window indexing, and sketch a possible optimization for use in the special case of Lempel-Ziv compression....
Research of image matching algorithm based on local features
Sun, Wei
2015-07-01
For the problem of low efficiency in SIFT algorithm while using exhaustive method to search the nearest neighbor and next nearest neighbor of feature points, this paper introduces K-D tree algorithm, to index the feature points extracted in database images according to the tree structure, at the same time, using the concept of a weighted priority, further improves the algorithm, to further enhance the efficiency of feature matching.
2011-06-01
management, personnel assignments (or allocations), payroll and compensation. This research addresses just one of these functions; the assignment of...smaller regional markets. Of the seven different UK markets that have used computerized matching techniques, Roth found that the two that use stable
... is an MRE? Is an MRE shelf stable? What foods are packaged in retort packages? What is aseptic ... type of package is used for aseptic processing? What foods are packaged in aseptic packages? Can I microwave ...
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)
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
LDAHash: Improved Matching with Smaller Descriptors.
Strecha, C; Bronstein, A M; Bronstein, M M; Fua, P
2012-01-01
SIFT-like local feature descriptors are ubiquitously employed in computer vision applications such as content-based retrieval, video analysis, copy detection, object recognition, photo tourism, and 3D reconstruction. Feature descriptors can be designed to be invariant to certain classes of photometric and geometric transformations, in particular, affine and intensity scale transformations. However, real transformations that an image can undergo can only be approximately modeled in this way, and thus most descriptors are only approximately invariant in practice. Second, descriptors are usually high dimensional (e.g., SIFT is represented as a 128-dimensional vector). In large-scale retrieval and matching problems, this can pose challenges in storing and retrieving descriptor data. We map the descriptor vectors into the Hamming space in which the Hamming metric is used to compare the resulting representations. This way, we reduce the size of the descriptors by representing them as short binary strings and learn descriptor invariance from examples. We show extensive experimental validation, demonstrating the advantage of the proposed approach.
A matched filter hypothesis for cognitive control.
Chrysikou, Evangelia G; Weber, Matthew J; Thompson-Schill, Sharon L
2014-09-01
The prefrontal cortex exerts top-down influences on several aspects of higher-order cognition by functioning as a filtering mechanism that biases bottom-up sensory information toward a response that is optimal in context. However, research also indicates that not all aspects of complex cognition benefit from prefrontal regulation. Here we review and synthesize this research with an emphasis on the domains of learning and creative cognition, and outline how the appropriate level of cognitive control in a given situation can vary depending on the organism's goals and the characteristics of the given task. We offer a matched filter hypothesis for cognitive control, which proposes that the optimal level of cognitive control is task-dependent, with high levels of cognitive control best suited to tasks that are explicit, rule-based, verbal or abstract, and can be accomplished given the capacity limits of working memory and with low levels of cognitive control best suited to tasks that are implicit, reward-based, non-verbal or intuitive, and which can be accomplished irrespective of working memory limitations. Our approach promotes a view of cognitive control as a tool adapted to a subset of common challenges, rather than an all-purpose optimization system suited to every problem the organism might encounter. © 2013 Published by Elsevier Ltd.
More Speed and More Compression: Accelerating Pattern Matching by Text Compression
Matsumoto, Tetsuya; Hagio, Kazuhito; Takeda, Masayuki
2007-01-01
This paper addresses the problem of speeding up string matching by text compression, and presents a compressed pattern matching (CPM) algorithm which finds a pattern within a text given as a collage system that variable sequence S is encoded by byte-oriented Huffman coding. The compression ratio is high compared with existing CPM algorithms addressing the problem, and the search time reduction ratio compared to the Knuth-Morris-Pratt algorithm over uncompressed text is nearly the same as the...
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.
How convincing is a matching Y-chromosome profile?
DEFF Research Database (Denmark)
Andersen, Mikkel Meyer; Balding, David J.
2017-01-01
The introduction of forensic autosomal DNA profiles was controversial, but the problems were successfully addressed, and DNA profiling has gone on to revolutionise forensic science. Y-chromosome profiles are valuable when there is a mixture of male-source and female-source DNA, and interest centres...... on the identity of the male source(s) of the DNA. The problem of evaluating evidential weight is even more challenging for Y profiles than for autosomal profiles. Numerous approaches have been proposed, but they fail to deal adequately with the fact that men with matching Y-profiles are related in extended...
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.
Rapid matching in Drosophila place learning
Zars, Melissa; Zars, Troy
2009-08-01
The level of conditioned behavior in animals is proportional to the intensity, amount, frequency, or probability of reinforcement. Interestingly, this matching can be dynamic, with performance levels following, for example, a switch in the probability of reinforcement with a short delay. We previously found that conditioned performance levels in Drosophila match reinforcement intensity in a place conditioning paradigm. Whether Drosophila can match conditioned behavior to a change in reinforcement intensity was an open question. In this study, we found that both conditioned behavior and memory levels match reinforcement intensity after a switch, and this rapid matching occurs within 2 min. Thus, fruit flies can dynamically match conditioned behavior and memory levels to a change in reinforcement intensity.
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...
Tackling the challenges of matching biomedical ontologies.
Faria, Daniel; Pesquita, Catia; Mott, Isabela; Martins, Catarina; Couto, Francisco M; Cruz, Isabel F
2018-01-15
Biomedical ontologies pose several challenges to ontology matching due both to the complexity of the biomedical domain and to the characteristics of the ontologies themselves. The biomedical tracks in the Ontology Matching Evaluation Initiative (OAEI) have spurred the development of matching systems able to tackle these challenges, and benchmarked their general performance. In this study, we dissect the strategies employed by matching systems to tackle the challenges of matching biomedical ontologies and gauge the impact of the challenges themselves on matching performance, using the AgreementMakerLight (AML) system as the platform for this study. We demonstrate that the linear complexity of the hash-based searching strategy implemented by most state-of-the-art ontology matching systems is essential for matching large biomedical ontologies efficiently. We show that accounting for all lexical annotations (e.g., labels and synonyms) in biomedical ontologies leads to a substantial improvement in F-measure over using only the primary name, and that accounting for the reliability of different types of annotations generally also leads to a marked improvement. Finally, we show that cross-references are a reliable source of information and that, when using biomedical ontologies as background knowledge, it is generally more reliable to use them as mediators than to perform lexical expansion. We anticipate that translating traditional matching algorithms to the hash-based searching paradigm will be a critical direction for the future development of the field. Improving the evaluation carried out in the biomedical tracks of the OAEI will also be important, as without proper reference alignments there is only so much that can be ascertained about matching systems or strategies. Nevertheless, it is clear that, to tackle the various challenges posed by biomedical ontologies, ontology matching systems must be able to efficiently combine multiple strategies into a mature matching
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...
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.
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.
Highly Scalable Matching Pursuit Signal Decomposition Algorithm
National Aeronautics and Space Administration — In this research, we propose a variant of the classical Matching Pursuit Decomposition (MPD) algorithm with significantly improved scalability and computational...
44 CFR 361.4 - Matching contributions.
2010-10-01
... HOMELAND SECURITY PREPAREDNESS NATIONAL EARTHQUAKE HAZARDS REDUCTION ASSISTANCE TO STATE AND LOCAL GOVERNMENTS Earthquake Hazards Reduction Assistance Program § 361.4 Matching contributions. (a) All State...
PUMA: The Positional Update and Matching Algorithm
Line, J. L. B.; Webster, R. L.; Pindor, B.; Mitchell, D. A.; Trott, C. M.
2017-01-01
We present new software to cross-match low-frequency radio catalogues: the Positional Update and Matching Algorithm. The Positional Update and Matching Algorithm combines a positional Bayesian probabilistic approach with spectral matching criteria, allowing for confusing sources in the matching process. We go on to create a radio sky model using Positional Update and Matching Algorithm based on the Murchison Widefield Array Commissioning Survey, and are able to automatically cross-match 98.5% of sources. Using the characteristics of this sky model, we create simple simulated mock catalogues on which to test the Positional Update and Matching Algorithm, and find that Positional Update and Matching Algorithm can reliably find the correct spectral indices of sources, along with being able to recover ionospheric offsets. Finally, we use this sky model to calibrate and remove foreground sources from simulated interferometric data, generated using OSKAR (the Oxford University visibility generator). We demonstrate that there is a substantial improvement in foreground source removal when using higher frequency and higher resolution source positions, even when correcting positions by an average of 0.3 arcmin given a synthesised beam-width of 2.3 arcmin.
Second Order Mode Selective Phase-Matching
DEFF Research Database (Denmark)
Lassen, Mikael Østergaard; Delaubert, Vincent; Bachor, Hans. A-
2006-01-01
We exploit second order (χ(2)) nonlinear optical phase matching for the selection of individual high order transverse modes. The ratio between the generated components can be adjusted continuously via changes in the phase-matching condition. ©2007 Optical Society of America......We exploit second order (χ(2)) nonlinear optical phase matching for the selection of individual high order transverse modes. The ratio between the generated components can be adjusted continuously via changes in the phase-matching condition. ©2007 Optical Society of America...
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.
The UspIC: Performing Scan Matching Localization Using an Imaging Sonar
Directory of Open Access Journals (Sweden)
Antoni Burguera
2012-06-01
Full Text Available This paper presents a novel approach to localize an underwater mobile robot based on scan matching using a Mechanically Scanned Imaging Sonar (MSIS. When used to perform scan matching, this sensor presents some problems such as significant uncertainty in the measurements or large scan times, which lead to a motion induced distortion. This paper presents the uspIC, which deals with these problems by adopting a probabilistic scan matching strategy and by defining a method to strongly alleviate the motion induced distortion. Experimental results evaluating our approach and comparing it to previously existing methods are provided.
The uspIC: performing scan matching localization using an imaging sonar.
Burguera, Antoni; Gonzàlez, Yolanda; Oliver, Gabriel
2012-01-01
This paper presents a novel approach to localize an underwater mobile robot based on scan matching using a Mechanically Scanned Imaging Sonar (MSIS). When used to perform scan matching, this sensor presents some problems such as significant uncertainty in the measurements or large scan times, which lead to a motion induced distortion. This paper presents the uspIC, which deals with these problems by adopting a probabilistic scan matching strategy and by defining a method to strongly alleviate the motion induced distortion. Experimental results evaluating our approach and comparing it to previously existing methods are provided.
... 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 ...
Stable Boundary Layer Education (STABLE) Final Campaign Summary
Energy Technology Data Exchange (ETDEWEB)
Turner, David D. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2016-03-01
The properties of, and the processes that occur in, the nocturnal stable boundary layer are not well understood, making it difficult to represent adequately in numerical models. The nocturnal boundary layer often is characterized by a temperature inversion and, in the Southern Great Plains region, a low-level jet. To advance our understanding of the nocturnal stable boundary layer, high temporal and vertical resolution data on the temperature and wind properties are needed, along with both large-eddy simulation and cloud-resolving modeling.
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.
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.
A novel SAR image precise-matching method based on SIFT algorithm
Yan, Wenwen; Li, Bin; Yang, Dekun; Tian, Jinwen; Yu, Qiong
2013-10-01
As for SAR image, it has a relatively great geometric distortion, and contains a lot of speckle noise. So a lot of research has been done to find a good method for SAR image matching. SIFT (Scale Invariant Feature Transform) has been proved to a good algorithm for the SAR image matching. This operator can dispose of matching problem such as rotation, affine distortion and noise. In this passage, firstly, in the preprocessing process, we use BM3D to denoise the image which can perform well comparing to other denoise method. Then, regardless of traditional SIFT-RANSAC method, SIFT-TC is used to complete image matching. By using this method, the image matching is proved to have better predominance in the matching efficiency, speed and robustness.
SEMI-GLOBAL MATCHING IN OBJECT SPACE
Directory of Open Access Journals (Sweden)
F. Bethmann
2015-03-01
Full Text Available Semi-Global Matching (SGM is a widespread algorithm for image matching which is used for very different applications, ranging from real-time applications (e.g. for generating 3D data for driver assistance systems to aerial image matching. Originally developed for stereo-image matching, several extensions have been proposed to use more than two images within the matching process (multi-baseline matching, multi-view stereo. These extensions still perform the image matching in (rectified stereo images and combine the pairwise results afterwards to create the final solution. This paper proposes an alternative approach which is suitable for the introduction of an arbitrary number of images into the matching process and utilizes image matching by using non-rectified images. The new method differs from the original SGM method mainly in two aspects: Firstly, the cost calculation is formulated in object space within a dense voxel raster by using the grey (or colour values of all images instead of pairwise cost calculation in image space. Secondly, the semi-global (path-wise minimization process is transferred into object space as well, so that the result of semi-global optimization leads to index maps (instead of disparity maps which directly indicate the 3D positions of the best matches. Altogether, this yields to an essential simplification of the matching process compared to multi-view stereo (MVS approaches. After a description of the new method, results achieved from two different datasets (close-range and aerial are presented and discussed.
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
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
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
Fingerprint Matching Using Minutiae Quadruplets | Iloanusi ...
African Journals Online (AJOL)
Fingerprint matching faces several challenges resulting from the varying quality of fingerprint scanners, the weakness of some scanners in detecting fake fingerprints and the poor performance of fingerprint matching algorithms caused by the high intraclass variations between fingerprints of the same subject. The major ...
Determination of Transmission Line Impedance Matching Parameters
African Journals Online (AJOL)
The analysis of measured and computed matching parameters show that the values obtained are within the acceptable standard threshold values of Voltage Standing Wave Ratio ≤1.50 and Return loss ≥ +14dB used by telecommunication transmission designers worldwide. Keywords: Impedance matching, voltage ...
Monkeys Match and Tally Quantities across Senses
Jordan, Kerry E.; MacLean, Evan L.; Brannon, Elizabeth M.
2008-01-01
We report here that monkeys can actively match the number of sounds they hear to the number of shapes they see and present the first evidence that monkeys sum over sounds and sights. In Experiment 1, two monkeys were trained to choose a simultaneous array of 1-9 squares that numerically matched a sample sequence of shapes or sounds. Monkeys…
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
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
Co-Segmentation Guided Hough Transform for Robust Feature Matching.
Chen, Hsin-Yi; Lin, Yen-Yu; Chen, Bing-Yu
2015-12-01
We present an algorithm that integrates image co-segmentation into feature matching, and can robustly yield accurate and dense feature correspondences. Inspired by the fact that correct feature correspondences on the same object typically have coherent transformations, we cast the task of feature matching as a density estimation problem in the homography space. Specifically, we project the homographies of correspondence candidates into the parametric Hough space, in which geometric verification of correspondences can be activated by voting. The precision of matching is then boosted. On the other hand, we leverage image co-segmentation, which discovers object boundaries, to determine relevant voters and speed up Hough voting. In addition, correspondence enrichment can be achieved by inferring the concerted homographies that are propagated between the features within the same segments. The recall is hence increased. In our approach, feature matching and image co-segmentation are tightly coupled. Through an iterative optimization process, more and more correct correspondences are detected owing to object boundaries revealed by co-segmentation. The proposed approach is comprehensively evaluated. Promising experimental results on four datasets manifest its effectiveness.
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%).
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.
Improved Feature Matching for Mobile Devices with IMU.
Masiero, Andrea; Vettore, Antonio
2016-08-05
Thanks to the recent diffusion of low-cost high-resolution digital cameras and to the development of mostly automated procedures for image-based 3D reconstruction, the popularity of photogrammetry for environment surveys is constantly increasing in the last years. Automatic feature matching is an important step in order to successfully complete the photogrammetric 3D reconstruction: this step is the fundamental basis for the subsequent estimation of the geometry of the scene. This paper reconsiders the feature matching problem when dealing with smart mobile devices (e.g., when using the standard camera embedded in a smartphone as imaging sensor). More specifically, this paper aims at exploiting the information on camera movements provided by the inertial navigation system (INS) in order to make the feature matching step more robust and, possibly, computationally more efficient. First, a revised version of the affine scale-invariant feature transform (ASIFT) is considered: this version reduces the computational complexity of the original ASIFT, while still ensuring an increase of correct feature matches with respect to the SIFT. Furthermore, a new two-step procedure for the estimation of the essential matrix E (and the camera pose) is proposed in order to increase its estimation robustness and computational efficiency.
A Note on the Room-Mates Problem and a Related Revenue Allocation Problem
Daniel Granot
1984-01-01
We introduce in this note the consistent organizational structure (COS) problem, which can be viewed as a generalization of the college admission and room-mates problems. Both the room-mates problem and the COS problem may have no stable solution. When side payments are allowed, the COS problem, but not the room-mates problem, always has a nonempty core. We further study some nucleoli of the COS problem with side payments.
Context-dependent logo matching and recognition.
Sahbi, Hichem; Ballan, Lamberto; Serra, Giuseppe; Del Bimbo, Alberto
2013-03-01
We contribute, through this paper, to the design of a novel variational framework able to match and recognize multiple instances of multiple reference logos in image archives. Reference logos and test images are seen as constellations of local features (interest points, regions, etc.) and matched by minimizing an energy function mixing: 1) a fidelity term that measures the quality of feature matching, 2) a neighborhood criterion that captures feature co-occurrence/geometry, and 3) a regularization term that controls the smoothness of the matching solution. We also introduce a detection/recognition procedure and study its theoretical consistency. Finally, we show the validity of our method through extensive experiments on the challenging MICC-Logos dataset. Our method overtakes, by 20%, baseline as well as state-of-the-art matching/recognition procedures.
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.
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
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.
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...
PSOM2—partitioning-based scalable ontology matching using ...
Indian Academy of Sciences (India)
B Sathiya
2017-11-16
-based systems to reduce the matching space. ... reduction in execution time, leading to an effective and scalable ontology matching system. Keywords. ... ontology matching results, collaborative and social ontol- ogy matching ...
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
Monitoring of stable glaucoma patients
K.M. Holtzer-Goor (Kim); N.S. Klazinga (Niek); M.A. Koopmanschap (Marc); H.G. Lemij (Hans); T. Plochg; E. van Sprundel (Esther)
2010-01-01
textabstractA high workload for ophthalmologists and long waiting lists for patients challenge the organization of ophthalmic care. Tasks that require less specialized skills, like the monitoring of stable (well controlled) glaucoma patients could be substituted from ophthalmologists to other
ORIGINAL ARTICLE Fitted-Stable Finite Difference Method for ...
African Journals Online (AJOL)
Gemechis
A fitted-stable central difference method is presented for solving singularly perturbed two point boundary value problems with the ..... Approximating the converted error term, which have the stabilizing effect (Choo and. Schultz, 1993), in Eq. (8) by using the ... is the local truncation error. Introducing the fitting factor σ into Eq.
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...
RETIRED MATCHES AMONG MALE PROFESSIONAL TENNIS PLAYERS
Directory of Open Access Journals (Sweden)
Kristijan Breznik
2012-06-01
Full Text Available The aim of this study was to explore the effect of characteristics of various games and players on the proportion of retired tennis matches in the Open Era of tennis. The data included over 420,000 matches played among 17,553 tennis players in the period from 1968 to the end of 2010. The influence of the surface type was clearly confirmed, with the proportion of retired matches being higher on hard and clay courts compared to grass and carpet surfaces. Similarly, more retired matches were observed in outdoor venues than in indoor ones. The impact of other variables, tournament types, rounds at which the game was played and both players' ranks, is more ambiguous. Our interpretation of the obtained results is presented in the paper. Network analytic methods were applied to extract players with the most retired matches in their careers. Eventually, we defined a group of top tennis players and gave a more precise insight into retired matches in that group. Correspondence analysis was used to visually display the two-mode network of top players and the proportion of retired matches by surface type
Voltage Sags Matching to Locate Faults for Underground Distribution Networks
Directory of Open Access Journals (Sweden)
BAKAR, A. H. A.
2011-05-01
Full Text Available A voltage sags matching to locate a fault for underground distribution network is presented in this paper. Firstly the method identifies the faulted section by matching a voltage sags measured at the primary substation during a fault with pre-developed voltage sag database. From the identified faulted section, the distance of a fault from sending-end is calculated. The problem of multiple sections is addressed by ranking approach. Test results on an underground distribution network shows most faults can be located by the first attempt within high accuracy distance. Only few faulted sections found by the second attempt. Since the method is using only voltage sag data, monitored at the primary substation, the method is considers economical to be implemented for a rural distribution network.
Topological transition in disordered planar matching: combinatorial arcs expansion
Lokhov, Andrey Y.; Valba, Olga V.; Nechaev, Sergei K.; Tamm, Mikhail V.
2014-12-01
In this paper, we investigate analytically the properties of the disordered Bernoulli model of planar matching. This model is characterized by a topological phase transition, yielding complete planar matching solutions only above a critical density threshold. We develop a combinatorial procedure of arcs expansion that explicitly takes into account the contribution of short arcs and allows us to obtain an accurate analytical estimation of the critical value by reducing the global constrained problem to a set of local ones. As an application to a toy representation of the RNA secondary structures, we suggest generalized models that incorporate a one-to-one correspondence between the contact matrix and the RNA-type sequence, thus giving sense to the notion of effective non-integer alphabets.
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.
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.
Thomas, Shane
2014-06-01
Problem gambling is an increasingly common problem in Australia. General practitioners (GPs) have an important role in ensuring that problem gambling is detected and treated. We review the clinical issues associated with the detection and treatment of problem gambling. At any one time 1% of the adult Australian population satisfy the clinical criteria for problem gambling; a further 4% are at a significant risk. Problem gambling frequently presents with other serious mental health conditions. There are several guidelines from the National Health and Medical Research Council and Australian Medical Association that recommend GP involvement in screening for problem gambling. Simple one-item tools are available for that purpose. GP screening and referral for problem gambling addresses the currently very low rates of treatment. Effective and durable psychological treatments are available for the treatment of problem gambling including cognitive behaviour therapy and motivational interviewing.
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
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 η......NL to demonstrate a significant soliton selffrequency shift of a fundamental soliton, and we show that nonlinear matching can take precedence over linear mode matching. The nonlinear coupling coefficient depends on both the dispersion (β2) and nonlinearity (γ), as well as on the power coupling efficiency η. Being...
Improving the Nephrology Match: the Path Forward.
Hsu, Chi-yuan; Parker, Mark G; Ross, Michael J; Schmidt, Rebecca J; Harris, Raymond C
2015-11-01
The Fellowship Match process was designed to provide applicants and program directors with an opportunity to consider all their options before making decisions about post-residency training. In a Match, applicants can choose the programs that best suit their career goals, and program directors can consider all candidates before preparing a rank order list. The Match is a contract, requiring obligations of both programs and applicants to achieve success, ensure uniformity, and standardize participation. Copyright © 2015 by the American Society of Nephrology.
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.
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
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…
A Zero-One Programming Approach to Gulliksen's Matched Random Subtests Method.
van der Linden, Wim J.; Boekkooi-Timminga, Ellen
1988-01-01
Gulliksen's matched random subtests method is a graphical method to split a test into parallel test halves, allowing maximization of coefficient alpha as a lower bound to the classical test reliability coefficient. This problem is formulated as a zero-one programing problem solvable by algorithms that already exist. (TJH)
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.
Microbiological characterization of stable resuspended dust
Directory of Open Access Journals (Sweden)
Nora Kováts
2016-06-01
Full Text Available Objectives: Air quality in the stables is characterized by elevated level of dust and aeroallergens which are supposed to directly cause or exacerbate several respiratory disorders. The most often recognized problem is recurrent airway obstruction (RAO, previously known as chronic obstructive pulmonary disease (COPD. There is some indication that aeroallergens (among them endotoxins may also cause inflammation in human airways and may exceed safe levels in stables. Monitoring studies have covered mainly the determination of the concentration of respirable particles and of culturable fungi and their toxins. However, these particles do not only directly affect the respiratory system, but might act as a carrier conveying toxic contaminants and biological agents such as bacteria. In a typical, 20-horse Hungarian stable, microbial community of respirable fraction of resuspended dust has been characterized to reveal if these particles convey hazardous pathogenic bacteria, posing risk to either horses or staff. Material and Methods: Resuspended dust was sampled using a mobile instrument. The instrument contains a PARTISOL-FRM model 2000 sampler that was operated at a flow rate of 16.7 l/min and a cyclone separator which collected the particulate matter with an aerodynamic size between 1 μm and 10 μm (PM1–10 fraction. Microbial taxa were identified by culture-independent next generation sequencing (NGS of variable 16S ribosomal ribonucleic acid (rRNA gene regions. Results: In total, 1491 different taxa were identified, of them 384 were identified to species level, 961 to genus level. The sample was dominated by common ubiquitous soil and organic material-dwelling taxa. Conclusions: Pathogens occurred at low abundance, and were represented by mostly facultative human pathogens, with the prevalence of Staphylococcus species.
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%).
... the mother, baby, or both. Possible complications include Preterm (premature) labor, when labor starts before 37 completed weeks of pregnancy Problems with the umbilical cord Problems with the position of the baby, such as breech, in which ...
... 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 ...
... your legs or feet Movement disorders such as Parkinson's disease Diseases such as arthritis or multiple sclerosis Vision or balance problems Treatment of walking problems depends on the cause. Physical therapy, surgery, or mobility aids may help.
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
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
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.
Matched Spectral Filter Imager, Phase I
National Aeronautics and Space Administration — OPTRA proposes the development of an imaging spectrometer for greenhouse gas and volcanic gas imaging based on matched spectral filtering and compressive imaging....
The Effectiveness of Advertising Matching Purchase Motivation
J. Loef; 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
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}.
A Theory of Rerepresentation in Analogical Matching
2003-01-01
cause (higherPressure Beaker Vial) (flow Beaker Vial Water Pipe)) T2: (cause (hotterThan Coffee IceCube ) (flow Coffee IceCube ...Coffee IceCube ) from the earlier example requires rewriting both expressions in terms of a more general, dimensional-independent comparative (e.g...greaterThan (Temperature Coffee) (Temperature IceCube )) which will match because non-identical function matches are allowed by structure
Technological progress and average job matching quality
Centeno, Mário; Corrêa, Márcio V.
2009-01-01
Our objective is to study, in a labor market characterized by search frictions, the effect of technological progress on the average quality of job matches. For that, we use an extension of Mortensen and Pissarides (1998) and obtain as results that the effects of technological progress on the labor market depend upon the initial conditions of the economy. If the economy is totally characterized by the presence of low-quality job matches, an increase in technological progress is accompanied by ...
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...
't Hooft anomaly matching for discrete symmetries
International Nuclear Information System (INIS)
Csaki, C.; Murayama, Hitoshi; Lawrence Berkeley National Lab., CA
1998-05-01
The authors show how to extend the 't Hooft anomaly matching conditions to discrete symmetries. They check these discrete anomally matching conditions on several proposed low-energy spectra of certain strongly interacting gauge theories. The excluded examples include the proposed chirally symmetric vacuum of pure N = 1 supersymmetric yang-Mills theories, certain non-supersymmetric confining theories and some self-dual N = 1 supersymmetric theories based on exceptional groups
Rebate subsidies, matching subsidies and isolation effects
Directory of Open Access Journals (Sweden)
Douglas D. Davis
2006-07-01
Full Text Available In a series of recent experiments (Davis, Millner and Reilly, 2005, Eckel and Grossman, 2003, 2005a-c, 2006, matching subsidies generate significantly higher charity receipts than do theoretically equivalent rebate subsidies. This paper reports a laboratory experiment conducted to examine whether the higher receipts are attributable to a relative preference for matching subsidies or to an ``isolation effect'' (McCaffery and Baron, 2003, 2006. Some potential policy implications of isolation effects on charitable contributions are also
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.
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
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....
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 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
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
Privacy-preserving matching of similar patients.
Vatsalan, Dinusha; Christen, Peter
2016-02-01
The identification of similar entities represented by records in different databases has drawn considerable attention in many application areas, including in the health domain. One important type of entity matching application that is vital for quality healthcare analytics is the identification of similar patients, known as similar patient matching. A key component of identifying similar records is the calculation of similarity of the values in attributes (fields) between these records. Due to increasing privacy and confidentiality concerns, using the actual attribute values of patient records to identify similar records across different organizations is becoming non-trivial because the attributes in such records often contain highly sensitive information such as personal and medical details of patients. Therefore, the matching needs to be based on masked (encoded) values while being effective and efficient to allow matching of large databases. Bloom filter encoding has widely been used as an efficient masking technique for privacy-preserving matching of string and categorical values. However, no work on Bloom filter-based masking of numerical data, such as integer (e.g. age), floating point (e.g. body mass index), and modulus (numbers wrap around upon reaching a certain value, e.g. date and time), which are commonly required in the health domain, has been presented in the literature. We propose a framework with novel methods for masking numerical data using Bloom filters, thereby facilitating the calculation of similarities between records. We conduct an empirical study on publicly available real-world datasets which shows that our framework provides efficient masking and achieves similar matching accuracy compared to the matching of actual unencoded patient records. Copyright © 2015 Elsevier Inc. All rights reserved.
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.
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
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
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.
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.
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.
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.
Stable Hemiaminals: 2-Aminopyrimidine Derivatives
Directory of Open Access Journals (Sweden)
Anna Kwiecień
2015-08-01
Full Text Available Stable hemiaminals can be obtained in the one-pot reaction between 2-aminopyrimidine and nitrobenzaldehyde derivatives. Ten new hemiaminals have been obtained, six of them in crystal state. The molecular stability of these intermediates results from the presence of both electron-withdrawing nitro groups as substituents on the phenyl ring and pyrimidine ring, so no further stabilisation by intramolecular interaction is required. Hemiaminal molecules possess a tetrahedral carbon atom constituting a stereogenic centre. As the result of crystallisation in centrosymmetric space groups both enantiomers are present in the crystal structure.
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 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
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
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
DEFF Research Database (Denmark)
Christensen, Anders Bøggild; Rasmussen, Tove; Bundesen, Peter Verner
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....
A mixture of delta-rules approximation to bayesian inference in change-point problems.
Directory of Open Access Journals (Sweden)
Robert C Wilson
Full Text Available Error-driven learning rules have received considerable attention because of their close relationships to both optimal theory and neurobiological mechanisms. However, basic forms of these rules are effective under only a restricted set of conditions in which the environment is stable. Recent studies have defined optimal solutions to learning problems in more general, potentially unstable, environments, but the relevance of these complex mathematical solutions to how the brain solves these problems remains unclear. Here, we show that one such Bayesian solution can be approximated by a computationally straightforward mixture of simple error-driven 'Delta' rules. This simpler model can make effective inferences in a dynamic environment and matches human performance on a predictive-inference task using a mixture of a small number of Delta rules. This model represents an important conceptual advance in our understanding of how the brain can use relatively simple computations to make nearly optimal inferences in a dynamic world.
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.
Computer-Generated Holographic Matched Filters
Butler, Steven Frank
This dissertation presents techniques for the use of computer-generated holograms (CGH) for matched filtering. An overview of the supporting technology is provided. Included are techniques for modifying existing CGH algorithms to serve as matched filters in an optical correlator. It shows that matched filters produced in this fashion can be modified to improve the signal-to-noise and efficiency over that possible with conventional holography. The effect and performance of these modifications are demonstrated. In addition, a correction of film non-linearity in continuous -tone filter production is developed. Computer simulations provide quantitative and qualitative demonstration of theoretical principles, with specific examples validated in optical hardware. Conventional and synthetic holograms, both bleached and unbleached, are compared.
[Establishment of beta block matching technique].
Zhu, Fa-Ming; Lü, Qin-Feng; Zhang, Wei; Zhang, Hai-Qin; Fu, Qi-Hua; Yan, Li-Xing
2005-10-01
The purpose of this study was to establish beta block matching technique. DNA was extracted from whole blood by salting-out method, beta block matching was performed by PCR and GeneScan technique. The results showed that the length of fragments amplificated in 100 samples was different and the range of them was 91-197 bp. Amplification fragments could be divided into four regions: 91-93, 105-113, 125-139 and 177-197 bp respectively. 91 bp DNA fragments could be found in all of samples. The numbers of DNA fragments with different length have been shown high polymorphism and they focused on the range of seven to twenty four. In conclusion, the beta block matching technique is reliable and applicable to the selection of hematopoietic stem cell transplantation donors.
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.
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.
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.
Directory of Open Access Journals (Sweden)
Kirstin Peters
2014-08-01
Full Text Available We study whether, in the pi-calculus, the match prefix—a conditional operator testing two names for (syntactic equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables. Later on, Gorla developed a by now widely-tested set of criteria for encodings that allows much more freedom (e.g. instead of direct translations of observables it allows comparison of calculi with respect to reachability of successful states. In this paper, we offer a considerably stronger separation result on the non-expressibility of matching using only Gorla's relaxed requirements.
Performance Evaluation of Tree Object Matching
DEFF Research Database (Denmark)
Somchaipeng, Kerawit; Sporring, Jon; Kreiborg, Sven
2005-01-01
of the algorithm is presented: an exact and an approximation. Several experiments are conducted to empirically evaluate the MSST matching algorithm under image distortions. Further, the performance of the MSST matching algorithm is measured on three databases: the ORL face database, magazine covers, and the COIL......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...... database. Finally the performance is compared with algorithms based on the Scale Invariant Feature Transform (SIFT), and the Position of Catastrophes (CAT)....
Transverse Matching Techniques for the SNS Linac
Jeon Dong Oh; Danilov, Viatcheslav V
2005-01-01
It is crucial to minimize beam loss and machine activation by obtaining optimal transverse matching for a high-intensity linear accelerator such as the Spallation Neutron Source linac. For matching the Drift Tube Linac (DTL) to Coupled Cavity Linac (CCL), there are four wire-scanners installed in series in CCL module 1 as proposed by the author.* A series of measurements was conducted to minimize envelope breathing and the results are presented here. As an independent approach, Chu et al is developing an application based on another technique by estimating rms emittance using the wire scanner profile data.** For matching the Medium Energy Beam Transport Line to the DTL, a technique of minimizing rms emittance was used and emittance data show that tail is minimized as well.
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.
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.
2011-01-28
... which we will compare our current employee records of the Federal Personnel/Payroll System with the... computerized comparison of records. We will use this information to verify self-certification statements of... Matching Program We will compare identifying information from The Payroll, Leave and Attendance Records (60...
A Matched Filter For Communicating With Chaos
Corron, Ned J.; Blakely, Jonathan N.
2011-04-01
In conventional communication systems, a matched filter provides optimal receiver performance in the presence of noise. As such, matched filters are highly desirable, yet they are practical only when a relatively small number of known basis functions are used to represent information. For communications using chaotic waveforms, the unpredictable and nonrepeating nature of chaos suggests the basis functions are uncertain and ever changing, which would preclude the use of a simple matched filter. Consequently, it is widely accepted that the performance of chaos communications lags that of conventional, no chaotic systems. In this paper, we show this assumption is not necessarily true. We describe a simple, low-dimensional chaotic oscillator that admits an exact analytic solution containing a single fixed basis function. The solution is written as the linear convolution of a symbol sequence and the basis function, similar to how conventional communications waveforms are usually represented. Despite the linear nature of the solution, waveform returns sampled at regular switching times are conjugate to a shift map, proving the oscillator is chaotic. A matched filter for the basis function is defined and used to extract symbolic information from the chaotic wave-form. Its performance in additive white Gaussian noise is comparable to that of binary phase-shift keying (BPSK). The oscillator and its matched filter have potential application in Hayes-type chaos communications where a message signal is encoded in the symbolic dynamics via small perturbation control. The discovery of a practical matched filter for chaos finally provides a coherent receiver to complement this elegant encoding scheme.
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.
Allocation Problems and Market Design
DEFF Research Database (Denmark)
Smilgins, Aleksandrs
The thesis contains six independent papers with a common theme: Allocation problems and market design. The first paper is concerned with fair allocation of risk capital where independent autonomous subunits have risky activities and together constitute the entity's total risk, whose associated risk......-to-one matching model by including a set of objects, such that a matching consists of two agents from disjoint sets, and an object. Agents' preference lists consist of all possible pairs of objects and agents from the other set, and thus contain important information about agent-object tradeoffs. The notion...
Matching Parasitic Antenna for Single RF MIMO
DEFF Research Database (Denmark)
Han, Bo; Kalis, A; Nielsen, Rasmus Hjorth
2012-01-01
. In order to have such performance, an antenna with rich pattern modes is required by the system, thus the ESPAR antenna is investigated. The critical part on such antenna is parasitic element impedance matching. Unlike the conventional smith-chart matching method which assumes the minimal resistance......Single RF MIMO communication emerges a novel low cost communication method which does not consume as much power as the conventional MIMO. The implementation of such single RF MIMO system is done by mapping the weighting factors to the polarizations or the radiation patterns of the antennas...
Adiabatic matching section for plasma accelerated beams
Directory of Open Access Journals (Sweden)
Klaus Floettmann
2014-05-01
Full Text Available An adiabatic matching section is discussed as option to control the divergence and emittance growth of a beam exiting a plasma channel. Based on a general analytical solution of a focusing channel with varying focusing strength, a focusing profile is proposed which allows for a fast expansion of the beam size while keeping the emittance growth minimal. The solution is also applicable to other cases, e.g., the matching of a positron source to the downstream accelerating section, which are, however, not discussed in this contribution.
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...
Families of FPGA-Based Accelerators for Approximate String Matching.
Van Court, Tom; Herbordt, Martin C
2007-03-05
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many implementations have reported impressive speed-ups, but have typically been point solutions - highly specialized and addressing only one or a few of the many possible options. The problem to be solved is creating a hardware description that implements a broad range of behavioral options without losing efficiency due to feature bloat. We report a set of three component types that address different parts of the approximate string matching problem. This allows each application to choose the feature set required, then make maximum use of the FPGA fabric according to that application's specific resource requirements. Multiple, interchangeable implementations are available for each component type. We show that these methods allow the efficient generation of a large, if not complete, family of accelerators for this application. This flexibility was obtained while retaining high performance: We have evaluated a sample against serial reference codes and found speed-ups of from 150× to 400× over a high-end PC.
Unmanned Aerial Systems and DSM matching for rock glacier monitoring
Dall'Asta, Elisa; Forlani, Gianfranco; Roncella, Riccardo; Santise, Marina; Diotri, Fabrizio; Morra di Cella, Umberto
2017-05-01
Among other techniques, aerial and terrestrial photogrammetry have long been used to control the displacements of landslides and glaciers as well as for the detection of terrain morphological changes. Unmanned Aerial Systems (UAS) are today an efficient tool to perform data acquisition in rough or difficult terrain, both safely and quickly, avoiding hazards and risks for the operators while at the same time containing the survey costs. Since 2012 ARPAVdA (the Regional Environmental Protection Agency of Aosta Valley, Italy) periodically surveys with UAS photogrammetry the Gran Sometta rock glacier, the Agency main monitoring site for the climate change impacts on high-mountain areas and related infrastructures. A Digital Surface Model (DSM) and an orthophoto of the rock glacier are produced after each survey flight. In order to accurately georeference them in a stable reference system, a Global Navigation Satellite System (GNSS) campaign is carried out at each epoch, to update the coordinates of signalised Ground Control Points (GCPs), since they partly lay in unstable (moving) areas. In late August 2015 a survey flight has been executed with a senseFly eBee RTK, with differential corrections sent from a ground reference station. The block has been adjusted without GCP using, as control information, only the projection centres coordinates encoded in the images. The RMS of the differences found on twelve Check Points were about 4 cm in horizontal and 7 cm in elevation, i.e. practically the same accuracy found using GCP. Differences between the DSMs produced at the same epoch with block orientation performed with GCP and with GNSS-determined projection centres were also investigated. To evaluate the rock glacier displacement fields between two epochs, corresponding features were at first manually identified on the orthophotos by a trained operator. To avoid the manual time-consuming procedure and increase the density of displacement information, two automatic
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
... can also cause foot problems. The Most Common Types of Foot Problems In older adults, the foot complaints encountered ... people include: Arch pain . From fallen arches (flat feet), or abnormally high arches. Tarsal tunnel syndrome . A type of pinched nerve disorder. Achilles tendonitis . Inflammation of ...
... during your menstrual cycle Premenstrual syndrome (PMS) Problem periods Getting enough sleep Looking and feeling your best Fighting germs Your sexuality What are STDs and STIs? Seeing the doctor Quizzes Links to more information on girls' bodies girlshealth glossary girlshealth.gov home http://www.girlshealth.gov/ Home ... Problem periods Itâs common to have ...
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
Successive odor matching- and non-matching-to-sample in rats: A reversal design.
Bruce, Katherine; Dyer, Katherine; Mathews, Michael; Nealley, Catharine; Phasukkan, Tiffany; Prichard, Ashley; Galizio, Mark
2017-07-13
There is a growing body of research on matching- and non-matching-to-sample (MTS, NMTS) relations with rats using olfactory stimuli; however, the specific characteristics of this relational control are unclear. In the current study we examine MTS and NMTS in rats with an automated olfactometer using a successive (go, no-go) procedure. Ten rats were trained to either match- or non-match-to-sample with common scents (apple, cinnamon, etc.) as olfactory stimuli. After matching or non-matching training with four odorants, rats were tested for transfer twice with four new odorants on each test. Most rats trained on MTS showed immediate transfer to new stimuli, and most rats trained on NMTS showed full transfer by the second set of new odors. After meeting criterion on the second transfer test, the contingencies were reversed with four new odor stimuli such that subjects trained on matching were shifted to non-matching and vice versa. Following these reversed contingencies, the effects of the original training persisted for many trials with new odorants. These data extend previous studies on same-different concept formation in rats, showing strong generalization requiring few exemplars. The critical role of olfactory stimuli is discussed. Copyright © 2017 Elsevier B.V. All rights reserved.
Do people match surface reflectance fundamentally differently than they match emitted light?
Granzier, J.J.M.; Brenner, E.; Smeets, J.B.J.
2009-01-01
We compared matches between colours that were both presented on a computer monitor or both as pieces of paper, with matching the colour of a piece of paper with a colour presented on a computer monitor and vice versa. Performance was specifically poor when setting an image on a computer monitor to
Recent trends in applicants and the matching process for the integrated plastic surgery match.
Super, Nikki; Tieman, Joshua; Boucher, Kenneth; Rockwell, William Bradford; Agarwal, Jayant P
2013-10-01
Matching into a plastic surgery (PS) residency program is a highly competitive process. Selection criteria are very stringent and may influence an applicant's candidacy and application strategy. The purpose of this study was to evaluate recent trends of applicants matching into integrated PS programs using published National Resident Match Program data. Residency match data were gathered for application years 2002 to 2011 using the National Resident Match Program/Association of American Medical Colleges databases. Analyses were limited to the US senior group and excluded the non-US senior group because of the small numbers in the latter group. For all data sets, a logistic regression was performed to analyze the statistical significance of the data. The overall match rate continues to approximately 50%. United States senior applicants were more likely to rank PS only versus PS and others (PS + other) over time (P ranking PS only were more likely to match versus US senior applicants ranking PS + other (odds ratio, 1.71; P rank PS only. The proportion of applicants ranking PS only is steadily rising. The ranking strategy used by US senior applicants is self-selecting into a more competitive (PS only) and less competitive (PS + other) applicant pool. If this continues, nearly 50% of applicants will not match and could be left scrambling for an alternative residency position. These findings therefore suggest that all candidates, regardless of their perceived application strength, should consider having a "backup plan."
Bayesian Approach to Inverse Problems
2008-01-01
Many scientific, medical or engineering problems raise the issue of recovering some physical quantities from indirect measurements; for instance, detecting or quantifying flaws or cracks within a material from acoustic or electromagnetic measurements at its surface is an essential problem of non-destructive evaluation. The concept of inverse problems precisely originates from the idea of inverting the laws of physics to recover a quantity of interest from measurable data.Unfortunately, most inverse problems are ill-posed, which means that precise and stable solutions are not easy to devise. Regularization is the key concept to solve inverse problems.The goal of this book is to deal with inverse problems and regularized solutions using the Bayesian statistical tools, with a particular view to signal and image estimation
Chebotarev, Alexander Yu.; Grenkin, Gleb V.; Kovtanyuk, Andrey E.; Botkin, Nikolai D.; Hoffmann, Karl-Heinz
2018-04-01
The paper is concerned with a problem of diffraction type. The study starts with equations of complex (radiative and conductive) heat transfer in a multicomponent domain with Fresnel matching conditions at the interfaces. Applying the diffusion, P1, approximation yields a pair of coupled nonlinear PDEs describing the radiation intensity and temperature for each component of the domain. Matching conditions for these PDEs, imposed at the interfaces between the domain components, are derived. The unique solvability of the obtained problem is proven, and numerical experiments are conducted.
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....
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…
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...
Scalable Multigigabit Pattern Matching for Packet Inspection
Sourdis, I.; Pnevmatikatos, D.N.; Vassiliadis, S.
2007-01-01
In this paper, we consider hardware-based scanning and analyzing packets payload in order to detect hazardous contents.We present two pattern matching techniques to compare incoming packets against intrusion detection search patterns. The first approach, decoded partial CAM (DpCAM), predecodes
Revisiting the Concept of "Style Match"
Zhang, Li-fang; Sternberg, Robert J.; Fan, Jieqiong
2013-01-01
Background: Intellectual style, an encompassing term for such constructs as learning style, teaching style, teaching approach, and thinking style, refers to one's preferred way of processing information. For the past several decades, whether or not there is a need for a match between teachers' teaching styles and students' learning styles has been…
Personality Matching for Student-Teacher Development.
Trieber, J. Marshall
Examples of personality types of supervising teachers and student teachers are described. Conflicts arising out of these clashes are illustrated and used to point up the need for personality matching in the selection of student teachers for student teaching programs. Some personality types listed are energetic and creative supervisors, meek…
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.
Impedance-matched drilling telemetry system
Normann, Randy A [Edgewood, NM; Mansure, Arthur J [Albuquerque, NM
2008-04-22
A downhole telemetry system that uses inductance or capacitance as a mode through which signal is communicated across joints between assembled lengths of pipe wherein efficiency of signal propagation through a drill string, for example, over multiple successive pipe segments is enhanced through matching impedances associated with the various telemetry system components.
The Effectiveness of Advertising Matching Purchase Motivation
Loef, J.; Antonides, G.; van Raaij, W.F.
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 informational advertising is more effective than transformational advertising. Likewise, for hedonic brands transformational advertising is more effective than informational advertising. These recommendations ...
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...
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
Product Substitutability and the Matching Law
Foxall, Gordon R.; James, Victoria K.; Oliveira-Castro, Jorge M.; Ribier, Sarah
2010-01-01
The applicability of matching analysis, pioneered in the context of laboratory experiments, to the investigation and interpretation of consumer choice in natural environments is explored by the examination of sequential purchases of four product categories based on information from a panel of British consumers. Over a 52-week period, participants…
Revisiting the concept of 'style match'.
Zhang, Li-fang; Sternberg, Robert J; Fan, Jieqiong
2013-06-01
Intellectual style, an encompassing term for such constructs as learning style, teaching style, teaching approach, and thinking style, refers to one's preferred way of processing information. For the past several decades, whether or not there is a need for a match between teachers' teaching styles and students' learning styles has been the focal point for debate among researchers, educators, and the general public. The preliminary objective of this research was to investigate the psychometric properties of the Preferred Teaching Approach Inventory (PTAI). The research's primary objective was to re-examine the concept of 'style match' through testing the predictive power of students' thinking styles for their preferred teaching approaches. Data were collected from two samples of university students, one each from Shanghai, mainland China (N = 236), and Hong Kong (N = 123). Participants provided the required demographic information and responded to two self-report inventories: the Thinking Styles Inventory - Revised II and the PTAI. Acceptable reliability and good validity were found for the PTAI. All of the eight multiple regressions indicated that students' thinking styles significantly contributed to their preferences for teachers' teaching approaches. These contributions varied by gender among the Shanghai students and by academic discipline among the Hong Kong students. Students, especially Shanghai female students and Hong Kong natural science students, are open to teaching approaches that do not precisely match their thinking styles. The concept of 'style match' requires new understanding. Findings have implications for research and education. © 2013 The British Psychological Society.
Comparison of Orthogonal Matching Pursuit Implementations
DEFF Research Database (Denmark)
Sturm, Bob L.; Christensen, Mads Græsbøll
2012-01-01
We study the numerical and computational performance of three implementations of orthogonal matching pursuit: one using the QR matrix decomposition, one using the Cholesky matrix decomposition, and one using the matrix inversion lemma. We find that none of these implementations suffer from numeri...
Lifecycle marriage matching: Theory and Evidence
Aloysius Siow; Eugene Choo
2007-01-01
estimated model shows that a concern for accumulating marriage specific capital is quantitatively significant in generating positive assortative matching in spousal ages at marriage, gender differences in spousal ages at marriage, and a preference for early marriage. Gender variations in population supplies due to gender specific mortality rates and entry cohort sizes have offsetting quantitative effects.
Computers Launch Faster, Better Job Matching
Stevenson, Gloria
1976-01-01
Employment Security Automation Project (ESAP), a five-year program sponsored by the Employment and Training Administration, features an innovative computer-assisted job matching system and instantaneous computer-assisted service for unemployment insurance claimants. ESAP will also consolidate existing automated employment security systems to…
Table tennis match analysis: a review.
Fuchs, Michael; Liu, Ruizhi; Malagoli Lanzoni, Ivan; Munivrana, Goran; Straub, Gunter; Tamaki, Sho; Yoshida, Kazuto; Zhang, Hui; Lames, Martin
2018-03-15
In table tennis, many different approaches to scientific founded match analysis have been developed since the first ones in the 1960s. The aim of this paper is to give a review on some of the most acknowledged methods of match analysis in table tennis. The first chapter presents a historical overview of match analysis from all over the world. The second part reviews different approaches to match analysis in more detail, using the performance analysis classification of theoretical and practical performance analysis. The review includes the most actual theoretical performance analysis techniques in table tennis: performance indices, simulative approaches, momentum analysis, footwork analysis, and finally an approach which uses top expert knowledge for a comprehensive technical-tactical analysis. In the section of practical performance analysis, the paper presents two "best practice" examples describing performance analysis procedures of the two most successful countries of the last Olympics: China and Japan. The paper ends with a summary on the impact of the different approaches and gives an outlook on promising new developments.
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
Predictive mean matching imputation of semicontinuous variables
Vink, G.; Frank, L.E.; Pannekoek, J.; Buuren, S. van
2014-01-01
Multiple imputation methods properly account for the uncertainty of missing data. One of those methods for creating multiple imputations is predictive mean matching (PMM), a general purpose method. Little is known about the performance of PMM in imputing non-normal semicontinuous data (skewed data
Uses of stable isotopes in fish ecology
Analyses of fish tissues (other than otoliths) for stable isotope ratios can provide substantial information on fish ecology, including physiological ecology. Stable isotopes of nitrogen and carbon frequently are used to determine the mix of diet sources for consumers. Stable i...
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.
Theory of stable allocations II
Directory of Open Access Journals (Sweden)
Pantelić Svetlana
2015-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. Shapley provided the fundamental theoretical contribution to this field of research, whereas Roth, a professor at the Harvard University in Boston, developed and upgraded these theoretical investigations by applying them to the American market of medical doctors. Namely, their research helps explain the market processes at work, for instance, when doctors are assigned to hospitals, students to schools and human organs for transplant to recipients.
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.
Dehydration of football referees during a match.
Da Silva, A I; Fernandez, R
2003-12-01
To study hydration status in referees (main) and assistant referees (linesmen) during official football matches. Twelve male football referees were evaluated; all were volunteers. Before and after each match, the referee and one of the assistants were weighed without clothes and a blood sample was taken. Total water loss was determined for each subject from the change in body weight. The main haematological variables were analysed in the blood samples. Total plasma protein concentration and osmolarity were also determined. Variation in plasma volume was determined from changes in packed cell volume and a combination of changes in packed cell volume and haemoglobin concentrations. During a match, total body water loss was 1.60 (0.13) litres, equivalent to 2.05 (0.18)% of body weight. Body weight was reduced by 1.55 (0.12)%, showing that water ingestion during the interval replaces only 24.4% of the body fluids lost during the match. The assistants lost 0.79 (0.19) litre of water, equivalent to 1.05 (0.25)% of body weight. The referees showed a significant decrease in plasma volume of 4.99 (1.33)%. The assistants showed a non-significant increase in plasma volume. The reduction in plasma volume observed in the referees correlated significantly with total body water loss (r = 0.9623). From these data, it is possible to predict that a dehydration of 1% reflects a reduction in plasma volume of nearly 2.5%. Referees are moderately dehydrated after a football match (2%), whereas assistants show a non-significant dehydration of 1% of their body weight.
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.
Generating a Pattern Matching Compiler by Partial Evaluation
DEFF Research Database (Denmark)
Jørgensen, Knud Jesper
1991-01-01
Datalogi, partial Evaluation, Compiling, denotational Semantics, Pattern Matching, Semantic directed Compiler Generation......Datalogi, partial Evaluation, Compiling, denotational Semantics, Pattern Matching, Semantic directed Compiler Generation...
... getting enough air. Sometimes you can have mild breathing problems because of a stuffy nose or intense ... panic attacks Allergies If you often have trouble breathing, it is important to find out the cause.
... For Consumers Consumer Information by Audience For Women Sleep Problems Share Tweet Linkedin Pin it More sharing ... 101 KB) En Español Medicines to Help You Sleep Tips for Better Sleep Basic Facts about Sleep ...
... Tongue pain may also occur with: Diabetic neuropathy Leukoplakia Mouth ulcers Oral cancer After menopause, some women have ... problem. Medicine may be prescribed for mouth ulcers, leukoplakia, oral cancer, and other mouth sores. Anti-inflammatory medicines ...
... High Blood Pressure Nutrition Join our e-newsletter! Aging & Health A to Z Kidney Problems Basic Facts & ... specialize in the care of people with kidney (renal) diseases are called nephrologists . What are Kidney Diseases? ...
... Start OverDiagnosisThese thickened areas are likely to be CORNS. If they appear to have small granules in ... these problems. Self CareUse an over-the-counter corn or wart remover. Remove the dead skin after ...
DEFF Research Database (Denmark)
Skovhus, Randi Boelskifte; Thomsen, Rie
2017-01-01
to be’ (WPR) approach. Forty-nine empirical studies on Danish youth career guidance were included in the study. An analysis of the issues in focus resulted in nine problem categories. One of these, ‘targeting’, is analysed using the WPR approach. Finally, the article concludes that the WPR approach...... provides a constructive basis for a critical analysis and discussion of the collective empirical knowledge production on career guidance, stimulating awareness of problems and potential solutions among the career guidance community....
Physics-based shape matching for intraoperative image guidance
Energy Technology Data Exchange (ETDEWEB)
Suwelack, Stefan, E-mail: suwelack@kit.edu; Röhl, Sebastian; Bodenstedt, Sebastian; Reichard, Daniel; Dillmann, Rüdiger; Speidel, Stefanie [Institute for Anthropomatics and Robotics, Karlsruhe Institute of Technology, Adenauerring 2, Karlsruhe 76131 (Germany); Santos, Thiago dos; Maier-Hein, Lena [Computer-assisted Interventions, German Cancer Research Center (DKFZ), Im Neuenheimer Feld 280, Heidelberg 69120 (Germany); Wagner, Martin; Wünscher, Josephine; Kenngott, Hannes; Müller, Beat P. [General, Visceral and Transplantation Surgery, Heidelberg University Hospital, Im Neuenheimer Feld 110, Heidelberg 69120 (Germany)
2014-11-01
Purpose: Soft-tissue deformations can severely degrade the validity of preoperative planning data during computer assisted interventions. Intraoperative imaging such as stereo endoscopic, time-of-flight or, laser range scanner data can be used to compensate these movements. In this context, the intraoperative surface has to be matched to the preoperative model. The shape matching is especially challenging in the intraoperative setting due to noisy sensor data, only partially visible surfaces, ambiguous shape descriptors, and real-time requirements. Methods: A novel physics-based shape matching (PBSM) approach to register intraoperatively acquired surface meshes to preoperative planning data is proposed. The key idea of the method is to describe the nonrigid registration process as an electrostatic–elastic problem, where an elastic body (preoperative model) that is electrically charged slides into an oppositely charged rigid shape (intraoperative surface). It is shown that the corresponding energy functional can be efficiently solved using the finite element (FE) method. It is also demonstrated how PBSM can be combined with rigid registration schemes for robust nonrigid registration of arbitrarily aligned surfaces. Furthermore, it is shown how the approach can be combined with landmark based methods and outline its application to image guidance in laparoscopic interventions. Results: A profound analysis of the PBSM scheme based on in silico and phantom data is presented. Simulation studies on several liver models show that the approach is robust to the initial rigid registration and to parameter variations. The studies also reveal that the method achieves submillimeter registration accuracy (mean error between 0.32 and 0.46 mm). An unoptimized, single core implementation of the approach achieves near real-time performance (2 TPS, 7–19 s total registration time). It outperforms established methods in terms of speed and accuracy. Furthermore, it is shown that the
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.
Kellerer, Hans; Pisinger, David
2004-01-01
Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago ...
Driving-Related Neuropsychological Performance in Stable COPD Patients
Directory of Open Access Journals (Sweden)
Foteini Karakontaki
2013-01-01
Full Text Available Background. Cognitive deterioration may impair COPD patient’s ability to perform tasks like driving vehicles. We investigated: (a whether subclinical neuropsychological deficits occur in stable COPD patients with mild hypoxemia (PaO2 > 55 mmHg, and (b whether these deficits affect their driving performance. Methods. We recruited 35 stable COPD patients and 10 normal subjects matched for age, IQ, and level of education. All subjects underwent an attention/alertness battery of tests for assessing driving performance based on the Vienna Test System. Pulmonary function tests, arterial blood gases, and dyspnea severity were also recorded. Results. COPD patients performed significantly worse than normal subjects on tests suitable for evaluating driving ability. Therefore, many (22/35 COPD patients were classified as having inadequate driving ability (failure at least in one of the tests, whereas most (8/10 healthy individuals were classified as safe drivers (P=0.029. PaO2 and FEV1 were correlated with almost all neuropsychological tests. Conclusions. COPD patients should be warned of the potential danger and risk they face when they drive any kind of vehicle, even when they do not exhibit overt symptoms related to driving inability. This is due to the fact that stable COPD patients may manifest impaired information processing operations.
A TSR Visual Servoing System Based on a Novel Dynamic Template Matching Method.
Cai, Jia; Huang, Panfeng; Zhang, Bin; Wang, Dongke
2015-12-21
The so-called Tethered Space Robot (TSR) is a novel active space debris removal system. To solve its problem of non-cooperative target recognition during short-distance rendezvous events, this paper presents a framework for a real-time visual servoing system using non-calibrated monocular-CMOS (Complementary Metal Oxide Semiconductor). When a small template is used for matching with a large scene, it always leads to mismatches, so a novel template matching algorithm to solve the problem is presented. Firstly, the novel matching algorithm uses a hollow annulus structure according to a FAST (Features from Accelerated Segment) algorithm and makes the method be rotation-invariant. Furthermore, the accumulative deviation can be decreased by the hollow structure. The matching function is composed of grey and gradient differences between template and object image, which help it reduce the effects of illumination and noises. Then, a dynamic template update strategy is designed to avoid tracking failures brought about by wrong matching or occlusion. Finally, the system synthesizes the least square integrated predictor, realizing tracking online in complex circumstances. The results of ground experiments show that the proposed algorithm can decrease the need for sophisticated computation and improves matching accuracy.
A TSR Visual Servoing System Based on a Novel Dynamic Template Matching Method †
Cai, Jia; Huang, Panfeng; Zhang, Bin; Wang, Dongke
2015-01-01
The so-called Tethered Space Robot (TSR) is a novel active space debris removal system. To solve its problem of non-cooperative target recognition during short-distance rendezvous events, this paper presents a framework for a real-time visual servoing system using non-calibrated monocular-CMOS (Complementary Metal Oxide Semiconductor). When a small template is used for matching with a large scene, it always leads to mismatches, so a novel template matching algorithm to solve the problem is presented. Firstly, the novel matching algorithm uses a hollow annulus structure according to a FAST (Features from Accelerated Segment) algorithm and makes the method be rotation-invariant. Furthermore, the accumulative deviation can be decreased by the hollow structure. The matching function is composed of grey and gradient differences between template and object image, which help it reduce the effects of illumination and noises. Then, a dynamic template update strategy is designed to avoid tracking failures brought about by wrong matching or occlusion. Finally, the system synthesizes the least square integrated predictor, realizing tracking online in complex circumstances. The results of ground experiments show that the proposed algorithm can decrease the need for sophisticated computation and improves matching accuracy. PMID:26703609
A TSR Visual Servoing System Based on a Novel Dynamic Template Matching Method
Directory of Open Access Journals (Sweden)
Jia Cai
2015-12-01
Full Text Available The so-called Tethered Space Robot (TSR is a novel active space debris removal system. To solve its problem of non-cooperative target recognition during short-distance rendezvous events, this paper presents a framework for a real-time visual servoing system using non-calibrated monocular-CMOS (Complementary Metal Oxide Semiconductor. When a small template is used for matching with a large scene, it always leads to mismatches, so a novel template matching algorithm to solve the problem is presented. Firstly, the novel matching algorithm uses a hollow annulus structure according to a FAST (Features from Accelerated Segment algorithm and makes the method be rotation-invariant. Furthermore, the accumulative deviation can be decreased by the hollow structure. The matching function is composed of grey and gradient differences between template and object image, which help it reduce the effects of illumination and noises. Then, a dynamic template update strategy is designed to avoid tracking failures brought about by wrong matching or occlusion. Finally, the system synthesizes the least square integrated predictor, realizing tracking online in complex circumstances. The results of ground experiments show that the proposed algorithm can decrease the need for sophisticated computation and improves matching accuracy.
Oblique low-altitude image matching using robust perspective invariant features
He, Haiqing; Du, Jing; Chen, Xiaoyong; Wang, Yuqian
2017-01-01
Compared with vertical photogrammtry, oblique photogrammetry is radically different for images acquired from sensor with big yaw, pitch, and roll angles. Image matching is a vital step and core problem of oblique low-altitude photogrammetric process. Among the most popular oblique images matching methods are currently SIFT/ASIFT and many affine invariant feature-based approaches, which are mainly used in computer vision, while these methods are unsuitable for requiring evenly distributed corresponding points and high efficiency simultaneously in oblique photogrammetry. In this paper, we present an oblique low-altitude images matching approach using robust perspective invariant features. Firstly, the homography matrix is estimated by a few corresponding points obtained from top pyramid images matching in several projective simulation. Then images matching are implemented by sub-pixel Harris corners and descriptors after shape perspective transforming on the basis of homography matrix. Finally, the error or gross error matched points are excluded by epipolar geometry, RANSAC algorithm and back projection constraint. Experimental results show that the proposed approach can achieve more excellent performances in oblique low-altitude images matching than the common methods, including SIFT and SURF. And the proposed approach can significantly improve the computational efficiency compared with ASIFT and Affine-SURF.
Toward automated forensic fracture matching of snap-off blade knives
Hollevoet, Davy; De Smet, Patrick; De Bock, Johan; Philips, Wilfried
2008-08-01
An interesting problem that has concerned forensic scientist for many years, is their need for accurate, reliable and objective methods for performing fracture matching examinations. The aim of these fracture matching methods is to determine if two broken object halves can be matched together, e.g., when one half is recovered at a crime scene, while the other half is found in the possession of a suspect. In this paper we discuss the use of a commercial white-light profilometer system for obtaining 2D/3D image surface scans of multiple fractured objects. More specifically, we explain the use of this system for digitizing the fracture surface of multiple facing halves of several snap-off blade knives. Next, we discuss the realization and evaluation of several image processing methods for trying to match the obtained image scans corresponding to each of the broken off blade elements used in our experiments. The algorithms that were tested and evaluated include: global template matching based on image correlation and multiple template matching based on local image correlation, using so-called "vote-map" computation. Although many avenues for further research still remain possible, we show that the second method yields very good results for allowing automated searching and matching of the imaged fracture surfaces for each of the examined blade elements.
Matching CCD images to a stellar catalog using locality-sensitive hashing
Liu, Bo; Yu, Jia-Zong; Peng, Qing-Yu
2018-02-01
The usage of a subset of observed stars in a CCD image to find their corresponding matched stars in a stellar catalog is an important issue in astronomical research. Subgraph isomorphic-based algorithms are the most widely used methods in star catalog matching. When more subgraph features are provided, the CCD images are recognized better. However, when the navigation feature database is large, the method requires more time to match the observing model. To solve this problem, this study investigates further and improves subgraph isomorphic matching algorithms. We present an algorithm based on a locality-sensitive hashing technique, which allocates quadrilateral models in the navigation feature database into different hash buckets and reduces the search range to the bucket in which the observed quadrilateral model is located. Experimental results indicate the effectivity of our method.
SSCL RFQ-DTL matching section instrumentation
International Nuclear Information System (INIS)
Datte, P.; Aiello, R.; Hayworth, M.; Johnson, R.; Jones, A.; McClure, S.; Mills, M.; Martin, D.; Ringwall, A.; Webber, R.; Yao, C.
1994-01-01
A description of the SSCL RFQ-DTL Matching Section instrumentation is presented with emphasis on design issues and early instrumentation commissioning results. The H - beam energy through the RFQ-DTL matching section is 2.5 Mev, the beam current is 27 mA with a pulse width of 35 μs. The typical beam diameter is 3 mm. The instrumentation consists of three beam position monitors (BPM), a wire scanner, beam loss monitors (BLM), a slit and collector emittance measurement unit (EMU), a current toroid, and a Faraday cup. The instruments were designed to accommodate high current densities, have a large dynamic range with moderate bandwidths, and fit congested spaces
[Establishment of delta block matching technique].
Lü, Qin-Feng; Zhang, Wei; Zhu, Fa-Ming; Yan, Li-Xing
2006-04-01
To establish delta block HLA-matching technique, DNA was extracted from whole blood by salting-out method, delta block was amplified by polymerase chain reaction (PCR), and PCR product was detected by GeneScan. The results showed that delta block had polymorphism in 104 samples without sibship of the Han people from Zhejiang province. The range of DNA fragment length was 81-393 bp and could be divided into 4 groups: 81-118 bp, 140-175 bp, 217-301 bp, 340-393 bp. The numbers of DNA fragments were 6-32. It is concluded that the method of delta block matching is reliable and can be applied to select donors for the patients to be transplanted. It is the first time to get delta block data of the Han people in China.
FINGERPRINT MATCHING BASED ON PORE CENTROIDS
Directory of Open Access Journals (Sweden)
S. Malathi
2011-05-01
Full Text Available In recent years there has been exponential growth in the use of bio- metrics for user authentication applications. Automated Fingerprint Identification systems have become popular tool in many security and law enforcement applications. Most of these systems rely on minutiae (ridge ending and bifurcation features. With the advancement in sensor technology, high resolution fingerprint images (1000 dpi pro- vide micro level of features (pores that have proven to be useful fea- tures for identification. In this paper, we propose a new strategy for fingerprint matching based on pores by reliably extracting the pore features The extraction of pores is done by Marker Controlled Wa- tershed segmentation method and the centroids of each pore are con- sidered as feature vectors for matching of two fingerprint images. Experimental results shows that the proposed method has better per- formance with lower false rates and higher accuracy.
Passport officers' errors in face matching.
White, David; Kemp, Richard I; Jenkins, Rob; Matheson, Michael; Burton, A Mike
2014-01-01
Photo-ID is widely used in security settings, despite research showing that viewers find it very difficult to match unfamiliar faces. Here we test participants with specialist experience and training in the task: passport-issuing officers. First, we ask officers to compare photos to live ID-card bearers, and observe high error rates, including 14% false acceptance of 'fraudulent' photos. Second, we compare passport officers with a set of student participants, and find equally poor levels of accuracy in both groups. Finally, we observe that passport officers show no performance advantage over the general population on a standardised face-matching task. Across all tasks, we observe very large individual differences: while average performance of passport staff was poor, some officers performed very accurately--though this was not related to length of experience or training. We propose that improvements in security could be made by emphasising personnel selection.
Passport officers' errors in face matching.
Directory of Open Access Journals (Sweden)
David White
Full Text Available Photo-ID is widely used in security settings, despite research showing that viewers find it very difficult to match unfamiliar faces. Here we test participants with specialist experience and training in the task: passport-issuing officers. First, we ask officers to compare photos to live ID-card bearers, and observe high error rates, including 14% false acceptance of 'fraudulent' photos. Second, we compare passport officers with a set of student participants, and find equally poor levels of accuracy in both groups. Finally, we observe that passport officers show no performance advantage over the general population on a standardised face-matching task. Across all tasks, we observe very large individual differences: while average performance of passport staff was poor, some officers performed very accurately--though this was not related to length of experience or training. We propose that improvements in security could be made by emphasising personnel selection.
SSCL RFQ-DTL Matching Section instrumentation
International Nuclear Information System (INIS)
Datte, P.; Aielo, R.; Hayworth, M.
1993-11-01
A description of the SSCL RFQ-DTL Matching Section instrumentation is presented with emphasis on design issues and early instrumentation commissioning results. The H - beam energy through the RFQ-DTL matching section is 2.5 MeV, the beam current is 27 mA with a pulse width of 35 Its. The typical beam diameter is 3 mm. The instrumentation consists of three beam position monitors (BPM), a wire scanner, beam loss monitors (BLM), a slit and collector emittance measurement unit (EMU), a current toroid, and a Faraday cup. The instruments were designed to accommodate high current densities, have a large dynamic range with moderate bandwidths, and fit congested spaces
Nearest Neighbour Corner Points Matching Detection Algorithm
Directory of Open Access Journals (Sweden)
Zhang Changlong
2015-01-01
Full Text Available Accurate detection towards the corners plays an important part in camera calibration. To deal with the instability and inaccuracies of present corner detection algorithm, the nearest neighbour corners match-ing detection algorithms was brought forward. First, it dilates the binary image of the photographed pictures, searches and reserves quadrilateral outline of the image. Second, the blocks which accord with chess-board-corners are classified into a class. If too many blocks in class, it will be deleted; if not, it will be added, and then let the midpoint of the two vertex coordinates be the rough position of corner. At last, it precisely locates the position of the corners. The Experimental results have shown that the algorithm has obvious advantages on accuracy and validity in corner detection, and it can give security for camera calibration in traffic accident measurement.
Wake field in matched kicker magnet
International Nuclear Information System (INIS)
Miyahara, Y.
1979-01-01
Coherent transverse instability observed in KEK booster proton synchrotron has been reported previously. This instability is induced by the interaction of the beam with kicker magnet for the fast beam extraction. To understand the mechanism completely, it is necessary to know the wake field in detail. Here, the wake field or induced current in the kicker magnet which is terminated with matched resistance is considered
Bridging Database Applications and Declarative Similarity Matching
Andrade Ribeiro, Leonardo; Schneider, Natália Cristina; de Souza Inácio, Andrei; Wagner, Harley Michel; von Wangenheim, Aldo
2017-01-01
Effective manipulation of string data is of fundamental importance to modern database applications. Very often, textual inconsistencies render equality comparisons meaningless and strings have to be matched in terms of their similarity. Previous work has proposed techniques to express similarity operations using declarative SQL statements. However, the non-trivial issue of embedding similarity support into object-oriented applications has received little attention. Particularly, declarative s...
Profile Terry Young: man of the match
2003-01-01
Terry Young, chair of health systems at Brunel University, has received a grant of 3.3 million pounds from EPSRC. The money will create the Multidisciplinary Assessment of Technology Centre for Health (MATCH). The aim of the centre is to aid the progress of medical devices from concept to patient care by developing criteria to single out promising technologies and helping them to market (1 page).
Saito, Kotaro; Kihara, Mitsuru; Shimizu, Tomoya; Yoneda, Keisuke; Kurashima, Toshio
2015-06-01
We performed environmental and accelerated aging tests to ensure the long-term reliability of solid type refractive index matching material at a splice point. Stable optical characteristics were confirmed in environmental tests based on an IEC standard. In an accelerated aging test at 140 °C, which is very much higher than the specification test temperature, the index matching material itself and spliced fibers passing through it had steady optical characteristics. Then we performed an accelerated aging test on an index matching material attached to a built-in fiber before splicing it in the worst condition, which is different from the normal use configuration. As a result, we confirmed that the repeated insertion and removal of fiber for splicing resulted in failure. We consider that the repetition of adhesion between index matching material and fibers causes the splice to degrade. With this result, we used the Arrhenius model to estimate a median lifetime of about 68 years in a high temperature environment of 60 °C. Thus solid type index matching material at a splice point is highly reliable over long periods under normal conditions of use.
Matching study areas using Google Street View: A new application for an emerging technology.
Less, Elyse Levine; McKee, Patricia; Toomey, Traci; Nelson, Toben; Erickson, Darin; Xiong, Serena; Jones-Webb, Rhonda
2015-12-01
Google Street View (GSV) can be used as an effective tool to conduct virtual neighborhood audits. We expand on this research by exploring the utility of a GSV-based neighborhood audit to measure and match target and comparison study areas. We developed a GSV-based inventory to measure characteristics of retail alcohol stores and their surrounding neighborhoods. We assessed its reliability and assessed the utility of GSV-based audits for matching target and comparison study areas. We found that GSV-based neighborhood audits can be a useful, reliable, and cost-effective tool for matching target and comparison study areas when archival data are insufficient and primary data collection is prohibitive. We suggest that researchers focus on characteristics that are easily visible on GSV and are relatively stable over time when creating future GSV-based measuring and matching tools. Dividing the study area into small segments may also provide more accurate measurements and more precise matching. Copyright © 2015 Elsevier Ltd. All rights reserved.
Stable Treemaps via Local Moves.
Sondag, Max; Speckmann, Bettina; Verbeek, Kevin
2018-01-01
Treemaps are a popular tool to visualize hierarchical data: items are represented by nested rectangles and the area of each rectangle corresponds to the data being visualized for this item. The visual quality of a treemap is commonly measured via the aspect ratio of the rectangles. If the data changes, then a second important quality criterion is the stability of the treemap: how much does the treemap change as the data changes. We present a novel stable treemapping algorithm that has very high visual quality. Whereas existing treemapping algorithms generally recompute the treemap every time the input changes, our algorithm changes the layout of the treemap using only local modifications. This approach not only gives us direct control over stability, but it also allows us to use a larger set of possible layouts, thus provably resulting in treemaps of higher visual quality compared to existing algorithms. We further prove that we can reach all possible treemap layouts using only our local modifications. Furthermore, we introduce a new measure for stability that better captures the relative positions of rectangles. We finally show via experiments on real-world data that our algorithm outperforms existing treemapping algorithms also in practice on either visual quality and/or stability. Our algorithm scores high on stability regardless of whether we use an existing stability measure or our new measure.
One-loop effective lagrangians after matching
Energy Technology Data Exchange (ETDEWEB)
Aguila, F. del; Santiago, J. [Universidad de Granada, Departamento de Fisica Teorica y del Cosmos and CAFPE, Granada (Spain); Kunszt, Z. [ETH Zuerich, Institute for Theoretical Physics, Zuerich (Switzerland)
2016-05-15
We discuss the limitations of the covariant derivative expansion prescription advocated to compute the one-loop Standard Model (SM) effective lagrangian when the heavy fields couple linearly to the SM. In particular, one-loop contributions resulting from the exchange of both heavy and light fields must be explicitly taken into account through matching because the proposed functional approach alone does not account for them. We review a simple case with a heavy scalar singlet of charge -1 to illustrate the argument. As two other examples where this matching is needed and this functional method gives a vanishing result, up to renormalization of the heavy sector parameters, we re-evaluate the one-loop corrections to the T-parameter due to a heavy scalar triplet with vanishing hypercharge coupling to the Brout-Englert-Higgs boson and to a heavy vector-like quark singlet of charged 2/3 mixing with the top quark, respectively. In all cases we make use of a new code for matching fundamental and effective theories in models with arbitrary heavy field additions. (orig.)
Best matching Barenblatt profiles are delayed
International Nuclear Information System (INIS)
Dolbeault, Jean; Toscani, Giuseppe
2015-01-01
The growth of the second moments of the solutions of fast diffusion equations is asymptotically governed by the behavior of self-similar solutions. However, at next order, there is a correction term which amounts to a delay depending on the nonlinearity and on a distance of the initial data to the set of self-similar Barenblatt solutions. This distance can be measured in terms of a relative entropy to the best matching Barenblatt profile. This best matching Barenblatt function determines a scale. In new variables based on this scale, which are given by a self-similar change of variables if and only if the initial datum is one of the Barenblatt profiles, the typical scale is monotone and has a limit. Coming back to original variables, the best matching Barenblatt profile is delayed compared to the self-similar solution with same initial second moment as the initial datum. Such a delay is a new phenomenon, which has to be taken into account for instance when fitting experimental data. (paper)