48th week of 2011 patent applcation highlights part 62 |
Patent application number | Title | Published |
20110295745 | SYSTEMS AND METHODS FOR APPENDING SUPPLEMENTAL PAYMENT DATA TO A TRANSACTION MESSAGE - A managing platform for appending supplemental payment data to a transaction message receives a transaction message representative of a credit card transaction from a merchant or an associated financial institution. The managing platform uses the transaction data contained in the transaction message and other information to determine whether the transaction satisfies one or more payment rules previously established by the cardholder. If the transaction satisfies a payment rule, the managing platform appends supplemental payment data to the transaction message in a format specified by a financial institution associated with the cardholder. The supplemental payment data includes information identifying a secondary payment account associated with the satisfied payment rule. The managing platform subsequently transmits the appended transaction message to the financial institution associated with the cardholder. | 2011-12-01 |
20110295746 | PAYMENT IDENTIFICATION CODE AND PAYMENT SYSTEM USING THE SAME - A method comprises receiving a payment instruction including a payment system routing number and a unique code associated with a payee, and employing the routing number to determine whether it includes routing information for a specific financial institution. If so, then the payment instruction is transmitted based on the routing number. The transmitted payment instruction includes the unique code associated with the payee. If the routing number is determined to not include routing information for a specific financial institution, then account identification information of the payee and a first system routing number are retrieved based on the unique code, and the unique code included in the payment instruction is replaced with the retrieved account identification information, and the routing number is replaced with the retrieved first system routing number. The payment instruction with the account identification information is transmitted to the payee and/or a financial institution associated with the payee. | 2011-12-01 |
20110295747 | SYSTEM FOR REMOTELY MANAGING AN ONGOING FINANCIAL TRANSACTION - The system for remotely managing an ongoing financial transaction providing the necessary comfort and speed for the customer, enabling a reactive or passive operations action from a registered remote customer, the customer requested to authorize or refuse a financial transaction request being processed. | 2011-12-01 |
20110295748 | DIGITAL CREDIT CARD - A digital credit card for transactional processes and a method of using the same, where said credit card comprises: a memory for storing data; a processor, where said processor executes functions related to the credit card: an input; an output; and a biometric security, where said biometric security activates the credit card. The memory may include read only memory and random access memory. The biometric security may include fingerprint identification, iris identification or retina identification. | 2011-12-01 |
20110295749 | SYSTEMS AND METHODS FOR FUNDRAISING VIA MOBILE APPLICATIONS - The present application is directed to methods and systems of facilitating a transfer of donation money from individuals to charitable organizations. The transfer of money occurs through a first transfer of money from at least one mobile phone carrier to a facilitating organization and through a second transfer of money from the facilitating organization to the charitable organization. The facilitating organization enables the money transfer by transmitting web-based and mobile phone communications regarding donations on behalf of charitable organizations and enabling individuals to respond to such communications and communicate donation solicitations to other individuals. | 2011-12-01 |
20110295750 | SECURE PAYMENT AND BILLING METHOD USING MOBILE PHONE NUMBER OR ACCOUNT - A system, method and computer program product for processing payments for goods or services, including a payment processor that receives a payment request from a merchant for goods or services and that includes a mobile phone number or mobile phone account of a user, sends a payment authorization request text message to the mobile phone requesting payment authorization, and receives a payment authorization text message from the mobile phone authorizing or not authorizing the payment. If the payment is authorized, the payment processor pays the merchant and charges the mobile phone account for the payment. If the payment is not authorized or if the payment is not received within a predetermined period of time, the payment processor declines to pay the merchant for the goods or services. | 2011-12-01 |
20110295751 | System and method for subsidized internet access through preferred partners - Provided are systems and methods for execution by a processor of a proxy server to provide a subsidized access to a network supported by a plurality of preferred partners. One method comprises receiving a first request from a client to access a first server on the network, forwarding the first request to a second server on the network such that the second server sends first content data over the network for rendering on a display of the client, recording the first request in a traffic log, and submitting the traffic log for reimbursement to at least one of the plurality of preferred partners affiliated with the second server to subsidize a cost of providing access to the network. By obtaining reimbursement for prioritizing and redirecting access to preferred sites, client connection costs can be fully or partially subsidized in light of additional revenue streams from increased user traffic. | 2011-12-01 |
20110295752 | PRACTICAL SECRECY-PRESERVING, VERIFIABLY CORRECT AND TRUSTWORTHY AUCTIONS - A system and method for conducting verifiably correct auctions that preserves the secrecy of the bids while providing for verifiable correctness and trustworthiness of the auction is disclosed. Some of the elements of the method and apparatus are that the auction operator accepts all bids submitted and follows the published rules of the auction. In one embodiment, the bids are maintained secret from the auctioneer and all bidders until the auction closes and no bidder is able to change or repudiate her bid. In another embodiment, the auction operator computes the auction results and publishes proofs of the results' correctness. In yet another embodiment, any party can check these proofs of correctness via publicly verifiable to computations on encrypted bids. | 2011-12-01 |
20110295753 | PIN PROTECTION FOR PORTABLE PAYMENT DEVICES - A method and system of encrypting a Personal Identification Number (PIN) using a portable payment device includes a portable payment device in communication with a network and a payment processor, and may be configured to receive a first encryption key from the payment processor, to receive a PIN, to encrypt the PIN using the first key, and to provide the encrypted PIN to the payment processor in a form useable to process a payment authorization message or transaction request. The first key may be protected by cryptographic camouflaging using a password. The password may be received by the device and used to decamouflage the first key, and the decamouflaged first key may be used to encrypt the PIN. In one configuration, the first key may be a symmetric key, such that a PIN encrypted by the first key may be of a standard format usable in existing payment systems. | 2011-12-01 |
20110295754 | Prioritization for product management - Systems and methods of prioritizing requirements for product release are disclosed. An exemplary method comprises receiving customer satisfaction requirements for a pending product release. The method also comprises receiving product manager input for the pending product release to meet a release schedule on time and on budget. The method also comprises receiving developer business requirements for the product release to balance the business desires of the developer. The method also comprises processing the received customer satisfaction requirements, product manager input, and developer business requirements for the pending product release to prioritize requirements and increase or maximize value for the customer and the developer and increase overall satisfaction with when the product is released. | 2011-12-01 |
20110295755 | FLEXIBLE EXTENDED PRODUCT WARRANTIES - A system and method for determining the optimum price that a service provider should charge to customers of a periodic extended-product warranty to optimize profits generated from providing such warranties. In one aspect of the present invention the customer is allowed to elect or to cancel warranty coverage on a monthly basis which election is based in part on the customer's expected net utility from his coverage decisions. In one embodiment, the customer can be afforded complete warranty coverage flexibility in terms of his ability to turn coverage on and off whenever desired. In another aspect of the present invention the customer can be allowed to make dynamic repair or replacement decisions in each period based on the product's failure status or on other criteria. By properly modeling optimal extended-product warranty strategies from the perspective of both the customer and from the perspective of the service provider, one can compute the customers' maximum expected discounted net utility and the service provider's expected discounted profit from strategic customers. | 2011-12-01 |
20110295756 | FLEXIBLE EXTENDED PRODUCT WARRANTIES HAVING PARTIALLY REFUNDABLE PREMIUMS - A system and method for determining the optimum price that a service provider should charge to customers of at least a partially refundable extended-product warranty to optimize profits generated from providing such warranties. In one aspect of the present invention the customer may elect to purchase warranty coverage when the product is new and cancel warranty coverage at any time thereafter, which election is based in part on the customer's expected discounted net utility from his coverage decisions. In another aspect of the present invention, the customer is allowed to make dynamic repair or replacement decisions in each period based on the product's failure status or on other criteria. In one embodiment, the customer can be afforded warranty coverage flexibility in terms of his ability to turn coverage off whenever desired and to obtain a partial refund of the warranty premium. By properly modeling extended-product warranty strategies from the perspective of the customer and from the perspective of the service provider, one can compute the customers' expected discounted net utility and the provider's expected discounted profit from strategic customers. In another aspect of the present invention a computer-based service is provided to the customer of the extended-product warranty for determining the customer's optimal dynamic decisions to maximize the customer's expected discounted net utility when making product replacement decisions, maintenance decisions, and warranty coverage decisions. | 2011-12-01 |
20110295757 | INTELLECTUAL PROPERTY TRADING EXCHANGE - A computerized intellectual property trading exchange is disclosed for facilitating the trading of license contracts relating to intellectual property rights or pools of intellectual property rights. The exchange includes at least one intellectual property license contract relating to intellectual property rights or pools of intellectual property rights and a computer-accessible forum configured to allow a plurality of participants to trade the license contract. The plurality of participants includes at least one seller, which may be the owner, having the license contract and desiring to trade the license contract. The plurality of participants also includes at least one buyer desiring to obtain the license contract. The buyer may be an investor, speculator, market maker, or arbitrageur, who purchases the license contract to achieve appreciation. The buyer also may be a licensee, who purchases the license contract to practice the intellectual property rights. | 2011-12-01 |
20110295758 | Neighborhood Networking: Building more prosperous Neighborhoods; methods of defining"Neighborhoods and Moderator" - Neighborhood Networking: Building More Prosperous Neighborhoods wishes to give notice to the nature of the technical disclosures of our invention pertaining to the method of defining “Neighborhood” and “Moderator”. We have discovered through our plan of operation for Neighborhood Networking, that when a “Neighborhood” is made up of only those homes that exist within their own tract as per county records, and does not include any homes within “other” tracts, it creates a group of homes with the most similar characteristics and commonalities. Additionally, we discovered that by implementing a dedicated “Moderator” per “Neighborhood” utilizing the Neighborhood Networking model plan of action, versus several people, the goal of “Building More Prosperous Neighborhoods within Neighborhood Networking, are much more easily accomplished. This is a very simple discovery, one which is obvious, however is not being utilized by any other neighborhood networking or neighborhood community groups. | 2011-12-01 |
20110295759 | METHOD AND SYSTEM FOR MULTI-SOURCE TALENT INFORMATION ACQUISITION, EVALUATION AND CLUSTER REPRESENTATION OF CANDIDATES - Embodiments of the invention relate to a system, method and apparatus for performing a multi-source talent acquisition. The method includes entering search criteria; selecting at least one source from a plurality of sources; executing a search using at least the search criteria and the at least one source; identifying at least one talent match; and displaying the at least one talent match. | 2011-12-01 |
20110295760 | BENEFITS ENROLMENT IN AN ENTERPRISE - Simplifying benefits enrollment in an organization using an enterprise software. A benefits administrator configures plan instances as groups, and the user interface for (enrolling) end users is controlled according to the configuration. The plan instances are displayed as the configured groups, while the user navigates the displayed information to select the specific plans of interest in each displayed group. In an embodiment, each group is presented as a stop in a train, such that the user is forced navigate only successive groups in the train sequence. | 2011-12-01 |
20110295761 | BUSINESS FORM MANAGEMENT SYSTEM, METHOD AND PROGRAM - According to one embodiment, a server has a first storage, a second storage, a built-in business form modification part, download execution part, and search part. The download execution part transmits the objective business form and the business form generation program stored in the first and second storage to a user terminal. The search part searches for the plant data in response to a request from the user terminal and transmits the data to the terminal. The business form generation program includes a business form definition program and a data expansion program. The business form definition program sets search conditions of plant data in the objective business form. The data expansion program requests the server to search for the plant data that satisfies the search conditions in the objective business form and outputs the plant data to the objective business form. The user terminal has an objective business form editing part and a business form generation part. The objective business form editing part edits an objective business form transmitted from the download execution part. The business form generation part executes the business form generation program to output the plant data to the edited objective business form. | 2011-12-01 |
20110295762 | Predictive performance of collaborative filtering model - For each first entity of a subset of a number of first entities, an expected improvement of a predictive performance of a collaborative filtering model if additional ratings of the first entity in relation to a plurality of second entities were obtained is estimated. Particular first entities from the subset of the first entities of which to obtain the additional ratings in relation to the second entities are selected based at least on the expected improvements that have been determined. The additional ratings of the particular first entities in relation to the second entities are obtained. | 2011-12-01 |
20110295763 | MULTI-ATTRIBUTE SYSTEM FOR PROJECT PLANNING - A method of planning a project includes receiving project requirements for a project to be planned and assigning scores to the project requirements based on user preferences associated with the attributes of the requirements. The method further includes generating a numerical model of the project based on the scored requirements and optimizing the score of the numerical model to generate a matching solution that matches the project requirements to vendor offerings. | 2011-12-01 |
20110295764 | GENERATING A LAYOUT OF PRODUCTS - Generating a product layout includes obtaining attributes of a retail location; correlating the attributes of the retail location to information relating to a product in order to determine whether the product is appropriate for the retail location; and if the product is appropriate for the retail location, generating a layout of the product within the retail location relative to like products according to one or more predefined rules. | 2011-12-01 |
20110295765 | Variable Annuity Product Management Method and System - A computer-implemented method for providing and managing a variable annuity product capable of investing in exchange-traded funds, including: receiving, on a server computer, a request to allocate an amount of annuity assets comprising tax-deferred or tax-advantaged assets into at least one subaccount corresponding to a specified exchange-traded fund; allocating the amount of annuity funds into at least one subaccount; and initiating the purchase of at least one share of an exchange-traded fund relating to at least a portion of at least one unit of the at least one subaccount. A system and a computer program product for implementing the aforementioned method includes appropriately communicatively connected hardware components. Also disclosed is a computer-implemented method for reducing risk in a variable annuity product as well as a system and a computer program product for implementing the method which includes appropriately communicatively connected hardware components. | 2011-12-01 |
20110295766 | ADAPTIVE CLOSED LOOP INVESTMENT DECISION ENGINE - An adaptive closed loop decision engine outputs actionable alerts regarding asset holdings and allocations to reduce investment volatility and improve returns over market and sector cycles without unnecessary trading activity. The decision engine performs a statistical analysis on pricing trends that generates threshold decision points for investing in or avoiding assets and for determining asset allocation weightings within a portfolio. The engine operates in a way that yields higher returns, dramatically reduces maximum drawdown and lower volatility over market cycles. It identifies conditional probabilities, when they exist, to establish decision parameters that are applied to individual investment vehicles or, to portfolios of investments. If asset pricing were a purely random event, then no conditional probability advantage would exist to yield a statistical benefit. However, historical data and empirical evidence indicate that for broad market indices and many investable assets (e.g., funds and ETFs) pricing variability deviates from a purely random (Gaussian) nature. Specifically, some trends have a higher probability of continuing for some period of time. Furthermore, these conditional relationships can be detected and used to establish decision parameters that can improve asset returns and lower volatility over single and multiple market corrections. Any conditional relationship that has existed in the past may not continue into the future and this invention is able to detect if those relationships are changing and adapt to those changes. The recent market turbulence has highlighted the need to have a well-developed statistical model of the market and an adaptive tool to deal objectively with such volatile situations. | 2011-12-01 |
20110295767 | INVERSE SOLUTION FOR STRUCTURED FINANCE - A method, system, and computer program for solving the inverse problem through an iterative process whereby each iterative effectively solves one forward problem without having to sample the entire non-linear space. The method is a selective and iterative process for optimizing many variables that substantially achieves a global optimum solution. One particular process utilizes a neo-Darwinism method. Under this method, the sample space is iteratively analyzed via “mutations” to the value of the variable involved. Starting from a basic structure that is assumed sub-optimal, small variations or mutations are applied to each variable in turn, and those that are determined to improve the outcome value are kept. A better outcome value is determined to exist when a set of ratings is closer to the required set. Because the average rating is an invariant, the variable space is operated on throughout the process of looking for the combination of factors that will lead to the better outcome value. | 2011-12-01 |
20110295768 | Using Commercial Share of Wallet in Private Equity Investments - Commercial size of spending wallet (“CSoSW”) is the total business spend of a business including cash but excluding bartered items. Commercial share of wallet (“CSoW”) is the portion of the spending wallet that is captured by a particular financial company. A modeling approach utilizes various data sources to provide outputs that describe a company's spend capacity. Private equity firms and other investors of small businesses can use the CSoW/CSoSW modeling approach to more accurately evaluate small and privately held companies, both during investment and for evaluating prospective investments. Over-the-counter securities trading systems can also use this modeling approach to provide more accurate information and/or rankings of listed companies to their customers. | 2011-12-01 |
20110295769 | SYSTEM AND METHOD FOR DIMENSIONAL RATING OF A MAILPIECE - A mailing machine for the creation of mailpieces includes a print station and a transport system for passing a length of the label material through the print station to receive information on a face surface of the label material. A processor is adapted to store rating information based upon the weight and dimensions of the mailpiece and is operatively coupled to, and controls, the print station and transport system. In a first operating mode, the processor prints rating information on a length of label material, and in a second operating mode, the processor prints postage indicia on the face surface of the label material based upon the rating information for subsequent application to a mailpiece. In the second operating mode, the postage indicia may optionally be printed on the label material or directly on the face surface of the mailpiece envelope. | 2011-12-01 |
20110295770 | Solve-A-Crisis - To reduce a chunk of the 2.3 trillion a year healthcare cost in the U.S. Solve-A-Crisis is a floating vessel/ship/very large floating platform equipped with a fully functional hospital (which is run by a contracted JCI accredited hospital) standing in international waters, which is also a preferred surgical hospital by the U.S. insurance companies. Surgeries/Procedures performed at Solve-A-Crisis will be at the rates of non U.S. international JCI accredited hospitals but will be paid for by the U.S. insurance companies. Surgeries outside the United States typically cost at around 20-50% of those performed in the U.S. Out of the 50-80% money saved in getting surgery on board the ship, the patient will receive a bonus check of a percentage ranging from 10-50% of the cost difference. That way the total healthcare bill comes down to about 50-70%. Saving the U.S. trillions every year. | 2011-12-01 |
20110295771 | Method of Distributing A Viscosity Reducing Solvent To A Set of Wells - Described are methods of distributing a viscosity reducing solvent to a set of wells terminating in an underground oil reservoir where the variation in the net solvent injection rate is minimized. The net solvent injection rate is the difference between the total solvent injection rate and the total solvent production rate from the set of wells, for example on an instantaneous or daily rate basis. Minimizing this variation can reduce costs associated with surface solvent storage, subsurface solvent storage, and solvent supply, since solvent supply often is least expensive when supplied at near a fixed rate. One option is to operate well pairs and to inject solvent into one well of the pair while producing oil and solvent from the other well of the pair. These methods are particularly useful in solvent-dominated, cyclic or non-cyclic, viscous oil recovery processes. | 2011-12-01 |
20110295772 | Systems and Methods for Developing and Optimizing Underutilized Real Property - The present application is directed to methods for converting underutilized real property at existing land and improvements into energy producing property. An exemplary method comprises bifurcating energy production and management rights associated with the underutilized real property from the existing land and improvements. | 2011-12-01 |
20110295773 | ASSISTED CLUSTERING - Assisted clustering systems and methods are described herein that provide a user interface by which a user can easily create clusters and selectively associate data items with such clusters. Information regarding data item-cluster associations made by the user is processed by a recommendation engine to learn a clustering model. The clustering model is then be used to generate recommendations for the user regarding which unassociated data items should be associated with which clusters. In certain embodiments, after the user has determined that the clustering model is performing at a satisfactory level based on the quality of the recommendations, the user can cause the system to automatically cluster a large quantity of remaining unassociated data items. In accordance with further embodiments, a user can specify arbitrary data item types for clustering as well as features of such data types that should be considered in generating the clustering model. | 2011-12-01 |
20110295774 | Training SVMs with Parallelized Stochastic Gradient Descent - Techniques for training a non-linear support vector machine utilizing a stochastic gradient descent algorithm are provided. The computations of the stochastic gradient descent algorithm are parallelized via a number of processors. Calculations of the stochastic gradient descent algorithm on a particular processor may be combined according to a packing strategy before communicating the results of the calculations with the other processors. | 2011-12-01 |
20110295775 | ASSOCIATING MEDIA WITH METADATA OF NEAR-DUPLICATES - Techniques for identifying near-duplicates of a media object and associating metadata of the near-duplicates with the media object are described herein. One or more devices implementing the techniques are configured to identify the near duplicates based at least on similarity attributes included in the media object. Metadata is then extracted from the near-duplicates and is associated with the media object as descriptors of the media object to enable discovery of the media object based on the descriptors. | 2011-12-01 |
20110295776 | RESEARCH MISSION IDENTIFICATION - A system and method is described herein that automatically determines if a user of a search engine is conducting a research mission and then provides one or more research tools, one or more specialized searches, one or more directed ads, and/or one or more marketplace events responsive to determining that the research mission is being conducted. The automatic provision of various events and/or tools responsive to determination of the research mission can advantageously improve the experience of the user conducting the research mission. | 2011-12-01 |
20110295777 | METHOD FOR BUILDING ADAPTIVE SOFT SENSOR - The invention discloses a method for building adaptive soft sensor. The method comprises the following steps. The input and schedule vectors are constructed, and a novel learning algorithm that uses online subtractive clustering is used to recursively update the structure and parameters of a local model network. Three rules are proposed for updating centers and local model coefficients of existing clusters, for generating new clusters and new models as well as for merging existing clusters and their corresponding models. Once verified, the online inferential model can be created to generate the predicted value of process. Thus, it does not need much memory space to process the method and can be easily applied to any other machine. | 2011-12-01 |
20110295778 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM - There is provided an information processing apparatus including a data pool generation section which generates an unknown data pool, a learning sample collection section which randomly collects a plurality of learning samples from the unknown data pool, a classifier generation section which generates a plurality of classifiers using the learning samples, an output feature quantity acquisition section which associates with the data, for each piece of the data, a plurality of output values, which are obtained by inputting the data into the plurality of classifiers to identify the data, as an output feature quantity represented in an output feature quantity space different from the feature quantity space, and a classification section which classifies each piece of the data into any one of a predetermined number of the classes based on the output feature quantity. | 2011-12-01 |
20110295779 | REGULAR EXPRESSION MATCHING METHOD AND SYSTEM - The present invention discloses a regex matching method and system, and relates to the field of computer technologies. The method includes: sorting multiple regexes into several regex groups, where all regexes in one regex group include a common string, which is known as a generic string; compiling each regex group into a DFA, and setting up a correlation between the generic string of each regex group and the DFA; matching to-be-matched data streams with the generic string respectively, and using the matched generic string as a matched string; obtaining a DFA corresponding to the matched string; and performing regex matching for the to-be-matched data streams according to the DFA, and outputting a matching result. The embodiments of the present invention shorten the data loading process, decrease the time consumed by data loading, and improve the matching performance. | 2011-12-01 |
20110295780 | Apparatus and Method for Personalized Delivery of Content from Multiple Data Sources - A non-transitory computer readable storage medium includes instructions to collect explicit feedback from a user regarding user content preferences. Multiple data sources are monitored. Topics associated with the multiple data sources are classified. The importance of the topics to the user is characterized. Content is delivered to the user when a selected topic exceeds an importance threshold for the user. Implicit feedback from the user that characterizes refined user content preferences is tracked. The instructions to characterize the importance of topics evaluates the explicit feedback and the implicit feedback. | 2011-12-01 |
20110295781 | Apparatus and Method for Improved Classifier Training - A non-transitory computer readable storage medium includes instructions to maintain an original training set of labeled documents, where the labeled documents correspond to a variety of topics. A new labeled document corresponding to a new topic is received. The original training set of labeled documents is modulated such that the new labeled document is over-represented with respect to the original training set. This results in a modulated training set. A classifier is trained with the modulated training set to form a trained classifier. | 2011-12-01 |
20110295782 | Clinical Decision Model - An embodiment of the invention provides a method for determining a patient-specific probability of disease. The method collects clinical parameters from a plurality of patients to create a training database. A fully unsupervised Bayesian Belief Network model is created using data from the training database; and, the fully unsupervised Bayesian Belief Network is validated. Clinical parameters are collected from an individual patient; and, such clinical parameters are input into the fully unsupervised Bayesian Belief Network model via a graphical user interface. The patient-specific probability of disease is output from the fully unsupervised Bayesian Belief Network model and sent to the graphical user interface for use by a clinician in pre-operative planning. The fully unsupervised Bayesian Belief Network model is updated using the clinical parameters from the individual patient and the patient-specific probability of disease. | 2011-12-01 |
20110295783 | Multiple Domain Anomaly Detection System and Method Using Fusion Rule and Visualization - The present invention discloses various embodiments of multiple domain anomaly detection systems and methods. In one embodiment of the invention, a multiple domain anomaly detection system uses a generic learning procedure per domain to create a “normal data profile” for each domain based on observation of data per domain, wherein the normal data profile for each domain can be used to determine and compute domain-specific anomaly data per domain. Then, domain-specific anomaly data per domain can be analyzed together in a cross-domain fusion data analysis using one or more fusion rules. The fusion rules may involve comparison of domain-specific anomaly data from multiple domains to derive a multiple-domain anomaly score meter for a particular cross-domain analysis task. The multiple domain anomaly detection system and its related method may also utilize domain-specific anomaly indicators of each domain to derive a cross-domain anomaly indicator using the fusion rules. | 2011-12-01 |
20110295784 | ERROR CORRECTING METHOD OF TEST SEQUENCE, CORRESPONDING SYSTEM AND GENE ASSEMBLY EQUIPMENT - The present invention provides an error correcting method of test sequence, which involves receiving test sequences, configuring high frequency short string list based on a preset high frequency threshold value, traversing each received test sequence, searching an area with the largest number of continuous high frequency short strings on each test sequence in combination with high frequency short string list, configuring whole left sequence and/or right sequence of high frequency short strings at left side and/or right side of searched area according to corresponding received test sequence and high frequency short string list, and constituting corresponding test sequence according to configured left and/or right sequence and searched area. The present invention also provides corresponding error correcting system of test sequence and gene assembly equipment. | 2011-12-01 |
20110295785 | MOBILE E-LEARNING METHOD AND APPARATUS BASED ON MEDIA ADAPTED LEARNING OBJECTS - A method, apparatus and system of a mobile e-learning method and apparatus based on media adapted learning objects are disclosed. In one embodiment, a method includes processing an e-learning course based on a set of executable files and a number of auxiliary files associated with the set of executable files to install the e-learning course to a mobile device with an application program selectively replicating a subset of the set of executable files and the number of auxiliary files to the mobile device presenting the subset of the set of executable files and the number of auxiliary files of the mobile device in a particular sequence when processing a signal data associated with a menu of the e learning course and analyzing an assessment result data based on the subset of the set of files to communicate the assessment result data to a repository of a content management system. | 2011-12-01 |
20110295786 | BELIEF PROPAGATION PROCESSOR - A processor includes a first memory module for storing a first set of storage values each representing a respective input, and a second memory module for storing a second set of storage values in analog form. An analog module is coupled to the first and the second memory modules. The analog module is configured to, in each operation cycle of at least one iteration, update at least some of the second set of storage values based on the first and the second sets of storage values. An output module is for generating a set of outputs from at least some of the second set of storage values. | 2011-12-01 |
20110295787 | INFORMATION PROCESSING APPARATUS, INFORMATION PROCESSING METHOD, AND PROGRAM - Disclosed herein is an information processing apparatus including an evaluation information extraction section configured to extract evaluation information including an object targeted to be evaluated and an evaluation of the object targeted to be evaluated from a linguistic expression given as information expressed linguistically by a user of interest; an identification section configured to identify whether the evaluation information is of a first type regarding content or of a second type regarding another user; and an evaluation prediction section configured to predict the evaluation by the user of interest regarding the content, based on the evaluation information of the first type given by the user of interest and on the evaluation information given by the other user in the evaluation information of the second type given by the user of interest. | 2011-12-01 |
20110295788 | Method and System to Enable Inferencing for Natural Language Queries of Configuration Management Databases - Disclosed are embodiments of systems and methods to derive a semantic network from a CMDB relationship graph which can then be queried in a natural way from a linguistic standpoint (i.e., using natural language queries). Because disclosed embodiments combine natural language queries with an inferencing engine the disclosed systems and methods automatically “connect the dots” between disparate pieces of information and can allow for a richer user experience. In general, CMDB graph relationships can be converted into semantic networks. Once a semantic network is created, queries can be phrased to leverage the inferential relationships between objects in the semantic network. | 2011-12-01 |
20110295789 | Context-Sensitive Dynamic Bloat Detection System - Methods and apparatus are provided for a context-sensitive dynamic bloat detection system. A profiling tool is disclosed that selects an appropriate collection implementation for a given application. The disclosed profiling tool uses semantic profiling together with a set of collection selection rules to make an informed choice. A collection implementation, such as an abstract data entity, is selected for a given program by obtaining collection usage statistics from the program. The collection implementation is selected based on the collection usage statistics using a set of collection selection rules. The collection implementation is one of a plurality of interchangeable collection implementations having a substantially similar logical behavior for substantially all collection types. The collection usage statistics indicate how the collection implementation is used in the given program. One or more suggestions can be generated for improving the collection allocated at a particular allocation context. | 2011-12-01 |
20110295790 | SYSTEM AND METHOD FOR PROVIDING INSTANCE INFORMATION DATA OF AN INSTANCE - A method and system for providing instance information data of at least one instance. The method has the steps of generating a semantic representation of the instance on the basis of at least one instance data source, providing a semantic representation of a domain on the basis of at least one structured domain data source, performing an integration of the semantic instance and domain representations to provide an integrated semantic representation and deriving automatically instance information data from the provided integrated semantic representation. The method and system allow to provide efficiently instance information data of a wide range of instances with technical entities and persons, in a particular patients in different domains such as radiology or anatomy. | 2011-12-01 |
20110295791 | SYSTEM AND METHOD FOR SPECIFYING METADATA EXTENSION INPUT FOR EXTENDING DATA WAREHOUSE - An input extension specification can be generated, via an administration tool on a business intelligence (BI) server, for an extender associated with a data warehouse in order to extend the data warehouse. The administration tool can request for data flow information of the data warehouse from the extender. The data flow information indicates the mapping relationship between one or more source data objects and one or more target tables in the data warehouse. The administration tool further allows a user to select said one or more target tables in the data warehouse to be extended based on the data flow information, and builds the input extension specification for the extender. | 2011-12-01 |
20110295792 | DATA MART AUTOMATION - Systems and methods are described for automating the creation of data marts within an enterprise. Data is maintained in a plurality of data sources that include at least a relational database and a multidimensional database. The system includes a business intelligence server that provides a virtual logical semantic model to integrate all of the plurality of data sources. The user specifies a list of levels and measures on the virtual logical semantic model. The list of levels and measures can span data from multiple data sources. The user can also specify a location in the plurality of data sources that will store the aggregate matrix. Once the list of levels and measures are specified, the business intelligence server generates a multidimensional cube to store the data for the aggregate matrix and stores the multidimensional cube in the data source location. | 2011-12-01 |
20110295793 | SYSTEM AND METHOD FOR PROVIDING DATA FLEXIBILITY IN A BUSINESS INTELLIGENCE SERVER USING AN ADMINISTRATION TOOL - An administration tool can be used to provide data flexibility in a business intelligence (BI) server that is associated with a data warehouse. The administration tool can display one or more data objects that are adapted to be imported from an application framework into a physical model maintained on the BI server. The administration tool can further map the one or more data objects in the physical model into a logical model, also maintained on the BI server, which corresponds to at least one target table in the data warehouse. Additionally, the administration tool can publish an extension input to an extender associated with the data warehouse based on the logical model, wherein the extender operates to generate one or more metadata extensions based on the extension input. | 2011-12-01 |
20110295794 | SYSTEM AND METHOD FOR SUPPORTING DATA WAREHOUSE METADATA EXTENSION USING AN EXTENDER - An extender associated with a data warehouse can support metadata extension for the data warehouse. The extender can create an ETL extension plan for extending the data warehouse. The ETL extension plan includes one or more ETL plan elements that indicate extensions on ETL metadata objects. The one or more ETL plan elements within the ETL extension plan can be ordered, and ETL metadata extension can be performed based on the ETL extension plan. | 2011-12-01 |
20110295795 | SYSTEM AND METHOD FOR ENABLING EXTRACT TRANSFORM AND LOAD PROCESSES IN A BUSINESS INTELLIGENCE SERVER - A business intelligence (BI) server maintains a plurality of metadata objects to support the extract, transform and load (ETL) processes. These metadata objects includes a transparent view object, which takes a joined set of source tables and represents a data shape of the joined set of source tables using a transformation, and a ETL mapping association object that maps the transformation contained in the transparent view object to a target table. The BI server can then orchestrate the movement of data from source systems into the target data warehouses in a source and target system agnostic way. | 2011-12-01 |
20110295796 | SYNCHRONIZATION OF SUBSETS OF DATA INCLUDING SUPPORT FOR VARYING SET MEMBERSHIP - An efficient way and general mechanism is provided to represent and exchange knowledge and/or partial knowledge across nodes when synchronizing between any two nodes including custom or move filters where set membership can change over time at a device as data items come in and out of filter scope. A first node sends a second node its knowledge and/or partial knowledge, including objects and versions of those objects. The second node compares its knowledge and/or partial knowledge with the knowledge and/or partial knowledge of the first node, and then sends the first node any latest versions of objects of which the first node is unaware. In addition, the second node sends its knowledge and/or partial knowledge to the first node. The first node then performs a similar object-by-object version comparison to determine any conflicts due to independent evolution of objects and any changes that can be sent to the second node in order to bring the objects of the second node up to date with the knowledge and/or partial knowledge of the first node. Replicas can track filters to efficiently support synchronizing with filtered replicas. Filter forgotten knowledge is also used to represent how recently a replica can guarantee to know which items have been in the filter. Ghosts can be used to represent items that have been in the filter recently but have currently moved out. Filter forgotten knowledge concept allows both new filters to be tracked when they are introduced into the community, as well as periodically cleaning up of tombstones and ghosts. | 2011-12-01 |
20110295797 | SYNCHRONIZATION OF SEQUENTIAL ACCESS STORAGE COMPONENTS WITH BACKUP CATALOG - Various embodiments for synchronization of source and replicated instances of sequential access storage components are provided. Subsequent to a storage operation performed on the source instance by a source component, a synchronization message is sent to a replicated component for the replicated instance. The synchronization message is stored locally in a persistent storage location associated with the source component along with an indicator representative of a time the storage operation was performed. Pursuant to receipt of the synchronization message by the replicated component, the replicated component is updated to a dirty state to indicate a lack of full synchronization between the source and replicated instances. Receipt of the synchronization message is acknowledged by the replicated component by sending a dirty state acknowledgement. If, during a subsequent recovery process, the dirty state is not yet cleared, the replicated component is deemed ineligible for participation in a full restoration operation. | 2011-12-01 |
20110295798 | MOBILE MIRROR DRIVE AND REMOTE ACCESS SYSTEM - A solid state memory stores a mirror image of a computer hard drive. The solid state memory is coupled with a wireless communication chip, such as 3G, in order to enable dynamically updating the files on the solid state memory. Any modifications done to the files on the hard drive are synced with the files on the solid state memory. Similarly, any modifications done to the files on the solid state memory are synced with the files on the hard drive. | 2011-12-01 |
20110295799 | METHOD AND APPARATUS FOR SYNCHRONIZING OF DATABASES - A method for synchronizing a first database including first data records with a second database including second data records. The method includes starting a synchronization session with an electronic device on which the second database resides, requesting the first data records from the first database, temporarily disconnecting the synchronization session while awaiting receipt of the first data records, receiving the first data records, and restarting and completing the synchronization session. | 2011-12-01 |
20110295800 | Method and System for Minimizing Synchronization Efforts of Parallel Database Systems - Operating a parallel database server system, where the database server system comprises at least two database servers and one data source. A client identifier is received from a client requesting services from one of said database servers. Information associated with said client is retrieved. The client is allocated to one of said database servers based on the retrieved information. | 2011-12-01 |
20110295801 | FILTERING WORKLOAD FOR DATABASE REPLAY - A method and apparatus for capturing database system workload and replaying that workload in a database system is provided. According to one aspect, in order to subject a test database system to the same workload to which the production database system actually would be subjected, a database server in the production system captures and records workload that the database server receives from external entities. This captured workload is processed. Processes external to a database server in the test database system send the processed workload to that database server. As a result, the test database system is subjected to the same workload to which the production database system originally was subjected. The foregoing technique permits a database administrator to determine how the production database system will fare if the difference that is present in the test database system is introduced into the production database system. | 2011-12-01 |
20110295802 | SCALABLE POLICY-BASED DATABASE SYNCHRONIZATION OF SCOPES - Embodiments described herein are directed to synchronizing scopes between a source database and a target database without the target database specifying each scope that is to be synchronized and to determining scope changes based on service subscriptions. In one embodiment, a source database receives from a target database a synchronization scopes policy corresponding to scope criteria provided by the target database. The synchronization scopes policy includes both the scope criteria and a version identifier that together identify a point-in-time snapshot of the set of scopes meeting the scope criteria as of the latest synchronization. The source database resolves the set of scopes last synchronized from the source database to the target database based on the synchronization scopes policy's scope criteria and version identifier. The source database synchronizes to the target database the changes to data in the resolved set of scopes. | 2011-12-01 |
20110295803 | DATABASE SYSTEM, METHOD, AND RECORDING MEDIUM OF PROGRAM - A system includes a first storage apparatus and a second storage apparatus. The first storage apparatus includes: a generating unit to generate logs, in response to updates performed on a database in the first storage apparatus, related to the updates; a storage unit to store the logs and data representing the order of generation of each of the logs; and a transmitting unit to transmit, when the logs and the data are stored in the storage unit, the log and the data to the second storage apparatus. The second storage apparatus includes: a receiving unit to receive the logs and the data transmitted by the transmitting unit; and an updating unit to update a database in the second storage apparatus based on the logs in accordance with the order represented by the data. | 2011-12-01 |
20110295804 | SYSTEMS AND METHODS FOR PERFORMING DATA REPLICATION - Preparing source data to be replicated in a continuous data replication environment. Certain systems and methods populate a file name database with entries having a unique file identifier descriptor (FID), short name and a FID of the parent directory of each directory or file on a source storage device. Such information is advantageously gathered during scanning of a live file system without requiring a snapshot of the source storage device. The database can be further used to generate absolute file names associated with data operations to be replayed on a destination storage device. Based on the obtained FIDs, certain embodiments can further combine write operations to be replayed on the destination storage device and/or avoid replicating temporary files to the destination system. | 2011-12-01 |
20110295805 | SYSTEMS AND METHODS FOR PERFORMING DATA REPLICATION - Preparing source data to be replicated in a continuous data replication environment. Certain systems and methods populate a file name database with entries having a unique file identifier descriptor (FID), short name and a FID of the parent directory of each directory or file on a source storage device. Such information is advantageously gathered during scanning of a live file system without requiring a snapshot of the source storage device. The database can be further used to generate absolute file names associated with data operations to be replayed on a destination storage device. Based on the obtained FIDs, certain embodiments can further combine write operations to be replayed on the destination storage device and/or avoid replicating temporary files to the destination system. | 2011-12-01 |
20110295806 | SYSTEMS AND METHODS FOR PERFORMING DATA REPLICATION - Preparing source data to be replicated in a continuous data replication environment. Certain systems and methods populate a file name database with entries having a unique file identifier descriptor (FID), short name and a FID of the parent directory of each directory or file on a source storage device. Such information is advantageously gathered during scanning of a live file system without requiring a snapshot of the source storage device. The database can be further used to generate absolute file names associated with data operations to be replayed on a destination storage device. Based on the obtained FIDs, certain embodiments can further combine write operations to be replayed on the destination storage device and/or avoid replicating temporary files to the destination system. | 2011-12-01 |
20110295807 | DISTRIBUTED DATA STORAGE - The present invention relates to a distributed data storage system comprising a plurality of storage nodes. Using unicast and multicast transmission, a server application may read and write data in the storage system. Each storage node may monitor reading and writing operations on the system as well as the status of other storage nodes. In this way, the storage nodes may detect a need for replication of files on the system, and may carry out a replication process that serves to maintain a storage of a sufficient number of copies of files with correct versions at geographically diverse locations. | 2011-12-01 |
20110295808 | HALDB OLR Variant Linear Statistics - A method for providing database reorganization statistics across timestamp recoveries, includes: appending statistical data for a database reorganization associated with a timestamp to a statistics file; determining that the database reorganization has resumed after a suspension; obtaining a resume timestamp; retrieving statistical data within the statistics file corresponding to the resume timestamp; and appending statistical data for the resumed database reorganization to the retrieved statistical data. Further raw statistical data for the resumed database reorganization are appended to the retrieved raw statistical data. When a unit of reorganization has committed or the resumed database reorganization has terminated, a statistics record including the retrieved raw statistical data and the further raw statistical data associated with another timestamp is created, and the statistics record is appended to the statistics file. | 2011-12-01 |
20110295809 | COMPUTER SYSTEM AND RESTORATION METHOD - A computer system and restoration method that can facilitate restoration work is suggested. | 2011-12-01 |
20110295810 | METHOD FOR COPYING DATA FROM SOURCE HARD DRIVE TO TARGET HARD DRIVE - A method for copying data from a source hard drive to a target hard drive is implemented in an electronic device. The source hard drive stores a master boot record (MBR) recording a SYSTEM partition and at least one other partition. The electronic device copies information related to the SYSTEM partition to a file to store in the source hard drive and modifies the MBR to be a modified MBR by erasing the SYSTEM partition. The electronic device then creates a diagnostic sub-partition for system diagnostics in one of the at least one other partition, copies the file to the diagnostic sub-partition, and copies the modified MBR in the target hard drive. When the system diagnostics is implemented for the target hard drive, the electronic device restores the SYSTEM partition in the target hard drive based on the file. | 2011-12-01 |
20110295811 | CHANGING A NUMBER OF DISK AGENTS TO BACKUP OBJECTS TO A STORAGE DEVICE - A method executes a simulation to determine backup times to backup objects to storage devices using a number of concurrent disk agents that are assigned to each of the storage devices. The number of concurrent disk agents is changed during the backup of the objects to the storage devices. | 2011-12-01 |
20110295812 | TECHNIQUES FOR PRODUCING A CONSISTENT COPY OF SOURCE DATA AT A TARGET LOCATION - Described area system and computer program product for producing a point in time copy of source data. A set of records corresponding to a time ordered series of recorded file operations as applied to said source data is received. The set of records includes one or more consistency point markers, each consistency point marker indicating a point in time at which said source data is in a consistent state when a portion of said recorded file operations occurring up to said point in time is applied to said source data. The recorded file operations corresponding to said set of records are applied to said copy of the source data until a marker record corresponding to a consistency point marker is determined. Also described is a target system for producing a point in time copy of source data including a data storage device including said copy of source data and a replication service. | 2011-12-01 |
20110295813 | Mechanism for Managing and Archiving System and Application Log Files - A mechanism for managing and archiving system and application log files is disclosed. A method of the invention includes accessing log files on shared storage that satisfy grouping requirements, combining the accessed log files that satisfy the grouping requirements into a single combined log file, compressing the single combined log file, and storing the single combined log file to an archival storage location. | 2011-12-01 |
20110295814 | Methods and Systems for Detecting Skewed Data in a Multitenant Database Environment - Detection of skew in an on-demand database services environment is provided. A request is generated to scan a multitenant database for skew indicated by relationship depth exceeding an expected limit. A database crawler calculates skew for tenant identifier for a particular table in the database. Any skew that is detected is identified for later resolution. | 2011-12-01 |
20110295815 | Proactive Detection of Data Inconsistencies in a Storage System Point-in-Time Copy of Data - Embodiments of the invention relate to testing a storage system point-in-time copy of data for consistency. An aspect of the invention includes receiving system and application event information from systems and applications associated with point-in-time copies of data. The system and application event information is associated with each of point-in-time copies of data. At least one point-in-time copy of data is selected for testing. The system and application event information is compared with inconsistency classes to determine tests for testing the point-in-time copy of data. The point-in-time copy of data is tested. | 2011-12-01 |
20110295816 | ALTERATION DETECTING APPARATUS AND ALTERATION DETECTING METHOD - According to one embodiment, an alteration detecting apparatus includes an input unit, a storage unit, an output unit, and an alteration detecting unit. The input unit inputs a file. The storage unit stores the file. The output unit outputs the file. The alteration detecting unit produces first alteration detection data that is uniquely determined, from the file on the basis of an alteration detection data production process in response to an input of the file, stores the file and the first alteration detection data in the storage unit, produces second alteration detection data that is uniquely determined, from the file stored in the storage unit on the basis of the alteration detection data production process in response to an output request for the file, compares the first alteration detection data with the second alteration detection data and detects alteration of the file on the basis of the compared result. | 2011-12-01 |
20110295817 | Technique For Compressing XML Indexes - A method and apparatus for XXX is provided. | 2011-12-01 |
20110295818 | METHOD AND SYSTEM FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - Various embodiments for transforming a logical data object for storage in a storage device operable with at least one storage protocol are provided. In one such embodiment, the logical data object into one or more segments are divided with each segment characterized by respective start and end offsets. One or more obtained variable size data chunks are processed corresponding to the logical data object to obtain processed data chunks, wherein at least one of the processed data chunks comprises transformed data resulting from the processing. Each of the variable size data chunks is associated with a respective segment of the logical data object. The processed data chunks are sequentially accommodated in accordance with an order of chunks received while keeping the association with the respective segments | 2011-12-01 |
20110295819 | METHOD AND SYSTEM FOR TRANSFORMATION OF LOGICAL DATA OBJECTS FOR STORAGE - Various embodiments for transforming a logical data object for storage in a storage device operable with at least one storage protocol are provided. In one such embodiment, the logical data object into one or more segments are divided with each segment characterized by respective start and end offsets. One or more obtained variable size data chunks are processed corresponding to the logical data object to obtain processed data chunks, wherein at least one of the processed data chunks comprises transformed data resulting from the processing. Each of the variable size data chunks is associated with a respective segment of the logical data object. The processed data chunks are sequentially accommodated in accordance with an order of chunks received while keeping the association with the respective segments | 2011-12-01 |
20110295820 | BLOCK-BASED DIFFERENCING ALGORITHM - A system and method for a block based differencing algorithm which includes the ability to limit memory requirements regardless of source file sizes by splitting the source file into optimally sized blocks. The invention allows the blocks to be processed in any order allowing in-place operation. Further, the present invention allows a second stage compressor to match the compressor blocks to those used by the differencing algorithm to optimize compressor and decompressor performance. | 2011-12-01 |
20110295821 | Servicing Daemon for Live Debugging of Storage Systems - A servicing daemon is described herein for providing servicing of a running computer system (such as a filer). The servicing daemon resides and executes on the operating system of the filer and communicates across a network with a debugger that resides and executes on a remote administering computer. A debugging session is performed that complies with a protocol relating to the remote accessing of files. The debugging session provides live servicing of an application executing on the filer without requiring an actual corefile (having copied filer memory data) to be created. Rather, the servicing daemon creates a simulated corefile header that is sent to the debugger, receives requests from the debugger, and maps addresses specified in the requests to filer memory addresses. The servicing daemon then reads and retrieves data directly from filer memory at the determined filer memory addresses and sends the data to the debugger for analysis. | 2011-12-01 |
20110295822 | Methods to Perform Disk Writes in a Distributed Shared Disk System Needing Consistency Across Failures - Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for transferring data items and locks associated with the data items from one node to another. | 2011-12-01 |
20110295823 | METHOD AND APPARATUS FOR MODELING RELATIONS AMONG DATA ITEMS - An approach is provided for modeling relations among data items of an information resource. A modeling manager retrieves, at a device, a first data item and determines one or more data types associated with the first data item. Based, at least in part, on the one or more data types, the modeling manager determines one or more relations corresponding to the first data item based, at least in part, on the one or more data types. The modeling manager then associates the first data item with a second data item based, at least in part, on a semantic relationship among the first data item, the second data item, the one or more relations, or a combination thereof. | 2011-12-01 |
20110295824 | SEARCH PREDICTION USING CONTEXT MODELING - A method and apparatus for predicting search queries for a user on a search-based system is described. A search engine tracks search queries from a user received at the search engine. A prediction engine compares a search query history from the user with search query histories from other users on the search engine. The search query histories are stored in a storage device of the search-based system. A prediction of a search query for the user is generated based on the comparison. Search query histories from other users having greater similarities with the search query history from the user have a greater computation weight than search query histories from other users with less similarities with the search query history from the user. | 2011-12-01 |
20110295825 | Method and System for Interacting with a Plurality of Search Engines - A way to conduct multiple distinct searches and to present the respective result subsets | 2011-12-01 |
20110295826 | Active Search Results Page Ranking Technology - Systems and methods for storing data regarding activities of a person and/or people associated with a website that is indexed in a search engine. Data regarding such activities is used to calculate a weighting factor that is combined with a relevance score for the website. The combined weighting factor and relevance score influences the relative position of the website among other websites in search results. | 2011-12-01 |
20110295827 | SYSTEM AND METHOD FOR ORGANIZING SEARCH CRITERIA MATCH RESULTS - A system and method for organizing database search criteria match results which are generated through a search engine, able to generate system databases upon the processing of search criteria established and submitted by a system user. The system is able to define and group the search criteria match results for presentation to the user based upon the relative emphasis or de-emphasis of such results. The system includes a context software module, for enabling the generating of a context database consisting of content, links, and layouts organized for presentation to the user, which module is adapted to determine and specify the context database based on a current context and settings. The system also includes a criteria software module for enabling the generating of a comparison database, adapted to enable criteria to be submitted, modified, and input by the user to generate comparison database information. | 2011-12-01 |
20110295828 | SYSTEMS AND METHODS FOR PROVIDING SEARCH RESULTS - A method includes generating search results in response to a user query, where at least one of the search results includes a group of links. The group of links may represent links to web pages within a same web site and may be identified based on at least one factor associated with the links. The method may also include providing the search results to the user. | 2011-12-01 |
20110295829 | Object Information Derived from Object Images - Search terms are derived automatically from images captured by a camera equipped cell phone, PDA, or other image capturing device, submitted to a search engine to obtain information of interest, and at least a portion of the resulting information is transmitted back locally to, or nearby, the device that captured the image. | 2011-12-01 |
20110295830 | Multi-Window Internet Search - Methods are described to preload and display a plurality of webpages from a hyperlink list either previously saved or returned by one or more search engines, where said webpages are displayed in a web browser. The web browser has been augmented to display multiple webpages simultaneously and to allow changing the number of webpages displayed and their physical arrangement within the web browser display. Hyperlinks associated with any portion of this plurality of webpages can be saved as a list of hyperlinks (group bookmark) for later retrieval. Preloading may be dynamically altered to take advantage of network bandwidth availability and processor non-saturation. Descendant webpages of preloaded webpages may also be preloaded to further speed performance. The zoom factor for a displayed webpage may be altered by clicking on a zoom icon or alternately rotating a mouse wheel while the cursor is held over the zoom icon. | 2011-12-01 |
20110295831 | Providing Content Using Stored Query Information - Among other disclosed subject matter, a computer-implemented method relating to providing content on a page includes receiving information for providing content for an access device in response to a navigation from a first page to a second page. The content is to be included in the second page. The method includes accessing query information stored on the access device, the query information based on a first query that was submitted from the access device to a search provider before navigating to the first page. The method includes providing the content for inclusion in the second page, the content selected using at least the received information and the accessed query information. A computer-implemented method can include recording search query information for a user; retrieving the search query information; and using the search query information to determine content for display to the user. | 2011-12-01 |
20110295832 | Identifying Communities in an Information Network - Techniques for identifying one or more communities in an information network are provided. The techniques include collecting one or more nodes and one or more edges from an information network, performing a random walk on the one or more nodes to produce a sequence of one or more nodes, creating a sequence database from one or more sequences produced via random walk, and mining the sequence database to determine one or more patterns in the network, wherein the one or more patterns identify one or more communities in the information network. | 2011-12-01 |
20110295833 | Framework for Testing Query Transformation Rules - Described is a test framework for testing transformation rules of query optimizers. Rule patterns obtained as tree structures from a query optimizer are used to generate queries that are used to test the rule optimizer's transformation rules. The test framework tracks which rules are exercised for each query, and also determines the correctness of the transformation rule by comparing the results of the query processing with the rule and without the rule (by turning off the rule). The test framework creates a composite pattern corresponding to two or more rules, such as to test rules in a set (e.g., as pairs). Also described is the efficient execution of a test suite for correctness testing, in which queries of the test suite are selected based upon cost information. | 2011-12-01 |
20110295834 | METHOD FOR OPTIMIZING A SEARCH QUERY - A user is provided with an analytical function which indicates an individual contribution of each search term used in a complex search query by a graphical, typographical or numerical indicator. For this purpose there is started in the background for each search term a search query which consists of the complex search query without the respective search term. The hit count obtained in this way is subtracted from the total hit count of the search query with the respective search term. The difference is a numerical indicator for the individual contribution of the respective search term to the total hit count. Thus, the user quickly and conveniently obtains a reference point indicating which search terms are crucial to the search query. The user can thus selectively refine the search query by explicitly specifying less significant search terms or removing overly restrictive search terms. | 2011-12-01 |
20110295835 | Expanding Attribute Profiles - A method and system for expanding attribute profiles are presented in which primary attributes from one or more attribute profiles are used to derive secondary attributes which are added to the respective attribute profiles to generate expanded attribute profiles. The expanded attribute profiles are generated to increase the strength of association of a query attribute with one or more attribute profiles associated with query-attribute-positive individuals. | 2011-12-01 |
20110295836 | SYSTEMS AND METHODS FOR PROVIDING VALUE HIERARCHIES, RAGGED HIERARCHIES AND SKIP-LEVEL HIERARCHIES IN A BUSINESS INTELLIGENCE SERVER - A business intelligence (BI) server and repository are described which support a set of hierarchical relationships among the data. The BI server receives user input specifying a set of parent-child or other ancestral relationship among a set of data in a data source. The BI server generates a set of SQL queries and executes the queries to pre-populate a set of tables which specify the parent child relationships among the data in the data source. One such table is a parent-child relationship closure table that defines the inter-member relationships among the data members. Once the tables are populated, the BI server uses the closure tables to answer queries that require knowledge of the ancestral relationships among data. | 2011-12-01 |
20110295837 | SYSTEMS AND METHODS FOR PROVIDING MULTILINGUAL SUPPORT FOR DATA USED WITH A BUSINESS INTELLIGENCE SERVER - A business intelligence (BI) server is described that supports data and schemas stored in multiple languages. The BI server implements a lookup table and lookup function that allows users to work with queries in different languages. When the user logs in, a session object is created for the user, which maintains the state information. A session variable specifies the language currently being used by the user. The BI server can inspect this session variable to determine the language of the user and perform the lookup translations as necessary. For example, if the language used by the session is different from the language of the base table storing the necessary information, the BI server can perform a translation by invoking a lookup function. The execution of the lookup can include performing a join operation of the base table with the lookup table to yield a translated value requested by the query. | 2011-12-01 |
20110295838 | TRANSFORMING QUERIES IN A MULTI-TENANT DATABASE SYSTEM - In a method, system, and computer-readable medium having instructions for optimizing a query in a database system, a query request is received with a query predicate to filter data returned in response to the query request and the query predicate has a formula, the query request is transformed to a transformed query request by preprocessing the formula in the query predicate, and the query request is optimized using the transformed query request. | 2011-12-01 |
20110295839 | OPTIMIZING QUERIES IN A MULTI-TENANT DATABASE SYSTEM ENVIRONMENT - In a method, system, and computer-readable medium having instructions for optimizing a query in a database system, a database statistic is generated for a number of related records for one or more entities for at least one tenant and a related record is a record with a relationship to a shared record in a database table for an entity from the one or more entities, a first cost is calculated for accessing the number of related records for at least one tenant, a second cost is calculated for accessing a number of related records accessible to a user, a comparison of the first cost to the second cost is performed to determine a data access path for retrieving accessible related records, and the data access path for retrieving accessible related records is determined based upon the comparison. | 2011-12-01 |
20110295840 | GENERALIZED EDIT DISTANCE FOR QUERIES - Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining a generalized edit distance for queries. In one aspect, a method includes selecting query pairs of consecutive queries, each query pair being a first query and a second query consecutively submitted as separate queries, each first and second query including at least one term. For each query pair, the method includes selecting term pairs from the query pair, each term pair being a first term in the first query and a second term in the second query; and determining a co-occurrence value for each term pair. The method also includes determining transition costs based on the co-occurrence values for term pairs, each transition cost indicative of a cost of transitioning from a first term in a first query to a second term in a second query consecutive to the first query. | 2011-12-01 |
20110295841 | VIRTUAL TOPOLOGICAL QUERIES - Systems, methods, and other embodiments associated with virtual topological queries are described. One example method includes executing a first topological query on a stored graph to generate a first result graph. The example method may also include manipulating the first result graph to generate a virtual query result graph as a function of a second topological query. The example method may also include providing the virtual query result graph. | 2011-12-01 |
20110295842 | Applying Scanned Information to Identify Content - Information corresponding to a sentence or less of text is scanned from a rendered document and converted to text. The text is communication to a search engine. Electronic content corresponding to the rendered document from which the text was scanned is identified from the search engine results. | 2011-12-01 |
20110295843 | DYNAMIC GENERATION OF CONTEXTUALLY AWARE PLAYLISTS - The embodiments described herein utilize various user-centric metrics to define and/or refine the generation of a contextually aware media playlist. | 2011-12-01 |
20110295844 | ENHANCING FRESHNESS OF SEARCH RESULTS - Methods, systems, and computer-storage media for improving the freshness, or the apparent freshness, of search results are described. In an embodiment, the first portion of search results presented on a search results page are based on responsiveness to the search query and a second portion of results describe only recently published documents that are responsive to the search query. In an embodiment, a more recent version of the document, which is not directly used to determine responsiveness, is used to build the caption for a search result. Another way to make search results appear fresh is to include a publication time within the search result caption. In one embodiment, the publication time is generated by calculating a point in time between when a document is first added to a search index and the previous time the search engine visited the site where the document was found. | 2011-12-01 |