17th week of 2009 patent applcation highlights part 57 |
Patent application number | Title | Published |
20090106170 | METHOD AND SYSTEM FOR AIR FARE VERIFICATION AUDITING - A method and system for air fare verification and auditing for a travel itinerary during a ticketing transaction. A request is received from a customer to verify the air fare for the travel itinerary. The fare verification process determines if the air fare for the travel itinerary is in a fares database. A plurality of rules and restrictions that are applicable to the air fare are validated. The process determines if the air fare passes each of the plurality of rules and restrictions and verifies the air fare if all rules and restrictions are satisfied. A verification response can be provided to the customer for the air fare verification request during the ticketing transaction. An audit report can also be provided via a web reporting tool in near real time. | 2009-04-23 |
20090106171 | Artificial intelligence platform - The present invention provides a new and unique platform for authoring and deploying interactive characters which are powered by artificial intelligence. The platform permits the creation of a virtual world populated by multiple characters and objects, interacting with one another so as to create a life-like virtual world and interacting with a user so as to provide a more interesting and powerful experience for the user. This system can be used for entertainment purposes, for commercial purposes, for educational purposes, etc. | 2009-04-23 |
20090106172 | FALSE DISCOVERY RATE FOR GRAPHICAL MODLES - The claimed subject matter provides systems and/or methods that determines a number of non-spurious arcs associated with a learned graphical model. The system can include devices and mechanisms that utilize learning algorithms and datasets to generate learned graphical models and graphical models associated with null permutations of the datasets, ascertaining the average number of arcs associated with the graphical models associated with null permutations of the datasets, enumerating the total number of arcs affiliated with the learned graphical model, and presenting a ratio of the average number of arcs to the total number of arcs, the ratio indicative of the number of non-spurious arcs associated the learned graphical model. | 2009-04-23 |
20090106173 | LIMITED-MEMORY QUASI-NEWTON OPTIMIZATION ALGORITHM FOR L1-REGULARIZED OBJECTIVES - An algorithm that employs modified methods developed for optimizing differential functions but which can also handle the special non-differentiabilities that occur with the L | 2009-04-23 |
20090106174 | METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS EXTRACTING NETWORK BEHAVIORAL METRICS AND TRACKING NETWORK BEHAVIORAL CHANGES - A network behavioral metric is extracted from a communication network based on a relevancy of the metric to network behavior by identifying a network metric x that is defined as a random variable that represents a quantitative measure of a network behavior accumulated over a period of time, selecting a network feature, generating a metric disintegration model for the network metric x comprising at least one normal behavior probability distribution function for the metric x for each value of the network feature, respectively, and at least one abnormal behavior probability distribution function for the metric x for each value of the network feature, respectively, increasing a number of the values of the metric x that indicates normal network behavior and/or abnormal network behavior based on the metric disintegration model, and selecting a network metric x as a behavioral metric based on a relevancy η of the network metric x to the network behavior. Embodiments for tracking network behavioral changes are also provided. | 2009-04-23 |
20090106175 | MANAGEMENT OF APPLICATIVE STREAMS IN MOBILE NETWORKS - A method is provided for constructing at least one decision graph for managing at least one applicative stream assigned to a terminal and set up between the terminal and a correspondent via at least one communication network. The method includes a step of dynamically constructing at least one possible decision graph for the one applicative stream assigned to the terminal, itself including a step of exchanging at least one configuration message between at least two decision modules pertaining to a predetermined set of decision modules. | 2009-04-23 |
20090106176 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM - An information processing apparatus for generating an algorithm determining a similarity between a pair of data. The apparatus includes: a feature-quantity-extraction expression list generation mechanism generating a feature-quantity-extraction expression list including a plurality of feature-quantity-extraction expressions including a plurality of operators by updating the feature-quantity-extraction expression list of a preceding generation; a calculation mechanism inputting first and second data given as teacher data into each of the feature-quantity-extraction expressions included in the feature-quantity-extraction expression list to calculate a feature quantity corresponding to each of the first and the second data; an evaluation-value calculation mechanism calculating the evaluation value of each of the feature-quantity-extraction expressions using the calculated feature quantities and a similarity between the first and the second data given as the teacher data; and a similarity-calculation expression estimation mechanism estimating a similarity calculation expression for calculating a similarity between the first and the second data given as the teacher data. | 2009-04-23 |
20090106177 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND PROGRAM - An information processing device for generating a target feature amount computational expression for outputting a target feature amount corresponding to input data, comprising: a feature amount extraction expression list generating unit configured to generate and update a feature amount extraction expression list; a feature amount computing unit configured to input actual data supplied as tutor data to each feature amount extraction expression included in the feature amount extraction expression list to compute multiple feature amounts corresponding to the actual data; a target feature amount computational expression generating unit configured to employ the multiple feature amounts, and an existing feature amount corresponding to the actual data supplied as tutor data for the same rank to generate the target feature amount computational expression by machine learning; and an evaluation value computing unit configured to compute the evaluation value of each feature amount extraction expression included in the feature amount extraction expression list. | 2009-04-23 |
20090106178 | Computer-Implemented Systems And Methods For Updating Predictive Models - Computer-implemented systems and methods for updating champion predictive models that operate within a production environment. A system and method can include evaluating the predictive model performance of a champion predictive model. Based upon an indication of decay of predictive model performance of the champion predictive model, a corrective action is performed to correct the performance of the champion predictive model. | 2009-04-23 |
20090106179 | SYSTEM AND METHOD FOR THE LONGITUDINAL ANALYSIS OF EDUCATION OUTCOMES USING COHORT LIFE CYCLES, CLUSTER ANALYTICS-BASED COHORT ANALYSIS, AND PROBABLISTIC DATA SCHEMAS - A computer implemented method, computer program product, and data processing system for performing analysis on a plurality of data stored in a database. In an illustrative method, a first cohort is generated from the plurality of data. An optimal control cohort is generated from the plurality of data. Generating is performed based on the first cohort and at least one constraint, and a mathematical process is used to derive the optimal control cohort. A first inference is generated based on a comparison of the first cohort to the optimal control cohort, wherein the first inference is absent from the database. In an illustrative example, the first inference is stored. | 2009-04-23 |
20090106180 | HEALTH METER - Techniques for indicating the status or health of a software system in a simple and summarized manner. In one embodiment, a health meter is displayed that displays a status value indicating the status or health of the software system. The status or health of the system as indicated by the health meter may be based upon one or more characteristics or perspectives (or components) of the system, such as performance, resource utilization, reliability, availability, scalability, and status values computed for the components. | 2009-04-23 |
20090106181 | Procedural Constraint Engine - Various systems and methods for integrating procedural logic with a stateless constraint engine are disclosed. One method involves accessing a first set of values generated by a stateless constraint engine based upon a first set of inputs and then accessing a second set of values generated by the stateless constraint engine subsequent to the first set of values and based upon a second set of inputs. The second set of values is validated based upon a procedural constraint. The procedural constraint can include a precondition and a postcondition. The precondition is dependent upon at least one value from the first set of values, and the postcondition is dependent upon at least one value from the second set of values. | 2009-04-23 |
20090106182 | DATA FLOW ANALZYING APPARATUS, DATA FLOW ANALYZING METHOD AND DATA FLOW ANALYZING PROGRAM - A data flow analyzing apparatus includes an analysis rule storage which stores analysis rules having definitions of data types, a data flow analyzer which performs data flow analysis on an analysis target program as a target of analysis by using the analysis rules stored in the analysis rule storage to thereby output unsafe data-including procedures as detected points, an analysis rule candidate generator which generates candidates of analysis rules based on the detected points, and an analysis rule candidate output which outputs the analysis rule candidates generated by the analysis rule candidate generator to a predetermined output. | 2009-04-23 |
20090106183 | EXTENDED FINITE STATE AUTOMATA AND SYSTEMS AND METHODS FOR RECOGNIZING PATTERNS USING EXTENDED FINITE STATE AUTOMATA - Deterministic finite automata (DFAs) are popular solutions to deep packet inspection because they are fast and DFAs corresponding to multiple signatures are combinable into a single DFA. Combining such DFAs causes an explosive increase in memory usage. Extended finite automata (XFAs) are an alternative to DFAs that avoids state-space explosion problems. XFAs extend DFAs with a few bytes of “scratch memory” used to store bits and other data structures that record progress. Simple programs associated with automaton states and/or transitions manipulate this scratch memory. XFAs are deterministic in their operation, are equivalent to DFAs in expressiveness, and require no custom hardware support. Fully functional prototype XFA implementations show that, for most signature sets, XFAs are at least 10,000 times smaller than the DFA matching all signatures. XFAs are 10 times smaller and 5 times faster or 5 times smaller and 20 times faster than systems using multiple DFAs. | 2009-04-23 |
20090106184 | LOCATING DENSE AND ISOLATED SUB-GRAPHS - Methods and apparatus for locating a dense and isolated sub-graph from a weighted graph having multiple nodes and multiple weighted edges are described. Each node in the weighted graph represents an object. Each weighted edge in the weighted graph connects two nodes and represents the relationship between the two objects represented by the two corresponding nodes. To located the sub-graph, first, an auxiliary weighted graph is constructed using the weighted graph and three coefficients: α, β, and γ, where α, β, and γ are greater than 0, α influences the number of nodes inside the sub-graph, β influences the sum of the weights associated with the edges connecting a node inside the sub-graph and a node outside the sub-graph, and γ influences the sum of the weights associated with the edges connecting two nodes both inside the sub-graph, and by adding a source node s and a sink node t. Next, the auxiliary weighted graph is partitioned into two parts using the s-t minimum cut algorithm. The sub-graph is the part associated with the sink node t in its original form, with the original undirected edges and unmodified edge weights and excluding the sink node t and all the new edges added during the construction of the auxiliary weighted graph. | 2009-04-23 |
20090106185 | Measurement data management with combined file database and relational database - A device for managing a plurality of measurement data, each measurement data representing a value of a physical parameter, the device comprising a file database adapted for storing the plurality of measurement data in the form of data files each of which being assigned to a specific measurement, a relational database adapted for storing at least a part of the plurality of measurement data in the form of relational data being structured in accordance with individual measurement parameters assigned to different measurements, and a processing unit adapted for extracting the relational data from the data files. | 2009-04-23 |
20090106186 | Dynamically Generating an XQuery - Dynamically generating an XQuery for an XML database storing a plurality of non-XML documents, each non-XML document having a corresponding shadow XML document in the XML database. The method may include providing a plurality of static units of XQuery code, the static units being predefined in accordance with the non-XML documents. The method may further include combining the one or more static units with dynamic input from a user to generate the XQuery. | 2009-04-23 |
20090106187 | INFORMATION PROCESSING APPARATUS HAVING PROCESS UNITS OPERABLE IN PARALLEL - An information processing apparatus according to an exemplary aspect of the invention includes a plurality of process units operable in parallel and a cache unit. The information processing apparatus executes a series of processes including access to a database through pipelining of the plurality of process units. The plurality of process units corresponds to a plurality of block process on a one-by-one basis. The series of processes are divided into the plurality of block processes such that reference of a content of data stored in the database by one of the plurality of process units is not followed by update of the data by any of others of the plurality of process units. Each of the plurality of process units executes one of the plurality of block processes at a predetermined timing. The plurality of block processes include a first block process including update of first data in the database. The plurality of process units includes a first process unit corresponding to the first block process. Updated contents of the first data are obtained in executions of the first block process by the first process unit. The cache unit is provided to be associated with the first process unit and holds the updated contents in a format by which an order of additions of the updated contents is recognizable. | 2009-04-23 |
20090106188 | IMAGE PROCESSOR, STORED DOCUMENT MANAGEMENT METHOD, AND STORED DOCUMENT MANAGEMENT SYSTEM - An image processor includes a document name list acquisition unit, a document name list storage device, a document acquisition unit, and a document name assignment unit. The document name list acquisition unit acquires information of a document name list including a document name of each of a plurality of documents to be stored in the image processor. The document name list storage device stores the information of the document name list. The document acquisition unit acquires information of the plurality of documents. The document name assignment unit acquires the document name corresponding to each of the plurality of documents from the information of the document name list stored in the document name list storage device and assigns the document name to each of the plurality of documents. | 2009-04-23 |
20090106189 | Dynamically Sharing A Subtree Of Operators In A Data Stream Management System Operating On Existing Queries - A new continuous query to a data stream management system (DSMS) may use several operators that are equivalent to operators currently being used by continuous queries that have been previously registered in the DSMS. To determine equivalence of operators, the DSMS checks at least the function and the data input to the operators. On finding equivalence, the DSMS modifies a global plan being executed, to use at least an existing subtree of operators during execution of the new continuous query, to generate a modified plan. The DSMS is also programmed to cause each relation source operator (which outputs a relation) to propagate a current state of the relation to each operator newly coupled to the relational operator. After propagation of current state to newly-coupled operators, each operator in the modified plan processes any new data and supplies the result to all operators coupled thereto, including newly-coupled operators and existing operators. | 2009-04-23 |
20090106190 | Support For User Defined Functions In A Data Stream Management System - A data stream management system (DSMS) is designed to support a new user-defined function, by creating and using at least two structures as follows. A first structure (“metadata entry”) is created in response to a command for creation of the new function, and maps a single instance of a class to the function's name. A second structure is created with creation of an operator on receipt of each new continuous query that uses the new function. The second structure (“operator specific data structure”) contains a path to the newly-created instance, which path is obtained by looking up the first structure. Additional second structures are created on receipt of additional continuous queries which use the new function, but all second structures contain the same path. All continuous queries use the same instance. Repeated use of a single instance to compile and execute multiple queries eliminates repeated instantiation of the same function. | 2009-04-23 |
20090106191 | SEARCH CENTER DYNAMIC CONFIGURATION USING FIELD MAPPINGS - A mechanism for dynamically configuring searchable fields of interest within a search provided. A field mappings file is used to define relationships between searchable interest in searchable objects and fields within a search index accessible to an se-wide search center. The field mappings file can provide the defined relationships searchable object fields and search index fields at runtime of a user session, thus a rigid configuration at the time of search center initialization. | 2009-04-23 |
20090106192 | Visual database for online transactions - A system of searching an image database. An image database is associated with an on-line merchant, and each of the images in the database are associated with items which can be purchased. Image information is entered, and that image to information is used to search the items in the database. | 2009-04-23 |
20090106193 | REAL TIME RESPONSES IN DECENTRALIZED NETWORKS - A method of enabling a user to obtain a query result in a data network is provided taken latency problems of decentralised networks comprising a number of entities into account. The method comprises the steps of sending a query from a requesting entity to a number of further entities in the data network, receiving responses from at least some of the further entities and determining an initial relative response time for an initial group of said responses, determining a current relative response time for further incoming responses, comparing the initial relative response time with the current relative response time, and presenting the responses to a user of the requesting entity when the difference between the initial relative response time and the current relative response time exceeds a relative response-time parameter Further, a computer readable medium and a device provided with or for carrying out such methods are provided. | 2009-04-23 |
20090106194 | METHOD, INFORMATION PROCESSING APPARATUS, AND PROGRAM OF SEARCHING FOR, AGGREGATING AND SORTING TREES - A searching method for tree data structure topology employs an array generated as a search key array representing a tree serving as search key to represent a parent-child relationship between nodes. The array has the node identifier assigned to a parent node associated with a corresponding non-root node. Non-root nodes are nodes other than a root node, and the node identifier assigned to the parent node corresponds to the node identifier assigned to associated non-root nodes. An offset is applied to node identifiers in the search key array, the node identifiers to which offset is applied are compared with corresponding node identifiers contained in a portion in a C-P array, the portion determined according to the offset, and a vertex node list indicating a search result is stored, wherein the search result contains node identifiers included in a portion of the C-P array whose all nodes matched in comparison. | 2009-04-23 |
20090106195 | Information Processing Apparatus, Information Processing Method and Program - The present invention relates to an information processing apparatus, an information processing method and an information processing program that are capable of assigning an optimum keyword to a content. The information processing apparatus includes a content characteristic quantity extraction unit | 2009-04-23 |
20090106196 | TRANSFERRING RECORDS BETWEEN TABLES USING A CHANGE TRANSACTION LOG - A method and apparatus for transferring records between database tables using a transaction log. In one embodiment of the method, a first application generates a transaction for deleting a record from a first table in a database. In response to the generation of the first transaction, a copy of the record is stored in an entry of a transaction log before the record is deleted from the first table. A second application generates an instruction for copying the record from the transaction log to a second table, and the record is copied from the entry to the second table. | 2009-04-23 |
20090106197 | System and method for creating a collection of business listings - A system and method for developing a local business listing Internet site through member generated business listings is described. The members of the service provider providing the site are compensated with a portion of the money received by the service provider for the member created listings. | 2009-04-23 |
20090106198 | Support for sharing computation between aggregations in a data stream management system - A computer is programmed to process a continuous query that is known to perform a new aggregation on one or more stream(s) of data, using one or more other aggregations on the stream(s). The computer creates an operator to execute the continuous query, and schedules the operator for execution in a specific order. In several embodiments, the computer determines the order based on dependency of the new aggregation on other aggregation(s), and on the order of performance of the other aggregation(s). The new aggregation is scheduled for performance after performance of each of the other aggregations. The computer is further programmed to pass results of the other aggregations to the new aggregation, by execution of a predetermined function. Support for use of the other aggregations results within the new aggregation eliminates redundant computation of the other aggregations within the new aggregation. The new aggregation may be user defined or built-in. | 2009-04-23 |
20090106199 | COMMUNICATION DEVICE AND AN INFORMATION SEARCHING METHOD - A communication device may be used to obtain information regarding a group including a user and one or more group members. The communication device includes a table creating module, a user interface, a salutation obtaining module, and an information searching module. The table creating module is configured for creating a data table according to the one or more group members and relationships among the one or more group members of the group. The data table includes at least two personal nodes and a group node. The user interface is configured for acquiring login information about the user. The salutation obtaining module is configured for obtaining a salutation that is used by the user for obtaining a group member's information in the group. The information searching module is configured for locating a personal node corresponding to the group member in the data table according to the login information and the salutation. | 2009-04-23 |
20090106200 | Methods and Systems of Content Mobilization, Mobile Search, and Video Editing through a Web Interface - This invention relates to computer implemented methods and systems for content mobilization, and in particular, methods and systems for mobilization of video, music, photos and other media, including processes for mobile search, mobile messaging, building a mobile content library, and combinations thereof. Content mobilization may be initiated by entry of search parameters or keywords and followed by retrieval of search results (e.g. videos, images, audio files) from online source(s). Upon selection of a content item by user, the process dynamically retrieves the media from online source. Further, the media file may be dynamically edited and then dynamically transcoded and sent to a mobile device. | 2009-04-23 |
20090106201 | SYSTEM AND METHOD FOR RELATED INFORMATION SEARCH AND PRESENTATION FROM USER INTERFACE CONTENT - A method and computer program product for extracting primary information from the content in response to an action taken by a user. The primary information includes entities mentioned within the content. Related information is obtained from one or more content sources based on the primary information. The content is annotated to link at least a portion of the content to at least a portion of the related information, thus defining annotated content. At least a portion of the annotated content is provided to the user. | 2009-04-23 |
20090106202 | System And Method For Enabling Search Of Content - A system and method for searching content. The method comprises receiving from a first user metadata relating to generating a guide for content. A guide is generated relating to the content. The guide facilitates navigation of the content on a device. The metadata is forwarded to a metadata analyzer where the metadata is processed to produce processed metadata. The processed metadata is forwarded to an index server. An index is generated for the content based on the metadata at the index server. A query is received from a second user, the index is searched and a result is forwarded to the second user in response to the query. The result includes at least a uniform resource identifier relating to at least some of content. The second user may add additional metadata relating to the content. | 2009-04-23 |
20090106203 | METHOD AND APPARATUS FOR A WEB SEARCH ENGINE GENERATING SUMMARY-STYLE SEARCH RESULTS - A method and apparatus for a summarization-based search engine is presented. This invention provides a concise answer to a user's query—an accurate and up-to-date summary—that is synthesized from multiple contents taken from the World Wide Web. In contrast to conventional search engines, such as Google and Yahoo!, which return the user a list of web links, page titles and sentence fragments, this invention generates more readable, informative, relevant and integrated answers in response to the user's query. Moreover, this invention has broad applications to different search platforms and specific domains. It particularly suits well for mobile devices, inasmuch as its results are more concise than those of conventional search engines. | 2009-04-23 |
20090106204 | COMPONENT PART SEARCH SYSTEM WITH PUBLIC AND PRIVATE COMMUNITIES - A method of providing a searchable parts database includes collecting component part data from a plurality of users to form a component part database. An exclusive group is formed including a subset of the users. User members of the exclusive group are provided with access to the component part data contributed to the database by other user members of the exclusive group. Users excluded from the exclusive group are denied access to the component part data contributed to the database by the user members of the exclusive group. The user members in the exclusive group are enabled to provide images of desired component parts and to search the component part database based upon the images of desired component parts. | 2009-04-23 |
20090106205 | METHOD AND APPARATUS TO DEFINE THE SCOPE OF A SEARCH FOR INFORMATION FROM A TABULAR DATA SOURCE - A method and apparatus for defining the scope of a search is described. In one embodiment, user input is received, and the scope is defined, based on the user input, for a search of free-form text for information from any random rows within a tabular structure of source data. In one embodiment, the search is intended for finding, in the free-form text, a sub-set of data fragments that matches information from any single row within the tabular structure of the source data. | 2009-04-23 |
20090106206 | Progressive reference system, method and apparatus - A written document (hereinafter referred to as a “work,” on electronic format which includes, stories, novels, education texts, biographies, compilations, collections, anthologies, tracts, and any other traditional format for relatively extensive texts) provides access to reference, bibliography and/or definition material through an electronic software capability associated with the work. Depending upon reader access information or characteristics (e.g., age, grade, proficiency, or position within the work or any other identifiable reader characteristic or access limitation), any request for reference material, definitions, explanations, translations, or other material provided in the associated software capability is automatically limited by system acknowledgement of the reader access information or characteristics. As the reader's access information or characteristics change, the quality and/or quantity and/or format of requested information with respect to a work changes. | 2009-04-23 |
20090106207 | Method for restricting access to search results and a search engine supporting the method - In a method for information access, search, and retrieval over a data communication system generally, wherein a query is applied to a set of documents, a result set of the matching documents are identified. The method comprises amending the query according to the access entitlements of the current user to the original documents in source systems, in such a way that only documents the user is allowed to access directly from various source systems appear in the result set, even when the source documents reside in systems of different security domains that potentially are dependent on each other. | 2009-04-23 |
20090106208 | APPARATUS AND METHOD FOR CONTENT ITEM ANNOTATION - An apparatus for content item annotation comprises an ontology processor ( | 2009-04-23 |
20090106209 | Method and system for distributing product information - A method and system of associating product codes with product characteristics, and using those product codes to send and receive information about those characteristics to destinations on a network when the values of those characteristics change. | 2009-04-23 |
20090106210 | METHODS AND SYSTEMS FOR DATABASE ORGANIZATION - A relational database having a plurality of records is organized by using a processing arrangement to perform a clustering operation on the records so as to create a number of clusters. At least one of the clusters is characterized by a selected metadata parameter. The clustering operation is performed to optimize a calculated value of a selected precision factor for the selected metadata parameter. The selected metadata parameter is selected to optimize execution of a database query and the value of the selected precision factor is related to efficiency of execution of the database query. | 2009-04-23 |
20090106211 | System and Method for Processing DNS Queries - Embodiments of the present invention provide a method and system for high-speed database searching with concurrent updating, without the use of database locks or access controls, for large database systems. Specifically, a plurality of search queries may be received over a network, the database may be searched, and a plurality of search replies may be sent over the network. While searching the database, new information received over the network may be incorporated into the database by creating a new element based on the new information and writing a pointer to the new element to the database using a single uninterruptible operation. | 2009-04-23 |
20090106212 | METHOD AND SYSTEM FOR SEARCHING FOR ONLINE USERS - A method and system for searching for online users. A storage unit is set for an SP, and adapted to store the basic information and status information of users. Thus, after receiving an online user search request carrying search conditions from an XDMC, the SP may determine online users meeting the search conditions according to the basic information and status information of users in the storage unit, and returning search results carrying the basic information of the online users to the XDMC. The storage unit may be set for the SP or shared by the SP and the XDMS. Because the storage unit set for the SP stores the basic information and status information of users, the SP does not need to interact with the PS to obtain the status information of users and or interact with the XDMS to obtain the basic information of users after receiving an online user search request from the XDMC. | 2009-04-23 |
20090106213 | System and Method for Resolving MTA Domain Names - A MAC-to-IP system receives IP and/or MAC lease information of network end-points from one or more DHCP servers providing services to a region of a multi-system subscriber access network. The lease information includes the MAC and IP address of devices that can be provisioned by a DHCP server serving the particular region as well as lease expiration information (i.e., time and date). The lease information can be extracted from issued leases and does not affect the issuance of leases by the DHCP server. A DNS-to-MAC-to-IP query interface receives a DNS lookup request for a network end-point from a network device and converts the DNS lookup request into a MAC-to-IP database query. Data is obtained from the MAC-to-IP database to fulfill the DNS lookup request and DNS lookup response is created and sent to the requesting network device. | 2009-04-23 |
20090106214 | ADDING NEW CONTINUOUS QUERIES TO A DATA STREAM MANAGEMENT SYSTEM OPERATING ON EXISTING QUERIES - A new continuous query to a data stream management system (DSMS) may use a stream or a relation which may or may not be used by continuous queries previously registered in the DSMS. The DSMS is programmed to modify an execution plan to accommodate execution of the new query while continuing to execute the previously registered continuous queries. The modified execution plan may include new operators and/or share existing operators. The DSMS is programmed to cause operators which output a relation to propagate a current state of the relation to each newly-coupled operator that uses the relation. The current state is propagated only to operators that have been newly coupled and have thus not yet received any state information previously. After propagation of current state to newly-coupled operators, results of processing any new data for the relation are supplied to all operators coupled thereto, including newly-coupled operators and existing operators. | 2009-04-23 |
20090106215 | DELETING A CONTINUOUS QUERY FROM A DATA STREAM MANAGEMENT SYSTEM CONTINUING TO OPERATE ON OTHER QUERIES - A first continuous query is deleted from several continuous queries that are being executed, by performing different actions that depend on how resources are shared therebetween. As an example, a second continuous query is deleted if a view is referenced by the first continuous query, and if the view is built on the second continuous query, and if the view is not referenced by any query other than the first continuous query. Such deletion is followed by compiling the second continuous query, followed by updating the view to refer to a newly-compiled version of the second continuous query. As another example, if an operator in the first continuous query is not used by any other query, this operator is de-scheduled from execution, and any exclusively-owned resources are released. Also, data to be read by the operator and data generated by the operator, if present in shared resources, are deleted therefrom. | 2009-04-23 |
20090106216 | PUSH-MODEL BASED INDEX UPDATING - A method and apparatus for push-model based index updating. In one embodiment of the method, a first transaction generated for modifying or inserting a first data object into a memory. A first message is generated in response to generating the first transaction, wherein the first message comprises information related to an identifier of the first data object, wherein the first message comprises information that indicates that the first data object was or will be modified or inserted into the memory, and wherein the first message comprises a copy of some or all of the data contents of the first data object; transmitting the first message to a computer system that implements a search engine. | 2009-04-23 |
20090106217 | ONTOLOGY-BASED NETWORK SEARCH ENGINE - A method and apparatus for searching for a documents residing on a network comprises receiving a search request from a user. The search request comprises one or more search terms of an ontology. The ontology includes a plurality of terms. One or more of the plurality of terms includes a plurality of sub-category terms. One or more documents residing on the network is identified based on the one or more search terms and an ontology index. The ontology index comprises a plurality of relationships between the plurality of terms and sub-category terms of the ontology and a plurality of documents residing on the network. One or more search results that describe the one or more documents is presented to the user. The one or more documents contain the one or more search terms, or one of the plurality of sub-category terms of the one or more search terms. | 2009-04-23 |
20090106218 | Support for user defined aggregations in a data stream management system - A computer is programmed to accept a command to create a new aggregation defined by a user during execution of continuous queries on streams of data. The computer is further programmed to thereafter accept and process new continuous queries using the new aggregation, in a manner similar to built-in aggregations. The user typically writes a set of instructions to perform the new aggregation, and identifies in the command, a location of the set of instructions. In response to such a command, the computer creates metadata identifying the new aggregation. The metadata is used to instantiate one aggregation for each group of data in a current window, grouped by an attribute identified in a new query. | 2009-04-23 |
20090106219 | SQL Execution Plan Verification - Approaches, techniques, and mechanisms are disclosed for ensuring that a database command is executed according to a query plan that has been verified to be actually optimal. Except in rare circumstances, a database server does not execute a query plan unless it is first verified by the database server. The database server receives a request to execute a database command. The database server determines an unverified plan is the best plan for satisfying the request. Rather than risk the unknown behavior of an unverified plan, the database server instead satisfies the request according to a verified plan. Subsequently—for example as part of a scheduled job—the database server executes the unverified plan to determine performance statistics. Based at least on the performance statistics, the database server determines whether or not to verify the unverified plan. Techniques for concurrent and optimistic verifications are also disclosed. | 2009-04-23 |
20090106220 | Systems and Methods for Gathering and Selectively Synchronizing State Information of at Least One Machine - A method for gathering and selectively synchronizing state information of at least one machine includes generating, by a first machine, a query identifying a plurality of metrics characterizing a state of a second machine and at least one criterion identifying a circumstance in which to respond to the query. The method includes determining, by the second machine, whether to respond to the query, responsive to the criterion in the query. The method includes transmitting, by the second machine, to the first machine, a response including a subset of the plurality of metrics, responsive to the determination. A system for gathering and selectively synchronizing state information of at least one machine, includes a first machine generating a query. The system includes an agent, on the second machine, determining whether to respond to the query, and transmitting a response including a subset of the plurality of metrics, responsive to the determination. | 2009-04-23 |
20090106221 | Ranking and Providing Search Results Based In Part On A Number Of Click-Through Features - Embodiments are configured to provide information based on a user query. In an embodiment, a system includes a search component having a ranking component that can be used to rank search results as part of a query response. In one embodiment, the ranking component includes a ranking algorithm that can use one or more click-through features to rank search results which may be returned in response to a query. Other embodiments are available. | 2009-04-23 |
20090106222 | Listwise Ranking - Procedures for learning and ranking items in a listwise manner are discussed. A listwise methodology may consider a ranked list, of individual items, as a specific permutation of the items being ranked. In implementations, a listwise loss function may be used in ranking items. A listwise loss function may be a metric which reflects the departure or disorder from an exemplary ranking for one or more sample listwise rankings used in learning. In this manner, the loss function may approximate the exemplary ranking for the plurality of items being ranked. | 2009-04-23 |
20090106223 | ENTERPRISE RELEVANCY RANKING USING A NEURAL NETWORK - A neural network is used to process a set of ranking features in order to determine the relevancy ranking for a set of documents or other items. The neural network calculates a predicted relevancy score for each document and the documents can then be ordered by that score. Alternate embodiments apply a set of data transformations to the ranking features before they are input to the neural network. Training can be used to adapt both the neural network and certain of the data transformations to target environments. | 2009-04-23 |
20090106224 | REAL-TIME QUERY SUGGESTION IN A TROUBLESHOOTING CONTEXT - A method for assisting a user to develop a query in a natural language includes receiving a user's query in a natural language and, while the user's query is being entered, presenting a subset of ranked query suggestions from a collection of ranked query suggestions to the user as candidates for user queries. The subset is based on that portion of the user's query already entered. The query suggestions in the subset of query suggestions are presented according to their respective rankings in the collection. Each of the query suggestions in the collection is formulated to retrieve at least one responsive instance in the knowledge base. The rankings of the query suggestions in the collection are based at least in part on stored logs of prior user sessions in which user queries were input to a search engine for retrieving responsive instances from the knowledge base. | 2009-04-23 |
20090106225 | IDENTIFICATION OF MEDICAL PRACTITIONERS WHO EMPHASIZE SPECIFIC MEDICAL CONDITIONS OR MEDICAL PROCEDURES IN THEIR PRACTICE - A scheme enables the identification of medical professionals having expertise with a particular medical condition or procedure. Areas of expertise are assigned to both conditions and procedures and medical professionals who treat the condition or perform the procedure. A description for treatment is received and used to identify a specific condition or procedure. Upon identification of the condition or procedure, the areas of expertise assigned to the condition or procedure are retrieved. Medical professionals who also have assigned one or more of the retrieved areas of expertise are then identified. | 2009-04-23 |
20090106226 | SEARCH SHORTCUT PULLQUOTES - A system for assisting users in obtaining objective information about consumer products is provided. The system includes pullquotes within a listing of ordered search results, where the pullquotes are extracted from independent objective consumer reviews. | 2009-04-23 |
20090106227 | Lubrication Program Management System and Methods - A system for scheduling a plurality of selected maintenance tasks. The system comprises one or more storage media and a processor. The one or more storage media store data indicative of a plurality of maintenance points, a plurality of task templates, and a plurality of maintenance task definitions as associations between maintenance points and task templates. At least one maintenance point has a plurality of maintenance point parameters and is associated with at least one task template having a plurality of task parameters, such that upon accessing at least one of the maintenance task definitions, such maintenance task definition is dynamically generated from the plurality of maintenance point parameters of the at least one maintenance point and from the plurality of task parameters of the at least one task template. The processor selectively applies one or more queries to the stored data to generate an assignment including one or more selected maintenance tasks. The one or more queries have a plurality of filter criteria and a plurality of logical relationships defined between the filter criteria to selectively include maintenance task definitions matching the one or more queries and exclude maintenance task definitions not matching the one or more queries. The system further comprises at least one means for outputting the generated assignment. | 2009-04-23 |
20090106228 | METHOD AND APPARATUS FOR PROVIDING A USER TRAFFIC WEIGHTED SEARCH - A method and apparatus for providing a user traffic weighted search in a network are disclosed. For example, the method receives a query from a customer and determines whether the customer has opted-in for a service for traffic data monitoring. The method then provides one or more search results to the customer in response to the query, where the one or more search results are prioritized in accordance with collected user usage data if the customer has opted-in for the service for traffic data monitoring. | 2009-04-23 |
20090106229 | Linear combination of rankers - Described herein is a system that includes a receiver component that receives first scores for training points and second scores for the training points, wherein the first scores are individually assigned to the training points by a first ranker component and the second scores are individually assigned to the training points by a second ranker component. The apparatus further includes a determiner component in communication with the receiver component that automatically outputs a value for a parameter α based at least in part upon the first scores and the second scores, wherein α is used to linearly combine the first ranker component and the second ranker component. | 2009-04-23 |
20090106230 | Query dependent link-based ranking - Query dependent ranking uses weighted edges in a stochastic approach for link structure analysis (SALSA) technique. Functions describing the weights of edges into and out of a vertex are determined to define transition probability functions. The transition probability functions are used to compute authority scores for each uniform resource locator (URL) u in a base set to rank a result set to a received query. | 2009-04-23 |
20090106231 | Query dependant link-based ranking using authority scores - Query dependent ranking uses an authority score. A base set is determined as the union of a result set to a received query, an inlinking-set, and an outlinked-set. The inlinking-set is determined by sampling a predetermined number of uniform resource locators (URLs) linking to each result. The outlinked-set is determined by sampling a predetermined number of URLs linked to by each result. A neighborhood graph consists of the vertices of the base set and the edges between the vertices in the base set. An authority score for each URL in the base set is computed using a Stochastic Approach to Link Structure Analysis (SALSA) technique. The authority scores are used to rank the result set. | 2009-04-23 |
20090106232 | BOOSTING A RANKER FOR IMPROVED RANKING ACCURACY - A system described herein includes a trainer component that receives an estimated gradient of cost that corresponds to a first ranker component with respect to at least one training point and at least one query. The trainer component builds a second ranker component based at least in part upon the received estimated gradient. The system further includes a combiner component that linearly combines the first ranker component and the second ranker component. | 2009-04-23 |
20090106233 | QUERY ENGINE INTERPRETER AND PRIORITIZATION ENGINE - A method for refining a search query includes receiving a query from a user, submitting at least one question to the user based on information provided in the query, and receiving an answer to the question from the user. The method also includes refining the query based on the answer received from the user, querying the database using the refined query to identify a subset of records tagged with categories relevant to the query, and delivering search results to the user. | 2009-04-23 |
20090106234 | APPARATUS AND METHODS FOR WEB MARKETING TOOLS AND DIGITAL ARCHIVES - WEB PORTAL ADVERTISING ARTS - This invention relates to the creation of a software application to: facilitate the creation, representation and publication of digital objects; in particular, methods and apparatus that improve digital resource retrieval on the part of end users and to provide a new system for the web based marketing of digital assets and the online distribution of metadata enriched advertising. | 2009-04-23 |
20090106235 | Document Length as a Static Relevance Feature for Ranking Search Results - Embodiments are configured to provide information based on a user query. In an embodiment, a system includes a search component having a ranking component that can be used to rank search results as part of a query response. In one embodiment, the ranking component includes a ranking algorithm that can use the length of documents returned in response to a search query to rank search results. | 2009-04-23 |
20090106236 | Method for scoring products, services, institutions, and other items - The present invention relates to a method of scoring an item, including reviewing a first editorial evaluation of the item; assigning a first editorial evaluation score to the item based on the first editorial evaluation; reviewing a second editorial evaluation of the item; assigning a second editorial evaluation score to the item based on the second editorial evaluation; and calculating a score for the item based on the first editorial evaluation score and the second editorial evaluation score. The item score may also be calculated based upon component scores for the item or quantitative ratings. | 2009-04-23 |
20090106237 | SYSTEM AND METHOD FOR DYNAMICALLY CUSTOMIZING WEB PAGE CONTENT - A method for providing customized web page content. The method includes receiving information from a referring uniform resource locator (URL) including information relating to a first search performed by a user, processing specific terms in the referring URL to produce a customized web page based upon the terms in the referring URL, and presenting the customized web page to the user. | 2009-04-23 |
20090106238 | Contextual Searching of Electronic Records and Visual Rule Construction - A web-based system for visual construction of logical rules includes a server, a network, and client operatively connected to the server via the network. The server includes a database and a search engine. The client includes a web-based visual rule building application including selectable windows for displaying and visually editing terms, logical operators, logical rules for storage in the database. The logical rules are generated by visually selecting at least one of the terms and logical operators from the windows. The server may further include a search engine configured to perform at least one of a direct search or a contextual search for an entered query string in records stored in the database and the client may include a visual interface for displaying results of the searches. The search results generated by the search engine may be stored as terms in the database for subsequent rule generation. | 2009-04-23 |
20090106239 | Document Review System and Method - A system and method for reviewing electronic documents. The method may include the step of using a computing device to rate a document's relevancy to a concept. Depending on the document's relevancy rating, the document could be routed to either substantive review personnel or relevancy review personnel. If the relevancy rating indicates that the document is likely relevant to the concept, the document is routed to substantive review personnel for substantive analysis. If the relevancy rating indicates that the document is likely irrelevant to the concept, the document is routed to relevancy review personnel to confirm whether the document is irrelevant to the concept. If the relevancy review personnel determine that the document is likely relevant to the concept, the document is rerouted to the substantive review personnel for substantive analysis. | 2009-04-23 |
20090106240 | SUPPLIER IDENTIFICATION AND LOCATOR SYSTEM AND METHOD - A supplier identification and locator system in that allows a user to identify a supplier of goods or services over the Internet; the system includes at least one directory Web site having a domain name that is at least partially descriptive of a class of goods or services. The directory Web site has a plurality of links that access suppliers' Web sites; a supplier descriptive portion located substantially adjacent to the link; a descriptive title portion substantially corresponding to the class of goods or services described in the domain name; a rollover window that displays information about at least one supplier; and an input receiving area where a user inputs data and ranked search results are displayed. | 2009-04-23 |
20090106241 | SEARCH CRITERIA CONTROL SYSTEM AND METHOD - A method and system is provided for controlling search criteria when searching databases using active controls. In one aspect, a search criteria control bar (SCCB) displays results of a search by identifying category selections and keywords. Category selections may be identified by a unique delimiter and any keywords may also be identified by another unique identifier. A user may optionally narrow a search by selecting any active category or active keyword(s) that may be identified in the results summary by simply clicking on the appropriate choice. This may cause only those pages associated with the selected keyword or category to be displayed. Conversely, a user may alter a search by eliminating a keyword or category from the results by a one-click action. Further, the search and results may be limited by user preferences. In this manner, a user may be able to intuitively control searches with more refinement and efficiency. | 2009-04-23 |
20090106242 | RESOLVING DATABASE ENTITY INFORMATION - Entity resolution in a database comprises receiving imported data comprising imported data entities each having properties each having values; receiving first user input that selects the imported data entities for resolution to existing data entities in a database; receiving second user input that specifies matching criteria for matching the imported data entities to the existing data entities, wherein each of the matching criteria comprises a matching technique; matching the imported data entities to the existing data entities using the matching criteria, resulting in creating and storing matched entity information, wherein the matched entity information is organized in matched entity data sets associated with subsets of the matching criteria that were matched; consolidating the imported data entities into the existing data entities; storing the first user input and second user input as a named criteria set for use in subsequent entity resolution operations. | 2009-04-23 |
20090106243 | SYSTEM FOR OBTAINING OF TRANSCRIPTS OF NON-TEXTUAL MEDIA - A system for obtaining textual transcripts of non-textual media is provided. The system uses a voting mechanism to determine which elements within a pool of candidate documents are included within a final transcript that is then associated with the non-textual media. | 2009-04-23 |
20090106244 | DISCOVERING INTERESTINGNESS IN FACETED SEARCH - Exemplary embodiments of the present invention relate to enhanced faceted search support for OLAP queries over unstructured text as well as structured dimensions by the dynamic and automatic discovery of dimensions that are determined to be most “interesting” to a user based upon the data. Within the exemplary embodiments “interestingness” is defined as how surprising a summary along some dimensions is from a user's expectation. Further, multi-attribute facets are determined and a user is optionally permitted to specify the distribution of values that she expects, and/or the distance metric by which actual and expected distributions are to be compared. | 2009-04-23 |
20090106245 | METHOD AND APPARATUS FOR IDENTIFYING AND RESOLVING CONFLICTING DATA RECORDS - A method and apparatus for identifying and resolving conflicting data records are disclosed. The individual data fields of a master record are compared with the corresponding data fields of each source record in a particular data set. For each, one of various matching algorithms is used to assign a field matching score indicating the extent to which the data in the two data fields matches. The particular algorithm used to determine the extent of a match and to assign the corresponding score is dependent on the type of the data field. Once all of the data fields for a particular source record have been analyzed, the sum of the field matching scores is tallied to determine an overall record matching score for that particular source record. | 2009-04-23 |
20090106246 | IMAGE DISPLAY APPARATUS AND METHOD THEREFOR - The present invention provides an image display apparatus and an image display method adapted for the apparatus. The apparatus stores a plurality of image files and metadata of each of the image files, and provides current timestamp. The metadata for each image includes an upload timestamp, a last-displayed timestamp, and a weighted value. A load-timestamp period is a time difference between the current timestamp and the upload timestamp. A not-displayed timestamp period is also a difference in time between the current timestamp and the last-displayed timestamp. The weighted value is calculated according to the load-timestamp period and the not-displayed timestamp period. The apparatus displays selected image files in accordance with the weighted values of the selected image files in an order. The present invention also provides a method of displaying image files adapted for the image display apparatus. | 2009-04-23 |
20090106247 | METHOD AND SYSTEM FOR ALLOWING MULTIPLE USERS TO ACCESS AND UNLOCK SHARED ELECTRONIC DOCUMENTS IN A COMPUTER SYSTEM - A system for allowing multiple users to access and unlock shared electronic documents in a computer system. A group of users are defined as potential “lock-breaker” users for a document, such that they are automatically contacted in the event that a user wishes to unlock the document after it has been locked by another user. The lock-breaker users defined for a document are given access rights to the document that allow them to break a current lock on the document, so that it can be opened for editing, and accordingly re-locked. The lock-breaker users for a document may be organized in a hierarchy, such as a hierarchy matching the relationships of employees of an organization. The lock-breaker hierarchy may define the order in which the lock-breaker users are automatically contacted when a user wishes to access a locked document (e.g. an LDAP directory tree or social network). | 2009-04-23 |
20090106248 | OPTIMISTIC LOCKING METHOD AND SYSTEM FOR COMMITTING TRANSACTIONS ON A FILE SYSTEM - In a file system shared by multiple servers, reservation of a data storage unit such as a LUN of a disk array to acquire locks in order to commit a transaction acting on data stored in the data storage unit is deferred until the transaction is completed in RAM and the locks can be acquired in parallel during a single instance of reserving the data storage unit. | 2009-04-23 |
20090106249 | DOCUMENT MANAGEMENT SYSTEM, DOCUMENT MANAGEMENT DEVICE, DOCUMENT MANAGEMENT METHOD AND RECORDING MEDIUM STORING A DOCUMENT MANAGEMENT PROGRAM - A document management system includes a management device that manages operation limiting information for limiting an operation of a document, and a document operation device that operates the document, in which the document operation device is provided with an invalidation request portion that requests invalidation of the document, and the management device is provided with an operation historical management portion that manages an operation history of a document for managing the operation limiting information, a related document retrieval portion that retrieves a related document related to the document according to the operation history managed by the operation historical management portion in response to the document invalidation request by the invalidation request portion, and an invalidation portion that sets invalidation information in operation limiting information on a document related to the invalidation request and a related document retrieved by the related document retrieval portion and invalidates the document related to the invalidation request and the related document. | 2009-04-23 |
20090106250 | ACCESS CONTROL SYSTEM, ACCESS CONTROL DEVICE, PROGRAM AND RECORDING MEDIUM - Effective utilization of a database while protecting a data provider's privacy is accomplished by an access control system which controls access to a database in which open information and secret information about a data provider are stored while being related to each other has an output request acquisition section which obtains an output request for output of information generated by accessing the database, a plural-term output authorization section which prohibits output of information generated by combining the open information and the secret information in output information requested to be output according to the output request, and which permits output of information generated by using the secret information without using the open information, and an output section which outputs the information in the output information permitted by the plural-term output authorization section to be output. | 2009-04-23 |
20090106251 | Web based communication of information with reconfigurable format - 22Attorney Docket No. DY-Internet/SCHA system of using an interactive device such as an e-mail pager to obtain information from a publicly available source, such as the Internet. The e-mail pager may send information in its native format to a service that acts as an intermediary. That service takes the information and uses it to assemble a request to the actual information source, such as a Web page being accessed. If a web page is being accessed, the request is in HTML, and may include personal logon information. The response from the web page is also in HTML, and this information is received by the service, and salient information is taken from the HTML file. The information is reformatted, e.g. according to a template, into the e-mail pager”s native format, and sent to the pager. Another embodiment describes opening multiple pages, and assembling their content into a single web page. | 2009-04-23 |
20090106252 | HTTP-Based Publish-Subscribe Service - Resources are retrieved asynchronous through the use of resource requests to a feed server. When the feed server returns an initial requested resource, a URI for a next resource is sent to the requesting subscriber. The URI for the next resource was pre-generated by the feed server before the next resource was created, thus allowing the subscriber to have a pending asynchronous resource request at the feed server. This resource request persists on the feed server until the new resource becomes available. | 2009-04-23 |
20090106253 | PORTAL EVENT VERIFICATION - Disclosed is a system and method for checking and identifying plurality of portal events of a portal page within a portal. The portal is checked for the plurality of portal events which are non-interconnected within the portal. Further, identifying a non-interconnected set of the plurality of portal events within the portal and outputting the non-interconnected set of the plurality of portal events. | 2009-04-23 |
20090106254 | METHOD AND PRODUCT FOR CALCULATING A NET OPERATING INCOME AUDIT AND FOR ENABLING SUBSTANTIALLY IDENTIFICAL AUDIT PRACTICES AMONG A PLURALITY OF AUDIT FIRMS - Deployment of a computer program including a global NOI audit model together with standards, procedures, documentation, and reporting requirements in interactive, digital form to a plurality of audit firms operating independently of each other and having a reporting relationship with an investment entity. The program is adapted for receiving audit data from a respective audit firm in connection with an associated real estate property and for generating an associated respective Current NOI audit report. The specific fields and screen arrangements, together with interactive instructions and definitions of the program require that each audit firm identify a consistent set of input parameters and apply them in a consistent way, as driven by the global audit model, thereby assuring computation and transmission of structurally consistent Current NOI audit reports to the investment entity, wherein the Current NOI calculations have been developed by substantially identical audit practices, procedures and assumptions. Using the same program, the investment entity then calculates and stores an Underwriting NOI set of values corresponding to each Current NOI report for the purpose of investment evaluation. The program generates a consolidated report of both Current and Underwriting NOI values for all of the plurality of audit firms so that the investment entity can effect a uniform analysis of all investment properties under consideration. | 2009-04-23 |
20090106255 | File Aggregation in a Switched File System - In a switched file system, a file switching device is logically positioned between clients and file servers and communicates with the clients and the file servers using standard network file protocols. The file switching device appears as a server to the client devices and as a client to the file servers. The file switching device aggregates storage from multiple file servers into a global filesystem and presents a global namespace to the client devices. The file switching device typically supports a “native” mode for integrating legacy files into the global namespace and an “extended” mode for actively managing files across one or more file servers. Typically, native-mode files may be accessed directly or indirectly via the file switching device, while extended-mode files may be accessed only through the file switching device. The file switching device may manage file storage using various types of rules, e.g., for managing multiple storage tiers or for applying different types of encoding schemes to files. Rules may be applied to pre-existing files. | 2009-04-23 |
20090106256 | VIRTUAL COMPUTING ENVIRONMENTS - Methods, systems, and apparatus, including computer program products, for discovering entities in a first portion of a data center network, examining information associated with the discovered entities to determine relationships that exist between pairs of entities in the first portion of the data center network, and generating a specification of the relationships that exist between pairs of entities in the first portion of the data center network based on results of the examining. | 2009-04-23 |
20090106257 | MULTIPLE-LINK SHORTCUTS BASED ON CONTEXTUAL ANALYSIS OF WEB PAGE OBJECTS - A multiple-link shortcut pane associated with an object on a web page provides multiple Internet links dynamically selected based in part on an object type of the object. The shortcut pane is invoked by launching a shortcut launcher icon on the web page, which causes an object key to be transmitted to a shortcut server. The shortcut server retrieves identifying information for the object from a database based on the object key, and an object type-specific template based on the object type. The object type is determined from the identifying information. The shortcut server then prepares and transfers information for building the multiple-link shortcut pane to the browser application that displays the web page. The shortcut pane may be further configured to capture and provide additional information about viewers who have accessed the pane, and actions they have taken. | 2009-04-23 |
20090106258 | SYSTEM AND METHOD FOR DISTRIBUTING A MEDIA CONTENT FILE OVER A NETWORK - A customer computer accesses, through a network, a media content file, as follows. A session is opened between a customer computer and either an application server or a media content server. A request to view a media content file is received from the computer. A temporary metafile having a temporary metafile name is created. The metafile contains a network address where the media content file can be obtained, an encrypted name of the media content file and an unencrypted file path leading to the media content file. The temporary metafile name is sent to the customer computer. The customer computer requests the temporary metafile to learn the encrypted media content file name, unencrypted media content file path and the network address. The customer computer subsequently sends the encrypted media content file name and the unencrypted media content file path to the network address to obtain the media content file. The metafile is cancelled or deleted before or at the end of the session with the customer computer, for security reasons. | 2009-04-23 |
20090106259 | Identifier Authenticating System - There is provided an identifier authenticating system in which information requesting users can share all predetermined information held in a plurality of information providing servers. In the identifier authenticating system, when an identifier holding user | 2009-04-23 |
20090106260 | Method and System for Transferring Files - The present invention proposes an apparatus and a method to efficiently transfer large files by splitting the file into smaller portions which may be transferred through a plurality of recipient nodes to a terminal node. The portion of file to be transferred by each recipient node is decided based on a load sharing algorithm. The terminal node may gather the current specifications of the recipient nodes and compute the portion of file each needs to transfer. The source node will get parallel requests from plurality of recipient nodes to transfer different offsets of the same file. The file splits across various nodes may be later merged locally. | 2009-04-23 |
20090106261 | INFORMATION PROCESSING TERMINAL DEVICE, INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD, AND PROGRAM - An information processing terminal device includes: a communication unit; a primary content information acquiring unit for acquiring primary content information; a primary content information holding managing unit for holding and managing primary content information, in correlation with a unique primary content identifier; a subsidiary content information holding managing unit for obtaining subsidiary content information configured having at least playback control information and having a subsidiary content identifier corresponding to itself and an editing history identifier; an editing processing unit for executing editing processing with secondary usage of at least one of primary content information and subsidiary content information; a subsidiary content information creating unit for creating subsidiary content information; an editing history identifier managing unit for generating the editing history identifier; and a subsidiary content identifier managing unit for generating a subsidiary content identifier to be correlated with subsidiary content information and providing this to subsidiary content information. | 2009-04-23 |
20090106262 | SCRUBBING AND EDITING OF DIAGNOSTIC DATA - Techniques that enable a user or customer at a system site to review and, if desired, modify data identified at the system site for transmission to a diagnosis site prior to the transmission. The identified diagnostic data may be modified such that data that the user does not want to be sent to the diagnosis site (e.g., sensitive data) is excluded from the data communicated to the diagnosis site. The data may be modified by removing or excluding the sensitive data from the data that is communicated to the diagnosis site or replacing the sensitive data with non-sensitive data. The modified data may then be communicated from the system site to the diagnosis site in the form of a package. | 2009-04-23 |
20090106263 | SYSTEMS AND METHODS FOR FOLDER REDIRECTION - A method for redirecting, to a second machine, without user intervention, a request for access to a folder on a first machine, the request made by a resource executing within a remote access session on the first machine, includes receiving, by a component on a first machine, folder mapping information associated with a folder provided by a shell namespace on a second machine. The component intercepts a request by a resource executing on the first machine for access to file system data on the first machine. The component redirects the request to the second machine responsive to the received folder mapping information. | 2009-04-23 |
20090106264 | STATUS PROCESSOR AND STATUS DISPLAY METHOD - A status processor, configured to connect to a network, includes a media connecting unit configured to connect at least one storage media. The status processor further includes a server unit configured to transmit data. The status processor still further includes a directory name setting unit configured to create a status-reflecting directory name on the server unit. The status-reflecting directory name corresponds to a status of at least one of the status processor and the storage media. The server unit is configured to transmit data that indicates an existence of the directory having the status-reflecting directory name to the network. | 2009-04-23 |
20090106265 | Image tile server - An image tile server importantly includes an image tile cache, to support a tiled map display in a user device. Instead of the conventional user device client (e.g., an Ajax client) making image requests directly to a mapping server (MS), a display device initiates an image request of a tile server (TS), and the tile server returns the requested image. However, importantly, the tile server (TS) also retains a cached copy of the returned image for faster retrieval at a later time relating to another image request by the same or different user device. | 2009-04-23 |
20090106266 | Method and System for Adjusting Software Settings - An arrangement permitting a user for example in a internet point or using a different profile in the same machine can connect to a web server to download and install local client software such as a java application or a browser plug-in the first time he accesses to this service from that browser in order to customize his environment. Once authenticated, he can choose the personalization to be performed in whatever application installed and eligible to be user customizable. For example he can replicate in the system his browser settings (favorites, cookies, forms etc) or word templates as a clone of environment setting of his personal machine. The customization can depend on pre-defined profiles to allow the user customization of a subset of settings, for example only browser settings. Models of different operating environments are defined and called upon to enable interactions with different client devices. | 2009-04-23 |
20090106267 | Dynamic management of multiple persistent data stores - Dynamic management of multiple persistent data stores is disclosed. One or more data objects are associated with a client context, e.g., an instance of a client application program. The one or more data objects are retrieved from one or more of a plurality of persistent data stores and provided to the client context in a manner such that the one or more data objects appear to the client context to come from a single source, even if in fact the objects have been retrieved from two or more different persistent stores. | 2009-04-23 |
20090106268 | CONTENT DISTRIBUTION PRIORITIZATION USING DEMAND INDICES - A method of providing electronic content that includes matching electronic content to a plurality of destinations based on one or more criteria, assigning demand indices to each of the plurality of destinations based upon a determined value of the destination to the electronic content, determining an order of the plurality of destinations based on the demand indices, and transmitting the electronic content to at least one of the destinations in a manner giving priority based upon the determined order. | 2009-04-23 |
20090106269 | Distributed storage system with high bandwidth utilization - A distributed storage system comprising a plurality of storage-and-computing elements, each storing a plurality of small content fragments associated with a plurality of contents, wherein a content retrieval load is shared between the storage-and-computing elements such that approximately the total uplink bandwidth of the distributed storage system can be utilized, on a continuous basis, by virtually any combination of multiple storage-and-computing elements simultaneously retrieving many contents or retrieving the same content with different time shifts. | 2009-04-23 |