Abstract: Devices, systems, and techniques can be provided for processing an oil-containing material with an alcohol-based solvent to extract oil from the material. In some examples, a system includes an extractor configured to process an oil-containing feedstock. The extractor receives the oil-containing feedstock and conveys the material from an inlet to an outlet through the extractor. The extractor also receives an alcohol-based solvent at a solvent inlet and conveys the solvent through the extractor to a solvent outlet. The alcohol-based solvent may be ethanol. A concentration of oil in the feedstock may decrease as the feedstock moves through the extractor from the inlet to the outlet while the concentration of the oil in the solvent increases.

Abstract: A method for configuring a system having a wearable optical unit is disclosed. The method includes powering on the system, and in response to the system being powered on, using one or more processors to control the system to: determine whether to cause the system to run a configuration workflow, and in response to determining to cause the system to run the configuration workflow, (a) control the system in connection with configuring an interpupillary distance (IPD) for a user of the system, (b) determine whether the IPD is configured for the user, and (c) in response to determining that the IPD is configured for the user, control the system in connection with configuring a focus of the optical unit.

Abstract: A database management system stores an entry in a journal. The journal, upon storage of the entry, comprises an ordered plurality of leaf nodes and a hierarchy of interior nodes based upon the leaf nodes. A node in the ordered plurality of nodes comprises a hash value computed based on the hash of a corresponding entry and a hash of a prior leaf node. A cryptographic proof of the entry comprises successive application of a hash operator to one or more hashes of the leaf nodes.

Abstract: A database management system stores an entry in a journal. The journal, upon storage of the entry, comprises a leaf node with a hash value based at least in part on the entry, and a hierarchy of interior nodes based at least in part upon the leaf node. In response to a request to delete the entry, the entry is deleted but the hash value is retained. A cryptographic proof of a second entry stored in the journal is based at least in part on the retained hash value.

Abstract: An electric motor of a pump drive of a motor vehicle, more particularly of an oil pump, having a rotor, which comprises a motor shaft mounted to rotate about an axis of rotation. The motor shaft is coupled by means of a freewheel to a motor support, the freewheel being held on the motor support by means of a securing device. Further disclosed is a pump drive of a motor vehicle.

Abstract: A database management system stores an entry in a journal. Upon storage of the entry, the journal comprises a plurality of threaded leaf nodes and a hierarchy of interior nodes comprising hash values computed from the threaded leaf nodes. A first set of hash values is provided to prove that the entry is stored in a first version of the journal. A second set is provided to prove that the entries stored in the first version of the journal are unmodified and stored in a second version of the journal.

Abstract: A robotic automated broccoli plant harvesting apparatus uses a vision system implemented with an RGB depth camera that provides imaging signals. Software operating on a microcomputer processes the imaging signals to identify the height and position of a broccoli plant to sever it with dual opposed cutting blades. In a preferred embodiment, the software algorithm combines color, texture, and distance information of the broccoli plant to reliably cut the broccoli stalk with ?-inch (3.175-millimeter) accuracy. Broccoli stalks of consistent lengths result in uniform, commercially viable products.

Abstract: A database management system stores an entry in a journal. The journal, upon storage of the entry, comprising a hierarchy of nodes. A node in the hierarchy comprises a hash value computed by application of a symmetric hash operator to hash values of first and second child nodes. The symmetric hash operator generates equivalent output irrespective of the order of the operands. A cryptographic proof of the entry comprises successive application of the symmetric hash operator to a list of hashes from the hierarchy.

Abstract: An electric motor which is designed as an internal rotor, comprising a laminated stator core and a functional support which is arranged on a rear side that faces away from an output side of the laminated stator core. The functional support includes a plastic housing and connecting elements which are integrated in the plastic housing and protrude therefrom in the axial direction of the laminated stator core. The functional support is interlocking and/or integrally connected to the laminated stator core in the axial direction at a lateral outer surface of the laminated stator core by means of the connecting elements.

Abstract: A method and system for testing of a communication network utilizing a plurality of test agents in the communication network using a deterministic decentralized scheduling of the plurality of test agents to test a single network service. Determining an optimal time period for executing a test of the single network service by each of the plurality of test agents without requiring global knowledge of the system and without requiring centralized coordination of individual agent test schedules.

Abstract: A method and system for testing of a communication network utilizing a plurality of test agents in the communication network using a deterministic decentralized scheduling of the plurality of test agents to test a single network service. Determining an optimal time period for executing a test of the single network service by each of the plurality of test agents without requiring global knowledge of the system and without requiring centralized coordination of individual agent test schedules.

Abstract: A database management system stores an entry in a journal. Upon storage of the entry, the journal comprises a plurality of threaded leaf nodes and a hierarchy of interior nodes comprising hash values computed from the threaded leaf nodes. A first set of hash values is provided to prove that the entry is stored in a first version of the journal. A second set is provided to prove that the entries stored in the first version of the journal are unmodified and stored in a second version of the journal.

Abstract: A database management system stores an entry in a journal. The journal, upon storage of the entry, comprises a leaf node with a hash value based at least in part on the entry, and a hierarchy of interior nodes based at least in part upon the leaf node. In response to a request to delete the entry, the entry is deleted but the hash value is retained. A cryptographic proof of a second entry stored in the journal is based at least in part on the retained hash value.

Abstract: A database management system stores an entry in a journal. The journal, upon storage of the entry, comprises an ordered plurality of leaf nodes and a hierarchy of interior nodes based upon the leaf nodes. A node in the ordered plurality of nodes comprises a hash value computed based on the hash of a corresponding entry and a hash of a prior leaf node. A cryptographic proof of the entry comprises successive application of a hash operator to one or more hashes of the leaf nodes.

Abstract: A database management system stores an entry in a journal. The journal, upon storage of the entry, comprising a hierarchy of nodes. A node in the hierarchy comprises a hash value computed by application of a symmetric hash operator to hash values of first and second child nodes. The symmetric hash operator generates equivalent output irrespective of the order of the operands. A cryptographic proof of the entry comprises successive application of the symmetric hash operator to a list of hashes from the hierarchy.

Abstract: Upstream burst transmit times are dynamically communicated to the transmit unit in grants issued over time and in any order. A critical parameter is when to trigger the operation to order the buffered data stream for transmission. If the ordering operation is triggered too soon, a later grant of an earlier burst transmit time may not be accounted for and the subsequent transmission could violate the transmission order rule. If the ordering operation is triggered too late, the decision to transmit a burst at an earlier burst transmit time may violate the margin rule. To address these concerns, a fetch offset time in advance of each granted burst transmit time is assigned. As each fetch offset time is sequentially reached, a next partial data portion of the buffered data stream is prepared for burst communication.

Abstract: A distributed network traffic flow monitoring system is provided. The system includes a plurality of network packet flow collector devices for receiving netflow packets associated with a traffic flow activity data at a network connection. The traffic flow activity data includes one or more transmissions between particular source and destination IP addresses. The system further includes a network packet flow coordinator device connected to the plurality of network packet flow collector devices and configured to aggregate probabilistic information related to the traffic flow activity data from the one or more of network packet flow collector devices and to estimate cardinality of the traffic flow activity data based on the aggregated probabilistic information.

Abstract: A distributed network traffic flow monitoring system is provided. The system includes a plurality of network packet flow collector devices for receiving netflow packets associated with a traffic flow activity data at a network connection. The traffic flow activity data includes one or more transmissions between particular source and destination IP addresses. The system further includes a network packet flow coordinator device connected to the plurality of network packet flow collector devices and configured to aggregate probabilistic information related to the traffic flow activity data from the one or more of network packet flow collector devices and to estimate cardinality of the traffic flow activity data based on the aggregated probabilistic information.

Abstract: Upstream burst transmit times are dynamically communicated to the transmit unit in grants issued over time and in any order. A critical parameter is when to trigger the operation to order the buffered data stream for transmission. If the ordering operation is triggered too soon, a later grant of an earlier burst transmit time may not be accounted for and the subsequent transmission could violate the transmission order rule. If the ordering operation is triggered too late, the decision to transmit a burst at an earlier burst transmit time may violate the margin rule. To address these concerns, a fetch offset time in advance of each granted burst transmit time is assigned. As each fetch offset time is sequentially reached, a next partial data portion of the buffered data stream is prepared for burst communication.

Abstract: A method is provided in one example and includes receiving a plurality of packets; identifying whether a particular packet, of the plurality of packets, is part of a sequenced flow; identifying whether a particular sequence number of the particular packet is being received within a time window; identifying whether the particular packet was a next expected packet for a particular flow; and forwarding the particular packet to a next destination. In more particular embodiments, packet inspection is used to set one or more flags for identifying characteristics associated with the plurality of packets. Certain packets in non-sequenced flows are routed directly from an input interface to an output interface of a resequencer module using a flow-through packet path.