齐型空间上Calderon-Zygmund算子的有界性

利用Hardy空间的原子分解与分子分解,证明了齐型空间上Calderon-Zygmund算子在Hardy空间上的有界性。     

热传导方程的反问题

介绍了数理方程反问题的研究现状和主要方法,用Galerkin逼近法和拓扑度理论得出一类线性方程反应问题的存在性定理,用不动点原理得出一类非线性方程反问题的存在性,惟一性定理,并给出求解反问题的算法和收敛性证明。     

关于集值条件期望的收敛性

集值条件期望的收敛性问题,在集值鞅论中有重要地位,在研究支撑函数性质的基础上,证明了随机集列关于单调σ－域族条件期望 的强下极限,弱上极限的Fatou引理及K－M意义下的控制收敛定理。     

联系2个单形顶点角的几何恒等式及其应用

利用代数方法得到联系n维单形∑和∑‘顶点角的一个几何恒等式[det(A‘‘r)]^2=det(Ar).det(A‘r),应用这个几何恒等式导出了一些涉及单形∑和∑‘新的几何不等式。     

表面活性剂-火焰原子吸收法测定人发中的微量铁

研究了用表面活性剂十二烷基硫酸钠测定铁的火焰原子吸收法 ,摸索了测定条件 ,在 1 mol/ L盐酸介质中 ,选定合适的仪器工作条件 ,铁含量 0 .0 2～ 0 .2 mg/ L范围内符合比尔定律 ,检出限量铁浓度为 1 .8mg/ L.经实际样品分析 ,变异系数不大于 3.6% ,样品加标回收率为 98%～ 1 0 2 % .     

Integrated dynamic shared protection algorithm for GMPLS networks

The path protection approach is widely investigated as a survivability solution for GMPLS networks, which has the advantage of efficient capacity utilization. However, there is a problem of the path protection approach that searching a disjoint backup path for a primary path is often unsuccessful. In order to resolve this problem, an integrated dynamic shared protection （IDSP） algorithm is proposed. The main idea of the proposed algorithm is that the path protection approach is first used to establish a backup path for the primary path; if the establishment is unsuccessful, then the primary path is dynamically divided into segments whose hop count are not fixed but not more than the limitation calculated by the equations introduced. In this proposal, backup bandwidth sharing is allowed to improve the capacity utilization ratio, which makes the link cost function quite different from previous ones. Simulation experiments are presented to demonstrate the efficiency of the proposed method compared with previous methods. Numerical results show that IDSP can not only achieve low protection failure probability but can also gain a better tradeoff between the protection overbuild and the average recovery time.     

Design and simulation of a Torus topology for network on chip

Aiming at the applications of NOC （network on chip） technology in rising scale and complexity on chip systems, a Torus structure and corresponding route algorithm for NOC is proposed. This Torus structure improves traditional Torus topology and redefines the denotations of the routers. Through redefining the router denotations and changing the original router locations, the Torus structure for NOC application is reconstructed. On the basis of this structure, a dead-lock and live-lock free route algorithm is designed according to dimension increase. System C is used to implement this structure and the route algorithm is simulated. In the four different traffic patterns, average, hotspot 13%, hotspot 67% and transpose, the average delay and normalization throughput of this Torus structure are evaluated. Then, the performance of delay and throughput between this Torus and Mesh structure is compared. The results indicate that this Torus structure is more suitable for NOC applications.     

New HB-weighted time delay estimation algorithm under impulsive noise environment

The traditional HB-weighted time-delay estimation （TDE） method degenerates under the impulsive noise environment. Two new time-delay estimation methods are proposed based on fractional lower order statistics （FLOS） according to the impulsive characteristics of fractional lower order α-stable noises. Theoretic analysis and computer simulations indicate that the proposed covariation based HB weighted （COV-HB） algorithm can suppress impulsive noises in one received signal for 1 ≤α≤ 2, whereas the other proposed fractional lower order eovariancebased HB weighted （FLOC-HB） algorithm has robust performance under arbitrary impulsive noise conditions for the whole range of 0 〈α≤ 2.     

Application of rough graph in relationship mining

Based on the definition of class shortest path in weighted rough graph, class shortest path algorithm in weighted rough graph is presented, which extends classical shortest path algorithm. The application in relationship mining shows effectiveness of it.     

吴越文化概述

吴越文化是长江下游的区域文化 ,其中心文化区是太湖、钱塘江流域。七千年间 ,吴越文化的民族性发生过沧桑巨变 ,楚败越以前基本上是夷越文化 ,秦灭越后基本上是汉族文化。民族性格前后有别 ,不可混为一谈 ,《汉书 .地理志》的说法不可信从。上下七千年的广义吴越文化 ,仍有共同的个性特征 ,那就是 :柔、细、雅。从汉代到明清 ,吴越地区多出科技、文艺人才 ,缺乏军政雄才。《红楼梦》是吴越文化的样品