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

arXiv 2025年

作者： Zhu, Huilin Yuan, Jingling Yang, Zhengwei Guo, Yu Zhong, Xian He, Shengfeng Hubei Key Laboratory of Transportation Internet of Things Wuhan University of Technology China School of Computing and Information Systems Singapore Management University Singapore School of Computer Science Wuhan University China School of Navigation Wuhan University of Technology China

In class-agnostic object counting, the goal is to estimate the total number of object instances in an image without distinguishing between specific categories. Existing methods often predict this count without considering class-specific outputs, leading to inaccuracies when such outputs are required. These inaccuracies stem from two key challenges: 1) the prevalence of single-category images in datasets, which leads models to generalize specific categories as representative of all objects, and 2) the use of mean squared error loss during training, which applies uniform penalization. This uniform penalty disregards errors in less frequent categories, particularly when these errors contribute minimally to the overall loss. To address these issues, we propose FocalCount, a novel approach that leverages diverse feature attributes to estimate the number of object categories in an image. This estimate serves as a weighted factor to correct class-count imbalances. Additionally, we introduce Focal-MSE, a new loss function that integrates binary cross-entropy to generate stronger error gradients, enhancing the model’s sensitivity to errors in underrepresented categories. Our approach significantly improves the model’s ability to distinguish between specific classes and general counts, demonstrating superior performance and scalability in both few-shot and zero-shot scenarios across three object counting datasets. The code will be released soon. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unknown-Aware Bilateral Dependency Optimization for Defending Against Model Inversion Attacks

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年 PP卷 PP页

作者： Peng, Xiong Liu, Feng Wang, Nannan Lan, Long Liu, Tongliang Cheung, Yiu-Ming Han, Bo Hong Kong Baptist University Department of Computer Science Hong Kong The University of Melbourne School of Computing and Information Systems Australia Xidian University State Key Laboratory of Integrated Services Networks School of Telecommunications Engineering Shaanxi Xi'an710071 China National University of Defense Technology State Key Laboratory of High Performance Computing School of Computer Hunan Changsha410000 China The University of Sydney Sydney AI Centre School of Computer Science Faculty of Engineering Australia

By abusing access to a well-trained classifier, model inversion (MI) attacks pose a significant threat as they can recover the original training data, leading to privacy leakage. Previous studies mitigated MI attacks by imposing regularization to reduce the dependency between input features and outputs during classifier training, a strategy known as unilateral dependency optimization. However, this strategy contradicts the objective of minimizing the supervised classification loss, which inherently seeks to maximize the dependency between input features and outputs. Consequently, there is a trade-off between improving the model's robustness against MI attacks and maintaining its classification performance. To address this issue, we propose the bilateral dependency optimization strategy (BiDO), a dual-objective approach that minimizes the dependency between input features and latent representations, while simultaneously maximizing the dependency between latent representations and labels. BiDO is remarkable for its privacy-preserving capabilities. However, models trained with BiDO exhibit diminished capabilities in out-of-distribution (OOD) detection compared to models trained with standard classification supervision. Given the open-world nature of deep learning systems, this limitation could lead to significant security risks, as encountering OOD inputs—whose label spaces do not overlap with the in-distribution (ID) data used during training-is inevitable. To address this, we leverage readily available auxiliary OOD data to enhance the OOD detection performance of models trained with BiDO. This leads to the introduction of an upgraded framework, unknown-aware BiDO (BiDO+), which mitigates both privacy and security concerns. As a highlight, with comparable model utility, BiDO-HSIC+ reduces the FPR95 by 55.02% and enhances the AUCROC by 9.52% compared to BiDO-HSIC, while also providing superior MI robustness. © 1979-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Modeling resource consumption in the US air transportation system via minimum-cost percolation

arXiv

引用

arXiv 2025年

作者： Kim, Minsuk Diggans, C. Tyler Radicchi, Filippo Center for Complex Networks and Systems Research Luddy School of Informatics Computing and Engineering Indiana University BloomingtonIN47408 United States Air Force Research Laboratory’s Information Directorate RomeNY13441 United States

We introduce a dynamic percolation model aimed at describing the consumption, and eventual exhaustion, of resources in transportation networks. In the model, rational agents progressively consume the edges of a network along demanded minimum-cost paths. As a result, the network undergoes a transition between a percolating phase where it can properly serve demand to a non-percolating phase where demand can no longer be supplied. We apply the model to a weighted, directed, temporal, multi-layer network representation of the air transportation system that can be generated using real schedules of commercial flights operated by US carriers. We study how cooperation among different carriers could improve the ability of the overall air transportation system in serving the demand of passengers, finding that unrestricted cooperation could lead to a 30% efficiency increase compared to the non-cooperative scenario. Cooperation would require major airlines to share a significant portion of their market, but it would allow also for an increased robustness of the system against perturbations causing flight cancellations. Our findings underscore some key benefits that could emerge by simply promoting code-share arrangements among US airlines without altering their current cost of operation. © 2025, CC BY.

关键词： Air transportation

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

arXiv

引用

arXiv 2025年

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China School of Computing Australian National University Canberra Australia

The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this paper, we study the problem of minimizing the Kirchhoff index by adding edges. We first provide a greedy algorithm for solving this problem and give an analysis of its quality based on the bounds of the submodularity ratio and the curvature. Then, we introduce a gradient-based greedy algorithm as a new paradigm to solve this problem. To accelerate the computation cost, we leverage geometric properties, convex hull approximation, and approximation of the projected coordinate of each point. To further improve this algorithm, we use pre-pruning and fast update techniques, making it particularly suitable for large networks. Our proposed algorithms have nearly-linear time complexity. We provide extensive experiments on ten real networks to evaluate the quality of our algorithms. The results demonstrate that our proposed algorithms outperform the state-of-the-art methods in terms of efficiency and effectiveness. Moreover, our algorithms are scalable to large graphs with over 5 million nodes and 12 million edges. Copyright © 2025, The Authors. All rights reserved.

关键词： Consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

J-OPT: A joint host and network optimization algorithm for energy-efficient workflow scheduling in cloud data centers 19

J-OPT: A joint host and network optimization algorithm for e...

引用

12th IEEE/ACM International Conference on Utility and cloud computing, UCC 2019

作者： Jayanetti, Amanda Buyya, Rajkumar Cloud Computing and Distributed Systems Laboratory School of Computing and Information Systems University of Melbourne Australia

ISBN: (纸本)9781450368940

Workflows are a popular application model used for representing scientific as well as commercial applications, and cloud data centers are increasingly used in the execution of workflow applications. Existing approaches to energy-efficient workflow scheduling in cloud computing environments have primarily focused on the optimization of server utilization. The majority of works have ignored the impact of scheduling decisions on the data center network (DCN). However, studies have revealed that the DCN consumes 10-20% of the total data center power, and this percentage could rise much higher depending on the utilization level of the data center. This paper proposes an energy-efficient workflow scheduling approach (J-OPT) that jointly optimizes the power consumption of servers and networking elements in cloud data centers. J-OPT considers precedence constraints and data dependencies among workflow tasks as well as communication requirements among task instances in the formulation of topology-aware scheduling decisions. The proposed approach is evaluated using synthetic and real world workflow traces in a simulated environment. Results of the experiments demonstrate that J-OPT outperforms state-of-the-art algorithms in terms of total power savings by 8% and 30% under high and low data center utilization levels, respectively. © 2019 Association for computing Machinery.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

CacheAlarm: Monitoring Sensitive Behaviors of Android Apps Using Cache Side Channel

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Tian, Jianwen Ma, Haoyu Gao, Debin Kuang, Xiaohui Academy of Military Sciences Institute of System Engineering China Beijing Jiaotong University School of Cyberspace Science and Technology Beijing100044 China Beijing Jiaotong University Beijing Key Laboratory of Security and Privacy in Intelligent Transportation Beijing100045 China Singapore Management University School of Computing and Information Systems Singapore

Malware attack has been a serious threat to the security and privacy of both individual and corporation users of the Android platform. Business entities seek to protect themselves by means of monitoring privacy-related sensitive behaviors conducted on company-issued Android devices. However, due to Android's own access control and privacy protection policies, this is difficult to be done with third-party apps using only normal privileges. Existing works proposed using side-channel readings from leaky APIs and system virtual files to speculate runtime app behaviors, which could be unreliable due to future system updates (that ban exploited resources), hardware jittering, etc. In this paper, we argue that a more traditional side-channel attack strategy, namely the CPU-cache-based side channel, could be exploited in the benign scenario of app behavior surveillance. Specifically, we propose CacheAlarm, a sensitive app behavior monitor and foreground app identification system, which works by measuring cache side-channel readings of selected methods within the Android framework, and conducted in-lab and in-the-wild user studies to compare the effectiveness of our scheme against SideNet, a previous Android app behavior surveillance scheme using API-based side channels. Results of the studies suggested that CacheAlarm outperforms SideNet on the accuracy of detecting sensitive behaviors in addition to gaining the capability of detecting apps running at foreground of the user device. © 2025 IEEE. All rights reserved.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

Family of Mutually Uncorrelated Codes for DNA Storage Address Design

IEEE Transactions on Nanobioscience

引用

IEEE Transactions on Nanobioscience 2025年 PP卷 PP页

作者： Liu, Zhenlu Cao, Ben Shao, Qi Zheng, Yanfen Wang, Bin Zhou, Shihua Zheng, Pan Dalian University Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian116622 China Dalian University of Technology School of Computer Science and Technology Dalian116024 China University of Canterbury Upper Riccarton Department of Accounting and Information Systems Christchurch8140 New Zealand

Deoxyribonucleic acid (DNA) has become an ideal medium for long-term storage and retrieval due to its extremely high storage density and long-term stability. But access efficiency is an existing bottleneck in DNA storage, especially the lack of high-quality random access address sequences. Therefore, in this paper, we report a series of approaches based on k-weakly mutually uncorrelated (k-WMU) codes to design the address sequence to improve the access efficiency of DNA storage. To address the problem of DNA sequences that are poorly scalable at the base level, we propose a 0-m-ruling coding scheme combined with k-WMU codes that can make address sequences avoid generating secondary structure with stem lengths ranging from 3 to 9. Based on the decoupled structure, We further extend the k-WMU codes with error correction function while satisfying combinatorial biological constraints. In order to investigate the performance of the designed address sequences for real-world applications, we perform simulation experiments based on thermodynamic properties and error correction capability as well as compared the minimum free energy (MFE), melting temperature (TM), and average decoding success rate (ADSR) with previous work. The results show that designed address sequences have a high MFE value and ADSR and a substantial reduction in TM-variance while satisfying the combinatorial biological constraints. As the quality of address sequences improves, this will help to achieve accurate random access as well as enhance the robustness of the DNA storage system. © 2002-2011 IEEE.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

QoS-Based Beamforming and Compression Design for Cooperative Cellular Networks via Lagrangian Duality

引用

IEEE Transactions on Signal Processing 2025年

作者： Fan, Xilai Liu, Ya-Feng Liu, Liang Chang, Tsung-Hui Chinese Academy of Sciences State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Beijing100190 China The Hong Kong Polytechnic University Department of Electronic and Information Engineering Hong Kong Hong Kong The Chinese University of HongKong School of Science and Engineering Shenzhen Shenzhen China Shenzhen Research Institute of Big Data China

This paper considers the quality-of-service (QoS)-based joint beamforming and compression design problem in the downlink cooperative cellular network, where multiple relay-like base stations (BSs), connected to the central processor via ratelimited fronthaul links, cooperatively transmit messages to the users. The problem of interest is formulated as the minimization of the total transmit power of the BSs, subject to all users' signal-to-interference-plus-noise ratio (SINR) constraints and all BSs' fronthaul rate constraints. In this paper, we first show that there is no duality gap between the considered joint optimization problem and its Lagrangian dual by showing the tightness of its semidefinite relaxation (SDR). Then, we propose an efficient algorithm based on the above duality result for solving the considered problem. The proposed algorithm judiciously exploits the special structure of an enhanced Karush-Kuhn-Tucker (KKT) conditions of the considered problem and approaches the solution that satisfies the enhanced KKT conditions via two fixed point iterations. Two key features of the proposed algorithm are: (1) it is able to detect whether the considered problem is feasible or not and find its globally optimal solution when it is feasible;(2) it is highly efficient because both of the fixed point iterations in the proposed algorithm are linearly convergent and function evaluations in the fixed point iterations are computationally cheap. Numerical results show the global optimality and efficiency of the proposed algorithm. © 1991-2012 IEEE.

关键词： Lagrange multipliers

来源：评论

学校读者我要写书评

暂无评论

Correction to: A comprehensive performance evaluation of container migration strategies

引用

computing 2025年第4期107卷 1-2页

作者： Feitosa, Leonel Barbosa, Vandirleya Sabino, Arthur Lima, Luiz Nelson Fé, Iure Silva, Luis Guilherme Callou, Gustavo Carvalho, Juliana Leão, Erico Nguyen, Tuan Anh Rego, Paulo Silva, Francisco Airton Laboratory of Applied Research to Distributed Systems (PASID) Federal University of Piauí (UFPI) Picos Brazil Department of Computing Federal Rural University of Pernambuco (UFRPE) Recife Brazil Department of Software Engineering Faculty of Information Technology University of Industry and Trade (HUIT) Ho Chi Minh City Vietnam Department of Computer Science Federal University of Ceará (UFC) Fortaleza Brazil

来源：评论

学校读者我要写书评

暂无评论

Foreign‐Object Detection in High‐Voltage Transmission Line Based on Improved YOLOv8m

arXiv

引用

arXiv 2025年

作者： Wang, Zhenyue Yuan, Guowu Zhou, Hao Ma, Yi Ma, Yutang School of Information Science and Engineering Yunnan University Kunming650504 China Electric Power Research Institute Yunnan Power Grid Co. Ltd. Kunming650214 China Yunnan Key Laboratory of Intelligent Systems and Computing Kunming650504 China

The safe operation of high‐voltage transmission lines ensures the power grid’s security. Various foreign objects attached to the transmission lines, such as balloons, kites and nesting birds, can significantly affect the safe and stable operation of high‐voltage transmission lines. With the advancement of computer vision technology, periodic automatic inspection of foreign objects is efficient and necessary. Existing detection methods have low accuracy because foreign objects attached to the transmission lines are complex, including occlusions, diverse object types, significant scale variations, and complex backgrounds. In response to the practical needs of the Yunnan Branch of China Southern Power Grid Co., Ltd., this paper proposes an improved YOLOv8m‐based model for detecting foreign objects on transmission lines. Experiments are conducted on a dataset collected from Yunnan Power Grid. The proposed model enhances the original YOLOv8m by incorporating a Global Attention Module (GAM) into the backbone to focus on occluded foreign objects, replacing the SPPF module with the SPPCSPC module to augment the model’s multiscale feature extraction capability, and introducing the Focal‐EIoU loss function to address the issue of high‐ and low‐quality sample imbalances. These improvements accelerate model convergence and enhance detection accuracy. The experimental results demonstrate that our proposed model achieves a 2.7% increase in mAP_0.5, a 4% increase in mAP_0.5:0.95, and a 6% increase in recall. © 2025, CC0.

关键词： Power transmission lines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：