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.     

一种基于FPGA的可变速率帧结构设计与实现

在简述V.35接口的基础上针对V.35接口速率可变的应用需求提出了一种速率可变的帧结构,该帧结构可支持N×64kb/s(3≤N≤32)速率,从而在V.35接口上实现了多种速率的低速业务传输.     

Computational and dynamic NMR investigation of 2,2-dimesityl-1,1,1,3,3,3-hexamethyltrisilane

The structure and rotational barrier for the mesityl-silicon bond of 2,2-dimesityl-1,1,1,3,3,3-hexamethyltrisilane have been investigated by ¹H- and ¹³C-variable temperature nuclear magnetic resonance (NMR) as well as by density functional theory structural calculations. The calculations show that the lowest energy structure has C₂ symmetry with nonequivalent ortho methyl groups, consistent with the crystal structure and solution NMR. The nonequivalent ortho methyl groups exchange through a C_s transition state with a calculated relative free energy of 11.0 kcal mol⁻¹. The barrier for this rotation found by dynamic NMR is 13.4 ± 0.2 kcal mol⁻¹ at 298 K.     

Dynamic Interactions in Synthetic Receptors: A Guest Exchange Saturation Transfer Study

The accumulated knowledge regarding molecular architectures is based on established, reliable, and accessible analytical tools that provide robust structural and functional information on assemblies. However, both the dynamicity and low population of noncovalently interacting moieties within studied molecular systems limit the efficiency and accuracy of traditional methods. Herein, the use of a saturation transfer-based NMR approach to study the dynamic binding characteristics of an anion to a series of synthetic receptors derived from bambusuril macrocycles is demonstrated. The exchange rates of BF₄⁻ are mediated by the side chains on the receptor (100 s⁻¹<k_ex<5000 s⁻¹), which play a critical role in receptor-anion binding dynamics. The signal amplification obtained with this approach allows for the identification of different types of intermolecular interactions between the receptor and the anion, something that could not have been detected by techniques hitherto used to study molecular assemblies. These findings, which are supported by a computational molecular dynamic study, demonstrate the uniqueness and added value of this NMR method.     

无源光网络标准发展及关键技术研究

无源光网络(Passive Optical Network,PON)作为当今接入网的主要技术解决方案,具有带宽使用效率高、传输距离远、抗干扰能力强等特点.通过研究PON技术的发展动态,本文首先归纳了各种PON技术的产生背景和应用特点,整理出各技术间的连接关系及主要标准;其次介绍了PON技术的帧结构,并对带宽、波长、传输模式等PON技术的主要参数进行了汇总;然后将国内外研究热点进行划分,围绕媒体访问控制协议、帧结构、动态带宽分配算法、节能机制等关键技术,阐述了其研究现状及在PON中的重要作用;最后对PON技术的发展趋势进行了展望.     

Twining Poly(polyoxometalate) Chains into Nanoropes

Organic polymers and inorganic clusters belong to two different disciplines and have completely different properties and structures. When a cluster is attached to the backbone of a polymer as a pendant, the resultant hybrid polymers (polyclusters) exhibit unique behaviours totally different from those of conventional polymers owing to the nanoscale size of the cluster and its particular interactions. Herein, the aggregation of a poly(polyoxometalate)—a polynorbornene backbone with inorganic polyoxometalate cluster pendants—upon addition of a non-solvent to its dilute solution is reported. A three-dimensional network of tangled and snake-like nanothreads was observed. Direct visualisation of individual nanoscale clusters enabled identification of single chains within the nanothreads. These observations suggest that during the process of aggregation, the hybrid polymer forms curved or extended chains as a consequence of an armouring effect in which the collapsed cluster pendants wrap around the backbone. The collapse occurs because they become less soluble in the solvent/non-solvent mixture. The extended chains then become entwined and form nanoropes consisting of multiple chains wound around each other. This study provides a deeper understanding of the nature of polyclusters and should also prove useful for their future development and application.     

Decay rate for viscoelastic wave equation of variable coefficients with delay and dynamic boundary conditions

In this paper, we consider a viscoelastic wave equation of variable coefficients in the presence of past history with nonlinear damping and delay in the internal feedback and dynamic boundary conditions. Under suitable assumptions, we establish an explicit and general decay rate result without imposing restrictive assumption on the behavior of the relaxation function at infinity by Riemannian geometry method and Lyapunov functional method.     

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.     

Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.