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. 26 (2013), 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.9
    2. No.8
    3. No.7
    4. No.6
    5. No.5
    6. No.4
    7. No.3
    8. No.2
    9. 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

22 Dec. (Last 30 Days)

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

Identification of Partially Unknown System Matrix of Discrete-time Stochastic Systems via Pseudomeasurement Approach

Akio Tanikawa, Yuichi Sawada

pp. 433-439

DOI:

10.5687/iscie.26.433

Abstract

In this paper, a new identification method of linear discrete-time stochastic systems is proposed. We assume that some entries of the system matrix are unknown and propose a new method which identifies those unknown entries and the state vector of the system simultaneously. The key idea of the proposed method is the use of pseudomeasurement which was first introduced by Whitecombe in tracking of maneuvering targets for obtaining high-accurate estimates of the system states from noisy observation data and has been used by several researchers for various purposes. We utilize the pseudomeasurement as a ficticious observation process on the unknown entries of the system matrix for obtaining better estimates of them. Augmenting the pseudomeasurement with the original observation process, we derive the new identification method by applying the extended Kalman filter.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Identification of Partially Unknown System Matrix of Discrete-time Stochastic Systems via Pseudomeasurement Approach

twitter
facebook
mendeley

Bibtex

Ris

Existence of Monotone EM Scheme with Implications in Cooperative Saliency Analysis

Kohji Kamejima

pp. 440-447

DOI:

10.5687/iscie.26.440

Abstract

By restricting `what-to-be-observed' in naturally complex scenes to `easy-to-compute' patterns, this paper presents a stochastic systems approach to the stabilization of early visual perception. In this approach, attentional landmarks are identified with saliency images latently specified in terms of a set of generic parameters. To stabilize the EM algorithm for the estimation of the latent parameters,a truncated version of innovation process is visualized via the multiplexing of residual distribution spanning entire the scene images; resulted visualization, simultaneously, yields an effective cue to confine the images of not-yet-identified landmarks. Based on experimental studies, it has been demonstrated that the focus control algorithm is available in the analysis of the first visit scenes; in this algorithm, it is sufficient to a priori define the attentional landmarks in terms of generic rules governing the perspective of the scene images; in contrast with conventional algorithms, no adhoc pre-processing is required to extract the saliency images under not-yet-identified photographing conditions.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Existence of Monotone EM Scheme with Implications in Cooperative Saliency Analysis

twitter
facebook
mendeley

Bibtex

Ris

State Estimation of Wireless Mobile Client based on Sensor Data Fusion for Localization in Multistory Building

Tomohiro Umetani, Susumu Yamane, Tomoya Yamashita, Yuichi Tamura

pp. 448-455

DOI:

10.5687/iscie.26.448

Abstract

This paper describes a state space model for estimating the location of a mobile wireless client based on sensor data fusion. Data pertaining to the physical position of personal electronic devices or mobile robots are important for information services and robotic applications. We use the strength of signals received by wireless LAN access points to locate mobile clients in multistory buildings. We also use the acceleration of the mobile client as sensor data. The output of an accelerometer is prone to uncertainty; we use a probabilistic model of the location estimated by wireless LAN signals and the acceleration acquired by a sensor to create an observation model. In addition, a simplified measurement method is proposed for use by a fingerprinting-type estimation system based on human footsteps. Experimental results show the feasibility of the proposed method.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

State Estimation of Wireless Mobile Client based on Sensor Data Fusion for Localization in Multistory Building

twitter
facebook
mendeley

Bibtex

Ris

On Noncausal H∞ Tracking Control for Linear Impulsive Systems with Stochastic Uncertainties

Gou Nakura

pp. 456-465

DOI:

10.5687/iscie.26.456

Abstract

In this paper we study the H∞ tracking problems with preview by state feedback for a class of linear continuous-time systems with impulsive effects and stochastic uncertainties on the finite time interval. The systems include linear stochastic discrete-time systems and linear systems with stochastic uncertainties and an input realized through a zero-order hold. In this paper we focus on the direct derivation method of noncausal compensator dynamics from the point of view of dynamics constraint. We derive the pair of noncausal compensator dynamics and impulsive Riccati equations by calculating the stochastic first variation of the performance index under the dynamics constraint.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

On Noncausal H∞ Tracking Control for Linear Impulsive Systems with Stochastic Uncertainties

twitter
facebook
mendeley

Bibtex

Ris

Using Ensemble Kalman Filter for Distributed Sensor Fusion

Pornsarayouth Sirichai, Masaki Yamakita

pp. 466-476

DOI:

10.5687/iscie.26.466

Abstract

Sensor fusion is a very powerful tool in various applications. Contrary to conventional methods using a single sensor, sensor fusions with multiple nodes (multiple sensors) give a state estimate from the distinct perspective of the nodes. By letting each node exchange data with its neighbors, a group of nodes form a sensor network, sensor fusion on each node can achieve more accurate estimation.However, in large-scale applications, a centralized sensor fusion which requires data from all nodes at once is not practical. On the other hand, using distributed or decentralized sensor fusion with conventional consensus algorithms which do not consider cross-covariance terms among nodes is not considerably efficient. We propose Ensemble Kalman Filter (EnKF) storing an estimation as a group of distinct particles to determine correlation between estimations. A cross-covariance can be easily obtained by simply approximating a sample second central cross-moment between estimations. Such a property of EnKF enables us to directly update a current estimation with the estimation from nearby nodes, even when the measurement is delayed. The proposed algorithm is proven to be globally optimal and iteratively stable even if redundancy of the estimation between nodes occurs.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Using Ensemble Kalman Filter for Distributed Sensor Fusion

twitter
facebook
mendeley

Bibtex

Ris

Reduced-order Construction of H∞ State Feedback Law for Discrete-time Input-delayed Systems

Kotaro Hashikura, Akira Kojima, Yoshito Ohta

pp. 477-488

DOI:

10.5687/iscie.26.477

Abstract

The H∞ state feedback control problem for discrete-time single input-delay systems is studied based on the min-max optimization and J-spectral factorization theories. The focus is on efficient construction of the H∞ state feedback law despite the augmented state space due to the input delay. By the min-max optimization approach, the feasibility of the H∞ disturbance attenuation is characterized in terms of a Riccati difference equation, and the stabilizing solution of the standard KYP equation for the augmented system is constructed from that for the delay-free case. The J-spectral factorization approach is outlined based on the author’s previous results. This approach yields another kind of feasibility conditions characterized in terms of a symplectic matrix. The relationship between the first and second approaches is addressed via finite-horizon ℓ2-gain analysis.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Reduced-order Construction of H∞ State Feedback Law for Discrete-time Input-delayed Systems

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

22 Dec. (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.