相关论文: A Note on Occur-Check

The simplest Standard Model extension to explain neutrino masses involves the addition of right-handed neutrinos. At some level, this extension will impact neutrino oscillation searches. In this work we explore the differences and…

Adversarial attacks perturb images such that a deep neural network produces incorrect classification results. A promising approach to defend against adversarial attacks on natural multi-object scenes is to impose a context-consistency…

The machine learning community adopted the use of null hypothesis significance testing (NHST) in order to ensure the statistical validity of results. Many scientific fields however realized the shortcomings of frequentist reasoning and in…

Most of the existing methods for debaising in click-through rate (CTR) prediction depend on an oversimplified assumption, i.e., the click probability is the product of observation probability and relevance probability. However, since there…

Optimization-based methods are widely used for computing fast, diverse solutions for complex tasks such as collision-free movement or planning in the presence of contacts. However, most of these methods require enforcing non-penetration…

To build robust, fair, and safe AI systems, we would like our classifiers to say ``I don't know'' when facing test examples that are difficult or fall outside of the training classes.The ubiquitous strategy to predict under uncertainty is…

We estimate the nuclear fusion rates for the transition OH-->F from the ground and excited molecular states and also consider effect of screening of electric charges of nuclei by bound electrons in the case of colliding atoms O and H. We…

Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This class of optimization problems, known as rank minimization, is…

A source assumed to prepare a specified reference state sometimes prepares an anomalous one. We address the task of identifying these anomalous states in a series of $n$ preparations with $k$ anomalies. We analyze the minimum-error protocol…

The achievement of the goals of the ongoing and future accelerator-based neutrino experiments - notably the determination of CP violating phase in the lepton sector - will require the development of advanced models of neutrino-nucleus…

Saturation is considered the state-of-the-art method for computing fixpoints with decision diagrams. We present a relatively simple decision diagram operation called REACH that also computes fixpoints. In contrast to saturation, it does not…

We show that for several variations of partially observable Markov decision processes, polynomial-time algorithms for finding control policies are unlikely to or simply don't have guarantees of finding policies within a constant factor or a…

Withdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N + O(1) queries, it achieves a success probability of at least…

Unitarity of the $3\times 3$ lepton flavor mixing matrix $V$ is unavoidably violated in a seesaw mechanism if its new heavy degrees of freedom are slightly mixed with the active neutrino flavors. We propose to use the atomic transition…

We show in a simple and general way that matter effects do not contribute to the averaged value of the probabilities of transition of solar $\nu_e$'s into other states in the case of maximal mixing of any number of massive neutrinos. We…

This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…

Searching for non-standard neutrino interactions, as a means for discovering physics beyond the Standard Model, has one of the key goals of dedicated neutrino experiments, current and future. We demonstrate here that much of the parameter…

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of…

Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the…

The existence is proved of a class of open quantum systems that admits a linear subspace ${\cal C}$ of the space of states such that the restriction of the dynamical semigroup to the states built over $\cal C$ is unitary. Such subspace…