Abstract: A method implemented in a data processing system includes receiving a plurality of text strings. A plurality of rules are applied to the text strings. If a condition specified in one of the rules exists in a given text string, one or more attributes are associated to that text string as metadata. One or more of the text strings are selected, using the metadata, as a potential title for the content. A final title is prepared based on the potential title, and the content is published online under the final title.

Abstract: A method for sharing verified identity documents is disclosed. The method is performed at one or more electronic devices. The client device obtains identity information of a user and a document. The client device extracts identity information from the document. The client device determines that the identity information of the user and the extracted identity information substantially match, and generates at least one verification rating for the document. The client device sends the document, the data extracted from the document, and the at least one verification rating to a server system remote from the client device. This information is then provided by the server system to another party upon approval by the user to share the information with that party.

Abstract: An apparatus and method for generating a multimedia play list based on user experiences in a portable multimedia player are provided. The apparatus includes an analyzer for analyzing user experience information input to the multimedia player, a recorder for recording the user experience information in a multimedia tag, a play list generator for generating a play list by analyzing the user experience information and the multimedia tag information recorded by the recorder, and a reproduction unit for reproducing multimedia according to the generated play list.

Abstract: Methods, computer program products and systems are provided for mining for sub-patterns within a text data set. The embodiments facilitate finding a set of N frequently occurring sub-patterns within the data set, extracting the N sub-patterns from the data set, and clustering the extracted sub-patterns into K groups, where each extracted sub-pattern is placed within the same group with other extracted sub-patterns based upon a distance value D that determines a degree of similarity between the sub-pattern and every other sub-pattern within the same group.

Abstract: A mediation method and system utilizes a subsystem (300) for processing event records that at least potentially have a mutual relation. The subsystem comprises an in-memory database (410) capable of storing data, database interface layer (310) providing an interface to the database, a basic functionality layer (320) comprising at least one module capable of performing basic functions, and a mediation functionality layer (330, 340) comprising at least two modules each capable of performing at least one mediation function on the data in the in-memory database via the modules at the database interface layer and/or basic functionality layer.

Abstract: A process is disclosed for the computer management of inverted lists and inverted indices, in which the standard representation and processing of inverted lists is changed in order to achieve a simpler, more compact and more efficient architecture.

Abstract: Disclosed is a method and an apparatus for optimally processing N sort queries in a multi-range scan, including: allocating a buffer based on a first number of extracted records included in the queries; extracting first data related to first attributes in a first list included in the queries and storing the extracted first data in the buffer; extracting second data related to the first attributes that are not extracted in the first list included in the queries; and updating the buffer so as to satisfy the queries by comparing the data stored in the buffer with the second data, wherein the queries are N sort queries in a multi-range scan for at least one record sorted based on the first attributes and second attributes.

Abstract: Methods, systems, and apparatus, including computer program products, for selectively presenting search results responsive to search query suggestions. In one aspect includes receiving a partial search query including one or more characters; generating a first query suggestion based on the partial search query; determining whether the first query suggestion meets a filtering criterion, where the filtering criterion is a criterion specifying one or more filtering criterion topics against which the first query suggestion is evaluated independent of search results responsive to the first query suggestion; providing the first query suggestion; and in response to determining that the first query suggestion meets the filtering criterion, preventing a first set of one or more images responsive to the first query suggestion from being presented to a user.

Abstract: Systems and methods for identifying candidate queries related to a trending topic based on a user query are described. A trending topic identification module identifies topics trending in one or more real-time content sources. The real-time content source(s) may include, for example, a source of microblog posts or other user-generated data, a news feed, or the like. A query recommendation module suggests at least one candidate query in response to receiving a user query. The query recommendation module obtains the at least one candidate query by comparing words and named entities of the user query with words and named entities associated with the trending topics identified by the trending topic identification module.

Abstract: Visual incongruity in search result sets may be reduced at least in part by searching an optimized visually significant subset of a category tree that categorizes a collection of content. The category tree may be optimized at build time at least in part by pruning with respect to visual coherence and by the size of the content collection subset referenced by particular categories. Content collection subset sizes both too large and too small can detract from the visual significance of a particular category. The visually significant subset of the category tree may be further optimized at query time by intersecting the visually significant subset with the query-associated sub-tree(s) and further pruning categories in the visually significant subset that have child categories in the visually significant subset. Searching with respect to the optimized visually significant subset can also improve search efficiency.

Abstract: An item is determined to exist in a dataset by arranging the dataset into a plurality of subsets, each bounded by the minimum amount of memory that may be transferred between levels of memory in a memory configuration. The item and the subsets have attributes that allow for a determination of which subset the item would exist in if the item were in the dataset. A singular subset is transferred between levels of memory to determine whether the item exists in the transferred subset. If the item does not exist in the transferred subset, it is determined that the item does not exist in the dataset.

Abstract: Various embodiments for storing a logical object are provided. In one such embodiment, by way of example only, incoming data is divided corresponding to a logical data object into a plurality of independent streams, associating each data chunk of a plurality of obtained data chunks with a corresponding stream among the plurality of independent streams. At least one of the obtained data chunks and derivatives thereof is sequentially accommodated in accordance with an order the obtained chunks are received, while keeping the association with the corresponding streams. A global index is generated as a single meta-data stream accommodated in the logical data object and comprising information common to the plurality of independent streams and related to mapping between data in the logical data object and the obtained data chunks.

Abstract: This document describes, in various implementations, controlling access to information stored in a storage device. The information stored in the storage device is accessed in a desired order without sorting the stored information prior to access.

Abstract: A method and system of classifying documents is provided. The method includes receiving a plurality of documents from at least one user, wherein each document includes information relating to a customer support issue or sentiment and identifying at least one customer support issue or sentiment contained within each document. The method also includes classifying the documents satisfying a confidence threshold using a classifier, clustering the remainder of the plurality of documents into groups using a clustering engine, the clustering engine applying a word analysis, and outputting a frequency of each identified customer support issue or sentiment, the frequency based on the classifying or the clustering.

Abstract: An approach for adapting a metadata framework in accordance with metadata manipulations is provided. The approach includes determining a first metadata associated with a first content item representing sensor information and a second metadata associated with a second content item representing sensor information. The approach also includes determining a third metadata based on the first metadata and the second metadata and associated the third metadata with a third content item.

Abstract: A method, article comprising machine-readable instructions and apparatus that processes data systems for encoding, decoding, pattern recognition/matching and data generation is disclosed. State subsets of a data system are identified for the efficient processing of data based, at least in part, on the data system's systemic characteristics.

Abstract: Systems and methods are provided for enabling a user to associate a story with one or more referents. In some embodiments, information representing a first version of a story may be caused to be displayed, and in the display of information representing the first version of the story, a user may be enabled to associate a referent with a first point in the first version of the story, where the referent is at least one of an event, a character, an object, a subject, a time, a place and a person. In some embodiments, the referent may be automatically associated with a second point in a second version of the story based at least in part on a point map associated with the first version of the story and the second version of the story.

Abstract: A mechanism is provided for cross-allocated block repair in a mounted file system. A set of cross-allocated blocks are identified from a plurality of blocks within an inode of the mounted file system, based on a corresponding bit associated with each cross-allocated block in a duplicated block information bitmap being in a first identified state. The set of cross-allocated blocks are repaired using a user-defined repair process. Then one or more of the set of cross-allocated blocks are deallocated based on results of the user-defined repair process.

Abstract: A method of and system for managing a data set of a storage facility is disclosed. The data set may be a sequential-access data set. The method and system may include structuring the sequential-access data set to have a first group-of-records configured for adding a second group-of-records to the sequential-access data set. The method and system add a second group-of-records to the sequential-access data set. The method and system merge the second group-of-records with the first group-of-records in response to a triggering event. The method and system establish, in response to merging the second group-of-records with the first group-of-records, a marker configured to indicate the first and second group-of-records, as merged, is sorted.

Abstract: Geographic data structuring and analysis is described. In one embodiment, a method for geographic data structuring and analysis is described, including parsing a set of geographic objects into groups of geographic objects, and assigning one or more attributes to the parsed geographic objects. The method may further include accessing a database of geographic object feature data and assigning certain features to certain attributes of the geographic objects, rendering one or more of the geographic objects in relation to geospatial topology information, and analyzing the rendered geographic objects. In certain aspects, systems and methods described herein provide functions attributable to Geographic Information Systems using rendering processors and engines that would otherwise be unable to achieve such functions.

Abstract: As described herein, a database machine is provided with specialized hardware that can be used to accelerate the sort function. This hardware lowers the computation cost of performing a raw sort operation over the result rows. The hardware may be embodied in a direct circuit (e.g., ASIC), a programmable circuit (e.g., FPGA), a parallel compute engine (e.g., GPU) or any parallel computer. A hardware-assisted sort procedure provides for the early return of up to K results. This early return feature is critically valuable in database operations because often an entire result set is not required. For requests that require only the first L results, when L<=K the query can be satisfied with only a single pass over the data. The hardware- or GPU-assisted sort procedure, referred to herein as “scraper sort,” may be based on modifications of well-known, existing parallel sort algorithms.

Abstract: A computer-implemented method for organizing data using basic atomic units of information includes generating an object of interest (OI) comprising an OI name and an OI description. The OI is a basic atomic unit of information. The OI comprises an audience and data associated with the OI is searchable. The method includes assigning one or more characteristics to the OI. The one or more characteristics of the OI are searchable. A first OI is linked with one or more second OIs having at least one overlapping audience or characteristic. The second OI is accessible by a link displayed in the first OI. The first OI is displayed in a visual format that is accessible to a plurality of users.

Abstract: Embodiments include methods, systems and computer program products for performing a composite sort on a tunable hardware sort engine includes determining desired sort performance parameters, configuring a composite sort engine based on the desired sort performance parameters, and receiving a plurality of keys having a payload associated with each of the plurality of keys. The method also includes reserving DRAM storage for each of the payloads, generating a tag for each of the plurality of keys, the tag identifying the DRAM storage reserved for each of the payloads, and storing the payloads in the portions of the DRAM storage. The method further includes generating a composite key for each of the plurality of keys, sorting the composite keys by the composite sort engine, and retrieving the payloads associated with the sorted composite keys from the DRAM storage. The method also includes outputting the payloads associated the sorted composite keys.

Abstract: Mechanisms for displaying an ordered sequence of images are provided. The mechanisms receive a search query as input from a user. The search query includes a start point and an end point of a virtual tour. The start point and the end point determine a boundary of the virtual tour. Based on the search query, images that are within the boundary of the virtual tour defined in the search query are collected. At least a subset of the collected images are displayed in an ordered sequence in accordance with the boundary of the virtual tour.

Abstract: Embodiments include methods, systems and computer program products for performing a tournament tree sort on a hardware accelerator. The method includes receiving a plurality of key values by the hardware accelerator, storing each the plurality of keys into a location on a memory of the hardware accelerator, and creating a pointer to each of the locations of the plurality of keys. The method also includes storing the pointer to each of the plurality of keys into a first array stored by the hardware accelerator, sorting the plurality of keys by ordering the pointers in the first array and by using a second array for storing the pointers, wherein the sorting identifies a winning key from the plurality of keys in the memory, and outputting the winning key.

Abstract: Disclosed are various embodiments for presenting content items that are related to media items that are currently being consumed by a user. A media item in a stream of media items being presented to a user is identified. A content item that is relevant to the media item is determined. An entry is added to the entries of a relevant content listing. The entry includes a link to the content item. The entries in the relevant content listing are chronologically correlated to the stream that is being presented to the user. The relevant content listing is updated in a user interface that is being presented to the user.

Abstract: Disclosed herein are systems, methods, and computer-readable media for dynamically managing data-centric searches. The method includes identifying an event related to domain-specific searches to a database, identifying data at a first memory location in the database, duplicating the data to a new memory location, and distributing processing more domain-specific searches amongst an expanded search space including the new memory location and the first memory location. The expanded search space can be reduced or collapsed in response to a reduction event by removing duplicate data from the first memory location or the new memory location and adjusting the distribution of processing amongst the remaining memory location. The method can optionally include organizing multiple events by network segment, identifying a network segment associated with domain-specific searches, and duplicating the data to a new memory location in close proximity to the identified network segment.

Abstract: Techniques to search for data elements in a distributed computing environment are described. An apparatus may comprise a processor and a memory unit communicatively coupled to the processor. The memory unit may store a correlation module that when executed by the processor is operative to determine a target rank position at a target percentile rank within a total data set. The correlation module may determine a target data item at the target rank position for the total data set using candidate data items at candidate rank positions for each of multiple sorted data subsets of the total data set, and correlation values associated with each of the candidate data items. Other embodiments are described and claimed.

Abstract: A method for determining a cause of events detected in a plurality of interactions includes: identifying, on a processor, a plurality of elements in the interactions; detecting, on the processor, a plurality of sequences of elements in the interactions; mining, on the processor, the plurality of sequences for generating a set of supported patterns; computing, on the processor, association rules from the set of supported patterns; and returning the computed association rules.

Abstract: Techniques for automatic sort and propagation of information relating to electronic documents are presented. With regard to an electronic document, such as an incoming message, an enhanced information management component (EIMC) can analyze the document to identify a file folder associated with a subject to which the document relates. Based on interaction with or tagging of the document in a first user interface (UI) and predefined user preferences, the EIMC can propagate information relating to the subject and/or document to a second UI. The EIMC can archive the document in the identified file folder automatically or in response to as little as one UI control manipulation. The EIMC can analyze audio or video content to facilitate tagging and archiving of such content using the first UI and propagation of information relating to such content and/or related subject to a second UI.

Abstract: A method for matching bulk data, involving receiving a plurality of input records, performing block distribution on the plurality of input records to obtain a plurality of block records, wherein performing block distribution comprises distributing the plurality of input records to a first plurality of containers, performing concurrent matching operations on the plurality of block records to obtain a plurality of single best records, and loading the plurality of single best records into a master index database.

Abstract: A method, system and a computer program product for generating an image tour in response to a search query in one or more multimedia databases includes determining information corresponding to a first and last image of the image tour by conducting an analysis of the search query. Based on this information, the first and last images satisfying a first pre-defined criteria are identified from the multimedia database. At least one intermediate image satisfying a second pre-defined criteria is identified from one or more videos of the multimedia database based on the identified first and last images. The image tour is generated by placing the identified intermediate images between the first and last images.

Abstract: A first server is configured to receive one or more summarized data groups from a second server. Each summarized data group may include: information regarding a quantity of a group of records, where the group of records includes records associated with a record type and a time interval; information regarding a quantity of records associated with an indicator within the group of records; and information regarding a failure rate associated with the group of records based on the quantity of records associated with the group of records and the quantity of records associated with the indicator within the group of records. The first server is further configured to determine a threshold based on the summarized data groups and based on the failure rates associated with the summarized data groups and send an indication to the client device based on determining that the failure rate does not satisfy the threshold.

Abstract: A method and system for sharing knowledge may include receiving information input into a database and organizing items of information in the database. Some embodiments may also include collecting ratings and comments associated with each item of information and allowing users to access and sort items of information according to selected rating criteria in order to find the most reliable and/or valuable information from the database. The described system and method may allow individual members to easily locate the items of information from a collectively generated knowledge base that is presented in accordance with that individual's personal measure of value in the information.

Abstract: There are provided methods and systems for efficient search in a peer-to-peer network topology. In various embodiments, search methods and systems provide for response times and network traffic that are independent from the number of query terms, thereby producing constant run-time searches and bandwidth hits in a P2P network search implementation. By distributing inverse indexes between peers, and storing with each inverse index a Bloom filter populated with selected keywords, multi-term search and analysis can be conducted on one network node without requiring exchange of posting lists between various network nodes.

Abstract: Techniques for external application-directed data partitioning in data exported from a parallel database management system (DBMS) are provided. An external application sends a query, a total number of requested access module processors (AMPs), and an application-defined data partitioning expression to the DBMS. The DBMS executes the query with the results vertical partitioned on the identified number of AMPs. Individual external mappers access their assigned AMPs asking for specific partitions that they are assigned to process the query results.

Abstract: Disclosed is an object placement device and the like that enable to determine an approximate balance in quantity of objects which should be placed in each related placement destination (PD) with a relatively simple processing configuration when a plurality of objects is placed in individual PDs, and the objects that must be moved can be kept to a minimum when PDs increase or decrease. This object placement device 10 includes a function 22 which, on the basis of identification information 11 generated on the basis of information that is specific to an target object to be placed in a PD 14, generates space designation information 15, and a function 24 determines, when the space designation information 15 indicates a specific partial space information included in relational information 12, such that the target object is placed in a PD corresponding to a specific PD identifier associated in the relational information.

Abstract: The present inventor devised systems, methods, interfaces, and software that can facilitate generation and presentation of legal trend data based on legal documents, such as caselaw documents or court docket documents.

Abstract: A highly flexible and extensible structure is provided for physically storing tabular data. The structure, referred to as a compression unit, may be used to store tabular data that logically resides in any type of table-like structure. According to one embodiment, compression units are recursive. Thus, a compression unit may have a “parent” compression unit to which it belongs, and may have one or more “child” compression units that belong to it. In one embodiment, compression units include metadata that indicates how the tabular data is stored within them. The metadata for a compression unit may indicate, for example, whether the data is stored in row-major or column major-format, the order of the columns within the compression unit (which may differ from the logical order of the columns dictated by the definition of their logical container), a compression technique for the compression unit, the child compression units (if any), etc.

Abstract: A sorting method of data documents is provided, adapted to an electronic device. The sort method includes the following steps: retrieving a plurality of keywords from contents of a plurality of data documents; retrieving corresponding keyword rankings of the plurality of keywords by a search engine; searching corresponding keyword categories of the plurality of keywords; and generating a sort algorithm based on the plurality of keywords, the keyword ranking and the keyword category of each of the plurality of keywords, and a current ranking of each of the plurality of data documents, wherein the sort algorithm is used to calculate a predicting ranking of another data document and to sort the another data document.

Abstract: A unique application within Video that allows for user generated Meta-tagging to be delivered in real time to individual clips is provided. This meta-tag creates its own tail based upon the user generated words population, which is searchable via a “spider network” that runs invisible behind the web pages of the site. These same “tagged” words are broadcast over various delivery networks including but not limited to live feeds from SMS, MMS, News Feeds within Community Web Sites, Video Sharing Web Sites, Widget applications any other forms of electronic communication that will be dropped in real time to identified users and friends of users.

Abstract: According to certain embodiments, a search query for a search of samples of sensor data is received. The search query indicates one or more requested values of one or more data parameters. The samples are represented by a characteristic function indicating whether a given binary representation represents a sample. A query function representing the one or more requested values is formulated. The query function and the characteristic function are used to identify one or more samples that have the one or more requested values.

Abstract: The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy.

Abstract: A predefined sorting policy includes at least two sorting rules. Each one of at least two sorting rules is a static sorting rule or a dynamic sorting rule and is configured with a priority. Contact information is obtained according to the predefined sorting policy, wherein the contact information includes dynamic information and/or static information. Applying an order of the at least two sorting rules is determined in a descending order of priorities of the at least two sorting rules. The contacts are sorted according to the at least two sorting rules in turn based on the obtained contact information.

Abstract: A method and an apparatus for managing contents are provided. The method includes determining a current time when a request for generating contents is made, determining a reference time corresponding to a standard time in a preset time zone based on the current time, storing the current time and the reference time in metadata of the contents, and storing the contents.

Abstract: A computer implemented system and method in a client-server environment, is provided for document research, aggregation, and compilation. The system and method includes a server having a search module configured to generate a search interface displayable to a client communicably coupled to the server, and responsive to instructions received via the search interface, to search and sort selections of interest within a plurality of source documents. A customized report module is configured to generate a custom report interface displayable to the client, and responsive to user selection instructions received via the custom report interface, to extract and aggregate the selections of interest into a customized report. Format modules are configured to respectively enable source documents in mutually distinct formats such as the PDF, PPT, and XLS formats, to be searched, sorted, and aggregated by the search module and customized report module.

Abstract: An information processing device includes a file-information acquirer and a conversion-management information generator. The file-information acquirer is configured to acquire file information that is information regarding a file to be subjected to conversion processing for converting a clip format. The conversion-management-information generator generates conversion management information that manages an identity of a clip created by the conversion processing performed on a clip to which the file corresponding to the file information belongs, by using the file information acquired by the file-information acquirer.

Abstract: Systems, methods, and computer readable media for automatically generating Data Definition Language (DDL) commands from database log information is described. In general, techniques are disclosed for analyzing database log entries to identify those associated with targeted DDL commands and associating those entries with a DDL command object. The DDL command object may be used (immediately or at some later time) to generate a DDL commands corresponding to the (possibly many) aggregated log records associated with the command object. The use of multiple database log entries as described herein enables the generation of DDL commands that capture database activity occurring over a period of time (full time context auditing) and can, therefore, naturally account for database schema changes.

Abstract: Disclosure is related to a reconfigurable sorter and a method of sorting using the sorter. The reconfigurable sorting method is adapted to the sorter essentially consisting of multiple serially-connected comparison units. The each comparison unit includes two registers. The sorter is particularly a reconfigurable device according to the number of sorted numerals. According to the exemplary embodiment, an input mode is initiated firstly. Initial values are set to the registers. The numerals are sequentially inputted to the registers. At the input mode, the values in the registers may be shifted if necessary and mutually compared in every comparison unit. The values in the registers of every comparison unit may be swapped based on the comparison. At output mode, the numerals are outputted sequentially. The values in the registers are shifted and swapped until all numerals are completely outputted. The output appears the sorted numerals with low timing latency.

Abstract: A computing device maintains an input history in memory. This input history includes input strings that have been previously entered into the computing device. When the user begins entering characters of an input string, a predictive input engine is activated. The predictive input engine receives the input string and the input history to generate a candidate list of predictive inputs which are presented to the user. The user can select one of the inputs from the list, or otherwise continue entering characters. The computing device generates the candidate list by combining frequency and recency information of the matching strings from the input history. Additionally, the candidate list can be manipulated to present a variety of candidates. By using a combination of frequency, recency and variety, a favorable user experience is provided.