Abstract: A method includes defining a host capability; creating for a storage device a second directory tree from a first directory tree of the storage device that is included in a file system within the storage device; and, for a data file that is stored in the storage device and is selectable for consumption by a host through the first directory tree that is included in the storage device's file system, determining whether the data file requires for consumption a host having the defined host capability. If the data file requires a host having the defined host capability, an entry is created in the second directory tree in which the data file is not selectable for consumption by the host. Otherwise, an entry is created in the second directory tree in which the data file is selectable for consumption by the host.

Abstract: A user accessing a media service desires to find out more information about the media service by formulating a query, by operation of an input device, where a region of interest of said media service is selected by the user. The query is submitted to other users who are defined by various tiers defined by different types of criteria. The users belonging to such tiers respond back to the query with new information, which is rendered on the media device being used by the user. Such responses are then rendered on the media device of the user. Optionally, a computer assistance mode is operated where keywords are extracted from said communications between users, and such keywords a used to obtain additional results from a resource such as a search engine.

Abstract: A computer-implemented method is provided for searching for files on the Internet. In one embodiment, the method may provide an application crawler that assembles and dynamically instantiates all components of a web page. The instantiated web application may then be analyzed to locate desired components on the web page. This may involve finding and analyzing all clickable items in the application, driving the web application by injecting events, and extracting information from the application and writing it to a file or database.

Abstract: A search engine may perform a search for a user search query. A rankings of result items may be returned as a result of the search. The user may enter new suggested rankings for some of the items. The new suggested rankings may change the rankings of result items when other users search for the same search query or a similar search query at a later time.

Abstract: A method for sharing data between an occasionally connected device and a remote global database is disclosed. The occasionally connected device receives data from a remote global database. The data is accessed by a user in an online mode. The data is stored in the form of one or more screen instances in a local database of the occasionally connected device. The one or more screen instances capture contents of a screen accessed by the user, and the one or more screen instances are last viewed instances of the screen accessed by the user. Further, the one or more screen instances are updated in the offline mode by querying the local database of the occasionally connected device. The one or more updated screen instances are synchronized with the remote global database to update the data stored in the remote global database corresponding to the one or more screen instances.

Abstract: The subject disclosure is directed towards partitioning a file into chunks that satisfy a chunk size restriction, such as maximum and minimum chunk sizes, using a sliding window. For file positions within the chunk size restriction, a signature representative of a window fingerprint is compared with a target pattern, with a chunk boundary candidate identified if matched. Other signatures and patterns are then checked to determine a highest ranking signature (corresponding to a lowest numbered Rule) to associate with that chunk boundary candidate, or set an actual boundary if the highest ranked signature is matched. If the maximum chunk size is reached without matching the highest ranked signature, the chunking mechanism regresses to set the boundary based on the candidate with the next highest ranked signature (if no candidates, the boundary is set at the maximum). Also described is setting chunk boundaries based upon pattern detection (e.g., runs of zeros).

Abstract: An apparatus, system, and method are disclosed for maintaining a context stack. A monitor module monitors a stack size after each monitor interval for a stack of a plurality of contexts. Each context defines communications between a process and a data set and comprises a pathway for communicating with the data set and a process identifier. A stack module deallocates a context that satisfies a stack policy from the stack if the stack size is within a buffer threshold of a maximum threshold.

Abstract: Embodiments relate to systems and methods for the conditioned distribution of data in a lattice-based database using spreading rules. A data store can store data in a lattice-based database or other three-dimensional hierarchical format. Higher-level data, such as yearly profit, may be desired to be spread from parent nodes at different levels or points in the lattice structure to lower nodes or locations, such as quarters. Parent nodes can be associated with a set of programmatic placeholder nodes. A spreading tool can insert child nodes representing quarters, months, or other insertion point(s) represented or encoded by a set of placeholder nodes, dividing, combining, or otherwise distributing quantities appropriately. In aspects, data can be spread from multiple parents and/or multiple target child nodes, at once. In aspects, the spreading tool can access or host sequence logic to ensure data spreading in an order that takes dependencies, formatting, or other factors into account.

Abstract: A challenge to be met is to make it possible to accurately ascertain a behavior history of a person in various camera environments. Person characteristic data extracted from a plurality of cameras are stored in a person characteristic database. A retrieval request receiving section receives an identifier for identifying a person to be retrieved as a retrieval key. A characteristic retrieval section performs retrieval of persons matching the retrieval key from the person characteristic database in descending order of similarity. A retrieval result grouping section classifies the results of retrieval into units assumed to belong to the same environment. A retrieval result display section displays results of grouping. Since retrieval results are displayed in the form of a list on each unit assumed to belong to the same environment, the person to be retrieved can simply be ascertained in various camera environments despite a limited number of displays provided.

Abstract: A search system using an extended keyword pool includes a processor. The processor includes a purchased keyword module configured to generate a purchased keyword set by searching for a keyword having a purchase history through a search advertisement. The processor includes an additional keyword module configured to generate an additional keyword set by extracting a keyword from at least one source. The processor includes a unified search keyword module configured to generate a unified search keyword set by searching for a keyword having a number of hits greater than a determined number of hits among queries comprising the purchased keyword set and the additional keyword set. The processor includes a search module configured to provide, as a keyword pool, an associated keyword or an extended keyword with respect to a search word, using the keywords in the purchased keyword set, the additional keyword set, and the unified search keyword set.

Abstract: Methods and systems for extending keyword searching techniques to syntactically and semantically annotated data are provided. Example embodiments provide a Syntactic Query Engine (“SQE”) that parses, indexes, and stores a data set as an enhanced document index with document terms as well as information pertaining to the grammatical roles of the terms and ontological and other semantic information. In one embodiment, the enhanced document index is a form of term-clause index, that indexes terms and syntactic and semantic annotations at the clause level. The enhanced document index permits the use of a traditional keyword search engine to process relationship queries as well as to process standard document level keyword searches.

Abstract: A method resolves ambiguous spotted entity names in a data corpus by determining an activation level value for each of a plurality of nodes corresponding to a single ambiguous entity name. The activation levels for each of the nodes may be modified by inputting outside domain knowledge corresponding to the nodes to increase the activation value of the nodes, spotting entity names corresponding to the nodes to increase the activation value of the nodes, searching the data corpus to spot newly posted entity names to increase the activation value of the nodes, and searching the data corpus to reduce or deactivate the activation value of the nodes by eliminating false positives. The ambiguous entity name is assigned to the node determined to have the highest activation level and is then outputted to a user.

Abstract: A method and system for providing unified local storage support for file and cloud access is disclosed. The method comprises writing a chunk on a storage server, and replicating the chunk to other selected storage servers when necessary. The method and system further comprise writing a version manifest on the storage server; replicating the version manifest to other selected storage servers when necessary. Object puts or appends are implemented by first chunking the object, determining if the chunks are new, transferring the chunks if required, followed by creation of a new version manifest referencing the chunks. Finally, the method and system include providing concurrent file-oriented read and write access consistent with the stored version manifests and chunks.

Abstract: Systems and methods for classifying electronic information or documents into a number of classes and subclasses are provided through an active learning algorithm. In certain embodiments, seed sets may be eliminated by merging relevance feedback and machine learning phases. Such document classification systems are easily scalable for large document collections, require less manpower and can be employed on a single computer, thus requiring fewer resources. Furthermore, the classification systems and methods described can be used for any pattern recognition or classification effort in a wide variety of fields, including electronic discovery in legal proceedings.

Abstract: Data processing apparatus comprising: a chunk store having a plurality of chunk sections, each operable to store specimen data chunks, the apparatus being operable to: process an input data set into one or more input data chunks; identify a specimen data chunk in one of said chunk sections which corresponds to a first input data chunk; identify a second input data chunk not corresponding to a specimen data chunk in the chunk store; and store the second input data chunk as a specimen data chunk in proximity to the identified specimen data chunk corresponding to the first input data chunk.

Abstract: A system identifies a set of documents from a corpus of documents that are relevant to a word, phrase or sentence and that were published at approximately a same time period, where each document of the set of documents includes news content and has an associated headline. The system extracts headlines from the set of documents and derives a score for each headline of the extracted headlines based on how many times selected words in each headline occurs among all of the extracted headlines.

Abstract: Disclosed herein is parallel processing of a query, which uses inter-query parallelism in posting list intersections. A plurality of tasks, e.g., posting list intersection tasks, are identified for processing in parallel by a plurality of processing units, e.g., a plurality of processing cores of a multi-core system.

Abstract: A method for automatically providing a plurality of additional database query terms comprising receiving a first query term from a user, receiving a plurality of characters from the user, wherein the plurality of characters is only a portion of a second query term, and selecting a set of records from a database based on the query term, wherein the database comprises records which comprise text translated from audio. The method also determines a plurality of additional query terms based on the plurality of characters, and, for at least one of the plurality of additional query terms, processes at least a portion of the set of records to determine a relevance of the additional query term. Finally, the method includes displaying at least one of the plurality of additional query terms to the user for selection based on the relevance of at least one of the plurality of additional query terms.

Abstract: Certain example embodiments relate to a database index for indexing one or more text documents in a database. The text documents include one or more hierarchical nodes, and each node includes one or more words. The database index includes at least one entry, with each entry including a key. The key, in turn, includes a subset of words occurring in one of the hierarchical nodes of the text documents and the name of the respective hierarchical node. Associated with each key is a value including one or more references to the text documents in which the subset of words occurs.

Abstract: Method and system for accessing subscriber data in a telecommunication system, and providing a database system with a master database and slave databases acting as memory caches located with requester applications. The method including: configuring data clusters at the master database, each data cluster identifying subscriber data associated with an operation and assigned a priority; determining at the master database the priority of the data cluster associated with a received operation; and either providing the data cluster associated with the operation from the master database towards the slave database, replicating the received data cluster at the slave database, and executing the operation with the received data cluster at the slave database, where the priority of the data cluster is higher than for previous operations; or executing the operation with the data cluster at the master database, where the priority of the data cluster is lower than for a previous operation.