Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleFebruary 2024
Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs
Journal of Computer and System Sciences (JCSS), Volume 139, Issue Chttps://doi.org/10.1016/j.jcss.2023.103475AbstractWe consider Internet of Things (IoT) sensors deployed inside an area to be monitored. Drones can be used to collect the data from the sensors, but they are constrained in energy and storage. Therefore, all drones need to select a subset of ...
- research-articleJune 2023
Arithmetical complexity of the language of generic limit sets of cellular automata
Journal of Computer and System Sciences (JCSS), Volume 134, Issue CPages 20–41https://doi.org/10.1016/j.jcss.2023.01.002AbstractThe generic limit set of a dynamical system is the smallest set that attracts most of the space in a topological sense: it is the smallest closed set with a comeager basin of attraction. Introduced by Milnor, it has been studied in the context of ...
- research-articleNovember 2022
Lower bounds for Boolean circuits of bounded negation width
Journal of Computer and System Sciences (JCSS), Volume 129, Issue CPages 90–105https://doi.org/10.1016/j.jcss.2022.05.003AbstractThe negation width of a Boolean AND, OR, NOT circuit computing a monotone Boolean function f is the minimum number w such that the unique formal DNF produced (purely syntactically) by the circuit contains each prime implicant of f ...
- research-articleMay 2020
Complete simulation of automata networks
Journal of Computer and System Sciences (JCSS), Volume 109, Issue CPages 1–21https://doi.org/10.1016/j.jcss.2019.12.001AbstractConsider a finite set A and n ≥ 1. We study complete simulation of transformations of A n, also known as automata networks. For m ≥ n, a transformation of A m is n-complete of size m if it may simulate every transformation of A n by ...
- editorialSeptember 2019
-
- research-articleFebruary 2018
On the complexity of two-dimensional signed majority cellular automata
Journal of Computer and System Sciences (JCSS), Volume 91, Issue CPages 1–32https://doi.org/10.1016/j.jcss.2017.07.010We study the complexity of signed majority cellular automata on the planar grid. We show that, depending on their symmetry and uniformity, they can simulate different types of logical circuitry under different modes. We use this to establish new bounds ...
- research-articleDecember 2015
Authorship verification of e-mail and tweet messages applied for continuous authentication
Journal of Computer and System Sciences (JCSS), Volume 81, Issue 8Pages 1429–1440https://doi.org/10.1016/j.jcss.2014.12.019Authorship verification using stylometry consists of identifying a user based on his writing style. In this paper, authorship verification is applied for continuous authentication using unstructured online text-based entry. An online document is ...
- articleMay 2014
Analysis of impersonation attacks on systems using RF fingerprinting and low-end receivers
Journal of Computer and System Sciences (JCSS), Volume 80, Issue 3Pages 591–601https://doi.org/10.1016/j.jcss.2013.06.013Recently, physical layer security commonly known as Radio Frequency (RF) fingerprinting has been proposed to provide an additional layer of security for wireless devices. A unique RF fingerprint can be used to establish the identity of a specific ...
- articleFebruary 2014
Search methods for tile sets in patterned DNA self-assembly
Journal of Computer and System Sciences (JCSS), Volume 80, Issue 1Pages 297–319https://doi.org/10.1016/j.jcss.2013.08.003The Pattern self-Assembly Tile set Synthesis (PATS) problem, which arises in the theory of structured DNA self-assembly, is to determine a set of coloured tiles that, starting from a bordering seed structure, self-assembles to a given rectangular colour ...
- articleJune 2013
Cluster-based topologies for 3D Networks-on-Chip using advanced inter-layer bus architecture
Journal of Computer and System Sciences (JCSS), Volume 79, Issue 4Pages 475–491https://doi.org/10.1016/j.jcss.2012.09.005Three-dimensional integrated circuits (3D ICs) have emerged as a viable candidate to achieve better performance and packaging density as compared to traditional two-dimensional (2D) ICs. In addition, combining the benefits of 3D ICs and Networks-on-Chip ...
- articleJune 2013
Developing a power-efficient and low-cost 3D NoC using smart GALS-based vertical channels
Journal of Computer and System Sciences (JCSS), Volume 79, Issue 4Pages 440–456https://doi.org/10.1016/j.jcss.2012.09.004Shorter global interconnects enable 3D NoC structures to offer higher performance, improved packaging density, and lower interconnect power consumption to CMPs and SoCs compared to their 2D counterparts. However, substantial challenges such as high peak ...
- articleMarch 2013
Regional cache organization for NoC based many-core processors
Journal of Computer and System Sciences (JCSS), Volume 79, Issue 2Pages 175–186https://doi.org/10.1016/j.jcss.2012.05.002As the number of Processing Elements (PEs) on a single chip keeps growing, we are now facing with slower memory references due to longer wire delay, intenser on-chip resource contention and higher network traffic congestion. Network on Chip (NoC) is now ...
- articleJuly 2012
On time-symmetry in cellular automata
Journal of Computer and System Sciences (JCSS), Volume 78, Issue 4Pages 1115–1126https://doi.org/10.1016/j.jcss.2012.01.006The notion of reversibility has been intensively studied in the field of cellular automata (CA), for several reasons. However, a related notion found in physical theories has been so far neglected, not only in CA, but generally in discrete dynamical ...
- articleMarch 2011
Adaptive decentralized re-clustering protocol for wireless sensor networks
Journal of Computer and System Sciences (JCSS), Volume 77, Issue 2Pages 282–292https://doi.org/10.1016/j.jcss.2010.01.007Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is limited. The ...
- articleJanuary 2009
Learning a circuit by injecting values
Journal of Computer and System Sciences (JCSS), Volume 75, Issue 1Pages 60–77https://doi.org/10.1016/j.jcss.2008.07.004We propose a new model for exact learning of acyclic circuits using experiments in which chosen values may be assigned to an arbitrary subset of wires internal to the circuit, but only the value of the circuit's single output wire may be observed. We ...
- articleNovember 2008
Two-factor mutual authentication based on smart cards and passwords
Journal of Computer and System Sciences (JCSS), Volume 74, Issue 7Pages 1160–1172https://doi.org/10.1016/j.jcss.2008.04.002One of the most commonly used two-factor user authentication mechanisms nowadays is based on smart-card and password. A scheme of this type is called a smart-card-based password authentication scheme. The core feature of such a scheme is to enforce two-...
- articleNovember 2008
Languages not recognizable in real time by one-dimensional cellular automata
Journal of Computer and System Sciences (JCSS), Volume 74, Issue 7Pages 1095–1102https://doi.org/10.1016/j.jcss.2007.06.023This paper discusses real-time language recognition by one-dimensional cellular automata (CA), focusing on limitations of the parallel recognition power. We investigate language recognition of strings containing binary representations B(|w|) of their ...
- articleSeptember 2008
An Adaptive Dynamic Grid-Based approach to DDM for large-scale distributed simulation systems
Journal of Computer and System Sciences (JCSS), Volume 74, Issue 6Pages 1043–1054https://doi.org/10.1016/j.jcss.2007.07.007Data Distribution Management (DDM) plays a key role in traffic volume control of large-scale distributed simulations. In recent years, several solutions have been devised to make DDM more efficient and adaptive to different traffic conditions. Examples ...
- articleAugust 2008
Fault tolerance in cellular automata at high fault rates
Journal of Computer and System Sciences (JCSS), Volume 74, Issue 5Pages 910–918https://doi.org/10.1016/j.jcss.2008.02.003A commonly used model for fault-tolerant computation is that of cellular automata. The essential difficulty of fault-tolerant computation is present in the special case of simply remembering a bit in the presence of faults, and that is the case we treat ...