Showing papers on "Generalization published in 1979"
Journal Article•
238 citations
Journal Article•
220 citations
TL;DR: In this paper, the authors discuss the history of personnel selection and highlight the major milestones in personnel selection, research, and research in the field of human resources and employability.
Abstract: THE HISTORICAL CONTEXT OF PERSONNEL SELECTION .... . . ....... ..... ... . . ... 478 Milestones: Personnel Selection Thinking, Research, Technology 478 The Conservation of Human Talent: 1975-80 481 VALIDITY AND VALIDATION.... . . .. . .. . . . . .. . . . ........ .. . ... 482 JOB ANALY SI S .... . ... ... . . . ... ... ..... ..... ...... . . .... 484 JOB PERFORMANCE MEA SUREMENT... . . . . . . . .. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 486 Format Comparisons and Rater Training 486 Internal Dimensionality and External Validity of Performance Ratings 488 Individual Diff erences Correlates of Performance Ratings 489 STA TI STICAL CONSI DERATIONS 490 Validity Estimates and Problems of Shrinkage .... ...... .... ......... ........ 490 Validity Generalization 492 Utility 493 Nonlinear Prediction ..... ..... 494 P SYCHOMETRICS OF EQUAL OPPORTUNITy. ........ . . . . . . . . . . . . . . .... . 496 Diff erential Validity 496 Test Fairness ....... ..... 497 LABOR MARKET I SSUES ... ... . . . . ..... . ..... ... ... .... .. .... . . .... ... .... . .... ...... .. ... . . . . . ... ..... 502 Labor Markets. Availabilities. and Human Resources Planning 502 SELEC TION PRACTICES: RESEARCH RESULTS . . . .... .... ..... ..... ....... . .... S04 The Selection Interview ... ..... .... 505 Biographical Information 509 Multiple Assessment Procedures ..... ......... .... 510 Job Samples ..... ........ 513 Miscellaneous Other Studies ........ 513 CONTEXT OF THE FUTURE IN PERSONNEL SELEC TION 514
198 citations
TL;DR: In this article, the Bayesian Steady Forecasting model is generalized to a wide class of processes other than the normal by defining the time series on the decision space, including a Beta-Binomial process, a Poisson-Gamma process and a Student-t sample distribution steady model.
Abstract: SUMMARY The Bayesian Steady Forecasting model is generalized to a very wide class of processes other than the normal by defining the time series on the decision space. Examples of such processes are presented including a Beta-Binomial process, a Poisson-Gamma process and a Student-t sample distribution steady model. Simple updating relations are given for most of the processes discussed.
105 citations
1 Jan 1979
TL;DR: In this paper, Cartographic transformations are applied to locative geographic data and to substantive geographic data, and the theoretical importance of the inverses is in the study of error propagation effects.
Abstract: Cartographic transformations are applied to locative geographic data and to substantive geographic data. Conversion between locative aliases are between points, lines, and areas. Substantive transformations occur in map interpolation, filtering, and generalization, and in map reading. The theoretical importance of the inverses is in the study of error propagation effects.
90 citations
TL;DR: Schubert's method for solving sparse nonlinear equations is an extension of Broyden's method The zero-nonzero structure defined by the sparse Jacobian is preserved by updating the approximate Jacobian row by row as discussed by the authors.
Abstract: Schubert’s method for solving sparse nonlinear equations is an extension of Broyden’s method The zero-nonzero structure defined by the sparse Jacobian is preserved by updating the approximate Jacobian row by row An estimate is presented which permits the extension of the convergence results for Broyden’s method to Schubert’s method The analysis for local and q-superlinear convergence given here includes, as a special case, results in a recent paper by B Lam; this generalization seems theoretically and computationally more satisfying A Kantorovich analysis paralleling one for Broyden’s method is given This leads to a convergence result for linear equations that includes another result by Lam A result by More and Trangenstein is extended to show that a modified Schubert’s method applied to linear equations is globally and q-superlinearly convergent
85 citations
TL;DR: It is found that the new SIRT methods converge faster than Gilbert's SIRT but are more sensitive to noise present in the data, so the faster convergence rates allow termination before the noise contribution degrades the reconstructed image excessively.
83 citations
TL;DR: The paper summarizes regression analysis including generalized least squares which might be used for simulation responses with non-constant variances, and the validity of the postulated regression metamodel is tested statistically.
72 citations
TL;DR: In this paper, a generalization of the general linear model is considered, where α and γ are assumed to be unobserved and exchangeably, jointly normally distributed (i.i.d.).
Abstract: A generalization of the general linear model is considered. Let Y i = α + T i y + e i, i = 1, …, n, where the Y i are 1 × p observed random variables, the T i are 1 × (r − 1) constant vectors, and α and γ are unobserved constants. The exchangeable linear model (EGLM) occurs when we assume that the e i are unobserved and exchangeably, jointly normally distributed. The classical general linear model (CGLM) occurs when the e i are independent and identically distributed (iid). Optimal procedures for testing hypotheses about γ for the CGLM are also optimal for the EGLM. Optimal methods for testing hypotheses about α for the CGLM have size 1 for the EGLM. There is no sensible test that the errors are iid in the EGLM. Estimation is considered.
66 citations
1 Jan 1979
TL;DR: In this article, running M-estimates are a natural generalization of Kernel-type smoothers (moving averages) and the rate of convergence can be expected from these estimates and the leading bias and variance terms.
Abstract: In curve estimation, running M-estimates are a natural generalization of Kernel-type smoothers (moving averages). We find the rate of convergence that can be expected from these estimates and the leading bias and variance terms. We also explain the effect of twicing for Kernel-type smoothers and give some rationale for its use in robust curve estimation.
65 citations
TL;DR: In this paper, the Richardson extrapolation process is generalized to cover a large class of sequences and error bounds for the approximations are obtained and some convergence theorems for two different limiting processes are given.
Abstract: The Richardson extrapOlation process is generalized to cover a large class of sequences. Error bounds for the approximations are obtained and some convergence theorems for two different limiting processes are given. The results are illustrated by an oscillatory infinite integral.
Proceedings Article•
20 Aug 1979TL;DR: The problem of concept learning, or forming a general description of a class of objects given a set of examples and non-examples, is viewed here as a search problem.
Abstract: The problem of concept learning, or forming a general description of a class of objects given a set of examples and non-examples, is viewed here as a search problem. Existing programs that generalize from examples are characterized in terms of the classes of search strategies that they employ. Several classes of search strategies are then analyzed and compared in terms of their relative capabilities and computational complexities.
TL;DR: The main result generalizes the theorem of Cesari Vincent according to which the period of a word is the maximum of the minimal repetitions, which allows a sharpened version of the solution to a problem settled by Schutzenberger.
TL;DR: In this article, a generalization of the stochastic multilocation problem of inventory theory is considered and a qualititative analysis of the problem is presented and it is shown that optimal policies have a certain geometric form.
Abstract: This paper examines a convex programming problem that arises in several contexts. In particular, the formulation was motivated by a generalization of the stochastic multilocation problem of inventory theory. The formulation also subsumes some “active” models of stochastic programming. A qualititative analysis of the problem is presented and it is shown that optimal policies have a certain geometric form. Properties of the optimal policy and of the optimal value function are described.
TL;DR: In this paper, a theoretical and experimental analysis of self-inducting turbo aerator performance was carried out based on the theory of water jet injector operation, and it was shown that the aerator's injection coefficient is completely determined by only two dimensionless groups, CH and EuG, between which there is a single valued dependence on whose basis generalization of experimental data is possible.
Abstract: A theoretical and experimental analysis of self-inducting turbo aerator performance was carried out based on the theory of water jet injector operation. It was shown that the aerator's injection coefficient is completely determined by only two dimensionless groups, CH and EuG, between which there is a single valued dependence on whose basis generalization of experimental data is possible. An analytical expression for the optimality criterion or aerator performance index, accounting for aerator gas capacity, power consumption, and submergence, has been obtained in terms of CH and EuG with only one adjustable parameter. From the above two dependencies, a methodology was developed for determining optimal operating conditions, by means of which all the data necessary for the optimal design can be obtained from the results of bench scale experiment.
TL;DR: For the standard case where the observations are uncorrelated and have equal variance, the optimal moving averages generalize two well-known optimalMoving averages: The minimum-variance and the minimum-Rz moving averages.
Abstract: In this paper a new criterion for judging the properties of moving averages is given, and moving averages which are optimal according to this criterion under general assumptions are derived. For the standard case where the observations are uncorrelated and have equal variance, our optimal moving averages generalize two well-known optimal moving averages: The minimum-variance and the minimum-Rz moving averages. This case is given some particular attention in the theoretical discussion, and some Monte Carlo experiments throw further light on it. These investigations indicate that our generalization is of practical as well as theoretical interest. The paper also contains the result that Spencer's 21-term moving average is approximately equal to the corresponding minimum-R 5 moving average.
TL;DR: Two related experiments examined generalization across contexts involving different sentence forms when selected grammatical features were trained within a single syntactic context and suggested that training on certain forms of either verbal auxiliary or copula may be sufficient to generate correct production of both of them.
Abstract: Two related experiments examined generalization across contexts involving different sentence forms when selected grammatical features were trained within a single syntactic context. Results obtaine...
Journal Article•
TL;DR: The theorem of Gleason without positivity and separability condition was proved in this article without any positivity or separation condition, and the theorem was proved without any condition on the proof.
Abstract: The theorem of Gleason is proved without positivity and separability condition.
TL;DR: A theorem-proving system has been programmed for automating mildly complex proofs by structural induction, which can cope with situations as complex as the defination and correctness proof of a simple compiling algorithm for expressions.
TL;DR: A class of functions that can be synthesized from example problems that is the interpretation of a given scheme and one can compute the number of examples necessary to characterize in a unique way a function of this class.
Abstract: We define a class of functions that can be synthesized from example problems. The algorithmic representation of these functions is the interpretation of a given scheme. The instantiation of the scheme variables is realized by a new method which uses pattern matching then if necessary generalization and further pattern matching. One can compute the number of examples necessary to characterize in a unique way a function of this class.
TL;DR: In this article, the authors generalized the methods of Brent and Brown for solving systems of equations without computation of analytic derivatives by exploiting the cases in which a substantial part of the work necessary to evaluate a function is common to the evaluation of another function.
Abstract: We generalize the methods of Brent and Brown for solving systems of equations without computation of analytic derivatives. The generalized methods try to exploit the cases in which a substantial part of the work necessary to evaluate a function is common to the evaluation of another function. Local convergence results and some numerical experience are given.
TL;DR: A generalization of the Modigliani-Hohn production scheduling problem including new computational algorithms and planning horizon results is investigated and coupled with decomposition methods in providing a computational algorithm for the production scheduling and employment smoothing problems with separable convex costs.
Abstract: A generalization of the Modigliani-Hohn production scheduling problem including new computational algorithms and planning horizon results is first investigated. These results are then coupled with decomposition methods in providing a computational algorithm for the production scheduling and employment smoothing problems with separable convex costs.
1 Dec 1979
TL;DR: In this article, a generalization of the quadratic optimal control theory for linear hereditary control systems is presented, where the generalization involves admitting delay terms in the cost index so that for example, the system output can be minimized.
Abstract: A generalization of the quadratic optimal control theory for linear hereditary control systems is presented. The generalization involves admitting delay terms in the cost index so that for example, a quadratic function of the system output can be minimized. Questions of existence of optimal control as well as necessary and sufficient conditions for optimal control are treated. The results have been achieved using a geometric approach based on properties of the set of reachable points.
TL;DR: In this paper, the existence of free formulas not only for systems based on the usual rules of proof but also for rule ω is proved. But the existence is not proved for all systems.
Abstract: Publisher Summary This chapter illustrates Godel incompleteness theorem and proves the existence of free formulas not only for systems based on the usual rules of proof but also for systems based on the rule ω. The chapter discusses the systems based on the rule ω rests on the basis of the remark of J. R. Shoenfield that the decomposition of the ∏11 sets into constituents can on several occasions be exploited in the same way as the recursive enumerability of the Σ01sets.
TL;DR: In this article, the authors proved the local version of this theorem together with a generalization to n dimensions and showed that the significance of 5 is replaced by 2n + 1.
Abstract: Suppose a function of the standard sphere S2 into the standard sphere S2+m, m > 0, sends every circle into a circle but is not a circlepreserving biection of S2. Then the image of the function must lie in a five-point set or, if it contains more than five points, it must lie in a circle together with at most one other point. We prove the local version of this theorem together with a generalization to n dimensions. In the generalization, the significance of 5 is replaced by 2n + 1. There is also proved a 3-dimensional result in which, compared to the n-dimensional theorem, we are allowed to weaken the structure assumed on the image set of the function.
TL;DR: This model is presented as a generalization of a few models which have applied to the analyses of a clustered search process, some indexing strategies and a relevance feedback process, and a set of guidelines are suggested to help a system designer to choose a model.