Showing papers on "Matching (statistics) published in 1988"
••
TL;DR: A typology evaluating the feasibility of strategy combinations is developed and the typology's implications for research and managerial practice are discussed.
Abstract: This paper discusses possibilities for combining collective and competitive strategies. Combinations can be problematic if competitive intentions are disclosed through the information links resulting from collective strategies. After describing how different collective strategies may lead to an uncontrolled disclosure of strategic information, a typology evaluating the feasibility of strategy combinations is developed. The typology's implications for research and managerial practice are discussed.
219 citations
••
177 citations
••
129 citations
••
71 citations
••
01 Sep 1988TL;DR: In this article, 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 a band-gap reference circuit.
Abstract: The matching properties of the threshold voltage, substrate factor and current factor of MOS transistors have been analysed and measured. Improvements of the existing theory are given, as well as extensions for long distance matching and rotation of devices. The matching results have been verified by measurements and calculations on a band-gap reference circuit.
68 citations
••
TL;DR: Close agreement between the measured and predicted means, ranges, and distributions of exponent values implies that CMM combined with line-length information can be used with success to determine an individual's rate of loudness growth.
Abstract: An investigation of the relation among individual power-function exponents for 51 adults with normal hearing was undertaken. Three different psychophysical procedures were employed: absolute magnit...
68 citations
••
TL;DR: Matching and maximizing are not competing theories about the fundamental nature of choice, but compatible points of view that may reveal environmental function and behavioral structure.
Abstract: Reinforcers under typical concurrent variable-interval, variable-ratio schedules may be (a) earned and obtained during the variable-interval component, (b) earned and obtained during the variable-ratio component, or (c) earned during the variable-ratio component and obtained during the variable-interval component. Categories a and b, which have no bearing on matching versus maximizing accounts of choice, were set at zero. The rate of Category c reinforcers and the duration of a changeover delay were varied. Simple matching, which predicts exclusive choice of the variable-interval component, and strict maximizing of overall reinforcement rate, which predicts a bias towards the variable-ratio component, were both disconfirmed: Subjects spent approximately 25% of their time in the variable-ratio component, contrary to the matching prediction, but earned only about one third of the reinforcers predicted by strict maximizing. However, maximizing describes the findings functionally in terms of discounting of delayed reinforcers; matching may describe the data in terms of a restructuring of the alternatives. Matching and maximizing are not competing theories about the fundamental nature of choice, but compatible points of view that may reveal environmental function and behavioral structure.
65 citations
••
TL;DR: The technique used in this study was shown to be effective in teaching abstract relations to nonverbal retarded children and to demonstrate particular features of stimulus control sufficient to enable generalized matching.
Abstract: In an extension of prior research, four retarded children were trained under an identity matching-to-sample procedure containing features previously shown to produce controlled generalization to novel stimuli. They first were taught to relate a particular handsign to the sample shape, then to maintain the handsign over a delay interval, and then to select from an array the comparison shape that permitted the handsign to be maintained (i.e., the shape identical to the sample). An initial test revealed little generalization of matching to novel stimuli, but after handsigns were trained to these stimuli, accurate generalized matching appeared immediately. The results replicated prior findings and demonstrated particular features of stimulus control sufficient to enable generalized matching. A behavioral account of relational matching was supported. The technique used in this study was shown to be effective in teaching abstract relations to nonverbal retarded children.
63 citations
••
[...]
TL;DR: A computational approach to image matching that uses multiple attributes associated with a pixel to yield a generally overdetermined system of constraints, taking into account possible structural discontinuities and occlusions.
Abstract: Establishing correspondences between images of the same scene is one of the most challenging and critical stcps in motion and scene analysis. Part of the difficulty is due to a wide variety of three-dimension structural discontinuities and occlusions that occur in real world scenes. This paper describes a computational approach to image matching that uses multiple attributes associated with a pixel to yield a generally overdetermined system of constraints, taking into account possible structural discontinuities and occlusions. In the algorithm implemented, intensity, edgeness, and comemess attributes are used in conjunction with the constraints arising from intraregional smoothness, field continuity and discontinuity, and occlusions to compute dense displacement fields and occlusion maps at pixel grids. A multiresolution multigrid structure is employed to deal with large disparities. Coarser level attributes are obtained by blurring the finer level attributes. The algorithms are tested on real world scenes containing depth discontinuities and occlusions. A special case of two-view matching is stereo matching where the motion between two images is known. The general algorithm given here can be easily spccialized to perfonn stereo matching using epipolar line constraint.
57 citations
••
TL;DR: In this paper, it is argued that the variety of uses of any single forecast, such matching is impractical and there is little evidence that matching would have any impact on comparative forecast performance, however measured.
52 citations
••
01 Jan 1988TL;DR: In this article, a methodology based on advanced metrology to quantify the overlay performance of individual wafer steppers and a means to optimize their matching is described, using accurate two point through the lens alignment directly referenced to the reticle and a three axis interferometrically controlled X-Y-0 stage.
Abstract: This paper describes a methodology based on advanced metrology to quantify the overlay performance of individual wafer steppers and a means to optimize their matching. Use of accurate two point through the lens alignment directly referenced to the reticle and a three axis interferometrically controlled X-Y-0 stage permits full characterisation of the individual machine overlay errors. With the help of parameters determined in an extended metrology model of the microlithographic lens distortions and the wafer stage grid distortions one can automatically adjust corresponding machine servo-mechanisms for optimum matching. The model can be used to calculate and predict the systematic errors between random pairs of machines rather thav having to directly measure all pairs, so ensuring efficient, high quality matching. Results of an eight machine matching experiment demonstrating the model's validity and effective use on PAS 2500 wafer steppers are described.
••
TL;DR: The number and percentage of graduating seniors from medical schools in the United States who have matched to categorical programs in internal medicine in the National Resident Matching Program have decreased since 1985 and the clerkship programs must be restructured to provide students an improved introduction to internal medicine.
Abstract: The number and percentage of graduating seniors from medical schools in the United States who have matched to categorical programs in internal medicine in the National Resident Matching Pr...
••
07 Jun 1988TL;DR: A novel method of broadbanding which utilizes the parametric representation of Brune functions is applied to double-matching problems and it is concluded that the real frequency-direct computational and theparametric methods of broadband matching yield similar results with the same complexity of the matching networks.
Abstract: A novel method of broadbanding which utilizes the parametric representation of Brune functions is applied to double-matching problems. Examples are presented to exhibit the use of the parametric-broadband matching procedure. The results obtained are compared with those obtained by the real frequency-direct computational technique. It is concluded that the real frequency-direct computational and the parametric methods of broadband matching yield similar results with the same complexity of the matching networks. On the other hand, if the complexity of the equalizer is increased, the parametric approach offers high numerical stability with less computation. >
••
TL;DR: In this paper, a model of bargaining in marriage markets is presented, where each couple bargains in a systematic way over the distribution of the utility of their marriage and each market participant has accurate conjectures about the utility he or she could obtain through a similar bargaining process with every other potential partner.
••
TL;DR: In this paper, the authors estimate the error due to averaging by fitting a Robertson-Walker model to an inhomogeneous Tolman model using realistic density profiles, and they find that errors are of the order of 10% or more.
Abstract: Since the equations of general relativity are nonlinear, it is not strictly correct to obtain average values by integrating over spatial volumes. Yet this is really what is done in the attempt to fit our rather lumpy universe to a standard cosmological model of uniform density. Consequently, the fitting problem, raised last year by Ellis and Stoeger [1], asks how accurate the average values derived from observational cosmology can be, even without measurement uncertainties. Do they really describe the best-fit Robertson-Walker model to our universe? One of the alternatives to averaging they suggested was that of volume matching. We try to provide a first estimate of the error due to averaging by fitting a Robertson-Walker model to an inhomogeneous Tolman model using realistic density profiles. Comparing the results from volume matching and from averaging, we find that errors are of the order of 10% or more.
••
TL;DR: In this paper, it was shown that, with price matching, prices ultimately charged to consumers are higher, and that price matching implies costless recall, whereas recall is not always interchangeable.
Abstract: Some sellers announce openly to prospective buyers that they will match any competitor's lower price on similar products. This practice is visible among many retailers of consumer durables such as TV sets, stereo components, cameras and personal computers. In more covert and informal forms, price matching is ubiquitous. It exists whenever individual sellers of a product are known to be generally willing to lower their prices when confronted by prospective buyers who can demonstrate information of lower prices elsewhere. Attempts to demonstrate and verify such information usually constitute part of the haggling process. One often wonders, will prices consumers ultimately pay indeed be lower with such haggling? Will apparently "aggressive" price matching strategies result in lower or higher equilibrium prices? This paper deals with an environment in which information is not perfect and buyers engage in costly, sequential search.' It will be shown that, with price matching, prices ultimately charged to consumers are higher. The crucial assumption here is that buyers' marginal search cost increases with the number of searches already performed. With this assumption, the main idea driving our results is as follows. In the presence of increasing marginal search cost, price matching encourages search. Therefore, there will be more prospective buyers who will have performed a larger number of searches. Their marginal search cost will be higher on the average. Thus, firms will be able to take advantage of this and charge higher prices. But why would price matching encourage search if marginal search cost is increasing? The answer lies in that price matching implies costless recall. In sequential search models with consumers facing a known price distribution and constant marginal search cost, whether recall is costless or costly is immaterial. For then consumers' optimal strategy is a constant reservationprice strategy, implying that prices rejected earlier will never be acceptable. The desire to recall never arises, so that it does not matter to the searcher whether recall is costly or costless. In such an environment, firms do not have the incentive to offer price matching. But, as Rothschild [7] has cautioned us, the two assumptions of costly and costless recall are not always interchangeable. They are not, when marginal search cost is increasing. For then if a consumer having a price
•
••
05 Dec 1988
TL;DR: This paper presents a method for matching two perspective images from a well defined indoor scene that succeeds in analyzing successively the rotational and translational effect.
Abstract: This paper presents a method for matching two perspective images from a well defined indoor scene. The method insists on exploring both geometric constraints and perceptual grouping for reducing the search space. The geometric constraints used are principally perspective information, such as vanishing point, horizon line and projective coordinates. The perceptual groups are such as directional, rays and collinear groups. Our method succeeds in analyzing successively the rotational and translational effect. which makes geometric constraints more direct and easier to explore. The matching strategy is coarse-to-fine, based on the hierarchical perceptual grouping. The hypotheses are then propagated and verified to the whole image by neighboring, relationship without backtracking. The matching results are also presented.
••
TL;DR: The impact of the corporate setting on determining and implementing corporate and marketing strategies follows the logic displayed in Figure 1 as mentioned in this paper, which states that while we know quite a lot about formulating strategies and producing plans, we actually know rather little about what is required to gain commitment or ownership for those plans, and thus to have them put into effect.
Abstract: The authors' research interests in the impact of the corporate setting on determining and implementing corporate and marketing strategies follows the logic displayed in Figure 1. The basic premise is that while we know quite a lot about formulating strategies and producing plans, we actually know rather little about what is required to gain commitment or 'ownership' for those plans, and thus to have them put into effect. Our attention has been focusing for some time now on coping with the manager's statement: 'We know what marketing is, but we don't know how to do it'. Indeed, another writer has recently summarised the same point of concern:
••
11 Jul 1988TL;DR: This paper presents new sequential algorithms for nonlinear pattern matching in trees that improves upon known tree pattern matching algorithms in important aspects such as time performance, ease of integration with several reduction strategies and ability to avoid unnecessary computation steps on match attempts that fail.
Abstract: Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as mechanical theorem proving, term rewriting, symbolic computation and nonprocedural programming languages. In this paper we present new sequential algorithms for nonlinear pattern matching in trees. Our algorithm improves upon known tree pattern matching algorithms in important aspects such as time performance, ease of integration with several reduction strategies and ability to avoid unnecessary computation steps on match attempts that fail. The expected time complexity of our algorithm is linear in the sum of the sizes of the two trees.
•
01 May 1988
TL;DR: This paper describes an approach to the provision of such support for three particular aspects: method support by active guidance, validation by transaction anomation, and reuse of specification fragments.
Abstract: : Requirements analysis is one of the most critical and difficult tasks in software engineering. The need for tool support is easily justified. This paper describes an approach to the provision of such support for three particular aspects: method support by active guidance, validation by transaction anomation, and reuse of specification fragments. Method guidance is supported by a method model used to describe the sequence of method steps that should be followed. This model is directly interpreted by the tools to provide advice and reasoning. It is used in conjunction with rules used for consistency checking to provide remedial advice. The animator provides facilities for the selection and execution of a transaction to reflect the specified behavior given a particular scenario. Actions are described in terms of input-out relations. Simple rules can be specified to control the execution of actions. Facilities are provided to replay and interact with transactions. Reuse is supported by facilities for identifying candidate transactions from a reuse database. The search strategies provided include browsing in an inheritance structure, different levels of pattern matching, casual chain matching (matching of the underlying control structures), and purpose matching. Support is then provided for the allocation of the selected fragment to the target environment. The approach has been tested by implementing a prototype set of tools for the CORE method and the Analyst workstation. A major case study, the ASE (Advanced Sensor Exploitation) test environment, has been analyzed and specified using CORE, the Analyst, and the tools described above. The results of that work are described and evaluated.
•
TL;DR: In this article, the authors present a survey planning and statistical analysis for license plate matching surveys, including site visit, survey plan, manpower, weather, equipment, training, and data processing.
Abstract: This article attempts to assist survey planners in both the practical issues involved in conducting license plate matching surveys, and the needed statistical considerations for designing the survey and analyzing the survey results. Planning and conducting the survey is described including site visit, survey plan, manpower, weather, equipment, training, and data processing. The several mathematical/statistical considerations that should be evaluated are reviewed: selection of time interval to record data; number of plate characters to record; survey design; and the number of plates required for statistical analyses. Data analysis techniques are also discussed.
01 Jan 1988
TL;DR: In this article, the authors proposed a nonlinear mathematical program to solve the problem of cash-flow matching and immunization for fixed-income portfolios, which can be linearized and solved by standard techniques.
Abstract: Shifts in the term structure of interest rates are the major sources of risk to fixed-income portfolios. Two important portfolio investment strategies in asset/liability management are cash-flow matching and immunization. The cash-flow matching strategy can be enhanced by allowing cash carry-forward and borrowing from future surpluses. Although the mathematical program thus formulated is nonlinear, we show that it can be linearized and solved by standard techniques. The algorithms can easily be implemented on a computer.
••
11 Apr 1988TL;DR: Simulations show that the commonly used dynamic programming word-sequence matching algorithm has serious shortcomings as an evaluation method at low performance levels, though it is generally reliable at high performance levels and a method using word end-point information provides precise, detailed performance analyses.
Abstract: Outputs of connected-word recognizers may contain substitution, deletion and insertion errors, and their interpretation is not trivial. Simulations show that the commonly used dynamic programming word-sequence matching algorithm has serious shortcomings as an evaluation method at low performance levels, though it is generally reliable at high performance levels. The strategy of comparing input and output words in strict sequence is found to have little to recommend it. A method using word end-point information, which provides precise, detailed performance analyses, is described. Tests with real data confirm the reliability of the end-point method and the presence of positive bias in performance estimates form the word-sequence matching method. >
••
22 Aug 1988TL;DR: The approach is to use the CAD model to predict the features that will appear in different views of the object under different lightings and use these visible features to generate a set of view classes for use in the matching.
Abstract: Given a CAD model of an object and a set of inspection specifications, we would like to automatically generate the vision procedure to inspect a part that is an instance of the model. Since the position and orientation of the part may be wholly or partially unknown, the first step in the procedure is to determine the pose of the object. Assuming the sensor involved is a CCD camera, this reduces to matching the features extracted from a two-dimensional graytone perspective projection image of the object to the corresponding three-dimensional features of the model. Since 2D to 3D matching is more complex and time consuming than 2D to 2D matching, our preference is to match a data structure representing features and their spatial relationships extracted from the image to a similar 2D data structure generated from the CAD model. Our approach is to use the CAD model to predict the features that will appear in different views of the object under different lightings and use these visible features to generate a set of view classes for use in the matching. A view class is a cluster of views of the object which all produce similar data structures. Then a single representative data structure can represent the entire cluster of views and be used to match to the structure extracted from the image. Important questions that must be answered are 1) how do we predict features from CAD models without generating entire artificial images of the object, 2) what is a good representation for the features extracted from one view, 3) what criteria should be used for forming view classes, and 4) how should the matching from part structure to view class representatives be achieved most efficiently. In this paper we will report on our ongoing research in these areas. Keywords: matching, view class, CAD model, relational pyramid This research was supported by the National Aeronautics and Space Administration (NASA) through a subcontract from Machine Vision International and by Boeing Commercial Aircraft Company.
•
01 Dec 1988
TL;DR: In this article, the use of inverted files for the calculation of similarity coefficients and other types of matching function is discussed in the context of mechanised document retrieval systems and a critical evaluation is presented of a range of algorithms which have been described for the matching of documents with queries.
Abstract: The use of inverted files for the calculation of similarity coefficients and other types of matching function is discussed in the context of mechanised document retrieval systems. A critical evaluation is presented of a range of algorithms which have been described for the matching of documents with queries. Particular attention is paid to the computational efficiency of the various procedures, and improved search heuristics are given in some cases. It is suggested that the algorithms could be implemented sufficiently efficiently to permit the provision of nearest neighbour searching as a standard retrieval option.
••
TL;DR: The Conceptual-Level Matching Model (CLMM) as discussed by the authors is a theoretical model for the development of treatment/rehabilitation programs with offender groups with a focus on offender groups.
Abstract: The Conceptual-Level Matching Model (CLMM) is reviewed with a focus to its application in the development of treatment/rehabilitation programs with offender groups. The CLMM is a theoretical model ...