English
Related papers

Related papers: On the undecidability of the Panopticon detection …

200 papers

To understand and explain process behaviour we need to be able to see it, and decide its significance, i.e. be able to tell a story about its behaviours. This paper describes a few of the modelling challenges that underlie monitoring and…

Multiagent Systems · Computer Science 2019-07-26 Mark Burgess

Detectability describes the property of a system whose current and the subsequent states can be uniquely determined after a finite number of observations. In this paper, we developed a novel approach to verifying strong detectability and…

Systems and Control · Computer Science 2019-03-25 Hao Lan , Yin Tong , Carla Seatzu , Jin Guo

Interest point detection is a common task in various computer vision applications. Although a big variety of detector are developed so far computational efficiency of interest point based image analysis remains to be the problem. Current…

Computer Vision and Pattern Recognition · Computer Science 2010-03-23 Vitaly Pimenov

Obtaining and maintaining anonymity on the Internet is challenging. The state of the art in deployed tools, such as Tor, uses onion routing (OR) to relay encrypted connections on a detour passing through randomly chosen relays scattered…

Cryptography and Security · Computer Science 2015-01-06 Joan Feigenbaum , Bryan Ford

Quantum Darwinism offers an explanation for the emergence of classical objective features -- those we are used to at macroscopic scales -- from quantum properties at the microscopic level. The interaction of a quantum system with its…

Fast variability of optical objects is an interesting though poorly explored subject in modern astronomy. Real-time data processing and identification of transient celestial events in the images is very important for such study as it allows…

This paper examines whether unitary evolution alone is sufficient to explain emergence of the classical world from the perspective of computability theory. Specifically, it looks at the problem of how the choice related to the measurement…

Quantum Physics · Physics 2014-10-27 Subhash Kak

Opacity is a generic security property, that has been defined on (non probabilistic) transition systems and later on Markov chains with labels. For a secret predicate, given as a subset of runs, and a function describing the view of an…

Cryptography and Security · Computer Science 2014-09-02 Béatrice Bérard , Krishnendu Chatterjee , Nathalie Sznajder

A honeypot is a type of security facility deliberately created to be probed, attacked and compromised. It is often used for protecting production systems by detecting and deflecting unauthorized accesses. It is also useful for investigating…

Cryptography and Security · Computer Science 2018-12-26 Wenjun Fan , Zhihui Du , David Fernandez , Victor A. Villagra

Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…

Data Structures and Algorithms · Computer Science 2007-05-23 Lawrence M. Ioannou

We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so under a different perspective, that is, we consider a dynamic…

Formal Languages and Automata Theory · Computer Science 2020-02-18 Alejandro Grez , Filip Mazowiecki , Michał Pilipczuk , Gabriele Puppis , Cristian Riveros

Opacity is an important information-flow security property in the analysis of cyber-physical systems. It captures the plausible deniability of the system's secret behavior in the presence of an intruder that may access the information flow.…

Systems and Control · Computer Science 2019-02-26 Xiang Yin , Majid Zamani

In this paper we propose a new observability property for nonautonomous linear control systems in finite dimension: the nonuniform complete observability, which is more general than the uniform complete observability. A dual relationship is…

Optimization and Control · Mathematics 2025-08-14 Ignacio Huerta , Pablo Monzón

We study the reachability problem of a quantum system modelled by a quantum automaton. The reachable sets are chosen to be boolean combinations of (closed) subspaces of the state space of the quantum system. Four different reachability…

Logic in Computer Science · Computer Science 2014-01-27 Yangjia Li , Mingsheng Ying

Object permanence is the concept that objects do not suddenly disappear in the physical world. Humans understand this concept at young ages and know that another person is still there, even though it is temporarily occluded. Neural networks…

Computer Vision and Pattern Recognition · Computer Science 2022-11-29 Michael Fürst , Priyash Bhugra , René Schuster , Didier Stricker

This paper addresses the following main question: Do we have a theoretical understanding of entanglement applicable to a full variety of physical settings? It is clear that not only the assumption of distinguishability, but also the…

Quantum Physics · Physics 2007-05-23 Gerardo Ortiz , Rolando Somma , Howard Barnum , Emanuel Knill , Lorenza Viola

The study of entanglement in systems composed of identical particles raises interesting challenges with far-reaching implications in both, our fundamental understanding of the physics of composite quantum systems, and our capability of…

Quantum Physics · Physics 2023-03-31 A. P. Majtey , A. Valdés-Hernández , E. Cuestas

Nonclassicality, defined in the quantum optical sense, serves as a resource for photon-based quantum technologies. Therefore, certifying the nonclassicality of a quantum state is crucial for gauging its potential for quantum advantage.…

Opacity is a general language-theoretic framework in which several security properties of a system can be expressed. Its parameters are a predicate, given as a subset of runs of the system, and an observation function, from the set of runs…

Cryptography and Security · Computer Science 2019-02-20 B. Bérard , J. Mullins , M. Sassolas

Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. It has recently been shown that this problem is NP-hard. There is a highly inefficient `basic algorithm'…

Quantum Physics · Physics 2009-11-10 L. M. Ioannou , B. C. Travaglione , D. Cheung , A. K. Ekert