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

arXiv 2020年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Anil, Carie Cao, Dongpu College of Computer Science and Technology Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Engineering VIT-AP AmaravatiAndhra Pradesh522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

—In the era of the Internet of Things (IoT), vehicles and other intelligent components in Intelligent Transportation System (ITS) are connected, forming the Vehicular Networks (VNs) that provide efficient and secure traffic, ubiquitous access to information, and various applications. However, as the number of connected nodes keeps increasing, it is challenging to satisfy various and large amounts of service requests with different Quality of Service (QoS) and security requirements in the highly dynamic VNs. Intelligent nodes in VNs can compete or cooperate for limited network resources so that either an individual or a group objectives can be achieved. Game theory, a theoretical framework designed for strategic interactions among rational decision-makers who faced with scarce resources, can be used to model and analyze individual or group behaviors of communication entities in VNs. This paper primarily surveys the recent advantages of GT used in solving various challenges in VNs. As VNs and GT have been extensively investigate34d, this survey starts with a brief introduction of the basic concept and classification of GT used in VNs. Then, a comprehensive review of applications of GT in VNs is presented, which primarily covers the aspects of QoS and security. Moreover, with the development of fifth-generation (5G) wireless communication, recent contributions of GT to diverse emerging technologies of 5G integrated into VNs are surveyed in this paper. Finally, several key research challenges and possible solutions for applying GT in VNs are outlined. Copyright © 2020, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Recruitment-imitation mechanism for evolutionary reinforcement learning

arXiv

引用

arXiv 2019年

作者： Lü, Shuai Han, Shuai Zhou, Wenbo Zhang, Junwei Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Reinforcement learning, evolutionary algorithms and imitation learning are three principal methods to deal with continuous control tasks. Reinforcement learning is sample efficient, yet sensitive to hyper-parameters setting and needs efficient exploration;Evolutionary algorithms are stable, but with low sample efficiency;Imitation learning is both sample efficient and stable, however it requires the guidance of expert data. In this paper, we propose Recruitment-imitation Mechanism (RIM) for evolutionary reinforcement learning, a scalable framework that combines advantages of the three methods mentioned above. The core of this framework is a dual-actors and single critic reinforcement learning agent. This agent can recruit high-fitness actors from the population of evolutionary algorithms, which instructs itself to learn from experience replay buffer. At the same time, low-fitness actors in the evolutionary population can imitate behavior patterns of the reinforcement learning agent and improve their adaptability. Reinforcement and imitation learners in this framework can be replaced with any off-policy actor-critic reinforcement learner or data-driven imitation learner. We evaluate RIM on a series of benchmarks for continuous control tasks in Mujoco. The experimental results show that RIM outperforms prior evolutionary or reinforcement learning methods. The performance of RIM's components is significantly better than components of previous evolutionary reinforcement learning algorithm, and the recruitment using soft update enables reinforcement learning agent to learn faster than that using hard update. Copyright © 2019, The Authors. All rights reserved.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Black-box expectation propagation for Bayesian models

Black-box expectation propagation for Bayesian models

引用

2018 SIAM International Conference on Data Mining, SDM 2018

作者： Li, Ximing Li, Changchun Chi, Jinjin Ouyang, Jihong Wang, Wenting College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University China College of Mathematics Jilin University China

In this paper, we develop a generic black-box expectation propagation (BBEP) algorithm that can be directly applied to Bayesian models without model-specific derivations. BBEP is built on the spirit of using Monte Carlo estimates, where the moment matching step in EP is replaced with Monte Carlo approximations. To avoid high variance, we employ importance sampling for variance reduction and analyze how to find an optimal proposal distribution. We compare BBEP against the state-of-the-art black-box algorithms on both synthetic and real-world data sets. The experimental results indicate that BBEP can reach better predictive performance than baseline algorithms, and even can be on a par with analytical solutions in some settings. © 2018 by SIAM.

关键词： Importance sampling

来源：评论

学校读者我要写书评

暂无评论

A Registration Method for Augmented Reality System Based on Visual SLAM

A Registration Method for Augmented Reality System Based on ...

引用

International Conference on Electronic engineering and Informatics (EEI)

作者： Zuoming Zhang Man Shu Zixuan Wang Hanwen Wang Xin Wang College of Software Engineering Jilin University Changchun China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781728140773

In augmented reality, smart devices need to sense their own position in real physical space and complex scene structure to achieve good virtual reality interaction and three-dimensional registration. This paper proposes a technical framework of visual SLAM, which uses VO and BA methods based on feature points to obtain pose, and applies it to the augmented reality system to realize pose estimation, registration, tracking, collision and other effects of intelligent equipment independent of artificial or natural landmarks.

关键词： augmented reality image registration pose estimation robot vision SLAM (robots) augmented reality pose estimation robot vision image registration supersonic low altitude missile Registration

来源：评论

学校读者我要写书评

暂无评论

SNB-PPB: Social-network-based-privacy-preserving Broadcast for Vehicular Communications 4

SNB-PPB: Social-network-based-privacy-preserving Broadcast f...

引用

4th International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS 2018

作者： Liu, Yanheng Zhu, Haifeng Wang, Jian College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

ISBN: (纸本)9789897582936

Internet key Exchange (IKE) can be used in vehicular communications in vehicular ad hoc networks (VANETs), but it requires a stable communication procedure, which is usually difficult to achieve because of the highly dynamic context of a VANET. In this paper, we propose a new method named social-network-based-privacy-preserving broadcast (SNB-PPB) for secure vehicular communications, which can omit the key exchange procedure. It transfers the information of online social networks to offline vehicular communications, dividing messages into different privacy levels and vehicles into different trust levels based on trust relations on social networks. The sender uses attributes on social networks and the message’s privacy level to encrypt messages;only those receivers who satisfy the corresponding trust level can decrypt the broadcast *** the best of our knowledge, this is the first time that social networks have been applied in VANETs to achieve secure vehicular communications and privacy preservation. Our simulation results show that our method enables the sender to decide the amount and percentage of vehicles that can decrypt the received broadcast. Copyright © 2018 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Incorporating Surprisingly Popular Algorithm and Euclidean Distance-based Adaptive Topology into PSO

arXiv

引用

arXiv 2021年

作者： Wu, Xuan Han, Jizong Wang, Di Gao, Pengyue Cui, Quanlong Chen, Liang Liang, Yanchun Huang, Han Lee, Heow Pueh Miao, Chunyan Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore State Key Laboratory of Superhard Materials International Center for Computational Method and Software College of Physics Jilin University Changchun130012 China Commercial Quality and Efficiency Department Baidu Inc Beijing100085 China Department of Computer Science Shantou University Shantou515063 China School of Computer Science Zhuhai College of Science and Technology Zhuhai519041 China School of Software Engineering The South China University of Technology Guangzhou510641 China Department of Mechanical Engineering National University of Singapore 117575 Singapore School of Computer Science and Engineering Nanyang Technological University 639798 Singapore College of Software Jilin University Changchun130012 China

While many Particle Swarm Optimization (PSO) algorithms only use fitness to assess the performance of particles, in this work, we adopt Surprisingly Popular Algorithm (SPA) as a complementary metric in addition to fitness. Consequently, particles that are not widely known also have the opportunity to be selected as the learning exemplars. In addition, we propose a Euclidean distance-based adaptive topology to cooperate with SPA, where each particle only connects to k number of particles with the shortest Euclidean distance during each iteration. We also introduce the adaptive topology into heterogeneous populations to better solve large-scale problems. Specifically, the exploration sub-population better preserves the diversity of the population while the exploitation sub-population achieves fast convergence. Therefore, large-scale problems can be solved in a collaborative manner to elevate the overall performance. To evaluate the performance of our method, we conduct extensive experiments on various optimization problems, including three benchmark suites and two real-world optimization problems. The results demonstrate that our Euclidean distance-based adaptive topology outperforms the other widely adopted topologies and further suggest that our method performs significantly better than state-of-the-art PSO variants on small, medium, and large-scale problems. Copyright © 2021, The Authors. All rights reserved.

关键词： Small-world networks

来源：评论

学校读者我要写书评

暂无评论

Model-based diagnosis of incomplete discrete-event system with rough set theory

引用

Science China(Information Sciences) 2017年第1期60卷 190-200页

作者： Xuena GENG Dantong OUYANG Yonggang ZHANG Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of EducationJilin University College of Computer Science and Technology Jilin University

Fault diagnosis of discrete-event system(DES) is important in the preventing of harmful events in the system. In an ideal situation, the system to be diagnosed is assumed to be complete; however, this assumption is rather restrictive. In this paper, a novel approach, which uses rough set theory as a knowledge extraction tool to deal with diagnosis problems of an incomplete model, is investigated. DESs are presented as information tables and decision tables. Based on the incomplete model and observations, an algorithm called Optimizing Incomplete Model is proposed in this paper in order to obtain the repaired model. Furthermore, a necessary and sufficient condition for a system to be diagnosable is given. In ensuring the diagnosability of a system, we also propose an algorithm to minimize the observable events and reduce the cost of sensor selection.

关键词： model-based diagnosis diagnosability discrete-event system finite state machine rough set theory

来源：评论

学校读者我要写书评

暂无评论

Copy-Paste Detection Based on a SIFT Marked Graph Feature Vector

引用

Chinese Journal of Electronics 2017年第2期26卷 345-350页

作者： LYU Yingda SHEN Xuanjing CHEN Haipeng College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University

To detect copy-paste tampering,an improved SIFT(Scale invariant feature transform)-based algorithm was *** angle is defined and a maximum angle-based marked graph is *** marked graph feature vector is provided to each SIFT key point via discrete polar coordinate *** points are matched to detect the copy-paste tampering *** experimental results show that the proposed algorithm can effectively identify and detect the rotated or scaled copy-paste regions,and in comparison with the methods reported previously,it is resistant to postprocessing,such as blurring,Gaussian white noise and JPEG *** proposed algorithm performs better than the existing algorithm to dealing with scaling transformation.

关键词： Copy-paste tampering Image forensics Marked graph Maximum angle

来源：评论

学校读者我要写书评

暂无评论

Deep Bayesian optimization on attributed graphs

arXiv

引用

arXiv 2019年

作者： Cui, Jiaxu Yang, Bo Hu, Xia College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education China Department of Computer Science and Engineering Texas A&M University College Station United States

Attributed graphs, which contain rich contextual features beyond just network structure, are ubiquitous and have been observed to benefit various network analytics applications. Graph structure optimization, aiming to find the optimal graphs in terms of some specific measures, has become an effective computational tool in complex network analysis. However, traditional model-free methods suffer from the expensive computational cost of evaluating graphs;existing vectorial Bayesian optimization methods cannot be directly applied to attributed graphs and have the scalability issue due to the use of Gaussian processes (GPs). To bridge the gap, in this paper, we propose a novel scalable Deep Graph Bayesian Optimization (DGBO) method on attributed graphs. The proposed DGBO prevents the cubical complexity of the GPs by adopting a deep graph neural network to surrogate black-box functions, and can scale linearly with the number of observations. Intensive experiments are conducted on both artificial and real-world problems, including molecular discovery and urban road network design, and demonstrate the effectiveness of the DGBO compared with the state-of-the-art. Copyright © 2019, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Group-attention Based Neural Machine Translation

引用

IOP Conference Series: Materials Science and engineering 2020年第2期782卷

作者： Renyu Hu Hao Xu Yang Xiao Chenjun Wu Haiyang Jia College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

Machine translation is a classic problem in natural language process (NLP). Recent years, the encoder and decoder through an attention mechanism has become a trend. Google proposed a new simple network architecture, the Transformer using attention mechanisms only rather than CNN or RNN in 2017. However, it may lose some important information (e.g., grammatical component, etc) when using attention mechanism for whole *** propose a new brand model based on transformer using Group attention layers and group position embedding. It absorbs the features of Group-CNN combines the algorithm in computer vision (CV) and NLP. The model not only pays more attention to the ingredients (e.g., subject, predicate and adverbial, etc), but also enhances the connection of phrase. It outperforms SofA Transformer in using more syntactic information.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：