Glyoxaldiimines (I) RN=CHCH=NR show in the NMR a downfield shift of glyoxalic protons (Hgly) when complexed to (II: M = Mo, W), but increasing high field shifts when going to (III) and complexes (IV). In the tungsten complexes II HglyW coupling satellites are resolved (J(WH) ≈4–6 Hz); in the phosphine compounds III, IV long range PHgly coupling is clearly visible. Mechanisms of spinspin interaction are briefly discussed in connection with the EPR results on monoanionic radicals of II–IV. 相似文献
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 KCa2Nb3O10 oxide grains. A seed layer composed of (TBA)Ca2Nb3O10 nanosheets (TBA = tetrabutylammonium) was formed on a glass substrate by simply dip coating it in the suspension. Two kinds
of perovskite compounds, LaNiO3 (LNO) and Pb(Zr,Ti)O3 (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. 相似文献
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. 相似文献
This paper studies the optimal operation of an M/Ek/1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/Ek/1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/Ek/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. 相似文献
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. 相似文献
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 aij>0 and aji>0 may be given where aij 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//Cmax 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. 相似文献
We develop an exact closed-form expression for the steady-state availability of a repairable, N-server system in which the ith server contains ni 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. 相似文献
Summary We describe an approach to protein structure comparison designed to detect distantly related proteins of similar fold, where the procedure must be sufficiently flexible to take into account the elasticity of protein folds without losing specificity. Protein structures are represented as a series of secondary structure elements, where for each element a local environment describes its relations with the elements that surround it. Secondary structures are then aligned by comparing their features and local environments. The procedure is illustrated with searches of a database of 468 protein structures in order to identify proteins of similar topology to porcine pepsin, porphobilinogen deaminase and serum amyloid P-component. In all cases the searches correctly identify protein structures of similar fold as the search proteins. Multiple cross-comparisons of protein structures allow the clustering of proteins of similar fold. This is exemplified with a clustering of /- and -class protein structures. We discuss applications of the comparison and clustering of three-dimensional protein structures to comparative modelling and structure-based protein design. 相似文献