A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

An implicit method for linear ill‐posed problems with perturbed operators

An implicit iterative method is applied to solving linear ill‐posed problems with perturbed operators. It is proved that the optimal convergence rate can be obtained after choosing suitable number of iterations. A generalized Morozov's discrepancy principle is proposed for the problems, and then the optimal convergence rate can also be obtained by an a posteriori strategy. The convergence results show that the algorithm is a robust regularization method. Copyright © 2006 John Wiley & Sons, Ltd.     

液压传动实验教学的新模式

在液压传动实验教学改革的研究与实践中,针对传统的液压传动实验教学中演示性实验的不足,构建了培养设计力和创新能力为目标的液压传动实验教学新模式,并用实例说明实验实施的方案。     

远程学习材料中的活动设计

本文对远程学习材料中活动设计的重要性、类型和形式、结构、数量安排、与学习者之间的关系等内容进行了全面的介绍，指出良好的活动设计是远程学习材料开发的关键要素，只有符合远程学习特征的学习材料才能真正适合远程学习者的需要，才能保证远程教育的质量。     

Concerning seven and eight mutually orthogonal Latin squares

In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc.     

Interior point cutting plane method for optimal power flow

In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective.     

Block transitive Steiner systems with more than one point orbit

For all ‘reasonable’ finite t, k, and s, we construct a t‐(?₀, k, 1) design and a group of automorphisms which is transitive on blocks and has s orbits on points. In particular, there is a 2‐(?0, 4, 1) design with a block‐transitive group of automorphisms having two point orbits. This answers a question of P. J. Cameron and C. E. Praeger. The construction is presented in a purely combinatorial way, but is a by‐product of a new way of looking at a model‐theoretic construction of E. Hrushovski. © 2004 Wiley Periodicals, Inc.     

Formula 1 – A Mathematical Microworld with CAS: Analysis of Learning Opportunities and Experiences with Students

In this article we describe a mathematical microworld for investigating car motion on a racing course and its use with a group of grade 12 students. The microworld is concerned with the mathematical construction of courses and functions which describe car motion. It is implemented in the computer algebra system, Maple^®, which provides the means to represent courses and functions symbolically and graphically. We describe the learning opportunities offered by the microworld in relation to the research literature on functions. Various facets and layers of the function concept are addressed in the microworld, and we suggest how work in the microworld might help in overcoming some well-known misconceptions.This revised version was published online in September 2005 with corrections to the Cover Date.     

The solvability conditions for inverse eigenproblem of symmetric and anti‐persymmetric matrices and its approximation

The problem of generating a matrix A with specified eigen‐pair, where A is a symmetric and anti‐persymmetric matrix, is presented. An existence theorem is given and proved. A general expression of such a matrix is provided. We denote the set of such matrices by ??????_Eⁿ. The optimal approximation problem associated with ??????_Eⁿ is discussed, that is: to find the nearest matrix to a given matrix A* by A∈??????_Eⁿ. The existence and uniqueness of the optimal approximation problem is proved and the expression is provided for this nearest matrix. Copyright © 2002 John Wiley & Sons, Ltd.     

酒店计算机管理系统

酒店宾馆总台有大量业务数据,传统手工处理效率低,不能适应现代化管理的需要.现代计算机处理数据速度快、效率高、成本低,本系统实现酒店宾馆总台的大量业务数据从手工处理转为计算机自动处理,并交付实际应用.