检索结果-内蒙古大学图书馆

SSRN 2022年

作者： Li, Juanjuan Li, Junqing Wang, Xiao Qin, Rui Yuan, Yong Wang, Fei-Yue The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Qingdao Academy of Intelligent Industries Qingdao266109 China School of Mathematics Renmin University of China Beijing100872 China Macao Institute of Systems Engineering Macau University of Science and Technology Macau 999078 China

Aiming to deal with the challenge of data security and data pricing in data trading markets, we propose the novel multi-blockchain-based framework and design the related pricing mechanisms. Specifically, data recording and trading are conducted separately in the Data Blockchain (DChain) and the Value Blockchain (VChain). Based on these blockchains, two-layer data trading markets are established to manage the initial data trading in the primary market and the data resale in the secondary market. Pricing mechanisms are proposed to protect the formulated data trading markets against strategic trading behaviors and balance the payoffs of both suppliers and users. In the regular data trading on VChain-S2D, two auction models are used to deal with users' strategic bidding in terms of the demand scale, where the incentive-compatible Vickrey-Clarke-Groves (VCG) model is dedicated to the low-demand trading scenario, while the nearly incentive-compatible Monopolistic Price (MP) model is for the high-demand trading scenario. In the temporary data trading on VChain-D2S, a reverse auction mechanism named Two-Stage Obscure Selection (TSOS) is designed to regulate both suppliers' quoting and users' valuation strategies. Moreover, experiments are carried out to validate our theoretical analysis. Our work is expected to enhance the data security and improve the trading efficiency. © 2022, The Authors. All rights reserved.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

The paralleleye dataset: Constructing large-scale artificial scenes for traffic vision research

arXiv

引用

arXiv 2017年

作者： Li, Xuan Wang, Kunfeng Tian, Yonglin Yan, Lan Wang, Fei-Yue School of Automation Beijing Institute of Technology Beijing100081 China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China Qingdao Academy of Intelligent Industries Qingdao266000 China Department of Automation University of Science and Technology of China Hefei230027 China Research Center for Computational Experiments and Parallel Systems Technology National University of Defense Technology Changsha410073 China

Video image datasets are playing an essential role in design and evaluation of traffic vision algorithms. Nevertheless, a longstanding inconvenience concerning image datasets is that manually collecting and annotating large-scale diversified datasets from real scenes is time-consuming and prone to error. For that virtual datasets have begun to function as a proxy of real datasets. In this paper, we propose to construct large-scale artificial scenes for traffic vision research and generate a new virtual dataset called "ParallelEye". First of all, the street map data is used to build 3D scene model of Zhongguancun Area, Beijing. Then, the computer graphics, virtual reality, and rule modeling technologies are utilized to synthesize large-scale, realistic virtual urban traffic scenes, in which the fidelity and geography match the real world well. Furthermore, the Unity3D platform is used to render the artificial scenes and generate accurate ground-truth labels, e.g., semantic/instance segmentation, object bounding box, object tracking, optical flow, and depth. The environmental conditions in artificial scenes can be controlled completely. As a result, we present a viable implementation pipeline for constructing large-scale artificial scenes for traffic vision research. The experimental results demonstrate that this pipeline is able to generate photorealistic virtual datasets with low modeling time and high accuracy labeling. Copyright © 2017, The Authors. All rights reserved.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Public service management system of urban placenames for Sanya case

Public service management system of urban placenames for San...

引用

IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI

作者： Wei Liu Fenghua Zhu Xisong Dong Gang Xiong Yongqiang Zhu Huazhou Wu Taozhong Liu Yuexiang Hu The State Key Laboratory of Management and Control for Complex Systems Chinese Academy of Sciences Beijing China College of Information Science and Technology Beijing University of Chemical Technology Beijing China Beijing Engineering Research Center of Intelligent Systems and Technology Chinese Academy of Sciences Beijing China Instituteof Smart Education Systems Qingdao Academy of Intelligent Industries Qingdao China Dongguan Research Institute of CASIA Chinese Academy of Sciences Dongguan China Xiamen Kingtopinfo Technology Co. Ltd Xiamen China Joint Laboratory of Parallel Management & Control and Business Intelligence Hainan Zhongke Flower Ocean Cloud Commerce Technology Co. Ltd Haikou China

ISBN: (纸本)9781509029280

The rapidly growing amount of social interaction makes geographical names an important and indispensable medium for people in social and economic exchanges. Especially in today's information age, the frequency of usage of name information has increased greatly. In this paper, a method for the construction of a cities' names database is proposed. This will include the processing of the outcome data from the names pilot survey, the consolidation into the database, the development of the cloud service and management system based on the geographical names and zoning database, and the construction of a relatively complete set of the public service system of geographical names based on a website and touch screen interface. The method has been applied in SanYa, China successfully, and very good results have been obtained. The platform can provide not only accurate and convenient services of geographical names, but also promote its economic development and social progress.

关键词： Urban areas Standards Cloud computing Economics Spatial databases Geospatial analysis

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Federated control Strategy for Participant Selection in Multi-Client Collaboration

An Adaptive Federated Control Strategy for Participant Selec...

引用

Digital Twins and Parallel Intelligence (DTPI), IEEE International Conference on

作者： Yizhu Chen Xiaoming Du Xiao Wang Jun Jason Zhang Fei-Yue Wang State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China School of Economics and Management University of Chinese Academy of Sciences Beijing China Qingdao Academy of Intelligent Industries Qingdao China School of Electrical Engineering and Automation Wuhan University Wuhan China

The federated ecology provides a new paradigm for breaking the isolated data island problem and fully activating the potential of big data and artificial intelligence, especially in multi-client collaboration tasks. Participant selection strategy in multi-client collaboration is the main limitation for increasing the convergence speed and lowing the communication costs. However, in the face of the unbalanced and non-IID data distributions, the performance of federated optimization algorithms will also decrease. To solve the above problems, we propose an adaptive federated control strategy for participant selection in multi-client collaboration based on the Mann-Kendall test, named FedMK. By adaptively selecting weak participants for training rather than random selection, FedMK can speed up model convergence and reduce communication costs. Experiment results show that our method outperforms the baseline method in non-IID scenarios, and the number of communication rounds on CIFAR-10 and synthetic datasets reduced by more than 15% and 10 %,9 respectively.

关键词： Training Adaptation models Costs Biological system modeling Collaboration Optimization methods Ecology

来源：评论

学校读者我要写书评

暂无评论

Resonant beam communications with echo interference elimination

arXiv

引用

arXiv 2021年

作者： Xiong, Mingliang Liu, Qingwen Wang, Gang Giannakis, Georgios B. Zhang, Sihai Zhu, Jinkang Huang, Chuan College of Electronics and Information Engineering Tongji University Shanghai201804 China State Key Lab of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China Department of Electrical and Computer Engineering University of Minnesota MinneapolisMN55455 United States Key Lab of Wireless-Optical Communications University of Science and Technology of China Hefei Anhui230026 China School of Science and Engineering Chinese University of Hong Kong Shenzhen Guangdong518172 Hong Kong

Resonant beam communications (RBCom) is capable of providing wide bandwidth when using light as the carrier. Besides, the RBCom system possesses the characteristics of mobility, high signal-to-noise ratio (SNR), and multiplexing. Nevertheless, the channel of the RBCom system is distinct from other light communication technologies due to the echo interference issue. In this paper, we reveal the mechanism of the echo interference and propose the method to eliminate the interference. Moreover, we present an exemplary design based on frequency shifting and optical filtering, along with its mathematic model and performance analysis. The numerical evaluation shows that the channel capacity is greater than 15 bit/s/Hz. Copyright © 2021, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Double Deep Q-learning for Anti-saturation Attack Problem of Warship Group

Double Deep Q-learning for Anti-saturation Attack Problem of...

引用

Digital Twins and Parallel Intelligence (DTPI), IEEE International Conference on

作者： Wei Li Gang Xiong Hao Tao Yunjun Han Fang Wang Xisong Dong Zhen Shen State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences School of Artificial Intelligence University of Chinese Academy of Sciences Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences China China Ship Development and Design Center Wuhan China School of Control Science and Engineering (CSE) Shandong University Jinan China Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences Dongguan China

Anti-saturation attack (ASA) strategy is vital for the survival of a warship group, and attracts the focus of many researchers. In this paper, the dynamics of ASA is formulated as a Markov decision Process (MDP) with an enhanced states space since those characters are involved, such as the formation and detection and interception areas of warship group. A reinforcement learning method (Double Deep Q-leaning, DDQN) is developed to solve the problem and deal with the curse of dimensionality whereby the cost-to-go value is calculated by a marine engagement simulation system. A heuristic defense algorithm guided by field expert knowledge is designed for comparison. The experimental results show that the DDQN method performs better in anti-saturation attack scenarios.

关键词： Industries Heuristic algorithms Digital twin Conferences Knowledge based systems Reinforcement learning Markov processes

来源：评论

学校读者我要写书评

暂无评论

Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization

arXiv

引用

arXiv 2021年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Chai, Tianyou Johansson, Karl H. The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden The Digital Futures Stockholm10044 Sweden The Department of Control Science and Engineering College of Electronics and Information Engineering The Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore

This paper considers the distributed online convex optimization problem with time-varying constraints over a network of agents. This is a sequential decision making problem with two sequences of arbitrarily varying convex loss and constraint functions. At each round, each agent selects a decision from the decision set, and then only a portion of the loss function and a coordinate block of the constraint function at this round are privately revealed to this agent. The goal of the network is to minimize the network-wide loss accumulated over time. Two distributed online algorithms with full-information and bandit feedback are proposed. Both dynamic and static network regret bounds are analyzed for the proposed algorithms, and network cumulative constraint violation is used to measure constraint violation, which excludes the situation that strictly feasible constraints can compensate the effects of violated constraints. In particular, we show that the proposed algorithms achieve O(T max{κ,1-κ}) static network regret and O(T 1-κ/2) network cumulative constraint violation, where T is the time horizon and κ ∈ (0, 1) is a user-defined trade-off parameter. Moreover, if the loss functions are strongly convex, then the static network regret bound can be reduced to O(T κ). Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2021, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Deep Rank-Consistent Pyramid Model for Enhanced Crowd Counting

arXiv

引用

arXiv 2022年

作者： Gao, Jiaqi Huang, Zhizhong Lei, Yiming Shan, Hongming Wang, James Z. Wang, Fei-Yue Zhang, Junping The Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China The Institute of Science and Technology for Brain-inspired Intelligence MOE Frontiers Center for Brain Science Fudan University Shanghai200433 China The Shanghai Center for Brain Science and Brain-Inspired Technology Shanghai201210 China The College of Information Sciences and Technology The Pennsylvania State University University ParkPA16802 United States The State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China The Institute of Systems Engineering Macau University of Science and Technology China Qingdao Academy of Intelligent Industries Qingdao266109 China

Most conventional crowd counting methods utilize a fully-supervised learning framework to establish a mapping between scene images and crowd density maps. They usually rely on a large quantity of costly and time-intensive pixel-level annotations for training supervision. One way to mitigate the intensive labeling effort and improve counting accuracy is to leverage large amounts of unlabeled images. This is attributed to the inherent self-structural information and rank consistency within a single image, offering additional qualitative relation supervision during training. Contrary to earlier methods that utilized the rank relations at the original image level, we explore such rank-consistency relation within the latent feature spaces. This approach enables the incorporation of numerous pyramid partial orders, strengthening the model representation capability. A notable advantage is that it can also increase the utilization ratio of unlabeled samples. Specifically, we propose a Deep Rank-consistEnt pyrAmid Model (DREAM), which makes full use of rank consistency across coarse-to-fine pyramid features in latent spaces for enhanced crowd counting with massive unlabeled images. In addition, we have collected a new unlabeled crowd counting dataset, FUDAN-UCC, comprising 4,000 images for training purposes. Extensive experiments on four benchmark datasets, namely UCF-QNRF, ShanghaiTech PartA and PartB, and UCF-CC-50, show the effectiveness of our method compared with previous semi-supervised methods. The codes are available at https://***/bridgeqiqi/DREAM. Copyright © 2022, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Modeling and Random Search Optimization Method for the Polysilicon Cvd Reactor

SSRN

引用

SSRN 2022年

作者： Xi, Bangwen Xiong, Gang Shen, Zhen Tamir, Tariku Sinshaw He, Chang Song, Yonggang Liu, Xiong State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation Chinese Academy of Sciences Beijing100190 China Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences Dongguan523808 China Intelligent Manufacturing Center Qingdao Academy of Intelligent Industries Qingdao266109 China Xinte Energy Co. Ltd Urumqi830000 China

Polysilicon is mainly obtained by chemical vapor deposition(CVD) reaction, in which hydrogen gas and trichlorosilane(TCS) are fed into the CVD reactor to produce polysilicon. However, the feeding parameters are mainly adjusted in a step-by-step manner according to the actual deposition results, which is inefficient to optimize and prone to resource wastage. In this paper, based on the existing mechanistic model of the CVD reactor, we combine the history data with the specific parameters to construct a simulator. A random search algorithm is used to determine the optimal feeding parameters. With the simulator, the polysilicon productivity can be increased by 704 kg, and the power consumption reduced by 3.8 kWh/kg. © 2022, The Authors. All rights reserved.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

Multi-robot Path Planning and Trajectory Smoothing

Multi-robot Path Planning and Trajectory Smoothing

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Hub Ali Gang Xiong Huaiyu Wu Bin Hu Zhen Shen Hongxing Bai School of Mechanical and Electrical Engineering University of Electronic Science and Technology of China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences Dongguan China Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation Chinese Academy of Sciences China Hubei Jointown Technology Co. Ltd Artificial Intelligence Research Institute Wuhan China

ISBN: (数字)9781728169040

ISBN: (纸本)9781728169057

In this paper we consider a problem in task execution for multi-robot trajectory planning with collision avoidance in a shared working environment. Consider two or more robots generating trajectories towards their respective goal positions. The collision may occur if their trajectory coordinates are intersecting at a point or follow the same path segment simultaneously. The central planner is introduced to control robot motion in the collision state and to reduce the complexity of the multi-robot path planning system. The global path for every robot is generated by the $\mathrm{A}^{*}$ algorithm in a grid-based environment. The path has presented a sequence of optimal grid numbers and later transformed into Cartesian coordinates for smooth trajectory generation. The central planner takes an optimal grid sequence for every robot to analyze the collision state according to its cost value. It regenerates the trajectories to minimize the complexity cost value and replaces the previous trajectory based on minimum cost value. In the collision state, the central planner allows one robot at a time to pass along the conflict path segment and hold others in queue at a safety offset distance until the previous robot passes safely. The algorithm has been applied to robots working in a shared environment in complex maps and the simulations is performed with MATLAB to calculate the efficiency of this approach for handling collision states in a multi-robot path planning system.

关键词： Robot kinematics Trajectory Collision avoidance Task analysis Resource management

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：