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

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

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

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

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

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

名人名著谈统计学

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. 最重要的是,统计学家应该是科学家.     

单节点图的弱最大亏格

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

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

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

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

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

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.     

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

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

欧氏空间中完备极小子流形

在一个类似于稳定不等式的条件下,得到了欧氏空间中完备极小子流形的Bernstein型定理.我们的结果部分推广了Li H.Z.和Wei G.X.的定理.     

三种新变形的全一问题

该文研究三种新变形的全一问题及最小全一问题. 原始的全一问题可被形象的称为顶点点亮顶点问题, 而这三类新问题则分别被称为顶点点亮边问题,边点亮顶点问题,边点亮边问题. 顶点点亮顶点问题已经得到了广泛的研究. 比如,解的存在性问题和求解的有效算法已经被解决,一般图上的最小顶点点亮顶点问题已经被证明是NP- 完备的,树、单圈图和双圈图上的最小顶点点亮顶点问题的线性时间最优算法也已被给出等. 该文对于顶点点亮边问题,证明一个图有解当且仅当它是二部图,因此只可能有两组解和最优解. 对于边点亮顶点问题,证明一个图有解当且仅当它包含偶数个顶点,并通过将其最优问题多项式变换成最小权的完美匹配问题,得出一般图上的最小边点亮顶点问题可在多项式时间内求解. 边点亮边问题可归约成线图上的顶点点亮顶点问题.     

General Tricomi-Rassias problem and oblique derivative problem for generalized Chaplygin equations

Many authors have discussed the Tricomi problem for some second order equations of mixed type, which has important applications in gas dynamics. In particular, Bers proposed the Tricomi problem for Chaplygin equations in multiply connected domains [L. Bers, Mathematical Aspects of Subsonic and Transonic Gas Dynamics, Wiley, New York, 1958]. And Rassias proposed the exterior Tricomi problem for mixed equations in a doubly connected domain and proved the uniqueness of solutions for the problem [J.M. Rassias, Lecture Notes on Mixed Type Partial Differential Equations, World Scientific, Singapore, 1990]. In the present paper, we discuss the general Tricomi-Rassias problem for generalized Chaplygin equations. This is one general oblique derivative problem that includes the exterior Tricomi problem as a special case. We first give the representation of solutions of the general Tricomi-Rassias problem, and then prove the uniqueness and existence of solutions for the problem by a new method. In this paper, we shall also discuss another general oblique derivative problem for generalized Chaplygin equations.     

Recovery of the unknown coefficients in a two-dimensional hyperbolic equation

In this paper, an inverse boundary value problem for a two-dimensional hyperbolic equation with overdetermination conditions is studied. To investigate the solvability of the original problem, we first consider an auxiliary inverse boundary value problem and prove its equivalence to the original problem in a certain sense. We then use the Fourier method to reduce such an equivalent problem to a system of integral equations. Furthermore, we prove the existence and uniqueness theorem for the auxiliary problem by the contraction mappings principle. Based on the equivalency of these problems, the existence and uniqueness theorem for the classical solution of the original inverse problem is proved. Some discussions on the numerical solutions for this inverse problem are presented including some numerical examples.     

A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming

In this paper, we study the bilevel programming problem with discrete polynomial lower level problem. We start by transforming the problem into a bilevel problem comprising a semidefinite program (SDP for short) in the lower level problem. Then, we are able to deduce some conditions of existence of solutions for the original problem. After that, we again change the bilevel problem with SDP in the lower level problem into a semi-infinite program. With the aid of the exchange technique, for simple bilevel programs, an algorithm for computing a global optimal solution is suggested, the convergence is shown, and a numerical example is given.     

Heuristic Solution Methods for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem is a problem of assigning agents to tasks where the agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. Two heuristic solution methods are presented for the problem. The heuristics are developed from solution methods for the generalized assignment problem. One method uses a regret minimization approach whilst the other method uses a repair approach on a relaxation of the problem. The heuristics are able to solve moderately large instances of the problem rapidly and effectively. Procedures for deriving an upper bound on the solution of the problem are also described. On larger and harder instances of the problem one heuristic is particularly effective.     

精确罚函数和极小极大问题

在这篇文章中我们研究了对于不等式约束的非线性规划问题如何根据极小极大问题的鞍点来找精确罚问题的解。对于一个具有不等式约束的非线性规划问题,通过罚函数,我们构造出一个极小极大问题,应用交换“极小”或“极大”次序的策略,证明了罚问题的鞍点定理。研究结果显示极小极大问题的鞍点是精确罚问题的解。     

Classification Problem for Graphs and Lattices is Wild

The classification problem for finite and infinite algebraic lattices has also been extensively addressed. A wild classification problem contains the classification problem of pairs of matrices up to simultaneous similarity. In this paper, we prove that the classification problem for graphs is wild by reducing the classification problem for finite 2-nilpotent p-groups to the classification problem for graphs.     

Global Method for Monotone Variational Inequality Problems with Inequality Constraints

We consider optimization methods for monotone variational inequality problems with nonlinear inequality constraints. First, we study the mixed complementarity problem based on the original problem. Then, a merit function for the mixed complementarity problem is proposed, and some desirable properties of the merit function are obtained. Through the merit function, the original variational inequality problem is reformulated as simple bounded minimization. Under certain assumptions, we show that any stationary point of the optimization problem is a solution of the problem considered. Finally, we propose a descent method for the variational inequality problem and prove its global convergence.     

A hybrid method for multidimensional scaling using city-block distances

The problem of multidimensional scaling with city-block distances in the embedding space is reduced to a two level optimization problem consisting of a combinatorial problem at the upper level and a quadratic programming problem at the lower level. A hybrid method is proposed combining randomized search for the upper level problem with a standard quadratic programming algorithm for the lower level problem. Several algorithms for the combinatorial problem have been tested and an evolutionary global search algorithm has been proved most suitable. An experimental code of the proposed hybrid multidimensional scaling algorithm is developed and tested using several test problems of two- and three-dimensional scaling.