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

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

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.     

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

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

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.     

以一种新的距离度量作为反馈的相关跟踪方法

基于相关的模板匹配方法在图像跟踪中得到了广泛的应用,但是这种方法的主要缺点是对图像噪声非常敏感,而且由这种方法得出的相关曲面比较平坦。为了有效抑制噪声和局部遮挡对图像的影响,提出用鲁棒统计中的一个值代替相关值作为距离度量。它不是计算两幅图像的对应像素差值,而是计算两幅图像中差别不大的对应像素对的个数。实验证明这样得到的曲面相对　　收稿日期:2003 08 31;　修订日期:2003 10 28作者简介:张桂林(1944 ),男,天津人,教授,博士生导师,主要研究方向为自动识别、人体生物统计特征识别、图像处理算法与系统性能评估等。　　　　　　　要尖锐得多。当上述的距离度量应用于跟踪过程中时,模板的合理更新对跟踪非常重要。基于上述的距离度量方法,提出了一种新的模板更新策略。利用两幅图像中近似像素在整修匹配模板像素中所占的比例大小决定加权系数。这种加权策略可以自适应地根据图像序列的变化选择更新相关模板,同时在一定程度上减小模板漂移的危险。     

Measurement and Identification of the Parameters of SPICE-Models of a Bipolar Transistor

A method of measuring and identifying the static parameters of a bipolar transistor is considered. The characteristic of the transistor, from which the parameters of the model are determined, is chosen depending on what group the calculated parameters belong to. The characteristics are measured in such a way that the equations of the model describing them can be reduced to the simplest form.     

连续波雷达测距中的解模糊技术

研究连续波雷达测距中的距离模糊问题，分析几种常用解模糊方法的性能，并讨论参差比的选取对测距范围的影响。     

电力系统谐波检测的现状与发展

准确、实时地对电力系统谐波进行检测有着重要的意义。本文根据电力系统谐波测量的基本方法，对近年来电力系统谐波检测的新方法进行了分析和评述。最后对电力系统的谐波测量进行了总结并提出了看法。     

地杂波O．94μm激光后向反射率测试研究

通过对地杂波O．94μm激光后向反射率的测试，获取不同入射角的多背景后向反射率测试数据。通过对测试数据的分析处理提供特征信息，为激光探浏器设计提供依据。     

工业管道测厚的几点问题探讨

超声波测厚在腐蚀监测上应用越来越广泛,为让这项检测技术更准确、更可靠,充分发挥功效,文章就工业管道测厚中测厚数据处理、测厚点选择、高温问题以及其它影响因素等几个方面进行了探讨。