新型稀土电子输运材料Tb(AcA)3·phen

Kido等人在文献[1]中报导,在研究有机电致发光(OEL)器件时发现,斓系化合物不能很好地传输载流子.但是,我们在实验中却现Tb(AcA)3phen·不仅是一种很好的OEL发射材料.而且具有很强的电子输运能力.     

Asymmetric synthesis XXVII: Asymmetric catalytic trimethylsilylcyanation of aldehydes by novel Ti-chiral Schiff base complexes

Enantioselective catalytic trimethylsilylcyanations of aldehydes with 48% to 92% e.e. have been studied using the novel Ti-chiral Schiff base complexes. We have found that the catalyst led to high enantoselectivity when the molar ratio of the Schiff base 1 to Ti(O-i-Pr)₄ was 2:1.     

Variation of geometric invariant theory quotients

Geometric Invariant Theory gives a method for constructing quotients for group actions on algebraic varieties which in many cases appear as moduli spaces parameterizing isomorphism classes of geometric objects (vector bundles, polarized varieties, etc.). The quotient depends on a choice of an ample linearized line bundle. Two choices are equivalent if they give rise to identical quotients. A priori, there are infinitely many choices since there are infinitely many isomorphism classes of linearized ample line bundles. Hence several natural questions arise. Is the set of equivalence classes, and hence the set of non-isomorphic quotients, finite? How does the quotient vary under change of the equivalence class? In this paper we give partial answers to these questions in the case of actions of reductive algebraic groups on nonsingular projective algebraic varieties. We shall show that among ample line bundles which give projective geometric quotients there are only finitely many equivalence classes. These classes span certain convex subsets (chambers) in a certain convex cone in Euclidean space, and when we cross a wall separating one chamber from another, the corresponding quotient undergoes a birational transformation which is similar to a Mori flip.     

Scheduling Parts in a Combined Production-transportation Work Cell

This paper is concerned with a combined production-transportation scheduling problem. The problem comprises a simple, two-machine, automated manufacturing cell, which either stands alone or is a subunit of a complete flexible manufacturing system. The cell consists of two machines in series with a dedicated part-handling device such as a crane or robotic arm for transferring parts from the first machine to the second. The loading of a new piece on the first machine and the ejection of a finished piece from the second machine are performed by dedicated automated mechanisms. The introduction of parts into the system is done n at a time, whereby the parts are reshuffled into a sequence that minimizes completion time. All processing and transfer times are considered deterministic—a reasonable assumption for a cell comprising a robotic transfer device and two CNC machining units. What complicates the problem is the assumption of a non-negligible time for the transfer device to return (empty) from the second machine to the first. The operation is a generalization of a two-machine flowshop problem, and is formulated as a specially structured, asymmetric travelling salesman problem. An approximate polynomial time 0(n log n) algorithm is proffered. The procedure incorporates a lower bound using the Gilmore–Gomory algorithm for the no-wait, two-machine flowshop problem.     

On the Role of Mixed Strategies in Elementary Decision Analysis and Related Decision-Support-System Treatments

We first demonstrate that mixed strategies are relevant in decision analysis for a maximin decision-maker quite apart from any game-theory considerations. This rectifies the apparent misconception that results from MS/OR textbooks which discuss mixed strategies only in the game-theory setting. Next we show an example of an implementable mixed strategy, by which we mean a mixed decision strategy which does not require randomization for its implementation. This application is to portfolio construction.     

Optimal Discrete Approximations for Continuous Outcomes with Applications in Decision and Risk Analysis

In decision and risk analysis, it is common to use discrete probability distributions to approximate uncertain events with continuous outcomes. This paper discusses how these approximations may be selected. A class of approximations based on a modification to Taguchi's work on tolerance analysis is shown to be optimal under assumptions of independent uncertainties with normally distributed outcomes. The approximation procedure is shown to be robust in many other situations and is extremely easy to use in practice. We also show how the approximation may be integrated into the process of subjective probability estimation by a ‘subject-matter expert’.     

Optimal Inventory Policies with Service-Level Constraints

In a practical situation it is often difficult to determine the value of the shortage costs for use in in ventory-control systems. However, in cost-minimization problems including service-level constraints, shortage costs are implicitly prevailing. With the purpose of exploring these relations, a continuous review (Q, r) stock-control system is considered, where the order points and lot sizes are computed simultaneously. Instead of explicitly expressing the shortage cost in the objective function, it is taken into consideration through a service-level constraint. The shadow price of this constraint can in some sense be interpreted as the shortage cost corresponding to the requested service level. By changing the value of the service level, interesting relations between shortage costs and service levels can be viewed for different sets of other inventory parameters. In order to investigate the sensitivity for probabilistic variations in the input data, two different probability distributions are used to describe the lead-time demand.