Showing papers on "Sorting published in 1969"

Categories of interference: verbal mediation and conflict in card sorting.

Abstract: When subjects sort cards by the number of symbols on the cards, the nature of the symbols interferes with the sorting in ways which are similar to those shown by Klein (1964) using a variant of the Stroop test. When the symbols have names, such as letters and words, there is a decrement in performance; when the symbols are digits the decrement is increased. These and related results form the basis of a functional model in which different types of interference between stimuli can be enumerated, and those operating in the sorting task isolated. The features of the final model are: (1) sorting proceeds via a verbal mediation; (2) the process of recognition of familiar named symbols is autonomous and results in the availability of the name of the symbol; (3) this name enters the same store as the mediating response and so can delay it; (4) in the present range of tasks there is no interference prior to the availability of the symbol name; (5) learning to reduce interference does result in a change prior to this stage; (6) the interference effects are analogous to word recognition phenomena.

Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Abstract: The real procedure gauss computes the area under the left-hand portion of the normal curve. Algorithm 209 [3] may be used for this purpose. If f < 0 or if dr1 < 1 or if dr2 < 1 then exit to the label error occurs. National Bureau of Standards formulas 26.6.4, 26.6.5, and 26.6.8 are used for computation of the statistic, and 26.6.15 is used for the approximation [2]. Thanks to Mary E. Rafter for extensive testing of this procedure and to the referee for a number of suggestions. begin if dfl < 1 V dr2 < 1 Vf < 0.0 then go to error; if f = 0.0 then prob := 1.0 else begin real fl, f2, x, ft, vp; fl := dfl; f2 := dr2; fl := 0.0; x := f2/(f2+flXf); vp := fl +f2-2.0; if 2 X (dfl+2) = dfl A dfl ~ maxn then begin realxx; xx := 1.0-x; for fl := fl-2.0 step-2.0 until 1.0 do begin vp := vp-2.0; ft := xx X vp/fl X (1.0+fl) end; ft := x 1\" (0.5X f2) X (1.O+fl) end else if 2 X (dr2 + 2) = dr2/S df2 =< maxn then begin for f2 := f2-2.0 step-2.0 until 1.0 do begin vp := vp-2.0; ft := x X vp/]2 X (1.O+ft) end ; ft := 1.0-(1.O-x)1\" (0.5X fl) X (1.O+ft) end else if dr1 \"4-dr2 <= maxn then begin real theta, sth, eth, sis, ets, a, b, xi, gamma; theta := arctan(sqrt(fl Xf /f2)) ; sth := sin(theta); cth := eos(theta); sts := sthl\"2; cts: = cthl'2; a := b := 0.0; if dr2 > 1 then begin for f2 := ./'2-2.0 step-2.0 until 2.0 do a := cts X (f2-1.0)/f2 X (1.0+a); a := sth X cth × (1.0+a) end ; a := thela + a; if dfl > 1 then begin for fl := fl-2.0 step-2.0 until 2.0 do begin vp := vp-2.0; b := sts X vp/fl X (1.0+b)

Method of and apparatus for sorting ores

Abstract: In the machine sorting of objects which have a material with magnetic properties, an auxiliary magnetic field is provided in the sorting zone to enhance a magnetic characteristic of the material with magnetic properties. In one embodiment the objects are passed through a strong, steady magnetic field just prior to passing a magnetic field detector. The magnetic field detector provides a sorting signal related to remanence of the objects, and the objects are deflected or not in accordance with the sorting signal.

Photometric sorting apparatus

Abstract: 1,152,407. Sorting ores by reflectance. SPHERE INVESTMENTS Ltd. Feb.2, 1968, No.5527/68. Heading G1A. In a method and apparatus for sorting irregularly shaped objects such as ores in which the objects are moved through a sorting zone which is scanned repeatedly across the zone to detect light reflected from discrete areas of the objects and zone, a series of at least three parameters are derived from the reflected light, a plurality of them are selected for comparison in a predetermined manner, and the result of the comparison is used to effect acceptance or rejection of an object . The ores are fed from a hopper to a belt conveyer passing through the sorting station by way of two vibrating conveyers and a shoot, the last named accelerating the lumps to approach the speed of the test conveyer which is faster than the others, to achieve separation of the pieces. The test conveyer may be black or white to provide a desirable background for the rock being sorted and the sorting is by blasts of compressed air from one of a number of apertures corresponding to the identified position across the belt of the object. The light source, which may be a laser, and the detector are repeatedly scanned across the belt, by a mirror drum, the detector including a polarizer to receive the reflected laser light and reject specular reflection. Photo-cells determine the lateral limits of each scan and a reflecting standard is included in the scanned path for calibration purposes. A draught of air and screens may be provided to keep dust from settling on the optical apparatus. The apparatus is described for sorting gold ore and in this case the following parameters are selected by preset switches for determination. The number of white areas per unit of area. The area of a piece of rock. The black area of the piece of rock.

Some Theorems on Sorting

Abstract: It is a “well-known fact” that a lower bound for the average number of comparisons required to sort a table of N items is $\log _2 N!$, where the average is taken over all possible permutations of the table. In this paper a somewhat better lower bound is obtained, which in a way provides considerable insight into the theoretical limitations on methods of sorting by comparison.

Indirect indexed searching and sorting

Abstract: A sorting method by insertion among sequenced indexes, involving two levels of address indirection for keys T of data records being sorted. The second level comprises a table containing the addresses A of the keys T. The addresses can be in any arbitrary order in their table, and the data records can be located anywhere reachable by the addresses. However the location of each address entry in table A is indicated by an assigned index. These assigned indexes are placed in a highest-level table S in the order of the keys which they represent. An ordering operation occurs for each new key T by placing its address into any available entry location in table A having a corresponding index. The new key is then compared to each key represented by an index entry in table S obtained by a binary search of the keys T using their order represented in table S. The binary search ends at a particular index when either the new key compares equal to a currently examined key, or when not more than i keys have been compared, where table S contains less than -1+2i 1 entries. The new index is inserted into table S after a space is made by moving all entries from the beginning of table S up to and including the particular index, and inserting the new index into the space. More new record keys may then be obtained and inserted in the same way.

Fast Fourier transforms without sorting

Abstract: This correspondence presents a mechanization of the fast Fourier transform which results in a particularly simple and compact FORTRAN program without the need for sorting the answers.

Data sorting system

Abstract: A data sorting system for multibit binary records is provided which is capable of responding to a control field in each of the records in order to sort the records into an ascending or descending progression. The sorting system to be described has the feature that it is capable of sorting a file of the aforesaid records which contains more records than the capacity of the sorting system itself. The system is controlled so that the file is repeatedly circulated therethrough until a complete sort is achieved, with the capacity of the system being reduced for each successive pass so that optimum efficiency is maintained at all times.

Batch sorting apparatus

Abstract: An array of objects in a predetermined sequence and direction of orientation, such as semiconductor chips, is tested and batch sorted by a sorting fixture having a matrix of locations with individually actuable vacuum pickups, while maintaining a predetermined direction of orientation of the objects. A system for this purpose includes a tester for measuring a characteristic of the objects in the array while maintaining them in a predetermined sequence and direction of orientation. Means for storing a result based on the measurements for each object in the array is connected to the tester. The sorting fixture for batch separation of objects with the desired characteristic on the basis of the stored results from the remainder of the objects is connected to the means for storing to allow selection of the objects on the basis of the stored results. Means engageable by the sorting fixture receives the objects having the desired characteristic. The selection and release of the objects to the means engageable by the sorting fixture are both carried out while maintaining a predetermined direction of orientation in the selected objects, enabling reorientation of the objects during their handling to be eliminated.

Differential Sorting of Pelecypod Valves in the Swash Zone

Abstract: Differential sorting of right and left valves of pelecypods was found to be common on Mustang and Padre Island beaches, Texas. Determination of stable orientations of valves in unidirectional flume currents enables one to predict their behavior on a beach washed by obliquely approaching waves. The valves become initially stable with respect to the oblique swash and then are sorted by the backwash. The following swash tends to re-enforce this sorting. Further observations on the beach confirm that opposing valves behave as predicted. The sense of sorting is correlated to the direction of wave approach and hence with the direction of longshore drift. Interpretations of paleodrift directions from R-L sorting may be possible, but the narrowness of the inter-tidal zone in which the sorting takes place, and the rapidity of resorting, plus uncertainties in the hydro-dynamic behavior of fossilized material, dictate extreme care in attempting such analyses.

Plants for sorting washing in laundries

Abstract: A plant for sorting washing in laundries, comprising a conveyor for sorting ironed washing and a bunker with compartments and movable shelves, in which the conveyor is made horizontal and closed and has one hauling chain fashioned as interhinged carriages equipped with comblike cantilever hangers mounted with a possibility of turning, the bunker having combs cooperating with the hangers, and washing level sensors.

Modular weight-sorting assembly for conveyors

Abstract: Sorting of poultry suspended by carriers from a moving overhead conveyor chain, is accomplished by weighing apparatus constituting a unitary assembly adjustably installed at any desired location in the conveyor system. A fluid-operated lifter engages the release arms on the poultry carriers to effect removal of poultry from the conveyor. The assembly is provided with facilities to maintain operational alignment and prevent malfunction because of carrier displacements.

Solid state electronic memory system for sorting machines

Abstract: A pickup head generates an output pulse for each ferrule and thus each product being sorted by a sorting machine. The train of pulses are fed to a shift register, whereby sensing a bad product causes the shift register to count down at a rate determined by the series of pulses. An ejector is triggered to eject the bad product when it is carried in register with an associated ejector.

Cloth-sorting and garment-forming apparatus

Abstract: An apparatus for feeding and handling a plurality of fabric segments wherein a suction device is employed to dispense singularly and continuously a plurality of fabric segments from a storage location to a work area where the segments may subsequently be folded, sewn and collected in some form of fabricated garment component.

Sorting apparatus and a method of sorting

Abstract: 1,274,449. Transistor switching circuits. GUNSONS SORTEX Ltd. 7 Oct., 1970 [8 Oct., 1969], No. 49402/62. Heading H3T. [Also in Division G4] When a photodiode 20 (Fig. 4) in sorting apparatus (see Division G4) detects radiation a leakage current flows from a power supply 99 into the virtual earth, established at the photodiode anode by field effect transistors 84, 86, amplify 92 and feedback elements 96, 98. This results in a negative signal at the output of amplifier 92, which after amplification, drives switching amplifier 95 into saturation at one end of its dynamic range. When no radiation is detected the amplifier 95 is saturated at the other end of its range. Compensation for the zero signal offset voltage is effected by means of potentiometer 100.

Lumber sorting method

Abstract: A lumber cutting and sorting method wherein the lumber is cut into various predetermined lengths by abutting them against gage stops while making the cut The gage stops have associated sensing means controlling downstream lateral deflector means for sorting the lumber by thickness, width, and/or grade Crossed plural conveyors remove the cut lumber after sorting

Printing means for sorting and routing system

Abstract: A printing means of a type adapted to simultaneously print ordinary legible indicia and corresponding magnetic ink characters upon a label in which the activating for magnetic character operation is made by the presence of a label in a particular location upon a platen, whereby an electrical circuit is closed through a predetermined opening in said label.

Sorting feasible basic solutions of a linear program

Abstract: : An algorithm for sorting feasible basic solutions of a linear program is proposed. The algorithm proceeds from one basic solution to the next in order of non-increasing values of the objective function. The use of the proposed procedure is demonstrated through numerical examples and geometrical interpretations. The algorithm solves problems where a basic feasible solution is sought, maximizing a linear objective function and satisfying some prescribed conditions. This category includes the fixed-charge problem, the travelling salesman-problem, the mixed 0,1 linear program, etc. (Author)

On the expected lengths of sequences generated in sorting by replacement selecting

Abstract: In the replacement-selecting technique of sorting, one is interested in the ratio Lj of the expected length of the jth sequence generated by the technique to the number of memory cells used. Using complex-variable theory, it is shown that Lj → 2 and that, asymtotically, the average interval between sign changes of Lj — 2 is 2.6662.

Magnetically responsive card retrieval system

Abstract: Card retrieval system for physically shifting and thereby selecting desired cards having a predetermined notch pattern along a sorting edge and a ferromagnetic member in a transverse edge from undesired cards having a different notch pattern and a ferromagnetic member including, a horizontal platen for supporting the cards with their respective sorting and transverse edges and ferromagnetic members aligned, a plurality of sorting bars disposed transversely of said sorting edge adjacent said notches, a sorting bar actuator for selectively moving said sorting bars into said notches, a dual-purpose elongated magnet disposed adjacent the ferromagnetic members of the cards which is movable in a direction parallel to the card sorting edges to separate the desired and undesired cards and which has a magnetic center below that of the ferromagnetic members to bias the sorting edges of the cards against the platen prior to magnet movement, thereby properly orienting the cards relative to the platen prior to sorting.