指纹考勤管理软件的研究与实现

针对企、事业单位原有的考勤系统，如打卡钟、磁卡、IC卡等考勤方式存在代打卡、卡丢失等不足和缺陷的实际，结合指纹识别技术，建立一套考勤、薪资、人事管理于一体的软件系统。给出了系统的体系结构和功能实现，能使企业考勤管理更加简便快捷、客观公正。并提出了进一步的发展方向和展望。     

Handover and Uplink Power Control Performance in the 3.84 Mcps TDD mode of UTRA Network

In this article we consider the performance of the 3.84 Mcpstime-division duplex (TDD) mode of UTRA (Universal TerrestrialRadio Access) network. We emphasize two of the radio resourcemanagement algorithms, handover and uplink power control, whoserole in the overall system performance is studied extensively.First, a handover algorithm used in WCDMA (Wideband Code DivisionMultiple Access) standard is considered in a TDD-mode operation.This gives rise to a careful setting of different handoverparameters, and the evaluation of the effects to the systemperformance. Secondly, the specified uplink power controlalgorithm is considered. Since it is based on several user-mademeasurements which may involve both random and systematic errors acareful study about the suitability of the power control scheme iscarried out.     

针对不同地质目标的叠前时间偏移成像解释评价

随着计算机硬件和地震勘探成像技术的发展，叠前时间偏移正逐步替代常规的NMO加DMO加叠后时间偏移成为地震数据成像处理方法的主流。但对于不同的地质目标，叠前时间偏移的成像效果是否优于常规NMO加DMO加叠后时间偏移的成像效果呢？为此，从地震数据成像处理方法、处理流程和处理参数等方面进行了讨论，并基于某地区三维数据常规处理结果和叠前时间偏移处理结果，针对不同地质目标进行了剖析与评价。认为：叠前时间偏移成像的垂向分辨率较常规处理明显降低，但对于空间波阻抗变化明显的河流和断层，叠前时间偏移成像的空间分辨率要高于常规处理；对于小于1／4波长的叠置薄储层，叠前时间偏移成像的垂向和空间分辨率低于常规处理结果。     

深圳市大型商场空气品质的测试与分析

本文根据对位于深圳市不同片区的五家大型商场进行室内空气品质现场检测所得的数据,分析了这些商场的室内空气品质状况,各商场不同楼层、不同售货区的空气品质参数分布规律,以及周末、平日、不同时段室内空气品质参数的变化规律,并结合现场实际情况对其原因进行了分析。     

基于SONET/SDH的存储网络容灾技术分析

文章分析了存储网络（SAN）容灾技术，认为在某些企业中，数据是至关重要的资产之一，是业务系统运行的血脉．保护企业的重要数据是企业成功的关键因素。文章讨论了设计容灾技术解决方案应考虑的各种因素，并给出了基于SONET／SDH的存储网络技术的体系架构设计方案。     

Fast handoff with reducing waste rate approach for wireless resources management in UMTS mobile networks

3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments. Meanwhile, the optimal number of rake combiners is also analyzed in this paper. This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018.     

移动通信系统中功率控制研究

在阐述功率控制在移动通信系统中的发展过程的基础上，着重研究了WCDMA系统的功率控制，最后对功率控制未来的研究方向做了简要的分析。     

交流伺服系统在玻璃裂片机中的应用

随着运动控制技术的飞速发展，交流伺服系统应用的日益广泛。介绍了液晶生产中的关键设备玻璃裂片机，并详细分析松下MINAS A系列交流伺服系统在玻璃裂片机中的应用。     

循环伏安法在润滑油检测中的应用

介绍了循环伏安法的产生背景、原理。应用该技术可以快速、方便地对润滑油中抗氧剂、总酸（碱）值进行测定，并且可以对不同厂家润滑油的抗氧剂包进行区别。该技术还可以有效地评价润滑油的使用寿命和设备工作状况。     

Range Assignment for Biconnectivity and k-Edge Connectivity in Wireless Ad Hoc Networks

Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.