arXiv subjects

Hiroyuki Nakagawa

Publications and source records attributed to Hiroyuki Nakagawa.

5 recordsLinked to original sources

arXiv2022

Embedded System Evolution in IoT System Development Based on MAPE-K Loop Mechanism

Embedded systems including IoT devices are designed for specialized functions; thus, changes in functions are not considered following their release. For this reason, changing functions to satisfy the requirements of IoT systems is difficult. In this study, we focus on updating existing embedded systems without modifying them. We investigate the design of new functions and their implementation with limited resources. This paper describes an evolution mechanism for updating the functionalities of existing embedded systems. The evolution mechanism uses a control unit that is deployed outside the embedded system. To guide the steady implementation of the evolution mechanism, we define an evolution process that effectively uses the state machine diagram at the design time and runtime to update the embedded systems. The programming framework implemented in this study supports the evolution process. We evaluate the evolution mechanism based on the results from two experiments. The first experiment involved applying the evolution mechanism to a cleaning robot, this demonstrated that the evolution mechanism systematically enables the injection of new functions into an embedded system in the real world. The second experiment, on the probabilistic model checking, demonstrated that the mechanism provides almost the same performance as the ordinary embedded system with an improved robustness.

cs.SE↗

arXiv2019

Using simulated annealing for locating array construction

Context: Combinatorial interaction testing is known to be an efficient testing strategy for computing and information systems. Locating arrays are mathematical objects that are useful for this testing strategy, as they can be used as a test suite that enables fault localization as well as fault detection. In this application, each row of an array is used as an individual test. Objective: This paper proposes an algorithm for constructing locating arrays with a small number of rows. Testing cost increases as the number of tests increases; thus the problem of finding locating arrays of small sizes is of practical importance. Method: The proposed algorithm uses simulation annealing, a meta-heuristic algorithm, to find locating array of a given size. The whole algorithm repeatedly executes the simulated annealing algorithm by dynamically varying the input array size. Results: Experimental results show 1) that the proposed algorithm is able to construct locating arrays for problem instances of large sizes and 2) that, for problem instances for which nontrivial locating arrays are known, the algorithm is often able to generate locating arrays that are smaller than or at least equal to the known arrays. Conclusion: Based on the results, it is concluded that the proposed algorithm can produce small locating arrays and scale to practical problems.

cs.SE↗

arXiv2019

Finding minimum locating arrays using a CSP solver

Combinatorial interaction testing is an efficient software testing strategy. If all interactions among test parameters or factors needed to be covered, the size of a required test suite would be prohibitively large. In contrast, this strategy only requires covering $t$-wise interactions where $t$ is typically very small. As a result, it becomes possible to significantly reduce test suite size. Locating arrays aim to enhance the ability of combinatorial interaction testing. In particular, $(\overline{1}, t)$-locating arrays can not only execute all $t$-way interactions but also identify, if any, which of the interactions causes a failure. In spite of this useful property, there is only limited research either on how to generate locating arrays or on their minimum sizes. In this paper, we propose an approach to generating minimum locating arrays. In the approach, the problem of finding a locating array consisting of $N$ tests is represented as a Constraint Satisfaction Problem (CSP) instance, which is in turn solved by a modern CSP solver. The results of using the proposed approach reveal many $(\overline{1}, t)$-locating arrays that are smallest known so far. In addition, some of these arrays are proved to be minimum.

cs.SE↗

arXiv2019

Diverse Stochasticity Leads a Colony of Ants to Optimal Foraging

A mathematical model of garden ants (Laius japonicus) is introduced herein to investigate the relationship between the distribution of the degree of stochasticity in following pheromone trails and the group foraging efficiency. Numerical simulations of the model indicate that depending on the systematic change of the feeding environment, the optimal distribution of stochasticity shifts from a mixture of almost deterministic and mildly stochastic ants to a contrasted mixture of almost deterministic ants and highly stochastic ants. In addition, the interaction between the stochasticity and the pheromone path regulates the dynamics of the foraging efficiency optimization. Stochasticity could strengthen the collective efficiency when stochasticity to the sensitivity of pheromone for ants is introduced in the model.

nlin.AO↗

arXiv2004

Flexible Foraging of Ants under Unsteadily Varying Environment

Using a simple model for the trail formation of ants, the relation between i)the schedule of feeding which represents the unsteady natural environment, ii)emerging patterns of trails connecting a nest with food resources, and iii)the foraging efficiency is studied. Simulations and a simple analysis show that the emergent trail pattern flexibly varies depending on the feeding schedule by which ants can make an efficient foraging according to the underlying unsteady environment.

q-bio.PE↗