WorldWideScience

Sample records for stable matching problem

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

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

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

  4. Solutions for the stable roommates problem with payments

    NARCIS (Netherlands)

    Biró, Péter; Bomhoff, M.J.; Golovach, Petr A.; Kern, Walter

    2014-01-01

    The stable roommates problem with payments has as input a graph G = (V , E ) with an edge weighting w : E → R≥0 and the problem is to find a stable solution. By pinpointing a relationship to the accessibility of the coalition structure core of matching games, we give a constructive proof for showing

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

  6. User Matching with Relation to the Stable Marriage Problem in Cognitive Radio Networks

    KAUST Repository

    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.

  7. Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching

    Science.gov (United States)

    2013-01-01

    REPORT Jealousy Graphs: Structure and Complexity of Decentralized Stable Matching 14. ABSTRACT 16. SECURITY CLASSIFICATION OF: The stable matching...Franceschetti 858-822-2284 3. DATES COVERED (From - To) Standard Form 298 (Rev 8/98) Prescribed by ANSI Std. Z39.18 - Jealousy Graphs: Structure and...market. Using this structure, we are able to provide a ner analysis of the complexity of a subclass of decentralized matching markets. Jealousy

  8. Data Acquisition Based on Stable Matching of Bipartite Graph in Cooperative Vehicle-Infrastructure Systems.

    Science.gov (United States)

    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.

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

  10. Sex-oriented stable matchings of the marriage problem with correlated and incomplete information

    Science.gov (United States)

    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.

  11. Statistical Mechanics of a Simplified Bipartite Matching Problem: An Analytical Treatment

    Science.gov (United States)

    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.

  12. A blind matching algorithm for cognitive radio networks

    KAUST Repository

    Hamza, Doha R.; Shamma, Jeff S.

    2016-01-01

    that will be used to relay PU data. We formulate the problem as a generalized assignment market to find an epsilon pairwise stable matching. We propose a distributed blind matching algorithm (BLMA) to produce the pairwise-stable matching plus the associated power

  13. Manipulation and gender neutrality in stable marriage procedures

    OpenAIRE

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

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

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

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

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

    OpenAIRE

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

    2004-01-01

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

  18. Stereo Matching Based On Election Campaign Algorithm

    Directory of Open Access Journals (Sweden)

    Xie Qing Hua

    2016-01-01

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

  19. Handelman's hierarchy for the maximum stable set problem

    NARCIS (Netherlands)

    Laurent, M.; Sun, Z.

    2014-01-01

    The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a

  20. A Large-Scale Study of Fingerprint Matching Systems for Sensor Interoperability Problem

    Directory of Open Access Journals (Sweden)

    Helala AlShehri

    2018-03-01

    Full Text Available The fingerprint is a commonly used biometric modality that is widely employed for authentication by law enforcement agencies and commercial applications. The designs of existing fingerprint matching methods are based on the hypothesis that the same sensor is used to capture fingerprints during enrollment and verification. Advances in fingerprint sensor technology have raised the question about the usability of current methods when different sensors are employed for enrollment and verification; this is a fingerprint sensor interoperability problem. To provide insight into this problem and assess the status of state-of-the-art matching methods to tackle this problem, we first analyze the characteristics of fingerprints captured with different sensors, which makes cross-sensor matching a challenging problem. We demonstrate the importance of fingerprint enhancement methods for cross-sensor matching. Finally, we conduct a comparative study of state-of-the-art fingerprint recognition methods and provide insight into their abilities to address this problem. We performed experiments using a public database (FingerPass that contains nine datasets captured with different sensors. We analyzed the effects of different sensors and found that cross-sensor matching performance deteriorates when different sensors are used for enrollment and verification. In view of our analysis, we propose future research directions for this problem.

  1. A Large-Scale Study of Fingerprint Matching Systems for Sensor Interoperability Problem.

    Science.gov (United States)

    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.

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

    NARCIS (Netherlands)

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

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

  3. A blind matching algorithm for cognitive radio networks

    KAUST Repository

    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.

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

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

  6. The complexity of the matching-cut problem for planar graphs and other graph classes

    NARCIS (Netherlands)

    Bonsma, P.S.

    2009-01-01

    The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be -complete when restricted to graphs with maximum degree four. In this paper it

  7. Equation level matching: An extension of the method of matched asymptotic expansion for problems of wave propagation

    Science.gov (United States)

    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.

  8. Efficient and stable perfectly matched layer for CEM

    KAUST Repository

    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.

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

  10. Target matching based on multi-view tracking

    Science.gov (United States)

    Liu, Yahui; Zhou, Changsheng

    2011-01-01

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

  11. Analysis of the spectrum of a Cartesian Perfectly Matched Layer (PML) approximation to acoustic scattering problems

    KAUST Repository

    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.

  12. Conditions for Model Matching of Switched Asynchronous Sequential Machines with Output Feedback

    OpenAIRE

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

  13. Matchings with Externalities and Attitudes

    DEFF Research Database (Denmark)

    Branzei, Simina; Michalak, Tomasz; Rahwan, Talal

    2013-01-01

    Two-sided matchings are an important theoretical tool used to model markets and social interactions. In many real-life problems the utility of an agent is influenced not only by their own choices, but also by the choices that other agents make. Such an influence is called an externality. Whereas ...... where agents take different attitudes when reasoning about the actions of others. In particular, we study optimistic, neutral and pessimistic attitudes and provide both computational hardness results and polynomial-time algorithms for computing stable outcomes....

  14. A Frequency Matching Method: Solving Inverse Problems by Use of Geologically Realistic Prior Information

    DEFF Research Database (Denmark)

    Lange, Katrine; Frydendall, Jan; Cordua, Knud Skou

    2012-01-01

    The frequency matching method defines a closed form expression for a complex prior that quantifies the higher order statistics of a proposed solution model to an inverse problem. While existing solution methods to inverse problems are capable of sampling the solution space while taking into account...... arbitrarily complex a priori information defined by sample algorithms, it is not possible to directly compute the maximum a posteriori model, as the prior probability of a solution model cannot be expressed. We demonstrate how the frequency matching method enables us to compute the maximum a posteriori...... solution model to an inverse problem by using a priori information based on multiple point statistics learned from training images. We demonstrate the applicability of the suggested method on a synthetic tomographic crosshole inverse problem....

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

  16. Computational Comparison of Several Greedy Algorithms for the Minimum Cost Perfect Matching Problem on Large Graphs

    DEFF Research Database (Denmark)

    Wøhlk, Sanne; Laporte, Gilbert

    2017-01-01

    The aim of this paper is to computationally compare several algorithms for the Minimum Cost Perfect Matching Problem on an undirected complete graph. Our work is motivated by the need to solve large instances of the Capacitated Arc Routing Problem (CARP) arising in the optimization of garbage...... collection in Denmark. Common heuristics for the CARP involve the optimal matching of the odd-degree nodes of a graph. The algorithms used in the comparison include the CPLEX solution of an exact formulation, the LEDA matching algorithm, a recent implementation of the Blossom algorithm, as well as six...

  17. Stable schizophrenia patients learn equally well as age-matched controls and better than elderly controls in two sensorimotor rotary pursuit tasks

    NARCIS (Netherlands)

    Picker, L.J. De; Cornelis, C.; Hulstijn, W.; Dumont, G.J.H.; Fransen, E.; Timmers, M.; Janssens, L.; Morrens, M.; Sabbe, B.G.C.

    2014-01-01

    Objective: To compare sensorimotor performance and learning in stable schizophrenia patients, healthy age- and sex-matched controls and elderly controls on two variations of the rotary pursuit: circle pursuit (true motor learning) and figure pursuit (motor and sequence learning). Method: In the

  18. Matching theory

    CERN Document Server

    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.

  19. Prospective Analysis of Behavioral Economic Predictors of Stable Moderation Drinking Among Problem Drinkers Attempting Natural Recovery.

    Science.gov (United States)

    Tucker, Jalie A; Cheong, JeeWon; Chandler, Susan D; Lambert, Brice H; Pietrzak, Brittney; Kwok, Heather; Davies, Susan L

    2016-12-01

    As interventions have expanded beyond clinical treatment to include brief interventions for persons with less severe alcohol problems, predicting who can achieve stable moderation drinking has gained importance. Recent behavioral economic (BE) research on natural recovery has shown that active problem drinkers who allocate their monetary expenditures on alcohol and saving for the future over longer time horizons tend to have better subsequent recovery outcomes, including maintenance of stable moderation drinking. This study compared the predictive utility of this money-based "Alcohol-Savings Discretionary Expenditure" (ASDE) index with multiple BE analogue measures of behavioral impulsivity and self-control, which have seldom been investigated together, to predict outcomes of natural recovery attempts. Community-dwelling problem drinkers, enrolled shortly after stopping abusive drinking without treatment, were followed prospectively for up to a year (N = 175 [75.4% male], M age = 50.65 years). They completed baseline assessments of preresolution drinking practices and problems, analogue behavioral choice tasks (Delay Discounting, Melioration-Maximization, and Alcohol Purchase Tasks), and a Timeline Followback interview including expenditures on alcohol compared to voluntary savings (ASDE index) during the preresolution year. Multinomial logistic regression models showed that, among the BE measures, only the ASDE index predicted stable moderation drinking compared to stable abstinence or unstable resolutions involving relapse. As hypothesized, stable moderation was associated with more balanced preresolution allocations to drinking and savings (odds ratio = 1.77, 95% confidence interval = 1.02 to 3.08, p < 0.05), suggesting it is associated with longer-term behavior regulation processes than abstinence. The ASDE's unique predictive utility may rest on its comprehensive representation of contextual elements to support this patterning of behavioral

  20. Prospective Analysis of Behavioral Economic Predictors of Stable Moderation Drinking Among Problem Drinkers Attempting Natural Recovery

    Science.gov (United States)

    Tucker, Jalie A.; Cheong, JeeWon; Chandler, Susan D.; Lambert, Brice H.; Pietrzak, Brittney; Kwok, Heather; Davies, Susan L.

    2016-01-01

    Background As interventions have expanded beyond clinical treatment to include brief interventions for persons with less severe alcohol problems, predicting who can achieve stable moderation drinking has gained importance. Recent behavioral economic (BE) research on natural recovery has shown that active problem drinkers who allocate their monetary expenditures on alcohol and saving for the future over longer time horizons tend to have better subsequent recovery outcomes, including maintenance of stable moderation drinking. The present study compared the predictive utility of this money-based “Alcohol-Savings Discretionary Expenditure” (ASDE) index with multiple BE analogue measures of behavioral impulsivity and self-control, which have seldom been investigated together, to predict outcomes of natural recovery attempts. Methods Community-dwelling problem drinkers, enrolled shortly after stopping abusive drinking without treatment, were followed prospectively for up to a year (N = 175 [75.4% male], M age = 50.65 years). They completed baseline assessments of pre-resolution drinking practices and problems; analogue behavioral choice tasks (Delay Discounting, Melioration-Maximization, and Alcohol Purchase Tasks); and a Timeline Followback interview including expenditures on alcohol compared to voluntary savings (ASDE index) during the pre-resolution year. Results Multinomial logistic regression models showed that, among the BE measures, only the ASDE index predicted stable moderation drinking compared to stable abstinence or unstable resolutions involving relapse. As hypothesized, stable moderation was associated with more balanced pre-resolution allocations to drinking and savings (OR = 1.77, 95% CI = 1.02 ∼ 3.08, p < .05), suggesting it is associated with longer term behavior regulation processes than abstinence. Conclusions The ASDE's unique predictive utility may rest on its comprehensive representation of contextual elements to support this patterning of

  1. Many-to-one blind matching for device-to-device communications

    KAUST Repository

    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.

  2. Transductive and matched-pair machine learning for difficult target detection problems

    Science.gov (United States)

    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.

  3. Matching Students to Schools

    Directory of Open Access Journals (Sweden)

    Dejan Trifunovic

    2017-08-01

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

  4. MARG1D: One dimensional outer region matching data code

    International Nuclear Information System (INIS)

    Tokuda, Shinji; Watanabe, Tomoko.

    1995-08-01

    A code MARG1D has been developed which computes outer region matching data of the one dimensional Newcomb equation. Matching data play an important role in the resistive (and non ideal) Magneto-hydrodynamic (MHD) stability analysis in a tokamak plasma. The MARG1D code computes matching data by using the boundary value method or by the eigenvalue method. Variational principles are derived for the problems to be solved and a finite element method is applied. Except for the case of marginal stability, the eigenvalue method is equivalent to the boundary value method. However, the eigenvalue method has the several advantages: it is a new method of ideal MHD stability analysis for which the marginally stable state can be identified, and it guarantees numerical stability in computing matching data close to marginal stability. We perform detailed numerical experiments for a model equation with analytical solutions and for the Newcomb equation in the m=1 mode theory. Numerical experiments show that MARG1D code gives the matching data with numerical stability and high accuracy. (author)

  5. Match-to-match variation in physical activity and technical skill measures in professional Australian Football.

    Science.gov (United States)

    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

  6. Best matching theory & applications

    CERN Document Server

    Moghaddam, Mohsen

    2017-01-01

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

  7. Unpredictably Stable

    DEFF Research Database (Denmark)

    Failla, Virgilio; Melillo, Francesca; Reichstein, Toke

    2014-01-01

    Is entrepreneurship a more stable career choice for high employment turnover individuals? We find that a transition to entrepreneurship induces a shift towards stayer behavior and identify job matching, job satisfaction and lock-in effects as main drivers. These findings have major implications...

  8. Matching presentational tools' ontology to part-task demands to foster problem-solving in business economics

    NARCIS (Netherlands)

    Slof, Bert; Erkens, Gijsbert; Kirschner, Paul A.

    2011-01-01

    Slof, B., Erkens, G., & Kirschner, P. A. (2010, July). Matching representational tools’ ontology to part-task demands to foster problem-solving in business economics. In K. Gomez, L. Lyons, & J. Radinsky (Eds.), Learning in the Disciplines: Proceedings of the 9th International Conference of the

  9. Stable schizophrenia patients learn equally well as age-matched controls and better than elderly controls in two sensorimotor Rotary Pursuit tasks

    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.

  10. On the classification of the spectrally stable standing waves of the Hartree problem

    Science.gov (United States)

    Georgiev, Vladimir; Stefanov, Atanas

    2018-05-01

    We consider the fractional Hartree model, with general power non-linearity and arbitrary spatial dimension. We construct variationally the "normalized" solutions for the corresponding Choquard-Pekar model-in particular a number of key properties, like smoothness and bell-shapedness are established. As a consequence of the construction, we show that these solitons are spectrally stable as solutions to the time-dependent Hartree model. In addition, we analyze the spectral stability of the Moroz-Van Schaftingen solitons of the classical Hartree problem, in any dimensions and power non-linearity. A full classification is obtained, the main conclusion of which is that only and exactly the "normalized" solutions (which exist only in a portion of the range) are spectrally stable.

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

  12. Linear Time Local Approximation Algorithm for Maximum Stable Marriage

    Directory of Open Access Journals (Sweden)

    Zoltán Király

    2013-08-01

    Full Text Available We consider a two-sided market under incomplete preference lists with ties, where the goal is to find a maximum size stable matching. The problem is APX-hard, and a 3/2-approximation was given by McDermid [1]. This algorithm has a non-linear running time, and, more importantly needs global knowledge of all preference lists. We present a very natural, economically reasonable, local, linear time algorithm with the same ratio, using some ideas of Paluch [2]. In this algorithm every person make decisions using only their own list, and some information asked from members of these lists (as in the case of the famous algorithm of Gale and Shapley. Some consequences to the Hospitals/Residents problem are also discussed.

  13. Target problem (mis) matching: predictors and consequences of parent-youth agreement in a sample of anxious youth.

    Science.gov (United States)

    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

  14. Matching theory for wireless networks

    CERN Document Server

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

  15. Analysis of the spectrum of a Cartesian Perfectly Matched Layer (PML) approximation to acoustic scattering problems

    KAUST Repository

    Kim, Seungil; Pasciak, Joseph E.

    2010-01-01

    is stable for real nonzero wave numbers, we show that the essential spectrum of the higher order part only intersects the real axis at the origin. This enables us to conclude stability of the PML scattering problem from a uniqueness result given in a

  16. Uniform stable conformal convolutional perfectly matched layer for enlarged cell technique conformal finite-difference time-domain method

    International Nuclear Information System (INIS)

    Wang Yue; Wang Jian-Guo; Chen Zai-Gao

    2015-01-01

    Based on conformal construction of physical model in a three-dimensional Cartesian grid, an integral-based conformal convolutional perfectly matched layer (CPML) is given for solving the truncation problem of the open port when the enlarged cell technique conformal finite-difference time-domain (ECT-CFDTD) method is used to simulate the wave propagation inside a perfect electric conductor (PEC) waveguide. The algorithm has the same numerical stability as the ECT-CFDTD method. For the long-time propagation problems of an evanescent wave in a waveguide, several numerical simulations are performed to analyze the reflection error by sweeping the constitutive parameters of the integral-based conformal CPML. Our numerical results show that the integral-based conformal CPML can be used to efficiently truncate the open port of the waveguide. (paper)

  17. One-dimensional stable distributions

    CERN Document Server

    Zolotarev, V M

    1986-01-01

    This is the first book specifically devoted to a systematic exposition of the essential facts known about the properties of stable distributions. In addition to its main focus on the analytic properties of stable laws, the book also includes examples of the occurrence of stable distributions in applied problems and a chapter on the problem of statistical estimation of the parameters determining stable laws. A valuable feature of the book is the author's use of several formally different ways of expressing characteristic functions corresponding to these laws.

  18. An Empirical Investigation into the Matching Problems among Game Theoretically Coordinating Parties in a Virtual Organization

    Directory of Open Access Journals (Sweden)

    Muhammad Yasir

    2010-09-01

    Full Text Available Virtual organization emerged as a highly flexible structure in response to the rapidly changing environment of 20th century. This organization consists of independently working parties that combine their best possible resources to exploit the emerging market opportunities. There are no formal control and coordination mechanisms employed by the classical hierarchical structures. Parties, therefore, manage their dependencies on each other through mutual understanding and trust.Mathematician John Nash, having significant contributions in Game Theory suggests that in every non-cooperative game there is at least one equilibrium point. At this point, according to him, every strategy of the player represents a response to the others’ strategies. Such equilibria could exist in a virtual organization, at which parties coordinate which each other to optimize their performance.Coordination/Matching problems are likely to arise among game theoretically coordinating parties in a virtual organization, mainly due to lack of binding agreements. By identifying and resolving these matching problems, virtual organizations could achieve efficiency and better coordination among parties.  

  19. The stable fixtures problem with payments

    NARCIS (Netherlands)

    Biró, Péter; Kern, Walter; Paulusma, Daniël; Wojuteczky, Péter

    2017-01-01

    We consider multiple partners matching games (G,b,w), where G is a graph with an integer vertex capacity function b and an edge weighting w. If G is bipartite, these games are called multiple partners assignment games. We give a polynomial-time algorithm that either finds that a given multiple

  20. Theory of asymptotic matching for resistive magnetohydrodynamic stability in a negative magnetic shear configuration

    International Nuclear Information System (INIS)

    Tokuda, Shinji; Watanabe, Tomoko.

    1996-11-01

    A theory and a numerical method are presented for the asymptotic matching analysis of resistive magnetohydrodynamic stability in a negative magnetic shear configuration with two rational surfaces. The theory formulates the problem of solving both the Newcomb equations in the ideal MHD region and the inner-layer equations around rational surfaces as boundary value/eigenvalue problems to which the finite element method and the finite difference method can be applied. Hence, the problem of stability analysis is solved by a numerically stable method. The present numerical method has been applied to model equations having analytic solutions in a negative magnetic shear configuration. Comparison of the numerical solutions with the analytical ones verifies the validity of the numerical method proposed. (author)

  1. The stable fixtures problem with payments

    NARCIS (Netherlands)

    Biró, Péter; Kern, Walter; Paulusma, Daniël; Wojuteczky, Péter; Mayr, Ernst W.

    2016-01-01

    We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph $G=(N,E)$, with an integer vertex capacity function $b$ and an edge weighting $w$. The set $N$ consists of a number of players that are to form a set $M\\subseteq E$ of 2-player

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

  3. Fast and compact regular expression matching

    DEFF Research Database (Denmark)

    Bille, Philip; Farach-Colton, Martin

    2008-01-01

    We study 4 problems in string matching, namely, regular expression matching, approximate regular expression matching, string edit distance, and subsequence indexing, on a standard word RAM model of computation that allows logarithmic-sized words to be manipulated in constant time. We show how...... to improve the space and/or remove a dependency on the alphabet size for each problem using either an improved tabulation technique of an existing algorithm or by combining known algorithms in a new way....

  4. Solution matching for a three-point boundary-value problem on atime scale

    Directory of Open Access Journals (Sweden)

    Martin Eggensperger

    2004-07-01

    Full Text Available Let $mathbb{T}$ be a time scale such that $t_1, t_2, t_3 in mathbb{T}$. We show the existence of a unique solution for the three-point boundary value problem $$displaylines{ y^{DeltaDeltaDelta}(t = f(t, y(t, y^Delta(t, y^{DeltaDelta}(t, quad t in [t_1, t_3] cap mathbb{T},cr y(t_1 = y_1, quad y(t_2 = y_2, quad y(t_3 = y_3,. }$$ We do this by matching a solution to the first equation satisfying a two-point boundary conditions on $[t_1, t_2] cap mathbb{T}$ with a solution satisfying a two-point boundary conditions on $[t_2, t_3] cap mathbb{T}$.

  5. Polar optical phonons in a semiconductor quantum-well: The complete matching problem

    International Nuclear Information System (INIS)

    Nieto, J.M.; Comas, F.

    2007-01-01

    Confined polar optical phonons in a semiconductor quantum-well (QW) are studied by applying a phenomenological theory which was proposed a few years ago and is based on a continuum approach. This theory considers the coupled character of the electromechanical vibrations and takes due account of both the electric and mechanical boundary conditions. In the present work, we have applied the so-called complete matching problem in contrast with all previous published works on the subject, where more restrictive approximate boundary conditions has been applied. We also consider the effects of strains at the interfaces on the phonon spectra. Comparisons with previous works are made, while we focused on the study of a ZnTe/CdTe/ZnTe QW

  6. A perfectly matched layer for fluid-solid problems: Application to ocean-acoustics simulations with solid ocean bottoms

    DEFF Research Database (Denmark)

    Xie, Zhinan; Matzen, René; Cristini, Paul

    2016-01-01

    A time-domain Legendre spectral-element method is described for full-wave simulation of ocean acoustics models, i.e., coupled fluid-solid problems in unbounded or semi-infinite domains, taking into account shear wave propagation in the ocean bottom. The technique can accommodate range-dependent a......A time-domain Legendre spectral-element method is described for full-wave simulation of ocean acoustics models, i.e., coupled fluid-solid problems in unbounded or semi-infinite domains, taking into account shear wave propagation in the ocean bottom. The technique can accommodate range......-dependent and depth-dependent wave speed and density, as well as steep ocean floor topography. For truncation of the infinite domain, to efficiently absorb outgoing waves, a fluid-solid complex-frequency-shifted unsplit perfectly matched layer is introduced based on the complex coordinate stretching technique....... The complex stretching is rigorously taken into account in the derivation of the fluid-solid matching condition inside the absorbing layer, which has never been done before in the time domain. Two implementations are designed: a convolutional formulation and an auxiliary differential equation formulation...

  7. Optimal Packed String Matching

    DEFF Research Database (Denmark)

    Ben-Kiki, Oren; Bille, Philip; Breslauer, Dany

    2011-01-01

    In the packed string matching problem, each machine word accommodates – characters, thus an n-character text occupies n/– memory words. We extend the Crochemore-Perrin constantspace O(n)-time string matching algorithm to run in optimal O(n/–) time and even in real-time, achieving a factor – speed...

  8. The tangential breast match plane: Practical problems and solutions

    International Nuclear Information System (INIS)

    Norris, M.

    1989-01-01

    The three-field breast set-up, in which tangential oblique opposed fields are joined to an anterior supraclavicular field, has been the method of choice for treatment of breast cancer for many years. In the last several years many authors have suggested refinements to the technique that improve the accuracy with which fields join at a match plane. The three-field breast set-up, using a rotatable half-beam block is the technique used at our institution. In instituting this procedure, several practical problems were encountered. Due to the small collimator rotation angles used it is possible to clinically reverse the collimator angle without observing an error noticeable on fluoroscopy. A second error can occur when the table base angle is used to compensate for the incorrect collimator rotation. These potential sources of error can be avoided if a programmable calculator or computer program is used to assist the dosimetrist during the simulation. Utilization of fluoroscopy, digital table position displays and a caliper provide accurate input for the computer program. This paper will present a hybrid procedure that combines practical set-up procedures with the mathematical calculation of ideal angles to result in an accurate and practical approach to breast simulation

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

  10. Attention to internal face features in unfamiliar face matching.

    Science.gov (United States)

    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.

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

  12. Matching games with partial information

    Science.gov (United States)

    Laureti, Paolo; Zhang, Yi-Cheng

    2003-06-01

    We analyze different ways of pairing agents in a bipartite matching problem, with regard to its scaling properties and to the distribution of individual “satisfactions”. Then we explore the role of partial information and bounded rationality in a generalized Marriage Problem, comparing the benefits obtained by self-searching and by a matchmaker. Finally we propose a modified matching game intended to mimic the way consumers’ information makes firms to enhance the quality of their products in a competitive market.

  13. Spanking and subsequent behavioral problems in toddlers: A propensity score-matched, prospective study in Japan.

    Science.gov (United States)

    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.

  14. The stable problem of the black-hole connected region in the Schwarzschild black hole

    OpenAIRE

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

  15. No shortcut solution to the problem of Y-STR match probability calculation.

    Science.gov (United States)

    Caliebe, Amke; Jochens, Arne; Willuweit, Sascha; Roewer, Lutz; Krawczak, Michael

    2015-03-01

    Match probability calculation is deemed much more intricate for lineage genetic markers, including Y-chromosomal short tandem repeats (Y-STRs), than for autosomal markers. This is because, owing to the lack of recombination, strong interdependence between markers is likely, which implies that haplotype frequency estimates cannot simply be obtained through the multiplication of allele frequency estimates. As yet, however, the practical relevance of this problem has not been studied in much detail using real data. In fact, such scrutiny appears well warranted because the high mutation rates of Y-STRs and the possibility of backward mutation should have worked against the statistical association of Y-STRs. We examined haplotype data of 21 markers included in the PowerPlex(®)Y23 set (PPY23, Promega Corporation, Madison, WI) originating from six different populations (four European and two Asian). Assessing the conditional entropies of the markers, given different subsets of markers from the same panel, we demonstrate that the PowerPlex(®)Y23 set cannot be decomposed into smaller marker subsets that would be (conditionally) independent. Nevertheless, in all six populations, >94% of the joint entropy of the 21 markers is explained by the seven most rapidly mutating markers. Although this result might render a reduction in marker number a sensible option for practical casework, the partial haplotypes would still be almost as diverse as the full haplotypes. Therefore, match probability calculation remains difficult and calls for the improvement of currently available methods of haplotype frequency estimation. Copyright © 2014 Elsevier Ireland Ltd. All rights reserved.

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

  17. Applications of stable isotope tracers to air pollution problems

    International Nuclear Information System (INIS)

    Kelly, W.R.

    1985-01-01

    One of the fundamental environmental problems facing the United States is how to effect acid rain abatement in the northeast United States and southeastern Canada in a cost effective manner. There are several key scientific questions that must be addressed in order to design an effective strategy. These questions include the following: (1) where do pollutants from a specified source area go., (2) what chemical transformations occur during transport., and (3) where and how are these pollutants deposited. One approach to address these questions is the use of enriched stable isotopes as intentional tracers of aerosol and sulfur emissions. Isotopic tracers can determine the location and pathways of pollutants in the environment and trace pollutants back to their original source. For an element with n isotopes, it is possible to intentionally tag n-2 sources. (For example, Nd, which has seven isotopes, could be used to tag 5 different aerosol sources). To trace sulfur compounds, the two minor isotopes of sulfur, 33 S and 36 S, could be used. Methods developed at NBS using high precision mass spectrometry permits the detection of the small changes in isotopic composition brought about by the intentional tagging at a source. This may make possible the identification of a source at a particular sampling site

  18. An Inductive Characterization of Matching in Binding Bigraphs

    DEFF Research Database (Denmark)

    Damgaard, Troels Christoffer; Glenstrup, Arne John; Birkedal, Lars

    2010-01-01

    We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching in bigraphs with binding. Our results yield a specification for a provably correct matching algorithm, as needed by our prototype tool implementing bigraphical react...... reactive systems....

  19. History Matching: Towards Geologically Reasonable Models

    DEFF Research Database (Denmark)

    Melnikova, Yulia; Cordua, Knud Skou; Mosegaard, Klaus

    This work focuses on the development of a new method for history matching problem that through a deterministic search finds a geologically feasible solution. Complex geology is taken into account evaluating multiple point statistics from earth model prototypes - training images. Further a function...... that measures similarity between statistics of a training image and statistics of any smooth model is introduced and its analytical gradient is computed. This allows us to apply any gradientbased method to history matching problem and guide a solution until it satisfies both production data and complexity...

  20. Delinquency and Recidivism: A Multicohort, Matched-Control Study of the Role of Early Adverse Experiences, Mental Health Problems, and Disabilities

    Science.gov (United States)

    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…

  1. Using crosswell data to enhance history matching

    KAUST Repository

    Ravanelli, Fabio M.; Hoteit, Ibrahim

    2014-01-01

    of the reality. This problem is mitigated by conditioning the model with data through data assimilation, a process known in the oil industry as history matching. Several recent advances are being used to improve history matching reliability, notably the use

  2. Semantic Data Matching: Principles and Performance

    Science.gov (United States)

    Deaton, Russell; Doan, Thao; Schweiger, Tom

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

  3. Dynamic Matchings in Convex Bipartite Graphs

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt

    2007-01-01

    We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...

  4. Matching by Monotonic Tone Mapping.

    Science.gov (United States)

    Kovacs, Gyorgy

    2018-06-01

    In this paper, a novel dissimilarity measure called Matching by Monotonic Tone Mapping (MMTM) is proposed. The MMTM technique allows matching under non-linear monotonic tone mappings and can be computed efficiently when the tone mappings are approximated by piecewise constant or piecewise linear functions. The proposed method is evaluated in various template matching scenarios involving simulated and real images, and compared to other measures developed to be invariant to monotonic intensity transformations. The results show that the MMTM technique is a highly competitive alternative of conventional measures in problems where possible tone mappings are close to monotonic.

  5. Symmetric Circular Matchings and RNA Folding

    DEFF Research Database (Denmark)

    Hofacker, Ivo L.; Reidys, Christian; Stadler, Peter F.

    2012-01-01

    RNA secondary structures can be computed as optimal solutions of certain circular matching problems. An accurate treatment of this energy minimization problem has to account for the small --- but non-negligible --- entropic destabilization of secondary structures with non-trivial automorphisms. S...

  6. On Tree-Constrained Matchings and Generalizations

    NARCIS (Netherlands)

    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

  7. On the tautology of the matching law in consumer behavior analysis.

    Science.gov (United States)

    Curry, Bruce; Foxall, Gordon R; Sigurdsson, Valdimar

    2010-05-01

    Matching analysis has often attracted the criticism that it is formally tautological and hence empirically unfalsifiable, a problem that particularly affects translational attempts to extend behavior analysis into new areas. An example is consumer behavior analysis where application of matching in natural settings requires the inference of ratio-based relationships between amount purchased and amount spent. This gives rise to the argument that matching is an artifact of the way in which the alleged independent and dependent variables are defined and measured. We argue that the amount matching law would be tautological only in extreme circumstances (those in which prices or quantities move strictly in proportion); this is because of the presence of an error term in the matching function which arises from aggregation, particularly aggregation over brands. Cost matching is a viable complement of amount matching which avoids this tautology but a complete explanation of consumer choice requires a viable measure of amount matching also. This necessitates a more general solution to the problem of tautology in matching. In general, the fact that there remain doubts about the functional form of the matching equation itself implies the absence of a tautology. In proposing a general solution to the problem of assumed tautology in matching, the paper notes the experiences of matching researchers in another translation field, sports behavior. Copyright (c) 2009 Elsevier B.V. All rights reserved.

  8. Adaptive Discrete Hypergraph Matching.

    Science.gov (United States)

    Yan, Junchi; Li, Changsheng; Li, Yin; Cao, Guitao

    2018-02-01

    This paper addresses the problem of hypergraph matching using higher-order affinity information. We propose a solver that iteratively updates the solution in the discrete domain by linear assignment approximation. The proposed method is guaranteed to converge to a stationary discrete solution and avoids the annealing procedure and ad-hoc post binarization step that are required in several previous methods. Specifically, we start with a simple iterative discrete gradient assignment solver. This solver can be trapped in an -circle sequence under moderate conditions, where is the order of the graph matching problem. We then devise an adaptive relaxation mechanism to jump out this degenerating case and show that the resulting new path will converge to a fixed solution in the discrete domain. The proposed method is tested on both synthetic and real-world benchmarks. The experimental results corroborate the efficacy of our method.

  9. Computationally Secure Pattern Matching in the Presence of Malicious Adversaries

    DEFF Research Database (Denmark)

    Hazay, Carmit; Toft, Tomas

    2014-01-01

    for important variations of the secure pattern matching problem that are significantly more efficient than the current state of art solutions: First, we deal with secure pattern matching with wildcards. In this variant the pattern may contain wildcards that match both 0 and 1. Our protocol requires O......We propose a protocol for the problem of secure two-party pattern matching, where Alice holds a text t∈{0,1}∗ of length n, while Bob has a pattern p∈{0,1}∗ of length m. The goal is for Bob to (only) learn where his pattern occurs in Alice’s text, while Alice learns nothing. Private pattern matching...... is an important problem that has many applications in the area of DNA search, computational biology and more. Our construction guarantees full simulation in the presence of malicious, polynomial-time adversaries (assuming the hardness of DDH assumption) and exhibits computation and communication costs of O...

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

  11. Polytypic pattern matching

    NARCIS (Netherlands)

    Jeuring, J.T.

    1995-01-01

    The pattern matching problem can be informally specified as follows: given a pattern and a text, find all occurrences of the pattern in the text. The pattern and the text may both be lists, or they may both be trees, or they may both be multi-dimensional arrays, etc. This paper describes a general

  12. Source-to-accelerator quadrupole matching section for a compact linear accelerator

    Science.gov (United States)

    Seidl, P. A.; Persaud, A.; Ghiorso, W.; Ji, Q.; Waldron, W. L.; Lal, A.; Vinayakumar, K. B.; Schenkel, T.

    2018-05-01

    Recently, we presented a new approach for a compact radio-frequency (RF) accelerator structure and demonstrated the functionality of the individual components: acceleration units and focusing elements. In this paper, we combine these units to form a working accelerator structure: a matching section between the ion source extraction grids and the RF-acceleration unit and electrostatic focusing quadrupoles between successive acceleration units. The matching section consists of six electrostatic quadrupoles (ESQs) fabricated using 3D-printing techniques. The matching section enables us to capture more beam current and to match the beam envelope to conditions for stable transport in an acceleration lattice. We present data from an integrated accelerator consisting of the source, matching section, and an ESQ doublet sandwiched between two RF-acceleration units.

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

  14. Improving multiple-point-based a priori models for inverse problems by combining Sequential Simulation with the Frequency Matching Method

    DEFF Research Database (Denmark)

    Cordua, Knud Skou; Hansen, Thomas Mejer; Lange, Katrine

    In order to move beyond simplified covariance based a priori models, which are typically used for inverse problems, more complex multiple-point-based a priori models have to be considered. By means of marginal probability distributions ‘learned’ from a training image, sequential simulation has...... proven to be an efficient way of obtaining multiple realizations that honor the same multiple-point statistics as the training image. The frequency matching method provides an alternative way of formulating multiple-point-based a priori models. In this strategy the pattern frequency distributions (i.......e. marginals) of the training image and a subsurface model are matched in order to obtain a solution with the same multiple-point statistics as the training image. Sequential Gibbs sampling is a simulation strategy that provides an efficient way of applying sequential simulation based algorithms as a priori...

  15. A Condition Number for Non-Rigid Shape Matching

    KAUST Repository

    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.

  16. Parikh Matching in the Streaming Model

    DEFF Research Database (Denmark)

    Lee, Lap-Kei; Lewenstein, Moshe; Zhang, Qin

    2012-01-01

    Let S be a string over an alphabet Σ = {σ1, σ2, …}. A Parikh-mapping maps a substring S′ of S to a |Σ|-length vector that contains, in location i of the vector, the count of σi in S′. Parikh matching refers to the problem of finding all substrings of a text T which match to a given input |Σ|-leng...

  17. Latent palmprint matching.

    Science.gov (United States)

    Jain, Anil K; Feng, Jianjiang

    2009-06-01

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

  18. A MATCHING METHOD TO REDUCE THE INFLUENCE OF SAR GEOMETRIC DEFORMATION

    Directory of Open Access Journals (Sweden)

    C. Gao

    2018-04-01

    Full Text Available There are large geometrical deformations in SAR image, including foreshortening, layover, shade,which leads to SAR Image matching with low accuracy. Especially in complex terrain area, the control points are difficult to obtain, and the matching is difficult to achieve. Considering the impact of geometric distortions in SAR image pairs, a matching algorithm with a combination of speeded up robust features (SURF and summed of normalize cross correlation (SNCC was proposed, which can avoid the influence of SAR geometric deformation. Firstly, SURF algorithm was utilized to predict the search area. Then the matching point pairs was selected based on summed of normalized cross correlation. Finally, false match points were eliminated by the bidirectional consistency. SURF algorithm can control the range of matching points, and the matching points extracted from the deformation area are eliminated, and the matching points with stable and even distribution are obtained. The experimental results demonstrated that the proposed algorithm had high precision, and can effectively avoid the effect of geometric distortion on SAR image matching. Meet accuracy requirements of the block adjustment with sparse control points.

  19. Improved SURF Algorithm and Its Application in Seabed Relief Image Matching

    Directory of Open Access Journals (Sweden)

    Zhang Hong-Mei

    2017-01-01

    Full Text Available The matching based on seabed relief image is widely used in underwater relief matching navigation and target recognition, etc. However, being influenced by various factors, some conventional matching algorithms are difficult to obtain an ideal result in the matching of seabed relief image. SURF(Speeded Up Robust Features algorithm is based on feature points pair to achieve matching, and can get good results in the seabed relief image matching. However, in practical applications, the traditional SURF algorithm is easy to get false matching, especially when the area’s features are similar or not obvious, the problem is more seriously. In order to improve the robustness of the algorithm, this paper proposes an improved matching algorithm, which combines the SURF, and RANSAC (Random Sample Consensus algorithms. The new algorithm integrates the two algorithms advantages, firstly, the SURF algorithm is applied to detect and extract the feature points then to pre-match. Secondly, RANSAC algorithm is utilized to eliminate mismatching points, and then the accurate matching is accomplished with the correct matching points. The experimental results show that the improved algorithm overcomes the mismatching problem effectively and have better precision and faster speed than the traditional SURF algorithm.

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

  1. Construction of basic match schedules for sports competitions by using graph theory

    NARCIS (Netherlands)

    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

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

  3. Self-Similar Spin Images for Point Cloud Matching

    Science.gov (United States)

    Pulido, Daniel

    The rapid growth of Light Detection And Ranging (Lidar) technologies that collect, process, and disseminate 3D point clouds have allowed for increasingly accurate spatial modeling and analysis of the real world. Lidar sensors can generate massive 3D point clouds of a collection area that provide highly detailed spatial and radiometric information. However, a Lidar collection can be expensive and time consuming. Simultaneously, the growth of crowdsourced Web 2.0 data (e.g., Flickr, OpenStreetMap) have provided researchers with a wealth of freely available data sources that cover a variety of geographic areas. Crowdsourced data can be of varying quality and density. In addition, since it is typically not collected as part of a dedicated experiment but rather volunteered, when and where the data is collected is arbitrary. The integration of these two sources of geoinformation can provide researchers the ability to generate products and derive intelligence that mitigate their respective disadvantages and combine their advantages. Therefore, this research will address the problem of fusing two point clouds from potentially different sources. Specifically, we will consider two problems: scale matching and feature matching. Scale matching consists of computing feature metrics of each point cloud and analyzing their distributions to determine scale differences. Feature matching consists of defining local descriptors that are invariant to common dataset distortions (e.g., rotation and translation). Additionally, after matching the point clouds they can be registered and processed further (e.g., change detection). The objective of this research is to develop novel methods to fuse and enhance two point clouds from potentially disparate sources (e.g., Lidar and crowdsourced Web 2.0 datasets). The scope of this research is to investigate both scale and feature matching between two point clouds. The specific focus of this research will be in developing a novel local descriptor

  4. BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks

    KAUST Repository

    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

  5. BLMA: A Blind Matching Algorithm with Application to Cognitive Radio Networks

    KAUST Repository

    Hamza, Doha R.; Shamma, Jeff S.

    2017-01-01

    We consider a two-sided one-to-one abstract matching problem with a defined notion of pairwise stability. The formulated problem is shown to encompass the ordinal and cardinal utility markets. We propose a distributed blind matching algorithm (BLMA) to solve the problem. BLMA is characterized by random activations of agents, and by generic negotiation and aspiration (utility) update processes. We prove the solution produced by BLMA will converge to an

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

  7. Citation Matching in Sanskrit Corpora Using Local Alignment

    Science.gov (United States)

    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.

  8. Approximate semantic matching of music classes on the internet

    NARCIS (Netherlands)

    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.

  9. Reducing the likelihood of long tennis matches.

    Science.gov (United States)

    Barnett, Tristan; Alan, Brown; Pollard, Graham

    2006-01-01

    Long matches can cause problems for tournaments. For example, the starting times of subsequent matches can be substantially delayed causing inconvenience to players, spectators, officials and television scheduling. They can even be seen as unfair in the tournament setting when the winner of a very long match, who may have negative aftereffects from such a match, plays the winner of an average or shorter length match in the next round. Long matches can also lead to injuries to the participating players. One factor that can lead to long matches is the use of the advantage set as the fifth set, as in the Australian Open, the French Open and Wimbledon. Another factor is long rallies and a greater than average number of points per game. This tends to occur more frequently on the slower surfaces such as at the French Open. The mathematical method of generating functions is used to show that the likelihood of long matches can be substantially reduced by using the tiebreak game in the fifth set, or more effectively by using a new type of game, the 50-40 game, throughout the match. Key PointsThe cumulant generating function has nice properties for calculating the parameters of distributions in a tennis matchA final tiebreaker set reduces the length of matches as currently being used in the US OpenA new 50-40 game reduces the length of matches whilst maintaining comparable probabilities for the better player to win the match.

  10. Optimally Joint Subcarrier Matching and Power Allocation in OFDM Multihop System

    Directory of Open Access Journals (Sweden)

    Shuyuan Yang

    2008-04-01

    Full Text Available Orthogonal frequency division multiplexing (OFDM multihop system is a promising way to increase capacity and coverage. In this paper, we propose an optimally joint subcarrier matching and power allocation scheme to further maximize the total channel capacity with the constrained total system power. First, the problem is formulated as a mixed binary integer programming problem, which is prohibitive to find the global optimum in terms of complexity. Second, by making use of the equivalent channel power gain for any matched subcarrier pair, a low complexity scheme is proposed. The optimal subcarrier matching is to match subcarriers by the order of the channel power gains. The optimal power allocation among the matched subcarrier pairs is water-filling. An analytical argument is given to prove that the two steps achieve the optimally joint subcarrier matching and power allocation. The simulation results show that the proposed scheme achieves the largest total channel capacity as compared to the other schemes, where there is no subcarrier matching or no power allocation.

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

  12. Marriage and Divorce in a Model of Matching

    OpenAIRE

    Mumcu, Ayse; Saglam, Ismail

    2006-01-01

    We study the problem of marriage formation and marital distribution in a two-period model of matching, extending the matching with bargaining framework of Crawford and Rochford (1986). We run simulations to find the effects of alimony rate, legal cost of divorce, initial endowments, couple and single productivity parameters on the payoffs and marital status in the society.

  13. POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY

    Directory of Open Access Journals (Sweden)

    S. Chen

    2016-06-01

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

  14. LiDAR Scan Matching Aided Inertial Navigation System in GNSS-Denied Environments.

    Science.gov (United States)

    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.

  15. Stable carbon and nitrogen isotope ratios of sodium and potassium cyanide as a forensic signature.

    Science.gov (United States)

    Kreuzer, Helen W; Horita, Juske; Moran, James J; Tomkins, Bruce A; Janszen, Derek B; Carman, April

    2012-01-01

    Sodium and potassium cyanide are highly toxic, produced in large amounts by the chemical industry, and linked to numerous high-profile crimes. The U.S. Centers for Disease Control and Prevention has identified cyanide as one of the most probable agents to be used in a chemical terrorism event. We investigated whether stable C and N isotopic content of sodium and potassium cyanide could serve as a forensic signature for sample matching, using a collection of 65 cyanide samples. Upon analysis, a few of the cyanide samples displayed nonhomogeneous isotopic content associated with degradation to a carbonate salt and loss of hydrogen cyanide. Most samples had highly reproducible isotope content. Of the 65 cyanide samples, >95% could be properly matched based on C and N isotope ratios, with a false match rate <3%. These results suggest that stable C and N isotope ratios are a useful forensic signature for matching cyanide samples. © 2011 American Academy of Forensic Sciences.

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

  17. Goals and everyday problem solving: examining the link between age-related goals and problem-solving strategy use.

    Science.gov (United States)

    Hoppmann, Christiane A; Coats, Abby Heckman; Blanchard-Fields, Fredda

    2008-07-01

    Qualitative interviews on family and financial problems from 332 adolescents, young, middle-aged, and older adults, demonstrated that developmentally relevant goals predicted problem-solving strategy use over and above problem domain. Four focal goals concerned autonomy, generativity, maintaining good relationships with others, and changing another person. We examined both self- and other-focused problem-solving strategies. Autonomy goals were associated with self-focused instrumental problem solving and generative goals were related to other-focused instrumental problem solving in family and financial problems. Goals of changing another person were related to other-focused instrumental problem solving in the family domain only. The match between goals and strategies, an indicator of problem-solving adaptiveness, showed that young individuals displayed the greatest match between autonomy goals and self-focused problem solving, whereas older adults showed a greater match between generative goals and other-focused problem solving. Findings speak to the importance of considering goals in investigations of age-related differences in everyday problem solving.

  18. Matching Supernovae to Galaxies

    Science.gov (United States)

    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

  19. Wide baseline stereo matching based on double topological relationship consistency

    Science.gov (United States)

    Zou, Xiaohong; Liu, Bin; Song, Xiaoxue; Liu, Yang

    2009-07-01

    Stereo matching is one of the most important branches in computer vision. In this paper, an algorithm is proposed for wide-baseline stereo vision matching. Here, a novel scheme is presented called double topological relationship consistency (DCTR). The combination of double topological configuration includes the consistency of first topological relationship (CFTR) and the consistency of second topological relationship (CSTR). It not only sets up a more advanced model on matching, but discards mismatches by iteratively computing the fitness of the feature matches and overcomes many problems of traditional methods depending on the powerful invariance to changes in the scale, rotation or illumination across large view changes and even occlusions. Experimental examples are shown where the two cameras have been located in very different orientations. Also, epipolar geometry can be recovered using RANSAC by far the most widely method adopted possibly. By the method, we can obtain correspondences with high precision on wide baseline matching problems. Finally, the effectiveness and reliability of this method are demonstrated in wide-baseline experiments on the image pairs.

  20. Third-Order Matching in the Polymorphic Lambda Calculus

    NARCIS (Netherlands)

    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.

  1. Matching of analytical and numerical solutions for neutron stars of arbitrary rotation

    International Nuclear Information System (INIS)

    Pappas, George

    2009-01-01

    We demonstrate the results of an attempt to match the two-soliton analytical solution with the numerically produced solutions of the Einstein field equations, that describe the spacetime exterior of rotating neutron stars, for arbitrary rotation. The matching procedure is performed by equating the first four multipole moments of the analytical solution to the multipole moments of the numerical one. We then argue that in order to check the effectiveness of the matching of the analytical with the numerical solution we should compare the metric components, the radius of the innermost stable circular orbit (R ISCO ), the rotation frequency and the epicyclic frequencies Ω ρ , Ω z . Finally we present some results of the comparison.

  2. Matching of analytical and numerical solutions for neutron stars of arbitrary rotation

    Energy Technology Data Exchange (ETDEWEB)

    Pappas, George, E-mail: gpappas@phys.uoa.g [Section of Astrophysics, Astronomy, and Mechanics, Department of Physics, University of Athens, Panepistimiopolis Zografos GR15783, Athens (Greece)

    2009-10-01

    We demonstrate the results of an attempt to match the two-soliton analytical solution with the numerically produced solutions of the Einstein field equations, that describe the spacetime exterior of rotating neutron stars, for arbitrary rotation. The matching procedure is performed by equating the first four multipole moments of the analytical solution to the multipole moments of the numerical one. We then argue that in order to check the effectiveness of the matching of the analytical with the numerical solution we should compare the metric components, the radius of the innermost stable circular orbit (R{sub ISCO}), the rotation frequency and the epicyclic frequencies {Omega}{sub {rho}}, {Omega}{sub z}. Finally we present some results of the comparison.

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

    Science.gov (United States)

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

    2018-02-01

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

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

    Science.gov (United States)

    Zhuang, Yufeng; Lu, Jiang; Su, Zhiyuan

    2018-04-01

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

  5. Problems in clinical practice of domestic supply of 99Mo/99mTc. The direction and problem of stable supply chain of 99Mo in Japan

    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)

  6. MARG2D code. 1. Eigenvalue problem for two dimensional Newcomb equation

    Energy Technology Data Exchange (ETDEWEB)

    Tokuda, Shinji [Japan Atomic Energy Research Inst., Naka, Ibaraki (Japan). Naka Fusion Research Establishment; Watanabe, Tomoko

    1997-10-01

    A new method and a code MARG2D have been developed to solve the 2-dimensional Newcomb equation which plays an important role in the magnetohydrodynamic (MHD) stability analysis in an axisymmetric toroidal plasma such as a tokamak. In the present formulation, an eigenvalue problem is posed for the 2-D Newcomb equation, where the weight function (the kinetic energy integral) and the boundary conditions at rational surfaces are chosen so that an eigenfunction correctly behaves as the linear combination of the small solution and the analytical solutions around each of the rational surfaces. Thus, the difficulty on solving the 2-D Newcomb equation has been resolved. By using the MARG2D code, the ideal MHD marginally stable state can be identified for a 2-D toroidal plasma. The code is indispensable on computing the outer-region matching data necessary for the resistive MHD stability analysis. Benchmark with ERATOJ, an ideal MHD stability code, has been carried out and the MARG2D code demonstrates that it indeed identifies both stable and marginally stable states against ideal MHD motion. (author)

  7. Solving the Border Control Problem: Evidence of Enhanced Face Matching in Individuals with Extraordinary Face Recognition Skills.

    Science.gov (United States)

    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.

  8. LiDAR Scan Matching Aided Inertial Navigation System in GNSS-Denied Environments

    Directory of Open Access Journals (Sweden)

    Jian Tang

    2015-07-01

    Full Text Available A new scan that matches an aided Inertial Navigation System (INS with a low-cost LiDAR is proposed as an alternative to GNSS-based navigation systems in GNSS-degraded or -denied environments such as indoor areas, dense forests, or urban canyons. In these areas, INS-based Dead Reckoning (DR and Simultaneous Localization and Mapping (SLAM technologies are normally used to estimate positions as separate tools. However, there are critical implementation problems with each standalone system. The drift errors of velocity, position, and heading angles in an INS will accumulate over time, and on-line calibration is a must for sustaining positioning accuracy. SLAM performance is poor in featureless environments where the matching errors can significantly increase. Each standalone positioning method cannot offer a sustainable navigation solution with acceptable accuracy. This paper integrates two complementary technologies—INS and LiDAR SLAM—into one navigation frame with a loosely coupled Extended Kalman Filter (EKF to use the advantages and overcome the drawbacks of each system to establish a stable long-term navigation process. Static and dynamic field tests were carried out with a self-developed Unmanned Ground Vehicle (UGV platform—NAVIS. The results prove that the proposed approach can provide positioning accuracy at the centimetre level for long-term operations, even in a featureless indoor environment.

  9. The obesity paradox in stable chronic heart failure does not persist after matching for indicators of disease severity and confounders.

    Science.gov (United States)

    Frankenstein, Lutz; Zugck, Christian; Nelles, Manfred; Schellberg, Dieter; Katus, Hugo A; Remppis, B Andrew

    2009-12-01

    To verify whether controlling for indicators of disease severity and confounders represents a solution to the obesity paradox in chronic heart failure (CHF). From a cohort of 1790 patients, we formed 230 nested matched triplets by individually matching patients with body mass index (BMI) > 30 kg/m(2) (Group 3), BMI 20-24.9 k/m(2) (Group 1) and BMI 25-29.9 kg/m(2) (Group 2), according to NT-proBNP, age, sex, and NYHA class (triplet = one matched patient from each group). Although in the pre-matching cohort, BMI group was a significant univariable prognostic indicator, it did not retain significance [heart rate (HR): 0.91, 95% CI: 0.78-1.05, chi(2): 1.67] when controlled for group propensities as covariates. Furthermore, in the matched cohort, 1-year mortality and 3-year mortality did not differ significantly. Here, BMI again failed to reach statistical significance for prognosis, either as a continuous or categorical variable, whether crude or adjusted. This result was confirmed in the patients not selected for matching. NT-proBNP, however, remained statistically significant (log(NT-proBNP): HR: 1.49, 95% CI: 1.13-1.97, chi(2): 7.82) after multivariable adjustment. The obesity paradox does not appear to persist in a matched setting with respect to indicators of disease severity and other confounders. NT-proBNP remains an independent prognostic indicator of adverse outcome irrespective of obesity status.

  10. Small Vocabulary with Saliency Matching for Video Copy Detection

    DEFF Research Database (Denmark)

    Ren, Huamin; Moeslund, Thomas B.; Tang, Sheng

    2013-01-01

    The importance of copy detection has led to a substantial amount of research in recent years, among which Bag of visual Words (BoW) plays an important role due to its ability to effectively handling occlusion and some minor transformations. One crucial issue in BoW approaches is the size of vocab......The importance of copy detection has led to a substantial amount of research in recent years, among which Bag of visual Words (BoW) plays an important role due to its ability to effectively handling occlusion and some minor transformations. One crucial issue in BoW approaches is the size...... matching algorithm based on salient visual words selection. More specifically, the variation of visual words across a given video are represented as trajectories and those containing locally asymptotically stable points are selected as salient visual words. Then we attempt to measure the similarity of two...... videos through saliency matching merely based on the selected salient visual words to remove false positives. Our experiments show that a small codebook with saliency matching is quite competitive in video copy detection. With the incorporation of the proposed saliency matching, the precision can...

  11. Achromatic hues matching in graphic printing

    Directory of Open Access Journals (Sweden)

    Martinia Ira Glogar

    2015-05-01

    Full Text Available Some problems in process of dark achromatic hues reproduction and matching in graphic industry, where requests on colour matching are very high, are discussed. When achromatic hues is concerned, in terms of high requests on colour parameter matching, right on time production, quick response and high quality standards requests, the production and moreover the reproduction is subject to many variables and represent the manufacturing process of high complexity. The aim is to achieve a graphic reproduction with defined colour parameters and remission characteristics as close as possible to a standard. In this paper, black and grey hues characterized with average lightness value L*≤ 20, were analysed. Subjective as well as objective colour evaluation have been performed and results of colour differences obtained by two colour difference formulae, CIELAB and CMC(l:c have been compared.

  12. Unsupervised image matching based on manifold alignment.

    Science.gov (United States)

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

    2012-08-01

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

  13. Solving the Border Control Problem: Evidence of Enhanced Face Matching in Individuals with Extraordinary Face Recognition Skills.

    Directory of Open Access Journals (Sweden)

    Anna Katarzyna Bobak

    Full Text Available Photographic identity documents (IDs are commonly used despite clear evidence that unfamiliar face matching is a difficult and error-prone task. The current study set out to examine the performance of seven individuals with extraordinary face recognition memory, so called "super recognisers" (SRs, on two face matching tasks resembling border control identity checks. In Experiment 1, the SRs as a group outperformed control participants on the "Glasgow Face Matching Test", and some case-by-case comparisons also reached significance. In Experiment 2, a perceptually difficult face matching task was used: the "Models Face Matching Test". Once again, SRs outperformed controls both on group and mostly in case-by-case analyses. These findings suggest that SRs are considerably better at face matching than typical perceivers, and would make proficient personnel for border control agencies.

  14. An Improved Ant Colony Matching by Using Discrete Curve Evolution

    OpenAIRE

    Saadi, Younes; Sari, Eka,; Herawan, Tutut

    2014-01-01

    Part 1: Information & Communication Technology-EurAsia Conference 2014, ICT-EurAsia 2014; International audience; In this paper we present an improved Ant Colony Optimization (ACO) for contour matching, which can be used to match 2D shapes. Discrete Curve Evolution (DCE) technique is used to simplify the extracted contour. In order to find the best correspondence between shapes, the match process is formulated as a Quadratic Assignment Problem (QAP) and resolved by using Ant Colony Optimizati...

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

    National Research Council Canada - National Science Library

    Zheng, Yefeng; Doermann, David S

    2004-01-01

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

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

  17. A Modified AH-FDTD Unconditionally Stable Method Based on High-Order Algorithm

    Directory of Open Access Journals (Sweden)

    Zheng Pan

    2017-01-01

    Full Text Available The unconditionally stable method, Associated-Hermite FDTD, has attracted more and more attentions in computational electromagnetic for its time-frequency compact property. Because of the fewer orders of AH basis needed in signal reconstruction, the computational efficiency can be improved further. In order to further improve the accuracy of the traditional AH-FDTD, a high-order algorithm is introduced. Using this method, the dispersion error induced by the space grid can be reduced, which makes it possible to set coarser grid. The simulation results show that, on the condition of coarse grid, the waveforms obtained from the proposed method are matched well with the analytic result, and the accuracy of the proposed method is higher than the traditional AH-FDTD. And the efficiency of the proposed method is higher than the traditional FDTD method in analysing 2D waveguide problems with fine-structure.

  18. The simplest problem in the collective dynamics of neural networks: is synchrony stable?

    International Nuclear Information System (INIS)

    Timme, Marc; Wolf, Fred

    2008-01-01

    For spiking neural networks we consider the stability problem of global synchrony, arguably the simplest non-trivial collective dynamics in such networks. We find that even this simplest dynamical problem—local stability of synchrony—is non-trivial to solve and requires novel methods for its solution. In particular, the discrete mode of pulsed communication together with the complicated connectivity of neural interaction networks requires a non-standard approach. The dynamics in the vicinity of the synchronous state is determined by a multitude of linear operators, in contrast to a single stability matrix in conventional linear stability theory. This unusual property qualitatively depends on network topology and may be neglected for globally coupled homogeneous networks. For generic networks, however, the number of operators increases exponentially with the size of the network. We present methods to treat this multi-operator problem exactly. First, based on the Gershgorin and Perron–Frobenius theorems, we derive bounds on the eigenvalues that provide important information about the synchronization process but are not sufficient to establish the asymptotic stability or instability of the synchronous state. We then present a complete analysis of asymptotic stability for topologically strongly connected networks using simple graph-theoretical considerations. For inhibitory interactions between dissipative (leaky) oscillatory neurons the synchronous state is stable, independent of the parameters and the network connectivity. These results indicate that pulse-like interactions play a profound role in network dynamical systems, and in particular in the dynamics of biological synchronization, unless the coupling is homogeneous and all-to-all. The concepts introduced here are expected to also facilitate the exact analysis of more complicated dynamical network states, for instance the irregular balanced activity in cortical neural networks

  19. Ontology-based composition and matching for dynamic service coordination

    OpenAIRE

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

    2011-01-01

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

  20. An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

    OpenAIRE

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

  1. Automated matching of corresponding seed images of three simulator radiographs to allow 3D triangulation of implanted seeds

    Science.gov (United States)

    Altschuler, Martin D.; Kassaee, Alireza

    1997-02-01

    To match corresponding seed images in different radiographs so that the 3D seed locations can be triangulated automatically and without ambiguity requires (at least) three radiographs taken from different perspectives, and an algorithm that finds the proper permutations of the seed-image indices. Matching corresponding images in only two radiographs introduces inherent ambiguities which can be resolved only with the use of non-positional information obtained with intensive human effort. Matching images in three or more radiographs is an `NP (Non-determinant in Polynomial time)-complete' problem. Although the matching problem is fundamental, current methods for three-radiograph seed-image matching use `local' (seed-by-seed) methods that may lead to incorrect matchings. We describe a permutation-sampling method which not only gives good `global' (full permutation) matches for the NP-complete three-radiograph seed-matching problem, but also determines the reliability of the radiographic data themselves, namely, whether the patient moved in the interval between radiographic perspectives.

  2. An adaptive clustering algorithm for image matching based on corner feature

    Science.gov (United States)

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

    2018-04-01

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

  3. Stable isotope analysis in primatology: a critical review.

    Science.gov (United States)

    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.

  4. Probabilistic evaluation of process model matching techniques

    NARCIS (Netherlands)

    Kuss, Elena; Leopold, Henrik; van der Aa, Han; Stuckenschmidt, Heiner; Reijers, Hajo A.

    2016-01-01

    Process model matching refers to the automatic identification of corresponding activities between two process models. It represents the basis for many advanced process model analysis techniques such as the identification of similar process parts or process model search. A central problem is how to

  5. Formal derivation of a stable marriage algorithm.

    NARCIS (Netherlands)

    Bijlsma, A.

    1991-01-01

    In this paper the well-known Stable Marriage Problem is considered once again. The name of this programming problem comes from the terms in which it was first described [2]: A certain community consists of n men and n women. Each person ranks those of the opposite sex in accordance with his or

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

  7. Template matching for auditing hospital cost and quality.

    Science.gov (United States)

    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.

  8. Geomagnetic matching navigation algorithm based on robust estimation

    Science.gov (United States)

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

    2017-08-01

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

  9. Trends and problems on the studies by stable isotope ratio mass spectrometry for verifying the geographical origin of foods

    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)

  10. Unconditionally stable diffusion-acceleration of the transport equation

    International Nuclear Information System (INIS)

    Larsen, E.W.

    1982-01-01

    The standard iterative procedure for solving fixed-source discrete-ordinates problems converges very slowly for problems in optically large regions with scattering ratios c near unity. The diffusion-synthetic acceleration method has been proposed to make use of the fact that for this class of problems the diffusion equation is often an accurate approximation to the transport equation. However, stability difficulties have historically hampered the implementation of this method for general transport differencing schemes. In this article we discuss a recently developed procedure for obtaining unconditionally stable diffusion-synthetic acceleration methods for various transport differencing schemes. We motivate the analysis by first discussing the exact transport equation; then we illustrate the procedure by deriving a new stable acceleration method for the linear discontinuous transport differencing scheme. We also provide some numerical results

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

  12. Signature detection and matching for document image retrieval.

    Science.gov (United States)

    Zhu, Guangyu; Zheng, Yefeng; Doermann, David; Jaeger, Stefan

    2009-11-01

    As one of the most pervasive methods of individual identification and document authentication, signatures present convincing evidence and provide an important form of indexing for effective document image processing and retrieval in a broad range of applications. However, detection and segmentation of free-form objects such as signatures from clustered background is currently an open document analysis problem. In this paper, we focus on two fundamental problems in signature-based document image retrieval. First, we propose a novel multiscale approach to jointly detecting and segmenting signatures from document images. Rather than focusing on local features that typically have large variations, our approach captures the structural saliency using a signature production model and computes the dynamic curvature of 2D contour fragments over multiple scales. This detection framework is general and computationally tractable. Second, we treat the problem of signature retrieval in the unconstrained setting of translation, scale, and rotation invariant nonrigid shape matching. We propose two novel measures of shape dissimilarity based on anisotropic scaling and registration residual error and present a supervised learning framework for combining complementary shape information from different dissimilarity metrics using LDA. We quantitatively study state-of-the-art shape representations, shape matching algorithms, measures of dissimilarity, and the use of multiple instances as query in document image retrieval. We further demonstrate our matching techniques in offline signature verification. Extensive experiments using large real-world collections of English and Arabic machine-printed and handwritten documents demonstrate the excellent performance of our approaches.

  13. PATTERN CLASSIFICATION APPROACHES TO MATCHING BUILDING POLYGONS AT MULTIPLE SCALES

    Directory of Open Access Journals (Sweden)

    X. Zhang

    2012-07-01

    Full Text Available Matching of building polygons with different levels of detail is crucial in the maintenance and quality assessment of multi-representation databases. Two general problems need to be addressed in the matching process: (1 Which criteria are suitable? (2 How to effectively combine different criteria to make decisions? This paper mainly focuses on the second issue and views data matching as a supervised pattern classification. Several classifiers (i.e. decision trees, Naive Bayes and support vector machines are evaluated for the matching task. Four criteria (i.e. position, size, shape and orientation are used to extract information for these classifiers. Evidence shows that these classifiers outperformed the weighted average approach.

  14. Optimization of Parameters of Asymptotically Stable Systems

    Directory of Open Access Journals (Sweden)

    Anna Guerman

    2011-01-01

    Full Text Available This work deals with numerical methods of parameter optimization for asymptotically stable systems. We formulate a special mathematical programming problem that allows us to determine optimal parameters of a stabilizer. This problem involves solutions to a differential equation. We show how to chose the mesh in order to obtain discrete problem guaranteeing the necessary accuracy. The developed methodology is illustrated by an example concerning optimization of parameters for a satellite stabilization system.

  15. Reduction of snapshots for MIMO radar detection by block/group orthogonal matching pursuit

    KAUST Repository

    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.

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

  17. History Matching of 4D Seismic Data Attributes using the Ensemble Kalman Filter

    KAUST Repository

    Ravanelli, Fabio M.

    2013-01-01

    . This problem is tackled by the conditioning of the model with production data through data assimilation. This process is known in the oil industry as history matching. Several recent advances are being used to improve history matching reliability, notably

  18. Solving the border control problem: evidence of enhanced face matching in individuals with extraordinary face recognition skills.

    OpenAIRE

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

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

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

  1. Scanner OPC signatures: automatic vendor-to-vendor OPE matching

    Science.gov (United States)

    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.

  2. Quantum learning and universal quantum matching machine

    International Nuclear Information System (INIS)

    Sasaki, Masahide; Carlini, Alberto

    2002-01-01

    Suppose that three kinds of quantum systems are given in some unknown states vertical bar f> xN , vertical bar g 1 > xK , and vertical bar g 2 > xK , and we want to decide which template state vertical bar g 1 > or vertical bar g 2 >, each representing the feature of the pattern class C 1 or C 2 , respectively, is closest to the input feature state vertical bar f>. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of K=1, showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process

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

  4. MBR-SIFT: A mirror reflected invariant feature descriptor using a binary representation for image matching.

    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.

  5. MBR-SIFT: A mirror reflected invariant feature descriptor using a binary representation for image matching.

    Science.gov (United States)

    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.

  6. Air-Coupled Piezoelectric Transducers with Active Polypropylene Foam Matching Layers

    Directory of Open Access Journals (Sweden)

    Tomás E. Gómez Alvarez-Arenas

    2013-05-01

    Full Text Available This work presents the design, construction and characterization of air-coupled piezoelectric transducers using 1–3 connectivity piezocomposite disks with a stack of matching layers being the outer one an active quarter wavelength layer made of polypropylene foam ferroelectret film. This kind of material has shown a stable piezoelectric response together with a very low acoustic impedance (<0.1 MRayl. These features make them a suitable candidate for the dual use or function proposed here: impedance matching layer and active material for air-coupled transduction. The transducer centre frequency is determined by the l/4 resonance of the polypropylene foam ferroelectret film (0.35 MHz, then, the rest of the transducer components (piezocomposite disk and passive intermediate matching layers are all tuned to this frequency. The transducer has been tested in several working modes including pulse-echo and pitch-catch as well as wide and narrow band excitation. The performance of the proposed novel transducer is compared with that of a conventional air-coupled transducers operating in a similar frequency range.

  7. Matching consumer feeding behaviours and resource traits: a fourth-corner problem in food-web theory.

    Science.gov (United States)

    Monteiro, Angelo Barbosa; Faria, Lucas Del Bianco

    2018-06-06

    For decades, food web theory has proposed phenomenological models for the underlying structure of ecological networks. Generally, these models rely on latent niche variables that match the feeding behaviour of consumers with their resource traits. In this paper, we used a comprehensive database to evaluate different hypotheses on the best dependency structure of trait-matching patterns between consumers and resource traits. We found that consumer feeding behaviours had complex interactions with resource traits; however, few dimensions (i.e. latent variables) could reproduce the trait-matching patterns. We discuss our findings in the light of three food web models designed to reproduce the multidimensionality of food web data; additionally, we discuss how using species traits clarify food webs beyond species pairwise interactions and enable studies to infer ecological generality at larger scales, despite potential taxonomic differences, variations in ecological conditions and differences in species abundance between communities. © 2018 John Wiley & Sons Ltd/CNRS.

  8. Experimental Matching of Instances to Heuristics for Constraint Satisfaction Problems.

    Science.gov (United States)

    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.

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

  10. Steelmaking-Casting of Molten Steel by Decarburization Ladle Matching

    Directory of Open Access Journals (Sweden)

    Wei Liu

    2018-01-01

    Full Text Available Steelmaking–continuous casting is a complex process. The method of selecting a ladle, which also functions as a storage device, follows a specific process of the production plan. In ladle matching, several ladle attributes are considered. However, matching objectives are difficult to achieve simultaneously. Different molten steel properties have contributed to the complexity of matching constraints, and, thus, matching optimization is regarded a multiconflict goal problem. In the process of optimization, the first-order rule learning method is first used to extract key ladle attributes (performance indicators, including highest temperature, usage frequency, lowest-level material, and outlet. On the basis of a number of indicators, such as ladle temperature, quantity, material, and usage frequency, as well as skateboard quantity, the ladle matching model is established. Second, the rule of ladle selection is determined by the method of least-generalization rule learning. Third, a simulation experiment is carried out according to various scheduling order strategies and matching priority combinations. Finally, the heuristic ladle matching method based on the rule priority (RP is determined for possible industrial applications. Results show that the accuracy of ladle selection can be improved. In particular, the numbers of ladles and maintenance times are reduced. Consequently, furnace production efficiency is also enhanced.

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

  12. Theory and design of broadband matching networks applied electricity and electronics

    CERN Document Server

    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

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

  14. A gradient stable scheme for a phase field model for the moving contact line problem

    KAUST Repository

    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.

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

    Science.gov (United States)

    2011-01-28

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

  16. Myocardium tracking via matching distributions.

    Science.gov (United States)

    Ben Ayed, Ismail; Li, Shuo; Ross, Ian; Islam, Ali

    2009-01-01

    The goal of this study is to investigate automatic myocardium tracking in cardiac Magnetic Resonance (MR) sequences using global distribution matching via level-set curve evolution. Rather than relying on the pixelwise information as in existing approaches, distribution matching compares intensity distributions, and consequently, is well-suited to the myocardium tracking problem. Starting from a manual segmentation of the first frame, two curves are evolved in order to recover the endocardium (inner myocardium boundary) and the epicardium (outer myocardium boundary) in all the frames. For each curve, the evolution equation is sought following the maximization of a functional containing two terms: (1) a distribution matching term measuring the similarity between the non-parametric intensity distributions sampled from inside and outside the curve to the model distributions of the corresponding regions estimated from the previous frame; (2) a gradient term for smoothing the curve and biasing it toward high gradient of intensity. The Bhattacharyya coefficient is used as a similarity measure between distributions. The functional maximization is obtained by the Euler-Lagrange ascent equation of curve evolution, and efficiently implemented via level-set. The performance of the proposed distribution matching was quantitatively evaluated by comparisons with independent manual segmentations approved by an experienced cardiologist. The method was applied to ten 2D mid-cavity MR sequences corresponding to ten different subjects. Although neither shape prior knowledge nor curve coupling were used, quantitative evaluation demonstrated that the results were consistent with manual segmentations. The proposed method compares well with existing methods. The algorithm also yields a satisfying reproducibility. Distribution matching leads to a myocardium tracking which is more flexible and applicable than existing methods because the algorithm uses only the current data, i.e., does not

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

    Science.gov (United States)

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

    2016-01-01

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

  18. On the use of INS to improve Feature Matching

    Science.gov (United States)

    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

  19. Characterizing Response-Reinforcer Relations in the Natural Environment: Exploratory Matching Analyses

    Science.gov (United States)

    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…

  20. Data matching for free-surface multiple attenuation by multidimensional deconvolution

    Science.gov (United States)

    van der Neut, Joost; Frijlink, Martijn; van Borselen, Roald

    2012-09-01

    A common strategy for surface-related multiple elimination of seismic data is to predict multiples by a convolutional model and subtract these adaptively from the input gathers. Problems can be posed by interfering multiples and primaries. Removing multiples by multidimensional deconvolution (MDD) (inversion) does not suffer from these problems. However, this approach requires data to be consistent, which is often not the case, especially not at interpolated near-offsets. A novel method is proposed to improve data consistency prior to inversion. This is done by backpropagating first-order multiples with a time-gated reference primary event and matching these with early primaries in the input gather. After data matching, multiple elimination by MDD can be applied with a deterministic inversion scheme.

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

  2. On Nash-Equilibria of Approximation-Stable Games

    Science.gov (United States)

    Awasthi, Pranjal; Balcan, Maria-Florina; Blum, Avrim; Sheffet, Or; Vempala, Santosh

    One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are far apart, or ɛ-equilibria that are far in variation distance from the true Nash equilibrium strategies, then this prediction may not be possible even in principle. Motivated by this consideration, in this paper we define the notion of games that are approximation stable, meaning that all ɛ-approximate equilibria are contained inside a small ball of radius Δ around a true equilibrium, and investigate a number of their properties. Many natural small games such as matching pennies and rock-paper-scissors are indeed approximation stable. We show furthermore there exist 2-player n-by-n approximation-stable games in which the Nash equilibrium and all approximate equilibria have support Ω(log n). On the other hand, we show all (ɛ,Δ) approximation-stable games must have an ɛ-equilibrium of support O(Δ^{2-o(1)}/ɛ2{log n}), yielding an immediate n^{O(Δ^{2-o(1)}/ɛ^2log n)}-time algorithm, improving over the bound of [11] for games satisfying this condition. We in addition give a polynomial-time algorithm for the case that Δ and ɛ are sufficiently close together. We also consider an inverse property, namely that all non-approximate equilibria are far from some true equilibrium, and give an efficient algorithm for games satisfying that condition.

  3. Transverse two-stream instability in a matched plasma channel

    International Nuclear Information System (INIS)

    Whlttum, D.H.

    1994-01-01

    A relativistic electron beam magnetically self-focused in a plasma is subject to a transverse two stream or 'hose' instability. Linear evolution is described in terms of a tune distribution characterizing the beam, and an effective transverse impedance determined by the beam and the plasma profiles. This model is compared to cloud-in-cell simulations of three-dimensional transport of a beam with a Bennett profile, through a matched plasma channel. In the limit of large skin-depth this instability appears to be the primary limitation on stable beam transport. (author)

  4. Shadow Areas Robust Matching Among Image Sequence in Planetary Landing

    Science.gov (United States)

    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.

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

    Science.gov (United States)

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

    2015-05-01

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

  6. The Purification Method of Matching Points Based on Principal Component Analysis

    Directory of Open Access Journals (Sweden)

    DONG Yang

    2017-02-01

    Full Text Available The traditional purification method of matching points usually uses a small number of the points as initial input. Though it can meet most of the requirements of point constraints, the iterative purification solution is easy to fall into local extreme, which results in the missing of correct matching points. To solve this problem, we introduce the principal component analysis method to use the whole point set as initial input. And thorough mismatching points step eliminating and robust solving, more accurate global optimal solution, which intends to reduce the omission rate of correct matching points and thus reaches better purification effect, can be obtained. Experimental results show that this method can obtain the global optimal solution under a certain original false matching rate, and can decrease or avoid the omission of correct matching points.

  7. Log-stable concentration distributions of trace elements in biomedical samples

    International Nuclear Information System (INIS)

    Kubala-Kukus, A.; Kuternoga, E.; Braziewicz, J.; Pajek, M.

    2004-01-01

    In the present paper, which follows our earlier observation that the asymmetric and long-tailed concentration distributions of trace elements in biomedical samples, measured by the X-ray fluorescence techniques, can be modeled by the log-stable distributions, further specific aspects of this observation are discussed. First, we demonstrate that, typically, for a quite substantial fraction (10-20%) of trace elements studied in different kinds of biomedical samples, the measured concentration distributions are described in fact by the 'symmetric' log-stable distributions, i.e. the asymmetric distributions which are described by the symmetric stable distributions. This observation is, in fact, expected for the random multiplicative process, which models the concentration distributions of trace elements in the biomedical samples. The log-stable nature of concentration distribution of trace elements results in several problems of statistical nature, which have to be addressed in XRF data analysis practice. Consequently, in the present paper, the following problems, namely (i) the estimation of parameters for stable distributions and (ii) the testing of the log-stable nature of the concentration distribution by using the Anderson-Darling (A 2 ) test, especially for symmetric stable distributions, are discussed in detail. In particular, the maximum likelihood estimation and Monte Carlo simulation techniques were used, respectively, for estimation of stable distribution parameters and calculation of the critical values for the Anderson-Darling test. The discussed ideas are exemplified by the results of the study of trace element concentration distributions in selected biomedical samples, which were obtained by using the X-ray fluorescence (XRF, TXRF) methods

  8. Myocardial perfusion SPECT in stable angina;Place de la scintigraphie myocardique dans l'angor stable

    Energy Technology Data Exchange (ETDEWEB)

    Jau, P.; Jacob, T. [HP Clairval, Service de medecine nucleaire, 13 - Marseille (France); Lecorff, G.; Bouvier, J.L.; Novella, P.; Bechet, V.; Pelet, V. [HP Clairval, Service de cardiologie, 13 - Marseille (France)

    2010-03-15

    We study the precise contribution of myocardial scintigraphy in the therapeutic management of stable coronary artery disease. Until recently, treatment was focused on revascularization, often by coronary angioplasty.Recent studies have challenged this practice by showing the absence of superiority of angioplasty compared to optimal medical therapy.The problem now is to define for each stable coronary artery disease, and individually, the best of both treatment options. In this spirit, the functional approach to coronary artery disease by myocardial perfusion scintigraphy is most interesting.The diagnostic performance, including sensitivity and negative predictive value, and the prognostic value of the technique are clearly established. Recent studies show that a therapeutic decision based on a functional approach to the patient is valid.We need to know this development in cardiology for best position in the multidisciplinary discussions, myocardial scintigraphy as a functional approach to stable coronary artery disease. (N.C.)

  9. 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%).

  10. Periodicity of the stable isotopes

    CERN Document Server

    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)

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

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

    Science.gov (United States)

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

    2016-08-01

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

  13. Job Searchers, Job Matches and the Elasticity of Matching

    NARCIS (Netherlands)

    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

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

  15. Firm R&D units and outsourcing partners: A matching story

    OpenAIRE

    Barge-Gil, Andrés; Conti, Annamaria

    2013-01-01

    We present a theory that examines the optimal match between firm R&D units and external partners for projects that involve problem solving. We have a firm selecting an external partner conditional on the learning costs of its internal R&D unit. We show that there exists a matching equilibrium with property that external partners with low learning costs for a project work with R\\&D units that also have low learning costs for the same project. Empirically, we use a dataset of ...

  16. Modulational-instability gain bands in quasi-phase-matched materials

    International Nuclear Information System (INIS)

    Corney, J.F.; Bang, O.

    2002-01-01

    Full text: Quadratically nonlinear materials are of significant technological interest in optics because of their strong and fast cascaded nonlinearities, which are accessed most efficiently with quasi-phase-matching (QPM) techniques. We study the gain spectra of modulational instabilities (Ml) in quadratic materials where the linear and nonlinear properties are modulated with QPM gratings. The periods and intensity-dependence of the Ml can now be measured in the laboratory. Using an exact Floquet theory, we find that novel low- and high-frequency bands appear in the gain spectrum (gain versus transverse spatial frequency). The high-frequency gain bands are a general feature of gain spectra for QPM gratings. They form part of an extensive series of bands that correspond to Ml in the non-phase-matched, quickly varying components of the fields. The low-frequency bands correspond to Ml in the phase-matched DC components of the fields and are accurately predicted by a simple average theory. This theory includes the effect of the quickly varying components as induced cubic terms, which can be strong enough to suppress the low-frequency bands, in which case dark solitons and other broad beams may be effectively stable, since the high-frequency bands are typically small

  17. Unconditionally stable microwave Si-IMPATT amplifiers

    International Nuclear Information System (INIS)

    Seddik, M.M.

    1986-07-01

    The purpose of this investigation has been the development of an improved understanding of the design and analysis of microwave reflection amplifiers employing the negative resistance property of the IMPATT devices. Unconditionally stable amplifier circuit using a Silicon IMPATT diode is designed. The problems associated with the design procedures and the stability criterion are discussed. A computer program is developed to perform the computations. The stable characteristics of a reflection-type Si-IMPATT amplifier, such as gain, frequency and bandwidth are examined. It was found that at large signal drive levels, 7 dB gain with bandwidth of 800 MHz at 22,5 mA was obtained. (author)

  18. A multi-stage heuristic algorithm for matching problem in the modified miniload automated storage and retrieval system of e-commerce

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    2013-12-05

    ... 1974: CMS Computer Matching Program Match No. 2013-01; HHS Computer Matching Program Match No. 1312 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS... Privacy Act of 1974 (5 U.S.C. 552a), as amended, this notice announces the renewal of a CMP that CMS plans...

  20. A probabilistic evaluation procedure for process model matching techniques

    NARCIS (Netherlands)

    Kuss, Elena; Leopold, Henrik; van der Aa, Han; Stuckenschmidt, Heiner; Reijers, Hajo A.

    2018-01-01

    Process model matching refers to the automatic identification of corresponding activities between two process models. It represents the basis for many advanced process model analysis techniques such as the identification of similar process parts or process model search. A central problem is how to

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

  2. High reliability solid refractive index matching materials for field installable connections in FTTH network

    Science.gov (United States)

    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.

  3. Study of Atomic Quasi-Stable States, Decoherence And Cooling of Mesoscale Particles

    Science.gov (United States)

    Zhong, Changchun

    Quantum mechanics, since its very beginning, has totally changed the way we understand nature. The past hundred years have seen great successes in the application of quantum physics, including atomic spectra, laser technology, condensed matter physics and the remarkable possibility for quantum computing, etc. This thesis is dedicated to a small regime of quantum physics. In the first part of the thesis, I present the studies of atomic quasi-stable states, which refer to those Rydberg states of an atom that are relatively stable in the presence of strong fields. Through spectrally probing the quasi-stable states, series of survival peaks are found. If the quasi-stable electrons were created by ultraviolet (UV) lasers with two different frequencies, the survival peaks could be modulated by continuously changing the phase difference between the UV and the IR laser. The quantum simulation, through directly solving the Schrodinger equation, matches the experimental results performed with microwave fields, and our studies should provide a guidance for future experiments. Despite the huge achievements in the application of quantum theory, there are still some fundamental problems that remain unresolved. One of them is the so-called quantum-to-classical transition, which refers to the expectation that the system behaves in a more classical manner when the system size increases. This basic question was not well answered until decoherence theory was proposed, which states that the coherence of a quantum system tends to be destroyed by environmental interruptions. Thus, if a system is well isolated from its environment, it is in principle possible to observe macroscopic quantum coherence. Quite recently, testing quantum principles in the macroscale has become a hot topic due to rapic technological developments. A very promising platform for testing macroscale quantum physics is a laser levitated nanoparticle, and cooling its mechanical motion to the ground state is the first

  4. Divorce Costs and Marital Dissolution in a One-to-One Matching Framework With Nontransferable Utilities

    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.

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

  6. Consensus of satellite cluster flight using an energy-matching optimal control method

    Science.gov (United States)

    Luo, Jianjun; Zhou, Liang; Zhang, Bo

    2017-11-01

    This paper presents an optimal control method for consensus of satellite cluster flight under a kind of energy matching condition. Firstly, the relation between energy matching and satellite periodically bounded relative motion is analyzed, and the satellite energy matching principle is applied to configure the initial conditions. Then, period-delayed errors are adopted as state variables to establish the period-delayed errors dynamics models of a single satellite and the cluster. Next a novel satellite cluster feedback control protocol with coupling gain is designed, so that the satellite cluster periodically bounded relative motion consensus problem (period-delayed errors state consensus problem) is transformed to the stability of a set of matrices with the same low dimension. Based on the consensus region theory in the research of multi-agent system consensus issues, the coupling gain can be obtained to satisfy the requirement of consensus region and decouple the satellite cluster information topology and the feedback control gain matrix, which can be determined by Linear quadratic regulator (LQR) optimal method. This method can realize the consensus of satellite cluster period-delayed errors, leading to the consistency of semi-major axes (SMA) and the energy-matching of satellite cluster. Then satellites can emerge the global coordinative cluster behavior. Finally the feasibility and effectiveness of the present energy-matching optimal consensus for satellite cluster flight is verified through numerical simulations.

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

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

    Institute of Scientific and Technical Information of China (English)

    Zhong Sheng; Zhang Tianxu; Sang Nong

    2005-01-01

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

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

  10. Security and matching of partial fingerprint recognition systems

    Science.gov (United States)

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

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

    Science.gov (United States)

    Li, Hongsheng; Huang, Xiaolei; He, Lei

    2013-02-01

    In this paper, we introduce a new matching method based on a novel locally affine-invariant geometric constraint and linear programming techniques. To model and solve the matching problem in a linear programming formulation, all geometric constraints should be able to be exactly or approximately reformulated into a linear form. This is a major difficulty for this kind of matching algorithm. We propose a novel locally affine-invariant constraint which can be exactly linearized and requires a lot fewer auxiliary variables than other linear programming-based methods do. The key idea behind it is that each point in the template point set can be exactly represented by an affine combination of its neighboring points, whose weights can be solved easily by least squares. Errors of reconstructing each matched point using such weights are used to penalize the disagreement of geometric relationships between the template points and the matched points. The resulting overall objective function can be solved efficiently by linear programming techniques. Our experimental results on both rigid and nonrigid object matching show the effectiveness of the proposed algorithm.

  12. A New Model for a Carpool Matching Service.

    Directory of Open Access Journals (Sweden)

    Jizhe Xia

    Full Text Available Carpooling is an effective means of reducing traffic. A carpool team shares a vehicle for their commute, which reduces the number of vehicles on the road during rush hour periods. Carpooling is officially sanctioned by most governments, and is supported by the construction of high-occupancy vehicle lanes. A number of carpooling services have been designed in order to match commuters into carpool teams, but it known that the determination of optimal carpool teams is a combinatorially complex problem, and therefore technological solutions are difficult to achieve. In this paper, a model for carpool matching services is proposed, and both optimal and heuristic approaches are tested to find solutions for that model. The results show that different solution approaches are preferred over different ranges of problem instances. Most importantly, it is demonstrated that a new formulation and associated solution procedures can permit the determination of optimal carpool teams and routes. An instantiation of the model is presented (using the street network of Guangzhou city, China to demonstrate how carpool teams can be determined.

  13. Pemberian Kredit Pada Koperasi Menggunakan Metode Profile Matching

    Directory of Open Access Journals (Sweden)

    Budi Sudradjat

    2017-09-01

    Abstract Cooperatives is an institution economic have function in the process of the increase in community welfare, Travel cooperatives not easy to reach position like now. The existence of movement cooperatives as an institution economic expected to act as propulsion engine national economic activity as well as soko teachers the country economy. Bhakti BPJS Kesehatan Service Cooperative is a cooperative engaged in services, forms of cooperative services to the community one is to lend funds (credit to help resolve the financial problems in the community. In granting the credit cooperatives need to do proper research and calculations to prospective customers who will take credit cooperatives, to avoid mistakes in decision making required data processing is fast, precise and accurate. With the Application Profile Matching Method For Determining Eligibility Lending In BPJS Kesehatan Service Cooperative Bhakti is the best solution to solve the problems that exist in this company, because with this method the decision taken by the cooperative members have been more thorough and detailed than the previous.   Keywords: Decision Support Systems, Profile Matching, The feasibility of the provision of credit.

  14. Boundary Between Stable and Unstable Regimes of Accretion

    Directory of Open Access Journals (Sweden)

    Blinova A. A.

    2014-01-01

    Full Text Available We investigated the boundary between stable and unstable regimes of accretion and its dependence on different parameters. Simulations were performed using a “cubed sphere" code with high grid resolution (244 grid points in the azimuthal direction, which is twice as high as that used in our earlier studies. We chose a very low viscosity value, with alpha-parameter α=0.02. We observed from the simulations that the boundary strongly depends on the ratio between magnetospheric radius rm (where the magnetic stress in the magnetosphere matches the matter stress in the disk and corotation radius rcor (where the Keplerian velocity in the disk is equal to the angular velocity of the star. For a small misalignment angle of the dipole field, Θ = 5°, accretion is unstable if rcor/rm> 1.35, and is stable otherwise. In cases of a larger misalignment angle of the dipole, Θ = 20°, instability occurs at slightly larger values, rcor/rm> 1.41

  15. PRACTICAL APPLICATION OF MATCHING ALGORITHMS IN CASE OF A TASK ALLOCATION PROBLEM

    Directory of Open Access Journals (Sweden)

    Péter Szikora

    2015-04-01

    Full Text Available Conflicts between individuals or even groups of people are part of everyday social life. However, when handling conflict situations successfully, conflicts are actually solved. In order to achieve such resolution, parties should separate the conflict from the involved people and try to create a cooperative, nonzero-sum mind set concentrating on interests and not on positions - agreeing on principles like using a fair standard and a fair procedure. In present paper such impartial standards and procedures - namely matching theory algorithms - that concentrate on factual controversies are introduced.

  16. Using crosswell data to enhance history matching

    KAUST Repository

    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.

  17. Many-to-one blind matching for device-to-device communications

    KAUST Repository

    Hamza, Doha R.; Shamma, Jeff S.

    2018-01-01

    -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

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

  19. Wage Differentials in the Presence of Unobserved Worker, Firm, and Match Heterogeneity

    OpenAIRE

    Woodcock, Simon

    2006-01-01

    We consider the problem of estimating and decomposing wage differentials in the presence of unobserved worker, firm, and match heterogeneity. Controlling for these unobservables corrects omitted variable bias in previous studies. It also allows us to measure the contribution of unmeasured characteristics of workers, firms, and worker-firm matches to observed wage differentials. An application to linked employer-employee data shows that decompositions of inter-industry earnings differentials a...

  20. Fuzzy Matching Based on Gray-scale Difference for Quantum Images

    Science.gov (United States)

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

    2018-05-01

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

  1. Different Loci of Semantic Interference in Picture Naming vs. Word-Picture Matching Tasks.

    Science.gov (United States)

    Harvey, Denise Y; Schnur, Tatiana T

    2016-01-01

    Naming pictures and matching words to pictures belonging to the same semantic category impairs performance relative to when stimuli come from different semantic categories (i.e., semantic interference). Despite similar semantic interference phenomena in both picture naming and word-picture matching tasks, the locus of interference has been attributed to different levels of the language system - lexical in naming and semantic in word-picture matching. Although both tasks involve access to shared semantic representations, the extent to which interference originates and/or has its locus at a shared level remains unclear, as these effects are often investigated in isolation. We manipulated semantic context in cyclical picture naming and word-picture matching tasks, and tested whether factors tapping semantic-level (generalization of interference to novel category items) and lexical-level processes (interactions with lexical frequency) affected the magnitude of interference, while also assessing whether interference occurs at a shared processing level(s) (transfer of interference across tasks). We found that semantic interference in naming was sensitive to both semantic- and lexical-level processes (i.e., larger interference for novel vs. old and low- vs. high-frequency stimuli), consistent with a semantically mediated lexical locus. Interference in word-picture matching exhibited stable interference for old and novel stimuli and did not interact with lexical frequency. Further, interference transferred from word-picture matching to naming. Together, these experiments provide evidence to suggest that semantic interference in both tasks originates at a shared processing stage (presumably at the semantic level), but that it exerts its effect at different loci when naming pictures vs. matching words to pictures.

  2. Match them, if you can! The similarity between brand personality and endorser personality as determinant of perceived fit and purchase intentions

    OpenAIRE

    Bekk, Magdalena; Spörrle, Matthias; Felser, Georg

    2009-01-01

    Objectives. The match-up hypothesis states that endorsements will be more effective in advertisements when there is congruence between endorser (i.e., a celebrity) and endorsed product (e.g., Till & Busler, 2000). Unlike most previous research, which has mainly dealt with attractiveness and expertise, this study examines the match-up hypothesis based on personality. Methods. The three cross-culturally stable (sincerity, excitement, sophistication; Aaker, Benet-Martinez, & Garolera, 2001) ...

  3. Precision 3d Surface Reconstruction from Lro Nac Images Using Semi-Global Matching with Coupled Epipolar Rectification

    Science.gov (United States)

    Hu, H.; Wu, B.

    2017-07-01

    The Narrow-Angle Camera (NAC) on board the Lunar Reconnaissance Orbiter (LRO) comprises of a pair of closely attached high-resolution push-broom sensors, in order to improve the swath coverage. However, the two image sensors do not share the same lenses and cannot be modelled geometrically using a single physical model. Thus, previous works on dense matching of stereo pairs of NAC images would generally create two to four stereo models, each with an irregular and overlapping region of varying size. Semi-Global Matching (SGM) is a well-known dense matching method and has been widely used for image-based 3D surface reconstruction. SGM is a global matching algorithm relying on global inference in a larger context rather than individual pixels to establish stable correspondences. The stereo configuration of LRO NAC images causes severe problem for image matching methods such as SGM, which emphasizes global matching strategy. Aiming at using SGM for image matching of LRO NAC stereo pairs for precision 3D surface reconstruction, this paper presents a coupled epipolar rectification methods for LRO NAC stereo images, which merges the image pair in the disparity space and in this way, only one stereo model will be estimated. For a stereo pair (four) of NAC images, the method starts with the boresight calibration by finding correspondence in the small overlapping stripe between each pair of NAC images and bundle adjustment of the stereo pair, in order to clean the vertical disparities. Then, the dominate direction of the images are estimated by project the center of the coverage area to the reference image and back-projected to the bounding box plane determined by the image orientation parameters iteratively. The dominate direction will determine an affine model, by which the pair of NAC images are warped onto the object space with a given ground resolution and in the meantime, a mask is produced indicating the owner of each pixel. SGM is then used to generate a disparity

  4. PRECISION 3D SURFACE RECONSTRUCTION FROM LRO NAC IMAGES USING SEMI-GLOBAL MATCHING WITH COUPLED EPIPOLAR RECTIFICATION

    Directory of Open Access Journals (Sweden)

    H. Hu

    2017-07-01

    Full Text Available The Narrow-Angle Camera (NAC on board the Lunar Reconnaissance Orbiter (LRO comprises of a pair of closely attached high-resolution push-broom sensors, in order to improve the swath coverage. However, the two image sensors do not share the same lenses and cannot be modelled geometrically using a single physical model. Thus, previous works on dense matching of stereo pairs of NAC images would generally create two to four stereo models, each with an irregular and overlapping region of varying size. Semi-Global Matching (SGM is a well-known dense matching method and has been widely used for image-based 3D surface reconstruction. SGM is a global matching algorithm relying on global inference in a larger context rather than individual pixels to establish stable correspondences. The stereo configuration of LRO NAC images causes severe problem for image matching methods such as SGM, which emphasizes global matching strategy. Aiming at using SGM for image matching of LRO NAC stereo pairs for precision 3D surface reconstruction, this paper presents a coupled epipolar rectification methods for LRO NAC stereo images, which merges the image pair in the disparity space and in this way, only one stereo model will be estimated. For a stereo pair (four of NAC images, the method starts with the boresight calibration by finding correspondence in the small overlapping stripe between each pair of NAC images and bundle adjustment of the stereo pair, in order to clean the vertical disparities. Then, the dominate direction of the images are estimated by project the center of the coverage area to the reference image and back-projected to the bounding box plane determined by the image orientation parameters iteratively. The dominate direction will determine an affine model, by which the pair of NAC images are warped onto the object space with a given ground resolution and in the meantime, a mask is produced indicating the owner of each pixel. SGM is then used to

  5. Learning Expressive Linkage Rules for Entity Matching using Genetic Programming

    OpenAIRE

    Isele, Robert

    2013-01-01

    A central problem in data integration and data cleansing is to identify pairs of entities in data sets that describe the same real-world object. Many existing methods for matching entities rely on explicit linkage rules, which specify how two entities are compared for equivalence. Unfortunately, writing accurate linkage rules by hand is a non-trivial problem that requires detailed knowledge of the involved data sets. Another important issue is the efficient execution of link...

  6. Cognitive function in patients with stable coronary heart disease: Related cerebrovascular and cardiovascular responses.

    Science.gov (United States)

    Gayda, Mathieu; Gremeaux, Vincent; Bherer, Louis; Juneau, Martin; Drigny, Joffrey; Dupuy, Olivier; Lapierre, Gabriel; Labelle, Véronique; Fortier, Annik; Nigam, Anil

    2017-01-01

    Chronic exercise has been shown to prevent or slow age-related decline in cognitive functions in otherwise healthy, asymptomatic individuals. We sought to assess cognitive function in a stable coronary heart disease (CHD) sample and its relationship to cerebral oxygenation-perfusion, cardiac hemodynamic responses, and [Formula: see text] peak compared to age-matched and young healthy control subjects. Twenty-two young healthy controls (YHC), 20 age-matched old healthy controls (OHC) and 25 patients with stable CHD were recruited. Cognitive function assessment included short term-working memory, perceptual abilities, processing speed, cognitive inhibition and flexibility and long-term verbal memory. Maximal cardiopulmonary function (gas exchange analysis), cardiac hemodynamic (impedance cardiography) and left frontal cerebral oxygenation-perfusion (near-infra red spectroscopy) were measured during and after a maximal incremental ergocycle test. Compared to OHC and CHD, YHC had higher [Formula: see text] peak, maximal cardiac index (CI max), cerebral oxygenation-perfusion (ΔO2 Hb, ΔtHb: exercise and recovery) and cognitive function (for all items) (Pcognitive inhibition and flexibility and long-term verbal memory (Pcognitive function (Pcognitive function (Pcognitive function, a similar cerebral oxygenation/perfusion during exercise but reduced one during recovery vs. their aged-matched healthy counterparts. In the all sample, cognitive functions correlated with [Formula: see text] peak, CI max and cerebral oxygenation-perfusion.

  7. Cognitive function in patients with stable coronary heart disease: Related cerebrovascular and cardiovascular responses.

    Directory of Open Access Journals (Sweden)

    Mathieu Gayda

    Full Text Available Chronic exercise has been shown to prevent or slow age-related decline in cognitive functions in otherwise healthy, asymptomatic individuals. We sought to assess cognitive function in a stable coronary heart disease (CHD sample and its relationship to cerebral oxygenation-perfusion, cardiac hemodynamic responses, and [Formula: see text] peak compared to age-matched and young healthy control subjects. Twenty-two young healthy controls (YHC, 20 age-matched old healthy controls (OHC and 25 patients with stable CHD were recruited. Cognitive function assessment included short term-working memory, perceptual abilities, processing speed, cognitive inhibition and flexibility and long-term verbal memory. Maximal cardiopulmonary function (gas exchange analysis, cardiac hemodynamic (impedance cardiography and left frontal cerebral oxygenation-perfusion (near-infra red spectroscopy were measured during and after a maximal incremental ergocycle test. Compared to OHC and CHD, YHC had higher [Formula: see text] peak, maximal cardiac index (CI max, cerebral oxygenation-perfusion (ΔO2 Hb, ΔtHb: exercise and recovery and cognitive function (for all items (P<0.05. Compared to OHC, CHD patients had lower [Formula: see text] peak, CI max, cerebral oxygenation-perfusion (during recovery and short term-working memory, processing speed, cognitive inhibition and flexibility and long-term verbal memory (P<0.05. [Formula: see text] peak and CI max were related to exercise cerebral oxygenation-perfusion and cognitive function (P<0.005. Cerebral oxygenation-perfusion (exercise was related to cognitive function (P<0.005. Stable CHD patients have a worse cognitive function, a similar cerebral oxygenation/perfusion during exercise but reduced one during recovery vs. their aged-matched healthy counterparts. In the all sample, cognitive functions correlated with [Formula: see text] peak, CI max and cerebral oxygenation-perfusion.

  8. Stable convergence and stable limit theorems

    CERN Document Server

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

  9. Improved Feature Matching for Mobile Devices with IMU

    Directory of Open Access Journals (Sweden)

    Andrea Masiero

    2016-08-01

    Full Text Available Thanks to the recent diffusion of low-cost high-resolution digital cameras and to the development of mostly automated procedures for image-based 3D reconstruction, the popularity of photogrammetry for environment surveys is constantly increasing in the last years. Automatic feature matching is an important step in order to successfully complete the photogrammetric 3D reconstruction: this step is the fundamental basis for the subsequent estimation of the geometry of the scene. This paper reconsiders the feature matching problem when dealing with smart mobile devices (e.g., when using the standard camera embedded in a smartphone as imaging sensor. More specifically, this paper aims at exploiting the information on camera movements provided by the inertial navigation system (INS in order to make the feature matching step more robust and, possibly, computationally more efficient. First, a revised version of the affine scale-invariant feature transform (ASIFT is considered: this version reduces the computational complexity of the original ASIFT, while still ensuring an increase of correct feature matches with respect to the SIFT. Furthermore, a new two-step procedure for the estimation of the essential matrix E (and the camera pose is proposed in order to increase its estimation robustness and computational efficiency.

  10. Effective anisotropy through traveltime and amplitude matching

    KAUST Repository

    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.

  11. Energy stable and high-order-accurate finite difference methods on staggered grids

    Science.gov (United States)

    O'Reilly, Ossian; Lundquist, Tomas; Dunham, Eric M.; Nordström, Jan

    2017-10-01

    For wave propagation over distances of many wavelengths, high-order finite difference methods on staggered grids are widely used due to their excellent dispersion properties. However, the enforcement of boundary conditions in a stable manner and treatment of interface problems with discontinuous coefficients usually pose many challenges. In this work, we construct a provably stable and high-order-accurate finite difference method on staggered grids that can be applied to a broad class of boundary and interface problems. The staggered grid difference operators are in summation-by-parts form and when combined with a weak enforcement of the boundary conditions, lead to an energy stable method on multiblock grids. The general applicability of the method is demonstrated by simulating an explosive acoustic source, generating waves reflecting against a free surface and material discontinuity.

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

  13. Use of stable isotopes in developing countries: safe markers for nutrition regime study

    International Nuclear Information System (INIS)

    Klein, P.D.; Klein, E.R.

    1987-01-01

    Possible use of stable radioisotopes in studies on nutrition and medicine problems that may be used in investigations of babies, children, pregnant women is shown. Attention is paid to behaviour of limited number of elements: hydrogen, carbon, nitrogen, oxygen. The IAEA plans implementation of a new coordinated research program on use of stable isotopes for studying nutrition problems and related diseases. The program emphasis will be placed on protein metabolism measurements and estimation of energy consumption in control population groups in developing countries

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

    Directory of Open Access Journals (Sweden)

    Guofeng Tong

    2014-04-01

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

  15. Magnetic safety matches

    Science.gov (United States)

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

    2017-07-01

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

  16. The separation of stable water-in-oil emulsions

    International Nuclear Information System (INIS)

    Velicogna, D.; Koundakjiian, A.; Beausejour, I.

    1993-01-01

    Stable oil-in-water emulsions are a major problem in the recovery of spilled oils. Such emulsions can contain as little as 10% oil and can have properties very different from the original oils, making their storage and disposal difficult. These problems have led to experiments testing the feasibility of a process for separating these stable emulsions into dischargeable water and reusable oil. The technique investigated involves use of a recyclable solvent to remove the oil and subsequent distillation and/or membrane treatment to recover the oil and recycle the solvent. Results of preliminary tests show that stable water-in-oil emulsions can be separated quite readily with a regenerated solvent system. The only products of these systems are oil, which can be sent to a refinery, and dischargeable water. The recycled solvent can be used many times without any significant decrease in separation efficiency. In order to enhance the throughput of the system, a solvent vapor stripping method was invented. This stripping method also improves the quality of the products and the recycled solvent. Membrane methods can be used as a post-treatment for the produced water in order to achieve more adequate compliance with discharge limits. 4 refs., 3 figs., 5 tabs

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

  18. FPFH-based graph matching for 3D point cloud registration

    Science.gov (United States)

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

    2018-04-01

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

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

    International Nuclear Information System (INIS)

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

    1985-01-01

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

  20. THE EFFECT OF IMAGE ENHANCEMENT METHODS DURING FEATURE DETECTION AND MATCHING OF THERMAL IMAGES

    Directory of Open Access Journals (Sweden)

    O. Akcay

    2017-05-01

    Full Text Available A successful image matching is essential to provide an automatic photogrammetric process accurately. Feature detection, extraction and matching algorithms have performed on the high resolution images perfectly. However, images of cameras, which are equipped with low-resolution thermal sensors are problematic with the current algorithms. In this paper, some digital image processing techniques were applied to the low-resolution images taken with Optris PI 450 382 x 288 pixel optical resolution lightweight thermal camera to increase extraction and matching performance. Image enhancement methods that adjust low quality digital thermal images, were used to produce more suitable images for detection and extraction. Three main digital image process techniques: histogram equalization, high pass and low pass filters were considered to increase the signal-to-noise ratio, sharpen image, remove noise, respectively. Later on, the pre-processed images were evaluated using current image detection and feature extraction methods Maximally Stable Extremal Regions (MSER and Speeded Up Robust Features (SURF algorithms. Obtained results showed that some enhancement methods increased number of extracted features and decreased blunder errors during image matching. Consequently, the effects of different pre-process techniques were compared in the paper.

  1. Collaboratively Conceived, Designed and Implemented: Matching Visualization Tools with Geoscience Data Collections and Geoscience Data Collections with Visualization Tools via the ToolMatch Service.

    Science.gov (United States)

    Hoebelheinrich, N. J.; Lynnes, C.; West, P.; Ferritto, M.

    2014-12-01

    Two problems common to many geoscience domains are the difficulties in finding tools to work with a given dataset collection, and conversely, the difficulties in finding data for a known tool. A collaborative team from the Earth Science Information Partnership (ESIP) has gotten together to design and create a web service, called ToolMatch, to address these problems. The team began their efforts by defining an initial, relatively simple conceptual model that addressed the two uses cases briefly described above. The conceptual model is expressed as an ontology using OWL (Web Ontology Language) and DCterms (Dublin Core Terms), and utilizing standard ontologies such as DOAP (Description of a Project), FOAF (Friend of a Friend), SKOS (Simple Knowledge Organization System) and DCAT (Data Catalog Vocabulary). The ToolMatch service will be taking advantage of various Semantic Web and Web standards, such as OpenSearch, RESTful web services, SWRL (Semantic Web Rule Language) and SPARQL (Simple Protocol and RDF Query Language). The first version of the ToolMatch service was deployed in early fall 2014. While more complete testing is required, a number of communities besides ESIP member organizations have expressed interest in collaborating to create, test and use the service and incorporate it into their own web pages, tools and / or services including the USGS Data Catalog service, DataONE, the Deep Carbon Observatory, Virtual Solar Terrestrial Observatory (VSTO), and the U.S. Global Change Research Program. In this session, presenters will discuss the inception and development of the ToolMatch service, the collaborative process used to design, refine, and test the service, and future plans for the service.

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

  3. Social matching of food intake and the need for social acceptance.

    Science.gov (United States)

    Robinson, Eric; Tobias, Talia; Shaw, Lucy; Freeman, Elyse; Higgs, Suzanne

    2011-06-01

    In a social eating context individuals tend to match their food intake to that of eating companions, regardless of whether the other person is eating a large amount. However, relatively little is known about the underlying processes of food intake matching. Findings from behavioural mimicry research suggest that individuals may copy how those around them act in order to facilitate social interactions and ingratiate themselves. The present paper reports two studies which were designed to examine whether ingratiation strategies may in part explain social matching of food intake in young females. In Study 1, female dyads completed a problem solving task together whilst having access to chocolate M&M's. We hypothesised that the extent to which individuals have a need to be socially accepted (trait self esteem) and are competent in social interactions (trait empathy) would predict the degree of matching. In Study 2 we directly manipulated the desire to ingratiate by priming social acceptance in half of participants prior to eating popcorn in the presence of a high eating confederate. In Study 1, both self esteem and empathy were associated with degree of matching within female dyads. In Study 2, priming social acceptance reduced the matching effect in females. These findings suggest that desire for social acceptance may be an underlying cause of social matching of food intake. Copyright © 2011 Elsevier Ltd. All rights reserved.

  4. Incentive compatibility in kidney exchange problems.

    Science.gov (United States)

    Villa, Silvia; Patrone, Fioravante

    2009-12-01

    The problem of kidney exchanges shares common features with the classical problem of exchange of indivisible goods studied in the mechanism design literature, while presenting additional constraints on the size of feasible exchanges. The solution of a kidney exchange problem can be summarized in a mapping from the relevant underlying characteristics of the players (patients and their donors) to the set of matchings. The goal is to select only matchings maximizing a chosen welfare function. Since the final outcome heavily depends on the private information in possess of the players, a basic requirement in order to reach efficiency is the truthful revelation of this information. We show that for the kidney exchange problem, a class of (in principle) efficient mechanisms does not enjoy the incentive compatibility property and therefore is subject to possible manipulations made by the players in order to profit of the misrepresentation of their private information.

  5. High-Order Entropy Stable Finite Difference Schemes for Nonlinear Conservation Laws: Finite Domains

    Science.gov (United States)

    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.

  6. An Analysis and Application of Fast Nonnegative Orthogonal Matching Pursuit for Image Categorization in Deep Networks

    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.

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

  8. Optimization methods for the Train Unit Shunting Problem

    DEFF Research Database (Denmark)

    Haahr, Jørgen Thorlund; Lusby, Richard Martin; Wagenaar, Joris Camiel

    2017-01-01

    We consider the Train Unit Shunting Problem, an important planning problem for passenger railway operators. This problem entails assigning train units from shunting yards to scheduled train services in such a way that the resulting operations are without conflicts. The problem arises at every...... shunting yard in the railway network and involves matching train units to arriving and departing train services as well as assigning the selected matchings to appropriate shunting yard tracks. We present an extensive comparison benchmark of multiple solution approaches for this problem, some of which...... are novel. In particular, we develop a constraint programming formulation, a column generation approach, and a randomized greedy heuristic. We compare and benchmark these approaches with two existing methods, a mixed integer linear program and a two-stage heuristic. The benchmark contains multiple real...

  9. Leader Derailment in Academe: Does the Training Match the Problems?

    Science.gov (United States)

    Williams, Feruzan Irani; Campbell, Constance; McCartney, William; Gooding, Carl

    2012-01-01

    Leader derailment of middle managers in higher education is most often attributable to self-defeating behaviors (SDBs) and problems with interpersonal relationships (PIRs). This study attempted to determine whether training provided for middle managers in Academe sufficiently addresses these issues. Our findings suggest that while little more than…

  10. New robust stable MPC using linear matrix inequalities

    Directory of Open Access Journals (Sweden)

    M.A. Rodrigues

    2000-03-01

    Full Text Available This paper addresses the stability of Model Predictive Control (MPC with output feedback. The proposed controller uses a new state-space formulation of the system, and the control problem is presented as an LMI optimization problem. The stability condition for the closed loop is included as a Lyapunov inequality. The resulting optimization problem becomes nonlinear with the inclusion of the stabilizing condition. A suboptimal solution is developed and the problem reduces to a pair of coupled LMI problems. An iterative solution that converges to a stable output feedback gain is proposed. A polytopic set of process models can be considered. A simulation example is included in the paper and shows that the proposed strategy eliminates the usual practice of enforcing robustness by detuning the MP controller.

  11. Pattern formation without diffraction matching in optical parametric oscillators with a metamaterial.

    Science.gov (United States)

    Tassin, Philippe; Van der Sande, Guy; Veretennicoff, Irina; Kockaert, Pascal; Tlidi, Mustapha

    2009-05-25

    We consider a degenerate optical parametric oscillator containing a left-handed material. We show that the inclusion of a left-handed material layer allows for controlling the strength and sign of the diffraction coefficient at either the pump or the signal frequency. Subsequently, we demonstrate the existence of stable dissipative structures without diffraction matching, i.e., without the usual relationship between the diffraction coefficients of the signal and pump fields. Finally, we investigate the size scaling of these light structures with decreasing diffraction strength.

  12. The Fears, Phobias and Anxieties of Children with Autism Spectrum Disorders and Down Syndrome: Comparisons with Developmentally and Chronologically Age Matched Children

    Science.gov (United States)

    Evans, David W.; Canavera, Kristin; Kleinpeter, F. Lee; Maccubbin, Elise; Taga, Ken

    2005-01-01

    This study compared the fears and behavior problems of 25 children with an autism spectrum disorder (ASD), 43 children with Down syndrome (DS), 45 mental age (MA) matched children, and 37 chronologically age (CA) matched children. Children's fears, phobias, anxieties and behavioral problems were assessed using parent reports. Significant…

  13. Fast Arc-Annotated Subsequence Matching in Linear Space

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li

    2012-01-01

    for investigating the function of RNA molecules. Gramm et al. (ACM Trans. Algorithms 2(1): 44-65, 2006) gave an algorithm for this problem using O(nm) time and space, where m and n are the lengths of P and Q, respectively. In this paper we present a new algorithm using O(nm) time and O(n+m) space, thereby matching......-annotated strings. © 2010 Springer Science+Business Media, LLC....

  14. Social welfare in one-sided matchings: Random priority and beyond

    DEFF Research Database (Denmark)

    Filos-Ratsikas, Aris; Frederiksen, Søren Kristoffer Stiil; Zhang, Jie

    2014-01-01

    We study the problem of approximate social welfare maximization (without money) in one-sided matching problems when agents have unrestricted cardinal preferences over a finite set of items. Random priority is a very well-known truthful-in-expectation mechanism for the problem. We prove...... that the approximation ratio of random priority is Theta(n^{-1/2}) while no truthful-in-expectation mechanism can achieve an approximation ratio better than O(n^{-1/2}), where n is the number of agents and items. Furthermore, we prove that the approximation ratio of all ordinal (not necessarily truthful......-in-expectation) mechanisms is upper bounded by O(n^{-1/2}), indicating that random priority is asymptotically the best truthful-in-expectation mechanism and the best ordinal mechanism for the problem....

  15. Simultaneous measurement of refractive index and temperature based on intensity demodulation using matching grating method.

    Science.gov (United States)

    Qi, Liang; Zhao, Chun-Liu; Kang, Juan; Jin, Yongxing; Wang, Jianfeng; Ye, Manping; Jin, Shangzhong

    2013-07-01

    A solution refractive index (SRI) and temperature simultaneous measurement sensor with intensity-demodulation system based on matching grating method were demonstrated. Long period grating written in a photonic crystal fiber (LPG-PCF), provides temperature stable and wavelength dependent optical intensity transmission. The reflective peaks of two fiber Bragg gratings (FBGs), one of which is etched then sensitive to both SRI and temperature, another (FBG2) is only sensitive to temperature, were located in the same linear range of the LPG-PCF's transmission spectrum. An identical FBG with FBG2 was chosen as a matching FBG. When environments (SRI and temperature) change, the wavelength shifts of the FBGs are translated effectively to the reflection intensity changes. By monitoring output lights of unmatching and matching paths, the SRI and temperature were deduced by a signal processing unit. Experimental results show that the simultaneous refractive index and temperature measurement system work well. The proposed sensor system is compact and suitable for in situ applications at lower cost.

  16. A Mobile, Dynamic, and Privacy-Preserving Matching System for Car and Taxi Pools

    Directory of Open Access Journals (Sweden)

    Shin-Yan Chiou

    2014-01-01

    Full Text Available Recently, rates of vehicle ownership have risen globally, exacerbating problems including air pollution, lack of parking, and traffic congestion. While many solutions to these problems have been proposed, carpooling remains one of the most effective approaches. Recently, several carpooling platforms have been built on cloud computing systems, with originators posting online list of departure/arrival points and schedules from which participants can search for rides that match their needs. However, it can be difficult to make matches quickly and the systems are subject to privacy concerns in that they may disclose private information such as names, registration data, and departure/arrival schedules. This paper proposes a dynamic matching method for car/taxi pools for use in mobile devices via ad hoc Wi-Fi networks. The proposed method also preserves user privacy including names and departure/arrival schedules. Moreover, the system does not require the user to register any personal data, so such data cannot be leaked. The system was implemented on the Android mobile platform, allowing users to immediately and securely access the system via their smart phones.

  17. Increasing the effectiveness of messages promoting responsible undergraduate drinking: tailoring to personality and matching to context.

    Science.gov (United States)

    York, Valerie K; Brannon, Laura A; Miller, Megan M

    2012-01-01

    This study addressed the serious problem of college student binge drinking by identifying factors that improve the effectiveness of messages encouraging responsible drinking presented through a website simulation. We tested schema matching (i.e., whether the message matches the person's self-schema type or not) and two types of context matching (i.e., whether the message matches the topic or values of the message context) to determine their relative influence on the effectiveness of the message. We expected that messages matched to any of these factors would be more effective than messages not matched. Schema matching reduced intentions to drink while staying in/home, but topic matching reduced intentions to drink when going out, suggesting that different factors are important for messages targeting drinking behavior in different locations. Significant interactions between topic matching and value matching on message evaluation variables indicated that the message should not match the message context too closely. That is, there appears to be a matching threshold: Increasing the number of factors the message matches does not increase message effectiveness, possibly because it makes the message too redundant with the surrounding content.

  18. Perturbed asymptotically linear problems

    OpenAIRE

    Bartolo, R.; Candela, A. M.; Salvatore, A.

    2012-01-01

    The aim of this paper is investigating the existence of solutions of some semilinear elliptic problems on open bounded domains when the nonlinearity is subcritical and asymptotically linear at infinity and there is a perturbation term which is just continuous. Also in the case when the problem has not a variational structure, suitable procedures and estimates allow us to prove that the number of distinct crtitical levels of the functional associated to the unperturbed problem is "stable" unde...

  19. COMBINING SOURCES IN STABLE ISOTOPE MIXING MODELS: ALTERNATIVE METHODS

    Science.gov (United States)

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

  20. A life course perspective on mental health problems, employment, and work outcomes.

    Science.gov (United States)

    Veldman, Karin; Reijneveld, Sijmen A; Verhulst, Frank C; Ortiz, Josue Almansa; Bültmann, Ute

    2017-07-01

    Objectives Little is known about how employment and work outcomes among young adults are influenced by their life-course history of mental health problems. Therefore, the aims of this study were to (i) identify trajectories of mental health problems from childhood to young adulthood and (ii) investigate the association between these trajectories and employment and work outcomes among young adults. Methods Data were used from 360 participants of the Tracking Adolescents' Individual Lives Survey (TRAILS), a Dutch prospective cohort study, with 12-year follow-up. Trajectories of externalizing and internalizing problems were identified with latent class growth models. Employment conditions and work outcomes (ie, psychosocial work characteristics) were measured at age 22. We assessed the association between mental health trajectories and employment conditions and work outcomes. Results Four trajectories of mental health problems were identified: high-stable, decreasing, moderate-stable and low-stable. Young adults with high-stable trajectories of externalizing problems worked over six hours more [B=6.71, 95% confidence interval (95% CI) 2.82-10.6] and had a higher income [odds ratio (OR) 0.33, 95% CI 0.15-0.71], than young adults with low-stable trajectories. Young adults with high-stable trajectories of internalizing problems worked six hours less per week (B=-6.07, 95% CI -10.1- -2.05) and reported lower income (OR 3.44, 95% CI 1.53-7.74) and poorer psychosocial work characteristics, compared to young adults with low-stable trajectories. Conclusions Among young adults who had a paid job at the age of 22 (and were not a student or unemployed), those with a history of internalizing problems are less likely to transition successfully into the labor market, compared to other young adults.

  1. [Propensity score matching in SPSS].

    Science.gov (United States)

    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.

  2. Multi-patch matching for person re-identification

    Science.gov (United States)

    Labidi, Hocine; Luo, Sen-Lin; Boubekeur, Mohamed B.; Benlefki, Tarek

    2015-08-01

    Recognizing a target object across non-overlapping distributed cameras is known in the computer vision community as the problem of person re-identification. In this paper, a multi-patch matching method for person reidentification is presented. Starting from the assumption that: the appearance (clothes) of a person does not change during the time of passing in different cameras field of view , which means the regions with the same color in target image will be identical while crossing cameras. First, we extract distinctive features in the training procedure, where each image target is devised into small patches, the SIFT features and LAB color histograms are computed for each patch. Then we use the KNN approach to detect group of patches with high similarity in the target image and then we use a bi-directional weighted group matching mechanism for the re-identification. Experiments on a challenging VIPeR dataset show that the performances of the proposed method outperform several baselines and state of the art approaches.

  3. Target Matching Recognition for Satellite Images Based on the Improved FREAK Algorithm

    Directory of Open Access Journals (Sweden)

    Yantong Chen

    2016-01-01

    Full Text Available Satellite remote sensing image target matching recognition exhibits poor robustness and accuracy because of the unfit feature extractor and large data quantity. To address this problem, we propose a new feature extraction algorithm for fast target matching recognition that comprises an improved feature from accelerated segment test (FAST feature detector and a binary fast retina key point (FREAK feature descriptor. To improve robustness, we extend the FAST feature detector by applying scale space theory and then transform the feature vector acquired by the FREAK descriptor from decimal into binary. We reduce the quantity of data in the computer and improve matching accuracy by using the binary space. Simulation test results show that our algorithm outperforms other relevant methods in terms of robustness and accuracy.

  4. Parent-reported problem behavior among children with sensory disabilities attending elementary regular schools

    NARCIS (Netherlands)

    Maes, B; Grietens, H

    2004-01-01

    Parent-reported problem behaviors of 94 children with visual and auditory disabilities, attending elementary regular schools, were compared with problems reported in a general population sample of nondisabled children. Both samples were matched by means of a pairwise matching procedure, taking into

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

  6. A nonlinear oscillatory problem

    International Nuclear Information System (INIS)

    Zhou Qingqing.

    1991-10-01

    We have studied the nonlinear oscillatory problem of orthotropic cylindrical shell, we have analyzed the character of the oscillatory system. The stable condition of the oscillatory system has been given. (author). 6 refs

  7. Stable confinement of toroidal electron plasma in an internal conductor device Prototype-Ring Trap

    International Nuclear Information System (INIS)

    Saitoh, H.; Yoshida, Z.; Watanabe, S.

    2005-01-01

    A pure electron plasma has been produced in an internal conductor device Prototype-Ring Trap (Proto-RT). The temporal evolution of the electron plasma was investigated by the measurement of electrostatic fluctuations. Stable confinement was realized when the potential profile adjusted to match the magnetic surfaces. The confinement time varies as a function of the magnetic field strength and the neutral gas pressure, and is comparable to the diffusion time of electrons determined by the classical collisions with neutral gas. Although the addition of a toroidal magnetic field stabilized the electrostatic fluctuation of the plasma, the effects of the magnetic shear shortened the stable confinement time, possibly because of the obstacles of coil support structures

  8. On Resolution Complexity of Matching Principles

    DEFF Research Database (Denmark)

    Dantchev, Stefan S.

    proof system. The results in the thesis fall in this category. We study the Resolution complexity of some Matching Principles. The three major contributions of the thesis are as follows. Firstly, we develop a general technique of proving resolution lower bounds for the perfect matchingprinciples based...... Chessboard as well as for Tseitin tautologies based on rectangular grid graph. We reduce these problems to Tiling games, a concept introduced by us, which may be of interest on its own. Secondly, we find the exact Tree-Resolution complexity of the Weak Pigeon-Hole Principle. It is the most studied...

  9. High precision and stable structures for particle detectors

    CERN Document Server

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

  10. Developmental improvement and age-related decline in unfamiliar face matching.

    Science.gov (United States)

    Megreya, Ahmed M; Bindemann, Markus

    2015-01-01

    Age-related changes have been documented widely in studies of face recognition and eyewitness identification. However, it is not clear whether these changes arise from general developmental differences in memory or occur specifically during the perceptual processing of faces. We report two experiments to track such perceptual changes using a 1-in- 10 (experiment 1) and 1-in-1 (experiment 2) matching task for unfamiliar faces. Both experiments showed improvements in face matching during childhood and adult-like accuracy levels by adolescence. In addition, face-matching performance declined in adults of the age of 65 years. These findings indicate that developmental improvements and aging-related differences in face processing arise from changes in the perceptual encoding of faces. A clear face inversion effect was also present in all age groups. This indicates that those age-related changes in face matching reflect a quantitative effect, whereby typical face processes are engaged but do not operate at the best-possible level. These data suggest that part of the problem of eyewitness identification in children and elderly persons might reflect impairments in the perceptual processing of unfamiliar faces.

  11. Entropy-Weighted Instance Matching Between Different Sourcing Points of Interest

    Directory of Open Access Journals (Sweden)

    Lin Li

    2016-01-01

    Full Text Available The crucial problem for integrating geospatial data is finding the corresponding objects (the counterpart from different sources. Most current studies focus on object matching with individual attributes such as spatial, name, or other attributes, which avoids the difficulty of integrating those attributes, but at the cost of an ineffective matching. In this study, we propose an approach for matching instances by integrating heterogeneous attributes with the allocation of suitable attribute weights via information entropy. First, a normalized similarity formula is developed, which can simplify the calculation of spatial attribute similarity. Second, sound-based and word segmentation-based methods are adopted to eliminate the semantic ambiguity when there is a lack of a normative coding standard in geospatial data to express the name attribute. Third, category mapping is established to address the heterogeneity among different classifications. Finally, to address the non-linear characteristic of attribute similarity, the weights of the attributes are calculated by the entropy of the attributes. Experiments demonstrate that the Entropy-Weighted Approach (EWA has good performance both in terms of precision and recall for instance matching from different data sets.

  12. Hierarchical Matching and Regression with Application to Photometric Redshift Estimation

    Science.gov (United States)

    Murtagh, Fionn

    2017-06-01

    This work emphasizes that heterogeneity, diversity, discontinuity, and discreteness in data is to be exploited in classification and regression problems. A global a priori model may not be desirable. For data analytics in cosmology, this is motivated by the variety of cosmological objects such as elliptical, spiral, active, and merging galaxies at a wide range of redshifts. Our aim is matching and similarity-based analytics that takes account of discrete relationships in the data. The information structure of the data is represented by a hierarchy or tree where the branch structure, rather than just the proximity, is important. The representation is related to p-adic number theory. The clustering or binning of the data values, related to the precision of the measurements, has a central role in this methodology. If used for regression, our approach is a method of cluster-wise regression, generalizing nearest neighbour regression. Both to exemplify this analytics approach, and to demonstrate computational benefits, we address the well-known photometric redshift or `photo-z' problem, seeking to match Sloan Digital Sky Survey (SDSS) spectroscopic and photometric redshifts.

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

    Directory of Open Access Journals (Sweden)

    Weirong Cui

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

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

    Science.gov (United States)

    Cui, Weirong; Du, Chenglie; Chen, Jinchao

    2016-01-01

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

  15. The influence of statin treatment on the inflammatory biomarkers YKL-40 and HsCRP in patients with stable coronary artery disease

    DEFF Research Database (Denmark)

    Mygind, Naja Dam; Harutyunyan, Marina J; Mathiasen, Anders Bruun

    2011-01-01

    OBJECTIVE: The inflammatory biomarker YKL-40 is elevated and associated with mortality in patients with stable coronary artery disease (CAD). The aim was to investigate the influence of statin treatment and lipid status on serum YKL-40 and Hs-CRP in patients with stable CAD. DESIGN: Serum YKL-40......, HsCRP, total cholesterol, HDL-c, LDL-c and triglycerides levels were measured in 404 statin treated and in 404 matched non-statin treated patients with stable CAD. RESULTS: YKL-40 was significantly higher in non-statin treated 110 µg/l (median) compared with 65 µg/l in statin treated (p ...

  16. A Compact Unconditionally Stable Method for Time-Domain Maxwell's Equations

    Directory of Open Access Journals (Sweden)

    Zhuo Su

    2013-01-01

    Full Text Available Higher order unconditionally stable methods are effective ways for simulating field behaviors of electromagnetic problems since they are free of Courant-Friedrich-Levy conditions. The development of accurate schemes with less computational expenditure is desirable. A compact fourth-order split-step unconditionally-stable finite-difference time-domain method (C4OSS-FDTD is proposed in this paper. This method is based on a four-step splitting form in time which is constructed by symmetric operator and uniform splitting. The introduction of spatial compact operator can further improve its performance. Analyses of stability and numerical dispersion are carried out. Compared with noncompact counterpart, the proposed method has reduced computational expenditure while keeping the same level of accuracy. Comparisons with other compact unconditionally-stable methods are provided. Numerical dispersion and anisotropy errors are shown to be lower than those of previous compact unconditionally-stable methods.

  17. Singular perturbation techniques in the gravitational self-force problem

    International Nuclear Information System (INIS)

    Pound, Adam

    2010-01-01

    Much of the progress in the gravitational self-force problem has involved the use of singular perturbation techniques. Yet the formalism underlying these techniques is not widely known. I remedy this situation by explicating the foundations and geometrical structure of singular perturbation theory in general relativity. Within that context, I sketch precise formulations of the methods used in the self-force problem: dual expansions (including matched asymptotic expansions), for which I identify precise matching conditions, one of which is a weak condition arising only when multiple coordinate systems are used; multiscale expansions, for which I provide a covariant formulation; and a self-consistent expansion with a fixed worldline, for which I provide a precise statement of the exact problem and its approximation. I then present a detailed analysis of matched asymptotic expansions as they have been utilized in calculating the self-force. Typically, the method has relied on a weak matching condition, which I show cannot determine a unique equation of motion. I formulate a refined condition that is sufficient to determine such an equation. However, I conclude that the method yields significantly weaker results than do alternative methods.

  18. Scenario tree generation and multi-asset financial optimization problems

    DEFF Research Database (Denmark)

    Geyer, Alois; Hanke, Michael; Weissensteiner, Alex

    2013-01-01

    We compare two popular scenario tree generation methods in the context of financial optimization: moment matching and scenario reduction. Using a simple problem with a known analytic solution, moment matching-when ensuring absence of arbitrage-replicates this solution precisely. On the other hand...

  19. Net Stable Funding Ratio: Impact on Funding Value Adjustment

    OpenAIRE

    Siadat, Medya; Hammarlid, Ola

    2017-01-01

    In this paper we investigate the relationship between Funding Value Adjustment (FVA) and Net Stable Funding Ratio (NSFR). FVA is defined in a consistent way with NSFR such that the new framework of FVA monitors the costs due to keeping NSFR at an acceptable level, as well. In addition, the problem of choosing the optimal funding strategy is formulated as a shortest path problem where the proposed FVA framework is applied in the optimization process. The solution provides us with the optimal f...

  20. Kolmogorov and Zabih’s Graph Cuts Stereo Matching Algorithm

    Directory of Open Access Journals (Sweden)

    Vladimir Kolmogorov

    2014-10-01

    Full Text Available Binocular stereovision estimates the three-dimensional shape of a scene from two photographs taken from different points of view. In rectified epipolar geometry, this is equivalent to a matching problem. This article describes a method proposed by Kolmogorov and Zabih in 2001, which puts forward an energy-based formulation. The aim is to minimize a four-term-energy. This energy is not convex and cannot be minimized except among a class of perturbations called expansion moves, in which case an exact minimization can be done with graph cuts techniques. One noteworthy feature of this method is that it handles occlusion: The algorithm detects points that cannot be matched with any point in the other image. In this method displacements are pixel accurate (no subpixel refinement.

  1. A zero-one programming approach to Gulliksen's matched random subtests method

    NARCIS (Netherlands)

    van der Linden, Willem 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. The method has practical relevance because it maximizes coefficient α as a lower bound to the classical test reliability coefficient. In this paper the same problem is formulated as a zero-one

  2. Stability analysis of resistive MHD modes via a new numerical matching technique

    International Nuclear Information System (INIS)

    Furukawa, M.; Tokuda, S.; Zheng, L.-J.

    2009-01-01

    Full text: Asymptotic matching technique is one of the principal methods for calculating linear stability of resistive magnetohydrodynamics (MHD) modes such as tearing modes. In applying the asymptotic method, the plasma region is divided into two regions: a thin inner layer around the mode-resonant surface and ideal MHD regions except for the layer. If we try to solve this asymptotic matching problem numerically, we meet practical difficulties. Firstly, the inertia-less ideal MHD equation or the Newcomb equation has a regular singular point at the mode-resonant surface, leading to the so-called big and small solutions. Since the big solution is not square-integrable, it needs sophisticated treatment. Even if such a treatment is applied, the matching data or the ratio of small solution to the big one, has been revealed to be sensitive to local MHD equilibrium accuracy and grid structure at the mode-resonant surface by numerical experiments. Secondly, one of the independent solutions in the inner layer, which should be matched onto the ideal MHD solution, is not square-integrable. The response formalism has been adopted to resolve this problem. In the present paper, we propose a new method for computing the linear stability of resistive MHD modes via matching technique, where the plasma region is divided into ideal MHD regions and an inner region with finite width. The matching technique using an inner region with finite width was recently developed for ideal MHD modes in cylindrical geometry, and good performance was shown. Our method extends this idea to resistive MHD modes. In the inner region, the low-beta reduced MHD equations are solved, and the solution is matched onto the solution of the Newcomb equation by using boundary conditions such that the parallel electric field vanishes properly as approaching the computational boundaries. If we use the inner region with finite width, the practical difficulties raised above can be avoided from the beginning. Figure

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

  4. Matching tomographic IMRT fields with static photon fields

    International Nuclear Information System (INIS)

    Sethi, A.; Leybovich, L.; Dogan, N.; Emami, B.

    2001-01-01

    The matching of abutting radiation fields presents a challenging problem in radiation therapy. Due to sharp penumbra of linear accelerator beams, small (1-2 mm) errors in field positioning can lead to large (>30%) hot or cold spots in the abutment region. With head and neck immobilization devices (thermoplastic mask/aquaplast) an average setup error of 3 mm has been reported. Therefore hot or cold spots approaching 50% of the prescription dose may occur along the matchline. Although abutting radiation fields have been investigated for static fields, there is no reported study regarding matching of tomographic IMRT and static fields. Compared to static fields, the matching of tomographic IMRT fields with static fields is more complicated. Since IMRT and static fields are planned on separate treatment planning computers, the dose in the abutment region is not specified. In addition, commonly used techniques for matching fields, such as feathering of junctions, are not practical. We have developed a method that substantially reduces dose inhomogeneity in the abutment region. In this method, a 'buffer zone' around the matchline was created and was included as part of the target for both IMRT and static field plans. In both fields, a small dose gradient (≤3%/mm) in the buffer zone was created. In the IMRT plan, the buffer zone was divided into three sections with dose varying from 83% to 25% of prescription dose. The static field dose profile was modified using either a specially designed physical (hard) or a dynamic (soft) wedge. When these modified fields were matched, the combined dose in the abutment region varied by ≤10% in the presence of setup errors spanning 4 mm (±2 mm) when the hard wedge was used and 10 mm (±5 mm) with the soft wedge

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

  6. Design of Matched Absorbing Layers for Surface Plasmon-Polaritons

    Directory of Open Access Journals (Sweden)

    Sergio de la Cruz

    2012-01-01

    Full Text Available We describe a procedure for designing metal-metal boundaries for the strong attenuation of surface plasmon-polaritons without the introduction of reflections or scattering effects. Solutions associated with different sets of matching materials are found. To illustrate the results and the consequences of adopting different solutions, we present calculations based on an integral equation formulation for the scattering problem and the use of a nonlocal impedance boundary condition.

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

  8. Full-Angle Quaternions for Robustly Matching Vectors of 3D Rotations

    NARCIS (Netherlands)

    Liwicki, Stephan; Pham, Minh-Tri; Zafeiriou, Stefanos; Pantic, Maja; Stenger, Björn

    In this paper we introduce a new distance for robustly matching vectors of 3D rotations. A special representation of 3D rotations, which we coin full-angle quaternion (FAQ), allows us to express this distance as Euclidean. We apply the distance to the problems of 3D shape recognition from point

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

  10. Fast Arc-Annotated Subsequence Matching in Linear Space

    DEFF Research Database (Denmark)

    Bille, Philip; Gørtz, Inge Li

    2010-01-01

    is deleted any arc with an endpoint in that base is also deleted. Arc-annotated strings where the arcs are "nested" are a natural model of RNA molecules that captures both the primary and secondary structure of these. The arc-preserving subsequence problem for nested arc-annotated strings is basic primitive...... for investigating the function of RNA molecules. Gramm et al. [ACM Trans. Algorithms 2006] gave an algorithm for this problem using O(nm) time and space, where m and n are the lengths of P and Q, respectively. In this paper we present; a new algorithm using O(nm) time and O(n+m,) space, thereby matching...... the previous time bound while significantly reducing the space from a quadratic term to linear. This is essential to process large RNA molecules where the space is a likely to be a bottleneck. To obtain our result we introduce several novel ideas which may be of independent interest for related problems on arc...

  11. The Interaction Between Schema Matching and Record Matching in Data Integration

    KAUST Repository

    Gu, Binbin; Li, Zhixu; Zhang, Xiangliang; Liu, An; Liu, Guanfeng; Zheng, Kai; Zhao, Lei; Zhou, Xiaofang

    2016-01-01

    Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have

  12. Predicting Rapid Relapse Following Treatment for Chemical Dependence: A Matched-Subjects Design.

    Science.gov (United States)

    Svanum, Soren; McAdoo, William George

    1989-01-01

    Persons who underwent residential treatment for chemical dependency were identified as three-month treatment failures (N=52) or successes (N=52). Subjects were matched on Minnesota Multiphasic Personality Inventory (MMPI) scores. Found posttreatment depression, anxiety, and sleep problems strongly related to failure among psychiatric MMPI group;…

  13. Integral staggered point-matching method for millimeter-wave reflective diffraction gratings on electron cyclotron heating systems

    International Nuclear Information System (INIS)

    Xia, Donghui; Huang, Mei; Wang, Zhijiang; Zhang, Feng; Zhuang, Ge

    2016-01-01

    Highlights: • The integral staggered point-matching method for design of polarizers on the ECH systems is presented. • The availability of the integral staggered point-matching method is checked by numerical calculations. • Two polarizers are designed with the integral staggered point-matching method and the experimental results are given. - Abstract: The reflective diffraction gratings are widely used in the high power electron cyclotron heating systems for polarization strategy. This paper presents a method which we call “the integral staggered point-matching method” for design of reflective diffraction gratings. This method is based on the integral point-matching method. However, it effectively removes the convergence problems and tedious calculations of the integral point-matching method, making it easier to be used for a beginner. A code is developed based on this method. The calculation results of the integral staggered point-matching method are compared with the integral point-matching method, the coordinate transformation method and the low power measurement results. It indicates that the integral staggered point-matching method can be used as an optional method for the design of reflective diffraction gratings in electron cyclotron heating systems.

  14. Integral staggered point-matching method for millimeter-wave reflective diffraction gratings on electron cyclotron heating systems

    Energy Technology Data Exchange (ETDEWEB)

    Xia, Donghui [State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 430074 Wuhan (China); Huang, Mei [Southwestern Institute of Physics, 610041 Chengdu (China); Wang, Zhijiang, E-mail: wangzj@hust.edu.cn [State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 430074 Wuhan (China); Zhang, Feng [Southwestern Institute of Physics, 610041 Chengdu (China); Zhuang, Ge [State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 430074 Wuhan (China)

    2016-10-15

    Highlights: • The integral staggered point-matching method for design of polarizers on the ECH systems is presented. • The availability of the integral staggered point-matching method is checked by numerical calculations. • Two polarizers are designed with the integral staggered point-matching method and the experimental results are given. - Abstract: The reflective diffraction gratings are widely used in the high power electron cyclotron heating systems for polarization strategy. This paper presents a method which we call “the integral staggered point-matching method” for design of reflective diffraction gratings. This method is based on the integral point-matching method. However, it effectively removes the convergence problems and tedious calculations of the integral point-matching method, making it easier to be used for a beginner. A code is developed based on this method. The calculation results of the integral staggered point-matching method are compared with the integral point-matching method, the coordinate transformation method and the low power measurement results. It indicates that the integral staggered point-matching method can be used as an optional method for the design of reflective diffraction gratings in electron cyclotron heating systems.

  15. Matching Matched Filtering with Deep Networks for Gravitational-Wave Astronomy

    Science.gov (United States)

    Gabbard, Hunter; Williams, Michael; Hayes, Fergus; Messenger, Chris

    2018-04-01

    We report on the construction of a deep convolutional neural network that can reproduce the sensitivity of a matched-filtering search for binary black hole gravitational-wave signals. The standard method for the detection of well-modeled transient gravitational-wave signals is matched filtering. We use only whitened time series of measured gravitational-wave strain as an input, and we train and test on simulated binary black hole signals in synthetic Gaussian noise representative of Advanced LIGO sensitivity. We show that our network can classify signal from noise with a performance that emulates that of match filtering applied to the same data sets when considering the sensitivity defined by receiver-operator characteristics.

  16. Matching Matched Filtering with Deep Networks for Gravitational-Wave Astronomy.

    Science.gov (United States)

    Gabbard, Hunter; Williams, Michael; Hayes, Fergus; Messenger, Chris

    2018-04-06

    We report on the construction of a deep convolutional neural network that can reproduce the sensitivity of a matched-filtering search for binary black hole gravitational-wave signals. The standard method for the detection of well-modeled transient gravitational-wave signals is matched filtering. We use only whitened time series of measured gravitational-wave strain as an input, and we train and test on simulated binary black hole signals in synthetic Gaussian noise representative of Advanced LIGO sensitivity. We show that our network can classify signal from noise with a performance that emulates that of match filtering applied to the same data sets when considering the sensitivity defined by receiver-operator characteristics.

  17. Doppler ultrasonography of the anterior knee tendons in elite badminton players: colour fraction before and after match.

    Science.gov (United States)

    Koenig, M J; Torp-Pedersen, S; Boesen, M I; Holm, C C; Bliddal, H

    2010-02-01

    Anterior knee tendon problems are seldom reported in badminton players although the game is obviously stressful to the lower extremities. Painful anterior knee tendons are common among elite badminton players. The anterior knee tendons exhibit colour Doppler activity. This activity increases after a match. Painful tendons have more Doppler activity than tendons without pain. Cohort study. 72 elite badminton players were interviewed about training, pain and injuries. The participants were scanned with high-end ultrasound equipment. Colour Doppler was used to examine the tendons of 64 players before a match and 46 players after a match. Intratendinous colour Doppler flow was measured as colour fraction (CF). The tendon complex was divided into three loci: the quadriceps tendon, the proximal patellar tendon and the insertion on the tibial tuberosity. Interview: Of the 72 players, 62 players had problems with 86 tendons in the lower extremity. Of these 86 tendons, 48 were the anterior knee tendons. Ultrasound: At baseline, the majority of players (87%) had colour Doppler flow in at least one scanning position. After a match, the percentage of the knee complexes involved did not change. CF increased significantly in the dominant leg at the tibial tuberosity; single players had a significantly higher CF after a match at the tibial tuberosity and in the patellar tendon both before and after a match. Painful tendons had the highest colour Doppler activity. Most elite badminton players had pain in the anterior knee tendons and intratendinous Doppler activity both before and after match. High levels of Doppler activity were associated with self-reported ongoing pain.

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

    Science.gov (United States)

    2013-07-15

    ... 1974; CMS Computer Match No. 2013-07; HHS Computer Match No. 1303; DoD-DMDC Match No. 18 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION... Act of 1974, as amended, this notice announces the establishment of a CMP that CMS plans to conduct...

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

  20. Bifurcation from stable holes to replicating holes in vibrated dense suspensions.

    Science.gov (United States)

    Ebata, H; Sano, M

    2013-11-01

    In vertically vibrated starch suspensions, we observe bifurcations from stable holes to replicating holes. Above a certain acceleration, finite-amplitude deformations of the vibrated surface continue to grow until void penetrates fluid layers, and a hole forms. We studied experimentally and theoretically the parameter dependence of the holes and their stabilities. In suspensions of small dispersed particles, the circular shapes of the holes are stable. However, we find that larger particles or lower surface tension of water destabilize the circular shapes; this indicates the importance of capillary forces acting on the dispersed particles. Around the critical acceleration for bifurcation, holes show intermittent large deformations as a precursor to hole replication. We applied a phenomenological model for deformable domains, which is used in reaction-diffusion systems. The model can explain the basic dynamics of the holes, such as intermittent behavior, probability distribution functions of deformation, and time intervals of replication. Results from the phenomenological model match the linear growth rate below criticality that was estimated from experimental data.

  1. Applying Agrep to r-NSA to solve multiple sequences approximate matching.

    Science.gov (United States)

    Ni, Bing; Wong, Man-Hon; Lam, Chi-Fai David; Leung, Kwong-Sak

    2014-01-01

    This paper addresses the approximate matching problem in a database consisting of multiple DNA sequences, where the proposed approach applies Agrep to a new truncated suffix array, r-NSA. The construction time of the structure is linear to the database size, and the computations of indexing a substring in the structure are constant. The number of characters processed in applying Agrep is analysed theoretically, and the theoretical upper-bound can approximate closely the empirical number of characters, which is obtained through enumerating the characters in the actual structure built. Experiments are carried out using (synthetic) random DNA sequences, as well as (real) genome sequences including Hepatitis-B Virus and X-chromosome. Experimental results show that, compared to the straight-forward approach that applies Agrep to multiple sequences individually, the proposed approach solves the matching problem in much shorter time. The speed-up of our approach depends on the sequence patterns, and for highly similar homologous genome sequences, which are the common cases in real-life genomes, it can be up to several orders of magnitude.

  2. Impedance matching wireless power transmission system for biomedical devices.

    Science.gov (United States)

    Lum, Kin Yun; Lindén, Maria; Tan, Tian Swee

    2015-01-01

    For medical application, the efficiency and transmission distance of the wireless power transfer (WPT) are always the main concern. Research has been showing that the impedance matching is one of the critical factors for dealing with the problem. However, there is not much work performed taking both the source and load sides into consideration. Both sides matching is crucial in achieving an optimum overall performance, and the present work proposes a circuit model analysis for design and implementation. The proposed technique was validated against experiment and software simulation. Result was showing an improvement in transmission distance up to 6 times, and efficiency at this transmission distance had been improved up to 7 times as compared to the impedance mismatch system. The system had demonstrated a near-constant transfer efficiency for an operating range of 2cm-12cm.

  3. Fingerprint recognition system by use of graph matching

    Science.gov (United States)

    Shen, Wei; Shen, Jun; Zheng, Huicheng

    2001-09-01

    Fingerprint recognition is an important subject in biometrics to identify or verify persons by physiological characteristics, and has found wide applications in different domains. In the present paper, we present a finger recognition system that combines singular points and structures. The principal steps of processing in our system are: preprocessing and ridge segmentation, singular point extraction and selection, graph representation, and finger recognition by graphs matching. Our fingerprint recognition system is implemented and tested for many fingerprint images and the experimental result are satisfactory. Different techniques are used in our system, such as fast calculation of orientation field, local fuzzy dynamical thresholding, algebraic analysis of connections and fingerprints representation and matching by graphs. Wed find that for fingerprint database that is not very large, the recognition rate is very high even without using a prior coarse category classification. This system works well for both one-to-few and one-to-many problems.

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

    Science.gov (United States)

    2013-08-07

    ... 1974; CMS Computer Match No. 2013-02; HHS Computer Match No. 1306; DoD-DMDC Match No. 12 AGENCY: Department of Health and Human Services (HHS), Centers for Medicare & Medicaid Services (CMS). ACTION: Notice... of 1974, as amended, this notice establishes a CMP that CMS plans to conduct with the Department of...

  5. Stable isotopes

    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)

  6. Constructivist-Based Asynchronous Tutorial to Improve Transfer between Math and Chemistry Domains: Design, Implementation, and Analysis of the Impact of ReMATCH on General Chemistry Course Performance and Confidence

    Science.gov (United States)

    Barker, M. Danielle

    2011-07-01

    The two-year implementation of ReMATCH, a web-based math and problem-solving tutorial, in a traditionally arranged general chemistry classroom at the University of Kansas examined the impact of a designed intervention to assist students with the transfer of their mathematical knowledge to a chemistry context where it could be readily used for quantitative problem solving. The ReMATCH intervention, designed on constructivist-based pedagogies, focused on illuminating the expert-processes of problem solving and transferring knowledge across domains to the novice chemistry. The two implementations of ReMATCH -- once as lab assignments and once lecture assignments -- resulted in very different student responses to the intervention. However, within both, the beneficial effects of sustained ReMATCH-use were visible. In 2006, students who attempted all of the ReMATCH homework assignments were predicted to earn ˜5% higher on their total exam points. The 2007 implementation of ReMATCH demonstrated that students who attempted all of the homework problems and visited at least half of the ReMATCH tutorial pages were predicted to earn ˜8.5% higher on their total exam points. Additionally, use of ReMATCH in 2006 also resulted in increased confidence (as measured by comfort-level) with some of the math-related chemistry topics covered in ReMATCH. In 2007, when only students who attempted all of the ReMATCH problems were considered, it became clear that individuals who were initially less confident in their math-related chemistry skills were more likely to view more of the ReMATCH tutorial pages. When students with lower initial comfort-levels on these topics viewed at least half of the ReMATCH tutorial pages, they were able to compensate for their initially lower levels of confidence and were equally comfortable with most of the math-related chemistry topics by the final survey. Student interactions with and perceptions of ReMATCH showed that student attitudes towards ReMATCH

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

    Science.gov (United States)

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

    2016-01-01

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

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

    Directory of Open Access Journals (Sweden)

    P. Fischer

    2018-04-01

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

  9. The three-body problem from Pythagoras to Hawking

    CERN Document Server

    Valtonen, Mauri; Kholshevnikov, Konstantin; Mylläri, Aleksandr; Orlov, Victor; Tanikawa, Kiyotaka

    2016-01-01

    This book, written for a general readership, reviews and explains the three-body problem in historical context reaching to latest developments in computational physics and gravitation theory. The three-body problem is one of the oldest problems in science and it is most relevant even in today’s physics and astronomy. The long history of the problem from Pythagoras to Hawking parallels the evolution of ideas about our physical universe, with a particular emphasis on understanding gravity and how it operates between astronomical bodies. The oldest astronomical three-body problem is the question how and when the moon and the sun line up with the earth to produce eclipses. Once the universal gravitation was discovered by Newton, it became immediately a problem to understand why these three-bodies form a stable system, in spite of the pull exerted from one to the other. In fact, it was a big question whether this system is stable at all in the long run. Leading mathematicians attacked this problem over more than...

  10. The COMT Val158 allele is associated with impaired delayed-match-to-sample performance in ADHD

    Directory of Open Access Journals (Sweden)

    Matthews Natasha

    2012-05-01

    Full Text Available Abstract Background This study explored the association between three measures of working memory ability and genetic variation in a range of catecholamine genes in a sample of children with ADHD. Methods One hundred and eighteen children with ADHD performed three working memory measures taken from the CANTAB battery (Spatial Span, Delayed-match-to-sample, and Spatial Working Memory. Associations between performance on working memory measures and allelic variation in catecholamine genes (including those for the noradrenaline transporter [NET1], the dopamine D4 and D2 receptor genes [DRD4; DRD2], the gene encoding dopamine beta hydroxylase [DBH] and catechol-O-methyl transferase [COMT] were investigated using regression models that controlled for age, IQ, gender and medication status on the day of test. Results Significant associations were found between performance on the delayed-match-to-sample task and COMT genotype. More specifically, val/val homozygotes produced significantly more errors than did children who carried a least one met allele. There were no further associations between allelic variants and performance across the other working memory tasks. Conclusions The working memory measures employed in the present study differed in the degree to which accurate task performance depended upon either the dynamic updating and/or manipulation of items in working memory, as in the spatial span and spatial working memory tasks, or upon the stable maintenance of representations, as in the delay-match–to-sample task. The results are interpreted as evidence of a relationship between tonic dopamine levels associated with the met COMT allele and the maintenance of stable working memory representations required to perform the delayed-match-to-sample-task.

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

  12. Solution to reinforcement learning problems with artificial potential field

    Institute of Scientific and Technical Information of China (English)

    XIE Li-juan; XIE Guang-rong; CHEN Huan-wen; LI Xiao-li

    2008-01-01

    A novel method was designed to solve reinforcement learning problems with artificial potential field. Firstly a reinforcement learning problem was transferred to a path planning problem by using artificial potential field(APF), which was a very appropriate method to model a reinforcement learning problem. Secondly, a new APF algorithm was proposed to overcome the local minimum problem in the potential field methods with a virtual water-flow concept. The performance of this new method was tested by a gridworld problem named as key and door maze. The experimental results show that within 45 trials, good and deterministic policies are found in almost all simulations. In comparison with WIERING's HQ-learning system which needs 20 000 trials for stable solution, the proposed new method can obtain optimal and stable policy far more quickly than HQ-learning. Therefore, the new method is simple and effective to give an optimal solution to the reinforcement learning problem.

  13. Self-reported impulsivity and inhibitory control in problem gamblers.

    Science.gov (United States)

    Lorains, Felicity K; Stout, Julie C; Bradshaw, John L; Dowling, Nicki A; Enticott, Peter G

    2014-01-01

    Impulsivity is considered a core feature of problem gambling; however, self-reported impulsivity and inhibitory control may reflect disparate constructs. We examined self-reported impulsivity and inhibitory control in 39 treatment-seeking problem gamblers and 41 matched controls using a range of self-report questionnaires and laboratory inhibitory control tasks. We also investigated differences between treatment-seeking problem gamblers who prefer strategic (e.g., sports betting) and nonstrategic (e.g., electronic gaming machines) gambling activities. Treatment-seeking problem gamblers demonstrated elevated self-reported impulsivity, more go errors on the Stop Signal Task, and a lower gap score on the Random Number Generation task than matched controls. However, overall we did not find strong evidence that treatment-seeking problem gamblers are more impulsive on laboratory inhibitory control measures. Furthermore, strategic and nonstrategic problem gamblers did not differ from their respective controls on either self-reported impulsivity questionnaires or laboratory inhibitory control measures. Contrary to expectations, our results suggest that inhibitory dyscontrol may not be a key component for some treatment-seeking problem gamblers.

  14. Optimal stability polynomials for numerical integration of initial value problems

    KAUST Repository

    Ketcheson, David I.

    2013-01-08

    We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step size and corresponding method for a given problem when the spectrum of the initial value problem is known. The problem is expressed in terms of a general least deviation feasibility problem. Its solution is obtained by a new fast, accurate, and robust algorithm based on convex optimization techniques. Global convergence of the algorithm is proven in the case that the order of approximation is one and in the case that the spectrum encloses a starlike region. Examples demonstrate the effectiveness of the proposed algorithm even when these conditions are not satisfied.

  15. Stable Isotope Data

    Data.gov (United States)

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

  16. stableGP

    Data.gov (United States)

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

  17. New Keypoint Matching Method Using Local Convolutional Features for Power Transmission Line Icing Monitoring

    Directory of Open Access Journals (Sweden)

    Qiangliang Guo

    2018-02-01

    Full Text Available Power transmission line icing (PTLI problems, which cause tremendous damage to the power grids, has drawn much attention. Existing three-dimensional measurement methods based on binocular stereo vision was recently introduced to measure the ice thickness in PTLI, but failed to meet requirements of practical applications due to inefficient keypoint matching in the complex PTLI scene. In this paper, a new keypoint matching method is proposed based on the local multi-layer convolutional neural network (CNN features, termed Local Convolutional Features (LCFs. LCFs are deployed to extract more discriminative features than the conventional CNNs. Particularly in LCFs, a multi-layer features fusion scheme is exploited to boost the matching performance. Together with a location constraint method, the correspondence of neighboring keypoints is further refined. Our approach achieves 1.5%, 5.3%, 13.1%, 27.3% improvement in the average matching precision compared with SIFT, SURF, ORB and MatchNet on the public Middlebury dataset, and the measurement accuracy of ice thickness can reach 90.9% compared with manual measurement on the collected PTLI dataset.

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

  19. Optimal stability polynomials for numerical integration of initial value problems

    KAUST Repository

    Ketcheson, David I.; Ahmadia, Aron

    2013-01-01

    We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest stable step

  20. On the Matching of Seen and Felt Shape by Newly Sighted Subjects

    Directory of Open Access Journals (Sweden)

    John Schwenkler

    2012-04-01

    Full Text Available How do we recognize identities between seen shapes and felt ones? Is this due to associative learning, or intrinsic connections these sensory modalities? We can address this question by testing the capacities of newly sighted subjects to match seen and felt shapes, but only if the subjects can see the objects well enough to form adequate visual representations of their shapes. In light of this, a recent study by R. Held and colleagues fails to demonstrate that their newly sighted subjects' inability to match seen and felt shape was due to a lack of intermodal connections rather than a purely visual deficit, as the subjects may not have been able visually to represent 3D shape in the perspective-invariant manner required for intermodal matching. However, the study could be modified in any of several ways to help avoid this problem.

  1. An L-stable method for solving stiff hydrodynamics

    Science.gov (United States)

    Li, Shengtai

    2017-07-01

    We develop a new method for simulating the coupled dynamics of gas and multi-species dust grains. The dust grains are treated as pressure-less fluids and their coupling with gas is through stiff drag terms. If an explicit method is used, the numerical time step is subject to the stopping time of the dust particles, which can become extremely small for small grains. The previous semi-implicit method [1] uses second-order trapezoidal rule (TR) on the stiff drag terms and it works only for moderately small size of the dust particles. This is because TR method is only A-stable not L-stable. In this work, we use TR-BDF2 method [2] for the stiff terms in the coupled hydrodynamic equations. The L-stability of TR-BDF2 proves essential in treating a number of dust species. The combination of TR-BDF2 method with the explicit discretization of other hydro terms can solve a wide variety of stiff hydrodynamics equations accurately and efficiently. We have implemented our method in our LA-COMPASS (Los Alamos Computational Astrophysics Suite) package. We have applied the code to simulate some dusty proto-planetary disks and obtained very good match with astronomical observations.

  2. Counting in Lattices: Combinatorial Problems from Statistical Mechanics.

    Science.gov (United States)

    Randall, Dana Jill

    In this thesis we consider two classical combinatorial problems arising in statistical mechanics: counting matchings and self-avoiding walks in lattice graphs. The first problem arises in the study of the thermodynamical properties of monomers and dimers (diatomic molecules) in crystals. Fisher, Kasteleyn and Temperley discovered an elegant technique to exactly count the number of perfect matchings in two dimensional lattices, but it is not applicable for matchings of arbitrary size, or in higher dimensional lattices. We present the first efficient approximation algorithm for computing the number of matchings of any size in any periodic lattice in arbitrary dimension. The algorithm is based on Monte Carlo simulation of a suitable Markov chain and has rigorously derived performance guarantees that do not rely on any assumptions. In addition, we show that these results generalize to counting matchings in any graph which is the Cayley graph of a finite group. The second problem is counting self-avoiding walks in lattices. This problem arises in the study of the thermodynamics of long polymer chains in dilute solution. While there are a number of Monte Carlo algorithms used to count self -avoiding walks in practice, these are heuristic and their correctness relies on unproven conjectures. In contrast, we present an efficient algorithm which relies on a single, widely-believed conjecture that is simpler than preceding assumptions and, more importantly, is one which the algorithm itself can test. Thus our algorithm is reliable, in the sense that it either outputs answers that are guaranteed, with high probability, to be correct, or finds a counterexample to the conjecture. In either case we know we can trust our results and the algorithm is guaranteed to run in polynomial time. This is the first algorithm for counting self-avoiding walks in which the error bounds are rigorously controlled. This work was supported in part by an AT&T graduate fellowship, a University of

  3. T-regulatory cells in chronic rejection versus stable grafts.

    Science.gov (United States)

    Al-Wedaie, Fatima; Farid, Eman; Tabbara, Khaled; El-Agroudy, Amgad E; Al-Ghareeb, Sumaya M

    2015-04-01

    Studying regulatory T cells in kidney allograft acceptance versus chronic rejection may help in the understanding of more mechanisms of immune tolerance and, in the future, may enable clinicians to induce immune tolerance and decrease the use of immunosuppressive drugs. The aim of the current study was to evaluate regulatory T cells in kidney transplant patients with stable graft versus transplant with biopsy-proven chronic rejection. The 3 groups that were studied included: kidney transplanted patients with no rejection episodes (n = 43); transplanted patients with biopsy-proven renal rejection (n = 27); and healthy age-matched nontransplanted individuals as controls (n = 42).The percentage of regulatory T cells (CD4+CD25+Foxp3+) in blood was determined by flow cytometry. The regulatory T cell percentage was significantly lower in chronic rejection patients than control or stable graft groups. No significant difference was observed in regulatory T cell percentage between the stable graft and control groups. In the stable graft group, patients on rapamycin had a significantly higher regulatory T cell percentage than patients on cyclosporine. No effect of donor type, infection, or duration after transplant was observed on regulatory T cell percentage. The results of the current study are consistent with previous studies addressing the function of regulatory T cells in inducing immunotolerance after kidney transplant. Considering the established role of regulatory T cells in graft maintenance and our observation of high regulatory T cell percentage in patients receiving rapamycin than cyclosporine, we recommend including rapamycin when possible in immunosuppressive protocols. The findings from the current study on the chronic rejection group support ongoing research of having treatment with regulatory T cells, which may constitute a novel, efficient antirejection therapy in the future.

  4. A long baseline global stereo matching based upon short baseline estimation

    Science.gov (United States)

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

    2018-05-01

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

  5. Probability matching in perceptrons: Effects of conditional dependence and linear nonseparability.

    Directory of Open Access Journals (Sweden)

    Michael R W Dawson

    Full Text Available Probability matching occurs when the behavior of an agent matches the likelihood of occurrence of events in the agent's environment. For instance, when artificial neural networks match probability, the activity in their output unit equals the past probability of reward in the presence of a stimulus. Our previous research demonstrated that simple artificial neural networks (perceptrons, which consist of a set of input units directly connected to a single output unit learn to match probability when presented different cues in isolation. The current paper extends this research by showing that perceptrons can match probabilities when presented simultaneous cues, with each cue signaling different reward likelihoods. In our first simulation, we presented up to four different cues simultaneously; the likelihood of reward signaled by the presence of one cue was independent of the likelihood of reward signaled by other cues. Perceptrons learned to match reward probabilities by treating each cue as an independent source of information about the likelihood of reward. In a second simulation, we violated the independence between cues by making some reward probabilities depend upon cue interactions. We did so by basing reward probabilities on a logical combination (AND or XOR of two of the four possible cues. We also varied the size of the reward associated with the logical combination. We discovered that this latter manipulation was a much better predictor of perceptron performance than was the logical structure of the interaction between cues. This indicates that when perceptrons learn to match probabilities, they do so by assuming that each signal of a reward is independent of any other; the best predictor of perceptron performance is a quantitative measure of the independence of these input signals, and not the logical structure of the problem being learned.

  6. Probability matching in perceptrons: Effects of conditional dependence and linear nonseparability

    Science.gov (United States)

    2017-01-01

    Probability matching occurs when the behavior of an agent matches the likelihood of occurrence of events in the agent’s environment. For instance, when artificial neural networks match probability, the activity in their output unit equals the past probability of reward in the presence of a stimulus. Our previous research demonstrated that simple artificial neural networks (perceptrons, which consist of a set of input units directly connected to a single output unit) learn to match probability when presented different cues in isolation. The current paper extends this research by showing that perceptrons can match probabilities when presented simultaneous cues, with each cue signaling different reward likelihoods. In our first simulation, we presented up to four different cues simultaneously; the likelihood of reward signaled by the presence of one cue was independent of the likelihood of reward signaled by other cues. Perceptrons learned to match reward probabilities by treating each cue as an independent source of information about the likelihood of reward. In a second simulation, we violated the independence between cues by making some reward probabilities depend upon cue interactions. We did so by basing reward probabilities on a logical combination (AND or XOR) of two of the four possible cues. We also varied the size of the reward associated with the logical combination. We discovered that this latter manipulation was a much better predictor of perceptron performance than was the logical structure of the interaction between cues. This indicates that when perceptrons learn to match probabilities, they do so by assuming that each signal of a reward is independent of any other; the best predictor of perceptron performance is a quantitative measure of the independence of these input signals, and not the logical structure of the problem being learned. PMID:28212422

  7. Probability matching in perceptrons: Effects of conditional dependence and linear nonseparability.

    Science.gov (United States)

    Dawson, Michael R W; Gupta, Maya

    2017-01-01

    Probability matching occurs when the behavior of an agent matches the likelihood of occurrence of events in the agent's environment. For instance, when artificial neural networks match probability, the activity in their output unit equals the past probability of reward in the presence of a stimulus. Our previous research demonstrated that simple artificial neural networks (perceptrons, which consist of a set of input units directly connected to a single output unit) learn to match probability when presented different cues in isolation. The current paper extends this research by showing that perceptrons can match probabilities when presented simultaneous cues, with each cue signaling different reward likelihoods. In our first simulation, we presented up to four different cues simultaneously; the likelihood of reward signaled by the presence of one cue was independent of the likelihood of reward signaled by other cues. Perceptrons learned to match reward probabilities by treating each cue as an independent source of information about the likelihood of reward. In a second simulation, we violated the independence between cues by making some reward probabilities depend upon cue interactions. We did so by basing reward probabilities on a logical combination (AND or XOR) of two of the four possible cues. We also varied the size of the reward associated with the logical combination. We discovered that this latter manipulation was a much better predictor of perceptron performance than was the logical structure of the interaction between cues. This indicates that when perceptrons learn to match probabilities, they do so by assuming that each signal of a reward is independent of any other; the best predictor of perceptron performance is a quantitative measure of the independence of these input signals, and not the logical structure of the problem being learned.

  8. Simultaneous Semi-Coupled Dictionary Learning for Matching in Canonical Space.

    Science.gov (United States)

    Das, Nilotpal; Mandal, Devraj; Biswas, Soma

    2017-05-24

    Cross-modal recognition and matching with privileged information are important challenging problems in the field of computer vision. The cross-modal scenario deals with matching across different modalities and needs to take care of the large variations present across and within each modality. The privileged information scenario deals with the situation that all the information available during training may not be available during the testing stage and hence algorithms need to leverage the extra information from the training stage itself. We show that for multi-modal data, either one of the above situations may arise if one modality is absent during testing. Here, we propose a novel framework which can handle both these scenarios seamlessly with applications to matching multi-modal data. The proposed approach jointly uses data from the two modalities to build a canonical representation which encompasses information from both the modalities. We explore four different types of canonical representations for different types of data. The algorithm computes dictionaries and canonical representation for data from both the modalities such that the transformed sparse coefficients of both the modalities are equal to that of the canonical representation. The sparse coefficients are finally matched using Mahalanobis metric. Extensive experiments on different datasets, involving RGBD, text-image and audio-image data show the effectiveness of the proposed framework.

  9. Nonlocal matching condition and scale-invariant spectrum in bouncing cosmology

    International Nuclear Information System (INIS)

    Chu, C.-S.; Furuta, K.; Lin, F.-L.

    2006-01-01

    In cosmological scenarios such as the pre-big bang scenario or the ekpyrotic scenario, a matching condition between the metric perturbations in the pre-big bang phase and those in the post big bang phase is often assumed. Various matching conditions have been considered in the literature. Nevertheless obtaining a scale-invariant CMB spectrum via a concrete mechanism remains impossible. In this paper, we examine this problem from the point of view of local causality. We begin with introducing the notion of local causality and explain how it constrains the form of the matching condition. We then prove a no-go theorem: independent of the details of the matching condition, a scale-invariant spectrum is impossible as long as the local causality condition is satisfied. In our framework, it is easy to show that a violation of local causality around the bounce is needed in order to give a scale-invariant spectrum. We study a specific scenario of this possibility by considering a nonlocal effective theory inspired by noncommutative geometry around the bounce and show that a scale-invariant spectrum is possible. Moreover we demonstrate that the magnitude of the spectrum is compatible with observations if the bounce is assumed to occur at an energy scale which is a few orders of magnitude below the Planckian energy scale

  10. Best Practices for NPT Transit Matching

    International Nuclear Information System (INIS)

    Gilligan, Kimberly V.; Whitaker, J. Michael; Oakberg, John A.; Snow, Catherine

    2016-01-01

    Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.

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

  12. Dynamics and control of twisting bi-stable structures

    Science.gov (United States)

    Arrieta, Andres F.; van Gemmeren, Valentin; Anderson, Aaron J.; Weaver, Paul M.

    2018-02-01

    Compliance-based morphing structures have the potential to offer large shape adaptation, high stiffness and low weight, while reducing complexity, friction, and scalability problems of mechanism based systems. A promising class of structure that enables these characteristics are multi-stable structures given their ability to exhibit large deflections and rotations without the expensive need for continuous actuation, with the latter only required intermittently. Furthermore, multi-stable structures exhibit inherently fast response due to the snap-through instability governing changes between stable states, enabling rapid configuration switching between the discrete number of programmed shapes of the structure. In this paper, the design and utilisation of the inherent nonlinear dynamics of bi-stable twisting I-beam structures for actuation with low strain piezoelectric materials is presented. The I-beam structure consists of three compliant components assembled into a monolithic single element, free of moving parts, and showing large deflections between two stable states. Finite element analysis is utilised to uncover the distribution of strain across the width of the flange, guiding the choice of positioning for piezoelectric actuators. In addition, the actuation authority is maximised by calculating the generalised coupling coefficient for different positions of the piezoelectric actuators. The results obtained are employed to tailor and test I-beam designs exhibiting desired large deflection between stable states, while still enabling the activation of snap-through with the low strain piezoelectric actuators. To this end, the dynamic response of the I-beams to piezoelectric excitation is investigated, revealing that resonant excitations are insufficient to dynamically trigger snap-through. A novel bang-bang control strategy, which exploits the nonlinear dynamics of the structure successfully triggers both single and constant snap-through between the stable states

  13. An ensemble based nonlinear orthogonal matching pursuit algorithm for sparse history matching of reservoir models

    KAUST Repository

    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.

  14. The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching

    International Nuclear Information System (INIS)

    Wadlinger, E.A.; Garnett, R.W.

    1996-01-01

    The issue involved in the simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ / 4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x = β y and α x = α y = 0 at the exit of the RFQ. This matching between the RFQ and DTL is described. (author)

  15. The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching

    International Nuclear Information System (INIS)

    Wadlinger, E.A.; Garnett, R.W.

    1996-01-01

    The issue involved in simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ/4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x =β y and α x =α y =0 at the exit of the RFQ. This matching between the RFQ and DTL is described

  16. Face recognition using elastic grid matching through photoshop: A new approach

    Directory of Open Access Journals (Sweden)

    Manavpreet Kaur

    2015-12-01

    Full Text Available Computing grids propose to be a very efficacious, economic and ascendable way of image identification. In this paper, we propose a grid based face recognition overture employing a general template matching method to solve the timeconsuming face recognition problem. A new approach has been employed in which the grid was prepared for a specific individual over his photograph using Adobe Photoshop CS5 software. The background was later removed and the grid prepared by merging layers was used as a template for image matching or comparison. This overture is computationally efficient, has high recognition rates and is able to identify a person with minimal efforts and in short time even from photographs taken at different magnifications and from different distances.

  17. The Nature of Stable Insomnia Phenotypes

    Science.gov (United States)

    Pillai, Vivek; Roth, Thomas; Drake, Christopher L.

    2015-01-01

    Study Objectives: We examined the 1-y stability of four insomnia symptom profiles: sleep onset insomnia; sleep maintenance insomnia; combined onset and maintenance insomnia; and neither criterion (i.e., insomnia cases that do not meet quantitative thresholds for onset or maintenance problems). Insomnia cases that exhibited the same symptom profile over a 1-y period were considered to be phenotypes, and were compared in terms of clinical and demographic characteristics. Design: Longitudinal. Setting: Urban, community-based. Participants: Nine hundred fifty-four adults with Diagnostic and Statistical Manual of Mental Disorders, Fifth Edition based current insomnia (46.6 ± 12.6 y; 69.4% female). Interventions: None. Measurements and results: At baseline, participants were divided into four symptom profile groups based on quantitative criteria. Follow-up assessment 1 y later revealed that approximately 60% of participants retained the same symptom profile, and were hence judged to be phenotypes. Stability varied significantly by phenotype, such that sleep onset insomnia (SOI) was the least stable (42%), whereas combined insomnia (CI) was the most stable (69%). Baseline symptom groups (cross-sectionally defined) differed significantly across various clinical indices, including daytime impairment, depression, and anxiety. Importantly, however, a comparison of stable phenotypes (longitudinally defined) did not reveal any differences in impairment or comorbid psychopathology. Another interesting finding was that whereas all other insomnia phenotypes showed evidence of an elevated wake drive both at night and during the day, the “neither criterion” phenotype did not; this latter phenotype exhibited significantly higher daytime sleepiness despite subthreshold onset and maintenance difficulties. Conclusions: By adopting a stringent, stability-based definition, this study offers timely and important data on the longitudinal trajectory of specific insomnia phenotypes. With

  18. Simple artificial neural networks that match probability and exploit and explore when confronting a multiarmed bandit.

    Science.gov (United States)

    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.

  19. Towards an Entropy Stable Spectral Element Framework for Computational Fluid Dynamics

    KAUST Repository

    Carpenter, Mark H.

    2016-01-04

    Nonlinearly stable finite element methods of arbitrary type and order, are currently unavailable for discretizations of the compressible Navier-Stokes equations. Summation-by-parts (SBP) entropy stability analysis provides a means of constructing nonlinearly stable discrete operators of arbitrary order, but is currently limited to simple element types. Herein, recent progress is reported, on developing entropy-stable (SS) discontinuous spectral collocation formulations for hexahedral elements. Two complementary efforts are discussed. The first effort generalizes previous SS spectral collocation work to extend the applicable set of points from tensor product, Legendre-Gauss-Lobatto (LGL) to tensor product Legendre-Gauss (LG) points. The LG and LGL point formulations are compared on a series of test problems. Both the LGL and LG operators are of comparable efficiency and robustness, as is demonstrated using test problems for which conventional FEM techniques suffer instability. The second effort extends previous work on entropy stability to include p-refinement at nonconforming interfaces. A generalization of existing entropy stability theory is required to accommodate the nuances of fully multidimensional SBP operators. The entropy stability of the compressible Euler equations on nonconforming interfaces is demonstrated using the newly developed LG operators and multidimensional interface interpolation operators. Preliminary studies suggest design order accuracy at nonconforming interfaces.

  20. A stable high-order perturbation of surfaces method for numerical simulation of diffraction problems in triply layered media

    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.

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

    Science.gov (United States)

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

    2009-01-01

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

  2. Matched-Filter Thermography

    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.

  3. On formation of a partially coherent beam in a stable-resonator laser

    International Nuclear Information System (INIS)

    Suvorov, A A

    2010-01-01

    A new method involving the expansion of the field coherence function in partially coherent modes - the eigensolutions of the problem for the second-order coherence function in a stable resonator - is proposed for the theoretical description of the process of multimode laser beam formation. The method for solving the problem for arbitrary partially coherent modes is formulated and the expressions for these modes are derived in the general form. The characteristics of the fundamental partially coherent mode, which coincides with the coherence function of a Gaussian partially coherent beam, are analysed in detail. The partially coherent modes are shown to possess two spatial scales - the effective radius and the coherence radius, which makes them a convenient tool for solving the problem of generation of a partially coherent beam. It is found that the unambiguous relation between the characteristics of partially coherent modes and the stable-resonator parameters is achieved by involving into consideration not only the process of the beam formation by the resonator mirrors but also the process of interaction of radiation with the active laser medium. (laser beams and resonators)

  4. Association of prenatal exposure to benzodiazepines and child internalizing problems: A sibling-controlled cohort study.

    Directory of Open Access Journals (Sweden)

    Ragnhild E Brandlistuen

    Full Text Available During pregnancy, many women experience sleep problems and anxiety that require treatment. The long-term safety for the child of maternal benzodiazepine (BZD and z-hypnotic use during pregnancy remains controversial.We conducted a cohort and a sibling control study using data from the Norwegian Mother and Child Cohort Study. Data on use of BZD and z-hypnotics, internalizing and externalizing outcomes, and covariates were collected from mothers at gestational weeks 17 and 30 and when children were 0.5, 1.5, and 3 years of age. The total sample consisted of 71,996 children (19,297 siblings at 1.5 years and 55,081 children (13,779 siblings at 3 years. Short-term use was defined as use in one pregnancy period only. Long-term use was defined as use in two or more pregnancy periods. Linear full cohort random-effect and sibling-matched fixed-effect regression models were used to compare internalizing and externalizing behavior in children prenatally exposed compared to those unexposed in the full cohort of pregnancies accounting for family clusters, as well as within sibling clusters comparing pregnancies with discordant exposures. Propensity score (PS adjustment included variables on indication for use (sleep problems, symptoms of anxiety and depression and other potential confounding factors.Long-term prenatal exposure to BZD or z-hypnotics was associated with increased internalizing behavior in crude cohort analyses and at age 1.5 years after PS adjustment in sibling-matched fixed-effect models [β 0.60, 95% confidence interval 0.17-0.95]. Analyses on specific drug groups showed that prenatal exposure to BZD-anxiolytics was associated with increased internalizing problems at both 1.5 years [β 0.25, 0.01-0.49] and 3 years [β 0.26, 0.002-0.52] while exposure to z-hypnotics was not associated with any adverse outcomes after adjustment.The findings suggest a moderate association between BZD-anxiolytic exposure and child internalizing problems that is

  5. Inhibitory mechanism of the matching heuristic in syllogistic reasoning.

    Science.gov (United States)

    Tse, Ping Ping; Moreno Ríos, Sergio; García-Madruga, Juan Antonio; Bajo Molina, María Teresa

    2014-11-01

    A number of heuristic-based hypotheses have been proposed to explain how people solve syllogisms with automatic processes. In particular, the matching heuristic employs the congruency of the quantifiers in a syllogism—by matching the quantifier of the conclusion with those of the two premises. When the heuristic leads to an invalid conclusion, successful solving of these conflict problems requires the inhibition of automatic heuristic processing. Accordingly, if the automatic processing were based on processing the set of quantifiers, no semantic contents would be inhibited. The mental model theory, however, suggests that people reason using mental models, which always involves semantic processing. Therefore, whatever inhibition occurs in the processing implies the inhibition of the semantic contents. We manipulated the validity of the syllogism and the congruency of the quantifier of its conclusion with those of the two premises according to the matching heuristic. A subsequent lexical decision task (LDT) with related words in the conclusion was used to test any inhibition of the semantic contents after each syllogistic evaluation trial. In the LDT, the facilitation effect of semantic priming diminished after correctly solved conflict syllogisms (match-invalid or mismatch-valid), but was intact after no-conflict syllogisms. The results suggest the involvement of an inhibitory mechanism of semantic contents in syllogistic reasoning when there is a conflict between the output of the syntactic heuristic and actual validity. Our results do not support a uniquely syntactic process of syllogistic reasoning but fit with the predictions based on mental model theory. Copyright © 2014 Elsevier B.V. All rights reserved.

  6. Time-dependent problems in quantum-mechanical state reconstruction

    International Nuclear Information System (INIS)

    Leonhardt, U.; Bardroff, P. J.

    1997-01-01

    We study the state reconstruction of wave packets that travel in time-dependent potentials. We solve the problem for explicitly time-dependent potentials. We solve the problem for explicitly time-dependent harmonic oscillators and sketch a general adaptive technique for finding the wave function that matches and observed evolution. (authors)

  7. Spatial competition with intermediated matching

    NARCIS (Netherlands)

    van Raalte, C.L.J.P.; Webers, H.M.

    1995-01-01

    This paper analyzes the spatial competition in commission fees between two match makers. These match makers serve as middlemen between buyers and sellers who are located uniformly on a circle. The profits of the match makers are determined by their respective market sizes. A limited willingness to

  8. The fears, phobias and anxieties of children with autism spectrum disorders and Down syndrome: comparisons with developmentally and chronologically age matched children.

    Science.gov (United States)

    Evans, David W; Canavera, Kristin; Kleinpeter, F Lee; Maccubbin, Elise; Taga, Ken

    2005-01-01

    This study compared the fears and behavior problems of 25 children with an autism spectrum disorder (ASD), 43 children with Down syndrome (DS), 45 mental age (MA) matched children, and 37 chronologically age (CA) matched children. Children's fears, phobias, anxieties and behavioral problems were assessed using parent reports. Significant differences emerged across the diagnostic groups on a variety of fears. Children with ASD were reported to have more situation phobias and medical fears, but fewer fears of harm/injury compared to all other groups. The groups also differed in terms of the pattern of correlations between fears, phobias, anxieties and behavior problems. For children with ASD, fears, phobias and anxieties were closely related to problem behaviors, whereas fears, phobias, and anxieties were less related to behavioral symptoms for the other groups of subjects. Such findings suggest that children with ASD exhibit a distinct profile of fear and anxiety compared to other mental age and chronologically age-matched children, and these fears are related to the symptoms associated with ASD.

  9. A Linear Programming Reformulation of the Standard Quadratic Optimization Problem

    NARCIS (Netherlands)

    de Klerk, E.; Pasechnik, D.V.

    2005-01-01

    The problem of minimizing a quadratic form over the standard simplex is known as the standard quadratic optimization problem (SQO).It is NPhard, and contains the maximum stable set problem in graphs as a special case.In this note we show that the SQO problem may be reformulated as an (exponentially

  10. Entropy Stable Summation-by-Parts Formulations for Compressible Computational Fluid Dynamics

    KAUST Repository

    Carpenter, M.H.

    2016-11-09

    A systematic approach based on a diagonal-norm summation-by-parts (SBP) framework is presented for implementing entropy stable (SS) formulations of any order for the compressible Navier–Stokes equations (NSE). These SS formulations discretely conserve mass, momentum, energy and satisfy a mathematical entropy equality for smooth problems. They are also valid for discontinuous flows provided sufficient dissipation is added at shocks and discontinuities to satisfy an entropy inequality. Admissible SBP operators include all centred diagonal-norm finite-difference (FD) operators and Legendre spectral collocation-finite element methods (LSC-FEM). Entropy stable multiblock FD and FEM operators follows immediately via nonlinear coupling operators that ensure conservation, accuracy and preserve the interior entropy estimates. Nonlinearly stable solid wall boundary conditions are also available. Existing SBP operators that lack a stability proof (e.g. weighted essentially nonoscillatory) may be combined with an entropy stable operator using a comparison technique to guarantee nonlinear stability of the pair. All capabilities extend naturally to a curvilinear form of the NSE provided that the coordinate mappings satisfy a geometric conservation law constraint. Examples are presented that demonstrate the robustness of current state-of-the-art entropy stable SBP formulations.

  11. Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.

    Science.gov (United States)

    Peng, Huan-Kai; Lee, Hao-Chih; Pan, Jia-Yu; Marculescu, Radu

    2016-01-01

    In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.

  12. Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization.

    Directory of Open Access Journals (Sweden)

    Huan-Kai Peng

    Full Text Available In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications.

  13. Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization

    Science.gov (United States)

    Peng, Huan-Kai; Lee, Hao-Chih; Pan, Jia-Yu; Marculescu, Radu

    2016-01-01

    In this paper, we define a new problem related to social media, namely, the data-driven engineering of social dynamics. More precisely, given a set of observations from the past, we aim at finding the best short-term intervention that can lead to predefined long-term outcomes. Toward this end, we propose a general formulation that covers two useful engineering tasks as special cases, namely, pattern matching and profit maximization. By incorporating a deep learning model, we derive a solution using convex relaxation and quadratic-programming transformation. Moreover, we propose a data-driven evaluation method in place of the expensive field experiments. Using a Twitter dataset, we demonstrate the effectiveness of our dynamics engineering approach for both pattern matching and profit maximization, and study the multifaceted interplay among several important factors of dynamics engineering, such as solution validity, pattern-matching accuracy, and intervention cost. Finally, the method we propose is general enough to work with multi-dimensional time series, so it can potentially be used in many other applications. PMID:26771830

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

  15. Inverse scattering problems with multi-frequencies

    International Nuclear Information System (INIS)

    Bao, Gang; Li, Peijun; Lin, Junshan; Triki, Faouzi

    2015-01-01

    This paper is concerned with computational approaches and mathematical analysis for solving inverse scattering problems in the frequency domain. The problems arise in a diverse set of scientific areas with significant industrial, medical, and military applications. In addition to nonlinearity, there are two common difficulties associated with the inverse problems: ill-posedness and limited resolution (diffraction limit). Due to the diffraction limit, for a given frequency, only a low spatial frequency part of the desired parameter can be observed from measurements in the far field. The main idea developed here is that if the reconstruction is restricted to only the observable part, then the inversion will become stable. The challenging task is how to design stable numerical methods for solving these inverse scattering problems inspired by the diffraction limit. Recently, novel recursive linearization based algorithms have been presented in an attempt to answer the above question. These methods require multi-frequency scattering data and proceed via a continuation procedure with respect to the frequency from low to high. The objective of this paper is to give a brief review of these methods, their error estimates, and the related mathematical analysis. More attention is paid to the inverse medium and inverse source problems. Numerical experiments are included to illustrate the effectiveness of these methods. (topical review)

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

  17. Real-time vehicle matching for multi-camera tunnel surveillance

    Science.gov (United States)

    Jelača, Vedran; Niño Castañeda, Jorge Oswaldo; Frías-Velázquez, Andrés; Pižurica, Aleksandra; Philips, Wilfried

    2011-03-01

    Tracking multiple vehicles with multiple cameras is a challenging problem of great importance in tunnel surveillance. One of the main challenges is accurate vehicle matching across the cameras with non-overlapping fields of view. Since systems dedicated to this task can contain hundreds of cameras which observe dozens of vehicles each, for a real-time performance computational efficiency is essential. In this paper, we propose a low complexity, yet highly accurate method for vehicle matching using vehicle signatures composed of Radon transform like projection profiles of the vehicle image. The proposed signatures can be calculated by a simple scan-line algorithm, by the camera software itself and transmitted to the central server or to the other cameras in a smart camera environment. The amount of data is drastically reduced compared to the whole image, which relaxes the data link capacity requirements. Experiments on real vehicle images, extracted from video sequences recorded in a tunnel by two distant security cameras, validate our approach.

  18. Relative Match Intensities at High Altitude in Highly-Trained Young Soccer Players (ISA3600).

    Science.gov (United States)

    Buchheit, Martin; Hammond, Kristal; Bourdon, Pitre C; Simpson, Ben M; Garvican-Lewis, Laura A; Schmidt, Walter F; Gore, Christopher J; Aughey, Robert J

    2015-03-01

    To compare relative match intensities of sea-level versus high-altitude native soccer players during a 2-week camp at 3600 m, data from 7 sea-level (Australian U17 National team, AUS) and 6 high-altitude (a Bolivian U18 team, BOL) native soccer players were analysed. Two matches were played at sea-level and three at 3600 m on Days 1, 6 and 13. The Yo-Yo Intermittent recovery test (vYo-YoIR1) was performed at sea-level, and on Days 3 and 10. Match activity profiles were measured via 10-Hz GPS. Distance covered >14.4 km.h(-1) (D>14.4 km·h(-1)) and >80% of vYo-YoIR1 (D>80%vYo-YoIR1) were examined. Upon arrival at altitude, there was a greater decrement in vYo-YoIR1 (Cohen's d +1.0, 90%CL ± 0.8) and D>14.4 km·h(-1) (+0.5 ± 0.8) in AUS. D>14.4 km.h(-1) was similarly reduced relative to vYo-YoIR1 in both groups, so that D>80%vYo-YoIR1 remained similarly unchanged (-0.1 ± 0.8). Throughout the altitude sojourn, vYo-YoIR1 and D>14.4 km·h(-1) increased in parallel in AUS, so that D>80%vYo-YoIR1 remained stable in AUS (+6.0%/match, 90%CL ± 6.7); conversely D>80%vYo-YoIR1 decreased largely in BOL (-12.2%/match ± 6.2). In sea-level natives competing at high-altitude, changes in match running performance likely follow those in high-intensity running performance. Bolivian data confirm that increases in 'fitness' do not necessarily translate into greater match running performance, but rather in reduced relative exercise intensity. Key pointsWhen playing at high-altitude, players may alter their activities during matches in relation to their transient maximal physical capacities, possibly to maintain a 'tolerable' relative exercise intensity.While there is no doubt that running performance per se in not the main determinant of match outcomes (Carling, 2013), fitness levels influence relative match intensity (Buchheit et al., 2012, Mendez-Villanueva et al., 2013), which in-turn may impact on decision making and skill performance (Rampinini et al., 2008).In the context of

  19. Progress in stable isotope analysis and new possibilities of clinical investigations

    International Nuclear Information System (INIS)

    Roth, E.

    1989-01-01

    The use of stable isotopes in medicine rests on three possibilities offered by labelling: identification of an element, a molecule, or a fragment of a molecule along its biological pathway; quantification of biological pools by isotopic dilution; measurement of metabolization rates, and more generally of clearances. Whenever a corporal function experiences a disregulation reflected either by changes in metabolic activity or modifications of the importance of pools of certain molecules, the possibility exists of making use of isotopes in diagnosis. Examples of practical applications of stable isotopes are given and analytical problems that had to be solved are underlined

  20. Unconditionally energy stable numerical schemes for phase-field vesicle membrane model

    Science.gov (United States)

    Guillén-González, F.; Tierra, G.

    2018-02-01

    Numerical schemes to simulate the deformation of vesicles membranes via minimizing the bending energy have been widely studied in recent times due to its connection with many biological motivated problems. In this work we propose a new unconditionally energy stable numerical scheme for a vesicle membrane model that satisfies exactly the conservation of volume constraint and penalizes the surface area constraint. Moreover, we extend these ideas to present an unconditionally energy stable splitting scheme decoupling the interaction of the vesicle with a surrounding fluid. Finally, the well behavior of the proposed schemes are illustrated through several computational experiments.

  1. Modelling of dynamically stable AR-601M robot locomotion in Simulink

    Directory of Open Access Journals (Sweden)

    Khusainov Ramil

    2016-01-01

    Full Text Available Humanoid robots will gradually play an important role in our daily lives. Currently, research on anthropomorphic robots and biped locomotion is one of the most important problems in the field of mobile robotics, and the development of reliable control algorithms for them is a challenging task. In this research two algorithms for stable walking of Russian anthropomorphic robot AR-601M with 41 Degrees of Freedom (DoF are investigated. To achieve a human-like dynamically stable locomotion 6 DoF in each robot leg are controlled with Virtual Height Inverted Pendulum and Preview control methods.

  2. Stable isotope geochemistry : definitions, terminology, measurement and some applications

    International Nuclear Information System (INIS)

    Faure, K.

    2014-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. These applications can be broadly classified into four main types: 1. Thermometry: Formation temperatures of rock and mineral systems are determined on the basis of temperature-dependent fractionations of the isotopic ratios between two or more cogenetic phases. 2. Tracers: Reservoirs like the ocean, the mantle, meteoric waters and organic matter have distinct stable isotope signatures that can be used to trace the origin of rocks, fluids, contaminants etc. 3. Reaction mechanism: Distinctions can be made between diffusion and recrystallization, open and closed systems and bacterial and thermogenic processes. 4. Chemostratigraphy: Abrupt changes (excursions) in the stable isotope ratios of ocean sediments and certain terrestrial materials can be used as stratigraphic markers. (author)

  3. Stable isotope geochemistry: definitions, terminology, measurement and some applications

    International Nuclear Information System (INIS)

    Faure, K.

    2015-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. These applications can be broadly classified into four main types: 1. Thermometry: Formation temperatures of rock and mineral systems are determined on the basis of temperature-dependent fractionations of the isotopic ratios between two or more cogenetic phases. 2. Tracers: Reservoirs like the ocean, the mantle, meteoric waters and organic matter have distinct stable isotope signatures that can be used to trace the origin of rocks, fluids, contaminants etc. 3. Reaction mechanism: Distinctions can be made between diffusion and recrystallization, open and closed systems and bacterial and thermogenic processes. 4. Chemostratigraphy: Abrupt changes (excursions) in the stable isotope ratios of ocean sediments and certain terrestrial materials can be used as stratigraphic markers. (author).

  4. Stable isotope geochemistry : definitions, terminology, measurement and some applications

    International Nuclear Information System (INIS)

    Faure, K.

    2016-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. These applications can be broadly classified into four main types: 1. Thermometry: Formation temperatures of rock and mineral systems are determined on the basis of temperature-dependent fractionations of the isotopic ratios between two or more cogenetic phases. 2. Tracers: Reservoirs like the ocean, the mantle, meteoric waters and organic matter have distinct stable isotope signatures that can be used to trace the origin of rocks, fluids, contaminants etc. 3. Reaction mechanism: Distinctions can be made between diffusion and recrystallization, open and closed systems and bacterial and thermogenic processes. 4. Chemostratigraphy: Abrupt changes (excursions) in the stable isotope ratios of ocean sediments and certain terrestrial materials can be used as stratigraphic markers. (author).

  5. Construction of second order accurate monotone and stable residual distribution schemes for unsteady flow problems

    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

  6. Stinging Insect Matching Game

    Science.gov (United States)

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

  7. Biological factors of natural and artificial ecosystems stable (unstable) functioning

    Science.gov (United States)

    Pechurkin, Nikolai S.

    The problem of sustainable development of humanity on Earth and the problem of supporting human life in space have the same scientific and methodological bases. The key to solve both problems is a long term maintenance of balanced material cycle. As a whole, natural or artificial ecosystems are to be more closed than open, but their elements (links of systems) are to be substantially open in interactions with each other. Prolonged stable interactions of different links have to have unique joint results - closed material cycling or biotic turnover. It is necessary to include, at least, three types of main links into any system to support real material cycling: producers, consumers, reducers. Producer links are now under studies in many laboratories. It is evident that the higher productivity of link, the lower link stability. Especially, it concerns with parasite impact to plants. As usual, artificial ecosystems are more simple (incomplete) than natural ecosystems, sometimes, they have not enough links for prolonged stable functioning. For example, life support system for space flight can be incomplete in consumer link, having only some crew persons, instead of interacting populations of consumers. As for reducer link, it is necessary to "organize" a special coordinated work of microbial biocenoses to fulfill proper cycling. Possible evolution of links, their self development is a matter of special attention for the maintenance of prolonged stable functioning. It's the most danger for systems with populations of quickly reproducing, so-called, R - strategists, according to symbols of logistic equation. From another side, quick reproduction of R - strategists is able to increase artificial ecosystems and their links functioning. After some damages of system, R - strategist's link can be quickly "self repaired" up to level of normal functioning. Some experimental data of this kind and mathematical models are to be discussed in the paper. This work is supported by

  8. The nature of stable insomnia phenotypes.

    Science.gov (United States)

    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.

  9. Phase behaviour and structure of stable complexes of oppositely charged polyelectrolytes

    Science.gov (United States)

    Mengarelli, V.; Auvray, L.; Zeghal, M.

    2009-03-01

    We study the formation and structure of stable electrostatic complexes between oppositely charged polyelectrolytes, a long polymethacrylic acid and a shorter polyethylenimine, at low pH, where the polyacid is weakly charged. We explore the phase diagram as a function of the charge and concentration ratio of the constituents. In agreement with theory, turbidity and ζ potential measurements show two distinct regimes of weak and strong complexation, which appear successively as the pH is increased and are separated by a well-defined limit. Weak complexes observed by neutron scattering and contrast matching have an open, non-compact structure, while strong complexes are condensed.

  10. Stable solutions of nonlocal electron heat transport equations

    International Nuclear Information System (INIS)

    Prasad, M.K.; Kershaw, D.S.

    1991-01-01

    Electron heat transport equations with a nonlocal heat flux are in general ill-posed and intrinsically unstable, as proved by the present authors [Phys. Fluids B 1, 2430 (1989)]. A straightforward numerical solution of these equations will therefore lead to absurd results. It is shown here that by imposing a minimal set of constraints on the problem it is possible to arrive at a globally stable, consistent, and energy conserving numerical solution

  11. Image matching for digital close-range stereo photogrammetry based on constraints of Delaunay triangulated network and epipolar-line

    Science.gov (United States)

    Zhang, K.; Sheng, Y. H.; Li, Y. Q.; Han, B.; Liang, Ch.; Sha, W.

    2006-10-01

    In the field of digital photogrammetry and computer vision, the determination of conjugate points in a stereo image pair, referred to as "image matching," is the critical step to realize automatic surveying and recognition. Traditional matching methods encounter some problems in the digital close-range stereo photogrammetry, because the change of gray-scale or texture is not obvious in the close-range stereo images. The main shortcoming of traditional matching methods is that geometric information of matching points is not fully used, which will lead to wrong matching results in regions with poor texture. To fully use the geometry and gray-scale information, a new stereo image matching algorithm is proposed in this paper considering the characteristics of digital close-range photogrammetry. Compared with the traditional matching method, the new algorithm has three improvements on image matching. Firstly, shape factor, fuzzy maths and gray-scale projection are introduced into the design of synthetical matching measure. Secondly, the topology connecting relations of matching points in Delaunay triangulated network and epipolar-line are used to decide matching order and narrow the searching scope of conjugate point of the matching point. Lastly, the theory of parameter adjustment with constraint is introduced into least square image matching to carry out subpixel level matching under epipolar-line constraint. The new algorithm is applied to actual stereo images of a building taken by digital close-range photogrammetric system. The experimental result shows that the algorithm has a higher matching speed and matching accuracy than pyramid image matching algorithm based on gray-scale correlation.

  12. Analysis of a Cartesian PML approximation to acoustic scattering problems in and

    KAUST Repository

    Bramble, James H.

    2013-08-01

    We consider the application of a perfectly matched layer (PML) technique applied in Cartesian geometry to approximate solutions of the acoustic scattering problem in the frequency domain. The PML is viewed as a complex coordinate shift ("stretching") and leads to a variable complex coefficient equation for the acoustic wave posed on an infinite domain, the complement of the bounded scatterer. The use of Cartesian geometry leads to a PML operator with simple coefficients, although, still complex symmetric (non-Hermitian). The PML reformulation results in a problem whose solution coincides with the original solution inside the PML layer while decaying exponentially outside. The rapid decay of the PML solution suggests truncation to a bounded domain with a convenient outer boundary condition and subsequent finite element approximation (for the truncated problem). This paper provides new stability estimates for the Cartesian PML approximations both on the infinite and the truncated domain. We first investigate the stability of the infinite PML approximation as a function of the PML strength σ0. This is done for PML methods which involve continuous piecewise smooth stretching as well as piecewise constant stretching functions. We next introduce a truncation parameter M which determines the size of the PML layer. Our analysis shows that the truncated PML problem is stable provided that the product of Mσ0 is sufficiently large, in which case the solution of the problem on the truncated domain converges exponentially to that of the original problem in the domain of interest near the scatterer. This justifies the simple computational strategy of selecting a fixed PML layer and increasing σ0 to obtain the desired accuracy. The results of numerical experiments varying M and σ0 are given which illustrate the theoretically predicted behavior. © 2013 Elsevier B.V. All rights reserved.

  13. Groin Problems in Male Soccer Players Are More Common Than Previously Reported

    DEFF Research Database (Denmark)

    Harøy, Joar; Clarsen, Ben; Thorborg, Kristian

    2017-01-01

    surveillance method developed to capture acute and overuse problems. STUDY DESIGN: Descriptive epidemiology study. METHODS: We registered groin problems during a 6-week period of match congestion using the Oslo Sports Trauma Research Center Overuse Injury Questionnaire. A total of 240 players from 15 teams......BACKGROUND: The majority of surveillance studies in soccer have used a time-loss injury definition, and many groin problems result from overuse, leading to gradually increasing pain and/or reduced performance without necessarily causing an absence from soccer training or match play. Thus......, the magnitude of groin problems in soccer has probably been underestimated in previous studies based on traditional injury surveillance methods. PURPOSE: To investigate the prevalence of groin problems among soccer players of both sexes and among male soccer players at different levels of play through a new...

  14. Stable isogeometric analysis of trimmed geometries

    Science.gov (United States)

    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.

  15. Recent applications of stable isotopes in environmental medicine in germany

    International Nuclear Information System (INIS)

    Krumbiegel, P.; Herbarth, O.

    2000-01-01

    In the last few years, a new quality in the application of stable isotopes became manifest. It is the establishment of stable isotopes as a tool in medical routine diagnosis - a novel field of nuclear medicine - and in environmental-medical epidemiological surveys. Owing to missing suitable radioactive isotopes of the bio elements carbon and nitrogen and because of ethical problems in the human use of some radionuclides, the stable isotopes 13 C and 1% N play a key role in this new field. A review is given about four new stable isotope-aided methods for in vivo organ function test. Three of them were developed in Leipzig, germany, and one in houston/Texas. We have validated the tests and then introduced into medical and environmental routine diagnostic use: ( 15 N Methacetin and ( 13 C) methacetin liver function tests to characterize the detoxification capacity of the human liver; ( 15 N) Urea and ( 13 C) urea tests to detect the colonization of the human stomach by the bacterium helicobacter pylori. This bacterium is, as known, responsible for gastritis and ulcer of the gastrointestinal tract. The transmission ways of H. Pylori are under investigation world-wide

  16. Changing predictions, stable recognition: Children's representations of downward incline motion.

    Science.gov (United States)

    Hast, Michael; Howe, Christine

    2017-11-01

    Various studies to-date have demonstrated children hold ill-conceived expressed beliefs about the physical world such as that one ball will fall faster than another because it is heavier. At the same time, they also demonstrate accurate recognition of dynamic events. How these representations relate is still unresolved. This study examined 5- to 11-year-olds' (N = 130) predictions and recognition of motion down inclines. Predictions were typically in error, matching previous work, but children largely recognized correct events as correct and rejected incorrect ones. The results also demonstrate while predictions change with increasing age, recognition shows signs of stability. The findings provide further support for a hybrid model of object representations and argue in favour of stable core cognition existing alongside developmental changes. Statement of contribution What is already known on this subject? Children's predictions of physical events show limitations in accuracy Their recognition of such events suggests children may use different knowledge sources in their reasoning What the present study adds? Predictions fluctuate more strongly than recognition, suggesting stable core cognition But recognition also shows some fluctuation, arguing for a hybrid model of knowledge representation. © 2017 The British Psychological Society.

  17. Successive substitution one-leg hybrid P-stable LMM for initial value ...

    African Journals Online (AJOL)

    This paper derives P-stable successive substitution one-leg hybrid linear multistep methods for the numerical solution of second order initial value problems in ordinary differential equations without explicit first order derivative. The methods are demonstrated by a numerical example also considered by Fatunla, et al (1997) ...

  18. Asymptotically Matched Layer (AML) for transient wave propagation in a moving frame of reference

    DEFF Research Database (Denmark)

    Madsen, Stine Skov; Krenk, Steen

    2017-01-01

    The paper presents an Asymptotically Matched Layer (AML) formulation in a moving frame of reference for transient dynamic response of a multi-layer 2D half-space. A displacement based finite element formulation of the convected domain problem is presented together with the AML formulation in whic...

  19. Real-time eSports Match Result Prediction

    OpenAIRE

    Yang, Yifan; Qin, Tian; Lei, Yu-Heng

    2016-01-01

    In this paper, we try to predict the winning team of a match in the multiplayer eSports game Dota 2. To address the weaknesses of previous work, we consider more aspects of prior (pre-match) features from individual players' match history, as well as real-time (during-match) features at each minute as the match progresses. We use logistic regression, the proposed Attribute Sequence Model, and their combinations as the prediction models. In a dataset of 78362 matches where 20631 matches contai...

  20. How can the co-ordinate transformation method of beam matching be extended to include separately labelled collimators?

    Science.gov (United States)

    Morgan-Fletcher, S; McKenzie, A L

    1996-03-01

    The problem of matching radiation beams was tackled by Siddon in 1980 using co-ordinate transformations. Since then, the need to distinguish between individual collimators in prescriptions of treatment set-up, brought about by the widespread use of 3-D treatment planning systems and asymmetric fields, as well as a reversal of the rotation sense in the turntable co-ordinate system proposed by the International Electrotechnical Commission, have made it necessary to revisit this particular problem. This paper builds upon Siddon's general equations for the particular case of matching beams, and derives expressions for calculating treatment-unit settings which may be used in a computer program without the need to perform matrix manipulation. The expression treat the individual collimator jaws separately.

  1. Solving inverse problems through a smooth formulation of multiple-point geostatistics

    DEFF Research Database (Denmark)

    Melnikova, Yulia

    be inferred, for instance, from a conceptual geological model termed a training image.The main motivation for this study was the challenge posed by history matching, an inverse problem aimed at estimating rock properties from production data. We addressed two main difficulties of the history matching problem...... corresponding inverse problems. However, noise in data, non-linear relationships and sparse observations impede creation of realistic reservoir models. Including complex a priori information on reservoir parameters facilitates the process of obtaining acceptable solutions. Such a priori knowledge may...... strategies including both theoretical motivation and practical aspects of implementation. Finally, it is complemented by six research papers submitted, reviewed and/or published in the period 2010 - 2013....

  2. Rapid matching of stereo vision based on fringe projection profilometry

    Science.gov (United States)

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

    2016-09-01

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

  3. An improved ASIFT algorithm for indoor panorama image matching

    Science.gov (United States)

    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.

  4. An Adaptive Impedance Matching Network with Closed Loop Control Algorithm for Inductive Wireless Power Transfer.

    Science.gov (United States)

    Miao, Zhidong; Liu, Dake; Gong, Chen

    2017-08-01

    For an inductive wireless power transfer (IWPT) system, maintaining a reasonable power transfer efficiency and a stable output power are two most challenging design issues, especially when coil distance varies. To solve these issues, this paper presents a novel adaptive impedance matching network (IMN) for IWPT system. In our adaptive IMN IWPT system, the IMN is automatically reconfigured to keep matching with the coils and to adjust the output power adapting to coil distance variation. A closed loop control algorithm is used to change the capacitors continually, which can compensate mismatches and adjust output power simultaneously. The proposed adaptive IMN IWPT system is working at 125 kHz for 2 W power delivered to load. Comparing with the series resonant IWPT system and fixed IMN IWPT system, the power transfer efficiency of our system increases up to 31.79% and 60% when the coupling coefficient varies in a large range from 0.05 to 0.8 for 2 W output power.

  5. An Adaptive Impedance Matching Network with Closed Loop Control Algorithm for Inductive Wireless Power Transfer

    Science.gov (United States)

    Miao, Zhidong; Liu, Dake

    2017-01-01

    For an inductive wireless power transfer (IWPT) system, maintaining a reasonable power transfer efficiency and a stable output power are two most challenging design issues, especially when coil distance varies. To solve these issues, this paper presents a novel adaptive impedance matching network (IMN) for IWPT system. In our adaptive IMN IWPT system, the IMN is automatically reconfigured to keep matching with the coils and to adjust the output power adapting to coil distance variation. A closed loop control algorithm is used to change the capacitors continually, which can compensate mismatches and adjust output power simultaneously. The proposed adaptive IMN IWPT system is working at 125 kHz for 2 W power delivered to load. Comparing with the series resonant IWPT system and fixed IMN IWPT system, the power transfer efficiency of our system increases up to 31.79% and 60% when the coupling coefficient varies in a large range from 0.05 to 0.8 for 2 W output power. PMID:28763011

  6. An Improvement on LSB Matching and LSB Matching Revisited Steganography Methods

    OpenAIRE

    Qazanfari, Kazem; Safabakhsh, Reza

    2017-01-01

    The aim of the steganography methods is to communicate securely in a completely undetectable manner. LSB Matching and LSB Matching Revisited steganography methods are two general and esiest methods to achieve this aim. Being secured against first order steganalysis methods is the most important feature of these methods. On the other hand, these methods don't consider inter pixel dependency. Therefore, recently, several steganalysis methods are proposed that by using co-occurrence matrix detec...

  7. Efficient line matching with homography

    Science.gov (United States)

    Shen, Yan; Dai, Yuxing; Zhu, Zhiliang

    2018-03-01

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

  8. A Propensity Score Matching Analysis of the Effects of Special Education Services.

    Science.gov (United States)

    Morgan, Paul L; Frisco, Michelle; Farkas, George; Hibel, Jacob

    2010-02-01

    We sought to quantify the effectiveness of special education services as naturally delivered in U.S. schools. Specifically, we examined whether children receiving special education services displayed (a) greater reading or mathematics skills, (b) more frequent learning-related behaviors, or (c) less frequent externalizing or internalizing problem behaviors than closely matched peers not receiving such services. To do so, we used propensity score matching techniques to analyze data from the Early Childhood Longitudinal-Study Kindergarten Cohort, 1998-1999, a large scale, nationally representative sample of U.S. schoolchildren. Collectively, results indicate that receipt of special education services has either a negative or statistically non-significant impact on children's learning or behavior. However, special education services do yield a small, positive effect on children's learning-related behaviors.

  9. Geographic Trends in the Plastic Surgery Match.

    Science.gov (United States)

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

    2016-01-01

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

  10. ECMOR 4. 4th European conference on the mathematics of oil recovery. Topic E: History match and recovery optimization. Proceedings

    Energy Technology Data Exchange (ETDEWEB)

    1994-01-01

    The report with collected proceedings from a conference, deals with mathematics of oil recovery with the focus on history match and recovery optimization. Topics of proceedings are as follow: Calculating optimal parameters for history matching; new technique to improve the efficiency of history matching of full-field models; flow constrained reservoir characterization using Bayesian inversion; analysis of multi-well pressure transient data; new approach combining neural networks and simulated annealing for solving petroleum inverse problems; automatic history matching by use of response surfaces and experimental design; determining the optimum location of a production well in oil reservoirs. Seven papers are prepared. 108 refs., 45 figs., 12 tabs.

  11. Shelf-stable foods through irradiation processing

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1995-11-01

    This survey has been produced from a database on analytical reference materials of biological and environmental origin, which is maintained at the International Atomic Energy Agency. It is an updated version of earlier reports, the last published in 1990. The information presented refers mostly to reference materials for trace element constituents; however, information is also included on a number of other selected measurands of relevance to IAEA programmes, i.e. radionuclides, stable isotopes, anions, cations, organometallic compounds and organic contaminants. The database presently contains over 10,000 analyte values for 455 measurands in 650 reference materials produced by 30 different suppliers. Additional information on the cost of the materials, the unit size supplied, and recommended minimum weight of material for analysis is also provided, if this information is available to the authors. It is expected that this survey will help analysts to select reference materials for quality assurance purposes that match as closely as possible, with respect to matrix type and concentrations of the measurands of interest, their samples to be analyzed. 22 refs, 2 tabs.

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

  13. Stable methods for ill-posed problems and application to reconstruction of atmospheric temperature profile

    International Nuclear Information System (INIS)

    Son, H.H.; Luong, P.T.; Loan, N.T.

    1990-04-01

    The problems of Remote Sensing (passive or active) are investigated on the base of main principle which consists in interpretation of radiometric electromagnetic measurements in such spectral interval where the radiation is sensitive to interested physical property of medium. Those problems such as an analysis of composition and structure of atmosphere using the records of scattered radiation, cloud identification, investigation of thermodynamic state and composition of system, reconstructing the atmospheric temperature profile on the base of data processing of infrared radiation emitted by system Earth-Atmosphere... belong to class of inverse problems of mathematical physics which are often incorrect. Int his paper a new class of regularized solution corresponding to general formulated RATP-problem is considered. (author). 14 refs, 3 figs, 3 tabs

  14. Ontology Matching Across Domains

    Science.gov (United States)

    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

  15. Hierarchical Stereo Matching in Two-Scale Space for Cyber-Physical System

    Directory of Open Access Journals (Sweden)

    Eunah Choi

    2017-07-01

    Full Text Available Dense disparity map estimation from a high-resolution stereo image is a very difficult problem in terms of both matching accuracy and computation efficiency. Thus, an exhaustive disparity search at full resolution is required. In general, examining more pixels in the stereo view results in more ambiguous correspondences. When a high-resolution image is down-sampled, the high-frequency components of the fine-scaled image are at risk of disappearing in the coarse-resolution image. Furthermore, if erroneous disparity estimates caused by missing high-frequency components are propagated across scale space, ultimately, false disparity estimates are obtained. To solve these problems, we introduce an efficient hierarchical stereo matching method in two-scale space. This method applies disparity estimation to the reduced-resolution image, and the disparity result is then up-sampled to the original resolution. The disparity estimation values of the high-frequency (or edge component regions of the full-resolution image are combined with the up-sampled disparity results. In this study, we extracted the high-frequency areas from the scale-space representation by using difference of Gaussian (DoG or found edge components, using a Canny operator. Then, edge-aware disparity propagation was used to refine the disparity map. The experimental results show that the proposed algorithm outperforms previous methods.

  16. Hierarchical Stereo Matching in Two-Scale Space for Cyber-Physical System.

    Science.gov (United States)

    Choi, Eunah; Lee, Sangyoon; Hong, Hyunki

    2017-07-21

    Dense disparity map estimation from a high-resolution stereo image is a very difficult problem in terms of both matching accuracy and computation efficiency. Thus, an exhaustive disparity search at full resolution is required. In general, examining more pixels in the stereo view results in more ambiguous correspondences. When a high-resolution image is down-sampled, the high-frequency components of the fine-scaled image are at risk of disappearing in the coarse-resolution image. Furthermore, if erroneous disparity estimates caused by missing high-frequency components are propagated across scale space, ultimately, false disparity estimates are obtained. To solve these problems, we introduce an efficient hierarchical stereo matching method in two-scale space. This method applies disparity estimation to the reduced-resolution image, and the disparity result is then up-sampled to the original resolution. The disparity estimation values of the high-frequency (or edge component) regions of the full-resolution image are combined with the up-sampled disparity results. In this study, we extracted the high-frequency areas from the scale-space representation by using difference of Gaussian (DoG) or found edge components, using a Canny operator. Then, edge-aware disparity propagation was used to refine the disparity map. The experimental results show that the proposed algorithm outperforms previous methods.

  17. The problem-oriented system, problem-knowledge coupling, and clinical decision making.

    Science.gov (United States)

    Weed, L L; Zimny, N J

    1989-07-01

    The information tool to aid us in making the clinical decisions discussed in this presentation is called the PKC. Our goal with patients should be to couple the knowledge of the unique patient to the knowledge in the literature and get the best possible match. This approach requires combinatorial versus probabilistic thinking. In the real world, ideal matches are not found. Therefore, it is critical to exhaust the patient's uniqueness first and only then use probabilities to settle further uncertainties. It is an error to teach people how to deal with uncertainty instead of teaching them to clean up a great deal of the uncertainty first. Patients must be involved in this endeavor. In essence, they have a PhD in their own uniqueness, and it is this uniqueness that is very powerful in solving complex problems. This method of patient evaluation and management cannot be used with the unaided mind. It requires new and powerful information tools like the PKC. All information that is relevant to a problem should be included in the coupler. It should encompass differing points of view, and the rationale should be made explicit to clinician and patient alike. When complete, the coupler should represent an interdisciplinary compilation of questions and tests that are expected to be collected every time in the clinic for the type of problem the coupler represents. This method will provide a basis for quality control because the contents of the coupler now have defined what we expect to occur in every patient encounter.(ABSTRACT TRUNCATED AT 250 WORDS)

  18. Pattern recognition and string matching

    CERN Document Server

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

  19. Matching faces with emotional expressions

    Directory of Open Access Journals (Sweden)

    Wenfeng eChen

    2011-08-01

    Full Text Available There is some evidence that faces with a happy expression are recognized better than faces with other expressions. However, little is known about whether this happy face advantage also applies to perceptual face matching, and whether similar differences exist among other expressions. Using a sequential matching paradigm, we systematically compared the effects of seven basic facial expressions on identity recognition. Identity matching was quickest when a pair of faces had an identical happy/sad/neutral expression, poorer when they had a fearful/surprise/angry expression, and poorest when they had a disgust expression. Faces with a happy/sad/fear/surprise expression were matched faster than those with an anger/disgust expression when the second face in a pair had a neutral expression. These results demonstrate that effects of facial expression on identity recognition are not limited to happy faces when a learned face is immediately tested. The results suggest different influences of expression in perceptual matching and long-term recognition memory.

  20. The Kent Face Matching Test.

    Science.gov (United States)

    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.

  1. One-Year stable perovskite solar cells by 2D/3D interface engineering

    Science.gov (United States)

    Grancini, G.; Roldán-Carmona, C.; Zimmermann, I.; Mosconi, E.; Lee, X.; Martineau, D.; Narbey, S.; Oswald, F.; de Angelis, F.; Graetzel, M.; Nazeeruddin, Mohammad Khaja

    2017-06-01

    Despite the impressive photovoltaic performances with power conversion efficiency beyond 22%, perovskite solar cells are poorly stable under operation, failing by far the market requirements. Various technological approaches have been proposed to overcome the instability problem, which, while delivering appreciable incremental improvements, are still far from a market-proof solution. Here we show one-year stable perovskite devices by engineering an ultra-stable 2D/3D (HOOC(CH2)4NH3)2PbI4/CH3NH3PbI3 perovskite junction. The 2D/3D forms an exceptional gradually-organized multi-dimensional interface that yields up to 12.9% efficiency in a carbon-based architecture, and 14.6% in standard mesoporous solar cells. To demonstrate the up-scale potential of our technology, we fabricate 10 × 10 cm2 solar modules by a fully printable industrial-scale process, delivering 11.2% efficiency stable for >10,000 h with zero loss in performances measured under controlled standard conditions. This innovative stable and low-cost architecture will enable the timely commercialization of perovskite solar cells.

  2. Probability matching and strategy availability

    OpenAIRE

    J. Koehler, Derek; Koehler, Derek J.; James, Greta

    2010-01-01

    Findings from two experiments indicate that probability matching in sequential choice arises from an asymmetry in strategy availability: The matching strategy comes readily to mind, whereas a superior alternative strategy, maximizing, does not. First, compared with the minority who spontaneously engage in maximizing, the majority of participants endorse maximizing as superior to matching in a direct comparison when both strategies are described. Second, when the maximizing strategy is brought...

  3. An Incentive Theory of Matching

    OpenAIRE

    Brown, Alessio J. G.; Merkl, Christian; Snower, Dennis J.

    2010-01-01

    This paper examines the labour market matching process by distinguishing its two component stages: the contact stage, in which job searchers make contact with employers and the selection stage, in which they decide whether to match. We construct a theoretical model explaining two-sided selection through microeconomic incentives. Firms face adjustment costs in responding to heterogeneous variations in the characteristics of workers and jobs. Matches and separations are described through firms'...

  4. The Interaction Between Schema Matching and Record Matching in Data Integration

    KAUST Repository

    Gu, Binbin

    2016-09-20

    Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have been thoroughly studied separately, but few attention has been paid to the interaction of SM and RM. In this work, we find that, even alternating them in a simple manner, SM and RM can benefit from each other to reach a better integration performance (i.e., in terms of precision and recall). Therefore, combining SM and RM is a promising solution for improving data integration. To this end, we define novel matching rules for SM and RM, respectively, that is, every SM decision is made based on intermediate RM results, and vice versa, such that SM and RM can be performed alternately. The quality of integration is guaranteed by a Matching Likelihood Estimation model and the control of semantic drift, which prevent the effect of mismatch magnification. To reduce the computational cost, we design an index structure based on q-grams and a greedy search algorithm that can reduce around 90 percent overhead of the interaction. Extensive experiments on three data collections show that the combination and interaction between SM and RM significantly outperforms previous works that conduct SM and RM separately.

  5. Stable isotope geochemistry : definitions, terminology, measurement and some applications

    International Nuclear Information System (INIS)

    Faure, K.

    2009-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 palaeolimatic 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. These applications can be broadly classified into four main types: 1. Thermometry: Formation temperatures of rock and mineral systems are determined on the basis of temperature-dependent fractionations of the isotopic ratios between two or more cogenetic phases. 2. Tracers: Reservoirs like the ocean, the mantle, meteroic waters and organic matter have distinct stable isotope signatures that can be used to trace the origin of rocks, fluids, contaminants etc. 3. Reaction mechanism: Distinctions can be made between diffusion and recrystallization, open and closed systems and bacterial and thermogenic processes. 4. Chemostratigraphy: Abrupt changes (excursions) in the stable isotope ratios of ocean sediments and certain terrestrial materials can be used as stratigraphic markers. (author). 56 refs., 11 figs., 2 tabs.

  6. Stable isotope geochemistry : definitions, terminology, measurement and some applications

    International Nuclear Information System (INIS)

    Faure, K.

    2012-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. These applications can be broadly classified into four main types: 1. Thermometry: Formation temperatures of rock and mineral systems are determined on the basis of temperature-dependent fractionations of the isotopic ratios between two or more cogenetic phases. 2. Tracers: Reservoirs like the ocean, the mantle, meteoric waters and organic matter have distinct stable isotope signatures that can be used to trace the origin of rocks, fluids, contaminants etc. 3. Reaction mechanism: Distinctions can be made between diffusion and recrystallization, open and closed systems and bacterial and thermogenic processes. 4. Chemostratigraphy: Abrupt changes (excursions) in the stable isotope ratios of ocean sediments and certain terrestrial materials can be used as stratigraphic markers. (author). 89 refs., 12 figs., 2 tabs.

  7. Stable isotope geochemistry : definitions, terminology, measurement and some applications

    International Nuclear Information System (INIS)

    Faure, K.

    2008-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 palaeolimatic 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. These applications can be broadly classified into four main types: 1. Thermometry: Formation temperatures of rock and mineral systems are determined on the basis of temperature-dependent fractionations of the isotopic ratios between two or more cogenetic phases. 2. Tracers: Reservoirs like the ocean, the mantle, meteroic waters and organic matter have distinct stable isotope signatures that can be used to trace the origin of rocks, fluids, contaminants etc. 3. Reaction mechanism: Distinctions can be made between diffusion and recrystallization, open and closed systems and bacterial and thermogenic processes. 4. Chemostratigraphy: Abrupt changes (excursions) in the stable isotope ratios of ocean sediments and certain terrestrial materials can be used as stratigraphic markers. (author). 56 refs., 11 figs., 2 tabs

  8. Stable isotope geochemistry : definitions, terminology, measurement and some applications

    International Nuclear Information System (INIS)

    Faure, K.

    2009-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 palaeolimatic 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. These applications can be broadly classified into four main types: 1. Thermometry: Formation temperatures of rock and mineral systems are determined on the basis of temperature-dependent fractionations of the isotopic ratios between two or more cogenetic phases. 2. Tracers: Reservoirs like the ocean, the mantle, meteroic waters and organic matter have distinct stable isotope signatures that can be used to trace the origin of rocks, fluids, contaminants etc. 3. Reaction mechanism: Distinctions can be made between diffusion and recrystallization, open and closed systems and bacterial and thermogenic processes. 4. Chemostratigraphy: Abrupt changes (excursions) in the stable isotope ratios of ocean sediments and certain terrestrial materials can be used as stratigraphic markers. (author). 56 refs., 11 figs., 2 tabs

  9. Stable isotope geochemistry : definitions, terminology, measurement and some applications

    International Nuclear Information System (INIS)

    Faure, K.

    2013-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. These applications can be broadly classified into four main types: 1. Thermometry: Formation temperatures of rock and mineral systems are determined on the basis of temperature-dependent fractionations of the isotopic ratios between two or more cogenetic phases. 2. Tracers: Reservoirs like the ocean, the mantle, meteoric waters and organic matter have distinct stable isotope signatures that can be used to trace the origin of rocks, fluids, contaminants etc. 3. Reaction mechanism: Distinctions can be made between diffusion and recrystallization, open and closed systems and bacterial and thermogenic processes. 4. Chemostratigraphy: Abrupt changes (excursions) in the stable isotope ratios of ocean sediments and certain terrestrial materials can be used as stratigraphic markers. (author). 91 refs., 12 figs., 2 tabs.

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

    Directory of Open Access Journals (Sweden)

    X. Liu

    2012-08-01

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

  11. Image Segmentation, Registration, Compression, and Matching

    Science.gov (United States)

    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

  12. Variational methods for direct/inverse problems of atmospheric dynamics and chemistry

    Science.gov (United States)

    Penenko, Vladimir; Penenko, Alexey; Tsvetova, Elena

    2013-04-01

    We present a variational approach for solving direct and inverse problems of atmospheric hydrodynamics and chemistry. It is important that the accurate matching of numerical schemes has to be provided in the chain of objects: direct/adjoint problems - sensitivity relations - inverse problems, including assimilation of all available measurement data. To solve the problems we have developed a new enhanced set of cost-effective algorithms. The matched description of the multi-scale processes is provided by a specific choice of the variational principle functionals for the whole set of integrated models. Then all functionals of variational principle are approximated in space and time by splitting and decomposition methods. Such approach allows us to separately consider, for example, the space-time problems of atmospheric chemistry in the frames of decomposition schemes for the integral identity sum analogs of the variational principle at each time step and in each of 3D finite-volumes. To enhance the realization efficiency, the set of chemical reactions is divided on the subsets related to the operators of production and destruction. Then the idea of the Euler's integrating factors is applied in the frames of the local adjoint problem technique [1]-[3]. The analytical solutions of such adjoint problems play the role of integrating factors for differential equations describing atmospheric chemistry. With their help, the system of differential equations is transformed to the equivalent system of integral equations. As a result we avoid the construction and inversion of preconditioning operators containing the Jacobi matrixes which arise in traditional implicit schemes for ODE solution. This is the main advantage of our schemes. At the same time step but on the different stages of the "global" splitting scheme, the system of atmospheric dynamic equations is solved. For convection - diffusion equations for all state functions in the integrated models we have developed the

  13. Structural analysis for diagnosis with application to ship propulsion problem

    DEFF Research Database (Denmark)

    Izadi-Zamanabadi, Roozbeh; Blanke, Mogens

    2002-01-01

    Aiming at design of algorithms for fault diagnosis, structural analysis of systems offers concise yet easy overall analysis. Graph-based matching, which is the essential tech-nique to obtain redundant information for diagnosis, is reconsidered in this paper. Matching is reformulated as a problem...... of relating faults to known parameters and measurements of a system. Using explicit fault modelling, minimal overdetermined subsystems are shown to provide necessary redundancy relations from the matching. Details of the method are presented and a realistic example used to clearly describe individual steps....

  14. Perceived match or mismatch on the Gottman conflict styles: associations with relationship outcome variables.

    Science.gov (United States)

    Busby, Dean M; Holman, Thomas B

    2009-12-01

    Gottman has proposed that there are 3 functional styles of conflict management in couple relationships, labeled Avoidant, Validating, and Volatile, and 1 dysfunctional style, labeled Hostile. Using a sample of 1,983 couples in a committed relationship, we test the association of perceived matches or mismatches on these conflict styles with relationship outcome variables. The results indicate that 32% of the participants perceive there is a mismatch with their conflict style and that of their partner. The Volatile-Avoidant mismatch was particularly problematic and was associated with more stonewalling, relationship problems, and lower levels of relationship satisfaction and stability than the Validating matched style and than other mismatched styles. The most problematic style was the Hostile style. Contrary to existing assumptions by Gottman, the 3 matched functional styles were not equivalent, as the Validating Style was associated with substantially better results on relationship outcome measures than the Volatile and Avoidant styles.

  15. Unconditionally stable WLP-FDTD method for the modeling of electromagnetic wave propagation in gyrotropic materials.

    Science.gov (United States)

    Li, Zheng-Wei; Xi, Xiao-Li; Zhang, Jin-Sheng; Liu, Jiang-fan

    2015-12-14

    The unconditional stable finite-difference time-domain (FDTD) method based on field expansion with weighted Laguerre polynomials (WLPs) is applied to model electromagnetic wave propagation in gyrotropic materials. The conventional Yee cell is modified to have the tightly coupled current density components located at the same spatial position. The perfectly matched layer (PML) is formulated in a stretched-coordinate (SC) system with the complex-frequency-shifted (CFS) factor to achieve good absorption performance. Numerical examples are shown to validate the accuracy and efficiency of the proposed method.

  16. Manual for the Use of Stable Isotopes in Entomology

    International Nuclear Information System (INIS)

    2009-06-01

    result of problem driven inquisitiveness and technological advances, and are framed by the social and political environment. Although the external environment may mould the technological path, a technology will only become obsolete if there are viable substitution products or methods. Stable isotope methods are a substitute for many radionuclide methods. The progress made in stable isotope science over the past twenty years is a direct result of the interplay of the above factors. Stable isotopes are omnipresent in the environment and pose no health or environmental risks. Advances in isotope ratio mass spectrometry in terms of detection, accuracy and automation have broadened experimental possibilities immensely over the past twenty years. It was recognised that there was significant potential for answering many of the entomologist?s biological and ecological questions using stable isotopes, an expertise the Soil Science Unit of the FAO/IAEA Agriculture and Biotechnology Laboratory in Seibersdorf had long fostered; therefore collaboration with the Entomology Unit at the same Laboratory was established. A number of collaborative experiments were carried and subsequently published. It was soon recognised that stable isotopes have tremendous potential in entomological research and although there were numerous studies using stable isotopes in ecology, their use in entomology per se was limited. Thus it was felt that a publication was required to make stable isotope techniques more widely known among entomologists. This manual will attempt to provide an introduction to the use of stable isotopes in entomological research. It will strive to communicate the basic principles and techniques of stable isotope science and provide a springboard for further interest and research in this area

  17. Fractional Order Element Based Impedance Matching

    KAUST Repository

    Radwan, Ahmed Gomaa

    2014-06-24

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

  18. Efficient algorithms for analyzing the singularly perturbed boundary value problems of fractional order

    Science.gov (United States)

    Sayevand, K.; Pichaghchi, K.

    2018-04-01

    In this paper, we were concerned with the description of the singularly perturbed boundary value problems in the scope of fractional calculus. We should mention that, one of the main methods used to solve these problems in classical calculus is the so-called matched asymptotic expansion method. However we shall note that, this was not achievable via the existing classical definitions of fractional derivative, because they do not obey the chain rule which one of the key elements of the matched asymptotic expansion method. In order to accommodate this method to fractional derivative, we employ a relatively new derivative so-called the local fractional derivative. Using the properties of local fractional derivative, we extend the matched asymptotic expansion method to the scope of fractional calculus and introduce a reliable new algorithm to develop approximate solutions of the singularly perturbed boundary value problems of fractional order. In the new method, the original problem is partitioned into inner and outer solution equations. The reduced equation is solved with suitable boundary conditions which provide the terminal boundary conditions for the boundary layer correction. The inner solution problem is next solved as a solvable boundary value problem. The width of the boundary layer is approximated using appropriate resemblance function. Some theoretical results are established and proved. Some illustrating examples are solved and the results are compared with those of matched asymptotic expansion method and homotopy analysis method to demonstrate the accuracy and efficiency of the method. It can be observed that, the proposed method approximates the exact solution very well not only in the boundary layer, but also away from the layer.

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

    Science.gov (United States)

    Narayan, Deepak

    2013-01-01

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

  20. Finding Non-Zero Stable Fixed Points of the Weighted Kuramoto model is NP-hard

    OpenAIRE

    Taylor, Richard

    2015-01-01

    The Kuramoto model when considered over the full space of phase angles [$0,2\\pi$) can have multiple stable fixed points which form basins of attraction in the solution space. In this paper we illustrate the fundamentally complex relationship between the network topology and the solution space by showing that determining the possibility of multiple stable fixed points from the network topology is NP-hard for the weighted Kuramoto Model. In the case of the unweighted model this problem is shown...

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

    CSIR Research Space (South Africa)

    Mlambo, CS

    2016-12-01

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

  2. Influence of the Antenna Impedance Variation and Input Matching Network Q on LNA Key Figures

    DEFF Research Database (Denmark)

    Ruaro, Andrea; Kvist, Søren Helstrup; Gülstorff, Steen

    2012-01-01

    In this paper we present an analysis of the behaviour of a 2:4 GHz Low Noise Amplifier (LNA) for Wireless Body Area Network (WBAN) applications facing antennadetuning issue. An amplifier with ultra-low power, low voltage, and with reduced component count is prototyped to validate simulation results......, then the behaviour is analyzed through simulations based on data measured on real users. The analysis shows that the designed LNA is stable to the antenna impedance variation expectable in most cases, while highlights the possible risks associated to a high-Q input matching network when used in a context prone...

  3. The influence of successive matches on match-running performance during an under-23 international soccer tournament: The necessity of individual analysis.

    Science.gov (United States)

    Varley, Matthew C; Di Salvo, Valter; Modonutti, Mattia; Gregson, Warren; Mendez-Villanueva, Alberto

    2018-03-01

    This study investigated the effects of successive matches on match-running in elite under-23 soccer players during an international tournament. Match-running data was collected using a semi-automated multi-camera tracking system during an international under-23 tournament from all participating outfield players. Players who played 100% of all group stage matches were included (3 matches separated by 72 h, n = 44). Differences in match-running performance between matches were identified using a generalised linear mixed model. There were no clear effects for total, walking, jogging, running, high-speed running and sprinting distance between matches 1 and 3 (effect size (ES); -0.32 to 0.05). Positional analysis found that sprint distance was largely maintained from matches 1 to 3 across all positions. Attackers had a moderate decrease in total, jogging and running distance between matches 1 and 3 (ES; -0.72 to -0.66). Classifying players as increasers or decreasers in match-running revealed that match-running changes are susceptible to individual differences. Sprint performance appears to be maintained over successive matches regardless of playing position. However, reductions in other match-running categories vary between positions. Changes in match-running over successive matches affect individuals differently; thus, players should be monitored on an individual basis.

  4. Applications of stable isotopes of 2H, 13C and 15N to clinical problems

    International Nuclear Information System (INIS)

    Klein, P.D.; Szczepanik, P.A.; Hachey, D.L.

    1974-01-01

    The function of the Argonne Program is to provide synthetic, analytical instrumental capability in a core facility for the clinical investigator who needs to use 2 H, 13 C, or 15 N labelled compounds for metabolic or clinical research on pregnant women, newborn infants, young children, or for mass screening. To carry out such application development, there were six stages which were recurrent steps in every application. Five fundamental strategies should be adopted to establish the use of stable isotopes in clinical work. The instrument required for measurements was a combined gas chromatograph-mass spectrometer, and its use was schematically illustrated. Some of the successful experiences with compounds labelled by stable isotopes, such as deuterium labelled chenodeoxycholic acid, and respective 13 C and 15 N-labelled glycine were described. Deutrium labelled bile acid enabled easy and safe determination of the size of the bile acid pool and the replacement rate, providing clearer diagnoses for cholestatic liver disease and gallstones. 13 C and 15 N labelled compounds were used in clinical studies, of children with genetic disorders of amino acid metabolism, i.e., non ketotic hyperflycinemia, B 12 -responsive methyl malonic acidemia, and Lesch-Nyhan syndrome. 15 N-labelled glycine was also studied in a child with Lesch-Nyhan syndrome. (Mukohata, S.)

  5. Matching pursuit and source deflation for sparse EEG/MEG dipole moment estimation.

    Science.gov (United States)

    Wu, Shun Chi; Swindlehurst, A Lee

    2013-08-01

    In this paper, we propose novel matching pursuit (MP)-based algorithms for EEG/MEG dipole source localization and parameter estimation for multiple measurement vectors with constant sparsity. The algorithms combine the ideas of MP for sparse signal recovery and source deflation, as employed in estimation via alternating projections. The source-deflated matching pursuit (SDMP) approach mitigates the problem of residual interference inherent in sequential MP-based methods or recursively applied (RAP)-MUSIC. Furthermore, unlike prior methods based on alternating projection, SDMP allows one to efficiently estimate the dipole orientation in addition to its location. Simulations show that the proposed algorithms outperform existing techniques under various conditions, including those with highly correlated sources. Results using real EEG data from auditory experiments are also presented to illustrate the performance of these algorithms.

  6. Bayesian estimation of dynamic matching function for U-V analysis in Japan

    Science.gov (United States)

    Kyo, Koki; Noda, Hideo; Kitagawa, Genshiro

    2012-05-01

    In this paper we propose a Bayesian method for analyzing unemployment dynamics. We derive a Beveridge curve for unemployment and vacancy (U-V) analysis from a Bayesian model based on a labor market matching function. In our framework, the efficiency of matching and the elasticities of new hiring with respect to unemployment and vacancy are regarded as time varying parameters. To construct a flexible model and obtain reasonable estimates in an underdetermined estimation problem, we treat the time varying parameters as random variables and introduce smoothness priors. The model is then described in a state space representation, enabling the parameter estimation to be carried out using Kalman filter and fixed interval smoothing. In such a representation, dynamic features of the cyclic unemployment rate and the structural-frictional unemployment rate can be accurately captured.

  7. A Propensity Score Matching Analysis of the Effects of Special Education Services

    Science.gov (United States)

    Morgan, Paul L.; Frisco, Michelle; Farkas, George; Hibel, Jacob

    2013-01-01

    We sought to quantify the effectiveness of special education services as naturally delivered in U.S. schools. Specifically, we examined whether children receiving special education services displayed (a) greater reading or mathematics skills, (b) more frequent learning-related behaviors, or (c) less frequent externalizing or internalizing problem behaviors than closely matched peers not receiving such services. To do so, we used propensity score matching techniques to analyze data from the Early Childhood Longitudinal—Study Kindergarten Cohort, 1998–1999, a large scale, nationally representative sample of U.S. schoolchildren. Collectively, results indicate that receipt of special education services has either a negative or statistically non-significant impact on children’s learning or behavior. However, special education services do yield a small, positive effect on children’s learning-related behaviors. PMID:23606759

  8. Hybrid-Based Dense Stereo Matching

    Science.gov (United States)

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

    2016-06-01

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

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

    International Nuclear Information System (INIS)

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

    2008-01-01

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

  10. Turbulence Spreading into Linearly Stable Zone and Transport Scaling

    International Nuclear Information System (INIS)

    Hahm, T.S.; Diamond, P.H.; Lin, Z.; Itoh, K.; Itoh, S.-I.

    2003-01-01

    We study the simplest problem of turbulence spreading corresponding to the spatio-temporal propagation of a patch of turbulence from a region where it is locally excited to a region of weaker excitation, or even local damping. A single model equation for the local turbulence intensity I(x, t) includes the effects of local linear growth and damping, spatially local nonlinear coupling to dissipation and spatial scattering of turbulence energy induced by nonlinear coupling. In the absence of dissipation, the front propagation into the linearly stable zone occurs with the property of rapid progression at small t, followed by slower subdiffusive progression at late times. The turbulence radial spreading into the linearly stable zone reduces the turbulent intensity in the linearly unstable zone, and introduces an additional dependence on the rho* is always equal to rho i/a to the turbulent intensity and the transport scaling. These are in broad, semi-quantitative agreements with a number of global gyrokinetic simulation results with zonal flows and without zonal flows. The front propagation stops when the radial flux of fluctuation energy from the linearly unstable region is balanced by local dissipation in the linearly stable region

  11. Relationships Between Internal and External Match-Load Indicators in Soccer Match Officials.

    Science.gov (United States)

    Castillo, Daniel; Weston, Matthew; McLaren, Shaun J; Cámara, Jesús; Yanci, Javier

    2017-08-01

    The aims of this study were to describe the internal and external match loads (ML) of refereeing activity during official soccer matches and to investigate the relationship among the methods of ML quantification across a competitive season. A further aim was to examine the usefulness of differential perceived exertion (dRPE) as a tool for monitoring internal ML in soccer referees. Twenty field referees (FRs) and 43 assistant referees (ARs) participated in the study. Data were collected from 30 competitive matches (FR = 20 observations, AR = 43 observations) and included measures of internal (Edwards' heart-rate-derived training impulse [TRIMP EDW ]) ML, external (total distance covered, distance covered at high speeds, and player load) ML, and ML differentiated ratings of perceived respiratory (sRPE res ) and leg-muscle (sRPE mus ) exertion. Internal and external ML were all greater for FRs than for ARs (-19.7 to -72.5), with differences ranging from very likely very large to most likely extremely large. The relationships between internal-ML and external-ML indicators were, in most cases, unclear for FR (r internal and external ML. Moreover, dRPE represents distinct dimensions of effort and may be useful in monitoring soccer referees' ML during official matches.

  12. Detecting intraannual dietary variability in wild mountain gorillas by stable isotope analysis of feces.

    Science.gov (United States)

    Blumenthal, Scott A; Chritz, Kendra L; Rothman, Jessica M; Cerling, Thure E

    2012-12-26

    We use stable isotope ratios in feces of wild mountain gorillas (Gorilla beringei) to test the hypothesis that diet shifts within a single year, as measured by dry mass intake, can be recovered. Isotopic separation of staple foods indicates that intraannual changes in the isotopic composition of feces reflect shifts in diet. Fruits are isotopically distinct compared with other staple foods, and peaks in fecal δ(13)C values are interpreted as periods of increased fruit feeding. Bayesian mixing model results demonstrate that, although the timing of these diet shifts match observational data, the modeled increase in proportional fruit feeding does not capture the full shift. Variation in the isotopic and nutritional composition of gorilla foods is largely independent, highlighting the difficulty for estimating nutritional intake with stable isotopes. Our results demonstrate the potential value of fecal sampling for quantifying short-term, intraindividual dietary variability in primates and other animals with high temporal resolution even when the diet is composed of C(3) plants.

  13. Applications of isotopes. [Need and cost of stable iotopes for use as tracers in biomedical and environmental studies

    Energy Technology Data Exchange (ETDEWEB)

    Kirby-Smith, J.S.

    1976-01-01

    Current and potential applications of stable isotopes as tracers in a number of biomedical and environmental areas are discussed. It is pointed out that a wide variety of problems exist in these fields whose solutions in principle are amenable to the isotopic approach. The number and diversity of these problems as well as the unique role stable isotopes can play in their solution illustrate the importance of achieving and maintaining a broad inventory of isotopic species. Experience has demonstrated unequivocally an additional overriding requirement for widespread exploration of stable isotopes by the scientific and technical community, i.e., the need for low cost availability of the materials in quantity. Some representative applications of /sup 12/C, /sup 13/C, /sup 14/N, /sup 15/N, /sup 16/O, /sup 17/O, and /sup 18/O are discussed.

  14. Horsetail matching: a flexible approach to optimization under uncertainty

    Science.gov (United States)

    Cook, L. W.; Jarrett, J. P.

    2018-04-01

    It is important to design engineering systems to be robust with respect to uncertainties in the design process. Often, this is done by considering statistical moments, but over-reliance on statistical moments when formulating a robust optimization can produce designs that are stochastically dominated by other feasible designs. This article instead proposes a formulation for optimization under uncertainty that minimizes the difference between a design's cumulative distribution function and a target. A standard target is proposed that produces stochastically non-dominated designs, but the formulation also offers enough flexibility to recover existing approaches for robust optimization. A numerical implementation is developed that employs kernels to give a differentiable objective function. The method is applied to algebraic test problems and a robust transonic airfoil design problem where it is compared to multi-objective, weighted-sum and density matching approaches to robust optimization; several advantages over these existing methods are demonstrated.

  15. Probabilistic seismic history matching using binary images

    Science.gov (United States)

    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

  16. Efficient Algorithms for a Family of Matroid Intersection Problems

    National Research Council Canada - National Science Library

    Gabow, Harold N; Tarjan, Robert E

    1982-01-01

    .... its efficiency is demonstrated by implementations on specific matroids. In all cases but one, the running time matches the best-known algorithm for the problem without the red element constraint...

  17. A Registration Scheme for Multispectral Systems Using Phase Correlation and Scale Invariant Feature Matching

    Directory of Open Access Journals (Sweden)

    Hanlun Li

    2016-01-01

    Full Text Available In the past few years, many multispectral systems which consist of several identical monochrome cameras equipped with different bandpass filters have been developed. However, due to the significant difference in the intensity between different band images, image registration becomes very difficult. Considering the common structural characteristic of the multispectral systems, this paper proposes an effective method for registering different band images. First we use the phase correlation method to calculate the parameters of a coarse-offset relationship between different band images. Then we use the scale invariant feature transform (SIFT to detect the feature points. For every feature point in a reference image, we can use the coarse-offset parameters to predict the location of its matching point. We only need to compare the feature point in the reference image with the several near feature points from the predicted location instead of the feature points all over the input image. Our experiments show that this method does not only avoid false matches and increase correct matches, but also solve the matching problem between an infrared band image and a visible band image in cases lacking man-made objects.

  18. Identification of Requirements for Computer-Supported Matching of Food Consumption Data with Food Composition Data

    Directory of Open Access Journals (Sweden)

    Barbara Koroušić Seljak

    2018-03-01

    Full Text Available This paper identifies the requirements for computer-supported food matching, in order to address not only national and European but also international current related needs and represents an integrated research contribution of the FP7 EuroDISH project. The available classification and coding systems and the specific problems of food matching are summarized and a new concept for food matching based on optimization methods and machine-based learning is proposed. To illustrate and test this concept, a study has been conducted in four European countries (i.e., Germany, The Netherlands, Italy and the UK using different classification and coding systems. This real case study enabled us to evaluate the new food matching concept and provide further recommendations for future work. In the first stage of the study, we prepared subsets of food consumption data described and classified using different systems, that had already been manually matched with national food composition data. Once the food matching algorithm was trained using this data, testing was performed on another subset of food consumption data. Experts from different countries validated food matching between consumption and composition data by selecting best matches from the options given by the matching algorithm without seeing the result of the previously made manual match. The evaluation of study results stressed the importance of the role and quality of the food composition database as compared to the selected classification and/or coding systems and the need to continue compiling national food composition data as eating habits and national dishes still vary between countries. Although some countries managed to collect extensive sets of food consumption data, these cannot be easily matched with food composition data if either food consumption or food composition data are not properly classified and described using any classification and coding systems. The study also showed that the

  19. Identification of Requirements for Computer-Supported Matching of Food Consumption Data with Food Composition Data

    Science.gov (United States)

    Korošec, Peter; Eftimov, Tome; Ocke, Marga; van der Laan, Jan; Roe, Mark; Berry, Rachel; Turrini, Aida; Krems, Carolin; Slimani, Nadia; Finglas, Paul

    2018-01-01

    This paper identifies the requirements for computer-supported food matching, in order to address not only national and European but also international current related needs and represents an integrated research contribution of the FP7 EuroDISH project. The available classification and coding systems and the specific problems of food matching are summarized and a new concept for food matching based on optimization methods and machine-based learning is proposed. To illustrate and test this concept, a study has been conducted in four European countries (i.e., Germany, The Netherlands, Italy and the UK) using different classification and coding systems. This real case study enabled us to evaluate the new food matching concept and provide further recommendations for future work. In the first stage of the study, we prepared subsets of food consumption data described and classified using different systems, that had already been manually matched with national food composition data. Once the food matching algorithm was trained using this data, testing was performed on another subset of food consumption data. Experts from different countries validated food matching between consumption and composition data by selecting best matches from the options given by the matching algorithm without seeing the result of the previously made manual match. The evaluation of study results stressed the importance of the role and quality of the food composition database as compared to the selected classification and/or coding systems and the need to continue compiling national food composition data as eating habits and national dishes still vary between countries. Although some countries managed to collect extensive sets of food consumption data, these cannot be easily matched with food composition data if either food consumption or food composition data are not properly classified and described using any classification and coding systems. The study also showed that the level of human

  20. One Leg hybrid P-stable substitution LMM for oscilatory IVPs in ODEs.

    African Journals Online (AJOL)

    This presents P-stable successive substitution one-leg hybrid LMM for the numerical solution of oscillatory second order IVPs in ODEs without explicitly defined first order derivative. These problems occurs amongst others, in orbital mechanics where the methods to be presented finds ready applications and need not any a ...

  1. Is Sensation Seeking a Stable Trait or Does It Change over Time?

    Science.gov (United States)

    Lynne-Landsman, Sarah D.; Graber, Julia A.; Nichols, Tracy R.; Botvin, Gilbert J.

    2011-01-01

    The theory of sensation seeking has conceptualized this construct as a stable personality trait associated with a variety of problem behaviors. Reckless behavior theory posits that increases in reckless behavior during adolescence can be attributed, in part, to increases in sensation seeking. This study evaluated patterns of stability and change…

  2. The Gastroenterology Fellowship Match: A Decade Later.

    Science.gov (United States)

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

    2017-06-01

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

  3. MATCHING IN INFORMAL FINANCIAL INSTITUTIONS.

    Science.gov (United States)

    Eeckhout, Jan; Munshi, Kaivan

    2010-09-01

    This paper analyzes an informal financial institution that brings heterogeneous agents together in groups. We analyze decentralized matching into these groups, and the equilibrium composition of participants that consequently arises. We find that participants sort remarkably well across the competing groups, and that they re-sort immediately following an unexpected exogenous regulatory change. These findings suggest that the competitive matching model might have applicability and bite in other settings where matching is an important equilibrium phenomenon. (JEL: O12, O17, G20, D40).

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

    Science.gov (United States)

    2010-06-02

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

  5. Sensor-Based Auto-Focusing System Using Multi-Scale Feature Extraction and Phase Correlation Matching

    Directory of Open Access Journals (Sweden)

    Jinbeum Jang

    2015-03-01

    Full Text Available This paper presents a novel auto-focusing system based on a CMOS sensor containing pixels with different phases. Robust extraction of features in a severely defocused image is the fundamental problem of a phase-difference auto-focusing system. In order to solve this problem, a multi-resolution feature extraction algorithm is proposed. Given the extracted features, the proposed auto-focusing system can provide the ideal focusing position using phase correlation matching. The proposed auto-focusing (AF algorithm consists of four steps: (i acquisition of left and right images using AF points in the region-of-interest; (ii feature extraction in the left image under low illumination and out-of-focus blur; (iii the generation of two feature images using the phase difference between the left and right images; and (iv estimation of the phase shifting vector using phase correlation matching. Since the proposed system accurately estimates the phase difference in the out-of-focus blurred image under low illumination, it can provide faster, more robust auto focusing than existing systems.

  6. Bi-stable optical actuator

    Science.gov (United States)

    Holdener, Fred R.; Boyd, Robert D.

    2000-01-01

    The present invention is a bi-stable optical actuator device that is depowered in both stable positions. A bearing is used to transfer motion and smoothly transition from one state to another. The optical actuator device may be maintained in a stable position either by gravity or a restraining device.

  7. Matched and mismatched appraisals of the effectiveness of communication strategies by family caregivers of persons with Alzheimer's disease.

    Science.gov (United States)

    Savundranayagam, Marie Y; Orange, J B

    2014-01-01

    Communication problems stemming from Alzheimer's disease (AD) often result in misunderstandings that can be linked with problem behaviours and increased caregiver stress. Moreover, these communication breakdowns also can result either from caregivers' use of ineffective communication strategies, which paradoxically are perceived as helpful, or can occur as a result of not using effective communication strategies that are perceived as unhelpful. The two primary aims were to determine the effectiveness of strategies used to resolve communication breakdowns and to examine whether caregivers' ratings of strategy effectiveness were consistent with evidence from video-recorded conversations and with effective communication strategies documented in the literature. Twenty-eight mealtime conversations were recorded using a sample of 15 dyads consisting of individuals with early, middle and late clinical-stage AD and their family caregivers. Conversations were analysed using the trouble-source repair paradigm to identify the communication strategies used by caregivers to resolve breakdowns. Family caregivers also rated the helpfulness of communication strategies used to resolve breakdowns. Analyses were conducted to assess the overlap or match between the use and appraisals of the helpfulness of communication strategies. Matched and mismatched appraisals of communication strategies varied across stages of AD. Matched appraisals by caregivers of persons with early-stage AD were observed for 68% of 22 communication strategies, whereas caregivers of persons with middle- and late-stage AD had matched appraisals for 45% and 55% of the strategies, respectively. Moreover, caregivers of persons with early-stage AD had matched appraisals over and above making matched appraisals by chance alone, compared with caregivers of persons in middle- and late-stage AD. Mismatches illustrate the need for communication education and training, particularly to establish empirically derived

  8. A Scenario-Based Parametric Analysis of Stable Marriage Approaches to the Army Officer Assignment Problem

    Science.gov (United States)

    2017-03-23

    information for assignments, whether for certain experiences, skill identifiers, or manner of past performance could be easily incorporated at this point... helper functions to save and load python objects def save obj(obj, name ): with open(’data/’+ name + ’.pkl’, ’wb’) as f: pkl.dump(obj, f, pkl.HIGHEST...http://www.gurobi.com/products/ features-benefits. Accessed: 2016-10-29. 14. M. Fırat, C. Hurkens, and A. Laugier, “Stable multi- skill workforce

  9. Co-development of Problem Gambling and Depression Symptoms in Emerging Adults: A Parallel-Process Latent Class Growth Model.

    Science.gov (United States)

    Edgerton, Jason D; Keough, Matthew T; Roberts, Lance W

    2018-02-21

    This study examines whether there are multiple joint trajectories of depression and problem gambling co-development in a sample of emerging adults. Data were from the Manitoba Longitudinal Study of Young Adults (n = 679), which was collected in 4 waves across 5 years (age 18-20 at baseline). Parallel process latent class growth modeling was used to identified 5 joint trajectory classes: low decreasing gambling, low increasing depression (81%); low stable gambling, moderate decreasing depression (9%); low stable gambling, high decreasing depression (5%); low stable gambling, moderate stable depression (3%); moderate stable problem gambling, no depression (2%). There was no evidence of reciprocal growth in problem gambling and depression in any of the joint classes. Multinomial logistic regression analyses of baseline risk and protective factors found that only neuroticism, escape-avoidance coping, and perceived level of family social support were significant predictors of joint trajectory class membership. Consistent with the pathways model framework, we observed that individuals in the problem gambling only class were more likely using gambling as a stable way to cope with negative emotions. Similarly, high levels of neuroticism and low levels of family support were associated with increased odds of being in a class with moderate to high levels of depressive symptoms (but low gambling problems). The results suggest that interventions for problem gambling and/or depression need to focus on promoting more adaptive coping skills among more "at-risk" young adults, and such interventions should be tailored in relation to specific subtypes of comorbid mental illness.

  10. Remarks on stable and quasi-stable k-strings at large N

    International Nuclear Information System (INIS)

    Armoni, A.; Shifman, M.

    2003-01-01

    We discuss k-strings in the large-N Yang-Mills theory and its supersymmetric extension. Whereas the tension of the bona fide (stable) QCD string is expected to depend only on the N-ality of the representation, tensions that depend on specific representation R are often reported in the lattice literature. In particular, adjoint strings are discussed and found in certain simulations. We clarify this issue by systematically exploiting the notion of the quasi-stable strings which becomes well-defined at large N. The quasi-stable strings with representation-dependent tensions decay, but the decay rate (per unit length per unit time) is suppressed as Λ 2 F(N) where F(N) falls off as a function of N. It can be determined on the case-by-case basis. The quasi-stable strings eventually decay into stable strings whose tension indeed depends only on the N-ality. We also briefly review large-N arguments showing why the Casimir formula for the string tension cannot be correct, and present additional arguments in favor of the sine formula. Finally, we comment on the relevance of our estimates to Euclidean lattice measurements

  11. Evolutionary Stable Strategy

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 21; Issue 9. Evolutionary Stable Strategy: Application of Nash Equilibrium in Biology. General Article Volume 21 Issue 9 September 2016 pp 803- ... Keywords. Evolutionary game theory, evolutionary stable state, conflict, cooperation, biological games.

  12. Diagrams benefit symbolic problem-solving.

    Science.gov (United States)

    Chu, Junyi; Rittle-Johnson, Bethany; Fyfe, Emily R

    2017-06-01

    The format of a mathematics problem often influences students' problem-solving performance. For example, providing diagrams in conjunction with story problems can benefit students' understanding, choice of strategy, and accuracy on story problems. However, it remains unclear whether providing diagrams in conjunction with symbolic equations can benefit problem-solving performance as well. We tested the impact of diagram presence on students' performance on algebra equation problems to determine whether diagrams increase problem-solving success. We also examined the influence of item- and student-level factors to test the robustness of the diagram effect. We worked with 61 seventh-grade students who had received 2 months of pre-algebra instruction. Students participated in an experimenter-led classroom session. Using a within-subjects design, students solved algebra problems in two matched formats (equation and equation-with-diagram). The presence of diagrams increased equation-solving accuracy and the use of informal strategies. This diagram benefit was independent of student ability and item complexity. The benefits of diagrams found previously for story problems generalized to symbolic problems. The findings are consistent with cognitive models of problem-solving and suggest that diagrams may be a useful additional representation of symbolic problems. © 2017 The British Psychological Society.

  13. Energy Conversion Properties of ZnSiP2, a Lattice-Matched Material for Silicon-Based Tandem Photovoltaics

    Energy Technology Data Exchange (ETDEWEB)

    Martinez, Aaron D.; Warren, Emily L.; Gorai, Prashun; Borup, Kasper A.; Krishna, Lakshmi; Kuciauskas, Darius; Dippo, Patricia C.; Ortiz, Brenden R.; Stradins, Paul; Stevanovic, Vladan; Toberer, Eric S.; Tamboli, Adele C.

    2016-11-21

    ZnSiP2 demonstrates promising potential as an optically active material on silicon. There has been a longstanding need for wide band gap materials that can be integrated with Si for tandem photovoltaics and other optoelectronic applications. ZnSiP2 is an inexpensive, earth abundant, wide band gap material that is stable and lattice matched with silicon. This conference proceeding summarizes our PV-relevant work on bulk single crystal ZnSiP2, highlighting the key findings and laying the ground work for integration into Si-based tandem devices.

  14. Coalition-based multimedia peer matching strategies for P2P networks

    Science.gov (United States)

    Park, Hyunggon; van der Schaar, Mihaela

    2008-01-01

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

  15. Training understanding of reversible sentences: a study comparing language-impaired children with age-matched and grammar-matched controls.

    Science.gov (United States)

    Hsu, Hsinjen Julie; Bishop, Dorothy V M

    2014-01-01

    Introduction. Many children with specific language impairment (SLI) have problems with language comprehension, and little is known about how to remediate these. We focused here on errors in interpreting sentences such as "the ball is above the cup", where the spatial configuration depends on word order. We asked whether comprehension of such short reversible sentences could be improved by computerized training, and whether learning by children with SLI resembled that of younger, typically-developing children. Methods. We trained 28 children with SLI aged 6-11 years, 28 typically-developing children aged from 4 to 7 years who were matched to the SLI group for raw scores on a test of receptive grammar, and 20 typically-developing children who were matched to the SLI group on chronological age. A further 20 children with SLI were given pre- and post-test assessments, but did not undergo training. Those in the trained groups were given training on four days using a computer game adopting an errorless learning procedure, during which they had to select pictures to correspond to spoken sentences such as "the cup is above the drum" or "the bird is below the hat". Half the trained children heard sentences using above/below and the other half heard sentences using before/after (with a spatial interpretation). A total of 96 sentences was presented over four sessions. Half the sentences were unique, whereas the remainder consisted of 12 repetitions of each of four sentences that became increasingly familiar as training proceeded. Results. Age-matched control children performed near ceiling (≥ 90% correct) in the first session and were excluded from the analysis. Around half the trained SLI children also performed this well. Training effects were examined in 15 SLI and 16 grammar-matched children who scored less than 90% correct on the initial training session. Overall, children's scores improved with training. Memory span was a significant predictor of improvement, even

  16. Training understanding of reversible sentences: a study comparing language-impaired children with age-matched and grammar-matched controls

    Directory of Open Access Journals (Sweden)

    Hsinjen Julie Hsu

    2014-11-01

    Full Text Available Introduction. Many children with specific language impairment (SLI have problems with language comprehension, and little is known about how to remediate these. We focused here on errors in interpreting sentences such as “the ball is above the cup”, where the spatial configuration depends on word order. We asked whether comprehension of such short reversible sentences could be improved by computerized training, and whether learning by children with SLI resembled that of younger, typically-developing children.Methods. We trained 28 children with SLI aged 6–11 years, 28 typically-developing children aged from 4 to 7 years who were matched to the SLI group for raw scores on a test of receptive grammar, and 20 typically-developing children who were matched to the SLI group on chronological age. A further 20 children with SLI were given pre- and post-test assessments, but did not undergo training. Those in the trained groups were given training on four days using a computer game adopting an errorless learning procedure, during which they had to select pictures to correspond to spoken sentences such as “the cup is above the drum” or “the bird is below the hat”. Half the trained children heard sentences using above/below and the other half heard sentences using before/after (with a spatial interpretation. A total of 96 sentences was presented over four sessions. Half the sentences were unique, whereas the remainder consisted of 12 repetitions of each of four sentences that became increasingly familiar as training proceeded.Results. Age-matched control children performed near ceiling (≥ 90% correct in the first session and were excluded from the analysis. Around half the trained SLI children also performed this well. Training effects were examined in 15 SLI and 16 grammar-matched children who scored less than 90% correct on the initial training session. Overall, children’s scores improved with training. Memory span was a significant

  17. Development of stable monolithic wide-field Michelson interferometers.

    Science.gov (United States)

    Wan, Xiaoke; Ge, Jian; Chen, Zhiping

    2011-07-20

    Bulk wide-field Michelson interferometers are very useful for high precision applications in remote sensing and astronomy. A stable monolithic Michelson interferometer is a key element in high precision radial velocity (RV) measurements for extrasolar planets searching and studies. Thermal stress analysis shows that matching coefficients of thermal expansion (CTEs) is a critical requirement for ensuring interferometer stability. This requirement leads to a novel design using BK7 and LAK7 materials, such that the monolithic interferometer is free from thermal distortion. The processes of design, fabrication, and testing of interferometers are described in detail. In performance evaluations, the field angle is typically 23.8° and thermal sensitivity is typically -2.6×10(-6)/°C near 550 nm, which corresponds to ∼800 m/s/°C in the RV scale. Low-cost interferometer products have been commissioned in multiple RV instruments, and they are producing high stability performance over long term operations. © 2011 Optical Society of America

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

  19. The size of stable international environmental agreements in the case of stock pollution

    NARCIS (Netherlands)

    Wagener, F.; de Zeeuw, A.

    2011-01-01

    Most of the literature on stability of International Environmental Agreements is essen- tially static and can therefore not identify changes in the size of the stable coalition in connection with changes in the stock of pollutants. This is a relevant issue because most global pollution problems are

  20. Adaptive Finite Element Methods for Elliptic Problems with Discontinuous Coefficients

    KAUST Repository

    Bonito, Andrea; DeVore, Ronald A.; Nochetto, Ricardo H.

    2013-01-01

    Elliptic PDEs with discontinuous diffusion coefficients occur in application domains such as diffusions through porous media, electromagnetic field propagation on heterogeneous media, and diffusion processes on rough surfaces. The standard approach to numerically treating such problems using finite element methods is to assume that the discontinuities lie on the boundaries of the cells in the initial triangulation. However, this does not match applications where discontinuities occur on curves, surfaces, or manifolds, and could even be unknown beforehand. One of the obstacles to treating such discontinuity problems is that the usual perturbation theory for elliptic PDEs assumes bounds for the distortion of the coefficients in the L∞ norm and this in turn requires that the discontinuities are matched exactly when the coefficients are approximated. We present a new approach based on distortion of the coefficients in an Lq norm with q < ∞ which therefore does not require the exact matching of the discontinuities. We then use this new distortion theory to formulate new adaptive finite element methods (AFEMs) for such discontinuity problems. We show that such AFEMs are optimal in the sense of distortion versus number of computations, and report insightful numerical results supporting our analysis. © 2013 Societ y for Industrial and Applied Mathematics.

  1. DOE Matching Grant Program; FINAL

    International Nuclear Information System (INIS)

    Dr Marvin Adams

    2002-01-01

    OAK 270 - The DOE Matching Grant Program provided$50,000.00 to the Dept of N.E. at TAMU, matching a gift of$50,000.00 from TXU Electric. The$100,000.00 total was spent on scholarships, departmental labs, and computing network

  2. A comparative study between matched and mis-matched projection/back projection pairs used with ASIRT reconstruction method

    International Nuclear Information System (INIS)

    Guedouar, R.; Zarrad, B.

    2010-01-01

    For algebraic reconstruction techniques both forward and back projection operators are needed. The ability to perform accurate reconstruction relies fundamentally on the forward projection and back projection methods which are usually, the transpose of each other. Even though the mis-matched pairs may introduce additional errors during the iterative process, the usefulness of mis-matched projector/back projector pairs has been proved in image reconstruction. This work investigates the performance of matched and mis-matched reconstruction pairs using popular forward projectors and their transposes when used in reconstruction tasks with additive simultaneous iterative reconstruction techniques (ASIRT) in a parallel beam approach. Simulated noiseless phantoms are used to compare the performance of the investigated pairs in terms of the root mean squared errors (RMSE) which are calculated between reconstructed slices and the reference in different regions. Results show that mis-matched projection/back projection pairs can promise more accuracy of reconstructed images than matched ones. The forward projection operator performance seems independent of the choice of the back projection operator and vice versa.

  3. A comparative study between matched and mis-matched projection/back projection pairs used with ASIRT reconstruction method

    Energy Technology Data Exchange (ETDEWEB)

    Guedouar, R., E-mail: raja_guedouar@yahoo.f [Higher School of Health Sciences and Techniques of Monastir, Av. Avicenne, 5060 Monastir, B.P. 128 (Tunisia); Zarrad, B., E-mail: boubakerzarrad@yahoo.f [Higher School of Health Sciences and Techniques of Monastir, Av. Avicenne, 5060 Monastir, B.P. 128 (Tunisia)

    2010-07-21

    For algebraic reconstruction techniques both forward and back projection operators are needed. The ability to perform accurate reconstruction relies fundamentally on the forward projection and back projection methods which are usually, the transpose of each other. Even though the mis-matched pairs may introduce additional errors during the iterative process, the usefulness of mis-matched projector/back projector pairs has been proved in image reconstruction. This work investigates the performance of matched and mis-matched reconstruction pairs using popular forward projectors and their transposes when used in reconstruction tasks with additive simultaneous iterative reconstruction techniques (ASIRT) in a parallel beam approach. Simulated noiseless phantoms are used to compare the performance of the investigated pairs in terms of the root mean squared errors (RMSE) which are calculated between reconstructed slices and the reference in different regions. Results show that mis-matched projection/back projection pairs can promise more accuracy of reconstructed images than matched ones. The forward projection operator performance seems independent of the choice of the back projection operator and vice versa.

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

    Science.gov (United States)

    2010-11-05

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

  5. Probability matching and strategy availability.

    Science.gov (United States)

    Koehler, Derek J; James, Greta

    2010-09-01

    Findings from two experiments indicate that probability matching in sequential choice arises from an asymmetry in strategy availability: The matching strategy comes readily to mind, whereas a superior alternative strategy, maximizing, does not. First, compared with the minority who spontaneously engage in maximizing, the majority of participants endorse maximizing as superior to matching in a direct comparison when both strategies are described. Second, when the maximizing strategy is brought to their attention, more participants subsequently engage in maximizing. Third, matchers are more likely than maximizers to base decisions in other tasks on their initial intuitions, suggesting that they are more inclined to use a choice strategy that comes to mind quickly. These results indicate that a substantial subset of probability matchers are victims of "underthinking" rather than "overthinking": They fail to engage in sufficient deliberation to generate a superior alternative to the matching strategy that comes so readily to mind.

  6. A Mean-Shift-Based Feature Descriptor for Wide Baseline Stereo Matching

    Directory of Open Access Journals (Sweden)

    Yiwen Dou

    2015-01-01

    Full Text Available We propose a novel Mean-Shift-based building approach in wide baseline. Initially, scale-invariance feature transform (SIFT approach is used to extract relatively stable feature points. As to each matching SIFT feature point, it needs a reasonable neighborhood range so as to choose feature points set. Subsequently, in view of selecting repeatable and high robust feature points, Mean-Shift controls corresponding feature scale. At last, our approach is employed to depth image acquirement in wide baseline and Graph Cut algorithm optimizes disparity information. Compared with the existing methods such as SIFT, speeded up robust feature (SURF, and normalized cross-correlation (NCC, the presented approach has the advantages of higher robustness and accuracy rate. Experimental results on low resolution image and weak feature description in wide baseline confirm the validity of our approach.

  7. Laparoscopy has a therapeutic role in the management of abdominal trauma: A matched-pair analysis.

    Science.gov (United States)

    Chakravartty, Saurav; Sarma, Diwakar R; Noor, Muhammad; Panagiotopoulos, Spyros; Patel, Ameet G

    2017-08-01

    Laparoscopy is increasingly utilised as a diagnostic tool in management of abdominal trauma; however its role in therapeutic intervention remains unexplored. The aim of this study is to compare laparoscopy with laparotomy in the treatment of abdominal trauma in haemodynamically stable patients. A review of patients undergoing surgery for abdominal trauma between January 2004-2014 identified 25 patients who underwent laparoscopy for therapeutic intervention (TL). This group was matched with 25 similar patients undergoing laparotomy (LT). Matching of the two cohorts was based on patient characteristics, severity of injuries, haemodynamic compromise and radiological findings. Peri-operative outcomes were compared. Patient characteristics were similar in TL and LT patients for age (median 33 vs. 26 years), gender distribution and clinical presentation. Injury severity score was also similar with a median of 16 in both groups (major trauma = ISS>15, normal range 0-75). Types of injuries included; hollow viscus [bowel repair = 10 (TL) vs. 16 (LT)] and solid organs [5(TL) vs. 2 (LT)]. Median operating time was similar in both groups; 105(TL) compared to 98 (LT) minutes. Post-operative complications (1 vs. 10, p = 0.02), analgesia requirements, specifically opiate use (34 vs. 136 morphine equivalents, p = 0.002) and hospital stay (4 vs. 9 days, p = 0.03) were significantly lower in the laparoscopy group. Abdominal trauma in haemodynamically stable patients can be managed effectively and safely with laparoscopy by experienced surgeons. Major benefits may include lower morbidity, reduced pain, and shorter length of hospital stay. Crown Copyright © 2017. Published by Elsevier Ltd. All rights reserved.

  8. Advice Complexity of the Online Search Problem

    DEFF Research Database (Denmark)

    Clemente, Jhoirene; Hromkovič, Juraj; Komm, Dennis

    2016-01-01

    the minimum amount of information needed in order to achieve a certain competitive ratio. We design an algorithm that reads $b$ bits of advice and achieves a competitive ratio of (M/m)^{1/(2^b+1)} where M and m are the maximum and minimum price in the input. We also give a matching lower bound. Furthermore......The online search problem is a fundamental problem in finance. The numerous direct applications include searching for optimal prices for commodity trading and trading foreign currencies. In this paper, we analyze the advice complexity of this problem. In particular, we are interested in identifying......, we compare the power of advice and randomization for this problem....

  9. Maternal Cigarette Smoking during Pregnancy and Offspring Externalizing Behavioral Problems: A Propensity Score Matching Analysis

    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.

  10. The Co-Development of Parenting Stress and Childhood Internalizing and Externalizing Problems.

    Science.gov (United States)

    Stone, Lisanne L; Mares, Suzanne H W; Otten, Roy; Engels, Rutger C M E; Janssens, Jan M A M

    Although the detrimental influence of parenting stress on child problem behavior is well established, it remains unknown how these constructs affect each other over time. In accordance with a transactional model, this study investigates how the development of internalizing and externalizing problems is related to the development of parenting stress in children aged 4-9. Mothers of 1582 children participated in three one-year interval data waves. Internalizing and externalizing problems as well as parenting stress were assessed by maternal self-report. Interrelated development of parenting with internalizing and externalizing problems was examined using Latent Growth Modeling. Directionality of effects was further investigated by using cross-lagged models. Parenting stress and externalizing problems showed a decrease over time, whereas internalizing problems remained stable. Initial levels of parenting stress were related to initial levels of both internalizing and externalizing problems. Decreases in parenting stress were related to larger decreases in externalizing problems and to the (stable) course of internalizing problems. Some evidence for reciprocity was found such that externalizing problems were associated with parenting stress and vice versa over time, specifically for boys. Our findings support the transactional model in explaining psychopathology.

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

    Science.gov (United States)

    2012-04-25

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

  12. Object-based connectedness facilitates matching

    NARCIS (Netherlands)

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

    2003-01-01

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

  13. Platform pricing in matching markets

    NARCIS (Netherlands)

    Goos, M.; van Cayseele, P.; Willekens, B.

    2011-01-01

    This paper develops a simple model of monopoly platform pricing accounting for two pertinent features of matching markets. 1) The trading process is characterized by search and matching frictions implying limits to positive cross-side network effects and the presence of own-side congestion.

  14. Matching score based face recognition

    NARCIS (Netherlands)

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

    2006-01-01

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

  15. Personalized trajectory matching in spatial networks

    KAUST Repository

    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.

  16. Matching Organs

    Science.gov (United States)

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

  17. Solution of adsorption problems involving steep moving profiles

    DEFF Research Database (Denmark)

    Kiil, Søren; Bhatia, Suresh K.

    1998-01-01

    The moving finite element collocation method proposed by Kiil et al. (1995) for solution of problems with steep gradients is further developed to solve transient problems arising in the field of adsorption. The technique is applied to a model of adsorption in solids with bidisperse pore structures....... Numerical solutions were found to match the analytical solution when it exists (i.e. when the adsorption isotherm is linear). Results of this application study show that the method is simple yet sufficiently accurate for use in adsorption problems with steep moving gradients, where global collocation...

  18. Searching for the true diet of marine predators: incorporating Bayesian priors into stable isotope mixing models.

    Directory of Open Access Journals (Sweden)

    André Chiaradia

    Full Text Available Reconstructing the diet of top marine predators is of great significance in several key areas of applied ecology, requiring accurate estimation of their true diet. However, from conventional stomach content analysis to recent stable isotope and DNA analyses, no one method is bias or error free. Here, we evaluated the accuracy of recent methods to estimate the actual proportion of a controlled diet fed to a top-predator seabird, the Little penguin (Eudyptula minor. We combined published DNA data of penguins scats with blood plasma δ(15N and δ(13C values to reconstruct the diet of individual penguins fed experimentally. Mismatch between controlled (true ingested diet and dietary estimates obtained through the separately use of stable isotope and DNA data suggested some degree of differences in prey assimilation (stable isotope and digestion rates (DNA analysis. In contrast, combined posterior isotope mixing model with DNA Bayesian priors provided the closest match to the true diet. We provided the first evidence suggesting that the combined use of these complementary techniques may provide better estimates of the actual diet of top marine predators- a powerful tool in applied ecology in the search for the true consumed diet.

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

    Science.gov (United States)

    2012-04-25

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

  20. Image matching navigation based on fuzzy information

    Institute of Scientific and Technical Information of China (English)

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

    2003-01-01

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

  1. Role model and prototype matching

    DEFF Research Database (Denmark)

    Lykkegaard, Eva; Ulriksen, Lars

    2016-01-01

    ’ meetings with the role models affected their thoughts concerning STEM students and attending university. The regular self-to-prototype matching process was shown in real-life role-models meetings to be extended to a more complex three-way matching process between students’ self-perceptions, prototype...

  2. Matching Intensity-Modulated Radiation Therapy to an Anterior Low Neck Field

    International Nuclear Information System (INIS)

    Amdur, Robert J.; Liu, Chihray; Li, Jonathan; Mendenhall, William; Hinerman, Russell

    2007-01-01

    When using intensity-modulated radiation therapy (IMRT) to treat head and neck cancer with the primary site above the level of the larynx, there are two basic options for the low neck lymphatics: to treat the entire neck with IMRT, or to match the IMRT plan to a conventional anterior 'low neck' field. In view of the potential advantages of using a conventional low neck field, it is important to look for ways to minimize or manage the problems of matching IMRT to a conventional radiotherapy field. Treating the low neck with a single anterior field and the standard larynx block decreases the dose to the larynx and often results in a superior IMRT plan at the primary site. The purpose of this article is to review the most applicable studies and to discuss our experience with implementing a technique that involves moving the position of the superior border of the low neck field several times during a single treatment fraction

  3. Trends in the use of stable isotopes in biochemistry and pharmacology

    International Nuclear Information System (INIS)

    Matwiyoff, N.A.; Walker, T.E.

    1977-01-01

    Recent trends in the use of the stable isotopes 13 C, 15 N and 18 O in biochemistry and pharmacology are reviewed with emphasis on the studies that have employed nuclear magnetic resonance (nmr) spectroscopy and mass spectrometry as analytical techniques. Pharmacological studies with drugs and other compounds labelled with stable isotopes have developed in parallel with the rapid progress in the enhancement of sensitivity and selectivity of gas chromatography - mass spectrometric analyses, and have been directed largely to an evaluation of pharmako-kinetics and drug metabolic pathways. In these studies, illustrated with selected samples, isotopically labelled compounds have been used to advantage as internal standards for the mass spectrometric analyses and as in vivo tracers for metabolites. In the broader discipline of biochemistry, stable isotopes and isotopically labelled compounds have been used increasingly in conjuction with both nmr spectroscopy and mass spectrometry in tracer and structural studies. The more recent trends in the use of stable isotopes in these biochemical studies are discussed in the context of the improvements in analytical techniques. Specific examples will be drawn from investigations of the biosynthesis of natural products by micro-organisms; the protein, fat and carbohydrate fluxes in humans; and the structure and function of enzymes, membranes and other macro-molecular assemblages. The potential for the future development of stable isotopes in biochemistry and pharmacology are considered briefly, together with some of the problems that must be solved if their considerable potential is to be realized. (author)

  4. Influence of the Substrate Properties on the Offset Printing ink Colour Matching

    Directory of Open Access Journals (Sweden)

    Anne Blayo

    2003-07-01

    Full Text Available The printing industry has been using computerised ink colour matching for a long time. The problem of ink formulation is to match a given standard colour with only three or four inks from a basis of about twelve inks.This is generally achieved by calculations based on the well-known Kubelka-Munk turbid media theory, which gives excellent results in many industrial situations. However, some hypotheses are necessary to apply the Kubelka-Munk model and corrections to the measured reflectance are often required (Saunderson’s correction coefficients, for example.One limitation in the resolution of this method of formulation may arise from the fact that the characterisation of the basic inks is made on one standard substrate, which may differ a lot from the real printing substrate.The aim of this work is precisely to study the contribution of the substrate to the colour matching procedure. The properties of the substrate which intervene in the process are physical properties (thickness, absorbency… and optical properties (brightness and gloss. Five different papers were chosen to make the characterisations of the basic offset inks. The reflectance measurements were performed with spectrophotometer X-Rite with the D/0° geometry, specular excluded or included, coupled with a coloured matching software (X-Rite Inkmaster. A special emphasis was put on the influence on the calculation of the ink film thickness, estimated for the different substrates, and on the choice of the correction coefficients for the Kubelka-Munk theory.

  5. Long-term outcome of FFR-guided PCI for stable coronary artery disease in daily clinical practice

    DEFF Research Database (Denmark)

    De Backer, Ole; Biasco, Luigi; Lønborg, Jacob

    2016-01-01

    AIMS: Our aim was to investigate the strength of fractional flow reserve (FFR)-guided percutaneous coronary intervention (PCI) for stable coronary artery disease (CAD) in daily practice. METHODS AND RESULTS: For this study, 3,512 patients with stable CAD and at least one 50-89% coronary stenosis...... were identified; those patients thought to require PCI (n=1,716) were selected. Of these, 962 (56%) were treated based on angiography (XA) alone, whereas 754 patients (44%) had an FFR-guided treatment. In the latter group, 321 patients (43%) were reallocated to another treatment, predominantly medical...... treatment. After propensity score matching, the number of indicated lesions was 957 in the XA-guided group and 947 in the FFR-guided group. FFR guidance resulted in PCI deferral in 462 lesions (48.8%). In a seven-day landmark analysis, the rate of periprocedural myocardial infarction (MI) was less than half...

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

    Science.gov (United States)

    2013-07-02

    ... 1974; CMS Computer Match No. 2013-11; HHS Computer Match No. 1302 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION: Notice of Computer Matching... notice announces the establishment of a CMP that CMS intends to conduct with State-based Administering...

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

    Science.gov (United States)

    2011-03-17

    ... 1974; CMS Computer Match No. 2011-02; HHS Computer Match No. 1007 AGENCY: Department of Health and Human Services (HHS), Centers for Medicare & Medicaid Services (CMS). ACTION: Notice of computer... notice establishes a computer matching agreement between CMS and the Department of Defense (DoD). We have...

  8. Adaptive Correlation Model for Visual Tracking Using Keypoints Matching and Deep Convolutional Feature

    Directory of Open Access Journals (Sweden)

    Yuankun Li

    2018-02-01

    Full Text Available Although correlation filter (CF-based visual tracking algorithms have achieved appealing results, there are still some problems to be solved. When the target object goes through long-term occlusions or scale variation, the correlation model used in existing CF-based algorithms will inevitably learn some non-target information or partial-target information. In order to avoid model contamination and enhance the adaptability of model updating, we introduce the keypoints matching strategy and adjust the model learning rate dynamically according to the matching score. Moreover, the proposed approach extracts convolutional features from a deep convolutional neural network (DCNN to accurately estimate the position and scale of the target. Experimental results demonstrate that the proposed tracker has achieved satisfactory performance in a wide range of challenging tracking scenarios.

  9. Fast image matching algorithm based on projection characteristics

    Science.gov (United States)

    Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun

    2011-06-01

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

  10. Multimodal correlation and intraoperative matching of virtual models in neurosurgery

    Science.gov (United States)

    Ceresole, Enrico; Dalsasso, Michele; Rossi, Aldo

    1994-01-01

    The multimodal correlation between different diagnostic exams, the intraoperative calibration of pointing tools and the correlation of the patient's virtual models with the patient himself, are some examples, taken from the biomedical field, of a unique problem: determine the relationship linking representation of the same object in different reference frames. Several methods have been developed in order to determine this relationship, among them, the surface matching method is one that gives the patient minimum discomfort and the errors occurring are compatible with the required precision. The surface matching method has been successfully applied to the multimodal correlation of diagnostic exams such as CT, MR, PET and SPECT. Algorithms for automatic segmentation of diagnostic images have been developed to extract the reference surfaces from the diagnostic exams, whereas the surface of the patient's skull has been monitored, in our approach, by means of a laser sensor mounted on the end effector of an industrial robot. An integrated system for virtual planning and real time execution of surgical procedures has been realized.

  11. A stable partitioned FSI algorithm for incompressible flow and deforming beams

    International Nuclear Information System (INIS)

    Li, L.; Henshaw, W.D.; Banks, J.W.; Schwendeman, D.W.; Main, A.

    2016-01-01

    An added-mass partitioned (AMP) algorithm is described for solving fluid–structure interaction (FSI) problems coupling incompressible flows with thin elastic structures undergoing finite deformations. The new AMP scheme is fully second-order accurate and stable, without sub-time-step iterations, even for very light structures when added-mass effects are strong. The fluid, governed by the incompressible Navier–Stokes equations, is solved in velocity-pressure form using a fractional-step method; large deformations are treated with a mixed Eulerian-Lagrangian approach on deforming composite grids. The motion of the thin structure is governed by a generalized Euler–Bernoulli beam model, and these equations are solved in a Lagrangian frame using two approaches, one based on finite differences and the other on finite elements. The key AMP interface condition is a generalized Robin (mixed) condition on the fluid pressure. This condition, which is derived at a continuous level, has no adjustable parameters and is applied at the discrete level to couple the partitioned domain solvers. Special treatment of the AMP condition is required to couple the finite-element beam solver with the finite-difference-based fluid solver, and two coupling approaches are described. A normal-mode stability analysis is performed for a linearized model problem involving a beam separating two fluid domains, and it is shown that the AMP scheme is stable independent of the ratio of the mass of the fluid to that of the structure. A traditional partitioned (TP) scheme using a Dirichlet–Neumann coupling for the same model problem is shown to be unconditionally unstable if the added mass of the fluid is too large. A series of benchmark problems of increasing complexity are considered to illustrate the behavior of the AMP algorithm, and to compare the behavior with that of the TP scheme. The results of all these benchmark problems verify the stability and accuracy of the AMP scheme. Results for

  12. A stable partitioned FSI algorithm for incompressible flow and deforming beams

    Energy Technology Data Exchange (ETDEWEB)

    Li, L., E-mail: lil19@rpi.edu [Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180 (United States); Henshaw, W.D., E-mail: henshw@rpi.edu [Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180 (United States); Banks, J.W., E-mail: banksj3@rpi.edu [Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180 (United States); Schwendeman, D.W., E-mail: schwed@rpi.edu [Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180 (United States); Main, A., E-mail: amain8511@gmail.com [Department of Civil and Environmental Engineering, Duke University, Durham, NC 27708 (United States)

    2016-05-01

    An added-mass partitioned (AMP) algorithm is described for solving fluid–structure interaction (FSI) problems coupling incompressible flows with thin elastic structures undergoing finite deformations. The new AMP scheme is fully second-order accurate and stable, without sub-time-step iterations, even for very light structures when added-mass effects are strong. The fluid, governed by the incompressible Navier–Stokes equations, is solved in velocity-pressure form using a fractional-step method; large deformations are treated with a mixed Eulerian-Lagrangian approach on deforming composite grids. The motion of the thin structure is governed by a generalized Euler–Bernoulli beam model, and these equations are solved in a Lagrangian frame using two approaches, one based on finite differences and the other on finite elements. The key AMP interface condition is a generalized Robin (mixed) condition on the fluid pressure. This condition, which is derived at a continuous level, has no adjustable parameters and is applied at the discrete level to couple the partitioned domain solvers. Special treatment of the AMP condition is required to couple the finite-element beam solver with the finite-difference-based fluid solver, and two coupling approaches are described. A normal-mode stability analysis is performed for a linearized model problem involving a beam separating two fluid domains, and it is shown that the AMP scheme is stable independent of the ratio of the mass of the fluid to that of the structure. A traditional partitioned (TP) scheme using a Dirichlet–Neumann coupling for the same model problem is shown to be unconditionally unstable if the added mass of the fluid is too large. A series of benchmark problems of increasing complexity are considered to illustrate the behavior of the AMP algorithm, and to compare the behavior with that of the TP scheme. The results of all these benchmark problems verify the stability and accuracy of the AMP scheme. Results for

  13. Analysis of matches and partial-matches in a Danish STR data set

    DEFF Research Database (Denmark)

    Tvedebrink, Torben; Eriksen, Poul Svante; Curan, James Michael

    2012-01-01

    Over the recent years, the national databases of STR profiles have grown in size due to the success of forensic DNA analysis in solving crimes. The accumulation of DNA profiles implies that the probability of a random match or near match of two randomly selected DNA profiles in the database...... increases. We analysed 53,295 STR profiles from individuals investigated in relation to crime case investigations at the Department of Forensic Medicine, Faculty of Health Sciences, University of Copenhagen, Denmark. Incomplete STR profiles (437 circa 0.8% of the total), 48 redundant STR profiles from...

  14. Radargrammetric DSM generation in mountainous areas through adaptive-window least squares matching constrained by enhanced epipolar geometry

    Science.gov (United States)

    Dong, Yuting; Zhang, Lu; Balz, Timo; Luo, Heng; Liao, Mingsheng

    2018-03-01

    Radargrammetry is a powerful tool to construct digital surface models (DSMs) especially in heavily vegetated and mountainous areas where SAR interferometry (InSAR) technology suffers from decorrelation problems. In radargrammetry, the most challenging step is to produce an accurate disparity map through massive image matching, from which terrain height information can be derived using a rigorous sensor orientation model. However, precise stereoscopic SAR (StereoSAR) image matching is a very difficult task in mountainous areas due to the presence of speckle noise and dissimilar geometric/radiometric distortions. In this article, an adaptive-window least squares matching (AW-LSM) approach with an enhanced epipolar geometric constraint is proposed to robustly identify homologous points after compensation for radiometric discrepancies and geometric distortions. The matching procedure consists of two stages. In the first stage, the right image is re-projected into the left image space to generate epipolar images using rigorous imaging geometries enhanced with elevation information extracted from the prior DEM data e.g. SRTM DEM instead of the mean height of the mapped area. Consequently, the dissimilarities in geometric distortions between the left and right images are largely reduced, and the residual disparity corresponds to the height difference between true ground surface and the prior DEM. In the second stage, massive per-pixel matching between StereoSAR epipolar images identifies the residual disparity. To ensure the reliability and accuracy of the matching results, we develop an iterative matching scheme in which the classic cross correlation matching is used to obtain initial results, followed by the least squares matching (LSM) to refine the matching results. An adaptively resizing search window strategy is adopted during the dense matching step to help find right matching points. The feasibility and effectiveness of the proposed approach is demonstrated using

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

    Science.gov (United States)

    2013-08-19

    ... 1974; CMS Computer Match No. 2013-10; HHS Computer Match No. 1310 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION: Notice of Computer Matching... notice announces the establishment of a CMP that CMS plans to conduct with the Department of Homeland...

  16. Techniques Used in String Matching for Network Security

    OpenAIRE

    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.

  17. Stable multiple-layer stationary solutions of a semilinear parabolic equation in two-dimensional domains

    Directory of Open Access Journals (Sweden)

    Arnaldo Simal do Nascimento

    1997-12-01

    Full Text Available We use $Gamma$--convergence to prove existence of stable multiple--layer stationary solutions (stable patterns to the reaction--diffusion equation. $$ eqalign{ {partial v_varepsilon over partial t} =& varepsilon^2, hbox{div}, (k_1(xabla v_varepsilon + k_2(x(v_varepsilon -alpha(Beta-v_varepsilon (v_varepsilon -gamma_varepsilon(x,,hbox{ in }Omegaimes{Bbb R}^+ cr &v_varepsilon(x,0 = v_0 quad {partial v_varepsilon over partial widehat{n}} = 0,, quadhbox{ for } xin partialOmega,, t >0,.} $$ Given nested simple closed curves in ${Bbb R}^2$, we give sufficient conditions on their curvature so that the reaction--diffusion problem possesses a family of stable patterns. In particular, we extend to two-dimensional domains and to a spatially inhomogeneous source term, a previous result by Yanagida and Miyata.

  18. Football officials activities during matches: a comparison of activity of referees and linesmen in European, Premiership and Championship matches

    OpenAIRE

    Di Salvo, Valter; Carmont, Michael R; Maffulli, Nicola

    2012-01-01

    We compared the notational activity of 68 referees and 170 referee’s assistants or linesmen officiating European matches from UEFA and the Champions League together with matches from the English Premiership and the English Championship competitions during the 2005/2006 football season using a computerised video system. We studied 328 games (14 European matches, UEFA and Champions league, 202 matches from the English Premiership and 112 from the English Championship).

  19. An Investigation of the Complexities of Successful and Unsuccessful Guide Dog Matching and Partnerships.

    Science.gov (United States)

    Lloyd, Janice; Budge, Claire; La Grow, Steve; Stafford, Kevin

    2016-01-01

    Matching a person who is blind or visually impaired with a guide dog is a process of finding the most suitable guide dog available for that individual. Not all guide dog partnerships are successful, and the consequences of an unsuccessful partnership may result in reduced mobility and quality of life for the handler (owner), and are costly in time and resources for guide dog training establishments. This study examined 50 peoples' partnerships with one or more dogs (118 pairings) to ascertain the outcome of the relationship. Forty-three of the 118 dogs were returned to the guide dog training establishment before reaching retirement age, with the majority ( n  = 40) being categorized as having dog-related issues. Most ( n  = 26) of these dogs' issues were classified as being behavioral in character, including work-related and non-work-related behavior, and 14 were due to physical causes (mainly poor health). Three dogs were returned due to matters relating to the handlers' behavior. More second dogs were returned than the handlers' first or third dogs, and dogs that had been previously used as a guide could be rematched successfully. Defining matching success is not clear-cut. Not all dogs that were returned were considered by their handlers to have been mismatched, and not all dogs retained until retirement were thought to have been good matches, suggesting that some handlers were retaining what they considered to be a poorly matched dog. Almost all the handlers who regarded a dog as being mismatched conceded that some aspects of the match were good. For example, a dog deemed mismatched for poor working behavior may have shown good home and/or other social behaviors. The same principle was true for successful matches, where few handlers claimed to have had a perfect dog. It is hoped that these results may help the guide dog industry identify important aspects of the matching process, and/or be used to identify areas where a matching problem exists.

  20. An investigation of the complexities of successful and unsuccessful guide dog matching and partnerships.

    Directory of Open Access Journals (Sweden)

    Janice Kathryn Foyer Lloyd

    2016-12-01

    Full Text Available Matching a person who is blind or visually impaired with a guide dog is a process of finding the most suitable guide dog available for that individual. Not all guide dog partnerships are successful, and the consequences of an unsuccessful partnership may result in reduced mobility and quality of life for the handler (owner, and are costly in time and resources for guide dog training establishments. This study examined 50 peoples’ partnerships with one or more dogs (118 pairings to ascertain the outcome of the relationship. Forty three of the 118 dogs were returned to the guide dog training establishment before reaching retirement age, with the majority (n = 40 being categorised as having dog related issues. Most (n = 26 of these dogs’ issues were classified as being behavioural in character, including work related and non-work related behaviour, and 14 were due to physical causes (mainly poor health. Three dogs were returned due to matters relating to the handlers’ behaviour. More second dogs were returned than the handlers’ first or third dogs, and dogs that had been previously used as a guide could be rematched successfully. Defining matching success is not clear-cut. Not all dogs that were returned were considered by their handlers to have been mismatched, and not all dogs retained until retirement were thought to have been good matches, suggesting that some handlers were retaining what they considered to be a poorly matched dog. Almost all the handlers who regarded a dog as being mismatched conceded that some aspects of the match were good. For example, a dog deemed mismatched for poor working behaviour may have shown good home and/or other social behaviours. The same principle was true for successful matches, where few handlers claimed to have had a perfect dog. It is hoped that these results may help the guide dog industry identify important aspects of the matching process, and/or be used to identify areas where a matching problem