深度学习识别光网络单元故障的设计与应用

为解决依赖装维上门鉴别光网络单元故障带来的不便,可以从机器视觉入手实现自动化故障识别。近年,ImageNet挑战赛的成功推动了物体识别技术的跨越式发展,特别是基于卷积的深度学习技术在视觉识别方面已经达到人类水平,为光网络单元故障的自动识别提供了技术基础。文章对识别光网络单元的工作状态进行了研究,将设备工作状态分为7个场景,提出了利用手机APP采集图片识别故障的解决方案并投入了实际生产;重点阐述了深度学习模块的设计与实现,提出一种通过算法整合的方式综合运用物体检测和图像分类算法,分3阶段逐步求精,解决了图片过滤,光网络单元型号和状态识别等问题,实现了基于计算机视觉自动识别光网络单元故障。从数据上看产品的端到端准确率超过84%,识别速度达到10 FPS,月均提供服务超过1万人次,在减少用户等待的同时节约了人力资源。     

Research on Circular Area Search algorithm of multi-robot service based on SOA cloud platform

Considering autonomous mobile robots with a variety of specific functions as a kind of service, when there are many types and quantities of services and the density of regional services is large, proposing an algorithm of Circular Area Search (CAS) because of the problem of multi-robot service scheduling in various areas. Firstly, Django is used as the web framework to build the Service-Oriented Architecture (SOA) multi-robot service cloud platform, which is the basic platform for multi-service combination. Then, the service type, the latitude and longitude and the scoring parameters of the service are selected as the service search metrics to design the CAS algorithm that based on the existing service information registered in MySQL and the Gaode Map for screening optimal service, and then providing the service applicant with the best service. Finally, the service applicant applies for the self-driving tour service as an example to perform performance simulation test on the proposed CAS algorithm. The results show that the CAS algorithm of the multi-robot service cloud platform proposed in this paper is practical compared to the global search. And compared with the Greedy Algorithm experiment, the service search time is reduced about 58% compared with the Greedy Algorithm, which verifies the efficiency of CAS algorithm.     

Real-time organic aerosol chemical speciation in the indoor environment using extractive electrospray ionization mass spectrometry

Understanding the sources and composition of organic aerosol (OA) in indoor environments requires rapid measurements, since many emissions and processes have short timescales. However, real-time molecular-level OA measurements have not been reported indoors. Here, we present quantitative measurements, at a time resolution of five seconds, of molecular ions corresponding to diverse aerosol-phase species, by applying extractive electrospray ionization mass spectrometry (EESI-MS) to indoor air analysis for the first time, as part of the highly instrumented HOMEChem field study. We demonstrate how the complex spectra of EESI-MS are screened in order to extract chemical information and investigate the possibility of interference from gas-phase semivolatile species. During experiments that simulated the Thanksgiving US holiday meal preparation, EESI-MS quantified multiple species, including fatty acids, carbohydrates, siloxanes, and phthalates. Intercomparisons with Aerosol Mass Spectrometer (AMS) and Scanning Mobility Particle Sizer suggest that EESI-MS quantified a large fraction of OA. Comparisons with FIGAERO-CIMS shows similar signal levels and good correlation, with a range of 100 for the relative sensitivities. Comparisons with SV-TAG for phthalates and with SV-TAG and AMS for total siloxanes also show strong correlation. EESI-MS observations can be used with gas-phase measurements to identify co-emitted gas- and aerosol-phase species, and this is demonstrated using complementary gas-phase PTR-MS observations.     

Service composition for generic service graphs

Service composition is a promising approach to multimedia service provisioning, due to its ability to dynamically produce new multimedia content, and to customize the content for individual client devices. Previous research work has addressed various aspects of service composition such as composibility, QoS-awareness, and load balancing. However, most of the work has focused on applications where data flow from a single source is processed by intermediate services and then delivered to a single destination. In this paper, we address the service composition problem for multimedia services that can be modeled as directed acyclic graphs (DAGs). We formally define the problem and prove its NP hardness. We also design a heuristic algorithm to solve the problem. Our simulation results show that the algorithm is effective at finding low-cost composition solutions, and can trade off computation overhead for better results. When compared with a hop-by-hop approach for service composition, our algorithm can find composition solutions that aress 10% smaller in cost, even when the hop-by-hop approach uses exhaustive searches.     

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.     

NEAX61Σ程控交换机远端控制附加业务的方法

主要介绍了NEAX61Σ程控交换机远端控制附加业务的功能,以及实现该业务的方法、局数据的设定等。     

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

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

销售企业客户服务体系建设的几点建议

在阐述客户服务意义的基础上，提出对中国石化成品油销售企业客户服务体系建设的建议，即建立以客户为尊的服务理念；建设特色企业文化；完善员工服务体系；注重细节，提高服务质量；整合现有客户体系资源，拓展服务功能。     

Analysis of Distributed DDQ for QoS Router

In a packet switching network, congestion is unavoidable and affects the quality of real‐time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well‐known solutions for quality‐of‐service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.