Future Generation Computer Systems-The International Journal of Escience最新文献

Process standardization for machine learning systems: A reference model based on international standards 机器学习系统的过程标准化：基于国际标准的参考模型

IF 7.5 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-10-01 DOI: 10.1016/j.future.2026.108873

Antonio Crespí,Maria Monserrat,Antonia Mas,Antoni-Lluís Mesquida

引用次数: 0

Efficient drift detection and model adaptation for edge MLOps leveraging class separability in the latent space 利用潜在空间中类可分性的边缘MLOps的有效漂移检测和模型自适应

IF 7.5 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-10-01 DOI: 10.1016/j.future.2026.108872

Lara Luys,Prangon Ghose,Mathias Verbeke

引用次数: 0

Multimodal deep learning for flood detection: Integrating water level sensors, rainfall, cameras, and satellite imagery 用于洪水检测的多模态深度学习：集成水位传感器、降雨、相机和卫星图像

IF 7.5 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-10-01 DOI: 10.1016/j.future.2026.108870

Ipshita Ahmed Moon,Jack Barbieri,Alfred Kalyanapu,Susmit Shannigrahi

引用次数: 0

Fuzzy client clustering and importance-aware regularization for personalized federated learning 个性化联邦学习的模糊客户聚类和重要性感知正则化

IF 7.5 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-10-01 DOI: 10.1016/j.future.2026.108878

Xingxing Chen,Senlin Luo,Deshan Yang,Limin Pan,Chenggang Cui

引用次数: 0

Security-aware service-chain orchestration across limited-trust, multi-tenant edge-cloud resource associations 跨有限信任、多租户边缘云资源关联的安全感知服务链编排

IF 7.5 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-10-01 DOI: 10.1016/j.future.2026.108879

Georgios Kontos,Polyzois Soumplis,Prodromos Makris,Aristotelis Kretsis,Anastassios Nanos,Emmanouel Varvarigos

引用次数: 0

HSFE: Hierarchical Feature Selection for Enhanced Automated Feature Engineering 面向增强自动化特征工程的分层特征选择

IF 7.5 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-09-01 DOI: 10.1016/j.future.2026.108787

Haibo Cai,Jian An,Qingli Tang,Xin He,Longfei Zhao

引用次数: 0

Modular Digital Twin Network for data-center thermal and electrical systems 用于数据中心热电系统的模块化数字孪生网络

IF 7.5 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-09-01 DOI: 10.1016/j.future.2026.108824

Xing Lu,Yan Chen,Cary A. Faulkner,Alex Vlachokostas,Hanlong Wan,Jeremy Lerond

引用次数: 0

Adaptive CPU sharing for co-located latency-critical JVM applications and batch jobs under dynamic workloads 动态工作负载下共定位延迟关键型JVM应用程序和批处理作业的自适应CPU共享

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-07-01 Epub Date: 2026-01-23 DOI: 10.1016/j.future.2026.108387

Dishi Xu , Fagui Liu , Bin Wang , Xuhao Tang , Qingbo Wu

{"title":"Adaptive CPU sharing for co-located latency-critical JVM applications and batch jobs under dynamic workloads","authors":"Dishi Xu , Fagui Liu , Bin Wang , Xuhao Tang , Qingbo Wu","doi":"10.1016/j.future.2026.108387","DOIUrl":"10.1016/j.future.2026.108387","url":null,"abstract":"<div><div>Latency-critical (LC) long-running applications operating on Java Virtual Machines (JLRAs) often rely on substantial CPU over-provisioning to meet Service-Level Objectives (SLOs) under dynamic workloads, leading to significant resource underutilization. Additionally, JLRAs exhibit inferior cold-start performance, and frequent deletion and creation of application instances to adjust resource allocation results in performance degradation. Furthermore, harvesting redundant resources by deploying best-effort (BE) batch jobs alongside JLRAs encounters serious challenges due to contention for shared CPU resources. Therefore, we present ChaosRM, a bi-level resource management framework for JVM workload co-location to enhance resource utilization efficiency while eliminating resource contention. In contrast to the conventional approach of isolating JLRAs and batch jobs on non-overlapping CPU sets, ChaosRM proposes a tri-zone CPU isolation mechanism, utilizing two CPU zones to isolate JLRAs and batch jobs, and an shared region for concurrently executing their threads. An application-wide, learning-based Application Manager adjusts the instance states of JLRAs based on the global workload and adaptively learns the shared zone allocation strategy and the performance target represented by thread queuing time; the Node Manager on each server heuristically binds CPU sets to JLRAs and dynamically schedules batch jobs among CPU zones according to this performance target and the JLRA instance states. Experimental results show that, while guaranteeing the SLOs of JLRAs, ChaosRM reduces the completion time of batch jobs by up to 14.10% over the best-performing baseline and up to 54.29% over all baselines.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"180 ","pages":"Article 108387"},"PeriodicalIF":6.2,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146033294","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

IRL-D3QN: An intelligent multi-agent learning framework for dynamic spectrum management in vehicular networks 基于IRL-D3QN的车辆网络动态频谱管理智能多智能体学习框架

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-07-01 Epub Date: 2026-01-10 DOI: 10.1016/j.future.2026.108371

Jing Wang , Wenshi Dan , Ke Yang , Xing Tang , Lingyu Yan

{"title":"IRL-D3QN: An intelligent multi-agent learning framework for dynamic spectrum management in vehicular networks","authors":"Jing Wang , Wenshi Dan , Ke Yang , Xing Tang , Lingyu Yan","doi":"10.1016/j.future.2026.108371","DOIUrl":"10.1016/j.future.2026.108371","url":null,"abstract":"<div><div>The proliferation of vehicular networks within intelligent transportation systems (ITS) has significantly increased the demand for efficient and adaptive spectrum resource allocation. Spectrum coordination is challenging due to high vehicle traffic, intensive communication environments and diversified service requirements. These are of particular significance in Vehicle-to-Everything (V2X) communications, where adaptive conditions call out powerful solutions. Multi-agent reinforcement learning (MARL) techniques are promising and have been applied to the management of dynamic spectrum access, but with limitations including overestimated value functions, unsteady policy convergence, and dependence on manual choices of rewards, these techniques have limitations as far as their application in practice. This paper presents a new framework of spectrum management IRL-D3QN, which combines Inverse Reinforcement Learning (IRL) and a Dueling Double Deep Q-Network (D3QN). This algorithm involves a prediction network of rewards on determining intrinsic motivation according to its interplay with environments, eliminating the necessity of a danger of designing rewards manually. This enhances generalization in various situations. The dueling network design contributes to learning that is more stable because it keeps the values of state and values of the action apart. In the meantime, the bias of overestimation is minimized in the case of double q-learning. It has been demonstrated through simulations that IRL-D3QN can support a higher Vehicle to Infrastructure (V2I) transmission rate by 7.94 percent and demonstrate significantly less performance degradation under heavy communication loads than state of the art RL algorithms. Therefore, it will provide a solution to the distribution of dynamic spectrum, which will be scalable and self-sufficient in the next generation of vehicular communication systems.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"180 ","pages":"Article 108371"},"PeriodicalIF":6.2,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145957070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

AFMIS: An approximate floating-point multiplier based on input segmentation 基于输入分割的近似浮点乘法器

IF 6.2 2区计算机科学

Future Generation Computer Systems-The International Journal of Escience Pub Date : 2026-07-01 Epub Date: 2026-01-18 DOI: 10.1016/j.future.2026.108377

Asma Naseri Rad , Shaghayegh Vahdat , Ali Afzali-Kusha , Massoud Pedram

{"title":"AFMIS: An approximate floating-point multiplier based on input segmentation","authors":"Asma Naseri Rad , Shaghayegh Vahdat , Ali Afzali-Kusha , Massoud Pedram","doi":"10.1016/j.future.2026.108377","DOIUrl":"10.1016/j.future.2026.108377","url":null,"abstract":"<div><div>This paper proposes an approximate floating-point (FP) multiplier, called AFMIS, which is based on input segmentation. The AFMIS multiplier statically divides the input mantissas into several segments and performs exact multiplication on the selected segments. This approach eliminates the need for a costly leading-one detector (LOD) circuit. The static segmentation and limited segment count in the proposed design reduce the number of required post-multiplication shift values. With only a few possible shifts, a simple multiplexer can replace a full shifter. This substitution improves speed compared with that of dynamic segmentation approaches. The proposed structure allows for adjustable accuracy levels by modifying the number of bits in each segment, making it suitable for a wide range of applications. To evaluate the efficiency of the AFMIS multiplier, its hardware parameters are compared to those of an exact FP multiplier and several other approximate FP multipliers. The comparison is performed using Synopsys Design Compiler in a 7 nm technology. The results show that the proposed multiplier achieves a mean relative error distance (MRED) of 0.27% to 18.6% while improving delay, area, and power consumption by up to 81.7%, 98%, and 99%, respectively, compared to the exact FP multiplier. Furthermore, the AFMIS multiplier outperforms other approximate FP multipliers in terms of speed, area, and energy consumption at similar accuracy levels. The utility of the AFMIS multiplier is demonstrated by its application in regression and classification tasks using neural networks (NNs) and JPEG compression. The results indicate that, in most cases, the output differences between the AFMIS multiplier and the exact multiplier are negligible.</div></div>","PeriodicalId":55132,"journal":{"name":"Future Generation Computer Systems-The International Journal of Escience","volume":"180 ","pages":"Article 108377"},"PeriodicalIF":6.2,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145995521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0