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

arXiv 2025年

作者： Kou, Wei-Bin Zhu, Guangxu Ye, Rongguang Wang, Shuai Tang, Ming Wu, Yik-Chung Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Shenzhen International Center For Industrial And Applied Mathematics Shenzhen Research Institute of Big Data Shenzhen China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China

Learning-based street scene semantic understanding in autonomous driving (AD) has advanced significantly recently, but the performance of the AD model is heavily dependent on the quantity and quality of the annotated training data. However, traditional manual labeling involves high cost to annotate the vast amount of required data for training robust model. To mitigate this cost of manual labeling, we propose a Label Anything Model (denoted as LAM), serving as an interpretable, high-fidelity, and prompt-free data annotator. Specifically, we firstly incorporate a pretrained Vision Transformer (ViT) to extract the latent features. On top of ViT, we propose a semantic class adapter (SCA) and an optimization-oriented unrolling algorithm (OptOU), both with a quite small number of trainable parameters. SCA is proposed to fuse ViT-extracted features to consolidate the basis of the subsequent automatic annotation. OptOU consists of multiple cascading layers and each layer contains an optimization formulation to align its output with the ground truth as closely as possible, though which OptOU acts as being interpretable rather than learning-based blackbox nature. In addition, training SCA and OptOU requires only a single pre-annotated RGB seed image, owing to their small volume of learnable parameters. Extensive experiments clearly demonstrate that the proposed LAM can generate high-fidelity annotations (almost 100% in mIoU) for multiple real-world datasets (i.e., Camvid, Cityscapes, and Apolloscapes) and CARLA simulation dataset. © 2025, CC BY-NC-ND.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy

ACGraph: Accelerating Streaming Graph Processing via Depende...

引用

Design Automation Conference

作者： Zihan Jiang Fubing Mao Yapu Guo Xu Liu Haikun Liu Xiaofei Liao Hai Jin Wei Zhang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Electronic and Computer Engineering HKUST Hong Kong

Streaming graph processing needs to timely evaluate continuous queries. Prior systems suffer from massive redundant computations due to the irregular order of processing vertices influenced by updates. To address this issue, we propose ACGraph, a novel streaming graph processing approach for monotonic graph algorithms. It maintains dependence trees during runtime, and makes affected vertices processed in a top-to-bottom order in the hierarchy of the dependence trees, thus normalizing the state propagation order and coalescing of multiple propagation to the same vertices. Experimental results show that ACGraph reduces the number of updates by 50% on average, and achieves the speedup of 1.75~7.43× over state-of-the-art systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing Ethanol Production in Escherichia Coli Using a Hybrid of Particle Swarm Optimization and Artificial Bee Colony 22

Optimizing Ethanol Production in Escherichia Coli Using a Hy...

引用

Proceedings of the 6th International Conference on Advances in Artificial Intelligence

作者： Mohamad Faiz Dzulkalnine Mohd Saberi Mohamad Yee Wen Choon Muhammad Akmal Remli Hany Alashwal Artificial Intelligence and Bioinformatics Research Group Faculty of Computing Universiti Teknologi Malaysia Malaysia Health Data Science Lab Department of Genetics and Genomics College of Medical and Health Sciences United Arab Emirates University UAE and Big Data Analytics Center United Arab Emirates University UAE Institute for Artificial Intelligence and Big Data Universiti Malaysia Kelantan Malaysia and Department of Data Science Universiti Malaysia Kelantan Malaysia Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University UAE and Big Data Analytics Center United Arab Emirates University UAE

ISBN: (纸本)9781450396943

Metabolic engineering for biomass production using microorganisms’ cell has received considerable attention in recent years. This is due to the biomass products being extensively used in the field of food additives, supplements, pharmaceuticals, and polymer materials. In this paper, ethanol production in Escherichia coli (E. coli) is the desired product. Sugarcane and corn are often used to produce ethanol. However, one of the problems to produce adequate amounts of ethanol is that large areas are needed to plant sugarcane and corn. Furthermore, the amount of time for the process of dry milling and wet milling is high, which are 40 to 50 hours and 24 to 48 hours, respectively. The wet laboratory is also having limitation on the production of ethanol in microorganisms because the amount of the ethanol produced is not satisfying. Hence, a lot of metabolic engineering techniques is introduced to enhance the production of ethanol in E. coli, such as gene knockout strategy, but the production is yet to meet the demand. Therefore, this paper proposes a hybrid algorithm of Particle Swarm Optimization with the Artificial Bee Colony algorithm (PSOABC) to identify the optimal set of gene knockout strategy to improve the ethanol production in E. coli. A list of genes to knockout, production of the desired product, and growth rate are presented in this paper. PSOABC has shown better performance in terms of production, growth rate and accuracy.

关键词： Gene Knockouts Particle Swarm Optimization Artificial Bee Colony Ethanol Flux Balance Analysis

来源：评论

学校读者我要写书评

暂无评论

Contactless Respiratory Rate Monitoring For ICU Patients Based On Unsupervised Learning

Contactless Respiratory Rate Monitoring For ICU Patients Bas...

引用

2023 IEEE/CVF Conference on computer Vision and Pattern Recognition Workshops, CVPRW 2023

作者： Liu, Zimeng Huang, Bin Lin, Chun-Liang Wu, Chieh-Liang Zhao, Changchen Chao, Wen-Cheng Wu, Yu-Cheng Zheng, Yadan Wang, Zhiru Beihang University Hangzhou Innovataion Institute China Beihang University School of Automation Science and Electrical Engineering China National Chung Hsing University College of Electrical Engineering and Computer Science Taiwan Taichung Veterans General Hospital Department of Critical Care Medicine Taiwan National Chung Hsing University College of Medicine Department of Post-Baccalaureate Medicine Taiwan National Chung Hsing University Big Data Center Taiwan Beijing University of Posts and Telecommunications Computer Science School China Beijing Foreign Studies University Graduate School of Translation and Interpretation China

ISBN: (纸本)9798350302493

Recently, the task of contactless physiological signal monitoring based on deep learning technologies has attracted a large number of scholars. However, few studies focus on the application of real-world scenarios, especially in clinical medicine scenes. In this paper, a novel video-based contactless respiratory rate measurement algorithm is developed for the Intensive Care Unit (ICU) patients. Firstly, a large-scale clinical real-world database towards ICU patient is collected in this study. Then, based on the dataset, the unsupervised learning is first introduced to extract the respiration waveform from the chest area of patients. Lastly, a respiratory rate estimator based on neural networks is proposed and trained on a periodical physiological signal simulation dataset, and utilizes the transfer learning technique to extract the respiratory rate from only 10-second respiration waveform. We obtained estimated respiratory rate with an MAE of 2.8 breaths/min and an STD of 3.0 breaths/min against the reference value computed from the specialized medical device. Extensive experiments demonstrate that our proposed methods achieve competitive results over state-of-the-art (SOTA) method in the real-world scenario. © 2023 IEEE.

关键词： Intensive care units

来源：评论

学校读者我要写书评

暂无评论

An Incentive Mechanism for Privacy Preserved data Trading with Verifiable data Disturbance

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Zhang, Man Li, Xinghua Luo, Bin Ren, Yanbing Miao, Yinbin Liu, Ximeng Deng, Robert H. State Key Laboratory of Integrated Services Networks the School of Cyber Engineering Xidian University Xi’an710071 China Engineering Research Center of Big data Security Ministry of Education Xi’an710071 China The College of Mathematics and Computer Science Fuzhou University Fujian350108 China The Department of Information Systems Singapore Management University 80 Stamford Road Singapore

To motivate data owners’ (DOs’) trading willingness, the existing incentive mechanisms allow DOs to independently disturb data following data consumer’s (DC’s) availability requirement. However, they cannot motivate DOs’ honest disturbance, which is attributed to DOs’ independent disturbance without any supervision. Thus, we implement an incentive mechanism for privacy preserved data trading with verifiable data disturbance where an honest-but-curious disturbance generator (DG) is additionally introduced to supervise DOs’ local disturbance and assist disturbance verification between DOs and DC. Specifically, DG generates the disturbance strategies and secretly distributes to DOs following private information retrieval, guaranteeing DOs’s local disturbance’s privacy and verifiability with our proposed three-level verification algorithm. Subsequently, we model the trading as a game and disturbance verification results determine the compensation and punishment for trading bilateral utilities following Nash Equilibrium where DOs honestly disturb data. Theoretical analysis shows that DOs are motivated to honestly disturb data and their raw data privacy is preserved. Extensive experiments using the real-world dataset demonstrate that the deviating DOs in our scheme can be verified with a probability of more than 90% and the statistical result accuracy can be improved by more than 80% compared with the existing works. © 2004-2012 IEEE. All rights reserved.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

EdgeMove: Pipelining Device-Edge Model Training for Mobile Intelligence 23

EdgeMove: Pipelining Device-Edge Model Training for Mobile I...

引用

2023 World Wide Web Conference, WWW 2023

作者： Dong, Zeqian He, Qiang Chen, Feifei Jin, Hai Gu, Tao Yang, Yun School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computing Technologies Swinburne University of Technology Australia School of Information Technology Deakin University Australia School of Computing Macquarie University Australia National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781450394161

Training machine learning (ML) models on mobile and Web-of-Things (WoT) has been widely acknowledged and employed as a promising solution to privacy-preserving ML. However, these end-devices often suffer from constrained resources and fail to accommodate increasingly large ML models that crave great computation power. Offloading ML models partially to the cloud for training strikes a trade-off between privacy preservation and resource requirements. However, device-cloud training creates communication overheads that delay model training tremendously. This paper presents EdgeMove, the first device-edge training scheme that enables fast pipelined model training across edge devices and edge servers. It employs probing-based mechanisms to tackle the new challenges raised by device-edge training. Before training begins, it probes nearby edge servers' training performance and bootstraps model training by constructing a training pipeline with an approximate model partitioning. During the training process, EdgeMove accommodates user mobility and system dynamics by probing nearby edge servers' training performance adaptively and adapting the training pipeline proactively. Extensive experiments are conducted with two popular DNN models trained on four datasets for three ML tasks. The results demonstrate that EdgeMove achieves a 1.3 × -2.1 × speedup over the state-of-the-art scheme. © 2023 ACM.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Expediting Distributed GNN Training with Feature-only Partition and Optimized Communication Planning

Expediting Distributed GNN Training with Feature-only Partit...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Bingqian Du Jun Liu Ziyue Luo Chuan Wu Qiankun Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Electrical and Computer Engineering The Ohio State University USA Department of Computer Science The University of Hong Kong Hong Kong School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Feature-only partition of large graph data in distributed Graph Neural Network (GNN) training offers advantages over commonly adopted graph structure partition, such as minimal graph preprocessing cost and elimination of cross-worker subgraph sampling burdens. Nonetheless, performance bottleneck of GNN training with feature-only partitions still largely lies in the substantial communication overhead due to cross-worker feature fetching. To reduce the communication overhead and expedite distributed training, we first investigate and answer two key questions on convergence behaviors of GNN model in feature-partition based distribute GNN training: 1) As no worker holds a complete copy of each feature, can gradient exchange among workers compensate for the information loss due to incomplete local features? 2) If the answer to the first question is negative, is feature fetching in every training iteration of the GNN model necessary to ensure model convergence? Based on our theoretical findings on these questions, we derive an optimal communication plan that decides the frequency for feature fetching during the training process, taking into account bandwidth levels among workers and striking a balance between model loss and training time. Extensive evaluation demonstrates consistent results with our theoretical analysis, and the effectiveness of our proposed design.

关键词： Training Time-frequency analysis Costs Computational modeling Distributed databases Bandwidth Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoke Zhu Danyang Li Xiaopan Chen Fumin Qi Fan Zhang Xiao-Yuan Jing School of Computer and Information Engineering Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng China Department of System Operation National Supercomuting Center in Shenzhen Shenzhen China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China School of Computer Science Wuhan University Wuhan China

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Facial image based kinship verification aims to decide whether there exists kinship between the given facial images. In practice, the cross-generation differences will cause adverse effects on kinship verification, which limits the performance. Therefore, how to mine the implied similarity from facial images with large cross-generation divergence is an important problem in kinship verification, which has not yet been well studied. In view of this, we propose a Similarity Mining via Implicit matching pattern LEarning (SMILE) approach for kinship verification. Specifically, SMILE mainly consists of two modules, including a Semi-coupled Multi-pattern Similarity Learning (SMSL) module and a Cross-Generation Feature Normalization (CGFN) module. The SMSL module is designed to learn multiple semi-coupled matching patterns for mining the implicit facial similarity information from different perspectives. The CGFN module aims to reduce the divergence between facial images of parent and child. Extensive experiments demonstrate that the proposed approach outperforms the existing state-of-the-art methods.

关键词： Pattern matching Similarity learning

来源：评论

学校读者我要写书评

暂无评论

Using Meta-Heuristic Methods to Detect Botnet Attacks in Internet of Things

SSRN

引用

SSRN 2023年

作者： Mardani, Shayan Boroujeni, Farsad Zamani Akbari, Mehdi Department of Engineering Sepahan Institute of Higher Education Science and Technology Iran Department of Computer Engineering Islamic Azad University Science and Research Branch Tehran Iran Faculty of Computer Engineering Islamic Azad University Najafabad Branch Najafabad Iran Big Data Research Center Islamic Azad University Najafabad Branch Najafabad Iran

The need for timely detection of botnet attacks due to the increase in the number of Internet of Things devices is very necessary to minimize security risks and ensure network security. Recently, botnet attack detection methods are based on artificial intelligence techniques;And in order to deal with the growing dimensions of Internet of Things data, they have used various filtering and wrapping feature selection methods. In this paper, for the challenge of IoT data dimensions in detecting botnet attacks, a comparison has been made between 7 different old and new meta-heuristic methods including PSO, Giza, RSO, Firefly, PEC, BAT and GWO. In this model, decision tree algorithm is used to detect attacks. The experimental results of the methods on two data sets IOT-BotNet and N-BaIoT show that all meta-heuristic methods in binary classification have similar performance and have been able to achieve accuracy above 99%. In detecting the type of attacks (multi-class classification), the results show that the best performance belongs to RSO, Giza, which reached an accuracy of over 99% and are among the latest meta-heuristic methods. The results of the methods show that meta-heuristic feature selection algorithms can effectively reduce data dimensions;So that the accuracy of the proposed attack detection model has increased compared to previous methods. © 2023, The Authors. All rights reserved.

关键词： Botnet

来源：评论

学校读者我要写书评

暂无评论

Deep Kernel Embedded Clustering Network

SSRN

引用

SSRN 2024年

作者： Ren, Lina Huang, Ruizhang Chen, Yanping Lin, Chuan Qin, Yongbin State Key Laboratory of Public Big Data Text Computing and Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and Technology Guizhou University Guiyang550025 China Department of Information Engineering Guizhou Light Industry Technical College Guiyang550025 China

In this paper, we propose a deep kernel embedded clustering network, namely DKEC, which learns data partitions with kernelized semantic embeddings of data samples via a self-supervised deep neural network. A kernelized semantic embedding learner is designed to learn high quality data representations, which not only capture the data semantic characteristics but also show good structural separable characteristics. Other than directly apply traditional predefined kernel mapping methods, the kernelized semantic embedding learner, investigated by a deep variational Gaussian process, is able to learn the kernel mapping according to the nature of various datasets automatically, while maintain reasonable computational complexity. The DKEC, which is an end-to-end deep clustering network, is invested based on the kernelized semantic embedding learner. A triplet self-supervised optimization objective is designed in the DKEC model to guide the clustering partition, the separable factor of the kernelized semantic embedding, and the data reconstruction factor of the kernelized semantic embedding, simultaneously. We conducted extensive experiments on $ 7 $ real-world datasets. The results unequivocally showcase the exceptional clustering performance of the proposed DKEC. © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：