Banach空间中二阶积分-微分方程的初值问题

使用锥理论及单调迭代技术，首先讨论了Banach空间中一阶积分-微分方程初值问题的最小最大解的存在性，并在此基础上讨论了带有一阶微分项的二阶积分-微分方程初值问题的最小最大解的存在性。     

Some sufficient conditions for oscillation of impulsive delay hyperbolic systems with Robin boundary conditions

This paper deals with the oscillation problems of delay hyperbolic systems with impulses. Some sufficient conditions for oscillations of impulsive delay hyperbolic systems with Robin boundary conditions are obtained and the criteria of oscillation of the systems are established.     

基于"纵横向拉开档次法"的上市公司经营业绩评价

鉴于目前已具有较全面、完整、连续的有关上市公司各项指标的纵横向数据，为充分利用数据所蕴涵的信息，本文提出运用“纵横向拉开档次”的综合评价方法，其特点是使指标权重的确定能尽量将被评价对象在纵横向拉开档次。将该法运用于安徽地方板块的18家上市公司业绩评价，获得了各公司在1999～2001年间动态发展的分析结果。     

Optimal control of the obstacle in a quasilinear elliptic variational inequality

In this paper we consider an obstacle control problem where the state satisfies a quasilinear elliptic variational inequality and the control function is the obstacle. The state is chosen to be close to the desire profile while the H² norms of the obstacle is not too large. Existence and necessary conditions for the optimal control are established.     

New characterizations of Hajlasz-Sobolev spaces on metric spaces

This paper introduces the fractional Sobolev spaces on spaces of homogeneous type,includingmetric spaces and fractals. These Sobolev spaces include the well-known Hajfasz-Sobolev spaces as specialmodels.The author establishes varions chaaracterizations of(sharp)maximal functions for these spaces.Asapplications,the author identifies the fractional Sobolev spaces with some Lipscitz-type spaces.Moreover;some embedding theorems are also given.     

抛物型时滞偏微分方程解振动的充要条件

讨论一类多滞量抛物型时滞偏微分方程解的振动性质，获得了其一切解振动的充要条件及一些充分条件；指出了其与普通抛物型偏微分方程解的质的差异．     

齐次~Morrey-Herz 空间上分数次积分算子高阶交换子的有界性

在齐次Morrey-Herz空间上建立了高阶交换子~$T^{m}_{b,l}$ 和 ~$M^{m}_{b,l}$的有界性，其中~$T^{m}_{b,l}$ 和 ~$M^{m}_{b,l}$ 是由分数次积分算子和分数次极大算子分别与~BMO($R^{n}$)函数生成的高阶交换子.     

年龄相关的种群扩散系统的最优分布控制

本文讨论年龄相关的种群扩散系统的最优分布控制 ,证明了最优分布控制的存在性 ,得到了分布控制为最优的充分必要条件及确定最优控制的最优性组 .     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

On Two Theorems of Finite Solvable Groups

For a finite group G, let T（G） denote a set of primes such that a prime p belongs to T（G） if and only if p is a divisor of the index of some maximal subgroup of G. It is proved that if G satisfies any one of the following conditions： （1） G has a p-complement for each p∈T（G）; （2）│T（G）│= 2： （3） the normalizer of a Sylow p-subgroup of G has prime power index for each odd prime p∈T（G）; then G either is solvable or G/Sol（G）≌PSL（2, 7） where Sol（G） is the largest solvable normal subgroup of G.