Related papers: Deterministic Computing Mechanism for Perfect Dens…
Since autonomous driving systems usually face dynamic and ever-changing environments, continual test-time adaptation (CTTA) has been proposed as a strategy for transferring deployed models to continually changing target domains. However,…
We consider the stability and the input-output analysis problems of a class of large-scale hybrid systems composed of continuous dynamics coupled with discrete dynamics defined over finite alphabets, e.g., deterministic finite state…
Cellular automata (CA) have been found as an attractive modeling tool for various applications, such as, pattern recognition, image processing, data compression, encryption, and specially for VLSI design & test. For such applications,…
The mechanism which discriminates the pattern classes at the same $\lambda$, is found. It is closely related to the structure of the rule table and expressed by the numbers of the rules which break the strings of the quiescent states. It is…
We consider the problem of finding response curves for a class of binary two-dimensional cellular automata with $L$-shaped neighbourhood. We show that the dependence of the density of ones after an arbitrary number of iterations, on the…
We argue that any general mathematical measure of density error, no matter how reasonable, is too arbitrary to be of universal use. However the energy functional itself provides a universal relevant measure of density errors. For the…
A number-conserving cellular automaton is a simplified model for a system of interacting particles. This paper contains two related constructions by which one can find all one-dimensional number-conserving cellular automata with one kind of…
In this paper we propose a rule-independent description of applications of cellular automata rules for one-dimensional additive cellular automata on cylinders of finite sizes. This description is shown to be a useful tool for for answering…
Interpretability is highly desired for deep neural network-based classifiers, especially when addressing high-stake decisions in medical imaging. Commonly used post-hoc interpretability methods have the limitation that they can produce…
For classical discrete systems on periodic lattice under constant composition x, we derive explicit expression of any-order moments for configurational density of states (CDOS). The derived expression clarifies that any-order moments can…
For distributed sensor/relay networks, high reliability and power efficiency are often required. However, several implementation issues arise in practice. One such problem is that all the distributed transmitters have limited power supply…
CA has grown as potential classifier for addressing major problems in bioinformatics. Lot of bioinformatics problems like predicting the protein coding region, finding the promoter region, predicting the structure of protein and many other…
Cellular Automata are discrete dynamical systems that evolve following simple and local rules. Despite of its local simplicity, knowledge discovery in CA is a NP problem. This is the main motivation for using data mining techniques for CA…
The Chinese Space Station Survey Telescope (CSST) aims to map the universe across an unprecedented dynamic range of stellar densities, spanning from extragalactic voids to the crowded Galactic center (e.g. a few stars and galaxies in the…
Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph…
Neural cellular automata (NCA) provide a lightweight alternative to encoder-decoder segmentation networks. However, it can be difficult to decide when a prediction should be trusted. Here, we study uncertainty estimation for NCA-based…
Cluster Perturbation Theory (CPT) is a technique for computing the spectral function of fermionic models with local interactions. By combining the solution of the model on a finite cluster with perturbation theory on intra-cluster hoppings,…
Cell counting remains a fundamental yet challenging task in medical and biological research due to the diverse morphology of cells, their dense distribution, and variations in image quality. We present DLA-Count, a breakthrough approach to…
With the rapid advancements in digital imaging systems and networking, low-cost hand-held image capture devices equipped with network connectivity are becoming ubiquitous. This ease of digital image capture and sharing is also accompanied…
We show that the $(degree+1)$-list coloring problem can be solved deterministically in $O(D \cdot \log n \cdot\log^2\Delta)$ rounds in the \CONGEST model, where $D$ is the diameter of the graph, $n$ the number of nodes, and $\Delta$ the…