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

IEEE Conference on Global Communications (GLOBECOM)

作者： Chenyang Wang Yan Chen Chuan Sun Bosen Jia Xiaofei Wang Tarik Taleb Victor C. M. Leung College of Computer Science & Software Engineering Shenzhen University Shenzhen China Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) Shenzhen China Faculty of Electrical Engineering and Information Technology Ruhr University Bochum Bochum Germany College of Computing and Data Science Nanyang Technological University Singapore China Unicom Digital Technology Co. Ltd Beijing China College of Intelligence and Computing Tianjin University Tianjin China University of British Columbia Vancouver Canada

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Mobile Edge Caching (MEC) can potentially alleviate Internet transmission congestion by delivering content at the network edge. However, current MEC solutions suffer from low resource utilization efficiency and often fail to meet user Quality of Experience (QoE), primarily due to dynamic user requests and obsessive pursuit of direct caching hits. Given the prevalence of recommendation systems, users often lack precise requests when using recommendation-based applications like TikTok and Taobao, insted passively enjoying recommended content. In this paper, we introduce a recommendation-enabled MEC architecture to enhance resource utilization and QoE. We develop a recommendation-enabled soft caching model and formulate the optimization problem as maximizing joint system revenue. To address this, we propose an attention-assisted federated learning deep Q-network algorithm. We conduct the simulations by using the real-world MIND dataset. The results demonstrate that our proposed algorithm outperforms existing baselines, demonstrating its effectiveness in improving resource utilization and QoE.

关键词： Video on demand Heuristic algorithms Computational modeling Internet Quality of experience Resource management Web sites Global communication Optimization Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Early Fault Detection in Rolling Element Bearings Using Signal Processing Techniques

Early Fault Detection in Rolling Element Bearings Using Sign...

引用

International Symposium on High Capacity Optical Networks and Enabling Technologies, HONET

作者： Ali Saeed M. Usman Akram Muazzam A. Khan M. Belal Afsar Department of Computer Science ICESCO Chair Big Data Analytics and Edge Computing Quaid-i-Azam University Islamabad Pakistan Department of Computer and Software Engineering National University of Sciences & Technology Islamabad Pakistan Faculty of Electrical Engineering and Information Technology Otto-von-Guericke University Maddeburg DE

ISBN: (数字)9798350378078

ISBN: (纸本)9798350378085

Many studies show that bearings are the most vulnerable components in low-voltage motors. While advanced bearing diagnostic systems exist, their cost can be a barrier for non-critical machinery due to the potential wait time to see a return on investment. This research explores the feasibility of using basic signal processing techniques on vibration data for bearing condition monitoring. The primary goal is to analyze benchmark data from the Case Western Reserve University (CWRU) dataset and establish a baseline performance for this data-driven approach. The results suggest that, with appropriate signal processing, it's possible to achieve early detection of bearing faults, leading to more efficient time-to-fault identification with higher detection accuracies ranging from 83 % to 100 % for each method.

关键词： Vibrations Fault diagnosis Low voltage Smart cities Rolling bearings Signal processing Motors Robots Monitoring Investment

来源：评论

学校读者我要写书评

暂无评论

Fast Heterogeneous Federated Learning with Hybrid Client Selection

arXiv

引用

arXiv 2022年

作者： Shen, Guangyuan Gao, Dehong Song, Duanxiao Yang, Libin Zhou, Xukai Pan, Shirui Lou, Wei Zhou, Fang Department of Cyber Science and Technology Northwestern Polytechnical University China Alibaba Group China Department of Data Science and AI Faculty of IT Monash University Australia Department of Computing The Hong Kong Polytechnic University Hong Kong

Client selection schemes are widely adopted to handle the communication-efficient problems in recent studies of Federated Learning (FL). However, the large variance of the model updates aggregated from the randomly-selected unrepresentative subsets directly slows the FL convergence. We present a novel clustering-based client selection scheme to accelerate the FL convergence by variance reduction. Simple yet effective schemes are designed to improve the clustering effect and control the effect fluctuation, therefore, generating the client subset with certain representativeness of sampling. Theoretically, we demonstrate the improvement of the proposed scheme in variance reduction. We also present the tighter convergence guarantee of the proposed method thanks to the variance reduction. Experimental results confirm the exceed efficiency of our scheme compared to alternatives. Copyright © 2022, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Variance-Reduced Heterogeneous Federated Learning via Stratified Client Selection

arXiv

引用

arXiv 2022年

作者： Shen, Guangyuan Gao, Dehong Yang, Libin Zhou, Fang Song, Duanxiao Lou, Wei Pan, Shirui Department of Cyber Science and Technology Northwestern Polytechnical University China Alibaba Group China Department of Computing The Hong Kong Polytechnic University Hong Kong Department of Data Science and AI Faculty of IT Monash University Australia

Client selection strategies are widely adopted to handle the communication-efficient problem in recent studies of Federated Learning (FL). However, due to the large variance of the selected subset's update, prior selection approaches with a limited sampling ratio cannot perform well on convergence and accuracy in heterogeneous FL. To address this problem, in this paper, we propose a novel stratified client selection scheme to reduce the variance for the pursuit of better convergence and higher accuracy. Specifically, to mitigate the impact of heterogeneity, we develop stratification based on clients' local data distribution to derive approximate homogeneous strata for better selection in each stratum. Concentrating on a limited sampling ratio scenario, we next present an optimized sample size allocation scheme by considering the diversity of stratum's variability, with the promise of further variance reduction. Theoretically, we elaborate the explicit relation among different selection schemes with regard to variance, under heterogeneous settings, we demonstrate the effectiveness of our selection scheme. Experimental results confirm that our approach not only allows for better performance relative to state-of-the-art methods but also is compatible with prevalent FL algorithms. © 2022, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

RAPID MIXING OF THE FLIP CHAIN OVER NON-CROSSING SPANNING TREES

arXiv

引用

arXiv 2024年

作者： Anand, Konrad Feng, Weiming Freifeld, Graham Guo, Heng Jerrum, Mark Wang, Jiaheng School of Mathematical Sciences Queen Mary University of London Mile End Road LondonE1 4NS United Kingdom School of Computing and Data Science The University of Hong Kong Pokfulam Road Hong Kong School of Informatics University of Edinburgh Informatics Forum EdinburghEH8 9AB United Kingdom Faculty of Informatics and Data Science University of Regensburg Bajuwarenstrasse 4 Regensburg93053 Germany

We show that the flip chain for non-crossing spanning trees of n + 1 points in convex position mixes in time O(n8 log n). We use connections between Fuss-Catalan structures to construct a comparison argument with a ch... 详细信息

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

6th International Conference on Advances in Artificial Intelligence, ICAAI 2022

作者： Dzulkalnine, Mohamad Faiz Mohamad, Mohd Saberi Choon, Yee Wen Remli, Muhammad Akmal Alashwal, Hany Artificial Intelligence and Bioinformatics Research Group Faculty of Computing Universiti Teknologi Malaysia Johor81310 Malaysia Health Data Science Lab Department of Genetics and Genomics College of Medical and Health Sciences United Arab Emirates University P.O. Box 17666 Al Ain Abu Dhabi United Arab Emirates Big Data Analytics Center United Arab Emirates University Al Ain Abu Dhabi United Arab Emirates Institute for Artificial Intelligence and Big Data Universiti Malaysia Kelantan Kelantan Kota Bharu16100 Malaysia Department of Data Science Universiti Malaysia Kelantan Kelantan Kota Bharu16100 Malaysia Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University Al-Ain United Arab Emirates

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. © 2022 Association for computing Machinery.

关键词： Ethanol

来源：评论

学校读者我要写书评

暂无评论

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection

arXiv

引用

arXiv 2025年

作者： Liang, Hanzhe Zhou, Jie Chen, Xuanxin Dai, Tao Wang, Jinbao Gao, Can College of Computer Science and Software Engineering Shenzhen University China Shenzhen Audencia Financial Technology Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Faculty of Education Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

3D anomaly detection (AD) is prominent but difficult due to lacking a unified theoretical foundation for preprocessing design. We establish the Fence Theorem, formalizing preprocessing as a dual-objective semantic isolator: (1) mitigating cross-semantic interference to the greatest extent feasible and (2) confining anomaly judgements to aligned semantic spaces wherever viable, thereby establishing intra-semantic comparability. Any preprocessing approach achieves this goal through a two-stage process of Semantic-Division and Spatial-Constraints stage. Through systematic deconstruction, we theoretically and experimentally subsume existing preprocessing methods under this theorem via tripartite evidence: qualitative analyses, quantitative studies, and mathematical proofs. Guided by the Fence Theorem, we implement Patch3D, consisting of Patch-Cutting and Patch-Matching modules, to segment semantic spaces and consolidate similar ones while independently modeling normal features within each space. Experiments on Anomaly-ShapeNet and Real3D-AD with different settings demonstrate that progressively finer-grained semantic alignment in preprocessing directly enhances point-level AD accuracy, providing inverse validation of the theorem’s causal logic. Copyright © 2025, The Authors. All rights reserved.

关键词： Fences

来源：评论

学校读者我要写书评

暂无评论

Parallel Image Encryption Algorithm Using Partitioned Cellular Automata on Graphic Processor Unit

Parallel Image Encryption Algorithm Using Partitioned Cellul...

引用

Omni-layer Intelligent Systems (COINS), International Conference on

作者： Mahmood Fazlali Amirhossein Alihoseini Ebrahim Zarei Myasar Tabani Seyedali Pourmoafi Cybersecurity and Computing Systems Research Group University of Hertfordshire Hatfiled UK Dept. of data and Computer Sciensce Faculty of Mathematical sciences Shahid Beheshti University Tehran Iran Dep. of Computer Science Khansar Campus University Of Isfahan Isfahan Iran

Image encryption is a reliable method for securely transmitting images over a network. The time required to encrypt and decrypt an image in online applications is also very important. Although cellular automata cryptography is an appropriate technique for parallelizing and accelerating cryptographic methods, its capacity cannot be demonstrated only in multi-core platforms. Thus, it is needed to parallelize cellular automata cryptography on Graphic Processor Units (GPUs) in order to significantly decrease the encryption/decryption time. In this paper, we propose a new parallel algorithm for two-dimensional cellular automata cryptography that is implemented on GPU. The proposed algorithm uses multiple threads at once to accelerate the bit-level permutation and substitution operations by taking into account the capacity of cellular automata in parallel processing. According to the study experimental findings, the proposed algorithm performs faster on GPU compared to a multicore platform while maintaining the same level of security in comparison to the serial algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BFGTP: A BERT-Guided Two-Stage Molecular Representation Learning Framework for Toxicity Prediction

引用

IEEE Journal of Biomedical and Health Informatics 2025年 PP卷 PP页

作者： Hu, Kaimiao He, Yuan Wei, Jianguo Sun, Changming Geng, Jie Wei, Leyi Su, Ran Tianjin University College of Intelligence and Computing Tianjin30000 China CSIRO Data61 SydneyNSW1710 Australia Tianjin University Tianjin Key Laboratory of Cardiovascular Emergency and Critical Care Tianjin Municipal Science and Technology Bureau Department of Cardiology Chest Hospital Tianjin China Macao Polytechnic University Centre for Artificial Intelligence driven Drug Discovery Faculty of Applied Science China Xiamen University School of Informatics Xiamen China

Accurate prediction of molecular toxicity is vital for drug development. Most mainstream methods rely on fingerprints or graph-based feature extraction, the emergence of large language models (LLMs) offers new prospects for molecular representation learning in toxicity prediction. Although several studies attempt to leverage LLMs to integrate molecular sequence data for pretraining molecular representations, certain limitations remain. Current LLM-based approaches usually utilize solely on class embedding features, overlooking the rich information in sequence embedding. Moreover, integrating pre-trained molecular representations with multi-modal molecular data may further enhance performance in toxicity prediction. To address these challenges, we propose BFGTP, a BERT-guided two-stage molecular representation learning framework for toxicity prediction. Firstly, we design independent encoders for molecular descriptions of three modalities, where the fingerprint encoder with dual level attention mechanisms effectively integrates multi-category fingerprints. Then, the two-stage guide strategy is introduced to fully utilize the prior knowledge of LLMs, employing contrastive learning to align and fuse the tri-modal representations and knowledge distillation to align predicted value distributions. BFGTP ultimately combines fingerprint and graph representations to predict molecular toxicity. Experiments on seven toxicity datasets show that BFGTP outperforms baselines, achieving the highest AUC on five datasets and the best average performance across five evaluation metrics. Ablation studies, t-SNE visualization and case study confirm the effectiveness of BFGTP's components and its ability to capture meaningful molecular representations. ©2013 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

GPU-based Parallel Technique for Solving the N-Similarity Problem in Textual data Mining

GPU-based Parallel Technique for Solving the N-Similarity Pr...

引用

Distributed computing and High Performance computing (DCHPC), International Conference on

作者： Mahmood Fazlali Mina Mirhosseini Mahyar Shahsavari Alex Shafarenko Mashallah Mashinchi Department of Computer Science Cyber Security and Computing Research Group University of Hertfordshire Hertfordshire UK Department of Computer and Data Sciences Faculty of Mathematical Sciences Shahid Beheshti University Tehran Iran AI Department Donders Institute for Brain Cognition and Behaviour Radboud University Nijmegen The Netherlands Department of Statistics Faculty of Mathematics and Computer Shahid Bahonar University of Kerman Kerman Iran

An important issue in data mining and information retrieval is the problem of multiple similarity or n-similarity. This problem entails finding a group of n data points with the highest similarity within a large dataset. Exact methods to solve this problem exist but come with high time and space complexities. Additionally, various metaheuristic algorithms have been proposed, including genetic algorithms, gravitational search algorithms, particle swarm optimization, imperialist competitive algorithms, and fuzzy imperialist competitive algorithms. These metaheuristics are capable of finding near-optimal solutions within a reasonable timeframe, although there is no guarantee of achieving exact results. In this paper, we employ a parallelization technique using CUDA to expedite the exact method. We conduct experiments on textual datasets to identify a group of n textual documents with the highest similarity to each other. The experimental results demonstrate that the proposed parallel exact method significantly reduces execution time compared to the best sequential approach and CPU multi-core implementation. Furthermore, it is evident that the proposed method requires less memory space than the exact method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：