Table of Content

26 March 1982, Volume 2 Issue 1 Previous Issue    Next Issue

For Selected:

View Abstracts

Download Citations EndNote Reference Manager ProCite BibTeX RefWorks

Toggle Thumbnails

Select

EQUIVALENCE FOR DEFINTIONS OF ZEROS OF MATRIX TRANSFER FUNCTIONS Wang Chaozhu Acta mathematica scientia,Series A. 1982, 2 (1):  1-8.  Abstract ( 55 )   RICH HTML PDF (380KB) ( 104 )   Save For the transfer function matrix of the linear multivariable time-invariant systems there are two definitions of its zeros introduced in tte earlier works. In this paper it is clarified that they are equivalent. Related Articles | Metrics

Select

AN INVERSE PROBLEM IN THE DYNAMICAL REATOR THEORY Feng Dexing, Zhu Guangtian Acta mathematica scientia,Series A. 1982, 2 (1):  9-16.  Abstract ( 81 )   RICH HTML PDF (391KB) ( 25 )   Save In this paper the optimal design problem of the diffusion-fission cross section for a dynamical reactor is considered on the basis of the simple energy static diffusion approximation equation. This problem, mathematically, can be explained as an inverse problem. The existence of the optimal diffusion-fission cross section and the corresponding optimality condition are given. Related Articles | Metrics

Select

ON THE BLOWING-UP AND QUENCHING PROBLEMS FOR SEMILINEAR HEAT EQUATIONS Chen Qingyi Acta mathematica scientia,Series A. 1982, 2 (1):  17-23.  Abstract ( 70 )   RICH HTML PDF (337KB) ( 80 )   Save In recent years it is found that solutions of initial value problems or initial-boundary value problems for semilinear parabolic equations may blow-up or quench. In this paper we consider problem of preventing the occurrence of these phenomena. By introducing a sufficiently "small" coefficient g(t) or g(t, x) to the nonlinear term f(u),we can preclude the blowing-up or quenching of the solution. Related Articles | Metrics

Select

PERIODIC CRACK PROBLEMS OF PLANE ANISOTROPIC MEDIUM Cai Hai tao Acta mathematica scientia,Series A. 1982, 2 (1):  35-44.  Abstract ( 62 )   RICH HTML PDF (469KB) ( 30 )   Save In this paper are given the solutions of the periodic crack problems of infinitive anisotropic medium for plane symmetric loadings by means of the method of complex function. There problems are now reduced to the determination of two complex functions that must satisfy certain boundary condition on the periodic cracks. The stresses,the displacements and the boundary conditions are assumed to be periodic, and further, the stresses are assumed to be bounded at infinity. The solutions are expressed in closed forms. Related Articles | Metrics

Select

OBSERVABLE CANONICAL FORMS AND IDENTIFICATION FOR LINEAR MULTIVARIABLE SYSTEMS Wang Zhimin, Lu Guizhang Acta mathematica scientia,Series A. 1982, 2 (1):  45-61.  Abstract ( 70 )   RICH HTML PDF (811KB) ( 30 )   Save In this paper the generalized selector matrix has been defind. Using this new conception the general form of input-output relationship.,which is eguivalent to the canonical state eguation, has been obtained,and a study is made on the internal relations between the different identification algorithms and between the different canonical forms. On the basis of this study a new simple algorithm of the realization of B* is proposed. Matrix inversion is not required for whole idea tification process. Related Articles | Metrics

Select

QUALITATIVE THEORIES OF CONSTRUCTIONS OF Q-PROCESSES ON ABSTRACT SPACES Zheng Xiaogu Acta mathematica scientia,Series A. 1982, 2 (1):  63-80.  Abstract ( 62 )   RICH HTML PDF (915KB) ( 16 )   Save The qualitative theories of the constructions of q-processes on countable spaces were established by Hou Zhenting and Guo Qingfeng ([7] or[1,Chapter 14]).In[4] the definition of q-processes on abstract spaces were mentioned, and the criterion for existence and for uniqueness were obtained. Related Articles | Metrics

Select

SOME PROPERTIES OF ORDERED TREES Wang Zhen yu Acta mathematica scientia,Series A. 1982, 2 (1):  81-83.  Abstract ( 56 )   RICH HTML PDF (134KB) ( 30 )   Save Orderd tree is a common information structure that we usually encounter in the computer science and algorithm studies for computer programming. In this paper, we will give some properties of ordered trees. Related Articles | Metrics

Select

COMPORTEMENT LIMITE DES SOLUTIONS DE CERTAINS PROBLEMES MIXTES POUR DES EQUATIONS PARABOLIQUES(2) A. Damlamian, Li Ta-tsien Acta mathematica scientia,Series A. 1982, 2 (1):  85-104.  Abstract ( 76 )   RICH HTML PDF (1002KB) ( 22 )   Save Soit Ω un ouvert de Rn×Rm de la forme Ω=O×G, où O est un ouvert borné régulier de Rn et contenant 1' origine,et G est un ouvert borné régulier de Rm. La variable dans O sera notée x, celle dans G z. Related Articles | Metrics

Select

LINE COLORED TREES WITH EXTENDABLE AUTOMORPHISMS Georg Gati, Frank Harary, Robert W. Robinson Acta mathematica scientia,Series A. 1982, 2 (1):  105-110.  Abstract ( 60 )   RICH HTML PDF (317KB) ( 21 )   Save An E-tree is a rooted line-colored tree such that every automorphism of a subtree contain-s ing the root can be extended to an automorphism of the entire tree. When only one color i used, E-trees correspond both to achiral planted trees and to partitions with successively divisible parts. The exact numbers of E-trees with n points and colors from a store of c are found, with and without the restriction that each color should be used at least one. Asymptotic formulas for these quantities are discussed for c fixed and n→∞. Related Articles | Metrics

Select

INFORMATION FLOW OF TREE (2) Tree Flow Equations Li Chuanxiang Acta mathematica scientia,Series A. 1982, 2 (1):  111-124.  Abstract ( 57 )   RICH HTML PDF (636KB) ( 22 )   Save This paper is the second part of Information Flow of Tree. In the first part we put emphasis on two most essential streams of information on tree, that is, characteristic information flow J and equivalent characteristic information flow Jθκ(F°), thus established the correlation between information. The purpose of this paper is to express the transforming characteristics when these information is flowing through the tree, i. e. to establish the so-called tree flow equations. These equations describe the transmit relation of information between root and leave. The major sections consist of 1) leave vector set; 2) principle of odd-even transformation and 3) tree flow, equations. Related Articles | Metrics