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

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Chuanhao Zang Anming Dong Jiguo Yu 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

Trajectory tracking of zebrafish is an important requirement in studying neurological disorders and developing new psychoactive drug. However, many challenges emerge for stable tracking, since zebrafish are similar in appearance, occlusion, agile, non-linear in moving and easy to swarm, all of which will lead to mistrack for multiple fish. And there is no precedent for tracking zebrafish through embedded edge artificial intelligence device. To overcome these difficulties, we present a tracking system for zebrafish based on RK3588-S. First, We construct an embedded edge AI hardware system consisting of two cameras driven by the RK3588-S, one for the front view and the other for top view of the fish. Then, we develop a 2D tracking algorithm based on YOLOv5 and the Observation-Centric Simple online and real-time tracking (OC-SORT) algorithm, which are transplanted to the RK3588-S for tracking the top and front views of the fish at the edge device. Compared with the previous methods, our method has fewer ID exchanges and highly real-time. Moreover, we apply the MQTT mechanism to establish communication links between the edge and the cloud to reliably transmit data to the cloud. The correspondence between cloud server and embedded AI is 1: N. Finally, we design a multi-view data fusion association algorithm to fuse the data of the two views in the cloud, which are further utilized to build the 3D tracklets of the zebrafish.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic feature augmentation via distribution estimation and infinite sampling on manifolds 22

Hyperbolic feature augmentation via distribution estimation ...

引用

Proceedings of the 36th International Conference on Neural information Processing Systems

作者： Zhi Gao Yuwei Wu Yunde Jia Mehrtash Harandi Beijing Lab of Intellegent Information Technology School of Computer Science Beijing Institute of Technology China Beijing Lab of Intellegent Information Technology School of Computer Science Beijing Institute of Technology China and Guangdong Lab of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Guangdong Lab of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China and Beijing Lab of Intellegent Information Technology School of Computer Science Beijing Institute of Technology China Department of Electrical and Computer Systems Eng. Monash University and Data61 Australia

ISBN: (纸本)9781713871088

Learning in hyperbolic spaces has attracted growing attention recently, owing to their capabilities in capturing hierarchical structures of data. However, existing learning algorithms in the hyperbolic space tend to overfit when limited data is given. In this paper, we propose a hyperbolic feature augmentation method that generates diverse and discriminative features in the hyperbolic space to combat overfitting. We employ a wrapped hyperbolic normal distribution to model augmented features, and use a neural ordinary differential equation module that benefits from meta-learning to estimate the distribution. This is to reduce the bias of estimation caused by the scarcity of data. We also derive an upper bound of the augmentation loss, which enables us to train a hyperbolic model by using an infinite number of augmentations. Experiments on few-shot learning and continual learning tasks show that our method significantly improves the performance of hyperbolic algorithms in scarce data regimes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Homophily Induced Contrastive Attributed Graph Clustering

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China South China Technology Commercialization Center Guangzhou China Guangdong Key Laboratory of Information Security Technology Guangzhou China

Attributed graph clustering, aiming to discover the underlying graph structure and partition the graph nodes into several disjoint categories, is a basic task in graph data analysis. Although recent efforts over graph contrastive clustering have achieved decent performances, most of them get accustomed to construct the positive neighbor set by the generated pseudo clustering information, directly ignoring the ready-made neighbor nodes and the underlying semantics of edges in a graph. How to well deal with the graph neighbor-specific information to facilitate the performance of graph contrastive clustering is still a challenging problem. Therefore, in this work, we propose a novel Homophily Induced Contrastive Attributed Graph Clustering (HomoCAGC) method, where the power of homophily is exploited in facilitating the performance of contrastive attributed graph clustering, while the pseudo homophily in a graph is also explored and distinguished. Especially, the node feature as reliable information guidance is used to compute the underlying feature-oriented pair-wise node similarity, based on which the positive node pairs in contrastive regularizer are adjusted for better node representation characterization. According to the refined node representations, a triplet self-supervised clustering objective is well-designed to ensure the output embedding is cluster-oriented, and suitable for the downstream clustering task. Extensive experiments on seven benchmarks are conducted to demonstrate the effectiveness of HomoCAGC. © 1991-2012 IEEE.

关键词： Attributed graph clustering contrastive learning graph homophily self-supervised clustering

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preserving and Byzantine Robust Collaborative Federated Learning Method Design

A Privacy Preserving and Byzantine Robust Collaborative Fede...

引用

IEEE International Conference on Communications (ICC)

作者： Nuocheng Yang Sihua Wang Mingzhe Chen Changchuan Yin Christopher G. Brinton Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing China State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

Collaborative federated learning (CFL) enables device cooperation in training shared machine learning models without reliance on a parameter server. However, the absence of a parameter server also impacts vulnerabilities associated with adversarial attacks, including privacy inference and Byzantine attacks. In this context, this paper introduces a novel CFL framework that enables each device to individually determine the subset of devices to transmit FL parameters to over the wireless network, based on its neighboring devices' location, current loss, and connection information, to achieve privacy protection and robust aggregation. This is formulated as an optimization problem whose goal is to minimize CFL training loss while satisfying the privacy preservation, robust aggregation, and transmission delay requirements. To solve this problem, a proximal policy optimization (PPO)-based reinforcement learning (RL) algorithm integrated with a graph neural network (GNN) is proposed. Compared to traditional algorithms that use global information with high computational complexity, the proposed GNN-RL method can be deployed on devices based on neighboring information with lower computational overhead. Simulation results show that the proposed algorithm can protect data privacy and increase identification accuracy by 15% compared to an algorithm in which devices are partially clustered for model aggregation.

关键词： Training Privacy Federated learning Simulation Collaboration Clustering algorithms Propagation losses

来源：评论

学校读者我要写书评

暂无评论

Awareness requirement and performance management for adaptive systems: a survey

arXiv

引用

arXiv 2023年

作者： Rashid, Tarik A. Hassan, Bryar A. Alsadoon, Abeer Qader, Shko Vimal, S. Chhabra, Amit Yaseen, Zaher Mundher Computer Science and Engineering Department School of Science and Engineering University of Kurdistan Hewler Kurdistan Region Erbil Iraq Department of Information Technology Kurdistan Institution for Strategic Studies and Scientifc Research KRI Sulaymaniyah46001 Iraq School of Computing and Mathematics Charles Sturt University Sydney Australia School of Computing Engineering and Mathematics Western Sydney University Sydney City Campus Sydney Australia Sydney Australia Information Technology Department Kent Institute Australia Sydney Australia Department of Information Technology University College of Goizha Kurdistan Region Sulaimani Iraq Data Analytics Lab Department of Artifcial Intelligence and Data Science Ramco Institute of Technology North Venganallur Village Virudhunagar District Tamilnadu Rajapalayam626 117 India Department of Computer Engineering and Technology Guru Nanak Dev University Amritsar India Civil and Environmental Engineering Department King Fahd University of Petroleum & Minerals Dhahran31621 Saudi Arabia Department of Computer Science College of Science Charmo University KRI Chamchamal46023 Iraq Department of Information Technology Computer Science Institute Sulaimani Polytechnic University KRI Sulaymaniyah46001 Iraq

Self-adaptive software can assess and modify its behavior when the assessment indicates that the program is not performing as intended or when improved functionality or performance is available. Since the mid-1960s, the subject of system adaptivity has been extensively researched, and during the last decade, many application areas and technologies involving self-adaptation have gained prominence. All of these efforts have in common the introduction of self-adaptability through software. Thus, it is essential to investigate systematic software engineering methods to create self-adaptive systems that may be used across different domains. The primary objective of this research is to summarize current advances in awareness requirements for adaptive strategies based on an examination of state-of-the-art methods described in the literature. This paper presents a review of self-adaptive systems in the context of requirement awareness and summarizes the most common methodologies applied. At first glance, it gives a review of the previous surveys and works about self-adaptive systems. Afterward, it classifies the current self-adaptive systems based on six criteria. Then, it presents and evaluates the most common self-adaptive approaches. Lastly, an evaluation among the self-adaptive models is conducted based on four concepts (requirements description, monitoring, relationship, dependency/impact, and tools). © 2023, CC BY-NC-ND.

关键词： Adaptive systems

来源：评论

学校读者我要写书评

暂无评论

Lca-Med: A Lightweight Cross-Modal Adaptive Feature Processing Module for Detecting Imbalanced Medical Image Distribution

SSRN

引用

SSRN 2024年

作者： Li, Xiang Lan, Long Lahza, Husam Yang, Shaowu Wang, Shuihua Yang, Wenjing Liu, Hengzhu Zhang, Yudong College of Computer Science and Technology National University of Defense Technology Changsha410073 China Department of Intelligent Data Science College of Computer Science and Technology National University of Defense Technology Changsha410073 China Department of Information Technology Faculty of Computing and Information Technology King Abdulaziz University Jeddah21589 Saudi Arabia Department of Biological Sciences Xi'an Jiaotong-Liverpool University Jiangsu Suzhou215123 China School of Computing and Mathematical Sciences University of Leicester LeicesterLE1 7RH United Kingdom Department of Mathematical Sciences University of Liverpool LiverpoolL69 3BX United Kingdom

data distribution discrepancy across datasets is one of the major obstacles hindering the improvement of the accuracy of cross-domain adaptive detection of medical images. To address this challenge, we propose a novel lightweight cross-modal adaptive detection module named LCA-Med (LCaM). The proposed module boasts a lightweight structure and a minimalistic parameter count, thereby facilitating its integration into the anterior segment of a diverse array of foundational and downstream networks. It is adept at serving as a feature preprocessor, proficiently extracting pertinent information regrading pathologies from a array of images (image modality) produced through varied medical imaging techniques, all guided by the input of prompts (text modality). We also propose a novel cross-modal medical image adaptive detection method, LCA-Med CNX (LCaM-CNX), and a novel cross-domain adaptive detection training paradigm that incorporates generated dataset groups, an attention module, and a meta-heuristic algorithm. Experimental results on six medical image datasets compared with ten state-of-the-art methods demonstrate that the LCaM-CNX trained following the proposed paradigm achieves the best performance on five datasets and competitive performance on the other dataset. Notably, our method outperforms the state-of-the-art methods more when the data distribution is more imbalanced. © 2024, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Simulate the Machine Learning Algorithm to Organize the CRAHN Network System

Simulate the Machine Learning Algorithm to Organize the CRAH...

引用

Advancement in Electronics & Communication Engineering (AECE), International Conference on

作者： P Prabakaran L. Chandra Sekhar Reddy LVD Ravikumar Manish Kumar Verma Department Of Computer Applications School of computing sciences Vels Institute of Science Technology and Advanced Studies Chennai India Department of CSE(Data Science) CMR College of Engineering & Technology Medchal Hyderabad India Department of Information Technology Shri Vishnu Engineering College For Women Bhimavaram India Department of Psychology Lovely Professional University Phagwara India

Using available channels in a wireless spectrum, cognitive radio (CR) may automatically adjust transmission settings to optimize radio operational behaviour. To function properly, a CR ad hoc network (CRAHN) has to be dynamically capable construct autonomous and decentralized networks without negatively impacting licensed main user (PU) systems. For this reason, an effective spectrum necessitates a system structure based on artificial intelligence. This research provides a model for network planning, learning, and dynamic configuration that is based on a distributed autonomous CRAHN network system that uses reinforcement learning. The proposed optimization techniques for spectrum sensing, ad hoc network design, and context-aware signal categorization are all derived from the system model and are based on machine learning. The cognitive and detection engines may be used to examine the spectrum utilization and neighbour network status in the immediate area. To adapt to the ever-changing nature of the wireless environment, the suggested policy engine may generate network operating policies, identify policy conflicts, and infer the best course of action. Together with the erudition engine, whereby apply the recommended machine-learning methods, the decision engine arrives at the best possible settings for the CRAHN. In addition, guarantee peaceful cohabitation with surrounding systems to have excellent signal context recognition ability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhancing Physical Layer Communication Security through Generative AI with Mixture of Experts

arXiv

引用

arXiv 2024年

作者： Zhao, Changyuan Du, Hongyang Niyato, Dusit Kang, Jiawen Xiong, Zehui In Kim, Dong Shen, Xuemin Letaief, Khaled B. CNRS@CREATE 1 Create Way 08-01 Create Tower 138602 Singapore College of Computing and Data Science Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of The Department of Electrical and Computer Engineering University of Waterloo Canada The Department of Electrical and Computer Engineering Hong Kong University of Science and Technology Hong Kong

AI technologies have become more widely adopted in wireless communications. As an emerging type of AI technologies, the generative artificial intelligence (GAI) gains lots of attention in communication security. Due to its powerful learning ability, GAI models have demonstrated superiority over conventional AI methods. However, GAI still has several limitations, including high computational complexity and limited adaptability. Mixture of Experts (MoE), which uses multiple expert models for prediction through a gate mechanism, proposes possible solutions. Firstly, we review GAI model’s applications in physical layer communication security, discuss limitations, and explore how MoE can help GAI overcome these limitations. Furthermore, we propose an MoE-enabled GAI framework for network optimization problems for communication security. To demonstrate the framework’s effectiveness, we provide a case study in a cooperative friendly jamming scenario. The experimental results show that the MoE-enabled framework effectively assists the GAI algorithm, solves its limitations, and enhances communication security. © 2024, CC BY.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Incomplete Multi-view Clustering Based on Joint Concept Decomposition and Anchor Graph Learning 11th

Incomplete Multi-view Clustering Based on Joint Concept Dec...

引用

11th International Joint Conference on Rough Sets, IJCRS 2025

作者： Li, Zhuowen Chen, Hongmei Xiang, Biao Yuan, Zhong Luo, Chuan Li, Tianrui School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China College of Computer Science Sichuan University Chengdu610065 China

ISBN: (纸本)9783031927430

The main objective of incomplete multi-view clustering is to effectively utilize the existing view information to fill in the missing data and to mine the complementary information and potential associations between multiple views to effectively group samples. The existing primary means for recovering missing information are classified into two parts: one uses matrix decomposition or low-rank constraints to fill in the missing views, and the other constructs multiple graph structures and uses graph regularization to recover the corresponding missing parts. However, the two methods are relatively independent and are not used jointly to improve the model performance. This paper proposes an incomplete multi-view clustering method with complete clustering metrics and complete anchor graphs (CFAG). Specifically, each view’s missing samples are recovered by a matrix of consistent clustering metrics and represented by an anchor graph. The recovered complete data performs anchor graph construction and anchor learning and utilizes the orthogonal variation principle to learn the consistency structure of multiple anchor graphs to mine the complementary information among multiple views. The clustering metrics are obtained based on the consistency structure, and the consistency of the clustering metrics is also considered to obtain the final clustering results. The effectiveness of the proposed method is verified on multiple datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Multi-Graph Fusion Networks for Urban Region Embedding

arXiv

引用

arXiv 2022年

作者： Wu, Shangbin Yan, Xu Fan, Xiaoliang Pan, Shirui Zhu, Shichao Zheng, Chuanpan Cheng, Ming Wang, Cheng Fujian Key Laboratory of Sensing and Computing for Smart Cities School of Informatics Department of Computer Science and Technology Xiamen University China Department of Data Science and AI Faculty of Information Technology Monash University Australia University of Chinese Academy of Sciences China

Learning the embeddings for urban regions from human mobility data can reveal the functionality of regions, and then enables the correlated but distinct tasks such as crime prediction. Human mobility data contains rich but abundant information, which yields to the comprehensive region embeddings for cross domain tasks. In this paper, we propose multi-graph fusion networks (MGFN) to enable the cross domain prediction tasks. First, we integrate the graphs with spatio-temporal similarity as mobility patterns through a mobility graph fusion module. Then, in the mobility pattern joint learning module, we design the multi-level cross-attention mechanism to learn the comprehensive embeddings from multiple mobility patterns based on intra-pattern and inter-pattern messages. Finally, we conduct extensive experiments on real-world urban datasets. Experimental results demonstrate that the proposed MGFN outperforms the state-of-the-art methods by up to 13.11% improvement. https://***/wushangbin/MGFN. Copyright © 2022, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：