Abstract: A system and method for managing electronic files and tasks in a way that is intuitive to the users, mimicking their environment, but “Process-Blind’. The system and method comprise a configurable structure that facilitates the accurate filing and subsequent locating of electronic files in underlying document/record management applications. The manager enables users, with permissions, to communicate with each other regarding these files and their work through ad-hoc workflows that are created by the user as needed, then retained as documentation of events. The manager provides an efficient, secure, auditable handling of unstructured data that is free of predetermined inflexible processes and is not dependant on specific underlying document management software.

Abstract: Methods and systems for efficient query rewriting and the like are described here. One such described method comprises: offline mapping frequently-seen search queries to rewritten queries that may be better for searching; offline caching the mapping in a cache memory; and upon receiving a search query from a user similar to one of the mapped search queries, obtaining a corresponding rewritten query from the mapping in the cache memory based on predetermined conditions, and issuing a search of the rewritten query to the backend data system in order to avoid having to issue a search query to the backend data system twice while the user is online.

Abstract: Techniques for detecting, managing, and presenting syndication XML (feeds) are disclosed. In one embodiment, a web browser automatically determines that a web site is publishing feeds and notifies the user, who can then access the feed easily. In another embodiment, a browser determines that a web page or feed is advertising relationship XML, and displays information about the people identified in the relationship XML. In yet another embodiment, a browser determines that a file contains a feed and enables the user to view it in a user-friendly way. In yet another embodiment, feed state information is stored in a repository that is accessible by applications that are used to view the feed. In yet another embodiment, if a feed's state changes, an application notifies the repository, and the state is updated. In yet another embodiment, a feed is parsed and stored in a structured way.

Abstract: Provides methods, apparatus, and systems for computer aided authoring. Included are: a method for browsing an electronic document, an apparatus for aided authoring, an electronic document browser, a method for retrieving an electronic document, a system for retrieving electronic documents, a method for subscribing and publishing an electronic document as well as a system for subscribing and publishing electronic documents. An example method for computer aided authoring includes: generating one or more topic summaries based on an electronic document while a writer is writing said electronic document, wherein the reliability of the topic summary is ensured by the writer; and saving said topic summary information in correspondence with said electronic document.

Abstract: An information search system that enables efficient collection of information and support of formation of groups which people who share a same interest can join over a network. This system includes an intermediate server and a central server, wherein the intermediate server retains indexes for searching the content database on the central server. Users issue a search request to the intermediate server and search results are returned and recorded on the intermediate server as a search history. The search history is shared by users and used as references from which retrievable content can be selected.

Abstract: Systems and methods are described for analyzing the content of resource requests. A tokenizer parses the resource request and derives a key therefrom. A database associates values of the key with categories of service. An association engine uses the key to obtain one or more matching entries from the database, and derive therefrom the desired category of service for the resource request. A cookie engine derives cookie information from a cookie located in the resource request. A session engine derives session information from a session identifier located in a handshake message associated with the resource request. The desired category of service, the cookie information, and the session information are each useful for allocating a resource to the resource request.

Abstract: Methods and systems consistent with the present invention provide a host based positioning system. The host based positioning system includes a tracker hardware interface that connects to a dedicated hardware space vehicle tracker. The tracker hardware interface receives positioning information from the space vehicle tracker. The host based positioning system includes a layered approach to enable user applications on a host computer to access data from tracker hardware.

Abstract: A change list tracking mechanism supports features that require a record of values that have been modified in a document of a project management software application. Examples of the features supported include multiple undo, report generation, and audit logging. The change list tracking mechanism includes object containers and change lists. Each object container includes objects that are associated with properties of the document. A user who wants to be notified of specific modifications creates the change list to track modifications made to a specific object property in a particular object container. A property value identified in the change list may be modified by any user that accesses the document. The corresponding object container provides information about the modification to the change list. The user is identified and notified of the modification.

Abstract: Techniques are disclosed that locate implicitly defined semantic structures in a document, such as, for example, implicitly defined lists in an HTML document. The semantic structures can be used in the calculation of distance values between terms in the documents. The distance values may be used, for example, in the generation of ranking scores that indicate a relevance level of the document to a search query.

Abstract: A method of accessing information from a collection of data includes receiving a query, generating an inverse index of the collection of data and generating results to the query in conjunction with the inverse index.

Abstract: Enabling efficient navigation of a playlist of media files stored on a computer-readable medium. Aspects of the invention define a playlist structure to have one or more playlist units. Each playlist unit identifies one or more media files in the playlist and includes metadata for the media files. A consumer electronic device retrieves the playlist units and displays the metadata contained therein to a user to enable navigation of the playlist. Aspects of the invention reduce the memory requirements of the consumer electronic devices and reduce the quantity of disk seek operations needed for playlist navigation.

Abstract: The invention relates to a terminal apparatus, comprising: a display, a memory, and a user interface for receiving a sample string including one or several symbols. In order to achieve a user-friendly solution for selecting a symbol string the terminal apparatus is configured to: retrieve, from said memory symbol strings with a first part that matches with a sample string and to display the retrieved symbol strings on said display such that if the group of symbol strings includes an identical first part, then at least for these symbol strings only the first part is displayed and only once, display on said display, in response to a user selection via said user interface, information relating to those retrieved symbol strings which have an identical first part with the user selected symbol string, and receive, via said user interface, a second user selection identifying a selected symbol string.

Abstract: The present invention provides systems and methods for extending media retention. Methods are provided in which a set of aging preferences are obtained. Data elements of a data set stored on storage media are evaluated against the aging preferences to determine whether each of the data elements satisfy the aging preferences. Each of the data elements that is determined to satisfy the aging preferences is aged. Aging can include freeing a portion of storage media, previously used to store a data element, for other storage usage.

Abstract: A full-text search index system and method is generated by creating instances of a database index from an in-memory inverted list of keywords associated with a text identifier and the occurrences of the keyword in the text. Instances of the index are placed in a priority queue. A merge scheduling process determines when a merge should be initiated, selects instances of the index to be merged and selects a type of merge to perform. Instances of an index are assigned a temporal indicator (timestamp). A set of instances is selected to be merged. The set of instances is validated and merged.

Abstract: Embodiments of the present invention relate to systems and methods for optimizing and reducing the memory requirements of state machine algorithms in pattern matching applications. Memory requirements of an Aho-Corasick algorithm are reduced in an intrusion detection system by representing the state table as three separate data structures. Memory requirements of an Aho-Corasick algorithm are also reduced by applying a banded-row sparse matrix technique to the state transition table of the state table. The pattern matching performance of the intrusion detection system is improved by performing a case insensitive search, where the characters of the test sequence are converted to uppercase as the characters are read. Testing reveals that state transition tables with sixteen bit elements outperform state transition tables with thirty-two bit elements and do not reduce the functionality of intrusion detection systems using the Aho-Corasick algorithm.

Abstract: File system metadata regarding states of a file system affected by transactions is tracked consistently even in the face of dirty shutdowns which might cause rollbacks in transactions which have already been reflected in the metadata. In order to only request time- and resource-heavy rebuilding of metadata for metadata which may have been affected by rollbacks, reliability information is tracked regarding metadata items. When a metadata item is affected by a transaction which may not complete properly in the case of a problematic shutdown or other event, that metadata item's reliability information indicates that it may not be reliable in case of such a problematic (“dirty” or “abnormal”) event. In addition to flag information indicating unreliability, timestamp information tracking a time of the command which has made a metadata item unreliable is also maintained.

Abstract: A computer-implemented system and method for handling a database statement from a first database system. The database statement is formatted according to a language format used by the first database system. Database language difference data is accessed so that a database specific statement may be generated which is operational within a different type of database system.

Abstract: The user requesting the search is enabled to analyze the list of excessive hits in a manner organized through a Web content manager on the user's display screen, and reduce the excessive hits through the elimination of extraneous domains or subdomains captured by the search. An implementation for reducing an excessive number of hits in a search result received at one of the receiving display stations on the Web comprising conventional means for displaying at said receiving display station, Web documents received from sources on the Web, and means for conducting keyword searches on the Web.

Abstract: Embodiments of the present invention relate to systems and methods for database registration. According to an embodiment of the present invention, a method for database registration includes receiving a user identifier of a user and then sending a query to a first database based at least in part on the user identifier. A first data value associated with the user is received from the first database. A second data value associated with the user is received from a data source, which is different from the first database. The first data value and the second data value are stored in a second database, which is different from the first database.

Abstract: The present invention provides an index structure for managing weighted-sequences in large databases. A weighted-sequence is defined as a two-dimensional structure in which each element in the sequence is associated with a weight. A series of network events, for instance, is a weighted-sequence because each event is associated with a timestamp. Querying a large sequence database by events' occurrence patterns is a first step towards understanding the temporal causal relationships among the events. The index structure proposed herein enables the efficient retrieval from the database of all subsequences (contiguous and non-contiguous) that match a given query sequence both by events and by weights. The index structure also takes into consideration the nonuniform frequency distribution of events in the sequence data.