软件需求定量分析及其映射的模糊层次分析法

在用数量化理论 3 类(quantification theory of type 3,简称 QT3)定量地分析软件需求的基础上,以质量功能展开(quality function deployment,简称 QFD)中的质量屋(house of quality,简称 HOQ)系列矩阵为纲领,基于由模糊技术改进后的模糊层次分析法(fuzzy analytic hierarchy process,简称 FAHP),提出了一种软件需求定量分析及其向设计实现过程模糊映射的方法.将该方法具体应用于 CD-R/RW 光盘刻录机软件的开发过程,其有效性得到了验证.

Using Symbolic Computation to Exactly Solve the Integrable Broer-Kaup Equations in （2＋1）-Dimensional Spaces

The extended tanh method is further improved by generalizing the Riccati equation and introducing its twenty seven new solutions. As its application, the (2+ 1)-dimensional Broer-Kaup equation is investigated and then its fifty four non-travelling wave solutions have been obtained. The results reported in this paper show that this method is more powerful than those, such as tanh method, extended tanh method, modified extended tanh method and Riccati equation expansion method introduced in previous literatures.

QoS multicast routing algorithm based on GA

The multicast routing problem with multiple QoS constraints in networks with uncertain parameters is discussed, and a network model that is suitable to research such QoS multicast routing problem is described. The QMRGA, a multicast routing policy for Internet, mobile network or other highperformance networks is mainly presented, which is based on the genetic algorithm(GA), and can provide QoSsensitive paths in a scalable and flexible way in the network environment with uncertain parameters. The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or nearoptimal solution within few iterations, even for the network environment with uncertain parameters. The incremental rate of computational cost can be close to a polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated by using simulations. The results show that QMRGA provides an available approach to QoS multicast routing in network environment with uncertain parameters.

Applications of Jacobi Elliptic Function Expansion Method for Nonlinear Differential-Difference Equations

The Jacobi elliptic function expansion method is extended to derive the explicit periodic wave solutions for nonlinear differential-difference equations. Three well-known examples are chosen to illustrate the application of the Jacobi elliptic function expansion method. As a result, three types of periodic wave solutions including Jacobi elliptic sine function, Jacobi elliptic cosine function and the third elliptic function solutions are obtained. It is shown that the shock wave solutions and solitary wave solutions can be obtained at their limit condition.

Optimizing on multiple constrained QoS multicast routing algorithms based on GA

With the rapid development of Intemet, mobile networks and high-performance networking technology, multiple constrained QoS multicast routing optimization in networks with uncertain parameters has become a very important research issue in the areas of networks and distributed systems. It is also a challenging and hard problem to the next generation Intemet and high-performance networks, and has attracted the interests of many people. This paper discusses the multiple constrained QoS multicast routing problem, which may deal with the delay, delay jitter, bandwidth and packet loss metrics, and describes a network model for researching the routing problem. The paper mainly presents multiple constrained QoS multicast routing algorithm (MCQMRA), a QoS multicast routing policy for Intemet, mobile network or other high-performance networks, which is based on the genetic algorithm (GA) and can provide QoS-sensitive paths in a scalable and flexible wayin the network environment with uncertain parameters. The MCQMRA can also optimize the network resources such as bandwidth, delay, packet loss metrics and can converge to the optimal or near-optimal solution within few iterations, even for the network environment with uncertain parameters. Simulation results show that MCQMRA is an available approach to QoS multicast routing decision.

Computer Algebra and Solutions to the Karamoto-Sivashinsky Equation

The method of Riccati equation is extended for constructing travelling wave solutions of nonlinear partial differential equations. It is applied to solve the Karamoto-Sivashinsky equation and then its more new explicit solutions have been obtained. From the results given in this paper, one can see the computer algebra plays an important role in this procedure.

Feature selection based on mutual information and redundancy-synergy coefficient

Mutual information is an important information measure for feature subset. In this paper, a hashing mechanism is proposed to calculate the mutual information on the feature subset. Redundancy-synergy coefficient, a novel redundancy and synergy measure of features to express the class feature, is defined by mutual information. The information maximization rule was applied to derive the heuristic feature subset selection method based on mutual information and redundancy-synergy coefficient. Our experiment results showed the good performance of the new feature selection method.

An Automated Algebraic Method for Finding a Series of Exact Travelling Wave Solutions of Nonlinear Evolution Equations

Based on a type of elliptic equation,a new algebraic method to construct a series of exact solutions for nonlinear evolution equations is proposed,meanwhile,its complete implementation TRWS in Maple is presented.The TRWS can output a series of travelling wave solutions entirely automatically,which include polynomial solutions,exponential function solutions,triangular function solutions,hyperbolic function solutions,rational function solutions,Jacobi elliptic function solutions,and Weierstrass elliptic function solutions.The effectiveness of the package is illustrated by applying it to a variety of equations.Not only are previously known solutions recovered but also new solutions and more general form of solutions are obtained.

Applications of Computer Algebra in Solving Nonlinear Evolution Equations

With the use of computer algebra, the method that straightforwardly leads to travelling wave solutions is presented. The compound KdV-Burgers equation and KP-B equation are chosen to illustrate this approach. As a result, their abundant new soliton-like solutions and period form solutions are found.

桌面环境下拼贴显示的自动对准(英文)

通过拼贴一组投影仪来构建高分辨率显示系统已成为现在一个较实际的办法.但是,这样的高分辨率显示系统用途有限,因为它们需要在定制的并行机或个人计算机集群上运行一些专门开发的并行形象化程序才能实现.针对个人计算机桌面环境下的任意拼贴显示给出了一种自动对准机制,使得桌面用户可以在其上运行普通的桌面应用软件.该系统包括3个步骤:检测投影仪对齐失准,计算出纠正所需之变换,对桌面环境进行实时的变形.这样就允许用户在运行任何2D,3D或视频程序时无须作任何修改,也无须使用专门的硬件支持.实验结果表明,系统能够获得亚像素级的精度,并且能在系统性能衰减最小的情况下达到实时变形.

Travelling Wave Solutions to a Special Type of Nomlinear Evolution Equation

A unified approach is presented for finding the travelling wave solutions to one kind of nonlinear evolution equation by introducing a concept of 'Rank',The key idea of this method is to make use of the arbitrariness of the manifold in Painleve analysis.We selected a new expansion variable and thus obtained a rich variety of travelling wave manifold in Painleve analysis.We selected a new expansion varialbe and thus obtained a rich variety of travelling wave manifold in Painleve analysis.We selected a new expansion variable and thus obtained a rich variety of travelling wave solutions to nonlinear veolution equation.which covered solitary wave solutions periodic wave solutions.Weierstrass elliptic function solutions,and rational solutions.Three illustrative equations are investigated by this means,and abundant travelling wave solutions are obtained in a systematic way,In addition,some new solutions are firstly reported here.

Conservation Laws and Soliton Solutions for Generalized Seventh Order KdV Equation

With the assistance of the symbolic computation system Maple,rich higher order polynomial-type conservation laws and a sixth order t/x-dependent conservation law are constructed for a generalized seventh order nonlinear evolution equation by using a direct algebraic method.From the compatibility conditions that guaranteeing the existence of conserved densities,an integrable unnamed seventh order KdV-type equation is found.By introducing some nonlinear transformations,the one-,two-,and three-solition solutions as well as the solitary wave solutions are obtained.

Solving geometric constraints with genetic simulated annealing algorithm

This paper applies genetic simulated annealing algorithm (SAGA) to solving geometric constraint problems. This method makes full use of the advantages of SAGA and can handle under-/over- constraint problems naturally. It has advantages (due to its not being sensitive to the initial values) over the Newton-Raphson method, and its yielding of multiple solutions, is an advantage over other optimal methods for multi-solution constraint system. Our experiments have proved the robustness and efficiency of this method.

An Automated Jacobi Elliptic Function Method for Finding Periodic Wave Solutions to Nonlinear Evolution Equation

We describe the Jacobi elliptic function method for finding exact periodic wave solutions to nonlinear evolution equations.We present a Maple packaged automated Jacobi elliptic function method,which can entirely automatically output the exact periodic wave solutions.The effectiveness of the automated Jacobi elliptic function method is demonstrated using as examples the spplication to a variety of equations with physical interest.Not only are the previously known solutions recovered but in some cases new solutions and more general forms of solutions are obtained.

VEHICLE SIMULATION MODEL FOR DEVELOPING AN INTELLIGENT SLOPE SHIFT STRATEGY

With the rapid development of electronics and the growing demand for higher vehicle performance,intelligent shift technology is becoming increasingly important,and it promises to be a developing trend in vehicle automatic transmissions.A new simulation model is presented,which includes engine,powertrain,tire and vehicle dynamics models.Based on the model,simulation experiments are conducted to investigate the slope shift strategy.The data and conclusions obtained from the simulations are valuable contributions to the development of an intelligent slope shift strategy.

Research on Algorithm for Generating Min-Area Rectangle Encasing Box for Closed Contour

In many engineering applications, it is necessary to calculate the min-area encasing box of a circumscription. In this paper, an algorithm for generating the min-area rectangle encasing box, based on revolving angle, is investigated and hence put forward. The algorithm computes the areas of the outer rectangular bounds of a closed contour in different revolving angles θ by dispersing approach where 0< θ < π/2 because of the axial symmetry. It is very simple, straight forward and highly efficient. The complexity of its computing time reaches O(n·k ). Practical applications suggest its usefulness and efficiency.

General explicit solutions of a classical Boussinesq system

Seeking a travelling wave solution of the classical Boussinesq system and making an ansatz for the solution,we obtain a nonlinear system of algebraic equations.We solve the system using an effective algorithm and then two general explicit solutions are obtained which are of physical interest.

IMPROVED ACCURACY AND ROUGHNESS MEASURES FOR ROUGH SETS

Accuracy and roughness, proposed by Pawlak(1982), might draw a conclusion inconsistent with our intuition in some cases. This letter analyzes the limitations in these measures and proposes improved accuracy and roughness measures based on information theory.

Iterative Solution for Systems of Nonlinear Two Binary Operator Equations

Using the cone and partial ordering theory and mixed monotone operator theory, the existence and uniqueness of solutions for some classes of systems of nonlinear two binary operator equations in a Banach space with a partial ordering are discussed. And the error estimates that the iterative sequences converge to solutions are also given. Some relevant results of solvability of two binary operator equations and systems of operator equations are imnroved and generalized.

On formalizing and verifying web services

Web services are becoming an important paradigm for web-based computing. However the mainstream web service description language such as WSDL (Web Service Description Language) is lack of formal basis. In order to verify the behavioral properties of web services, we adopt the π-calculus as a precise language because it provides many useful facilities such as behavioral equivalence, mobility that are lack in other formal language. The basic elements of WSDL are translated into the terms in the π-calculus. By means of the MWB (Mobility Workbench), a concurrency tool, the behavioral property of web services denoted by processes is verified.