MPC850最小系统的硬件设计

介绍MPC850芯片的两个主要模块:嵌入式处理器模块和通信处理模块.设计了基于MPC850最小系统硬件系统,它包括系统时钟、复位电路、存储器电路及串行通道和接口.实际应用显示该系统效果良好.     

Note on: N.E. Aguilera, M.S. Escalante, G.L. Nasini, “The disjunctive procedure and blocker duality”

Aguilera et al. [Discrete Appl. Math. 121 (2002) 1–13] give a generalization of a theorem of Lehman through an extension of the disjunctive procedure defined by Balas, Ceria and Cornuéjols. This generalization can be formulated as(A) For every clutter , the disjunctive index of its set covering polyhedron coincides with the disjunctive index of the set covering polyhedron of its blocker, .In Aguilera et al. [Discrete Appl. Math. 121 (2002) 1–3], (A) is indeed a corollary of the stronger result(B) .Motivated by the work of Gerards et al. [Math. Oper. Res. 28 (2003) 884–885] we propose a simpler proof of (B) as well as an alternative proof of (A), independent of (B). Both of them are based on the relationship between the “disjunctive relaxations” obtained by and the set covering polyhedra associated with some particular minors of .     

Statistical inference based on aligned ranks for two-way MANOVA with interaction

Multiresponse experiments in two-way layouts with interactions, having equal number of observations per cell, are considered. Robust procedures based on aligned ranks for statistical inference of interactions, main effects and an overall mean response in the models are proposed. Large sample properties of the proposed tests, estimators and confidence regions as the cell size tends to infinity are investigated. For the univariate case, it is found that the asymptotic relative efficiencies (ARE's) of the proposed procedures relative to classical procedures agree with the ARE-results of the two-sample rank test relative to the t-test. In addition, robustness due to Huber (1981, Robust Statistics, Wiley, New York) can be drawn.     

平板型太阳热水器板芯高温耐久性实验方法研究

为了研究平板型太阳热水器板芯表面的高温耐久性,结合国外的实验方法及国内的应用特点设计了本实验方法.该方法以板芯表面光学性能的衰减来推断系统的寿命,即在一定的高温实验条件下模拟加速衰减过程,以板芯表面光学性能衰减小于5%作为判断板芯合格标准.     

An improved approximation technique to obtain numerical solution of a class of two-point boundary value similarity problems in fluid mechanics

A simple and efficient approximate numerical technique is presented to obtain solutions to a wide class of two-point boundary value similarity problems in fluid mechanics. This technique is based on the common finite difference method with central differencing, a tridiagonal matrix manipulation and an iterative procedure. The technique described in this paper has been successfully applied to three different representative similarity problems of fluid mechanics. Each one of these problems is described by a coupled, non-linear system of three ordinary differential equations and has already been solved elsewhere using a different numerical method. So, the obtained numerical results, by our efficient numerical technique, permit a comparative study and show the accuracy and the effectiveness of this technique.     

A concise and efficient synthesis of isoindolin-1-ones. New synthetic approach to the polycyclic framework of vitedoamine A

A concise and efficient synthesis of 2,3-dihydro-1H-isoindol-1-ones based upon the Parham-type cyclization of iodinated benzyldicarbamates is reported. The synthetic potential of this approach was further emphasized by the assembly of the polycyclic framework of vitedoamine A.     

A planar minimax alogrithm for analysis of coordinate measurements

We characterize the solution of the following problem and describe an algorithm for numerically solving it. Two sets ofN points in the plane, labeled 1,...,N, are given: a fixed set of nominal points and a set of measured points. We wish to transform the messured points as a whole, by translation and rotation, so that the maximal distance between corresponding points in the two sets is minimized. This algorthm provides an accept-reject criterion that may be used together with a coordinate measuring machine to determine if two mating parts will fit, or if a part is sufficiently close to its ideal measurements. A weighted version, suitable for point-dependent tolerances, is also discussed, as is optimal joint scalling of the data.     

A linear system solver based on a modified Krylov subspace method for breakdown recovery

Despite its usefulness in solving eigenvalue problems and linear systems of equations, the nonsymmetric Lanczos method is known to suffer from a potential breakdown problem. Previous and recent approaches for handling the Lanczos exact and near-breakdowns include, for example, the look-ahead schemes by Parlett-Taylor-Liu [23], Freund-Gutknecht-Nachtigal [9], and Brezinski-Redivo Zaglia-Sadok [4]; the combined look-ahead and restart scheme by Joubert [18]; and the low-rank modified Lanczos scheme by Huckle [17]. In this paper, we present yet another scheme based on a modified Krylov subspace approach for the solution of nonsymmetric linear systems. When a breakdown occurs, our approach seeks a modified dual Krylov subspace, which is the sum of the original subspace and a new Krylov subspaceK _m (w _j ,A ^T ) wherew _j is a newstart vector (this approach has been studied by Ye [26] for eigenvalue computations). Based on this strategy, we have developed a practical algorithm for linear systems called the MLAN/QM algorithm, which also incorporates the residual quasi-minimization as proposed in [12]. We present a few convergence bounds for the method as well as numerical results to show its effectiveness.Research supported by Natural Sciences and Engineering Research Council of Canada.