Related papers: ACM with Overlapping Partitions: Implementation an…
Quantum computing is an emerging technology that has the potential to revolutionize fields such as cryptography, machine learning, optimization, and quantum simulation. However, a major challenge in the realization of quantum algorithms on…
Bifurcations in a system of coupled maps are investigated. Using symbolic dynamics it is proven that for coupled shift maps the well known space--time--mixing attractor becomes unstable at a critical coupling strength in favour of a…
A common approach for designing scalable algorithms for massive data sets is to distribute the computation across, say $k$, machines and process the data using limited communication between them. A particularly appealing framework here is…
Quantum kicked top is a fundamental model for time-dependent, chaotic Hamiltonian system and has been realized in experiments as well. As the quantum kicked top can be represented as a system of qubits, it is also popular as a testbed for…
Recently, a novel image encryption scheme based on improved hyperchaotic sequences was proposed. A pseudo-random number sequence, generated by a hyper-chaos system, is used to determine two involved encryption functions, bitwise exclusive…
To lower the complexity of network codes over packet line networks with arbitrary schedules, chunked codes (CC) and overlapped chunked codes (OCC) were proposed in earlier works. These codes have been previously analyzed for relatively…
The increase in data traffic on the internet has significantly increased the relevance of data and image encryption. Among the techniques most used in cryptography, chaotic systems have received great attention due to their easy…
A matching cut of a graph is a partition of its vertex set in two such that no vertex has more than one neighbor across the cut. The Matching Cut problem asks if a graph has a matching cut. This problem, and its generalization d-cut, has…
We introduce a construction to embed a quasiperiodic lattice of obstacles into a single unit cell of a higher-dimensional space, with periodic boundary conditions. This construction transparently shows the existence of channels in these…
We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the…
In this paper, a new image encryption scheme using a secret key of 144-bits is proposed. In the substitution process of the scheme, image is divided into blocks and subsequently into color components. Each color component is modified by…
Simultaneous localization and mapping, especially the one relying solely on video data (vSLAM), is a challenging problem that has been extensively studied in robotics and computer vision. State-of-the-art vSLAM algorithms are capable of…
The Massively Parallel Computation (MPC) model is an emerging model which distills core aspects of distributed and parallel computation. It has been developed as a tool to solve (typically graph) problems in systems where the input is…
Traditional DRAM-based main memory systems face several challenges with memory refresh overhead, high latency, and low throughput as the industry moves towards smaller DRAM cells. These issues have been exacerbated by the emergence of…
We introduce the concept of Almost-Companion Matrix (ACM) by relaxing the non-derogatory property of the standard Companion Matrix (CM). That is, we define an ACM as a matrix whose characteristic polynomial coincides with a given monic and…
A dynamic SBox using a chaotic map is a cryptography technique that changes the SBox during encryption based on iterations of a chaotic map, adding an extra layer of confusion and security to symmetric encryption algorithms like AES. The…
The growing demand for highly reliable communication systems drives the research and development of algorithms that identify and correct errors during data transmission and storage. This need becomes even more critical in hard-to-access or…
We consider the incomplete multi-graph matching problem, which is a generalization of the NP-hard quadratic assignment problem for matching multiple finite sets. Multi-graph matching plays a central role in computer vision, e.g., for…
Schematic maps are in daily use to show the connectivity of subway systems and to facilitate travellers to plan their journeys effectively. This study surveys up-to-date algorithmic approaches in order to give an overview of the state of…
We establish the emergence of chaotic motion in optomechanical systems. Chaos appears at negative detuning for experimentally accessible values of the pump power and other system parameters. We describe the sequence of period doubling…