SRS: Spatial-tagged radio-mapping system combining LiDAR and mobile-phone data for indoor location-based services

One of the most challenging issues in radio received signal strength (RSS)-based localization systems is the generation and distribution of a radio map with a coordinate system linked with spatial information in a large indoor space. This study proposes a novel spatial-tagged radio-mapping system (SRS) that effectively combines the heterogeneous properties of LiDAR and mobile phones to simultaneously perform both spatial and radio mappings. The SRS consists of synchronization, localization, and map building processes, and enables real-time spatial and radio mapping. In the synchronization process, the distance range, motion data, and radio signals obtained through the LiDAR and mobile phone are collected in nodal units according to the sensing time. In the localization process, a feature variance filter is used to control the number of features generated from LiDAR and estimate the positions at which the nodes are generated in real time according to the motion data and radio signals. In map building, the estimated positions of the nodes are used to extract spatial and radio maps by using a unified location coordinate system. To ensure mobility, the SRS is manufactured in the form of a backpack supporting LiDAR and a mobile phone; the usefulness of the system is experimentally verified. The experiments are performed in a large indoor shopping mall with a complex structure. The experimental results demonstrated that a common coordinate system could be used to build spatial and radio maps with high accuracy and efficiency in real time. In addition, the field applicability of the SRS to location-based services is experimentally verified by applying the constructed radio map to well-known fingerprinting algorithms using the heterogeneous mobile phones.     

5G核心网业务模型的智能化预测研究

摘 要：核心网业务模型的建立是5G网络容量规划和网络建设的基础，通过现有方法得到的理论业务模型是静态不可变的且与实际网络存在偏离。为了克服现有5G核心网业务模型与现网模型适配性较差以及规划设备无法满足用户实际业务需求的问题，提出了一种长短期记忆（long short-term memory，LSTM）网络与卷积LSTM （convolution LSTM，ConvLSTM）网络双通道融合的 5G 核心网业务模型预测方法。该方法基于人工智能（artificial intelligence，AI）技术以实现高质量的核心网业务模型的智能预测，形成数据反馈闭环，实现网络自优化调整，助力网络智能化建设。     

面向老龄化社会的产品服务系统设计赋能

目的 针对面向老龄化社会的产品及产品服务系统设计,将赋能的设计理念和价值引入其中,探索设计结果提升老年人能动性和参与性的赋能品质,为设计师开展设计赋能实践提供参考.方法 以设计教学中的学生设计方案作为研究材料,邀请设计研究者参与工作坊,对设计结果的赋能属性进行分析,并通过聚类获得类别化的设计属性,产生了能描述赋能品质的属性词汇表.结果 总结了包含5组形容词组的设计赋能品质集,这一集合包含"顺应性"和"激励性"两个面向.结论 研究结果为设计师进行老龄化设计提供了知识参考,有助于提升设计师的赋能意识.揭示了设计赋能充满矛盾性的品质,提出面向老龄化的设计赋能需要在"顺应"和"激励"之间找到平衡.     

一次性使用医用手套标准解读

一次性医用手套是能够防止人们交叉感染的常用防护用品。随着新冠肺炎疫情在全球范围的迅速蔓延,疫情防控一线以及广大普通民众对一次性医用手套的需求与日俱增,其标准也受到广泛关注。本文对中国国家标准涉及一次性使用医用手套的4项产品标准进行了解读,并分析它们与国外同种产品标准间的对应关系以及重点指标的差异。     

A self‐scalable load injection service

Load testing of applications is an important and costly activity for software provider companies. Classical solutions are very difficult to set up statically, and their cost is prohibitive in terms of both human and hardware resources. Virtualized cloud computing platforms provide new opportunities for stressing an application's scalability, by providing a large range of flexible and less expensive (pay‐per‐use model) computation units. On the basis of these advantages, load testing solutions could be provided on demand in the cloud. This paper describes a Benchmark‐as‐a‐Service solution that automatically scales the load injection platform and facilitates its setup according to load profiles. Our approach is based on: (i) virtualization of the benchmarking platform to create self‐scaling injectors; (ii) online calibration to characterize the injector's capacity and impact on the benched application; and (iii) a provisioning solution to appropriately scale the load injection platform ahead of time. We also report experiments on a benchmark illustrating the benefits of this system in terms of cost and resource reductions. Copyright © 2013 John Wiley & Sons, Ltd.     

Intelligent Information‐Centric Networking routing scheme under imprecise information

Information‐Centric Networking (ICN) has been accepted to overcome some weaknesses of the current Internet architecture, showing that “what is being exchanged” is more important than “who are exchanging information.” Given the inadequate considerations on Quality of Service (QoS) and energy saving in ICN routing, we propose in this paper a routing algorithm to enhance the two aspects. At first, on one hand, Cauchy distribution is used as a fuzzy model to evaluate users' QoS requirements, such as bandwidth, delay, and error rate; on the other hand, we formulate energy saving problem to evaluate the green quality of routing algorithm. Then, we design a link selection approach by considering QoS and energy saving, which belongs to a multi‐objective decision problem resolved by intelligent drops algorithm. Finally, we implement the proposed algorithm and compare it with the famous adaptive forwarding mechanism in terms of some significant metrics, and the experimental results reveal that the proposed algorithm is more efficient.     

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

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

Sparse non-convex Lp regularization for cone-beam X-ray luminescence computed tomography

Cone-beam X-ray luminescence computed tomography (CB-XLCT) is an attractive hybrid imaging modality, and it has the potential of monitoring the metabolic processes of nanophosphors-based drugs in vivo. However, the XLCT imaging suffers from a severe ill-posed problem. In this work, a sparse nonconvex L_p (0?p?L₁ regularization. Further, an iteratively reweighted split augmented lagrangian shrinkage algorithm (IRW_SALSA-L_p) was proposed to efficiently solve the non-convex L_p (0?p?p-values (1/16, 1/8, 1/4, 3/8, 1/2, 5/8, 3/4, 7/8) in both 3D digital mouse experiments and in vivo experiments. The results demonstrate that the proposed non-convex methods outperform L₂ and L₁ regularization in accurately recovering sparse targets in CB-XLCT. And among all the non-convex p-values, our L_p(1/4?p?相似文献   

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.     

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.