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

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

作者： Yansong Cao Yutong Wang Juwu Dai Xihao Zhu Fei-Yue Wang Macau Institute of Systems Engineering Macau University of Science and Technology Macau China The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Ningbo Sanbody Intelligent Technology co. LTD Ningbo China Faculty of Science and Engineering University of Nottingham Ningbo China

Along with economic globalization, the shoes and clothing market is undergoing huge changes and is facing increasing individualized demands. To realize personalized customization, we propose a social manufacturing pattern for the shoes and clothing industry. On the customer side, we collect costumer information with the help of 3D scanning and virtual fitting. On the production side, we replace human labor with intelligent production equipment. On the enterprise management side, we construct a cloud platform to realize source maximization. Through this social manufacturing pattern, we expect to accelerate the intelligent reform of the shoes and clothing industry.

关键词： Product customization Cloud computing Three-dimensional displays Social networking (online) Production equipment Footwear Clothing industry

来源：评论

学校读者我要写书评

暂无评论

Learning Network-Invariant and label-Discriminative Representations for Cross-Network Node Classification

Learning Network-Invariant and Label-Discriminative Represen...

引用

Chinese automation Congress (CAC)

作者： Linyao Yang Yancai Xu Jiachen Hou Yuxin Dai Chen Lv The State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China Qingdao Academy of Intelligent Industries Qingdao China Institute of Systems Engineering Macau University of Science and Technology Macau China School of Electrical Engineering and Automation Wuhan University Wuhan China China Electric Power Research Institute Beijing China

ISBN: (纸本)9781665426480

Networks are ubiquitous data structures in the real world. The accurate and efficient analysis of networks is critical to realizing many intelligent network-based services. However, most existing network analysis methods are developed for single networks and require a lot of labeled data, which is costly and time-consuming to acquire. Transfer learning has been widely accepted as an effective paradigm for tackling this problem by reusing the model trained on a supervised task. However, transfer learning on the non-euclidean network data has been investigated by no more than a few studies. To realize accurate node classification based on the knowledge learned from the labeled source network, this paper proposes to learn network-invariant and label-discriminative representations based on graph embedding and linear discriminant analysis. Specifically, we embed the source and target networks into adjacent vector spaces based on the graph attention network by minimizing the Sinkhorn distributional distances between their embeddings. To obtain label-discriminative features for learning better classification models, we then utilize a transferable linear discriminative analysis method to project the embeddings into label-discriminative subspaces. In the end, a support vector machine model trained on the labeled source network is utilized to classify the target nodes. Experiments on two pairs of networks illustrate that our method achieves the best performance and evaluates the effectiveness of the proposed modules.

关键词： Support vector machines Knowledge engineering Analytical models automation Transfer learning Network analyzers Data structures

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

arXiv

引用

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems 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 Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Parallel Governance for Decentralized Autonomous Organizations enabled by Blockchain and Smart Contracts

Parallel Governance for Decentralized Autonomous Organizatio...

引用

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

作者： Wen Wen Ding XiaoLong Liang JiaChen Hou Ge Wang Yong Yuan Junqing Li Fei-Yue Wang Institute of Systems Engineering Macau University of Science and Technology Macau China School of Mathematics Renmin University of China Beijing China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China

Decentralized autonomous organizations(DAOs) enabled by blockchain and smart contracts is regarded as an effective tool to solve corporate governance problems. It can minimize the contract risks, principal-agent dilemmas, and other issues in corporate governance. However, DAOs also face a variety of governance issues, such as internal governance issues and external governance issues caused by the technical attributes of blockchain and smart contracts. DAO is a typical complex system with the characteristics of both social and engineering complexity. It is difficult for existing governance theories to solve governance problems in DAOs. The parallel intelligence theory based on the artificial systems + computational experiments + parallel execution (ACP) method is a suitable research and practical approach to solve management and control problems for complex systems. Therefore, we propose a parallel governance framework for DAO based on the parallel intelligence theory and discuss its key research issues. Finally, we construct a parallel governance system for GnosisDAO, and conduct computational experiments on its voting mechanism. The results show the defects of GnosisDAO governance mechanism and we thus propose further research directions. We consider that parallel governance represents the future trend of DAO research and practice. This paper is aimed at stimulating further effort and providing helpful guidance and reference for future research works.

关键词： Computational modeling Digital twin Conferences Smart contracts Tools systems modeling Market research

来源：评论

学校读者我要写书评

暂无评论

Micro-displacement Amplifying Mechanism of a Piezoelectric Single Crystal Actuator and Its Motion Characterization

Micro-displacement Amplifying Mechanism of a Piezoelectric S...

引用

IEEE International Conference on Mechatronics and automation

作者： Tianlu Zhang Zhangming Du Chao Zhou Zhiqiang Cao Shuo Wang Long Cheng State Key Laboratory of Management and Control for Complex System Institute of Automation Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China State Key Laboratory of Management and Control for Complex System Institute of Automation Chinese Academy of Sciences Beijing China

ISBN: (数字)9781728164168

ISBN: (纸本)9781728164175

Piezoelectric single crystal actuator is useful in the micro- and nano-scaled. But the range of the operation is limited. The paper presented the amplifying mechanism of the single crystal actuator in order to amplify the output of the piezoelectric actuator in micro- and nano-applications. Due to the single crystal's expansion when the applied signals decrease, the paper developed the adjustable spring that added to the amplifying mechanism. This paper tested the characteristics of the amplifying mechanism by designed a set of experiment device. The input and output displacement of the amplifying mechanism driven by kinds of signals were measured. It can concluded that the amplifying mechanism achieve the positive and negative displacement response and show its accuracy and stable. These excellent properties of the amplifying mechanism amplify the micro-displacement and expand the operating range of single crystal actuator in micro- and nano-positioning applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A KG-based Enhancement Framework for Fact Checking Using Category Information

A KG-based Enhancement Framework for Fact Checking Using Cat...

引用

IEEE International Conference on Intelligence and Security Informatics, ISI

作者： Shuai Wang Lei Wang Wenji Mao State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences School of Artificial Intelligence University of Chinese Academy of Sciences

ISBN: (数字)9781728188003

ISBN: (纸本)9781728188010

The massive spread of false information has brought about severe security-related problems to individuals and society. To debunk misinformation automatically, fact checking has become an important task that aims at retrieving evidence from external sources to verify the truthfulness of a given claim. As knowledge graph (KG) is a classic external source for retrieving relevant evidence. Previous methods typically check a claim by making inferences over it. Entity category information can be utilized to strengthen both the learning and verification process. However, this information was largely ignored in previous research. To make better use of the category information, in this paper, we propose a category-based framework for improving the performance of fact checking with KGs. We first learn prototypes for each category as their representatives, and then propose a prototype-based learning technique for effectively modeling the entity dependency in KG. We further develop a prototype matching technique to explore the category-level relations between head and tail entities for more robust verification. Experimental results on two benchmark datasets and a real-world dataset show that our framework can significantly improve the reasoning abilities of KG reasoning methods on Fact Checking task.

关键词： Conferences Prototypes Benchmark testing Cognition Security Task analysis Informatics

来源：评论

学校读者我要写书评

暂无评论

Compressed Gradient Tracking Algorithms for Distributed Nonconvex Optimization

arXiv

引用

arXiv 2023年

作者： Xu, Lei Yi, Xinlei Wen, Guanghui Shi, Yang Johansson, Karl H. Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Systems Science School of Mathematics Southeast University Nanjing210096 China The Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden

In this paper, we study the distributed nonconvex optimization problem, aiming to minimize the average value of the local nonconvex cost functions using local information exchange. To reduce the communication overhead, we introduce three general classes of compressors, i.e., compressors with bounded relative compression error, compressors with globally bounded absolute compression error, and compressors with locally bounded absolute compression error. By integrating them, respectively, with the distributed gradient tracking algorithm, we then propose three corresponding compressed distributed nonconvex optimization algorithms. Motivated by the state-of-the-art BEER algorithm proposed in [1], which is an efficient compressed algorithm integrating gradient tracking with biased and contractive compressors, our first proposed algorithm extends this algorithm to accommodate both biased and non-contractive compressors. For each algorithm, we design a novel Lyapunov function to demonstrate its sublinear convergence to a stationary point if the local cost functions are smooth. Furthermore, when the global cost function satisfies the Polyak–Lojasiewicz (P–L) condition, we show that our proposed algorithms linearly converge to a global optimal point. It is worth noting that, for compressors with bounded relative compression error and globally bounded absolute compression error, our proposed algorithms’ parameters do not require prior knowledge of the P–L constant. The theoretical results are illustrated by numerical examples, demonstrating the effectiveness of the proposed algorithms in significantly reducing the communication burden while maintaining the convergence performance. Moreover, simulation results show that the proposed algorithms outperform the state-of-the-art compressed distributed nonconvex optimization algorithms. Copyright © 2023, The Authors. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Parallel Planning:A New Motion Planning Framework for Autonomous Driving

引用

IEEE/CAA Journal of Automatica Sinica 2019年第1期6卷 236-246页

作者： Long Chen Xuemin Hu Wei Tian Hong Wang Dongpu Cao Fei-Yue Wang IEEE School of Data and Computer Science Sun Yat-sen University the School of Computer Science and Information Engineering Hubei University Institute of Measurement and Control Systems Karlsruhe Institute of Technology Department of Mechanical and Mechatronics Engineering University of Waterloo the State Key Laboratory of Management and Control for Complex Systems.Institute of Automation Chinese Academy of Sciences the Research Center for Military Computational Experiments and Parallel Systems Technology National University of Defense Technology

Motion planning is one of the most significant technologies for autonomous driving. To make motion planning models able to learn from the environment and to deal with emergency situations, a new motion planning framework called as"parallel planning" is proposed in this paper. In order to generate sufficient and various training samples, artificial traffic scenes are firstly constructed based on the knowledge from the reality.A deep planning model which combines a convolutional neural network(CNN) with the Long Short-Term Memory module(LSTM) is developed to make planning decisions in an end-toend mode. This model can learn from both real and artificial traffic scenes and imitate the driving style of human ***, a parallel deep reinforcement learning approach is also presented to improve the robustness of planning model and reduce the error rate. To handle emergency situations, a hybrid generative model including a variational auto-encoder(VAE) and a generative adversarial network(GAN) is utilized to learn from virtual emergencies generated in artificial traffic scenes. While an autonomous vehicle is moving, the hybrid generative model generates multiple video clips in parallel, which correspond to different potential emergency scenarios. Simultaneously, the deep planning model makes planning decisions for both virtual and current real scenes. The final planning decision is determined by analysis of real observations. Leveraging the parallel planning approach, the planner is able to make rational decisions without heavy calculation burden when an emergency occurs.

关键词： Autonomous driving artificial traffic scene deep learning emergencies motion planning parallel planning

来源：评论

学校读者我要写书评

暂无评论

AI Graphical Programming Learning Platform for Children

AI Graphical Programming Learning Platform for Children

引用

Chinese automation Congress (CAC)

作者： Hongxia Zhao Xiwei Liu Xiaoyan Gong Qiang Li Sifeng Jing Yaofeng Xue The Stale Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing China Institute of Smart Education Systems Qingdao Academy of Intelligent Industries Qingdao China University of Chinese Academy of Sciences Beijing China East China Normal University Shanghai China

ISBN: (纸本)9781665426480

In this era of rapid development of artificial intelligence, the truth of competition in the future is the talent. Countries all over the world attach great importance to the programming and artificial intelligence education of children. In the future, the theoretical development and practical application of this emerging field will usher in a period of rapid development. This paper presents an artificial intelligence graphical programming learning platform based on Jetson Nano, which combines artificial intelligence education with modular software programming, provides students with a more open, intelligent, and interesting programming environment through the cross-platform development mode of "cloud service + intelligent hardware", and adopts visual programming to reduce the difficulty of artificial intelligence programming. The platform can fully tap learning resources, reduce education costs, and make artificial intelligence education more intuitive and humanized.

关键词： Visualization Costs automation Education Learning (artificial intelligence) Games Software

来源：评论

学校读者我要写书评

暂无评论

Deep Behavioral Cloning for Traffic control with Virtual Expert Demonstration Under a Parallel Learning Framework ⁎

引用

IFAC-PapersOnLine 2020年第5期53卷 176-181页

作者： Xiaoshuang Li Fenghua Zhu Fei-Yue Wang State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing 100080 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing 100049 China

Intelligent traffic signal control is necessary for improving traffic efficiency. These fast changing and challenging traffic scenarios and demands are generally handled by professional traffic engineers. However, it may take years of time and thousands of practices to train such an engineer. This paper proposes a deep behavioral cloning method to learn how to control the traffic signal effectively and efficiently from virtual expert demonstration. The method imitates promising working behavior of optimized offline solutions, and applies it to solve online traffic signal control problems of the similar scenario. Different traffic demand patterns are generated through a combination of different kinds of components. Then the virtual demonstration is constructed by getting an exclusive and optimized solution for each generated virtual traffic demand pattern through a heuristic random search method. After that, a deep neural network-based behavioral cloning method is employed to learn from the virtual demonstration and finish on-line traffic signal control task. The experimental results show that compared with other methods, the proposed method significantly reduces the waiting time and time loss in different situations. And the average traffic speed of the road network at different saturation levels can be improved by 1.58% to 11.54%.

关键词： intelligent transportation system behavioral cloning virtual demonstration parallel learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：