36th week of 2008 patent applcation highlights part 60 |
Patent application number | Title | Published |
20080215524 | SYSTEM AND METHOD FOR ASSOCIATING GEOGRAPHIC LOCATION INFORMATION FROM MULTIPLE SOURCES - A system and method for providing a virtual map database, referred to herein as the “Virtual Database System” (VDB). The VDB allows integration of map data, often from various sources, in a consistent manner for supply to an end user, while simultaneously ensuring that the entity best able to support a particular data source retains control over the data. In accordance with an embodiment, the VDB environment enables third-party data providers to associate their third-party-files with a base map or file-of-reference, thereby allowing for the creation of dynamic relationships between digital map features and other third-party data providers. The integration may be performed in a dynamic or real-time fashion, receiving up-to-date information from the various sources, creating links, and composing virtual maps, as needed or on-demand. Since the information is linked between the map providers and the various third parties, whenever an item of information or a link between items is updated in either the file-of-reference or in one of the third-party files, that updated information can be propagated back to all of the third-parties for further use in their software applications. | 2008-09-04 |
20080215525 | MEDICAL IMAGE RETRIEVAL SYSTEM - A medical image retrieval system includes an image database which stores medical images. An interpretation unit acquires a currently diagnosed image for use in performing interpretation of one of the medical images and provides the currently diagnosed image to a computer terminal. An image requesting unit issues an image request associated with the currently diagnosed image. An image retrieval unit retrieves a reference image from the image database in accordance with the image request and provides the reference image to the computer terminal in order to propose the reference image as references for diagnosis. An evaluation input unit prompts to input an evaluation indicating whether the reference image has been helpful for diagnosis based on the currently diagnosed image. | 2008-09-04 |
20080215526 | Information processing apparatus, informaition processing method, and information processing program - In an information processing apparatus, an acquisition unit acquires a keyword, and a calculation unit calculates the importance level of each keyword by adding a value determined depending on an increase in the number of occurrences to the importance level and subtracting a value determined depending on an increase in the difference between a current time and a last acquisition time to the importance level. An extraction unit extracts text information of a subtitle in a program. A subtitle morphological analysis unit morphologically analyzes the text information of the subtitle. A comparison unit compares each acquired keyword with each keyword detected via the morphological analysis. A recording unit records the program if the comparison indicates that any acquired keyword is identical to any keyword detected via the morphological analysis. A registration unit registers the recorded program and information indicating the importance level in a table in association with the keyword. | 2008-09-04 |
20080215527 | APPARATUS AND SYSTEM FOR DEFINING A METADATA SCHEMA TO FACILITATE PASSING DATA BETWEEN AN EXTENSIBLE MARKUP LANGUAGE DOCUMENT AND A HIERARCHICAL DATABASE - The apparatus and system are provided for defining a metadata schema to facilitate passing data between an XML document and a hierarchical database. The invention includes a database accessor, a document accessor, and an association module. The database accessor accesses a database schema indicative of database field names and a hierarchical structure for a hierarchical database. The document accessor accesses a document schema that defines the hierarchical structure, content data syntax, and semantics of valid, well-formed, XML documents that can be passed into and out of the hierarchical database. The document schema also includes at least one XML element name that maps to a corresponding database field name in the database schema. The association module associates the database schema and the document schema to provide a metadata schema that enables data to be passed between an XML document and the hierarchical database. | 2008-09-04 |
20080215528 | Multi-Model Access To Data - Techniques are provided for accessing data stored in a database. According to one technique, an application makes one or more calls to an operating system to access a file. The operating system includes routines that implement an operating system file system. The one or more calls are made to the routines that implement the operating system file system. In response to the one or more calls, one or more database commands are issued to a database server that manages the database. The database server executes the database commands to retrieve the data from the database. The file is generated from the data, and provided to the application. | 2008-09-04 |
20080215529 | METHOD FOR USING LENGTHS OF DATA PATHS IN ASSESSING THE SIMILARITY OF SETS OF DATA - A method for finding sets of data (SDDs) for presentation in one-dimension, which are similar to a target SDD, is invented. The method leverages a new category of signatures, called equivalence signatures, to characterize the SDDs and is applicable to all types of data with special interpretation for data that may be presented in two-dimensions. These signatures have the salient feature that, at worst, they change in a bounded manner when small changes are made to the SDDs and when used to find SDDs that are similar to a target SDDs, they allow for a significant reduction in the number of SDDs to be compared with the target. This is an improvement over the state of the art wherein the computational expensive process of performing a complete search against the entire corpus must be applied. | 2008-09-04 |
20080215530 | METHOD FOR USING TWO-DIMENSIONAL DYNAMICS IN ASSESSING THE SIMILARITY OF SETS OF DATA - A method for finding sets of data (SDDs) for presentation in two-dimensions, which are similar to a target SDD, is invented. The method leverages a new category of signatures, called equivalence signatures, to characterize the SDDs. The equivalence signature is computed as the action for the motion of a string which sweeps out a sheet specified by the values of the digital data. These signatures have the salient feature that, at worst, they change in a bounded manner when small changes are made to the SDDs and when used to find SDDs that are similar to a target SDDs, they allow for a significant reduction in the number of SDDs to be compared with the target. This is an improvement over the state of the art wherein the computational expensive process of performing a complete search against the entire corpus must be applied. | 2008-09-04 |
20080215531 | DETERMINING VALIDITY RANGES OF QUERY PLANS BASED ON SUBOPTIMALITY - A method for approximating a validity range for a domain of cardinalities of input to an optimal query plan is provided. Such a validity range is iteratively approximated using a modified Newton-Raphson method to find roots of cost functions for optimal and alternative query plans, respectively. The Newton-Raphson method is combined with a method of incrementing roots of cost functions, known as input cardinalities, such that discontinuous and non-differentiable points in cost functions are avoided. In this manner, input cardinalities remain within a domain for which a valid range can be specified. Additionally, a robustness measure is determined by a sensitivity analysis performed on an approximated validity range. Using a robustness measure provided by a sensitivity analysis and resultant validity range and, query plan sub-optimality detection is simplified, re-optimization is selectively triggered, and robustness information is provided to a system or user performing corrective actions. | 2008-09-04 |
20080215532 | DATABASE OPTIMIZATION THROUGH SCHEMA MODIFICATION - A database optimizer collects statistics regarding applications accessing a database, and makes one or more changes to the database schema to optimize performance according to the collected statistics. In a first embodiment, the optimizer detects when a certain type of application accesses the database a percentage of time that exceeds a predefined threshold level, and if the data in the database is stored in a less-than-optimal format for the application, the data type of one or more columns in the database is changed to a more optimal format for the application. In a second embodiment, the optimizer detects when one type of application accesses a column a percentage of time that exceeds a first predefined threshold level and is less than a second predefined threshold level, and creates a new column in the database so the data is present in both formats. | 2008-09-04 |
20080215533 | Method for interfacing application in an information search and retrieval system - In a method for interfacing search, analysis, and report applications in an information search and retrieval system with a complex structured record or content repository, a schema discovery is performed on the basis of a search application, schema paths associated with a search result are extracted, and summary information of the extracted schema paths is computed. | 2008-09-04 |
20080215534 | COST-BASED SUBQUERY CORRELATION AND DECORRELATION - Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table. | 2008-09-04 |
20080215535 | AUTONOMICALLY GENERATING A QUERY IMPLEMENTATION THAT MEETS A DEFINED PERFORMANCE SPECIFICATION - A database query optimizer allows specifying a performance specification for a query. When an access plan is created, the actual performance for executing the query using the access plan is determined and compared to the performance specification for the query. If the actual performance does not satisfy the performance specification for the query, the query optimizer autonomically generates a different access plan to see if the performance improves. If an access plan that meets the performance specification is generated, the new access plan is stored in the access plan cache for the query. If no access plan can be generated that meets the performance specification for the query, the access plan that provided the best performance is selected and stored in the access plan cache for the query. | 2008-09-04 |
20080215536 | AUTONOMICALLY GENERATING A QUERY IMPLEMENTATION THAT MEETS A DEFINED PERFORMANCE SPECIFICATION - A database query optimizer allows specifying a performance specification for a query. When an access plan is created, the actual performance for executing the query using the access plan is determined and compared to the performance specification for the query. If the actual performance does not satisfy the performance specification for the query, the query optimizer autonomically generates a different access plan to see if the performance improves. If an access plan that meets the performance specification is generated, the new access plan is stored in the access plan cache for the query. If no access plan can be generated that meets the performance specification for the query, the access plan that provided the best performance is selected and stored in the access plan cache for the query. | 2008-09-04 |
20080215537 | DATA ORDERING FOR DERIVED COLUMNS IN A DATABASE SYSTEM - Optimized query execution for queries that return data sorted by a derived column. The query optimizer is used to determine if the data is already sorted or if existing database metadata can be utilized to provide the sort. The optimizer will examine the query field being derived and attempt to determine if there are existing index structures that can be used to sort the data. The optimizer can also look at the values of the data in the column to determine what existing structures can be used to sort the data. | 2008-09-04 |
20080215538 | DATA ORDERING FOR DERIVED COLUMNS IN A DATABASE SYSTEM - Optimized query execution is disclosed for queries that return data sorted by a derived column. The query optimizer is used to determine if the data is already sorted or if existing database metadata can be utilized to provide the sort. The optimizer will examine the query field being derived and attempt to determine if there are existing index structures that can be used to sort the data. The optimizer can also look at the values of the data in the column to determine what existing structures can be used to sort the data. | 2008-09-04 |
20080215539 | DATA ORDERING FOR DERIVED COLUMNS IN A DATABASE SYSTEM - Optimized query execution is disclosed for queries that return data sorted by a derived column. The query optimizer is used to determine if the data is already sorted or if existing database metadata can be utilized to provide the sort. The optimizer will examine the query field being derived and attempt to determine if there are existing index structures that can be used to sort the data. The optimizer can also look at the values of the data in the column to determine what existing structures can be used to sort the data. | 2008-09-04 |
20080215540 | OPTIMIZING A QUERY TO A PARTITIONED DATABASE TABLE USING A VIRTUAL MAINTAINED TEMPORARY INDEX THAT SPANS MULTIPLE DATABASE PARTITIONS - A query optimizer optimizes a query to a partitioned database table by determining common characteristics of the partitions and generating a virtual maintained temporary index that spans multiple partitions. Using the virtual maintained temporary index allows the query optimizer to generate an access plan based on the virtual maintained temporary index, which relieves the optimizer from having to individually optimize access to each partition for partitions that share common characteristics. | 2008-09-04 |
20080215541 | TECHNIQUES FOR SEARCHING WEB FORUMS - A search system provides various techniques for facilitating information retrieval. The search system may identify alternate queries for an initial query submitted by a user to a search system. Upon receiving the initial query, the search system identifies questions that are related to the initial query and presents to the user the related questions as alternate queries. The search system may also identify messages within a discussion thread that include answers. The search system may also identify an expert relating to the subject of a query by searching through expert profiles containing keywords of discussion threads in which the expert participated. | 2008-09-04 |
20080215542 | Method For Supporting Ontology-Related Semantic Queries in DBMSs with XML Support - A method for supporting semantic matching queries in a database management system (DBMS) by extracting and storing the transitive/subsumption relationships from a given ontology data in a DBMS with native XML support. These transitive relationships are transformed into a set of XML documents that are natural mappings of the hierarchical structure of the transitive relationships. A table function construct expresses semantic matching queries in a declarative manner. The semantic matching queried are automatically rewritten or translated into standard SQL/XML search operators such as XQuery, XPath and XMLExists, and executed by the SQL/XML DBMS on the given instance data and the extracted transitive relationships data. | 2008-09-04 |
20080215543 | Graph-based search leveraging sentiment analysis of user comments - A search system and method is provided. The method includes constructing a graph-based query that is indicative of a user's preference-levels for different features of a search item (a product, for example). The constructed graph-based query is executed by comparing the user's preference-levels for the different features of the product, which are graphically represented in the query, with information related to sentiments expressed by other users regarding the product. Information related to the sentiments expressed by other users regarding the product can include system-generated product performance graphs constructed from comments regarding the product obtained from the World Wide Web (or other network). Results returned and output upon execution of the graph-based query include system-generated product performance graphs that are similar to the user-submitted query. | 2008-09-04 |
20080215544 | Systems and Methods for Modeling Partitioned Tables as Logical Indexes - Technologies for forming logical indexes and utilizing such indexes so as to abstract many of the complexities resulting from referencing partitioned database tables. Included are technologies for making use of order-preserving properties of table metadata, for adding a partition equality predicate to an explicit predicate in merge-join processing on partitioned tables, and for selecting execution of a logical skip scan on a partitioned table when a query predicate does not reference a specific partition. Such technologies generally abstract from the query writer and processing systems explicit referencing of table partitions. | 2008-09-04 |
20080215545 | Data file management and search method and system based on file attributes - A data file management and search method based on file attributes is disclosed. At least one data file, externally imported or generated by a user, is retrieved. Attributes of the data file are edited, a virtual catalog corresponding to the data file is generated, and a catalog tree is built according to the data file and the virtual catalog. The virtual catalog and the data file are displayed by a user interface. A search operation is performed based on a search command to locate at least one required virtual catalog or data file among multiple data files and virtual catalogs. A basic operation is implemented on the located virtual catalog or data file. | 2008-09-04 |
20080215546 | Time Series Search Engine - Methods and apparatus consistent with the invention provide the ability to organize, index, search, and present time series data based on searches. Time series data are sequences of time stamped records occurring in one or more usually continuous streams, representing some type of activity. In one embodiment, time series data is organized into discrete events with normalized time stamps and the events are indexed by time and keyword. A search is received and relevant event information is retrieved based in whole or in part on the time indexing mechanism, keyword indexing mechanism, or statistical indices calculated at the time of the search. | 2008-09-04 |
20080215547 | INTRODUCTION SUPPORTING APPARATUS AND RECORDING MEDIUM STORING COMPUTER PROGRAM - According to an aspect of the invention, an apparatus for supporting an introduction among a plurality of users includes: a receiving unit; a member database; a community database; an extracting unit; a determining unit; and a transmitting unit. | 2008-09-04 |
20080215548 | INFORMATION SEARCH METHOD AND SYSTEM - An information search system for search in plural images as content information is provided. An input interface inputs a first image. An dominant color extractor extracts an dominant color as attribute of the first image. A tag extractor extracts a tag or descriptor as meta information associated with the dominant color. A retriever retrieves a second image having the extracted tag or descriptor among the plural images. Furthermore, a display panel displays the second image. Also, a search refining selector selects image among plural sets of the second image to be output according to degree of relevancy of the second image with the first image. The relevancy for evaluation is relevancy of the dominant color. | 2008-09-04 |
20080215549 | Method and Apparatus for Query and Analysis - A data handling method combines search capabilities with analytical functionality. The invention provides advantages when dealing with structured documents (such as electronic catalogs, XML documents, text documents, HTML documents, Internet documents, etc.) and other data stored in a computer system. Various embodiments include simplified ways to express search/analysis requests of a data set and also to express results to such requests. | 2008-09-04 |
20080215550 | SEARCH SUPPORT APPARATUS, COMPUTER PROGRAM PRODUCT, AND SEARCH SUPPORT SYSTEM - A search support apparatus estimates, based on a document and a specific phrase (keyword) in the document, a theme of the document, a site type of a website that provides the document, and a content type of the document, and selects a search condition corresponding to the theme, the site type, and the content type, to be presented to the user. | 2008-09-04 |
20080215551 | Physically Locating Content in a Network | 2008-09-04 |
20080215552 | Time-conditioned search engine interface with visual feedback - A human-computer interface for a search engine or similar application includes specification means for a time condition applicable to a search query, and visual feedback means expressive of relative availability of sought or potentially sought database items at one or more specific times within a time period under consideration. The invention provides a new and unique way to support interactive searching of a database that includes information relating to time availability of represented items, in order to identify items that match one or more search term(s) and are available at a specific time or during a specific time period. | 2008-09-04 |
20080215553 | Personalized Network Searching - Personalized network searching, in which a search query is received from a user, and a request is received to personalize a search result. Responsive to the search query and the request to personalize the search result, a personalized search result is generated by searching a personalized search object. Responsive to the search query, a general search result is generated by searching the general search object. The personalized search result and the general search result are provided to a client device, an advertisement is selected based at least in part upon the personalized search object, and the advertisement, the personalized search result, and the general search result are displayed. | 2008-09-04 |
20080215554 | Data Plotting Extension for Structured Query Language - Information is typically obtained from a relational database using a query in structured query language (SQL). An extension to the SQL standard is described which permits plotting the results of a query. SQL keywords are provided for specifying a format for graphing selected data, and syntax for recognizing those keywords, thereby causing the data to be presented as a graph according to the specified format. This extension of SQL maintains the syntax and style of conventional SQL queries. This permits automated systems, such as database driven websites, to issue extended SQL queries directly to a relational database and have the results returned as formatted graphical content. | 2008-09-04 |
20080215555 | Hybrid Approach for Query Recommendation in Conversation Systems - Techniques are disclosed for combining natural language generation with query retrieval for context appropriate query recommendation. For example, a computer-implemented method for generating a recommended query for a conversation system in response to an original user query, wherein at least a portion of the original user query is not understandable to a query interpretation process, includes the following steps. Recommendation results are computed, in response to the original user query, using a natural language generation-based recommendation process. Recommendation results are computed, in response to the original user query, using a retrieval-based recommendation process. A recommended query is generated based on consideration of at least a portion of the natural language generation-based recommendation results and at least a portion of the retrieval-based recommendation results. | 2008-09-04 |
20080215556 | DYNAMIC FILTERS FOR RELATIONAL QUERY PROCESSING - Systems and methods that eliminate non-qualifying data for queries against data warehouses and improve execution time, via a dynamic filter component(s). In general, such dynamic filter components are derived from data during processing of the query and without being explicitly defined by the users within a query forwarded to the data warehouse. Moreover, an evaluation component can monitor efficiency of filter components (e.g., number of rows that can be eliminated), and dynamically change and/or update the evaluation order of such filters. | 2008-09-04 |
20080215557 | METHODS AND SYSTEMS OF MOBILE QUERY CLASSIFICATION - In embodiments, the present invention provides a method and system for receiving a search query from a mobile communication facility, receiving an indicator input, classifying the search query in association with the indicator input, and formatting the presentation of a search result of the search query based at least in part on the indicator input and search query association. | 2008-09-04 |
20080215558 | SYSTEM FOR MANAGING CONFIGURATION CHANGES IN A DATA PROCESSING SYSTEM - A method of managing configuration changes in a data processing system, particularly a network wherein software products ( | 2008-09-04 |
20080215559 | SYSTEM AND METHOD FOR QUERYING XML STREAMS - A system and method for querying a stream of XML data in a single pass using standard XQuery expressions. The system comprises: an expression parser that receives a query and generates a parse tree; a SAX events API that receives the stream of XML data and generates a stream of SAX events; an evaluator that receives the parse tree and stream of SAX events and buffers fragments from the stream of SAX events that meet an evaluation criteria; and a tuple constructor that joins fragments to form a set of tuple results that satisfies the query for the stream of XML data. | 2008-09-04 |
20080215560 | INFORMATION TECHNOLOGY MANAGEMENT SYSTEM DATABASE FOR COORDINATING THE INFORAMTION TECHNOLOGY ACTIVITES FOR A BUSINESS ENTERPRISE - A business enterprise level information technology management system database implementation providing search results responsive to a user query that filters the extensive data that may be generated in the search result so that the user and his need for data is taken into account. An implementation determining the role of the requesting user relative to the selected activities, tracking the frequency of use of the requesting user's actions relative to the selected activities and presenting the search results to the requesting user with suggested user actions customized based upon said role of the user and prioritized based upon said frequency of use. | 2008-09-04 |
20080215561 | SCORING RELEVANCE OF A DOCUMENT BASED ON IMAGE TEXT - A method and system for determining relevance of a document having text and images to a text string is provided. A scoring system identifies image text associated with an image of the document. The scoring system calculates an image score indicating relevance of the image text to the text string. The image score may be used in many applications, such as searching, summary generation, and document classification, image search, and image classification. | 2008-09-04 |
20080215562 | System and Method for Improved Name Matching Using Regularized Name Forms - A system and method for improved name matching using regularized name forms is presented. A regularization rule engine uses culture-specific regularization rules to iteratively convert candidate names and query names to a canonical form, which are regularized candidate names and regularized query names, respectively. The regularization rules are context-sensitive or context-free rules that pertain to a name's originating culture. Subsequently, a name search engine compares the regularized query name with the regularized candidate names and identifies the regularized candidate names that meet a particular regularization matching threshold. In turn, name search engine selects the candidate names that correspond to the identified regularized candidate names and provides the selected candidate names to a user. | 2008-09-04 |
20080215563 | Pseudo-Anchor Text Extraction for Vertical Search - A search method uses pseudo-anchor text associated with search objects to improve search performance. The pseudo-anchor text may be extracted in combination with an identifier of the search objects (such as a pseudo-URL) from a digital corpus such as a collection of documents. Pseudo-anchor texts for each object are preferably extracted from candidate anchor blocks using a machine learning based approach. The pseudo-anchor texts are made available for searching and used to help ranking the objects in a search result to improve search performance. Method may be used in vertical search of objects such as published articles, products and images that lack explicit URL and anchor text information. | 2008-09-04 |
20080215564 | Query rewrite - A method and apparatus for rewriting of search engine queries is provided. Queries are rewritten by applying a set of rules. The rules represent domain knowledge and can be created by developers or users outside the search engine. There are two types of rules, production rules and definitions. Production rules specify how a query can be modified. Definition type rules specify a vocabulary for matching or modification of query terms. The modified query is issued to a search engine generating more focused and relevant results. | 2008-09-04 |
20080215565 | SEARCHING HETEROGENEOUS INTERRELATED ENTITIES - Systems and methods for searching heterogeneous interrelated entities for a heterogeneous entities search query are disclosed herein. A user may enter the heterogeneous entities search query. The search retrieves and returns multiple types of heterogeneous entities. The retrieved heterogeneous interrelated entities are searched in a unified matrix that represents relationships between one or more heterogeneous entities. The retrieved heterogeneous interrelated entities may have one or more entity types. The set of retrieved interrelated entities may also be ranked based on the similarity between each entity and the search query. Feedback may also be incorporated into the system to improve search accuracy. | 2008-09-04 |
20080215566 | METHOD FOR USING ONE-DIMENSIONAL DYNAMICS IN ASSESSING THE SIMILARITY OF SETS OF DATA - A method for finding sets of data (SDDS) for presentation in one-dimension, which are similar to a target SDD, is invented. The method leverages a new category of signatures, called equivalence signatures, to characterize the SDDs and is applicable to all types of data with special interpretation for data, such as text, binaries and audio, that may be presented in one-dimension. The equivalence signature is computed as the functional for the kinetic energy of a point particle whose path is specified by the values of the digital data. These signatures have the salient feature that, at worst, they change in a bounded manner when small changes are made to the SDDs and when used to find SDDs that are similar to a target SDDs, they allow for a significant reduction in the number of SDDs to be compared with the target. This is an improvement over the state of the art wherein the computational expensive process of performing a complete search against the entire corpus must be applied. | 2008-09-04 |
20080215567 | METHOD FOR USING ISOMETRIES ON THE SPACE OF SIGNATURES TO FIND SIMILAR SETS OF DATA - A method for finding sets of data (SDDs) which are similar to a target SDD, is invented. By virtue of the isometrics on the space of equivalence signatures the lengths of the equivalence signature vectors of similar SDDs must be equal. A filter is then applied to the database of SDDs to find those SDDs that have the same length of the equivalence signatures vectors as that of the target SDD. With this, a significant reduction in the number of SDDs to be compared with the target for a final determination of similarity is obtained. This is an improvement over the state of the art wherein the computational expensive process of performing a complete search against the entire corpus must be applied. | 2008-09-04 |
20080215568 | MULTIMEDIA FILE REPRODUCING APPARATUS AND METHOD - An apparatus and method to check whether a user likes a multimedia file based on the user's emotional reaction index of the multimedia file and repeatedly reproducing the multimedia file if the user likes the multimedia file. The multimedia file reproducing apparatus can include an emotional reaction index calculation unit to calculate an emotional reaction index based on a physical reaction signal of a user; a like/dislike checking unit to check whether the user likes or dislikes a corresponding audio file based on the calculated emotional reaction index; a list generation unit to generate a list of audio files that the user likes based on an average of emotional reaction indices for each audio file and the user's preference for each audio file; and a reproduction management unit to control the reproduction of the corresponding audio file based on whether the user likes or dislikes the corresponding audio file and to reproduce the audio files in the generated list. | 2008-09-04 |
20080215569 | Ad Placement Method with Frequency Component - A method of generating a search result list in response to a search request from a client using a computer network is described. The search request is received, and a set of network addresses associated with search terms that match the search request is identified, each network address being associated with a modifiable bid value and a position value initially set to the bid value. The set is ordered according to the respective position values of the matching network addresses, and divided into a display set sent to the client and an excluded set. The position value of the network addresses in the display set is reset to its respective bid amount, and the position values of the network addresses in the excluded set are incremented by an increment factor I determined using the bid amount of the network address having the lowest position value of the display set. | 2008-09-04 |
20080215570 | Medical literature database search tool - This invention provides a method of identifying clinically relevant, evidence based medical literature on diseases and their treatment to physicians, nurses and other healthcare personnel. This method accesses a medical literature database that is then searched using a medical literature classification system identifier for a disease integrated with an evidence based medicine search filter. In conjunction with identifying the evidence based medical literature, a database of articles selected and reviewed by experts that concern the disease is also searched. The results of both searches are then displayed to the user. This invention can be implemented through the use of an encoded computer readable medium. | 2008-09-04 |
20080215571 | PRODUCT REVIEW SEARCH - This disclosure describes various exemplary methods, computer program products, and user interfaces that provide results for a product review search with opinion snippets and opinion visual graphs. This disclosure describes identifying user opinions by extracting passages that contain subjective opinions from web pages; ranking the user opinions by incorporating sentiment orientations and sentiment topics, where the sentiment orientations are positive or negative; and generating review snippets to indicate user sentiment orientations and to describe user opinions toward product features. This disclosure improves a user product search experience from the following aspects: understanding the product review from snippets instead of browsing the web page; obtaining more information by reading reviews in a shorter time period; and obtaining overall opinions of users of the web through visualized opinion summarization. | 2008-09-04 |
20080215572 | METHOD AND APPARATUS FOR EVALUATING EQUIPMENT LEASES - A lease information processing system provides subscribers, such as funding sources and lease brokers, with information indicating whether a proposed lease may have an enhanced chance of premature termination, based on prior leases and concurrent leases by the vendor and lessee, along with reports of suspicious activity reported by other subscribers. | 2008-09-04 |
20080215573 | Inter-Frequency Neighbor List Searching - Techniques for inter-frequency neighbor list searching are disclosed. Embodiments disclosed herein address the need for inter-frequency neighbor list searching. In one embodiment, a searcher is deployed to search a PN space with a first set of search parameters and to return search results. A subset of those results is selected, along with a previously saved search result, to form a set of PN locations for a second search. The second search is performed on a window around each of the PN locations, using a second set of search parameters. The maximum peak from the second search is saved for use in future iterations. In one embodiment, the subset is selected as the highest energy level peaks from the first search. In one embodiment, if a maximum peak is deemed to correspond to a valid base station when the position of that maximum peak is within a pre-determined time offset from a previous maximum peak. | 2008-09-04 |
20080215574 | Efficient Retrieval Algorithm by Query Term Discrimination - An exemplary method for use in information retrieval includes, for each of a plurality of terms, selecting a predetermined number of top scoring documents for the term to form a corresponding document set for the term; receiving a plurality of terms, optionally as a query; ranking the plurality of terms for importance based at least in part on the document sets for the plurality of terms where the ranking comprises using an inverse document frequency algorithm; selecting a number of ranked terms based on importance where each selected, ranked term comprises its corresponding document set wherein each document in a respective document set comprises a document identification number; forming a union set based on the document sets associated with the selected number of ranked terms; and, for a document identification number in the union set, scanning a document set corresponding to an unselected term for a matching document identification number. Various other exemplary systems, methods, devices, etc. are also disclosed. | 2008-09-04 |
20080215575 | Information Processing Apparatus, Information Processing Method, and Program - An information processing apparatus is disclosed which includes: a creation section configured to create, through learning, a search axis which serves as a reference for presenting contents and which is determined by feature quantities of the contents and either by a history of reproduction of the contents by a user or by evaluations of the contents by the user; and a display control section configured to control display of the presentation of the contents in reference to the search axis having been created. | 2008-09-04 |
20080215576 | FUSION AND VISUALIZATION FOR MULTIPLE ANOMALY DETECTION SYSTEMS - The present invention is a method for detecting anomalies against normal profiles and for fusing and visualizing the results from multiple anomaly detection systems in a quantifying and unifying user interface. The knowledge patterns discovered from historical data serve as the normal profiles, or baselines or references (hereinafter, called “normal profiles”). The method assesses a piece of information against a collection of the normal profiles and decides how anomalous it is. The normal profiles are calculated from historical data sources, and stored in a collection of mining models. Multiple anomaly detection systems generate a collection of mining models using multiple data sources. When a piece of information is newly observed, the method measures the degree of correlation between the observed information and the normal profiles. The analysis is expressed and visualized through anomaly scores and critical event notifications that are triggered by fusion rules, thus allowing a user to see multiple levels of complexity and detail in a single view. | 2008-09-04 |
20080215577 | Information processing apparatus and method, program, and storage medium - An information processing apparatus includes: an acquiring section acquiring metadata of content; a morphological analysis section performing a morphological analysis of text information included in the metadata of the content; a genre extracting section extracting genre information for each individual content in the metadata of the content; and a keyword extracting section extracting words with attributes that have relevance to the genre of predetermined content in the metadata of the content by a morphological analysis result of the morphological analysis section. | 2008-09-04 |
20080215578 | Materialized Query Table Matching With Query Expansion - Methods, apparatuses, and computer program products for materialized query table matching are provided that include receiving a database query, retrieving a materialized query table (MQT) from data storage accessible to a database management system, selecting a join in the materialized query table between a table that is not invoked by the query and a table that is invoked in the query, determining whether the selected join is lossless, and expanding the query to include the lossless join if the selected join is lossless, expanding the query to include the lossless join. Determining whether the selected join is lossless may be carried out by losslessly joining the table that is not invoked by the query to the query, and determining whether the lossless join to the query matches the selected join of the materialized query table. | 2008-09-04 |
20080215579 | INCLUDING ANNOTATION DATA WITH DISPARATE RELATIONAL DATA - Methods, systems, and articles of manufacture that may be used for identifying and indicating annotations made for a variety of different type (i.e., heterogeneous) data objects are provided. According to some embodiments, an annotation store may be queried to identify annotations for data objects in a current view of data. For certain identifiable portions of the view (e.g., a row in a relational view), a callable function may be created that returns a set of indicia maps indicating which objects in the portions are annotated. Bits in an indicia map may correspond to different objects (e.g., individual cells in a row or the row itself). Using these indicia maps, an indication of which data objects are annotated may be provided in the view, for example, by displaying annotation icons proximate annotated objects. | 2008-09-04 |
20080215580 | SYSTEM AND METHOD FOR ADAPTIVE DATABASE CACHING - A local database cache enabling persistent, adaptive caching of either full or partial content of a remote database is provided. Content of tables comprising a local cache database is defined on per-table basis. A table is either: defined declaratively and populated in advance of query execution, or is determined dynamically and asynchronously populated on-demand during query execution. Based on a user input query originally issued against a remote DBMS and referential cache constraints between tables in a local database cache, a Janus query plan, comprising local, remote, and probe query portions is determined. A probe query portion of a Janus query plan is executed to determine whether up-to-date results can be delivered by the execution of a local query portion against a local database cache, or whether it is necessary to retrieve results from a remote database by executing a remote query portion of Janus query plan. | 2008-09-04 |
20080215581 | CONTENT/METADATA SELECTION AND PROPAGATION SERVICE TO PROPAGATE CONTENT/METADATA TO CLIENT DEVICES - In various embodiments, one or more servers is (collectively) endowed with a core data collection and management service, and a core content/metadata selection and propagation service, to receive from client devices automatically collected user activity associated data and in response, to select and propagate content/metadata to the client device, in a more efficient, flexible and effective manner (with high relevancy). | 2008-09-04 |
20080215582 | Generating Statistics on Text Pattern Matching Predicates for Access Planning - Statistics for a pattern matching predicate are generated using stored character statistics. A first structure stores, for each of a plurality of character positions, frequently occurring characters in that character position, and a count of the number of occurrences of that character. A second structure stores frequently occurring characters that are subsequent to the frequently occurring characters stored in the first structure, and a probability of occurrence of each frequently occurring subsequent character. To form an estimate of the number of tuples matching a pattern matching predicate, statistics are retrieved for the matching characters in each matching position in the predicate, and then combined to produce the estimate. In the event a statistic is not stored for a desired character, the available statistics are used to make an estimate by accumulating statistics for other characters, and then calculating average frequency of occurrence of characters that do not have stored statistics. | 2008-09-04 |
20080215583 | Ranking and Suggesting Candidate Objects - A method of ranking and suggesting objects, such as tags, is described in which a group of objects are suggested to a user in relation to a particular information object, such as a web page or file. A user either selects one of the suggestions or enters an alternative object and on receipt of data identifying the particular object selected by the user, the group of suggestions is updated based on whether the object selected by the user was one of the suggestions or not. The updating of the group may also be based on other factors, such as ranking parameters associated with each of the objects. | 2008-09-04 |
20080215584 | Shared-Memory Multiprocessor System and Method for Processing Information - Large-scale table data stored in a shared memory are sorted by a plurality of processors in parallel. According to the present invention, the records subjected to processing are first divided for allocation to the plurality of processors. Then, each processor counts the numbers of local occurrences of the field value sequence numbers associated with the records to be processed. The numbers of local occurrences of the field value sequence numbers counted by each processor is then converted into global cumulative numbers, i.e., the cumulative numbers used in common by the plurality of processors. Finally, each processor utilizes the global cumulative numbers as pointers to rearrange the order of the allocated records. | 2008-09-04 |
20080215585 | SYSTEM AND METHOD FOR CREATION, REPRESENTATION, AND DELIVERY OF DOCUMENT CORPUS ENTITY CO-OCCURRENCE INFORMATION - To respond to queries that relate to co-occurring entities on the Web, a compact sparse matrix representing entity co-occurrences is generated and then accessed to satisfy queries. The sparse matrix has groups of sub-rows, with each group corresponding to an entity in a document corpus. The groups are sorted from most occurring entity to least occurring entity. Each sub-row within a group corresponds to an entity that co-occurs in the document corpus, within a co-occurrence criterion, with the entity represented by the group, and to facilitate query response the sub-rows within a group are sorted from most occurring co-occurrence to least occurring co-occurrence. | 2008-09-04 |
20080215586 | Simulating Multi-User Activity While Maintaining Original Linear Request Order for Asynchronous Transactional Events - A system and article of manufacture maintain the original order of a sequence of transactions originating from a source database and being replicated to a target database. A lockable object is associated with each transaction of the sequence of transactions from the source database. Each transaction has one or more transactional events. The transactions of the sequence of transactions have an order. The order is a commit order of the transactions in the source database. The lockable object is based on the commit order. A lock is attempted to be obtained on one or more lockable objects associated with one or more transactions of the sequence of transactions which precede a particular transaction of the sequence of transactions. In response to being unable to obtain the lock, the one or more transactional events of the one or more transactions which precede the particular transaction are serially processed. | 2008-09-04 |
20080215587 | Object State Transfer Method, Object State Transfer Device, Object State Transfer Program, and Recording Medium for the Program - When the states of a large number of objects must be transferred to another device, the overhead can be greatly reduced and the object states can be synchronized in a short period of time. At the time of creating an object, an object creation function arranges the internal state of the object into a byte sequence in a region for transfer, and sets mapping data in a mapping management table. When an application program has manipulated the internal state by using an accessor method, the state is set in the byte sequence in the region for transfer, or obtained therefrom. A transfer function transfers the byte sequence in the region for transfer and the mapping management table to a receiver, where a reproduction function reproduces the object based on the received data. | 2008-09-04 |
20080215588 | Electronic object sharing system - According to one embodiment, a system and method is described for assigning access rights to documents and controlling these access rights within a database environment thereby preventing unauthorized persons from viewing certain documents. According to one embodiment of the invention, a method of operation comprises determining if a user has access rights to an electronic object stored in a database. If not, information associated with the electronic object is precluded from being displayed. | 2008-09-04 |
20080215589 | System, Method, and Computer-Readable Medium for Collection and Distribution of User-Supplied Comments Associated with Network and Local Content - A system, method and computer-readable medium for collection and distribution of user-supplied comments associated with network and local content is provided. User-supplied comments may be associated with network content and may be stored in a network repository in association with an identifier of the network content for which the comments were supplied. Other network users that view the content may be provided with the user-supplied comments associated with the content. User-supplied comments associated with local content may be stored in a local repository. Comments associated with local content may be displayed to a user in response to selection of the local content. | 2008-09-04 |
20080215590 | SYSTEM AND METHOD FOR ASSESSING THE IMPORTANCE OF A WEB LINK - A system and method for determining the most relevant web links to a destination web page is disclosed. The method generates a link value for a linking web page by analyzing the position of the link to the destination web page, the number of links to the destination web page, the number of links to competitors of the destintion web page, and a universal significance score of the linking web page. A plurality of web links to the destination web page may be assessed to generate a link value score for each web link. A list of relevance rankings of the link value scores ranked from highest to lowest relevance may be compiled. Determining the web links with the highest link value to a destination web page enables that company to determine the most beneficial web links, and thereby establish better business relationships with the web page owners that provide the most beneficial links to the company's web page. | 2008-09-04 |
20080215591 | EMAIL INTERFACE FOR WEBLOG ENTRIES - Posting to a blog is accomplished by sending an email to a specified address uniquely associated with the blog. When the email message is received, information on the associated blog is accessed from a database and publication data is extracted from the email message. Using information from the database, a connection is made to the blog hosting site which hosts the associated blog and the publication data is posted to the associated blog. | 2008-09-04 |
20080215592 | INFORMATION PROCESSING APPARATUS AND IDENTIFICATION INFORMATION REGISTRATION METHOD - An information processing apparatus and method determining whether a site corresponding to identification information of a request exists on a network, and registering identification information in a storage device based on a result of the determination. | 2008-09-04 |
20080215593 | Replication of object graphs - The updating of only some memory locations in a multiple computer environment in which at least one applications program ( | 2008-09-04 |
20080215594 | Contents distribution system, terminal apparatus, contents distribution method, and recording medium on which is recorded a program used therein - To provide a contents distribution system, a terminal apparatus and a contents distribution method, as well as a recording medium on which is recorded a program used therein, which can avoid an increase in accesses to a connection management server. | 2008-09-04 |
20080215595 | Data distribution system, terminal apparatus, connection candidate introduction apparatus, information processing method and recording medium with program recorded thereon - To provide a data distribution system, terminal apparatus, a connection candidate introduction apparatus, a recording medium on which a program is recorded, and an information processing method, which can prevent an occurrence of a circular connection between the terminal apparatus. | 2008-09-04 |
20080215596 | SELECTING STORAGE CLUSTERS TO USE TO ACCESS STORAGE - Provided are a method, system and program for selecting storage clusters to use to access storage. Input/Output (I/O) requests are transferred to a first storage cluster over a network to access storage. The storage may be additionally accessed via a second storage cluster over the network and both the first and second storage clusters are capable of accessing the storage. An unavailability of a first storage cluster is detected when the second storage cluster is available. A request is transmitted to hosts over the network to use the second storage cluster to access the storage. Hosts receiving the transmitted request send I/O requests to the storage via the second storage cluster if the second storage cluster is available. | 2008-09-04 |
20080215597 | Information processing apparatus, information processing system, and program - Conventional information processing apparatuses have a problem that the precision of related term collection is low. An information processing apparatus is provided which comprises a document information storing section for storing one or more pieces of document information, a term information receiving section for receiving term information, a document information obtaining section for obtaining the whole or a part of document information having the term information, a cited document information obtaining section for obtaining the whole or a part of cited document information which is information of a cited document having a citation relationship with a document corresponding to the document information, from the document information storing section, based on the whole or the part of the document information obtained by the document information obtaining section, a related term information obtaining section for obtaining related term information which is information of a related term which is related to the term indicated by the term information, based on the whole or the part of the cited document information obtained by the cited document information obtaining section, and a related term information outputting section for outputting the related term information obtained by the related term information obtaining section. Thereby, the precision of related term collection can be improved. | 2008-09-04 |
20080215598 | DATA STORAGE APPARATUS, DATA STORAGE METHOD AND IMAGE PROCESSING APPARATUS - In a data storage apparatus for storing data by making the data to be a file, a file is deleted, in a normal deletion processing, after contents of the file are destructed by overwriting the file to be deleted with data for elimination such as “all-zeros”. On the other hand, with respect to storage processing, when storing new data, files waiting for deletion are investigated whether they are existent or not, excluding files being deleted currently in the normal deletion processing, and when files waiting for deletion are existent, either one of the files waiting for deletion is overwritten with new data to be stored. | 2008-09-04 |
20080215599 | Internet Music Composition Application With Pattern-Combination Method - This invention relates to the method and system of producing/composing user's own music (musical composition, arrangement, and performance) on the web site. The system creates musical patterns out of all kinds of music, recommends the ideal patterns in accordance with genres selected by users, and ultimately enables ordinary internet users without musical knowledge to compose their own music simply by selecting and assembling the patterns. The system of invention is composed of a DB server including a music database storing a music data specifically patterned from a plurality of music and a lyrics database storing lyrics data patterned from a plurality of lyrics and various kinds of texts; an user PC for downloading the music and lyrics data through a music file real-time player; a web site; and a music pattern automatic control server for controlling the files suitable for music by allowing the user to select and combine the patterned music and lyrics data of the said DB server in accordance with acoustics and harmonics. | 2008-09-04 |
20080215600 | Data Processor - A data processor requires setting a plurality of items to a plurality of data sets. The data processor includes a setting unit, a determining unit, a first prompting unit, and a second prompting unit. The setting unit sets an item to a data set. The first prompting unit prompts the setting unit to change the setting of an item from the currently setting item by the setting unit to remaining one of the plurality of items other than the currently setting item when the determining unit determines that a data set which is set for the currently setting item satisfies a prescribed condition for the data set of the currently setting item. The second prompting unit prompts the setting unit to change a setting of an item from the currently setting item by the setting unit to one of the items that has been previously set by the setting unit when the determining unit determines that a data set which is set for the currently setting item is out of conformance with a prescribed condition for the data set of the currently setting item. | 2008-09-04 |
20080215601 | SYSTEM MONITORING PROGRAM, SYSTEM MONITORING METHOD, AND SYSTEM MONITORING APPARATUS - A system monitoring apparatus, method and program determining whether each unit process executed by a system matches one of a plurality of unit process models generated by individually modeling a plurality of types of unit processes, determining whether an analysis of a processing status of the system is needed based on determining whether each unit process matches one of the plurality of unit process models, and displaying a difference of a most approximate unit process model among the plurality of unit process models in relation to each unit process determined as matching none of the plurality of unit process models. | 2008-09-04 |
20080215602 | "Methods and Apparatus for Fusing Databases" - Methods and apparatus for fusing multiple databases into a single database are disclosed. A disclosed method determines a ranking of a plurality of matching variables associated with first and second datasets and generates a hierarchical matching grid including a plurality of levels based on the ranking of the plurality of matching variables. The example method identifies first and second sets of match candidates from the first and second datasets based on successive levels of the hierarchical matching grid and fuses records in the first and second sets of match candidates based on probabilities associated with the records. | 2008-09-04 |
20080215603 | SERIALIZATION OF RUN-TIME STATE - The claimed subject matter provides a system and/or a method that facilitates re-locating a web application associated with a network service utilizing a portion of serialized data. The network service can be any collection of resources that are maintained by a party (e.g., third-party, off-site, etc.) and accessible by an identified user over a network (e.g., WAN, Internet, etc.). An interface component can receive a portion of serialized data with transparent structure related to an application specification. A hydrate component can create a web application independent of a network service based at least in part upon the serialized data, the web application has state within the network service. | 2008-09-04 |
20080215604 | Processing Pedigree Data - A device, namely, one of a Field Programmable Gate Array (FPGA) device and an Application Specific Integrated Circuit (ASIC) is described. The FPGA or ASIC is configured to represent one or more pedigree data structures, each structure comprising at least two generations. The device comprises a plurality of logic cells arranged such that one or more of the logic cells model a module of the pedigree data structure, where each module of the pedigree data structure is representative of an individual in a pedigree, input circuitry to receive pedigree data and output circuitry to output processed data; and electrical connections between the logic cells and the input and output circuitry. The arrangement of the logic cells and electrical connections enable parallel processing on a loaded pedigree data structure such that the transmission of pedigree data through at least a subset of the, or each, pedigree data structure occurs in each sampling cycle. A method and data structure are further disclosed. | 2008-09-04 |
20080215605 | Method for Embedding Data - Watermarking schemes are known that embed the watermark directly in the MPEG domain. A requirement for these algorithms is that the watermarked MPEG stream does not increase in size. Therefore, a bit rate controller allows a modification of a DCT coefficient only if such modification does not increase the stream size. It happens frequently that DCT coefficients are skipped because of this requirement. As a direct consequence, the watermark energy is smaller than desired and therefore the watermark is less robust. This invention exploits the fact that stuffing bits have often already been added to the stream by the MPEG encoder. The embedder is arranged to analyse the stream so as to find out how many stuffing bits there are at the end of the slice. The embedder can then embed the watermark immediately at the beginning of a slice. As a direct result, the watermark energy will increase and therefore the watermark will be more robust. | 2008-09-04 |
20080215606 | FOCAL POINT COMPRESSION METHOD AND APPARATUS - A method for compressing and decompressing files is provided. The method includes creating a list of shift-invariant focal points of neighborhoods in the stream and comparing those focal points to a list of focal points created using the same method on the reference stream. The method of the present invention searches for the longest sequence of focal points that appear in both files. The method of the present invention also verifies that neighborhoods contain the same focal points. The changed data and references to the reference stream are then encoded. The decompression process decodes the encoded stream of data, and using the reference stream recreates the new version of stream. | 2008-09-04 |
20080215607 | TRIBE OR GROUP-BASED ANALYSIS OF SOCIAL MEDIA INCLUDING GENERATING INTELLIGENCE FROM A TRIBE'S WEBLOGS OR BLOGS - A computer-based method for generating intelligence from social media data, such as blog data, that is publicly available on the Internet. A server is provided that runs a tribe analysis tool, and the method includes accessing a set of the social media data with the tribe analysis tool. The social media data is associated with a plurality of network users or authors. The method continues with operating the tribe analysis tool to identify members of a tribe from the authors by processing the set of social media data to determine the authors having associated portions of the social media data that satisfies tribe membership criteria. Common interests for the identified members of the tribe are determined by processing the social media data associated with the tribe authors. A report is generated for the tribe that includes information related to the set of common interests and additional generated tribe-based intelligence. | 2008-09-04 |
20080215608 | Computer Program Product and Computer System for Information Organization Using Markup Languages - The presentation of information in HTML files is desirably enhanced by the use of one or more separate scripting Javascript™ files, referenced from the HTML, file, which uses information presented as variables in the HTML file. In this manner, a high degree of formatting flexibility can be achieved, while reducing the likelihood of errors in the HTML pages, improving ease of site maintenance, and standardising the “look and feel” of the site. Improvements in the network bandwidth required to browse sites organised in this manner can also be achieved in favourable instances. | 2008-09-04 |
20080215609 | Method and system for data aggregation in a sensor network - A sensor profile based data aggregation method for aggregating data in a sensor network, which includes a plurality of sensor nodes, is provided. This method includes steps of determining types of sensors included in the sensor nodes, and generating a sensor profile that includes information on each type of the sensors. The information includes a filtering criterion and aggregation operators defined for the each type of the sensors. Once the sensor profile is created, the profile is parsed into a header file, and the header file is compiled with other sub-modules to generate a sensor profile based aggregation module. The sensor profile based aggregation module is installed in each of the sensor nodes. Whenever, sensor data is received in the sensor node, the data is filtered according to the filtering criterion defined in the sensor profile, and data aggregation is simultaneously with given operators. | 2008-09-04 |
20080215610 | Methods involving artificial intelligence - One aspect of the present invention relates to methods of generating a profile data set. In an exemplary embodiment, data is accessed and the accessed data is processed using a dynamic cluster method, mobile center method, and/or a k-means algorithm, each using neighborhood data. Other aspects relate to methods of generating a diagnosis, advice, and/or other information. Further aspects relate to dynamic surveying and systems. | 2008-09-04 |
20080215611 | SEQUENCED MODIFICATION OF MULTIPLE ENTITIES BASED ON AN ABSTRACT DATA REPRESENTATION - The present invention is generally directed to a system, method and article of manufacture for modifying data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs transformation of an abstract query into a form that can be used against a particular physical data representation. The transformation includes ordering physical modification operations according to a physical entity relationships specification to ensure that the physical modification operations are executed in an appropriate order. | 2008-09-04 |
20080215612 | SEQUENCED MODIFICATION OF MULTIPLE ENTITIES BASED ON AN ABSTRACT DATA REPRESENTATION - The present invention is generally directed to a system, method and article of manufacture for modifying data represented abstractly through an abstraction model. In one embodiment, a data repository abstraction layer provides a logical view of an underlying data repository that is independent of the particular manner of data representation. A query abstraction layer is also provided and is based on the data repository abstraction layer. A runtime component performs transformation of an abstract query into a form that can be used against a particular physical data representation. The transformation includes ordering physical modification operations according to a physical entity relationships specification to ensure that the physical modification operations are executed in an appropriate order. | 2008-09-04 |
20080215613 | Method and System For Transferring Objects Between Programming Platforms Computer Program Product Thereof - Objects are transferred between a first and a second platform, the platforms being, e.g. Java and Net platforms, providing a reflection framework adapted to allow introspection of the meta-information that describes the structure of the objects. The arrangement provides for translating the objects to be transferred into XML payloads by reading the characteristics of the objects through the reflection framework, thereby carrying out introspection of the meta-information that describes the structure of the classes of the objects. The objects translated into XML payloads are transferred from the first to the second platform by means of an asynchronous peer-to-peer delivery facility, such as TCP or UDP. The objects transferred as XML payloads to the second platform are then re-translated into objects of the second platform. | 2008-09-04 |
20080215614 | Pyramid Information Quantification or PIQ or Pyramid Database or Pyramided Database or Pyramided or Selective Pressure Database Management System - Embodiments of the present invention allow for methods to catalog, classify and stratify data, producing an optimized and finitely targeted database, database subset or data model, including networks of any scale, and their contents. This would include World Wide Web pages and their objects or resources. Four controls and constraints: Category Target Time and Exclusion, produce a data environment that applies selective pressure to delineate stronger data or targeted data from weaker or unwanted data. A wide variety of free standing application(s), search engine(s), social network(s), database schema(s) and control(s) can all be derived from the inherent flexibility of the information-processing capabilities defined by the patent described herein. | 2008-09-04 |
20080215615 | Social Online Memory Systems - A system is described having the steps of receiving a roster of an organization; when the roster includes a name of a person associated with the organization; electronically storing a digital-medium; when the digital-medium includes a likeness of the person; assisting relating the digital-medium with the name; when the step of assisting relating further includes the steps of presenting, over a electronic-network, the likeness within a structured document; accepting inputting of a letter; presenting, by modifying at least a portion of the structured document, a portion of the roster; when the portion excludes a other name; when the other name includes the roster and does not comprise the letter; allowing selecting the name from the portion of the roster, whereby a relationship is formed between the digital-medium and the name; and electronically storing the relationship. | 2008-09-04 |
20080215616 | VIRTUAL FOLDERING SYSTEM FOR BLENDING PROCESS AND CONTENT IN A COLLABORATIVE ENVIRONMENT - A computer system that includes a processor and a storage medium. The storage medium stores a database of tables and a calculation engine. Each table includes columns and rows. The tables describe components of a hierarchy in which hierarchical relationships between components of the hierarchy are defined. The tables include a component table and component-specific tables. The components of the hierarchy encompass component types. Each component-specific table encompasses only components of the hierarchy. The calculation engine includes a popup calculator being displayed to a user via a display interface of the computer system upon the calculation engine being executed by the processor. The popup calculator performs, under interactive control by the user via the display interface, an evaluation of a specified function of set of functions and displays a result of the evaluation to the user via the display interface. | 2008-09-04 |
20080215617 | METHOD FOR USING PSYCHOLOGICAL STATES TO INDEX DATABASES - The present invention provides a method for capturing and storing physiological response attributes measured from a user while different stimuli are presented. Each stimulus may be any multimedia object, for example text, picture, or audio/video. The measured physiological response attributes are paired with the input stimulus, and stored conjointly in one or more databases. The physiological response attributes measure an aspect of the user known as emotional valence, and relate to the emotional state of the user, such as angry or sad. The database of physiological responses attributes of multiple users is first established. Then, when the physiological response attributes of a specific user in the future is examined, the system can suggest which objects in the database best correspond. Moreover, the database can be constructed based on the responses of the individual user for their own utilization, and be updated over the course of its continued use. | 2008-09-04 |
20080215618 | Natural Language Interaction with Large Databases - A method includes applying at least one tag to at least one data element stored in a database the tag having at least one associated rule, utilizing the at least one associated rule to generate at least one variant of the data element, and storing the at least one variant in the database. | 2008-09-04 |
20080215619 | Financial line data-base - A computerized method for managing data performed in a computer system. The data is stored in a data base including flat lines. Each of the flat lines includes values of the data and tags associated with the values forming tag-value pairs. The flat lines are scanned and an object of a class is created. The class specifies a subset including one or more tags selected from the tags of the flat lines. The flat line points to the object if a portion of the tag-value pairs of the flat line includes all the tags of the subset. When the flat line contains multiple alternative ways, through the subset(s) of tags or through different tag-value pairs, of pointing to the object of the class, then the object as individually identified by the alternative ways is taken to be the same object. | 2008-09-04 |
20080215620 | METHOD AND SYSTEM FOR SOCIAL REMIXING OF MEDIA CONTENT - Systems and methods have been developed for manipulating media assets in a networked computing environment where processing power, bandwidth and/or storage capacity may be limited. | 2008-09-04 |
20080215621 | Metamodel-based automatic report generation - A metamodel-based system for automatically generating reports is provided. Much of the work involved in creating report designs and reports is automated, allowing developers to produce a broad variety of report designs and reports in a fraction of the time required with standard report development, according to one illustrative embodiment. Metamodels for data and style templates may be created, that allow for the automated design and manipulation of report models. The report models may be used to generate reports that include the indicated data, arranged according to indicated data field properties, settings, and style templates. Changes made in the metamodels can automatically be reflected in reports designed according to those metamodels. | 2008-09-04 |
20080215622 | Enterprise confidential electronic data inventory systems, methods and computer program products - Enterprise confidential electronic data inventory systems, methods and/or computer program products include a database management system, method and/or computer program product that is configured to store identifying information for the confidential electronic data of the enterprise without storing the confidential electronic data itself. Querying of the identifying information for the electronic data of the enterprise that is stored may also be provided. | 2008-09-04 |
20080215623 | MOBILE COMMUNICATION FACILITY USAGE AND SOCIAL NETWORK CREATION - In embodiments, the present invention provides a method and system for associating a mobile subscriber characteristic with a mobile communication facility, creating a first user profile based at least in part on the mobile subscriber characteristic, identifying a relevancy between the first user profile and a second user profile, and sending an invitation to interact with a user associated with the first user profile and a user associated with the second user profile | 2008-09-04 |