光纤药物原位溶出度/释放度监测仪实时监测复方氯唑沙宗片体外溶出度

研制了光纤-光学传感-药物溶出监测仪并应用于复方氯唑沙宗片的实时-原位体外溶出度.分支光纤的一端与光源相接,另一端与检测器连接,其公共端部探头浸入于盛于溶出杯中的溶解液中.借联机的计算机进行数据记录及处理,对复方氯唑沙宗片的组分对乙酰氨基酚和氯唑沙宗的回收率在低、中、高三个浓度水平进行了试验,结果依次为98.3%,102.3%和103.1%及108.6%,98.7%和97.7%,其相应的RSD值为1.0%,1.4%和0.4%及1.7%,1.6%及1.3%.应用此监测仪对药片的溶出全过程进行了监控,并显示了药物的溶解曲线,相关的溶出参数可随时提取.试验证明,使用该仪器可获得药物溶出全过程的真实情况的信息.     

Electrophoresis simulations using Chebyshev pseudo-spectral method on a moving mesh

We present the implementation and demonstration of the Chebyshev pseudo-spectral method coupled with an adaptive mesh method for performing fast and highly accurate electrophoresis simulations. The Chebyshev pseudo-spectral method offers higher numerical accuracy than all other finite difference methods and is applicable for simulating all electrophoresis techniques in channels with open or closed boundaries. To improve the computational efficiency, we use a novel moving mesh scheme that clusters the grid points in the regions with poor numerical resolution. We demonstrate the application of the Chebyshev pseudo-spectral method on a moving mesh for simulating nonlinear electrophoretic processes through examples of isotachophoresis (ITP), isoelectric focusing (IEF), and electromigration-dispersion in capillary zone electrophoresis (CZE) at current densities as high as 1000 A/m. We also show the efficacy of our moving mesh method over existing methods that cluster the grid points in the regions with large concentration gradients. We have integrated the adaptive Chebyshev pseudo-spectral method in the open-source SPYCE simulator and verified its implementation with other electrophoresis simulators.     

Mixed-valence, mixed-spin-state, and heterometallic [2x2] grid-type arrays based on heteroditopic hydrazone ligands: synthesis and electrochemical features

An extended family of heterometallic [(M1)2(M2)2(L-)4](n+) [2x2] grid-type arrays 1-9 has been prepared. The three-tiered synthetic route encompasses regioselective, redox and enantioselective features and is based on the stepwise construction of heteroditopic hydrazone ligands A-C. These ligands contain ionisable NH and nonionisable NMe hydrazone units, which allows the metal redox properties to be controlled according to the charge on the ligand binding pocket. The 2-pyrimidine (R) and 6-pyridine (R') substituents have a significant effect on complex geometry and influence both the electrochemical and magnetic behaviour of the system. 1H NMR spectroscopic studies show that the Fe(II) ions in the grid can be low spin, high spin or spin crossover depending on the steric effect of substituents R and R'. This steric effect has been manipulated to construct an unusual array possessing two low-spin and two spin-crossover Fe(II) centres (grid 8). Electrochemical studies were performed for the grid-type arrays 1-9 and their respective mononuclear precursor complexes 10-13. The grids function as electron reservoirs and display up to eight monoelectronic, reversible reduction steps. These processes generally occur in pairs and are assigned to ligand-based reductions and to the Co(III)/Co(II) redox couple. Individual metal ions in the heterometallic grid motif can be selectively addressed electrochemically (e.g., either the Co(III) or Fe(II) ions can be targeted in grids 2 and 5). The Fe(II) oxidation potential is governed by the charge on the ligand binding unit, rather than the spin state, thus permitting facile electrochemical discrimination between the two types of Fe(II) centre in 7 or in 8. Such multistable heterometallic [2x2] gridlike arrays are of great interest for future supramolecular devices incorporating multilevel redox activity.     

Homo- and heterometallic [2x2] grid arrays containing RuII, OsII, and FeII subunits and their mononuclear RuII and OsII precursors: synthesis, absorption spectra, redox behavior, and luminescence properties

The absorption spectra, redox behavior, and luminescence properties (both at 77 K in rigid matrices and at room temperature in fluid solution) of a series of [2x2] molecular grids have been investigated. The latter were prepared either by means of sequential self-assembly, or by a stepwise protection/deprotection procedure, and are based on a ditopic hexadentate ligand 1 in which two terpyridine-like binding sites are fused together in a linear arrangement. The molecular grids studied include the homometallic species [[Fe(1)](4)](8+) (Fe(2)Fe(2)), and the heterometallic species [[Ru(1)](2)[Fe(1)](2)](8+) (Ru(2)Fe(2)) and [[Os(1)](2)[Fe(1)](2)](8+) (Os(2)Fe(2)). For comparison purposes, the properties of the mononuclear complexes [Ru(1)(2)](2+) (1-Ru) and [Os(1)(2)](2+) (1-Os) have been studied. All these compounds exhibit very intense absorption bands in the UV region (epsilon in the 10(5)-10(6) M(-1) cm(-1) range, attributed to spin-allowed ligand-centered (LC) transitions), as well as intense metal-to-ligand charge-transfer (MLCT) transitions (epsilon in the 10(4)-10(5) M(-1) cm(-1) range) that extend to the entire visible region. The mononuclear species 1-Ru and 1-Os exhibit relatively intense luminescence, both in acetonitrile at room temperature (tau=59 and 18 ns, respectively) and in butyronitrile rigid matrices at 77 K. In contrast, the tetranuclear molecular grids do not exhibit any luminescence, either at room temperature or at 77 K. This is attributed to fast intercomponent energy transfer from the Ru- or Os-based subunits to the low-lying metal-centered (MC) levels involving the Fe(II) centers, which leads to fast radiationless decay. The redox behavior of the compounds is characterized by several metal-centered oxidation and ligand-centered reduction processes, most of them reversible in nature (as many as twelve for Fe(2)Fe(2)). Detailed assignment of each redox process has been made, and it is apparent that these systems can be viewed as multilevel molecular electronic species capable of reversibly exchanging a number of electrons at accessible and predetermined potentials. Furthermore, it is shown that the electronic interaction between specific subunits depends on their location in the structure and on the oxidation states of the other components.     

Properties of the random search in global optimization

From theorems which we prove about the behavior of gaps in a set ofN uniformly random points on the interval [0, 1], we determine properties of the random search procedure in one-dimensional global optimization. In particular, we show that the uniform grid search is better than the random search when the optimum is chosen using the deterministic strategy, that a significant proportion of large gaps are contained in the uniformly random search, and that the error in the determination of the point at which the optimum occurs, assuming that it is unique, will on the average be twice as large using the uniformly random search compared with the uniform grid. In addition, some of the properties of the largest gap are verified numerically, and some extensions to higher dimensions are discussed. The latter show that not all of the conclusions derived concerning the inadequacies of the one-dimensional random search extend to higher dimensions, and thaton average the random search is better than the uniform grid for dimensions greater than 6.This paper is based on work started in the Statistics Department of Princeton University when the first author was visiting as a Research Associate. Part of this research was supported by the Office of Naval Research, Contract No. 0014-67-A-0151-0017, and by the US Army Research Office—Durham, Contract No. DA-31-124-ARO-D-215.2 The authors wish to thank B. Omodei for his careful work in preparing the programs for the results of Figs. 1–2 and Table 1. The computations were performed on the IBM 360/50 of the Australian National University's Computer Centre. Thanks are also due to R. Miles for suggestions regarding the extension of the results to multidimensional regions, and to P. A. P. Moran and R. Brent for suggestions regarding the evaluation of the integral ₀ ¹ ... ^0/1 (x ₁ ² + ... +x _n ^/2 )^1/2 dx ₁ ...dx _n.     

Decentralized operation strategies for an integrated building energy system using a memetic algorithm

The emerging technology in net-zero building and smart grids drives research moving from centralized operation decisions on a single building to decentralized decisions on a group of buildings, termed a building cluster which shares energy resources locally and globally. However, current research has focused on developing an accurate simulation of single building energy usage which limits its application to building clusters as scenarios such as energy sharing and competition cannot be modeled and studied. We hypothesize that the study of energy usage for a group of buildings instead of one single building will result in a cost effective building system which in turn will be resilient to power disruption. To this end, this paper develops a decision model based on a building cluster simulator with each building modeled by energy consumption, storage and generation sub modules. Assuming each building is interested in minimizing its energy cost, a bi-level operation decision framework based on a memetic algorithm is proposed to study the tradeoff in energy usage among the group of buildings. Two additional metrics, measuring the comfort level and the degree of dependencies on the power grid are introduced for the analysis. The experimental result demonstrates that the proposed framework is capable of deriving the Pareto solutions for the building cluster in a decentralized manner. The Pareto solutions not only enable multiple dimensional tradeoff analysis, but also provide valuable insight for determining pricing mechanisms and power grid capacity.     

Convergence issues in using high‐resolution schemes and lower–upper symmetric Gauss–Seidel method for steady shock‐induced combustion problems

This paper reports numerical convergence study for simulations of steady shock‐induced combustion problems with high‐resolution shock‐capturing schemes. Five typical schemes are used: the Roe flux‐based monotone upstream‐centered scheme for conservation laws (MUSCL) and weighted essentially non‐oscillatory (WENO) schemes, the Lax–Friedrichs splitting‐based non‐oscillatory no‐free parameter dissipative (NND) and WENO schemes, and the Harten–Yee upwind total variation diminishing (TVD) scheme. These schemes are implemented with the finite volume discretization on structured quadrilateral meshes in dimension‐by‐dimension way and the lower–upper symmetric Gauss–Seidel (LU–SGS) relaxation method for solving the axisymmetric multispecies reactive Navier–Stokes equations. Comparison of iterative convergence between different schemes has been made using supersonic combustion flows around a spherical projectile with Mach numbers M = 3.55 and 6.46 and a ram accelerator with M = 6.7. These test cases were regarded as steady combustion problems in literature. Calculations on gradually refined meshes show that the second‐order NND, MUSCL, and TVD schemes can converge well to steady states from coarse through fine meshes for M = 3.55 case in which shock and combustion fronts are separate, whereas the (nominally) fifth‐order WENO schemes can only converge to some residual level. More interestingly, the numerical results show that all the schemes do not converge to steady‐state solutions for M = 6.46 in the spherical projectile and M = 6.7 in the ram accelerator cases on fine meshes although they all converge on coarser meshes or on fine meshes without chemical reactions. The result is based on the particular preconditioner of LU–SGS scheme. Possible reasons for the nonconvergence in reactive flow simulation are discussed.Copyright © 2012 John Wiley & Sons, Ltd.     

Numerical simulation and convergence analysis for a system of nonlinear singularly perturbed differential equations arising in population dynamics

In this article, we consider a system of nonlinear singularly perturbed differential equations with two different parameters. To solve this system, we develop a weighted monotone hybrid scheme on a nonuniform mesh. The proposed scheme is a combination of the midpoint scheme and the upwind scheme involving the weight parameters. The weight parameters enable the method to switch automatically from the midpoint scheme to the upwind scheme as the nodal points start moving from the inner region to the outer region. The nonuniform mesh in particular the adaptive grid is constructed using the idea of equidistributing a positive monitor function involving the solution gradient. The method is shown to be second order convergent with respect to the small parameters. Numerical experiments are presented to show the robustness of the proposed scheme and indicate that the estimate is optimal.     

A new level‐dependent coarse grid correction scheme for indefinite Helmholtz problems

In this paper, we construct and analyze a level‐dependent coarse grid correction scheme for indefinite Helmholtz problems. This adapted multigrid (MG) method is capable of solving the Helmholtz equation on the finest grid using a series of MG cycles with a grid‐dependent complex shift, leading to a stable correction scheme on all levels. It is rigorously shown that the adaptation of the complex shift throughout the MG cycle maintains the functionality of the two‐grid correction scheme, as no smooth modes are amplified in or added to the error. In addition, a sufficiently smoothing relaxation scheme should be applied to ensure damping of the oscillatory error components. Numerical experiments on various benchmark problems show the method to be competitive with or even outperform the current state‐of‐the‐art MG‐preconditioned Krylov methods, for example, complex shifted Laplacian preconditioned flexible GMRES. Copyright © 2013 John Wiley & Sons, Ltd.     

A simplified adaptive Cartesian grid system for solving the 2D shallow water equations

This paper presents a new simplified grid system that provides local refinement and dynamic adaptation for solving the 2D shallow water equations (SWEs). Local refinement is realized by simply specifying different subdivision levels to the cells on a background uniform coarse grid that covers the computational domain. On such a non‐uniform grid, the structured property of a regular Cartesian mesh is maintained and neighbor information is determined by simple algebraic relationships, i.e. data structure becomes unnecessary. Dynamic grid adaptation is achieved by changing the subdivision level of a background cell. Therefore, grid generation and adaptation is greatly simplified and straightforward to implement. The new adaptive grid‐based SWE solver is tested by applying it to simulate three idealized test cases and promising results are obtained. The new grid system offers a simplified alternative to the existing approaches for providing adaptive mesh refinement in computational fluid dynamics. Copyright © 2011 John Wiley & Sons, Ltd.