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

ACDV: Adaptive Content Delivery for Vehicular Digital Twin Networks

IEEE Transactions on Vehicular Technology 2025年第5期74卷 7084-7098页

作者： Zheng, Jinkai Luan, Tom H. Li, Guanjie Yin, Zhisheng Wu, Yuan Dong, Mianxiong Dongguan University of Technology School of Electrical Engineering and Intelligentization Dongguan523808 China Xi'an Jiaotong University School of Cyber Science and Engineering Xi'an710049 China Xidian University School of Cyber Engineering Xi'an710071 China Singapore University of Technology and Design Information Systems Technology and Design Pillar 487372 Singapore Xidian University State Key Laboratory of Isn Xi'an710071 China University of Macau State Key Laboratory of Internet of Things for Smart City 999078 China University of Macau Department of Computer Information Science 999078 China Muroran Institute of Technology Department of Sciences and Informatics Muroran05-08585 Japan

Digital Twins (DTs), serving personalized cloud-based digital assistants, hold great promise for supporting infotainment applications of the Internet of Vehicles (IoVs), in which personalized content such as high-definition maps, system updates, and social video streaming can be delivered from individualized DTs to vehicular users (VUEs) to enhance the intelligence of IoV services and improve their driving experience. This paper proposes a novel content caching framework tailored to DT-enabled IoVs, where DTs selectively cache on-demand contents on edge devices (i.e., cellular base stations and roadside units) managed by the edge service manager (ESM) along the VUE's trip to avoid backbone congestion yet save download time. However, ESMs are inherently selfish and reluctant to contribute resources to cache contents without benefits. Furthermore, considering the diverse trajectories of vehicles, it is inefficient to cache data along a single path. To address these challenges, we propose ACDV, which first models the interactions between the ESMs and DTs as a Stackelberg game to incentivize ESMs to actively participate in the content caching process. We then deploy a Markov model to predict the VUE distribution, which enables DTs to cache contents with a focus on predicted trajectories. To save storage costs, we derive an upper bound of content sizes that the VUE can download within a limited network connection time. Considering the lack of network information and users' private utility model in practical scenarios, we further develop a learning-based algorithm to find the optimal pricing scheme and content size strategies of ESMs and DTs. Through extensive simulations, we show that our proposal can effectively find the optimal strategy and achieve a fast convergence speed and high-level performance compared to the baselines. © 1967-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Prescriptive Analytics for Logistics: Bridging Predictive Models and Actionable Decisions Through Advanced Optimization Techniques

Prescriptive Analytics for Logistics: Bridging Predictive Mo...

引用

Innovative Research in Applied science, engineering and Technology (IRASET),Conference on

作者： Oussama El Azzouzy Tarik Chanyour Said Jai Andaloussi Department of Mathematics and Computer Science Laboratory of Data Engineering and Intelligent Systems(LIDSI) Hassan II University Casablanca Morocco

ISBN: (数字)9798331532970

ISBN: (纸本)9798331532987

Modern logistics is facing increasing challenges due to the growing complexity of supply chains, high consumer expectations, and economic and environmental pressures. While predictive analytics, powered by artificial intelligence (AI) and massive data, has transformed the ability to forecast trends and risks, its application remains limited by the lack of effective mechanisms to convert these predictions into actionable decisions in dynamic and constrained environments. This paper proposes an innovative hybrid approach that combines advanced predictive models, notably the Temporal Fusion Transformer (TFT), with prescriptive algorithms, such as linear programming and deep reinforcement learning (DRL). The TFT demonstrated superior performance in terms of predictive accuracy (significant reduction in MAE, RMSE, and MAPE), while the prescriptive algorithms optimized complex logistics decisions in real time, even in uncertain environments. This integrated methodology was validated through use cases simulating critical logistics scenarios, such as delivery route optimization. Experimental results show a substantial improvement in operational efficiency, with reductions in costs, lead times and resource utilization. The prescriptive approach made it possible to automate complex decisions, while taking into account multiple constraints, such as costs, lead times and sustainability objectives. By integrating real-time data collected via IoT devices and logistics management systems, this architecture offers a robust, adaptable and scalable solution. It thus meets the requirements of modern logistics by enabling proactive, optimized and resilient decision-making. This research makes a significant contribution by bridging the gap between predictive and prescriptive analysis, while laying the foundations for new applications in the field of intelligent logistics.

关键词： Costs Supply chains Predictive models Prediction algorithms Linear programming Transformers Real-time systems Thin film transistors Resource management Optimization

来源：评论

学校读者我要写书评

暂无评论

Refining Boundary Sample Space for Differentiable Rendering 16

Refining Boundary Sample Space for Differentiable Rendering

引用

2024 16th International Conference on Graphics and Image Processing, ICGIP 2024

作者： Gao, Ruicheng Qi, Yue State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing100191 China Jingdezhen Research Institute Beihang University Jingdezhen333000 China Qingdao Research Institute Beihang University Qingdao266104 China

ISBN: (数字)9781510688780

ISBN: (纸本)9781510688773

The objective of physics-based differentiable rendering (PBDR) is to propagate gradients between scene parameters and the intensities of image pixels in a manner that is physically correct. The gradients obtained can be applied in optimization algorithms for the reconstruction of 3D geometry or materials, or they can be further propagated into neural network to learn neural representations of the scene. However, applying automatic differentiation techniques directly to the primary rendering process will result in biased gradients, as the rendering integral contains moving high-dimensional discontinuities. Based on how these discontinuities are managed-either implicitly or explicitly-existing PBDR methods can be categorized into two groups: reparameterization methods and boundary sampling methods. Boundary sampling methods need to construct paths that have one segment tangent to the geometry being differentiated in order to estimate a boundary integral to address the discontinuities explicitly. Such paths are usually constructed by sampling the tangent segment first and then extending it to complete the paths for subsequent processing. Fortunately, the number of dimensions in the space composed of such tangent segments is only three. In scenes comprised solely of triangle meshes, the first dimension is used to parameterize all the edges on the mesh, which determines a point on the tangent segment. The remaining two dimensions are used to parameterize the direction of the tangent segment. However, state-of-the-art boundary sampling methods parameterize the first dimension uniformly, which is inefficient because only a small portion of the edges contributes to the boundary integral, resulting in wasted parameter space. In this paper, we parameterize the first dimension by considering both edge length and contributions, thereby allocating more parameter space to important edges. Experiments demonstrate that our methods achieve lower variance gradients in the forward dif

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

SPRGAN: Streamlined Progressive Refinement for Adversarial Point Cloud Video Upsampling

SPRGAN: Streamlined Progressive Refinement for Adversarial P...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Zhang, Zhiyong Liu, Ruyu Wang, Chaochao Zhang, Xianchao Zhang, Jianhua Liu, Xiufeng School of Computer Science and Engineering Tianjin University of Technology Tianjin China School of Information Science and Technology Hangzhou Normal University Hangzhou China Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems Jiaxing University Zhejiang China Department of Technology Management and Economics Technical University of Denmark Lyngby Denmark

ISBN: (纸本)9798350368741

Getting dense, uniform, time-series point cloud data is critical for effective rendering. However, due to the limited computational power of edge devices, existing methods cannot achieve real-time results, which affects the visual quality of the consumer experience. To effectively address this issue, this paper presents a self-supervised adversarial upsampling method for point cloud video streams called SPR-GAN. In the generator, we design the Temporal Iterative Graph module to learn local features for each frame and captures long-range spatial information using three iterations of graph convolution operations. Then the Contextual Temporal Fusion module is developed to merge information between different frames, synthesizing temporal information and enriching the dynamic feature representation of the point cloud. Meanwhile, in the discriminator, we introduce the Efficient Shape module. Through dynamic graph convolution operations and stacked learning, it significantly improves the resolution efficiency of global shape information in point clouds. The final experiments show that the proposed method exhibits high practicality and superiority. The model achieves a good result on both the D-FAUST and DeformingThing4D-Animals datasets. © 2025 IEEE.

关键词： point cloud sequence Point cloud upsampling self-supervised temporal aggregation

来源：评论

学校读者我要写书评

暂无评论

Correction to: Automated explainable and interpretable framework for anomaly detection and human activity recognition in smart homes (Neural Computing and Applications, (2025), 10.1007/s00521-025-10991-3)

引用

Neural Computing and Applications 2025年 1-2页

作者： Kim, Tae Hoon Ojo, Stephen Krichen, Moez Alamro, Meznah A. Mihoub, Alaeddine Sampedro, Gabriel Avelino School of Information and Electronic Engineering Zhejiang University of Science and Technology No. 318 Zhejiang Hangzhou China Department of Electrical and Computer Engineering College of Engineering Anderson University AndersonSC29621 United States Al-Baha University Al-Baha65528 Saudi Arabia ReDCAD Laboratory University of Sfax Sfax3038 Tunisia Department of Information Technology College of Computer and Information Science Princess Nourah Bint Abdul Rahman University Riyadh11564 Saudi Arabia Department of Management Information Systems College of Business and Economics Qassim University P.O. Box: 6640 Buraidah51452 Saudi Arabia Department of Computer Science University of the Philippines Diliman Quezon City1101 Philippines

In this article, the author’s name Stephen Ojo was incorrectly written as Stepehn Ojo and the affiliation details for author Stephen Ojo was incorrectly given as ‘Department of Electrical and computer engineering, College of engineering Anderson, Anderson University, Anderson, SC 29621, USA’ but should have been ‘Department of Electrical and computer engineering, College of engineering, Anderson University, Anderson, SC 29621, USA’. In addition, the affiliation details for author Gabriel Avelino Sampedro were incorrectly given as ‘College of computer Studies, De La Salle University, 2401 Taft Ave., Malate, 1004 Manila, Philippines and Faculty of Information and Communication Studies, University of the Philippines Open University, 4031 Los Baños, Philippines’ but should have been ‘Department of computer science, University of the Philippines Diliman, 1101 Quezon City, Philippines’. The original article has been corrected. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Globally Convergent Method for Computing B-stationary Points of Mathematical Programs with Equilibrium Constraints

arXiv

引用

arXiv 2025年

作者： Nurkanovic, Armin Leyffer, Sven Systems Control and Optimization Laboratory Department of Microsystems Engineering University of Freiburg Germany Mathematics and Computer Science Division Argonne National Laboratory United States

This paper introduces a method that globally converges to Bstationary points of mathematical programs with equilibrium constraints (MPECs) in a finite number of iterations. B-stationarity is necessary for optimality and means that no feasible first-order direction improves the objective. Given a feasible point of an MPEC, B-stationarity can be certified by solving a linear program with equilibrium constraints (LPEC) constructed at this point. The proposed method solves a sequence of LPECs, which either certify B-stationarity or provide an active-set estimate for the complementarity constraints, and nonlinear programs (NLPs) - referred to as branch NLPs (BNLPs) - obtained by fixing the active set in the MPEC. A BNLP is more regular than the MPEC, easier to solve, and with the correct active set, its solution coincides with the solution of the MPEC. The method has two phases: the first phase identifies a feasible BNLP or certifies local infeasibility, and the second phase solves a finite sequence of BNLPs until a B-stationary point of the MPECis found. The paper provides a detailed convergence analysis and discusses implementation details. In addition, extensive numerical experiments and an open-source software implementation are provided. The experiments demonstrate that the proposed method is more robust and faster than relaxation-based methods, while also providing a certificate of B-stationarity without requiring the usual too-restrictive *** Codes 90C30, 90C33, 49M37, 65K10, 90C11 © 2025, CC BY.

关键词： Nonlinear programming

来源：评论

学校读者我要写书评

暂无评论

SSCCPC-Net: Simultaneously Learning 2D and 3D Features with CLIP for Semantic Scene Completion on Point Cloud 41st

SSCCPC-Net: Simultaneously Learning 2D and 3D Features with...

引用

41st computer Graphics International Conference, CGI 2024

作者： Duan, Wantong Bao, Yongtang Qi, Yue State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University Beijing100191 China Shandong University of Science and Technology Qingdao266590 China Jingdezhen Research Institute of Beihang University Jingdezhen333000 China Qingdao Research Institute of Beihang University Qingdao266000 China

ISBN: (纸本)9783031820236

Compare to traditional Scene Completion (SC), Semantic Scene Completion (SSC) is a challenging task that aims to generate complete and semantically consistent 3D scene from partial and sparse input data, which is fundamental to fully understanding the scene and being able to interact with it. Consequently, the SSC task has received much attention in recent years. Most of the methods are voxel-based approaches, but they have high computational and memory requirements. A few works based on point cloud do not sufficiently exploit the correlation between semantic segmentation and geometric completion subtasks, while focusing too much on point cloud shape features and ignoring the rich texture information that RGB images can provide. In this paper, we present SSCCPC-Net (Semantic Scene Completion with CLIP on Point Cloud-Net), a novel network architecture for point cloud semantic scene completion using a combination of 2D and 3D features. Inspired by recent works of large pretrained vision-language models in semantic segmentation, we explore to accomplish SSC task with the help of Contrastive Language-Image Pre-Training (CLIP) model. Specifically, we use the CLIP features for guidance to fuse the 2D features extracted from the RGB image and the 3D features extracted from the point cloud. The fused features are then fed into our designed Semantic-Completion Decoder for per-point semantic prediction and semantic labeling-assisted point cloud completion. Finally, we obtain the complete semantically point cloud. Numerous experiments have demonstrated that our method has higher effectiveness and generalizability compared to state-of-the-art methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

PathGPT: Leveraging Large Language Models for Personalized Route Generation

arXiv

引用

arXiv 2025年

作者： Marcelyn, Steeve Cuthbert Gao, Yucen Zhang, Yuzhe Gao, Xiaofeng Chen, Guihai Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China

The proliferation of GPS-enabled devices has led to the accumulation of a substantial corpus of historical trajectory data. By leveraging these data for training machine learning models, researchers have devised novel data-driven methodologies that address the personalized route recommendation (PRR) problem. In contrast to conventional algorithms such as Dijkstra’s shortest path algorithm, these novel algorithms possess the capacity to discern and learn patterns within the data, thereby facilitating the generation of more personalized paths. However, once these models have been trained, their application is constrained to the generation of routes that align with their training patterns. This limitation renders them less adaptable to novel scenarios and the deployment of multiple machine learning models might be necessary to address new possible scenarios, which can be costly as each model must be trained separately. Inspired by recent advances in the field of Large Language Models (LLMs), we leveraged their natural language understanding capabilities to develop a unified model to solve the PRR problem while being seamlessly adaptable to new scenarios without additional training. To accomplish this, we combined the extensive knowledge LLMs acquired during training with further access to external hand-crafted context information, similar to RAG (Retrieved Augmented Generation) systems, to enhance their ability to generate paths according to user-defined requirements. Extensive experiments on different datasets show a considerable uplift in LLM performance on the PRR problem. © 2025, CC BY.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Experimental assessment of a semi-submersible floating solar platform subjected to wave and wind loading 6th

Experimental assessment of a semi-submersible floating solar...

引用

6th International Conference on Renewable Energies Offshore, RENEW 2024

作者： Campbell, M. Baruah, G. Karimirad, M. Van, M. Pakrashi, V. School of Natural and Built Environment Queen’s University Belfast Belfast United Kingdom School of Electronics Electrical Engineering and Computer Science Queen’s University Belfast Belfast United Kingdom UCD Centre for Mechanics Dynamical Systems and Risk Laboratory School of Mechanical and Materials Engineering University College Dublin Ireland

ISBN: (纸本)9781032905570

Floating solar platforms are subjected to coupled wave and wind induced responses, straddling the unpredictable wave-wind boundary layer. The simultaneous actions of these coupled responses in real sea conditions are not yet fully investigated for floating solar systems. The fluidstructure interactions are complex due to these coupled responses. The combined response to these wave and wind loads results in a coupled motion and tension in the mooring lines. This paper investigates the wave-only and wave-wind load case scenarios using scaled model wave tank testing. To study these scenarios, the Qualisys motion capture system is used to record the motions of the structure in the tank and load cells to record the mooring loads. This study investigates the correlation of wave, wind, motions, and mooring tension. The contribution of the wind loading component to the coupled wave-wind scenario is assessed and trends are determined for the wind loading contribution effects observed. © 2025 The Author(s).

关键词： Mooring

来源：评论

学校读者我要写书评

暂无评论

Binary Stochastic Flip Optimization for Training Binary Neural Networks

Binary Stochastic Flip Optimization for Training Binary Neur...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Tatsukichi Shibuya Nakamasa Inoue Rei Kawakami Ikuro Sato Department of Computer Science Institute of Science Tokyo Tokyo Japan Department of Systems and Control Engineering Institute of Science Tokyo Tokyo Japan Denso IT Laboratory Tokyo Japan

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

For deploying deep neural networks on edge devices with limited resources, binary neural networks (BNNs) have attracted significant attention, due to their computational and memory efficiency. However, once a neural network is binarized, finetuning it on edge devices becomes challenging because most conventional training algorithms for BNNs are designed for use on centralized servers and require storing real-valued parameters during training. To address this limitation, this paper introduces binary stochastic flip optimization (BinSFO), a novel training algorithm for BNNs. BinSFO employs a parameter update rule based on Boolean operations, eliminating the need to store real-valued parameters and thereby reducing memory requirements and computational overhead. In experiments, we demonstrated the effectiveness and memory efficiency of BinSFO in fine-tuning scenarios on six image classification datasets. BinSFO performed comparably to conventional training algorithms with a 70.7% smaller memory requirement. Code is released at https://***/TatsukichiShibuya/ICASSP2025_BinSFO

关键词： Training Speech coding Memory management Signal processing algorithms Signal processing Classification algorithms Servers Speech processing Optimization Image classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：