第三代短波自动链路建立系统特性分析及仿真实现

分析了第三代短波自动链路建立系统的工作特性及技术特点，并对系统仿真实现的原则及一些细节问题进行了较深入的探讨，同时对仿真实现中涉及的链路质量分析（LQA）算法进行了研究。     

An EM‐based adaptive multiple target tracking filter

Tracking targets of interest is one of the major research areas in radar surveillance systems. We formulate the problem as incomplete data estimation and apply EM to the MAP estimate. The resulting filter has a recursive structure analogous to the Kalman filter. The advantage is that the measurement‐update deals with multiple measurements in parallel and the parameter‐update estimates the system parameters on the fly. Experiments tracking separate targets in parallel show that tracking maintenance ratio of the proposed system is better than that of NNF and RMS position error is smaller than that of PDAF. Also, the system parameters are correctly obtained even from incorrect initial values. Copyright © 2001 John Wiley & Sons, Ltd.     

EVOLUTIONARY ALGORITHMS WITH PREFERENCE FOR MANUFACTURING CELLS FORMATION

Due to the combinatorial nature of cell formation problem and the characteristics of multi-objective and multi-constrain, a novel method of evolutionary algorithm with preference is proposed. The analytic hierarchy process （AHP） is adopted to determine scientifically the weights of the sub-objective functions. The satisfaction of constraints is considered as a new objective, the ratio of the population which doesn＇t satisfy all constraints is assigned as the weight of new objective. In addition, the self-adaptation of weights is applied in order to converge more easily towards the feasible domain. Therefore, both features multi-criteria and constrains are dealt with simultaneously. Finally, an example is selected from the literature to evaluate the performance of the proposed approach. The results validate the effectiveness of the proposed method in designing the manufacturing cells.     

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

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

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

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

The GENIUS-test-facility—first results on background from Rn daughters

GENIUS-TF (Nucl. Instr. and Meth. A 511 (2003) 341; Nucl. Instr. and Meth. A 481 (2002) 149.) is a test-facility for the GENIUS project (GENIUS-Proposal, 20 November 1997; Z. Phys. A 359 (1997) 351; CERN Courier, November 1997, 16; J. Phys. G 24 (1998) 483; Z. Phys. A 359 (1997) 361; in: H.V. Klapdor-Kleingrothaus, H. Pas. (Eds.), First International Conference on Particle Physics Beyond the Standard Model, Castle Ringberg, Germany, 8–14 June 1997, IOP Bristol (1998) 485 and in Int. J. Mod. Phys. A 13 (1998) 3953; in: H.V. Klapdor-Kleingrothaus, I.V. Krivosheina (Eds.), Proceedings of the Second International Conference on Particle Physics Beyond the Standard Model BEYOND’ 99, Castle Ringberg, Germany 6–12 June 1999, IOP Bristol (2000) 915), a proposed large scale underground observatory for rare events which is based on operation of naked germanium detectors in liquid nitrogen for an extreme background reduction. Operation of naked Ge crystals in liquid nitrogen has been applied routinely already for more than 20 years by the CANBERRA Company for technical functions tests (CANBERRA Company, private communication, 5 March 2004.), but it never had found entrance into basic research. Only in 1997 first tests of application of this method for nuclear spectroscopy have been performed, successfully, in Heidelberg (Klapdor-Kleingrothaus et al., 1997, 1998; J. Hellmig and H.V. Klapdor-Kleingrothaus, 1997).

On May 5, 2003 the first four naked high-purity germanium detectors (total mass 10.52 kg) were installed in liquid nitrogen in the GENIUS Test Facility at the Gran Sasso underground laboratory. Since then the experiment has been running continuously, testing for the first time the novel technique in an underground laboratory and for a long-lasting period.

In this work, we present the first analysis of the GENIUS-TF background after the completion of the external shielding, which took place in December 2003. We focus especially on the background coming from ²²²Rn daughters. This is found to be at present by a factor of 200 higher than expected from simulation. It is still compatible with the scientific goal of GENIUS-TF, namely to search for cold dark matter by the modulation signal, but on the present level would cause serious problems for a full GENIUS—like experiment using liquid nitrogen.     

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.     

Sphere packing with a geometric based compression algorithm

An efficient algorithm for the random packing of spheres can significantly save the cost of the preparation of an initial configuration often required in discrete element simulations. It is not trivial to generate such random packing at a large scale, particularly when spheres of various sizes and geometric domains of different shapes are present. Motivated by the idea of compression complemented by an efficient physical process to increase packing density, shaking, a new approach, termed compression algorithm, is proposed in this work to randomly fill any arbitrary polyhedral or cylindrical domains with spheres of various sizes. The algorithm features both simplicity and high efficiency. Tests show that it takes 181 s on a 1.4-GHz PC to complete the filling of a cylindrical domain with a total number of 26,787 spheres, achieving a packing density of 52.89%.     

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压缩算法对图像进行压缩传输，在接受方进行解码并且实现了远程文件创建和删除、显示被控制端的主机信息、发送实时消息等功能。采用鼠标，键盘的模拟方式对计算机进行实时控制。