Patent application number | Description | Published |
20160129009 | HIGH PURITY DIAMINOPHENOTHIAZINIUM COMPOUNDS INCLUDING METHYLTHIONINIUM CHLORIDE (MTC) - This invention pertains generally to the field of chemical synthesis and purification, and more specifically to methods of synthesizing and purifying certain 3,7 diamino-phenothiazin-5-ium compounds (referred to herein as “diaminophenothiaziniumcompounds”) including Methythioninium Chloride (MTC) (also known as Methylene Blue). In one embodiment, the method comprises the steps of, in order: nitrosylation (NOS); nitrosyl reduction (NR); thiosulfonic acid formation (TSAF); oxidative coupling (OC); Cr(VI) reduction (CR); isolation and purification of zwitterionic intermediate (IAPOZI); ring closure (RC); chloride salt-formation (CSF); one of: sulphide treatment (ST); dimethyldithiocarbamate treatment (DT); carbonate treatment (CT); ethylenediaminetetraacetic acid treatment (EDTAT); organic extraction (OE); and recrystallisation (RX). The present invention also pertains to the resulting (high purity) compounds, compositions comprising them (e.g., tablets, capsules), and their use in methods of inactivating pathogens, and methods of medical treatment and diagnosis, etc., for example, for tauopathies, Alzheimer's disease (AD), skin cancer, melanoma, viral diseases, bacterial diseases, or protozoal diseases. | 05-12-2016 |
Patent application number | Description | Published |
20100184752 | PHENOTHIAZINE COMPOUNDS FOR TREATING MILD COGNITIVE IMPAIRMENT - The present invention relates generally to methods and materials based on diaminophenothiazines for use in the treatment of Mild Cognitive Impairment (MCI). | 07-22-2010 |
20100280975 | SYSTEMS FOR CLINICAL TRIALS - The invention provides methods and systems for assessing the efficacy of a pharmaceutical which is putatively disease modifying of a cognitive disorder, for use in the treatment or prophylaxis of that cognitive disorder, the method comprising the steps of: (1) stratifying a subject group into at least 2 sub-groups according to a baseline indicator of likely disease progression, (2) treating members of each subject group with the pharmaceutical for a treatment time frame, (3) deriving psychometric and optionally physiological outcome measures for each treated patient group, (4) comparing the outcomes at (3) with a comparator arm of said sub-groups which is optionally a placebo or minimal efficacy comparator arm, (5) using the comparison in (4) to derive an efficacy measure for the pharmaceutical. The methods and systems of the invention address problems such as low rate of decline over the treatment time-frame of patients who have mild-disease severity at baseline and biased withdrawal, particularly in the placebo/comparator treatment arm. | 11-04-2010 |
20100290986 | THERAPEUTIC USE OF DIAMINOPHENOTHIAZINES - The present invention relates generally to methods and materials for use in the treatment or prophylaxis of diseases, for example cognitive disorders, using diaminophenothiazines. In particular it relates to treatments having optimised pharmacokinetic properties, and dosage forms are intended to improve the relative cognitive or CNS benefits of the diaminophenothiazines, for instance compared to haematological effects. | 11-18-2010 |
20160030444 | THERAPEUTIC USE OF DIAMINOPHENOTHIAZINES - Described are methods and materials for use in the treatment or prophylaxis of diseases, for example cognitive disorders, using diaminophenothiazines. In particular it relates to treatments having optimised pharmacokinetic properties, and dosage forms are intended to improve the relative cognitive or CNS benefits of the diaminophenothiazines, for instance compared to haematological effects. | 02-04-2016 |
Patent application number | Description | Published |
20130097580 | ASYNCHRONOUS PROGRAMMING MODEL MAPPING - Mapping is performed between operations of an abstract asynchronous programming model and a concrete asynchronous programming model. In other words, differences between asynchronous programming models are bridged to enable interaction. | 04-18-2013 |
20140237452 | Call Stacks for Asynchronous Programs - Embodiments provide call stacks for asynchronous programming. A set of all asynchronous call stacks is found by first identifying all threads and all outstanding tasks that have not yet been completed. Optionally, all outstanding continuation-delegates or lambdas that are in the windows queue waiting to be scheduled and/or all outstanding delegates or lambdas in a language-specific queue are also identified. Next, for each thread, identify whether it was invoked by a continuation-callback and, if so, find the corresponding task/promise. Next, given a task/promise, identify the logical parent task/promise. Optionally, given a delegate or lambda, identify its logical parent task/promise. The sequence of logical tasks/promises constitutes an asynchronous call stack in a program. Further information may optionally be retrieved to make the asynchronous call stack more useful. Finally, given a task/promise, identify the corresponding line number and location in source code. | 08-21-2014 |
Patent application number | Description | Published |
20100299660 | DYNAMIC BINDING DIRECTED BY STATIC TYPES - A static type, called “dynamic”, is introduced into a statically bound programming language. An expression or subexpression that is defined as a static type called “dynamic” in the source code of a program written in the statically bound programming language, is bound based on its runtime type instead of on its compile time type. Binding can be performed based on a mixture of compile time and runtime types that are based on the specification of types of expressions in source code. This type of binding is called hybrid binding. Operations are bound using the runtime type of constituent expressions (i.e., the runtime type of a receiver, an argument, or an operand) typed as dynamic and the compile time type of static constituents. If any constituent expression of an operation is dynamic, binding occurs at runtime instead of at compile time. | 11-25-2010 |
20110314460 | COMPILE TIME INTERPRETATION OF MARKUP CODES - The present invention extends to methods, systems, and computer program products for compile time interpretation of markup codes. Embodiments of the invention can be used to specify custom behaviors to be taken in response to any of a number of ways that markup codes (e.g., XML data) can be constructed and in response to any number of ways that markup codes can be accessed. At compile time, the construction of objects and/or the modes of access for objects using mark up codes are known. As such, the compiler, type-system and development environment can use a known set of custom behaviors to regulate or give feedback on what constructions or modes of access are allowed, and what their characteristics are. | 12-22-2011 |
20120324431 | PATTERN-BASED COMPILATION OF ASYNCHRONOUS CONSUMPTION - The present invention extends to methods, systems, and computer program products for transforming source code to await execution of asynchronous operations. Embodiments of the invention simplify authoring and use of asynchronous methods, by generating statements that use well-defined awaitable objects to await completion of asynchronous operations. For example, a computer system can transform a statement that requests to await the completion of an asynchronous operation into a plurality of statements that use a predefined pattern of members of an awaitable object corresponding the asynchronous operation. The pattern can include one or more members configured to return a completion status of the asynchronous operation, one or more members configured to resume execution of the asynchronous method at a resumption point when the asynchronous operation completes, and one or more members configured to retrieve completion results. Accordingly, the plurality of statements can use these members to await execution of the asynchronous operation. | 12-20-2012 |
20120324457 | USING COMPILER-GENERATED TASKS TO REPRESENT PROGRAMMING ELEMENTS - The present invention extends to methods, systems, and computer program products for representing various programming elements with compiler-generated tasks. Embodiments of the invention enable access to the future state of a method through a handle to a single and composable task object. For example, an asynchronous method is rewritten to generate and return a handle to an instance of a builder object, which represents one or more future states of the asynchronous method. Information about operation of the asynchronous method is then passed through the handle. Accordingly, state of the asynchronous method is trackable prior to and after completing. | 12-20-2012 |