Showing papers on "Sorting published in 1979"

A fast two-dimensional median filtering algorithm

Abstract: We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).

Sampling variability and life history features: basic considerations in the design of aquatic insect studies

Abstract: Sampling variability in benthic studies may result from sampling device operation, physical features of the environment, laboratory sorting procedures, and biological features of study populations....

Container sorting and handling system

Abstract: A novel container sorting and handling system is provided for sorting a plurality of diverse types of containers into preselected types for either reuse, reclamation or disposal depending upon the type of container. The sorting system comprises a housing having a sorting station defined therein and an infeed conveyor for sequentially and individually transporting containers to the sorting station. At the sorting station the individual containers are rotated by a roller in order to bring the UPC Code, bar code or other code on each container into alignment with an optical scanner at the sorting station. The optical scanner produces an output signal representative of the bar code and this is in turn fed to a computer which compares the signal from the optical scanner with a plurality of prestored values in the computer. As a result of this comparison, the computer generates an output signal representative of the type of container at the sorting station. This output signal from the computer in turn is fed to an indexing mechanism which transports the container in the sorting station to one of a plurality of outfeed conveyors whereby each outfeed conveyor transports a single type of container. The recyclable containers are crushed and/or shredded into a compact mass and transported to a salvage company and/or reclamation center. The computer also provides a signal to an output device which produces a tangible record via coin, receipt or token of the monetary value of the returnable containers processed by the system.

The cube-connected-cycles: A versatile network for parallel computation

Abstract: We introduce a network of processing elements, the cube-connected-cycles (CCC), complying with the present technological constraints of VLSI design. By combining the principles of parallelism and pipelining, the CCC can emulate the cube-connected machine with no significant degradation of performance but with a much more compact structure. We describe in detail how to program the CCC for efficiently solving a large class of problems, which includes Fast-Fourier-Transform, sorting, permutations, and derived algorithms. The CCC can also be used as a general purpose parallel processor.

Some Analysis Techniques for Asynchronous Multiprocessor Algorithms

Abstract: Efficient algorithms for asynchronous multiprocessor systems must achieve a balance between low process communication and high adaptability to variations in process speed. Algorithms that employ problem decomposition may be classified as static (in which decomposition takes place before execution) and dynamic (in which decomposition takes place during execution). Static and dynamic algorithms are particularly suited for low process communication and high adaptability, respectively. For static algorithms the following analysis techniques are presented: finding the probability distribution of execution time, deriving bounds on mean execution time using order statistics, finding asymptotic mean speedup, and using approximations. For dynamic algorithms the technique of modeling using a queueing system is presented. For each technique, an example application to parallel sorting is given.

A time-space tradeoff for sorting on non-oblivious machines

Abstract: A model of computation is introduced which permits the analysis of both the time and space requirements of non-oblivious programs. Using this model, it is demonstrated that any algorithm for sorting n inputs which is based on comparisons of individual inputs requires time-space product proportional to n2. Uniform and non-uniform sorting algorithms are presented which show that this lower bound is nearly tight.

Algorithms: Their Complexity and Efficiency

Abstract: Evaluation of Polynomials Iterative Processes Direct Methods for Solving Sets of Linear Equations The Fast Fourier Transform Fast Multiplications of Numbers Internal Sorting External Sorting Searching.

Parallel processing techniques for hidden surface removal

Abstract: Previous work in the hidden-surface problem has revealed two key concepts. First, the removal of non-visible surfaces is essentially a sorting problem. Second, some form of coherence is essential for the efficient solution of this problem.In order to provide real-time simulations, it is not only the amount of sorting which must be reduced, but the total time required for computation. One potentially economic strategy to attain this goal is the use of parallel processor systems. This approach implies that the computational time will no longer be dependent on the total amount of sorting, but more on the appropriate division of responsibility.This paper investigates two existing algorithmic approaches to the hidden-surface problem with a view towards their applicability to implementation on a parallel machine organization. In particular, the statistical results of a parallel processor implementation indicate the difficulties stemming from a loss of coherence and imply potentially important design criteria for a parallel configuration.

Mailing package for facilitating automatic sorting of mail

Abstract: A method and apparatus for facilitating the automatic sorting of mail by optical scanning equipment is provided and includes a first, usually dark-colored sheet, and a second sheet of a generally light-colored material overlying the first sheet and having a coded array of apertures therethrough, thereby permitting the first sheet to be read by the optical scanning equipment through the apertures in the second sheet. The array of apertures in the second sheet is coded to represent a desired original address, and a second array of apertures can be provided representing a return address. In such a case, various facilities are provided to cause the first sheet to selectively underlie either the original or return coded arrays of apertures so that the scanning equipment will read the desired address code.

Document sorter apparatus

Abstract: Document sorting apparatus for sorting documents having data characters recorded thereon into a selected one of a plurality of storage pockets depending upon the data characters. Sorter controllers, each associated with a pre-determined number of the storage pockets, are provided for controlling the gate mechanisms of the storage pockets within their respective control areas so as to direct the document into the selected one of the pockets. The sorter controllers comprise single cycle processors which execute program instructions stored in memory in implementing document tracking functions. Further, the sorter controllers are responsive to destination and sequential tracking numbers assigned to each document by a central processor for recognizing a document as being intended for a pocket within its control area.

The shaded surface display of large molecules

Abstract: The complexity of computer generated images is often restricted by the storage requirements of the data and the processing time in keeping it sorted. A method is presented which alleviates the burden of storing and sorting for one previously published hidden surface algorithm.

Flat item sorting system - has transferring sorting unit to deflect items upstream of its inlet into transport channel

Abstract: The sorting system distributes flat items such as letters having destination code markings, having two or more sorting units, each with transport channels, deflectors, and destinationa hoppers. The unsorted items are delivered to the units in equal quantities, each fully distrubiting the items to its hoppers and transferring to them items for one or more other sorting units. The units to be distributed in one or the other sorting unit are deflected by the transferring sorting unit upstream of its inlet to the transport channel forming the inlet to the others.

Construction of Efficient Nuclear Event Analysis Programs Using a Simple Dedicated Language

Abstract: During nuclear experiments individual events are often recorded sequentially on magnetic tape. Repeated analysis of these data has become more and more important and now causes a noticeable load on the physisists, who must describe the analysis to be done, and on the computers doing the analysis. Introduction of a dedicated event analysis language has made programming easier and more reliable and increased the sorting efficiency many fold.

A time-space tradeoff for sorting and related non-oblivious computations

Abstract: The authors have discovered that the proof of Theorem 2 (the time-space tradeoff for \"silent\" sorting) is incorrect, due to an inherent difference between ordinary and silent branching programs. The time-space tradeoffs for element distinctness and set disjointness stated in Section 4 have therefore not been established. Determining the complexities of these problems remains an interesting open question.

Fully Interconnecting Multiple Computers with Pipelined Sorting Nets

Abstract: A pipelined multiprocessor interconnection method functionally equivalent to a full crossbar, but with a per processor cost proportional to the square of the log of the total number of processors, is presented.

System for sorting elongated members

Abstract: A system of sorting elongated pieces such as asparagus, wherein each of the elongated pieces are successively conveyed by a conveyer and detected as a still image by a sensor such as a TV camera. In processing a signal representative of the still image a stem diameter of the piece and a ratio of the spike maximum diameter of the piece to the stem diameter are obtained as sorting out factors by calculation. When the calculation values of the sorting out factors satisfy predetermined reference values, the piece is further sorted out according to size. The stem diameter is measured at a position which is spaced from the cut end of the stem by a predetermined dimension toward the spike thereof.

Goods sorting and storing system

Abstract: PURPOSE:To provide a goods sorting and storing system suited for a goods collecting and delivering center, truck terminal, working storage, automatic storehouse or the like where it is necessary to sort a large number of goods promptly.

On lower bounds of time complexity of some algorithms

Abstract: In this paper, two classes of machines are defined, and the lower bounds of time complexity to compute some problems including sorting and searching on them are examined

A bubble string comparator for information processing

Abstract: A new magnetic bubble device is proposed: the bubble string comparator. It performs the sorting of couples of data without any logical control, depending only on the nature of the couples themselves. By means of an external control the bubble string comparator can also operate as a standard binary switch, either in bypass mode or in cross-over mode.

Collecting paired-comparison data with a sorting algorithm

Abstract: Monte Carlo techniques were used to evaluate the performance of an on-line paired-comparisons data collection procedure that makes use of a common computer sorting algorithm The results revealed that the sorting method can reduce the number of trials per subject substantially even when a considerable amount of random error is present While a complete paired-comparisons design requires N(N−1)/2 trials (where N is the number of objects), the sorting procedure requires a theoretical minimum of N(log2N) trials The savings in the number of trials consequently increases with N Furthermore, the negative effect of random error on the final ordering of the data from the sorting method is small and decreases with the number of stimuli The data from a small empirical study reinforces the Monte Carlo observations It is recommended that the sorting method be used in place of the complete paired-comparisons procedure whenever a substantial number of stimuli are included in the design

Device for sorting articles to be conveyed

Abstract: PURPOSE:To sence the conveying operation of articles to be conveyd and sorted and to store them and to sort them at sorting place

Method for controlling document copying apparatus having collator

Abstract: PURPOSE:To facilitate desired gathering or sorting, by stopping gathering when a gathering number is within the total processing capacity and above the effective processing capacity in order to utilize collators efficiently. CONSTITUTION:A register is provided for receiving and storing appointed copy number N or the total number to be sorted irrespective of the total processing capacity of connected collators K1, K2,.... Information on the gathering or sorting of this register is compared to the total processing capacity and the effective processing capacity. When the information on the gathering or sorting of the register is smaller than the effective processing capacity, gathering or sorting is operated by using these vacant collators, while when it is within the total processing capacity of the collators and above the effective processing capacity, gathering or sorting is not operated.