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

arXiv 2025年

作者： Zhang, Kunpeng Xu, Lei Yi, Xinlei Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai201210 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online nonconvex optimization with time-varying inequality constraints over a network of agents. For a time-varying graph, we propose a distributed online primal–dual algorithm with compressed communication to efficiently utilize communication resources. We show that the proposed algorithm establishes an O(T max{1−θ1,θ1}) network regret bound and an O(T 1−θ1/2) network cumulative constraint violation bound, where T is the number of iterations and θ1 ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints at all iterations), the network cumulative constraint violation bound is reduced to O(T 1−θ1). These bounds are comparable to the state-of-the-art results established by existing distributed online algorithms with perfect communication for distributed online convex optimization with (time-varying) inequality constraints. Finally, a simulation example is presented to validate the theoretical results. Copyright © 2025, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

DDCM: Cracking Anonymized Facial Images Using Denoising Diffusion Cryptanalytic Model

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Jiang, Donghua Ni, Jiangqun Alasbali, Nada Nafea, Ibtehal Liu, Qingliang Ahmad, Jawad Boulila, Wadii Sun Yat-sen University School of Computer Science and Engineering Guangzhou510006 China Sun Yat-sen University School of Cyber Science and Technology Shenzhen518107 China Peng Cheng Laboratory Department of New Networks Shenzhen518052 China King Khalid University College of Computer Science Department of Informatics and Computing Systems Abha61421 Saudi Arabia Taibah University College of Computer Science and Engineering Medina41477 Saudi Arabia Qingdao University of Science and Technology School of Mathematics and Physics Qingdao266061 China Prince Mohammad Bin Fahd University Cybersecurity Center Alkhobar Saudi Arabia Prince Sultan University Robotics and Internet-of-Things Laboratory Riyadh12435 Saudi Arabia

Currently, in consumer electronics industry, quite a number of E-healthcare products highly depend on consumers' facial biometrics for both disease diagnosis and identity authen-tication. In light of this, various facial privacy-preserving approa-ches oriented towards the internet of medical things have been proposed, including visual cryptography and desensitization tech-nique. Nevertheless, few attentions have been paid to investigating their countermeasure, i.e., facial privacy analysis, owning to significant distribution discrepancy between the original and anony-mized facial images. To this end, a general Denoising Diffusion Cryptanalytic Model (DDCM) is proposed in this paper to recon-struct the original facial images in a coarse-to-fine manner from their encrypted ones with diverse anonymous approaches. Spec-ifically, to accurately reconstruct the original facial image without any prior knowledge, a customized initial prediction module with an encoder-decoder structure is introduced by taking advantage of its leaked visual cues to generate the coarse face. Furthermore, the residual map between the original and coarse facial images is explicitly modeled with the output of the customized prediction module as a conditional prior, thereby obtaining a refined facial image. Finally, extensive experiments demonstrate that the propo-sed DDCM could not only effectively crack multiple handcrafted facial anonymization approaches, such as blurring, pixelation and thumbnail-preserving encryption, but also outperform the prev-ious works (e.g., Pix2Pix) in terms of image fidelity and attack success rate. © 1975-2011 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Strategic Pricing and Routing to Maximize Profit in Congested Roads Considering Interactions With Travelers

引用

IEEE Transactions on Control of Network systems 2025年

作者： Kim, Youngseo Duan, Ning Zardini, Gioele Samaranayake, Samitha Wischik, Damon Cornell University Civil and Environmental Engineering IthacaNY United States Cornell University Operations Research and Information Engineering IthacaNY United States Massachusetts Institute of Technology Laboratory for Information and Decision Systems CambridgeMA United States University of Cambridge Department of Computer Science and Technology Cambridge United Kingdom

We introduce an innovative approach for analyzing strategic interactions in transportation networks featuring Mobility-on-Demand (MoD) services. This study focuses on achieving company-traveler equilibria, whereby a single company optimizes pricing and routing decisions to maximize profitability while considering travelers' mode choices, modeled via a multinomial logit model (MNL). Although profit maximization problems have been extensively studied in the field of revenue management across various domains, their application to transportation networks poses unique challenges, such as the influence of network topology and additional constraints (e.g., flow conservation, rebalancing, etc.). To address the inherent non-linear relationship arising from endogenous travel demand, we shift our domain space from price to market share. Subsequently, we derive prices using a direct one-toone correspondence within the MNL. This work is the first effort in leveraging such novel techniques in the context of transportation network analysis. Remarkably, the proposed reformulation results in an equivalent problem exhibiting convexity, offering computational efficiency and interpretability. By solving the Karush-Kuhn-Tucker (KKT) conditions, we characterize user equilibrium with the generalized route cost, which incorporates the operating cost by rebalancing and travelers' disutility caused by congestion. Our approach is empirically validated through a numerical analysis conducted on the widely recognized Sioux Falls network. The results underscore the effectiveness and practical applicability of our method in analyzing transportation networks featuring MoD services, and open the stage for important future investigations. © 2014 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

Computing Power in the Sky: Digital Twin-assisted Collaborative Computing with Multi-UAV Networks

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Wang, Chao Han, Yu Zhang, Long Jia, Ziye Zhang, Hongliang Hong, Choong Seon Han, Zhu Hebei University of Engineering School of Information and Electrical Engineering Handan056038 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China Nanjing University of Aeronautics and Astronautics College of Electronic and Information Engineering Nanjing211106 China Southeast University National Mobile Communications Research Laboratory Jiangsu Nanjing211111 China Peking University State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Beijing100871 China Kyung Hee University Department of Computer Science and Engineering Gyeonggi-do Yongin-si17104 Korea Republic of University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

The collaboration of computing powers (CPs) among unmanned aerial vehicles (UAVs)-mounted edge servers is essential to handle data-intensive tasks of user equipments (UEs). This paper presents a multi-UAV computing power network (CPN) that orchestrates the CP resources of edge servers to cooperatively process tasks through collaborative computing. Due to the frequent interactions among edge servers and the increased complexities for large-scale task executions, we propose a digital twin (DT)-driven multi-UAV CPN framework, where the aerial DT network is created as a digital replica of the multi-UAV network to assist collaborative computing. A joint optimization problem of the service association, offloading power control, task partitions, CP allocation, and UAV trajectory design is formulated to minimize the long-term average delay of UEs. We use the Lyapunov technique to tackle the long-term energy constraint, forming a tractable optimization problem, which is modeled as a Markov decision process to balance the UAV's deficit queue stability and the UE's task completion delay. A hybrid soft actor-critic based deep reinforcement learning algorithm is developed to optimize the joint design by sampling the hybrid action from the Gumbel and Gaussian distributions. Simulation results verify that the multi-UAV CPN contributes to significant performance gains when supported by DTs. © 2025 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Fine-Grained Scheme for Distinguishing the Hotness of Warm Data to Reduce Segment Cleaning Overhead

SSRN

引用

SSRN 2025年

作者： Yang, Lihua Wang, Fang Lin, Weizhao Zhang, Wei Xiao, Yang Tan, Zhipeng Li, Jiaxin Lu, Kai College of Computer Science and Technology National University of Defense Technology Yanwachi Street Changsha410073 China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Huazhong University of Science and Technology Luoyu Road Wuhan430074 China

With the widespread adoption of flash memory, the Flash Friendly File System (F2FS) designed to flash memory characteristics has become widely-used in large data centers. However, F2FS encounters from significant cleaning overheads due to its logging scheme writes. We observe that warm data in F2FS account for a substantial proportion, at least 80%. Nevertheless, the mixed storage of warm data with varying hotness exacerbates segment cleaning challenges. To address this issue, we propose a scheme called M2H, which involves a fine-grained management of warm data hotness identified by the K-means clustering algorithm. M2H determines hotness by considering factors such as file block update distance, most recently used distance, and workload characteristics. M2H facilitates {M}ulti-log delayed writing and {M}odified segment cleaning based on {H}otness. To reduce costs associated with distinguishing data hotness at the file block level, we employ Mini Batch K-means and refer to this variant as M2H_MBK. Moreover, for servers equipped with GPUs, the clustering process can be offloaded to the GPU, known as M2H_GPU. We conduct a comprehensive comparison of traditional F2FS, M2H, M2H_MBK, and M2H_GPU on a real platform. Results show that compared to traditional F2FS, M2H_GPU reduces the number of segment cleanings by 54.41% to 97.93%. © 2025, The Authors. All rights reserved.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Identifying the net information flow direction pattern in mutually coupled non-identical chaotic oscillators

arXiv

引用

arXiv 2025年

作者： Ghosh, Anupam Liang, X. San Manshour, Pouya Paluš, Milan Department of Complex Systems Institute of Computer Science The Czech Academy of Sciences Prague18200 Czech Republic Division of Frontier Research Southern Marine Science and Engineering Guangdong Laboratory Zhuhai519000 China Department of Atmospheric & Oceanic Sciences Fudan University Shanghai200438 China

This paper focuses on a fundamental inquiry in a coupled oscillator model framework. It specifically addresses the direction of net information flow in mutually coupled non-identical chaotic oscillators. Adopting a specific form of conditional mutual information as a model-free and asymmetric index, we establish that if the magnitude of the maximum Lyapunov exponent can be defined as the ‘degree of chaos’ of a given isolated chaotic system, a predominant net information transfer exists from the oscillator exhibiting a higher degree of chaos to the other while they are coupled. We incorporate two distinct categories of coupled ‘non-identical’ oscillators to strengthen our claim. In the first category, both oscillators share identical functional forms, differing solely in one parameter value. We also adopt another measure, the Liang–Kleeman information flow, to support the generality of our results. The functional forms of the interacting oscillators are entirely different in the second category. We further extend our study to the coupled oscillator models, where the interacting oscillators possess different dimensions in phase space. These comprehensive analyses support the broad applicability of our results. © 2025, CC BY-NC-ND.

关键词： Chaotic systems

来源：评论

学校读者我要写书评

暂无评论

Sensing With Random Communication Signals

引用

IEEE Network 2025年

作者： Lu, Shihang Liu, Fan Xiong, Yifeng Du, Zhen Cui, Yuanhao Li, Shuangyang Yuan, Weijie Yang, Jie Jin, Shi Southeast University National Mobile Communications Research Laboratory Nanjing210096 China Beijing University of Posts and Telecommunications School of Information and Communication Engineering Beijing100876 China Nanjing University of Information Science and Technology School of Electronic and Information Engineering Nanjing210044 China Technical University of Berlin Faculty of Electrical Engineering and Computer Science Berlin10587 Germany Shenzhen518055 China Frontiers Science Center for Mobile Information Communication and Security China Southeast University MOE Key Laboratory of Measurement and Control of Complex Systems of Engineering Nanjing211189 China

Communication-centric Integrated Sensing and Communication (ISAC) has been recognized as a promising methodology to implement wireless sensing functionality over existing network architectures, due to its cost-effectiveness and backward compatibility to legacy cellular systems. However, the inherent randomness of the communication signal may incur huge fluctuations in sensing capabilities, leading to unfavorable detection and estimation performance. To address this issue, we elaborate on random ISAC signal processing methods in this article, aiming at improving the sensing performance without unduly deteriorating the communication functionality. Specifically, we commence by discussing the fundamentals of sensing with random communication signals, including the performance metrics and optimal ranging waveforms. Building on these concepts, we then present a general framework for random ISAC signal transmission, followed by an in-depth exploration of time-domain pulse shaping, frequency-domain constellation shaping, and spatial-domain precoding methods. We provide a comprehensive overview of each of these topics, including models, results, and design guidelines. Finally, we conclude this article by identifying several promising research directions for random ISAC signal transmission. © 2025 IEEE.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

SDSFusion: A Semantic-Aware Infrared and Visible Image Fusion Network for Degraded Scenes

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2025年 PP卷 PP页

作者： Jun Chen Liling Yang Wei Yu Wenping Gong Zhanchuan Cai Jiayi Ma School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Faculty of Engineering China University of Geosciences Wuhan China School of Computer Science and Engineering Macau University of Science and Technology Taipa Macau China Electronic Information School Wuhan University Wuhan China

A single-modal infrared or visible image offers limited representation in scenes with lighting degradation or extreme weather. We propose a multi-modal fusion framework, named SDSFusion, for all-day and all-weather infrared and visible image fusion. SDSFusion exploits the commonality in image processing to achieve enhancement, fusion, and semantic task interaction in a unified framework guided by semantic awareness and multi-scale features and losses. To address the disparity between infrared and visible images in degraded scenes, we differentiate modal features in a unified fusion model. Unlike existing joint fusion methods, we propose an adversarial generative network that refines the reconstruction of low-light images by embedding fused features. It provides feature-level brightness supplementation and image reconstruction to refine brightness and contrast. Extensive experiments in degraded scenes confirm that our approach is superior to state-of-the-art approaches in visual quality and performance, demonstrating the effectiveness of interaction improvement. The code will be posted at: https://***/Liling-yang/SDSFusion.

关键词： Degradation Image fusion Semantics Training Visualization Meteorology Feature extraction Lighting Image segmentation Brightness

来源：评论

学校读者我要写书评

暂无评论

Nested Named Entity Recognition: A Survey of Latest Research

引用

Expert systems 2025年第7期42卷

作者： Ji, Lixia Dang, Yiping Du, Yunlong Gao, Wenzhao Zhang, Han School of Cyber Science and Engineering Zhengzhou University Zhengzhou China College of Computer Science Sichuan University Chengdu China Intelligent Systems Research Centre School of Computing Engineering & Intelligent Systems Ulster University Belfast United Kingdom Intelligent Policing Key Laboratory of Sichuan Province Sichuan Police College Luzhou China

The research on nested named entity recognition (NER) is conducive to providing richer semantic representations and capturing the nested structure among entities, which is crucial for the execution of downstream tasks. This paper aims to summarise the nested NER methods that have been combined with emerging technologies in recent years. We summarise the nested NER methods that are integrated with emerging technologies from three dimensions: model, framework, and data. Additionally, we explore the research progress of nested NER in two scenarios: cross-lingual modality and multi-modal in different modalities. Furthermore, we discuss the practical applications of NER technology in five fields: biomedicine, justice, finance, media, and e-commerce. Through this review, we can clearly see the development trends of nested NER technology under emerging technologies and different modalities, as well as its broad application prospects in various fields. This provides a reference for future exploration directions in nested NER. © 2025 John Wiley & Sons Ltd.

关键词： application fields modal nested named entity recognition new technologies

来源：评论

学校读者我要写书评

暂无评论

Uncertainty Quantification and Quality Control for Heatmap-based Landmark Detection Models

引用

IEEE Transactions on Medical Imaging 2025年

作者： Feng, Yong Yang, Jinzhu Tang, Lingzhi Sun, Song Wang, Yonghuai Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang China Northeastern University School of Computer Science and Engineering Shenyang China National Frontiers Science Center for Industrial Intelligence and Systems Optimization Shenyang China The First Hospital of China Medical University Department of Cardiovascular Ultrasound Shenyang China

Uncertainty quantification is a vital aspect of explainable artificial intelligence that fosters clinician trust in medical applications and facilitates timely interventions, leading to safer and more reliable outcomes. Although deep learning models have reached clinically acceptable accuracy in anatomical landmark detection, their predictions remain susceptible to contextual noise due to the small size of the target structures, making uncertainty quantification more challenging than in classification and segmentation tasks. This paper presents an end-to-end uncertainty quantification method tailored for heatmapbased anatomical landmark detection models, designed to improve both interpretability and controllability in clinical applications. Leveraging Dempster-Shafer Theory and Subjective Logic Theory, we implement probability assignment and uncertainty quantification through a single forward pass to ensure computational efficiency. We introduce an evidence map that captures the strength of landmark evidence, alongside an uncertainty map that calibrates predicted probabilities within the Subjective Logic framework. The interaction between these two components, facilitated by a cross-attention mechanism, further improves landmark detection accuracy and enhances the effectiveness of uncertainty quantification. Experimental results demonstrate that the proposed method maintains detection accuracy, even in noisy environments, while outperforming state-of-the-art methods in terms of uncertainty quantification and quality control. Furthermore, the model effectively identifies out-of-distribution data solely through calibrated probabilities when encountering inconsistencies in multi-center data and novel data, underscoring its potential for clinical applications. © 1982-2012 IEEE.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：