Patent application number | Description | Published |
20090063523 | MEMORY EFFICIENT REPRESENTATION OF RELATIONAL DATA WITH CONSTANT TIME RANDOM ACCESS TO THE DATA ITSELF - An efficient method for storing relational data in a memory space uses B tree and B+ tree structures to store data for a database where non-identical values are stored in a string buffer and pointers to the string buffer are stored in a table buffer, and where identical data is stored only once, and each instance of that value in the database is referenced by a pointer to such identical data corresponding to the locations in the database where that identical value exists, thereby preserving physical memory and increasing the storage capacity of a fixed memory space. | 03-05-2009 |
20090240947 | SYSTEM AND METHOD FOR SECURELY ACCESSING MOBILE DATA - The present invention provides a system and method for maintaining secure information on mobile devices and that balances security and convenience in the provision of mobile data access. Security is maintained by extending the use of industry-accepted two-factor authentication methods, and convenience is enhanced by utilizing a user's existing mobile device accessories as an authentication factor. As a result, the present invention provides a strong authentication system and method without the cost or burden of requiring the user to acquire additional hardware for security purposes. | 09-24-2009 |
20110107437 | SYSTEM FOR PROVIDING MOBILE DATA SECURITY - A system transfers applications and datasets (files) from a server to a client device and assigns to each file a lease key that will expire at a specified time. A file cannot be accessed unless its lease key is validated. Upon expiration of a lease key, the client device will connect to the server to determine if the lease key may be renewed. If the lease key may be renewed, a new lease key is created and access to the associated application or dataset is restored. If the lease key may not be renewed, the file may be deleted or rendered inaccessible. If rendered inaccessible, the file may be restored in the future without having to re-transmit it from the server to the client device. The server may also revoke a lease key before it expires. | 05-05-2011 |
20130276067 | SYSTEM FOR PROVIDING MOBILE DATA SECURITY - A system transfers applications and datasets (files) from a server to a client device and assigns to each file a lease key that will expire at a specified time. A file cannot be accessed unless its lease key is validated. Upon expiration of a lease key, the client device will connect to the server to determine if the lease key may be renewed. If the lease key may be renewed, a new lease key is created and access to the associated application or dataset is restored. If the lease key may not be renewed, the file may be deleted or rendered inaccessible. If rendered inaccessible, the file may be restored in the future without having to re-transmit it from the server to the client device. The server may also revoke a lease key before it expires. | 10-17-2013 |
20140006943 | OPERATING ROOM CHECKLIST SYSTEM | 01-02-2014 |
Patent application number | Description | Published |
20090030829 | Seller automated engine architecture and methodology for optimized pricing strategies in automated real-time iterative reverse auctions over the internet and the like for the purchase and sale of goods and services - An improved seller automated engine architecture methodology particularly (though not exclusively) for use in automated real-time iterative reverse auctions over the Internet and the like for the purchase and sale of goods and services, providing a choice of architectural implementations while enabling price optimization on market share-directed considerations, specific sales target-directed implementations, seller utility derivative-following implementations, model optimizer implementations and explorations, mathematical optimization-oriented and rules-based implementations. | 01-29-2009 |
20090099902 | System for and method of automatic optimizing quantitative business objectives of sellers (advertisers) with synergistic pricing, promotions and advertisements, while simultaneously minimizing expenditure discovery and optimizing allocation of advertising channels that optimize such objectives - An Internet system for and method of automatic optimizing quantitative business objectives of sellers (advertisers) with synergistic pricing, promotions and advertisements, while simultaneously minimizing expenditure and discovery and optimizing allocation of advertising channels that optimize such objectives. | 04-16-2009 |
20100169126 | Systems and methods for determining optimal pricing ans risk contol monitoring of auctioned assets including the automatic computation of bid prices for credit default swaps and the like - Embodiments of the invention provide an innovative, fully-automated system that facilitates the buying and selling of debt-based derivatives and other assets. The techniques described herein eliminate opaqueness, inefficiencies, and lack of risk monitoring and provide an end-to-end, highly efficient reverse-auction platform that considers many aspects of risk control and other parameters. This is accomplished while computing a true CDS price by incorporating reference entity, primary and secondary insurance company default risks. Furthermore, the reference entity pricing model decouples the borrower from the entity issuing the debt and eliminates rating inflation due to digital discontinuity. | 07-01-2010 |
20100191580 | METHOD, SYSTEM AND APPARATUS FOR AUTOMATIC REAL-TIME ITERATIVE COMMERCIAL TRANSACTIONS OVER THE INTERNET IN A MULTIPLE-BUYER, MULTIPLE-SELLER MARKETPLACE OPTIMIZING BOTH BUYER AND SELLER NEEDS BASED UPON THE DYNAMICS OF MARKET CONDITIONS - A method of communications network shopping by buyers of products and services for purchasing such from sellers in which buyers request an automatic reverse auctioneer or auction controller to initiate a reverse auction in real time amongst willing sellers and to solicit their automatic real-time iterative bidding price quotations for such products and services to be returned automatically over the network back to the controller under the iterative processing guidance of the controller to assure a best bid price quotation for the buyer; and automatically effecting buyer notification or purchase at such best price, all while the buyer may remain on-line, and without any manual intervention. | 07-29-2010 |
20110112923 | Seller automated engine methodology for optimized pricing strategies in automated real-time iterative reverse auctions over the internet and the like for the purchase and sale of goods and services - An improved seller automated engine architecture methodology particularly (though not exclusively) for use in automated real-time iterative reverse auctions over the Internet and the like for purchase and sale of goods and services, providing a choice of architectural implementations while enabling price optimization on market share-directed considerations, specific sales target-directed implementations, seller utility derivative-following implementations, model optimizer implementations and explorations, mathematical optimization-oriented and rules-based implementations. | 05-12-2011 |
20110112924 | Seller automated engine architecture for optimized pricing strategies in automated real-time iterative reverse auctions over the internet and the like for the purchase and sale of goods and services - An improved seller automated engine architecture methodology particularly (though not exclusively) for use in automated real-time iterative reverse auctions over the Internet and the like for purchase and sale of goods and services, providing a choice of architectural implementations while enabling price optimization on market share-directed considerations, specific sales target-directed implementations, seller utility derivative-following implementations, model optimizer implementations and explorations, mathematical optimization-oriented and rules-based implementations. | 05-12-2011 |
20110125605 | SYSTEMS AND METHODS FOR IMPLEMENTING AUCTIONS ON SOCIAL NETWORK PLATFORMS - A system platform and associated methods are provided for implementing online reverse auctions in a social network platform (SNP). A fully-automated, live, reverse-auction based system is integrated into an SNP to enable buyers to initiate desired transactions and take advantage of a subscribers' network of friends, colleagues, co-workers, family members and connections by connecting buyers and sellers in a non-intrusive, targeted fashion. Sellers compete for buyers' business by providing dynamic, real-time seller-specific pricing while simultaneously optimizing the seller's target parameters such as price, inventory levels, profit, revenue and volume. | 05-26-2011 |
20110231228 | SELLER AUTOMATED ENGINE ARCHITECTURE AND METHODOLOGY FOR OPTIMIZED PRICING STRATEGIES OF GOODS AND SERVICES - An improved seller automated engine architecture methodology particularly (though not exclusively) for use in automated real-time iterative reverse auctions and/or price quotations over the Internet and the like for purchase and sale of goods and services, providing a choice of architectural implementations while enabling price optimization on market share-directed considerations, specific sales target-directed implementations, seller utility derivative-following implementations, model optimizer implementations and explorations, mathematical optimization-oriented and rules-based implementations. | 09-22-2011 |
20130297428 | System For And Method Of Automatic Optimizing Quantitative Business Objectives Of Sellers (Advertisers) With Synergistic Pricing, Promotions and Advertisements, While Simultaneously Minimizing Expenditures and Discovery and Optimizing Allocation Of Advertising Channels That Optimize Such Objectives - An Internet system for and method of automatic optimizing quantitative business objectives of sellers (advertisers) with synergistic pricing, promotions and advertisements, while simultaneously minimizing expenditure and discovery and optimizing allocation of advertising channels that optimize such objectives. | 11-07-2013 |
20130311320 | METHOD, SYSTEM AND APPARATUS FOR AUTOMATIC REAL-TIME ITERATIVE COMMERCIAL TRANSACTIONS OVER THE INTERNET IN A MULTIPLE-BUYER, MULTIPLE-SELLER MARKETPLACE OPTIMIZING BOTH BUYER AND SELLER NEEDS BASED UPON THE DYNAMICS OF MARKET CONDITIONS - A method of communications network shopping by buyers of products and services for purchasing such from sellers in which buyers request an automatic reverse auctioneer or auction controller to initiate a reverse auction in real time amongst willing sellers and to it their automatic real-time iterative bidding price quotations for such products and services to be returned automatically over the network back to the controller under the iterative processing guidance of the controller to assure a best bid price quotation for the buyer; and automatically effecting buyer notification or purchase at such best price, all while the buyer may remain online, and without any manual intervention. | 11-21-2013 |
20130311351 | Systems and Methods for Determining Optimal Pricing and Risk Control Monitoring of Auctioned Assets Including the Automatic Computation of Bid Prices for Credit Default Swaps and the Like - Embodiments of the invention provide an innovative, fully-automated system that facilitates the buying and selling of debt-based derivatives and other assets. The techniques described herein eliminate opaqueness, inefficiencies, and lack of risk monitoring and provide an end-to-end, highly efficient reverse-auction platform that considers many aspects of risk control and other parameters. This is accomplished while computing a true CDS price by incorporating reference entity, primary and secondary insurance company default risks. Furthermore, the reference entity pricing model decouples the borrower from the entity issuing the debt and eliminates rating inflation due to digital discontinuity. | 11-21-2013 |
20140019257 | METHOD, SYSTEM AND APPARATUS FOR AUTOMATIC REAL-TIME ITERATIVE COMMERCIAL TRANSACTIONS OVER THE INTERNET IN A MULTIPLE-BUYER, MULTIPLE-SELLER MARKETPLACE OPTIMIZING BOTH BUYER AND SELLER NEEDS BASED UPON THE DYNAMICS OF MARKET CONDITIONS - A method of communications network shopping by buyers of products and services for purchasing such from sellers in which buyers request an automatic reverse auctioneer or auction controller to initiate a reverse auction in real time amongst willing sellers and to it their automatic real-time iterative bidding price quotations for such products and services to be returned automatically over the network back to the controller under the iterative processing guidance of the controller to assure a best bid price quotation for the buyer; and automatically effecting buyer notification or purchase at such best price, all while the buyer may remain online, and without any manual intervention. | 01-16-2014 |
20140222589 | System For And Method Of Automatic Optimizing Quantitative Business Objectives Of Sellers (Advertisers) With Synergistic Pricing, Promotions and Advertisements, While Simultaneously Minimizing Expenditures and Discovery and Optimizing Allocation Of Advertising Channels That Optimize Such Objectives - A system for and method of automatic optimizing quantitative business objectives of sellers (advertisers) with synergistic pricing, promotions and advertisements, while simultaneously minimizing expenditure and discovery and optimizing allocation of advertising channels that optimize such objectives. | 08-07-2014 |
20140222590 | System For And Method Of Automatic Optimizing Quantitative Business Objectives Of Sellers (Advertisers) With Synergistic Pricing, Promotions and Advertisements, While Simultaneously Minimizing Expenditures and Discovery and Optimizing Allocation Of Advertising Channels That Optimize Such Objectives - A system for and method of automatic optimizing quantitative business objectives of sellers (advertisers) with synergistic pricing, promotions and advertisements, while simultaneously minimizing expenditure and discovery and optimizing allocation of advertising channels that optimize such objectives. | 08-07-2014 |
20140244419 | Implementing Auctions on Social Network Platforms - A system platform and associated methods are provided for implementing online reverse auctions in a social network platform (SNP). A fully-automated, live, reverse-auction based system is integrated into an SNP to enable buyers to initiate desired transactions and take advantage of a subscribers' network of friends, colleagues, co-workers, family members and connections by connecting buyers and sellers in a non-intrusive, targeted fashion. Sellers compete for buyers' business by providing dynamic, real-time seller-specific pricing while simultaneously optimizing the seller's target parameters such as price, inventory levels, profit, revenue and volume. | 08-28-2014 |
20140244420 | Group Formation and Dynamic Pricing for E-Commerce in Social Networks - A system platform and associated methods are provided for implementing online reverse auctions in a social network platform (SNP). A fully-automated, live, reverse-auction based system is integrated into an SNP to enable buyers to initiate desired transactions and take advantage of a subscribers' network of friends, colleagues, co-workers, family members and connections by connecting buyers and sellers in a non-intrusive, targeted fashion. Sellers compete for buyers' business by providing dynamic, real-time seller-specific pricing while simultaneously optimizing the seller's target parameters such as price, inventory levels, profit, revenue and volume. | 08-28-2014 |
Patent application number | Description | Published |
20090256570 | Method For Joint Sparsity-Enforced K-Space Trajectory and Radiofrequency Pulse Design - A system and method is provided for simultaneously designing a radiofrequency (“RF”) pulse waveform and a magnetic field gradient waveform in a magnetic resonance imaging (“MRI”) system. The method includes determining a desired pattern of RF excitation and determining, from the desired pattern of RF excitation, a plurality of k-space locations indicative of the magnetic field gradient waveform and a plurality of complex weighting factors indicative of RF energy deposited at each k-space location. The method also includes calculating, from the determined k-space locations, the magnetic field gradient waveform and calculating, from the complex weighting factors, the RF pulse waveform that will produce the desired pattern of RF excitation when produced with the calculated magnetic field gradient. | 10-15-2009 |
20100052679 | Coil Array Mode Compression For Parallel Transmission Magnetic Resonance Imaging - A method for target-dependent, sparsity-enforced selection for choosing a substantially optimal connection of radiofrequency (“RF”) transmitters to the elements of the RF coil array is provided. In particular, a method is provided that selects the linear combinations of the “N” spatial mode profiles of a transmission RF coil array, such that the k-space trajectory and pulse duration acceleration capabilities of the array are advantageously utilized. A sparsity-enforcement method that determines a subset of the available spatial modes for a parallel transmission RF coil array is employed to this end. In this manner, the utilization of the encoding power of a highly-parallel N-mode coil array in a system with only “P” available excitation channels is enabled. | 03-04-2010 |
20120081114 | System for Accelerated MR Image Reconstruction - An MR imaging system uses the multiple RF coils for acquiring corresponding multiple image data sets of the slice. An image data processor comprises at least one processing device conditioned for, generating a composite MR image data set representing a single image in a single non-iterative operation by performing a weighted combination of luminance representative data of individual corresponding pixels of the multiple image data sets in providing an individual pixel luminance value of the composite MR image data set. The image data processor reduces noise in the composite MR image data set by generating a reduced set of significant components in a predetermined transform domain representation of data representing the composite image to provide a de-noised composite MR image data set. An image generator comprises at least one processing device conditioned for, generating a composite MR image using the de-noised composite MR image data set. | 04-05-2012 |
20130044213 | SYSTEM AND METHOD FOR DIFFUSE IMAGING WITH TIME-VARYING ILLUMINATION INTENSITY - Diffuse image measurement system and digital image formation method. The system includes a source of light with time-varying intensity directed at a scene to be imaged. A time-resolved light meter is provided for receiving light reflected from the scene to generate time-resolved samples of the intensity of light incident at the light meter. The temporal variation in the intensity of light incident at the light meter is associated with a function of a radiometric property of the scene, such as a linear functional of reflectance, and a computer processes the samples to construct a digital image. The spatial resolution of the digital image is finer than the spatial support of the illumination on the scene and finer than the spatial support of the sensitivity of the light meter. Using appropriate light sources instead of impulsive illumination significantly improves signal-to-noise ratio and reconstruction quality. | 02-21-2013 |
20130088225 | System for Reconstructing MRI Images Acquired in Parallel - A system for parallel image processing in MR imaging comprises multiple MR imaging RF coils for individually receiving MR imaging data representing a slice of patient anatomy. An MR imaging system uses the multiple RF coils for acquiring corresponding multiple image data sets of the slice. An image data processor comprises at least one processing device conditioned for, deriving a first set of weights for generating a calibration data set comprising a subset of k-space data of composite image data representing the multiple image data sets. The at least one processing device uses the calibration data set in generating a first MR image data set, deriving a second set of weights using the calibration data set and the generated first MR image data set and uses the second set of weights in generating a second MR image data set representing a single image having a reduced set of data components relative to the first composite MR image data set. | 04-11-2013 |
20130088726 | Method and Apparatus to Determine Depth Information For A Scene of Interest - Depth information about a scene of interest is acquired by illuminating the scene, capturing reflected light energy from the scene with one or more photodetectors, and processing resulting signals, in at least one embodiment, a pseudo-randomly generated series of spatial light modulation patterns is used to modulate the light pulses either before or after reflection. | 04-11-2013 |
20130207652 | System for Accelerated Magnetic Resonance Imaging Using Parallel Coils - An MR imaging system uses multiple RF coils for acquiring corresponding multiple image data sets of a slice or volume of patient anatomy. An image data processor comprises at least one processing device conditioned for, deriving a first set of weights for weighted combination of k-space data of the multiple image data sets for generating a calibration data set comprising a subset of k-space data of composite image data representing the multiple image data sets. The image data processor uses the calibration data set in generating a first MR image data set, deriving the parameters of a probability distribution in response to the first set of weights and the first MR image data set and deriving a second set of weights and second MR image data set together using the probability distribution. | 08-15-2013 |
20140184273 | Energy-Efficient Time-Stampless Adaptive Nonuniform Sampling - Described herein is a sampling system and related sampling scheme. The system and sampling scheme is based upon a framework for adaptive non-uniform sampling schemes. In the system and schemes described herein, time intervals between samples can be computed by using a function of previously taken samples. Therefore, keeping sampling times (time-stamps), except initialization times, is not necessary. One aim of this sampling framework is to provide a balance between reconstruction distortion and average sampling rate. The function by which sampling time intervals can be computed is called the sampling function. The sampling scheme described herein can be applied appropriately on different signal models such as deterministic or stochastic, and continuous or discrete signals. For each different signal model, sampling functions can be derived. | 07-03-2014 |