Abstract: A Phasetime Method and Automated System for tracking Element Efforts that result in end products, at least including products of art, industry, and nature, and reporting Development Event Efforts by their virtual Points in Phasetime within designated Past, Present, and Future Project Development Phases. Dynamically generated Phasetime Reports display Element Project Efforts within a live Phasetime Matrix in relation to their Phase of Development and Points in Phasetime. Development Events occur within Project Development Phases, which Phases may vary in number and kind depending on the end product. Development Events include Project Production Elements, Element Efforts, the duration of said Efforts, and Efforts' Points in Phasetime. Element Efforts, tracked by Phasetime Project Development Event Instances, are reported in edited Storyboard Beats in Phasetime Macro, Micro, and Nano Views depicting the Efforts' effect on the end Product's Storyline.

Abstract: A distributed system of data centers is configured to ensure that all data operations involving specific accounts are performed within a given time frame at only one data center. Once a data center has begun accessing data that is associated with an account, all requests to access or manipulate data for that account are redirected to that data center for a period of time. Thus, the data center becomes not only the “owner” of all data associated with the account for that period of time, but also the servicer of all requests associated with the account. The data center then asynchronously replicates changes to the data associated with the account to the other data centers. Since none of the other data centers are permitted to change the data associated with the account, conflicts in the replicated data are minimized.

Abstract: A method includes: displaying a map, a first field configured to receive a first query input, and a second field configured to receive a second query input; receiving the first query input in the first field; receiving the second query input in the second field; initiating a search that uses the first query input and a search that uses the second query input; concurrently displaying on the map a first plurality of search results for the first query input and a second plurality of search results for the second query input; detecting selection of a first search result in the first plurality of search results; detecting selection of a second search result in the second plurality of search results; and displaying a route on the map from the first search result to the second search result.

Abstract: A computer identifies a plurality of data retrieval requests that may be serviced using a plurality of unique data chunks. The computer services the data retrieval requests by utilizing at least one of the unique data chunks. At least one of the unique data chunks can be utilized for servicing two or more of the data retrieval requests. The computer determines a servicing sequence for the plurality of data retrieval requests such that the two or more of the data retrieval requests that can be serviced utilizing the at least one of the unique data chunks are serviced consecutively. The computer services the plurality of data retrieval requests according to the servicing sequence.

Abstract: In some aspects, at least two different probes are applied to datafeed archives to derive information based on data in the archives. The probes are part of a probe plan to determine a result based on the derived information. The result is determined based on the derived information.

Abstract: A distributed caching system for storing and serving information modeled as a graph that includes nodes and edges that define associations or relationships between nodes that the edges connect in the graph.

Abstract: Example systems and methods are directed at maintaining and retrieving presence metadata. One example method includes receiving a request from a first client to edit a document file, and sending short-term check out metadata to the first client to begin an editing session. The method also includes writing the transition ID to a transition table stored in a cache, wherein the presence of another transition ID in the cache indicates that a document has switched from a single-client mode to a multi-client mode. An example system includes a processing unit operative to receive a document, the document including short-term check out metadata indicating an editing session has begun, ping a cache to determine if another transition ID is stored in the cache, and send a transition ID to a transition table stored in a cache to switch from a single-client mode to a multi-client mode.

Abstract: Systems and methods are provided for selecting contexts for new invitational content and invitational content for new contexts. In particular, a performance history of delivered invitational content in known contexts is combined with similarity measures for the delivered invitational content, with respect to a new invitational content, to generate a list of potential contexts for the new invitational content. Similarly, a performance history of in known contexts with delivered invitational content can combined with similarity measures for known contexts, with respect to a new context, to generate a list of potential content for the new context. Further, a combination of these methods can be used to pair new invitational content with new contexts.

Abstract: A method, computer program product, and system for defining custodianship of content in an electronic discovery management system, and maintaining custodianship definitions in an external content archive, the custodianship specifying at least one parameter of a first custodian to associate the content with the first custodian. Responsive to receiving a request to perform an operation on the content associated with the first custodian, the request is modified with the at least one parameter of the first custodian and at least one property of the content in the content archive, the at least one parameter and at the least one property being consumable by the content archive. The modified request is sent to the content archive, which is configured to, responsive to receiving the modified request, perform the operation on the content associated with the first custodian.

Abstract: Data can be processed in parallel across a cluster of nodes using a parallel processing framework. Using Web services calls between components allows the number of nodes to be scaled as necessary, and allows developers to build applications on the framework using a Web services interface. A job scheduler works together with a queuing service to distribute jobs to nodes as the nodes have capacity, such that jobs can be performed in parallel as quickly as the nodes are able to process the jobs. Data can be loaded efficiently across the cluster, and levels of nodes can be determined dynamically to process queries and other requests on the system.

Abstract: A method which generates at a user's computer system a display which graphically shows the relationships among a core query and one or more suggested related queries in a search conducted through an online search engine. The display preferably is a set of partially overlapping geometric figures such as circles, with the size of each circle indicating the number of resources found by the search queries and the overlap indicating commonality between a core query and a suggested related query.

Abstract: A computer-implemented method for data loss prevention may include (1) identifying a network configured with a data loss prevention system, (2) identifying a file subject to a data loss prevention assessment within the network, (3) identifying a source of the file, the source of the file causing an entry of the file onto the network, (4) determining, based on the source of the file, that the file is subject to a data loss prevention policy, and (5) applying the data loss prevention policy to the file based on the determination that the file is subject to the data loss prevention policy. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: When an index is partitioned and managed in a plurality of indexes in a search system which deals with large amounts of data, the number of documents registered in each partitioned index may be varied, and inefficient data transfer may occur at the time of index reconfiguration when search nodes are added or deleted. In the present invention, mapping information is used to map search node IDs to slot regions obtained by equally partitioning a circular hash value space in which a start point and an end point of the hash value space are assumed to be identical, so that each document is mapped to each partitioned index.

Abstract: A processor-implemented method, system, and/or computer program product generate and utilize a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects. A non-contextual data object is associated with a context object to define a synthetic context-based object, where the non-contextual data object ambiguously relates to multiple subject-matters, and where the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object. The synthetic context-based object is then associated with at least one specific data store, which includes data that is associated with data contained in the non-contextual data object and the context object.

Abstract: To eliminate restrictions on the order of writing in an access control list. A permission rule and a prohibition rule are stored in advance. A rule is read out from an access control list accepted, and a determination is made as to whether the readout rule is contained in the permission and prohibition rules stored in advance. When the readout rule is not contained and when the readout rule is a permission rule, the readout rule is stored in the temporary storage unit. When the readout rule is not contained and when the readout rule is a prohibition rule, a determination is made as to whether the prohibition rule conflicts with the permission rule stored in the temporary storage unit. When the prohibition rule does not conflict, the prohibition rule is stored in the temporary storage unit.

Abstract: Systems and methods consistent with the invention may include selecting a plurality of hosts to store data structures by defining a color incidence process used to model a host assignment process, determining, by the color incidence process, a color allocation, and assigning the data structures to one of the plurality of hosts based on the color allocation determined by the color incidence process.

Abstract: System and computer implemented method for evaluating the quality and accuracy of a human translation from a source language to a target language by a group of professional translation reviewers communicating in real-time. The system and method comprise a system computer with a database of profiles and credentials of reviewers; and the ability to communicate with groups of selected reviewers via a computer network. The computer system assigns evaluations and collects ratings returned by reviewers, and calculates a consensus rating for the group, while omitting statistical outliers. The system will also calculate a score for the reviewer as compared to the group, and use the score in selecting reviewers for future evaluations.

Abstract: Techniques for logging data pertaining to the operation of a data stream processing server. In one set of embodiments, logging configuration information can be received specifying a functional area of a data stream processing server to be logged. Based on the logging configuration information, logging can be dynamically enabled for objects associated with the functional area that are instantiated by the data stream processing server, and logging can be dynamically disabled for objects associated with the functional area that are discarded (or no longer used) by the data stream processing server. In another set of embodiments, a tool can be provided for visualizing the data logged by the data stream processing server.

Abstract: Methods and apparatus include features for managing social media universes. In one embodiment, media content and community members that have been associated with a new concept for creating a new universe are searched on a plurality of media content servers. For each found new concept, an association is retained between the new universe for the new concept and any found media content and community members. When a requesting user requests to view the new universe, a representation of the media content and the community members that are associated with the new universe is displayed for the requesting user.

Abstract: Search assistance is provided to users that submit search queries to search engines. In one implementation, a partial search query input by a user to a search engine is received. The partial search query is predicted to be a navigational query. A web address is selected based on the predicted navigational query. A search assistance list that includes the selected web address is generated. The search assistance list is displayed to the user in response to the received partial search query. In another implementation, a plurality of suggested search queries is determined for the received partial search query. A suggested search query of the plurality of suggested search queries having a highest relevance to the user is determined. A search assistance list is generated and displayed to the user. The suggested search query having the highest relevance to the user is prominently displayed in the search assistance list.