2,082 research outputs found

    Hydrodynamic effects of a cannula in a USP dissolution testing apparatus 2

    Get PDF
    Dissolution testing is routinely used in the pharmaceutical industry to provide in vitro drug release information for drug development and quality control purposes. The USP Testing Apparatus 2 is the most common dissolution testing system for solid dosage forms. Usually, sampling cannulas are used to take samples manually from the dissolution medium. However, the inserted cannula can alter the normal fluid flow within the vessel and produce different dissolution testing results. The hydrodynamic effects introduced by a permanently inserted cannula in a USP Dissolution Testing Apparatus 2 were evaluated by two approaches. Firstly, the dissolution tests were conducted with two dissolution systems, the testing system (with cannula) and the standard system (without cannula), for nine different tablet positions using non-disintegrating salicylic acid calibrator tablets. The dissolution profiles at each tablet location in the two systems were compared using statistical tools. Secondly, Particle Image Velocimetry (PIV) was used to obtain experimentally velocity vector maps and velocity profiles in the vessel for the two systems and to quantify changes in the velocities on selected horizontal so-surfaces. The results show that the system with the cannula produced higher dissolution profiles than that without the cannula and that the magnitude of the difference between dissolution profiles in the two systems depended on tablet location. However, in most dissolution tests, the changes in dissolution profile due to the cannula were small enough to satisfy the FDA criteria for similarity between dissolution profiles (f1 and f2 values). PIV measurements showed slightly changes in the velocities of the fluid flow in the vessel where the cannula was inserted. The most significant velocity changes were observed closest to the cannula. However, generally the hydrodynamic effect generated by the cannula did not appear to be particularly strong, which was consistent to dissolution test results. It can be concluded that the hydrodynamic effects generated by the inserted cannula are real and observable. Such effects result in slightly mod fications of the fluid flow in the dissolution vessel and in detectable differences in the dissolution profiles, which, although limited, can introduce variations in test results possibly leading to failure of routine dissolution tests

    Computationally efficient methods for solving time-variable-order time-space fractional reaction-diffusion equation

    Get PDF
    Fractional differential equations are becoming more widely accepted as a powerful tool in modelling anomalous diffusion, which is exhibited by various materials and processes. Recently, researchers have suggested that rather than using constant order fractional operators, some processes are more accurately modelled using fractional orders that vary with time and/or space. In this paper we develop computationally efficient techniques for solving time-variable-order time-space fractional reaction-diffusion equations (tsfrde) using the finite difference scheme. We adopt the Coimbra variable order time fractional operator and variable order fractional Laplacian operator in space where both orders are functions of time. Because the fractional operator is nonlocal, it is challenging to efficiently deal with its long range dependence when using classical numerical techniques to solve such equations. The novelty of our method is that the numerical solution of the time-variable-order tsfrde is written in terms of a matrix function vector product at each time step. This product is approximated efficiently by the Lanczos method, which is a powerful iterative technique for approximating the action of a matrix function by projecting onto a Krylov subspace. Furthermore an adaptive preconditioner is constructed that dramatically reduces the size of the required Krylov subspaces and hence the overall computational cost. Numerical examples, including the variable-order fractional Fisher equation, are presented to demonstrate the accuracy and efficiency of the approach

    GW25-e0866 The Study of Experimental Acupuncture-meridians Treatment for Patients with Impaired Glucose Regulation

    Get PDF

    Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs

    Full text link
    Let GG be a simple graph with 2n2n vertices and a perfect matching. The forcing number f(G,M)f(G,M) of a perfect matching MM of GG is the smallest cardinality of a subset of MM that is contained in no other perfect matching of GG. Among all perfect matchings MM of GG, the minimum and maximum values of f(G,M)f(G,M) are called the minimum and maximum forcing numbers of GG, denoted by f(G)f(G) and F(G)F(G), respectively. Then f(G)≀F(G)≀nβˆ’1f(G)\leq F(G)\leq n-1. Che and Chen (2011) proposed an open problem: how to characterize the graphs GG with f(G)=nβˆ’1f(G)=n-1. Later they showed that for bipartite graphs GG, f(G)=nβˆ’1f(G)=n-1 if and only if GG is complete bipartite graph Kn,nK_{n,n}. In this paper, we solve the problem for general graphs and obtain that f(G)=nβˆ’1f(G)=n-1 if and only if GG is a complete multipartite graph or Kn,n+K^+_{n,n} (Kn,nK_{n,n} with arbitrary additional edges in the same partite set). For a larger class of graphs GG with F(G)=nβˆ’1F(G)=n-1 we show that GG is nn-connected and a brick (3-connected and bicritical graph) except for Kn,n+K^+_{n,n}. In particular, we prove that the forcing spectrum of each such graph GG is continued by matching 2-switches and the minimum forcing numbers of all such graphs GG form an integer interval from ⌊n2βŒ‹\lfloor\frac{n}{2}\rfloor to nβˆ’1n-1

    Hybrid Augmented Automated Graph Contrastive Learning

    Full text link
    Graph augmentations are essential for graph contrastive learning. Most existing works use pre-defined random augmentations, which are usually unable to adapt to different input graphs and fail to consider the impact of different nodes and edges on graph semantics. To address this issue, we propose a framework called Hybrid Augmented Automated Graph Contrastive Learning (HAGCL). HAGCL consists of a feature-level learnable view generator and an edge-level learnable view generator. The view generators are end-to-end differentiable to learn the probability distribution of views conditioned on the input graph. It insures to learn the most semantically meaningful structure in terms of features and topology, respectively. Furthermore, we propose an improved joint training strategy, which can achieve better results than previous works without resorting to any weak label information in the downstream tasks and extensive evaluation of additional work
    • …