<?xml version="1.0" encoding="UTF-8"?>

<rss version="2.0">

<channel>
<image>
<title>freepatentsonline.com</title>
<width>141</width>
<height>131</height>
<link>http://www.freepatentsonline.com/index.html</link>
<url>http://www.freepatentsonline.com/images/logo.gif</url>
</image>

<title>freepatentsonline.com: Data processing: database and file management or data structures</title>
<link>http://www.freepatentsonline.com/result.html?query_txt=ccl/707%20and%20isd/11/10/2009&amp;uspat=on</link>
<description>USPTO Class 707 Data processing: database and file management or data structures</description>
<language>en-us</language>
<lastBuildDate>Thu, 12 Nov 2009 03:32:06 EST</lastBuildDate>

<item>
<title><![CDATA[Method and apparatus for operating a database]]></title>
<link>http://www.freepatentsonline.com/7617183.html</link>
<description><![CDATA[A method of processing a database service query is provided. In one embodiment, the method includes receiving a service query, applying principles of logic to the service query to obtain a sum of terms, evaluating each term as one or more separate SQL instructions, and executing each separate SQL instruction. Preferably, the sum of terms is additionally expanded to remove NOT operators, using for example Boolean logic.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Dataset search using reduced collation set]]></title>
<link>http://www.freepatentsonline.com/7617187.html</link>
<description><![CDATA[A method of searching for objects in a second database using a query from a first database includes receiving a first query from the first database where the first query is generated using a collation associated with the first database or user session or explicitly specified by users, where the first database may be the same as the second database. The first query is rewritten to form a second query which includes a superset of the collation and a residue predicate which includes a predicate from the first query. An index plan is adopted which targets an index associated with the a multiple language collation expressed in the rewritten query. The rewritten query is executed accessing the index and corresponding data that align with the residue predicate. The total number of indexes provided can be much less than the number of indexes needed if all possible collations were individually indexed.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Interactive user-controlled relevance ranking retrieved information in an information search system]]></title>
<link>http://www.freepatentsonline.com/7617193.html</link>
<description><![CDATA[The present invention presents an apparatus and system for providing an ability to conduct a secondary search using results provided by a first search capability. This secondary search is integrated with the first search and functions as an added tool or accessory. The present invention allows for user control of search ranking, search viewing and search presentations thus affording more relevant information retrieval. Searchers can dynamically and interactively examine and manipulate the search results to improve relevance and quickly satisfy their search objectives.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method for analyzing status of specialized tank files which store and handle large objects]]></title>
<link>http://www.freepatentsonline.com/7617206.html</link>
<description><![CDATA[A data management system is provided with a database which has internal tanks for storing large object data according to the size of the data involved. An analysis method and system is provided which will search out and calculate the space of each of the tank files involved and will report on how the space of each tank file is being used in terms of existing large objects, in terms of unused and available space, and in terms of deleted large object spaces.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Management and use of data in a computer-generated document]]></title>
<link>http://www.freepatentsonline.com/7617229.html</link>
<description><![CDATA[Methods and systems provide for breaking a computer-generated document into a number of components where the components have explicit relationships with each other. A relationship representation is generated for the components of the document. A user may then navigate the relationships between the components to quickly understand the nature of the document and its components and to locate particular portions of the document that are important to the user. In addition, the user may open, edit and reuse particular components of the document apart from the rest of the document and without having to open or edit the document.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and system for displaying results of a dynamic search]]></title>
<link>http://www.freepatentsonline.com/7617236.html</link>
<description><![CDATA[A method and system for displaying results of a dynamic search are provided. Results of a search are received in a result node of a query wherein the result node comprises a first node and a second node. The first node has a static key data and the second node has a dynamic key data. The static key data and the dynamic key data are transferred to a dummy node. A table displaying the static key data and the dynamic key data is then generated based upon the dummy node.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System management method, system management device, system management program, and storage medium containing system management program]]></title>
<link>http://www.freepatentsonline.com/7617238.html</link>
<description><![CDATA[A system management method is disclosed for associating a process object and a process with each node in a tree structure, and operating each node based on the tree structure so as to manage the process object and the process, including: registering a registered user that performs operations for a general node corresponding to the process object or for a function node corresponding to the process; setting the function node as a child node of the general node corresponding to the process object for which the process corresponding to the function node should be performed, and setting the general node as a parent node of the function node; setting registered user operation authority for each registered user; and, when execution of the process corresponding to the function node is requested by the registered user, causing the function node to execute the process only when the process is permitted by the registered user operation authority, of the registered user requesting the process, set in the general node that is a parent node of the function node.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Compensating for unavailability in a storage virtualization system]]></title>
<link>http://www.freepatentsonline.com/7617252.html</link>
<description><![CDATA[A storage virtualization system for accessing at least one storage device for a virtual logical unit (VLUN) from at least one host. The system includes at least one upstream processing element (UPE) which is adapted for coupling to a corresponding host server. The system is further adapted for coupling to at least one storage device. The controller also includes a primary central processing element (CPE) that can be configurably coupled to the UPEs. The primary CPE permits data transfer to occur between a host and a storage device via the corresponding UPE. The controller further includes a backup CPE that can be configurably coupled to the UPEs. The backup CPE is configurable to permit the data transfer when the primary CPE becomes unavailable.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System for real-time healing of vital computer files]]></title>
<link>http://www.freepatentsonline.com/7617258.html</link>
<description><![CDATA[A method and healing system for healing a computer's vital files. The healing system includes a system healer having a database that stores a copy of the computer's vital files. The system healer receives identification of condition(s) under which a first vital file is to be changed. The system healer receives notification that the computer has detected a change in the first vital file. If the system healer ascertains that the condition(s) are satisfied, then the system healer replaces the stored copy of the first vital file by the changed first vital file in the system healer's database. If the system healer ascertains that the condition(s) are not satisfied then the system healer sends the stored copy of the first vital to the computer, resulting in replacement of the changed first vital file in the computer by the stored copy of the first vital file.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Optimization of database network traffic based upon data-use analysis]]></title>
<link>http://www.freepatentsonline.com/7617181.html</link>
<description><![CDATA[An apparatus, program product and method utilize one or more usage statistics, which are reflective of what data is actually and/or likely to be used by a client when processing a database query, to reduce or eliminate the transfer of unnecessary data between a client and server in a client-server database management system. Information such as the columns that are or have been used and/or the number of rows that have been accessed, may be utilized to identify certain data that is likely to not be used during processing of the database query. Based upon the data that has been identified, a subset of the data that would otherwise be returned as a result of the database query may be identified and returned to a client, often substantially reducing the amount of data required to be retrieved by a client in connection with a database query.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Combined title prefix and full-word content searching]]></title>
<link>http://www.freepatentsonline.com/7617197.html</link>
<description><![CDATA[A system for searching an object environment includes harvesting and indexing applications to create a search database and one or more indexes into the database. A scoring application determines the relevance of the objects, and a querying application locates objects in the database according to a search term. One or more of the indexes may be implemented by a hash table or other suitable data structure, where algorithms provide for adding objects to the indexes and searching for objects in the indexes. A ranking scheme sorts searchable items according to an estimate of the frequency that the items will be used in the future. Multiple indexes enable a combined prefix title and full-text content search of the database, accessible from a single search interface.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and apparatus for upgrading a database in a redundant environment by release chaining]]></title>
<link>http://www.freepatentsonline.com/7617175.html</link>
<description><![CDATA[What is disclosed is a method of updating a message from a first version to an upgraded version by chaining through intermediate versions, including the steps of receiving an update message having a first version format, and repeatedly generating a revised update message having a next most recent version format based on the update message until a final update message having an upgraded version format is generated. An apparatus for performing the method is also disclosed.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Query-based snippet clustering for search result grouping]]></title>
<link>http://www.freepatentsonline.com/7617176.html</link>
<description><![CDATA[A clustering architecture that dynamically groups the search result documents into clusters labeled by phrases extracted from the search result snippets. Documents related to the same topic usually share a common vocabulary. The words are first clustered based on their co-occurrences and each cluster forms a potentially interesting topic. Keywords are chosen and then clustered by counting co-occurrences of pairs of keywords. Documents are assigned to relevant topics based on the feature vectors of the clusters.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Methods and systems for providing a visualization graph]]></title>
<link>http://www.freepatentsonline.com/7617185.html</link>
<description><![CDATA[A visualization graph is provided on a computer by storing data corresponding to a plurality of entities and/or nodes, wherein a semantic net includes the entities and/or nodes and wherein the entities and/or nodes are linked to each other by a plurality of relations. A query is generated and performed on the data. Data is output in the form of a visualization graph representing the results of the query, wherein the graph has a focus entity or node defined by a user or the query. Context information is used to determine at least one entity and/or node to be output in the results that is indirectly related to the focus entity or node.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Context-sensitive term expansion with multiple levels of expansion]]></title>
<link>http://www.freepatentsonline.com/7617196.html</link>
<description><![CDATA[Methods, articles of manufacture, and systems for searching collections of data using context sensitive expanded term searching are provided. The collection of data may be a relational database, text document, or any other type of searchable collection of data. In either case, a query including a search condition based on a specified search term may be modified to include additional conditions based on a set of expanded (e.g., conceptually-related) search terms. For some embodiments, a user may be given the ability to control the level of expansion and the context in which the terms may be expanded.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Estimating confidence for query revision models]]></title>
<link>http://www.freepatentsonline.com/7617205.html</link>
<description><![CDATA[An information retrieval system includes a query revision architecture that integrates multiple different query revisers, each implementing one or more query revision strategies. A revision server receives a user's query, and interfaces with the various query revisers, each of which generates one or more potential revised queries. The revision server evaluates the potential revised queries, and selects one or more of them to provide to the user. A session-based reviser suggests one or more revised queries, given a first query, by calculating an expected utility for the revised query. The expected utility is calculated as the product of a frequency of occurrence of the query pair and an increase in quality of the revised query over the first query.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Persistent key-value repository with a pluggable architecture to abstract physical storage]]></title>
<link>http://www.freepatentsonline.com/7617218.html</link>
<description><![CDATA[A system and techniques are described for managing key-value pairs using an architecture that does not restrict its users to any specific platform or storage subsystem. According to one aspect of the invention, the repository is portable in that the architecture need not change based on the environment and platform in which the repository is used. Rather, the portion of the architecture that is platform-specific is limited to plug-ins at a storage abstraction layer of the repository. The plug-ins expose the same storage abstraction interface to the other layers of the repository, but are implemented to interact with different platforms and storage subsystems. Consequently, in response to being ported from one platform to another, the repository may simply change the plug-in to invoke for persistent storage operations.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Centralized terminology and glossary development]]></title>
<link>http://www.freepatentsonline.com/7617232.html</link>
<description><![CDATA[Developing terminology for use within an organization. Data representing a term is received from a user. Data representing one or more projects to be associated with the term is also received from the user. The received data representing the term is linked with the received data representing the one or more projects in a memory area. A glossary for the one or more projects is generated. The generated glossary includes the term.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Modeling of activity data]]></title>
<link>http://www.freepatentsonline.com/7617239.html</link>
<description><![CDATA[An activity class is defined which includes multiple data elements that are common to various activity types. The activity class identifies relationships of an activity with various entities related to the activity.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Storage system, storage control device and recovery point detection method for storage control device]]></title>
<link>http://www.freepatentsonline.com/7617255.html</link>
<description><![CDATA[The present invention supports the selection of an appropriate recovery point, even if a point of recovery is unknown. The user issues a retrieval request from the host by specifying a recovery target file name (path name) and retrieval conditions (key word). The partial restoring processing section restores only a specified file out of the user data volume, and stores it in a temporary restoring area. The retrieval processing section detects a period where the restored file matches the retrieval conditions, and notifies the recovery point candidate list to the host. The user specifies one recovery point out of the recovery point candidates, and requests to restore the user data volume. By this, the user can acquire recovery point candidates based on a slight clue and select an appropriate recovery point.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Systems and methods for monitoring application data in a data replication system]]></title>
<link>http://www.freepatentsonline.com/7617262.html</link>
<description><![CDATA[Performing data management operations on replicated data in a computer network. Log entries are generated for data management operations of an application executing on a source system. Consistency point entries are used to indicate a time of a known good, or recoverable, state of the application. A destination system is configured to process a copy of the log and consistency point entries to replicate data in a replication volume, the replicated data being a copy of the application data on the source system. When the replicated data represents a known good state of the application, as determined by the consistency point entries, the destination system(s) may perform a storage operation (e.g., snapshot, backup) to copy the replicated data and to logically associate the copied data with a time information (e.g., time stamp) indicative of the source system time when the application was in the known good state.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Indexing method of database management system]]></title>
<link>http://www.freepatentsonline.com/7617265.html</link>
<description><![CDATA[When operating a database management system that consists of a plurality of database servers and enables the database servers to transfer data between them by partitioning a data area into small areas and altering allocation of the small areas to the database servers, after altering the configuration, there occurs degradation in processing speed that accompanies re-creation of the index. If this problem is solved by using the conventional technique, noticeable degradation in processing speed will occur to a specific query at the time of a steady state operation. When operating the database management system that consists of the plurality of database servers and enables the database servers to transfer data between them by partitioning the database area into small areas and altering the allocation of the small areas to the database server, an index created for each of the small areas and an index to all the small areas allocated to the database server are used in combination.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and methodology for cost-based subquery optimization using a left-deep tree join enumeration algorithm]]></title>
<link>http://www.freepatentsonline.com/7617179.html</link>
<description><![CDATA[A system providing methodology for cost-based enumeration of subqueries using a left-deep tree join enumeration algorithm is described. In one embodiment, for example, in a database system, a method of the present invention is described for optimizing a database query, the method comprises steps of: receiving a database query including at least one subquery; building a query optimization graph for each query block of the database query, the query optimization graph including plan nodes representing subqueries of each query block; generating a set of access methods and join methods for each plan node, including generating at least one access method for a subquery quantifier based on subquery type and semantic properties of the database query; determining an optimal access plan for each query block based upon selecting access methods, join methods, and join order for plan nodes of the query optimization graph having favorable execution costs; and constructing a detailed access plan for execution of the database query based upon the optimal access plan determined for each query block.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Scalable hierarchical data-driven navigation system and method for information retrieval]]></title>
<link>http://www.freepatentsonline.com/7617184.html</link>
<description><![CDATA[A data-driven, hierarchical information navigation system and method enable search of sets of documents or other materials by certain common attributes that characterize the materials. The invention includes several aspects of a data-driven, hierarchical navigation system that employs this navigation mode. The navigation system of the present invention includes features of an interface, a knowledge base and a taxonomy definition process and a classification process for generating the knowledge base, a graph-based navigable data structure and method for generating the data structure, World Wide Web-based applications of the system, and methods of implementing the system. Users are able to search or browse a particular collection of documents by selecting desired values for the attributes. A data-driven, hierarchical information navigation system and method enable this navigation mode by associating terms with the materials, defining a set of hierarchical relationships among the terms, and providing a guided search mechanism based on the relationship between the terms. In another aspect of the invention, implementations of the invention may be scalable through parallel or distributed computation. Implementations of the invention may employ master and slave servers in a hierarchical configuration.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System, method and computer program for successive approximation of query results]]></title>
<link>http://www.freepatentsonline.com/7617186.html</link>
<description><![CDATA[A method, system, and computer program for generating successive approximations of the result of a query. The query is applied to successively larger samples of the data to produce successively more accurate approximations, optionally until the exact result of the query has been computed.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and system for capability content search with mobile computing devices]]></title>
<link>http://www.freepatentsonline.com/7617192.html</link>
<description><![CDATA[A computer system and method for processing a search query directed to a database first inquires of multiple searchlet applications as to whether each respective searchlet is capable of performing the search query and then, if an affirmative response is received, passes the search query to the affirmatively responding searchlets, such that each searchlet returns a response comprising a single page, or no page at all if the search fails. Communication of the search query to the searchlets is managed by a content broker process. Each searchlet includes methods for searching a particular category of content, generating an index of the content, performing a search on the index, and returning search results.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Supervised ranking of vertices of a directed graph]]></title>
<link>http://www.freepatentsonline.com/7617194.html</link>
<description><![CDATA[A method and system for ranking importance of vertices of a directed graph based on links between the vertices and some prior knowledge of importance of the vertices is provided. A ranking system inputs an indication of the vertices along with an indication of the links between the vertices as the directed graph. The ranking system generates a transition-probability matrix that represents the probability of transitioning from vertex to vertex. The ranking system then generates a ranking of the vertices based on the links between the vertices represented by the stationary distribution of the transition-probability matrix that is minimally perturbed to satisfy the prior knowledge, which may be a partial ranking of the vertices.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Optimizing the performance of duplicate identification by content]]></title>
<link>http://www.freepatentsonline.com/7617195.html</link>
<description><![CDATA[In accordance with the disclosure, there is provided a method for identifying duplicate documents comprising drafting a first document and creating a near unique representative string based on the document content. The method further comprises searching for other documents with the same NRS and selectively assigning a duplicate group identification to the first document, the duplicate group identification is unique if no near unique representative string matches are found, or the duplicate group identification is the same as an associated duplicate document's duplicate group identification that matches the NRS. The method further comprises placing the DGI into a meta-data of the first document and recalling a list of duplicates of a particular document based upon user demand by searching the meta-data and selecting documents using the same DGI.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Generation of XML search profiles]]></title>
<link>http://www.freepatentsonline.com/7617198.html</link>
<description><![CDATA[A system for generating a nested field record related to a corresponding data record is described. The system comprises a structured database for storing a plurality of the corresponding data records and a nested field record generator to query the structured database and generate the nested field record according to data selected from the corresponding data record. The nested field record generator also further derives and includes derived data from the corresponding data record in the nested field record.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Systems and methods that employ a distributional analysis on a query log to improve search results]]></title>
<link>http://www.freepatentsonline.com/7617202.html</link>
<description><![CDATA[The present invention provides systems and methods that employ a statistical distributional analysis to improve content search engine search results. In particular, a substring and/or a string sequence distributional algorithm can be applied to a set of queries to generate a distributional characteristic (e.g., a profile) for the set of queries, wherein the set is selected from a plurality of queries stored on a query log. Typically, the queries are selected based on a substring of interest and/or an identification of a user initiating searches. The distributional characteristic can then be employed to determine a distributional similarity measure that can be utilized in connection with a search to facilitate search results via providing a mechanism to determine synonymous search terms, spelling corrections/variations, and facilitate collaborative filtering, for example. Thus, the present invention employs a novel technique that mines and employs previous queries to enhance the query search results.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Listings optimization using a plurality of data sources]]></title>
<link>http://www.freepatentsonline.com/7617203.html</link>
<description><![CDATA[A system is provided for allocating combinations of search results, types of space, and/or other information from different sources (e.g., search engines) in which a type of space, search results, and/or other information from at least one source or type or from each source or type, for example, are optimized to obtain an optimum commercial value. Using the example of a search, a commercial metric and a user satisfaction metric are established for search terms and used in the optimization process. In calculating the commercial value and the user satisfaction value for a set of search results, the weight given to the commercial value and the user satisfaction value of a search result is different depending on its source. Optionally, keeping the user satisfaction value above a certain threshold is treated as a constraint while optimizing the commercial value. Alternatively, a tradeoff may be allowed between the minimum threshold for the user satisfaction and a better commercial value. For example, a commercial value may be associated with the commercial metric and quality metric so that the total commercial value may be calculated and optimized.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[User query data mining and related techniques]]></title>
<link>http://www.freepatentsonline.com/7617208.html</link>
<description><![CDATA[Methods and apparatus are described for mining user queries found within the access logs of a website and for relating this information to the website's overall usage, structure, and content. Such techniques may be used to discover valuable information to improve the quality of the website, allowing the website to become more intuitive and adequate for the needs of its users.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Global inventory warehouse]]></title>
<link>http://www.freepatentsonline.com/7617210.html</link>
<description><![CDATA[Building and maintaining an accurate and up-to-date global inventory of hardware, software, and telecommunications assets deployed throughout an organization is described. A global inventory warehouse (GIW) receives an identification and physical location of these assets from multiple source systems. Some of these source systems contain information pertaining to the assets that has been manually entered into the source system by a human administrator. Other source systems, meanwhile, contain information that has been automatically collected by the source systems without human intervention. The GIW receives this information from the source systems and stores it within a GIW database. The GIW database may thus contain a global inventory of all or nearly all of the hardware, software, and telecommunications assets distributed throughout the organization. This database may also contain an identification of physical locations within the organization of all or substantially all of these assets.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Metadata offload for a file server cluster]]></title>
<link>http://www.freepatentsonline.com/7617216.html</link>
<description><![CDATA[A file server system has a cluster of server computers that share access to a file system in shared storage. One of the server computers has primary responsibility for management of access to the file system. In order to reduce the possibility of primary server overload when a large number of the clients happen to concurrently access the same file system, most metadata processing operations are offloaded to secondary server computers. This also facilitates recovery from failure of a primary server computer since only a fraction of the ongoing metadata operations of a primary server computer is interrupted by a failure of the primary server computer. For example, a secondary data mover may truncate, delete, create, or rename a file in response to a client request.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for redirecting access to a remote mirrored snapshot]]></title>
<link>http://www.freepatentsonline.com/7617217.html</link>
<description><![CDATA[In a system and method for updating a remote replicated destination file system snapshot with changes in a source file system snapshot, users and processes are redirected to a local exported snapshot of the replicated snapshot on the active file system on the destination before beginning the next update of the active file system's replicated snapshot. In this manner, an unstable replicated snapshot is not accessed. Indirection is introduced into inode lookup at the destination as the destination's active file system is being updated. The indirection can be based upon a snapshot ID that conforms to a latest exported snapshot ID.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Sharing access to content items using group information and item information]]></title>
<link>http://www.freepatentsonline.com/7617220.html</link>
<description><![CDATA[A user can share media content with others by defining one or more groups, where each group includes members who may access a set of user's content item on the online service or on user's local device. Item information is generated for content items to be shared and indicates where the content item can be accessed. The item information is provided to the members of the group that was selected to share the content item. The user can conveniently configure or update the group to share the user's content items. The content items to be shared can be located on an online service or on the user's local device.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Rendering database queries with blank space]]></title>
<link>http://www.freepatentsonline.com/7617221.html</link>
<description><![CDATA[A computer-implemented method includes selecting a first member of a first dimension of a database to be included at a first location in a report. The first member includes first data to be retrieved from the database. A blank space to be added at a second location relative to the first member is also selected. A database query is generated that includes a first instruction to retrieve first data included in the first member. The first instruction is located at a first position in the query and the first data will appear in the report at the first location. The database query also includes a second instruction to retrieve a null set of data. The second instruction is located at a second position in the query and the null set of data will appear in the report at the second location.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Converting physical aspects of common warehouse model to elements of relational database]]></title>
<link>http://www.freepatentsonline.com/7617223.html</link>
<description><![CDATA[A method and a system for converting physical aspects of a common warehouse model (CWM) to corresponding database management system (DBMS) items in a relational database by processing in a hierarchical manner the physical aspects and creating the corresponding DBMS items. The physical aspects comprise relational catalogs. The relational catalogs comprise relational schemas. The corresponding DBMS items comprise DBMS catalogs. The DBMS catalogs comprise DBMS schemas.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Document treadmilling system and method for updating documents in a document repository and recovering storage space from invalidated documents]]></title>
<link>http://www.freepatentsonline.com/7617226.html</link>
<description><![CDATA[A tokenspace repository stores documents as a sequence of tokens. The tokenspace repository, as well as the inverted index for the tokenspace repository, uses a data structure that has a first end and a second end and allows for insertions at the second end and deletions from the front end. A document in the tokenspace repository is updated by inserting the updated version into the repository at the second end and invalidating the earlier version. Invalidated documents are not deleted immediately; they are identified in a garbage collection list for later garbage collection. The tokenspace repository is treadmilled to shift invalidated documents to the front end, at which point they may be deleted and their storage space recovered.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Storage control sub-system comprising virtual storage units]]></title>
<link>http://www.freepatentsonline.com/7617227.html</link>
<description><![CDATA[A storage control device provided in a storage control system reports a virtual storage capacity value stored in a shared memory, to a host terminal, and ensures that, after the virtual storage capacity value has been stored in the host terminal, the virtual storage capacity value thus reported cannot be changed while the virtual storage unit having the virtual storage capacity value is connected to the host terminal.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Data hashing method, data processing method, and data processing system using similarity-based hashing algorithm]]></title>
<link>http://www.freepatentsonline.com/7617231.html</link>
<description><![CDATA[A data hashing method, a data processing method, and a data processing system using a similarity-based hashing (SBH) algorithm in which the same hash value is calculated for the same data and the more similar data, the smaller difference in the generated hash values. The data hashing method includes receiving computerized data, and generating a hash value of the computerized data using the SBH algorithm in which two data are the same if calculated hash values are the same and two data are similar if the difference of calculated hash values is small, wherein a search, comparison, and classification of data may be quickly processed within a time complexity of O(1) or O(n) since the similarity/closeness of data content are quantified by component values for each of the respective corresponding generated hash values.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[XML schema for binding data]]></title>
<link>http://www.freepatentsonline.com/7617234.html</link>
<description><![CDATA[An XML schema is provided allowing data to be stored in a separate location from the presentation surface of an application. By way of the schema, users of the application can establish links (or bindings) between the contents of the data and the presentation surface as part of an XML document format. Methods, systems, and computer-readable medium are described implementing the schema.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and system for creating a domain index]]></title>
<link>http://www.freepatentsonline.com/7617235.html</link>
<description><![CDATA[A domain index for a partitioned database can be created using a user-defined indexing scheme. Partition maintenance operations performed on the partitioned database objects cause corresponding partition maintenance operations to be performed on the domain indexes. The user-supplied partitioning code is partition operation-unaware.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for geo-coding user generated content]]></title>
<link>http://www.freepatentsonline.com/7617246.html</link>
<description><![CDATA[A system and method for geo-coding user generated content is described. The system comprises a content source, a content management module, a content repository, a location source, a location repository, a geo-coding module, and a geo-location object data sheet (GDS). The content source captures the user generated content. The content management module manages the user generated content. The content repository stores the user generated content. The location source generates a plurality of location data, and the location repository stores the location data. The geo-coding module generates the geo-located object data sheet (GDS) that associates the user generated content with the corresponding location data. The GDS depository stores the geo-located object data sheet.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Apparatus and method for controlling user interface]]></title>
<link>http://www.freepatentsonline.com/7617247.html</link>
<description><![CDATA[The user describes in advance conflict process rules, which indicate descriptions for avoiding conflicts that occur between setup data, in a conflict process rule description file ( 301 ). An inference engine ( 302 ) refers to this conflict process rule description file ( 301 ) and generates complementary rules indicating complementary conflict avoidance descriptions. The complementary rules are implemented by generating inverse logic rules of given descriptions for a function, which are described to allow inference by analogy.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Notification system and method]]></title>
<link>http://www.freepatentsonline.com/7617248.html</link>
<description><![CDATA[A dispatch and notification system that can adjust resources to meet and accommodate real time changes in demand or load is disclosed. The system provides an automated assembly that includes provisions that provide an effective and low cost arrangement that notifies technicians of real time changes in their scheduled work. The system can determine if a real time intervention in a technician's schedule is necessary and can notify the technician in near real time of changes in assigned tasks.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and system of handling document operation requests on documents having large collections with constrained memory]]></title>
<link>http://www.freepatentsonline.com/7617249.html</link>
<description><![CDATA[A method and system of handling document operation requests on documents with large collections and constrained memory is disclosed. In some embodiments, when one or more collection elements of a document are required to be in memory for a document operation, each of the one or more required collection elements not already in the memory are loaded into a collection partition in the memory before the document operation is executed.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Semantic file system]]></title>
<link>http://www.freepatentsonline.com/7617250.html</link>
<description><![CDATA[A data model represents semantic information associated with objects stored in a file system. The data model includes a first object identifier, a second object identifier and a relation identifier. The first object identifier identifies a first object stored in the file system. The second object identifier identifies a second object stored in the file system, wherein the second object is related to the first object. The relation identifier identifies a relationship between the first object and the second object.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Destination systems and methods for performing data replication]]></title>
<link>http://www.freepatentsonline.com/7617253.html</link>
<description><![CDATA[Performing data management operations on replicated data in a computer network. Log entries are generated for data management operations of an application executing on a source system. Consistency point entries are used to indicate a time of a known good, or recoverable, state of the application. A destination system is configured to process a copy of the log and consistency point entries to replicate data in a replication volume, the replicated data being a copy of the application data on the source system. When the replicated data represents a known good state of the application, as determined by the consistency point entries, the destination system(s) may perform a storage operation (e.g., snapshot, backup) to copy the replicated data and to logically associate the copied data with a time information (e.g., time stamp) indicative of the source system time when the application was in the known good state.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and mechanism for relational access of recovery logs in a database system]]></title>
<link>http://www.freepatentsonline.com/7617254.html</link>
<description><![CDATA[The present invention is directed to a method and mechanism for accessing recovery log information in a database system. The data stored in the recovery log is presented as a relational database “view,” which can be queried and accessed using relational database statements even though the underlying recovery log data may be stored in a non-relational format. According to an aspect of the invention, the recovery log data is thus encapsulated by the view presented to users of that data.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for managing redundant storage consistency at a file system level]]></title>
<link>http://www.freepatentsonline.com/7617259.html</link>
<description><![CDATA[A file system may save dirty file information indicating portions of files, residing on a storage system, to be modified corresponding data modification requests received by the file system. The file system may update the saved dirty file information to indicate successful modification of the files across redundant storage of the storage system and may track redundancy consistency recovery information on a file-by-file basis or on a file portion basis. A file system may also retrieve saved dirty file information and recover redundancy consistency for portions of files determined, based on the saved dirty file information, not to have redundancy consistency on the storage system. Recovering redundancy consistency may include copying, either directly to via a storage system mechanism, portions of files between redundant storage of the storage system. The redundancy consistency for the saved dirty file information may be recovered prior to recovering redundancy consistency for individual files.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and computer-readable medium for providing an official file repository]]></title>
<link>http://www.freepatentsonline.com/7617263.html</link>
<description><![CDATA[A method and computer-readable medium are provided for storing files in an official file repository. According to the method, a generic interface is exposed that includes a first method for requesting that a file be stored in a file vault. A record series is maintained that identifies one or more document types that may be stored in the file vault along with a location for each file type within the file vault where files of the type should be stored. A call may be made to the first method including the file to be stored in the file vault. In response to the call, a location for storing the file in the file vault may be identified based on the contents of the record series. Once the location has been identified, the file is stored in the identified location if the file type is in the record series. If the file type is not in the record series or the necessary property values are not received with the call, the file is placed in a holding zone portion of the file vault. The generic interface may further expose a second method for retrieving the file types identified in the record series and a third method for retrieving one or more properties associated with a file type identified in the record series.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Computer-readable medium and data structure for communicating technical architecture standards to vendors]]></title>
<link>http://www.freepatentsonline.com/7617244.html</link>
<description><![CDATA[A computer-readable medium and a data structure for communicating information regarding the current and future components of a technical architecture standard to vendors are provided. The computer-readable medium includes a data structure having a data field containing data identifying a particular component of an information technology architecture for an organization, a data field containing data identifying a current standard for the component, and a data field containing data identifying a future standard for the component. The data structure includes one or more architectural component tags indicative of one component of an information technology architecture for an organization, one or more current standard tags corresponding to each architecture component tag indicative of a current standard for the component of the information technology architecture identified by the architecture component tag, and one or more future direction tags corresponding to each architecture component tag indicative of a future standard for the component of the information technology architecture identified by the architecture component tag.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for audio hot spotting]]></title>
<link>http://www.freepatentsonline.com/7617188.html</link>
<description><![CDATA[Audio hot spotting is accomplished by specifying query criterion to include a non-lexical audio cue. The non-lexical audio cue can be, e.g., speech rate, laughter, applause, vocal effort, speaker change or any combination thereof. The query criterion is retrieved from an audio portion of a file. A segment of the file containing the query criterion can be provided to a user. The duration of the provided segment can be specified by the user along with the files to be searched. A list of detections of the query criterion within the file can also be provided to the user. Searches can be refined by the query criterion additionally including a lexical audio-cue. A keyword index of topic terms contained in the file can also be provided to the user.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Contact relationship systems and methods]]></title>
<link>http://www.freepatentsonline.com/7617207.html</link>
<description><![CDATA[The invention generally relates to systems and methods for establishing and managing relationships with contacts. The contact relationship systems generally include databases for storing profile data, retrieved information and correspondence with contacts. The contact relationship systems may also include nurture level indicators for displaying actual frequency of correspondence with a contact. Methods for managing relationships with contacts include storing retrieved information and correspondence between a user and a contact, matching retrieved information to the contact, providing nurture level indicators changeable according to actual frequency of correspondence with the contact.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Parallel query processing techniques for minus and intersect operators]]></title>
<link>http://www.freepatentsonline.com/7617189.html</link>
<description><![CDATA[Various techniques are described for processing database commands that include MINUS and/or INTERSECT operators. According to one technique, the database server executes the MINUS/INTERSECT in a specialized rowsource in parallel. In one approach, the specialized rowsource implements a sort merge-join like solution, where: a DISTINCT SORT is performed on each input, a left and right pointer is maintained on the respective input streams of tuples, the left or right pointer is incremented based on whether there is a match between the tuples pointed-to by the pointers, and the tuple of the left side is returned (or not returned) based on whether there is a match. Techniques are described for generating multiple query plans for executing a query, where each of the query plans includes a plan portion for executing, in parallel, the operation associated with a MINUS/INTERSECT operator. Cost estimates are generated for the query plans. The database server selects from the query plans a particular query plan to execute based, at least in part, on the cost estimates.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Selection of search phrases to suggest to users in view of actions performed by prior users]]></title>
<link>http://www.freepatentsonline.com/7617209.html</link>
<description><![CDATA[A search engine system assists users in refining their searches by suggesting previously-submitted search phrases to such users. The search phrases are selected to suggest based on collected data regarding search behaviors of search engine users. In one embodiment, candidate search phrases are scored and selected to suggest based at least in-part on (a) a frequency with which each search phrase has been submitted, and/or (b) an evaluation of the “usefulness” of each search phrase, as reflected by post-query-submission actions of users who submitted the search phrase.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and apparatus for processing natural language using tape-intersection]]></title>
<link>http://www.freepatentsonline.com/7617091.html</link>
<description><![CDATA[Operations for weighted and non-weighted multi-tape automata are described for use in natural language processing tasks such as morphological analysis, disambiguation, and entity extraction.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Transferring data and storing metadata across a network]]></title>
<link>http://www.freepatentsonline.com/7617222.html</link>
<description><![CDATA[Data is now able to be transferred back and forth between computer systems which have disparate file systems, e.g., between a computer having a hierarchical file system and a computer having a nonhierarchical file system. The differences, however, are not limited to the file storage system. Data may now be transferred across different platforms, different human and computer languages, different binary codes, etc. From one computer system the associated metadata is stored in a interpretable format on the second computer system so that when data and its associated metadata are transferred, the second computer system can interpret the transferred data. Data transfer can be accomplished in both directions. Thus, a tool writer or a software developer using a integrated development environment, such as Eclipse, on a Linux workstation with its hierarchical file system may download source files and other resources from an iSeries computer server with its OS/400 nonhierarchical file system, modify the resources, and then put them back onto the iSeries machine for use on the iSeries. The metadata of the source file and other resources are stored in a .properties file which, if in XML format, supports the transfer of resources across the Internet.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System for persistent caching of LDAP metadata in a cluster LDAP server topology]]></title>
<link>http://www.freepatentsonline.com/7617257.html</link>
<description><![CDATA[Systems and methods for providing consistent metadata in a cluster database system are disclosed. Each node contains a number of LDAP server instances, as well as a monitor process. Each node contains a node shared memory, and the cluster contains a cluster shared memory stored on a directory store. When a client alters metadata in one of the LDAP server instances, the LDAP server instances writes the changes to the directory store, and provides update information, such as a version number, to the node shared memory. Other server instances on that node poll the node shared memory to determine whether updates have been made. If updates have been made, the other server instances update their on-heap caches based on the directory store. Each monitor process determines whether changes have been made to the cluster shared memory, and if so, updates the node shared memory based on the directory store.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Fast failover with multiple secondary nodes]]></title>
<link>http://www.freepatentsonline.com/7617369.html</link>
<description><![CDATA[A method, system, computer system, and computer program product to quickly synchronize replicas of data stored at multiple secondary nodes upon failure of a primary node. Secondary nodes to which an update to data is sent are identified. The secondary nodes insert the update into a respective log of updates to a respective copy of the data. When all of the secondary nodes have acknowledged the update, a notification is sent to each of the secondary nodes. In response to receiving the notification, each of the secondary nodes clears the update from the respective log. Data at one secondary node can be synchronized with data at another secondary node when one of the nodes has received updates from the primary node that the other secondary node has not yet received.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Search service that accesses and highlights previously accessed local and online available information sources]]></title>
<link>http://www.freepatentsonline.com/7617191.html</link>
<description><![CDATA[Methods, systems and program storage devices for generating search engine search results. Online files relevant to a requested search query are located by a search engine, while simultaneously previously accessed offline files residing on a client computer are located using the same search query. The search engine retrieves the offline files from the client computer and combines such offline files with the locate online files in a single search result overview. The listing of files within the combined search results are ranked according to relevancy to the search query using a search engine scoring algorithm, whereby the offline files within the combined search results are preferably brought to a user's attention to indicate that such files reside on the client computer.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Conditional navigation through hierarchical lists]]></title>
<link>http://www.freepatentsonline.com/7617204.html</link>
<description><![CDATA[The present invention provides a method and system for conditional navigation through hierarchical lists. Filtering parameters are associated with members in a list, such as a hierarchical list. The filtering parameters affect the number of choices that are shown to a user in another list when that list is selected and displayed to the user. A selection of a member having filtering parameters within a master list affects the choices shown to a user in other master lists and/or filtered lists when they are displayed. The filtering may occur across different processes within the same machine and across different machines. For example, a user may make a selection within a master list on a first machine that causes a list on a second machine to be filtered for presentation to another user.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for controlling access to a database]]></title>
<link>http://www.freepatentsonline.com/7617212.html</link>
<description><![CDATA[A database access controlling system controls the access to a database from a database access layer in an application, especially a relational database, with data sets that are being accessed concurrently by reading and writing transactions. The present system performs changes on the data by a writing transaction that place the changed data in a marked state. The changed data in the marked state enables concurrent transactions to recognize that the data has just been changed.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Methods and systems for managing data created by different applications]]></title>
<link>http://www.freepatentsonline.com/7617225.html</link>
<description><![CDATA[Systems and methods for managing data are provided. Data such as metadata from files created by several different software applications are captured, and the captured metadata is searched. The type of information in metadata for one type of file differs from the type of information in metadata for another type of file. A single search input is received and the search is performed through the metadata and content of the plurality of files and subset of the plurality of files stored on a user's data processing system. The search input is saved in a folder for performing future searches.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System for archive integrity management and related methods]]></title>
<link>http://www.freepatentsonline.com/7617261.html</link>
<description><![CDATA[A system for archive integrity management and related methods are disclosed. The invention includes one or more integrity manager applications, each of which monitor the integrity of an aspect of a data archive. Some integrity manager applications monitor the integrity of processes executed by the archive system, and other integrity manager applications monitor the integrity of communication paths in the archive system. A file input integrity manager application monitors the integrity of a plurality of processes associated with storing a new data file in the archive. A business content integrity manager application determines what documents are required for a transaction and monitors whether all of the required documents have been received by the archive system. Further, an event integrity manager application executes predetermined events triggered by characteristics of documents stored in the archive system and ensures that all events have been properly executed.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Methods and systems for providing benchmark information under controlled access]]></title>
<link>http://www.freepatentsonline.com/7617177.html</link>
<description><![CDATA[An electronic data structure comprises benchmark information and an authorizing section for access to said benchmark information. A method processes and stores data objects by means of one or more processes running in a computer system having one or more of the electronic data structures. A request for benchmark information is received from a second party, the request including identification information of the second party. The benchmark information is analyzed to determine whether it contains in its electronic data structures and whether the authorizing section of the electronic data structure includes the identification information. Based on the determination, the benchmark information is presented to the second party.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for automatically synchronizing security-relevant information between a relational database and a multidimensional database]]></title>
<link>http://www.freepatentsonline.com/7617211.html</link>
<description><![CDATA[A security management system and method for managing access security in an IT-environment comprises a relational database of the ROLAP type and a data warehouse of the MOLAP type. The system shares a subset of common data, wherein database access security for accessing particular database tables is managed by user-related access limitations in a table form. The present system transforms the access-limiting conditions existing at the ROLAP system automatically to a respective filter criterion for the MOLAP system. The access-limiting conditions exiting at the ROLAP system are defined in a table form. The present system and method automatically activates filter criterion whenever an access to the MOLAP system is requested by a user.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and apparatus for facilitating optimistic authorization in a database]]></title>
<link>http://www.freepatentsonline.com/7617213.html</link>
<description><![CDATA[A method, computer-readable storage medium, and an apparatus are provided to facilitate authorizing a user during a database transaction. The method starts by receiving a request at the database to perform a database operation. Upon receiving the request, the database sends an authorization request to an authorization module to determine if the user has authorization to perform the database operation. In addition, the database continues executing the database operation without waiting for completion of the authorization request. Next, the database receives a response from the authorization module. The database then checks the response to determine if the user has authorization to perform the database operation. If so, the database commits the database operation, and if not, the database rolls back the database operation.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Finding similarity among sets of coordinated tasks]]></title>
<link>http://www.freepatentsonline.com/7617230.html</link>
<description><![CDATA[The described workflow analysis techniques generalize activity instance information into activity context information so that activities can be analyzed in the presence of other possible activities, and by extension, other workflows. Generalization is made possible by deriving an action model for each activity, in which each model specifies contexts for preconditions and postconditions. These contexts are necessary and sufficient in defining each activity, and can be further populated with metadata. The derived activity contexts can be used for analyses that are not possible using existing approaches.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Systems and methods for freezing the state of digital assets for litigation purposes]]></title>
<link>http://www.freepatentsonline.com/7617251.html</link>
<description><![CDATA[Systems and methods for managing digital assets in a distributed computing environment are described. Meta-data for the digital assets is stored separately from the digital assets. Meta-data for some of the digital assets is copied and stored at a central location. Meta-data for the digital assets is generated by clients of the system.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[File system architecture requiring no direct access to user data from a metadata manager]]></title>
<link>http://www.freepatentsonline.com/7617321.html</link>
<description><![CDATA[A system, method and computer program product for implementing a distributed file system architecture requiring no direct access to user data from a metadata manager in a data storage network. Metadata operations requiring user volume access are performed via a proxy on a storage manager server that is a distributed file system client. Management of metadata can be isolated from user data because the metadata manager requires no capability to see the storage for user volumes. This allows for a distributed file management system to support heterogeneous environments without requiring any single point in the system to see all the storage.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Distributed tempero-spatial query service]]></title>
<link>http://www.freepatentsonline.com/7616590.html</link>
<description><![CDATA[A distributed tempero-spatial query service uses a plurality of service agents each having an assigned area of responsibility. The service agents are organized into a spatial hierarchy based upon each service agent's area of responsibility. The spatial hierarchy is distributed and hosted on each of the service agents. The spatial hierarchy enables matching of requests from subscribing agents with publishing agents based upon spatial attributes. The spatial hierarchy is dynamically maintained in a distributed manner on each of the service agents. The service agents can be arranged into a tree-based spatial hierarchy having a limited depth.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for mission-driven visual information retrieval and organization]]></title>
<link>http://www.freepatentsonline.com/7616816.html</link>
<description><![CDATA[The present invention provides a virtual data collection system and method that provides an image analyst with full-control of the image, including the ability to retrieve and reorganize information from an existing video database of images. The system provides for the search and retrieval of information from previously collected images, and reorganize them to meet new or revised mission objectives. The system also enables quick access of the “right” information through virtual data collection from the existing video database.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Virtual crimp validation system]]></title>
<link>http://www.freepatentsonline.com/7617066.html</link>
<description><![CDATA[A system for validating a proposed crimp includes a pre-crimp modeler configured to establish a geometry for the proposed crimp, a plurality of virtual testing modules configured to determine at least one characteristic of the proposed crimp, and a virtual validation module configured to compare results from each of the plurality of virtual testing modules to predetermined criteria.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Moving file fragments from background file sharing to foreground file sharing and preventing duplicate downloads]]></title>
<link>http://www.freepatentsonline.com/7617178.html</link>
<description><![CDATA[In accordance with one illustrative embodiment, when a file is moved from the background to the foreground in a peer-to-peer client, the client makes a local request for file pieces. The client sends a handshake message to itself to check for available pieces. The client then exchanges messages locally the same way it would with external peers. As an alternative approach to local message passing, the client may keep a local record of file fragments in a data structure, such as a markup language document or other data repository. The client may then query the data structure for needed file fragments before submitting a request to the peer-to-peer network. Every time a new file segment is downloaded and validated in the background, or the foreground, the peer-to-peer client may update the data structure. Then, the client may simply query the data structure for the specific segment it wishes to download.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Efficient lock management]]></title>
<link>http://www.freepatentsonline.com/7617180.html</link>
<description><![CDATA[A current transaction accessing a data object is disclosed. Accessing could include determining that previous transaction information about a previous transaction is associated with the data object, determining that the previous transaction no longer needs a lock on the data object, and associating current transaction information about the current transaction with the data object. Accessing could include determining that an embedded lock is active, copying the embedded lock to a shared lock region, invalidating the embedded lock, and queuing the current transaction in the shared lock region.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Document clustering based on entity association rules]]></title>
<link>http://www.freepatentsonline.com/7617182.html</link>
<description><![CDATA[For each document in a document set, entities are identified and a set of association rules, based on appearance of the entities in the paragraphs of the documents in the set, are derived. Documents are clustered based on the association rules. As documents are added to the clusters, additional association rules specific to the clusters can optionally be derived as well.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Data feeds for management systems]]></title>
<link>http://www.freepatentsonline.com/7617190.html</link>
<description><![CDATA[A data feed is defined with a data type and criteria. Each data type corresponds to a type of management related data provided by a management system. The management system is searched for all management related data that corresponds with the data type and the criteria. An aggregator collects the management related data that corresponds with the data type and the criteria. The collected management related data is rendered for a display.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and arrangement for setting up and updating a user interface for accessing information pages in a data network]]></title>
<link>http://www.freepatentsonline.com/7617215.html</link>
<description><![CDATA[The aim of the invention is to establish and update a user interface allowing a user to access data pages in a data network. Said aim is achieved by the fact that selected data pages are made accessible to the user on the user interface by means of a display element while said data pages are accessed by accessing the respective display element, contents being stored on the data pages. An allocated set of content data, in which characteristics describing the respective content that is stored on the data page are stored, is created for the data pages. In order to determine the selected data pages, a set of user data is created by means of which a searched content is described. The sets of content data are compared with the set of user data regarding the degree of correspondence, and data pages in which the degree of correspondence between the respective set of content data and the set of user data reaches and/or exceeds a predefined threshold value are displayed on the user interface by means of display elements.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Displaying image data]]></title>
<link>http://www.freepatentsonline.com/7617228.html</link>
<description><![CDATA[A machine-readable definition of a three-dimensional scene is represented. A list of relationships between elements of the scene is generated, wherein each entry on said list identifies two elements and the nature of a relationship between the two elements. A displayable schematic representation of the scene is created in which elements of the scene are defined by nodes and relationships between the nodes are represented by links. Input data is received in response to displaying the list of relationships that identifies one of the relationships. A portion of the schematic representation is displayed showing the elements related by the relationship identified by the input data.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Encoding device, encoding method, decoding device, decoding method, program and machine readable recording medium containing the program]]></title>
<link>http://www.freepatentsonline.com/7617237.html</link>
<description><![CDATA[A device divides a table ( 60 ) including element information contained in tree-structure information and position information in a corresponding tree-structure into an element information value ( 61 ) and position information ( 62 ) by a table division unit ( 101 ). An element information rearrangement unit ( 103 ) rearranges the divided element information values ( 61 ) into an order in a dictionary. Correspondence information ( 703 ) indicating the order change by this rearrangement is extracted by a correspondence information extraction unit ( 104 ). A position information encoding unit ( 102 ) and a corresponding information encoding unit ( 105 ) encode the position information ( 62 ) and the correspondence information ( 703 ), respectively. By using the encoded position information ( 62 ) and the correspondence information ( 703 ) and the element information values ( 61 ), a compressed information forming unit ( 106 ) forms compressed information from these.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and apparatus for enhanced hashing]]></title>
<link>http://www.freepatentsonline.com/7617241.html</link>
<description><![CDATA[A search key lookup system including a hash table having a plurality of entries and a function generator is disclosed. The function generator can be coupled to the hash table and configured to receive a key and to provide a first function and a second function. The first function can be a Cyclic Redundancy Code (CRC) type function and the second function can be an Error Checking and Correcting (ECC) type function. Further, an address of the table can include a concatenation of the results of the CRC and the ECC type functions.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and apparatus for reproducing play lists in record media]]></title>
<link>http://www.freepatentsonline.com/7617242.html</link>
<description><![CDATA[A recording and reproducing system includes a DVD-RAM medium having a plurality of data files of storing predetermined data, file recording means of recording, in a play list file held by the DVD-RAM medium, a play list of describing reproduction order of reproducing the predetermined data stored in each of all or a part of the data files out of the plurality of data files by using a file name of the data file and a unique directory ID provided to a directory to which the data file belongs, and file reproducing means of reproducing the predetermined data stored by each of all or a part of the data files out of the plurality of data files based on the recorded play list.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Integrated address book based on departmental hierarchy]]></title>
<link>http://www.freepatentsonline.com/7617243.html</link>
<description><![CDATA[A hierarchical address book for an organization is implemented where employees are represented by user objects and departments are represented by department objects. Computer-readable media include executable instructions for displaying and navigating the hierarchical address book. Computer-readable media also include executable instructions for ordering a list of recipients of an electronic mail message as a function of the seniority rating of an object in the hierarchical address book.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Data set version counting in a mixed local storage and remote storage environment]]></title>
<link>http://www.freepatentsonline.com/7617260.html</link>
<description><![CDATA[Provided are techniques for storing local versions of a data set. A first number that indicates how many local versions of the data set are to be stored in local storage given an amount of available local storage is received. It is determined whether a second number that indicates a total number of local versions of the data set that the local storage is capable of storing exceeds the first number. In response to determining that the second number exceeds the first number, the amount of local storage that is capable of storing the first number of local versions of the data set is used.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Data compilation system and method]]></title>
<link>http://www.freepatentsonline.com/7617296.html</link>
<description><![CDATA[A method, computer program product, client, and server application configured to store information associated with a subset of users of a media distribution service in a memory. At least one distribution history data set is compiled for each member of the subset of users. The at least one distribution history data set for each member of the subset of users are combined to form a combined distribution history data set. Information from the combined distribution history data set is transferred to a user electronic device.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Initiating and using information used for a host, control unit, and logical device connections]]></title>
<link>http://www.freepatentsonline.com/7617349.html</link>
<description><![CDATA[Provided are a method, system, and program for initiating and using information used for a host, control unit, and logical device connections receiving a request to create a host port to control unit port connection. In a volume group data structure, a volume group entry is defined having a plurality of pointers for the host port and control unit port pair. At least one device address is added to the volume group that is accessible to the host port and control unit port connection by initializing at least one pointer in the volume group entry to address at least one device data structure. For each of the at least one device addresses, indication is made in the at least one device data structure addressed by the at least one pointer in the volume group entry that the device address is accessible to the host port and control unit port connection.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and system for verifying and storing documents during a program failure]]></title>
<link>http://www.freepatentsonline.com/7617418.html</link>
<description><![CDATA[Method and system for verifying and storing documents during a failure in a program module. Once a failure is detected in the program module, control passes to an exception handler that determines whether the open files have been modified. If so, a crash handler is executed, which verifies and stores the documents by detecting and repairing any discovered corruption. The program module is then terminated and restarted. Upon restarting the program module, the repaired document is opened and displayed to the user with a list of repairs.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and/or system to authorize access to stored data]]></title>
<link>http://www.freepatentsonline.com/7617541.html</link>
<description><![CDATA[Embodiments of methods and/or systems to authorize access to stored data are disclosed.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Porting security application preferences from one system to another]]></title>
<link>http://www.freepatentsonline.com/7617214.html</link>
<description><![CDATA[Configuring a security application includes determining whether user preferences for the security application are pre-loaded in an information handling system (IHS) received by a user. If the user preferences have not been pre-loaded a request to receive the user preferences corresponding to the user and the security application is sent to a provider of the security application. The request includes a unique identifier for accessing the user preferences for the security application. The user preferences, which have been previously configured by the user for another IHS, are stored in a predefined format and are accessible to any requester providing the unique identifier. The provider provides the user preferences corresponding to the unique identifier.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Enhanced handling of repeated information in a web form]]></title>
<link>http://www.freepatentsonline.com/7617219.html</link>
<description><![CDATA[A presentation interface for rendering Web form content can include a Web form, a repeated item section, and a collection control section. The Web form can be written in a markup language based upon a Standard Generalized Mark-up Language (SGML). The Web form can include a repeating structure that references a collection of data items. The repeated item section can present the data items in a tabular format. The repeated item section can also include multiple selectors, one selector corresponding to each data item. The collection control section can include at least one user selectable collection actuator, such as a button, that performs a function associated with the actuator upon only those designated data items in the collection for which a corresponding selector has been chosen.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for managing hierarchically related software components]]></title>
<link>http://www.freepatentsonline.com/7617224.html</link>
<description><![CDATA[Provided is a method for generating an on-demand, custom runtime solution to a user or business's computing needs. A library of software components corresponding to different computing tasks of a business situation is created. Each software component is associated with one or more meta descriptors. Aggregate descriptors are created that define relationships between software components and other software components, software components and aggregate descriptors and between aggregate descriptors. The software components and related meta and aggregate descriptors are managed by means of a software component meta management system (SCMMS). Employing the SCMMS, software components are registered and managed in a hierarchical structure based upon the interrelationships among the software components and the aggregate descriptors. The hierarchical structure is multi-layered, with different layers having different scopes. Users specify the number of levels and how the levels are defined. Meta descriptors are defined at each level.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Workflow definition and management system]]></title>
<link>http://www.freepatentsonline.com/7617245.html</link>
<description><![CDATA[A workflow can be managed by presenting one or more questions to a user, wherein the questions are associated with a present status of an entity being processed through a workflow; receiving input from the user corresponding to the presented questions; evaluating the received input to determine whether one or more tasks associated with the present status have been completed; determining to advance the entity to a subsequent status in the workflow if each of the tasks associated with the present status has been completed; and executing an action mapping to advance the entity. Further, it can be determined not to advance the entity to the subsequent status in the workflow if each of the one or more tasks associated with the present status has not been completed. Thus, the entity can be retained in the present status or transferred to a previous status in the workflow.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Remote file updates through remote protocol]]></title>
<link>http://www.freepatentsonline.com/7617256.html</link>
<description><![CDATA[An improved remote protocol enables efficient and reliable updating of files on a remote server. A gather-copy extension to a remote protocol enables a client to instruct a server to gather portions of data from an existing source file on the server and to copy those portions of data to appropriate offsets within a new destination file on the server. The gather-copy extension thus enables the client to leave blank locations in the destination file into which the client can write new data during a file update. The gather-copy extension also enables the client to effectively delete portions of the source file by not copying them from the source file to the destination file. File updates can therefore be made without having to transfer the entire file from the client to the server.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Characterizing context-sensitive search results as non-spam]]></title>
<link>http://www.freepatentsonline.com/7617199.html</link>
<description><![CDATA[Methods and apparatus assessing, ranking, organizing, and presenting search results associated with a user's current work context are disclosed. The system disclosed assesses, ranks, organizes and presents search results against a user's current work context by comparing statistical and heuristic models of the search results to a statistical and heuristic model of the user's current work context. In this manner, search results are assessed, ranked, organized, and/or presented with the benefit of attributes of the user's current work context that are predictive of relevance, such as words in a user's document (e.g., web page or word processing document) that may not have been included in the search query. In addition, search results from multiple search engines are combined into an organization scheme that best reflects the user's current task. As a result, lists of search results from different search engines can be more usefully presented to the user.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Parallel remembered-set processing respecting popular-object detection]]></title>
<link>http://www.freepatentsonline.com/7617264.html</link>
<description><![CDATA[A garbage collector that operates in multiple threads divides a generation of a garbage-collected heap into heap sections, with which it associates respective remembered sets of locations where references to objects in those heap sections have been found. When such a heap section comes up for collection, each of a plurality of parallel garbage-collector threads that is processing its remembered set maintains a separate “popularity”—indicating count map, which includes an entry for each of a set of segments into which the collector has divided that heap section. The thread increments an entry in its count map each time it finds a reference to an object in the associated segment. If an object is located in a segment for which the associated count-map entry has exceeded a threshold, the thread evacuates the object in a manner different from that in which it evacuates objects not thus been found to be popular.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Displaying context-sensitive ranked search results]]></title>
<link>http://www.freepatentsonline.com/7617200.html</link>
<description><![CDATA[Methods and apparatus assessing, ranking, organizing, and presenting search results associated with a user's current work context are disclosed. The system disclosed assesses, ranks, organizes and presents search results against a user's current work context by comparing statistical and heuristic models of the search results to a statistical and heuristic model of the user's current work context. In this manner, search results are assessed, ranked, organized, and/or presented with the benefit of attributes of the user's current work context that are predictive of relevance, such as words in a user's document (e.g., web page or word processing document) that may not have been included in the search query. In addition, search results from multiple search engines are combined into an organization scheme that best reflects the user's current task. As a result, lists of search results from different search engines can be more usefully presented to the user.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Marketplace system that supports user-to-user sales via a definitive product catalog]]></title>
<link>http://www.freepatentsonline.com/7614552.html</link>
<description><![CDATA[An electronic marketplace system embodies various inventions for assisting users in listing products for sale, locating the listings for a product, and performing related actions. A user wishing to sell a product can browse to an existing description of the product in an electronic catalog and then select an option to create a corresponding listing. To create the listing for the selected product, the user preferably specifies the product's condition and a selling price. The pending listings for a product are preferably displayed or summarized on the product's detail page in the catalog. When no such listings exist, an option to preorder the product from an unspecified seller may be provided. In one embodiment, the electronic catalog also serves as a retail sales catalog of a merchant.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Techniques for using an image for the retrieval of television program information]]></title>
<link>http://www.freepatentsonline.com/7616840.html</link>
<description><![CDATA[A method for determining a video file such as a television program file is provided. The method comprises receiving information identifying an input image; comparing the input image with a plurality of video files to determine a video file that includes information that is considered to match the input image; and providing access to that video file or otherwise performing an action in response to the determination.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Managing and unifying structured representations of product information]]></title>
<link>http://www.freepatentsonline.com/7617014.html</link>
<description><![CDATA[Aspects of the subject matter described herein relate to defining, sharing, unifying, and managing multiple structured representations of product information in the context of business activities. In certain aspects a data structure is provided that enables, among other things, unambiguous specification of subelements. In other aspects, a method is provided which may be used to, among other things, unambiguously specify subelements. Other aspects are described in the specification.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Efficiency of training for ranking systems based on pairwise training with aggregated gradients]]></title>
<link>http://www.freepatentsonline.com/7617164.html</link>
<description><![CDATA[The subject disclosure pertains to systems and methods for facilitating training of machine learning systems utilizing pairwise training. The number of computations required during pairwise training is reduced by grouping the computations. First, a score is generated for each retrieved data item. During processing of the data item pairs, the scores of the data items in the pair are retrieved and used to generate a gradient for each data item. Once all of the pairs have been processed, the gradients for each data item are aggregated and the aggregated gradients are used to update the machine learning system.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for analyzing statistics in a reporting system]]></title>
<link>http://www.freepatentsonline.com/7617201.html</link>
<description><![CDATA[A system and method for monitoring and analyzing statistics regarding informational and transactional data is provided. Data distribution servers provide e-mail and other messages of topical interest to a subset of the subscribers. The content may be generated by an OLAP based channel database system, and the output may also be communicated to individuals via spreadsheet programs data, pager, telephone, mobile phone, fax, personal digital assistants, HTML e-mail and other formats, including a workbook file attachment. Statistics regarding the provided reports are generated and compiled. Analysis of the statistics may enable evaluations of system performance, application usage, and optimal configurations for the system.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Adaptive threshold based spam classification]]></title>
<link>http://www.freepatentsonline.com/7617285.html</link>
<description><![CDATA[A spam classification manager uses a dynamically adaptive decision threshold for detecting spam email messages. For each of a plurality of time periods, the spam classification manager calculates an adaptive decision threshold to use to adjudicate whether or not received email messages comprise spam. The threshold is based on ratios between clean and spam emails received in previous time periods, as well as a misclassification cost ratio. The spam classification manager determines a likelihood of each incoming email message received during the time period being spam, and adjudicates whether each message in fact comprises spam by comparing the determined likelihood to the threshold. The spam classification manager keeps track of incoming email messages received during the time period adjudicated to be spam and adjudicated to be clean, and uses that information in the calculation of adaptive thresholds for future time periods.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Providing archiving of individual mail content while maintaining a single copy mail store]]></title>
<link>http://www.freepatentsonline.com/7617297.html</link>
<description><![CDATA[A data processing system for providing archiving of individual mail content while maintaining a single copy mail store can include a mail application enabled to maintain a single copy mail store, a primary data store configured for high data throughput and acting as a single copy mail store for the mail application, and a secondary data store configured for mass storage and having a lower data throughput than the primary data store. The system further can include at least one archive implementation of an archive interface, the archive interface defining an archive task and a restore task. In one aspect of the embodiment, the system can include each of a content table, a content map table and a restore queue. Furthermore, the system can include a map view of archived content for a specified user, the map view providing a user interface for activating the restore task.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Node matching in a dynamic, decentralized environment]]></title>
<link>http://www.freepatentsonline.com/7617300.html</link>
<description><![CDATA[Computing entities in a dynamic, decentralized computing environment are treated as if these computing entities were nodes in a graph linked by edges so as to match these nodes until no further matches are possible. New nodes may dynamically be introduced into the decentralized computing environment and yet various embodiments of the present invention continue to match nodes while inhibiting deadlocks in the decentralized computing environment.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Marketplace system capable of using purchase history data to generate listing request messages]]></title>
<link>http://www.freepatentsonline.com/7614547.html</link>
<description><![CDATA[An electronic marketplace system provides various features for assisting users in listing products for sale, locating the listings for a product, and performing related actions. A user wishing to sell a product can browse to an existing description of the product in an electronic catalog and then select an option to create a corresponding listing. If the user previously purchased the product via the system, the user may alternatively select the product from a personal purchase history. The system may also proactively send product-specific listing requests to those who have purchased or otherwise indicated ownership of specific products.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and system of managing service reminders and promotions using mileage estimates]]></title>
<link>http://www.freepatentsonline.com/7617028.html</link>
<description><![CDATA[The present invention provides a method and system for screening and sending appropriate promotions with a system for generating and sending service reminders based on the estimated mileage the vehicle. The mileage of the vehicle can be estimated based on the age of the vehicle, or it can be based on the last known mileage of the vehicle and estimating the additional mileage using average vehicle mileage statistics. The mileage of the vehicle may be estimated based on actual vehicle history, and may be adjusted based on the characteristics of the vehicle, the driver, or the geographic location of the vehicle. Promotions may be screened according to mileage, vehicle characteristics, vehicle operational characteristics, driver preferences or characteristics, or seasonal characteristics.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Map information system and map information processing method and program]]></title>
<link>http://www.freepatentsonline.com/7617047.html</link>
<description><![CDATA[A map information system is provided which includes an electronic pen which reads a dot pattern in a form where map images are shown, to output handwriting information, and a processing unit including an association module which associates the output handwriting information with one of the map images where the handwriting information is written and stores it in a storage unit, a search module which searches for the associated handwriting information and map image using information to specify the map image as a search key, a pattern assignment module which when acquiring print request information including information to specify the map images to be printed, newly assigns a dot pattern, and an output instruction module which issues an output instruction so as to cause an output unit to visually output data including the retrieved associated handwriting information and map image and the newly assigned dot pattern.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Device search apparatus]]></title>
<link>http://www.freepatentsonline.com/7617455.html</link>
<description><![CDATA[There is disclosed an apparatus for searching a device on a network. A device search client links a search condition for searching the device with an icon to store the search condition. When a user designates the icon, the search condition linked with the icon and stored is inquired of a device search server to obtain the search result. Subsequently, the display form of the designated icon corresponding to the search condition is changed based on the obtained search result.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Medical image review workstation with integrated content-based resource retrieval]]></title>
<link>http://www.freepatentsonline.com/7616793.html</link>
<description><![CDATA[A review workstation for facilitating interpretation of a medical image by a user is described. The review workstation comprises a display device displaying the medical image to the user, and an input device receiving a graphical identification of a region of interest (ROI) in the medical image that is interesting to the user. Responsive to the identification of the ROI, a content-based image comparison is performed between the ROI and a resource database, the resource database comprising a collection of resource images previously analyzed by human interpreters and textual information associated with those previous analyses. The content-based image comparison comprises identifying a subset of the resource images similar to the ROI with respect to a preselected set of computed features. The display device subsequently displays to the user at least one of the identified subset of resource images and its associated textual information simultaneously with the ROI.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Geospatial modeling system providing geospatial model data target point filtering based upon radial line segments and related methods]]></title>
<link>http://www.freepatentsonline.com/7616828.html</link>
<description><![CDATA[A geospatial modeling system may include a geospatial model database and a processor cooperating therewith for filtering geospatial model data. This may be done by selectively updating a target point based upon adjacent points lying along a plurality of radial line segments extending outwardly from the at least one target point.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Real time push notification in an event driven network]]></title>
<link>http://www.freepatentsonline.com/7617162.html</link>
<description><![CDATA[Disclosed herein is a method and system for matching attributes across an event driven network of user applications at the instance of a change in the attribute profiles of a user application. Each user application in the network has a set of one or more updatable attributes. Once a change is made to one or more attributes in the user application, information about the changed attribute is broadcasted to other user applications in the event driven network. A notification manager coordinates the trigger for notification and the matching of the attributes.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Component based task handling during claim processing]]></title>
<link>http://www.freepatentsonline.com/7617240.html</link>
<description><![CDATA[A computer program for handling insurance-related tasks includes a data component that stores, retrieves and manipulates data utilizing a plurality of functions, a client component that includes: (1) an adapter component that transmits and receives data to/from the data component; (2) a business component that serves as a data cache and includes logic for manipulating the data; and (3) a controller component that is adapted to handle events generated by a user utilizing the business component to cache data and the component to ultimately persist data to a data repository. In use, the client component allows a user to define tasks during execution phase of the program that achieve a goal upon completion. The user is able to input rules which dictate which tasks should be selected based on a set of predetermined events. Tasks are generated based on received events.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method, apparatus, computer program product and web-enabled service providing dynamically adjustable policies]]></title>
<link>http://www.freepatentsonline.com/7617304.html</link>
<description><![CDATA[Described is a method, a system, a computer program product and a service implemented at least partially through a data communications network to dynamically change the effect of an enforcement of a policy in a policy-managed system. The method, system, computer program product and service enabling the user to identify at least one policy as a dynamic policy and to specify at least one part of a policy statement of the dynamic policy to have a value that can be varied while the policy is active.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Context conflict resolution and automatic context source maintenance]]></title>
<link>http://www.freepatentsonline.com/7617308.html</link>
<description><![CDATA[Techniques are disclosed for detecting and resolving conflicts in context information from various sources. That information may be used to automatically update one or more context sources and/or to validate or invalidate (until further notice or for a period of time) input from one or more context sources. Or, the updates can be made in response to the user's instructions. Rules are used in preferred embodiments to dictate the conflict resolution approach for individual users. Updating the context source is particularly useful when the source is an electronic calendar. Updates that may be made to the calendar include adding, deleting, or changing scheduled events and/or working hours. Invalidating data from a context source is particularly useful for lost, forgotten, misplaced, or loaned devices. Marking data from a context source as valid is preferably done when harmony among several context sources is detected. Context suppliers may be notified of errors or discrepancies in their context data.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method and system for validating logical end-to-end access paths in storage area networks]]></title>
<link>http://www.freepatentsonline.com/7617320.html</link>
<description><![CDATA[A method and system for validating logical access path in a storage area network is provided. It supports definition of a SAN access path policy that represent which application to data LUN logical access paths should not exist, which should exist, and what should be the end-to-end attributes of each. It performs the SAN-customized graph-based validation algorithm based on information it collects automatically from devices distributed across the SAN using a variety of non-intrusive mechanisms. It enables to identify violations of actual logical access paths relative to the required access paths as determined by the policy. It enables notification about violations, with all their relevant context information, to the appropriate target recipient using a variety of means.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Avoiding copy on first write]]></title>
<link>http://www.freepatentsonline.com/7617372.html</link>
<description><![CDATA[Handling a write operation to write data to a section of a storage device includes determining if the section needs to be copied to at least a first target device and, if the section of the storage device needs to be copied to the at least first target device, providing the data to a memory location and confirming completion of the write operation prior to copying the section of the storage device to the at least first target device. Handling a write operation to write data to a section of a storage device may also include determining if a slot in a cache memory corresponding to the section of the storage device needs to be copied to at least a second target device. If so, then in some cases the slot may be copied to the at least second target device prior to providing the data to the memory location.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Resource conflict management using predefined XML schemas]]></title>
<link>http://www.freepatentsonline.com/7617498.html</link>
<description><![CDATA[A method and system for identifying conflicting resource claims by applications for a system having a plurality of resources. A set of schemas are predefined for the system, wherein each schema defines a pooling of the resources of the system. Each application is then created based upon one of the schemas so as to be associated with a specified pool or subset of device resources. Applications are executed by a browser. Each application may have more than one state, and each state may have an associated schema. Requests for changes of state, such as invoking an instance of the application, are received by the browser. The browser informs a resource manager of the associated schema and the resource manager identifies the pool or subset of resources for requested state change based upon its schema and determines whether or not the resources are currently in use by another active application. Conflicts may be resolved by a conflict resolution component.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method, system, and computer program product for sharing information between hypertext markup language (HTML) forms using a cookie]]></title>
<link>http://www.freepatentsonline.com/7617233.html</link>
<description><![CDATA[The present invention provides a method, system, and computer program product for automatically sharing information between HTML forms using a cookie. A method in accordance with the present invention comprises: providing a cookie containing at least one name-value pair; determining if an input element of a form contains a variable indicating that the input element is enabled for automatic populating, wherein the variable includes a name attribute; and automatically populating the input element of the form using the value in the corresponding name-value pair if the name attribute of the variable corresponds to a name-value pair in the cookie.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Apparatus and method for secure downloading of files]]></title>
<link>http://www.freepatentsonline.com/7617124.html</link>
<description><![CDATA[A download processor for secure downloading of a digital product file when ordered by a user. The order includes a file identifier related to the file and an order identifier related to the order. The download processor performs security checks related to the file, the order, and the user. The file identifier and order identifier are verified based upon information related to the file and the order, and information related to the user is also verified. Based upon the verifications, the download processor selectively permits or denies download of the file to a user machine.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Reducing scattering center data using magnitude-based reduction]]></title>
<link>http://www.freepatentsonline.com/7616151.html</link>
<description><![CDATA[A method to reduce scattering centers (SC) includes receiving a set of SC data points representing an object. The method also includes reducing SC data points associated with a first region based on magnitudes of intensity of the SC data points associated with the first region, reducing SC data points associated with a second region based on magnitudes of intensity of the SC data points associated with the second region, combining the reduced SC data points associated with the first region and the second region to form a reduced set of SC data points, comparing the reduced set of SC data points with the received set of SC data points to determine if the reduced set of SC data points meets a set of comparison metrics and if the reduced set of SC data points meets the set of comparison metrics, performing another iteration of the reducing.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[System and method for using a data replication service to manage a configuration repository]]></title>
<link>http://www.freepatentsonline.com/7617289.html</link>
<description><![CDATA[A mechanism for making changes consistently across an application server domain or a cluster. Server configuration consistency is absolutely necessary for cluster deployments. The invention allows changes to the configuration repository and to the application deployment process to be managed via a Data Replication Service (DRS). The former requires that the configuration repository be version aware, while the latter breaks down the application deployment process into two phases—one for data distribution and processing as far as possible, and the second to expose the changes through the Java Naming and Directory Interface (JNDI).]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Method for managing download of duplicate contents]]></title>
<link>http://www.freepatentsonline.com/7617540.html</link>
<description><![CDATA[A method for managing downloads of contents. This method provides for a replay memory that stores a globally unique right object identifier (GUID) and a right issuer timestamp (RITS). A duplication memory is used to store a right object (RO) in downloading a duplicate of content that is already stored in the replay memory. When a right issuer timestamp (RITS) included in the right object (RO) of the currently received content is less than the current time plus the set threshold value, and the globally unique right object identifier (GUID) and the right issuer timestamp (RITS) of the received right object (RO) are already stored in the replay memory, the received right object (RO) is separately stored in the duplication memory in association with the globally unique right object identifier (GUID).]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

<item>
<title><![CDATA[Authoring speech grammars]]></title>
<link>http://www.freepatentsonline.com/7617093.html</link>
<description><![CDATA[A method and apparatus are provided for automatically forming a grammar. Example text strings are received and N-grams are formed based on the text strings. A rule in the grammar is then generated automatically based in part on the n-grams.]]></description>
<pubDate>Tue, 10 Nov 2009 08:00:00 EST</pubDate>
</item>

</channel>
</rss>
