Abstract: A social networking system recommends pages or other objects to a user with which the user may establish a connection to receive content associated with an object. Candidate objects may be identified by the social networking system as objects connected to additional users who are connected to an object connected to the user. To recommend objects with which the user is likely to have an interest, the social networking system extracts one or more topics from the object connected to the user and from various candidate objects. Based on a topic graph, the social networking system determines measures of relatedness between topics extracted from various candidate objects and an object connected to the user. The measures of relatedness are then used to select one or more of the candidate objects to identify to the user.

Abstract: In one embodiment, a method includes receiving a query, identifying one or more nodes of a plurality of second nodes corresponding to the query, calculating a score for each of the identified nodes using a probabilistic ranking model that scores each node based at least in part on a number of edges connecting the node to one or more nodes within a first set of user nodes that includes the first node and user nodes corresponding to second users sharing one or more user attributes with the first user, and generating corresponding search results. The score calculated for each of the identified nodes may bias the search results toward nodes connected to disproportionately more nodes in the first set of user nodes than nodes in the plurality of second nodes that correspond to an overall population of users of the online social network.

Abstract: In one embodiment, a method includes receiving a query, determining a user bias of a first user of an online social network from a first node corresponding to the first user and a plurality of user nodes corresponding to a plurality of second users sharing one or more user attributes with the first user, identifying nodes of a plurality of second nodes based at least in part on the user bias of the first user, where the identified nodes correspond to the structured query, and generating search results corresponding to the identified nodes. The bias may be determined by identifying a candidate user node of the second nodes, comparing a first user attribute of the first node to a second user attribute of the candidate user node, and including the candidate user node in the user nodes when the first user attribute matches the second user attribute.

Abstract: Embodiments are directed to indexing and querying a sequence of hash values in an indexing matrix. A computer system accesses a document to extract a portion of text from the document. The computer system applies a hashing algorithm to the extracted text. The hash values of the extracted text form a representative sequence of hash values. The computer system inserts each hash value of the sequence of hash values into an indexing matrix, which is configured to store multiple different hash value sequences. The computer system also queries the indexing matrix to determine how similar the plurality of hash value sequences are to the selected hash value sequence based on how many hash values of the selected hash value sequence overlap with the hash values of the plurality of stored hash value sequences.

Abstract: Exemplary methodology, procedure, system, method and computer-accessible medium can be provided for authenticating a non-digital medium of a physical object, by receiving at least one image of video of at least one marked or unmarked region, and comparing the first microscopic image or video of at least one marked or unmarked region with at least one second microscopic image or video relating to the non-digital medium to determine if a similarity between the first and second microscopic images or videos matches or exceeds a predetermined amount.

Abstract: An exemplary methodology, procedure, system, method and computer-accessible medium can be provided for authenticating a portion of a non-digital medium for a document, by receiving at least one image of at least one first marked portion of the non-digital medium for the document, extracting at least one first speckle pattern of the at least one first marked portion, and comparing the first speckle pattern of the at least one first marked portion with at least one second speckle pattern relating to the non-digital medium to determine if a similarity between the first and second speckle patterns equals or exceeds a predetermined amount.

Abstract: The present invention extends to methods, systems, and computer program products for decomposing and merging regular expressions. Embodiments of the invention decompose a regular expression into multiple simple keyword graphs, merge those keyword graphs in a compact and efficient manner, and produce a directed acyclic graph (DAG) that can execute a simplified regular expression alphabet. Several of these regular expression DAG's can then be merged together to produce a single DAG that represents an entire collection of regular expressions. DAGs along with other text processing algorithms and a heap collection can be combined in a multi-pass approach to expand the regular expression alphabet.

Abstract: Embodiments are directed to indexing and querying a sequence of hash values in an indexing matrix. A computer system accesses a document to extract a portion of text from the document. The computer system applies a hashing algorithm to the extracted text. The hash values of the extracted text form a representative sequence of hash values. The computer system inserts each hash value of the sequence of hash values into an indexing matrix, which is configured to store multiple different hash value sequences. The computer system also queries the indexing matrix to determine how similar the plurality of hash value sequences are to the selected hash value sequence based on how many hash values of the selected hash value sequence overlap with the hash values of the plurality of stored hash value sequences.

Abstract: An apparatus for providing a high level mobile virtual machine may include at least one processor and at least one memory including computer program code. The at least one memory and the computer program code may be configured to, with the at least one processor, cause the apparatus to perform at least maintaining a record, at a service platform, of service software versions employed at one or more virtual machines, providing a service software upgrade from the service platform to at least one of the one or more virtual machines, and tracking which of the one or more virtual machines employs the service software upgrade. A corresponding method and computer program product are also provided.

Abstract: An exemplary methodology, procedure, system, method and computer-accessible medium can be provided for authenticating a portion of a non-digital medium for a document, by receiving at least one image of at least one first marked portion of the non-digital medium for the document, extracting at least one first speckle pattern of the at least one first marked portion, and comparing the first speckle pattern of the at least one first marked portion with at least one second speckle pattern relating to the non-digital medium to determine if a similarity between the first and second speckle patterns equals or exceeds a predetermined amount.

Abstract: A mechanism for managing data communications is provided. A circularly arranged set of buckets is disposed between input buffers and output buffers in a networked computer system. Connections among the system and clients are stored in the buckets. Each bucket in the set is successively examined, and each connection in the bucket is polled. During polling, the amount of information that has accumulated in a buffer associated with the connection since the last poll is determined. Based on the amount, a period value associated with the connection is adjusted. The connection is then stored in a different bucket that is generally identified by the sum of the current bucket number and the period value. Polling continues with the next connection and the next bucket. In this way, the elapsed time between successive polls of a connection automatically adjusts to the actual operating bandwidth or data communication speed of the connection.

Abstract: A multiple opening sleeve valve is provided with a gate movable to control flow or pressure without the need for axial movement of a component through a pressure-containing seal. A gate actuator can include a drive rod and nut coupled to a gate substantially internal to the valve housing without the need for grease or similar external lubrication. The valve can provide for relatively high in-line gate-moving force, a reduction in force or torque requirements for operation, increased ease of wear-part replacement and decreased overall valve length, compared to previous valve configurations of comparable size or capacity.

Abstract: A multiple opening sleeve valve is provided with a gate movable to control flow or pressure without the need for axial movement of a component through a pressure-containing seal. A gate actuator can include a drive rod and nut coupled to a gate substantially internal to the valve housing without the need for grease or similar external lubrication. The valve can provide for relatively high in-line gate-moving force, a reduction in force or torque requirements for operation, increased ease of wear-part replacement and decreased overall valve length, compared to previous valve configurations of comparable size or capacity.

Abstract: A method and apparatus for managing data communications is provided. A circularly arranged set of buckets is disposed between input buffers and output buffers in a networked computer system. Connections among the system and clients are stored in the buckets. Each bucket in the set is successively examined, and each connection in the bucket is polled. During polling, the amount of information that has accumulated in a buffer associated with the connection since the last poll is determined. Based the amount, a period value associated with the connection is adjusted. The connection is then stored in a different bucket that is generally identified by the sum of the current bucket number and the period value. Polling continues with the next connection and the next bucket. In this way, the elapsed time between successive polls of a connection automatically adjusts to the actual operating bandwidth or data communication speed of the connection.

Abstract: A switching network incorporates expander graphs such as multibutterflies but avoids the wiring complications resulting from the randomness of such graphs. The network includes metanodes, each having plural routers. Channels of multiple interconnections are connected between the metanodes according to an upper level expander graph. Interconnections within the channels are randomly connected. Interconnections on the channels may be time multiplexed and they may be dynamically assigned to routers within a metanode.

Abstract: A technique for organizing graphical objects in a graphics database that facilitates the rapid selection of one or more graphical objects on a computer display screen. Graphical objects are stored in the graphics database using a spatially organized data structure. The spacially organized data structure is formed by recursively subdividing the graphics space until each subspace contains no more than a predetermined number of graphical objects. The spacially organized database is ideally suited for spacial queries required to select, based on visual criteria, graphical objects appearing on a display screen. Graphical objects may be selected in response to a cursor moving about a display screen under programmer control, or in response to a system request to identify one or more objects spacially located in a given portion of the graphics space.