logo
Language
Bookmarks
Log Out

Journals

Search Sites

Account

© 2022 Steel Science Portal

How to use

Advanced Search

Search Sites

site
site
site
site

Transactions of the Institute of Systems, Control and Information Engineers Vol. 25 (2012), No. 12

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)

    1. No.8
    2. No.7
    3. No.6
    4. No.5
    5. No.4
    6. No.3
    7. No.2
    8. No.1

  2. Vol. 36 (2023)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  3. Vol. 35 (2022)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  4. Vol. 34 (2021)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  5. Vol. 33 (2020)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  6. Vol. 32 (2019)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  7. Vol. 31 (2018)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  8. Vol. 30 (2017)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  9. Vol. 29 (2016)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  10. Vol. 28 (2015)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  11. Vol. 27 (2014)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  12. Vol. 26 (2013)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  13. Vol. 25 (2012)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  14. Vol. 24 (2011)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  15. Vol. 23 (2010)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  16. Vol. 22 (2009)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  17. Vol. 21 (2008)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  18. Vol. 20 (2007)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  19. Vol. 19 (2006)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  20. Vol. 18 (2005)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  21. Vol. 17 (2004)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  22. Vol. 16 (2003)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  23. Vol. 15 (2002)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  24. Vol. 14 (2001)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  25. Vol. 13 (2000)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  26. Vol. 12 (1999)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  27. Vol. 11 (1998)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  28. Vol. 10 (1997)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  29. Vol. 9 (1996)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  30. Vol. 8 (1995)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  31. Vol. 7 (1994)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  32. Vol. 6 (1993)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  33. Vol. 5 (1992)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  34. Vol. 4 (1991)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  35. Vol. 3 (1990)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  36. Vol. 2 (1989)

    1. No.12
    2. No.11
    3. No.10
    4. No.9
    5. No.8
    6. No.7
    7. No.6
    8. No.5
    9. No.4
    10. No.3
    11. No.2
    12. No.1

  37. Vol. 1 (1988)

    1. No.7
    2. No.6
    3. No.5
    4. No.4
    5. No.3
    6. No.2
    7. No.1

Keyword Ranking

21 Nov. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 25 (2012), No. 12

Optimal Strategies for Vaccination using the Stochastic SIRV Model

Ishikawa Masaaki

pp. 343-348

DOI:

10.5687/iscie.25.343

Abstract

Despite the advanced medical technology, infectious diseases remain a continuing threat to mankind. Hence, a prevention of prevalence of infectious diseases is one of important problems in epidemiology. In the past, the public health system has prepared for some strategies such as antibiotics and vaccines to control the infectious disease development. In order to build up more effective strategies, we need a precise theoretical analysis of infectious diseases. From a theoretical viewpoint, the mathematical model which describes the spread of the infectious disease has a very important role. In this paper, we study the stochastic modeling of the infectious disease in populations consisting of four groups: susceptible, infected, recovered and vaccinated. We consider the optimal vaccination strategy under the framework of the stochastic optimal control problem. Applying the stochastic maximum principle and the four-step scheme to the considered stochastic optimal control problem, we construct a feasible optimal vaccination system.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Optimal Strategies for Vaccination using the Stochastic SIRV Model

twitter
facebook
mendeley

Bibtex

Ris

Local Convergence of the Sequential Quadratic Method for Differential Games

Akio Tanikawa, Hiro Mukai, Min Xu

pp. 349-357

DOI:

10.5687/iscie.25.349

Abstract

For computing a Nash (saddle point) solution to a zero-sum differential game for a general nonlinear system, Mukai et al. presented an iterative Sequential Quadratic-Quadratic Method (SQQM) as follows. Given a solution estimate, they defined a subproblem which approximates the original problem up to the second order around the solution estimate. They proposed to replace the subproblem with another subproblem in order to obtain a game problem with only a linear dynamics by removing the quadratic terms in the system dynamics and adding them to the payoff function as in Lagrangian function. We can now solve this subproblem conveniently by a Riccati equation method. We then update the solution estimate by adding its Nash solution to the current solution estimate for the original game. Through our extensive experiments, we observed not only local convergence of the SQQM but also much faster convergence of the SQQM than the iterative methods based on lower order approximations such as the Sequential Linear-Quadratic Method (SLQM). In this paper we will establish local convergence of the SQQM.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Local Convergence of the Sequential Quadratic Method for Differential Games

twitter
facebook
mendeley

Bibtex

Ris

Stochastic Graph Minor Generation via Dynamic Reference to Geographics Annotation

Kohji Kamejima

pp. 358-365

DOI:

10.5687/iscie.25.358

Abstract

A stochastic-computational scheme is presented for generating as-is graph structure spanning complex local geographics. In this schematics, GPS tracks uploaded by a multitude of probe vehicles are exploited to expand a network of feasible roadway patterns. By associating the GPS tracks with a multitude of Brownian motions conditioned by landmark allocation, the graph structure is successively augmented in terms of feasible roadway segments. In reference to the augmented information, symbolic design of over-the-horizon maneuvering process can be interactively substantiated into a chain of topological minors grounded on the local geographics.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Stochastic Graph Minor Generation via Dynamic Reference to Geographics Annotation

twitter
facebook
mendeley

Bibtex

Ris

Hybrid Optimization of the Observations for Stationary LQG Control Systems

Yoshiki Takeuchi, Ryo Matsumi

pp. 366-374

DOI:

10.5687/iscie.25.366

Abstract

In this paper, we consider an optimization problem for observations of stationary LQG stochastic control systems which employ the stationary Kalman filter. The performance of the Kalman filter and that of the LQG stochastic optimal control are both dependent on the gain matrix in the linear observation. One of the authors has already developed methods of optimizing this gain matrix based on the estimation or control individual performance under a quadratic performance criterion. This paper discusses a hybrid problem by taking into account of both estimator and regulator performances. By introducing the eigenvalues-eigenvectors representation of a nonnegative definite symmetric matrix, the condition of optimality is derived. Also, numerical calculations are easily carried out by introducing multi-dimensional polar coordinates systems.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Hybrid Optimization of the Observations for Stationary LQG Control Systems

twitter
facebook
mendeley

Bibtex

Ris

Analytical Solution to Equations of Brillouin Optical Time Domain Reflectometry and Its Properties

Ken’ichi Nishiguchi

pp. 375-381

DOI:

10.5687/iscie.25.375

Abstract

We analytically solved the equations for Brillouin optical time domain reflectometry (BOTDR), which is a distributed strain/temperature sensing system that uses a property where the scattering spectrum shifts in proportion to the change of the strain/temperature. Although the equations include both spontaneous and stimulated Brillouin scattering terms, we show that the largest part of the measured spectrum arises from spontaneous scattering in usual BOTDR conditions. This indicates that the term related to stimulated scattering in the equations for BOTDR can be ignored and we show that the observed spectrum is analytically represented in that case.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Analytical Solution to Equations of Brillouin Optical Time Domain Reflectometry and Its Properties

twitter
facebook
mendeley

Bibtex

Ris

On a Probabilistic Approach for Capricious Vague Perceptions of Random Phenomena

Tokuo Fukuda

pp. 382-388

DOI:

10.5687/iscie.25.382

Abstract

In this paper, the author investigates a class of fuzzy random sets as the vague perception of a crisp phenomenon or a crisp random phenomenon. First, considering that the vague perception of a crisp phenomenon fluctuates slightly but randomly due to the state of a capricious person’s mind, a new class of fuzzy random set is introduced. Secondly, the proposed fuzzy random set is generalized as the vague perception of a crisp random phenomenon. The expectations of the introduced fuzzy random sets are investigated from the viewpoint of the multivalued logic proposed by Kwakernaak[1].

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

On a Probabilistic Approach for Capricious Vague Perceptions of Random Phenomena

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

21 Nov. (Last 30 Days)

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.