Penicillones A and B, two novel polyketides with tricyclo [5.3.1.0] undecane skeleton, from a marine-derived fungus Penicillium terrestre

Two novel polyketides, penicillones A (1) and B (2), with tricyclo [5.3.1.0^3,8] undecane skeleton, were isolated from Penicillium terrestre. Their structures and relative stereochemistries were determined on the basis of spectroscopic methods. The absolute configuration of 2 was established by the modified Mosher’s method, while that of 1 was deduced from the similar CD absorptions of 1 and 2. Compound 1 showed weak cytotoxicities against P338 and A-549 cell lines, while 2 was inactive against P388.     

交替三线性分解算法与反相高效液相-二极管阵列检测方法相结合同时测定苯二酚的位置异构体

 利用交替三线性分解算法与反相高效液相 二极管阵列检测 (RP HPLC DAD)相结合 ,在洗脱时间为1 0 86min～ 1 399min(间隔 1 / 1 50min)、紫外吸收波长为 2 68nm～ 2 98nm(间隔 1nm)时对苯二酚位置异构体的重叠及光谱体系进行了分辨研究。分辨结果与实际结果一致。同时测定了水溶液中共存的邻苯二酚、间苯二酚和对苯二酚的含量 ,回收率分别为 (1 0 0 1± 1 0 ) % ,(99 4± 1 4) % ,(1 0 0 5± 1 7) %。研究结果表明 :该方法定量快速准确 ,实验操作步骤简单 ,解决了在干扰物存在条件下三者很难同时分辨的问题。     

Orientation control of perovskite thin films on glass substrates by the application of a seed layer prepared from oxide nanosheets

Orientation control of perovskite compounds was investigated by the application of a seed layer prepared from oxide nanosheets. An aqueous suspension of oxide nanosheets was prepared by the exfoliation of a layered compound of KCa₂Nb₃O₁₀ oxide grains. A seed layer composed of (TBA)Ca₂Nb₃O₁₀ nanosheets (TBA = tetrabutylammonium) was formed on a glass substrate by simply dip coating it in the suspension. Two kinds of perovskite compounds, LaNiO₃ (LNO) and Pb(Zr,Ti)O₃ (PZT) with a preferred orientation of (00l) were successfully grown on this seeded glass substrate. In this study, the relation between lattice mismatch and electrical properties is investigated. A large, oriented PZT film with a size of 5 ×4 cm shows an improved P-E hysteresis behavior by use of this orientation control.     

An approach for solving fuzzy multi-criteria decision problem under linguistic information

Fuzzy Optimization and Decision Making - Linguistic information processing exists in multi-criteria decision making, and linguistic truth-valued lattice implication algebra (LTV-LIA) has definite...     

Safety Stock Determination with Serially Correlated Demand in a Periodic-Review Inventory System

We consider a periodic-review inventory replenishment model with an order-up-to-R operating doctrine for the case of deterministic lead times and a covariance-stationary stochastic demand process. A method is derived for setting the inventory safety stock to achieve an exact desired stockout probability when the autocovariance function for Gaussian demand is known. Because the method does not require that parametric time-series models be fit to the data, it is easily implemented in practice. Moreover, the method is shown to be asymptotically valid when the autocovariance function of demand is estimated from historical data. The effects on the stockout rate of various levels of autocorrelated demand are demonstrated for situations in which autocorrelation in demand goes undetected or is ignored by the inventory manager. Similarly, the changes to the required level of safety stock are demonstrated for varying levels of autocorrelation.     

Optimal Control of an <Emphasis Type="Italic">M/E</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>/1 Queueing System with a Removable Service Station

This paper studies the optimal operation of an M/E _k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E _k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E _k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost.     

An Algorithm for the Economic Design of <Emphasis Type="Italic">np</Emphasis> Charts for a Multiplicity of Assignable Causes

Chiu, in 1976, studied the economic design of np charts for processes subject to a multiplicity of assignable causes. Chiu developed a two-step minimization procedure to obtain the three control variables, namely, the sampling interval, the sample size and the acceptance number. Although Chiu's two-step minimization procedure is simple, applicable and down to earth, it is rather inefficient and has some drawbacks. This paper presents an algorithm to overcome these drawbacks. The results and the execution times of all numerical examples show that the accuracy and the efficiency of the algorithm is reasonably good.     

A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a _ij >0 and a _ji >0 may be given where a _ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//C_max belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.     

Availability Analysis of Repairable <Emphasis Type="Italic">N</Emphasis>-Server <Emphasis Type="Italic">n</Emphasis><Subscript><Emphasis Type="Italic">i</Emphasis></Subscript>-Replicated Systems

We develop an exact closed-form expression for the steady-state availability of a repairable, N-server system in which the ith server contains n _i identical, reconfigurable, breakdown-prone units. Our approach, which follows from the Markov chain balance equations and the recursive properties of Hessenberg matrix determinants, is simpler than previously proposed matrix geometric approaches, and can readily be adapted to the availability analysis of more complicated structures. We illustrate this by computing the steady-state availability of a mixed parallel-serial gracefully degrading replicated system.