图的一种加权邻接矩阵谱半径和能量的界

图G的一种加权邻接矩阵记为A_db(G)=(a^db_ij)_n×n,若顶点v_i和顶点v_j相邻,则$a_{i j}^{d b}=\frac{d_{i}+d_{j}}{d_{i} d_{j}}$, 反之a^db_ij=0.给出图G的加权谱半径的上下界,并在此基础上给出加权谱半径的Nordhaus-Gaddum-type关系.得到了图G的加权能量的几个上下界,并在此基础上给出加权能量的Nordhaus-Gaddum-type关系.     

可逆半环上的同余

本文讨论可逆半环上的同余,指出可逆半环上存在使其商半环对加法和乘法均成群的最小同余。     

高分子力学中的Valanis－Landel假说

根据经验公式的建立原则和橡胶的各向同性性能,讨论了Ｖａｌａｎｉｓ－Ｌａｎｄｅｌ假说中关于“任何一种应变类型的应力一应变关系,可从单一的纯剪试验推导出来”这一重要结论,并证明了结论的正确性,还研究了结论的应用。     

Massively time-parallel,approximate simulation of loss queueing systems

A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFSG/G/1/K queues. The GG1K algorithm requires two phases. In the first phase, a similar system (i.e. aG/G/1/ queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximateG/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except whenK is very small (e.g. 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large.     

Normal subgroups of

We classify the normal subgroups of of index less than 960; they are all congruence subgroups.

     

ORACLE SQL* FORMS主从块设计

介绍在ＯＲＡＣＬＥＳＱＬ＊ＦＯＲＭＳ中快捷且灵活地建立主从关系的一种方法．     

Syndrome series of one point algebraic-geometric codes and majority voting scheme

A type of recurring relations on syndrome series is presnted. After some important theorems are established, an algorithm for computing a minimal polynomial set is presented. Finally an algorithm for determining the unknown syndromes with incorporating α majority scheme is presented.     

模糊灰关联模式识别方法及其应用

首先建立了灰关联分析的新的理论模型,然后将其与模糊集理论结合起来,提出了一种模糊灰关联模式识别方法．通过应用于场地土类别的评定,从而说明了本文方法的有效性     

我的几点意见——评论“关于狭义相对论的本质”一文

评论了“关于狭义相对论的本质”一文,实际上仍使用了狭义相对论的两个基本假设。