Abstract: The invention features compositions and methods for treating and preventing cancer. In one aspect, isolated fusion proteins are provided that comprise a DNAJBI portion and a PRKACA portion. In a further aspect, compositions are provided, including immunogenic compositions that comprise an isolated fusion protein comprising a DNAJBI portion and a PRKACA portion. In a yet further aspect, a cancer vaccine is provided that comprises an isolated fusion protein comprising a DNAJBI portion and a PRKACA portion.

Abstract: A method and system are provided for adaptive evaluation of meta-relationships in semantic graphs. The method includes providing a semantic graph based on a knowledge base in which concepts in the form of graph nodes are linked by semantic relationships in the form of graph edges. Metadata are encoded in the edges and nodes of the semantic graph, of weightings for measuring a meta-relationship, wherein the meta-relationship applies to the concepts of the semantic graph and is independent of the semantic relationship defined by the edges of the semantic graph. A graph activation is carried out for an input context relating to one or more concepts of the semantic graph, wherein the weightings are applied to a spreading activation signal through the semantic graph to produce a measure of the meta-relationship for a sub-set of concepts of the semantic graph.

Abstract: A method and system are provided for adaptive evaluation of meta-relationships in semantic graphs. The method includes providing a semantic graph based on a knowledge base in which concepts in the form of graph nodes are linked by semantic relationships in the form of graph edges. Metadata are encoded in the edges and nodes of the semantic graph, of weightings for measuring a meta-relationship, wherein the meta-relationship applies to the concepts of the semantic graph and is independent of the semantic relationship defined by the edges of the semantic graph. A graph activation is carried out for an input context relating to one or more concepts of the semantic graph, wherein the weightings are applied to a spreading activation signal through the semantic graph to produce a measure of the meta-relationship for a sub-set of concepts of the semantic graph.

Abstract: Method and system are provided for adaptive evaluation of meta-relationships in semantic graphs. The method includes providing a semantic graph based on a knowledge base in which concepts in the form of graph nodes are linked by semantic relationships in the form of graph edges. Metadata is encoded in the edges and nodes of the semantic graph, of weightings for measuring a meta-relationship, wherein the meta-relationship applies to the concepts of the semantic graph and is independent of the semantic relationship defined by the edges of the semantic graph. A graph activation is carried out for an input context relating to one or more concepts of the semantic graph, wherein the weightings are applied to a spreading activation signal through the semantic graph to produce a measure of the meta-relationship for a sub-set of concepts of the semantic graph.

Abstract: Method and system are provided for adaptive evaluation of meta-relationships in semantic graphs. The method includes providing a semantic graph based on a knowledge base in which concepts in the form of graph nodes are linked by semantic relationships in the form of graph edges. Metadata is encoded in the edges and nodes of the semantic graph, of weightings for measuring a meta-relationship, wherein the meta-relationship applies to the concepts of the semantic graph and is independent of the semantic relationship defined by the edges of the semantic graph. A graph activation is carried out for an input context relating to one or more concepts of the semantic graph, wherein the weightings are applied to a spreading activation signal through the semantic graph to produce a measure of the meta-relationship for a sub-set of concepts of the semantic graph.

Abstract: Disclosed is a computer implemented method, computer program product, and apparatus to decorate visible attributes of a rendered avatar. A server may collect a first user profile of a first avatar, the first user profile having at least one interest of a user. Next, the server may receive a location of the first avatar, wherein the location is associated with a view to at least a second avatar. The server can identify the second avatar among a group of avatars visible with respect to the first avatar. Further, the server may read a target profile of the second avatar then determine whether the second user profile satisfies a criterion based on the first user profile and the target profile. In addition, the server may render a modified rendered avatar to a client, responsive to the determination that the target profile satisfies the criterion.

Abstract: Disclosed is a computer implemented method, computer program product, and apparatus to decorate visible attributes of a rendered avatar. A server may collect a first user profile of a first avatar, the first user profile having at least one interest of a user. Next, the server may receive a location of the first avatar, wherein the location is associated with a view to at least a second avatar. The server can identify the second avatar among a group of avatars visible with respect to the first avatar. Further, the server may read a target profile of the second avatar then determine whether the second user profile satisfies a criterion based on the first user profile and the target profile. In addition, the server may render a modified rendered avatar to a client, responsive to the determination that the target profile satisfies the criterion.

Abstract: Illustrative embodiments provide a computer implemented method, a data processing system and a computer program product for locating contact information in a mobile phone network within a social network. In one embodiment, the computer implemented method permits reciprocal access between a first user's contact information and a second user's contact information by a first user device and a second user device, and permitting reciprocal access between the second user's contact information and a third user's contact information by the second user device and a third user device. The computer implemented method receives a request from the third user device to contact the first user device, wherein the first user contact information is unknown to the third user and issues a search on the mobile phone network, from the third user device, for the first user contact information.

Abstract: A method and apparatus is disclosed for representing data available in a peer-to-peer network of processing nodes. In one arrangement, respective Bloom-Filters may be formed at the nodes as a function of data available via the nodes. The Bloom-filters may be communicated between peer-to-peer coupled nodes of the peer-to-peer network that have formed connections using incentive-based criteria to control whether one node connects to another node. A search expression may be formed for locating a data object, and nodes selected as a function of the Bloom-filters and the incentive-based criteria. The search expression may be propagated to the selected nodes, and the result of the search expression output from nodes that satisfy the search expression.