Abstract: Systems and methods are provided for ranking electronic information based on determined similarities. In one aspect a set of unique features are determined from a collection of electronic objects. A graph is constructed in which electronic object are represented as object nodes and determined features are represented as feature nodes. The object nodes are interconnected by a weighted edge to at least one feature node. Scores for the object nodes and the feature nodes are computed using a determined set of anchor nodes and a determined weighted adjacency matrix. The object nodes and the feature nodes of the graph are ranked and displayed based on the computed scores. In one aspect, the scores and the ranks for the object nodes and the feature nodes are dynamically updated and displayed based on user preferences.

Abstract: Techniques are provided for anonymizing data in a data stream.

Abstract: The backup-in-the-middle primary-backup configuration is created by placing a backup-in-the-middle forwarder in the routing path between the primary and the environment. The backup-in-the-middle forwarder intercepts output messages along with required state information sent by the primary to the environment. The backup-in-the-middle forwarder backs up the primary by updating its state information and forwards the output packets to the environment.

Abstract: A first circuit representation of a given function is obtained at a first processing device. The given function comprises at least two computer programming switch statement clauses. A second circuit representation is generated at the first processing device from the first circuit representation wherein the at least two computer programming switch statement clauses are respectively represented by at least two tree circuits that are embedded in the second circuit representation such that the second circuit representation is characterized by a given cost (e.g., a minimum cost). The second circuit representation is encrypted at the first processing device, and sent to a second processing device for secure evaluation of the given function by the second processing device.

Abstract: Techniques are provided for anonymizing data in a data stream.

Abstract: A first circuit representation of a given function is obtained at a first processing device. The given function comprises at least two computer programming switch statement clauses. A second circuit representation is generated at the first processing device from the first circuit representation wherein the at least two computer programming switch statement clauses are respectively represented by at least two tree circuits that are embedded in the second circuit representation such that the second circuit representation is characterized by a given cost (e.g., a minimum cost). The second circuit representation is encrypted at the first processing device, and sent to a second processing device for secure evaluation of the given function by the second processing device.

Abstract: Techniques are provided for anonymizing streamed data. In various embodiments, data are anonymized by receiving a data element of a data stream including a plurality of said data elements (pi, si), where pi comprises an identifying portion and si comprises an associated sensitive information portion; obtaining a partitioned space S including t regions; assigning the identifying portion, pi, to a selected region; encrypting the associated sensitive information si as e(si); and storing the encrypted associated sensitive information e(si) in a list associated with the selected region but not storing the associated identifying portion, pi, in the list. The regions have corresponding center points, and a nearest center to pi is optionally determined. The encrypted associated sensitive information e(si) may be stored in a list associated with the nearest center.

Abstract: Methods and apparatus are provided with improved routing techniques for bifurcated flows. Routing methods and apparatus are provided that obtain a fractional flow from a set of nodes to a given destination having a maximum load, L, on any link between a node in the set and the given destination; and generate a bifurcated flow between the set of nodes and the given destination from the fractional flow such that the maximum load on any link in the bifurcated flow does not exceed 2L, wherein the bifurcated flow allows a flow from a given node to be sent on at most two outgoing links. The fractional flow can be, for example, a fractional single-sink multicommodity flow.

Abstract: Techniques are provided for anonymizing streamed data. In various embodiments data are anonymized by receiving a data element (pi, si) of a data stream, where pi comprises an identifying portion and si comprises associated sensitive information; assigning the identifying portion, pi, to a region Si of a partitioned space S; encrypting the associated sensitive information si as e(si); and storing the encrypted associated sensitive information e(si) in a list associated with the assigned region Si. Optionally a permutation function ? randomizes the order that regions S1, S2, . . . , St in the partitioned space S are stored so that an adversary cannot obtain information by observing the data being stored in particular regions. The regions S1, S2, . . . , St have corresponding center points C1, C2, . . . , Ct, and a nearest center Ci to pi is optionally determined. The encrypted associated sensitive information e(si) may be stored in a list associated with the nearest center Ci.

Abstract: Undirected cross connects are provided based on wavelength-selective switches. An undirected Cantor network is disclosed where the switch nodes are wavelength selective switches. An undirected Clos cross connect is also disclosed where one or more undirected switches are undirected Cantor networks having at least one wavelength selective switch.

Abstract: A primary-backup replication capability is disclosed. A primary process and a backup process participate in a synchronization process configured to synchronize state information of the primary and backup processes. The synchronization process operates in periods of time referred to as epochs. During the current epoch, the primary process computes state update information representing changes to the state information of the primary process since a previous epoch, and also buffers output messages generated during the current epoch in an associated output buffer dedicated for use in the current epoch. The primary process initiates a new epoch independent of receiving, from the backup process, a state update acknowledgement for the previous epoch. The output messages buffered for the current epoch are released from the associated output buffer after the primary process receives a state update acknowledgment for the current epoch and all output buffers of all previous epochs are empty.

Abstract: A primary-backup replication capability is disclosed. A primary process and a backup process participate in a synchronization process configured to synchronize state information of the primary and backup processes. The synchronization process operates in periods of time referred to as epochs. During the current epoch, the primary process computes state update information representing changes to the state information of the primary process since a previous epoch, and also buffers output messages generated during the current epoch in an associated output buffer dedicated for use in the current epoch. The primary process initiates a new epoch independent of receiving, from the backup process, a state update acknowledgement for the previous epoch. The output messages buffered for the current epoch are released from the associated output buffer after the primary process receives a state update acknowledgment for the current epoch and all output buffers of all previous epochs are empty.

Abstract: The backup-in-the-middle primary-backup configuration is created by placing a backup-in-the-middle forwarder in the routing path between the primary and the environment. The backup-in-the-middle forwarder intercepts output messages along with required state information sent by the primary to the environment. The backup-in-the-middle forwarder backs up the primary by updating its state information and forwards the output packets to the environment.

Abstract: Undirected cross connects are provided based on wavelength-selective switches. A undirected Cantor network is disclosed where the switch nodes are wavelength selective switches. A undirected Clos cross connect is also disclosed where one or more undirected switches are undirected Cantor networks having at least one wavelength selective switch.

Abstract: Undirected cross connects are provided based on wavelength-selective switches A demand d={i, j} is routed over a path pd between ports i and j in a multi-layer network based on one or more wavelength selective switches, by determining a middle layer node n in the multi-network for which there is a first path pi between the port i and the middle layer node n and a second path pj between the port j and the middle layer node n; identifying a node n?, wherein the node n? is a first node starting from port i that path pi shares with path pj; and concatenating the path pd comprised of a subpath p?i of the first path pi from the port i to the node n? with a subpath of p?j of the second path pi from the node n? to the port j. An undirected Cantor network is disclosed where the switch nodes are wavelength selective switches. An undirected Clos cross connect is also disclosed where one or more undirected switches are undirected Cantor networks having at least one wavelength selective switch.

Abstract: Undirected cross connects are provided based on wavelength-selective switches A demand d={i, j} is routed over a path pd between ports i and j in a multi-layer network based on one or more wavelength selective switches, by determining a middle layer node n in the multi-network for which there is a first path pi between the port i and the middle layer node n and a second path pi between the port j and the middle layer node n; identifying a node n?, wherein the node n? is a first node starting from port i that path pi shares with path pj; and concatenating the path pd comprised of a subpath pi? of the first path pi from the port i to the node n? with a subpath of p?j of the second path pi from the node n? to the port j. An undirected Cantor network is disclosed where the switch nodes are wavelength selective switches.

Abstract: Methods and apparatus are provided with improved routing techniques for bifurcated flows. Routing methods and apparatus are provided that obtain a fractional flow from a set of nodes to a given destination having a maximum load, L, on any link between a node in the set and the given destination; and generate a bifurcated flow between the set of nodes and the given destination from the fractional flow such that the maximum load on any link in the bifurcated flow does not exceed 2L, wherein the bifurcated flow allows a flow from a given node to be sent on at most two outgoing links.

Abstract: A method for recognizing a table structure from delineated table region in an electronic document using hierarchical clustering of data strings. The cluster groupings are segregated effectively using the distances from a positional vector associated with words and groups of words rather than a minimum number of blank spaces between words. Once a data tree of the hierarchical clusterings is constructed, the tree is scanned downward from the root to find appropriate column boundaries using a columnization algorithm. Then using successive heuristic algorithms, determine column and row headers and row boundaries.

Abstract: A method for recognizing a table structure from delineated table region in an electronic document using hierarchical clustering of data strings. The cluster groupings are segregated effectively using the distances from a positional vector associated with words and groups of words rather than a minimum number of blank spaces between words. Once a data tree of the hierarchical clusterings is constructed, the tree is scanned downward from the root to find appropriate column boundaries using a columnization algorithm. Then using successive heuristic algorithms, determine column and row headers and row boundaries.

Abstract: A handwritten test symbol, such as an alphabetic character, a word or a signature, written on a digitizing tablet is normalized by comparison with a model symbol to determine the transformation necessary to best fit the test symbol to the model symbol. Such transformation is then applied to normalize the test symbol. Shape information in the test symbol is preserved during such normalization. In accordance with one aspect of the invention, the model symbol is a line segment. In accordance with another aspect of the invention, the model symbol is an example of the symbol being normalized. Such normalization can be used as a preprocessing step in applications such as character recognition, text recognition or signature verification.