Abstract: A turf slicer includes a gang of six slicer wheels that “walk” through the turf in response to the forward motion of the turf slicer. In the meantime, the power takeoff from the tractor vertically oscillates the slicer wheels out of phase with one another, so that every sixth wheel is being thrust downwardly to bear most of the weight of the turf slicer as the other five wheels in the gang of six are either being withdrawn upwardly or moved downwardly and do not bear much weight, so that the weight of the turf slicer is concentrated on the downwardly moving slicer wheel that is approaching bottom dead center of its movement, thereby amplifying the effective weight of the turf slicer against the turf below.

Abstract: A computer-implemented method receives a set of data regarding a layout of a network, where the data specifies the interconnection of linear facilities and specifies at least one network point that is disconnected from the network. The computer-implemented method further determines a closest one of the linear facilities to the at least one network point based on the set of data and shifts the at least one network point to connect the at least one network point to the network based on a distance between a vertex associated with the closest one of the linear facilities and the at least one network point. The computer-implemented method also shifts the closest one of the linear facilities to connect the at least one network point in the network based on a distance associated with a linear projection from the at least one network point to the closest one of the linear facilities.

Abstract: A computer-implemented method receives a list of polygonal vertices associated with multiple polygons located in proximity to one another in a two-dimensional region and analyzes the polygonal vertices. The method automatically generates, based on the analysis, a polygonal hull that encloses the multiple polygons such that a line segment connecting any two polygonal vertices of the multiple polygons falls completely inside the generated polygonal hull. The multiple polygons may correspond to a two-dimensional geographic region. The computer-implemented method may be used for geographic regional segmentation.

Abstract: Disclosed is an apparatus, method, and program product for identifying and grouping threads that have interdependent data access needs. The preferred embodiment of the present invention utilizes two different constructs to accomplish this grouping. A Memory Affinity Group (MAG) is disclosed. The MAG construct enables multiple threads to be associated with the same node without any foreknowledge of which threads will be involved in the association, and without any control over the particular node with which they are associated. A Logical Node construct is also disclosed. The Logical Node construct enables multiple threads to be associated with the same specified node without any foreknowledge of which threads will be involved in the association. While logical nodes do not explicitly identify the underlying physical nodes comprising the system, they provide a means of associating particular threads with the same node and other threads with other node(s).

Abstract: Multiple database queries are satisfied with the same data in a manner that assures the data is current and without having to interrogate the database for each query. In a first embodiment, all queries that are received during the processing of a first query after interrogation of the database has begun for the first query are evaluated to determine whether the result set returned for the first query will satisfy the queries received during processing of the first query. If so, the result set returned for the first query is used to generate result sets for the subsequent compatible queries received during the processing of the first query. In a second embodiment, queries are delayed and grouped, and a new query is then processed for each group that returns a result set that satisfies all of the queries in the group. In both cases, the result set for one query is used to generate a result set for a different query.

Abstract: A packet control mechanism for a computer data system that dynamically adjusts packet training depending on the utilization load on the processor. The dynamic adjustment of packet training can be to enable and disable packet training, or adjust the number of packets in the packet train. In preferred embodiments, the computer data system includes a processor utilization mechanism that indicates a load on a processor. When the packet control mechanism determines the load on the processor is above a threshold limit, the packet control mechanism reduces the processor load by compressing the packets into the packet train. The compressing of the packets is stopped or reduced when the processor load is below a threshold in order to increase the data throughput on the network interface.

Abstract: A packet control mechanism for a computer data system that dynamically adjusts packet training depending on the utilization load on the processor. The dynamic adjustment of packet training can be to enable and disable packet training, or adjust the number of packets in the packet train. In preferred embodiments, the computer data system includes a processor utilization mechanism that indicates a load on a processor. When the packet control mechanism determines the load on the processor is above a threshold limit, the packet control mechanism reduces the processor load by compressing the packets into the packet train. The compressing of the packets is stopped or reduced when the processor load is below a threshold in order to increase the data throughput on the network interface.

Abstract: A packet control mechanism for a computer data system that dynamically adjusts packet training depending on the utilization load on the processor. The dynamic adjustment of packet training can be to enable and disable packet training, or adjust the number of packets in the packet train. In preferred embodiments, the computer data system includes a processor utilization mechanism that indicates a load on a processor. When the packet control mechanism determines the load on the processor is above a threshold limit, the packet control mechanism reduces the processor load by compressing the packets into the packet train. The compressing of the packets is stopped or reduced when the processor load is below a threshold in order to increase the data throughput on the network interface.

Abstract: A packet control mechanism for a computer data system that dynamically adjusts packet training depending on the utilization load on the processor. The dynamic adjustment of packet training can be to enable and disable packet training, or adjust the number of packets in the packet train. In preferred embodiments, the computer data system includes a processor utilization mechanism that indicates a load on a processor. When the packet control mechanism determines the load on the processor is above a threshold limit, the packet control mechanism reduces the processor load by compressing the packets into the packet train. The compressing of the packets is stopped or reduced when the processor load is below a threshold in order to increase the data throughput on the network interface.

Abstract: A seeder (20) includes a seed hopper (22) that feeds seed by gravity to a seed dispenser (24). The seed feed wheels (38) of the seeder are mounted in a seed metering tube (30) so that rotation of the seed feed wheels meters the output of the seeds. The seed feed wheels can be formed in segments (50 and 60) so that by matching different segments, different sizes of seed receiving detents can be used for dispensing the seeds. An adjustment bracket (72) shifts the seed feed wheels so that different sizes of detents can register with the openings of the seed metering tube (30), thereby achieving the desired matching of sizes of detents with the sizes of the seeds.

Abstract: A seeder (20) includes a seed hopper (22) that feeds seed by gravity to a seed dispenser (24). The seed feed wheels (38) of the seeder are mounted in a seed metering tube (30) so that rotation of the seed feed wheels meters the output of the seeds. The seed feed wheels can be formed in segments (50 and 60) so that by matching different segments, different sizes of seed receiving detents can be used for dispensing the seeds. An adjustment bracket (72) shifts the seed feed wheels so that different sizes of detents can register with the openings of the seed metering tube (30), thereby achieving the desired matching of sizes of detents with the sizes of the seeds.

Abstract: A turf slicer includes a gang of six slicer wheels that “walk” through the turf in response to the forward motion of the turf slicer. In the meantime, the power takeoff from the tractor vertically oscillates the slicer wheels out of phase with one another, so that every sixth wheel is being thrust downwardly to bear most of the weight of the turf slicer as the other five wheels in the gang of six are either being withdrawn upwardly or moved downwardly and do not bear much weight, so that the weight of the turf slicer is concentrated on the downwardly moving slicer wheel that is approaching bottom dead center of its movement, thereby amplifying the effective weight of the turf slicer against the turf below.

Abstract: Disclosed is an apparatus, method, and program product for observing the nodal workload balance of the system on an ongoing basis, and for dynamically changing the preferred nodes of existing threads in order to improve nodal balance. Workload balance is ascertained on a nodal basis and then thread-based workload information is collected. If the detected imbalance persists, the thread-based information is used to change the assignment of preferred nodes to threads to improve nodal workload balance.

Abstract: A meter for determining the temperature of a grain sample comprises two long conductors (7, 8) having temperature dependent resistance and being bent to cover a certain area, a current sensor (9,10) connected to the conductors and means for calculating the resistance of the conductive element based on the measured current and the temperature based on the calculated resistance value.

Abstract: A method of determining density of grains, comprises the steps of: (a) filling a test cell (3) having a known volume with an excess of grains, (b) removing the excess grains from the test cell (3), (c) gathering the removed excess of grains in a container (4) having a known weight when empty, (d) weighing the container (4) together with the excess of grains, (e) filling the container (4) with grains from the test cell (3) after the step of weighing the container (4) together with the excess of grains has been performed and weighing the container (4) together with its content of grains, and (f) determining a correction factor for the density of said grains. This factor is dependent on the weight of the excess grains, and permits precise calculation the density of the grains.

Abstract: The present invention relates to a grain moisture meter comprising means (1,2) for introducing a grain sample into a test cell (3), said test cell comprising means for measuring the dielectric constant of the grain sample, and means for calculating the moisture content of said sample based on the measured dielectric constant. According to the invention the grain moisture meter comprises a strike off element (7) for removing excess of grains delivered to the test cell (3), a bottom container (4) disposed under the test cell (3) and having such an extension that grains removed from the test cell (3) by the strike off element (7) will fall into said container (4), means for unloading grains from the test cell into said container (4), and means (5) for weighing the container and its possible content.

Abstract: A grain moisture sensor is disclosed having a sensor cell that includes a driven plate, a sense plate proximate to and substantially parallel with the driven plate for capacitive measurement across a spacing between the driven plate and the sense plate, and a fill plate adjacent the sense plate and substantially parallel with the driven plate for sensing whether the spacing is filled with grain. Optionally, the sensor cell includes a guard proximate to the parallel to the sense plate such that the sense plate is between the driven plate and the guard. The grain moisture sensor provides for measuring real and imaginary components of an excitation voltage applied to the driven plate, measuring real and imaginary components of a sense current sensed at the sense plate, calculating a complex admittance of the cell, calculating a complex admittance of a reference admittance, and calculating a grain complex permittivity.

Abstract: Disclosed is an apparatus, method, and program product for identifying and grouping threads that have interdependent data access needs. The preferred embodiment of the present invention utilizes two different constructs to accomplish this grouping. A Memory Affinity Group (MAG) is disclosed. The MAG construct enables multiple threads to be associated with the same node without any foreknowledge of which threads will be involved in the association, and without any control over the particular node with which they are associated. A Logical Node construct is also disclosed. The Logical Node construct enables multiple threads to be associated with the same specified node without any foreknowledge of which threads will be involved in the association. While logical nodes do not explicitly identify the underlying physical nodes comprising the system, they provide a means of associating particular threads with the same node and other threads with other node(s).

Abstract: Mechanism for Assigning Home Nodes to Newly Created Threads Disclosed is an apparatus, method, and program product for associating threads with the processing nodes of a multi-nodal computer system. The assignment is accomplished by considering both the relative work capacity of, and the relative amount of ongoing work assigned to, each node. Initiation Weights are used in the preferred embodiment to reflect the desired proportions of threads assigned to each node, from the standpoint of which node should be chosen when a new thread is created.

Abstract: A method for controlling operation of a computer software application running on a plurality of computing entities, which are members of a group of mutually-linked computing entities running the application within a distributed computing system. The method includes receiving an indication of a change in membership of the group together with a reason for the change. A membership change message is delivered to the members, so as to inform the members of the change and of the reason for the change.