| 52nd week of 2012 patent applcation highlights part 64 |
| Patent application number | Title | Published |
|---|
| 20120330912 | VERIFYING AN ATTRIBUTE IN RECORDS FOR PROCUREMENT APPLICATION - A method for verifying a target attribute of a company profile record for a procurement application. It is ascertained that a database stores the company profile record including the target attribute and a validity attribute associated with the target attribute. The validity attribute has a VALID or INVALID value respectively indicating that the target attribute in the company profile record has a valid or invalid value within the database. It is insured that the database stores a first and second user profile record, that a first user of a requisition transaction corresponds to the first user profile record, that the first user profile record includes the target attribute having a value identical to a value of the target attribute of a first company profile record associated with a first company represented by the first user, and that the validity attribute of the first company profile record has the VALID value. | 2012-12-27 |
| 20120330913 | SYSTEMS AND METHODS FOR SUPPORTING TRANSACTIONAL MESSAGE HANDLING - In accordance with embodiments disclosed herein, there are provided methods, systems, and apparatuses including, for supporting transactional message handling in an on-demand service environment including, for example: enqueuing a message specifying a transaction to be processed via a host organization; inserting a row into a database of the host organization associating the message with a status of pending, wherein the row is autocommitted to the database upon insertion; updating the status for the row to ready if a commit operation for the transaction is initiated; requesting a lock on the row; and performing final processing for the transaction based on the status for the message and based further on whether the lock is obtained for the row. Final processing may include, for example, a transaction roll back, a transaction commit, a transaction requeue, a termination of transaction processing, or an orphaned transaction clean up. | 2012-12-27 |
| 20120330914 | SERVER, INTER-BUSINESS ENTERPRISE INFORMATION CONTROL METHOD AND COMPUTER PROGRAM - A Web server includes a storage unit that stores transaction relation information, transaction data requirement information that determines whether a reference authority is appended to a user for transaction data, and information that identifies the user, associated with each other; and a control unit that controls to receive the transaction data containing the transaction relation information, refer to the storage unit, extract user identification information for appending information indicating the transaction relation and the reference authority from the storage unit, when the storage unit stores the received transaction relation information and the received transaction data satisfies the transaction data requirement, and register the extracted information and information for identifying the transaction data in the database, from the user terminal, therefore, separate third parties can refer to every transaction data, even to the transaction data transmitted and received between the same transaction relations. | 2012-12-27 |
| 20120330915 | STREAMING TRANSACTION NOTIFICATIONS - Methods and systems are provided for identifying data transactions satisfying a streaming query and providing data corresponding to those data transactions to subscribed client devices. One exemplary method involves receiving a subscription request for a streaming query from a client device, monitoring a database for indication of a data transaction corresponding to the streaming query, and in response to identifying the indication of the data transaction corresponding to the streaming query, obtaining data for an entry associated with the data transaction from the database and providing at least a portion of the obtained data to the client device. | 2012-12-27 |
| 20120330916 | UTILIZING SHARED NUMERIC LOCKS - A method and system for performing at least one transaction on at least one column of a table in a database system is disclosed. The method includes determining whether a first transaction of the at least one transaction fulfills all of at least one criteria. The method further includes ensuring that the at least one column is in a shared numeric lock if the first transaction fulfills all of the at least one criteria, wherein the shared numeric lock is a lock that allows at least a second transaction fulfilling all of the at least one criteria to access the same column concurrently with the first transaction without releasing the shared numeric lock between transactions, and wherein the shared numeric lock is released only after all of the transactions fulfilling all of the criteria have completed processing. The method further includes processing the first transaction. | 2012-12-27 |
| 20120330917 | BATCHING CONTENT MANAGEMENT OPERATIONS TO FACILITATE EFFICIENT DATABASE INTERACTIONS - Batching content management operations to facilitate efficient database interactions is disclosed. Two or more content management-related requests are received. The two or more content management-related requests are treated as a batch, including by formulating and sending to a database in a single database interaction a grouped request to add, delete, or modify each of a plurality of database records. | 2012-12-27 |
| 20120330918 | FLEXIBLE EVENT DATA CONTENT MANAGEMENT FOR RELEVANT EVENT AND ALERT ANALYSIS WITHIN A DISTRIBUTED PROCESSING SYSTEM - Methods, systems, and computer program products for flexible event data content management for relevant event and alert analysis within a distributed processing system are provided. Embodiments include receiving, by an interface connector, a raw event from a component of the distributed processing system; analyzing, by the interface connector, custom data within the raw event to determine a location to store the custom data, the custom data in a first data format; storing, by the interface connector, extended data within the raw event in a common event data format, the extended data indicating the location of the custom data; receiving, by an event analyzer, the event; and determining whether there are custom customer rules that need the custom data; and if there are such custom customer rules, retrieving the custom data based on the extended data from the event; and applying the custom customer rules to the extended data; if there are no such custom customer rules, applying the base rules to a base portion of the event. | 2012-12-27 |
| 20120330919 | DETERMINING CROSS-LANGUAGE QUERY SUGGESTION BASED ON QUERY TRANSLATIONS - Computer-implemented methods, systems, computer program products for generating cross-language query suggestions are described. A pair of machine-generated translations are obtained for a primary-language query suggestion. A first machine-generated translation of the pair is generated by machine-translation from a first language to a second language, while the second machine-generated translation is generated by machine-translation from the second language to the first language. A respective difference measure is determined for each machine-generated translation based on the number of n-grams the machine-generated translation has in common with the primary-language query suggestion. The machine-generated translation that has a smaller number of n-grams in common with the primary-language query suggestion is identified as a preferred choice as a cross-language query suggestion for the primary-language query suggestion. The first language and the second language can be the preferred languages for the primary-language query suggestions and cross-language query suggestions, respectively. | 2012-12-27 |
| 20120330920 | TYPED SEARCH TO ASSIST WITH BUYING AND SELLING ACTIVITIES - The current application is directed to characterization of e-commerce-related searches and digital encoding of the characterizations in a database or other data-storage system by an e-commerce search engine. As one example, when a user enters a query term in a search textbox, the user is provided with a choice of pressing an action button labeled “I want to buy” or an action button labeled “I want to sell,” referred to as a “buy button” and “sell button,” respectively. The search engine records the buy-button and sell-button inputs along with corresponding search queries. The search-engine implementation then collects these queries from a large number of users into a database and matches them over a period of time, thus helping buyers find sellers and vice versa. | 2012-12-27 |
| 20120330921 | USING ONTOLOGICAL INFORMATION IN OPEN DOMAIN TYPE COERCION - A computer-implemented system, method and program product generates answers to questions in an input query text string. The method includes determining, by a programmed processor unit, a lexical answer type (LAT) string associated with an input query; automatically obtaining a candidate answer string to the input query from a data corpus; mapping the query LAT string to a first type string in a structured resource; mapping the candidate answer string to a second type string in the structured resource; and determining if the first type string and the second type string are disjointed; and scoring the candidate answer string based on the determination of the types being disjointed wherein the structured resource includes a semantic database providing ontological content. | 2012-12-27 |
| 20120330922 | ANCHOR IMAGE IDENTIFICATION FOR VERTICAL VIDEO SEARCH - Anchor images and information associated therewith are accumulated during a Web crawling operation. One or more rules are applied to the accumulated candidate anchor images to filter out candidate anchor images that are not appropriate for use as the anchor image for a particular target video. The remaining candidate anchor image is then selected as the anchor image for the particular video. | 2012-12-27 |
| 20120330923 | VALUE-BASED POSITIONING FOR OUTER JOIN QUERIES - Enterprise systems, methods and computer program products are disclosed for providing value-based positioning for outer join database queries in an enterprise resource planning system operating on a specially programmed computer server. The computer implemented method comprises; receiving a query at a server and processing the query for inner join and then evaluating a returned value for Order by direction and whether the current row returns NULL. Depending on forward paging and reverse paging for outer join, the process involves changing an inequality operator depending on the evaluated Order by direction and whether the current row is NULL. The process for inner join and outer join queries is implemented on an application object server including a kernel instance, a query framework and query generation model and a data access layer engine to a database of the enterprise resource planning system. | 2012-12-27 |
| 20120330924 | METHOD AND SYSTEM FOR QUERYING AN ON DEMAND DATABASE SERVICE - Methods and systems are provided for querying a multi-tenant database. One exemplary method of generating an improved query plan to a database from an input query submitted to an on demand database service over a network involves determining guidance information appropriate to the input query based at least in part on an identity of a source of the input query, determining a database hint for processing the input query based at least in part on the guidance information, and providing the database hint to the database to form the improved query plan, thereby enabling the database to return an improved result responsive to the input query based at least in part upon the database hint. | 2012-12-27 |
| 20120330925 | OPTIMIZING FINE GRAINED ACCESS CONTROL USING AUTHORIZATION INDEXES - Architecture that is an index mechanism which optimizes complex queries that result from enforcing fine grained access control. The architecture addresses the problem of efficient query evaluation in the presence of fine grained access control. The index mechanism is a structure (referred to as authorization indexes) which provides expedient access to the authorized tuples of a particular user in a table. The index is maintained by utilizing view maintenance algorithms. The index can be built for only certain groups/roles (referred to as partial authorization indexes). Additionally, the authorization index can be used to create a cost-based query rewriter, as well as authorization-aware query optimizer. | 2012-12-27 |
| 20120330926 | STATISTICS MANAGEMENT FOR DATABASE QUERYING - Methods and systems are provided for querying a database. One exemplary method for obtaining data from an on-demand database supporting one or more tenants involves obtaining model database statistics based on expected utilization information for a tenant and providing the model database statistics to the on-demand database. The on-demand database utilizes the model database statistics to generate a query plan and executes the query plan to obtain data from the model database statistics. | 2012-12-27 |
| 20120330927 | INTELLIGENT ADAPTIVE INDEX DENSITY IN A DATABASE MANAGEMENT SYSTEM - Adaptive index density in a database management system is provided, which includes receiving a number of partitions for an index for a database table, the index subject to creation. The adaptive index density also includes selecting a column from the database table, the column selected based upon an estimated frequency of execution of database queries for the column. The adaptive index density further includes calculating an estimated cost of executing each of the database queries for the column, and determining data to reside in each of the partitions of the index responsive to the estimated cost. | 2012-12-27 |
| 20120330928 | Method and Apparatus for Generating a Fused View of One or More People - In accordance with particular embodiments, a method includes receiving data from disparate data sources comprising data associated with different people. At least one of the data sources comprises data associated with at least one common person. The method also includes extracting at least one record from each of the disparate data sources. Each extracted record is associated with a corresponding person and comprises at least one feature associated with the corresponding person. The method additionally includes distributing the records to computers configured to identify matches between the records based on at least one matching feature associated with two or more records. The method further includes merging the at least one feature from each of the records of each corresponding match into merged records, each merged record corresponding to a different match. The method also includes generating at least one fused view associated with the at least one common person and comprising a merged record. | 2012-12-27 |
| 20120330929 | SERVICE CONTEXT - According to one general aspect, a method of using an application may include receiving a request, from a user, to display at least a portion of a business service context regarding a business service. The method may also include receiving, from a database, an aggregated database result regarding the business service. The aggregated database result may include the requested business service context. The business service context may include information from a plurality of other applications. The method may further include displaying a graphical user interface element that displays at least a portion of the information included by the business service context. | 2012-12-27 |
| 20120330930 | System for multiple database correlation of location based information - A method includes loading an application on a user device wherein the application is configured to receive information requests and to launch search requests utilizing a web mapping service with a local search feature. After launching a search request via the application, the user device receives search results from the web mapping service. At the application, the results are analyzed to ascertain if a search result corresponds to an information request. Such data is added, when not already present, to the database. | 2012-12-27 |
| 20120330931 | DATABASE MANAGEMENT METHOD, COMPUTER, SENSOR NETWORK SYSTEM AND DATABASE SEARCH PROGRAM - In a system manages a plurality of pieces of sensor information in a plant, or the like, it can be reducing an amount of data stored in a database and easily a processing for searching a place of an anomaly and an anomaly cause. | 2012-12-27 |
| 20120330932 | PRESENTING SUPPLEMENTAL CONTENT IN CONTEXT - Techniques that may be used for detecting a primary content (e.g., a web page) that the user is viewing and presenting one or more pieces of supplemental content (e.g., social media data) together with the primary content. The supplemental content presented to the user together with the primary content may be content that is matched to the primary content and therefore detected to be relevant to the user. Detection of primary content and matching to supplemental content may be carried out based on a comparison of entities related to the primary and supplemental content. In some embodiments, an analysis of the primary content for entities may include ordering entities according to significance in the primary content and selecting top entities for comparison. Also, in some embodiments, multiple pieces of supplemental content may be displayed to a user categorized based on entity. | 2012-12-27 |
| 20120330933 | HANDHELD ELECTRONIC DEVICE WITH ASSISTED TEXT ENTRY USING EXISTING MESSAGE THREAD, AND ASSOCIATED METHOD - A method of facilitating the entry of text into a new message generated by a messaging application of a handheld electronic device is provided that includes receiving a command to reply to or forward a received message that is included within a message thread, scanning the message thread, identifying a plurality of words in the message thread, generating one or more word lists that include the identified words, and displaying the one or more word lists. The method further includes receiving a selection of a selected one of the words from the one or more word lists, and entering the selected one of the words into the new message. Also provided is an improved handheld electronic device that implements the described method. | 2012-12-27 |
| 20120330934 | PROVIDING QUESTION AND ANSWERS WITH DEFERRED TYPE EVALUATION USING TEXT WITH LIMITED STRUCTURE - A system, method and computer program product for conducting questions and answers with deferred type evaluation based on any corpus of data. The method includes processing a query including waiting until a “Type” (i.e. a descriptor) is determined AND a candidate answer is provided. Then, a search is conducted to look (search) for evidence that the candidate answer has the required Lexical Answer Type (e.g., as determined by a matching function that can leverage a parser, a semantic interpreter and/or a simple pattern matcher). Prior to or during candidate answer evaluation, a process is provided for extracting and storing collections of entity-type pairs from semi-structured text documents. During QA processing and candidate answer scoring, a process is implemented to match the query LAT against the lexical type of each provided candidate answer and generate a score judging a degree of match. | 2012-12-27 |
| 20120330935 | USER-SPECIFIC PRESENTATION OF TRAVEL DATA - Systems and methods for mediation of content-related services are provided. Information about a user may be stored in memory. Such information may be used to identify availability of the user to travel on certain days. A search is formulated based on the identified availability of the user. Each search result is evaluated to derive a user-specific value. The search results are thereafter ranked based on the user-specific value calculated. A user-specific display of travel data is then generated for presentation to the user. | 2012-12-27 |
| 20120330936 | USING A DYNAMICALLY-GENERATED CONTENT-LEVEL NEWSWORTHINESS RATING TO PROVIDE CONTENT RECOMMENDATIONS - A method for providing content-level data artifact recommendations can begin with the creation of a semantic library from the textual content of data artifacts by a newsworthy content recommendation engine. A base newsworthiness rating can be calculated using global newsworthiness parameters and behavioral functions that model newsworthy influences for each relationship contained in the semantic library. A user-specific search network can be generated that represents user-entered criteria and/or user task-related criteria. Within the semantic library, potential newsworthy semantic networks can be identified. Newsworthy content from each identified potential newsworthy semantic network can be dynamically determined based upon the base newsworthiness rating and a predefined newsworthiness threshold. The newsworthy content from the identified potential newsworthy semantic network can be related to the user-specific search network at the common node, creating a newsworthy content recommendation graph. The newsworthy content recommendation graph can be presented within a user interface. | 2012-12-27 |
| 20120330937 | Search Results Comparison Methods and Systems - An exemplary method includes a search results comparison system receiving data representative of a first search term and a second search term, identifying a group of search results that are each related to the first and second search terms, determining a degree of relatedness of each of the search results to the first search term and a degree of relatedness of each of the search results to the second search term, and presenting a set of one or more search result icons representative of one or more of the search results in between a first search term icon representative of the first search term and a second search term icon representative of the second search term. Corresponding methods and systems are also disclosed. | 2012-12-27 |
| 20120330938 | SYSTEM AND METHOD FOR FILTERING DOCUMENTS - A method and document separation system for separating a set of related documents is described. In one aspect, the method comprises: determining, on a document selection system, quality scores for a plurality of the documents in the set of related documents; obtaining a similarity score for a plurality of pairs of documents in the set of related document; and on a document selection system, obtaining a first subset of related documents which solves an optimization problem, the first subset of related documents including a portion of the document in the set of related documents, the optimization problem being a function of one or more quality scores of the documents assigned to the first subset of related documents and one or more similarity scores of pairs of documents assigned to the first subset of related documents. | 2012-12-27 |
| 20120330939 | USING A DYNAMICALLY-GENERATED CONTENT-LEVEL NEWSWORTHINESS RATING TO PROVIDE CONTENT RECOMMENDATIONS - A method for providing content-level data artifact recommendations can begin with the creation of a semantic library from the textual content of data artifacts by a newsworthy content recommendation engine. A base newsworthiness rating can be calculated using global newsworthiness parameters and behavioral functions that model newsworthy influences for each relationship contained in the semantic library. A user-specific search network can be generated that represents user-entered criteria and/or user task-related criteria. Within the semantic library, potential newsworthy semantic networks can be identified. Newsworthy content from each identified potential newsworthy semantic network can be dynamically determined based upon the base newsworthiness rating and a predefined newsworthiness threshold. The newsworthy content from the identified potential newsworthy semantic network can be related to the user-specific search network at the common node, creating a newsworthy content recommendation graph. The newsworthy content recommendation graph can be presented within a user interface. | 2012-12-27 |
| 20120330940 | METHOD AND SYSTEM FOR RANKING AFFINITY DEGREE AMONG FUNCTIONAL BLOCKS - A methodology for assisting a user in a combination of functional blocks by defining a value representative of an affinity degree among the functional blocks. Such affinity degree is influenced by available historic data derived by previous uses of the functional blocks which had been recorded into a repository. | 2012-12-27 |
| 20120330941 | Search Method and Apparatus - A computing device may identify multiple search results that have relatively high correlation with the keyword. The device may determine multiple additional search results based on the corresponding relationships among the keyword, the multiple additional search results, and transaction parameters. The device may list the search results related to the degree of transaction success on the top and the search results related to the correlation on the bottom. The transactional parameters may be determined based on a click index and a purchase index that are associated with the keyword and each search result of the multiple additional search results. The click index and the purchase index may be generated in a predetermined time period. | 2012-12-27 |
| 20120330942 | INFORMATION REPOSITORY SEARCH SYSTEM - A system for receiving search criteria from users is disclosed. The search criteria are for application to a common information repository. The search criteria are received from at least two of the users. The system further associates the search criteria with source information that identifies multiple sources via which the search criteria are received. The system further generates a ranked set of search criteria based on the search criteria and presents a user interface including the ranked set of search criteria. | 2012-12-27 |
| 20120330943 | SIMPLIFIED SEARCHING FOR MEDIA SERVICES USING A CONTROL DEVICE - A method and apparatus are disclosed for searching for a media content related to a selected media service. A selected media service, as selected by a user operable indicator, has related metadata that is used as the basis of a search query. Once the search query is formulated, the query is submitted to a search engine that returns search results of media content related to the selected media service. Media content then may be selected from the returned search results for rendering in a rendering environment. | 2012-12-27 |
| 20120330944 | INDEXING AND SEARCH QUERY PROCESSING - A method for processing a search query according to one embodiment includes receiving a search query containing terms; combining at least some consecutive terms in the search query to create biwords; looking up at least some of the terms and biwords in a search index for identifying sections of documents containing the at least some of the terms and/or biwords; generating a content score for each of the identified sections based at least in part on a number of the terms and biwords found in the sections of each document, wherein the biwords are given a higher priority than matched terms, wherein the priority affects the content score; and selecting and outputting an indicator of at least one of the sections, or portion thereof, based at least in part on the content score. | 2012-12-27 |
| 20120330945 | Ranking Search Results Based on the Frequency of Access on the Search Results by Users of a Social-Networking System - Particular embodiments access a search query submitted by a first user of a social-networking system; identify one or more web pages in response to the search query; for each of the one or more web pages, determine a value indicating a number of user clicks associated with the web page by one or more second users of the social-networking system who are connected to the first user within the social-networking system; and send a set of hyperlinks for the one or more web pages, wherein hyperlinks for web pages where the value is greater than zero are visually emphasized over other hyperlinks. | 2012-12-27 |
| 20120330946 | INTUITIVE, CONTEXTUAL INFORMATION SEARCH AND PRESENTATION SYSTEMS AND METHODS - Tags representing characteristic terms in a set of matter-specific local documents, such as an accumulating litigation or medical record, are identified and used to evaluate the relevance to a user of each of a set of global, generally accessible documents. User-entered keywords and other parameters may also be incorporated into the search strategy to increase the relevance of returned documents. | 2012-12-27 |
| 20120330947 | Name-Search System and Method - A computer-implemented method is disclosed. The method may include receiving a portion of a personal name and converting the portion to a normalized portion by reducing the one or more characters to their simplest equivalents. The method may further include searching a typographical index tree and a phonetic index tree to identify one or more keys matching the normalized portion. The method may further include compiling, ranking, and presenting a plurality of suggested matches identified during the searching. | 2012-12-27 |
| 20120330948 | MULTI-PART SEARCH RESULT RANKING - Search results responsive to a query are generated by a search engine. If the query is “location relevant”, the results are provided to a ranker component. If the query is an entity search, then entities matching the query are ranked by distance from the user. If the query is not, and if it is not semantically charged, the entities are ranked either according to distance from the user or by search relevance. If the query is semantically charged, a semantic score is calculated for each entity. One or more threshold semantic scores are determined that divide the search results into multiple parts. The results within each part can then be ranked independently. The results within a first part are ranked according to their distance from the user, while the results in a subsequent part are ranked according to their semantical relationship to the query. The re-ranked parts are concatenated together. | 2012-12-27 |
| 20120330949 | Search System Using Search Subdomain and Hints to Subdomains in Search Query Statements and Sponsored Results on a Subdomain-By-Subdomain Basis - A method and apparatus for generating search results including searching by subdomain and providing sponsored results by subdomain is provided. A search system according to embodiments of the present invention analyzes search queries to determine if they are to be routed to subdomains and presents results include sponsored hits sponsored on a subdomain by subdomain basis. | 2012-12-27 |
| 20120330950 | METHOD AND APPARATUS FOR SEGMENTING MEDIA CONTENT - A method for creating information in media content is disclosed. In one embodiment, one or more macro segments of the contiguous stream are identified. A standardized segment tag associated with the one or more macro segments is created. | 2012-12-27 |
| 20120330951 | PROVIDING ACCURATE RECIPIENT LISTS BY CORRELATING TAGGED KEYWORDS TO RECIPIENT LISTS - A method, system and computer program product for providing accurate recipients lists. Keywords (e.g., processor, monitor) in a document (e.g., electronic mail message) are identified. These keywords are tagged, where tagging refers to an index term assigned to a piece of information, such as these keywords. A list of recipients may be provided to be correlated with these tagged keywords. The list of recipients is associated with these tagged keywords thereby providing a predefined recipient list to be used when a subsequent document with these tagged keywords is identified. Furthermore, the user is provided an option to modify this recipient list when a subsequent document containing the tagged keywords associated with the recipient list is identified thereby ensuring an accurate recipient list is used. | 2012-12-27 |
| 20120330952 | SCALABLE METADATA EXTRACTION FOR VIDEO SEARCH - Video entity templates defining common features that relate to various metadata types shared among a group of video Web pages are generated for target Web sites. Metadata associated with videos contained within Web pages belonging to a particular target Web site can then be automatically and accurately extracted using a video entity template generated for the particular target Web site. This metadata can then be indexed for use by video search applications in providing video search results. | 2012-12-27 |
| 20120330953 | DOCUMENT TAXONOMY GENERATION FROM TAG DATA USING USER GROUPINGS OF TAGS - Embodiments of the invention provide a novel and non-obvious method, system and computer program product for generating a document taxonomy based upon tag data in groupings of tags. In an embodiment of the invention, a method for generating a document taxonomy based upon tag data in groupings of tags has been claimed. The method includes retrieving into memory of a host computer different groupings of tags for correspondingly different documents providing a bottom-up view of the documents. The method further includes deriving a folksonomy from the groupings of tags for the documents and organizing the folksonomy into a hierarchy of nodes. Of note, each of the nodes can be associated with a different subject in the folksonomy. Finally, the method includes publishing the hierarchy of nodes as a taxonomy for the documents to provide a top-down view of the documents. | 2012-12-27 |
| 20120330954 | System And Method For Implementing A Scalable Data Storage Service - A system that implements a scalable data storage service may maintain tables in a non-relational data store on behalf of clients. The system may provide a Web services interface through which service requests are received, and an API usable to request that a table be created, deleted, or described; that an item be stored, retrieved, deleted, or its attributes modified; or that a table be queried (or scanned) with filtered items and/or their attributes returned. An asynchronous workflow may be invoked to create or delete a table. Items stored in tables may be partitioned and indexed using a simple or composite primary key. The system may not impose pre-defined limits on table size, and may employ a flexible schema. The service may provide a best-effort or committed throughput model. The system may automatically scale and/or re-partition tables in response to detecting workload changes, node failures, or other conditions or anomalies. | 2012-12-27 |
| 20120330955 | DOCUMENT SIMILARITY CALCULATION DEVICE - A document similarity calculation device, configured to calculate a similarity indicating a degree of how much a plurality of documents are similar, includes: an associative word group storage portion for storing an associative word group composed of words associated with one another, a word-in-document frequency matrix generation portion for generating a matrix of word frequency in document which is a matrix each element of which is the frequency of a word present in a document with respect to each combination of the word and the document, a word-in-document frequency matrix transformation portion for transforming the generated matrix of word frequency in document based on the stored associative word group so as to reduce the number of dimensions of the matrix of word frequency in document, and a similarity calculation portion for calculating the similarity based on the transformed matrix of word frequency in document. | 2012-12-27 |
| 20120330956 | SYSTEM AND METHOD FOR PRESENTING USER GENERATED GEO-LOCATED OBJECTS - A system and method for generating a virtual tour on a display device is described. The method comprises providing at least one map. The method further comprises providing a plurality of sequenced images, wherein each of the images is associated with at least one location by a geo-coding module configured to generate a geo-location object data sheet that associates sequential images with a corresponding location. The sequenced images are organized based on the location of each of the sequenced images and displayed on the map. The method is implemented by the system. | 2012-12-27 |
| 20120330957 | INFORMATION PROCESSING METHOD FOR DETERMINING WEIGHT OF EACH FEATURE IN SUBJECTIVE HIERARCHICAL CLUSTERING - An information processing apparatus determines a weight of each physical feature for hierarchical clustering by acquiring training data of multiple pieces of content in triplets with label information indicating a pair specified by a user as having a highest degree of similarity among three contents of the triplet and executing hierarchical clustering using a feature vector of each piece of content of the training data and the weight of each feature to determine the hierarchical structure of the training data. The information processing apparatus updates the weight of each feature so that the degree of agreement between a pair combined first as being the same clusters among three contents of the triplet in a determined hierarchical structure and a pair indicated by label information corresponding to the triplet increases. | 2012-12-27 |
| 20120330958 | Regularized Latent Semantic Indexing for Topic Modeling - Electronic documents are retrieved from a database and/or from a network of servers. The documents are topic modeled in accordance with a Regularized Latent Semantic Indexing approach. The Regularized Latent Semantic Indexing approach may allow an equation involving an approximation of a term-document matrix to be solved in parallel by multiple calculating units. The equation may include terms that are regularized via either l | 2012-12-27 |
| 20120330959 | Method and Apparatus for Assessing a Person's Security Risk - A method for assessing a person's security risk includes receiving data from a plurality of disparate data sources in which at least two of the plurality of disparate data sources maintain their respective data in different manners. The method also includes identifying at least one item of data from at least two different data sources that correspond to a first real-world person. The method further includes merging the items from the at least two different data sources into a first record associated with the first real-world person. The method additionally includes identifying one or more relationships between the first real-world person and one or more other real-world people. The method also includes adding the identified one or more relationships to the first record associated with the first real-world person. The method further includes determining a level of risk associated with the first real-world person based on the first record. | 2012-12-27 |
| 20120330960 | SYSTEMS AND METHODS FOR MAPPING A VALUE TO A NEW DOMAIN - Source values are mapped to new user-defined categories. The new user-defined categories are stored in a new user-defined field. In an embodiment, a user-selection of an existing field is received. Based on a data type of the existing field, a specific mapping interface is displayed. The interface guides the user through specification of the new field and categories, and identification of the source values to map to the new categories. | 2012-12-27 |
| 20120330961 | Method and Apparatus of Determining Product Category Information - A user may submit product title information to a server. The server may generate a phrase based on the product title information. The server may then search a database to find relevancies between the phrase and product categories corresponding to multiple nodes in a product category tree. Based on the relevancies, the server may select a node from the multiple nodes. The server may associate the product title information with the node corresponding to a product category when the node is a leaf node of the product category tree. | 2012-12-27 |
| 20120330962 | Method and Apparatus of Providing Suggested Terms - The present disclosure discloses a method of providing suggested terms. The method includes: receiving an initial query input from a user, and obtaining corresponding suggested queries based on the initial query; determining at least two categories corresponding to the suggested queries and at least two clickable regions usable for looking up the suggested queries; separately determining a category weight associated with each obtained category in each clickable region for the suggested queries, and a click attribute weight associated with each clickable region; computing a degree of confidence of each category for the suggested queries; and separately determining target categories for the suggested queries based on the degree of confidence of each category for the suggested queries. As such, the user may quickly identify his/her search intention based on the target categories corresponding to the suggested queries, thereby effectively improving the speed of information searching. | 2012-12-27 |
| 20120330963 | ANNOTATION SYSTEM FOR CREATING AND RETRIEVING MEDIA AND METHODS RELATING TO SAME - The invention described herein is generally directed to a method and apparatus for creating and retrieving audio data. In one implementation the invention comprises an annotation system configured to record, store, and retrieve media. The annotation system contains a set of client-processing devices configured to capture media for subsequent playback. Each client-processing device typically contains a record button to initiate the capture and is configured upon performing the capture operation to trigger an association of a unique ID with the media. The client-processing devices are further configured to upload the media and a unique ID to a server for purposes of storage. The server obtains the media and unique ID for subsequent retrieval and provides the media and the unique ID to at least one client-processing device from the set of client processing devices. | 2012-12-27 |
| 20120330964 | SMART INDEX CREATION AND RECONCILIATION IN AN INTERCONNECTED NETWORK OF SYSTEMS - A tool for using an interconnected network of systems to create an index for a database table. An index advisor on a primary server recommends one or more indexes to improve efficiency. While resources of the primary server are being used by various queries and processes, the primary server sends the recommendations to a secondary server (with available resources) so that the recommended indexes may be built in parallel with the processes executing on the primary server. The secondary server builds the recommended indexes based on its own copies of the database tables. The secondary server sends the built indexes to the primary server, where the primary server must reconcile the indexes with any changes that took place to the database tables subsequent to the replication of the tables on the secondary server. The primary server makes the associations between the new indexes and the tables they were built for. | 2012-12-27 |
| 20120330965 | METHOD AND APPARATUS FOR STORING AND SEARCHING FOR KEYWORD - A method for storing a keyword includes: performing a first Hash function operation and a second Hash function operation on the keyword to obtain an addresses of a first Hash bucket and an address of a second Hash bucket respectively; searching for the first Hash bucket and the second Hash bucket according to the address of the first Hash bucket and the address of the second Hash bucket; when the first Hash bucket has remaining space, storing the compressed keyword of the keyword and a pointer of the keyword into the first Hash bucket; and when the first Hash bucket has no remaining space, the second Hash bucket has remaining space, and no compressed keyword in the second Hash bucket conflicts with the compressed keyword of the keyword, storing the compressed keyword of the keyword and the pointer of the keyword into the second Hash bucket. | 2012-12-27 |
| 20120330966 | INTERFACE SYSTEMS AND METHODS FOR ACCESSING STORED DATA - A modular data and storage management system. The system includes a time variance interface that provides for storage into a storage media of data that is received over time. The time variance interface of the modular data and storage management system provides for retrieval, from the storage media, of an indication of the data corresponding to a user specified date. The retrieved indication of the data provides a user with an option to access specific information relative to the data, such as content of files that are included in the data. | 2012-12-27 |
| 20120330967 | Descriptor storage and searches of k-dimensional trees - Various arrangements for using a k-dimensional tree for a search are presented. A plurality of descriptors may be stored. Each of the plurality of descriptors stored is linked with a first number of stored dimensions. The search may be performed using the k-dimensional tree for one or more query descriptors that at least approximately match one or more of the plurality of descriptors linked with the first number of stored dimensions. The k-dimensional tree may be built using the plurality of descriptors wherein each of the plurality of descriptors is linked with a second number of dimensions when the k-dimensional tree is built. The second number of dimensions may be a greater number of dimensions than the first number of stored dimensions. | 2012-12-27 |
| 20120330968 | SYSTEM AND METHOD FOR MATCHING COMMENT DATA TO TEXT DATA - Methods and comment association systems for associating one or more comments with one or more primary electronic documents are described. In one aspect, the method comprises: identifying, at a comment association system, one or more key terms from at least a portion of the one or more primary electronic documents; identifying, at the comment association system, one or more comments associated with the identified key terms; determining, at the comment association system, whether an identified comment is sufficiently related to the one or more primary electronic documents by calculating one or more relation score for that identified comment and comparing the relation score to one or more threshold; and if the identified comment is sufficiently related to the one or more primary electronic documents, then associating the identified comment with the one or more primary electronic documents at the comment association system. | 2012-12-27 |
| 20120330969 | SYSTEMS AND METHODS FOR RANKING DOCUMENT CLUSTERS - Document cluster ranking systems and methods of ranking document clusters are described. In some example embodiments, the method comprises: obtaining, at a document cluster ranking system, a value associated with a first feature for each of a plurality of document clusters; based on the values associated with the first feature, automatically generating, at the document cluster ranking system, a plurality of first feature bins, each first feature bin defining a range of values and a bin identifier; and obtaining a score for one of the document clusters, by: i) identifying the first feature bin having a range of values which includes the obtained value associated with the first feature for that one of the document clusters; and ii) determining a score for that document cluster based on the first feature bin identifier for the identified first feature bin. | 2012-12-27 |
| 20120330970 | System and method for optimizing web searching and scheduling of service providers - A system for optimizing web searching and scheduling of service providers which has three main characteristics: a system and method for search optimization that automatically aggregates service providers and their services; checks, in real time, the availability information for the service providers; and proposes one or more optimized series of services for which there is availability. First, service providers and their services, including schedule are aggregated. Second the system checks, in real time, the availability information for the service providers. The availability is used as a criterion for the schedule optimization. Finally, the system proposes one or more optimized series of services for which there is availability, and that will take place in a given period of time. The optimization process aims at scheduling this succession of events under various constraints. An optimization algorithm assigns a score to each series of services that can thereby be ranked. | 2012-12-27 |
| 20120330971 | ITEMIZED RECEIPT EXTRACTION USING MACHINE LEARNING - A method, including retrieving a transaction receipt, wherein the transaction receipt includes unstructured data. Features indicating details of the transaction are extracted from the unstructured data, and using a receipt language model, weights are applied to the features. Based on the features and the weights, labels are associated with tokens in the receipt, and the receipt language model is updated with the extracted features, the applied weights and the associated labels. | 2012-12-27 |
| 20120330972 | DATA INGEST OPTIMIZATION - Methods and systems for optimizing the retrieval of data from multiple sources are described. A slot map including slots for the storage of data elements can be obtained. The data elements associated with the slots can be prioritized by weighting values with costs of retrieving the data elements from respective data sources. Each value can be associated with a different data element and can indicate a respective degree of importance of the associated data element. Further, the systems and methods can direct the retrieval of data elements from the respective data sources in an order in accordance with the priority of the data elements to optimize the quality of data obtainable within a critical time constraint. In addition, the retrieved data elements can be stored in corresponding slots on a storage medium. | 2012-12-27 |
| 20120330973 | SYSTEM AND METHOD FOR COLLECTING AND PROCESSING DATA - A system and method for collecting and processing data over a communications network. A data mining marshaller module associates each plugin to a particular data source and manages the plugin to periodically retrieve unstructured data from the data source based on a plurality of data items to be monitored on behalf of a plurality of users. The plugins convert unstructured data received from the data sources to structured data and the data marshaller module stores the structured data in a database. This enables the system and method to aggregate and display the structured data in multiple graphical representations according to the user's preference. | 2012-12-27 |
| 20120330974 | METHOD OF COMPOSING AN ONTOLOGY ALIGNMENT - A modular method of composing an ontology alignment provides a set of correspondences between at least two ontologies thereby allowing a composition of an optimal alignment by balancing a recall value and a precision of the alignment. A two-fold strategy is followed. By means of mapping functions a set of alignment correspondences is determined. Depending on a particular mapping function a recall value of the alignment can be improved by an extension of the set of correspondences. By filtering functions particularities of the domain are reflected and incorrect mappings are avoided. Depending on a particular filtering function a precision value of the alignment can be improved by restricting the set of correspondences. | 2012-12-27 |
| 20120330975 | SYSTEMS AND METHODS FOR CREATING AN INTEREST PROFILE FOR A USER - Profiling systems and methods of creating and using user interest profiles are described. In some example embodiments, the method includes: creating a topic set which includes topics which are organized in a hierarchical structure which includes a plurality of topic levels including an upper topic level and a lower topic level, each topic in the lower topic level being a subtopic of at least one of the topics in the upper topic level; monitoring interest in a plurality of documents for a user to identify one or more documents-of-interest to the user; and based on the monitored interest for the user, creating an interest profile for the user by determining a measure of topical interest for the user for at least one of the topics at the upper topic level and for a subtopic of that topic, the subtopic being at the lower topic level. | 2012-12-27 |
| 20120330976 | RELATIONSHIP INFORMATION EXPANSION APPARATUS, RELATIONSHIP INFORMATION EXPANSION METHOD, AND PROGRAM - A relationship information expansion apparatus capable of acquiring a new relationship based on a relationship information piece including two or more language expressions having a semantic relationship is provided. The relationship information expansion apparatus generates a candidate expanded relationship information piece in which at least one language expression included in the relationship information piece was replaced with a similar language expression, and acquires a score that indicates a probability that the candidate expanded relationship information piece has a semantic relationship. The relationship information expansion apparatus selects an expanded relationship information piece, which is a candidate expanded relationship information piece having a high score among candidate expanded relationship information pieces. | 2012-12-27 |
| 20120330977 | METHOD, COMPUTER SYSTEM, AND COMPUTER PROGRAM FOR SEARCHING DOCUMENT DATA USING SEARCH KEYWORD - Techniques provide for searching pieces of document data using a search keyword. The technique includes: calculating, as a first vector, respective first scores at which or respective probabilities that each of the pieces of document data belongs to clusters or classes; calculating, as a second vector, respective second scores at which or respective probabilities that the search keyword or a relevant keyword associated with the search keyword belongs to the clusters or the classes; calculating an inner product of each of the first vectors and the second vector, the calculated inner product being a third score of the corresponding piece of document data regarding the search keyword; and acquiring a correlation value from document data containing each keyword in a classification keyword set and document data with the third score that is equal to or more than a predetermined threshold or is included in a predetermined high-ranking proportion. | 2012-12-27 |
| 20120330978 | CONSISTENT PHRASE RELEVANCE MEASURES - Two methods for measuring keyword-document relevance are described. The methods receive a keyword and a document as input and output a probability value for the keyword. The first method is a similarity-based approach which uses techniques for measuring similarity between two short-text segments to measure relevance between the keyword and the document. The second method is a regression-based approach based on an assumption that if an out-of-document phrase (the keyword) is semantically similar to an in-document phrase, then relevance scores of the in and out-of document phrases should be close to each other. | 2012-12-27 |
| 20120330979 | SORTING A DATASET OF INCREMENTALLY RECEIVED DATA - A method of sorting a dataset includes incrementally receiving data from the dataset, and incrementally storing the received data as individual input data subsets as the data is received, thereby sequentially generating a plurality of filled data subsets of unsorted data. The method includes individually sorting each filled data subset of unsorted data concurrently with receiving data for a next one of the individual input data subsets, thereby sequentially generating a plurality of sorted input data subsets, and performing a merge sort on the plurality of sorted input data subsets, thereby incrementally generating a sorted version of the dataset. | 2012-12-27 |
| 20120330980 | Personalizing an Online Service Based on Data Collected for a User of a Computing Device - An Internet or other online service is personalized or customized based on data collected for a user of a computing device. In one embodiment, a method includes: storing a plurality of person profiles for persons associated with communications received by a user of a computing device; receiving data associated with an online service; and filtering, using at least one processor, the data based on the plurality of person profiles, wherein the filtered data is for display to the user on the computing device. | 2012-12-27 |
| 20120330981 | MECHANISM FOR ASSOCIATING EMAILS WITH FILTER LABELS - A mechanism is disclosed for generating a composite email for an email conversation. The composite email includes content automatically extracted from a plurality of the emails in the email conversation, and may be generated in response to a user accessing just one of the emails in the email conversation. A mechanism is also disclosed for discovering and recovering lost emails in an email conversation. A mechanism is further disclosed for automatically moving emails from one container to another after an email has been read. These and other advantageous email generating, manipulation, and organization mechanisms are disclosed herein. | 2012-12-27 |
| 20120330982 | Method and system for processing a search request - The invention relates to a method and system for processing a search request. A search request including a sequence of data strings and representing a plurality of search parameters is received. The strings are parsed and the search request is interpreted so as to define search parameters by recognizing items reflecting search criteria within the sequence of data strings. A query is built based on the result of the preceding process and at least one travel data service can be interrogated. This improves the search for information based on free-text input from the user. | 2012-12-27 |
| 20120330983 | DATA PROCESSING SYSTEM - An object of the present invention is to provide a data processing system which makes it possible to reflect data in a data aggregate of another party, with the mutual relational properties of the data preserved, in a case in which there has been a modification, addition, or the like in any of at least two data aggregates. The data processing system has a data acquisition part for acquiring data recorded in a second data aggregate and described by a designated descriptor; an object generator for generating an object on the basis of the acquired data; a reference relation processor for determining, based on internal attributes, a reference relation among objects in a case in which two or more objects are generated; a save processor for saving the generated objects in a first data aggregate; and a relation updater for extracting, based on the reference relation determined by the reference relation processor, the “ID” in the internal attributes of an object on the referenced side, and using the extracted “ID” to update the internal attributes showing the reference of an object on the reference side. | 2012-12-27 |
| 20120330984 | METHOD FOR PROCESSING A STRUCTURED DOCUMENT TO RENDER, AND CORRESPONDING PROCESSOR - The present invention concerns a method for processing a structured document to render, such as XML or HTML files. The method comprises the steps of: parsing the structured document into parsed tokens TK of structured data; constructing a first tree structure DTree storing the structured data of parsed tokens; constructing a render tree structure RTree storing the document content to render, said render tree structure being synchronized with the first tree structure; rendering the structured document based on the render tree structure RTree; wherein constructing the first tree structure DTree comprises deciding, for each parsed token TK, whether or not the parsed token is to be stored in said first tree structure, and storing the structured data of the parsed token therein only in case of positive decision. Partial first (DOM) tree DTree is therefore stored in memory, reducing memory use and processing time before rendering the structured document. | 2012-12-27 |
| 20120330985 | TECHNIQUES TO AUTOMATICALLY BUILD A LANGUAGE DEPENDENCY GRAPH FOR LOCALIZABLE RESOURCES - Techniques to automatically build a language dependency graph for localizable resources are described. A technique may include storing resources from a file in a translation database with data that indicates the language that the resource is in, the entity that created that version of the resource, and a dependency, if any, on a different language version of the resource. Subsequent translations of a resource may also be stored in the translation database in a manner that groups the translated version(s) of a resource to the original resource, and also stores the language of the resource, the entity that translated it, and the dependency to the language from which the resource was translated. A language dependency graph may be generated from the translation database for a file, where the graph reflects the languages of translation and dependency relationships among the translations. Other embodiments are described and claimed. | 2012-12-27 |
| 20120330986 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM - There is provided an information processing apparatus including an evaluation value calculating unit that acquires time-series data of a discrete system including sampling values x | 2012-12-27 |
| 20120330987 | CONTENT PROVIDING METHOD AND SYSTEM FOR TRANSMITTING METADATA EXTRACTED FROM CONTENT - Provided is a content providing method and system for extracting and transmitting metadata. When a user uploads a content file, metadata of content may be extracted from the content file. The extracted metadata of the content may be transmitted to a terminal of the user and the user may select content based on the metadata. The content selected using the uploaded content file may be provided to the user through downloading or streaming. | 2012-12-27 |
| 20120330988 | Systems And Methods For Performing Index Joins Using Auto Generative Queries - In accordance with the teachings described herein, systems and methods are provided for performing index joins. A database management application may receive an instruction to perform an index join operation between columns in a first table and a second table, wherein the database management application does not have direct access to an index of the first table or the second table for performing the index join operation. A query may be automatically generated by the database management application, wherein the query includes a where clause equality expression that equates an indexed column of the second table with a parameter or updatable constant. The database management application may substitute a value from a row of the first table may for the parameter or updatable constant, and cause the query to be executed on the index of the second table to fetch any one or more rows of the second table that satisfy the where clause by having an index value that matches the substituted value. The database management application may then repeat the substituting and executing operations for each row of the first table, and perform the index join operation using the fetched one or more rows. | 2012-12-27 |
| 20120330989 | DETECTING SOURCE LANGUAGES OF SEARCH QUERIES - Computer-implemented methods, systems, computer program products for automatic language-detection for search queries are described. A character-to-language mapping is stored on a client device. The client device can process each query character of a search query to determine a number of candidate “language-writing system” pairs in which the query character can exist according to the character-to-language mapping. A respective sub-score can be generated for each candidate “language-writing system” pair in the context of each query character that is associated with the candidate “language-writing system” pair. A final score can be calculated for each candidate “language-writing system” pair by aggregating all the sub-scores that have been generated for the candidate “language-writing system” pair. A source language of the search query can be determined based on the respective final scores of all the candidate “language-writing system” pairs identified for the search query. | 2012-12-27 |
| 20120330990 | EVALUATING QUERY TRANSLATIONS FOR CROSS-LANGUAGE QUERY SUGGESTION - Computer-implemented methods, systems, computer program products for generating cross-language query suggestions are described. For each query suggestion written in a first natural language, candidate segmentations are generated from the query suggestion, and candidate translations are generated from each candidate segmentation. The candidate translations are evaluated based on a measure of segmentation quality associated with the respective candidate segmentation from which each candidate translation is derived, and a frequency of occurrence of the candidate translation in a target language query log. The measure of segmentation quality associated with each candidate segmentation is further based on a frequency of occurrence of the candidate segmentation in a source language query log. A candidate translation is provided as a cross-language query suggestion for the primary language query suggestion based on the result of the evaluation. | 2012-12-27 |
| 20120330991 | Context- And Version-Aware Facade For Database Queries - A method, computer program product, and system for accessing versioned data objects within a database, comprising creating a first new connection to a database stored in a memory, receiving a first query from a first client that requests access to a versioned data object stored in the database, and modifying the received first query to add contextual information configured on the first new connection, so that the modified first query is able to retrieve a first version of the versioned data object that corresponds to the contextual information. | 2012-12-27 |
| 20120330992 | Recommendation Systems And Methods Using Interest Correlation - A search technology generates recommendations with minimal user data and participation, and provides better interpretation of user data, such as popularity, thus obtaining breadth and quality in recommendations. It is sensitive to the semantic content of natural language terms and lets users briefly describe the intended recipient (i.e., interests, eccentricities, previously successful gifts). Based on that input, the recommendation software system and method determines the meaning of the entered terms and creatively discover connections to gift recommendations from the vast array of possibilities. The user may then make a selection from these recommendations. The search/recommendation engine allows the user to find gifts through connections that are not limited to previously available information on the Internet. Thus, interests can be connected to buying behavior by relating terms to respective items. | 2012-12-27 |
| 20120330993 | CONTACT RECOMMENDATION SYSTEM FOR A USER COMMUNICATION - Techniques are described for allowing a first user to efficiently send contact information to a second user using a user communication of a messaging application such as email programs, instant messaging programs, social media websites, or chat rooms. The messaging application may maintain a name database that stores names that are relevant to a first user. When the first user then types or speaks a name into a user communication (e.g., an email, instant message, or voice message), the messaging application provides the first user with the names stored in the name database that match the name in the user communication. Additionally, the messaging application may use ranking data associated with each matched name to order the names according to relevance. The first user can then select the correct name (if there are multiple matched names) which prompts the messaging application to automatically send contact information to the intended recipient of the user communication either within the current user communication or in a separate communication. In this manner, the first user is able to efficiently send contact information of relevant names to a recipient. The recipient may then use the contact information to communicate with the suggested contact. | 2012-12-27 |
| 20120330994 | Systems and Methods for Inter-Object Pattern Matching - Systems and methods are disclosed for identifying objects from a collection of objects of diverse types that match a pattern. In one implementation, a system includes a processor and a memory. The memory stores instructions that cause the processor to receive a pattern input text identifying the pattern to be matched. The pattern input text comprises one or more conditions and a match statement. The processor also receives a collection of objects of diverse types, where each object comprises at least an attribute and a value associated with the attribute. The processor analyzes each object to determine whether the object satisfies the match statement based on an application of the one or more conditions to the attributes and attribute values for the object. If the processor determines that the object satisfies the match statement, the processor creates an output comprising an indication of the object and the conditions that caused the match statement to be satisfied. | 2012-12-27 |
| 20120330995 | METHODS AND SYSTEMS TO FACILITATE PROVIDING SPREADSHEET AND DATABASE DATA TO USERS VIA A SOCIAL NETWORK - A spreadsheet application platform facilitates accessing a spreadsheet stored using a spreadsheet database at a server computer. The spreadsheet application platform includes a computer-implemented social network, and a publisher may use the social network to publish a spreadsheet so that other users of the social network may subscribe to and access the spreadsheet's data. Further, a subscribed user may generate other spreadsheets that reference the publisher's spreadsheet via the application platform. When a stored value for a cell of the publisher's spreadsheet is updated at the spreadsheet database, the application platform may generate update requests for one or more target spreadsheet cells that reference the updated cell. An update request may indicate that a target cell is to be updated, and the application platform may process a plurality of update requests in parallel to update the stored values for a corresponding plurality of spreadsheet cells. | 2012-12-27 |
| 20120330996 | MULTI-GRANULARITY HIERARCHICAL AGGREGATE SELECTION BASED ON UPDATE, STORAGE AND RESPONSE CONSTRAINTS - Techniques are disclosed for multi-granularity hierarchical aggregate selection based on update, storage and response constraints. For example, for a temporal hierarchy of aggregation statistics associated with a plurality of database records, wherein the temporal hierarchy comprises two or more aggregation statistics levels and each level has a different temporal granularity associated therewith, a method comprises iteratively modifying the temporal hierarchy to at least one of: (a) minimize a storage usage cost while satisfying a temporal hierarchy update constraint and a query response time constraint; (b) reduce a temporal hierarchy update time and a query response time while satisfying a storage usage constraint; and (c) minimize a query response time for frequently applied queries that do not shift in time while satisfying the storage usage constraint, wherein the resulting temporal hierarchy that achieves at least one of (a), (b) and (c) is identified as an optimal temporal hierarchy. | 2012-12-27 |
| 20120330997 | EXPRESSION EVALUATION OVER MULTIPLE DATA MODELS - Embodiments of the present invention provide a method, system and computer program product for expression evaluation of content instances of multiple different data models. In an embodiment of the invention, a method for expression evaluation of content instances over multiple different data models comprises loading a schema for a content instance in memory of a computer and evaluating an expression against the content instance. In response to a failure during the evaluation of the expression against the content instance to resolve a reference to an element specified by the expression, an alias reference for the element can be identified in the schema and the evaluation can be completed using the alias reference in lieu of the specified reference. | 2012-12-27 |
| 20120330998 | SYSTEM, A METHOD AND A COMPUTER PROGRAM PRODUCT FOR COMMUNICATION - A system for communication, the system including: (a) an interface configured to receive detection information indicative of a detection of a portable identification object in a vicinity of a detector that is located in a physical site that includes multiple transaction generating entities; (b) a content manager configured to selectively retrieve from a database content of at least one of the transaction generating entities, based on client preferences of a client account that is associated with the portable identification object; (c) a messages integration module configured to generate a message based on at least part of the retrieved content; and (d) a transmitter configured to transmit the message to a portable computer associated with the client account. | 2012-12-27 |
| 20120330999 | SYSTEMS AND METHODS FOR PROVIDING INTERACTIVE ASSISTANCE ON PURCHASE DECISION-MAKING - Systems and methods for providing interactive assistance on purchase decision-making are provided. These systems and methods are preferably adapted to enable a purchase decision to be made by preferably interactively assisting the purchase decision-making process until a final purchase selection is made or indicated. | 2012-12-27 |
| 20120331000 | STREAMING TRANSACTION NOTIFICATIONS - Methods and systems are provided for identifying data transactions satisfying a streaming query and providing data corresponding to those data transactions to subscribed client devices. One exemplary method involves a server initiating a data transaction for a database entry in a database in response to input data received from a client device, determining whether the data transaction satisfies a streaming query, and indicating an association between the database entry and the streaming query when the data transaction satisfies the streaming query. | 2012-12-27 |
| 20120331001 | System and Method for Providing a Routing Service in Distributed Computing Environment - A system for providing a routing service that enables a client to locate a target service in distributed computing environment that supports multiple communications protocols. The system includes a main database and a routing mechanism. The main database has routing information. The routing mechanism can be distributed in multiple instances. The routing mechanism includes a local database. The local database stores an extract of the main database. The routing mechanism uses the local database to make routing decisions. To locate the target service, the client first obtains a reference to the routing mechanism. The client then sends a request with input parameters to the routing mechanism. The routing mechanism then returns output parameters to the client. The output parameters contains a reference and/or associated properties of the target service depending on the type of the target service. The client analyzes the returned output parameters and locates the target service. | 2012-12-27 |
| 20120331002 | METHOD AND SYSTEM FOR RETRIEVING AND SERVING REGULATORY HISTORY FOR A PROPERTY - Described is a method and system for retrieving and serving the regulatory history of a property. An identification of data sources for permits and approvals is stored in a computer system. Property identifiers from the data sources are stored in the computer system. The system identifies the types of permit and approval data available from each of the data sources for each of the property identifiers. A determination can be made of the completeness of the regulatory history available for each property associated with each of said property identifiers. The system receives a request for the regulatory history of at least one of the properties associated with the property identifiers. A web page is populated with a list of the regulatory history for the property. | 2012-12-27 |
| 20120331003 | EFFICIENT PASSAGE RETRIEVAL USING DOCUMENT METADATA - A system, method and computer program product for efficiently retrieving relevant passages to questions based on a corpus of data. A processor device receives an input query and performs a query analysis to obtain searchable query terms. The processor performs: matching metadata associated with one or more documents against the query terms. The document metadata includes one or more of: a title of the documents, one or more user tags or clouds. Then the processor device performs: mapping matched document metadata to corresponding one or more documents; identifying corresponding matched documents to form a subcorpus of documents; and conducting a search in the data subcorpus using the searchable query terms to obtain one or more passages relevant input query from the identified documents. | 2012-12-27 |
| 20120331004 | ASSET MANAGING APPARATUS AND ASSET MANAGING METHOD - A search extent setting unit that identify a layer made to correspond to an asset specified by referencing a first database for recording assets made to correspond to each of users by relating each of the assets to a first layer that is a layer related to a virtual system individually used by each of the users, or to a second layer that is a layer related to hardware and software, and to set an extent for extracting information about other assets having a relationship with the specified asset according to a layer of the specified asset, and an extracting unit that extract other assets that have a relationship with the specified asset and are present in the extent set by referencing the first database and a second database for recording information indicating a relationship among the assets, and the first database based on the first asset. | 2012-12-27 |
| 20120331005 | METHOD AND APPARATUS FOR STORING, SHARING, AND/OR ORGANIZING PERSONAL INFORMATION - Embodiments of the subject invention relate to systems and methods for presenting and managing user information. Specific embodiments allow creating, editing, presenting, and storing user information. In a more specific embodiment, the systems and methods can be used to provide a digital safe deposit box (DSDB) that allows users to save, maintain, update, and/or share information about themselves and/or their organization. Specific embodiments provide a personal financial solution that is designed for customers interacting with professional institutions, such as accounting firms, banks, and insurance agencies, and/or interacting with family members and people that may need to access certain documents. Embodiments of the invention provide individuals, based on permission granted/allocated to them, access to specific information, while providing safety from fraud. | 2012-12-27 |
| 20120331006 | DATA ACCESS METHOD AND DATA ACCESS DEVICE - An information processing apparatus has data management data that determines storage locations of real data in a data group in accordance with data definition information indicating a data structure of the data group, and a data access program that describes an access function to the real data whose data structure is specified in accordance with the data definition information, and gains access to the real data of the data group by executing the data access program while determining the storage locations of the real data by referring to the data management data. | 2012-12-27 |
| 20120331007 | Anchored Patterns - A method and apparatus relate to recognizing anchored patterns from an input stream. Patterns from a plurality of given patterns are marked as anchored patterns. An anchored state tree for the anchored patterns of the plurality of given patterns is built, including nodes representing a state of the anchored state tree. For each node of the anchored state tree, a failure value equivalent to a node representing a state in an unanchored state tree representing unanchored patterns of the plurality of given patterns is determined. | 2012-12-27 |
| 20120331008 | SAMPLING THE SPACE OF ANCESTRAL RECOMBINATION GRAPHS - A method is provided for constructing an ancestral recombination graph. A value K is received representing K extant units. M non-mixing segments are also received. K vertices V are generated. K lineages for each of M trees are associated with each of the K vertices. An ancestral recombination graph is constructed. To construct the ancestral recombination graph, there is repeated, until only one lineage survives for each of the M trees, a process that includes the following. A tree is randomly selected tree. A first vertex v | 2012-12-27 |
| 20120331009 | MAP EDITING WITH LITTLE USER INPUT - A semi-automatic map editor may allow a user to add features to a map with a minimum of effort. In one example, a user may add a road to a map by indicating where the endpoints of the road are. A system may then attempt to fill in the path of the road using the user-provided endpoints, an analysis of an aerial or satellite photograph, existing maps that show the road, or any other appropriate information. Using this information, the system may display a proposed path for the road between the endpoints that the user has indicated. The user may then fine tune and/or confirm the proposed path, thereby adding the road to the map. In addition to roads, other feature such as bodies of water, ski trails, etc., may be added in this manner. | 2012-12-27 |
| 20120331010 | Systems And Methods For Performing A Query On A Distributed Database - Systems and methods are provided for performing a query in a distributed system. In one example, a query processor receives an instruction to perform a database operation involving a query. Based on an identification of a correlated subquery within the query, the query processor modifies the correlated subquery by replacing at least one correlated variable with a parameter or updatable constant. The modified subquery is sent to an external database for execution, where the external database is identified in the correlated subquery. The results of the modified subquery are received at the query processor from the external database and are used to execute the query. The correlated subquery includes a conditional relationship between a column in a first set of data and a column in a second set of data, wherein the first and second sets of data are stored in different external databases. | 2012-12-27 |
| 20120331011 | SYSTEM AND METHODS THEREOF FOR GENERATION OF SEARCHABLE STRUCTURES RESPECTIVE OF MULTIMEDIA DATA CONTENT - A method for creating a multimedia data search engine platform to allow fast search of multimedia content data elements (MMDEs). The method comprises collecting MMDEs from at least an external source storing MMDEs; generating a plurality of signatures for each of the collected MMDEs; generating signature reduced clusters (SRCs) for the collected MMDEs by clustering the plurality of signatures generated for each of the collected MMDEs; and generating concept structures from the generated SRCs, wherein the concept structures generated for different SRCs are utilized to compare between different MMDEs, thereby searching for an input MMDE that matches the collected MMDEs. | 2012-12-27 |
