Patent application number | Description | Published |
20080287439 | Pyrimidine compounds - The present invention relates to substituted pyrimidines of formula I, their preparation, pharmaceutical compositions containing them and their use as inhibitors of cyclin-dependent kinases (CDKs) and hence their use in the treatment of proliferative disorders and/or viral disorders. | 11-20-2008 |
20090215805 | 4-Heteroaryl Pyrimidine Derivatives and use thereof as Protein Kinase Inhibitors - The present invention relates to compounds of formula (I) or formula (II), or pharmaceutically acceptable salts thereof. Further aspects relate to pharmaceutical compositions comprising compounds according to the invention, and the use of said compounds in the preparation of a medicament for treating a variety of disorders, including proliferative disorders, viral disorders, stroke, etc. | 08-27-2009 |
20110257365 | Cyclin Based Inhibitors of CDK2 and CDK4 - Structural and functional analysis of peptide inhibitor binding to the cyclin D1 groove has been investigated and used to design peptides that provide the basis for structure-activity relationships, have improved binding and have potential for development as chemical biology probes, as potential diagnostics and as therapeutics in the treatment of proliferative diseases including cancer and inflammation. | 10-20-2011 |
20120202970 | Fragment Ligated Inhibitors Selective for the Polo Box Domain of PLK1 - Methods for developing non-peptidic inhibitors that target the polo-box domain of PLK1 proteins are described. Methods include developing structure activity relationships for peptidic inhibitors followed by development of non-peptide fragment alternatives for portions of the peptide inhibitors. The non-peptide fragment can provide similar structure activity relationship as the replaced peptide. Fragment alternatives to key binding determinants are identified in an iterative computational and synthetic process facilitated through understanding of the peptide structure-activity relationships. The approach is informed by peptide structure-activity data obtained through synthesis and testing of truncated and mutated analogs of known PBD binding motifs. | 08-09-2012 |
20130289240 | Cyclin Based Inhibitors of CDK2 and CDK4 - Structural and functional analysis of peptide inhibitor binding to the cyclin D and cyclin A groove has been investigated and used to design peptides that provide the basis for structure-activity relationships, have improved binding and have potential for development as chemical biology probes, as potential diagnostics and as therapeutics in the treatment of proliferative diseases including cancer and inflammation. | 10-31-2013 |
20140296484 | Cyclin Based Inhibitors of CDK2 and CDK4 - Structural and functional analysis of peptide inhibitor binding to the cyclin D and cyclin A groove has been investigated and used to design peptides that provide the basis for structure-activity relationships, have improved binding and have potential for development as chemical biology probes, as potential diagnostics and as therapeutics in the treatment of proliferative diseases including cancer and inflammation. | 10-02-2014 |
20140316107 | CYCLIN BASED INHIBITORS OF CDK2 AND CDK4 - Structural and functional analysis of peptide inhibitor binding to the cyclin D1 groove has been investigated and used to design peptides that provide the basis for structure-activity relationships, have improved binding and have potential for development as chemical biology probes, as potential diagnostics and as therapeutics in the treatment of proliferative diseases including cancer and inflammation. | 10-23-2014 |
20150315555 | Fragment Ligated Inhibitors Selective for the Polo Box Domain of PLK1 - Methods for developing non-peptidic inhibitors that target the polo-box domain of PLK1 proteins are described. Methods include developing structure activity relationships for peptidic inhibitors followed by development of non-peptide fragment alternatives for portions of the peptide inhibitors. The non-peptide fragment can provide similar structure activity relationship as the replaced peptide. Fragment alternatives to key binding determinants are identified in an iterative computational and synthetic process facilitated through understanding of the peptide structure-activity relationships. The approach is informed by peptide structure-activity data obtained through synthesis and testing of truncated and mutated analogs of known PBD binding motifs. | 11-05-2015 |
Patent application number | Description | Published |
20110145087 | REAL TIME ELECTRONIC COMMERCE TELECOMMUNICATION SYSTEM AND METHOD - An auction system and method, which identifies at least one lot to be auctioned, having a plurality of units within the lot and associated auction parameters; transmits a remaining quantity of units within the lot from a central server to a plurality of remote locations; receives bid identifications for remaining units within the lot at the contemporaneous offering price from the plurality of remote locations; and decrements the offering price over time. The decrement may be adaptive to a bid activity pattern, and the bid activity pattern may be stored in a database. A local server may be provided to communicate between the central server and remote locations while changing the format of the information communicated. The packets preferably include compressed information, and preferably include quantity remaining information for a plurality of auction lots. | 06-16-2011 |
20140122285 | REAL TIME ELECTRONIC COMMERCE TELECOMMUNICATION SYSTEM AND METHOD - An auction system and method, which identifies at least one lot to be auctioned, having a plurality of units within the lot and associated auction parameters; transmits a remaining quantity of units within the lot from a central server to a plurality of remote locations; receives bid identifications for remaining units within the lot at the contemporaneous offering price from the plurality of remote locations; and decrements the offering price over time. The decrement may be adaptive to a bid activity pattern, and the bid activity pattern may be stored in a database. A local server may be provided to communicate between the central server and remote locations while changing the format of the information communicated. The packets preferably include compressed information, and preferably include quantity remaining information for a plurality of auction lot. | 05-01-2014 |
20150332389 | REAL TIME ELECTRONIC COMMERCE TELECOMMUNICATION SYSTEM AND METHOD - An auction system and method, which identifies at least one lot to be auctioned, having a plurality of units within the lot and associated auction parameters; transmits a remaining quantity of units within the lot from a central server to a plurality of remote locations; receives bid identifications for remaining units within the lot at the contemporaneous offering price from the plurality of remote locations; and decrements the offering price over time. The decrement may be adaptive to a bid activity pattern, and the bid activity pattern may be stored in a database. A local server may be provided to communicate between the central server and remote locations while changing the format of the information communicated. The packets preferably include compressed information, and preferably include quantity remaining information for a plurality of auction lot. | 11-19-2015 |
Patent application number | Description | Published |
20080209650 | Oral hygiene devices - Oral hygiene devices employing an ultrasound transducer are disclosed. The device is user-activatable to commence an operating cycle, and has a controller that may provide a timing function and may provide a variable level of ultrasound transducer output during an operating cycle. The controller may provide a monitoring function that is capable of detecting an ultrasound transducer fault condition and alert a user, through a user interface, when an ultrasound transducer fault condition is detected. The controller may be programmed to count the number of device operating cycles or accumulate the total device operating time and activate a transducer replacement signal following a predetermined number of uses or a predetermined accumulated operating time. The ultrasound transducer assembly may be provided in operative communication with an ultrasound drive circuit and power supply by means of a transformer assembly that inductively couples and transfers power from the ultrasound drive circuit to the ultrasound transducer. | 09-04-2008 |
20110159461 | TOOTHBRUSH EMPLOYING ACOUSTIC WAVEGUIDE - A power toothbrush ( | 06-30-2011 |
20150174387 | COMBINED SONIC AND ULTRASONIC SKIN CARE DEVICE - Dermal infusion devices and methods are provided. The device is configured to direct two different frequencies of oscillating motion (e.g., sonic and ultrasonic) towards the skin of a subject. The combination of the two different frequencies results in improved dermal infusion capabilities and can be used, for example, to effect transdermal delivery of a topical formulation. | 06-25-2015 |
20150265825 | COMBINED SONIC AND IONTOPHORETIC SKIN CARE DEVICE - The present disclosure seeks to address the primary problem of long application durations to deliver an effective dose of an active ingredient. The devices combine mechanical motion with electrically induced flux (e.g., iontophoresis). The combination of techniques in a single device can reduce the treatment time required to deliver the active ingredient in an effective dose, or deliver a larger dose over the same duration of application. | 09-24-2015 |
20160089525 | SKIN TREATMENT APPLIANCE WITH CHANGEABLE WORKPIECE - The appliance includes an appliance body/handle and an interface assembly for receiving a detachable workpiece. The body/handle includes a signal-generating assembly with electrical connections to the appliance body interface. The signal-generating assembly is controlled by a microprocessor, which generates signals adapted to control and operate the workpiece which is attached to the appliance. A plurality of workpieces are included which are individually adapted for treating various spot skin irregularities. The appliance further includes a system for identifying the workpiece attached, so that appropriate operating signals can be generated and provided to the attached workpiece. | 03-31-2016 |
Patent application number | Description | Published |
20090064119 | Systems, Methods, And Computer Products For Compiler Support For Aggressive Safe Load Speculation - Systems, methods and computer products for compiler support for aggressive safe load speculation. Exemplary embodiments include a method for aggressive safe load speculation for a compiler in a computer system, the method including building a control flow graph, identifying both countable and non-countable loops, gathering a set of candidate loops for load speculation, for each candidate loop in the set of candidate loops gathered for load speculation performing computing an estimate of the iteration count, delay cycles, and code size, performing a profitability analysis and determine an unroll factor based on the delay cycles and the code size, transforming the loop by generating a prologue loop to achieve data alignment and an unrolled main loop with loop directives, indicating which loads can safely be executed speculatively and performing low-level instruction on the generated unrolled main loop. | 03-05-2009 |
20090064152 | SYSTEMS, METHODS AND COMPUTER PRODUCTS FOR CROSS-THREAD SCHEDULING - Systems, methods and computer products for cross-thread scheduling. Exemplary embodiments include a cross thread scheduling method for compiling code, the method including scheduling a scheduling unit with a scheduler sub-operation in response to the scheduling unit being in a non-multithreaded part of the code and scheduling the scheduling unit with a cross-thread scheduler sub-operation in response to the scheduling unit being in a multithreaded part of the code. | 03-05-2009 |
20130086338 | LINKING CODE FOR AN ENHANCED APPLICATION BINARY INTERFACE (ABI) WITH DECODE TIME INSTRUCTION OPTIMIZATION - A code sequence made up multiple instructions and specifying an offset from a base address is identified in an object file. The offset from the base address corresponds to an offset location in a memory configured for storing an address of a variable or data. The identified code sequence is configured to perform a memory reference function or a memory address computation function. It is determined that the offset location is within a specified distance of the base address and that a replacement of the identified code sequence with a replacement code sequence will not alter program semantics. The identified code sequence in the object file is replaced with the replacement code sequence that includes a no-operation (NOP) instruction or having fewer instructions than the identified code sequence. Linked executable code is generated based on the object file and the linked executable code is emitted. | 04-04-2013 |
20130086369 | COMPILING CODE FOR AN ENHANCED APPLICATION BINARY INTERFACE (ABI) WITH DECODE TIME INSTRUCTION OPTIMIZATION - Compiling code for an enhanced application binary interface (ABI) including identifying, by a computer, a code sequence configured to perform a variable address reference table function including an access to a variable at an offset outside of a location in a variable address reference table. The code sequence includes an internal representation (IR) of a first instruction and an IR of a second instruction. The second instruction is dependent on the first instruction. A scheduler cost function associated with at least one of the IR of the first instruction and the IR of the second instruction is modified. The modifying includes generating a modified scheduler cost function that is configured to place the first instruction next to the second instruction. An object file is generated responsive to the modified scheduler cost function. The object file includes the first instruction placed next to the second instruction. The object file is emitted. | 04-04-2013 |
20130086563 | COMPILING CODE FOR AN ENHANCED APPLICATION BINARY INTERFACE (ABI) WITH DECODE TIME INSTRUCTION OPTIMIZATION - A code sequence made up multiple instructions and specifying an offset from a base address is identified in an object file. The offset from the base address corresponds to an offset location in a memory configured for storing an address of a variable or data. The identified code sequence is configured to perform a memory reference function or a memory address computation function. It is determined that the offset location is within a specified distance of the base address and that a replacement of the identified code sequence with a replacement code sequence will not alter program semantics. The identified code sequence in the object file is replaced with the replacement code sequence that includes a no-operation (NOP) instruction or having fewer instructions than the identified code sequence. Linked executable code is generated based on the object file and the linked executable code is emitted. | 04-04-2013 |
20130086570 | LINKING CODE FOR AN ENHANCED APPLICATION BINARY INTERFACE (ABI) WITH DECODE TIME INSTRUCTION OPTIMIZATION - A code sequence made up multiple instructions and specifying an offset from a base address is identified in an object file. The offset from the base address corresponds to an offset location in a memory configured for storing an address of a variable or data. The identified code sequence is configured to perform a memory reference function or a memory address computation function. It is determined that the offset location is within a specified distance of the base address and that a replacement of the identified code sequence with a replacement code sequence will not alter program semantics. The identified code sequence in the object file is replaced with the replacement code sequence that includes a no-operation (NOP) instruction or having fewer instructions than the identified code sequence. Linked executable code is generated based on the object file and the linked executable code is emitted. | 04-04-2013 |
20130318510 | COMPILING CODE FOR AN ENHANCED APPLICATION BINARY INTERFACE (ABI) WITH DECODE TIME INSTRUCTION OPTIMIZATION - Generating decode time instruction optimization (DTIO) object code that enables a DTIO enabled processor to optimize execution of DTIO instructions. A code sequence configured to facilitate DTIO in a DTIO enabled processor is identified by a computer. The code sequence includes an internal representation (IR) of a first instruction and an IR of a second instruction. The second instruction is dependent on the first instruction. A schedule associated with at least one of the IR of the first instruction and the IR of the second instruction is modified. The modifying includes generating a modified schedule that is configured to place the first instruction next to the second instruction. An object file is generated based on the modified schedule. The object file includes the first instruction placed next to the second instruction. The object file is emitted. | 11-28-2013 |
Patent application number | Description | Published |
20100250355 | Redemption of Reward Points as Cash and Deposit of Cash to Checking, Savings or Other Accounts - Systems and methods of redeeming reward points for cash and depositing the cash to a checking or savings account of a user is presented. In some arrangements, the user will input account information relating to one or more checking or savings accounts. The information may be stored by the system. The user may select to redeem some or all of the reward points in his or her reward account balance as cash. Upon selection of this option, the user may select one or more of the saved accounts to which the funds will be deposited. In some arrangements, the redemption may occur automatically upon occurrence of a triggering event or meeting a predetermined threshold. | 09-30-2010 |
20120239465 | ALLOCATING REWARDS FROM A REWARDS ACCOUNT - A method for allocating rewards across a plurality of rewards programs, each associated with one or more accounts owned by a customer, the method includes receiving customer input indicating that one or more rewards associated with a first rewards program should be associated with a second rewards program, determining a conversion factor configured for assisting conversion of the one or more rewards from the first rewards program to the second rewards program, applying, using a processing device, the conversion factor to the one or more rewards, thereby resulting in one or more converted rewards; and associating the one or more converted rewards with the second rewards program. | 09-20-2012 |
20120239473 | APPLYING REWARDS BASED ON NON-TRANSACTION EVENTS - A method for providing a customer-centric rewards platform configured to communicate to a customer information related to one or more rewards programs associated with one or more customer accounts includes initiating presentation, using a processing device, to the customer of the rewards platform comprising information related to one or more rewards programs associated with the customer, wherein each of the rewards programs is associated with at least one customer account, determining a non-account transaction event indicating one or more rewards should be applied to one or more rewards accounts has occurred, each of the one or more rewards accounts associated with one or more customer accounts, and crediting one or more rewards accounts with one or more rewards based at least in part on the occurrence of the non-account transaction event. | 09-20-2012 |
20120239482 | CUSTOMER AWARENESS PLATFORM - A system and method for providing a customer-centric rewards interface configured to communicate to a customer information related to one or more rewards programs associated with one or more customer accounts includes authenticating an identity of the customer, receiving customer input requesting presentation of the rewards interface, and initiating presentation, using a processing device, to the customer of the rewards interface comprising information related to one or more rewards programs associated with the customer. | 09-20-2012 |