基于分布式的远程网络信息管理系统的一种内网数据安全保护方法

网络信息系统的一大特点是数据共享,但数据共享必然带来系统中数据安全问题.对数据安全的威胁不仅来自于网络外部,同样也来自于网络内部.本文就一个实际系统讨论了基于分布式的远程网络信息管理系统的一种内网数据安全保护方法,建立了一个安全模型,并对安全模型的各个部分进行了描述.使用这种方法可以较好地从网络内部保护网络数据.     

基于深度强化学习的无人机自组网路由算法

针对无人机自组网节点密度大、拓扑变换频繁,导致移动自组网复杂的问题,提出了一种基于深度强化学习(deep-reinforcement learning, DRL)的分布式无人机自组网路由算法。利用DRL感知学习无人机特征,使节点不断与环境交互、探索学习最优行动(路由)策略;通过存储经验知识,维护端到端路由,赋予无人机网络智能化重构和快速修复的能力,从而提高路径的稳定性,降低路由建立和维护开销,增强网络的鲁棒性能。仿真结果表明,提出的算法具有较好的收敛性能;在路由修复时间、端到端时延,以及网络适应性、扩展性方面都优于传统的路由算法。     

基于神经网络的钞票真假识别研究

利用神经网络与光电检测的技术研制了钞票真假识别系统.介绍了系统的结构组成、工作原理、软件系统、神经网络的优化设计、实验及测试结果.经实践验证,其识别结果稳定可靠,可应用于金融智能防伪点钞机与ATM机中.     

分布式公路交通量数据服务中心的设计与实现

所探讨的分布式交通量数据服务中心由3个数据库和4个独立子系统组成.分析了数据服务中心的需求特点、总体功能和系统构成,介绍了数据库表的结构和子系统的功能,描述了基于.NET的多线程、异步Socket及其资源释放、Web服务及Excel报表制作等实现技术.实际运行表明,该分布式系统有较好的稳定性与健壮性,满足了公路管理部门的需求.     

Neural network representations of quantum many-body states

Machine learning is currently the most active interdisciplinary field having numerous applications;additionally,machine-learning techniques are used to research quantum many-body problems.In this study,we first propose neural network quantum states(NNQSs)with general input observables and explore a few related properties,such as the tensor product and local unitary operation.Second,we determine the necessary and sufficient conditions for the representability of a general graph state using normalized NNQS.Finally,to quantify the approximation degree of a given pure state,we define the best approximation degree using normalized NNQSs.Furthermore,we observe that some 7V-qubit states can be represented by a normalized NNQS,such as separable pure states,Bell states and GHZ states.     

Visual Recognition of Traffic Signs in Natural Scenes Based on Improved RetinaNet

Aiming at recognizing small proportion, blurred and complex traffic sign in natural scenes, a traffic sign detection method based on RetinaNet-NeXt is proposed. First, to ensure the quality of dataset, the data were cleaned and enhanced to denoise. Secondly, a novel backbone network ResNeXt was employed to improve the detection accuracy and effection of RetinaNet. Finally, transfer learning and group normalization were adopted to accelerate our network training. Experimental results show that the precision, recall and mAP of our method, compared with the original RetinaNet, are improved by 9.08%, 9.09% and 7.32%, respectively. Our method can be effectively applied to traffic sign detection.     

一种网络式码流监测仪的设计方案研究

介绍了一种网络式码流监测仪的设计技术和方案,整个系统由码流监测仪、服务器和客户机等部分组成,相互之间通过WAN/LAN连接,采用SNMP工业标准协议;通过这种开放式的监测平台,可以在网络环境下多机连接进行多点监测,实现高速码流实时采集和捕获,并且进行数据触发、过滤。     

Domain-Specific On-Device Object Detection Method

Object detection is a significant activity in computer vision, and various approaches have been proposed to detect varied objects using deep neural networks (DNNs). However, because DNNs are computation-intensive, it is difficult to apply them to resource-constrained devices. Here, we propose an on-device object detection method using domain-specific models. In the proposed method, we define object of interest (OOI) groups that contain objects with a high frequency of appearance in specific domains. Compared with the existing DNN model, the layers of the domain-specific models are shallower and narrower, reducing the number of trainable parameters; thus, speeding up the object detection. To ensure a lightweight network design, we combine various network structures to obtain the best-performing lightweight detection model. The experimental results reveal that the size of the proposed lightweight model is 21.7 MB, which is 91.35% and 36.98% smaller than those of YOLOv3-SPP and Tiny-YOLO, respectively. The f-measure achieved on the MS COCO 2017 dataset were 18.3%, 11.9% and 20.3% higher than those of YOLOv3-SPP, Tiny-YOLO and YOLO-Nano, respectively. The results demonstrated that the lightweight model achieved higher efficiency and better performance on non-GPU devices, such as mobile devices and embedded boards, than conventional models.     

Structural Entropy of the Stochastic Block Models

With the rapid expansion of graphs and networks and the growing magnitude of data from all areas of science, effective treatment and compression schemes of context-dependent data is extremely desirable. A particularly interesting direction is to compress the data while keeping the “structural information” only and ignoring the concrete labelings. Under this direction, Choi and Szpankowski introduced the structures (unlabeled graphs) which allowed them to compute the structural entropy of the Erdős–Rényi random graph model. Moreover, they also provided an asymptotically optimal compression algorithm that (asymptotically) achieves this entropy limit and runs in expectation in linear time. In this paper, we consider the stochastic block models with an arbitrary number of parts. Indeed, we define a partitioned structural entropy for stochastic block models, which generalizes the structural entropy for unlabeled graphs and encodes the partition information as well. We then compute the partitioned structural entropy of the stochastic block models, and provide a compression scheme that asymptotically achieves this entropy limit.     

Quantum Switchboard with Coupled-Cavity Array

The ability to control the flow of quantum information is deterministically useful for scaling up quantum computation. In this paper, we demonstrate a controllable quantum switchboard which directs the teleportation protocol to one of two targets, fully dependent on the sender’s choice. Importantly, the quantum switchboard also acts as a optimal quantum cloning machine, which allows the receivers to recover the unknown quantum state with a maximal fidelity of 56. This protects the system from the complete loss of quantum information in the event that the teleportation protocol fails. We also provide an experimentally feasible physical implementation of the proposal using a coupled-cavity array. The proposed switchboard can be utilized for the efficient routing of quantum information in a large quantum network.