Patent application number | Description | Published |
20090042961 | OXIME DERIVATIVE SUBSTITUTED HYDROXYETHYLAMINE ASPARTYL PROTEASE INHIBITORS - The invention relates to novel compounds and methods of treating diseases, disorders, and conditions associated with amyloidosis. Amyloidosis refers to a collection of diseases, disorders, and conditions associated with abnormal deposition of A-beta protein. | 02-12-2009 |
20090270367 | SUBSTITUTED HYDROXYETHYLAMINE ASPARTYL PROTEASE INHIBITORS - The invention relates to novel compounds and also to methods of treating at least one disease, disorder, or condition associated with amyloidosis using such compounds. Amyloidosis refers to a collection of diseases, disorders, and conditions associated with abnormal deposition of A-beta protein. | 10-29-2009 |
20100081680 | N-SULFONAMIDO POLYCYCLIC PYRAZOLYL COMPOUNDS - The current invention provides compounds having a structure according to Formulae 1, 2, 3, and 4: | 04-01-2010 |
20110034691 | Process for the Production of Fused, Tricyclic Sulfonamides - The present invention provides methods, i.e., scalable or large-scale processes for the production of fused, tricyclic sulfonamido analogs, such as substituted or unsubstituted 5-(aryl-sulfonyl)-4,5-dihydro-1H-pyrazolo[4,3-c]quinolines and 5-(heteroaryl-sulfonyl)-4,5-dihydro-1H-pyrazolo[4,3-c]quinolines. Exemplary methods of the invention include an intra-molecular cyclization step, in which a carbon-nitrogen bond is formed, and which employs a copper-based catalyst that contains at least one organic ligand, such as DMEDA. The invention further provides compounds, which are useful as intermediates in the methods of the invention. | 02-10-2011 |
Patent application number | Description | Published |
20090298806 | FACTOR XA INHIBITORS - The present invention is directed to compounds represented by Formula I and pharmaceutically acceptable salts, solvates, hydrates, and prodrugs thereof which are inhibitors of Factor Xa. The present invention is also directed to and intermediates used in making such compounds, pharmaceutical compositions containing such compounds, methods to prevent or treat a number of conditions characterized by undesired thrombosis and methods of inhibiting the coagulation of a blood sample. | 12-03-2009 |
20100234352 | FACTOR XA INHIBITORS - The present invention is directed to compounds represented by Formula (I) or a pharmaceutically acceptable salt, ester, or prodrug thereof which are inhibitors of Factor Xa. The present invention is also directed to and intermediates used in making such compounds, pharmaceutical compositions containing such compounds, methods to prevent or treat a number of conditions characterized by undesired thrombosis and methods of inhibiting the coagulation of a blood sample. | 09-16-2010 |
20100331335 | Inhibitors of Jun N-Terminal Kinase - The present disclosure provides inhibitors of c-Jun N-terminal kinases (JNK) having a structure according to the following formula: | 12-30-2010 |
20120178733 | FACTOR XA INHIBITORS - The present invention is directed to compounds represented by Formula I and pharmaceutically acceptable salts, solvates, hydrates, and prodrugs thereof which are inhibitors of Factor Xa. The present invention is also directed to and intermediates used in making such compounds, pharmaceutical compositions containing such compounds, methods to prevent or treat a number of conditions characterized by undesired thrombosis and methods of inhibiting the coagulation of a blood sample. | 07-12-2012 |
20130072494 | INHIBITORS OF JUN N-TERMINAL KINASE - The present disclosure provides inhibitors of c-Jun N-terminal kinases (JNK) having a structure according to the following formula: | 03-21-2013 |
20140363454 | Antibody-Drug Conjugates, Compositions and Methods of Use - Antibody-cytotoxin antibody-drug conjugates and related compounds, such as linker-cytotoxin conjugates and the linkers used to make them, tubulysin analogs, and intermediates in their synthesis; compositions; and methods, including methods of treating cancers. | 12-11-2014 |
20150259330 | INHIBITORS OF JUN N-TERMINAL KINASE - The present disclosure provides inhibitors of c-Jun N-terminal kinases (JNK) having a structure according to the following formula: | 09-17-2015 |
Patent application number | Description | Published |
20090285205 | UNIFIED MESSAGE SYSTEM - The present invention provides a method and devices for unified messaging. One method provides for receiving a message having a first identifier associated with a user, translating the first identifier associated with the user to a second identifier comprising a zip code and a street address, the second identifier being associated with a network address, and sending the message to the user at the network address. A line interface device of the present invention is associated with an address that comprises a zip code. | 11-19-2009 |
20110130129 | METHOD FOR DATA INTERCHANGE - A method for data interchange includes summing up data associated with an electronic document to provide summed up data, representing the summed up data as one or more bar codes, and returning the one or more bar codes for display and data capture via a bar code scan from either a video display or a printed version of the one or more bar codes. The electronic document may be of any number of formats. The summing up may include taking data from multiple information fields to create the summed up data. The data may include data tags or a step of adding data tags to the data to assist in data interchange may be performed. | 06-02-2011 |
20110188541 | HIGH BANDWIDTH DATA TRANSPORT SYSTEM - The present invention provides for a methods, system, and apparatus relating to data transmission. One method of the present invention includes representing data using at least one ultra wideband pulse, sending the at least one ultra wideband pulse over an electrically conductive guided media, and recovering the data from the at least one ultra wideband pulse. The present invention can be used in conjunction with telephony applications, cable TV applications, power line applications, fiber optic applications, and data bus applications. | 08-04-2011 |
20130001297 | METHODS AND SYSTEMS FOR DATA INTERCHANGE - A method for data interchange includes summing up data associated with an electronic document to provide summed up data, representing the summed up data as one or more bar codes, and returning the one or more bar codes for display and data capture via a bar code scan from either a video display or a printed version of the one or more bar codes. The electronic document may be of any number of formats. The summing up may include taking data from multiple information fields to create the summed up data. The data may include data tags or a step of adding data tags to the data to assist in data interchange may be performed. | 01-03-2013 |
20130299572 | METHODS AND SYSTEMS FOR DATA INTERCHANGE - A method for data interchange includes summing up data associated with an electronic document to provide summed up data, representing the summed up data as one or more bar codes, and returning the one or more bar codes for display and data capture via a bar code scan from either a video display or a printed version of the one or more bar codes. The electronic document may be of any number of formats. The summing up may include taking data from multiple information fields to create the summed up data. The data may include data tags or a step of adding data tags to the data to assist in data interchange may be performed. | 11-14-2013 |
20140064288 | SYSTEM AND METHOD FOR STORING/CACHING, SEARCHING FOR, AND ACCESSING DATA - A system for persistently maintaining data using a network for data packets is provided. The system includes a transmission medium associated with the network, a plurality of switches operatively connected to the transmission medium. Each switch has an intelligent network controller adapted for delivering the data packets to a device operatively connected to the intelligent network controller in response to a request for the data packets from the device and further adapted for re-transmitting unexpired data packets over the network. | 03-06-2014 |
20150078393 | SYSTEM AND METHOD FOR STORING/CACHING, SEARCHING FOR, AND ACCESSING DATA - A system for persistently maintaining data using a network for data packets is provided. The system includes a transmission medium associated with the network, a plurality of switches operatively connected to the transmission medium. Each switch has an intelligent network controller adapted for delivering the data packets to a device operatively connected to the intelligent network controller in response to a request for the data packets from the device and further adapted for re-transmitting unexpired data packets over the network. | 03-19-2015 |
20160117319 | METHODS AND SYSTEMS FOR DATA INTERCHANGE - A method for data interchange includes summing up data associated with an electronic document to provide summed up data, representing the summed up data as one or more bar codes, and returning the one or more bar codes for display and data capture via a bar code scan from either a video display or a printed version of the one or more bar codes. The electronic document may be of any number of formats. The summing up may include taking data from multiple information fields to create the summed up data. The data may include data tags or a step of adding data tags to the data to assist in data interchange may be performed. | 04-28-2016 |
Patent application number | Description | Published |
20090076989 | AUTOMATED CLASSIFICATION ALGORITHM COMPRISING AT LEAST ONE INPUT-INVARIANT PART - A classification algorithm is separated into one or more input-invariant parts and one or more input-dependent classification parts. The input-invariant parts of the classification algorithm capture the underlying and unchanging relationships between the plurality of data elements being operated upon by the classification algorithm, whereas the one or more classification parts embody the probabilistic labeling of the data elements according to the various classifications. For any given iteration, a user's input is used to modify at least one classification part of the algorithm. Recalculated classification parts (i.e., updated classification results) are determined based on computationally simple combinations of the one or more modified classification parts and the one or more input-invariant parts. Preferably, a graphical user interface is used to solicit user input. In this manner, wait times between user feedback iterations can be dramatically reduced, thereby making application of active learning to classification tasks a practical reality. | 03-19-2009 |
20110246467 | EXTRACTION OF ATTRIBUTES AND VALUES FROM NATURAL LANGUAGE DOCUMENTS - One or more classification algorithms are applied to at least one natural language document in order to extract both attributes and values of a given product. Supervised classification algorithms, semi-supervised classification algorithms, unsupervised classification algorithms or combinations of such classification algorithms may be employed for this purpose. The at least one natural language document may be obtained via a public communication network. Two or more attributes (or two or more values) thus identified may be merged to form one or more attribute phrases or value phrases. Once attributes and values have been extracted in this manner, association or linking operations may be performed to establish attribute-value pairs that are descriptive of the product. In a presently preferred embodiment, an (unsupervised) algorithm is used to generate seed attributes and values which can then support a supervised or semi-supervised classification algorithm. | 10-06-2011 |
20110307429 | AUTOMATED CLASSIFICATION ALGORITHM COMPRISING AT LEAST ONE INPUT-INVARIANT PART - A classification algorithm is separated into one or more input-invariant parts and one or more input-dependent classification parts. Classifiable electronic data is obtained via a communication network. Using the classification algorithm, classifications of a plurality of data elements in the classifiable data are identified, where the at least one classification part incorporates user input concerning classification of at least one data element of the plurality of data elements. | 12-15-2011 |
20120036100 | EXTRACTION OF ATTRIBUTES AND VALUES FROM NATURAL LANGUAGE DOCUMENTS - One or more classification algorithms are applied to at least one natural language document in order to extract both attributes and values of a given product. Supervised classification algorithms, semi-supervised classification algorithms, unsupervised classification algorithms or combinations of such classification algorithms may be employed for this purpose. The at least one natural language document may be obtained via a public communication network. Two or more attributes (or two or more values) thus identified may be merged to form one or more attribute phrases or value phrases. Once attributes and values have been extracted in this manner, association or linking operations may be performed to establish attribute-value pairs that are descriptive of the product. In a presently preferred embodiment, an (unsupervised) algorithm is used to generate seed attributes and values which can then support a supervised or semi-supervised classification algorithm. | 02-09-2012 |
20140123304 | DATA ANONYMIZATION BASED ON GUESSING ANONYMITY - Privacy is defined in the context of a guessing game based on the so-called guessing inequality. The privacy of a sanitized record, i.e., guessing anonymity, is defined by the number of guesses an attacker needs to correctly guess an original record used to generate a sanitized record. Using this definition, optimization problems are formulated that optimize a second anonymization parameter (privacy or data distortion) given constraints on a first anonymization parameter (data distortion or privacy, respectively). Optimization is performed across a spectrum of possible values for at least one noise parameter within a noise model. Noise is then generated based on the noise parameter value(s) and applied to the data, which may comprise real and/or categorical data. Prior to anonymization, the data may have identifiers suppressed, whereas outlier data values in the noise perturbed data may be likewise modified to further ensure privacy. | 05-01-2014 |
Patent application number | Description | Published |
20100162402 | DATA ANONYMIZATION BASED ON GUESSING ANONYMITY - Privacy is defined in the context of a guessing game based on the so-called guessing inequality. The privacy of a sanitized record, i.e., guessing anonymity, is defined by the number of guesses an attacker needs to correctly guess an original record used to generate a sanitized record. Using this definition, optimization problems are formulated that optimize a second anonymization parameter (privacy or data distortion) given constraints on a first anonymization parameter (data distortion or privacy, respectively). Optimization is performed across a spectrum of possible values for at least one noise parameter within a noise model. Noise is then generated based on the noise parameter value(s) and applied to the data, which may comprise real and/or categorical data. Prior to anonymization, the data may have identifiers suppressed, whereas outlier data values in the noise perturbed data may be likewise modified to further ensure privacy. | 06-24-2010 |
20100169375 | Entity Assessment and Ranking - General entity retrieval and ranking is described. A first set of documents is retrieved from one or more document repositories based on a query formed according to the topic. The first set of documents is characterized based on its first set of metadata values. One or more candidate entities are identified based on the first set of documents and the original query is thereafter augmented according to a candidate entity. The second set of documents resulting from the augmented query is then characterized in a similar manner. For each candidate entity, the first and second document set characterizations are compared to determine their degree of similarity. Increasingly similar document set characterizations indicates that the candidate entity is increasingly relevant to the original query. Repeating this process for each of the one or more candidate entities can give rise to rankings according to the respective degrees of similarity. | 07-01-2010 |
20140095466 | ENTITY ASSESSMENT AND RANKING - General entity retrieval and ranking is described. A first set of documents is retrieved from one or more document repositories based on a query formed according to the topic. The first set of documents is characterized based on its first set of metadata values. One or more candidate entities are identified based on the first set of documents and the original query is thereafter augmented according to a candidate entity. The second set of documents resulting from the augmented query is then characterized in a similar manner. For each candidate entity, the first and second document set characterizations are compared to determine their degree of similarity. Increasingly similar document set characterizations indicates that the candidate entity is increasingly relevant to the original query. Repeating this process for each of the one or more candidate entities can give rise to rankings according to the respective degrees of similarity. | 04-03-2014 |
Patent application number | Description | Published |
20080270493 | SYSTEM FOR AUTOMATICALLY REPLICATING A CUSTOMER'S PERSONALIZED COMPUTER SYSTEM IMAGE ON A NEW COMPUTER SYSTEM - The Computer Image Replication System automatically replicates a customer's computer system image, including all of the customer's data, programs, device drivers, program preferences, personalizations, and file directory structures on a new computer system. The Computer Image Replication System is part of a Data Shadowing System which comprises a memory module that is connected to a monitored computer system via an existing communication medium, such as an input/output port, to store the shadowed data. The memory module includes a memory device for data storage, as well as software, including a control software component that is automatically installed on the monitored computer system when the memory module is first connected to the monitored computer system, as well as associated module software for maintaining a record of the data stored on the memory device and controlling the operation of the memory device. | 10-30-2008 |
20100057794 | SYSTEM FOR AUTOMATICALLY SHADOWING DATA AND FILE DIRECTORY STRUCTURES THAT ARE RECORDED ON A COMPUTER MEMORY - The Data Shadowing System comprises a memory module that is connected to the monitored computer system via an existing input/output port to store the shadowed data. The memory module includes a memory device for data storage as well as software, including a control software component that is automatically installed on the monitored computer system when the memory module is first connected to the monitored computer system, as well as associated module software for maintaining a record of the data stored on the memory device. The Data Shadowing System automatically stores the data on the memory module in a single format, while representing it in a data management database in two formats: disk sectors and files. The Data Shadowing System thereby efficiently tracks and stores the state of multiple file systems over time, while allowing for correct disk-level and file-level restoration to a point-in-time without storing redundant data. | 03-04-2010 |
20100174684 | SYSTEM FOR AUTOMATICALLY SHADOWING ENCRYPTED DATA AND FILE DIRECTORY STRUCTURES FOR A PLURALITY OF NETWORK-CONNECTED COMPUTERS USING A NETWORK-ATTACHED MEMORY WITH SINGLE INSTANCE STORAGE - The Secure Networked Data Shadowing System is connected to a plurality of monitored computer systems via an existing communication medium to store the shadowed data. The data is encrypted by the monitored computer system using a cryptokey, and the data file is processed using a hash function prior to encryption, so the contents of this file are uniquely identified. Thus, the encrypted file is stored in its encrypted form and the hash index is used to identify the encrypted file. A “data de-duplication” process avoids storing multiple copies of the same files by identifying instances of duplication via the hash index. Files that have the same hash index can be reduced to a single copy without any loss of data as long as the file structure information for each instance of the file is maintained. | 07-08-2010 |