仿酉对称矩阵的构造及对称正交多小波滤波带的参数化

仿酉矩阵在小波、多小波、框架的构造中发挥了重要的作用.本文给出仿酉对称矩阵(简记为p.s.m.)的显式构造算法,其中仿酉对称矩阵是元素为对称或反对称多项式的仿酉矩阵.基于已构造的p.s.m.和已知的正交对称多小波(简记为o.s.m.),给出o.s.m.的参数化.恰当地选择一些参数,可得到具有一些优良性质的o.s.m.,例如Armlet.最后作这一个算例,构造出一类对称的Chui-Lian Armlet滤波带.     

名人名著谈统计学

W.E.Denting(1940),Discussion of Professor Hottelling's Paper "The Teaching of Statistics"(Ann.Math.Stat.Vol.11,457-470): Above all,a statistician must be a scientist. 最重要的是,统计学家应该是科学家.     

D.C.隶属函数模糊集及其应用(I)--D.C.隶属函数模糊集基本概念与性质

本文是D.C.隶属函数模糊集及其应用系列研究的第一部分.建立了D.C.隶属函数模糊集的基本概念.探讨了D.C.隶属函数模糊集的基本性质和D.C.隶属函数模糊集对一些常见的重要t模、余模和伪补的封闭性.并以此建立了丰富的模糊数学应用模型.     

柔性圆环壳在子午面内整体弯曲的复变量方程及细环壳的一般解

在З.Л.Аксельрад(E.L.Axelrad)非轴对称载荷下柔性旋转壳线性方程的基础上,导出了圆环壳在子午面内整体弯曲的复变量方程和相应的细环壳方程.该方程可与钱伟长给出了一般解的В.В.Новожилов(V.V.Novozhilov)轴对称环壳方程相类比.通过类比,给出了细环壳在子午面内整体弯曲的一般解.所给出的解可以用来计算波纹管整弯曲的应力和端面位移.     

股价最简微分方程,其解及与Black-Scholes模型的假设的相互关系

在系数的某种等价关系条件下,股价的两类数学表达式,一类是基于明确型描述的由类似固体力学方法导出的最简微分方程(S.D.E.)的解,另一类是基于不确定型描述(即统计理论)的Black-Scholes模型的假设(A.B-S.M.),即股价密度函数服从对数正态分布,可以是完全相同的.S.D.E.的解仅适用于股市的常规情形(无利好或利空消息,等),因此,A.B-S.M.的适用范围也相同.     

β混合随机变量序列加权和的收敛性

本文研究了混合随机变量序列加权和的收敛性.利用Utev, S.和Peligrad, M不等式得到了混合随机变量序列加权和的收敛性定理及Hajeck-Rènyi型不等式,推广和改进了W.F,Stout,吴群英,J.Hajeck和A.Rènyi.的相应结论.     

对Aubin与Frankowska关于闭凸集值映射最小选择的一个结果的讨论

本文对J.-P.Aubin与H.Frankowska最近关于自反严格凸Banach空间中闭凸集值映射最小选择连续的一个结果加以讨论,首先在比自反性较强的一类空间中讨论了在弱于J.-P.Aubin与H.Frankowska的条件下闭凸集值映射最小选择的连续性,其次对J.-P.Aubin与H.Frankowska的结果给出一个新的简单证明,最后用反例说明本文给出的条件与J.-P.Aubin与H.Frankowska条件都是充分而不必要的.     

单节点图的弱最大亏格

单节点图即只有一个点的图.本文讨论了该图类的三种嵌入.并得到了对应的最大亏格.对于这类图的弱嵌入.插值定理是成立的.     

(伪)单调集值映射拟均衡问题

主要讨论G-凸上的广义向量拟均衡问题,推广W.O ettli,D.Sch l ger,Q.H.A nsari,I.V.K onnov,和J.C.Y ao的一些主要结果.     

TWO-DIMENSIONAL RIEMANN PROBLEMS： FROM SCALAR CONSERVATION LAWS TO COMPRESSIBLE EULER EQUATIONS

In this paper we survey the authors＇ and related work on two-dimensional Riemann problems for hyperbolic conservation laws, mainly those related to the compressible Euler equations in gas dynamics. It contains four sections： 1. Historical review. 2. Scalar conservation laws. 3. Euler equations. 4. Simplified models.     

Stability and chaos control of regularized Prabhakar fractional dynamical systems without and with delay

In this paper, we studied the stabilization of nonlinear regularized Prabhakar fractional dynamical systems without and with time delay. We establish a Lyapunov stabiliy theorem for these systems and study the asymptotic stability of these systems without design a positive definite function V (without considering the fractional derivative of function V is negative). We design a linear feedback controller to control and stabilize the nonautonomous and autonomous chaotic regularized Prabhakar fractional dynamical systems without and with time delay. By means of the Lyapunov stability, we obtain the control parameters for these type of systems. We further present a numerical method to solve and analyze regularized Prabhakar fractional systems. Furthermore, by employing numerical simulation, we reveal chaotic attractors and asymptotic stability behaviors for four systems to illustrate the presented theorem.     

Controllability and observability of coordinated linear systems

This paper develops concepts of controllability and observability for the class of coordinated linear systems, a special class of linear hierarchical systems with a top-to-bottom information structure. The usual concepts of reachability and indistinguishability for linear systems are refined, taking into account the decentralized nature of coordinated linear systems. The corresponding controllability and observability decompositions are derived, and several concepts of controllability and observability for coordinated linear systems are introduced and discussed. These results are then combined to a definition and characterization of stabilizability via dynamic measurement feedback for this class of systems.     

Isochronous systems and their quantization

We review recent results about classical isochronous systems characterized by the presence of an open (hence fully dimensional) region in their phase space in which all their solutions are completely periodic (i.e., periodic in all degrees of freedom) with the same fixed period (independent of the initial data provided they are inside the isochronicity region). We report a technique for generating such systems, whose wide applicability justifies the statement that isochronous systems are not rare. We also present an analogous technique applicable to a vast class of Hamiltonian systems and generating isochronous Hamiltonian systems. We also report some results concerning the quantized versions of such systems.     

Three and four-body systems in one dimension: Integrability,superintegrability and discrete symmetries

Families of three-body Hamiltonian systems in one dimension have been recently proved to be maximally superintegrable by interpreting them as one-body systems in the three-dimensional Euclidean space, examples are the Calogero, Wolfes and Tramblay Turbiner Winternitz systems. For some of these systems, we show in a new way how the superintegrability is associated with their dihedral symmetry in the three-dimensional space, the order of the dihedral symmetries being associated with the degree of the polynomial in the momenta first integrals. As a generalization, we introduce the analysis of integrability and superintegrability of four-body systems in one dimension by interpreting them as one-body systems with the symmetries of the Platonic polyhedra in the four-dimensional Euclidean space. The paper is intended as a short review of recent results in the sector, emphasizing the relevance of discrete symmetries for the superintegrability of the systems considered.     

Symplectic Transformations and a Reduction Method for Asymptotically Linear Hamiltonian Systems

In many fields of applications, especially in applications from mechanics, many equations of motion can be written as Hamiltonian systems. In this paper, we study a class of asymptotically linear Hamiltonian systems. We construct a symplectic transformation which reduces the linear systems of the Hamiltonian systems. This reduction method can be applied to study the existence of periodic solutions for a class of asymptotically linear Hamiltonian systems under weaker conditions on the linear systems of the Hamiltonian systems.     

Gyroscopic control and stabilization

Summary In this paper, we consider the geometry of gyroscopic systems with symmetry, starting from an intrinsic Lagrangian viewpoint. We note that natural mechanical systems with exogenous forces can be transformed into gyroscopic systems, when the forces are determined by a suitable class of feedback laws. To assess the stability of relative equilibria in the resultant feedback systems, we extend the energy-momentum block-diagonalization theorem of Simo, Lewis, Posbergh, and Marsden to gyroscopic systems with symmetry. We illustrate the main ideas by a key example of two coupled rigid bodies with internal rotors. The energy-momentum method yields computationally tractable stability criteria in this and other examples.     

Categorical Abstract Algebraic Logic: Leibniz Equality and Homomorphism Theorems

The study of structure systems, an abstraction of the concept of first-order structures, is continued. Structure systems have algebraic systems rather than universal algebras as their algebraic reducts. Moreover, their relational component consists of a collection of relation systems on the underlying functors rather than simply a system of relations on a single set. Congruence systems of structure systems are introduced and the Leibniz congruence system of a structure system is defined. Analogs of the Homomorphism, the Second Isomorphism and the Correspondence Theorems of Universal Algebra are provided in this more abstract context. These results generalize corresponding results of Elgueta for equality-free first-order logic. Finally, a version of Gödel’s Completeness Theorem is provided with reference to structure systems.     

Critical systems thinking and practice

Critical systems thinking and the methodologies associated with it were developed precisely to allow analysis of complex societal problems and intervention to resolve such problems. Early approaches employing systems ideas, such as operational research, systems analysis and systems engineering, were suitable for tackling certain well-defined problems, but were found to have limitations when faced with complex problems involving people with a variety of viewpoints and frequently at odds with one another. Systems thinkers responded with approaches such as system dynamics and organisational cybernetics to tackle complexity; soft systems methodology (SSM) and interactive planning to handle subjectivity; and critical systems heuristics to help the disadvantaged in situations involving conflict. There was a corresponding enlargement of the range of problem contexts in which they felt competent to intervene. It has been critical systems thinking, however, which has supplied the bigger picture, has allowed systems thinking to mature as a discipline and has set out how the variety of methodologies now available can be used together in a coherent manner to promote successful intervention in complex societal problem situations. This paper outlines, at the request of the editor of this special issue, my involvement in developing critical systems thinking and practice, describes its origins, nature and use, and sets out a programme for future research in the area.     

Stability and robustness of quasi-linear impulsive hybrid systems

Both hybrid dynamical systems and impulsive dynamical systems are studied extensively in the literature. However, impulsive hybrid systems are not yet well studied. Nonetheless, many physical systems exhibit both system switching and impulsive jump phenomena. This paper investigates stability and robust stability of a class of quasi-linear impulsive hybrid systems by using the methods of Lyapunov functions and Riccati inequalities. Sufficient conditions for stability and robust stability of those systems are established. Some examples are given to illustrate the applicability of our results.     

First fall degree and Weil descent

Polynomial systems arising from a Weil descent have many applications in cryptography, including the HFE cryptosystem and the elliptic curve discrete logarithm problem over small characteristic fields. Understanding the exact complexity of solving these systems is essential for the applications. A first step in that direction is to study the first fall degree of the systems. In this paper, we establish a rigorous general bound on the first fall degree of polynomial systems arising from a Weil descent. We also provide experimental data to study the tightness of our bound in general and its plausible consequences on the complexity of polynomial systems arising from a Weil descent.