Showing papers on "Matching (statistics) published in 1989"
TL;DR: In this paper, the matching properties of the threshold voltage, substrate factor, and current factor of MOS transistors have been analyzed and measured, and the matching results have been verified by measurements and calculations on several basic circuits.
Abstract: The matching properties of the threshold voltage, substrate factor, and current factor of MOS transistors have been analyzed and measured. Improvements to the existing theory are given, as well as extensions for long-distance matching and rotation of devices. Matching parameters of several processes are compared. The matching results have been verified by measurements and calculations on several basic circuits. >
3,121 citations
TL;DR: The theoretical and practical issues encountered in conducting the matching operation and the results of that operation are discussed.
Abstract: A test census of Tampa, Florida and an independent postenumeration survey (PES) were conducted by the U.S. Census Bureau in 1985. The PES was a stratified block sample with heavy emphasis placed on hard-to-count population groups. Matching the individuals in the census to the individuals in the PES is an important aspect of census coverage evaluation and consequently a very important process for any census adjustment operations that might be planned. For such an adjustment to be feasible, record-linkage software had to be developed that could perform matches with a high degree of accuracy and that was based on an underlying mathematical theory. A principal purpose of the PES was to provide an opportunity to evaluate the newly implemented record-linkage system and associated methodology. This article discusses the theoretical and practical issues encountered in conducting the matching operation and presents the results of that operation. A review of the theoretical background of the record-linkage...
1,347 citations
TL;DR: In this paper, optimal matched samples are obtained using network flow theory, which yields optimal constructions for several statistical matching problems that have not been studied previously, including the construction of matched samples with multiple controls, with a variable number of controls, and the balanced matched samples that combine features of pair matching and frequency matching.
Abstract: Matching is a common method of adjustment in observational studies. Currently, matched samples are constructed using greedy heuristics (or “stepwise” procedures) that produce, in general, suboptimal matchings. With respect to a particular criterion, a matched sample is suboptimal if it could be improved by changing the controls assigned to specific treated units, that is, if it could be improved with the data at hand. Here, optimal matched samples are obtained using network flow theory. In addition to providing optimal matched-pair samples, this approach yields optimal constructions for several statistical matching problems that have not been studied previously, including the construction of matched samples with multiple controls, with a variable number of controls, and the construction of balanced matched samples that combine features of pair matching and frequency matching. Computational efficiency is discussed. Extensive use is made of ideas from two essentially disjoint literatures, namely st...
654 citations
TL;DR: In this paper, the matching process constitutes a key feature of the on-the-job training model presented in this article and tested with a unique data set containing extensive information concerning on the job training, employer search, wages and wage and productivity growth.
Abstract: Conventional analysis predicts that workers pay part of their on-the-job training costs by accepting a lower starting wage and subsequently realize a return to this investment in the form of greater wage growth. Missing from the conventional treatment of on-the-job training is a discussion of the process by which heterogeneous workers are matched to jobs requiring varying amounts of training. This matching process constitutes a key feature of the on-the-job training model presented in this article and tested with a unique data set containing extensive information concerning on-the-job training, employer search, wages, and wage and productivity growth.
390 citations
TL;DR: Experimental results on Landsat images show that the proposed method produces results comparable to those obtained by an experienced photointerpreter, and the robustness of the proposed algorithm was demonstrated through simulation experiments.
Abstract: Image registration of Landsat Thematic Mapper scenes with translational and rotational differences is studied. Two major steps of image registration, control-point selection and control-point matching, are emphasized. In control-point selection, the properties that a good control point should satisfy are defined. Several potential control-point candidates are suggested, and methods are discussed for extracting them from the input image. In control-point matching, a relaxation algorithm proposed in the literature is improved by reducing its time complexity from O(n/sup 4/) to O(n/sup 3/), where n is the number of control points. The matching algorithm also uses a two-way matching concept which utilizes the inherent symmetry property of the point-matching problem. The robustness of the proposed algorithm was demonstrated through simulation experiments by evaluating a matching index. Experimental results on Landsat images show that the proposed method produces results comparable to those obtained by an experienced photointerpreter. >
224 citations
TL;DR: Affect comprehension was studied in children with pervasive developmental disorders (PDD) and normal children matched for mental age, and face and affect matching were significantly correlated with mental age as well as social behavior and play.
Abstract: Affect comprehension was studied in children with pervasive developmental disorders (PDD) and normal children matched for mental age. Three matching tasks were used: matching objects (a nonsocial control task), matching faces, and matching affects. The three tasks were developed to be of equal difficulty for normal children. Children were also tested for comprehension and expression of affect terms. The PDD children were impaired on affect matching relative to the normal controls. The PDD children were impaired on face and affect matching relative to their own performance on object matching, whereas the normal children were not. Within the PDD sample, object matching was correlated with mental age measures but not with measures of social behavior and play, but face and affect matching were significantly correlated with mental age as well as social behavior and play. Individual PDD children who showed relative deficits on face or affect matching tended to be more socially impaired than PDD children whose face and affect matching was consonant with their mental age. Results are discussed in terms of possible etiologies of the social deficit in PDD children, and the importance of subtypes within this population.
188 citations
TL;DR: In this article, the authors describe the convex hull of the incidence vectors of stable matchings and propose a linear program to solve the optimal stable marriage problem as a linear programming problem.
184 citations
TL;DR: A new algorithm for stereo matching is described, which has been designed to work well with data from the SPOT satellite, and is basically an extension of Gruen's adaptive least squares correlation algorithm, so that whole images can be automatically matched, instead of just selected patches.
184 citations
Posted Content•
TL;DR: In this paper, the authors present a picture of the labor market, one with large flows of jobs and workers, and matching, and develop a consistent approach to the interaction among those flows and the stocks of unemployed workers and vacant jobs, and to the determination of wages.
Abstract: We present a picture of the labor market, one with large flows of jobs and workers, and matching. We develop a consistent approach to the interaction among those flows and the stocks of unemployed workers and vacant jobs, and to the determination of wages. We estimate the matching function, using both aggregate data and data from manufacturing and find evidence of a stable matching process in the data. We examine the joint movements in unemployment, vacancies and wages -the Beveridge and Phillips curve relations- in the light of our model. We conclude that aggregate activity shocks rather than reallocation shocks dominate the movement of unemployment.
163 citations
TL;DR: In this article, the authors show that the set of stable outcomes (which is equal to the core defined by weak domination) has some surprising properties not found in models of one-to-one matching.
Abstract: The college admissions problem is perhaps the simplest model of many-to-one matching in two-sided markets, such as labor markets The authors show that the set of stable outcomes (which is equal to the core defined by weak domination) has some surprising properties not found in models of one-to-one matching These properties may help to explain the success that this kind of model has had in explaining empirical observations Copyright 1989 by The Econometric Society
154 citations
TL;DR: In this article, the authors present a picture of the labor market, one with large flows of jobs and workers, and matching, and develop a consistent approach to the interaction among those flows and the stocks of unemployed workers and vacant jobs, and to the determination of wages.
Abstract: We present a picture of the labor market, one with large flows of jobs and workers, and matching. We develop a consistent approach to the interaction among those flows and the stocks of unemployed workers and vacant jobs, and to the determination of wages. We estimate the matching function, using both aggregate data and data from manufacturing and find evidence of a stable matching process in the data. We examine the joint movements in unemployment, vacancies and wages -the Beveridge and Phillips curve relations- in the light of our model. We conclude that aggregate activity shocks rather than reallocation shocks dominate the movement of unemployment.
TL;DR: This paper proposes the use of management development as an alternate means of achieving manager—strategy alignment by suggesting that choice of alignment method is contingent upon particular strategic, structural, and cultural factors.
Abstract: Several articles have recently been published stressing the importance of matching managerial talent with organizational strategy. These have generally relied on selection to ‘fit’ the manager to the strategy. This paper proposes the use of management development as an alternate means of achieving manager—strategy alignment. Management development is defined, its role in strategy implementation is discussed, and its benefits and costs are identified. These are contrasted with the costs, benefits and strategic role of selection. It is suggested that choice of alignment method (i.e. management development versus selection) is contingent upon particular strategic, structural, and cultural factors. These contingency relationships are presented as a series of research propositions.
TL;DR: In this article, the authors consider a natural model of incomplete information, in which agents know their own preferences but may not know those of others, and show that results concerning dominant and dominated strategies carry over from the complete information case to the present model, but results concerning Nash equilibrium do not.
TL;DR: The minimax grid matching problem and the maximum up-right matching problem are solved and tight upper bounds on the average case behavior of the best algorithms known for 2-dimensional bin packing, 1-dimensional on-line bin packing and on- line dynamic allocation are obtained.
Abstract: The minimax grid matching problem is a fundamental combinatorial problem associated with the average case analysis of algorithms. The problem has arisen in a number of interesting and seemingly unrelated areas, including wafer-scale integration of systolic arrays, two-dimensional discrepancy problems, and testing pseudorandom number generators. However, the minimax grid matching problem is best known for its application to the maximum up-right matching problem. The maximum up-right matching problem was originally defined by Karp, Luby and Marchetti-Spaccamela in association with algorithms for 2-dimensional bin packing. More recently, the up-right matching problem has arisen in the average case analysis of on-line algorithms for 1-dimen-sional bin packing and dynamic allocation. In this paper, we solve both the minimax grid matching problem and the maximum up-right matching problem. As a direct result, we obtain tight upper bounds on the average case behavior of the best algorithms known for 2-dimensional bin packing, 1-dimensional on-line bin packing and on-line dynamic allocation. The results also solve a long-open question in mathematical statistics.
01 Nov 1989
TL;DR: Considering the lower number of features and the high discrimination power of the primitive, the region-based matcher is more efficient and accurate than those using edge-based primitives.
Abstract: The authors consider the development of a practical binocular stereo approach for extracting depth information. This approach is particularly well suited for robot vision systems designed for inspection and manipulation tasks. The authors emphasize the importance of semantic content and stability of the primitive used in stereo matching and introduce the use of homogeneous regions as features in stereo matching. Considering the lower number of features and the high discrimination power of the primitive, the region-based matcher is more efficient and accurate than those using edge-based primitives. A region-based matching technique can utilize both local and global information and thus yield a more globally consistent solution. However, region-based matching processes typically yield coarse disparity maps. It is noted that it is critical that an efficient and robust stereo system utilize the most appropriate set of primitives at each state of the process. A hierarchical stereo approach that does so is proposed. Several experiments to evaluate the performance of a region-based stereo matcher and a straightforward disparity and depth generation module are described. >
TL;DR: It is shown that Stable Matching problems are the same as problems about stable configurations of X-networks and consequences include easy proofs of old theorems, a new simple algorithm for finding a stable matching, and a fast parallel reduction from the Stable Marriage problem to the Assignment problem.
Abstract: It is shown that Stable Matching problems are the same as problems about stable configurations of X-networks. Consequences include easy proofs of old theorems, a new simple algorithm for finding a stable matching, an understanding of the difference between Stable Marriage and Stable Roommates, NP-completeness of Three-party Stable Marriage, CC-completeness of several Stable Matching problems, and a fast parallel reduction from the Stable Marriage problem to the Assignment problem.
TL;DR: An algorithm is presented for error detection and correction of disparity, as a process separate from stereo matching, with the contention that matching is not necessarily the best way to utilize all the physical constraints characteristic to stereopsis.
Abstract: An algorithm is presented for error detection and correction of disparity, as a process separate from stereo matching, with the contention that matching is not necessarily the best way to utilize all the physical constraints characteristic to stereopsis As a result of the bias in stereo research towards matching, vision tasks like surface interpolation and object modeling have to accept erroneous data from the stereo matchers without the benefits of any intervening stage of error correction An algorithm which identifies all errors in disparity data that can be detected on the basis of figural continuity and corrects them is presented The algorithm can be used as a postprocessor to any edged-based stereo matching algorithm, and can additionally be used to automatically provide quantitative evaluations on the performance of matching algorithms of this class >
TL;DR: In earlier work, the Erdijs-Bnyi law for pure head runs was generalized to exact matching patterns between two sequences, which is extended to include matchings of quality a between p and 1, and the motivation for this work is the comparison of DNA sequences.
Abstract: 1. Informal introduction. The Erdos-Bnyi law [Erdijs and R6nyi (1970)l for coin tossing is a strong law for the behavior of the length of long success rich runs. For the length R, of the longest run of pure heads in n tosses, the result is that with probability l,lin~~+~ RJlog,,,(n) = 1, where p = flheads) > 0. A more general result is quoted as formula (1) in Section 2 for RZ, the longest head rich run in which the fraction of heads is at least a > p. Note that R, = Ri. In many practical situations, such as manufacturing or roulette, observations are taken sequentially and each can be classified as success or failure. For these cases, it is possible to use the Erdijs-Wnyi law to test the hypothesis that the success probability is p. From another point of view, the Erdijs-Bnyi law can be used to recognize patterns of unusually long runs of succe88e8 (or failures). Our interest is in the recognition of unusually long patterns or words common to two random sequences. The patterns are unknown prior to an examination of the sequences. The motivation for this work is the comparison of DNA sequences, which can be modeled as sequences of i.i.d. or Markov distributed letters. Evolution operates to conserve, although imperfectly, patterns important to biological function. It is a task of biology to discover these patterns and their function. In earlier work, we generalized the Erdiie-Bnyi law for pure head runs (a = 1) to exact matching patterns between two sequences. In this paper we extend those results to include matchings of quality a between p and 1. The examples below illustrate the natural analogs of RZ studied in this paper. Two words form a “quality a matching” if they have the same length and the
04 Jun 1989
TL;DR: Stereo matching is the process of determining correspondences between entities in related images, and regions are considered as the primitives to be matched, since many of the shortcomings inherent in approaches based on points or lines can be overcome by taking more developed entities.
Abstract: Stereo matching is the process of determining correspondences between entities in related images Often, this is treated as two quite independent subprocesses, namely, segmentation, followed by matching These processes are treated as naturally related, in that partial matching is fed back to the segmentation and both proceed simultaneously in a cooperative fashion Regions are considered as the primitives to be matched, since many of the shortcomings inherent in approaches based on points or lines can be overcome by taking more developed entities The implementation is based on maintaining a hierarchy of segmented regions in each image, corresponding to analysis at differing scales The selection of a particular segmentation in each image at a scale appropriate to each region is validated with reference to the optimal matching region in the other image Examples of these methods, applied to a synthetic image (incorporating color) and to natural office scenes, are presented >
TL;DR: The authors investigated the commonsense view that "people tend to marry people who look like themselves" by having younger and older raters judge the degree of facial similarity among pairs of photographs representing either actual couples, or randomly paired same age individuals of the opposite sex.
Abstract: This study investigates the commonsense view that 'people tend to marry people who look like themselves'. Various explanations of the observation of facial resemblance were considered by having younger and older raters judge the degree of facial similarity among pairs of photographs representing either actual couples, or randomly paired same age individuals of the opposite sex. The results suggest that the observation of facial resemblance among couples appears to reflect a real phenomenon. It was observed by both young and old, and in new as well as older marital relationships. The study provided no supportfor environmental co-existence, perceptual bias, or matching hypotheses as explanations for this facial resemblance. However, the results are consistent with an explanation based on the repeated mere exposure hypothesis, suggesting that through repeated exposure to their own face and to the faces of others genetically similar to themselves, individuals develop an attraction to faces similar to their own.
TL;DR: By reducing an array matching problem to a string matching problem in a natural way, it is shown that efficient string matching algorithms can be applied to arrays, assuming that a linear preprocessing is made on the text.
Abstract: By reducing an array matching problem to a string matching problem in a natural way, it is shown that efficient string matching algorithms can be applied to arrays, assuming that a linear preprocessing is made on the text.
TL;DR: In this paper, the welfare implications of symmetrical improvements in information and accompanying screening mechanisms which allow for improved matching of individuals to their respective risk classes are investigated, and it is demonstrated that the structural form of the heterogeneity of technologies and the type of insurance contracts available in the market determine in an interactive way the value of information which improves the matching of individual to risk class.
Patent•
13 Jun 1989
TL;DR: In this article, a method and apparatus for performing kinematic analysis of linkages is described, along with an improved optimization technique along with a closed-form kinematics analysis method.
Abstract: A method and apparatus for performing kinematic analysis of linkages is disclosed. Generalized mechanisms are selected from a catalog of mechanisms. From an initial selection of mechanisms, the one most closely matching a desired behavior is chosen and an optimization procedure is conducted. The method may be preceded by a qualitative kinematic analysis or the qualitative analysis may be used in lieu of a catalog selection. An improved optimization technique is disclosed, along with a closed form kinematic analysis method.
TL;DR: In this paper, the authors provide an empirical evaluation of performance appraisal systems and provide evidence about how well organizations adhere to these conceptual prescriptions, but little evidence exists about the effectiveness of these prescriptions.
Abstract: Research on performance appraisal systems provides many conceptual prescriptions, but little evidence exists about how well organizations adhere to these prescriptions. This article provides an emp...
TL;DR: In this article, the authors examine the question of strategic structural choice between centralized and formalized means of control and propose an alternative approach in conceiving and operationalizing the problem of choice, using the "Indifference Curves" postulate as put forward in neo-classical economic theory.
Abstract: Drawing on previous research on patterns of organization structures, this paper examines the question of strategic structural choice between centralized and formalized means of control. An alternative approach in conceiving and operationalizing the problem of choice is suggested. This uses the 'Indifference Curves' postulate as put forward in neo-classical economic theory. An operational model featuring 'trade-offs' between centralized and formalized control is proposed.The conclusions are that the framework based on the notion of 'indifference' provides reasonable theoretical strength in portraying and explaining trade-offs in structural choices. Theoretically infinite trade-offs in choices between means of control find limits in the purposive search for equilibrium (optimum choice), for example in matching the amount/type of structuring with constraints such as size.
TL;DR: A test is developed, which determines, for a given preference profile, whether a fair algorithm exists or not, but the mutual agreement algorithm now is fair under this definition of fairness.
Abstract: We analyze the Gale-Shapley matching problem within the context of Rawlsian justice. Defining a fair matching algorithm by a set of 4 axioms (Gender Indifference, Peer Indifference, Maximin Optimality, and Stability), we show that not all preference profiles admit a fair matching algorithm, the reason being that even this set of minimal axioms is too strong in a sense. Because of conflict between Stability and Maximin Optimality, even the algorithm which generates the mutual agreement match, paradoxically, has no chance to be fair.
TL;DR: It is shown that matching and unification in collapse free cquational theories behave similar with respect to the existence and the cardinality of minimal complete sets of solutions and that unification may become undecidable, if the authors add new free constants to the signature.
TL;DR: In this article, an algorithm is introduced to determine proper and stable solutions to the model matching problem, which utilizes the theory of inverses and state-space algorithms, and it guarantees a proper, stable solution to the problem when one exists.
Abstract: An algorithm is introduced to determine proper and stable solutions to the model matching problem. It utilizes the theory of inverses and state-space algorithms, and it guarantees a proper and stable solution to the problem when one exists. This approach is also used to determine proper and stable solutions of the two-sided matching problem. Examples are included. >
TL;DR: It is explained how fuzziness is incorporated in the structure of the net and its influence on matching process is clarified, and interesting aspects of matching and inverse matching procedures are underlined.