Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 32 (2019), No. 2

ISIJ International
belloff
ONLINE ISSN: 2185-811X
PRINT ISSN: 1342-5668
Publisher: THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Backnumber

  1. Vol. 37 (2024)

  2. Vol. 36 (2023)

  3. Vol. 35 (2022)

  4. Vol. 34 (2021)

  5. Vol. 33 (2020)

  6. Vol. 32 (2019)

  7. Vol. 31 (2018)

  8. Vol. 30 (2017)

  9. Vol. 29 (2016)

  10. Vol. 28 (2015)

  11. Vol. 27 (2014)

  12. Vol. 26 (2013)

  13. Vol. 25 (2012)

  14. Vol. 24 (2011)

  15. Vol. 23 (2010)

  16. Vol. 22 (2009)

  17. Vol. 21 (2008)

  18. Vol. 20 (2007)

  19. Vol. 19 (2006)

  20. Vol. 18 (2005)

  21. Vol. 17 (2004)

  22. Vol. 16 (2003)

  23. Vol. 15 (2002)

  24. Vol. 14 (2001)

  25. Vol. 13 (2000)

  26. Vol. 12 (1999)

  27. Vol. 11 (1998)

  28. Vol. 10 (1997)

  29. Vol. 9 (1996)

  30. Vol. 8 (1995)

  31. Vol. 7 (1994)

  32. Vol. 6 (1993)

  33. Vol. 5 (1992)

  34. Vol. 4 (1991)

  35. Vol. 3 (1990)

  36. Vol. 2 (1989)

  37. Vol. 1 (1988)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 32 (2019), No. 2

H State Estimation for Linear Continuous-Time Systems Driven by Wiener and Poisson Processes

Gou Nakura

pp. 47-54

Abstract

While H filtering theory for stochastic continuous-time systems driven by Poisson processes has been presented by B. Song et al.(2015), H smoothing theory for the systems and the relationship between H filtering and smoothing have not been yet fully investigated. In this paper, we study the H state estimation (filtering and smoothing) problems for a class of linear continuous-time systems driven by Wiener and Poisson processes on the finite time interval. In order to derive H state estimators, we adopt unified stochastic variational approach which has not been found in previous work by any other researchers.

Bookmark

Share it with SNS

Article Title

H State Estimation for Linear Continuous-Time Systems Driven by Wiener and Poisson Processes

Stochastic Consensus over Multi-Channel Networks of MIMO Linear Symmetric Agents

Kenta Hanada, Takayuki Wada, Izumi Masubuchi, Toru Asai, Yasumasa Fujisaki

pp. 55-62

Abstract

Multi-agent systems over noisy networks with multi-input/multi-output linear symmetric agents are considered. The information is assumed to be sent from an agent to its neighbors via multi-channels. The communication graph of each channel is allowed to be time varying and a different topology. The entire network which is defined by the union of all graph is assumed to be connected in an undirected graph case or weakly connected and balanced in a directed one. The aim of this study is to establish a stopping rule of a stochastic averaging consensus under a noisy and time-varying network. The convergence analysis reveals an explicit relation between the number of iterations and the closeness of the consensus. The results are illustrated through numerical examples.

Bookmark

Share it with SNS

Article Title

Stochastic Consensus over Multi-Channel Networks of MIMO Linear Symmetric Agents

Event Related Hemodynamics and Potentials evoked by Visual Attention Task

Kanako Mikami, Kunihiko Oura

pp. 63-68

Abstract

This paper discusses “visual attention” related hemodynamics and potentials during performance of modified paced visual serial addition test (mPVSAT). In researches for human cognitive function, “attention” is regarded as the basis of all mental abilities or human actions. The mPVSAT task, as our revised version of standardized test concerning attention, also needs higher-order attention to solve the test. Then, in order to make clear the mechanism of attentional function, brain activity is evaluated by event related hemodynamics (ERH) and event related potentials (ERP) in our study. From the results, some typical areas with high processing speed or large volume of blood flow are shown. Judgement and recognition process tend to be slow while complicated stimulus in visual attention task.

Bookmark

Share it with SNS

Article Title

Event Related Hemodynamics and Potentials evoked by Visual Attention Task

Income Allocation to Workers in Synthetic Populations Using Basic Survey on Wage Structure

Sho Sugiura, Tadahiko Murata, Takuya Harada

pp. 69-78

Abstract

In this paper, we propose a synthetic reconstruction method (SR method) to allocate an income attribute to each worker in synthetic populations. A synthetic population is a population synthesized based on statistics. We assign an income attribute to each worker in individual households using statistics in Japan. In order to add that attribute, we first prepare a synthetic population of households with members synthesized by our previously proposed SR method. Then we assign job attributes such as a working status, a type of employment, a type of industry, and a size of enterprise according to four statistics using our SR method. After determining the working status, we assign job attributes besides the working status for each worker. We determine the monthly income of each worker based on his/her job attributes. To see the validity of allocated monthly income, we compare the average income of each type of industry in the synthesized population with the statistics of the average income of each type of industry that is not used in the synthesizing procedure. The result showed that the error over all industries becomes 0.8% to 10.3% in allocating income to each worker in a synthesized population.

Bookmark

Share it with SNS

Article Title

Income Allocation to Workers in Synthetic Populations Using Basic Survey on Wage Structure

Metaheuristic Framework Introducing the Concept of Reinforcement Learning for Combinatorial Optimization Problems

Hiroki Nakajima, Hitoshi Iima

pp. 79-86

Abstract

Metaheuristics are promising methods for combinatorial optimization problems. However, existing metaheuristics cannot necessarily find optimal solutions or near-optimal solutions. Meanwhile, in the field of machine learning, reinforcement learning theoretically enables an agent to learn optimal actions and has attracted attention. Thus, we previously proposed a general metaheuristic framework based on the reinforcement learning. However, this framework is not superior in finding good solutions in a short time because it generates a relatively large number of infeasible solutions. In this paper, we propose an extension of the metaheuristic framework to find better solutions. In addition, we propose a concrete method based on the metaheuristic framework for solving the knapsack problem as a case study. The effectiveness of our proposed method is verified through experiments of applying the proposed method and other methods to the knapsack problem.

Bookmark

Share it with SNS

Article Title

Metaheuristic Framework Introducing the Concept of Reinforcement Learning for Combinatorial Optimization Problems

You can use this feature after you logged into the site.
Please click the button below.

Advanced Search

Article Title

Author

Abstract

Journal Title

Year

Please enter the publication date
with Christian era
(4 digits).

Please enter your search criteria.