A new multi-step curve search method for unconstrained minimization problems is proposed. The convergence of the algorithm is proved under some mild conditions. The linear convergence rate is also investigated when th...
详细信息
A new multi-step curve search method for unconstrained minimization problems is proposed. The convergence of the algorithm is proved under some mild conditions. The linear convergence rate is also investigated when the objective function is uniformly convex. This method uses previous multi-step iterative information and curve search rule to generate new iterative points. Using more previous iterative information and curve search rule can make the new method converge more stably than traditional descent methods and be suitable to solve large scale problems.
The finite element method is combined with the natural boundary element method to study the weak solvability and Galerkin approximations of a class of semi-linear exterior boundary value problems. Theoretical analysis...
详细信息
The finite element method is combined with the natural boundary element method to study the weak solvability and Galerkin approximations of a class of semi-linear exterior boundary value problems. Theoretical analysis is mainly based on the variational formulation with constraints. The error estimate of the finite element solution and the asymptotic rate of convergence 0 (hn) are obtained. Finally, a numerical example is devoted to illustrate this new method.
This paper proposes a new switching control method - saturated function series approach - for generating multi-scroll chaotic attractors. The systematic methodology developed here can create multi-scroll chaotic attra...
详细信息
ISBN:
(纸本)0780388739
This paper proposes a new switching control method - saturated function series approach - for generating multi-scroll chaotic attractors. The systematic methodology developed here can create multi-scroll chaotic attractors from a given 3-D linear autonomous system with a saturated function series controller. It includes 1-D n-scroll, 2-D n × m-grid scroll, and 3-D n × m × l-grid scroll chaotic attractors. The chaos generation mechanism in multi-scroll systems is briefly discussed by analyzing the system equilibria.
Extracting and using goal orderings is a way to improve efficiencies of planning algorithms. During extracting goal orderings, some of existing methods can only deal with atomic goals of a specific problem that will i...
详细信息
ISBN:
(纸本)0780382730
Extracting and using goal orderings is a way to improve efficiencies of planning algorithms. During extracting goal orderings, some of existing methods can only deal with atomic goals of a specific problem that will introduce too much redundant work, and the others deal with predicates of a planning domain that can not extract enough goal orderings. The paper addressed an abstract method to extract goal orderings. The method used unification to identify different instantiations of a predicate when dealing with predicates. It can not only reduce redundant work during extracting, but also get enough goal orderings.
An abstract sufficient condition is developed to deal with Riesz basis generation in Hilbert spaces for cases where the eigenvalues are not necessarily simple and separable but are comprised of some finite unification...
详细信息
An abstract sufficient condition is developed to deal with Riesz basis generation in Hilbert spaces for cases where the eigenvalues are not necessarily simple and separable but are comprised of some finite unification of separable sets. The condition is then applied to the connected string system to show that there is a family of generalized eigen-functions, which forms a Riesz basis with parentheses in the state space. The spectrum-determined growth condition is concluded as a consequence.
For nonlinear discrete event dynamic systems described by min-max function, we point out that the cycle time can be assigned inmergely by state feedback, if and only if the system is reachable. Further, a simple neces...
详细信息
ISBN:
(纸本)0889863512
For nonlinear discrete event dynamic systems described by min-max function, we point out that the cycle time can be assigned inmergely by state feedback, if and only if the system is reachable. Further, a simple necessary and sufficient condition for that cycle time can be assigned independently by state feedback is given, hence the difficult problem which corresponds the pole assignment problem in traditional linear control systems is solved.
In this paper, we propose a nonoverlapping domain decomposition method for solving the three-dimensional Maxwell equations, based on the edge element discretization. For the Schur complement system on the interface, w...
详细信息
In this paper, we propose a nonoverlapping domain decomposition method for solving the three-dimensional Maxwell equations, based on the edge element discretization. For the Schur complement system on the interface, we construct an efficient preconditioner by introducing two special coarse subspaces defined on the nonoverlapping subdomains. It is shown that the condition number of the preconditioned system grows only polylogarithmically with the ratio between the subdomain diameter and the finite element mesh size but possibly depends on the jumps of the coefficients.
Involving end users to make the requirements elicitation process less prone to errors is currently one of the common opinions. This paper is presenting such kind of approach. Two factors concerning involving end users...
详细信息
ISBN:
(纸本)0889863415
Involving end users to make the requirements elicitation process less prone to errors is currently one of the common opinions. This paper is presenting such kind of approach. Two factors concerning involving end users are considered. The first is how to steer end users describe their applications. The second is how to make end users understand the results of analysis so that they will be able to supply further information or revise the current application descriptions. An enterprise ontology has been designed for these two purposes, and an ontology-based approach of the requirements elicitation and analysis has also been presented.
In this paper we define and study the notion of digital flatness. We extend to dimension two various definitions and classical results about digital lines and rays. In particular, we resolve a conjecture of Maurice Ni...
详细信息
We have been engaged in a software engineering project called Eagle, which was aimed at knowledge based automatical generation of information systems. In this project, we have developed a software called PROMIS (PROto...
详细信息
ISBN:
(纸本)0889863415
We have been engaged in a software engineering project called Eagle, which was aimed at knowledge based automatical generation of information systems. In this project, we have developed a software called PROMIS (PROtotyping Management Information systems) for generating information systems automatically. The work of PROMIS was relying upon a large scale domain knowledge base. For constructing this knowledge base, we have designed a new knowledge architecture which is a combination of object and ontology. We call our approach as ontology oriented (ONO). It has proved to possess many advantages versus the traditional approach which is based on objects only. But in the Eagle project we have programmed a big variety of different ontology structures without standard construction rules. The lack of standard architecture adds difficulty to ontology design and implementation. The contribution of this paper is to introduce type concepts for ontologies and to design an ontology language Ontodom with four basic ontology types. We have shown that a subtyping mechanism is powerful enough to produce the big variety of domain ontologies with help of the four basic ontology types of Ontodom. A case study is given. And at last, comparative discussions are given from the angles of ONO with other (structured and object-oriented) approaches and of Ontodom with other ontology representations.
暂无评论