Search Sites

Transactions of the Institute of Systems, Control and Information Engineers Vol. 16 (2003), 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. 16 (2003), No. 2

Test Statistics for a Masquerader Detection System

Takeshi OKAMOTO, Yuji WATANABE, Yoshiteru ISHIDA

pp. 61-69

Abstract

The performance analysis is carried out for a masquerader detection system by a hidden Markov model (HMM). A Markov model and a probability distribution have been applied to many intrusion detection systems, however it is not clear to what extent the HMM improves the performance in detecting a masquerader, compared with other two probabilistic models. Statistics of these three models are compared and the advantage of the HMM for a masquerader detection system is clarified. Some implications useful in extending the other two probabilistic models to an HMM are also provided.

Bookmark

Share it with SNS

Article Title

Test Statistics for a Masquerader Detection System

Support Vector Machines using Multi Objective Linear Programming

Takeshi ASADA, Hirotaka NAKAYAMA

pp. 70-76

Abstract

Support Vector Machines (SVMs) are now thought as a powerful method for solving pattern recognition problems. SVMs are usually formulated as Quadratic Programming (QP). Using another distance function, SVMs can be formulated as Linear Programming (LP). In general, SVMs tend to make overlearning. In order to overcome this difficulty, the notion of soft margin is introduced. In this event, it is difficult to decide the weight for slack variables reflecting soft margin. In this paper, soft margin method is extended to Multi Objective Linear Programming (MOLP). It will be shown throughout several examples that SVMs reformulated as MOLP can give a good performance in pattern classification.

Bookmark

Share it with SNS

Article Title

Support Vector Machines using Multi Objective Linear Programming

Self-Localization for Mobile Robots Based on Model-Fitting of Floor Region on Omni-Directional Image

Daisuke SEKIMORI, Tomoya USUI, Yasuhiro MASUTANI, Fumio MIYAZAKI

pp. 77-84

Abstract

In this paper, we propose a method of self-localization for mobile robots. The method is based upon model-fittng of floor region provided by the omni-directional camera mounted on the robot. In our method, even if a part of the floor region is hidden by obstacles, this can be compensated for by computing the convex hull of a boundary point set of the floor region in the omni-directional image. The geometric features of the detected floor region and the linearized least square method considering the properties of omni-directional imaging are employed to fit the known floor shape. In addition, we developed a self-localization method that allowed for better estimates of values by integrating omni-directional vision and dead reckoning with the Kalman filter than by individual methods. Finally, we verify the effectiveness of these methods through several experiments with a real robot according to the rule of the RoboCup Small Size League.

Bookmark

Share it with SNS

Article Title

Self-Localization for Mobile Robots Based on Model-Fitting of Floor Region on Omni-Directional Image

New State Space Design Method of Stable Filtered Inverse Systems and Their Application

Kou YAMADA, Wataru KINOSHITA

pp. 85-93

Abstract

This paper considers a design method of filtered inverse systems for time-invariant systems, which reproduce the input signal to the system approximately. The inverse system must be stable in practical applications. It is well known that the inverse system is unstable if the system has invariant zeros in the closed right half plane. Yamada and Watanabe presented a state space design method of stable filtered inverse systems for strictly proper systems with some right half plane invariant zeros. However, the series connected system with the system and filtered inverse system is not always diagonal rational function. The purpose of this paper is to give a state space design method of stable filtered inverse systems such that the series connected system with the system and stable filtered inverse system is a diagonal rational function. We construct preliminary the filtered inverse system by usual method and factorize the filtered inverse systems to several subsystems. The stable filtered inverse system is obtained using observer design for subsystems of the filtered inverse system. Numerical example is illustrated to demonstrait the effectiveness of the proposed method. Finally, an application of the stable filtered inverse systems is presented.

Bookmark

Share it with SNS

Article Title

New State Space Design Method of Stable Filtered Inverse Systems and Their Application

Improved Worst-Case L2 Gain Analysis for Systems with Switching and Dynamic Uncertainty Based on LMIs

Toru ASAI

pp. 94-100

Abstract

This paper deals with analysis of bumpy responses for systems with switching and uncertainty. Switching in control systems often causes bumpy responses. Since those responses are harmful, several methods have been proposed to attain bumpless transfer. However, the existing methods may not have enough robustness. Recently, another method has been proposed to analyze bumpy responses for systems with uncertainty, where the bumpy responses are analyzed through the worst-case L2 gain from the past disturbance to the future control output, with the expense of conservatism. This paper aims to improve the results by reducing the conservatism. The proposed analysis results are less conservative and given in terms of linear matrix inequalities. A numerical example shows that the proposed method actually gives a less conservative result than existing methods.

Bookmark

Share it with SNS

Article Title

Improved Worst-Case L2 Gain Analysis for Systems with Switching and Dynamic Uncertainty Based on LMIs

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.