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

IEEE Transactions on Radar Systems 2025年 3卷 44-56页

作者： Kahya, Sabri Mustafa Yavuz, Muhammet Sami Steinbach, Eckehard Technical University of Munich Media Technology School of Computation Information and Technology Department of Computer Engineering Munich80333 Germany

Detecting human presence indoors with millimeter-wave frequency-modulated continuous-wave (FMCW) radar faces challenges from both moving and stationary clutters. This work proposes a robust and real-time capable human presence and out-of-distribution (OOD) detection method using 60-GHz short-range FMCW radar. HOOD solves the human presence and OOD detection problems simultaneously in a single pipeline. Our solution relies on a reconstruction-based architecture and works with radar macro- and micro-range-Doppler images (RDIs). HOOD aims to accurately detect the presence of humans in the presence or absence of moving and stationary disturbers. Since HOOD is also an OOD detector, it aims to detect moving or stationary clutters as OOD in humans' absence and predicts the current scene's output as "no presence."HOOD performs well in diverse scenarios, demonstrating its effectiveness across different human activities and situations. On our dataset collected with a 60-GHz short-range FMCW radar with only one transmit (Tx) and three receive antennas, we achieved an average area under the receiver operating characteristic curve (AUROC) of 94.36%. Additionally, our extensive evaluations and experiments demonstrate that HOOD outperforms state-of-the-art (SOTA) OOD detection methods in terms of common OOD detection metrics. Importantly, HOOD also perfectly fits on Raspberry Pi 3B+ with a advanced RISC machines (ARM) Cortex-A53 CPU, which showcases its versatility across different hardware environments. Videos of our human presence detection experiments are available at: https://***/HOOD. © 2023 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Information Rates of Successive Interference Cancellation for Optical Fiber

引用

IEEE Journal on Selected Areas in Communications 2025年第5期43卷 1484-1497页

作者： Jäger, Alex Kramer, Gerhard Technical University of Munich Institute for Communications Engineering Department of Computer Engineering School of Computation Information and Technology Munich80333 Germany

Joint detection and decoding (JDD) achieves rates based on information theory but is too complex to implement for many channels with memory or nonlinearities. Successive interference cancellation (SIC) at the receiver, combined with multistage encoding at the transmitter, is a method that lets one use coded modulation for memoryless channels to approach JDD rates. A SIC-based receiver is presented to compensate for inter-channel interference in long-haul optical fiber links. Simulations for 1000 km of standard single-mode fiber with ideal distributed Raman amplification, single-polarization transmission, and circularly symmetric complex Gaussian (CSCG) modulation show that SIC attains the achievable information rates (AIRs) of JDD using surrogate channel models with correlated phase and additive noise (CPAN). Moreover, the AIRs of ring constellations are compared to those of CSCG modulation. Simulations show that 32 rings, 16 SIC-stages, and Gaussian message passing on the factor graph of the CPAN surrogate model achieve the JDD rates of CSCG modulation. The computational complexity scales in proportion to the number of SIC-stages, where one stage has complexity similar to separate detection and decoding. © 1983-2012 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Visual Explanations of Some Problematic Search Behaviors of Frequently-Used EMO Algorithms 13th

Visual Explanations of Some Problematic Search Behaviors of ...

引用

13th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2025

作者： Ishibuchi, Hisao Pang, Lie Meng Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

ISBN: (纸本)9789819635375

Recently, evolutionary multi-objective optimization (EMO) algorithms have been used in various application fields. Whereas many new EMO algorithms are proposed every year, well-known EMO algorithms such as NSGA-II, MOEA/D, SMS-EMOA and NSGA-III have been still frequently used in application papers as shown by their number of citations. Since most EMO algorithms have been designed for and evaluated by artificial test problems such as DTLZ and WFG, they do not always work well on real-world problems. Main difficulties of real-world problems are as follows: (i) their Pareto front shapes are irregular, (ii) some objectives have much larger values than others, (iii) some decision variables have much larger values than others, (iv) some objectives are highly correlated, and (v) solution evaluation is expensive. In this paper, we focus on the first four difficulties (except for expensive solution evaluation). Our goal is to clearly explain problematic search behaviors of NSGA-II, MOEA/D, SMS-EMOA and NSGA-III caused by these difficulties using simple distance minimization problems. We formulate various distance minimization problems with the above-mentioned four difficulties by changing the location of each target point on the map as well as the size and shape of the map. We also suggest simple remedies for performance improvement of each algorithm for real-world applications without changing the algorithm itself. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Enhancing NSGA-II with a Knee Point for Constrained Multi-objective Optimization 13th

Enhancing NSGA-II with a Knee Point for Constrained Multi...

引用

13th International Conference on Evolutionary Multi-Criterion Optimization, EMO 2025

作者： Pang, Lie Meng Ishibuchi, Hisao Nan, Yang Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China

ISBN: (纸本)9789819635054

To handle constrained multi-objective optimization problems (CMOPs), many constrained multi-objective evolutionary algorithms (CMOEAs) have been proposed. However, a recent study has shown that many of these CMOEAs do not perform well on real-world CMOPs. In contrast, NSGA-II, proposed over 20 years ago with a simple constrained dominance principle, has demonstrated better performance than recent CMOEAs on many real-world CMOPs. Motivated by NSGA-II’s promising results, this paper aims to further enhance its performance. We explore the idea of enhancing NSGA-II with a knee point for solving CMOPs. Specifically, a knee point is identified using the minimum distance from the estimated ideal point, and always included in the next population of NSGA-II. Experimental results show that this simple idea improves the performance of NSGA-II on real-world CMOPs. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Stability in Online Coalition Formation

引用

Journal of Artificial Intelligence Research 2025年 82卷 2423-2452页

作者： Bullinger, Martin Romen, René Department of Computer Science University of Oxford 7 Parks Road OxfordOX1 3QD United Kingdom School of Computation Information and Technology Technical University of Munich Boltzmannstr 3 Munich85748 Germany

Coalition formation is concerned with the question of how to partition a set of agents into disjoint coalitions according to their preferences. Deviating from most of the previous work, we consider an online variant of the problem, where agents arrive in sequence. Whenever an agent arrives, they must be assigned to a coalition immediately and irrevocably. The scarce existing literature on online coalition formation has focused on maximizing social welfare, a demanding requirement, even in the offline setting. Instead, we seek to achieve stable coalition structures online and treat the most common stability concepts based on deviations by single agents and groups of agents. We present a comprehensive picture in additively separable hedonic games, leading to dichotomies, where positive results are obtained by deterministic algorithms and negative results even hold for randomized algorithms. ©2025 The Authors.

关键词： reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

An Online Integrated Development Environment for Automated Programming Assessment Systems 17

An Online Integrated Development Environment for Automated P...

引用

17th International Conference on computer Supported Education, CSEDU 2025

作者： Frankford, Eduard Crazzolara, Daniel Vierhauser, Michael Meißner, Niklas Krusche, Stephan Breu, Ruth University of Innsbruck Department of Computer Science Austria University of Stuttgart Institute of Software Engineering Germany Technical University of Munich School of Computation Information and Technology Germany

ISBN: (纸本)9789897587467

The increasing demand for programmers has led to a surge in participants in programming courses, making it increasingly challenging for instructors to assess student code manually. As a result, automated programming assessment systems (APASs) have been developed to streamline this process. These APASs support lecturers by managing and evaluating student programming exercises at scale. However, these tools often do not provide feature-rich online editors compared to their traditional integrated development environments (IDEs) counterparts. This absence of key features, such as syntax highlighting and autocompletion, can negatively impact the learning experience, as these tools are crucial for effective coding practice. To address this gap, this research contributes to the field of programming education by extracting and defining requirements for an online IDE in an educational context and presenting a prototypical implementation of an open-source solution for a scalable and secure online IDE. The usability of the new online IDE was assessed using the technology Acceptance Model (TAM), gathering feedback from 27 first-year students through a structured survey. In addition to these qualitative insights, quantitative measures such as memory (RAM) usage were evaluated to determine the efficiency and scalability of the tool under varying usage conditions. Copyright © 2025 by SCITEPRESS - Science and technology Publications, Lda.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Semantic Security With Infinite-Dimensional Quantum Eavesdropping Channel

引用

IEEE Transactions on Information Theory 2025年第4期71卷 2662-2697页

作者： Frey, Matthias Bjelakovic, Igor Notzel, Janis Stanczak, Slawomir Department of Electrical and Electronic Engineering University of Melbourne ParkvilleVIC3052 Australia Fraunhofer Heinrich-Hertz-Institute Berlin10587 Germany Technische Universität Berlin Department of Electrical Engineering and Computer Science Berlin10623 Germany Technical University of Munich School of Computation Information and Technology Munich80333 Germany

We propose a new proof method for direct coding theorems for wiretap channels where the eavesdropper has access to a quantum version of the transmitted signal on an infinite-dimensional Hilbert space and the legitimate parties communicate through a classical channel or a classical input, quantum output (cq) channel. The transmitter input can be subject to an additive cost constraint, which specializes to the case of an average energy constraint. This method yields errors that decay exponentially with increasing block lengths. Moreover, it provides a guarantee of a quantum version of semantic security, which is an established concept in classical cryptography and physical layer security. Therefore, it complements existing works which either do not prove the exponential error decay or use weaker notions of security. The main part of this proof method is a direct coding result on channel resolvability which states that there is only a doubly exponentially small probability that a standard random codebook does not solve the channel resolvability problem for the cq channel. Semantic security has strong operational implications meaning essentially that the eavesdropper cannot use its quantum observation to gather any meaningful information about the transmitted signal. We also discuss the connections between semantic security and various other established notions of secrecy. © 1963-2012 IEEE.

关键词： Hilbert spaces

来源：评论

学校读者我要写书评

暂无评论

Dual AAV Cluster-Assisted Maritime Physical-Layer Secure Communications via Collaborative Beamforming

引用

IEEE Internet of Things Journal 2025年第9期12卷 12589-12607页

作者： Huang, Jiawei Wang, Aimin Sun, Geng Li, Jiahui Wang, Jiacheng Du, Hongyang Niyato, Dusit Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science Jurong West 639798 Singapore The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong

Autonomous aerial vehicles (AAVs) can be utilized as relay platforms to assist maritime wireless communications. However, complex channels and multipath effects at sea can adversely affect the quality of AAV transmitted signals. Collaborative beamforming (CB) can enhance the signal strength and range to assist the AAV relay for remote maritime communications. However, due to the open nature of AAV channels, security issue requires special consideration. This article proposes a dual AAV cluster-assisted system via CB to achieve physical-layer security in maritime wireless communications. Specifically, one AAV cluster forms a maritime AAV-enabled virtual antenna array (MUVAA) relay to forward data signals to the remote legitimate vessel, and the other AAV cluster forms an MUVAA jammer to send jamming signals to the remote eavesdropper. In this system, we formulate a secure and energy-efficient maritime communication multiobjective optimization problem (SEMCMOP) to maximize the signal-to-interference-plus-noise ratio (SINR) of the legitimate vessel, minimize the SINR of the eavesdropping vessel and minimize the total flight energy consumption of AAVs. Since the SEMCMOP is an NP-hard and large-scale optimization problem, we propose an improved swarm intelligence optimization algorithm with chaotic solution initialization and hybrid solution update strategies to solve the problem. Simulation results indicate that the proposed algorithm outperforms other comparison algorithms, and it can achieve more efficient signal transmission by using the CB-based method. © 2014 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Lexical Substitution is not Synonym Substitution: On the Importance of Producing Contextually Relevant Word Substitutes

arXiv

引用

arXiv 2025年

作者： Vladika, Juraj Meisenbacher, Stephen Matthes, Florian Department of Computer Science School of Computation Information and Technology Technical University of Munich Germany

Lexical Substitution is the task of replacing a single word in a sentence with a similar one. This should ideally be one that is not necessarily only synonymous, but also fits well into the surrounding context of the target word, while preserving the sentence’s grammatical structure. Recent advances in Lexical Substitution have leveraged the masked token prediction task of Pre-trained Language Models to generate replacements for a given word in a sentence. With this technique, we introduce CONCAT, a simple augmented approach which utilizes the original sentence to bolster contextual information sent to the model. Compared to existing approaches, it proves to be very effective in guiding the model to make contextually relevant predictions for the target word. Our study includes a quantitative evaluation, measured via sentence similarity and task performance. In addition, we conduct a qualitative human analysis to validate that users prefer the substitutions proposed by our method, as opposed to previous methods. Finally, we test our approach on the prevailing benchmark for Lexical Substitution, CoInCo, revealing potential pitfalls of the benchmark. These insights serve as the foundation for a critical discussion on the way in which Lexical Substitution is evaluated. © 2025, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Step-by-Step Fact Verification System for Medical Claims with Explainable Reasoning

arXiv

引用

arXiv 2025年

作者： Vladika, Juraj Hacajová, Ivana Matthes, Florian Technical University of Munich School of Computation Information and Technology Department of Computer Science Germany

Fact verification (FV) aims to assess the veracity of a claim based on relevant evidence. The traditional approach for automated FV includes a three-part pipeline relying on short evidence snippets and encoder-only inference models. More recent approaches leverage the multi-turn nature of LLMs to address FV as a step-by-step problem where questions inquiring additional context are generated and answered until there is enough information to make a decision. This iterative method makes the verification process rational and explainable. While these methods have been tested for encyclopedic claims, exploration on domain-specific and realistic claims is missing. In this work, we apply an iterative FV system on three medical fact-checking datasets and evaluate it with multiple settings, including different LLMs, external web search, and structured reasoning using logic predicates. We demonstrate improvements in the final performance over traditional approaches and the high potential of step-by-step FV systems for domain-specific claims. © 2025, CC BY-NC-ND.

关键词： Inference engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：