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

A Time-Driven Cloudlet Placement Strategy for Workflow Applications in Wireless Metropolitan Area Networks

学校读者我要写书评

暂无评论

Research Square

Research Square 2021年

作者： Zhang, Jianshan Li, Ming Zheng, Xianghan Hsu, Ching-Hsien College of Mathematics and Computer Science Fuzhou University Fuzhou China Fujian Provincial Key Laboratory Network Computing and Intelligent Information Processing Fuzhou China Department of Computer Science and Information Engineering Asia University Taichung Taiwan

With the rapid development of mobile technology, mobile applications have increasing requirements for computational resources, and mobile devices can no longer meet these requirements. Mobile edge computing (MEC) has emerged in this context and has brought innovation into the working mode of traditional cloud computing. By provisioning edge server placement, the computing power of the cloud centre is distributed to the edge of the network. The abundant computational resources of edge servers compensate for the lack of mobile devices and shorten the communication delay between servers and users. Constituting a specific forms of edge servers, cloudlets have been widely studied within academia and industry in recent years. However, existing studies have mainly focused on computation offloading for general computing tasks under fixed cloudlet placement positions. They ignored the impact on computation offloading results from cloudlet placement positions and data dependencies among mobile application components. In this paper, we study the cloudlet placement problem based on Workflow Applications (WAs) in Wireless Metropolitan Area Networks (WMANs). We devise a cloudlet placement strategy based on a Particle swarm optimization algorithm using Genetic algorithm operators with the Encoding Library updating mode (PGEL), which enables the cloudlet to be placed in appropriate positions. The simulation results show that the proposed strategy can obtain a near-optimal cloudlets placement scheme, and compared with other classic algorithms, this algorithm can reduce the execution time of WAs by 15.04%-44.99%. © 2021, CC BY.

关键词： computation offloading

MM-Pyramid: Multimodal Pyramid Attentional Network for Audio-Visual Event Localization and Video Parsing

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yu, Jiashuo Cheng, Ying Zhao, Rui-Wei Feng, Rui Zhang, Yuejie School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University China Academy for Engineering and Technology Fudan University China Shanghai Collaborative Innovation Center of Intelligent Visual Computing China

Recognizing and localizing events in videos is a fundamental task for video understanding. Since events may occur in auditory and visual modalities, multimodal detailed perception is essential for complete scene comprehension. Most previous works attempted to analyze videos from a holistic perspective. However, they do not consider semantic information at multiple scales, which makes the model difficult to localize events in different lengths. In this paper, we present a Multimodal Pyramid Attentional Network (MM-Pyramid) for event localization. Specifically, we first propose the attentive feature pyramid module. This module captures temporal pyramid features via several stacking pyramid units, each of them is composed of a fixed-size attention block and dilated convolution block. We also design an adaptive semantic fusion module, which leverages a unit-level attention block and a selective fusion block to integrate pyramid features interactively. Extensive experiments on audio-visual event localization and weakly-supervised audio-visual video parsing tasks verify the effectiveness of our approach. Copyright © 2021, The Authors. All rights reserved.

关键词： Semantics

Kernel-learning parameter prediction and evaluation in algebraic multigrid method for several PDEs

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Zhang, Juan Luo, Junyue Zhang, Fangfang Yue, Xiaoqiang Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

This paper explores the application of kernel learning methods for parameter prediction and evaluation in the Algebraic Multigrid Method (AMG), focusing on several Partial Differential Equation (PDE) problems. AMG is an efficient iterative solver for large-scale sparse linear systems, particularly those derived from elliptic and parabolic PDE discretizations. However, its performance heavily relies on numerous parameters, which are often set empirically and are highly sensitive to AMG’s effectiveness. Traditional parameter optimization methods are either computationally expensive or lack theoretical support. To address this, we propose a Gaussian Process Regression (GPR)-based strategy to optimize AMG parameters and introduce evaluation metrics to assess their effectiveness. Trained on small-scale datasets, GPR predicts nearly optimal parameters, bypassing the time-consuming parameter sweeping process. We also use kernel learning techniques to build a kernel function library and determine the optimal kernel function through linear combination, enhancing prediction accuracy. In numerical experiments, we tested typical PDEs such as the constant-coefficient Poisson equation, variable-coefficient Poisson equation, diffusion equation, and Helmholtz equation. Results show that GPR-predicted parameters match grid search results in iteration counts while significantly reducing computational time. A comprehensive analysis using metrics like mean squared error, prediction interval coverage, and Bayesian information criterion confirms GPR’s efficiency and reliability. These findings validate GPR’s effectiveness in AMG parameter optimization and provide theoretical support for AMG’s practical application. © 2025, CC BY.

关键词： Poisson equation

Chemical Environment Adaptive Learning for Optical Band Gap Prediction of Doped Graphitic Carbon Nitride Nanosheets

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Chen Xu, Enze Yang, Defu Yan, Chenggang Wei, Tao Chen, Hanning Wei, Yong Chen, Minghan Intelligent Information Processing Laboratory Hangzhou Dianzi University Hangzhou China Department of Computer Science Wake Forest University Winston-SalemNC United States Department of Chemical Engineering Howard University WashingtonDC United States Texas Advanced Computing Center The University of Texas at Austin AustinTX United States Department of Computer Science High Point University High PointNC United States

This study presents a new machine learning algorithm, named Chemical Environment Graph Neural Network (ChemGNN), designed to accelerate materials property prediction and advance new materials discovery. Graphitic carbon nitride (g-C3N4) and its doped variants have gained significant interest for their potential as optical materials. Accurate prediction of their band gaps is crucial for practical applications;however, traditional quantum simulation methods are computationally expensive and challenging to explore the vast space of possible doped molecular structures. The proposed ChemGNN leverages the learning ability of current graph neural networks (GNNs) to satisfactorily capture the characteristics of atoms' chemical environment underlying complex molecular structures. Our experimental results demonstrate more than 100% improvement in band gap prediction accuracy over existing GNNs on g-C3N4. Furthermore, the general ChemGNN model can precisely foresee band gaps of various doped g-C3N4 structures, making it a valuable tool for performing high-throughput prediction in materials design and development. Copyright © 2023, The Authors. All rights reserved.

关键词： Energy gap

Lane marking detection algorithm based on high-precision map and multisensor fusion

学校读者我要写书评

暂无评论

Lane marking detection algorithm based on high-precision map...

作者： Yao, Haichang Chen, Chen Liu, Shangdong Li, Kui Ji, Yimu Huang, Guangyan Wang, Ruchuan School of Computer Science Nanjing University of Posts and Telecommunications Nanjing China School of Computer and Software Nanjing Institute of Industry Technology Nanjing China Industrial Software Engineering Technology Research and Development Center of Jiangsu Education Department Nanjing Institute of Industry Technology Nanjing China Jiangsu HPC and Intelligent Processing Engineer Research Center Nanjing China Institute of High Performance Computing and Bigdata Nanjing University of Posts and Telecommunications Nanjing China School of Information Technology Deakin University Melbourne Australia

In case of sharp road illumination changes, bad weather such as rain, snow or fog, wear or missing of the lane marking, the reflective water stain on the road surface, the shadow obstruction of the tree, and mixed lane markings and other signs, missing detection or wrong detection will occur for the traditional lane marking detection algorithm. In this manuscript, a lane marking detection algorithm based on high-precision map and multisensor fusion is proposed. The basic principle of the algorithm is to use the centimeter-level high-precision positioning combined with high-precision map data to complete the detection of lane markings. In the process of generating high-precision maps or in the uncovered areas of high-precision maps, LIDAR (LIght Detection And Ranging) is used to estimate the curvature of the road to assist in lane marking detection. The experimental results show that the algorithm has lower false detection rate in case of bad road conditions, and the algorithm is robust. © 2020 John Wiley & Sons, Ltd.

关键词： Roads and streets

Learning Unified Embeddings for Recommendation via Meta-path Semantics 21

学校读者我要写书评

暂无评论

Learning Unified Embeddings for Recommendation via Meta-path...

29th ACM International Conference on Multimedia, MM 2021

作者： Hao, Qianxiu Xu, Qianqian Yang, Zhiyong Huang, Qingming Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing China Artificial Intelligence Research Center Peng Cheng Laboratory Shenzhen China

ISBN: (纸本)9781450386517

Heterogeneous information networks (HINs) have become a popular tool to capture complicated user-item relationships in recommendation problems in recent years. As a typical instantiation of HINs, meta-path is introduced in search of higher-level representations of user-item interactions. Though remarkable success has been achieved along this direction, existing meta-path-based recommendation methods face at least one of the following issues: 1) existing methods merely adopt simple meta-path fusion rules, which might be insufficient to exclude inconsistent information of different meta-paths that may hurt model performance;2) the representative power is limited by shallow/stage-wise formulations. To solve these issues, we propose an end-to-end and unified embedding-based recommendation framework with graph-based learning. To address 1), we propose a flexible fusion module to integrate meta-path-based similarities into relative similarities between users and items. To address 2), we take advantage of the powerful representative ability of deep neural networks to learn more complicated and flexible latent embeddings. Finally, empirical studies on real-world datasets demonstrate the effectiveness of our proposed method. © 2021 ACM.

关键词： Embeddings

On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering 14th

学校读者我要写书评

暂无评论

On Fixed-Order Book Thickness Parameterized by the Pathwidth...

14th International Conference on Algorithmic Aspects in information and Management, AAIM 2020

作者： Liu, Yunlong Chen, Jie Huang, Jingui Wang, Jianxin Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Computer Science and Engineering Central South University Changsha410083 China

ISBN: (纸本)9783030576011

Given a graph (Formula Presented) and a fixed linear order (Formula Presented) of V, the problem fixed-order book thickness asks whether there is a page assignment (Formula Presented) such that (Formula Presented) is a k-page book embedding of G. Recently, Bhore et al.(GD2019) presented an algorithm parameterized by the pathwidth of the vertex ordering (denoted by (Formula Presented)). In this paper, we first re-analyze the running time for Bhore et al.’s algorithm, and prove a bound of (Formula Presented) improving on Bhore et al.’s bound of (Formula Presented). We further show that this parameterized problem does not admit a polynomial kernel unless NP (Formula Presented) coNP/poly. Finally, we show that the general fixed-order book thickness problem, in which a budget of at most c crossings over all pages was given, admits an algorithm running in time (Formula Presented). © 2020, Springer Nature Switzerland AG.

关键词： Budget control

Lightweight Vision Model-based Multi-user Semantic Communication Systems

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Jiang, Feibo Tu, Siwei Dong, Li Wang, Kezhi Yang, Kun Liu, Ruiqi Pan, Cunhua Wang, Jiangzhou Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Information Science and Engineering Hunan Normal University Changsha410081 China School of Computer Science Hunan University of Technology and Business Changsha410205 China Xiangjiang Laboratory Changsha410205 China Department of Computer Science Brunel University London United Kingdom School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China Wireless and Computing Research Institute ZTE Corporation Beijing100029 China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China National Mobile Communications Research Laboratory Southeast University Nanjing China Purple Mountain Laboratories Nanjing China

Semantic Communication (SemCom) is a promising new paradigm for next-generation communication systems, emphasizing the transmission of core information, particularly in environments characterized by uncertainty, noise, and bandwidth constraints. However, existing image SemCom systems face several challenges, such as inefficient knowledge base construction, insufficient semantic encoding, and lack of multi-user semantic sharing. To address these issues, we propose a Lightweight Vision Model-based Multi-user Semantic Communication System (LVM-MSC). First, we construct a Lightweight Knowledge Base (LKB) based on the fast Segment Anything Model (SAM). LKB incorporates the extensive image knowledge of the SAM model while significantly reducing the number of parameters through its convolutional architecture. Next, we design an Efficient Semantic Codec (ESC) based on the Masked AutoEncoder (MAE) architecture. ESC enhances semantic compression at both the pixel and semantic levels and implements lightweight semantic decoding tailored for user devices. Furthermore, we propose a Multi-user Semantic Sharing (MSS) transmission for the multi-user SemCom. By calculating the similarity of semantic information among different users in the sharing semantic space, we unify the transmissions of similar semantic information through broadcasting, further improving the transmission efficiency. Finally, simulation results demonstrate the feasibility and effectiveness of the proposed LVM-MSC system. Copyright © 2025, The Authors. All rights reserved.

关键词： Latent semantic analysis

Ekblom Promoting Adaptive Algorithm for System Identification

学校读者我要写书评

暂无评论

TechRxiv

TechRxiv 2022年

作者： Huang, Xinqi Li, Yingsong Han, Xiao Tu, Huawei College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Anhui Hefei China College of Computer Science and Technology Harbin Engineering University Harbin150001 China Department of Computer Science and Information Technology La Trobe University MelbourneVIC3086 Australia

We propose an Ekblom promoting adaptive algorithm (EPAA) which uses Ekblom norm to construct a data reusing scheme to achieve better performance under impulsive noise (IN) environments. By exerting Ekblom-norm constraint on the a posterior error vector, a sliding window cost function is created to realize the EPAA that is derived to reduce IN effects. The derivation and theoretical convergence analysis of the EPAA are presented in detail. The simulation examples are setup to illustrate the superior performance of the EPAA compared to popular data reusing algorithms for system identification under IN environments. © 2022, CC BY.

关键词： Adaptive filtering