Abstract: A method for identifying an auto-complete communication pattern within a sequence of request entities includes grouping the request entities into a plurality of clusters according to a criterion. Clusters are removed from the plurality according to at least one of pattern analysis, a cluster size, and a cluster timing. Remaining clusters are identified as having an auto-complete communication pattern.

Abstract: Feature information, such as street address data, is provided by multiple sources of varying levels of trust. The street address data provided by these sources may include various representations of an address for a map feature. Thus, overlapping street address data for the map feature exists. In one embodiment, a feature selection server merges the street address data for the map feature to create a representative street address for the address data provided from multiple sources.

Abstract: The question and answer data editing device for editing dialog content to generate question and answer data, includes a detecting unit that detects a part of the dialog content similar to existing question and answer data stored, and a extracting unit that extracts a context in which the dialog content is made from dialog content in the proximity of the similar part detected and registers the context extracted as new question and answer data or as index information of the question and answer data.

Abstract: A search engine optimizer that works independently and in parallel with a browser and search engine supercomputer to gather, analyze, and distill input information interactively. The optimizer reorganizes the input, and provides an optimized version as an output. The optimized version of the input (e.g. output) is sent to the search engine, which responds to the end user with search results. The optimizer recognizes each request as a pattern and stores the pattern in an advanced Glyph format. This permits the optimizer to identify a left and right side human brain checkmate combination required to achieve certitude.

Abstract: Methods, systems, and apparatus are described that include receiving a sequence of one or more characters representing a first partial query entered into a search field on a computing device. A first list of query completions for the first partial query is provided for display on the computing device. One or more additional characters are then entered into the search field, where the sequence of characters and the additional characters cumulatively represent a second partial query. A second list of query completions are then obtained for the second partial query, and one or more query completions appearing in the first and the second lists are identified. Demotion scores for the identified query completions are then calculated which are used to demote the identified query completions to a lesser position within the second list, thereby forming a refined second list for display on the computing device.

Abstract: While using an online application, information received or selected by a user is associated with a context. For example, a search query is received from a user and the search query is associated with a context. The user is provided with a recommendation to join a discussion forum that corresponds to the context, thereby dynamically aggregating users. The recommendation may be provided conditionally, if predefined criteria are satisfied. Alternately, in some embodiments a recommendation may be made unconditionally.

Abstract: Disclosed is an information processing apparatus provided with a software environment in which a function of the information processing apparatus is added and deleted by a plug-in and having a storage unit which stores, in a prescribed storage region, information that is composed of one or more attribute data and the function uses.

Abstract: In a Virtual Input/Output (I/O) Server (VIOS) partition within a data processing system that comprises cluster-aware VIOSes, a method includes: performing, via a backup/restore utility of a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS partition, a backup operation on the first VIOS partition, which creates a first configuration backup file having configuration information about the hardware, logical and virtual devices of the VIOS partition; storing the configuration backup file within local storage; and responsive to receipt of a VIOS restore command: retrieving the configuration backup file from the local storage; and restoring the configuration of the hardware, logical and virtual devices of the first VIOS to a state that existed at a time at which the backup operation creating the configuration backup file was performed.

Abstract: Techniques for reducing the memory used for processing events received in a data stream are provided. This may be achieved by reducing the memory required for storing tuples. A method for processing a data stream includes receiving a tuple and determining a tuple specification that defines a layout of the tuple. The layout identifies one or more data types that are included in the tuple. A tuple class corresponding to the tuple specification may be determined. A tuple object based on the tuple class is instantiated, and during runtime of the processing system. The tuple object is stored in a memory.

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 method, a computer program product and a system are provided for archiving emails, where the email system includes at least one user mailbox configured to receive and store emails within the user mailbox and send emails from the user mailbox. User-specific metadata corresponding with emails received and sent by each user mailbox is collected. The collected user-specific metadata is analyzed to provide a predictive indication when and which emails will be archived for each user mailbox, and emails are archived for user mailboxes based upon the predictive indication for each user mailbox.

Abstract: Methods, systems and computer program products are provided that may relate to controlling access to or accessing computer files over a computer network. A file server may execute on a first computer system and a client may execute on a second computer system. The client may be configured to send a first communication to the file server relating to a first computer file stored on the first computer system. The first communication may include first access control data associated with the first computer file. The file server may be configured to receive the first communication and extract the first access control data from the first communication. The file server may then store the extracted first access control data in extended attributes of the first computer file on the first computer system.

Abstract: Systems and methods are provided for data processing and storage management. In an illustrative implementation an exemplary computing environment comprises at least one data store, a data processing and storage management engine (B-File engine) and at least one instruction set to instruct the B-File engine to process and/or store data according to a selected data processing and storage management paradigm. In an illustrative operation, the illustrative B-File engine can generate a B-File comprising multiple buckets and store sample items in a random bucket according to a selected distribution. When the size of the B-FILE grows to reach a selected threshold (e.g., maximum available space), the B-File engine can shrink the B-File by discarding the largest bucket. Additionally, the B-File engine can append data to existing buckets and explicitly cluster data when erasing data such that data can be deleted together into the same flash block.

Abstract: A method includes receiving input indicating a listener object and an interface for an object class corresponding to a persisted object of an object model retained by a database, where the interface has multiple different implementations within the object model; recording information indicating that the listener object has an interest in persistent data associated with the interface for the object class corresponding to the persisted object; in connection with a transaction with the database and when each of multiple calls is received for the database, checking whether the interface for the object class corresponding to the persisted object is associated with the call, wherein each of the calls alerts the database to changes for data managed by the database; and communicating with the listener object when the interface for the object class corresponding to the persisted object was associated with at least one of the calls during the transaction.

Abstract: Systems and methods for performing latency-free database searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set.

Abstract: A process is described for assessing the suitability of particular keyword phrases for use in serving contextually relevant content for display on pages of network-accessible sites. In one embodiment, the process involves scoring the key phrases based in part on collected user behavioral data, such as view counts of associated social media content items. A process is also disclosed in which selected keyword phrases on a page are transformed into links that can be selected by a user to view bundled content that is related to such keyword phrases.

Abstract: Systems and methods for performing latency-free contact searches using two-level indexed data structures having decreasing integer sets as identifiers to represent actual contact data. The indexed data structures are stored in distributed memory. Data operations such as intersection and union are performed using the indexed data structures. A binary interval reduction technique is used to quickly move through the data sets looking for common elements for the intersection set, or unique elements to add to the union set.

Abstract: An audience selection system for the selection of an entity, based on an entity's consumption history without requiring the storage of a content descriptor for identifying content previously accessed by the entity. By directly and/or indirectly observing the usage of words used to locate content through a search engine over time for a population, a list of depersonalized keywords can be discovered, creating the ability to characterize content based on depersonalized keywords. A protected consumption history can be recorded for an entity using depersonalized keywords instead of recording a content descriptor for identifying the content. Depersonalized keywords do not uniquely identify content. Associating depersonalized keywords with an entity does not mean that the entity has used those depersonalized keywords; it only means that the entity has accessed content which has been accessed in the past by other entities in a population using the depersonalized keywords.

Abstract: A method of executing a word search on a computer with a software program mimicking the human brain by adding knowledge, understanding and wisdom to simulate deductive reasoning to create a language based equation and a geospatial based equation includes the steps of assigning a unique value from lowest to highest to lowest; organizing and distributing the Internet environment into quality partitions from lowest to highest establishing a glyph database; processing the impact of a managerial hierarchical related group of index relationships to create an equation that shrinks the search environment; organizing and distributing the Internet using human brain tendencies; and modifying each the request by: identifying for each static and dynamic request the best suited search pattern within the search pattern database and automatically sending the preprocessed results to the end of a user's browser as output.

Abstract: Ranking search results, comprises retrieving search results that include target strings that relate to a query string; segmenting the query string and each of the target strings; pairing segments in the query string with respective segments in the target strings to form combinations; retrieving weights that correspond to the combinations; and determining a weighted word length based on the weights corresponding to each of the target strings; and ranking the target strings based on their respective weighted word lengths. Alternatively, ranking search results includes determining a minimum weight of each inserted word with respect to segments in the query string; determining a minimum weight of each deleted word with respect to segments in the target strings; determining a total edit distance for each target string; and ranking the target strings based on the total edit distances.