Construction of Drug–Polymer Thermodynamic Phase Diagrams Using Flory–Huggins Interaction Theory: Identifying the Relevance of Temperature and Drug Weight Fraction to Phase Separation within Solid Dispersions

Amorphous drug-polymer solid dispersions have the potential to enhance the dissolution performance and thus bioavailability of BCS class II drug compounds. The principle drawback of this approach is the limited physical stability of amorphous drug within the dispersion. Accurate determination of the solubility and miscibility of drug in the polymer matrix is the key to the successful design and development of such systems. In this paper, we propose a novel method, based on Flory-Huggins theory, to predict and compare the solubility and miscibility of drug in polymeric systems. The systems chosen for this study are (1) hydroxypropyl methylcellulose acetate succinate HF grade (HPMCAS-HF)-felodipine (FD) and (2) Soluplus (a graft copolymer of polyvinyl caprolactam-polyvinyl acetate-polyethylene glycol)-FD. Samples containing different drug compositions were mixed, ball milled, and then analyzed by differential scanning calorimetry (DSC). The value of the drug-polymer interaction parameter ? was calculated from the crystalline drug melting depression data and extrapolated to lower temperatures. The interaction parameter ? was also calculated at 25 °C for both systems using the van Krevelen solubility parameter method. The rank order of interaction parameters of the two systems obtained at this temperature was comparable. Diagrams of drug-polymer temperature-composition and free energy of mixing (?G mix) were constructed for both systems. The maximum crystalline drug solubility and amorphous drug miscibility may be predicted based on the phase diagrams. Hyper-DSC was used to assess the validity of constructed phase diagrams by annealing solid dispersions at specific drug loadings. Three different samples for each polymer were selected to represent different regions within the phase diagram

Stapleton-Rose Performance

Improvisations, Biegungen Im Ausland, Ausland, Berlin

Class Responsibility Assignment (CRA) for Use Case Specification to Sequence Diagrams (UC2SD)

Identifying responsibility for classes in object oriented software design phase is a crucial task. This paper proposes an approach for producing high quality and robust behavioural diagrams (e.g. Sequence Diagrams) through Class Responsibility Assignment (CRA). GRASP or General Responsibility Assignment Software Pattern (or Principle) was used to direct the CRA process when deriving behavioural diagrams. A set of tools to support CRA was developed to provide designers and developers with a cognitive toolkit that can be used when analysing and designing object-oriented software. The tool developed is called Use Case Specification to Sequence Diagrams (UC2SD). UC2SD uses a new approach for developing Unified Modelling Language (UML) software designs from Natural Language, making use of a meta-domain oriented ontology, well established software design principles and established Natural Language Processing (NLP) tools. UC2SD generates a well-formed UML sequence diagrams as output.

On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables

Influence diagrams are intuitive and concise representations of structured decision problems. When the problem is non-Markovian, an optimal strategy can be exponentially large in the size of the diagram. We can avoid the inherent intractability by constraining the size of admissible strategies, giving rise to limited memory influence diagrams. A valuable question is then how small do strategies need to be to enable efficient optimal planning. Arguably, the smallest strategies one can conceive simply prescribe an action for each time step, without considering past decisions or observations. Previous work has shown that finding such optimal strategies even for polytree-shaped diagrams with ternary variables and a single value node is NP-hard, but the case of binary variables was left open. In this paper we address such a case, by first noting that optimal strategies can be obtained in polynomial time for polytree-shaped diagrams with binary variables and a single value node. We then show that the same problem is NP-hard if the diagram has multiple value nodes. These two results close the fixed-parameter complexity analysis of optimal strategy selection in influence diagrams parametrized by the shape of the diagram, the number of value nodes and the maximum variable cardinality.