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

International Conference on Cyber-Enabled Distributed computing and Knowledge Discovery, CyberC

作者： Haoyan Xu Xiaolong Xu Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China

In the traditional work, based on EEG Sensors monitoring the physiological and emotional state of humans, the time-frequency analysis method is usually used to extract the characteristics of the signal, and then analyzed by SVM, KNN and other methods. However, the recognition accuracy of such methods is not ideal. Deep learning methods such as CNN and RNN have become the research hotspots in the field of EEG analysis. However, due to the high structural risk of the deep learning model, the model is prone to poor generalization ability, long training time, over-fitting, and poor real-time performance. In addition, current EEG data acquisition devices generally require dozens of signal channels to provide a data foundation for accurate analysis of subsequent brain signals, which not only brings high hardware costs, but also is not portable enough to be popularized in daily life. However, due to the weak and susceptible interference of the EEG signal, reducing the number of signal channels under the premise of using the above method may further lead to a worse analysis effect. In order to solve these problems, we propose a new lightweight EEG classification model based on a small number of channel EEG sensors, called Armaiti. Armaiti first uses the 5-channel EEG signal collected by the portable EEG acquisition device to perform blind source signal separation to obtain data from multiple sources, including noise signals such as EOG. Instead of identifying and screening these signals, we use a combination of EEG, EOG and other signals. Then Armaiti performs wavelet packet transform on each signal source, decomposes the signal into different frequency bands, and then inputs it into the lightweight convolutional neural network model designed in this paper to obtain five classifiers. Finally, Armaiti uses the ensemble learning to get the final classification results. In order to verify the performance and practicability of the model, from September 2018 to June 2019, we use

关键词： Electroencephalography Brain modeling Electrooculography Computational modeling Analytical models Fatigue Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Strong Asymptotic Properties of Kernel Smoothing Estimation for NA Random Variables with Right Censoring

arXiv

引用

arXiv 2019年

作者： Shi, Jian-Hua Xu, Jian-Sen Xu, Jin-Feng School of Mathematics and Statistics Minnan Normal University Zhangzhou363000 China Fujian Key Laboratory of Granular Computing and Applications Zhangzhou363000 China The Institute of Meteorological Big Data-Digital Fujian Zhangzhou363000 China Fujian Key Laboratory of Data Science and Statistics Zhangzhou363000 China

Most studies for negatively associated (NA) random variables consider the complete-data situation, which is actually a relatively ideal condition in practice. The paper relaxes this condition to the incomplete-data setting and considers kernel smoothing density and hazard function estimation in the presence of right censoring based on the Kaplan-Meier estimator. We establish the strong asymptotic properties for these two estimators to assess their asymptotic behavior and justify their practical use. Copyright © 2019, The Authors. All rights reserved.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Mapping Heavy Metals in Cultivated Soils Based on Land Use Types and Cokriging 5th

Mapping Heavy Metals in Cultivated Soils Based on Land Use T...

引用

5th International Conference on Geo-Spatial Knowledge and Intelligence, GSKI 2017

作者： Zhao, Jinling Liu, Chuang Song, Qixiang Jiang, Yan Hong, Qi Huang, Linsheng Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230039 China Anhui Engineering Laboratory of Agro-Ecological Big Data Anhui University Hefei230601 China Information Engineering Institute Suzhou University Suzhou234000 China

ISBN: (纸本)9789811308925

It is extremely important to explore the heavy metal content and spatial distribution in different cultivated soils. In our study, cokriging (COK) method was used to investigate the relationship between heavy metals and land use types. A total of six heavy metals including Zn, Fe, Cu, Mn, B, S were selected to forecast the heavy metals in cultivated soils. Five types of cultivated land were considered in the study area, including vegetable land, irrigated land, irrigated paddy field, dry land, orchard. Test of normality was firstly carried out to assure that higher prediction accuracy can be obtained, and then correlation analysis and analysis of variance (ANOVA) were performed to find out the most sensitive heavy metals for spatial interpolation. The analysis results showed that Zn, Cu and Fe were the primary heavy metals in soil of the study area. It was obvious that the effect of Mn and Fe were much greater caused by land use types, while they were smaller for B and S. Three errors of mean standard (MS), root mean square error (RMSE), and root mean square standardized error (RMSSE) were derived to assess the prediction accuracy. In comparison with ordinary kriging (OK), the MS of COK approached to 1, the RMSE was much smaller and the RMSSE also approached to 1, which showed that COK can make better predictions than OK. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Heavy metals

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：