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

IEEE Conference on Vehicular Technology (VTC)

作者： Nguyen Thi Thanh Van Nguyen Cong Luong Feng Shaohan Shimin Gong Dusit Niyato Dong In Kim Faculty of Computer Science PHENIKAA University Hanoi Vietnam School of Information and Electronic Engineering Zhejiang Gongshang University Hangzhou China School of Intelligent Systems Engineering Sun Yat-sen University Guangzhou China College of Computing and Data Sciene Nanyang Technological University Singapore Department of Electrical and Computer Engineering Sungkyunkwan University Suwon South Korea

ISBN: (数字)9798350387414

ISBN: (纸本)9798350387421

In this paper, we propose a simultaneous wire-less information and power transfer (SWIPT)-enabled Ad hoc network underlay rate-splitting multiple access (RSMA)-based system with intelligent reflecting surface (IRS). Therein, a base station (BS) in a primary network uses RSMA to serve primary users (PUs), and secondary user (SU) pairs constitute an Ad hoc network sharing the spectrum with the primary network. The power splitting (PS)-based SWIPT protocol is used in the Ad hoc network that allow the SU receivers to decode the information and harvest energy simultaneously. An IRS is deployed to further enhance the system performance. We formulate optimization problems that optimize the common data rate allocation and beamformers associated with the common and private messages of RSMA, the beamformers and the PS factor in the Ad hoc network, and reflection coefficients of the IRS to maximize the minimum rate of the PUs while satisfying the requirements of harvested energy and data rate of the SU pairs. The optimization problems are non-convex and challenging to be solved. We propose a low complexity algorithm based on alternating descent techniques. Numerical results demonstrate the effectiveness and improvement of the proposed framework compared with the framework based on existing multiple access schemes, i.e., non-orthogonal multiple access (NOMA).

关键词： Cellular networks NOMA Vehicular and wireless technologies System performance Simulation Throughput Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A Novel Multi-layered Minutiae Extractor Based on OCT Fingerprints 16th

A Novel Multi-layered Minutiae Extractor Based on OCT Finge...

引用

16th Chinese Conference on Biometric Recognition, CCBR 2022

作者： Zeng, Wenfeng Zhang, Wentian Liu, Feng Tan, Xu Li, Qin College of Computer Science and Software Engineering Shenzhen University Shenzhen China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Senzhen China The National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Software Engineering Shenzhen Institute of Information Technology Shenzhen China

ISBN: (纸本)9783031202322

Fingerprints of Optical Coherence Tomography (OCT) imaging provide 3D volume data which have the nature property of multi-layered tissue structure. This paper, for the first time, attempts to extract minutiae for OCT-based fingerprint by making full use of the merits multi-layered structure of OCT imaging and powerful convolution al neural network (CNN). In particular, a novel multi-layered feature fusion minutiae extraction network is proposed, involving a multi-layered feature extractor to integrate the rich information of multiple subsurface fingerprints, and a two-stage object detection framework using reweighted concatenation feature to detect minutiae points. Compared with the results achieved by typical traditional and learning-based methods, our method outperforms the best one by about 2% of F1-score in minutiae extraction, and achieves the improvement of 0.09% than the best one in matching performance, which further demonstrate the effectiveness and robustness of our proposed method. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Optical tomography

来源：评论

学校读者我要写书评

暂无评论

Active Legibility in Multiagent Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Liu, Yanyu Pan, Yinghui Zeng, Yifeng Ma, Biyang Prashant, Doshi School of Automation Central South University No.605 South Lushan Road Hunan Changsha410083 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen China Department of Computer and Information Sciences Northumbria University Newcastle United Kingdom School of Computer Science Minnan Normal University Fujian Zhangzhou China Department of Computer Science University of Georgia AthensGA United States

A multiagent sequential decision problem has been seen in many critical applications including urban transportation, autonomous driving cars, military operations, etc. Its widely known solution, namely multiagent reinforcement learning, has evolved tremendously in recent years. Among them, the solution paradigm of modeling other agents attracts our interest, which is different from traditional value decomposition or communication mechanisms. It enables agents to understand and anticipate others’ behaviors and facilitates their collaboration. Inspired by recent research on the legibility that allows agents to reveal their intentions through their behavior, we propose a multiagent active legibility framework to improve their performance. The legibility-oriented framework allows agents to conduct legible actions so as to help others optimise their behaviors. In addition, we design a series of problem domains that emulate a common scenario and best characterize the legibility in multiagent reinforcement learning. The experimental results demonstrate that the new framework is more efficient and costs less training time compared to several multiagent reinforcement learning algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Delayed Memory unit: Modelling Temporal Dependency Through Delay Gate

arXiv

引用

arXiv 2023年

作者： Sun, Pengfei Wu, Jibin Zhang, Malu Devos, Paul Botteldooren, Dick Department of Information Technology WAVES Research Group Ghent University Technologiepark Zwijnaarde 126 Ghent9052 Belgium Department of Data Science and Artificial Intelligence The Department of Computing The Hong Kong Polytechnic University Hong Kong School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu610054 China

Recurrent Neural Networks (RNNs) are widely recognized for their proficiency in modeling temporal dependencies, making them highly prevalent in sequential data processing applications. Nevertheless, vanilla RNNs are confronted with the well-known issue of gradient vanishing and exploding, posing a significant challenge for learning and establishing long-range dependencies. Additionally, gated RNNs tend to be over-parameterized, resulting in poor computational efficiency and network generalization. To address these challenges, this paper proposes a novel Delayed Memory unit (DMU). The DMU incorporates a delay line structure along with delay gates into vanilla RNN, thereby enhancing temporal interaction and facilitating temporal credit assignment. Specifically, the DMU is designed to directly distribute the input information to the optimal time instant in the future, rather than aggregating and redistributing it over time through intricate network dynamics. Our proposed DMU demonstrates superior temporal modeling capabilities across a broad range of sequential modeling tasks, utilizing considerably fewer parameters than other state-of-the-art gated RNN models in applications such as speech recognition, radar gesture recognition, ECG waveform segmentation, and permuted sequential image classification. Copyright © 2023, The Authors. All rights reserved.

关键词： Gesture recognition

来源：评论

学校读者我要写书评

暂无评论

Improvement of Low-Contrast Objective Detecting Capability for YOLOv5 Based on Receptive Field Enhancement and Redundant Feature Reuse

Improvement of Low-Contrast Objective Detecting Capability f...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Qingyu Xu Jiguo Yu Anming Dong Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China School of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Big Data Institute Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

YOLOv5s is a classic deep learning target detection framework with balanced speed and performance in recognition, which is widely used in industrial defect inspections. YOLOv5s relies on the residual structure in the C3 module for feature extraction, but due to its simple structure and the small, fixed convolution kernel, it is difficult to accurately and completely extract target features when applied to the detection of defects with inconspicuous features and irregular shapes, which results in a decrease in recognition accuracy. To solve this problem, this paper proposes an improved YOLO architecture based on receptive field enhancement and redundant feature reuse. Firstly, the method designs a redundant feature reuse module (RFRM) to replace the residual structure in the C3 module for feature extraction. This module can deepen the network with a smaller cost and enhance the network’s ability to extract features. Furthermore, the feature reuse process allows the network to deepen while retaining detailed information, enabling the network to classify and localize more accurately. Secondly, a simplified convolutional block attention module (SCBAM) is designed and embedded into the neck of the detection network. This module directs the detection network to focus more on inconspicuous defect features and reduce interference from background noise in the feature map, thereby improving the accuracy of defect classification and localization. Finally, a receptive field enhancement module (RFEM) is designed and inserted between the neck and head of the detection network. This module adds only a small computational cost to expand the receptive field of the network, enabling it to further extract and comb irregular features from the neck in a comprehensive manner, making the features reaching the detection head more complete. Applying the above improvements to defect detection, the experimental results show that the improved YOLO architecture based on receptive field enhancem

关键词： YOLO Head Accuracy Target recognition Shape computer architecture Feature extraction

来源：评论

学校读者我要写书评

暂无评论

An Efficient Dimensionality Reduction Techniques to data data Visualization

An Efficient Dimensionality Reduction Techniques to Data Dat...

引用

Advances in computing, Communication and Applied Informatics (ACCAI), International Conference on

作者： R. Sasikala P. Sakthi K. Agalya U. Vidhya M. Karthik R. Nareshkumar Department of Artificial Intelligence and Data Science CARE College of Engineering Trichy Department of Information Technology SRM Valliammai Engineering College Chennai Tamil Nadu India Department of Computer Science and Engineering Sri Eshwar College of Engineering Coimbatore Department Of Information Technology Indra Ganesan College of Engineering Tiruchirappalli Department of Computer Science and Engineering K. Ramakrishnan College of Technology Trichy Tamilnadu India Department of Networking and Communications School of Computing College of Engineering and Technology SRM Institute of Science and Technology Kattankulathur Tamilnadu India

ISBN: (数字)9798350389449

ISBN: (纸本)9798350389456

The aim of this paper, is to gain insights in to dynamics of Kabaddi. This sport has become increasingly popular, by analyzing teams’ performance in national leagues. To do so, the results of each round of matches the participating teams play are used to create a dissimilarity matrix. This matrix is then processed through two algorithms, A visualization of the outcomes of each team was achieved by the utilization of novel dimensionality techniques. This novel approach for dimensionality reduction enables the teams’ performance to be represented in a lower-dimensional manner, facilitating the visualization of complex data connections. The t-SNE algorithm, on the other hand, captures the non-linear relationships in the teams’ performance. This study attempts to discover crucial characteristics that impact team performance and give a greater knowledge of the dynamics of the sport by comparing the findings acquired using a novel dimensionality reduction technique. The data for this study comes from the Kabaddi season that took place during 2017-2018.

关键词： Dimensionality reduction Training Fans Heuristic algorithms data visualization Games Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Feature selection and importance of predictors of non-communicable diseases medication adherence from machine learning research perspectives

引用

Informatics in Medicine Unlocked 2023年 38卷

作者： Kanyongo, Wellington Ezugwu, Absalom E. Department of Computer Science Faculty of Science Engineering Bindura University of Science Education Bindura 0771 603 900 Zimbabwe School of Mathematics Statistics and Computer Science University of KwaZulu-Natal Pietermaritzburg Campus Pietermaritzburg 3201 South Africa Unit for Data Science and Computing North-West University 11 Hoffman Street Potchefstroom 2520 South Africa

Medication nonadherence is a significant public health concern that leads to ineffective treatment, which in turn engenders complications such as increased morbidity risks, unnecessary hospitalisations, and premature mortality. Technologies of the Fourth Industrial Revolution, such as machine learning, provide breakthroughs in identifying the most important features for building predictive models of medication adherence. Due to the diversity and complexity of medication adherence, it is crucial to leverage machine learning to determine significant medication adherence factors. This study systematically reviewed articles exhibiting feature selection and feature importance in research utilising machine learning to analyse medication adherence among Non-communicable diseases (NCD) patients. The articles were retrieved using Google Scholar, Research4Life, IEEE Xplore, and PubMed. The requirements for inclusion were met by 27 papers published between 2010 and 2022. The publications reviewed incorporate machine learning while also demonstrating feature selection and the importance of predictors of medication adherence in NCD patients with hypertension (n = 6), cardiovascular diseases (n = 6), diabetes (n = 4), opioid use disorder (n = 3), and other NCDs (n = 8). The findings demonstrate that medication adherence is a multifactorial issue influenced by various features such as sociodemographic and economic characteristics, medication information, behavioural, disease-related, and healthcare system-related factors. Some of these features, such as the patient's age, gender and race, cannot be modified. Once the patients with nonmodifiable features have been identified, they must be proactively monitored for medication adherence. On the other hand, adjustable risk features, such as self-efficacy and medication knowledge, can be modified and improved through medication education or medication adherence awareness. Various techniques for selecting and ranking features have emerg

关键词： Chronic disease Feature importance Feature selection (FS) Machine learning (ML) Medication adherence (MA) Non-communicable disease (NCD) Predictors of MA

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-Aware Pedestrian Trajectory Prediction via Distributional Diffusion

arXiv

引用

arXiv 2023年

作者： Liu, Yao Ye, Zesheng Wang, Rui Li, Binghao Sheng, Quan Z. Yao, Lina School of Computing Macquarie University Sydney Australia School of Computer Science and Engineering University of New South Wales Sydney Australia College of Information Science and Engineering Northeastern University Shenyang China School of Minerals and Energy Resources Engineering University of New South Wales Sydney Australia Data 61 CSIRO Sydney Australia

Tremendous efforts have been put forth on predicting pedestrian trajectory with generative models to accommodate uncertainty and multi-modality in human behaviors. An individual’s inherent uncertainty, e.g., change of destination, can be masked by complex patterns resulting from the movements of interacting pedestrians. However, latent variable-based generative models often entangle such uncertainty with complexity, leading to limited either latent expressivity or predictive diversity. In this work, we propose to separately model these two factors by implicitly deriving a flexible latent representation to capture intricate pedestrian movements, while integrating predictive uncertainty of individuals with explicit bivariate Gaussian mixture densities over their future locations. More specifically, we present a model-agnostic uncertainty-aware pedestrian trajectory prediction framework, parameterizing sufficient statistics for the mixture of Gaussians that jointly comprise the multi-modal trajectories. We further estimate these parameters of interest by approximating a denoising process that progressively recovers pedestrian movements from noise. Unlike previous studies, we translate the predictive stochasticity to explicit distributions, allowing it to readily generate plausible future trajectories indicating individuals’ self-uncertainty. Moreover, our framework is compatible with different neural net architectures. We empirically show the performance gains over state-of-the-art even with lighter backbones, across most scenes on two public benchmarks. Copyright © 2023, The Authors. All rights reserved.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Efficient Sampling Algorithms for Approximate Motif Counting in Temporal Graph Streams

arXiv

引用

arXiv 2022年

作者： Wang, Jingjing Wang, Yanhao Jiang, Wenjun Li, Yuchen Tan, Kian-Lee Department of Mathematics and Computer Science Changsha University Changsha China School of Data Science and Engineering East China Normal University Shanghai China College of Computer Science and Electronic Engineering Hunan University Changsha China School of Computing and Information Systems Singapore Management University Singapore Singapore School of Computing National University of Singapore Singapore Singapore

A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of a set of vertices and a series of timestamped and directed edges. Temporal motifs in temporal graphs are generalized from subgraph patterns in static graphs which take into account edge orderings and durations in addition to topologies. Counting the number of occurrences of temporal motifs is a fundamental problem for temporal network analysis. However, existing methods either cannot support temporal motifs or suffer from performance issues. Moreover, they cannot work in the streaming model where edges in a temporal graph are observed incrementally over time. In this paper, we focus on approximate temporal motif counting via random sampling. We first propose two sampling algorithms for approximate temporal motif counting in the offline setting, where the whole temporal graph is available in advance and can be kept in main memory. The first is a generic edge sampling (ES) algorithm for estimating the number of instances of any temporal motif and the second is an improved edge-wedge sampling (EWS) algorithm that hybridizes edge sampling with wedge sampling for counting temporal motifs with 3 vertices and 3 edges. Furthermore, we propose two algorithms to count temporal motifs incrementally in temporal graph streams by extending the ES and EWS algorithms, which are referred to as the SES and SEWS algorithms, respectively. We provide comprehensive analyses of the theoretical bounds and complexities of our proposed algorithms. Finally, we perform extensive experimental evaluation of our proposed algorithms on several real-world temporal graphs. The results show that ES and EWS have higher efficiency, better accuracy, and greater scalability than state-of-the-art sampling methods for temporal motif counting in the offline setting. What is more, SES and SEWS further achieve up to three orders of

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

DeFusion: An Effective Decoupling Fusion Network for Multi-Modal Pregnancy Prediction

arXiv

引用

arXiv 2025年

作者： Ouyang, Xueqiang Wei, Jia Huo, Wenjie Wang, Xiaocong Li, Rui Zhou, Jianlong School of Computer Science and Engineering South China University of Technology Guangzhou China Department of Obstetrics and Gynecology Nanfang Hospital Southern Medical University Guangzhou China Golisano College of Computing and Information Sciences Rochester Institute of Technology RochesterNY14623 United States UTS Data Science Institute University of Technology Sydney UltimoNSW2007 Australia

Temporal embryo images and parental fertility table indicators are both valuable for pregnancy prediction in in vitro fertilization embryo transfer (IVF-ET). However, current machine learning models cannot make full use of the complementary information between the two modalities to improve pregnancy prediction performance. In this paper, we propose a Decoupling Fusion Network called DeFusion to effectively integrate the multi-modal information for IVF-ET pregnancy prediction. Specifically, we propose a decoupling fusion module that decouples the information from the different modalities into related and unrelated information, thereby achieving a more delicate fusion. And we fuse temporal embryo images with a spatial-temporal position encoding, and extract fertility table indicator information with a table transformer. To evaluate the effectiveness of our model, we use a new dataset including 4046 cases collected from Southern Medical University. The experiments show that our model outperforms state-of-the-art methods. Meanwhile, the performance on the eye disease prediction dataset reflects the model's good generalization. Our code and dataset are available at https://***/Ou-Young-1999/DFNet. Copyright © 2025, The Authors. All rights reserved.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：