相关论文: A Note on Occur-Check

The problem of state estimation in the setting of partially-observed discrete event systems subject to cyber attacks is considered. An operator observes a plant through a natural projection that hides the occurrence of certain events. The…

Learning performance can show non-monotonic behavior. That is, more data does not necessarily lead to better models, even on average. We propose three algorithms that take a supervised learning model and make it perform more monotone. We…

When neutrino masses arise from the exchange of neutral heavy leptons, as in most seesaw schemes, the effective lepton mixing matrix $N$ describing neutrino propagation is non-unitary, hence neutrinos are not exactly orthonormal. New CP…

Huang and Li [arXiv:2603.00885] have raised the following two points regarding our previous work [arXiv:2502.18029]:(1) The real-value conditions associated with $\mu$-$\tau$ reflection symmetry were overlooked. (2) Inverted Ordering (IO)…

In the standard approach to the neutrino oscillations a unitary relation among weak and mass eigenstates of light neutrinos is imposed. However, in many extensions of the SM left-handed, active neutrinos mix with additional heavy neutrino…

Bloom filters, cuckoo filters, and other approximate set membership sketches have a wide range of applications. Oftentimes, expensive operations can be skipped if an item is not in a data set. These filters provide an inexpensive, memory…

To better understand quantum computation we can search for its limits or no-gos, especially if analogous limits do not appear in classical computation. Classical computation easily implements and extensively employs the addition of two bit…

Object detectors are at the heart of many semi- and fully autonomous decision systems and are poised to become even more indispensable. They are, however, still lacking in accessibility and can sometimes produce unreliable predictions.…

We propose and analyze experiments to test distinguishability and determinism in atoms. As a first step, we consider experiments to test if atoms are distinguishable from each other due to small differences in the nuclear magnetic moment.…

Composition is something we take for granted in classical algorithms design, and in particular, we take it as a basic axiom that composing ``efficient'' algorithms should result in an ``efficient'' algorithm -- even using this intuition to…

It is shown that different distinguishability measures impose different orderings on ensembles of $N$ pure quantum states. This is demonstrated using ensembles of equally-probable, linearly independent, symmetrical pure states, with the…

We propose a low-computational strategy for the efficient implementation of the "atom selection step" in sparse representation algorithms. The proposed procedure is based on simple tests enabling to identify subsets of atoms which cannot be…

We show that solving a multiple-unicast network coding problem can be reduced to solving a single-unicast network error correction problem, where an adversary may jam at most a single edge in the network. Specifically, we present an…

Survival Analysis and Reliability Theory are concerned with the analysis of time-to-event data, in which observations correspond to waiting times until an event of interest such as death from a particular disease or failure of a component…

This manuscript is inspired by the paper [2]. In the paper, they investigate a method to detect existence of an object with arbitrarily small interaction. Below, we sketch their protocol to motivate the present manuscript. The object of…

The data supporting neutrino oscillations are reexamined empirically, ignoring the phase space of the usual theory. An absolutely minimum description can be constructed easily without assuming oscillations. An empirical fit to a simplified…

We consider the impact of neutral-current (NC) non-standard neutrino interactions (NSI) on the determination of the neutrino mass ordering. We show that in presence of NSI there is an exact degeneracy which makes it impossible to determine…

A number of attempts have been made to improve accuracy and/or scalability of the PC (Peter and Clark) algorithm, some well known (Buhlmann, et al., 2010; Kalisch and Buhlmann, 2007; 2008; Zhang, 2012, to give some examples). We add here…

Several aspects of next-to-leading (NLO) order corrections to see-saw formulas are discussed and phenomenologically relevant situations are identified. We generalize the formalism to calculate the NLO terms developed for the type I see-saw…

Platform trials allow treatment arms to enter and exit over time while maintaining a shared control arm, yielding concurrent and non-concurrent controls (NCC). Pooling NCC is often motivated as a strategy to improve statistical efficiency,…