Lower and upper orientable strong radius and strong diameter of complete k-partite graphs

For two vertices u and v in a strong digraph D, the strong distance sd(u,v) between u and v is the minimum size (the number of arcs) of a strong sub-digraph of D containing u and v. For a vertex v of D, the strong eccentricity se(v) is the strong distance between v and a vertex farthest from v. The strong radius srad(D) (resp. strong diameter sdiam(D)) is the minimum (resp. maximum) strong eccentricity among the vertices of D. The lower (resp. upper) orientable strong radius srad(G) (resp. SRAD(G)) of a graph G is the minimum (resp. maximum) strong radius over all strong orientations of G. The lower (resp. upper) orientable strong diameter sdiam(G) (resp. SDIAM(G)) of a graph G is the minimum (resp. maximum) strong diameter over all strong orientations of G. In this paper, we determine the lower orientable strong radius and diameter of complete k-partite graphs, and give the upper orientable strong diameter and the bounds on the upper orientable strong radius of complete k-partite graphs. We also find an error about the lower orientable strong diameter of complete bipartite graph K_m,n given in [Y.-L. Lai, F.-H. Chiang, C.-H. Lin, T.-C. Yu, Strong distance of complete bipartite graphs, The 19th Workshop on Combinatorial Mathematics and Computation Theory, 2002, pp. 12-16], and give a rigorous proof of a revised conclusion about sdiam(K_m,n).     

How to count strong adsorption sites by gas chromatography?

Summary A simple gas chromatographic method is presented for the determination of the quantity of the strongest adsorption sites on an adsorbent's surface. The method consists of the blockage of the sites with quasi-irreversibly adsorbed, known amount of a strongly interacting compound and subsequent measuring of the retention of a hydrocarbon during the presence of the blocking compound in the column. Heterogeneity of chromatographic grade silicas is investigated with this method.     

连续时间遗传算法模型及其强收敛性分析

本文在隐马尔可夫链的框架下利用隐马尔可夫链{Xt:t∈[0,∞)}的观测链的概率分布提出一个连续化遗传算法模型，并给出其一个强收敛结果，讨论了其离散骨架的性质。     

大孔阳树脂催化合成苯乙酸酯

利用Ｄ７２，Ｄ６１大孔阳离子交换树脂为催化剂，催化合成苯乙酸异戊酯、苯乙酸丁酯、苯乙酸苄酸、苯乙酸苯乙酯、苯乙酸茴香酯。对影响反应的诸因素进行了讨论，酯收率为９０％左右。     

时间随机环境下随机游动的渐近行为

本文给出了可数状态空间中时间随机环境下随机游动的一个统一的模型 .对于最常见的情况 ,即d维最近邻域随机环境下随机游动 ,如果环境是严平稳的 ,则在一定条件下 ,该随机游动满足强大数定律和中心极限定理 .特别地 ,当环境独立同分布时 ,我们可以得到更为具体的结果 ,该结果类似于经典的随机游动的相应结论 .     

Krein空间上算子的可定化性

从Hilbert空间(H,(·,·))上的一个有界自伴算子G可以导出不定内积[·,·]:=(G·,·),本文给出了由G所导出的Krein空间上的G-自伴、G-酉以及G-正常算子的可定化、强可定化和一致可定化性质以及这三种不同的可定化性之间的关系.     

A nonlinear nonlocal mixed problem for a second order pseudoparabolic equation

We study a nonlocal mixed problem for a nonlinear pseudoparabolic equation, which can, for example, model the heat conduction involving a certain thermodynamic temperature and a conductive temperature. We prove the existence, uniqueness and continuous dependence of a strong solution of the posed problem. We first establish for the associated linear problem a priori estimate and prove that the range of the operator generated by the considered problem is dense. The technique of deriving the a priori estimate is based on constructing a suitable multiplicator. From the resulted energy estimate, it is possible to establish the solvability of the linear problem. Then, by applying an iterative process based on the obtained results for the linear problem, we establish the existence, uniqueness and continuous dependence of the weak solution of the nonlinear problem.     

R（0，θ）分布族参数的矩估计与最大似然估计

本文讨论了均匀分布族｛Ｒ（０，θ），θ＞０｝中参数θ的矩估计及最大似然估计的效率及相合性，结果表明θ修正后的最大似然估计要优于θ的矩估计。     

Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups

In this paper, we show strong convergence theorems for nonexpansive mappings and nonexpansive semigroups in Hilbert spaces by the hybrid method in the mathematical programming.     

辛映射与Hamilton控制系统

给定等价辛流形 ,即辛同态或形变等价的辛流形 ,研究了建立在这些辛流形上的Hamilton控制系统之间的一些性质的联系 ,诸如 (局部 )能观测性 ,强可接近性 ,(拟 )极小性等 .而且 ,利用Cort啨ｓ介绍的 (弱 )外等价系统的概念 ,给出使得两个Hamilton控制系统是辛同态的一个充分条件