Abstract: A machine and method for reducing giveaway material on mint products. The machine may include a conveying assembly for conveying a plurality of mints products to be processed. The machine may also include a processing assembly for processing at least one given mint product at a time, so as to remove an amount of giveaway material from each one of the mint products. The machine may also include a recuperating assembly for recuperating mint products having being processed.

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: Disclosed are polyurethane encapsulating compounds for embedding hollow fibers of filter elements, obtainable by mixing a polyol component (A) and an isocyanate component (B), including at least one aromatic isocyanate, to give a reaction mixture and reacting the mixture to completion to give the polyurethane encapsulating compound. The polyol component (A) includes at least one fatty-acid-based polyol (a1) having a hydroxyl number of greater than 50 to less than 500 mg KOH/g and a functionality of from 2-6, and at least one bismuth catalyst (a2), obtainable by mixing a bismuth carboxylate (a2-1) with an amine compound (a2-11) having at least one tertiary nitrogen atom and at least one isocyanate-reactive hydrogen atom. The molar ratio of bismuth to amine compound (a2-11) is 1:0.5-1:50. Also disclosed are methods for producing filter elements using the polyurethane encapsulating compounds and to uses of the polyurethane encapsulating compounds for the embedding of hollow fibers.

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: Polyurethane encapsulating compounds for the embedding of hollow fibers of filter elements are provided. These are obtainable by mixing a polyol component (A) and an isocyanate component (B) to give a reaction mixture and reacting the mixture to completion to give the polyurethane encapsulating compound, wherein the polyol component (A) comprises (a1) at least one fatty-acid-based polyol, (a2) at least one amine compound having at least one tertiary nitrogen atom and at least one isocyanate-reactive hydrogen atom and (a3) at least one metal compound that functions as a polyurethane catalyst, wherein the polyurethane catalyst (a3) does not comprise any tin, lead and/or mercury and the isocyanate component (B) comprises at least one aromatic isocyanate having at least two isocyanate groups. Further provided is a method for producing filter elements using the polyurethane encapsulating compounds and the use of the polyurethane encapsulating compounds for the embedding of hollow fibers.

Abstract: Disclosed are polyurethane encapsulating compounds for embedding hollow fibers of filter elements, obtainable by mixing a polyol component (A) and an isocyanate component (B), including at least one aromatic isocyanate, to give a reaction mixture and reacting the mixture to completion to give the polyurethane encapsulating compound. The polyol component (A) includes at least one fatty-acid-based polyol (a1) having a hydroxyl number of greater than 50 to less than 500 mg KOH/g and a functionality of from 2-6, and at least one bismuth catalyst (a2), obtainable by mixing a bismuth carboxylate (a2-1) with an amine compound (a2-11) having at least one tertiary nitrogen atom and at least one isocyanate-reactive hydrogen atom. The molar ratio of bismuth to amine compound (a2-11) is 1:0.5-1:50. Also disclosed are methods for producing filter elements using the polyurethane encapsulating compounds and to uses of the polyurethane encapsulating compounds for the embedding of hollow fibers.

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 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: Polyurethane encapsulating compounds for the embedding of hollow fibers of filter elements are provided. These are obtainable by mixing a polyol component (A) and an isocyanate component (B) to give a reaction mixture and reacting the mixture to completion to give the polyurethane encapsulating compound, wherein the polyol component (A) comprises (a1) at least one fatty-acid-based polyol, (a2) at least one amine compound having at least one tertiary nitrogen atom and at least one isocyanate-reactive hydrogen atom and (a3) at least one metal compound that functions as a polyurethane catalyst, wherein the polyurethane catalyst (a3) does not comprise any tin, lead and/or mercury and the isocyanate component (B) comprises at least one aromatic isocyanate having at least two isocyanate groups. Further provided is a method for producing filter elements using the polyurethane encapsulating compounds and the use of the polyurethane encapsulating compounds for the embedding of hollow fibers.

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 system is disclosed comprising a transceiver, transcoder, memory, and a processor for receiving raw data, partitioning the raw data into substrings of predetermined length, assigning each substring to a corresponding predetermined frequency based upon a data set or first lookup table based on the substring's given pattern, and transmitting said frequency using an antenna. Embodiments include a compression component for receiving raw data as input, breaking the raw data into subsets of predetermined length, comparing the raw data to a second lookup table, the second lookup table comprising all possible bit patterns for a file of the length of the raw data, wherein the possible bit patterns are partitioned in n-bit partitions, the n-bit partitions having a corresponding assigned value, the values of which are assembled by a given function so as to produce a code for each possible bit pattern.