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

5th IFIP TC 12 International Conference on intelligence science, ICIS 2022

作者： Yao, Zhangrui Chen, Junhan Pan, Yinghui Zeng, Yifeng Ma, Biyang Ming, Zhong Department of Automation and Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision-Making Xiamen University Xiamen China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Computer and Information Sciences Northumbria University Newcastle upon Tyne United Kingdom School of Computer Science and Engineering Minnan Normal University Zhangzhou China

ISBN: (纸本)9783031149023

Given the huge toll caused by natural disasters, it is critically important to develop an effective disaster management and emergency response technique. In this article, we investigate relationships between typhoon-related variables and emergency response from natural language (NL) reports. A major challenge is to exploit typhoon state information for typhoon contingency plan generation, especially from unstructured text data based on NL input. To tackle this issue, we propose a novel framework for learning typhoon Bayesian network structures (FLTB), which can extract typhoon state information from unstructured NL, mine inter-information causal relationships and then generate Bayesian networks. We first extract information about typhoon states through NL processing (NLP) techniques, and then analyze typhoon reports by designing heuristic rules to identify causal relationships between states. We leverage these features to improve the learned structures and provide user-interaction mechanisms to finalize Bayesian networks. We evaluate the performance of our framework on real-world typhoon datasets and develop the Bayesian networks based typhoon emergency response systems. © 2022, IFIP International Federation for Information Processing.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

A Probabilistic Framework for Pruning Transformers Via a Finite Admixture of Keys 48

A Probabilistic Framework for Pruning Transformers Via a Fin...

引用

48th IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Nguyen, Tan M. Nguyen, Tam Bui, Long Do, Hai Nguyen, Duy Khuong Le, Dung D. Tran-The, Hung Ho, Nhat Osher, Stan J. Baraniuk, Richard G. University of California Department of Mathematics Los Angeles United States Rice University Department of Electrical and Computer Engineering Houston United States Fpt Software Ai Center Ha Noi Viet Nam Vin University College of Engineering and Computer Science Viet Nam Deakin University Applied Artificial Intelligence Institute Geelong Australia The University of Texas Department of Statistics and Data Sciences Austin United States

ISBN: (纸本)9781728163277

Pairwise dot product-based self-attention is key to the success of transformers which achieve state-of-the-art performance across a variety of applications in language and vision, but are costly to compute. It has been shown that most attention scores and keys in transformers are redundant and can be removed without loss of accuracy. In this paper, we develop a novel probabilistic framework for pruning attention scores and keys in transformers. We first formulate an admixture model of attention keys whose input data to be clustered are attention queries. We show that attention scores in self-attention correspond to the posterior distribution of this model when attention keys admit a uniform prior distribution. We then relax this uniform prior constraint and let the model learn these priors from data, resulting in a new Finite Admixture of Keys (FiAK). The learned priors are used for pruning away redundant attention scores and keys in the baseline transformers, improving the diversity of attention patterns that the models capture. We corroborate the efficiency of transformers pruned with FiAK on the ImageNet object classification and WikiText-103 language modeling tasks. Our experiments demonstrate that transformers pruned with FiAK yield similar or better accuracy than the baseline dense transformers while being much more efficient in terms of memory and computational cost. © 2023 IEEE.

关键词： admixture models pruning Transformers

来源：评论

学校读者我要写书评

暂无评论

Dependency-Aware Hybrid Task Offloading in Mobile Edge Computing Networks 27

Dependency-Aware Hybrid Task Offloading in Mobile Edge Compu...

引用

27th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2021

作者： Ming, Zhao Li, Xiuhua Sun, Chuan Fan, Qilin Wang, Xiaofei Leung, Victor C. M. School of Big Data and Software Engineering Chongqing University Chongqing China TKLAN College of Intelligence and Computing Tianjin University Tianjin China College of Computer Science and Software Engineering Shenzhen University Shenzhen China The University of British Columbia Department of Electrical and Computer Engineering Vancouver Canada

ISBN: (纸本)9781665408783

With the rapid increase of data in mobile edge computing (MEC) networks, mobile devices (MDs) have been generating many computation-latency-sensitive tasks. As the MDs are limited by resources in terms of storage, computation, and bandwidth, part of tasks have to be offloaded to the edge of mobile networks or the remote cloud for more efficient processing. Hence, task offloading plays a vital role in this scene. Existing works about task offloading mainly aim at one-shot task offloading and rarely consider the dependencies of tasks. In this paper, we focus on minimizing the maximum delay of processing a series of tasks with dependencies in MEC networks, which supports device-to-device communications. Specifically, we consider task offloading under a hybrid scenario with a small base station (SBS) deployed with an edge server (ES) and several MDs which generate several tasks with dependencies. Then we model the tasks to a weighted directed acyclic graph (DAG) and formulate the optimization problem as minimizing the critical path of the weighted DAG. To tackle this NP-hard problem, we propose a heuristic scheme to iteratively optimize the delay of paths of the weighted DAG under the constraints of the ES. To evaluate the proposed scheme, we perform numerical experiments with different numbers of tasks. Simulation results demonstrate that the proposed scheme outperforms other schemes in terms of reducing the system delay and saving the energy consumption of the MDs. © 2021 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Improving Routing Decision Algorithm for RPL Networks 11

Improving Routing Decision Algorithm for RPL Networks

引用

11th International Conference on Information Technology, ICIT 2023

作者： Zaqebah, Abdullah Al Almomani, Omar Almomani, Malek Alsaaidah, Adeeb Abu-Shareha, Ahmad Adel Althunibat, Ahmad The World IslamicSciences and Education University Department of Computer Science Amman Jordan The World Islamic Sciences and Education University Department of Information System and Networks Amman Jordan Software Engineering The World Islamic Sciences and Education University Amman Jordan Al-Ahliyya Amman University Department of Networks and Information Security Amman Jordan Al-Ahliyya Amman University Department of Data Science and Artificial Intelligence Amman Jordan Al-Zaytoonah University of Jordan Department of Software Engineering Amman11733 Jordan

ISBN: (纸本)9798350320060

Low Power Networks are spreading worldwide, seeking to enable small devices to join wireless networks. This requires a routing mechanism that makes it possible and seamless. This research aims to create a Low Power and Lossy Networks (RPL) routing protocol that balances power usage and node dependability. The main emphasis of the algorithm presented here is the choice made by network nodes (Zigbees) regarding which path to deliver the message along. Results for this routing technique seem promising. Utilizing it increased packet transfer reliability while enforcing power conservation. Furthermore, a 10% reduction in the network's overall power consumption was made. © 2023 IEEE.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

Automatic Detection and Characterization of Human Veins Using Infra-Red Image Processing

引用

Journal of computer and Communications 2024年第9期12卷 141-159页

作者： Jean Ndoumbe Brice Ekobo Akoa Gaelle Patricia Talotsing Frederic Franck Kounga Samuel Kaissassou Bertin Chouanmo Njo Laboratory of Computer Engineering Data Science and Artificial Intelligence Department of Computer & Telecommunications Engineering National Higher Polytechnic School Douala Cameroon Laboratory of Electrical Engineering Mechatronics and Signal Processing Department of Electrical & Telecommunications Engineering National Advanced School of Engineering Yaound Cameroon Mobile Computing and Networking Research Laboratory Department of Computer and Software Engineering Polytechnique Montreal Montreal Canada DigiPlus SARL Bonamoussadi Douala Cameroon

The detection and characterization of human veins using infrared (IR) image processing have gained significant attention due to its potential applications in biometric identification, medical diagnostics, and vein-based authentication systems. This paper presents a low-cost approach for automatic detection and characterization of human veins from IR images. The proposed method uses image processing techniques including segmentation, feature extraction, and, pattern recognition algorithms. Initially, the IR images are preprocessed to enhance vein structures and reduce noise. Subsequently, a CLAHE algorithm is employed to extract vein regions based on their unique IR absorption properties. Features such as vein thickness, orientation, and branching patterns are extracted using mathematical morphology and directional filters. Finally, a classification framework is implemented to categorize veins and distinguish them from surrounding tissues or artifacts. A setup based on Raspberry Pi was used. Experimental results of IR images demonstrate the effectiveness and robustness of the proposed approach in accurately detecting and characterizing human. The developed system shows promising for integration into applications requiring reliable and secure identification based on vein patterns. Our work provides an effective and low-cost solution for nursing staff in low and middle-income countries to perform a safe and accurate venipuncture.

关键词： Vein Detection Blood Radiation Infrared Image CLAHE Algorithm Raspberry Pi

来源：评论

学校读者我要写书评

暂无评论

Federated Causally Invariant Feature Learning 39

Federated Causally Invariant Feature Learning

引用

39th Annual AAAI Conference on Artificial intelligence, AAAI 2025

作者： Guo, Xianjie Yu, Kui Cui, Lizhen Yu, Han Li, Xiaoxiao School of Computer Science and Information Engineering Hefei University of Technology China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education China School of Software Shandong University China College of Computing and Data Science Nanyang Technological University Singapore Department of Electrical and Computer Engineering The University of British Columbia Canada Vector Institute Canada

ISBN: (纸本)157735897X

Federated feature selection (FFS) is a promising field for selecting informative features while preserving data privacy in federated learning (FL) settings. Existing FFS methods focus on capturing the correlations between features and labels. They struggle to achieve satisfactory performance in the face of data distribution heterogeneity among FL clients, and cannot address the out-of-distribution (OOD) problem that arises when a significant portion of clients do not actively participate in FL training. To address these limitations, we propose Federated Causally Invariant Feature Learning (FedCIFL), a novel approach for learning causally invariant features in a privacy-preserving manner. We design a sample reweighting strategy to eliminate spurious correlations introduced by selection bias and iteratively estimate the federated causal effect between each feature and the labels (with the remaining features initially treated as confounders). By iteratively refining the confounding feature set to identify the true confounders, FedCIFL mitigates the impact of limited local data on the accuracy of federated causal effect estimation. Theoretical analysis proves the correctness of FedCIFL under reasonable assumptions. Extensive experiments on synthetic and real-world datasets demonstrate the superiority of FedCIFL against eight state-of-the-art baselines, beating the best-performing approach by 3.19%, 9.07% and 2.65% in terms of average test Accuracy, RMSE and F1 score, respectively. It is a first-of-its-kind FFS approach capable of handling Non-IID and OOD data simultaneously. The source code is available at https://***/Xianjie-Guo/FedCIFL. Copyright © 2025, Association for the Advancement of Artificial intelligence (***). All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Incremental Learning Algorithms for Broad Learning System with Node and Input Addition

Incremental Learning Algorithms for Broad Learning System wi...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Guang-Ze Chen Junwei Jin Hai-Wei Sun C. L. Philip Chen Department of Mathematics Faculty of Science and Technology University of Macau Macau China School of Artificial Intelligence and Big Data Henan University of Technology Zhengzhou China South China University of Technology and Pazhou Lab School of Computer Science and Engineering Guangzhou China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

The Broad Learning System (BLS) has been established as an effective flat network alternative to Deep Neural Networks (DNNs), delivering high efficiency while achieving competitive accuracy. Despite its advantages, the incremental learning methods of BLS face challenges in stability and computation when expanding with new nodes or input. We introduce two novel incremental learning algorithms based on factorization updates for BLS that optimize node and input additions to overcome these limitations. Our node addition algorithm utilizes QR decomposition and Cholesky factorization, using the update of the Cholesky factor instead of pseudo-inverse computations. For input addition, we propose an iterative Cholesky factor update algorithm. Our algorithms demonstrate not only faster computation compared to the existing BLS but also improved testing accuracy on the MNIST or Fashion-MNIST dataset. This work presents a significant step forward in the practical application and scalability of BLS in various data-dense environments.

关键词： Learning systems Incremental learning Accuracy Scalability Parallel processing Stability analysis Matrix decomposition Thermal stability Numerical stability Testing

来源：评论

学校读者我要写书评

暂无评论

How graph neural networks learn: lessons from training dynamics 24

How graph neural networks learn: lessons from training dynam...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Chenxiao Yang Qitian Wu David Wipf Ruoyu Sun Junchi Yan School of Artificial Intelligence & Department of Computer Science and Engineering & MoE Lab of AI Shanghai Jiao Tong University Amazon Web Services School of Data Science The Chinese University of Hong Kong Shenzhen and Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data

A long-standing goal in deep learning has been to characterize the learning behavior of black-box models in a more interpretable manner. For graph neural networks (GNNs), considerable advances have been made in formalizing what functions they can represent, but whether GNNs will learn desired functions during the optimization process remains less clear. To fill this gap, we study their training dynamics in function space. In particular, we find that the gradient descent optimization of GNNs implicitly leverages the graph structure to update the learned function, as can be quantified by a phenomenon which we call kernel-graph alignment. We provide theoretical explanations for the emergence of this phenomenon in the overparameterized regime and empirically validate it on real-world GNNs. This finding offers new interpretable insights into when and why the learned GNN functions generalize, highlighting their limitations in heterophilic graphs. Practically, we propose a parameter-free algorithm that directly uses a sparse matrix (i.e. graph adjacency) to update the learned function. We demonstrate that this embarrassingly simple approach can be as effective as GNNs while being orders-of-magnitude faster.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prototype and Instance Contrastive Learning for Unsupervised Domain Adaptation in Speaker Verification

Prototype and Instance Contrastive Learning for Unsupervised...

引用

International Symposium on Chinese Spoken Language Processing

作者： Wen Huang Bing Han Zhengyang Chen Shuai Wang Yanmin Qian Department of Computer Science and Engineering Auditory Cognition and Computational Acoustics Lab MoE Key Lab of Artificial Intelligence AI Institute Shanghai Jiao Tong University Shanghai Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen

ISBN: (数字)9798331516826

ISBN: (纸本)9798331516833

Speaker verification system trained on one domain usually suffers performance degradation when applied to another domain. To address this challenge, researchers commonly use feature distribution matching-based methods in unsupervised domain adaptation scenarios where some unlabeled target domain data is available. However, these methods often have limited performance improvement and lack generalization in various mismatch situations. In this paper, we propose Prototype and Instance Contrastive Learning (PICL), a novel method for unsupervised domain adaptation in speaker verification through dual-level contrastive learning. For prototype contrastive learning, we generate pseudo labels via clustering to create dynamically updated prototype representations, aligning instances with their corresponding class or cluster prototypes. For instance contrastive learning, we minimize the distance between different views or augmentations of the same instance, ensuring robust and invariant representations resilient to variations like noise. This dual-level approach provides both high-level and low-level supervision, leading to improved generalization and robustness of the speaker verification model. Unlike previous studies that only evaluated mismatches in one situation, we have conducted relevant explorations on various datasets and achieved state-of-the-art performance currently, which also proves the generalization of our method.

关键词： Degradation Adaptation models Noise Prototypes Contrastive learning Robustness

来源：评论

学校读者我要写书评

暂无评论

Self-Supervised Teaching and Learning of Representations on Graphs 23

Self-Supervised Teaching and Learning of Representations on ...

引用

2023 World Wide Web Conference, WWW 2023

作者： Wan, Liangtian Fu, Zhenqiang Sun, Lu Wang, Xianpeng Xu, Gang Yan, Xiaoran Xia, Feng Key Laboratory for Ubiquitous Network Service Software of Liaoning Province School of Software Dalian University of Technology Dalian China Department of Communication Engineering Institute of Information Science Technology Dalian Maritime University Dalian China State Key Laboratory of Marine Resource Utilization in South China Sea School of Information and Communication Engineering Hainan University Haikou China State Key Laboratory of Millimeter Waves School of Information Science and Engineering Southeast University Nanjing China Research Center of Big Data Intelligence Research Institute of Artificial Intelligence Zhejiang Lab Hangzhou China School of Computing Technologies Rmit University Melbourne Australia

ISBN: (纸本)9781450394161

Recent years have witnessed significant advances in graph contrastive learning (GCL), while most GCL models use graph neural networks as encoders based on supervised learning. In this work, we propose a novel graph learning model called GraphTL, which explores self-supervised teaching and learning of representations on graphs. One critical objective of GCL is to retain original graph information. For this purpose, we design an encoder based on the idea of unsupervised dimensionality reduction of locally linear embedding (LLE). Specifically, we map one iteration of the LLE to one layer of the network. To guide the encoder to better retain the original graph information, we propose an unbalanced contrastive model consisting of two views, which are the learning view and the teaching view, respectively. Furthermore, we consider the nodes that are identical in muti-views as positive node pairs, and design the node similarity scorer so that the model can select positive samples of a target node. Extensive experiments have been conducted over multiple datasets to evaluate the performance of GraphTL in comparison with baseline models. Results demonstrate that GraphTL can reduce distances between similar nodes while preserving network topological and feature information, yielding better performance in node classification. © 2023 ACM.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：