Showing papers on "Sorting published in 1982"

A sorting-cum-learning model of education

Abstract: This paper presents a sorting model of education in which individuals are tested in school. By assuming that higher-ability individuals are more likely to succeed on a given test, one can construct a sorting model of education that does not hinge on the more able having lower nonpecuniary costs of schooling. Nash equilibria always exist in this model (even with a continuum of types of individuals); however, some are "unreasonable." To eliminate these unreasonable Nash equilibria, more restrictive definitions of equilibrium are proposed. I also show that when schooling affects productivity--and therefore a worker's probability of passing the test--a sorting equilibrium may be characterized by too little investment in education.

A Clustered Dynamic Model for a class of LInear Autonomous Systems Unsing Simple Enumerative Sorting

Abstract: Simple, computationally efficient, enumerative techniques are introduced for establishing a clustered semidecoupled dynamic model for a class of autonomous linear systems exemplified by the electromechanical dynamics of the electric power system. Such a model consists of intercluster (usually slow) dynamics and intracluster dynamics (usually fast) which are respectively weakly coupled. The process starts by selecting the point in frequency where intracluster and intercluster dynamics tend to separate. The sorting technique then identifies the number of clusters, the width of separation in frequency, the specifics of the dynamic components and the coupling between them. No matrix manipulations like finding eigenvalues or inverses are required.

The Parallel Enumeration Sorting Scheme for VLSI

Abstract: We propose a new parallel sorting scheme, called the parallel enumeration sorting scheme, which is suitable for VLSI implementation. This scheme can be introduced to conventional computer systems without changing their architecture. In this scheme, sorting is divided into two stages, the ordering process and the rearranging one. The latter can be efficiently performed by central processing units or intelligent memory devices. For implementations of the ordering process by VLSI technology, we design a new hardware algorithm of parallel enumeration sorting circuits whose processing time is linearly proportional to the number of data for sorting. Data are serially transmitted between the sorting circuit and memory devices and the total communication between them is minimized. The basic structure used in the algorithm is called a bus connected cellular array structure with pipeline and parallel processing. The circuit consists of a linear array of one type of simple cell and two buses connecting all cells for efficient global communications in the circuit. The sorting circuit is simple, regular and small enough for realization by today's VLSI technology. We discuss several applications of the sorting circuit and evaluate its performance.

Apparatus and method for processing fruit and the like

Abstract: Apparatus and method for processing fruit and the like, particularly for sorting as a function of variables including color, blemish, size and shape. The apparatus provides an illuminator for substantially uniformly illuminating a portion of the item being examined, and a signal detector array for generating a plurality of signals corresponding to respective different portions of the item being examined. The data signals corresponding to a given item are accumulated and then batch processed to determine sorting signals, while a next item is being examined and data signals for it are being accumulated. For blemish detection, the batch processing includes determination of differences between signals representing adjacent surface portions, and generation of blemish sorting signals as a function of such determined differences.

Basic statistical computing

Abstract: List of algorithms and programs notation some general principles sorting and ranking inspection and summary of data using tables inspection and summary of data using graphical methods computation of variance and correlation coefficients simulation probability functions of random variables generation of random samples from non-uniform distributions significance tests and confidence intervals regression analysis of variance.

Sorting and Merging in Rounds

Abstract: The need for sorting algorithms which operate in a fixed number of rounds (rather than have each new comparison depend on the outcomes of all previous comparisons) arises in structural modeling. Since all comparisons within a round are evaluated simultaneously, such algorithms have an obvious connection to parallel processing.In an earlier paper (SIAM J. Comput.,10 (1981), pp. 465–472) we used a counting argument to prove the existence of subquadratic sorting algorithms for two rounds. Here we develop optimal algorithms for merging in rounds, and apply them to actually construct good sorting algorithms for k rounds, $k\geqq 3$. For example, in $k = 66$ rounds, our algorithm will sort any n-element linearly ordered set with $O ( n^{1.10} )$ comparisons.

Prioritized sorting system

Abstract: A priority sorting system for sorting information on a priority basis is disclosed having at least first, second, third and fourth data stores arranged horizontally so that the input of one data store is connected to the output of the preceding data store, and a plurality of comparators, each comparator connected to a pair of data stores with no data store being connected to more than one comparator, said comparators swapping information stored in said data stores on a priority basis.

Applying Data Flow Techniques to Data Base Machines

Abstract: Recently, data flow languages and architectures have been the subject of much research. Although most projects set out to produce a general-purpose, data flow machine, the primary goal has been to reduce the execution time of large numerical computations. In this article, we describe a different line of research: the application of data flow machine principles towards improving access to large nonnumerical data bases. For the past four years we have researched the problems associated with providing efficient access to relational data bases that are too large to be handled by a single conventional processor. The result of that research is Direct, a multiprocessor multiple instruction stream multiple data stream relational data base machine.1 A prototype of this MIMD machine that supports the relational data base system Ingres2 became operational in June 1980 using a PDP 11/40 and eight PDP 11/23's. All previous data base machines were single instruction stream multiple data stream machines and could thus execute only one data base operation at a time. One consequence of an SIMD design data base machine is that the activities of the processors do not have to be scheduled; during each time unit, all processors execute the same instruction. With an MIMD design, such as Direct, groups of processors can work on different instructions from the same query, from different queries, or both. Therefore, after the design of Direct was completed, alternative processor allocation strategies for MIMD data base machines were explored. The goal of this research was to determine what strategy would allow the greatest number of queries to be executed per time unit. One of the strategies examined was based on data flow machine principles. In this article, we describe some of the results obtained from our experiments with the various strategies,3 in particular, experiences with variations of a strategy based on data flow techniques for processor allocation.

Sugar beet sorting machine - has pairs of separately driven rollers forming sloping path, with mechanism controlling gaps between rollers

Abstract: The sugar beet sorting appts. which divides the beets into two flows of different sizes, has pairs of rollers which form a sloping path for the beets. The gap between each pair can be adjusted, and the sorting action is assisted by a rubber flap at each pair. The pairs of rollers are connected by swinging arms to adjust all the gaps simultaneously. The rollers of each pair can be driven separately and one roller can be driven at a different speed to that of the other. The rollers can have smooth or rough surfaces, and can have a rubber or plastics coating. The angle of slope can be adjusted between 20 and 50 degrees to the horizontal. An alternative design uses two separate frames for the two rollers of the pairs.

Age, response complexity, and target consistency in visual search

Abstract: Adult age differences in visual search were examined under manipulatins of target set consistency (fixed versus varied), response complexity (2 versus 4 sorting categories), display size (1, 4, or 8 letters/card), and sessions (2). Mean card sorting times of 20 young (mean = 22 years) and 20 elderly (mean = 62 years) adults were compared. Significant main effects of age, complexity, consistency, sessions, and display size were obtained. A consistent target set facilitated search independent of response complexity. As predicted, significant interactions indicated that age differences in search were eliminated under the fixed set procedure but not under the varied set procedure.

Statistical Precision in the Calibration and Use of Sorting Machines and Other Classifiers

Abstract: Mechanical sorters with a nonnegligible probability of misclassification need to be calibrated. This article provides formulas for the statistical precision of class frequency estimates for lots (populations) of items, considering contributions of error from the calibration, from sampling the population, and from random misclassifications in the sorting of the sample.

Automatic weight sorter

Abstract: An automatic weight sorter for weighing a series of articles successively fed by a belt conveyer and then sorting them into predetermined classes based upon their measured weights, which includes an improved automatic weight correcting device for cancelling the difference between static and dynamic measurements, the mode of correction being easily preset by simply applying actual articles to the sorter for measurement while it is turned into a set-up mode of operation before normal operation is started.

Sorting device for use with a document reproduction machine

Abstract: A sorting device for use with the document reproduction machine according to the present invention is constructed so that each of the sorting bins for stacking sorted copies is successively moved upward or downward with respect to the discharge port of the machine to directly receive each copy when several copies made from the same original are discharged successively from the discharge port. In a nonsort-mode, only a specified sorting bin is positioned facing the discharge port of the machine. In the sort-mode, if the document reproduction machine is not operated for a predetermined time after copying has been completed, the machine is returned to the nonsort-mode.

Parallel Algorithms and Their Implementation in MICRONET

Abstract: This paper describes a simple microcomputer network system and its architectural support for four categories of database operations. The design and implementation of hardware and software and the parallel algorithms for the database operations are described and illustrated. Three new algorithms, one for finding maximum/minimum, and two for sorting distributed files, are presented together with their implementations in MICRONET. The results of the analyses of the new sorting algorithms and a comparison with other sorting algorithms are also given. The system is characterized by its simplicity in network connection and communication, flexibility in expanding or contracting the size of the network, reliability achieved by interchangeable hardware and software, and high performance achieved by one-to-all broadcasting, hardware scheduling, and special control lines for inter-processor communication and synchronization.

Envelope tracking system for mail sorting machines

Abstract: An improved envelope tracking and control system for a mail sorting machine of the type which reads a sorting code imprinted on each envelope and deposits the envelope in the proper sorting bin by deflecting a diverter gate associated with the bin. Each diverter mechanism has two sets of photo sensors which sense the presence of an approaching envelope. Tracking circuitry processes the sort code obtained from the envelope and transfers the processed data to the tracking circuit for the next diverter if the data does not coincide with a code that has been preassigned to the diverter. The processed data is held in a latch circuit and is passed on only if the envelope is sensed by the second set of photo sensors. If there is coincidence of the data, a one shot pulse applied to a solenoid deflects the appropriate gate for a predetermined time period that avoids possible damage to the solenoid or to the circuit components. Existing components are used in a self test system which includes an astable oscillator that simulates successive envelopes passing through the machine.

Method and device for sorting mixtures of packages and similar goods, whether or not used

Abstract: The invention relates to a method for sorting objects such as metal or plastic packages which is based on methods for the bulk sorting of household waste or rejects from industrial production lines. Such mixtures are first sorted in order to remove the objects of smallest dimensions using a screen (2). A distributor (4) enables the objects to be fed one by one in a stable position, making their smallest dimensions perpendicular to the direction of advance. After centring on the transporter (11), the objects are brought one by one to the station for detecting metal bodies (5, 6), and then to the station for detecting bodies transparent to infrared radiation. These stations are provided with optical cells (7, 8 and 42) detecting the presence and the shape of the objects. Logic circuits (18) control the ejections of objects into the receptacles (13, 36, 46) and leave the heterogeneous products on the transporter. The devices are thus of a rapid, flexible and reliable type.