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

A Stepwise Path Selection Scheme Based on Multiple QoS Parameters Evaluation in SDN 17th

学校读者我要写书评

暂无评论

A Stepwise Path Selection Scheme Based on Multiple QoS Param...

17th EAI International Conference on Collaborative computing: Networking, Applications, and Worksharing, CollaborateCom 2021

作者： Liu, Lin Zhou, Jian-Tao Xing, Hai-Feng Guo, Xiao-Yong College of Computer Science Ecological Big Data Engineering Research Center of the Ministry of Education Cloud Computing and Service Software Engineering Laboratory of Inner Mongolia Autonomous Region National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Social Computing and Data Processing Key Laboratory of Inner Mongolia Autonomous Region Big Data Analysis Technology Engineering Research Center of Inner Mongolia Autonomous Region Inner Mongolia University Inner Mongolia Hohhot China College of Computer Science and Technology Inner Mongolia Normal University Inner Mongolia Hohhot China College of Computer Information and Management Inner Mongolia University of Finance and Economics Inner Mongolia Hohhot China

ISBN: (纸本)9783030926342

Nowadays, the best-effort service can not guarantee the quality of service (QoS) for all kinds of services. QoS routing is an important method to guarantee QoS requirements. It involves path selection for flows based on the current network status and the performance criteria of the service requirements. However, it is difficult for proposed solutions to obtain all the available paths owing to not fully considering all the QoS parameters of paths. In this paper, we propose SWQoS, a novel, universal, and stepwise QoS guarantee scheme based on multiple QoS parameter evaluation for selecting the available paths including preferred paths, satisfied paths and reluctant paths in SDN. The experiments show that SWQoS can select all the available paths that meet the performance criteria of the service requirements and have better QoS parameter performance compared with other path selection methods. © 2021, ICST Institute for Computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Quality of service

Self-Supervised Teaching and Learning of Representations on Graphs 23

学校读者我要写书评

暂无评论

Self-Supervised Teaching and Learning of Representations on ...

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Fu, Zhenqiang Sun, Lu Wang, Xianpeng Xu, Gang Yan, Xiaoran Xia, Feng Key Laboratory for Ubiquitous Network Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China State Key Laboratory of Marine Resource Utilization in South China Sea School of Information and Communication Engineering Hainan University Haikou China State Key Laboratory of Millimeter Waves School of Information Science and Engineering Southeast University Nanjing China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Recent years have witnessed significant advances in graph contrastive learning (GCL), while most GCL models use graph neural networks as encoders based on supervised learning. In this work, we propose a novel graph learning model called GraphTL, which explores self-supervised teaching and learning of representations on graphs. One critical objective of GCL is to retain original graph information. For this purpose, we design an encoder based on the idea of unsupervised dimensionality reduction of locally linear embedding (LLE). Specifically, we map one iteration of the LLE to one layer of the network. To guide the encoder to better retain the original graph information, we propose an unbalanced contrastive model consisting of two views, which are the learning view and the teaching view, respectively. Furthermore, we consider the nodes that are identical in muti-views as positive node pairs, and design the node similarity scorer so that the model can select positive samples of a target node. Extensive experiments have been conducted over multiple datasets to evaluate the performance of GraphTL in comparison with baseline models. Results demonstrate that GraphTL can reduce distances between similar nodes while preserving network topological and feature information, yielding better performance in node classification. © 2023 ACM.

关键词： Classification (of information)

Evaluating Interpolation and Extrapolation Performance of Neural Retrieval Models

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhan, Jingtao Xie, Xiaohui Mao, Jiaxin Liu, Yiqun Guo, Jiafeng Zhang, Min Ma, Shaoping Department of Computer Science and Technology Beijing National Research Center for Information Science and Technology Tsinghua University Beijing100084 China Beijing Key Laboratory of Big Data Management and Analysis Methods Gaoling School of Artificial Intelligence Renmin University of China Beijing100872 China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

A retrieval model should not only interpolate the training data but also extrapolate well to the queries that are different from the training data. While neural retrieval models have demonstrated impressive performance on ad-hoc search benchmarks, we still know little about how they perform in terms of interpolation and extrapolation. In this paper, we demonstrate the importance of separately evaluating the two capabilities of neural retrieval models. Firstly, we examine existing ad-hoc search benchmarks from the two perspectives. We investigate the distribution of training and test data and find a considerable overlap in query entities, query intent, and relevance labels. This finding implies that the evaluation on these test sets is biased toward interpolation and cannot accurately reflect the extrapolation capacity. Secondly, we propose a novel evaluation protocol to separately evaluate the interpolation and extrapolation performance on existing benchmark datasets. It resamples the training and test data based on query similarity and utilizes the resampled dataset for training and evaluation. Finally, we leverage the proposed evaluation protocol to comprehensively revisit a number of widely-adopted neural retrieval models. Results show models perform differently when moving from interpolation to extrapolation. For example, representation-based retrieval models perform almost as well as interaction-based retrieval models in terms of interpolation but not extrapolation. Therefore, it is necessary to separately evaluate both interpolation and extrapolation performance and the proposed resampling method serves as a simple yet effective evaluation tool for future IR studies. Copyright © 2022, The Authors. All rights reserved.

关键词： Extrapolation

MINDFLOW: A NETWORK TRAFFIC ANOMALY DETECTION MODEL BASED ON MINDSPORE

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Xiang, Qiuyan Wu, Shuang Wu, Dongze Liu, Yuxin Qin, Zhenkai School of Information Technology Guangxi Police College 530028 China College of Computer Science and AI Southwest Minzu University 610213 China Institute of Software Chinese Academy of Sciences 100190 China School of Computing and Information China Network Security Research Center China Big Data and Policing Technology Laboratory Guangxi Police College Guangxi Nanning China

With the wide application of IoT and industrial IoT technologies, the network structure is becoming more and more complex, and the traffic scale is growing rapidly, which makes the traditional security protection mechanism face serious challenges in dealing with high-frequency, diversified, and stealthy cyber-attacks. To address this problem, this study proposes MindFlow, a multi-dimensional dynamic traffic prediction and anomaly detection system combining convolutional neural network (CNN) and bi-directional long and short-term memory network (BiLSTM) architectures based on the MindSpore framework, and conducts systematic experiments on the NF-BoT-IoT dataset. The experimental results show that the proposed model achieves 99% in key metrics such as accuracy, precision, recall and F1 score, effectively verifying its accuracy and robustness in network intrusion detection. © 2025, CC0.

关键词： Convolutional neural networks

Exact Fit Attention in Node-Holistic Graph Convolutional Network for Improved EEG-Based Driver Fatigue Detection

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Xu, Meiyan Chen, Qingqing Chen, Duo Ding, Yi Wang, Jingyuan Gu, Peipei Pan, Yijie Huang, Deshuang Guo, Jiayang Zhang, Xun Department of Computer Science The Institute of Human Factors Engineering Minnan Normal University Zhangzhou363000 China School of Artificial Intelligence and Information Technology Nanjing University of Chinese Medicine Nanjing210023 China College of Computing and Data Science Nanyang Technological University Singapore School of Digital Media and Design Arts Beijing University of Posts and Telecommunications Beijing100088 China College of Software Engineering Zhengzhou University of Light Industry Zhengzhou450000 China Department of Computer Science and Technology Tsinghua University Beijing100084 China Eastern Institute for Advanced Study Eastern Institute of Technology Ningbo315200 China Ningbo Institute of Digital Twin Eastern Institute of Technology Ningbo315200 China National Institute for Data Science in Health and Medicine Xiamen University Xiamen361005 China

EEG-based fatigue monitoring can effectively reduce the incidence of related traffic accidents. In the past decade, with the advancement of deep learning, convolutional neural networks (CNN) have been increasingly used for EEG signal processing. However, due to the data’s non-Euclidean characteristics, existing CNNs may lose important spatial information from EEG, specifically channel correlation. Thus, we propose the node-holistic graph convolutional network (NHGNet), a model that uses graphic convolution to dynamically learn each channel’s features. With exact fit attention optimization, the network captures inter-channel correlations through a trainable adjacency matrix. The interpretability is enhanced by revealing critical areas of brain activity and their interrelations in various mental states. In validations on two public datasets, NHGNet outperforms the SOTAs. Specifically, in the intra-subject, NHGNet improved detection accuracy by at least 2.34% and 3.42%, and in the inter-subjects, it improved by at least 2.09% and 15.06%. Visualization research on the model revealed that the central parietal area plays an important role in detecting fatigue levels, whereas the frontal and temporal lobes are essential for maintaining vigilance. Copyright © 2025, The Authors. All rights reserved.

关键词： Electroencephalography

Deceptive level generation for angry birds

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Gamage, Chathura Pinto, Vimukthini Renz, Jochen Stephenson, Matthew School of Computing The Australian National University Canberra Australia Department of Data Science and Knowledge Engineering Maastricht University Maastricht Netherlands

The Angry Birds AI competition has been held over many years to encourage the development of AI agents that can play Angry Birds game levels better than human players. Many different agents with various approaches have been employed over the competition's lifetime to solve this task. Even though the performance of these agents has increased significantly over the past few years, they still show major drawbacks in playing deceptive levels. This is because most of the current agents try to identify the best next shot rather than planning an effective sequence of shots. In order to encourage advancements in such agents, we present an automated methodology to generate deceptive game levels for Angry Birds. Even though there are many existing content generators for Angry Birds, they do not focus on generating deceptive levels. In this paper, we propose a procedure to generate deceptive levels for six deception categories that can fool the state-of-the-art Angry Birds playing AI agents. Our results show that generated deceptive levels exhibit similar characteristics of human-created deceptive levels. Additionally, we define metrics to measure the stability, solvability, and degree of deception of the generated levels. Copyright © 2021, The Authors. All rights reserved.

关键词： Birds

Hiding Scrambling Text Message in Speech Signal Based on Lightwight Hyperchaotic Map and Conditional Lsb Mechanisms

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Al Sibahee, Mustafa A. Abduljaleel, Iman Qays Luo, Chengwen Zhang, Jin Huang, Yijing Abduljabbar, Zaid Ameen Ma, Junchao National Engineering Laboratory for Big Data System Computing Technology Shenzhen Technology University 518060 China Department of Computer Science College of Computer Science and Information Technology University of Basrah 61004 Iraq College of Computer Science and Software Engineering Shenzhen University 518060 China Department of Computer Science College of Education for Pure Sciences University of Basrah Basrah61004 Iraq Technical Computer Engineering Department Al-kunooze University College Basrah61001 Iraq Huazhong University of Science and Technology Shenzhen Institute Shenzhen518118 China College of Big Data and Internet Shenzhen Technology University Shenzhen518118 China

This study proposed a lightweight and secure audio steganography system for hiding text messages during transmission over the Internet to address the computational cost exaggeration, and Insufficient levels of security in earlier studies. The paper proposes a two-phase functioning mechanism. Text characters are transformed into ASCII code and then stored in a vector, which is then divided into three sub-vectors. The sub-vectors are scrambled using a two low complexity operation, namely a forwardbackward reading technique and an odd-even index. Two scrambling circuits can be performed: the first on tiny sub-vectors and another on the vector as a whole. In the hiding phase, the speech signal samples were divided into 256 blocks using only 200 values per block, and low complexity Quadratic and the Hénon maps to hide the speech signal in a random manner. This method utilizes the conditional LSB as low complexity algorithm to identify hidden bits and a special hyperchaotic map algorithm for randomly choosing locations. The proposed approach provides good security for a scrambled text message with high SNR and PSNR, small MSE error and PESQ, SSIM near one, BER close to zero, and MOS near five as well as the lowest computational hiding cost. © 2023, The Authors. All rights reserved.

关键词： Steganography

Global gyrokinetic particle simulations of microturbulence in W7-X and LHD stellarators 47

学校读者我要写书评

暂无评论

Global gyrokinetic particle simulations of microturbulence i...

47th EPS Conference on Plasma Physics, EPS 2021

作者： Nicolau, J.H. Wang, H.Y. Holod, I. Fu, J.Y. Bao, J. Choi, G.J. Lin, Z. Liu, P.F. Spong, D. Wei, X.S. Xiao, Y. University of California Irvine United States Peking University Beijing China Max Planck Computing and Data Facility Garching Germany Chinese Academy of Science Beijing China Oak Ridge National Laboratory Oak Ridge United States Zhejiang University Hangzhou China

Design and Comparison of Collaborative Filtering Technology for Product Suggestions in E-Commerce 1

学校读者我要写书评

暂无评论

Design and Comparison of Collaborative Filtering Technology ...

1st IEEE International Conference on Automation, computing and Renewable Systems, ICACRS 2022

作者： Rajasekar, P. Mohanraj, B. Padhi, S.N. Sivakumar, N. Lavanya, J. Charles Prabu, V. Department of Data Science and Business Systems School of Computing SRM Institute of Science and Technology Tamil Nadu Chennai603203 India Department of Information Technology Karpagam College of Engineering Tamil Nadu Coimbatore641032 India Department of Mechanical Engineering Koneru Lakshmaiah Education Foundation Andhra Pradesh Vaddeswaram522302 India Department of Computer Science and Engineering Panimalar Engineering College Chennai City Campus Tamil Nadu Chennai600029 India Department of Fashion Designing SRM Institute of Science and Technology CSH Kattankulathur campus Tamil Nadu Chennai603203 India Department of Computer Science Engineering Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Tamil Nadu Chennai600 062 India

ISBN: (纸本)9781665460842

E-commerce websites and internet purchasing have never been more necessary. Product recommendations are a key tactic employed by online buying platforms. This study compares two different filtering algorithms that are used in product recommendationson websites like Amazon and Flipkart. Reviews of electrical devices, user data, and timestamps were all gathered from Kaggle and put into a dataset. These specifics then undergo several preprocessing steps. The steps are data visualization, duplicate value analysis, missing value analysis, and datatype analysis. The exhibited data is then used to train and test the machine learning models. For this purpose, two machine learning models are developed using two different algorithms. The algorithms K-Nearest Neighbor(KNN) and Support Vector Decomposition (SVD) are employed. The models are then trained to acquire used in the prediction procedure after that. The best models for the prediction process are then determined by scrutinizing the results of both models. The Root Mean Square Error (RMSE), Mean Square Error (MSE), and Mean Absolute Error (MAE) values are located and compared because the findings of the analysis weren't *** erroneous data are plotted into a graph and evaluated to further demonstrate the point. As the SVD method is discovered to be the best of the group, the algorithm's greatest and worst predictions are discovered and examined. Even the poorest model constructed for the study's predictions turned out to be superior to several other prediction algorithms used for product suggestions. This algorithm can be deployed into the backend of any e-commerce website making it more effective. © 2022 IEEE

关键词： Value engineering