关键词： 崔-lawson方程   遗传算法   参数估计  

摘要： 本文提出用遗传算法，对生态学中的一些数学模型参数进行优化估计，并以崔-lawson方程为例．尝试了遗传算法的效果．结果表明，该方法性能良好，可望成为生态学中各类非线性模型辨识的有效参数．

ISBN: (纸本)7560912044

关键词： 数学模型   机器人   三维视觉系统   优化算法  

摘要： 本文根据系统辨识理论，在比较深入分析三维视觉系统观测特性的基础上，提出了一种优化该系统数学模型的非线性迭代算法。实际测试结果表明，视觉系统的测量精度仅低于视觉传感器分辨率的０．２％，且在整个测量空间，其精度基本一致。

关键词： COUPLED LYAPUNOV EQUATIONS   JUMP LINEAR SYSTEMS   PARALLEL ALGORITHMS   DISCRETE-TIME SYSTEMS  

摘要： A parallel iterative scheme for solving coupled algebraic Lyapunov equations of discrete-time jump linear systems with Markovian transitions is introduced. The algorithm is computationally efficient since it operates on reduced-order decoupled algebraic discrete Lyapunov equations. Furthermore, the solutions at every iteration are computed by elementary matrix operations. Hence, the number of operations is minimal. Monotonicity of convergence is established under the existence conditions of unique positive solutions.

摘要： The method of thermodynamic calculation of binary phase diagrams (2PD), containing p disordered phases of variable composition and q phases of constant composition for case (p,q)less than or equal to 10 was constructed in this paper. In this method 1) the definition of all possible solutions of phase equilibrium equations system (PEES) was realized;2) the separation of PEES' roots or tie-line's ends at (T,P)=const was conducted;3) the original algorithm for calculation of PEES' roots was constructed and programmed and theorems about this algorithm convergence and about behaviour of this convergence were formulated and proved;4) the algorithm for autonomic selection of thermodynamically stable tie- lines was constructed and thereby calculating process T-x phase diagrams was automated. Some examples of using this method for calculation of binary phase diagrams for Cr-W, Ni-W, Mi-al and Mi-Cr are reported here.

关键词： IMAGE PROCESSING   MATHEMATICAL MORPHOLOGY   PARALLEL COMPUTING   OPTICAL COMPUTING   OPTICAL INFORMATION PROCESSING  

摘要： Morphological techniques are applied to binary image processors in a multiple-imaging optical system and the following algorithms are proposed: performing morphological basic operations, extraction of boundary lines, detection of characteristic points in small-scale patterns, elimination of salt noises with few pixels, and smoothing of boundaries. Techniques for processing a complicated binary image are demonstrated using the algorithms and a hybrid parallel computing system with a simple optical multiple-imaging system and a personal computer.

关键词： 模糊计算机   模糊计算   模糊插值  

摘要： ＦＤ转换器的核心是ｆｕｚｚｙ插值器，详细介绍了ｆｕｚｚｙ插值方法；首先给出ｆｕｚｚｙ插值的正式定义，然后研究ｆｕｚｚｙ插值所具备的性质及其精度估计．最后设计了一个算法．

关键词： Tree searching   directed graphs   Paths   search strategies   Byways   Numerical controls   greedy method  

摘要： This paper places three greedy search problems in the class NC: lexicographic topological-first search (lex-tfs) for DAGs, lexicographic depth-first search (lex-dfs) for DAGs, and lexicographic breadth-first search (lex-bfs) for directed graphs. The latter result answers an open question of Hoover and Ruzzo (A compendium of problems complete for P, draft, November 1985). For each of these problems, we show that the search trees from all sources in a graph of n vertices can be computed by an EREW PRAM in O(log(2) n) time using O(n(3)) operations for lex-dfs and O(n(3) log n) operations for lex-bfs/lex-tfs. Two novel results that emerge from our derivation of the algorithms are of interest in their own right. One uncovers a natural correspondence between the greedy search strategies and lexicographic versions of path finding problems. The other result is our approach to generating parallel algorithms for the lexicographic versions of path-algebra problems in a uniform way. This approach gives rise to a unifying algorithm which yields, as particular cases, NC algorithms for the path problems that correspond to the three greedy search strategies: all-pairs lexmax longest paths for weighted DAGs, all-pairs lexmin paths for DAGs, and all-pairs lexmin shortest paths for weighted directed graphs with no cycles of negative cost. (C) 1995 Academic Press, Inc.

关键词： FLOW INJECTION   MATHEMATICAL MODEL   OPTIMIZATION   POWELLS METHOD  

摘要： A methodology to design a flow- injection system with optimized performance characteristics for different experimental requirements is presented which requires minimal experimental effort. Departing from basic experimental knowledge of the hydrodynamic parameters and rates of the reactions involved, the coupling of a mathematical model describing the flow system with the Powell's optimization algorithm allows the automated generation of a complete set of flow- injection configurations, each of them being optimal with respect to its objective function. From this set of configurations, the performance of the flow- injection system is easily visualized, allowing the user to select the system that better suits the requirements of his particular application and exploiting the potentiality of multiple flow- injection optimal configurations.

摘要： Let k be a field, S = k[x(v) : v is an element of V] be the polynomial ring over the finite set of variables (x(v) : v is an element of V), and rn = (x(v) : v is an element of V) the ideal defining the origin of Spec S. It is theoretically known (see e.g. Alonso et al., 1991) that the algorithmic ideas for the computation of ideal (and module) intersections, quotients, deciding radical membership etc. in S may be adopted not only for computations in the local ring Sm but also for term orders of mixed type with standard bases replacing Grobner bases. Using the generalization of Mora's tangent cone algorithm to arbitrary term orders we give a detailed description of the necessary modifications and restrictions. In a second part we discuss a generalization of the deformation argument for standard bases and independent sets to term orders of mixed type. For local term orders these questions were investigated in Grabe (1991). The main algorithmic ideas described are implemented in the author's REDUCE package CALI (Grabe, 1993a).