Abstract: A network system that facilitates financial transactions. A software defined network may operate to provide a variety of trading related services to a variety of customers with a low latency. Core or processor affinity for routing processes may improve speeds of routing. Data capture through a shared memory space may allow for a variety of analytics without introducing unacceptable delay.

Abstract: A data storage system performs partial compression and decompression of a set of memory items. The memory items each include a data block and a tag with a prefix making up at least part of the tag. The memory items are ordered based on the prefixes. A code word is created containing compressed information representing values of the prefixes for the set of memory items. The code word and block data for each of the memory items are stored in a memory. The code word is decompressed to recover the prefixes.

Abstract: It is provided a circuit for generating finger print code data comprising: plural pairs of first transistors, each of the first transistors having a source formed in the substrate, a drain formed in the substrate, a channel formed in the substrate between the source and the drain, a gate insulating layer formed on the channel, a gate electrode formed over the gate insulating layer, and an insulating sidewall formed at a side surface of the gate electrode; plural pairs of cross coupled second transistors, each of the plural pairs of cross coupled second transistors having drains and commonly connected sources, corresponding to each of the plural pairs of first transistors; and plural pairs of third transistors, each of the plural pairs of third transistors corresponding to each of the plural pairs of cross coupled second transistors.

Abstract: In a data storage system, a prior set S of prefix codes for pseudo-dynamic compression as well as data compressed utilizing prior set S are stored. While data compressed utilizing prior set S are stored in the data storage system, the number of prefix codes utilized by the data storage system for pseudo-dynamic compression are augmented. Augmenting the number of codes includes determining a new set S? of prefix codes for pseudo-dynamic compression from a training data set selected from a workload of the data storage system and storing the new set S? in the data storage system with the prior set S.

Abstract: A sequence of tuples, each having one or more attributes, is received at one of one or more processing elements operating on one or more processors. Each processing element may have one or more stream operators. A first stream operator may be identified as one that only processes an instance of a first attribute in a currently received tuple when a difference between an instance of the first attribute in a previously received tuple and the instance of the first attribute in the currently received tuple is outside of a difference threshold. A second stream operator may generate a difference attribute from a first instance of the first attribute in a first one of the received tuples and a second instance of the first attribute in a second one of the received tuples. The difference attribute may be transmitted from the second stream operator to the first stream operator.

Abstract: Parallel processing concepts such as wavefront parallel processing, are realized with a reduced end-to-end delay by giving up the usual slice concept according to which slices are either coded/decoded completely independent from areas of the picture outside of the respective slice, or at least independent from areas outside the respective slice as far as the entropy coding is concerned, namely in favor of slices of different modes, namely ones called dependent slices which allow for interdependencies across slice boundaries, and others which do not, called normal slices, for example. Combined with the aspect or not, WPP processing concept is made more efficiently by using the slices' start syntax portions to locate WPP entry points.

Abstract: A searching device converts a searching data into an encoded searching data in a first encoding format according to a first encoding rule; and searches the encoded searching data in a target encoded data that has been encoded into the first encoding format by the first encoding rule, or that has been encoded in a second encoding format wherein when a specific encoded data encoded in the second encoding format is detected in the searching, the searching compares the encoded searching data and a converted encoded data, the converted encoded data being the specific encoded data converted into the first encoding format based on a predetermined conversion rule.

Abstract: A sub-block entropy coding method more efficiently encodes content. Specifically, by selecting the most optimal tables for each sub-block, the number of bits utilizes is minimized. Furthermore, based on results, tables are able to be eliminated as options to further reduce the number of signaling bits.

Abstract: Parameter encoding techniques for wireless communication networks are described. In some embodiments, an apparatus may comprise a memory and logic for a wireless communication device, at least a portion of the logic comprised in circuitry coupled to the memory, the logic to determine a channel usage configuration to be applied for a transmission of a packet to a remote device, the channel usage configuration to designate a primary channel and one or more data transmission channels, generate a PHY header for the packet, the PHY header to comprise a first field comprising information indicating the one or more data transmission channels and a second field comprising information identifying the primary channel, and encode the PHY header for wireless transmission. Other embodiments are described and claimed.

Abstract: There are provided a universal asynchronous receiver/transmitter (UART) unit, and a memory controller and a memory system, which have the UART unit. A UART unit includes: a WORD table to store text information and a plurality of word codes corresponding to the text information, and to output a first word code corresponding to first text information when the first text information is received by the WORD table, wherein the text information includes a plurality of words, and the first text information includes a first word among the plurality of words; a UART controller to output the first text information to the WORD table by extracting the first word from output information, and to output an output code based on the output information and the first word code when the first word code is received from the WORD table; and a UART to output debugging information based on the output code.

Abstract: A query is received by a document store from a client. The query specifies at least one database operation implicating documents within the document store. At least one of the implicated documents has partially compressed objects in which only a portion of the document is compressed. Thereafter, the documents are scanned to identify the compressed objects and to identify decompression keys. The scanned compressed objects are then decompressed using the corresponding decompression keys. Data responsive to the query can then be provided to the client. lated apparatus, systems, techniques and articles are also described.

Abstract: The disclosure may relate to a communications protocol between a mobile device and a control panel, or a mobile device and a server associated with the automation system. The communication protocol may reduce a size of data transferred between the mobile device and control panel ensuring the user does not experience latency on their mobile device, a large bill from their wireless broadband provider, and also does not miss important update or the like from the automation system. In some embodiments, a method for a security and/or automation is described. The method may comprise generating a communication to a user, coding the communication using a pre-established user-specific code index, and transmitting the coded communication to a device associated with the user. Coding the communication may further comprise reducing a size of the communication.

Abstract: Parallel processing concepts such as wavefront parallel processing, are realized with a reduced end-to-end delay by giving up the usual slice concept according to which slices are either coded/decoded completely independent from areas of the picture outside of the respective slice, or at least independent from areas outside the respective slice as far as the entropy coding is concerned, namely in favor of slices of different modes, namely ones called dependent slices which allow for interdependencies across slice boundaries, and others which do not, called normal slices, for example. Combined with the aspect or not, WPP processing concept is made more efficiently by using the slices' start syntax portions to locate WPP entry points.

Abstract: A searching device converts a searching data into an encoded searching data in a first encoding format according to a first encoding rule; and searches the encoded searching data in a target encoded data that has been encoded into the first encoding format by the first encoding rule, or that has been encoded in a second encoding format wherein when a specific encoded data encoded in the second encoding format is detected in the searching, the searching compares the encoded searching data and a converted encoded data, the converted encoded data being the specific encoded data converted into the first encoding format based on a predetermined conversion rule.

Abstract: Provided are a method and an apparatus for transmitting uplink control information (UCI), which is carried out by a terminal in a wireless communication system. If the number of information bits of the UCI falls inside a specific range when different types of UCI are transmitted through the same PUCCH format, a bit sequence of each of the UCI are channel-coded by aligning/interleaving, wherein the aligning/interleaving is carried out so that the UCI having high importance are channel-coded so as to have better decoding performance.

Abstract: A system and method of forming entropy coding groups in an entropy encoder includes providing multiple prefix codebooks, each prefix codebook being associated with a bit-based representation; receiving a block of sample values as a current block of sample values; forming multiple entropy coding groups; converting the sample values in each entropy coding group to a selected bit-based representation; determining the bit-based representation used for each respective entropy coding group; selecting a first or second prefix codebook for a respective entropy coding group in response to the determining; applying the selected prefix codebook to encode a prefix value of the respective entropy coding group; forming the bit-representation of the entropy coding groups, where the bit-representation of each entropy coding group includes a prefix encoded using the selected prefix codebook and one or more sample values; and providing the bit-representation of the entropy coding groups as an output.

Abstract: A method, executed by one or more processors, includes receiving a first bit sequence corresponding to source data having a source encoding bit-length (BLS), generating one or more additional bit sequences by shifting the first bit sequence by shift lengths that are equal to a multiple of the source encoding bit-length, partitioning the first bit sequence and the one or more additional bit sequences according to a target encoding bit-length (BLT) to provide a plurality of target encoding search patterns, and searching a target character string encoded with the target encoding using the plurality of target encoding search patterns. A computer system and computer program product corresponding to the above method are also disclosed herein.

Abstract: Approaches are described to improve database performance by implementing a RLE decompression function at a low level within a general-purpose processor or an external block. Specifically, embodiments of a hardware implementation of an instruction for RLE decompression are disclosed. The described approaches improve performance by supporting the RLE decompression function within a processor and/or external block. Specifically, a RLE decompression hardware implementation is disclosed that produces a 64-bit RLE decompression result, with an example embodiment performing the task in two pipelined execution stages with a throughput of one per cycle. According to embodiments, hardware organization of narrow-width shifters operating in parallel, controlled by computed shift counts, is used to perform the decompression.

Abstract: A signal encoder divides the signal into segments and uses prediction models to approximate the samples of each segment Each local prediction model, each applicable to one segment, is applied in its own translated axis system within the segment and the offset is given by the last predicted value for the previous segment. When the signal is reasonably continuous, it alleviates the need to parameterize the offset for each local predictor model as each local predictor model can build on this last predicted sample value of the previous segment. The encoder as a consequence doesn't suffer from a build up of error even though the offset is not transmitted but instead the last predicted value of the last sample of the previous segment is used. Prediction errors are obtained for the approximated samples and transmitted to the decoder, together with the predictor model parameters and seed value to allow accurate reconstruction of the signal by the decoder.

Abstract: Methods and apparatus teach a digital spectrum of a file. The digital spectrum is used to map a file's position in a multi-dimensional space. This position relative to another file's position reveals distances between the files. Closest files can be grouped together. When contemplating voluminous numbers of files for digital spectrums, various methods include: concatenating all such files together to get a single key useful for creating a file's spectrum; or compressing files individually and combining their collective dictionaries into a single dictionary with or without the use of tree mechanisms that defines the digital spectrum. Each provides advantage over the other. The latter consumes considerably less run time because each compression event can be distributed to a separate processor. Method two provides better spectrums because it is more “informationally” valid than is method one.

Abstract: Various examples are directed to systems and methods for secure messaging between computing components. A first computing device may send tree generation data to a second computing component. The tree generation data may comprise string selection data identifying a set of at least two strings of a string library. The first computing component may generate a coding tree based at least in part on the tree generation data and the string library and encode a first message based at least in part on the coding tree to generate a first encoded message. The first computing component may send the first encoded message to the second computing component.

Abstract: A method for manufacturing a personalizable portable electronic device having a 0.libraries as well as a corresponding portable electronic device and personalization system. The method includes a step of storing a plurality of compressed application code libraries in the non-volatile memory a step of determining which application code libraries are not required for applications used on the personalizable portable electronic device, a step of deleting from the non-volatile memory any compressed application code libraries determined to not be required for applications used on the personalizable portable electronic device, and a step of decompressing an application code library required by an application used on the personalizable portable electronic device. Other systems and methods are disclosed.

Abstract: Techniques for data processing may include: computing an entropy value for the chunk; determining, in accordance with the entropy value for the data chunk, whether the data chunk is compressible; and responsive to determining the data chunk is compressible based on the entropy value for the chunk, compressing the data chunk. The entropy value may be determined using counters for data items where the counters denote current frequencies of different allowable data items in the data chunk; and performing second processing using the counters to determine an entropy value for the data chunk, wherein said second processing includes selecting a precomputed binary logarithmic value from a table for each of the counters. The table may include integer representations of binary logarithmic values. The second processing may include loading multiple data items of the chunk into a register, extracting each data item from the register and incrementing a corresponding counter.

Abstract: A system for hierarchical variable code rate error correction coding may include at least one circuit that is configured to identify a row of a hierarchical portion of a generator matrix that corresponds to a determined code rate, determine a number of information bits to apply to the hierarchical portion based at least on the identified row, and apply the determined number of information bits to the identified row. The circuit may be further configured to apply an output of the identified row to a subsequent row of the hierarchical portion, when the hierarchical portion includes a subsequent row, and apply an output of a last row of the hierarchical portion to a base portion of the generator matrix. The circuit may be further configured to provide a codeword output by the base portion of the generator matrix.

Abstract: Embodiments of the present invention provide a method for feeding back channel state information, a user equipment, and a base station, to improve feedback precision of channel state information. The method includes: receiving a reference signal sent by a base station; selecting a precoding matrix W from a codebook according to the reference signal, where a column vector of the precoding matrix W may be expressed as ?[v ej?v]T, v=[1 ej?]; and sending a precoding matrix indicator PMI to the base station, where the PMI is corresponding to the selected precoding matrix W. The present invention may further improve quantization precision and achieve balance between overheads and the quantization precision. The base station performs precoding on a sent signal according to a fed back precoding matrix indicator, which can improve precoding precision, thereby improving a data transmission rate and system throughput.

Abstract: An arithmetic encoder is provided for converting an event sequence comprised of a plurality of events to an information sequence comprised of at least one information piece, and includes a core engine for receiving an event of the event sequence, and a probability estimate from a probability estimator, and generating zero or more pieces of the information sequence responsive to the received event and the probability estimate by bounding the ratio of events to information pieces. An arithmetic encoder is provided that is capable of constraining a number of events in at least one event sequence as a function of the number of generated information pieces in at least one information sequence.

Abstract: Data structures can provide for a column store of a database table. Methods can use the data structures for efficiently responding to a query. Unique field values of a column of a database table can be identified. The unique values can be stored in a dictionary table along with reference keys that point to a row of the database table. A reference store column can replace the original column, where the reference store column stores index values of the dictionary table. A hash table can be used in accessing the database. A hash function can provide a hash value of a query term, and the hash value can be used to access a hash table to obtain a stored value of an index value of the dictionary table. The index value can be used to access the dictionary table to obtain reference keys corresponding to rows of the database table.

Abstract: Exemplary embodiments provide for compressing, storing, retrieving and decompressing paged code from mass storage devices. By evaluating the size of compressed virtual pages relative to the storage page (read unit) of the mass storage device into which the compressed virtual pages are to be stored, decisions can be made which facilitate later read out and decompression of those compressed virtual pages. According to exemplary embodiments, a virtual page can be stored uncompressed, compressed but undivided or compressed and subdivided into a plurality of parts based on an evaluation.

Abstract: A network system that facilitates financial transactions. A software defined network may operate to provide a variety of trading related services to a variety of customers with a low latency. Core or processor affinity for routing processes may improve speeds of routing. Data capture through a shared memory space may allow for a variety of analytics without introducing unacceptable delay.

Abstract: A system includes a stored table comprising a plurality of rows and at least one column, each of the plurality of rows associated with a node of a hierarchy, and one of the at least one columns implicity representing a position of a row's associated node within the hierarchy, wherein a Structured Query Language query is received and, response to the query, one or more values of the one of the at least one columns are determined and one or more properties of the hierarchy are determined based on the one or more values.

Abstract: A system, method, and computer readable medium for removing credit card numbers from a financial transaction record is provided. A temporary record containing only numeric characters is generated by parsing non-numeric characters from the financial transaction record. Numeric strings are then parsed from the temporary record and evaluated to determine if the parsed numeric strings potentially comprise a credit card number. Numeric strings that are evaluated as potentially comprising credit card numbers may then be further evaluated to determine if the numeric strings comprise valid credit card numbers. The original financial transaction record may then be searched for numeric strings evaluated as valid credit card numbers. Any string of consecutive characters that match a validated credit card number may then be replaced with white space characters or other innocuous characters in the transaction record.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for receiving from a plurality of publisher clients a plurality of messages, each message being for a particular channel of a plurality of distinct channels wherein each channel comprises an ordered plurality of messages, encoding each message based on a particular dictionary, storing encoded messages in one or more respective buffers according to the order, each buffer having a respective time-to-live and residing on a respective node, retrieving encoded messages for the particular channel from respective buffers having time-to-lives that have not expired and according to the order, decoding each retrieved message based on the particular dictionary, and sending the decoded messages to a plurality of subscriber clients.

Abstract: The invention provides method and system for extracting rule specific data from a computer word. The method comprises: calculating at least one decimal value based on a rule representation associated with a rule, the rule representation is a byte array, value of each bit of the byte array representing whether a corresponding bit position in the computer word has a data component; identifying at least one result byte array based on the calculated decimal value from a preset look-up table, which includes a plurality of mappings, each between a result byte array and a decimal value, the result byte array indicating a set of reference bit positions for determining a set of bit positions in the computer word in which data components related to the rule are stored, and a last byte of the result byte array representing a bit count value associated with the set of reference bit positions.

Abstract: Examples of methods and apparatus for performing wavefront parallel decode of video bitstreams are described herein. An example apparatus includes a CABAC decoder configured to decode a CABAC bitstream and generate an output bitstream. The output bitstream contains a plurality of NAL units, each NAL unit being associated with a respective row of a macroblock. The apparatus includes an extractor block configured to extract entry point information associated with a row, and a memory configured to store the extracted entry point information associated with the row. The apparatus includes an insertion block configured to read from the memory the entry point information and insert the entry point information into the NAL unit associated with the row. The plurality of NAL units are provided to at least one macroblock decoder for performing parallel wavefront decode on the output bitstream.

Abstract: Method and apparatus for performing in-place compression is provided. The in-place compression system transfers source data from a partition of a memory to a data buffer based on a read address. Compressed data is created by referencing the source data stored in the data buffer. The system writes the compressed data to the memory partition based on a write address. When the write address points at an address location that stores source data that has not been transferred to the data buffer, the system overwrites the compressed data stored in the memory partition with the source data stored in the data buffer.

Abstract: Techniques are disclosed for generating a sequence of symbols based on input data for a neuro-linguistic model. The model may be used by a behavior recognition system to analyze the input data. A mapper component of a neuro-linguistic module in the behavior recognition system receives one or more normalized vectors generated from the input data. The mapper component generates one or more clusters based on a statistical distribution of the normalized vectors. The mapper component evaluates statistics and identifies statistically relevant clusters. The mapper component assigns a distinct symbol to each of the identified clusters.

Abstract: A second physical-address-dependent code is generated from a first physical-address-dependent code using differential data, where the generating comprises converting a first physical address in a region of the first physical-address-dependent code to a second, different physical address for inclusion in a corresponding region of the second physical-address-dependent code.

Abstract: A storage system receives one or more records from a host system. The records are compressed in a first compression format that is native to the host system. The storage system identifies an incompatibility between the first compression format and a first operation of the storage system. In response to the identified incompatibility, the storage system decompresses the received records. The decompression is based on the first compression format. The storage system compresses the decompressed records in a second compression format. The storage system stores the secondarily compressed records onto a storage medium.

Abstract: A computer-implemented method, system, and apparatus for storing binary data is disclosed. A processor receives a digital bit stream and transforms the digital bit stream to an encoded digital bit stream. The encoded digital bit stream comprises a data message encoded by an OCTS-expanded table for storage. The processor stores the encoded digital bit stream on a digital data storage device or system.

Abstract: The present disclosure relates to an encoder and an encoding method thereof, as well as a decoder and a decoding method thereof, which can be used to reduce the number of wires necessary for data transmission and transmit more data at a faster speed with the same number of wires, thereby improving the efficiency of data transmission. The encoder may comprises two input terminals configured to receive two input signals simultaneously, each input terminal comprises a wire identifying a positive voltage and a wire identifying a negative voltage; and a plurality of output terminals, wherein each output terminal comprises a wire identifying a positive voltage and a wire identifying a negative voltage, a combination of the two input signals corresponds to one of the plurality of output terminals, and the output terminal to which the current combination of the two input signals corresponds is configured to output signals through the two wires of the output terminal.

Abstract: A precoding matrix indicator (PMI) is determined for a user equipment or a base station, where the PMI corresponds to a precoding matrix W, and the precoding matrix W satisfies a first condition, a second condition, or a third condition; and the PMI is sent to a base station. The precoding matrix indicator can effectively control a beam, especially a beam shape and a beam orientation, in a horizontal direction and a perpendicular direction.

Abstract: A millimeter radio wave communication system. In a method for operating a base station (BS) in an analog/digital mixed BF system, an analog BF direction is determined. A digital BF precoder is determined for the determined analog BF direction. Digital BF precoding is performed using the digital BF precoder with respect to the determined analog BF direction. A DownLink Reference Signal (DL RS) is transmitted in the analog BF direction on which the digital BF precoding has been performed.

Abstract: A communication network implements a Universal Measurement and Calibration Protocol (XCP) policy. The communication network includes a plurality of nodes, each of the nodes being operably connected to a bus to send and to receive data communications to and from others of the plurality of nodes. Certain of the data communications include a Universal Measurement and Calibration Protocol (XCP) identifier indicating the presence of XCP protocol within the data frame. At least one of the nodes is configured to mitigate identified XCP protocol in accordance with the policy.

Abstract: A storing unit stores appearance information of the extracted word in correspondence with a specific record of the specific word in an index data when a specific word extracted from a target file is stored in a static dictionary that stores a plurality of words and a plurality of compressed codes corresponding respectively to the plurality of words, the appearance information including, existence information indicating whether the specific word exists in the target file or the appearance information indicating how many times the specific word has appeared in the target file. The storing unit stores adds a specific record of the specific word to the index data and stores the appearance information when the specific extracted word is not stored in the static dictionary and stored in a dynamic dictionary whose records are added in a course of compression.

Abstract: The embodiments described herein relate to managing compressed data to optimize file compression for efficient random access to the data. A first partition of a first data block of a compression group is compressed. The first compressed partition is stored in a first compression entity. An in-memory table is maintained, which includes updating the in-memory table with data associated with an address of the stored compressed first partition. At such time as it is determined that the first compression entity is full, the in-memory table is compressed and written to the first compression entity. Accordingly, the in-memory table, which stores partition compression data, is store with the compression entity.

Abstract: An arithmetic encoder is provided for converting an event sequence comprised of a plurality of events to an information sequence comprised of at least one information piece, and includes a core engine for receiving an event of the event sequence, and a probability estimate from a probability estimator, and generating zero or more pieces of the information sequence responsive to the received event and the probability estimate by bounding the ratio of events to information pieces. An arithmetic encoder is provided that is capable of constraining a number of events in at least one event sequence as a function of the number of generated information pieces in at least one information sequence.

Abstract: An electronic device dynamically generates a password for one-time only usage. The one-time password is constructed by placing, in a random sequential order: (i) several randomly chosen digits and (ii) several digits, which are randomly selected from personal identification numbers, which were previously provided by an authorized user. The current user of the device is presented with a natural-language password hint, which describes the sequence of digits in the password. Only the authorized user knows the personal identification numbers; and so is able to construct, on-the-fly, the one-time password, and present that password to the device. The password hint may be presented aloud, in audio form, and the password may be entered into the device via speech. If someone nearby hears the hint and/or the password, they cannot use it at a later time to gain device control or data access, since the password is only valid the one time.

Abstract: A normalization value calculator 12 calculates a normalization value that is representative of a predetermined number of input samples. A normalization value quantizer 13 quantizes the normalization value to obtain a quantized normalization value and a normalization-value quantization index corresponding to the quantized normalization value. An quantization-candidate calculator 14 subtracts a value corresponding to the quantized normalization value from a value corresponding to the magnitude of each of the samples to obtain a difference value and, when the difference value is positive and the value of each of the samples is positive, sets the difference value as an quantization candidate corresponding to the sample. When the difference value is positive and the value of each of the samples is negative, the quantization-candidate calculator 14 reverses the sign of the difference value and setting the sign-reversed value as an quantization candidate corresponding to the sample.

Abstract: A system for dictionary generation that can generate a set of candidate dictionaries based at least in part on subsets of content, where candidate dictionaries of the set of candidate dictionaries are generated based at least in part on a different subset of the content. The system can further use candidate dictionaries of the set of candidate dictionaries to compress the content and can identify one or more dictionary quality metrics for candidate dictionaries of the set of candidate dictionaries based at least in part on the respective compression of the content by candidate dictionaries of the set of candidate dictionaries.

Abstract: A computer-implemented method for generating code for real-time stream processing, where data is streamed in tuples. One or more processors receive source code which includes code to be applied in a sequential series to one or more tuples. Processor(s) generate the code for real-time stream processing by: buffering received time sequence tuples in a buffer; and converting the code to be sequentially applied to the one or more tuples into code for buffered tuples with a loop construct. Processor(s) also generate code for: checking that all tuples in a processing window have been buffered; and applying the converted code to each tuple in the processing window.