Abstract: A system for enabling enhancement of a text-based message with visual assets, the system comprising: input means for receiving message text; a data store comprising a plurality of visual assets; search means arranged to compare data related to the message text received at the input means against data related to the plurality of visual assets stored in the data store in order to identify at least one visual asset that corresponds to a portion of the message text; composing means arranged to receive the at least one visual asset identified by the search means and to compose at least one composed asset set in dependence upon the at least one visual asset identified by the search means and the message text received at the input means; output means arranged to output the at least one composed asset set.

Abstract: In one embodiment, an original search input entered by a user is detected. An excluded term is deleted from the original search input to create a modified search input. The modified search input is matched against a plurality of stored terms. In response to there being a match between the modified search input and one or more of the plurality of stored terms, a suggestion of a search term to replace the original search input is displayed, based on the match between the modified search input and one or more stored terms. In response to there not being a match between the modified search input and one or more of the plurality of stored terms, a suggestion of a search term to replace the original search input is displayed, based on a match between the original search input and one or more of the plurality of stored terms.

Abstract: Routing method for computing routes over uncertain geo-spatial data whereby only upon visiting the geographic entities it can be determined whether the needed service or product is actually provided and is adequate. When dealing with uncertain data, the returned route may need to go via several entities of the same type. Another routing method consists of finding an efficient and effective route from a starting point to an ending point going trough a predetermined number of objects, wherein each object represents a geographical entity of a unique type, and each object is selected from a distinct set of similar objects.

Abstract: An approach is provided for determining related queries for a given search query based on the linking structure of electronic documents within a document set. Document titles are used to represent potential search queries and links between the electronic documents are used to determine relationships between the potential search queries. As such, the document set may be represented as a directed graph in which document titles (which represent potential search queries) are nodes and links are edges between the nodes. When a particular search query is received, a corresponding node is identified and related queries are determined by identifying other nodes having connections with that node.

Abstract: Systems and methods are disclosed for performing data storage operations, including content-indexing, containerized deduplication, and policy-driven storage, within a cloud environment. The systems support a variety of clients and cloud storage sites that may connect to the system in a cloud environment that requires data transfer over wide area networks, such as the Internet, which may have appreciable latency and/or packet loss, using various network protocols, including HTTP and FTP. Methods are disclosed for content indexing data stored within a cloud environment to facilitate later searching, including collaborative searching. Methods are also disclosed for performing containerized deduplication to reduce the strain on a system namespace, effectuate cost savings, etc. Methods are disclosed for identifying suitable storage locations, including suitable cloud storage sites, for data files subject to a storage policy.

Abstract: Techniques to automate the management of investor relations are disclosed herein. A vertical domain query language is introduced, specifically for investor relations. Graphical query builder tools to create queries in the vertical domain query language are described. Reports specific to investor relations, in particular reports to assess the efficacy of investor relations activities, are also described. Investor relations client applications that make use of user state, such as identity, date time stamp and geolocation are described.

Abstract: A bank maintains a financial document in a first storage system when a record date is later than a pre-selected date and in a second storage system when the record date is earlier than or equal to the pre-selected date. The bank receives and inputs a request for the financial document from a client and compares the record date to the pre-selected date to determine if the record date is later than, earlier than, or equal to the pre-selected date. In processing the request, the bank can utilize a computer terminal, connected to the storage systems through a processing unit, to access one of the storage systems in response to the comparison of the record date to the pre-selected date. After accessing the appropriate storage system, the bank retrieves the requested financial document and can then reproduce and distribute the requested financial document.

Abstract: A corpus contains information including text from books and metadata about the books. The book texts mention entities of various types, such as location, date, event, and person entities. An entity importance engine analyzes the information in the corpus to identify the entities mentioned therein, and ranks the entities using query-independent importance scores. The importance scores can be based in part on the contexts in which the entities are mentioned by the books. A presentation engine enables searching of the corpus to identify books satisfying a search query. The presentation engine presents information about a designated book. Entities mentioned in the book are presented in a style selected to enhance comprehension and utility. For example, location entities can be presented on a map with markers showing the locations of the entities. The number of entities presented are limited and ordered based on the query-independent importance scores.

Abstract: An advertising method controls the display of information on a client device. A user accesses first content on a server and a first link reference to second content is created. The first content and the first link reference are displayed in separate areas. User interaction with the first link reference sends second content to replace the first content on the content display area of the client computer. The second content includes a second link reference which can redirect the user to the hosting location of the second content. The server may operate as a wireless node. The first content is optionally parsed to key words or objects and the parsed content is used to identify the second content. Optionally, receiving data from a user's wireless device relates to user location; and, the location data is used to identify the second content.

Abstract: A method for information delivery is disclosed. The method includes directing the display of a multimedia presentation in a first screen segment. The multimedia presentation is associated with a reference tag descriptive of an aspect thereof. An information link corresponding to the reference tag in a second screen segment is generated. The information link is contextually related to the multimedia presentation in accordance with the reference tag. Thereafter, a selection input of the information link is received from one of the viewers while mitigating obstruction of the displaying of the multimedia presentation. The selected information link and the identity of the viewer are associated as a marker.

Abstract: A system and method of massively parallel data processing are disclosed. In an embodiment, a method includes generating an interpretation of a customizable database request which includes an extensible computer process and providing an input guidance to available processors of an available computing environment. The method further includes automatically distributing an execution of the interpretation across the available computing environment operating concurrently and in parallel, wherein a component of the execution may be limited to at least a part of an input data. The method also includes automatically assembling a response using a distributed output of the execution.

Abstract: A method includes receiving, at a message processing system that includes a processor and a memory, a message from an originator. The message includes content related to a particular service of a plurality of services. The method includes selecting a set of potential responses to the message at the message processing system based on the particular service. The method also includes retrieving account information related to the originator of the message at the message processing system. The method further includes filtering the set of potential responses at the message processing system to provide a filtered set of responses. The set of potential responses is filtered based on the account information. When a first response has a confidence level that exceeds a threshold confidence level, the method includes sending the first response from the message processing system to the originator of the message without sending the filtered set of responses to an agent.

Abstract: A technique for dynamic integration and semantic analysis of structured data and unstructured textual data including: defining and selecting static attributes and dynamic attribute from structured data, embedding static and dynamic views of the selected corresponding attributes in an annotated document, linking the unstructured textual data with the structured data using the defined static and dynamic attributes, populating an annotated document structure of multiple annotated documents, performing semantic analysis of a query across the unstructured textual data and structured data, querying the annotated document structure to provide query results satisfying static part of the query, processing static and dynamic parts of the query by querying structured data and the annotated document structure, as appropriate, and providing a combined query processing result satisfying the dynamic and static part the query. Other embodiments are also disclosed.

Abstract: An information retrieval system for biomedical information uses a supervised machine learning system to identify keywords to improve search efficiency. The supervised machine learning system may be trained using a set of clinical questions whose keywords have been extracted, for example, by trained individuals. Weighting of search terms in the document query process is based at least in part on keywords identification.

Abstract: The disclosure describes search systems and methods in which exact token searches, spelling suggestions, and split-token searches are used in conjunction to return search results to the user. Depending on the number and relevancy of results for the search query results from each of the steps the results are either merged or discarded into the final result set. The split-token search is adapted to generate two split-tokens from the token(s) of the search query in anticipation that the search token(s) is misspelled. As the location of the misspelling is unknown, the split-token search widens the scope of the results provided in response to the search. In an embodiment, the split-token search includes performing a prefix search for tokens matching a prefix split-token and a postfix search for tokens matching a postfix split-token. In an embodiment, the index is specially adapted to allow the postfix search to be performed more efficiently.

Abstract: Software development items can be represented in a graph data structure. Relationships between the represented items can be detected and reflected in the graph data structure. Queries can be run against the data structure to determine which software development items are related to each other. Implicit query can be implemented in a software development context. A graph browser can present panes showing related items. In some embodiments, a set of regular expressions can be used to identify paths in a graph. Probability scores for the identified paths can be computed. Path data for the identified paths, including the probability scores, can be stored in a searchable location accessible by one or more applications. A query of the path data can be processed to return query results associated with at least one of the identified paths.

Abstract: The present invention provides an apparatus, system and method for a dedicated function, modular computing solution. The apparatus, system and method include a base microprocessing unit, at least one peripheral interconnective with the base microprocessing unit, wherein the at least one peripheral alone imparts the dedicated function to the base microprocessing unit, and a limited function operating system provided with the base microprocessing unit, wherein the limited function operating system accepts a first application for at least partially operating the at least one peripheral provided with the at least one peripheral, and wherein the limited function operating system includes a second application for seeking topical information, regarding a topic searched, that is recommended by one or more qualified experts in the topic searched.

Abstract: This invention provides an information search system including a management table which stores a name of a memory area and memory area information indicating the memory area in association with each other. When received source information search destination information indicates that source information to be searched is stored in a memory, the information search system searches the management table for a name of a memory area which matches a received source information name of the source information to be searched. When the name of the memory area which matches the received source information name of the source information to be searched is retrieved, the system acquires information which matches the received search target condition information from memory area information associated with the retrieved name of the memory area.

Abstract: A system and method for context based query augmentation. A question is received over a network from a questioning user comprising an identification of a user and at least one question criteria. A first query is formulated so as to search, via the network, for user profile data, social network data, spatial data, temporal data and topical data so as to identify user context data relevant to question criteria. The question is modified using the user context data to create at least one modified question having at least one additional criteria based on the user context data. A second query is formulated so as to search, via the network, for knowledge data, user profile data, social network data, spatial data, temporal data and topical data so as to identify knowledge data relevant to the identified user and the modified question criteria. The knowledge data is transmitted, over the network, to the questioning user.

Abstract: Creating and executing a distributed stream processing operator graph based on a query. The operator graph includes movable stream algebra operators for processing events received from high volume data streams. The operators are partially compiled and distributed to computing devices for completion of the compilation and subsequent execution. During execution, the operators maintain minimal state information associated with received events via an expiration time assigned to each of the event instances. Additional events are generated and aggregated by the operators for communication to a service responsible for the query.

Abstract: Parsing of event queries in an enterprise system is described. The enterprise system receives queries, which are broken down into query components. The query components each represent segments of the query. The enterprise system identifies sources of event data and sends queries towards the sources of the event data. The query components are processed close to the data source. The responses are combined to generate an event query response that indicates the event data of each of the query components.

Abstract: Search may be performed on a user device, such as a handheld electronic book reader device. A search query term may be received. Text of a collection of electronic items stored in memory of the user device may be searched for the queried term. Search results may be returned identifying locations in the electronic items at which the queried term appears.

Abstract: Query aware processing. An example method of processing mark-up language documents includes receiving a plurality of conditions and desired output format from a plurality of clients, and a mark-up language document. The method also includes determining whether the mark-up language document satisfies the plurality of conditions. If the mark-up language document satisfies at least one condition of the plurality of conditions then at least one of unparsed mark-up language document, part of the unparsed mark-up language document, a document object model of the mark-up language document, and part of the document object model of the mark-up language document is provided based on the desired output format.

Abstract: Methods and system for text conversion are described. In one embodiment, free-form text associated with an item may be received. The item may be identified based on the free-form text. The item may be compatible with a parent item. The parent item may be identified based on the free-form text. An item descriptor may be identified in the free-form text. The item descriptor may be a particular term of the free-form text. Compatibility-based text may be constructed for the item based on identification of the parent item and the item descriptor. The compatibility-based text may be capable of being used to identify a plurality of matching items. Additional methods and systems are disclosed.

Abstract: A method and apparatus for efficient indexed storage for unstructured content have been disclosed.

Abstract: In this paper, we propose a new approach to extracting question-context-answer triples from online discussion forums. More specifically, we propose a general framework based on Conditional Random Fields (CRFs) for context and answer detection, and also extend the basic framework to utilize contexts for answer detection and to better accommodate the features of forums.

Abstract: A method and system are described for providing context sensitive data to a system user. The method includes the steps of identifying the user and querying databases to create a user context. Information is aggregated from the network databases and filtered using the user context. Providing the correct data needed by the user for that particular time, location and job function.

Abstract: A search device creates as many stack frames as the number obtained by adding one to the number of search condition character strings contained in an out-of-search-condition character string in a stack, sequentially inputs character strings in a text into automaton data, determines whether the character strings in the text hit the search condition character string or the out-of-search-condition character string to push correspondence to the stack or to change correspondence into non-correspondence, and determines whether the text is to be searched.

Abstract: Search and retrieval of information shared between members of a social mobile networks is facilitated. The search returns results in an order that is based on relevance measurements unique to each member. A comprehensive map of the interactions and behaviors that take place between the members of a social mobile network is discovered and maintained. Such maps are used to assign a unique relevance measurement for each member of each social mobile network.

Abstract: Systems and methods for efficiently identifying emails with content similarity are disclosed. In one embodiment, a method comprises grouping a first set of a plurality of email documents with only common-type subsets of character sequences in a first searchable group, and grouping a second set of the plurality of email documents with one or more uncommon-type subsets of character sequences in a second searchable group. The method further comprises selectively searching either only one of or both of the first and second searchable groups, and identifying selected one or more email documents of the plurality of email documents that may contain content that is similar to the particular email document based on the searching.

Abstract: An apparatus is provided which determines the naturalness of an array of words as a sentence. When an entire source text to be translated is not registered in a lexicon, the source text is divided into plural words. A parallel translation for each word in the source text is obtained to generate parallel translation patterns, and a web search is made for a text which includes each of the parallel translation patterns (step 36 to 44).

Abstract: This is a method and system for automated calendar event creation from unstructured text, with assisted administration and viewing.

Abstract: Facility information for a destination facility and facility information for a neighboring facility of the destination facility are accepted as search conditions. The destination facility that neighbors the neighboring facility is identified by using a database that defines a neighboring relationship between the facilities. The facility information for the identified destination facility is outputted.

Abstract: In a computing device, a method and system for searching for matching ink words or phrases, by comparing a given search term of at least one word (and possibly alternates) with the words in a document, including recognized ink words and any possible alternates for those recognized words as returned by a recognizer. Various matching tests are possible because of the use of alternates, which also may have corresponding probability rankings that may influence the search. Searching may occur in actively edited ink documents, or the recognition results may be saved as saved search file data that can be searched independent of recognition.

Abstract: Methods and systems for providing electronic notifications are described. A server is configured to serve an interface, such as a Web page, to a terminal that requests from a user a first set of user contacts to be used to provide notifications to the user by a telephonic notification system in response to a notification process initiated by an organization associated with the user. The interface further requests a first set of priorities corresponding to the first set of user contacts, wherein the notification system will attempt to provide notifications to the first set user contracts in an order based at least in part on the first set of priorities. A database is configured to store the first set of user contacts and the first set of priorities. A voice interface circuit is configured to transmit a voice notification to at least one of the first set of user contacts.

Abstract: A system and method for refining a string of search term used in a search of an electronic data base, by extracting phrases from a first result set of the search, selecting relevant phrases from among the extracted phrases, and adding the selected phrases to the original search term.

Abstract: Subject ranking management system provides a ranked search result for a given set of one or more search terms. The subject ranking management system determines, using a taxonomy, one or more parent subject items related to one or more matching subject items that match a given set of search terms. The system statistically ranks relevant subject items including the matching subject items and the parent subject items, and organizes the relevant subject items as ranked by the item ranking calculation unit. Ranked subjects can then be presented to an operator to assist with further refinement or used to automatically produce a better search without further operator invention.

Abstract: A computer method and system for intercepting email messages, scanning the email messages for key words, determining whether the key words match or relate to key words determined to relate to advertising content, and enhancing the email message by routing the emails to recipients in a manner so that highly relevant, highly targeted advertising tag lines or other content are displayed together with the emails when the emails are accessed and viewed by email recipients.

Abstract: A method of generating a set of search results. An audio content search results set including an individual audio content search result corresponding to a rich media time segment is generated. A visual content search results set including an individual visual content search result corresponding to the rich media time segment is also generated. A relevance of the rich media time segment is determined based at least in part on an individual search result count. The individual search result count is a sum of a number of individual audio content search results corresponding to the rich media time segment and a number of individual visual content search results corresponding to the rich media time segment. The rich media time segment is included in an ordered set of search results, wherein an order of the rich media time segment is based at least in part on the determined relevance.

Abstract: Search parameters and proximity criteria may be used to perform a proximity search. The proximity criteria may indicate a desired proximity among the search parameters in order for there to be a match. When there is a document that includes the search parameters that satisfy the proximity criteria, the search parameters in the document may be formatted.

Abstract: A document similarity detector may be used to determine a family of documents based on a similarity analysis between content of a seed document and content of the family of documents, the content of the seed document associated with at least one database object having at least one field. A content extraction system may be used to determine a ranking of a plurality of terms from within at least one document of the family of documents, based on a relative frequency with which each of the plurality of terms appears within the family of documents, and configured to extract at least one term from the plurality of terms as being associated with a value of the at least one field, based on the ranking.

Abstract: A method and apparatus for efficiently processing a query that specifies a location path and a content path is provided. The location path identifies the hierarchical location of a set of documents within a resource hierarchy. The content path identifies hierarchical location of one or more nodes within the content of the set of documents. Computing the query includes using a resource hierarchy index, based on the location path, to generate first results corresponding to the set of documents. Computing the query also includes using a content index, based on the content path, to generate second results corresponding to the one or more nodes. Final results of the query are based on the first results and second results by, for example, joining the first and second results.

Abstract: Systems and methods are provided to match facilitate advertising relationships among various advertising clients and non-profit organizations. In one embodiment, a web-connected database is employed to find non-profit programs or events that match parameters for desired advertising campaigns. Other embodiments may provide campaign records that match parameters of a non-profit organization's desired program or event. Formatted reports and chat capability may help facilitate the entities entering an advertising relationship. Database records and search parameters are provided to facilitate identifying beneficial opportunities. Methods are also provided for a third party provider to operate a server system and receive records of advertising client campaigns and non-profit organization programs or events.

Abstract: A core dump is processed to locate and optionally alter sensitive information. A core dump copy is created from at least a portion of an original core dump. Also, at least one input parameter is provided that corresponds to select information to be identified in the core dump copy and address information associated with the core dump copy is defined that corresponds to at least one of addresses where the select information can be altered and addresses where the select information should not be altered. Each occurrence of the select information located within the core dump copy is identified and optionally replaced with predetermined replacement data if the occurrence of the select information is within the addresses where the select information can be altered.