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

arXiv 2021年

作者： Xu, Guangquan Liu, Yihua Xing, Jun Luo, Tao Gu, Yonghao Liu, Shaoying Zheng, Xi Vasilakos, Athanasios V. The Big Data School Qingdao Huanghai University Qingdao266427 China College of Intelligence and Computing Tianjin University Tianjin300350 China The International Engineering Institute Tianjin University Tianjin300350 China The College of Intelligence and Computing Tianjin University Tianjin Tianjin300350 China The school of Computer Science Beijing University of Posts and Telecommunications Beijing100876 China The Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing100876 China School of Informatics and Data Science Hiroshima University Japan The Department of Computing Macquarie University SydneyNSW2109 Australia The University of Technology Sydney Australia The Fuzhou University Fuzhou China Lulea University of Technology Lulea Sweden

The Internet of Vehicles (IoV) is an application of the Internet of things (IoT). It faces two main security problems: (1) the central server of the IoV may not be powerful enough to support the centralized authentication of the rapidly increasing connected vehicles, (2) the IoV itself may not be robust enough to single-node attacks. To solve these problems, this paper proposes SG-PBFT: a secure and highly efficient PBFT consensus algorithm for Internet of Vehicles, which is based on a distributed blockchain structure. The distributed structure can reduce the pressure on the central server and decrease the risk of single-node attacks. The SG-PBFT consensus algorithm improves the traditional PBFT consensus algorithm by using a score grouping mechanism to achieve a higher consensus efficiency. The experimental result shows that our method can greatly improve the consensus efficiency and prevent single-node attacks. Specifically, when the number of consensus nodes reaches 1000, the consensus time of our algorithm is only about 27% of what is required for the state-of-the-art consensus algorithm (PBFT). Our proposed SG-PBFT is versatile and can be used in other application scenarios which require high consensus efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Capacity analysis of ship-tugging operations in a large container port

引用

Asian Transport Studies 2020年 6卷

作者： Kang, Liujiang Gao, Song Meng, Qiang Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Ministry of Transport Beijing Jiaotong University 100044 China Intelligent Transportation Systems Research Center Wuhan University of Technology Wuhan 430063 China Department of Civil and Environmental Engineering National University of Singapore Singapore 117576 Singapore

In this study, we deal with the simulation problem of ship-tugging operations in a large container port. First, we build a tugboat-service network using a directed graph, where the nodes consist of tugboat bases, anchorages, and berths while the arcs represent the directed links between nodes. Second, we develop a marine traffic simulation system, which can simulate maritime traffic conditions in restricted waters, such as large container ports and busy straits. The marine traffic simulation system is a customized system. Users are allowed to set their study areas and virtual traffic environment (such as traffic demand and network structure) at will. Finally, we conduct various simulations for a real tugboat-service network of Singapore Port, which includes one anchorage, one tugboat base, two berths, and two channels between the anchorage and berths. A detailed analysis of the tugging capacity is provided based on simulation results. © 2020 The Authors

关键词： Capacity estimation Container ports Simulation system development Tugging operations

来源：评论

学校读者我要写书评

暂无评论

MultiAdapt: A Neural Network Adaptation For Pruning Filters Base on Multi-layers Group

引用

Journal of Physics: Conference Series 2021年第1期1873卷

作者： Jie Yang Zhihong Xie Ping Li School of Computer and Communication Engineering Changsha University of Science and Technology Changsha Hunan Changsha 410114 China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha University of Science and Technology Changsha Hunan Changsha 410114 China

Deep convolutional neural networks have been widely used in various AI applications. The most advanced neural networks are becoming deeper and wider, which has caused some large convolutional neural networks to exceed the size limit of the server or application. The pruning algorithm provides a way to reduce the size of the neural network while keeping the accuracy as high as possible. The automatic progressive pruning algorithm is one of the widely used pruning algorithms. The progressive pruning algorithm prunes a certain layer of the network in each iteration to reduce the sparsity while preserving the accuracy as much as possible. In this article, we design a new automatic progressive pruning algorithm named MultiAdapt. MultiAdapt combines the combination method and the greedy algorithm. This multi-layers progressive pruning method greatly increases the search space of the greedy algorithm, making it possible to obtain a better pruning network. We use MultiAdapt to prune large neural networks VGG-16 and ResNet. The experimental results show that the MultiAdapt algorithm is better than other mainstream methods in the balance of neural network model size and accuracy. For image classification tasks on the ImageNet dataset, our method achieved 88.72% and 90.55% TOP-5 accuracy on the 50% sparsity VGG-16 and ResNet, while obtaining nearly 2×reduction in parameters and floating point numbers. The operation is reduced, and the reduction is higher than the recent popular method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Erratum to “Event-triggering-based H∞ load frequency control for multi-area cyber–physical power system under DoS attacks” [Franklin Open Volume 3, June 2023, 100012]

Franklin Open

引用

Franklin Open 2024年 9卷

作者： Xingyue Liu Kaibo Shi Kun Zhou Shiping Wen Yiqian Tang Lin Tang School of Electronic Information and Electrical Engineering Chengdu University Chengdu 610106 PR China Key Laboratory of Intelligent Manufacturing Quality Big Data Tracing and Analysis of Zhejiang Province China Jiliang University Hangzhou 310018 PR China Engineering Research Center of Power Quality of Ministry of Education Anhui University Hefei 230601 PR China Institute of Electronic and Information Engineering of University of Electronic Science and Technology of China in Guangdong 523808 PR China Australian AI Institute Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW 2007 Australia

来源：评论

学校读者我要写书评

暂无评论

SR-GAN: Semantic rectifying generative adversarial network for zero-shot learning

arXiv

引用

arXiv 2019年

作者： Ye, Zihan Lyu, Fan Li, Linyan Fu, Qiming Ren, Jinchang Hu, Fuyuan Suzhou University of Science and Technology China Tianjin University China Suzhou Institute of Trade & Commerce China University of Strathclyde United Kingdom Virtual Reality Key Laboratory of Intelligent Interaction and Application Technology of Suzhou China Key Laboratory of Intelligent Building Energy Efficiency China Suzhou Key Laboratory for Big Data and Information Service China

The existing Zero-Shot learning (ZSL) methods may suffer from the vague class attributes that are highly overlapped for different classes. Unlike these methods that ignore the discrimination among classes, in this paper, we propose to classify unseen image by rectifying the semantic space guided by the visual space. First, we pre-train a Semantic Rectifying Network (SRN) to rectify semantic space with a semantic loss and a rectifying loss. Then, a Semantic Rectifying Generative Adversarial Network (SR-GAN) is built to generate plausible visual feature of unseen class from both semantic feature and rectified semantic feature. To guarantee the effectiveness of rectified semantic features and synthetic visual features, a pre-reconstruction and a post reconstruction networks are proposed, which keep the consistency between visual feature and semantic feature. Experimental results demonstrate that our approach significantly outperforms the state-of-the-arts on four benchmark datasets. Copyright © 2019, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Joint Spatial-Temporal Trajectory Clustering Method for Mobile Social Networks

Joint Spatial-Temporal Trajectory Clustering Method for Mobi...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ji Tang Linfeng Liu Jiagao Wu Jian Zhou Yang Xiang School of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9781728125848

As an important issue in the trajectory mining task, the trajectory clustering technique has attracted lots of the attention in the field of data mining. Trajectory clustering technique identifies the similar trajectories (or trajectory segments) and classifies them into the several clusters which can reveal the potential movement behaviors of nodes. At present, most of the existing trajectory clustering methods focus on some spatial properties of trajectories (such as geographic locations, movement directions), while the spatial-temporal properties (especially the combination of spatial distances and semantic distances) are ignored, and thus some vital information regarding the movement behaviors of nodes is probably lost in the trajectory clustering results. In this paper, we propose a Joint Spatial-Temporal Trajectory Clustering Method (JSTTCM), where some spatialtemporal properties of the trajectories are exploited to cluster the trajectory segments. Finally, the number of clusters and the silhouette coefficient are observed through simulations, and the results show that JSTTCM can cluster the trajectory segments appropriately.

关键词： Trajectory clustering Spatial-temporal properties Spatial distances Semantic distances trajectory Social Networks Clustering methods Social Media Ganglia

来源：评论

学校读者我要写书评

暂无评论

Erratum to "Multi-View Face Synthesis via Progressive Face Flow"

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2021年 30卷 6700页

作者： Yangyang Xu Xuemiao Xu Jianbo Jiao Keke Li Cheng Xu Shengfeng He School of Computer Science and Engineering South China University of Technology Guangzhou China State Key Laboratory of Subtropical Building Science the Key Laboratory of Big Data and Intelligent Robot Ministry of Education and the Guangdong Provincial Key Lab of Computational Intelligence and Cyberspace Information South China University of Technology Guangzhou China University of Oxford Oxford U.K.

In the above article [1], unfortunately, Fig. 5 was not displayed correctly with many empty images. The correct version is supplemented here.

关键词： Faces

来源：评论

学校读者我要写书评

暂无评论

Multi-agent game abstraction via graph attention neural network

arXiv

引用

arXiv 2019年

作者： Liu, Yong Wang, Weixun Hu, Yujing Hao, Jianye Chen, Xingguo Gao, Yang National Key Laboratory for Novel Software Technology Nanjing University Tianjin University NetEase Fuxi AI Lab Noah's Ark Lab Huawei Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications

In large-scale multi-agent systems, the large number of agents and complex game relationship cause great difficulty for policy learning. Therefore, simplifying the learning process is an important research issue. In many multi-agent systems, the interactions between agents often happen locally, which means that agents neither need to coordinate with all other agents nor need to coordinate with others all the time. Traditional methods attempt to use pre-defined rules to capture the interaction relationship between agents. However, the methods cannot be directly used in a large-scale environment due to the difficulty of transforming the complex interactions between agents into rules. In this paper, we model the relationship between agents by a complete graph and propose a novel game abstraction mechanism based on two-stage attention network (G2ANet), which can indicate whether there is an interaction between two agents and the importance of the interaction. We integrate this detection mechanism into graph neural network-based multi-agent reinforcement learning for conducting game abstraction and propose two novel learning algorithms GA-Comm and GA-AC. We conduct experiments in Traffic Junction and Predator-Prey. The results indicate that the proposed methods can simplify the learning process and meanwhile get better asymptotic performance compared with state-of-the-art algorithms. Copyright © 2019, The Authors. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Geo-spatial ontology matching through compact evolutionary algorithm 2nd

Geo-spatial ontology matching through compact evolutionary a...

引用

2nd International Conference on Smart Vehicular Technology, Transportation, Communication and Applications, VTCA 2018

作者： Xue, Xingsi Liu, Jianhua College of Information Science and Engineering Fujian University of Technology FuzhouFujian350118 China Intelligent Information Processing Research Center Fujian University of Technology FuzhouFujian350118 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology FuzhouFujian350118 China Fujian Key Lab for Automotive Electronics and Electric Drive Fujian University of Technology FuzhouFujian350118 China

ISBN: (纸本)9783030045845

Geo-spatial ontologies can provide a formal description of concepts, relationships, activities, features and rules in GIS domain. However, simply use them only allows to partially solve semantic conflicts, and does not completely solve heterogeneity issues that are caused by themselves. Geo-spatial ontology matching technique can find the correspondences between semantic identical entities, and solve the heterogeneous problem between two geo-spatial ontologies. Be inspired by the successful application of Evolutionary Algorithm (EA) in instance matching domain, in this paper, it is utilized to match the heterogeneous geo-spatial ontologies. To reduce the runtime and memory consumption required by EA, a compact version of it is presented, which does not work on the whole population but a probability representation on it. In addition, a geo-spatial similarity measure is presented to determine the identical geo-spatial entities, and an optimal model is constructed for geo-spatial ontology matching problem. The experimental results show that cEA-based geo-spatial ontology matching technique can efficiently determine the alignment. © Springer Nature Switzerland AG 2019.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

N-Docker: A NVM-HDD Hybrid Docker Storage Framework to Improve Docker Performance 16th

N-Docker: A NVM-HDD Hybrid Docker Storage Framework to Impro...

引用

16th IFIP WG 10.3 International Conference on Network and Parallel Computing, NPC 2019

作者： Gu, Lin Tang, Qizhi Wu, Song Jin, Hai Zhang, Yingxi Shi, Guoqiang Lin, Tingyu Rao, Jia National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China State Key Laboratory of Intelligent Manufacturing System Technology Beijing100854 China The University of Texas at Arlington ArlingtonTX76019 United States

ISBN: (纸本)9783030307080

Docker has been widely adopted in production environment, but unfortunately deployment and cold-start of container are limited by the low speed of disk. The emerging non-volatile memory (NVM) technology, which has high speed and can store data permanently, brings a new chance to accelerate the deployment and cold-start of container. However, it is expensive to replace the whole hard disk driver (HDD) with NVM. To achieve the fastest deployment and cold-start with lowest cost, we conduct in-depth analysis on the Top-134 images in Docker Hub and obtain two main insights as: (1) the storing latency of layered image has become the bottleneck of container deployment;(2) only a few image layers are required for container cold-start. Based on these two findings, we propose a NVM-HDD hybrid docker storage framework as N-Docker. It can effectively accelerate container cold-start by detecting the bottleneck layers as well as cold-start required layers and storing them into NVM for faster container startup with limited NVM capacity. Experimental results show that N-Docker can accelerate the container deployment by 1.21X and cold-start by 2.96X. Compared to NVM-Docker, which stores all images into NVM, N-Docker achieves the same performance improvements while reducing the usage of NVM by 88.22%. © 2019, IFIP International Federation for Information Processing.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：