Abstract: Longest Prefix Match (LPM) is implemented using a binary tree based search algorithm. Masked entries are stored in a plurality of binary search engines, wherein each of the binary search engines stores masked entries of a corresponding mask length. A search value is applied to each of the binary search engines in parallel. The search value is masked within each of the binary search engines, thereby creating a plurality of masked search values, each having a masked length equal to the mask length of the corresponding binary search engine. Each of the masked search values is compared with the masked entries of the corresponding binary search engine. An LPM result is selected from the binary search engine that detects a match, and has the longest corresponding mask length. Alternately, each binary search engine stores masked entries of N mask lengths, and N consecutive comparisons are performed to identify the LPM.

Abstract: Dynamic aliasing of multi-valued binary attributes in a directory. A plurality of binary attribute-values are stored in the directory that in the aggregate form the multi-valued binary attribute. For each binary attribute-value, there is stored metadata describing characteristics of the binary attribute-value with which it is associated. A preference is received from a user of the directory, the preference being based on the characteristics of the multi-valued binary attribute. The preference is associated with at least one binary attribute-value. A set of multi-valued binary attribute-values are associated for the user based on the preference received from the user and the set of multi-valued binary attribute-values are accessed.

Abstract: Provided is a control device including: a storage portion for storing binary data transmitted from outside and received successively; and a control portion for carrying out processing including: production processing of producing a frame where of the stored binary data, pieces of data expressing events occurring in a predetermined period are placed into a group among which pieces of data expressing events each having a small degree of variation are arranged so as to be close to each other; difference computing processing of arranging the frames produced at intervals of the predetermined time in a predetermined order and of computing a difference between two adjacent frames; compression processing of compressing a result of the computation by a run length method; and recording processing of recording, to a recording portion, a first frame in the difference computing processing, a number of difference computations, and the compressed data.

Abstract: A system is described for providing a configurable adaptor for mediating systems. The system may include a memory, an interface, and a processor. The memory may store an interaction item, a data mapping, data schemas and binary representations of the data schemas. The interface may communicate with a first system, a second system, and a device. The processor may identify the interaction item describing an interaction between the systems. The processor may generate and process a first and second data schema to generate binary representations of the schemas. The processor may generate a data mapping referencing the binary representations to describe a data transformation between the data formats of the first and second systems. The processor may deploy the binary representations, the data mapping, and the interaction item to a device to enable the device to maintain interaction state, and communicate properly formatted messages between the first and second systems.

Abstract: A device, system, and method are directed towards sorting a set of string or binary data items. A segment of a fixed size from each data item is combined with a pointer to the data item in a word. The words are sorted, and words having equivalent string/binary segments are grouped together. The groups are recursively sorted until no groups remain or the end of the string or binary data in a group is sorted. Methods of the invention include determining a segment size based on a size of a pointer item and a word size, so that a segment and a pointer fit within a word, allowing comparisons and data manipulation to be performed on words.

Abstract: Systems and methods for creating metadata are provided in which electronic evidence is captured, the electronic evidence comprising a binary large object, extrinsic metadata, and intrinsic metadata. The extrinsic metadata and the intrinsic metadata are extracted from the captured electronic evidence. The extrinsic metadata, intrinsic metadata, or user-defined metadata, or any combination thereof are dynamically associated with the binary large object. At least one operation is performed on the binary large object, wherein the operation is determined by the associated extrinsic metadata, associated intrinsic metadata, or associated user-defined metadata.

Abstract: A security architecture has an event analysis engine that acquires several tangible actions. The occur in an action space of an organization, and relate to unauthorized access to assets and reproduction of information. The event analysis engine evaluates the acquired actions based on the information stored in the database and in the context of past actions which have occurred, and determines a suitable response to the acquired action based on the evaluation.

Abstract: An associated between a data type and a user interface (UI) element such as a Page and/or Panel, and a data type allows dynamic determination of application flow including menu and menu items. This may allow a dynamic determination of all target UI elements to which an end user may navigate from a source UI element, that are capable of displaying the same record of information represented in the source UI element or a related record of information.

Abstract: A method for decomposing textual contents of a web page using Search Tree technology, wherein binary search trees accelerate analysis of text to thereby determine if a word matches words and phrases which are associated with one or more categories of content, wherein scores are given to words using the first or the second method according to the degree of correlation to categories, and wherein a total score for any category exceeding a user selectable threshold assigns a web page to one or more categories, and wherein categories that are exceeded will cause an Internet filter to take an appropriate action, such as blocking access to or providing a warning when accessing a web page.