7740 results about "Array data structure" patented technology

Methods and apparatus are disclosed for generating and using an enhanced tree bitmap data structure in determining a longest prefix match, such as in a router, packet switching system. One implementation organizes the tree bitmap to minimize the number of internal nodes that must be accessed during a lookup operation. A pointer is included in each of the trie or search nodes to the best match so far entry in the leaf or results array which allows direct access to this result without having to parse a corresponding internal node. Moreover, one implementation stores the internal node for a particular level as a first element in its child array. Additionally, one implementation uses a general purpose lookup engine that can traverse multiple tree bitmaps or other data structures simultaneously, and perform complete searches, partial searches, and resume partial searches such as after receiving additional data on which to search.

A graphical user interface in which object thumbnails are rendered on a simulated three-dimensional surface which (i) exploits spatial memory and (ii) allows more objects to be rendered on a given screen. The objects may be moved, continuously, on the surface with a two-dimensional input device.

This invention relates to computer implemented methods for accommodating elements of an information array within the physical constraints of a predetermined two dimensional display space. The maldistribution and wastage of space inherent to matrix format display is sought to be minimized by allocating space based on moderated display space requirement values of larger elements. A measurement of lopsidedness of distribution of larger elements across columns and across rows is used while allocating column widths and row heights. If the display space is inadequate for displaying the array elements in matrix format, then the elements are displayed in Tall/Wall format wherein the row/column alignment of cells, respectively, is not maintained. The information array elements may include text, image or both. Methods such as font size reduction, text abbreviation and image size reduction are used in combination with space allocation methods to fit the array elements into corresponding cells in the display space.

In particular, this invention provides novel methods of populating data structures for use in evolutionary modeling. In particular, this invention provides methods of populating a data structure with a plurality of character strings. The methods involve encoding two or more a biological molecules into character strings to provide a collection of two or more different initial character strings; selecting at least two substrings from the pool of character strings; concatenating the substrings to form one or more product strings about the same length as one or more of the initial character strings; adding the product strings to a collection of strings; and optionally repeating this process using one or more of the product strings as an initial string in the collection of initial character strings.

QSecure Validation Service (QVS™) is part of the QSecure Suite and includes a CVQ Table Generator (QTG) for use with a QBox™ card personalizer. In general, the QVS/QVM compares dynamic CVQ token data fetched by an issuer authorization host from a transaction then occurring in the field. An array of acceptable CVQ values computed in real-time from the original keys and algorithms used by the QTG and QBox to personalize the particular card are applied in the comparison. There is an order to the CVQ values in such array, and the dynamic CVQ token data will step through these over time. Small deviations in the order actually received can normally occur for reasons other than fraud, so a moving window of acceptance is needed to cope with normal deviations. A running account of which CVQ values have already been used is maintained for, or by, the QVS, and these help predict where the acceptance window should next be positioned in the array of acceptable CVQ values.

Systems and methods are provided for writing code to access data arrays. One aspect provides a method of accessing a memory array. Data is provided within a one-dimensional array of allocated memory. A dimensional dynamic overlay is declared from within a block of statements, and the declaration initializes various attributes within an array attribute storage object. The data is accessed from within the block of statements as a dimensional indexed array using the array attribute storage object. Another aspect provides a method of creating and accessing a dimensional dynamic array. A dimensional dynamic array is declared from within a block of statements, and memory storage for the array is dynamically allocated. A dynamic overlay storage object is also provided and its attributes are initialized from the dynamic array declaration. The data is accessed as a dimensional indexed array from within the block of statements using the array attribute storage object.

A novel solution for fast packet classification includes a novel data structure to store classifier rules which enables fast packet classification, which structure employs bitmaps for each field of the incoming packet for which classification is desired. A fast packet classification algorithm using the novel data structure allows the matching rule with the highest priority to be quickly obtained. A novel rule update algorithm allows new classifier rules to be added into the data structure incrementally. In one practical implementation of a classification engine employing the structures and algorithms of the present invention, a configurable processor with customized instructions is used to accelerate packet classification.

Disclosed is a system, method, and program for generating a data structure in computer memory for storing strings, such as words in a dictionary. Each string includes at least one character from a set of characters. An arrangement of nodes is determined to store the characters such that the arrangement of the nodes is capable of defining a tree structure. An array data structure is generated to store the nodes. The array includes a row for each node and a column for each character in the set of characters. A non-empty cell identifies a node for the character indicated in the column of the cell that has descendant nodes in the row indicated in the cell content for the node. The array data structure is processed to eliminate at least one row in the array data structure to reduce a number of bytes needed to represent the array data structure. In this way, the array data structure following the processing requires less bytes of storage space then before the processing.

Techniques for representing nodes of tries. Associated with the nodes are keys and rules. A node of a trie having a stride n>1 is represented by a trie having a stride of 1 and the stride 1 trie is represented by a bit string termed a structural enumeration. The structural enumeration has a bit for each node of the trie of stride 1. If the node has a key and rule associated with it, the bit is set; otherwise it is not. The representation of a node of stride n>1 includes the node's structural enumeration and an array of rule pointers. The array has an entry for each rule associated with the node and the entries have the same order in the array as the set bits for their keys in the structural enumeration. Nodes having large strides may be represented by subdividing them into subtries.

Methods and apparatus for analyzing tasks performed by computer users by (i) gathering usage data, (ii) converting logged usage data into a uniform format, (iii) determining or defining task boundaries, and (iv) determining a task analysis model by "clustering" similar tasks together. The task analysis model may be used to (i) help users complete a task (such help, for example, may be in the form of a gratuitous help function), and/or (ii) to target marketing information to users based on user inputs and the task analysis model. The present invention also provides a uniform semantic network for representing different types of objects in a uniform way.

A method and system for mapping a number of characters in a string, wherein the string comprises a combination of characters representing indexed expressions and a combination of characters representing non-indexed expressions. One embodiment produces a weight array that can be utilized to compare a first and second string having indexed and non-indexed expressions. In one embodiment, a method generates a set of special weights for characters that represent indexed and non-indexed expressions. The method then associates a weight value of an indexed expression with the specific group of characters representing a specific non-indexed expression, and generates a weight array by retrieving a plurality of special weights associated with the specific group of characters representing the specific non-indexed expression and the associated weight value of the indexed expression.

A 3D memory device includes a plurality of ridge-shaped stacks, in the form of multiple strips of conductive material separated by insulating material, arranged as bit lines which can be coupled through decoding circuits to sense amplifiers. Diodes are connected to the bit lines at either the string select of common source select ends of the strings. The strips of conductive material have side surfaces on the sides of the ridge-shaped stacks. A plurality of word lines, which can be coupled to row decoders, extends orthogonally over the plurality of ridge-shaped stacks. Memory elements lie in a multi-layer array of interface regions at cross-points between side surfaces of the semiconductor strips on the stacks and the word lines.

Methods, data structures, and systems provide techniques for processing track logs. A track log is represented as a plurality of track points. The track points represent geographic positions previously traversed. The track log and the track points are overlaid on a map and presented on a display in communication with a portable navigation device. Track points are graphically selected and identified via the display. Any graphically selected track point is also associated with a selectable operation for immediate, automatic, and/or subsequent execution on the portable navigation device.

Methods, systems, and computer-readable media of columnar storage of a database index are disclosed. A particular columnar index includes a column store that stores rows of the columnar index in a column-wise fashion and a delta store that stores rows of the columnar index in a row-wise fashion. The column store also includes an absence flag array. The absence flag array includes entries that indicate whether certain rows have been logically deleted from the column store.

An exemplary embodiment includes partitioning a data message to be communicated from a first data site to a second data site into data chunks; generating a data chunk identifier for each data chunk; determining whether the data chunks are stored at the second data site; when at least one data chunk is not stored at the second data site, adding the data chunk identifier for each data chunk not stored at the second data site to a data structure at the first data site; sending a transformed data message from the first date site to the second data site; wherein, when at least one data chunk is already stored at the second data site, rather than including that data chunk, the transformed data message instead includes at least one tuple to enable the data message to be reconstructed at the second data site without sending the previously stored data chunk, the transformed data message also includes each data chunk not stored at the second data site.