52nd week of 2012 patent applcation highlights part 63 |
Patent application number | Title | Published |
20120330826 | Virtual accounts linked to financial accounts - Virtual accounts having alphanumeric identifiers different from an alphanumeric identifier of a financial account are linked to the financial account. Financial transactions performed in relation to the virtual accounts result in changing the current value of the financial account. The virtual accounts themselves do not have a current value apart from a current value of the financial account to which the virtual accounts are linked. Performance of the financial transactions in relation to the virtual accounts does not expose the alphanumeric identifier of the financial account that would otherwise be exposed if the financial transactions were performed in relation to the financial account. A given financial account is also linked to another financial account. Performance of a financial transaction in relation to this given virtual account thus results in changing the current value of one of the financial accounts to which it is linked. | 2012-12-27 |
20120330827 | METHOD AND SYSTEM TO ACCEPT AND SETTLE TRANSACTION PAYMENTS FOR AN UNBANKED CONSUMER - A system and method is provided to accept and settle transaction payments for a consumer. The consumer initiates a transaction with a merchant, and the merchant transmits transaction information to a central processing unit using an initiating processing unit. The central processing unit generates a unique transaction identifier. The system may provide the merchant and consumer the nearest payment processing unit. At the payment processing unit, the consumer presents the unique transaction identifier, which is transmitted to the central processing unit for validation. The consumer makes payment at the payment processing unit, and the payment information is transmitted to the central processing unit. The system remits the payment to the merchant. | 2012-12-27 |
20120330828 | MECHANISM FOR FRAUD-RESISTANT CONSUMER TRANSACTIONS - A facility for conducting a financial transaction is described. The facility receives a purchase order identifying a customer and an amount of a payment to be made by the identified customer to a payee. The customer identified by the purchase order has an individual account. The facility selects an account from a pool of accounts designated as being shared by a number of customers including the identified customer. The shared pool does not include the identified customer's individual account. The facility transfers the identified amount from the identified customer's individual account to the selected account of the shared pool. The facility causes information identifying a credit card number for the selected account of the shared pool to be provided to the payee for use in effecting the payment. | 2012-12-27 |
20120330829 | DEVICE ASSISTED CDR CREATION AGGREGATION, MEDIATION AND BILLING - Device assisted CDR creation, aggregation, mediation and billing is provided. In some embodiments, device assisted CDR creation, aggregation, mediation and billing for a wireless network includes collecting device generated service usage information for one or more devices in wireless communication on the wireless network; and providing the device generated service usage information in a syntax (e.g., a device assisted charging data record (CDR)) and a communication protocol (e.g., 3GPP, 3GPP2, or other communication protocols) that can be used by other network devices to augment or replace network generated service usage information for the one or more devices in wireless communication on the wireless network. | 2012-12-27 |
20120330830 | SYSTEM AND METHOD FOR CREATING AND MANAGING A STORED VALUE ACCOUNT ASSOCIATED WITH A CLIENT UNIQUE IDENTIFIER - A method and system for creating and managing a stored value account associated with a client device is disclosed. A first stored value and an associated first virtual token may be created. A graphical representation of the first virtual token may be displayed on a display of a client device. An exchange request may be received, and a second stored value account may be created along with an associated second virtual token. Next, an animation that includes a transition from the first virtual token to the second virtual token may be displayed on the display of the client device. The animation may include a peel-off effect in which the first virtual token appears to curl away to reveal the second virtual token when the first virtual token has been exchanged for the second virtual token. | 2012-12-27 |
20120330831 | OFFSETTING FUTURE ACCOUNT DISCREPANCY ASSESSMENTS - In general terms, embodiments of the present invention relate to methods and apparatuses for prepaying, covering, avoiding, negating, and/or otherwise offsetting future account discrepancy assessments. For example, in some embodiments, a method is provided that includes: (a) receiving one or more payments for offsetting one or more future account discrepancy assessments, where the one or more payments are associated with an account; (b) receiving transaction information associated with a transaction, where the transaction involves the account, and where the transaction is initiated after the receiving the one or more payments; (c) determining, based at least partially on the transaction information, that the account will incur an account discrepancy as a result of the transaction; (d) determining that the one or more payments are sufficient to offset an account discrepancy assessment associated with the account discrepancy; and (e) authorizing the transaction based at least partially on the determining that the one or more payments are sufficient. | 2012-12-27 |
20120330832 | SYSTEMS AND METHODS FOR GESTURE-BASED INTERACTION WITH COMPUTER SYSTEMS - The present disclosure facilitates gesture-based interaction with a computer-system. The method may comprise pairing a transaction account with a likeness, receiving the likeness and a transaction request based upon the location of a marker in three dimensional space, retrieving the transaction account paired with the likeness, and approving the transaction request at least partially based upon the transaction account and the likeness. | 2012-12-27 |
20120330833 | SYSTEMS AND METHODS FOR GESTURE-BASED INTERACTION WITH COMPUTER SYSTEMS - The present disclosure facilitates gesture-based interaction with a computer-system. The method may comprise pairing a transaction account with a likeness, receiving the likeness and a transaction request based upon the location of a marker in three dimensional space, retrieving the transaction account paired with the likeness, and approving the transaction request at least partially based upon the transaction account and the likeness. | 2012-12-27 |
20120330834 | SYSTEMS AND METHODS FOR GESTURE-BASED INTERACTION WITH COMPUTER SYSTEMS - The present disclosure facilitates gesture-based interaction with a computer-system. The method may comprise pairing a transaction account with a likeness, receiving the likeness and a transaction request based upon the location of a marker in three dimensional space, retrieving the transaction account paired with the likeness, and approving the transaction request at least partially based upon the transaction account and the likeness. | 2012-12-27 |
20120330835 | SYSTEMS AND METHODS FOR GESTURE-BASED INTERACTION WITH COMPUTER SYSTEMS - The present disclosure facilitates gesture-based interaction with a computer-system. The method may comprise pairing a transaction account with a likeness, receiving the likeness and a transaction request based upon the location of a marker in three dimensional space, retrieving the transaction account paired with the likeness, and approving the transaction request at least partially based upon the transaction account and the likeness. | 2012-12-27 |
20120330836 | SYSTEMS AND METHODS FOR GESTURE-BASED INTERACTION WITH COMPUTER SYSTEMS - The present disclosure facilitates gesture-based interaction with a computer-system. The method may comprise pairing a transaction account with a likeness, receiving the likeness and a transaction request based upon the location of a marker in three dimensional space, retrieving the transaction account paired with the likeness, and approving the transaction request at least partially based upon the transaction account and the likeness. | 2012-12-27 |
20120330837 | ACCOUNT LINKING SYSTEM AND METHOD - Embodiments of the invention are directed to a relationship payment system that allows the establishment of a linked relationship between a primary account of a primary user and a secondary account of a secondary user. The relationship payment system allows a primary user to designate a portion of a credit limit of a primary user's account to grant to a secondary user's account. Transactions are authorized against secondary user's account, and then ultimately clearing and settlement for the transactions is conducted against the primary user's account. | 2012-12-27 |
20120330838 | SYSTEM AND METHOD FOR PROCESSING TOKENLESS BIOMETRIC ELECTRONIC TRANSMISSIONS USING AN ELECTRONIC RULE MODULE CLEARINGHOUSE - Herein is described a tokenless biometric method for processing electronic transmissions, using at least one user biometric sample, an electronic identicator and an electronic rule module clearinghouse. The steps for processing of the electronic transmissions comprise of a user registration step, wherein a user registers with an electronic identicator at least one registration biometric sample taken directly from the person of the user. | 2012-12-27 |
20120330839 | TRANSACTION PROCESSING - A transaction processing system for the real time authorization of payment transactions, The system comprises a verification system ( | 2012-12-27 |
20120330840 | CONFIGURABLE SYSTEM AND APPARATUS FOR RENDERING PAYMENT DECISIONS AND TRIGGERING ACTIONS - A computer-implemented method for controlling a payment transaction from a payer to a payee includes submitting a request for payment to a data processing machine, the request for payment including a set of submitted transaction characteristics for the payment transaction; and comparing, in the data processing machine, at least a portion of the set of submitted transaction characteristics to a set of predetermined transaction characteristics that are specific to the payer to determined a first payment decision for the payment transaction. | 2012-12-27 |
20120330841 | DEVICE AND METHOD FOR FACILITATING FINANCIAL TRANSACTIONS - A device, system, and method for conducting a secure transaction over a network includes receiving from a user, being issued a stored-value financial instrument, a dollar amount to be associated to the stored-value financial instrument, communicating the dollar amount to a debit agent residing on a network processing and communication device, receiving at the debit agent a selection of a non-integrated financial institution selected from a list that includes at least one non-integrated financial institution, receiving at the debit agent a financial-institution user-identifier from the user, communicating the financial-institution user-identifier from the debit agent to the selected non-integrated financial institution, participating in a user-free electronic dialogue between the debit agent and the selected non-integrated financial institution, the dialogue including a request to transfer funds from the selected non-integrated financial institution, and transferring, with the debit agent, the funds from the selected non-integrated financial institution to the stored-value financial instrument. | 2012-12-27 |
20120330842 | SYSTEM AND METHOD FOR PROVIDING A DISTRIBUTED DECISIONING ENVIRONMENT FOR PROCESSING OF FINANCIAL TRANSACTIONS - A system and method for providing one or more client systems for communicating with a host system over a network. The client systems use a scanner to convert a paper form of a check, coupon, or other paper document to a digital representation and then the client systems send the digital representation over a network to the host system for storage. The host system archives the digital representation and determines the appropriate processing stream for a transaction related to the paper document (e.g. coupon, check), via a decisioning engine, based on a set of predefined stream selection rules. The host system then communicates the transaction to a back end transaction destination, according to the selected processing stream. Examples of the transaction destination can include ACH, Reproduce Paper, and Remittance. | 2012-12-27 |
20120330843 | TRANSPARENTLY SECURING DATA FOR TRANSMISSION ON FINANCIAL NETWORKS - Systems and methods for performing financial transactions are provided. In one embodiment, the invention provides a method for processing token data for a bank card transaction, the method includes: receiving a string of first token data from a token at a token reader; modifying the first token data and generating second token data, the second token data including modified token data; performing a modulo arithmetic operation on the second token data and determining a mod | 2012-12-27 |
20120330844 | MULTI FUNCTIONAL DUPLEX ENCRYPTED PROCUREMENT AND PAYMENT SYSTEM AND METHOD - A device having a processor, the processor executing program instructions causing the processor to: storing credit card information of an individual in an encrypted format only readable by the processor; function as a credit card terminal by receiving an invoice for payment, wherein the invoice has a merchant key to direct payment to a specified gateway; and transferring funds from the individual to the specified gateway. | 2012-12-27 |
20120330845 | ANIMATED TWO-DIMENSIONAL BARCODE CHECKS - Systems and methods are disclosed to provide an animated 2D barcode check that is used to securely and efficiently transmit financial information between mobile devices. The financial information includes a check written by a payer and transmitted to a merchant. The check includes account information of the payer and of the merchant with a payment service provider, a payment amount, and a cryptographic signature that has been certified by the payment service provider. The payer's mobile device encodes the check into a sequence of 2D barcodes and displays the sequence of 2D barcodes in a loop that is scanned by a camera on the merchant's mobile device. The merchant uses the cryptographic signature to verify the validity of the signature on the check without having Internet connectivity to the payment service provider. The merchant may later present the check to the payment service provider to receive payment. | 2012-12-27 |
20120330846 | DYNAMIC ELECTRONIC MONEY - The invention concerns a method of making an electronic payment by an electronic payment device comprising: transmitting from said electronic payment device ( | 2012-12-27 |
20120330847 | Methods and Systems Involving Databases for Energy Microgeneration Data - A method for analyzing electrical generation data includes receiving data associated with a generating device at a metered location and storing the data associated with the generating device in a database, receiving data associated with time periods that the generating device is used at the metered location and storing the data in the database, associating the received data associated with a generating device with the data associated with time periods that the generating device is used at the metered location, processing the received data associated with a generating device with the data associated and the time periods that the generating device is used at the metered location to identify time periods that the generating device outputs electrical power to an electrical grid, and identifying a preferred time period that the generating device may be used to output power to the grid. | 2012-12-27 |
20120330848 | SYSTEM AND METHOD FOR ELECTRONIC CONTRACTING BETWEEN REMOTE PARTIES - A method carried out by an intermediary through an electronic contracting system, for establishing a contract between remote parties, comprising: receiving distinguishing information indicative of the first party's identity; receiving a document; establishing first party's acceptance of the document; generating a certificate of acceptance of the document; and sending the certificate of acceptance to at least one of the parties. A remote electronic contracting system, according to embodiments of the present invention may comprise at least a first communication device associated with a first party; at least a second communication device associated with a second party; and an electronic contracting unit associated with an intermediary; the first and second communication devices and the electronic contracting unit are connectable through a network, and wherein said electronic contracting unit is adapted to receive at least one document and an acceptance indication of said document and generate a certificate of acceptance. | 2012-12-27 |
20120330849 | METHODS, APPARATUS, AND SYSTEMS FOR PERFORMING INSTALLATIONS OF ENGINEERED SYSTEMS AND GENERATING SITE VISIT MANIFESTS FOR SAME - Improvements to an installation process for an engineered system involve consolidation of the number of visits to a work site by field staff and/or particular work performed in a given site visit. A site visit manifest is generated to provide electronic documentation of pre-installation and/or installation activity. Various types of electronic information may be generated and/or collected in connection with any of multiple possible phases of a given installation at a particular work site for purposes of generating a site visit manifest. Additionally, different information components of a site visit manifest may be selectively viewed/accessed (e.g., based on different levels of permission or access-rights) to facilitate one or more of review of the work performed, quality, productivity and/or cost assessments of same, and billing functions. Particular examples of improved processes relating to installation of Fiber to the Premises (FTTP) subscriber drops are provided. | 2012-12-27 |
20120330850 | MEASURING DEVICE, CONTAINER AND SYSTEM FOR MONITORING AND MANAGING A CONTAINER - A measuring device for detecting a filling status of a containing cavity suitable for containing non-homogenous objects of various nature includes a capacitive device that is positionable near the containing cavity and configured for detecting a variation in electric capacity caused by the presence of the objects so as to determine the filling status. A container is provided with the measuring device. A system is provided including the measuring device and a station configured for receiving and processing data provided by the measuring device, the system being configured for managing and monitoring the filling status and planning intervention activities on the containing cavity. The system is used for monitoring and managing urban waste. | 2012-12-27 |
20120330851 | METHOD AND SYSTEM FOR PROVIDING LICENSE INFORMATION - Information relating to intellectual property, across one or more intellectual property applications having various types of intellectual property data, can be provided and/or accessed in an integrated manner. Commonality(ies) are determined between disparate intellectual property applications, that may be applied by the intellectual property applications in accessing the intellectual property information. Responsive to a user request, which may include a specified commonality, stored information regarding the disparate data corresponding to the disparate intellectual property applications is retrieved. The commonality is utilized in bridging the gap to the intellectual property data for the disparate intellectual property applications. The bridging is provided by use of a commonality and by an IP engine. | 2012-12-27 |
20120330852 | FACILITY SAFETY AND COMPLIANCE INFORMATION SYSTEM - A facility safety and compliance information system is provided as a Web-based application for managing information about deficiencies and repairs to facilities, that are subject to health and safety codes, security measures, and production and maintenance standards. The facility safety and compliance information system can maintain facility quality and keep maintenance costs in line, while also reducing liability and satisfying other regulatory constraints. The facility safety and compliance information system leverages computer information system, network, and communication technologies for automating the collection of data and the generation of regulatory and compliance documentation, while also improving the timeliness and accuracy of a facilities reporting, preparedness, and adherence to safety and compliance codes. In an exemplary embodiment of the facility safety and compliance information system, a Firestopping Information System (FIS) is provided for managing information about deficiencies and repairs to facilities that are subject to fire safety codes. | 2012-12-27 |
20120330853 | BUSINESS INTELLIGENCE BASED SOCIAL NETWORK WITH VIRTUAL DATA-VISUALIZATION CARDS - A method for sharing business intelligence information includes creating a plurality of data visualization cards from business intelligence data in response to create requests from a plurality of user accounts. Each data visualization card is associated with the user account that requested its creation. Data visualization cards are also associated with user accounts that did not request their creation in response to collect requests from those user accounts. A social network is created amongst the user accounts using the data visualization cards such that user accounts associated with data visualization cards created from common business intelligence data are linked. A first data visualization card that was created in response to a create request from a first user account may then be provided to a second user account in response to determining that the first user account and the second user account are linked in the social network. | 2012-12-27 |
20120330854 | DISTRIBUTABLE REFERRAL DIRECTORY - A user-content generated network is provided for presenting business listings, as well as commentary and reviews of businesses, by participants of the network. In an embodiment, businesses can participate in the network and receive referrals from members of the network. The network can track and monitor referrals that individual businesses receive as a mechanism for promoting the business to other users in the network's user base. | 2012-12-27 |
20120330855 | Military Occupations and Skills Management System - Systems and methods are provided for translating military occupations and MOS codes into civilian skills and civilian occupations. The military duties associated with a MOS code are mapped to equivalent or relevant civilian skills and civilian occupations. A user's selection of MOS codes, subspecialties, trainings, licenses or work experiences are mapped to one or more civilian skills, which in turn can be mapped to one or more civilian occupations and used to generate a set of matching civilian jobs. | 2012-12-27 |
20120330856 | METHOD AND SYSTEM FOR CHANNEL OPTIMIZATION - A method for selecting a communication channel. The method includes identifying a job, identifying a target for the job, determining a characteristic of the target, obtaining analytic information using the characteristic, identifying, using the analytic information, a first communication channel of a plurality of communication channels over which to send a first job message for the job to the target, wherein a conversion rate associated with the first communication channel is higher than any conversion rate associated with any other of the plurality of communication channels and wherein the conversion rates are determined using the analytic information, and generating the first job message, wherein the first job message is associated with a first URL, and wherein the first URL is associated with the job, a sender, the target, and the first communication channel, and sending the first job message over the first communication channel to the target. | 2012-12-27 |
20120330857 | Online Community Service - A method for completing community service or serving the community voluntarily or as ordered by any authoritative or accredited body, such as a court Magistrate Judge, Public School System, Private School System, Scholarship Board, Probation Officer, Parole Officer, Officer of the Court, Deferment Program, Probation Program, Judicial Worker, Judge, District Attorney, Federal Attorney, Arbitrator, Mediator, Counselor, Case Worker, in lieu of fines, in lieu of jail time, in lieu of driver's license points or other repercussions and or suspensions, Magistrates, Clerks of the Court, Legal Aids, or any other type of court ordered community service online, on the internet, on the world wide web and or on mobile applications facilitated on computers, laptops, notebooks, mobile phones, tablets or any other type of input device that is user controlled and electronic in nature powered by electricity or connected by wireless signal or cable to other electronic devices. | 2012-12-27 |
20120330858 | DYNAMIC INVENTORY DISTRIBUTION SYSTEM - Embodiments include systems and methods of delivery DVDs, games, other electronically or computer readable media, or other high value items through the mail or via any other delivery service for return and redelivery to a second customer. For example, in one embodiment, items returned by a first customer are identified during processing of a container or mailer containing the item, the second customer is determined, a new address label is affixed to the container, and the item is delivered to the second customer. | 2012-12-27 |
20120330859 | INTERACTIVE BUSINESS PROCESS MODELING AND SIMULATION - Interactive business process modeling and simulation includes generating a business process model including mapping business processes with activities, logical gates, and decision paths of an enterprise. The interactive business process modeling and simulation also includes creating a business process simulation model by assigning a transaction to corresponding activities for business processes in the business process model, the business process simulation model including at least one entry transaction and transaction sequence for each of the activities. The interactive business process modeling and simulation further includes executing the business process simulation model by calling the entry transaction and displaying the entry transaction, loading input data and intermediate data into the business process simulation model, and executing transactions starting with the entry transaction and using the intermediate data and an output from execution of the entry transaction to feed a next one of the transactions configured by the business process simulation model. | 2012-12-27 |
20120330860 | SYSTEMS AND METHODS FOR MONITORING ORDERS IN AN EXCHANGE - A trading computer receives data regarding a change in the inside market for a product traded using a trading host. The computer determines a value of a highest bid price and a value of a lowest ask price and displays the values of the highest bid price and lowest offer price in a first and a second region, respectively, of a display. The trading computer also displays a plurality of values less than the value of the highest bid price in a first plurality of regions and a plurality of values greater than the value of the lowest offer price in a second plurality of regions. The location of the first region, the second region, the first plurality of regions, and the second region relative to each other remains constant even when the inside market changes. | 2012-12-27 |
20120330861 | SYSTEMS AND METHODS FOR PROVIDING INVESTMENT PERFORMEANCE DATA TO INVESTORS - Systems and methods for generating a performance index are described. A rank score is generated for each investor relative to a group of investors of which the investor is a member. Generation of the rank score uses investment data of a portfolio of the investor, and the portfolio comprises at least one investment position. A set of investors is selected from the group of investors, and the selection is based on the rank score of each investor. The performance index is generated to provide a measure of performance of top individual investors over time relative to a market index. Generation of the performance index includes generating a composite portfolio comprising investment positions of each portfolio of each investor of the set of investors. | 2012-12-27 |
20120330862 | Single-Stock Futures Contract (SSFC) - The “invention” described in this Application is a method, process, structure, system and formulation describing one way how to produce a “financial instrument” which can simultaneously: (1) permit an organization qualified to receive “tax deductible” donations under IRC §170(c)(2) and §2055(a)(2) to issue a “securities futures contract” (the “SSFC”) without violating the restrictions on transfer of restricted stock under SEC Rule 144; and (2) qualify the SSFC as an “exempt security” (not subject to registration or regulation under the Federal Securities Acts or the Commodities Trading Acts of the U.S. Government, when issued by a qualified “tax exempt organization” described in IRC §170(c)(2) and §501(c)(3)-); and (3) qualify the SSFC as a “securities futures contract” within the meaning of the definition in IRC §1234B; and (4) permit the “tacking” of the holding period (under IRC §1223(14)-) of the SSFC onto the holding period of the securities delivered pursuant to the SSFC (provided the SSFC not a §1256 contract); and (5) qualify the purchaser and/or holder of the SSFC, who remains as the holder of the securities delivered pursuant to the SSFC, to receive a charitable income tax deduction under IRC §170(a), or a charitable estate tax deduction under IRC §2055(a), equal to the ‘current market value’ of the donated securities (when the donated securities were received pursuant to the “securities futures contract” and held as a ‘capital asset’ by the holder for a combined holding period which is longer than one (1) year); without regard to the (possibly lesser) “cost basis” of the donor in the securities acquired pursuant to the SSFC; and, without regard to the (possibly shorter) holding period of the donated securities, if/when computed only from the date that the donated securities were delivered pursuant to the SSFC to the donor of the securities. | 2012-12-27 |
20120330863 | System and Method for Sharing Malware Analysis Results - In certain embodiments, a computer-implemented method includes accessing information related to a first file determined to satisfy at least one of a plurality of suspected malware conditions. A first of a number of manager consoles may access the information, each manager console being communicatively coupled to a respective network of a number of networks. A request may be generated for a determination of whether the first file comprises malware. The determination may be conducted at a master manager console. Data may be accessed indicating a result, outputted by the master manager console, of the determination of whether the first file comprises malware. A sharing policy may be accessed and used to determine whether the result is sharable with a second one of the manager consoles. If the result is sharable, a message comprising the result may be generated to be sent to the second manager console. | 2012-12-27 |
20120330864 | FAST PERSONALIZED PAGE RANK ON MAP REDUCE - A personalized page rank computation system is described herein that provides a fast MapReduce method for Monte Carlo approximation of personalized PageRank vectors of all the nodes in a graph. The method presented is both faster and less computationally intensive than existing methods, allowing a broader scope of problems to be solved by existing computing hardware. The system adopts the Monte Carlo approach and provides a method to compute single random walks of a given length for all nodes in a graph that it is superior in terms of the number of map-reduce iterations among a broad class of methods. The resulting solution reduces the I/O cost and outperforms the state-of-the-art FPPR approximation methods, in terms of efficiency and approximation error. Thus, the system can very efficiently perform single random walks of a given length starting at each node in the graph and can very efficiently approximate all the personalized PageRank vectors. | 2012-12-27 |
20120330865 | SYSTEM AND METHOD FOR FORMULATING A PROBLEM - A method for formulating a problem using a computational system is provided. The method includes determining an initial problem statement that characterizes the problem and identifying a plurality of factors affecting the problem. The method also includes generating a plurality of hypotheses associated with the problem based upon the identified factors and updating the initial problem statement to an updated problem statement using the initial problem statement, identified factors and the plurality of hypotheses. | 2012-12-27 |
20120330866 | SYSTEM AND METHOD FOR DETERMINING AN OPTIMUM QC STRATEGY FOR IMMEDIATE RELEASE RESULTS - The present invention proposes a method for optimizing a quality control strategy for rapid release results. An embodiment of the invention includes generating a set of candidate quality control rules and for each candidate rule, computing a maximum number of patient specimens that can be tested between quality control events while keeping the expected number of correctable unacceptable results below a predetermined correctable maximum and keeping the expected number of final unacceptable results below a predetermined final maximum. Furthermore a quality control utilization rate can be computed based on the number of patient specimens tested between each quality control event and the number of reference samples tested at each quality control event. The candidate rule for which the best quality control utilization rate may be selected along with the corresponding number of patients to be tested between each quality control as the optimum quality control strategy. | 2012-12-27 |
20120330867 | SYSTEMS AND METHODS FOR LARGE-SCALE RANDOMIZED OPTIMIZATION FOR PROBLEMS WITH DECOMPOSABLE LOSS FUNCTIONS - Systems and methods directed toward processing optimization problems using loss functions, wherein a loss function is decomposed into at least one stratum loss function, a loss is decreased for each stratum loss function to a predefined stratum loss threshold individually using gradient descent, and the overall loss is decreased to a predefined threshold for the loss function by appropriately ordering the processing of the strata and spending appropriate processing time in each stratum. Other embodiments and aspects are also described herein. | 2012-12-27 |
20120330868 | MATCHING APPARATUS AND NON-TRANSITORY COMPUTER READABLE STORAGE MEDIUM - The matching apparatus | 2012-12-27 |
20120330869 | Mental Model Elicitation Device (MMED) Methods and Apparatus - A mental-model elicitation process and apparatus, called the Mental-Model Elicitation Device (MMED) is described. The MMED is used to give rise to more effective end-user mental-modeling activities that require executive function and working memory functionality. The method and apparatus is visual analysis based, allowing visual and other sensory representations to be given to thoughts, attitudes, and interpretations of a user about a given visualization of a mental-model, or aggregations of such visualizations and their respective blending. Other configurations of the apparatus and steps of the process may be created without departing from the spirit of the invention as disclosed. | 2012-12-27 |
20120330870 | METHOD AND APPARATUS FOR A LOCAL COMPETITIVE LEARNING RULE THAT LEADS TO SPARSE CONNECTIVITY - Certain aspects of the present disclosure support a local competitive learning rule applied in a computational network that leads to sparse connectivity among processing units of the network. The present disclosure provides a modification to the Oja learning rule, modifying the constraint on the sum of squared weights in the Oja rule. This constraining can be intrinsic and local as opposed to the commonly used multiplicative and subtractive normalizations, which are explicit and require the knowledge of all input weights of a processing unit to update each one of them individually. The presented rule provides convergence to a weight vector that is sparser (i.e., has more zero elements) than the weight vector learned by the original Oja rule. Such sparse connectivity can lead to a higher selectivity of processing units to specific features, and it may require less memory to store the network configuration and less energy to operate it. | 2012-12-27 |
20120330871 | USING VALUES OF PRPD ENVELOPE TO CLASSIFY SINGLE AND MULTIPLE PARTIAL DISCHARGE (PD) DEFECTS IN HV EQUIPMENT - A method, system and computer program product for classifying types of partial discharge experienced by high voltage motors, reducing the labor and expertise required for such classification. This method, system and computer program product utilize feature extraction techniques to preprocess partial discharge measurements data to suit neural network input requirements. | 2012-12-27 |
20120330872 | CANONICAL SPIKING NEURON NETWORK FOR SPATIOTEMPORAL ASSOCIATIVE MEMORY - Embodiments of the invention relate to canonical spiking neurons for spatiotemporal associative memory. An aspect of the invention provides a spatiotemporal associative memory including a plurality of electronic neurons having a layered neural net relationship with directional synaptic connectivity. The plurality of electronic neurons configured to detect the presence of a spatiotemporal pattern in a real-time data stream, and extract the spatiotemporal pattern. The plurality of electronic neurons are further configured to, based on learning rules, store the spatiotemporal pattern in the plurality of electronic neurons, and upon being presented with a version of the spatiotemporal pattern, retrieve the stored spatiotemporal pattern. | 2012-12-27 |
20120330873 | Delay Generator Using a Programmable Resistor Based on a Phase-Change Material - A delay generator comprises at least one programmable resistor R | 2012-12-27 |
20120330874 | APPARATUSES, METHODS AND SYSTEMS FOR A DIGITAL CONVERSATION MANAGEMENT PLATFORM - The APPARATUSES, METHODS AND SYSTEMS FOR A DIGITAL CONVERSATION MANAGEMENT PLATFORM (“DCM-Platform”) transforms digital dialogue from consumers, client demands and, Internet search inputs via DCM-Platform components into tradable digital assets, and client needs based artificial intelligence campaign plan outputs. In one implementation, The DCM-Platform may capture and examine conversations between individuals and artificial intelligence conversation agents. These agents may be viewed as assets. One can measure the value and performance of these agents by assessing their performance and ability to generate revenue from prolonging conversations and/or ability to effect sales through conversations with individuals. | 2012-12-27 |
20120330875 | STRUCTURE INDEX - The present invention relates to a method for answering a query ( | 2012-12-27 |
20120330876 | METHODS AND SYSTEMS FOR GENERATING MEDICAL REPORTS - Disclosed is a networked database-driven system for facilitating the generation by multiple users of reports containing frequently occurring, repetitive, or predictable elements, through the system making predictions or suggestions regarding elements to insert into or changes to make to a currently edited report in progress by one user, through the use of user-defined report elements and user-defined relations between those elements, as well as the system's drawing upon collected data regarding prior reports and report elements entered into the system by previous report authors and inclusion or exclusion decisions made by previous report authors regarding those elements in relation to other report elements. | 2012-12-27 |
20120330877 | EFFICIENT BINARY PROTOCOL MARSHALLING FOR RULE ENGINE SESSIONS - Some embodiments of efficient binary protocol marshalling for rule engine sessions have been presented. In one embodiment, a set of marshalling plug-ins is provided to a rule engine. Each of the set of marshalling plug-ins is customized for a type of user objects. In response to encountering a user object, the rule engine selects a marshalling plug-in out of the set of marshalling plug-ins based on a type of the user object to marshall in or to marshall out the user object. | 2012-12-27 |
20120330878 | CONVENTIONS FOR INFERRING DATA MODELS - A programming environment may use a set of conventions that may infer database objects from memory objects or memory objects from database objects. The inferred objects may be referenced and used in the programming environment after being created by the set of conventions. The set of conventions may be added to or modified to create different results that are inferred by the conventions. Some conventions may be dependent on other conventions, and the dependencies may be modified by reordering the conventions or otherwise redefining the dependencies. In some embodiments, a versioning system may manage different versions of the convention sets for various upgrade scenarios. | 2012-12-27 |
20120330879 | REFLECTING THE QUANTITATIVE IMPACT OF ORDINAL INDICATORS - Embodiments of the invention may help improve the accuracy of individually tailored prognoses in dealing with individual patient prognoses for cancer, diabetes, multiple sclerosis, heart disease, and/or other diseases. Alternate embodiments of the invention may be useful in improving the accuracy of predictions in a variety of other contexts and fields. A method according to various embodiments of the invention includes generating a univariate impact reflecting index (UIRI) based on an indicator, the indicator having a monotonic relationship to a focal conclusion; and determining a probability that the focal conclusion will occur, wherein determining the probability is based at least partially on a regression analysis of the UIRI. | 2012-12-27 |
20120330880 | SYNTHETIC DATA GENERATION - The claimed subject matter provides a method for data generation. The method includes identifying a generative probability distribution based on one or more cardinality constraints for populating a database table. The method also includes selecting one or more values for a corresponding one or more attributes in the database table based on the generative probability distribution and the cardinality constraints. Additionally, the method includes generating a tuple for the database table. The tuple comprises the one or more values. | 2012-12-27 |
20120330881 | Evaluation of Next Actions by Customers - System, including method, apparatus, and computer-readable storage media, for evaluating probabilities of next actions by customers to permit selective customer targeting. Customer data ( | 2012-12-27 |
20120330882 | FACT CHECKING USING AND AIDING PROBABILISTIC QUESTION ANSWERING - A system and a computer program product for verifying a statement are provided. The system is configured to receive a statement. The system is configured to decompose the received statement into one or more sets of question and answer pairs. The system is configured to determine a confidence value of each answer in the one or more question and answer pair sets. The system is configured to combine the determined confidence values. The combined confidence values represent a probability that the received statement is evaluated as true. | 2012-12-27 |
20120330883 | PARETO SAMPLING USING SIMPLICIAL REFINEMENT BY DERIVATIVE PURSUIT - A method of optimizing a plurality of objectives includes the steps of initializing a set of simplices; selecting a simplex from the set of simplices; computing one or more weights based at least in part on the selected simplex; and generating a point on a tradeoff surface by utilizing the one or more weights in a weighted-sum optimization. | 2012-12-27 |
20120330884 | DECIDING AN OPTIMAL ACTION IN CONSIDERATION OF RISK - A method and system for deciding an optimal action in consideration of risk. The method includes the steps of: generating sequentially, by way of a Markov decision process based on a Monte Carlo method, a series of data having states on a memory of a computer; computing a risk measure of a present data by tracking generated data from opposite order to generation order, where the risk measure is calculated from a value at risk or an exceedance probability that is derived from risk measures of a plurality of states transitionable from a state of the present data; and executing the step of computing the risk measure while tracking back to starting data, where at least one of the steps is carried out using a computer device. | 2012-12-27 |
20120330885 | SEQUENCE LEARNING IN A HIERARCHICAL TEMPORAL MEMORY BASED SYSTEM - A hierarchy of computing modules is configured to learn a cause of input data sensed over space and time, and is further configured to determine a cause of novel sensed input data dependent on the learned cause. At least one of the computing modules has a sequence learner module configured to associate sequences of input data received by the computing module to a set of causes previously learned in the hierarchy. | 2012-12-27 |
20120330886 | ANNOTATING COLLABORATIVE INFORMATION STRUCTURES - Embodiments of the present invention address deficiencies of the art in respect to collaborative information object management and provide a method, system and computer program product for annotating collaborative information structures. In an embodiment of the invention, a method for annotating collaborative information structures can be provided. The method can include creating a collaborative information structure document (ISD) with each of an object section and an annotation section, adding a collaborative object in a collaborative computing environment to the object section of the collaborative ISD, adding an annotation for the collaborative ISD to the annotation section of the collaborative ISD, and storing the collaborative ISD for use as a collaborative object in the collaborative computing environment. | 2012-12-27 |
20120330887 | DISTRIBUTION AND SYNCHRONIZATION OF DIGITAL OBJECTS - Systems and methods are provided to facilitate distribution and synchronization of digital objects between a plurality of computing devices. In an embodiment, a master file catalog is maintained at a central server. As updates are made to digital object(s) on devices associated with the central server, file catalogs are forwarded to the master catalog which is updated accordingly. The master catalog can then be reviewed to facilitate file sharing in a peer-to-peer manner between the devices. In another embodiment, one-way hash pairings are created when a digital object is created/modified. Received hash pairings can be analysed to facilitate determination of whether two extants of a digital object are the same or different. Utilizing one-way hash pairings enable sensitive information regarding a digital object to remain secure, and sensitive information (and digital objects) is only shared between authenticated devices. | 2012-12-27 |
20120330888 | DATA BACKUP DEVICE - A data backup device is built into a device charging mechanism to provide automated data backup when a device is charged. Such a system results in regular data backups, as most users consistently charge their devices, such as their cell phones, smart phones, tablet computers, and the like. The charger/data backup device can integrate into a wireless network to provide remote access and additional backup options. The charger/data backup device can be configured to move data between electronic devices from multiple manufacturers or between electronic devices having different operating systems. | 2012-12-27 |
20120330889 | Video And Digital Multimedia Aggregator Remote Content Crawler - A remote content crawler continually crawls a digital communication network looking for content to provide to a content aggregator, The content provided to the aggregator may be stored in a form of an entire content file. The content may include an entire movie, television program or electronic book. Alternatively, the content provided to the aggregator may be a reference to a content file that is stored at, or that will he available at one of the remote locations. The content may be a reference to a future, scheduled live sports event that will be made available to system users. The sports event may be provided for a one time fee, as part of a sports package, for which a fee is collected, or as a free event. | 2012-12-27 |
20120330890 | PROPAGATING TABLES WHILE PRESERVING CYCLIC FOREIGN KEY RELATIONSHIPS - The invention meeting the need identified above is the “Enhanced Database Propagation Program” or (EDPP). EDPP uses a cyclic member table that identifies a first source table in a cyclic relationship with a second source table. The first source table, identified in the cyclic member table, propagates first. EDPP replaces all foreign keys with “NULL” in the first target table. After the second source table in the subscription set has propagated to a second target table, EDPP updates first target table with the foreign keys from the first source table. | 2012-12-27 |
20120330891 | METHOD AND APPARATUS FOR MANAGING SYNCHRONIZATION CONFIGURATION FILES - A method and apparatus for managing synchronization configuration files at a computing device is provided. It is determined that at least one configuration file has expired, the at least one configuration file associated with a second computing device and comprising data for synchronizing the second computing device with the computing device. A location of the at least one configuration file is then determined. The at least one configuration file is then deleted at the location. | 2012-12-27 |
20120330892 | CLIENT-BASED DATA REPLICATION - A client computing device having a processor and a memory receives, in response to a request, a replication layout from a replication controller. The client device initiates a data replication request at each of a plurality of data servers according to the replication layout. The client device receives, from each of the data servers, integrity information representing a state of a replication dataset at each of the servers. The client device transmits the integrity information to the replication controller. | 2012-12-27 |
20120330893 | DISTRIBUTED DATA STORE WITH A DESIGNATED MASTER TO ENSURE CONSISTENCY - One machine, i.e. computer, on a network, such as associated with a distributed database, e.g. a data store or a partition thereof, is designated as a master, which alone can issue system orderstamps for transactional operations, while other machines associated with the data store or partition thereof act as any of clients that submit transactions to the master, or as slaves that adhere to updates from the master. If a transactional operation on the distributed database is attempted on a client machine, and communication cannot be established with the master machine, the transaction fails. The distributed data store having such a master provides a method that decreases transaction time across the distributed database, and maintains consistent data between separate machines. | 2012-12-27 |
20120330894 | SYSTEM AND METHOD FOR PROVIDING A UNIFIED STORAGE SYSTEM THAT SUPPORTS FILE/OBJECT DUALITY - Methods and systems that permit file protocols and object protocols to co-exist using a file namespace and an object namespace in a unified storage system are disclosed. Data stored in the unified storage system are file-objects that preserve the behaviors expected by both file clients and object clients. | 2012-12-27 |
20120330895 | TRANSITIONING APPLICATION REPLICATION CONFIGURATIONS IN A NETWORKED COMPUTING ENVIRONMENT - Embodiments of the present invention provide an approach for providing non-disruptive transitioning of application replication configurations and proactive analysis of possible error scenarios. Specifically, under embodiments of the present invention, a common integration model (CIM)-compatible representation of a system replication plan is provided in a computer data structure. Based on the representation, a hierarchical tree data structure having a set of nodes is created. A set of system configuration updates pertaining to the set of nodes are then classified (e.g., based upon the type of configuration update). Once the set of nodes has been classified, the set of nodes may then be analyzed to determine if any nodes of the set are isomorphic. If so, the plan can be modified accordingly. In any event, the replication plan (or modified replication plan) may then be implemented. | 2012-12-27 |
20120330896 | ELECTRONIC DEVICE AND METHOD FOR MANAGING STORAGE OF DATA - A method of managing storage of address book data records at an electronic device includes provisioning, at the electronic device, a new Personal Information Manager (PIM) service account including address book functionality on the electronic device, automatically updating, by the electronic device, address book data records stored on the electronic device and not associated with another PIM service account to associate the address book data records with the new PIM service account provisioned on the electronic device in response to provisioning the new PIM service account, and sending, from the electronic device, the updated address book data records for storage at the PIM service account thereby merging the address book data records stored only at the electronic device with address book data records at the new PIM service account. | 2012-12-27 |
20120330897 | METHOD FOR MIRRORING A LOG FILE BY THRESHOLD DRIVEN SYNCHRONIZATION - A method for of accelerating database log hardening using specific per block data protection and damage control is provided. A per write specification is implemented to determine when database log data is mirrored synchronously or asynchronously. Synchronous mirroring is performed upon reaching a predetermined threshold, based on one or more parameters such as transaction value, both individual and cumulative, and the quantity of data written since the last synchronous mirroring. As data is added to the database log, it is written specifying asynchronous mirroring to the primary log file. Once a threshold is met, a write specifying synchronous mirroring is performed to both the primary and secondary log files, thereby hardening the log file in both primary and secondary storage subsystem. | 2012-12-27 |
20120330898 | AUTOMATIC DISCOVERY OF CACHE MIRROR PARTNERS IN AN N-NODE CLUSTER - Partner mirroring is provided with tray loss protection in an N node storage cluster architecture. A master proxy receives and records broadcasts of nodes in a cluster and selects mirror partners in a round robin fashion, so that even numbered nodes are mirrored with other even numbered nodes and odd numbered nodes are mirrored with other odd numbered nodes. In an N node storage cluster architecture which includes a cluster of dual controllers, tray loss protection is provided using such an odd numbered and even numbered mirror pairing process. | 2012-12-27 |
20120330899 | AUTOMATIC FAILOVER CONFIGURATION WITH LIGHTWEIGHT OBSERVER - Techniques used in an automatic failover configuration having a primary database system, a standby database system, and an observer for preventing divergence among the primary and standby database systems while increasing the availability of the primary database system. In the automatic failover configuration, the primary database system remains available even in the absence of both the standby and the observer as long as the standby and the observer become absent sequentially. The failover configuration further permits automatic failover only when the observer is present and the standby and the primary are synchronized and inhibits state changes during failover. The database systems and the observer have copies of failover configuration state and the techniques include techniques for propagating the most recent version of the state among the databases and the observer and techniques for using carefully-ordered writes to ensure that state changes are propagated in a fashion which prevents divergence. | 2012-12-27 |
20120330900 | DATABASE SAMPLING - The present subject matter relates to systems and methods for database sampling. The method comprises identifying at least one query table and one or more associated tables amongst a plurality of tables in a production database, based on filtering criteria. Further, the method comprises generating a key value list for the at least one query table and each of the one or more associated tables based on an order indicated by an order list. Based on the generated key value list, the sample data is extracted in a reverse order indicated by the order list, from the at least one query table and each of the one or more associated tables. | 2012-12-27 |
20120330901 | VALIDATION OF INGESTED DATA - Methods and systems for validating ingested data are disclosed. In accordance with the methods and systems, data elements can be received for storage in slots of an individual descriptor in a storage medium. In addition, at least one validation test can be selected based on a weighting of the data elements that indicates a respective degree of importance of the data elements. The selected validation test or tests can be applied to the data elements stored in the slots to generate respective validation results. Further, a validation score indicating a sufficiency of the stored data elements can be generated based on the validation results. | 2012-12-27 |
20120330902 | METHOD FOR ORDER INVARIANT CORRELATED ENCRYPTING OF DATA AND SQL QUERIES FOR MAINTAINING DATA PRIVACY AND SECURELY RESOLVING CUSTOMER DEFECTS - According to one embodiment of the present invention, a method for debugging a computer system is provided. According to one embodiment of the invention, a method includes encrypting data and query program instructions using correlated order invariant encrypting, the data and query program instructions operating in a customer computer system. The encrypted data and encrypted query program instructions are then transferred to a servicing entity having a test system. The encrypted data and encrypted query program instructions are run on the test system to generate a set of results. The set of results are then used to generate a diagnosis of a problem with the customer computer system. Thus the customer problem can be resolved without the servicing entity having access to the customer's data and query program instructions. | 2012-12-27 |
20120330903 | DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE - A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed. | 2012-12-27 |
20120330904 | EFFICIENT FILE SYSTEM OBJECT-BASED DEDUPLICATION - In accordance with one or more embodiments, an inode implemented file system may be utilized to support both offline and inline deduplication. When the first content is stored in the storage medium, one inode is used to associate a filename with the data blocks where the first content is stored. When a second content that is a duplicate of the first content is to be stored, then a parent inode is created to point to the data blocks in which a copy of the first content is stored. Further, two inodes are created, one representing the first content and the other representing the second content. Both inodes point to the same parent inode that points to the data blocks where the first content is stored. | 2012-12-27 |
20120330905 | METHOD FOR PRODUCING AND MANAGING A LARGE-VOLUME LONG - The present invention relates to a method for producing and managing a large-volume long-term archive which comprises an archive data memory and a management file, and to a corresponding long-term archive. The method according to the invention involves relocating archive data in a container file so that the legal validity of the data is maintained by virtue of qualified signing. | 2012-12-27 |
20120330906 | METHOD AND SYSTEMS FOR DETECTING DUPLICATE TRAVEL PATH - A system and method comprising: receiving itinerary data from at least two sources; identifying a traveler associated with the itinerary data; and adding information about the identified traveler to the itinerary data. | 2012-12-27 |
20120330907 | STORAGE SYSTEM FOR ELIMINATING DUPLICATED DATA - A storage system | 2012-12-27 |
20120330908 | SYSTEM AND METHOD FOR INVESTIGATING LARGE AMOUNTS OF DATA - A data analysis system is proposed for providing fine-grained low latency access to high volume input data from possibly multiple heterogeneous input data sources. The input data is parsed, optionally transformed, indexed, and stored in a horizontally-scalable key-value data repository where it may be accessed using low latency searches. The input data may be compressed into blocks before being stored to minimize storage requirements. The results of searches present input data in its original form. The input data may include access logs, call data records (CDRs), e-mail messages, etc. The system allows a data analyst to efficiently identify information of interest in a very large dynamic data set up to multiple petabytes in size. Once information of interest has been identified, that subset of the large data set can be imported into a dedicated or specialized data analysis system for an additional in-depth investigation and contextual analysis. | 2012-12-27 |
20120330909 | System and Method for Storing Data Streams in a Distributed Environment - Systems, methods and computer readable medium for storing data elements transmitted via data streams received from distributed devices connected via a network. The received data elements may be stored in block stores on the distributed devices. The stored data elements may be allocated to data blocks of a block store that have assigned block identifiers and further allocated to events of the data blocks. Stream schema of the received plurality of data streams may have the same stream schema, and indices may be generated indices based on the order of the event allocated data elements. Stream schema of the received data streams may comprise a list of token names. Token names may be assigned to the event allocated data elements. Indices may be generated for the event allocated data elements based on the stream schema. | 2012-12-27 |
20120330910 | 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. | 2012-12-27 |
20120330911 | AUTOMATIC GENERATION OF INSTANTIATION RULES TO DETERMINE QUALITY OF DATA MIGRATION - During migration of data from at least one data source to a target system, data quality is determined by obtaining metadata associated with the target system, automatically generating instantiated rules for assessing a quality of data to be loaded from the at least one data source into the target system, where the instantiated rules are dependent upon the obtained metadata associated with the target system, and applying a quality analysis based upon the instantiated rules to the data to be loaded into the target system. The quality analysis provides an indication of a level of compliance of the data with requirements of the target system. | 2012-12-27 |
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 |