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

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

来源：评论

学校读者我要写书评

暂无评论

3+ Seat Risk-Limiting Audits for Single Transferable Vote Elections

arXiv

引用

arXiv 2025年

作者： Blom, Michelle Ek, Alexander Stuckey, Peter J. Teague, Vanessa Vukcevic, Damjan School of Computing and Information Systems University of Melbourne Parkville Australia Department of Econometrics and Business Statistics Monash University Clayton Australia Department of Data Science and AI Monash University Clayton Australia Thinking Cybersecurity Pty. Ltd. Melbourne Australia

Constructing efficient risk-limiting audits (RLAs) for multi-winner single transferable vote (STV) elections is a challenging problem. An STV RLA is designed to statistically verify that the reported winners of an election did indeed win according to the voters’ expressed preferences and not due to mistabulation or interference, while limiting the risk of accepting an incorrect outcome to a desired threshold (the risk limit). Existing methods have shown that it is possible to form RLAs for two-seat STV elections in the context where the first seat has been awarded to a candidate in the first round of tabulation. This is called the first winner criterion. We present an assertion-based approach to conducting full or partial RLAs for STV elections with three or more seats, in which the first winner criterion is satisfied. Although the chance of forming a full audit that verifies all winners drops substantially as the number of seats increases, we show that we can quite often form partial audits that verify most, and sometimes all, of the reported winners. We evaluate our method on a dataset of over 500 three- and four-seat STV elections from the 2017 and 2022 local council elections in Scotland. Copyright © 2025, The Authors. All rights reserved.

关键词： Seats

来源：评论

学校读者我要写书评

暂无评论

RIS-Assisted Passive Localization (RAPL): An Efficient Zero-Overhead Framework Using Conditional Sample Mean

arXiv

引用

arXiv 2025年

作者： Yao, Jiawei Mao, Yijie Chen, Mingzhe Hu, Ye School of Information Science and Technology ShanghaiTech University Shanghai201210 China Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States Department of Industrial and Systems Engineering University of Miami Coral GablesFL33146 United States

Reconfigurable Intelligent Surface (RIS) has been recognized as a promising solution for enhancing localization accuracy. Traditional RIS-based localization methods typically rely on prior channel knowledge, beam scanning, and pilot-based assistance. These approaches often result in substantial energy and computational overhead, and require real-time coordination between the base station (BS) and the RIS. To address these challenges, in this work, we move beyond conventional methods and introduce a novel data-driven, multiple RISs-assisted passive localization approach (RAPL). The proposed method includes two stages, the angle-of-directions (AoDs) between the RISs and the user is estimated by using the conditional sample mean in the first stage, and then the user’s position is determined based on the estimated multiple AoD pairs in the second stage. This approach only utilizes the existing communication signals between the user and the BS, relying solely on the measurement of received signal power at each BS antenna for a set of randomly generated phase shifts across all RISs. Moreover, by obviating the need for real-time RIS phase shift optimization or user-to-BS pilot transmissions, the method introduces no additional communication overhead, making it highly suitable for deployment in real-world networks. The proposed scheme is then extended to multi-RIS scenarios considering both parallel and cascaded RIS topologies. Numerical results show that the proposed RAPL improves localization accuracy while significantly reducing energy and signaling overhead compared to conventional methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

Hybrid Blockchain and IoT Driven Framework for Supply Chain Optimization by Enhancing Transparency, Efficiency and Cost Reduction

Hybrid Blockchain and IoT Driven Framework for Supply Chain ...

引用

Electronics and Renewable systems (ICEARS), International Conference on

作者： Pradeep Kumar S CH Hussaian Basha C. Arun Prasath G. Amirthayogam Syed Ismail Abdul Lathif R. Leelavathi Computer Science Design Department Rajalakshmi Engineering College Thandalam Chennai Department of Electrical and Electronics Engineering SR University Warangal Department of ECE Mahendra Engineering College Namakkal Department of Computer Science and Engineering School of Computing Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Chennai Department of Data Science and Business Systems SRM Institute of Science and Technology Chennai Department of Biomedical Engineering Velalar College of Engineering and Technology Erode

ISBN: (数字)9798331509675

ISBN: (纸本)9798331509682

Blockchain technology represents a modern supply chain management revolution which fixes operational challenges while providing enhanced transparency at reduced costs. The research develops HB-SCOF (Hybrid Blockchain-Enabled Supply Chain Optimization Framework) which combines blockchain self-verification databases with automatic smart contracts to maintain continuous supply chain observation and evaluate data credibility. The framework integrates tamper-proof transaction tracking mechanisms with unified supply chain network connectivity for securing data transmission as a trust delivery method through unbreakable shared databases. The retail-industry case study demonstrated a 25% decrease in expenses stemming from agency elimination alongside enhanced flow management and better stock distribution. The system demonstrates its effectiveness through assessments of key performance indicators including transaction speed and data accuracy together with business cost efficiency. This part looks at implementation methods through training stakeholders in addition to transforming organizational policies which produce successful outcomes. Blockchain technology labs verify its capability to enhance supply chain management efficiency while showing realistic deployment methods.

关键词： Training Costs Supply chain management Supply chains Smart contracts Key performance indicator Blockchains Stakeholders Internet of Things Optimization

来源：评论

学校读者我要写书评

暂无评论

SciceVPR: Stable Cross-Image Correlation Enhanced Model for Visual Place Recognition

arXiv

引用

arXiv 2025年

作者： Wan, Shanshan Wei, Yingmei Kang, Lai Shen, Tianrui Wang, Haixuan Yang, Yee-Hong College of Systems Engineering the Laboratory for Big Data and Decision National University of Defense Technology Hunan Changsha410073 China Department of Computing Science University of Alberta EdmontonABT6G 2E9 Canada

Visual Place Recognition (VPR) is a major challenge for robotics and autonomous systems, with the goal of predicting the location of an image based solely on its visual features. State-of-the-art (SOTA) models extract global descriptors using the powerful foundation model DINOv2 as backbone. These models either explore the cross-image correlation or propose a time-consuming two-stage re-ranking strategy to achieve better performance. However, existing works only utilize the final output of DINOv2, and the current cross-image correlation causes unstable retrieval results. To produce both discriminative and constant global descriptors, this paper proposes a stable cross-image correlation enhanced model for VPR called SciceVPR. This model explores the full potential of DINOv2 in providing useful feature representations that implicitly encode valuable contextual knowledge. Specifically, SciceVPR first uses a multi-layer feature fusion module to capture increasingly detailed task-relevant channel and spatial information from the multi-layer output of DINOv2. Secondly, SciceVPR considers the invariant correlation between images within a batch as valuable knowledge to be distilled into the proposed self-enhanced encoder. In this way, SciceVPR can acquire fairly robust global features regardless of domain shifts (e.g., changes in illumination, weather and viewpoint between pictures taken in the same place). Experimental results demonstrate that the base variant, SciceVPR-B, outperforms SOTA one-stage methods with single input on multiple datasets with varying domain conditions. The large variant, SciceVPR-L, performs on par with SOTA two-stage models, scoring over 3% higher in Recall@1 compared to existing models on the challenging Tokyo24/7 dataset. Our code will be released at https://***/shuimushan/SciceVPR. Copyright © 2025, The Authors. All rights reserved.

关键词： Image correlation

来源：评论

学校读者我要写书评

暂无评论

Vivim: a Video Vision Mamba for Ultrasound Video Segmentation

引用

IEEE Transactions on Circuits and systems for Video Technology 2025年

作者： Yang, Yijun Xing, Zhaohu Yu, Lequan Fu, Huazhu Huang, Chunwang Zhu, Lei Nansha Guangdong Guangzhou511400 China School of Computing and Data Science University of Hong Kong Hong Kong 138632 Singapore Guangdong Provincial People’s Hospital Guangdong Academy of Medical Sciences Southern Medical University Department of Ultrasound China Robotics and Autonomous Systems Thrust China Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Hong Kong

Ultrasound video segmentation gains increasing attention in clinical practice due to the redundant dynamic references in video frames. However, traditional convolutional neural networks have a limited receptive field and transformer-based networks are unsatisfactory in constructing long-term dependency from the perspective of computational complexity. This bottleneck poses a significant challenge when processing longer sequences in medical video analysis tasks using available devices with limited memory. Recently, state space models (SSMs), famous by Mamba, have exhibited linear complexity and impressive achievements in efficient long sequence modeling, which have developed deep neural networks by expanding the receptive field on many vision tasks significantly. Unfortunately, vanilla SSMs failed to simultaneously capture causal temporal cues and preserve non-casual spatial information. To this end, this paper presents a Video Vision Mamba-based framework, dubbed as Vivim, for ultrasound video segmentation tasks. Our Vivim can effectively compress the long-term spatiotemporal representation into sequences at varying scales with our designed Temporal Mamba Block. We also introduce an improved boundary-aware affine constraint across frames to enhance the discriminative ability of Vivim on ambiguous lesions. Extensive experiments on thyroid segmentation in ultrasound videos, breast lesion segmentation in ultrasound videos, and polyp segmentation in colonoscopy videos demonstrate the effectiveness and efficiency of our Vivim, superior to existing methods. © 1991-2012 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Blockchain Integration for Robust Intellectual Property Protection in New Product Development (NPD)

Blockchain Integration for Robust Intellectual Property Prot...

引用

Electronics and Renewable systems (ICEARS), International Conference on

作者： P. Chinnasamy Subashini. B Nijanthan Nijanthan Madasamy Raja. G Devulapally Swetha Sreenivasulu Reddy L Department of Computer Science and Engineering School of Computing Kalasalingam Academy of Research and Education Tamilnadu India Department of Data Science and Business Systems School of Computing SRMIST India Computer Science and Engineering Paavai Engineering College Namakkal Tamilnadu India Information Technology Paavai Engineering College Namakkal Tamilnadu India Dept. of Computer Science and Engineering Vaagdevi Engineering College Telangana India Department of Mathematics School of Advanced Sciences Kalasalingam Academy of Research and Education Krishnankoil Tamilnadu India

ISBN: (数字)9798331509675

ISBN: (纸本)9798331509682

The rapid advancement of Blockchain technology has led to its widespread application in several domains of digital activities, such as e-government concerns and monetary security. This article presents a smart contract-based Blockchain solution for protecting intellectual property rights in new product development. The proposed solution effectively tackles the challenges associated with the confidentiality of personally identifiable information, efficiency in storing transaction-related information, as well as cooperation and monitoring in IPR. Initially, we create a mathematical model based on smart contract enabled Blockchain and intelligent contracts. Subsequently, we develop algorithms for Blockchain generation, and intelligent contracts. The system is suitable for protecting IPR in a blockchain network, by implementation of distributed identity authentication and real-time extensible storage. These features enhance the security and expandability of circuit copyright protection based on blockchain technology. The experimental results demonstrate that the suggested algorithm has decreased the cost for communication and enhanced the effectiveness of storing information and administration. Furthermore, it demonstrates resilience against many common attacks such as double-spending assaults, while maintaining low cost and overhead. Additionally, it exhibits a superior level of security in comparison to three other competing algorithms.

关键词： Patents Technological innovation Costs Smart contracts Intellectual property Product development Blockchains Security Protection Resilience

来源：评论

学校读者我要写书评

暂无评论

Doing More With Less: Mismatch-Based Risk-Limiting Audits

arXiv

引用

arXiv 2025年

作者： Ek, Alexander Blom, Michelle Stark, Philip B. Stuckey, Peter J. Teague, Vanessa J. Vukcevic, Damjan Department of Econometrics and Business Statistics Monash University Clayton Australia Department of Computing and Information Systems University of Melboure Parkville Australia Department of Statistics University of California BerkeleyCA United States Department of Data Science and AI Monash University Clayton Australia Australian National University Thinking Cybersecurity Pty Ltd Australia

One approach to risk-limiting audits (RLAs) compares randomly selected cast vote records (CVRs) to votes read by human auditors from the corresponding ballot cards. Historically, such methods reduce audit sample sizes by considering how each sampled CVR differs from the corresponding true vote, not merely whether they differ. Here we investigate the latter approach, auditing by testing whether the total number of mismatches in the full set of CVRs exceeds the minimum number of CVR errors required for the reported outcome to be wrong (the "CVR margin"). This strategy makes it possible to audit more social choice functions and simplifies RLAs conceptually, which makes it easier to explain than some other RLA approaches. The cost is larger sample sizes. "Mismatch-based RLAs" only require a lower bound on the CVR margin, which for some social choice functions is easier to calculate than the effect of particular errors. When the population rate of mismatches is low and the lower bound on the CVR margin is close to the true CVR margin, the increase in sample size is small. However, the increase may be very large when errors include errors that, if corrected, would widen the CVR margin rather than narrow it;errors affect the margin between candidates other than the reported winner with the fewest votes and the reported loser with the most votes;or errors that affect different margins. Copyright © 2025, The Authors. All rights reserved.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

A comparative study between android phone and TV apps

引用

Automated Software Engineering 2025年第2期32卷 1-30页

作者： Liu, Yonghui Chen, Xiao Liu, Yue Kong, Pingfan Bissyandé, Tegawendé F. Klein, Jacques Sun, Xiaoyu Li, Li Chen, Chunyang Grundy, John Department of Software Systems and Cybersecurity Monash University Melbourne Australia Faculty of Data Science City University of Macau Macau China School of Information and Physical Sciences University of Newcastle Newcastle Australia SnT University of Luxembourg Esch-sur-Alzette Luxembourg The School of Computing Australian National University Canberra Australia School of Software Beihang University Beijing China Department of Computer Science Technical University of Munich Munich Germany

Smart TVs have surged in popularity, leading developers to create TV versions of mobile apps. Understanding the relationship between TV and mobile apps is key to building consistent, secure, and optimized cross-platform experiences while addressing TV-specific SDK challenges. Despite extensive research on mobile apps, TV apps have been given little attention, leaving the relationship between phone and TV apps unexplored. Our study addresses this gap by compiling an extensive collection of 3445 Android phone/TV app pairs from the Google Play Store, launching the first comparative analysis of its kind. We examined these pairs across multiple dimensions, including non-code elements, code structure, security, and privacy aspects. Our findings reveal that while these app pairs could get identified with the same package names, they deploy different artifacts with varying functionality across platforms. TV apps generally exhibit less complexity in terms of hardware-dependent features and code volume but maintain significant shared resource files and components with their phone versions. Interestingly, some categories of TV apps show similar or even severe security and privacy concerns compared to their mobile counterparts. This research aims to assist developers and researchers in understanding phone-TV app relationships, highlight domain-specific concerns necessitating TV-specific tools, and provide insights for migrating apps from mobile to TV platforms.

关键词： Television applications

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

引用

IEEE Transactions on Mobile computing 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing Advanced Information Network Laboratory Beijing China College of Computing and Data Science Singapore University of Miami Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing Coral Gables33146 United States University of Miami Department of Industrial and Systems Engineering Coral Gables33146 United States Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China North Carolina State University Department of Computer Science RaleighNC27695 United States Beijing Key Laboratory of Network System Architecture and Convergence China Beijing University of Posts and Telecommunications Beijing Advanced Information Network Laboratory Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025 IEEE. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：