k元n维冒泡排序网络的子网排除

在并行计算机系统中,元器件和线路故障普遍存在,而系统的容错能力可以通过其底层基础网络的拓扑性质衡量。为了精确度量以k元n维冒泡排序网络为底层拓扑结构的并行计算机系统的容错能力,结合其层次结构和子网划分特征,分别提出了节点故障模型和线路故障模型下攻击该网络中所有k－m元n－m维冒泡排序子网络的算法,确定了需要攻击的最优节点集合和最优线路集合。根据算法可得:当2≤k≤n－2,m≤k－1时,攻击k元n维冒泡排序网络中所有的k－m元n－m维冒泡排序子网络,在节点故障模型下需要攻击至少C^m_nm!个节点,在边故障模型下需要攻击至少C^m_nm!条线路。     

DDOS(分布式拒绝服务)研究与探讨

由于目前网络安全问题的日趋严重, ＤＤＯＳ（ Ｄｉｓｔｒｉｂｕｔｅｄ Ｄｅｎｉａｌ ｏｆ Ｓｅｒｖｉｃｅ,分布式拒绝服务攻击）的攻击手段严重威胁 Ｉｎｔｅｒｎｅｔ的安全。文章详细地介绍了什么是 ＤＤＯＳ及其造成的危害,Ｗ理论上分析了其体系结构和运作情况,并实际列举了一些著名的ＤＤＯＳ 工具及其特点,尝试提出有关ＤＤＯＳ的攻击检测规则和相关的检测工具。     

一个基于组通信的设计过程管理系统的设计与实现

设计过程管理在协调由多人参与的大型设计项目中的作用是非常重要的。本文在对分布对象技术及组通信技术深入研究的基础上,设计实现了一个基于组通信服务的分布式集成框架,在该集成框架之上设计实现了一个设计过程管理系统ＤＰＭＳ。     

The historical workstation project

Since 1978 research in the development of software dedicated to the specific problems of historical research has been undertaken at the Max-Planck-Institute für Geschichte in Göttingen. From a background of practical experiences during these years, a concept of what an appropriate workstation for an historian would be has been derived. It stresses the necessity of three components: (a) software, derived from a detailed analysis of what differentiates information contained in historical sources from such present in current material, (b) databases which are as easily available as printed books and (c) knowledge bases which allow software and data bases to draw upon the information contained in historical reference works. A loose network of European research projects, dedicated to the realization of such a setup, is described.Manfred Thaller has a Ph.D. (1975) in Modern and Medieval History and held a post-doctoral fellowship in sociology at the Institute for Advanced Studies (Vienna). Since 1978 he has been at the Max-Planck-Institute for History, where he is a research fellow for Historical Information Science.     

一种快速的反向k近邻查找算法及其改进

提出一种快速的反向k近邻查找算法,该方法利用现代计算机具有外存便宜、运行速度快的特点,预先计算数据之间的距离,并组织为数据索引块存储于外存,由计算机在空闲时自动进行维护.在进行反向最近邻查询时,只需读入相应的索引块,就可进行直接查询,其时间复杂度为O(N),而且不受k的影响.为减少索引块的读取时间,提出一种改进方法来有效地压缩索引块,仅用必要的二进制位来存储对象之间的距离,并将冗余减少到最低水平,提高了算法的效率.最后通过实验分析评估算法的有效性和效率.     

On-Line Approximate String Searching Algorithms: Survey and Experimental Results

The problem of approximate string searching comprises two classes of problems: string searching with k mismatches and string searching with k differences. In this paper we present a short survey and experimental results for well known sequential approximate string searching algorithms. We consider algorithms based on different approaches including dynamic programming, deterministic finite automata, filtering, counting and bit parallelism. We compare these algorithms in terms of running time against pattern length and for several values of k for four different kinds of text: binary alphabet, alphabet of size 8, English alphabet and DNA alphabet. Finally, we compare the experimental results of the algorithms with their theoretical complexities.     

NUMERICAL SIMULATION OF PROPAGATION AND BREAKING PROCESSES OF A FOCUSED WAVES GROUP

A two-dimensional numerical wave flume is developed to study the focused waves group propagation and the consequent breaking processes. The numerical model is based on the Reynolds-Averaged Navier-Stokes (RANS) equations, with the standard k-ε turbulence model to simulate the turbulence effects. To track the complicated and broken free-surface, the Volume Of Fluid (VOF) method is employed. The numerical model combines the "Partial Cell Treatment (PCT)" method with the "Locally Relative Stationary (LRS)" concept to treat the moving wave paddle so that various waves can be generated directly in a fixed Cartesian grid system. The theoretical results of the linear and nonlinear waves are used to validate the numerical wave flume firstly, and then a plunging breaking wave created by a focused waves group is simulated. The numerical results are compared to the experimental data and other simulation results, with very good agreements. The turbulence intensity, the flow field and the energy dissipation in the breaking processes are analyzed based on the numerical results. It is shown that the present numerical model is efficient and accurate for studying the waves group generation, the waves packet propagation, and the wave breaking processes.     

武汉原状粉质黏土与其重塑土的试验对比研究（I）：试验结果描述

以武汉沙湖粉质黏土为研究对象,首先借助于高压固结仪,对重塑土和原状土进行了室内侧限的固结试验;其次利用改进的应力控制式常规三轴仪,在不同的加荷路径和排水条件下,对重塑土和原状土分别进行了常规三轴试验研究,并对试验资料进行了较为系统的分析．结果表明：1）原状土的侧压力系数约为0．56,超固结比约等于1．2,为弱超固结土体,其结构屈服压力稍大于其前期固结压力;2）原状土初始的切线模量及其抗剪强度均高于重塑土相应的值;3）在固结排水条件下的三轴剪切试验,原状土的剪胀量要小于重塑土的剪胀量,但在固结不排水条件下,原状土体的剪胀趋势却明显要高于重塑土的剪胀趋势．     

线性模型中回归系数的c-F(K)型估计的研究和应用

针对引起线性回归模型最小二乘估计性能变坏的根本原因,在线性回归模型中提出了一种新的有偏估计β^(F(K))=(cX'V-1X+TF(K)T')-1X'V-1Y,它将众多经典的有偏估计结合在一起,对有偏估计进行了改进.首先利用Stine式压缩技术说明在均方误差意义下β(F(K))=(cX'V-1X+TF(K)T')-1X'V-1Y,它将众多经典的有偏估计结合在一起,对有偏估计进行了改进.首先利用Stine式压缩技术说明在均方误差意义下β^(F(K))具有优于广义岭估计的优良性质,然后将β(F(K))具有优于广义岭估计的优良性质,然后将β^(F(K))应用到多元线性回归模型的可容许性上.     

政策法制与能源产业推动之探讨——以德国再生能源法为中心

全球传统石化能源耗竭及气候变迁等负面效应日益严重,以永续发展为目标,再生能源之开发利用备受关注,已成为世界各国能源政策的主要施政方针,其中多以立法手段积极推动.综观各国已提出亦或正在施行的政策和措施,皆由订定法令来体现,以法律的形式确立发展目标,再透过具体而明确的强制规范或经济激励措施,进而得其实质成效.德国再生能源法相关法规范即为明证.德国于2000年制定全球首部再生能源优先法(Gesetz fürden Vorrang Erneuerbarer Energien),简称再生能源法(Ernererbare-Energien-Gesetz,EEG),至今已历多次修法.本文将从德国再生能源法制探讨,观其核心固定电价制度(Feed-in Tariff,FIT)与近年修法方向,说明德国再生能源产业发展之背景及现况,希祈能就推动发展再生能源有所帮助.