Abstract: Messages having patient healthcare information are exchanged between various healthcare IT systems. The messages are formatted according to various specific healthcare communication standards. The standards enable communication of the patient healthcare information among the healthcare IT systems. The messages are collected into a repository. Data mining is performed on the collected messages in order to make health-related findings.

Abstract: A method of performing auto-naming of content includes: receiving an auto-naming command for the content; performing auto-naming of the content by using different parameters according to different content types to obtain at least one auto-naming result for the content; and displaying the auto-naming result.

Abstract: The present disclosure describes implementing a virtual image file system, or IMGFS. A mount point directory is created in a local file system, where the local file system organizes files on a storage device. The mount point directory corresponds to a proxy backup image file stored on the storage device. The proxy backup image file stores an image file system. The image file system is mounted on the local file system at the mount point directory, using a virtual file system that implements an interface configured to access the image file system. In some embodiments, a notification is provided to a recovery manager that indicates the recovery manager should catalog one or more database files of the proxy backup image file. One or more database files can be restored to a second storage device, such as a group of physical disks that are managed as a single storage unit.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for using tiered arrays to represent aggregated software dependencies. One of the methods includes receiving a request to generate a range of contiguous indexes having non-default values represented by a tiered array, wherein each non-default element of each tier is a reference to a catalog at a lower tier except for a bottom-most tier of the tiered array that stores non-default values. After descending one or more tiers to identify a first index that (i) is greater than or equal to the start index and (ii) has a non-default value, a system ascends one or more tiers in the tiered array and subsequently descends again to identify a second index that is a last index in a contiguous sequence of indexes having non-default values from the first index up to and including the second index.

Abstract: A method and a mobile device comprising an address linking module assess a segment of text as comprising an address and create a link. The method comprises: searching a text for a segment of text having at least two character strings satisfying a proximity constraint, each character string being of a different predefined address indicator type; assessing whether or not the segment comprises an address; displaying at least a portion of the text comprising the segment on a display of a mobile device; and if the segment is assessed as comprising an address, including a link for display, the link pointing to at least one application.

Abstract: A system and method for reporting and analysis of media consumption data. A request is received over a network from a requesting user for consumption data relating to at least one media object, the request comprising an identification of the media objects. Spatial, temporal, topical, and social data available to the network relating to consumption of the media object are retrieved using a global index of data available to the network. The spatial, temporal, topical, and social data available to the network relating to consumption of the media objects are transmitted, over the network to the requesting user.

Abstract: This disclosure describes systems and methods for selecting and/or ranking web-based content predicted to have the greatest interest to individual users. In particular, articles are ranked in terms of predicted interest for different users. This is done by optimizing an interest model and in particular through a method of bilinear regression and Bayesian optimization. The interest model is populated with data regarding users, the articles, and historical interest trends that types of users have expressed towards types of articles.

Abstract: Techniques and mechanisms are provided for storing data in a backup storage system. According to various embodiments, a first blockmap in a backup storage system may be identified. The first blockmap may correspond with a first restore point. The first blockmap may identify a first plurality of data segments. Each of the first plurality of data segments may have associated therewith a respective storage location in the backup storage system. The first blockmap may be compared with a designated storage system state to identify a subset of the first plurality of data segments that each correspond with a respective matching data segment in the designated storage system state. A second blockmap may be stored in the backup storage system. The second blockmap may correspond with a second restore point. The second blockmap may include the identified subset of the first plurality of data segments.

Abstract: Methods, systems, and apparatus, including computer program products for structured content ranking. In an aspect, a method determines a service requirement from terms of a query, the service requirement being one of a plurality of service requirements fulfilled by databases; determines, for each of the databases, a service requirement score for the database, the service requirement score being a measure of an ability of the database to fulfill the service requirement; selects databases based on the service requirement scores; generates data responsive to the service requirement based on the terms of the query and one or more of the selected databases; and generates, from the data identifying resources that are determined to be responsive to the query and from the data responsive to the service requirement, search results that include first search results that each identify a corresponding resource that was determined to be responsive to the query.

Abstract: Methods, systems, and computer program products for maintaining up-to-date pre-computed search results, such as travel recommendations, stored in a data cache maintained, for example, by a global distribution system. Pre-computed search results are re-computed to provide long-term accuracy. A re-computation controller assigns a re-computation indicator to any of the pre-computed search results. The re-computation indicator for a pre-computed search result is based on at least on a probability that the pre-computed search result is still valid, and on a re-computation frequency of the search result. Within a given time interval, a computation platform re-computes these pre-computed search results having a re-computation indicator indicating the highest need for re-computation. The number of pre-computed search results re-computed by the computation platform is limited by the computation resources of the computation platform that are available for the re-computation within the given time interval.

Abstract: A database has a main table and an auxiliary table. Data are stored by: dividing the data into a sequence of segments each having a size smaller than a predetermined threshold; storing a first segment into a first field of a record of the main table; storing an index indexing the data into a second field of the record of the main table; storing the other segments into first fields of corresponding records of the auxiliary table; generating indexes associated to the other segments and storing each index into a second field of the record of the auxiliary table storing the associated segment of the sequence and also in a third field of the record of the auxiliary table storing a preceding segment in the sequence. A third record of the main table stores the index of a first segment of the sequence which is stored in the auxiliary table.

Abstract: A system and method can support network management in a network environment. The network environment can include a plurality of configuration daemons (CDs), wherein a master CD is an active CD on a switch with a master subnet manager (SM). The master CD operates to perform consistency check on one or more states associated with one or more peer CDs in the network environment, and replicate a configuration file to the one or more peer CDs, wherein the configuration file includes at least one management key (M_Key) value.

Abstract: Provided is a system and method for providing a mobile uniform resource locator (URL) in a mobile search environment. The system includes a collector configured to collect a mobile URL associated with a search target. The search target includes website information, where the website information is included in a search result of the search service. The system includes a determiner configured to determine a validity of the mobile URL. The system includes a provider configured to provide the mobile URL based on the determined validity of the mobile URL.

Abstract: One embodiment of the present invention provides a system for graph pruning. During operation, the system identifies a connected component in a graph comprising one or more vertices. A respective vertex of the graph represent an element in a data set, an edge between two vertices represents a type and strength of relationship between the vertices. The system identifies a connected component to be smaller than a minimum graph traversal threshold associated with a query for the graph. This minimum graph traversal threshold indicates a minimum number of traversal steps needed for the query. The system then generates a second graph by pruning the connected component from the graph. This second graph is processed to extract information of interest from the data set.

Abstract: Systems and methods for reducing a churn rate associated with subscribers of social network services are described. In some example embodiments, the systems and methods may access activity information associated with a former subscriber of a social network service, compare the accessed activity information to activity information associated with subscribers of the social network service, identify one or more differences between the activity information associated with the former subscriber of the social network service and the activity information associated with the subscribers of the social network service, and perform an action based on the identified one or more differences.

Abstract: Systems, methods, computer program product embodiments for an active/push notification façade for a passive database are described herein. An embodiment includes an event listener configured to poll (or query) a passive database and selectively retrieve data objects based on the poll results. Such a selective database read operation may be based on the priority of an event occurring in the passive database. If events of a low priority occur, the event listener does not open the passive database immediately to retrieve additional information related to the low priority event but defers reading the passive database by a pre-determined amount of time. If a higher priority event occurs, the passive database is immediately read to retrieve details related to the high priority event from the passive database. In another embodiment, event listener reads the passive database based on event timestamp information in the passive database and stored timestamp information.

Abstract: The recovery of one or more transactions in a computing system in which one or more persistent systems are coupled via a bus to one or more processors. As an example, the persistent system may serve as at least part of the main memory of the computing system. The transaction might implement multi-versioning in which a record is not updated in place. Rather, each record is represented as a sequence of one or more record versions, each version having a valid interval during which the record version is considered to properly represent the record.

Abstract: Techniques that facilitate management of skewed data during a parallel multiple join operation are provided. Portions of tables involved in the join operation can be distributed among a plurality of processing modules, and each of the processing modules can be provided with a list of skewed values of a join column of a larger table involved in the join operation. Each of the processing modules can scan the rows of first and second tables distributed to the processing modules and compare values of the join columns of both tables with the list of skewed values. One or more of the processing modules can then redistribute the skewed values.

Abstract: Search history data such as browse trails are collected over time. The browse trails, including associated queries and domains, are processed to identify free tokens of the queries that are also modifiers. Attribute value pairs of a structured data source that correspond to the modifiers are determined based on the search history data and a frequency of the attribute value pairs in the structured data source. When a subsequent query is received, modifiers in the query are identified and replaced with the determined combinations of attribute value pairs that correspond to the modifiers in a structured query that is generated from the received query. The structured query is used to identify items and/or services in the structured data source that are responsive to the received query.

Abstract: Performing a transaction in the context of a computing system that has one or more persistent systems coupled to one or more processors over a bus. As an example, the persistent system may serve as at least part of the main memory of the computing system. The transaction might implement multi-versioning in which a record is not updated in place. Rather, each record is represented as a sequence of one or more record versions, each version having a valid interval during which the record version is considered to properly represent the record. The transaction processing uses torn write detection so that recovery processes may use such guards to verify that there are no torn writes. For instance, torn write guards may be used to verify the integrity of record versions as well as the log buffers that refer to the record versions.