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

Network Intrusion Detection System Using Deep Learning Method with KDD Cup'99 Dataset

学校读者我要写书评

暂无评论

Network Intrusion Detection System Using Deep Learning Metho...

IEEE International Symposium on Embedded Multicore Socs (MCSoC)

作者： Jesse Jeremiah Tanimu Mohamed Hamada Patience Robert Anand Mahendran Dept. Of Computer Science Bayero University Kano Kano Nigeria Software Engineering Lab. University of Aizu Aizu Japan Department of Computer Science Federal Polytechnic Bali Bali Nigeria Theoretical Computer Science Lab. Higher School of Economics Moscow Moscow Russia

ISBN: (纸本)9781665465007

This work is a deep sparse autoencoder network intrusion detection system which addresses the issue of interpretability of L2 regularization technique used in other works. The proposed model was trained using a mini-batch gradient descent technique, L1 regularization technique and ReLU activation function to arrive at a better performance. Results based on the KDDCUP'99 dataset show that our approach provides significant performance improvements over other deep sparse autoencoder Network Intrusion Detection Systems.

关键词： Deep learning Multicore processing Network intrusion detection

Secure and Transparent Public-key Management System for Vehicular Social Networks 6

学校读者我要写书评

暂无评论

Secure and Transparent Public-key Management System for Vehi...

6th IEEE International Conference on computer and Communications, ICCC 2020

作者： Noor, Abdul Wu, Youxi Khan, Salabat School of Artificial Intelligence Hebei University of Technology Tianjin China College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (纸本)9781728186351

Vehicular Social Networks (VSNs) are expected to become a reality soon, where commuters having common interests in the virtual community of vehicles, drivers, passengers can share information, both about road conditions and their surroundings. This will improve transportation efficiency and public safety. However, social networking exposes vehicles to different kinds of cyber-attacks. This concern can be addressed through an efficient and secure key management framework. This study presents a Secure and Transparent Public-key Management (ST-PKMS) based on blockchain and notary system, but it addresses security and privacy challenges specific to VSNs. ST-PKMS significantly enhances the efficiency and trustworthiness of mutual authentication. In ST-PKMS, each vehicle has multiple short-lived anonymous public-keys, which are recorded on the blockchain platform. However, public-keys get activated only when a notary system notarizes it, and clients accept only notarized public-keys during mutual authentication. Compromised vehicles can be effectively removed from the VSNs by blocking notarization of their public-keys;thus, the need to distribute Certificate Revocation List (CRL) is eliminated in the proposed scheme. ST-PKMS ensures transparency, security, privacy, and availability, even in the face of an active adversary. The simulation and evaluation results show that the ST-PKMS meets real-time performance requirements, and it is cost-effective in terms of scalability, delay, and communication overhead. © 2020 IEEE.

关键词： Authentication

Automatic Sleep Spindle Detection and Analysis in Patients with Sleep Disorders 1

学校读者我要写书评

暂无评论

2nd International Workshop on Human Brain and Artificial Intelligence, HBAI 2020 held in Conjunction with IJCAI-PRICAI 2020

作者： Chen, Chao Zhu, Xuequan Belkacem, Abdelkader Nasreddine Lu, Lin Hao, Long You, Jia Shin, Duk Tan, Wenjun Huang, Zhaoyang Ming, Dong Academy of Medical Engineering and Translational Medicine Tianjin University Tianjin300072 China Key Laboratory of Complex System Control Theory and Application Tianjin University of Technology Tianjin300384 China Department of Computer and Network Engineering College of Information Technology UAE University Al Ain15551 United Arab Emirates Zhonghuan Information College Tianjin University of Technology Tianjin300380 China Department of Electronics and Mechatronics Tokyo Polytechnic University Atsugi243-0297 Japan School of Computer Science and Engineering Northeastern University Shenyang110189 China Department of Neurology Xuanwu Hospital Capital Medical University Beijing100088 China

ISBN: (数字)9789811612886

ISBN: (纸本)9789811612879

Nowadays, Sleep disorder is a common disease, and spindle spindles are important features of the second stage non-rapid eye movement (NREM) sleep. In this paper, we propose an improved automatic detection method of spindles based on wavelet transform. The spindles automatic detector is mainly composed of wavelet transform and clustering. We collected the electroencephalography (EEG) signals of six patients with sleep disorders all night for ten hours, and then preprocessed the data and other operations, and then used our improved method to detect the sleep EEG signals by spindles. By comparing with the previous automatic detection method not improved and another automatic detection method, the results show that the accuracy of sleep spindles detection can be effectively improved. The accuracy of the improved detector is 5.19% higher than before, and 9.7% higher than that of another method based on amplitude threshold. Finally, we made a simple comparison between people with sleep disorders and normal people. We found that there were significant differences in spindle density between people with sleep disorders and people without sleep disorders. The average spindle density in the normal population averaged 2.59 spindles per minute. People with sleep disorders had an average spindle density of 1.32 spindles per minute. In future research, our research direction is to improve the accuracy of spindles automatic detection by improving the spindles detector and study the difference of spindles between patients with sleep disorders and normal people in a large number of samples, so that the difference of spindles can be used as the basis for the diagnosis of sleep disorders. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Wavelet transforms

Approximation Algorithm for Connected Submodular Function Maximization Problems

学校读者我要写书评

暂无评论

Approximation Algorithm for Connected Submodular Function Ma...

International Conference on Distributed Computing Systems

作者： Wenzheng Xu He Xue Jing Li Weifa Liang Zichuan Xu Pan Zhou Xiaohua Jia Sajal K. Das College of Computer Science Sichuan University Chengdu P. R. China Sichuan Fire Science and Technology Research Institute of MEM Chengdu P. R. China Department of Computing The Hong Kong Polytechnic University Hong Kong P. R. China Department of Computer Science City University of Hong Kong Hong Kong P. R. China School of Software Dalian University of Technology Dalian P. R. China School of Cyber Science and Engineering Huazhong University of Science & Technology P. R. China Department of Computer Science Missouri University of Science and Technology Rolla USA

ISBN: (数字)9798350386059

ISBN: (纸本)9798350386066

In this paper, we study a connected submodular function maximization problem, which arises from many applications including deploying UAV networks to serve users and placing sensors to cover Points of Interest (PoIs). Specifically, given a budget $K$ , the problem is to find a subset $S$ with $K$ nodes from a graph $G$ so that a given submodular function $f (S)$ on $S$ is maximized while the induced subgraph $G[S]$ by the nodes in $S$ is connected, where the submodular function $f$ can be used to model many practical application problems, such as the number of users within different service areas of the deployed UAVs in $S$ , the sum of data rates of users served by the UAVs, the number of covered PoIs by placed sensors, etc. We then propose a novel $\frac{1-1/e}{2h+2}$ -approximation algorithm for the problem, improving the best approximation ratio $\frac{1-1/e}{2h+3}$ for the problem so far, through estimating a novel upper bound on the problem and designing a smart graph decomposition technique, where $e$ is the base of the natural logarithm, $h$ is a parameter depends on the problem and its typical value is 2. In addition. when $h= 2$ , the algorithm approximation ratio is at least $\frac{1-1/e}{5}$ and may be as large as 1 in some special cases when $K$ ≤21, and is no less than $\frac{1-1/e}{6}$ when $K$ ≥ 22, compared with the current best approximation ratio $\frac{1-1/e}{7}(= \frac{1-1/e}{2h+3})$ for the problem. We finally evaluate the algorithm performance in the application of deploying a UAV network. Experimental results demonstrate the number of users within the service area of the deployed UAV network by the proposed algorithm is up to 7.5% larger than those by existing algorithms, and its empirical approximation ratio is between 0.7 and 0.99, which is close to the theoretical maximum value one.

关键词： Upper bound Approximation algorithms Autonomous aerial vehicles Data models Distributed computing Intelligent sensors Monitoring

Deep High-resolution representation learning for cross-resolution person re-identification

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Zhang, Guoqing Ge, Yu Dong, Zhicheng Wang, Hao Zheng, Yuhui Chen, Shengyong The School of Computer and Software Nanjing University of Information Science and Technology Nanjing210044 China The Engineering Research Center of Digital Forensics Ministry of Education Nanjing University of Information Science and Technology The School of Computer and Software Nanjing University of Information Science and Technology 210044 China The School of Computer Science and Engineering Tianjin University of Technology Tianjin300384 China

Person re-identification (re-ID) tackles the problem of matching person images with the same identity from different cameras. In practical applications, due to the differences in camera performance and distance between cameras and persons of interest, captured person images usually have various resolutions. We name this problem as Cross-Resolution Person Re-identification which brings a great challenge for matching correctly. In this paper, we propose a Deep High-Resolution Pseudo-Siamese Framework (PS-HRNet) to solve the above problem. Specifically, in order to restore the resolution of low-resolution images and make reasonable use of different channel information of feature maps, we introduce and innovate VDSR module with channel attention (CA) mechanism, named as VDSR-CA. Then we reform the HRNet by designing a novel representation head to extract discriminating features, named as HRNet-ReID. In addition, a pseudo-siamese framework is constructed to reduce the difference of feature distributions between low-resolution images and high-resolution images. The experimental results on five cross-resolution person datasets verify the effectiveness of our proposed approach. Compared with the state-of-the-art methods, our proposed PS-HRNet improves 3.4%, 6.2%, 2.5%,1.1% and 4.2% at Rank-1 on MLR-Market-1501, MLR-CUHK03, MLR-VIPeR, MLR-DukeMTMC-reID, and CAVIAR datasets, respectively. Our code is available at https://***/zhguoqing. Copyright © 2021, The Authors. All rights reserved.

关键词： Cameras

Device Activity Detection in mMTC with Low-Resolution ADC: A New Protocol

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Zhaorui Liu, Ya-Feng Wang, Ziyue Liu, Liang Pan, Haoyuan Cui, Shuguang The Future Network of Intelligence Institute The School of Science and Engineering The Chinese University of Hong Kong Shenzhen518172 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong College of Computer Science and Software Engineering Shenzhen University Shenzhen China

This paper investigates the effect of low-resolution analog-to-digital converters (ADCs) on device activity detection in massive machine-type communications (mMTC). The low-resolution ADCs induce two challenges on the device activity detection compared with the traditional setup with the assumption of infinite ADC resolution. First, the codebook design for signal quantization by the low-resolution ADC is particularly important since a good design of the codebook can lead to small quantization error on the received signal, which in turn has significant influence on the activity detector performance. To this end, prior information about the received signal power is needed, which depends on the number of active devices K. This is sharply different from the activity detection problem in traditional setups, in which the knowledge of K is not required by the BS as a prerequisite. Second, the covariance-based approach achieves good activity detection performance in traditional setups while it is not clear if it can still achieve good performance in this paper. To solve the above challenges, we propose a communication protocol that consists of an estimator for K and a detector for active device identities: 1) For the estimator, the technical difficulty is that the design of the ADC quantizer and the estimation of K are closely intertwined and doing one needs the information/execution from the other. We propose a progressive estimator which iteratively performs the estimation of K and the design of the ADC quantizer;2) For the activity detector, we propose a custom-designed stochastic gradient descent algorithm to estimate the active device identities. Numerical results demonstrate the effectiveness of the communication protocol. © 2023, CC BY.

关键词： Stochastic systems

学校读者我要写书评

暂无评论

Visual Tuning

arXiv 2023年

作者： Yu, Bruce X.B. Chang, Jianlong Wang, Haixin Liu, Lingbo Wang, Shijie Wang, Zhiyu Lin, Junfan Xie, Lingxi Li, Haojie Lin, Zhouchen Tian, Qi Chen, Chang Wen Zhejiang University University of Illinois Urbana-Champaign Institute Zhejiang University China Huawei China National Engineering Research Center for Software Engineering Peking University China Peng Cheng Laboratory China College of Computer Science and Engineering Shandong University of Science and Technology China National Key Lab of General AI School of Intelligence Science and Technology Peking University China Department of Computing The Hong Kong Polytechnic University Hong Kong

Fine-tuning visual models has been widely shown promising performance on many downstream visual tasks. With the surprising development of pre-trained visual foundation models, visual tuning jumped out of the standard modus operandi that fine-tunes the whole pre-trained model or just the fully connected layer. Instead, recent advances can achieve superior performance than full-tuning the whole pre-trained parameters by updating far fewer parameters, enabling edge devices and downstream applications to reuse the increasingly large foundation models deployed on the cloud. With the aim of helping researchers get the full picture and future directions of visual tuning, this survey characterizes a large and thoughtful selection of recent works, providing a systematic and comprehensive overview of existing work and models. Specifically, it provides a detailed background of visual tuning and categorizes recent visual tuning techniques into five groups: fine-tuning, prompt tuning, adapter tuning, parameter tuning, and remapping tuning. Meanwhile, it offers some exciting research directions for prospective pre-training and various interactions in visual tuning. Copyright © 2023, The Authors. All rights reserved.

关键词： Vision

On the comparison of optimal NOMA and OMA in a paradigm shift of emerging technologies

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2022年

作者： Ghosh, Joydev Ra, In-Ho Singh, Saurabh Haci, Hüseyin Al-Utaibi, Khaled A. Sait, Sadiq M. School of Computer Science and Robotics Tomsk Polytechnic University Tomsk Russia School of Computer Information and Communication Engineering Kunsan National University Gunsan Korea Republic of Department of Industrial & Systems Engineering Dongguk University Korea Republic of Department of Electrical and Electronics Engineering Near East University Mersin 10 Turkey Computer Science and Software Engineering Department University of Ha’il Saudi Arabia Department of Computer Engineering King Fahd University of Petroleum & Minerals Dhahran Saudi Arabia

Non-orthogonal multiple access (NOMA) is a better multiple access technique than orthogonal multiple access (OMA), precisely orthogonal frequency division multiple access (OFDMA) scheme, at the conceptual level for fifth-generation (5G) networks and beyond 5G (B5G) networks. We investigate the potentials of the schemes by comparing the proposed NOMA scheme with the traditional cooperative communication NOMA (CCNOMA) scheme, rather than the comparison between NOMA and OMA only. To probe the effectiveness of NOMA as a multiple access technique, we propose a novel NOMA scheme considering two adjacent BSs with a special design of the transceiver architecture. The proposed scheme provides a reasonable data rate to both near user (NU) and far user (FU) without compromising the quality of service (QoS) to anyone of them. The conclusive analyses on the optimization framework of multi-user sum rate, capacity, transmit power, spectral efficiency (SE), and energy efficiency (EE) trade-off for NOMA and OFDMA schemes have been established to a succession of derivations. Under the analytical optimization framework, we also prove quite a few properties for them. Simulation results confirm the theoretical findings and show that the two schemes can efficiently approach the optimal power allocation, minimization of power consumption, and optimal SE-EE trade-off, and the proposed NOMA scheme provides comparatively better data sum rates than the baseline OMA scheme. © 2022, CC BY.

关键词： Energy efficiency

Heterophily-Aware Graph Attention Network

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Wang, Junfu Guo, Yuanfang Yang, Liang Wang, Yunhong State Key Laboratory of Software Development Environment Beihang University Beijing100191 China School of Computer Science and Engineering Beihang University Beijing100191 China Shen Yuan Honors College Beihang University Beijing100191 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China Hebei Province Key Laboratory of Big Data Calculation Hebei University of Technology Tianjin300401 China

Graph Neural Networks (GNNs) have shown remarkable success in graph representation learning. Unfortunately, current weight assignment schemes in standard GNNs, such as the calculation based on node degrees or pair-wise representations, can hardly be effective in processing the networks with heterophily, in which the connected nodes usually possess different labels or features. Existing heterophilic GNNs tend to ignore the modeling of heterophily of each edge, which is also a vital part in tackling the heterophily problem. In this paper, we first propose a heterophily-aware attention scheme and reveal the benefits of modeling the edge heterophily, i.e., if a GNN assigns different weights to edges according to different heterophilic types, it can learn effective local attention patterns, enabling nodes to acquire appropriate information from distinct neighbors. Then, we propose a novel Heterophily-Aware Graph Attention Network (HA-GAT) by fully exploring and utilizing the local distribution as the underlying heterophily, to handle the networks with different homophily ratios. To demonstrate the effectiveness of the proposed HA-GAT, we analyze the proposed heterophily-aware attention scheme and local distribution exploration, by seeking an interpretation from their mechanism. Extensive results demonstrate that our HA-GAT achieves state-of-the-art performances on eight datasets with different homophily ratios in both the supervised and semi-supervised node classification tasks. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph neural networks