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

arXiv 2025年

作者： Wu, Jing Wang, Lin Deng, Quanfeng Yu, Chen Zhang, Dong Yan, Bingheng Liu, Fangming 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 China Paderborn University Germany Inspur Data Co. Ltd. China Peng Cheng Laboratory China

Serverless platforms typically adopt an early-binding approach for function sizing, requiring developers to specify an immutable size for each function within a workflow beforehand. Accounting for potential runtime variability, developers must size functions for worst-case scenarios to ensure service-level objectives (SLOs), resulting in significant resource inefficiency. To address this issue, we propose Janus, a novel resource adaptation framework for serverless platforms. Janus employs a late-binding approach, allowing function sizes to be dynamically adapted based on runtime conditions. The main challenge lies in the information barrier between the developer and the provider: developers lack access to runtime information, while providers lack domain knowledge about the workflow. To bridge this gap, Janus allows developers to provide hints containing rules and options for resource adaptation. Providers then follow these hints to dynamically adjust resource allocation at runtime based on real-time function execution information, ensuring compliance with SLOs. We implement Janus and conduct extensive experiments with real-world serverless workflows. Our results demonstrate that Janus enhances resource efficiency by up to 34.7% compared to the state-of-the-art. © 2025, CC BY-NC-ND.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

FHRDiff: Leveraging Diffusion Models for Conditional Fetal Heart Rate Signal Generation

FHRDiff: Leveraging Diffusion Models for Conditional Fetal H...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xiaoqing Li Yu Lu Kee Yuan Ngiam Zichang Yu Mohammad Shaheryar Furqan College of Big Data and Internet Shenzhen Technology University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Surgery Yong Loo Lin School of Medicine National University of Singapore Singapore

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Accurate analysis of Fetal Heart Rate (FHR) signal is often impeded by challenges such as data scarcity and label imbalance, which affect the reliability and robustness of deep learning models. To address these challenges, this study introduces FHRDiff, a novel diffusion model conditioned on Phase-Rectified Signal Averaging (PRSA) spectrograms for the creation of synthetic FHR signals. Our model integrates time encoding, condition generation from PRSA spectrograms, and residual blocks with dilated convolutions to effectively manage temporal dynamics and long-range dependencies. Extensive qualitative and quantitative experiments on FHR signal synthesis demonstrate the feasibility and effectiveness of FHRDiff. Compared to Generative Adversarial Networks (GANs) and image-based diffusion model, our method achieves the highest signal fidelity and distribution similarity, with key measures including 0.067 maximum mean deviation (MMD), 0.492 percent root mean square difference (PRD), 1.763 relative entropy (RE), and 0.160 Frechet distance (FD). Expert validation confirms the model’s capacity to accurately generate data for normal and abnormal FHR signals based on the paired condition. In addition, an ablation study was conducted to highlight that the spectrogram paired condition can guide the diffusion model to produce synthetics FHR signals with greater diversity compared to unconditional models. The results emphasize diffusion models’ potential for broad application in biomedical time series analysis, such as generation, imputation and noise removal.

关键词： Analytical models Fetal heart rate Biological system modeling Time series analysis Diffusion models data models Robustness Signal synthesis Root mean square Spectrogram

来源：评论

学校读者我要写书评

暂无评论

WebCode2M: A Real-World dataset for Code Generation from Webpage Designs 25

WebCode2M: A Real-World Dataset for Code Generation from Web...

引用

34th ACM Web Conference, WWW 2025

作者： Gui, Yi Li, Zhen Wan, Yao Shi, Yemin Zhang, Hongyu Su, Yi Chen, Bohua Chen, Dongping Wu, Siyuan Zhou, Xing Jiang, Wenbin Jin, Hai Zhang, Xiangliang Huazhong University of Science and Technology Wuhan China Peking University Beijing China Chongqing University Chongqing China Hubei University of Automotive Technology Shiyan China Rabbitpre AI Shenzhen China University of Notre Dame Notre Dame United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster Grid Computing Lab School of Computer Science and Technology China

ISBN: (纸本)9798400712746

Automatically generating webpage code from webpage designs can significantly reduce the workload of front-end developers, and recent Multimodal Large Language Models (MLLMs) have shown promising potential in this area. However, our investigation reveals that most existing MLLMs are constrained by the absence of high-quality, large-scale, real-world datasets, resulting in inadequate performance in automated webpage code generation. To fill this gap, this paper introduces WebCode2M, a new dataset comprising 2.56 million instances, each containing a design image along with the corresponding webpage code and layout details. Sourced from real-world web resources, WebCode2M offers a rich and valuable dataset for webpage code generation across a variety of applications. The dataset quality is ensured by a scoring model that filters out instances with aesthetic deficiencies or other incomplete elements. To validate the effectiveness of WebCode2M, we introduce a baseline model based on the Vision Transformer (ViT), named WebCoder, and establish a benchmark for fair comparison. Additionally, we introduce a new metric, TreeBLEU, to measure the structural hierarchy recall. The benchmarking results demonstrate that our dataset significantly improves the ability of MLLMs to generate code from webpage designs, confirming its effectiveness and usability for future applications in front-end design tools. Finally, we highlight several practical challenges introduced by our dataset, calling for further research. © 2025 Copyright held by the owner/author(s).

关键词： Web Design

来源：评论

学校读者我要写书评

暂无评论

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Network for Segmenting Pathology Lesion of the Focal Lymphocytic Sialadenitis 1

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Ne...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Han, Hao Lu, Feng Deng, Yanhan Luo, Xiaofang Jin, Hai Tu, Wei Xie, Xia School of Computer Science and Technology Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan430074 China Tongji Medical College Huazhong University of Science and Technology Tongji Hospital Wuhan430022 China School of Computer Science and Technology Hainan University Haikou China

ISBN: (纸本)9798350358780

In the medical realm, the pivotal role of pathological Whole Slide Images (WSIs) in detecting cancer, tracking disease progression, and evaluating treatment efficacy is indisputable. Nevertheless, the identification and quantification of lesion areas in these gigapixel WSIs present a significant challenge due to their substantial size and the intricate details of lesions. To address these issues, we developed a novel multi-resolution and multi-scale cross fusion network (M2CF-Net), adept at managing large-scale pathological WSIs and capturing both fine details and context. Our model particularly focuses on segmenting local lymphocyte infiltration lesions in pathological WSIs of patients diagnosed with primary Sjogren's syndrome. By employing a patch-based training approach and combining interconnected elements via a multi-scale fusion technique, we enhance our model's capacity to detect and analyze structures and features in minor salivary gland section WSIs. Extensive experiments and ablation studies conducted on real-world clinical datasets affirm our model's superior accuracy in identifying lymphocyte-infiltrated regions over state-of-the-art models, with a performance improvement of up to 4.32% in terms of the Dice Similarity Coefficient. © 2023 IEEE.

关键词： Pathology

来源：评论

学校读者我要写书评

暂无评论

Container lifecycle-aware scheduling for serverless computing

Container lifecycle-aware scheduling for serverless computin...

引用

作者： Wu, Song Tao, Zhiheng Fan, Hao Huang, Zhuo Zhang, Xinmin Jin, Hai Yu, Chen Cao, Chun 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 State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Elastic scaling in response to changes on demand is a main benefit of serverless computing. When bursty workloads arrive, a serverless platform launches many new containers and initializes function environments (known as cold starts), which incurs significant startup latency. To reduce cold starts, platforms usually pause a container after it serves a request, and reuse this container for subsequent requests. However, this reuse strategy cannot efficiently reduce cold starts because the schedulers are agnostic of container lifecycle. For example, it may ignore soon available containers or evict soon needed containers. We propose a container lifecycle-aware scheduling strategy for serverless computing, CAS. The key idea is to control distribution of requests and determine creation or eviction of containers according to different lifecycle phases of containers. We implement a prototype of CAS on OpenWhisk. Our evaluation shows that CAS reduces 81% cold starts and therefore brings a 63% reduction at 95th percentile latency compared with native scheduling strategy in OpenWhisk when there is worker contention between workloads, and does not add significant performance overhead. © 2021 John Wiley & Sons Ltd.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

LightST: A Simplifying Spatio-Temporal Graph Neural Network for Traffic Flow Forecasting

引用

IEEE Transactions on big data 2025年

作者： Hu, Jie Zheng, Taichuan Peng, Lilan Teng, Fei Du, Shengdong Li, Tianrui Southwest Jiaotong University School of Computing and Artificial Intelligence Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology China

Traffic flow forecasting task plays an essential role in intelligent transportation systems. Accurately capturing the intricate spatio-temporal dependencies in traffic network signals is the core of precise prediction. Recently, a paradigm that models spatio-temporal dependencies through graph neural networks and time series models has become one of the most promising methods to solve this problem. However, existing methods still have limitations due to ineffectively modeling dynamic spatial dependencies and high time and space complexity. To address these issues, we propose a simplifying and powerful general spatio-temporal traffic flow forecasting model called LightST. Specifically, LightST first embeds temporal covariates and spatial position information to enhance the spatio-temporal modeling capabilities. Then, stacked temporal linear layers are introduced to capture temporal dependencies efficiently. Finally,we propose a concise adaptive spatio-temporal embedding graph convolution method to extract implicit spatial dependencies over time via dynamic graph convolution with adaptive spatio-temporal embedding graph generation. Extensive experiment results on four public traffic flow datasets demonstrate the superiority of our LightST concerning computational efficiency and prediction performance. © 2025 IEEE. All rights reserved,

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction 21

SumPA: Efficient Pattern-Centric Graph Mining with Pattern A...

引用

Proceedings of the 30th International Conference on Parallel Architectures and Compilation Techniques

作者： Chuangyi Gui Xiaofei Liao Long Zheng Pengcheng Yao Qinggang Wang Hai Jin National Engineering Research Center for Big Data Technology and System/Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781665442787

Graph mining aims to explore interesting structural information of a graph. Pattern-centric systems typically transform a generic-purpose graph mining problem into a series of subgraph matching problems for high performance. Existing pattern-centric mining systems reduce the substantial search space towards a single pattern by exploring a highly-optimized matching order, but inherent computational redundancies of such a matching order itself still suffer severely, leading to significant performance degradation. The key innovation of this work lies in a general redundancy criterion that characterizes computational redundancies arising in not only handing a single pattern but also matching multiple patterns simultaneously. In this paper, we present SumPA, a high-performance pattern-centric graph mining system that can sufficiently remove redundant computations for any complex graph mining problems. SumPA features three key designs: (1) a pattern abstraction technique that can simplify numerous complex patterns into a few simple abstract patterns based on pattern similarity, (2) abstraction-guided pattern matching that completely eliminates (totally and partially) redundant computations during subgraph enumeration, and (3) a suite of system optimizations to maximize storage and computation efficiency. Our evaluation on a wide variety of real-world graphs shows that SumPA outperforms the two state-of-the-art systems Peregrine and GraphPi by up to 61.89× and 8.94×, respectively. For many mining problems on large graphs, Peregrine takes hours or even days while SumPA finishes in only a few minutes.

关键词： data reuse

来源：评论

学校读者我要写书评

暂无评论

Channel Capacity and Power Allocation of MIMO Visible Light Communication system

引用

China Communications 2023年第2期20卷 122-138页

作者： Shuai Ma Ruixin Yang Guanjie Zhang Hang Li Wen Cao Linqiong Jia Yanyu Zhang Shiyin Li Peng Cheng Laboratory Shenzhen 518055China School of Information and Control Engineering China University of Mining and TechnologyXuzhou 221116China Shenzhen Research Institute of Big Data Shenzhen 518172China School of Electronics and Control Engineering Chang’an UniversityXi’an 710064China School of Electronic and Optical Engineering Nanjing University of Science and TechnologyNanjing 210094China National Digital Switching System Engineering&Technological Research Center Zhengzhou 450000China

In this paper,the channel capacity of the multiple-input multiple-output(MIMO)visible light communication(VLC)system is investigated under the peak,average optical and electrical power *** the channel capacity of MIMO VLC is shown to be a mixed integer programming *** address this open problem,we propose an inexact gradient projection method to find the channel capacity-achieving discrete input distribution and the channel capacity of MIMO *** we derive both upper and lower bounds of the capacity of MIMO VLC with the closed-form ***,by considering practical discrete constellation inputs,we develop the optimal power allocation scheme to maximize transmission rate of MIMO VLC *** results show that more discrete points are needed to achieve the channel capacity as SNR *** the upper and lower bounds of channel capacity are tight at low SNR *** addition,comparing the equal power allocation,the proposed power allocation scheme can significantly increase the rate for the low-order modulation inputs.

关键词： visible light communication MIMO discrete constellation inputs power allocation

来源：评论

学校读者我要写书评

暂无评论

A Real-time Demonstration of Bidirectional Multiformat/Rate-adjustable Integrated Laser Communication/Ranging for Satellite Communication

A Real-time Demonstration of Bidirectional Multiformat/Rate-...

引用

2024 Conference on Lasers and Electro-Optics, CLEO 2024

作者： Wang, Yizhou Wang, Yuanxiang Luo, Zhen Zhong, Linsheng Zou, Yang Ao, Xueyuan Liu, Jiale Fan, Feng Li, Xiaoliang Dai, Xiaoxiao Yang, Qi Liu, Deming National Engineering Laboratory for Next Generation Internet Access System School of Optical and Electronic Information Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Beijing Research Institute of Telemetry Beijing100094 China Jinyinhu Laboratory Wuhan430040 China

A multi-format/rate-adjustable integrated laser communication/ranging system is proposed, achieving adjustable rates between 0.625-10Gbit/s. Real-time experiment shows that at 1e-4 BER the ranging error is only 0.29% ... 详细信息

ISBN: (纸本)9781957171395

关键词： Laser theory

来源：评论

学校读者我要写书评

暂无评论

A Fine-Grained Anomaly Detection Method Fusing Isolation Forest and Knowledge Graph Reasoning 19th

A Fine-Grained Anomaly Detection Method Fusing Isolation For...

引用

19th International Conference on Web Information systems and Applications, WISA 2022

作者： Xu, Jie Zhou, Jiantao College of Computer Science Engineering Research Center of Ecological Big Data Ministry of Education National and Local Joint Engineering Research Center of Mongolian Intelligent Information Processing Technology Inner Mongolia Cloud Computing and Service Software Engineering Laboratory Inner Mongolia Social Computing and Data Processing Key Laboratory Inner Mongolia Discipline Inspection and Supervision Big Data Key Laboratory Inner Mongolia Big Data Analysis Technology Engineering Laboratory Inner Mongolia University Hohhot China

ISBN: (纸本)9783031203084

Anomaly detection aims to find outliers data that do not conform to expected behaviors in a specific scenario, which is indispensable and critical in current safety environments related studies. However, when performing outlier detection on a large-scale multidimensional dataset, most of the traditional methods make no distinctions between classes of outliers and lack the reasoning ability and the explainability of the analysis results, which leads to the low accuracy of global outlier detection and the inability to effectively identify local outliers. In this paper, we propose a fine-grained anomaly detection method which well utilizes isolation forest and knowledge graph reasoning tactics. First, a better extracting data feature method and a more reasonable weighted strategy are used to find global outliers based on the traditional isolation forest algorithm, and then we construct a custom rule base according to the in-depth research and analysis of global abnormal data, and at last the ontology knowledge is reasoned based on such rule base to achieve the detection of local outliers. Through analysis of extensive experiment results, our method could effectively discover more abnormal data without big loss of time costs, has strong generalization, and correspondingly improves the performance for abnormal detection. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：