Abstract: A computer program product and a system are provided. The product and system provide associations between individuals having health care needs and available social services. The providing is efficient and cost effective.

Abstract: A personalized electronic healthcare management system and computer-implemented method thereof. The system includes a user interface configured to receive user profile information associated with a user as input by the user, and a server interfacing with the user interface. The server retrieves healthcare information from at least one external source, and provides the retrieved healthcare information to the user at the user interface. The healthcare information may be personalized to the user's needs. The server further retrieves social service program information from at least one host site, provides the retrieved social service program information to the user, and applies to at least one social service program of the at least one host site using the user profile information, when desired by the user, and retrieves interactive information to be presented to the user at the user interface.

Abstract: Techniques are provided for selecting a limited but comprehensive set of high-quality users reviews covering several different aspects or attributes of a reviewed item. For several implementations, selection methodologies approach the challenge as a maximum coverage problem and provide a generic formalism to model the different variants of the review-set selection. Variations to such implementation may also employ different algorithms in consideration of different variants and weightings of those variants. Select implementations employ methodologies that collectively consider attributes of the item discussed in the reviews, the quality of the reviews themselves, and the viewpoint of the reviews (e.g., positive or negative) as input values in order to provide outputs that cover as many attributes of the item as possible, comprising high quality reviews representing different viewpoints.

Abstract: The disclosure generally relates to document summarization. Given a document, summarization can be defined as picking k sentences from the original document D such that the constructed summary exhibits two key properties: coverage and orthogonality. In one embodiment of the disclosure, the two requirements are captured in a combinatorial formulation of the problem and presented as an algorithms.

Abstract: The present invention provides a method and system for constructing one or more a comprehensive summaries of event sequence(s). The present invention approaches the problem of finding the shortest yet most comprehensive summary of an event sequence by transforming this summarization problem into a concrete optimization problem and provides a computer-implementing technique for solving this optimization problem to construct and/or form the basis for constructing the summaries. The summaries describe an entire event sequence while at the same time reveal local associations between events of that sequence. In certain embodiments, the segmentation of the event sequence produced in accordance with the present invention is itself a summary of the event sequence. In other embodiments, the segmentation produced forms a basis for one or more summaries.

Abstract: A personalized electronic healthcare management system and computer-implemented method thereof. The system includes a user interface configured to receive user profile information associated with a user as input by the user, and a server interfacing with the user interface. The server retrieves healthcare information from at least one external source, and provides the retrieved healthcare information to the user at the user interface. The healthcare information may be personalized to the user's needs. The server further retrieves social service program information from at least one host site, provides the retrieved social service program information to the user, and applies to at least one social service program of the at least one host site using the user profile information, when desired by the user, and retrieves interactive information to be presented to the user at the user interface.

Abstract: Systems and methods for managing security and/or privacy settings are described. In one embodiment, the method may include communicably coupling a first client to a second client. The method may further include propagating a portion of a plurality of security and/or privacy settings for the first client from the first client to the second client. The method may also include, upon receiving at the second client the portion of the plurality of security and/or privacy settings for the first client, incorporating the received portion of the plurality of security and/or privacy settings for the first client into a plurality of security and/or privacy settings for the second client.

Abstract: The present invention provides a method and system for constructing one or more a comprehensive summaries of event sequence(s). The present invention approaches the problem of finding the shortest yet most comprehensive summary of an event sequence by transforming this summarization problem into a concrete optimization problem and provides a computer-implementing technique for solving this optimization problem to construct and/or form the basis for constructing the summaries. The summaries describe an entire event sequence while at the same time reveal local associations between events of that sequence. In certain embodiments, the segmentation of the event sequence produced in accordance with the present invention is itself a summary of the event sequence. In other embodiments, the segmentation produced forms a basis for one or more summaries.

Abstract: The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities of the nodes before publishing the graph/social network data does not guarantee privacy. The structure of the graph itself, and in is basic form the degree of the nodes, can be revealing the identities of individuals. To address this issue, a specific graph-anonymization framework is proposed. A graph is called k-degree anonymous if for every node v, there exist at least k?1 other nodes in the graph with the same degree as v. This definition of anonymity prevents the re-identification of individuals by adversaries with a priori knowledge of the degree of certain nodes. Given a graph G, the proposed graph-anonymization problem asks for the k-degree anonymous graph that stems from G with the minimum number of graph-modification operations.

Abstract: A computer program product and a system are provided. The product and system provide associations between individuals having health care needs and available social services. The providing is efficient and cost effective.

Abstract: A system, a method and computer-readable media for identifying and presenting potential query refinements for a user's search input. Documents are identified as being responsive to the search input. A query log is accessed to identify previously entered queries that also returned one or more of the identified documents. From these previously entered queries, a portion of the queries are selected as potential query refinements. Thereafter, the potential query refinements are displayed to the user.