YOLSO: You Only Look Small Object

Small object detection is challenging and far from satisfactory. Most general object detectors suffer from two critical issues with small objects: (1) Feature extractor based on classification network cannot express the characteristics of small objects reasonably due to insufficient appearance information of targets and a large amount of background interference around them. (2) The detector requires a much higher location accuracy for small objects than for general objects. This paper proposes an effective and efficient small object detector YOLSO to address the above problems. For feature representation, we analyze the drawbacks in previous backbones and present a Half-Space Shortcut(HSSC) module to build a background-aware backbone. Furthermore, a coarse-to-fine Feature Pyramid Enhancement(FPE) module is introduced for layer-wise aggregation at a granular level to enhance the semantic discriminability. For loss function, we propose an exponential L1 loss to promote the convergence of regression, and a focal IOU loss to focus on prime samples with high classification confidence and high IOU. Both of them significantly improves the location accuracy of small objects. The proposed YOLSO sets state-of-the-art results on two typical small object datasets, MOCOD and VeDAI, at a speed of over 200 FPS. In the meantime, it also outperforms the baseline YOLOv3 by a wide margin on the common COCO dataset.     

基于声源定位的高校在线巡课系统设计与研究

随着网络建设以及信息化教学方法在高校教学过程中的应用普及,越来越多的高校使用在线巡课系统对教师的教学过程进行跟踪和管理,以便发现课堂教学中的亮点、问题和不足。文章提出的在线巡课系统,基于声源定位的技术,对传统的在线巡课系统做出了改进,解决了已有巡课系统中“只闻其声,不见其人”的问题,能够更直观地跟踪到教师的教学过程,包括教学行为以及师生互动过程,有效提升教务人员巡课效果和体验感受。     

北斗三星无源定位技术

介绍了北斗双星定位系统的特点、功能、系统组成和工作原理,说明了北斗有源定位方式在应用方面的局限性。针对北斗有源定位方式不能无线电静默,和人们对具有无线电隐蔽性的卫星定位的需求,详细介绍一种北斗三星无源定位技术:包括工作原理、实现方法、定位精度分析和目前达到的定位精度。阐述了北斗三星无源定位技术的优点和应用形势。     

Effective Location Based Services with Dynamic Data Management in Mobile Environments

With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.     

测向定位技术准确度及误差校正

测向定位技术是无线电管理的一个重要课题。测向定位过程中的误差的种类和产生的原因很多。选择适当的方法对误差进行校正，可以有效的减小测向误差带来的损失，提高无线电管理的效率。     

一种基于GIS的选址问题及算法

本文考虑了选址区域内存在地理阻断情况下的一种基于GIS的选址问题.对单配送中心选址模型,以GIS返回的任意两点间的最短可行路径的长度作为修正距离函数,分析了目标函数在凸形选址区域上非凸非连续的性质.进一步,采用给出了一种近似搜索算法并通过一个实例计算与重心法进行了比较.     

基于CDMA智能网平台的增值业务--"位置服务"

本主要介绍基于CDMA智能网平台的一种增值业务——“位置服务”，阐述这个业务的网络结构、涉及到的技术问题和解决方案，并将这个整体思路投入到开发业务中去。     

一种新的加权最小二乘测距定位方法

三站二维定位问题是最小定位问题，一般只利用几何关系就能获得定位估计，但由于未利用距离测量的统计信息，定位精度较差。该文先将点到点的距离测量转化为点到线的距离估计，再在此基础上推导出一种新的加权几休定位方法，其中加权的确定利用了距离测量的统计信息。仿真实验表明，在测距误差较小时新方法具有更高的定位精度。     

基于CCD图像的火灾空间定位方法

大空间中火源的空间位置的定位,一直是火灾自动探测与自动扑救中的难点。研究了一种利用单一CCD摄像头进行火灾自动空间定位的方法。根据计算机视觉原理,利用固定在自动消防水炮末端的CCD摄像头随水炮旋转扫描时的角度、位移变化,将CCD摄像头在不同位置所拍摄的图像中火源图像坐标和火源的空间坐标建立联系,从而实现了火源空间位置的自动定位。     

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

A hybrid heuristic method for combinatorial optimization problems is proposed that combines different classical techniques such as tree search procedures, bounding schemes and local search. The proposed method enhances the classic beam search approach by applying to each partial solution corresponding to a node selected by the beam, a further test that checks whether the current partial solution is dominated by another partial solution at the same level of the search tree. If this is the case, the latter solution becomes the new current partial solution. This step allows to partially recover from previous wrong decisions of the beam search procedure and can be seen as a local search step on the partial solution. We present here the application to two well known combinatorial optimization problems: the two-machine total completion time flow shop scheduling problem and the uncapacitated p-median location problem. In both cases the method strongly improves the performances with respect to the basic beam search approach and is competitive with the state of the art heuristics.