Abstract: A self-propelled harvester is disclosed. The harvester comprises a drive motor, an attachment drive that has a hydraulic pump configured to drive a hydraulic motor to drive an attachment positioned on a feed device of the harvester, and a control device. The control device controls the attachment drive by accessing an attachment-specific parameter set tailored to the attachment that is connected to the harvester so that the hydraulic motor generates an attachment-specific operating torque which is lower than a maximum torque specific to the attachment to be driven. Further, the control device is configured, when a load peak is detected, to control the hydraulic motor to increase the operating torque generated by the hydraulic motor up to the attachment-specific maximum torque by changing a preset pivot angle.

Abstract: A folding joint for attaching a rear view display device to a vehicle includes one or more hinge sections and a biasing element. The one or more hinge sections are adapted to rotate relative to the vehicle, with each of the one or more hinge sections comprising a first end and a second end. The biasing element includes a spring, a coil, a wave spring, or other elastic member for biasing at least one of the one or more hinge sections in response to rotation of the folding joint, with the biasing element biasing at least one of a spring biased cam section or a biased clamping bolt.

Abstract: A planetary carrier arrangement includes a planetary carrier, and a lubricant dispensing unit designed to dispense lubricant into the planetary carrier. The lubricant dispensing unit includes an axially elastically movable thrust ring designed to compensate an axial offset of the planetary carrier. The thrust ring has a side in facing relationship to the planetary carrier, with the side designed to include a lubricant pocket thereon.

Abstract: A transmission includes a first transmission stage, a feedthrough extending through the first transmission stage, and a first deflector designed to deflect a lubricant away from the feedthrough.

Abstract: A method for setting up a virtual ad hoc network for transmitting at least one piece of information to a first transportation vehicle as a first network subscriber. The method includes the information being provided based on first data from at least one second network subscriber, and at least one second network subscriber being a second transportation vehicle or an infrastructure component; wherein a motor-vehicle-external, central data processing device receives second data from multiple potential second network subscribers and takes the second data and at least one space-time parameter as a basis for determining the second network subscribers and setting up the virtual ad hoc network with the first transportation vehicle, as the first network subscriber, and the determined second network subscribers, the space-time parameter defining a specific area of relevance that has a predetermined physical and temporal correlation with the current position of the first transportation vehicle.

Abstract: Disclosed herein are processes for producing polyurethanes including mixing (a) polyisocyanate, (b) polymeric compounds having isocyanate-reactive groups, (c) optionally catalysts, (d) compounds of general formula W-Kw-NH—C(O)—CH2-Q and optionally (e) blowing agents, (f) chain extenders and/or crosslinking agents and (g) auxiliaries and/or additives to afford a reaction mixture and reacting the reaction mixture to afford the polyurethane. Further disclosed herein are a polyurethane producible by such a process and a method of using such a polyurethane in enclosed spaces.

Abstract: Attachment (10) for an agricultural harvesting vehicle, comprising a frame (11), a crop collecting device (12), a crop conveying device (13) is designed to convey collected crops in the direction of a feeder device, a crop hold-down device (14) which can be displaced relative to the frame (11), and a protection apparatus (18) having at least two portions (19, 20) and extends over the crop collecting device (12) and the crop conveying device (13), wherein a first portion (19) of the protection apparatus (18) and a second portion (20) of the protection apparatus (18) are connected together in an articulated manner, such that with a displacement of the crop hold-down device (14) and the receiver (17) thereof relative to the frame (11), the first portion (19) of the protection apparatus (18) and the second portion (20) of the protection apparatus (18) can be displaced relative to one another.

Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.

Abstract: Methods, systems, and computer program products are provided for a compute cluster comprising placement and load balancing (PLB) logic that receives data (e.g., state metadata) relating to a service (e.g., database service) executing on the compute cluster, from a resource manager executing on the compute cluster, via a first API associated with the resource manager. The PLB logic receives second data from the service via a second API and determines whether a PLB action is indicated based on one of the second data or a combination of the first data and the second data. When a PLB action is indicated, the PLB logic sends a command to the resource manager to execute the PLB action. The PLB logic also receives queries from clients external to the compute cluster and may spawn a child PLB logic to offload PLB operations, respond to queries, or perform software validation in the child.

Abstract: Intelligent memory brokering for multiple process instances, such as relational databases (e.g., SQL servers), reclaims memory based on value, thereby minimizing cost across instances. An exemplary solution includes: based at least on a trigger event, determining a memory profile for each of a plurality of process instances at a computing node; determining an aggregate memory profile, the aggregate memory profile indicating a memory unit cost for each of a plurality of memory units; determining a count of memory units to be reclaimed; identifying, based at least on the aggregate memory profile and the count of memory units to be reclaimed, a count of memory units to be reclaimed within each process instance so that a total cost is minimized to reclaim the determined count; and communicating, to each process instance having identified memory units to be reclaimed, a count of memory units to be reclaimed within the process instance.

Abstract: Techniques for differential overbooking on a cloud database. These techniques may include determining a reservation amount of a multi-tenant resource for a first service of a based upon an overbooking characteristic of the first service, and determining that a total usage value of the multi-tenant resource by a plurality of services is greater than a threshold value. In addition, the techniques may include determining a service usage value of the multi-tenant resource by the first service, determining a first overage value of the first service based on the service usage value and the reservation amount, and performing a resource reclamation process over the multi-tenant resource based on the first overage value of the first service.

Abstract: Placement of a tenant database in an oversubscribed, database-as-a-service cluster comprised of a plurality of nodes is described. The placement may be based on per-node estimates of a probability of resource demand violation if the tenant database is placed on the node. Past resource usage of similar tenant databases subscribed to the cluster that are collected and stored as compressed traces may be used to obtain the estimates. In some examples, based on the estimates, a per-node expected number of resource violations is determined and compared across nodes, where the determined placement minimizes the number of resource violations. In other examples, when the tenant database is being placed in parallel with other tenant databases, a score assigned to each valid configuration for the placement may be modified based on the estimates, where the determined placement is the configuration having a lowest score.

Abstract: Method for operating an agricultural harvester (1), wherein the agricultural harvester (1) has an attachment (2), wherein the attachment (2) has a receiving conveyor (7) which is driven at a defined first speed, wherein the attachment (2) has a discharge conveyor (8) which is driven at a defined second speed, wherein the harvester (1) has an infeed unit (4) with infeed rollers (5, 6) which are driven at a defined third speed. The second speed, at which the discharge conveyor (8) is driven, is determined depending on the third speed, at which the infeed rollers (5, 6) are driven, and also depending on the speed of travel of the agricultural harvester (1).

Abstract: Methods for distributed histogram computation in a framework utilizing data stream sketches and samples are performed by systems and devices. Distributions of large data sets are scanned once and processed by a computing pool, without sorting, to generate local sketches and value samples of each distribution. The local sketches and samples are utilized to construct local histograms on which cardinality estimates are obtained for query plan generation of distributed queries against distributions. Local statistics of distributions are also merged and consolidated to construct a global histogram representative of the entire data set. The global histogram is utilized to determine a cardinality estimation for query plan generation of incoming queries against the entire data set. The addition of new data to a data set or distribution involves a scan of the new data from which new statistics are generated and then merged with existing statistics for a new global histogram.

Abstract: Bias correcting system for small number estimators. A computer system includes a distinct value estimator configured to estimate a number of distinct values in a data set. The computer system includes a bias table for the estimator. The bias table includes entries with values corresponding to biases caused by the distinct value estimator correlated to values corresponding to numbers estimated. The entries in the table are optimized by having a set of entries with an optimized number of biases in the entries. The biases in the entries are associated with predetermined confidence intervals. The system includes a bias corrector configured to correct the number of distinct values in the multiset data estimated by the distinct value estimator set using values from the bias table to produce a corrected value. The system includes a user interface coupled to the bias corrector configured to output the corrected value to a user.

Abstract: Methods for determining cache activity and for optimizing cache reclamation are performed by systems and devices. A cache entry access is determined at an access time, and a data object of the cache entry for a current time window is identified that includes a time stamp for a previous access and a counter index. A conditional counter operation is then performed on the counter associated with the index to increment the counter when the time stamp is outside the time window or to maintain the counter when the time stamp is within the time window. A counter index that identifies another counter for a previous time window where the other counter value was incremented for the previous cache entry access causes the other counter to be decremented. A cache configuration command to reclaim, or additionally allocate space to, the cache is generated based on the values of the counters.

Abstract: Techniques for differential overbooking on a cloud database. These techniques may include determining a reservation amount of a multi-tenant resource for a first service of a based upon an overbooking characteristic of the first service, and determining that a total usage value of the multi-tenant resource by a plurality of services is greater than a threshold value. In addition, the techniques may include determining a service usage value of the multi-tenant resource by the first service, determining a first overage value of the first service based on the service usage value and the reservation amount, and performing a resource reclamation process over the multi-tenant resource based on the first overage value of the first service.

Abstract: A contact pin, in particular a spring contact pin, comprising a test head for contacting an electrically conductive contact surface of a test object, in particular a wafer, a printed circuit board or the like, and comprising a pin sleeve, in which the test head is mounted with a guide end in a longitudinally displaceable manner. At least in some sections, a flexible, deformable/deformed circuit carrier is provided, on which at least one electrical/electronic component is arranged and which is or can be axially inserted into the pin sleeve by rolling and/or folding.

Abstract: Methods for determining cache activity and for optimizing cache reclamation are performed by systems and devices. A cache entry access is determined at an access time, and a data object of the cache entry for a current time window is identified that includes a time stamp for a previous access and a counter index. A conditional counter operation is then performed on the counter associated with the index to increment the counter when the time stamp is outside the time window or to maintain the counter when the time stamp is within the time window. A counter index that identifies another counter for a previous time window where the other counter value was incremented for the previous cache entry access causes the other counter to be decremented. A cache configuration command to reclaim, or additionally allocate space to, the cache is generated based on the values of the counters.

Abstract: A solution is disclosed for memory management of serverless databases that includes: based at least on detecting a trigger event, determining whether memory is to be reclaimed; based at least on determining that memory is to be reclaimed, determining an amount of memory to be reclaimed; identifying memory to be reclaimed; and reclaiming the identified memory. Disclosed solutions are flexible, enabling customization of the aggressiveness and manner of memory reclamation. This permits users to specify a tailored balance point between performance and cost, for arrangements that bill users based on resource usage (e.g., memory consumed by a serverless database). In some examples, users specify a ramp-down parameter that is used to determine how much memory can be evicted in a particular reclamation event, time intervals (or another criteria) for triggering a reclamation event, and a definition for whether a cache is active.