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

IEEE SSD International Multi-Conference on Systems, Signals and Devices

作者： Wafa Akermi Nouha Alyaoui Awatef Benfradj Guiloufi Karim Chabir Computer Science and Telecommunications Department Higher Institute of Applied Science and Technology Gafsa University Gafsa Tunisia Laboratory of Modeling Analysis and Control of Systems (MACS) National Engineering School of Gabes (ENIG) Gabes University Gabes Tunisia Departement of Computer Engineering College of Computer Qassim University Buraidh Saudi Ababia

ISBN: (数字)9798331542726

ISBN: (纸本)9798331542733

High node mobility, rapid topology changes provide specific challenges for vehicular ad hoc networks (VANETs), which have an immediate impact on the routing protocols' performance. Traditional approaches, like the Optimized Link State Routing (OLSR) protocol, provide proactive route management but fail to fully account for critical dynamic parameters like link stability, relative vehicle speed, node distance, and bandwidth availability. This work proposes a hybrid method combining OLSR with Q-learning to facilitate real-time adaptive routing. The model leverages dynamic metrics to proactively evaluate links while employing Q-learning to optimize routing decisions based on rewards computed from performance factors like delay, packet loss rate, and link duration. Simulation results demonstrate that our approach significantly outperforms classic OLSR. The improvements include reduced packet loss rates, increased average throughput, lower average latency, and a reduction in control overhead. These findings confirm that integrating dynamic metrics and adaptive learning effectively addresses the challenges posed by VANETs.

关键词： Q-learning Simulation Vehicular ad hoc networks Packet loss Routing Throughput Routing protocols Stability analysis Topology Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

SensoryT5: Infusing Sensorimotor Norms into T5 for Enhanced Fine-grained Emotion Classification

arXiv

引用

arXiv 2024年

作者： Xia, Yuhan Zhao, Qingqing Long, Yunfei Xu, Ge Wang, Jia School of Computer Science and Electronic Engineering University of Essex United Kingdom Institute of Linguistics Chinese Academy of Social Sciences China College of Computer and Control Engineering Minjiang University China Department of Intelligent Science Xi’an Jiaotong-Liverpool University China

In traditional research approaches, sensory perception and emotion classification have traditionally been considered separate domains. Yet, the significant influence of sensory experiences on emotional responses is undeniable. The natural language processing (NLP) community has often missed the opportunity to merge sensory knowledge with emotion classification. To address this gap, we propose SensoryT5, a neuro-cognitive approach that integrates sensory information into the T5 (Text-to-Text Transfer Transformer) model, designed specifically for fine-grained emotion classification. This methodology incorporates sensory cues into the T5’s attention mechanism, enabling a harmonious balance between contextual understanding and sensory awareness. The resulting model amplifies the richness of emotional representations. In rigorous tests across various detailed emotion classification datasets, SensoryT5 showcases improved performance, surpassing both the foundational T5 model and current state-of-the-art works. Notably, SensoryT5’s success signifies a pivotal change in the NLP domain, highlighting the potential influence of neuro-cognitive data in refining machine learning models’ emotional sensitivity. © 2024, CC BY-SA.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

A public data-set for synchronous motor electrical faults diagnosis with CNN and LSTM reference classifiers

引用

Energy and AI 2023年第4期14卷 221-237页

作者： Zhenglong Sun Ram Machlev Qianchao Wang Juri Belikov Yoash Levron Dmitry Baimel Key Laboratory of Modern Power System Simulation and Control&Renewable Energy Technology Ministry of Education(Northeast Electric Power University)JilinChina The Andrew and Erna Viterbi Faculty of Electrical&Computer Engineering Technion-Israel Institute of TechnologyHaifa 3200003Israel Key Laboratory of Energy Thermal Conversion and Control of Ministry of Education School of Energy and EnvironmentSoutheast UniversityNanjing210096China Department of Software Science Tallinn University of TechnologyAkadeemia tee 15a12618 TallinnEstonia Department of Electrical and Electronics Engineering Sami Shamoon College of EngineeringBeer-Sheva84100Israel

In the last two decades,motor operation monitoring tools have become a necessity,and many studies focus on the detection and diagnosis of motor electrical ***,at present,a core obstacle that prevents the direct comparison of such classification techniques is the lack of a standard database that can be used as a *** view of this,we offer here a public experimental data-set that has beendesigned specifically for the comparison of synchronous motor electrical fault *** data-set comprises five types of motor electrical faults:open phase between inverter and motor;short circuit/leakage current between two phases;short circuit/leakage current in phase-to-neutral;rotor excitation voltage disconnection;and variation of rotor excitation *** addition,each fault has been recorded as a four-dimensional signal:three phase voltages;three phase currents;motor speed;and motor *** package includes two deep-learning reference classifiers that are based on a convolutional neural network(CNN)and long short term memory(LSTM).Due to the good performance of these classifiers,we suggest that they can be used by the community as benchmarks for the development of new and better motor electrical fault classification *** database and the reference classifiers are examined and insights regarding different combinations of features and lengths of recording points are *** developed code is available online,and is free to use.

关键词： Motor faults Synchronous motors Public data-set Classification Deep-learning CNN LSTM

来源：评论

学校读者我要写书评

暂无评论

FISS GAN:A Generative Adversarial Network for Foggy Image Semantic Segmentation

引用

IEEE/CAA Journal of Automatica Sinica 2021年第8期8卷 1428-1439页

作者： Kunhua Liu Zihao Ye Hongyan Guo Dongpu Cao Long Chen Fei-Yue Wang School of Computer Science and Engineering Sun Yat-sen UniversityGuangzhou 510006China State Key Laboratory of Automotive Simulation and Control and the Department of Control Science and Engineering Jilin University(Campus Nanling)Changchun 130025China Mechanical and Mechatronics Engineering Department at the University of Waterloo 200 University Avenue West WaterlooON N2L 3G1Canada State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190 Institute of Systems Engineering Macao University of Science and TechnologyMacao 999078China

Because pixel values of foggy images are irregularly higher than those of images captured in normal weather(clear images),it is difficult to extract and express their *** method has previously been developed to directly explore the relationship between foggy images and semantic segmentation *** investigated this relationship and propose a generative adversarial network(GAN)for foggy image semantic segmentation(FISS GAN),which contains two parts:an edge GAN and a semantic segmentation *** edge GAN is designed to generate edge information from foggy images to provide auxiliary information to the semantic segmentation *** semantic segmentation GAN is designed to extract and express the texture of foggy images and generate semantic segmentation *** on foggy cityscapes datasets and foggy driving datasets indicated that FISS GAN achieved state-of-the-art performance.

关键词： Edge GAN foggy images foggy image semantic segmentation GAN semantic segmentation

来源：评论

学校读者我要写书评

暂无评论

Risk-Averse Learning with Delayed feedback

arXiv

引用

arXiv 2024年

作者： Wang, Siyi Wang, Zifan Johansson, Karl H. Hirche, Sandra Department of Electrical and Computer Engineering Technical University of Munich Munich80333 Germany Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm10044 Sweden

In real-world scenarios, the impacts of decisions may not manifest immediately. Taking these delays into account facilitates accurate assessment and management of risk in real-world environments, thereby ensuring the efficacy of strategies. In this paper, we investigate risk-averse learning using Conditional Value at Risk (CVaR) as risk measure, while incorporating delayed feedback with unknown but bounded delays. We develop two risk-averse learning algorithms that rely on one-point and two-point zeroth-order optimization approaches, respectively. The regret achieved by the algorithms is analyzed in terms of the cumulative delay and the number of total samplings. The results suggest that the two-point risk-averse learning achieves a smaller regret bound than the one-point algorithm. Furthermore, the one-point risk-averse learning algorithm attains sublinear regret under certain delay conditions, and the two-point risk-averse learning algorithm achieves sublinear regret with minimal restrictions on the delay. We provide numerical experiments on a dynamic pricing problem to demonstrate the performance of the proposed algorithms. © 2024, CC0.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

An Erasure-Coded Data Update Method for Distributed Storage Clusters

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2022年第11期59卷 2451-2466页

作者： Zhang, Zilin Liu, Duo Tan, Yujuan Wu, Yu Luo, Longpan Wang, Weilüe Qiao, Lei College of Computer Science Chongqing University Chongqing400044 China Beijing Institute of Control Engineering Beijing100080 China

Erasure coding is widely deployed in distributed storage clusters to provide data reliability, but the disk I/O overhead becomes a performance bottleneck when data updates are intensive. On the one hand, traditional data update strategies need to read the original data chunk, and then write new data when updating the data chunk. In the case of intensive updates, frequent write-after-read seriously affects the write performance of the storage clusters. On the other hand, the operations of updating the parity chunk include reading the increments randomly distributed in the log file and merging them with the data file, which also introduces additional disk seek overhead. In this paper, a data updating method, named PARD (parity logging with reserved space and data delta), is proposed to solve these problems. The main idea of PARD is to use the linear calculations of erasure coding to reduce write-after-read, and take advantage of the disk characteristics to reduce the disk seek overhead. PARD comprises three key design features: 1) Adopting in-place data updates and log-based parity updates. 2) Taking advantage of the linear calculations of erasure coding to construct the log based on data increments. For a series of write requests to the same data chunk, only the first update needs to read the original data chunk, and the subsequent update executes the pure write, which remarkably reduces the write-after-read. 3) According to the characteristics of disk, reserving space for the log at the end of data file to reduce the disk seek overhead of reading and writing log. Experiments show that when the chunk size is 4 MB, PARD gains at least, 30.4%, 47.0% and 82.0% improvements in update throughput compared with PLR, PARIX, and FO, respectively. © 2022, science Press. All right reserved.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Convergent Approaches to AI Explainability for HEP Muonic Particles Pattern Recognition

引用

Computing and Software for Big science 2023年第1期7卷 1-18页

作者： Maglianella, Leandro Nicoletti, Lorenzo Giagu, Stefano Napoli, Christian Scardapane, Simone Department of Computer Control and Management Engineering Antonio Ruberti Sapienza University of Rome Rome Italy Department of Physics Sapienza University of Rome Rome Italy Institute for Systems Analysis and Computer Science Italian National Research Council Rome Italy Department of Computational Intelligence Electronics and Telecommunications Czestochowa University of Technology Czestochowa Poland Department of Information Engineering Electronics and Telecommunications Sapienza University of Rome Rome Italy

Neural networks are commonly defined as ‘black-box’ models, meaning that the mechanism describing how they give predictions and perform decisions is not immediately clear or even understandable by humans. Therefore, Explainable Artificial Intelligence (xAI) aims at overcoming such limitation by providing explanations to Machine Learning (ML) algorithms and, consequently, making their outcomes reliable for users. However, different xAI methods may provide different explanations, both from a quantitative and a qualitative point of view, and the heterogeneity of approaches makes it difficult for a domain expert to select and interpret their result. In this work, we consider this issue in the context of a high-energy physics (HEP) use-case concerning muonic motion. In particular, we explored an array of xAI methods based on different approaches, and we tested their capabilities in our use-case. As a result, we obtained an array of potentially easy-to-understand and human-readable explanations of models’ predictions, and for each of them we describe strengths and drawbacks in this particular scenario, providing an interesting atlas on the convergent application of multiple xAI algorithms in a realistic context. © 2023, The Author(s).

关键词： Explainable Artificial Intelligence High-energy physics Intrinsically interpretable Decision Trees Saliency maps methods Tracing gradient descent

来源：评论

学校读者我要写书评

暂无评论

Research on the Characteristics and Security Risks of the Internet of Vehicles Data 7

Research on the Characteristics and Security Risks of the In...

引用

7th IEEE International Conference on Data science in Cyberspace, DSC 2022

作者： Sun, Jun Liu, Dong Liu, Yang Li, Chuang Ma, Yumeng Institute of Network Security Inspection and Evaluation China Industrial Control System Cyber Emergency Response Team Beijing China University of Electronic Science and Technology of China School of Computer Science and Engineering Szechwan China

ISBN: (数字)9781665474801

ISBN: (纸本)9781665474801

As a new industry integrated by computing, communication, networking, electronics, and automation technology, the Internet of Vehicles (IoV) has been widely concerned and highly valued at home and abroad. With the rapid growth of the number of intelligent connected vehicles, the data security risks of the IoV have become increasingly prominent, and various attacks on data security emerge in an endless stream. This paper firstly introduces the latest progress on the data security policies, regulations, standards, technical routes in major countries and regions, and international standardization organizations. Secondly, the characteristics of the IoV data are comprehensively analyzed in terms of quantity, standard, timeliness, type, and cross-border transmission. Based on the characteristics, this paper elaborates the security risks such as privacy data disclosure, inadequate access control, lack of identity authentication, transmission design defects, cross-border flow security risks, excessive collection and abuse, source identification, and blame determination. And finally, we put forward the measures and suggestions for the security development of IoV data in China. © 2022 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Rethinking guidance information to utilize unlabeled samples: a label encoding perspective 24

Rethinking guidance information to utilize unlabeled samples...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Yulong Zhang Yuan Yao Shuhao Chen Pengrong Jin Yu Zhang Jian Jin Jiangang Lu Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China and College of Control Science and Engineering Zhejiang University Hangzhou China Beijing Teleinfo Technology Company Ltd. China Academy of Information and Communications Technology Beijing China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Research Institute of Industrial Internet of Things China Academy of Information and Communications Technology Beijing China College of Control Science and Engineering Zhejiang University Hangzhou China

Empirical Risk Minimization (ERM) is fragile in scenarios with insufficient labeled samples. A vanilla extension of ERM to unlabeled samples is Entropy Minimization (EntMin), which employs the soft-labels of unlabeled samples to guide their learning. However, EntMin emphasizes prediction discriminability while neglecting prediction diversity. To alleviate this issue, in this paper, we rethink the guidance information to utilize unlabeled samples. By analyzing the learning objective of ERM, we find that the guidance information for labeled samples in a specific category is the corresponding label encoding. Inspired by this finding, we propose a Label-Encoding Risk Minimization (LERM). It first estimates the label encodings through prediction means of unlabeled samples and then aligns them with their corresponding ground-truth label encodings. As a result, the LERM ensures both prediction discriminability and diversity, and it can be integrated into existing methods as a plugin. Theoretically, we analyze the relationships between LERM and ERM as well as EntMin. Empirically, we verify the superiority of the LERM under several label insufficient scenarios. The codes are available at https://***/zhangyl660/LERM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

3D Point Cloud Semantic Segmentation Based on Diffusion Model

3D Point Cloud Semantic Segmentation Based on Diffusion Mode...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Chang Liu Aimin Jiang Yibin Tang Yanping Zhu Qi Chen College of Information Science and Engineering Hohai University Changzhou China School of Microelectronics and Control Engineering Changzhou University Changzhou China School of Computer Science and Artificial Intelligence Changzhou University Changzhou China

Point cloud segmentation plays a crucial role in extracting unique attributes and separating various objects, thereby enabling semantic comprehension and analysis. In this paper, we introduce a novel point cloud segmentation approach based on Diffusion Probabilistic Network (DDPM). The proposed model treats points as particles undergoing diffusion towards a noise distribution, and a reverse diffusion process transforms this noise distribution into the desired shape. Leveraging a Markov diffusion model in the reverse process enables generating point clouds with more refined and specific topological structures. After the diffusion step, multi-scale sampled features are fused to enhance the discriminative representation of 3D shapes. Objective and subjective experimental results demonstrate that our segmentation method outperforms state-of-the-art techniques in terms of evaluation metrics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：