基于双因子认证技术的网络身份识别

本文提出了一种基于动态双因子认证技术的网络身份识别方法,用户每次登录的口令是利用系统时间和用户ID通过MD5加密算法计算得到,其通过MD5加密后生成的登录口令是随机的,这将进一步提高开放网络环境下身份识别的可靠性和安全性。同时,本文还提出网络身份识别技术可以应用到各类网站的服务器上,用来完成对用户身份的识别,以提高网络系统的安全性。     

基于MFQ的补丁优先算法的研究与实现

目前采用的视频流调度算法，没有充分利用补丁流满足服务率高而占用系统资源少的优势，系统效率较低．为了提高效率，提出了一种基于MFQ的补丁优先算法，并给出了该算法的系统流程。通过对实验结果的比较，该算法在用户请求撤销率、节目调度不公平性和用户等待时间方面有明显的优越性．     

Wavefront reduction using graphs,neural networks and genetic algorithm

This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd.     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

计算机远程控制系统的设计与实现

介绍了一个计算机远程控制系统的设计与实现，该系统采用客户机／服务器模式，实现远程屏幕的实时传输，采用LZW压缩算法对图像进行压缩传输，在接受方进行解码并且实现了远程文件创建和删除、显示被控制端的主机信息、发送实时消息等功能。采用鼠标，键盘的模拟方式对计算机进行实时控制。     

水力压裂净压力拟合分析解释技术研究与应用

基于三维裂缝延伸模拟模型的水力压裂净压力拟合分析解释技术,提出了净压力拟合分析解释的一般步骤及理论方法,研究了现场监测净压力的计算方法,并介绍了其在现场施工中的应用情况。该技术可以帮助认识地层参数和压裂参数,提高压裂施工成功率和有效率。     

天然气管网输配气量优化研究

天然气管网系统管理部门为了明确天然气管网的输气能力和提高天然气管网的利用率，需要对天然气管网系统的输配气量进行优化。为此，以天然气管网系统的最大流量为目标函数，同时考虑了管道强度、节点压力和流量限制等约束条件，建立了天然气管网输配气量优化的数学模型。在研究遗传算法和模拟退火算法的基础上，提出了一种由二者结合构成的具有全域搜索、快速收敛和鲁棒性强等特点的混合遗传算法。结合实例，采用这一新算法求解了天然气管网输配气量优化的数学模型。实例优化结果表明，所建立的数学模型和采用的混合遗传算法是可行和有效的，能够对天然气管网系统输配气量的调度运行起到指导作用。     

Note on ‘Construction of Double Sampling s‐Control Charts for Agile Manufacturing’

He and Grigoryan (Quality and Reliability Engineering International 2002; 18 :343–355) formulated the design of a double‐sampling (DS) s control chart as an optimization problem and solved it with a genetic algorithm. They concluded that the DS s control charts can be a more economically preferable alternative in detecting small shifts than traditional s control charts. We explain that, since they only considered the average sample size when the process is in control, their conclusion is questionable. Copyright © 2006 John Wiley & Sons, Ltd.     

A parallel and scalable algorithm for ADI method with pre-propagation and message vectorization

It is hard to implement the ADI method in an efficient way on distributed-memory parallel computers. We propose “P-scheme” which parallelizes a tridiagonal linear system of equations for the ADI method, but its effectiveness is limited to the cases where the problem size is large enough mainly because of the communication cost of the propagation phase of the scheme.

In order to overcome this difficulty, we propose an improved version of the P-scheme with “message vectorization” which aggregates several communication messages into one and alleviates the communication cost. Also we evaluate the effectiveness of message vectorization for the ADI method and show that the improved version of the P-scheme works well even for smaller problems and linear and super-linear speedups can be achieved for 8194 × 8194 and 16,386 × 16,386 problems, respectively.     

Estimation for the number of components in a mixture model using stepwise split-and-merge EM algorithm

The main difficulty with EM algorithm for mixture model concerns the number of components, say g. This is the question of model selection, and the EM algorithm itself could not estimate g. On the contrary, the algorithm requires g to be specified before the remaining parameters can be estimated. To solve this problem, a new algorithm, which is called stepwise split-and-merge EM (SSMEM) algorithm, is proposed. The SSMEM algorithm alternately splits and merges components, estimating g and other parameters of components simultaneously. Also, two novel criteria are introduced to efficiently select the components for split or merge. Experimental results on simulated and real data demonstrate the effectivity of the proposed algorithm.