Tootfinder

Does Movable Antenna Present A Dual-edged Nature? From the Perspective of Physical Layer Security: A Joint Design of Fixed-position Antenna and Movable Antenna
Kan Yu, Wenxu Wang, Xiaowu Liu, Yujia Zhao, Qixun Zhang, Zhiyong Feng, Dong Li
https://arxiv.org/abs/2507.05784

Does Movable Antenna Present A Dual-edged Nature? From the Perspective of Physical Layer Security: A Joint Design of Fixed-position Antenna and Movable Antenna
In conventional artificial noise (AN)-aided physical-layer security systems, fixed-position antenna (FPA) arrays exhibit inherent vulnerability to coverage gaps due to their static spatial configuration. Adversarial eavesdroppers can strategically exploit their mobility to infiltrate these spatial nulls of AN radiation patterns, thereby evading interference suppression and successfully intercepting the confidential communication. To overcome this limitation, in this paper, we investigate a hybr…

Extrinsic nature of the polarization in hafnia ferroelectrics
Binayak Mukherjee (Luxembourg Institute of Science and Technology), Natalya S. Fedorova (Luxembourg Institute of Science and Technology), Jorge \'I\~niguez-Gonz\'alez (Luxembourg Institute of Science and Technology, University of Luxembourg)
https://arxiv.org/abs/2508.00…

Extrinsic nature of the polarization in hafnia ferroelectrics
Hafnia and related fluorites defy our understanding of ferroelectricity, even if we restrict ourselves to the intrinsic properties of ideal crystals. Here we focus on a critical puzzle, namely, the sign of the electric polarization. Using first-principles simulations, we show that a polar hafnia layer with a fixed atomic configuration can give rise to depolarizing fields of either positive or negative sign, depending on the environment. This implies that (the sign of) the polarization in hafnia…

This https://arxiv.org/abs/2504.21223 has been replaced.
initial toot: https://mastoxiv.page/@arX…

Surface Structure and Surface State of a Tight-Binding Model on a Diamond Lattice
Surface states of a tight-binding model with nearest-neighbor hopping on a diamond lattice of finite thickness are investigated. We consider systems with (001), (110), and (111) surfaces. Even if the surface direction is fixed, there is freedom to choose the surface structure due to the two-sublattice nature of a diamond lattice. The existence of surface states is governed by the topology of the matrix elements of the bulk Hamiltonian. In this sense, the existence of surface states is determine…

Fixed points of Personalized PageRank centrality: From irreducible to reducible networks
David Aleja, Julio Flores, Eva Primo, Daniel Rodr\'iguez, Miguel Romance
https://arxiv.org/abs/2507.18652

Fixed points of Personalized PageRank centrality: From irreducible to reducible networks
In this paper we analyze the PageRank of a complex network as a function of its personalization vector. By using this approach, a complete characterization of the existence and uniqueness of fixed points of PageRank of a graph is given in terms of the number and nature of its strongly connected components. The method presented includes the use of a feedback-PageRank in order to compute exactly the fixed points following the classic Power's Method in terms of the (left-hand) Perron vector of eac…

Kilo-scale point-source inference using Parametric Cataloging
Gabriel H. Collin
https://arxiv.org/abs/2507.23472 https://arxiv.org/pdf/2507.23472

Kilo-scale point-source inference using Parametric Cataloging
The estimation of the number of point-sources in the sky is one the oldest problems in astronomy, yet an easy and efficient method for estimating the uncertainty on these counts is still an open problem. Probabilistic cataloging solves the general point-source inference problem, but the trans-dimensional nature of the inference method requires a bespoke approach that is difficult to scale. Here it is shown that probabilistic cataloging can be performed in a fixed-dimensional framework called Pa…

Enumeration of subsets with closedness in finite fields of characteristic 2
Nithish Kumar R, Vadiraja Bhatta G. R., Prasanna Poojary
https://arxiv.org/abs/2506.20351

Enumeration of subsets with closedness in finite fields of characteristic 2
The additive closedness in the subset of an additive group is termed as r-value. The nature of closedness in different subsets of fixed size is observed as a spectrum of r-values. We enumerate r-values of subsets in finite fields of characteristic 2 and represent them as the spectrum of values. Based on these values the subsets can be further studied as partial Steiner triple systems, sum-free sets, Sidon sets, and Schure triples.

Reproducible Evaluation of Camera Auto-Exposure Methods in the Field: Platform, Benchmark and Lessons Learned
Olivier Gamache, Jean-Michel Fortin, Mat\v{e}j Boxan, Fran\c{c}ois Pomerleau, Philippe Gigu\`ere
https://arxiv.org/abs/2506.18844

Reproducible Evaluation of Camera Auto-Exposure Methods in the Field: Platform, Benchmark and Lessons Learned
Standard datasets often present limitations, particularly due to the fixed nature of input data sensors, which makes it difficult to compare methods that actively adjust sensor parameters to suit environmental conditions. This is the case with Automatic-Exposure (AE) methods, which rely on environmental factors to influence the image acquisition process. As a result, AE methods have traditionally been benchmarked in an online manner, rendering experiments non-reproducible. Building on our prior…

Eigenvalue bounds for distance-edge colorings
Aida Abiad, Luuk Reijnders
https://arxiv.org/abs/2506.20976 https://arxiv.org/pdf/2506.…

Eigenvalue bounds for distance-edge colorings
For a fixed positive integer $t$, we consider the graph colouring problem in which edges at distance at most $t$ are given distinct colours. We obtain sharp lower bounds for the distance-$t$ chromatic index, the least number of colours necessary for such a colouring. Our bounds are of algebraic nature; they depend on the eigenvalues of the line graph and on a polynomial which can be found using integer linear programming methods. We show several graph classes that attain equality for our bounds…

Rel-HNN: Split Parallel Hypergraph Neural Network for Learning on Relational Databases
Md. Tanvir Alam, Md. Ahasanul Alam, Md Mahmudur Rahman, Md. Mosaddek Khan
https://arxiv.org/abs/2507.12562

Rel-HNN: Split Parallel Hypergraph Neural Network for Learning on Relational Databases
Relational databases (RDBs) are ubiquitous in enterprise and real-world applications. Flattening the database poses challenges for deep learning models that rely on fixed-size input representations to capture relational semantics from the structured nature of relational data. Graph neural networks (GNNs) have been proposed to address this, but they often oversimplify relational structures by modeling all the tuples as monolithic nodes and ignoring intra-tuple associations. In this work, we prop…

PAPR Analysis for MIMO FTN Signaling with Gaussian Symbols
Zichao Zhang, Melda Yuksel, Gokhan M. Guvensen, Halim Yanikomeroglu
https://arxiv.org/abs/2507.15116

PAPR Analysis for MIMO FTN Signaling with Gaussian Symbols
Faster-than-Nyquist signaling serves as a promising solution for improving spectral efficiency in future generations of communications. However, its nature of fast acceleration brings highly overlapped pulses that lead to worse peak-to-average power ratio (PAPR) performance. In this paper, we investigate the PAPR behavior of MIMO FTN using Gaussian symbols under optimal power allocation for two power constraints: fixed transmit power and fixed received signal-to-noise-ratio (SNR). Our findings …