Abstract: A system includes a server connected to a network. The server includes a data collection module, a database interaction module, and a predictive analysis module. The data collection module is configured to collect data, via the network, from one or more data sources, the data being related to food safety risk and sanitation compliance tracking of a food establishment. The database interaction module is configured to store, into a database, data collected by the data collection module and to retrieve data from the database. The predictive analysis module is configured to analyze data in the database and calculate, based on the analyzed data, a probability of the food establishment violating a health code.

Abstract: Computer-implemented method for providing corrected plant-related index data, comprising the steps of: providing initial plant-related index data for an agricultural field, preferably based on at least one satellite image; and correcting the initial plant-related index data for the agricultural field at least based on historical plant-related index data for the agricultural field and providing corrected plant-related index data.

Abstract: A heat exchanger is provided that can include furcating unit cells coupled with each other. Each of the unit cells can be elongated along an axis and include a sidewall that defines annular ring openings on opposite ends of the unit cell along the axis. The sidewall also can define undulating annular rings between the annular ring openings and axially separated from each other along the axis. The sidewall can further define angled openings into the unit cell both above and below each of the undulating annular rings. At least a first opening of the annular ring openings and the angled openings can be configured to be an inlet to receive a first fluid into the unit cell and at least a second opening of the annular ring openings and the angled openings configured to be an outlet through which the first fluid exits the unit cell.

Abstract: Some embodiments herein are directed to head-mounted Virtual Retina Display (VRD) systems with actuated reflective pupil steering. The display systems include a projection system for generating image content and an actuated reflective optical architecture, which may be part of an optical combiner, that reflects light from the projection system into the user's eyes. The display systems are configured to track the position of a user's eyes and to actuate the reflective optical architecture to change the direction of reflected light so that the reflected light is directed into the user's eyes. The VRDs described herein may be highly efficient, and may have improved size, weight, and luminance such that they are capable of all-day, everyday use.

Abstract: Levers with fulcrums and other linkages can be structured to provide motion in many different structural formations by making adjustments to the parameters of a mechanism such as this invention. Mechanisms with multiple levers working together in coordination and moving a fraction of the full actuation allows machines to be built more efficiently. The levers can be connected to each other in multiple configurations which allow for these machines to be built and programmed from how the levers are connected to each other. This invention is modular so building complex actuators is a simple procedure. The machine can be used as a mechanical actuator or a projectile launcher or a programmable moving mechanism where the programming is built in the structure. By using levers, and simple energy mechanisms to power this invention, the overall efficiency of some processes can be increased.

Abstract: A process for manufacturing a nitrile compound through chain elongation of an alkylene amine compound containing three or more amine units in which at least two amine units are protected by a cyclic urea unit and at least one amine unit is not protected, includes reacting the at least one amine unit that is not protected with glycolonitrile or with the combination of formaldehyde and a cyanide compound selected from HCN and inorganic cyanide salts, to add at least one acetonitrile group to the at least one amine unit that is not protected.

Abstract: A process for producing a cyclic alkylene urea product of Formula I: in which a compound of Formula II and/or Formula III is contacted in a reaction zone with a compound of Formula IV and/or Formula V and in the presence of one or more carbonyl delivering compounds; wherein the compound of Formula II and/or the compound of Formula III are added to a reaction zone comprising compound of Formula IV and/or compound of Formula (V) continuously or semi-continuously over a period of time, or in two or more batches.

Abstract: An encrypted search uses hash vectorization (HV) models, which are secure, one-way hash indices that are produced by a compression process, such as a modeling phase of Lempel-Ziv (LZ) parsing. Each HV model includes a hash filter and a chain vector. The hash filter is a Boolean quotient filter similar to Bloom filters, and allows for the quick elimination of negative query assessments. The hash filter is followed by a chain vector, which provides spatial modeling of hashed elements throughout the compressed and encrypted data, thereby providing increased levels of accuracy, efficiency, and query expressiveness as compared with known techniques.

Abstract: A method includes receiving an input data stream at a processor, and for each byte sequence from a plurality of byte sequences of the input data stream, a hash is generated and compared to a hash table to determine whether a match exists. If a match exists, that byte sequence is incrementally expanded to include one or more additional adjacent bytes from the input data stream, to produce multiple expanded byte sequences. Each of the expanded byte sequences is compared to the hash table to identify a maximum-length matched byte sequence from a set that includes the byte sequence and the plurality of expanded byte sequences. A representation of the maximum-length matched byte sequence is stored in the memory. If a match does not exist, a representation of that byte sequence is stored as a byte sequence literal in the memory.

Abstract: An encrypted search uses hash vectorization (HV) models, which are secure, one-way hash indices that are produced by a compression process, such as a modeling phase of Lempel-Ziv (LZ) parsing. Each HV model includes a hash filter and a chain vector. The hash filter is a Boolean quotient filter similar to Bloom filters, and allows for the quick elimination of negative query assessments. The hash filter is followed by a chain vector, which provides spatial modeling of hashed elements throughout the compressed and encrypted data, thereby providing increased levels of accuracy, efficiency, and query expressiveness as compared with known techniques.

Abstract: An encrypted search uses hash vectorization (HV) models, which are secure, one-way hash indices that are produced by a compression process, such as a modeling phase of Lempel-Ziv (LZ) parsing. Each HV model includes a hash filter and a chain vector. The hash filter is a Boolean quotient filter similar to Bloom filters, and allows for the quick elimination of negative query assessments. The hash filter is followed by a chain vector, which provides spatial modeling of hashed elements throughout the compressed and encrypted data, thereby providing increased levels of accuracy, efficiency, and query expressiveness as compared with known techniques.

Abstract: A method includes receiving an input data stream at a processor, and for each byte sequence from a plurality of byte sequences of the input data stream, a hash is generated and compared to a hash table to determine whether a match exists. If a match exists, that byte sequence is incrementally expanded to include one or more additional adjacent bytes from the input data stream, to produce multiple expanded byte sequences. Each of the expanded byte sequences is compared to the hash table to identify a maximum-length matched byte sequence from a set that includes the byte sequence and the plurality of expanded byte sequences. A representation of the maximum-length matched byte sequence is stored in the memory. If a match does not exist, a representation of that byte sequence is stored as a byte sequence literal in the memory.

Abstract: An encrypted search uses hash vectorization (HV) models, which are secure, one-way hash indices that are produced by a compression process, such as a modeling phase of Lempel-Ziv (LZ) parsing. Each HV model includes a hash filter and a chain vector. The hash filter is a Boolean quotient filter similar to Bloom filters, and allows for the quick elimination of negative query assessments. The hash filter is followed by a chain vector, which provides spatial modeling of hashed elements throughout the compressed and encrypted data, thereby providing increased levels of accuracy, efficiency, and query expressiveness as compared with known techniques.

Abstract: A method includes receiving an input data stream at a processor, and for each byte sequence from a plurality of byte sequences of the input data stream, a hash is generated and compared to a hash table to determine whether a match exists. If a match exists, that byte sequence is incrementally expanded to include one or more additional adjacent bytes from the input data stream, to produce multiple expanded byte sequences. Each of the expanded byte sequences is compared to the hash table to identify a maximum-length matched byte sequence from a set that includes the byte sequence and the plurality of expanded byte sequences. A representation of the maximum-length matched byte sequence is stored in the memory. If a match does not exist, a representation of that byte sequence is stored as a byte sequence literal in the memory.

Abstract: A method for searching compressed, encrypted data includes receiving uncompressed data and identifying patterns thereof. Each pattern includes a predetermined number of bytes. Each pattern is hashed into a hash value, producing a set of hash values that is stored in a hash table. Each record of the hash table includes a hash value from the set of hash values and an associated position value. A Boolean filter is generated based on the hash table, each bit of the Boolean filter associated with a different hash value. A search string hash value is calculated based on a received search request. A location in the Boolean filter, having an address equal to the search string hash value, is inspected to determine whether a position stored at the location is true or false. If the position is true, at least a portion of the compressed data is flagged as relevant.

Abstract: A data compression system includes an encoder for receiving a binary string of data which is partitioned into one or more binary segments and assigned Variable Length Codewords (VLCs) to be stored to a file or transmitted over a medium, such as a wired network or a wireless network. The system can also include a decoder for receiving the VLCs from a file or network and reproducing a binary string of data substantially identical to that which was input to the encoder. The system can also include a processor, a memory and/or a coder/decoder (CODEC) for compressing/decompressing a raw or compressed data stream received from a file or network.

Abstract: A method for searching compressed, encrypted data includes receiving uncompressed data and identifying patterns thereof. Each pattern includes a predetermined number of bytes. Each pattern is hashed into a hash value, producing a set of hash values that is stored in a hash table. Each record of the hash table includes a hash value from the set of hash values and an associated position value. A Boolean filter is generated based on the hash table, each bit of the Boolean filter associated with a different hash value. A search string hash value is calculated based on a received search request. A location in the Boolean filter, having an address equal to the search string hash value, is inspected to determine whether a position stored at the location is true or false. If the position is true, at least a portion of the compressed data is flagged as relevant.

Abstract: A data encoding system includes a non-transitory memory, a processor, a digital-to-analog converter (DAC) and a transmitter. The non-transitory memory stores a predetermined file size threshold. The processor is in operable communication with the memory, and is configured to receive data. The processor detects a file size associated with the data. When the file size is below the predetermined file size threshold, the processor compresses the data using a variable length codeword (VLC) encoder. When the file size is not below the predetermined file size threshold, the processor compresses the data, using a hash table algorithm. The DAC is configured to receive a digital representation of the compressed data from the processor and convert the digital representation of the compressed data into an analog representation of the compressed data. The transmitter is coupled to the DAC and configured to transmit the analog representation of the compressed data.

Abstract: A method for searching compressed, encrypted data includes receiving uncompressed data and identifying patterns thereof. Each pattern includes a predetermined number of bytes. Each pattern is hashed into a hash value, producing a set of hash values that is stored in a hash table. Each record of the hash table includes a hash value from the set of hash values and an associated position value. A Boolean filter is generated based on the hash table, each bit of the Boolean filter associated with a different hash value. A search string hash value is calculated based on a received search request. A location in the Boolean filter, having an address equal to the search string hash value, is inspected to determine whether a position stored at the location is true or false. If the position is true, at least a portion of the compressed data is flagged as relevant.

Abstract: A data encoding system includes a non-transitory memory, a processor, a digital-to-analog converter (DAC) and a transmitter. The non-transitory memory stores a predetermined file size threshold. The processor is in operable communication with the memory, and is configured to receive data. The processor detects a file size associated with the data. When the file size is below the predetermined file size threshold, the processor compresses the data using a variable length codeword (VLC) encoder. When the file size is not below the predetermined file size threshold, the processor compresses the data, using a hash table algorithm. The DAC is configured to receive a digital representation of the compressed data from the processor and convert the digital representation of the compressed data into an analog representation of the compressed data. The transmitter is coupled to the DAC and configured to transmit the analog representation of the compressed data.