Abstract: Data can be stored based on one or more indications and one or more other storage criteria. The indications can effectively indicate or identify a storage level for storing data in a multi-storage system. The indications, however, need not be the only basis for storing the data object in a multi-storage system as one or more other storage criteria can also be considered. As a result, the indication can be used to effectively influence data storage but other storage criteria can be used as well to prevent adverse effects caused by undue influence and to ensure the overall efficiency of the system. Also, the one or more other storage criteria can be evaluated or reevaluated on a continual basis.

Abstract: A system and method for deriving associations between assets is disclosed. The system comprises a signature module, a matching module and an association module. These components of the system are communicatively coupled to each other. The signature module generates a first fingerprint for a first asset. The matching module determines a matching fingerprint that matches the first fingerprint from a candidate set. The matching module determines a first asset type for the first asset associated with the first fingerprint and a second asset type for a second asset associated with the matching fingerprint. The matching module determines an association test. The association module associates the first asset with the matching asset based on whether the association test is passed.

Abstract: Emails are received and parsed for a set of dates. A set of words surrounding the set of dates are identified and contextual information is correlated with the set of dates based on the set of words. It is then determined whether the dates are promotional expiration dates based on the contextual information. The emails that have promotional dates are placed in a list having a chronological order that is based on the promotional expiration dates. The current calendar date is checked and emails are excluded from the list in response to the current calendar date being chronologically after the promotional expiration date. The list is then displayed based on the exclusion of the email.

Abstract: A method includes receiving a user inputted lower-level hierarchical filter key, processing filter key relational data to identify higher-level filter criteria keys associated with the user inputted lower-level hierarchical filter key, updating higher-level filter criteria to include the identified higher-level filter criteria keys, and generating a list of results according to the updated filter criteria. A computer program product and computer system corresponding to the method are also disclosed.

Abstract: The inventive technology enables the search engine operator to charge the advertisers who place their links on the search engine only if the user uses the search results to visit the advertiser's web portal(s) and generates revenue for the advertiser. This concept is especially attractive to the advertisers because it eliminates the risk, which the advertisers face in conventional search engines, when they are changed by the search engine per user click irrespectively of whether the user's visit resulted in advertiser's revenue.

Abstract: Embodiments provide a data persisting mechanism that allows for efficient, unobtrusive persisting of large volumes of data while optimizing the use of system resources by the persisting process. In an embodiment, the persisting process includes a self-tuning algorithm that constantly monitors persistence performance and that adjusts persistence time to maintain performance within user-defined criteria. From one aspect, this allows the persisting process to seamlessly adapt to changes in system environment (speeding up persistence during times of low processor usage and slowing down persistence during times of high processor usage) and to reduce or eliminate CPU spikes caused by persisting process. From another aspect, the persisting process results in the data being persisted as quickly as possible given the system constraints, thereby minimizing the possibility of data loss.

Abstract: The Prefix Burrows-Wheeler Transform (“PWBT”) is described to provide data operations on data sets even if the data set has been compressed. Techniques to set up a PWBT, including an offset table and a prefix table, and techniques to apply data operations on data sets transformed by PWBT are also described. Data operations include k-Mer substring search. General applications of techniques using PWBT, such as plagiarism searches and open source clearance, are described. Bioinformatics applications of the PWBT, such as genomic analysis and genomic tagging, are also described.

Abstract: Selecting a storage device to be mapped to a requested virtual disk includes maintaining attributes for a set of storage devices including a cost attribute, a capacity attribute and quality-of-service attributes. A request for a virtual disk includes request parameters including a price parameter, a capacity parameter and quality-of-service parameters. A device selection function generates a score for each storage device based on the request parameters and the storage device attributes, and identifies a best suited storage device by comparing the respective scores of the storage devices. The virtual disk is then created in satisfaction of the request with a mapping to the identified storage device to provide underlying physical data storage for the virtual disk.

Abstract: A system and method for securely obfuscating, storing, and transmitting digital information includes a computing device configured to parse at least a portion of one or more bit streams to form a plurality of first datasets. The computing device is configured to disperse the plurality of first datasets into multiple data blocks to form t volumes as part of a plurality of second bit streams such that m number of volumes contain a complete data set, wherein m<t. The computing device is also configured to output the t volumes to a plurality of local or distributed storage locations, such that no complete dataset is stored at a single storage location.

Abstract: An enterprise level data element review system including a data access event collection subsystem operative to collect data access event notifications relating to ones of a multiplicity of data elements, a data element metadata modification subassembly receiving an output from the data access event collection subsystem and providing a script indicating which data elements have had a metadata modification over a given period of time, and a data element dancer operative to collect at least one of metadata and access permissions for a plurality of data elements which is substantially less than the multiplicity of data elements and is selected on the basis of the script.

Abstract: A document classification and analysis system includes a processor, a memory including one or more storage regions, and a non-transitory computer-readable medium having stored thereon instructions that, when executed, cause the processor to perform a method. The method includes receiving a document including a plurality of words, performing morpheme analysis on the document to extract original forms of the words, tagging each of the words based on a corresponding part-of-speech, determining location information of the words based on an order of the words in the document, applying one or more lexicon lists to the document to classify each of the words, and storing the location information.

Abstract: A system and method for generating user-centric directories including analyzing a plurality of relationships of a user. A contact directory for the user is defined based upon the plurality of relationships of the user.

Abstract: Methods, systems, and media for presenting suggestions of related media content are provided. In some embodiments, the method comprises: generating, using a hardware processor, a transcript of a first media content item; receiving one or more social network posts associated with one or more other media content items; computing one or more correlations between text in the one or more social network posts and the transcript; ranking the social network posts based at least in part on the correlations; and causing one or more suggestions to view the one or more other media content items associated with the one or more social network posts based at least in part on the rankings to be presented.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer-readable storage medium, including a method for ranking content using location-based query log analysis. The method comprises: identifying a region defining an area of interest including identifying a plurality of content items that are associated with the region; evaluating query logs associated with users that submitted queries associated with the region to determine a ranking associated with the plurality of content items; receiving a request for content associated with the region; and providing one or more of the content items based at least in part on the ranking.

Abstract: A usage information storage section is configured to store usage information. An item information storage section is configured to store attribute correspondence information. A relevant attribute selection section is configured to calculate an attribute relevant degree based on the usage information and the attribute correspondence information, select a relevant attribute for each item identifier based on the calculated attribute relevant degree, and create relevant attribute information in which each item identifier and the selected relevant attribute are associated with each other.

Abstract: An event server adapted to receive events from an input stream and produce an output event stream. The event server uses a processor using code in an event processing language to process the events. The event server obtaining input events from and/or producing output events to a cache.

Abstract: Methods, systems, and apparatus, including computer program products, for refining search queries. In one implementation, a method includes obtaining a submitted search query, and in response to obtaining the search query: obtaining search results responsive to the search query; selecting a document from a group of documents identified by the search results; generating from a subset of one or more entities associated with the document one or more candidates for refined search queries, including: identifying one or more terms in the search query, where the one or more terms occur in the search query in a particular order relative to each other, and combining the one or more terms with the entity to generate a candidate, where the one or more terms occur in the particular order relative to each other; and identifying one or more of the candidates as being refined search queries for providing with the search results.

Abstract: Techniques for inferring social affinity may include the following operations: obtaining information derived from online activity of a first party, where the online activity includes searches initiated by the first party, and where the information specifies interaction of the first party with content accessed through the online activity; determining, based on the information, that an amount of the interaction of the first party with the content exceeds a threshold; following the determining, identifying a second party who provided the content; adjusting, in a social graph for the first party, an affinity of the second party to the first party based on the amount of the interaction with the content; and using the affinity to promote search results output to the first party that contain content that is provided by the second party.

Abstract: A method for consolidating a database in a Seibel CRM environment is presented. Bypassing the Business Object Layer (BOL) of the Seibel CRM environment, primary keys in a consolidated table are realigned such that a consolidated child table, created from two distinct databases, is able to point to reference items in a single parent table.

Abstract: Embodiments enable the evaluation of injected queries within a monad. One or more operators with closures are received from a first process. The operators with closures represent one or more functions to be applied by a second process. The second process evaluates the received operators with closures to apply the functions within the monad. During evaluation, the second process converts the closures to simply typed closures. Further, the second process binds the converted closures within the monad to restrict execution of the functions. In some embodiments, the queries (e.g., sequences of one or more operators with closures) are composed using a set of query operators from the language integrated query (LINQ) framework encoded in uniform resource locators (URLs) in the representational state transfer (REST) style.