Related papers: ACM with Overlapping Partitions: Implementation an…
Understanding the computational overheads imposed by classical control systems on quantum computing platforms becomes critically important as these quantum machines grow in scale and complexity. In this work, we calculate the overheads…
Recently, a chaotic image encryption algorithm based on information entropy (IEAIE) was proposed. This paper scrutinizes the security properties of the algorithm and evaluates the validity of the used quantifiable security metrics. When the…
We predict synchronization of the chaotic dynamics of two atomic ensembles coupled to a heavily damped optical cavity mode. The atoms are dissipated collectively through this mode and pumped incoherently to achieve a macroscopic population…
In this paper, after reviewing the main points of image encryption and threshold function, we introduce the methods of chaotic image encryption based on pseudorandom bit padding that the bits be generated by the novel generalized threshold…
TMAC is a toolbox written in C++11 that implements algorithms based on a set of modern methods for large-scale optimization. It covers a variety of optimization problems, which can be both smooth and nonsmooth, convex and nonconvex, as well…
Chaotic Hamiltonians are known to follow Random Matrix Theory (RMT) ensembles in the apparent randomness of their spectra and wavefunction statistics. Deviations form RMT also do occur, however, due to system-specific properties, or as…
This paper analyzes the use of the logistic map for cryptographic applications. The most important characteristics of the logistic map are shown in order to prove the inconvenience of considering this map in the design of new chaotic…
The interleaving of chaos and cryptography has been the aim of a large set of works since the beginning of the nineties. Many encryption proposals have been introduced to improve conventional cryptography. However, many proposals possess…
In some medical imaging tasks and other settings where only small parts of the image are informative for the classification task, traditional CNNs can sometimes struggle to generalise. Manually annotated Regions of Interest (ROI) are…
For a specific quantum chip, multi-programming helps to improve overall throughput and resource utilization. However, the previous solutions for mapping multiple programs onto a quantum chip often lead to resource under-utilization, high…
Clustering the nodes of a graph is a cornerstone of graph analysis and has been extensively studied. However, some popular methods are not suitable for very large graphs: e.g., spectral clustering requires the computation of the spectral…
We study the problem of multi-access coded caching (MACC): a central server has $N$ files, $K$ ($K \leq N$) caches each of which stores $M$ out of the $N$ files, $K$ users each of which demands one out of the $N$ files, and each user…
We apply renormalized entropy as a complexity measure to the logistic and sine-circle maps. In the case of logistic map, renormalized entropy decreases (increases) until the accumulation point (after the accumulation point up to the most…
Background Nucleotide sequences contain multiple codes responsible for organism's functioning and structure. They can be investigated by various signal processing methods. These techniques are well suited for indication of frequently…
One of the most important properties of orbital angular momentum (OAM) of photons is that the Hilbert space required to describe a general quantum state is infinite dimensional. In principle, this could allow for encoding arbitrarily large…
As the robot explores the environment, the map grows over time in the simultaneous localization and mapping (SLAM) system, especially for the large scale environment. The ever-growing map prevents long-term mapping. In this paper, we…
Analytical periodic solutions for weakly Coupled Map Lattices are shown in an explicit form as well as in a recurrence relation. The results establish a link between a matricial representation and recurrence relations of the solutions.
In this work, we propose Asynchronous Perception Machine (APM), a computationally-efficient architecture for test-time-training (TTT). APM can process patches of an image one at a time in any order asymmetrically and still encode…
The Periodic Anderson Model (PAM) is widely studied to understand strong correlation physics and especially the competition of antiferromagnetism and singlet formation. Quantum Monte Carlo (QMC) studies have focused both on issues such as…
We study the lattice agreement (LA) and atomic snapshot problems in asynchronous message-passing systems where up to $f$ nodes may crash. Our main result is a crash-tolerant atomic snapshot algorithm with \textit{amortized constant round…