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

A Reputation-Based AODV Protocol for Blackhole and Malfunction Nodes Detection and Avoidance

computers, Materials & Continua 2024年第8期80卷 1867-1888页

作者： Qussai M.Yaseen Monther Aldwairi Ahmad Manasrah Artificial Intelligence Research Center(AIRC) College of Engineering and Information TechnologyAjman UniversityAjman346United Arab Emirates Department of Computer Information Systems Faculty of Computer and Information TechnologyJordan University of Science and TechnologyIrbid22110Jordan College of Technological Innovation Zayed UniversityAbu Dhabi144534United Arab Emirates Faculty of Information Technology and Computer Science Yarmouk UniversityIrbid21163Jordan Computer Information Systems Higher Colleges of TechnologySharjah341214United Arab Emirates

Enhancing the security of Wireless Sensor Networks(WSNs)improves the usability of their ***,finding solutions to various attacks,such as the blackhole attack,is crucial for the success of WSN *** paper proposes an enhanced version of the AODV(Ad Hoc On-Demand Distance Vector)protocol capable of detecting blackholes and malfunctioning benign nodes in WSNs,thereby avoiding them when delivering *** proposed version employs a network-based reputation system to select the best and most secure path to a *** achieve this goal,the proposed version utilizes the Watchdogs/Pathrater mechanisms in AODV to gather and broadcast reputations to all network nodes to build the network-based reputation *** minimize the network overhead of the proposed approach,the paper uses reputation aggregator nodes only for forwarding reputation ***,to reduce the overhead of updating reputation tables,the paper proposes three mechanisms,which are the prompt broadcast,the regular broadcast,and the light broadcast *** proposed enhanced version has been designed to perform effectively in dynamic environments such as mobile WSNs where nodes,including blackholes,move continuously,which is considered a challenge for other *** the proposed enhanced protocol,a node evaluates the security of different routes to a destination and can select the most secure routing *** paper provides an algorithm that explains the proposed protocol in detail and demonstrates a case study that shows the operations of calculating and updating reputation values when nodes move across different ***,the paper discusses the proposed approach’s overhead analysis to prove the proposed enhancement’s correctness and applicability.

关键词： AODV blackhole malfunction nodes pathrater reputation system wireless sensor networks(WSNs) watchdogs

来源：评论

学校读者我要写书评

暂无评论

Joint View Selection, Multigroup Multicast Beamforming, and DIBR for RIS-Aided Multi-View Videos

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 6376-6393页

作者： Lee, Chi-Han Yang, De-Nian Lee, Guang-Siang Wang, Chih-Hang Liao, Wanjiun National Taiwan University Department of Electrical Engineering Taiwan Academia Sinica Institute of Information Science The Research Center for Information Technology Innovation Taiwan Academia Sinica Research Center for Information Technology Innovation Taiwan National Chung Cheng University Department of Computer Science and Information Engineering Taiwan

The rapid development of multi-view videos (MVV) transmission is an irresistible trend. Concurrently, reconfigurable intelligent surface (RIS)-assisted wireless communication has drawn significant attention. We observe that the view selection based on the base station and the view synthesis based on depth-image-based rendering (DIBR) can effectively reduce power consumption. Therefore, this paper studies the view selection and synthesis for RIS-aided MVV in multigroup multicast beamforming. To deal with this complicated scenario, we investigate a problem, named the joint View selection, Multicast beamforming, and DIBR (JVMD), to minimize the total multicast beamforming power, the view transmission operation power, and view synthesis, subject to quality-of-service (QoS), RIS phase shifts, view selection, and DIBR constraints. Unfortunately, the mathematical model is a complicated mixed discrete-continuous optimization problem. To tackle this challenging problem, we designed an algorithm, named View selection, Beamforming, RIS phase, and DIBR (VBRD) algorithm. First, we deal with the discrete optimization problem of selecting the view. VBRD uses the dual-based approximation methodology to round back a primal's integer solution. Then, in the continuous optimization problem, we apply the alternating optimization (AO) method to determine beamforming, RIS phase, and DIBR. Finally, simulation results show the performance of exploiting view synthesis for RIS-assisted wireless communication. © 2002-2012 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

A Survey on Verification and Validation, Testing and Evaluations of Neurosymbolic Artificial Intelligence

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第8期5卷 3765-3779页

作者： Renkhoff, Justus Feng, Ke Meier-Doernberg, Marc Velasquez, Alvaro Song, Houbing Herbert Department of Information Systems BaltimoreMD21250 United States Embry-Riddle Aeronautical University Department of Electrical Engineering and Computer Science Daytona BeachFL32114 United States University of Colorado Department of Computer Science BoulderCO80309 United States

Neurosymbolic artificial intelligence (AI) is an emerging branch of AI that combines the strengths of symbolic AI and subsymbolic AI. Symbolic AI is based on the idea that intelligence can be represented using semantically meaningful symbolic rules and representations, while deep learning (DL), or sometimes called subsymbolic AI, is based on the idea that intelligence emerges from the collective behavior of artificial neurons that are connected to each other. A major drawback of DL is that it acts as a 'black box,' meaning that predictions are difficult to explain, making the testing & evaluation (T&E) and validation & verification (V&V) processes of a system that uses subsymbolic AI a challenge. Since neurosymbolic AI combines the advantages of both symbolic and subsymbolic AI, this survey explores how neurosymbolic applications can ease the V&V process. This survey considers two taxonomies of neurosymbolic AI, evaluates them, and analyzes which algorithms are commonly used as the symbolic and subsymbolic components in current applications. Additionally, an overview of current techniques for the T&E and V&V processes of these components is provided. Furthermore, it is investigated how the symbolic part is used for T&E and V&V purposes in current neurosymbolic applications. Our research shows that neurosymbolic AI has great potential to ease the T&E and V&V processes of subsymbolic AI by leveraging the possibilities of symbolic AI. Additionally, the applicability of current T&E and V&V methods to neurosymbolic AI is assessed, and how different neurosymbolic architectures can impact these methods is explored. It is found that current T&E and V&V techniques are partly sufficient to test, evaluate, verify, or validate the symbolic and subsymbolic part of neurosymbolic applications independently, while some of them use approaches where current T&E and V&V methods are not applicable by default, and adjustments or even new approaches are needed. Our research shows that th

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Inverse kinematics solution for a six-degree-of-freedom upper limb rehabilitation robot using deep learning models

引用

Neural Computing and Applications 2025年 1-19页

作者： Shah, Muhammad Faizan Khan, Naveed Ahmad Jamwal, Prashant K. Chetty, Girija Goecke, Roland Hussain, Shahid School of Information Technology & Systems University of Canberra Canberra Australia Department of Electrical and Computer Engineering Nazarbayev University Astana Kazakhstan School of Systems and Computing University of New South Wales Canberra Australia

The inverse kinematics problem in serially manipulated upper limb rehabilitation robots implies the usage of the end-effector position to obtain the joint rotation angles. In contrast to the forward kinematics, there are no systematic approaches for solving the inverse kinematics problem. Furthermore, for some morphology of the upper limb rehabilitation robots, the inverse kinematics problem is particularly challenging to solve. Conventional methods to solve the inverse kinematics problem reported in the literature are computationally expensive. In the present work, we propose a deep learning-based model to acquire the joint angles for a given end-effector position. The proposed approach exhibits high efficacy in determining the joint angles for various target positions and can accurately predict the end-effector positions once trained, improving the ability of the upper limb rehabilitation robot to adapt to varying patient needs. Due to its improved capability and effectiveness to track positions, the proposed algorithm lays the foundation for the development of efficient controllers in future. © The Author(s) 2025.

关键词： Inverse kinematics

来源：评论

学校读者我要写书评

暂无评论

Inductive Lottery Ticket Learning for Graph Neural Networks

引用

Journal of computer science & Technology 2024年第6期39卷 1223-1237页

作者： Yong-Duo Sui Xiang Wang Tianlong Chen Meng Wang Xiang-Nan He Tat-Seng Chua School of Data Science University of Science and Technology of ChinaHefei 230027China Department of Electrical and Computer Engineering The University of Texas at AustinAustin 78712U.S.A School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China School of Computing National University of SingaporeSingapore

Graph neural networks (GNNs) have gained increasing popularity, while usually suffering from unaffordable computations for real-world large-scale applications. Hence, pruning GNNs is of great need but largely unexplored. The recent work Unified GNN Sparsification (UGS) studies lottery ticket learning for GNNs, aiming to find a subset of model parameters and graph structures that can best maintain the GNN performance. However, it is tailed for the transductive setting, failing to generalize to unseen graphs, which are common in inductive tasks like graph classification. In this work, we propose a simple and effective learning paradigm, Inductive Co-Pruning of GNNs (ICPG), to endow graph lottery tickets with inductive pruning capacity. To prune the input graphs, we design a predictive model to generate importance scores for each edge based on the input. To prune the model parameters, it views the weight’s magnitude as their importance scores. Then we design an iterative co-pruning strategy to trim the graph edges and GNN weights based on their importance scores. Although it might be strikingly simple, ICPG surpasses the existing pruning method and can be universally applicable in both inductive and transductive learning settings. On 10 graph-classification and two node-classification benchmarks, ICPG achieves the same performance level with 14.26%–43.12% sparsity for graphs and 48.80%–91.41% sparsity for the GNN model.

关键词： lottery ticket hypothesis graph neural networks neural network pruning

来源：评论

学校读者我要写书评

暂无评论

An Optimal DPM Based Energy-Aware Task Scheduling for Performance Enhancement in Embedded MPSoC

引用

computers, Materials & Continua 2023年第1期74卷 2097-2113页

作者： Hamayun Khan Irfan Ud Din Arshad Ali Mohammad Husain Department of Electrical Engineering Faculty of Engineering&Technology Superior University Lahore54000Pakistan Department of Computer Science Faculty of Computer Science&IT Superior University Lahore54000Pakistan Faculty of Computer and Information Systems Islamic University of MadinahAl Madinah Al Munawarah42351Saudi Arabia

Minimizing the energy consumption to increase the life span and performance of multiprocessor system on chip(MPSoC)has become an integral chip design issue for multiprocessor *** performance measurement of computational systems is changing with the advancement in *** to shrinking and smaller chip size power densities onchip are increasing rapidly that increasing chip temperature in multi-core embedded *** operating speed of the device decreases when power consumption reaches a threshold that causes a delay in complementary metal oxide semiconductor(CMOS)circuits because high on-chip temperature adversely affects the life span of the *** this paper an energy-aware dynamic power management technique based on energy aware earliest deadline first(EA-EDF)scheduling is proposed for improving the performance and reliability by reducing energy and power consumption in the system on chip(SOC).Dynamic power management(DPM)enables MPSOC to reduce power and energy consumption by adopting a suitable core configuration for task *** migration avoids peak temperature values in the multicore *** utilization factor(ui)on central processing unit(CPU)core consumes more energy and increases the temperature *** technique switches the core bymigrating such task to a core that has less temperature and is in a low power *** proposed EA-EDF scheduling technique migrates load on different cores to attain stability in temperature among multiple cores of the CPU and optimized the duration of the idle and sleep periods to enable the low-temperature *** effectiveness of the EA-EDF approach reduces the utilization and energy consumption compared to other existing methods and *** simulation results show the improvement in performance by optimizing 4.8%on u_(i) 9%,16%,23%and 25%at 520 MHz operating frequency as compared to other energy-aware techniques for MPSoCs when the least number of tasks is in running state and can

关键词： Dynamic power management dynamic voltage&frequency scaling dynamic thermal management multiprocessor system on chip complementary metal oxide semiconductor reliability

来源：评论

学校读者我要写书评

暂无评论

Data hiding with thumbnail-preserving encryption for cloud medical images

引用

Multimedia Tools and Applications 2024年第36期83卷 84161-84177页

作者： Xu, Shuying Chang, Chin-Chen Horng, Ji-Hwei Department of Information Engineering and Computer Science Feng Chia University Taichung407 Taiwan Department of Electrical Engineering National Quemoy University Kinmen892 Taiwan

To serve a convenient healthcare network, storing medical images and diagnosis records in the cloud is a straightforward solution. Encrypting the medical images before uploading them to the cloud is a trivial strategy to prevent data breaches. However, the availability of images is also reduced. Since all images look noisy, one cannot obtain the intended image by a quick viewing of the file folder. In this paper, we propose a total solution to these considerations. A reversible data hiding scheme based on thumbnail-preserving image encryption is presented. By leveraging a multi-scale Haar wavelet transform and extended run-length coding, we can produce thumbnail-preserving encrypted medical images that provide a sufficient vacating room for embedding electronic patient records. The experimental results demonstrate that our scheme effectively balances the confidentiality and availability of encrypted medical images. It provides over 1 bit per pixel of capacity for embedding electronic patient records, making it suitable for cloud-based medical data management. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Multiplayer Reach-Avoid Differential Games in 3D Space Inspired by Harris'Hawks'Cooperative Hunting Tactics

引用

Research 2024年第2期2023卷 41-54页

作者： Wanying Ruan Haibin Duan Yongbin Sun Wanmai Yuan Jie Xia State Key Laboratory of Virtual Reality Technology and Systems School of Automation Science and Electrical EngineeringBeihang UniversityBeijingChina Peng Cheng Laboratory ShenzhenChina Information Science Academy of CETC BeijingChina

This paper investigates a multiplayer reach-avoid differential game in 3-dimensional(3D)space,which involves multiple pursuers,multiple evaders,and a designated target *** evaders aim to reach the target region,while the pursuers attempt to guard the target region by capturing the *** class of research holds significant practical ***,the complexity of the problem escalates substantially with the growing number of players,rendering its solution extremely *** this paper,the multiplayer game is divided into many subgames considering the cooperation among pursuers,reducing the computational burden,and obtaining numerically tractable strategies for ***,the Apollonius sphere,a fundamental geometric tool for analyzing the 3D differential game,is formulated,and its properties are *** on this,the optimal interception point for the pursuer to capture the evader is derived and the winning conditions for the pursuer and evader are ***,based on the Apollonius sphere,the optimal state feedback strategies of players are designed,and simultaneously,the optimal one-to-one pairings are ***,the Value function of the multiplayer reach-avoid differential game is explicitly given and is proved to satisfy Hamilton-Jacobi-Isaacs(HJI)***,the matching algorithm for the case with pursuers outnumbered evaders is provided through constructing a weighted bipartite graph,and the cooperative tactics for multiple pursuers are proposed,inspired by the Harris'Hawks intelligent cooperative hunting ***,numerical simulations are conducted to illustrate the effectiveness of the theoretical results for both cases where the number of adversary players is equal and unequal between the 2 groups.

关键词： holds satisfy rendering

来源：评论

学校读者我要写书评

暂无评论

A new speaker-diarization technology with denoising spectral-LSTM for online automatic multi-dialogue recording

引用

Multimedia Tools and Applications 2024年第15期83卷 45407-45422页

作者： Chan, Din Yuen Wang, Jhing-Fa Chin, Hsu-Ting Department of Computer Science and Information Engineering National Chiayi University Chiayi City Taiwan Department of Electrical Engineering National Cheng Kung University Tainan Taiwan

In AI pandemic applications, the online automatic AI recording apparatus for official councils such as court trials, business conferences and commercial meetings will become imperative because it could let the opinion identification and consensus of participants be synchronically available to implicitly diminish social costs such as follow-up disputes and controversies. Hence, in this study, an automatic on-line multi-dialogue recording system is completely constructed, where the unbounded interleaved-state recurrent neural networks (UIS-RNN) with proposed crux improvements is exploited to achieve confident speaker-diarization. For keeping the systematic robustness, a denoising spectral-LSTM, which is precisely modified from the dual-signal transformation LSTM (DTLN), can strengthen its subsequent crux-improved UIS-RNN and automatic speech recognition (ASR). Finally, the MacBERT model is set to rectify the possible wrong words in conversed sentences according to the learned rational context. For making our system being a practical software apparatus in the use of unmarked multi-person councils, we have also completed the convenient interfaces for the operations of ASR and speaker-diarization, which can exhibit on-line denoising efficacy and speaker-diarization results as well as offer real-time hand-crafted rectifications to common users. In extensive experiments, the proposed recording system can promise high accuracy rates of online speaker diarization and speech-separated ASR. Our proposed system had been examined by the cooperated law court staffs, who offered the noise-embedded speeches of practical court field to test our system. Since the tight recording burden had been indeed noticeably alleviated in their legal-action councils, the court staffs had endorsed that the proposed entire system could be a friendly labor-saving AI apparatus for on-line automatic multi-dialogue recording. © The Author(s), under exclusive licence to Springer science+Business Media,

关键词： Audio recordings

来源：评论

学校读者我要写书评

暂无评论

Class-conditional domain adaptation for semantic segmentation

引用

Computational Visual Media 2024年第5期10卷 1013-1030页

作者： Yue Wang Yuke Li James H.Elder Runmin Wu Huchuan Lu School of Information and Communication Engineering Dalian University of TechnologyDalian 116024China School of Computer Science Wuhan UniversityWuhan 430072China Department of Electrical Engineering and Computer Science York UniversityToronto M3J 1P3Canada Department of Computer Science the University of Hong KongHong Kong 999077China

Semantic segmentation is an important sub-task for many ***,pixel-level ground-truth labeling is costly,and there is a tendency to overfit to training data,thereby limiting the generalization *** domain adaptation can potentially address these problems by allowing systems trained on labelled datasets from the source domain(including less expensive synthetic domain)to be adapted to a novel target *** conventional approach involves automatic extraction and alignment of the representations of source and target domains *** limitation of this approach is that it tends to neglect the differences between classes:representations of certain classes can be more easily extracted and aligned between the source and target domains than others,limiting the adaptation over all ***,we address:this problem by introducing a Class-Conditional Domain Adaptation(CCDA)*** incorporates a class-conditional multi-scale discriminator and class-conditional losses for both segmentation and ***,they measure the segmentation,shift the domain in a classconditional manner,and equalize the loss over *** results demonstrate that the performance of our CCDA method matches,and in some cases,surpasses that of state-of-the-art methods.

关键词： domain adaptation generative adversarial networks semantic segmentation cityscapes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：