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

A Clustering-Based Routing Protocol Using Path Pattern Discovery Method to Minimize Delay in VANET

Wireless Communications and Mobile Computing 2023年第1期2023卷

作者： Xie, Xiaoyun Navaei, Yahya Dorostkar Einy, Sajad School of Electronic Information Engineering Gannan University of Science and Technology Jiangxi Ganzhou341000 China Ganzhou Key Laboratory of Cloud Computing and Big Data Jiangxi Ganzhou341000 China Computer and Information Technology Engineering Qazvin Branch Islamic Azad University Qazvin Iran Istanbul Aydin University Department of Application and Research Center for Advanced Studies Istanbul Turkey

In vehicular ad hoc networks (VANETs), vehicle-to-vehicle (V2V) communications can link vehicles to each other, and vehicle-to-infrastructure (V2I) messaging and communications can link roadside infrastructure such as routers. The vehicles in these networks act as relays that transmit critical messages in the network. Due to the high-speed movement of vehicles on the road, real-time messaging and minimizing the delay in sending messages is one of the most important objectives of VANET developers. On the other hand, the high mobility of vehicles causes communication interruptions and decreases the data delivery rate in VANET. To overcome this issue, predicting the path of vehicles can play an important role in sending data from the source to the destination. When an accident occurs on the road, the messages that are sensed by the imbedded sensors in the vehicles need to be sent, and if they are sent by the vehicles that change their route, these messages will not be sent to the destination and the performance of the network will be disturbed. Previous methods in the literature for data transmission in intervehicular networks have focused more on reliability and trust, and little attention has been paid to the prediction of vehicle movement paths in these types of networks. Therefore, for fast and reliable data transmission in VANET, accurate prediction of vehicle movement and creation of movement patterns can be effective in message transmission delay and data delivery rate. In this paper, we present an approach using a combination of cluster-based routing protocols and pattern discovery methods to minimize latency in VANETs. The outline of the proposed method has four modules: primary data collection and analysis, primary data preparation and analysis, pattern extraction and vehicle route discovery, and vehicle clustering and data/information transmission routing. The simulation results show that the proposed method with a delivery rate of 88.56% has significantly i

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Multimodal Subspace Independent Vector Analysis Better Captures Hidden Relationships in Multimodal Neuroimaging data

Multimodal Subspace Independent Vector Analysis Better Captu...

引用

IEEE International Symposium on Biomedical Imaging

作者： Xinhui Li Tulay Adali Rogers F. Silva Vince D. Calhoun Tri-Institutional Center for Translational Research in Neuroimaging and Data Science (TReNDS) Georgia State University Georgia Institute of Technology and Emory University Atlanta GA USA Department of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA Department of Computer Science and Electrical Engineering University of Maryland Baltimore County Baltimore MD USA

We introduce multimodal subspace independent vector analysis (MSIVA), a methodology to capture both joint and unique latent sources across data modalities by defining shared and modality-specific subspaces. We compared MSIVA to a unimodal analysis (UA) baseline and tested both methods with four distinct subspace structures on synthetic and multimodal neuroimaging datasets. We demonstrated that both approaches can identify and distinguish the correct subspace structures from incorrect ones on synthetic datasets. We then showed that MSIVA can better capture the subspace structures across two neuroimaging modalities. Results from subsequent per-subspace canonical correlation analysis and brain-phenotype modeling showed that the sources from the optimal subspace structure are significantly associated with phenotype measures including age and sex.

关键词：

来源：评论

学校读者我要写书评

暂无评论

ADAPTIVE INCENTIVE FOR CROSS-SILO FEDERATED LEARNING: A MULTI-AGENT REINFORCEMENT LEARNING APPROACH

arXiv

引用

arXiv 2023年

作者： Yuan, Shijing Liu, Hongze Lv, Hongtao Feng, Zhanbo Li, Jie Chen, Hongyang Wu, Chentao Department of Computer Science and Engineering MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University China School of Software Shandong University Jinan China Research Center for Graph Computing Zhejiang Lab China

Cross-silo federated learning (FL) is a typical FL that enables organizations (e.g., financial or medical entities) to train global models on isolated data. Reasonable incentive is key to encouraging organizations to contribute data. However, existing works on incentivizing cross-silo FL lack consideration of the environmental dynamics (e.g., precision of the trained global model and data owned by uncertain clients during the training processes). Moreover, most of them assume that organizations share private information, which is unrealistic. To overcome these limitations, we propose a novel adaptive mechanism for cross-silo FL, towards incentivizing organizations to contribute data to maximize their long-term payoffs in a real dynamic training environment. The mechanism is based on multi-agent reinforcement learning, which learns near-optimal data contribution strategy from the history of potential games without organizations’ private information. Experiments demonstrate that our mechanism achieves adaptive incentive and effectively improves the long-term payoffs for organizations. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Reproducibility in Joint Blind Source Separation: application to fMRI Analysis

Reproducibility in Joint Blind Source Separation: Applicatio...

引用

Asilomar Conference on Signals, Systems & computers

作者： Francisco Laport Trung Vu Hanlu Yang Vince Calhoun Tulay Adali Department of Computer Science and Electrical Engineering University of Maryland Baltimore County MD USA CITIC Research Center University of A Coruna A Coruña Spain Tri-Institutional Center for Translational Research in Neuroimaging and Data Science (TReNDS) Georgia State University Georgia Institute of Technology and Emory University Atlanta GA USA

Joint blind source separation (JBSS) techniques have been successfully applied for the analysis of multi-subject functional magnetic resonance imaging (fMRI) data. However, convergence in JBSS can be only guaranteed to a local optimum, since typically cost functions are non-convex. Also, iterative methods are usually implemented with random initialization for best performance, resulting in high variability, especially for more flexible solutions. Yet, the assessment of the reproducibility of JBSS has been limited in the literature, even though it has been demonstrated that when not taken into account, the solutions can be highly suboptimal. In this work, we propose a framework for the evaluation of the reproducibility of independent vector analysis, an important JBSS solution. We introduce a mechanism for selecting the model complexity that offers the most consistent and accurate solution, and demonstrate results to underline its importance using resting state fMRI data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Decentralized and Lightweight Cross-Chain Transaction Scheme Based on Proxy Re-signature

Decentralized and Lightweight Cross-Chain Transaction Scheme...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Huiying Zou Jia Duan Xi Liu Wei Ren Tao Li Xianghan Zheng Kim-Kwang Raymond Choo School of Computer Science China University of Geosciences Wuhan China The Third Surveying and Mapping Institute of Hunan Province Hunan Engineering Research Center of Geographic Information Security and Application Hunan China Key Laboratory of Data Protection and Intelligent Management Sichuan University Ministry of Education China State Key Laboratory of Geo-Information Engineering and Key Laboratory of Surveying and Mapping Science and Geospatial Information Technology of MNR CASM Beijing China College of Computer and Big Data Fuzhou University School of Information and Intelligent Engineering Sanya College China Department of Information Systems and Cyber Security University of Texas at San Antonio San Antonio USA

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

With the widespread application of digital assets and the rapid development of blockchain technology, achieving secure and efficient transactions between different blockchain networks has become an urgent challenge. Existing cross-chain methods impose limitations, e.g., hash lock technology exhibits low scalability, side-chain technology is overly complex, and notary schemes pose centralization risks. In order to address these issues, we propose a cross-chain transaction solution based on proxy re-signature technology. To tackle the centralization concerns, we employ proxy re-signature technology to decentralize the authority of notaries among transaction participants, minimizing the potential for centralization at a low cost. We further present an extended scheme that can guarantee more requirements such as higher transaction amount and shorter transaction time. Furthermore, we analyze and compare the signature technologies used in the proposed solution and provide a systematic proof of our approach’s security.

关键词： Privacy Systematics Costs Scalability Blockchains Security

来源：评论

学校读者我要写书评

暂无评论

CiteFusion: An Ensemble Framework for Citation Intent Classification Harnessing Dual-Model Binary Couples and SHAP Analyses

arXiv

引用

arXiv 2024年

作者： Paolini, Lorenzo Vahdati, Sahar Di Iorio, Angelo Wardenga, Robert Heibi, Ivan Peroni, Silvio Department of Computer Science and Engineering University of Bologna Bologna Italy Nature-inspired machine intelligence group SCaDS.AI center Technical University of Dresden Germany Institute for Applied Computer Science InfAI Dresden Germany Research Centre for Open Scholarly Metadata Department of Classical Philology and Italian Studies University of Bologna Bologna Italy Department of Classical Philology and Italian Studies University of Bologna Bologna Italy

Understanding the motivations underlying scholarly citations is critical for evaluating research impact and fostering transparent scholarly communication. This study introduces CiteFusion, an ensemble framework designed to address the multiclass Citation Intent Classification (CIC) task on benchmark datasets, SciCite and ACL-ARC. The framework decomposes the task into binary classification subtasks, utilizing complementary pairs of SciBERT and XLNet models fine-tuned independently for each citation intent. These base models are aggregated through a feedforward neural network meta-classifier, ensuring robust performance in imbalanced and data-scarce scenarios. To enhance interpretability, SHAP (SHapley Additive exPlanations) is employed to analyze token-level contributions and interactions among base models, providing transparency into classification dynamics. We further investigate the semantic role of structural context by incorporating section titles into input sentences, demonstrating their significant impact on classification accuracy and model reliability. Experimental results show that CiteFusion achieves state-of-the-art performance, with Macro-F1 scores of 89.60% on SciCite and 76.24% on ACL-ARC. The original intents from both datasets are mapped to Citation Typing Ontology (CiTO) object properties to ensure interoperability and reusability. This mapping highlights overlaps between the two datasets labels, enhancing their understandability and reusability. Finally, we release a web-based application that classifies citation intents leveraging CiteFusion models developed on SciCite. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Single-Sample Direction-of-Arrival Estimation by Hankel-matrix Decompositions

Single-Sample Direction-of-Arrival Estimation by Hankel-matr...

引用

Asilomar Conference on Signals, Systems & computers

作者： Georgios I. Orfanidis Dimitris A. Pados George Sklivanitis Elizabeth S. Bentley Joseph Suprenant Michael J. Medley Department of Electrical Engineering and Computer Science Center for Connected Autonomy and AI Florida Atlantic University Boca Raton FL Air Force Research Laboratory Rome NY

Modern networked robotic platforms operating autonomously on the ground, in the air, or in space over highfrequency bands (e.g., mm-wave or future THz) require rapid and effective estimation of the direction of arrival (DoA) of signals of interest to maintain high data rate connectivity with each other and avoid interference from external in-band sources. High robotic platform mobility limits -or completely negates- our ability to wait and collect the necessary statistically stationary sequence of antenna-array-front measurements. As a result, conventional statistical DoA estimation optimization methods may not be applicable. In this paper, we present for the first time in the literature a single-sample DoA estimation algorithm based on Hankel-matrix-representation and singular-value decomposition (SVD) of the individual antenna-array snapshot. We compare the newly proposed estimator against the Maximum Likelihood (ML) single-sample estimator of the DoA of a signal observed in white Gaussian noise and -arguably surprisingly- demonstrate significant superiority in each metric of interest, such as meansquare estimation error, bias, and variance.

关键词： Antenna measurements Maximum likelihood estimation Direction-of-arrival estimation Gaussian noise Optimization methods Mean square error methods Robots

来源：评论

学校读者我要写书评

暂无评论

Robust Generalization Against Photon-Limited Corruptions via Worst-Case Sharpness Minimization

Robust Generalization Against Photon-Limited Corruptions via...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Zhuo Huang Miaoxi Zhu Xiaobo Xia Li Shen Jun Yu Chen Gong Bo Han Bo Du Tongliang Liu Sydney AI Centre The University of Sydney National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence School of Computer Science Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan University JD Explore Academy Department of Automation University of Science and Technology of China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education School of Computer Science and Engineering Nanjing University of Science and Technology Department of Computer Science Hong Kong Baptist University

Robust generalization aims to tackle the most challenging data distributions which are rare in the training set and contain severe noises, i.e., photon-limited corruptions. Common solutions such as distributionally robust optimization (DRO) focus on the worst-case empirical risk to ensure low training error on the uncommon noisy distributions. However, due to the over-parameterized model being optimized on scarce worst-case data, DRO fails to produce a smooth loss landscape, thus struggling on generalizing well to the test set. Therefore, instead of focusing on the worst-case risk minimization, we propose SharpDRO by penalizing the sharpness of the worst-case distribution, which measures the loss changes around the neighbor of learning parameters. Through worst-case sharpness minimization, the proposed method successfully produces a flat loss curve on the corrupted distributions, thus achieving robust generalization. Moreover, by considering whether the distribution annotation is available, we apply SharpDRO to two problem settings and design a worst-case selection process for robust generalization. Theoretically, we show that SharpDRO has a great convergence guarantee. Experimentally, we simulate photon-limited corruptions using CIFAR10/100 and ImageNet30 datasets and show that SharpDRO exhibits a strong generalization ability against severe corruptions and exceeds well-known baseline methods with large performance gains.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Classification of Breast Thermal Images into Healthy/Cancer Group Using Pre-Trained Deep Learning Schemes

Classification of Breast Thermal Images into Healthy/Cancer ...

引用

2022 International Conference on Machine Learning and data engineering, ICMLDE 2022

作者： Kadry, Seifedine Crespo, Rubén González Herrera-Viedma, Enrique Krishnamoorthy, Sujatha Rajinikanth, Venkatesan Faculty of Applied Computing and Technology Noroff University College Kristiansand94612 Norway Computer Science Department School of Engineering and Technology Universidad Internacional de la Rioja Andalusia26006 Spain Research Institute in Data Science and Computational Intelligence University of Granada Granada Spain Zhejiang Bioinformatics International Science and Technology Cooperation Center Wenzhou-Kean University Zhejiang Province China Wenzhou Municipal Key Lab of Applied Biomedical and Biopharmaceutical Informatics Wenzhou-Kean University Zhejiang Province China Department of Computer Science and Engineering Saveetha School of Engineering SIMATS Tamil Nadu Chennai602105 India

In the women's community, Breast Cancer (BC) is a severe disease. The World Health Organization reported in 2020 that 2.26 million deaths occur due to BC. BC is curable if detected early. Since thermal imaging is non-invasive and supports disease detection, it is commonly used in clinics. Compared to other methods, it keeps BC early and accurate. The proposed work aims to evaluate the performance of the Pretrained Deep-Learning Methods (PDLM) in detecting BC using the thermal images collected from the benchmark dataset. It includes the following stages: primary image processing, deep feature mining, handcrafted feature mining, feature optimization using Firefly-Algorithm (FA), classification and validation. Visual Lab thermal images were used in the study. The investigational outcome of this study authenticates that the VGG16, along with the DT, provides better detection accuracy (95.5%) compared to other classifiers used in this study. To justify the significance of the implemented technique, the proposed work not only improved accuracy, but also improved precision, sensitivity, specificity, and F1-Scores. © 2023 The Authors. Published by Elsevier B.V.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Rethinking CNN-based pansharpening: Guided colorization of panchromatic images via GANs

arXiv

引用

arXiv 2020年

作者： Ozcelik, Furkan Alganci, Ugur Sertel, Elif Unal, Gozde Department of Computer Engineering ITU-AI: Artificial Intelligence and Data Science Research and Application Center Turkey Turkey

Convolutional Neural Networks (CNN)-based approaches have shown promising results in pansharpening of satellite images in recent years. However, they still exhibit limitations in producing high-quality pansharpening outputs. To that end, we propose a new self-supervised learning framework, where we treat pansharpening as a colorization problem, which brings an entirely novel perspective and solution to the problem compared to existing methods that base their solution solely on producing a super-resolution version of the multispectral image. Whereas CNN-based methods provide a reduced resolution panchromatic image as input to their model along with reduced resolution multispectral images, hence learn to increase their resolution together, we instead provide the grayscale transformed multispectral image as input, and train our model to learn the colorization of the grayscale input. We further address the fixed downscale ratio assumption during training, which does not generalize well to the full-resolution scenario. We introduce a noise injection into the training by randomly varying the downsampling ratios. Those two critical changes, along with the addition of adversarial training in the proposed PanColorization Generative Adversarial Networks (PanColorGAN) framework, help overcome the spatial detail loss and blur problems that are observed in CNN-based pansharpening. The proposed approach outperforms the previous CNN-based and traditional methods as demonstrated in our experiments. Copyright © 2020, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：