田赛距离测量中全站仪的设计与实现

本文提出了将智能全站仪这种精密测量仪器广泛应用于田赛项目测量中，并结合其他科技元素用于解决田赛项目中跳远、投掷等项目的测量及数据管理问题，实现实时、自动、准确地裁定和报告比赛成绩。     

靶面激光光斑尺寸原位测量的研究

提供了一种简便易行的靶面激光光斑尺寸原位测量的方法。从高斯光束的横向光强分布特性出发,建立了激光烧蚀斑半径与辐照激光能量、光斑尺寸、烧蚀阈值间的关系式,模拟分析发现辐照激光光斑尺寸对烧蚀斑半径随辐照能量变化曲线有较大影响。对于脉宽为2 ms,波长为1064 nm的激光,实验测量了不同能量激光辐照下相纸烧蚀斑半径,并用推导出的关系式拟合测量数据,获得了靶面处光斑尺寸和样品烧蚀阈值。同时,也测量了不同位置处的光斑尺寸和样品烧蚀阈值,对高斯光束束腰位置和样品烧蚀阈值的光斑尺寸效应进行了验证。研究结果表明该技术结果可靠,简单高效。该技术可以为高能激光与固体物质相互作用的基础研究和激光加工等应用领域中实现简单方便地测量靶面光斑尺寸提供帮助。     

Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.     

基于三相幅度测量的相控阵天线快速校准方法

提出了一种基于三相幅度测量的相控阵天线快速校准方法。该方法将天线阵列进行分组,利用每种分组在三种配相下的阵面合成场幅度测量值,可解算出各个天线单元的初始幅相值。该方法仅需幅度测量,避免了相位测量误差影响单元幅相值的计算精度,而且所需幅度测量次数仅为(2N+1)次,可显著提高校准时效性。另外,利用分组思想,同时改变多个单元相位,使总辐射场的幅度变化显著,提升校准准确性。仿真结果表明:校准后相位均方根误差为2.2°,幅度均方根误差为0.2 dB。     

关于信息化测绘时代工程测量发展的思考

如今我国信息化技术全面发展，尤其对于工程测量工作领域来讲，不管是在工程建设和管理方面都产生不小的支撑引导效用。由此，笔者具体结合如今工程建设信息化测绘核心任何以及设备布置细节，进行结构整体安全管理周期和周边地理空间信息技术发展能效整理解析，试图将工程测量最新发展机遇和技术挑战问题处理完全。希望能够借此为日后一定时期范围内相关工程测量规划主体提供合理指导性建议内容，最终为我国各类工程事业可持续发展前景绽放奠定深刻适应基础。     

一种大尺度二维直线度精密测量的新方法

本文提出了一种远距离、大范围二维直线度测量的新方法．该方法采用特殊设计的十字线准直激光器及线阵CCD，通过特殊的光学系统结构设计，能在0-20m距离内连续测量，直线度范围可达70mm，精度优于0．1mm，实际测量结果表明，该方法可适应野外作业环境。     

电子天平示值误差测量结果的不确定度评定

一切测量结果都不可避免地具有不确定度，结合实际应用的情况，详细介绍了电子天平示值误差测量结果的不确定度评定方法。     

基于mobile agent的分布式网络自管理模型

为了解决大规模、异构网络环境下基于“管理员密集”的传统网络管理模式带来的低效率和高出错率问题，提出了一种网络自管理模型，从网络管理的自动初始化和动态自管理两个方面实现对网络自动、自主、自适应的管理；提出了管理定位服务这一关键技术，在多个管理站协同工作的分布式网络环境中为设备自动定位出合适的管理站及初始的管理任务；采用可伸缩的分布式体系结构，适应了大规模网络的规模可变性等特点；基于mobile agent的管理框架进一步提高了管理的自适应性和灵活性。     

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.