Patent application number | Description | Published |
20080249940 | Transaction Accounting Processing System and Approach - Accounting data is classified to facilitate transaction processing and management. According to an example embodiment, data based rules are implemented for generating transaction data using stored rules and identified valid accounting codes. Transaction information is processed as a function of the rules and generated transaction data (e.g., for classifying expenses under generated valid accounting codes). This approach involves, for example, identifying data based rules and valid accounting codes to use in processing received transaction information and in generating/applying accounting codes to the transaction information. | 10-09-2008 |
20090292630 | Transaction Accounting Auditing Approach and System Therefor - Accounting data is classified to facilitate transaction processing and management. According to an example embodiment, data based rules are implemented for classifying transaction-related data into accounting categories. Accounting information is processed as a function of the data based rules and accordingly automatically classified. This processing involves, for example, the identification of particular data based rules to apply to the accounting information, applying the rules and processing the information accordingly. | 11-26-2009 |
20100185540 | ORDER-RESOURCE FULFILLMENT AND MANAGEMENT SYSTEM AND APPROACH - Historical data is used to manage and authorize payment for merchant offerings for transactions among a plurality of transaction parties. According to an example embodiment of the present invention, invoiced item quantities are processed using historical fulfilled and billed quantities of each item. If invoiced item quantities involved items that have been fulfilled but not billed, payment for the invoiced items is authorized. If some or all of the invoiced items have not been fulfilled or have been previously billed, payment authorization is withheld for at least the portion of unfulfilled or previously billed (and paid) invoiced items. With this approach, historical information relative to order fulfillment and payment status is used to automatically process invoices (e.g., audit the invoices for payment). | 07-22-2010 |
20120158558 | AUTOMATED TRANSACTION ACCOUNTING PROCESSING ENGINE AND APPROACH - Accounting data is classified to facilitate transaction processing and management. According to an example embodiment, data based rules are implemented for classifying transaction-related data into accounting categories. Accounting information is processed as a function of the data based rules and accordingly classified. This approach involves, for example, the identification of particular data based rules to apply to the accounting information, applying the rules and processing the information accordingly. | 06-21-2012 |
Patent application number | Description | Published |
20110179852 | Molecule Detection Device Formed in a Semiconductor Structure - Semiconductor devices, chromatography devices and integrated circuits for detecting one or more molecules and methods for forming a semiconductor device for detecting one or more molecules are presented. For example, a semiconductor device for detecting one or more molecules includes a channel formed within a semiconductor structure, and at least one detector formed within the semiconductor structure. The at least one detector detects the one or more molecules in the channel The semiconductor device may optionally comprise one or more additional channels formed within the semiconductor structure. The semiconductor device may, for example, be operative to detect a single molecule. | 07-28-2011 |
20120158316 | PRECISION PEAK MATCHING IN LIQUID CHROMATOGRAPHY-MASS SPECTROSCOPY - A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner. | 06-21-2012 |
20120158317 | PRECISION PEAK MATCHING IN LIQUID CHROMATOGRAPHY-MASS SPECTROSCOPY - A method that identifies common peaks among unidentified peaks in the data from different LC-MS or LC-MS/MS runs is provided. The method employs an algorithm, herein referred to as “Precision Peak Matching (PPM).” The different runs can be from different laboratories, instruments, and biological samples that result in a significant variability in the data. PPM allows estimation and control of precision, defined as the fraction of truly identical peptide pairs among all pairs retrieved, in the matching process. PPM finds the maximal number of peptide pairs at a prescribed precision, thereby allowing quantitative control over the trade off between the number of true pairs missed, and false pairs found. PPM finds common peptides from a database of LC-MS runs of heterogeneous origins, and at the specified precision. PPM fills a much-needed role in proteomics by extracting useful information from disparate LC-MS databases in a statistically rigorous and interpretable manner. | 06-21-2012 |
20120323985 | ALIGNMENT OF MULTIPLE LIQUID CHROMATOGRAPHY-MASS SPECTROMETRY RUNS - The problem of aligning multiple liquid chromatography mass spectrometry (LC-MS) runs to a common reference time frame is solved to facilitate comparison among LC-MS runs. The alignment of multiple LCMS can be achieved by solving a sparse system of linear equations to optimally stretch or compress local retention times for maximal similarity among the multiple runs. The multiple LCMS runs can be aligned simultaneously, thereby providing the advantage of efficient use of data by employing a sparse solver. A method of quality control in retention time alignment is also provided. | 12-20-2012 |