Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for generating a context-based rich communication log. A system configured to practice the method performs a context-based analysis of a history of communication sessions over at least two communication modalities, wherein the context-based analysis considers semantic meaning, temporal relationship, and user activities. The system generates associations between the communication sessions based on the context-based analysis, and generates the context-based rich communication log based on the associations. The context-based analysis can be based on time, session participant identifications, ongoing events, and/or on-demand queries of the communication sessions. The system can then present the context-based rich communication log to a user.

Abstract: A method for managing communication in a peer-to-peer network in which overlay information is updated on-demand such that neighboring node information is updated at least periodically and other overlay information is updated on-demand (from standard communications). For example, in one aspect, the network includes a plurality of nodes, and the method includes sending a leaving message from a leaving node to the predecessor and successor nodes of the leaving node, the leaving message including information relating to the leaving node, updating each of the predecessor and successor nodes exclusive of any other nodes of the plurality of nodes.

Abstract: A method of authentication of peers of a peer-to-peer network includes a certificate issuer tracking at most a predetermined number of node IDs for each peer on the peer-to-peer network, a requesting peer requesting from the certificate issuer a certificate for authenticating a communicating peer and each certificate issued listing at least one node ID of the predetermined number of node IDs assigned for the communicating peer.

Abstract: The present disclosure provides mechanisms for verification of mapping from one type of network address to another type of network address based on delivery of a one-time key over one type of the network and confirmation of its receipt over another type of network. A particular example of such mapping is mapping from a telephone number used in the PSTN or the like to a VoIP address such as a SIP URI. The mapping verification mechanisms can be provided without dependence on the records of past calls, manual calling, or the line information database in the PSTN system. Accordingly, a highly secure and efficient mapping verification mechanism is realized.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for providing predictive contacts. A system configured to practice the method first analyzes a communication history and a current usage context of a user. Based on the analysis, the system ranks contacts that the user is likely to communicate with from a list of contacts to yield ranked contacts. The system identifies a respective motive for ranking each contact, and presents a predictive list of contacts based at least in part on the ranked contacts, wherein each ranked contact in the predictive list of contacts includes at least part of the respective motive. The system can update the predictive list of contacts in real time as the current usage context changes. The communication history can include, for example, emails, instant messages, phone calls, video conferences, and calendar events. The motive can include a user interaction history with a particular contact.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for predicting the subject, logistics, and resources of associated with a communication event. Predictions and suggestions can occur prior to, during, or in response to communication events. The user can confirm the prediction or suggestion via user input such as a click or a voice command. The system can analyze past behavior patterns with respect to the subject, logistics and resources of communication events, followed by preparing ranked listings of which subjects, logistics, and resources are most likely to be used in a given situation. The predicted logistics may then include people to invite, time and date of the meeting, its duration, location, and anything else useful in helping potential participants gather together. The resources may include files attached, files used, communication event minutes, recordings made, Internet browsers and other programs which may be utilized by the user.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for providing just-in-time resources based on context. A system configured to practice the method identifies a communication event associated with a user and a current context associated with the communication event and the user, and identifies a stored context that corresponds to the current context, wherein the stored context includes at least one resource. The system then retrieves the at least one resource and presents the at least one resource to the user. In another method for storing a current context, the system identifies a current communication context, identifies resources associated with the current communication context, indexes the current communication content and resources to enable searchability, and stores, as a stored context in a database, the current communication context and the resources associated with the current communication context.

Abstract: Disclosed herein are systems, methods, and non-transitory computer-readable storage media for scheduling an event to automatically join a user to a conference call. In one aspect, the method includes receiving an invitation for a user to join a conference call, extracting from the invitation a scheduled conference call time, conference call address information, conference call authentication information, and a conference call modality, and scheduling an event to join the user to the conference call via the conference call modality at the scheduled conference call time based on the conference call address information and the conference call authentication information. In another aspect, the system retrieves a scheduled event at a scheduled time, extracts the address, authentication, and modality information for the conference, and joins the user to the conference automatically at the scheduled time.

Abstract: A method for managing communication in a peer-to-peer network in which overlay information is updated on-demand such that neighboring node information is updated at least periodically and other overlay information is updated on-demand (from standard communications). For example, in one aspect, the network includes a plurality of nodes, and the method includes sending a leaving message from a leaving node to the predecessor and successor nodes of the leaving node, the leaving message including information relating to the leaving node, updating each of the predecessor and successor nodes exclusive of any other nodes of the plurality of nodes.

Abstract: A method for managing communication in a peer-to-peer network in which overlay information is updated on-demand such that neighboring node information is updated at least periodically and other overlay information is updated on-demand (from standard communications). For example, in one aspect, the network includes a plurality of nodes, and the method includes looking up at least one neighboring node, sending a joining message from a joining node to the neighboring node, the joining message including information relating to the joining node, joining the joining node to the network by updating each neighboring node exclusive of any other nodes of the plurality of nodes, sending reply messages from each neighboring node to the joining node, and updating the joining node with information from each neighboring node, exclusive of any other nodes of the plurality of nodes.

Abstract: A message system for a peer-to-peer network stores messages or message fragments at multiple peers when a called peer is off-line. The replicated messages or message fragments may be encrypted. According to a pull model, the called peer polls other peers to which it has access when it comes on-line to determine if a message is waiting. According to a push model, the peers storing the message from the calling peer notify the called peer when it comes on line. The system may employ a single level where only message data is stored or two levels where the primary level holds the address of peers that contain the message data which forms the secondary level.

Abstract: Security mechanisms are disclosed that protect the integrity of the candidate access node discovery procedures in a mobile communication network. In accordance with an aspect of the invention, an access node stores information on candidate access nodes in the mobile communication network and updates the information only after verifying information provided by a mobile terminal after a handoff from one access node to another access node. In accordance with another aspect of the invention, the information on candidate access nodes in the mobile communication network are associated with a particular mobile terminal and stored at the mobile terminal in a candidate access node list.

Abstract: A method of authentication of peers of a peer-to-peer network includes a certificate issuer tracking at most a predetermined number of node IDs for each peer on the peer-to-peer network, a requesting peer requesting from the certificate issuer a certificate for authenticating a communicating peer and each certificate issued listing at least one node ID of the predetermined number of node IDs assigned for the communicating peer.

Abstract: A method of authentication of a verifying device by a confirming device includes the confirming device receiving and storing a shared secret derived from at least a password of a user and sending a challenge. The method further includes the confirming device receiving a response to the challenge using the shared secret; determining if the response to the challenge is correct and if the response to the challenge is correct, authenticating the verifying device.

Abstract: A method for managing communications between or among nodes of a P2P network includes establishing a node ID, an IP address and a node type for each respective node to be joined or linked to the P2P network, the node type including at least a fixed node type or a mobile node type and identifying a type of the resource associated with a corresponding node. Fixed nodes are joined to form the P2P network. One of the joined nodes is selected for linking with a mobile type node based on a correspondence between the node IDs of the selected fixed node and the mobile node to be linked. The mobile node is linked to the selected node such that messages destined for the mobile node are routed via the selected node without updating any other node other than the selected node with the IP address of the mobile node.

Abstract: A method for joining a network resource as a joining node to a peer-to-peer network includes establishing a node ID for the joining node to be joined to the peer-to-peer network, routing the join message to an assignment node that manages resources with resource IDs closest to the node ID of the joining node, determining whether or not the node ID established is identical to respective ones of the node IDs on the peer-to-peer network, and joining the joining node to the peer-to-peer network, when the node ID of the joining node is not identical to any one of the node IDs on the peer-to-peer network.

Abstract: A method for managing communication in a peer-to-peer network in which overlay information is updated on-demand such that neighboring node information is updated at least periodically and other overlay information is updated on-demand (from standard communications). For example, in one aspect, the network includes a plurality of nodes, and the method includes looking up at least one neighboring node, sending a joining message from a joining node to the neighboring node, the joining message including information relating to the joining node, joining the joining node to the network by updating each neighboring node exclusive of any other nodes of the plurality of nodes, sending reply messages from each neighboring node to the joining node, and updating the joining node with information from each neighboring node, exclusive of any other nodes of the plurality of nodes.

Abstract: Terminal switching technology for seamlessly switching streaming sessions between terminals is provided. In this technology, a switching destination terminal has an establishing section establishing a streaming session with a communicating party according to a terminal switching request, a receiving section receiving data from the communicating party after a streaming session is established with the communicating party, a storing section storing received data, and an acquisition section acquiring newest data from the terminal apparatus of the switching source transmitting the terminal switching request in the event that the newest data to be outputted is not in the storing section after the terminal switching request is received and the storing section starts storing the data.

Abstract: Security mechanisms are disclosed that protect the integrity of the candidate access node discovery procedures in a mobile communication network. In accordance with an aspect of the invention, an access node stores information on candidate access nodes in the mobile communication network and updates the information only after verifying information provided by a mobile terminal after a handoff from one access node to another access node. In accordance with another aspect of the invention, the information on candidate access nodes in the mobile communication network are associated with a particular mobile terminal and stored at the mobile terminal in a candidate access node list.

Abstract: A method for encoding video data includes the steps of providing video data having a plurality of frames each of which has a plurality of blocks each of which has a predetermined number of pixels, providing a codebook having indices each representing a different pattern, performing an intra-coding process with respect to a first set of frames of the plurality of frames to select from the codebook best match indices for respective blocks of the first set of frames, performing a predictive coding process with respect to a second set of frames of the plurality of frames to obtain codes for respective blocks of the second set of frames, wherein each of the codes has an index-body determined using the best match indices for the blocks of the first set of frames and best match indices selected from the codebook for the blocks of the second set of frames, and performing a bi-directional predictive coding process with respect to a third set of frames of the plurality of frames to obtain codes for respective blocks of