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

3DGCformer: 3-Dimensional Graph Convolutional transformer for multi-step origin–destination matrix forecasting

Applied Intelligence 2025年第6期55卷 1-18页

作者： Huang, Yiou Deng, Hao Zhao, Shengjie School of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Shanghai China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of Education Shanghai China

Forecasting Human mobility is of great significance in the simulation and control of infectious diseases like COVID-19. To get a clear picture of potential future outbreaks, it is necessary to forecast multi-step Origin–Destination (OD) matrices for a relatively long period in the future. However, multi-step Origin–Destination Matrix Forecasting (ODMF) is a non-trivial problem. First, previous ODMF models only forecast the OD matrix for the next time-step, and they cannot perform well on long-term multi-step forecasts due to error accumulation. Second, many ODMF methods capture spatial and temporal dependencies with separate modules, which is insufficient to model spatio-temporal correlations in the time-varying OD matrix sequence. To address the challenges in multi-step ODMF, we propose 3-Dimensional Graph Convolutional Transformer (3DGCformer). As an enhancement of the original 3DGCN, we propose a novel Origin–Destination Feature Propagation (ODFP) rule between 3DGCN layers and integrate 2 3DGCNs with different spatio-temporal graphs and corresponding feature propagation rules to model the formation of OD flows in a more comprehensive way. For multi-step forecasts, 3DGCformer uses Transformer to capture long-term global temporal dependency, and adapt its decoder using labeled tokens to avoid error accumulation and improve time efficiency. To avoid information loss as the number of regions increases, we propose a patch embedding approach to convert data from 3DGCNs to the Transformer module. We perform extensive experiments on 4 real-world human mobility datasets, and the results show that our proposed model outperforms the state-of-the-art methods. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Deep learning based water leakage detection for shield tunnel lining

引用

Frontiers of Structural and Civil Engineering 2024年第6期18卷 887-898页

作者： Shichang LIU Xu XU Gwanggil JEON Junxin CHEN Ben-Guo HE College of Computer Science Sichuan UniversityChengdu 610065China School of Computer Science and Engineering Northeastern UniversityShenyang 110004China Department of Embedded Systems Engineering Incheon National UniversityIncheon 22012Korea School of Software Dalian University of TechnologyDalian 116621China Key Laboratory of Ministry of Education on Safe Mining of Deep Metal Mines Northeastern UniversityShenyang 110819China

Shield tunnel lining is prone to water leakage,which may further bring about corrosion and structural damage to the walls,potentially leading to dangerous *** avoid tedious and inefficient manual inspection,many projects use artificial intelligence(Al)to detect cracks and water leakage.A novel method for water leakage inspection in shield tunnel lining that utilizes deep learning is introduced in this *** proposal includes a ConvNeXt-S backbone,deconvolutional-feature pyramid network(D-FPN),spatial attention module(SPAM).and a detection *** can extract representative features of leaking areas to aid inspection *** further improve the model's robustness,we innovatively use an inversed low-light enhancement method to convert normally illuminated images to low light ones and introduce them into the training *** experiments are performed,achieving the average precision(AP)score of 56.8%,which outperforms previous work by a margin of 5.7%.Visualization illustrations also support our method's practical effectiveness.

关键词： water leakage detection deep learning deconvolutional-feature pyramid spatial attention

来源：评论

学校读者我要写书评

暂无评论

A Memetic Algorithm Based Feature Weighting for Metabolomics Data Classification

引用

Chinese Journal of Electronics 2025年第4期23卷 706-711页

作者： Jiarui Zhou Zexuan Zhu Zhen Ji College of Biomedical Engineering and Instrument Science Zhejiang University Hangzhou China Shenzhen City Key Laboratory of Embedded System Design College of Computer Science and Software Engineering Shenzhen University Shenzhen China

A metaheuristic chain based memetic algorithm namely MCMA is proposed for the classification of metabolomics data. MCMA regards both global evolution and local search as equivalent elemental metaheuristics, and searches with a chain of metaheuristics performed alternatively on the target problem. A hidden Markov model based scheduling mechanism is employed in MCMA for the selection of metaheuristics. By using MCMA for optimizing the linkage weight vector, a feature weighting algorithm for metabolomics data is formed to identify relevant metabolite features and reveal their exact relationships with the given physiological states. An extreme learning machine based classifier is utilized in predicting the physiological states according to the weighted metabolite features. Experimental results on real metabolomics data of clinical liver transplantation demonstrate that the proposed feature weighting and classification method obtains better performance than the other compared algorithms.

关键词： Memetics Metabolomics Metaheuristics Urban areas Liver Prediction algorithms Search problems Physiology Vectors Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Makespan and Security-Aware Workflow Scheduling for Cloud Service Cost Minimization Using Firefly Optimizer 22nd

Makespan and Security-Aware Workflow Scheduling for Cloud ...

引用

22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022

作者： Zhou, Chengliang Wang, Tian Li, Liying Sun, Jin Zhou, Junlong School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China National Trusted Embedded Software Engineering Technology Research Center East China Normal University Shanghai200062 China

ISBN: (纸本)9783031226762

As efficient commercial information technology, cloud computing has attracted more and more users to submit their requests to the cloud platform and pay for them based on the amount and quality of services. One of the most important concerns of cloud service providers is to minimize the monetary cost for completing users’ requests while meeting constraints on the quality of services such as makespan and security. To solve this concern, this paper proposes a makespan and security-aware workflow scheduling method based on an improved firefly optimizer that consists of a new solution initialization scheme, a firefly position updating scheme, a firefly-to-solution mapping operator, and two task-to-virtual machine assignment schemes. We carry out extensive simulation experiments on real-world workflows to validate our proposed workflow scheduling method. The results reveal that the monetary cost reduction achieved by our method can be up to 54.0% compared to a baseline and two state-of-the-art approaches. © 2023, Springer Nature Switzerland AG.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

software Aided Analysis of EWL Based Quantum Games 1

引用

14th International Conference on Parallel Processing and Applied Mathematics, PPAM 2022

作者： Kotara, Piotr Zawadzki, Tomasz Rycerz, Katarzyna IBM Software Laboratory Kraków Poland AGH Institute of Computer Science al. Mickiewicza 30 Krakow30-059 Poland Academic Computer Centre Cyfronet AGH ul. Nawojki 11 Krakow30-950 Poland

ISBN: (数字)9783031304453

ISBN: (纸本)9783031304446

In this paper, we present the library supporting analysis of Eisert–Wilkens–Lewenstein (EWL) scheme [3] proposed as a quantum extension for 2 × 2 bimatrix games on the example of Prisoner’s Dilemma. Such schemes are often used as a basis for quantization in game theory field [8]. The proposed solution is based on modern approach combining symbolic and numerical calculations with the actual access to quantum simulators and real devices provided by IBM-Q. In particular, the library provides high-level functions for searching Nash equilibria in pure strategies as well as finding the best response cycles which can lead to the existence of Nash equilibria in mixed states [16]. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

SigmaRL: A Sample-Efficient and Generalizable Multi-Agent Reinforcement Learning Framework for Motion Planning

SigmaRL: A Sample-Efficient and Generalizable Multi-Agent Re...

引用

International Conference on Intelligent Transportation

作者： Jianye Xu Pan Hu Bassam Alrifaee Chair of Embedded Software (Informatik 11) RWTH Aachen University Germany Department of Computer Science RWTH Aachen University Germany Department of Aerospace Engineering University of the Bundeswehr Munich Germany

ISBN: (数字)9798331505929

ISBN: (纸本)9798331505936

This paper introduces an open-source, decentralized framework named SigmaRL, designed to enhance both sample effciency and generalization of multi-agent Reinforcement Learning (RL) for motion planning of connected and automated vehicles. Most RL agents exhibit a limited capacity to generalize, often focusing narrowly on specific scenarios, and are usually evaluated in similar or even the same scenarios seen during training. Various methods have been proposed to address these challenges, including experience replay and regularization. However, how observation design in RL affects sample efficiency and generalization remains an under-explored area. We address this gap by proposing five strategies to design information-dense observations, focusing on general features that are applicable to most traffic scenarios. We train our RL agents using these strategies on an intersection and evaluate their generalization through numerical experiments across completely unseen traffic scenarios, including a new intersection, an on-ramp, and a roundabout. Incorporating these information-dense observations reduces training times to under one hour on a single CPU, and the evaluation results reveal that our RL agents can effectively zero-shot generalize.

关键词： Training Focusing Reinforcement learning Games Feature extraction Planning Intelligent transportation systems

来源：评论

学校读者我要写书评

暂无评论

Heuristic Elastic Scaling for Kubernetes Heterogeneous Microservices 21

Heuristic Elastic Scaling for Kubernetes Heterogeneous Micro...

引用

21st International Conference on Networking, Sensing and Control, ICNSC 2024

作者： Wang, Song He, Sheng Ning, Yishuang Gao, Xiang Ding, Zhijun The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China The Department of Computer Science and Technology Tongji University Shanghai201804 China Kingdee Research Kingdee International Software Group Co. Ltd Shenzhen518057 China Intelligent Computing Facility Innovation Center ZhejiangLab Hangzhou30012 China

ISBN: (纸本)9798350365221

Kubernetes has become the basic platform for building cloud native applications. However, existing horizontal scaling methods based on Kubernetes have problems with resource redundancy. Furthermore, the combined horizontal and vertical scaling based on Kubernetes takes a long time. Regarding the issue above, first, we describe the execution processes of three scaling techniques and compare them in different dimensions;second, we construct a formal elastic scaling model for expansion scenarios, with the goal of minimizing the total cost;and third, we introduce a heuristic expansion algorithm after balancing resource redundancy and execution time as the heuristic information. The experiment results show that the elastic scaling algorithm proposed in this paper achieves better performance than other algorithms. © 2024 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Zram Instance Pool Framework for Adaptive Memory Compression in Resource-Sensitive embedded Operating Systems

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Deng, Yin Xie, Guoqi Xiong, Chenglai Zhao, Sirong Ren, Wei Li, Kenli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan Changsha410082 China Huawei Technology Co. Ltd. Central Software Institute Guangdong Shenzhen518129 China

Memory compression can reduce the size of the inactive data in the random access memory (RAM), thereby freeing up unused space and allowing more programs to run;however, current mainstream memory compression frameworks (e.g., Zram and Zswap) and algorithms (e.g., Zstd and Lz4) do not effectively solve the problem of increased CPU utilization, causing they cannot be directly applied to the resource-sensitive embedded operating system that is sensitive to both CPU utilization and memory usage. In this study, we develop a Zram instance pool framework called ZramPool for adaptive memory compression. The framework consists of the swap space with multiple Zram instances and the adaptive Zram compression module. Through introducing linear regression analysis, the number of Zram instances can be adaptively adjusted based on the size of the compressed data, allowing Zram instances to work in parallel to match the workload. In ZramPool, we achieve two different requirements of reducing CPU utilization while keeping compression speed and increasing compression speed while keeping CPU utilization. ZramPool is deployed in the embedded Linux OS with a 8GB memory size running on the ARMv8 architecture. For the first requirement, ZramPool can reduce CPU utilization by an average of 11.42% while the compression speed only decreases by an average of 2.4%. For the second requirement, ZramPool can increase compression speed by an average of 11.71% while the CPU utilization only increases by an average of 1.9%. © 1982-2012 IEEE.

关键词： Random access storage

来源：评论

学校读者我要写书评

暂无评论

A Novel Wideband CPW-Fed 5.8GHz RFID Tag Antenna

引用

Chinese Journal of Electronics 2023年第2期21卷 202-208页

作者： Huihui Li Xuanqin Mou Zhen Ji Hang Yu Yan Li Institute of Image Processing and Pattern Recognition Xi'an Jiaotong University Xi'an China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Key Laboratory of Embedded System Design Shenzhen China

A novel wideband 5.8GHz CPW-fed antenna is presented for Radio frequency identification (RFID) tag. Four U-shaped and four L-shaped branches are used as additional resonators to achieve wideband operation. The proposed antenna was analyzed numerically using the Method of moment (MOM) and the Finite element method (FEM). With the antenna size limited to $30\times 30 \text{mm}^{2}$ , the −10dB bandwidth obtained by MOM is 3.235GHz (5.765∼9GHz) and the −9.5dB band-width obtained by FEM is 2.74GHz (5.32∼8.06GHz), corresponding to 55.7% and 47.2% of the center frequency 5.8GHz respectively. Moreover, the simulated results show that the proposed antenna has gain of more than 4.8dBi and the radiation pattern is nearly omnidirectional in the H-plane. The measured −10dB bandwidth is 2.68GHz (5.63GHz∼8.31GHz), 46.2% of the 5.8GHz frequency. Furthermore, there are three measured resonant frequencies at 1.34GHz, 3.23GHz and 5.8GHz with lower than −10dB return loss respectively. The measurement result achieves a wideband RFID tag antenna performance and is in good agreement with the calculated results.

关键词： Antenna measurements Resonant frequency Loss measurement Frequency measurement Finite element analysis Broadband antennas RFID tags

来源：评论

学校读者我要写书评

暂无评论

Joint DNN Partition and Thread Allocation Optimization for Energy-Harvesting MEC Systems

Joint DNN Partition and Thread Allocation Optimization for E...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Yizhou Shi Liying Li Yue Zeng Peijin Cong Junlong Zhou School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China National Key Laboratory for Novel Software Technology Nanjing University Nanjing China National Mobile Communications Research Laboratory Southeast University Nanjing China Key Laboratory of Embedded System and Service Computing (Tongji University) Ministry of Education Shanghai China

ISBN: (数字)9783982674100

ISBN: (纸本)9798331534646

Deep neural networks (DNNs) have demonstrated exceptional performance, leading to diverse applications across various mobile devices (MDs). Considering factors like portability and environmental sustainability, an increasing number of MDs are adopting energy harvesting (EH) techniques for power supply. However, the computational intensity of DNNs presents significant challenges for their deployment on these resource-constrained devices. Existing approaches often employ DNN partition or offloading to mitigate the time and energy consumption associated with running DNNs on MDs. Nonetheless, existing methods frequently fall short in accurately modeling the execution time of DNNs, and do not consider to use thread allocation for further latency and energy consumption optimization. To solve these problems, we propose a dynamic DNN partition and thread allocation method to optimize the latency and energy consumption of running DNNs on EH-enabled MDs. Specifically, we first investigate the relationship between DNN inference latency and allocated threads and establish an accurate DNN latency prediction model. Based on the prediction model, a DRL-based DNN partition (DDP) algorithm is designed to find the optimal partitions for DNNs. A thread allocation (TA) algorithm is proposed to reduce the inference latency. Experimental results from our test-bed platform demonstrate that compared to four benchmarking methods, our scheme can reduce DNN inference latency and energy consumption by up to 37.3% and 38.5%.

关键词： Energy consumption Instruction sets Heuristic algorithms Artificial neural networks Predictive models Prediction algorithms Inference algorithms Partitioning algorithms Resource management Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：