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. 16 (2003), 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. 16 (2003), No. 12

Distributed Genetic Algorithm with Centralized Multiple Crossovers Applied to Traveling Salesman Problems

Mitsunori MIKI, Tomoyuki HIROYASU, Yoshiko HANADA, Takanori MIZUTA

pp. 607-615

DOI:

10.5687/iscie.16.607

Abstract

This paper proposes a new method of genetic algorithms (GAs) for discrete optimization problems. For continuous optimization problems, it has been reported that distributed genetic algorithms (DGAs) show the higher performance than conventional GAs. However, for discrete optimization problems, the performance of DGAs has not been clear so far. In this paper, we propose a new approach in DGAs to discrete optimization problems. The proposed method is based on the multiple crossovers applied to the population consists of offsprings from elite individuals in distributed subpopulations (Centralized Multiple Crossover : CMX). We examine the performence of a conventional GA, DGA and proposed method for a typical discrete optimization problem, the Traveling Salesman Problem (TSP). The experiments showed that the proposed method provides better performance than the conventional DGA.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Distributed Genetic Algorithm with Centralized Multiple Crossovers Applied to Traveling Salesman Problems

twitter
facebook
mendeley

Bibtex

Ris

Implementation and Evaluation of Reliable Visual Marks Using Digital Watermark for Web Site Authentication

Hirokazu AOSHIMA, Hiroshi YOSHIURA, Seiichi SUSAKI, Shinsuke HONJO, Hisashi TOYOSHIMA, Ryoichi SASAKI

pp. 616-627

DOI:

10.5687/iscie.16.616

Abstract

Recently, World Wide Web plays an essential role in public and business applications such as information publication and electronic commerce, and its reliability is strongly required. Mark-based authentication has therefore started. It evaluates web sites and issues authentication marks to the sites. The marks are displayed on web pages of the sites, and users of the sites can judge their reliability by seeing the marks. This paper describes a web site authentication mark system which realizes generation, presentation and verification of marks. Especially the paper describes : (1) requirements for the system concerning security, usability, response speed, cost, and extensibility, (2) mark verification by digital signatures embedded in marks and by online queries, (3) implementation of verification programs as plug-ins of web browsers, (4) version management by embedded version IDs in marks, (5) life cycle management of marks using databases, (6) examples of the system behavior. The paper also explains reality of the proposed system through evaluations and comparison with previous systems.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Implementation and Evaluation of Reliable Visual Marks Using Digital Watermark for Web Site Authentication

twitter
facebook
mendeley

Bibtex

Ris

A Decentralized Supply Chain Optimization Method for Single Stage Production Systems

Tatsushi NISHI, Masami KONISHI, Yutaka HATTORI, Shinji HASEBE

pp. 628-636

DOI:

10.5687/iscie.16.628

Abstract

In recent years, the integrated optimization of planning and scheduling from customer order management to delivery has been required from the viewpoint of Supply Chain Management. However, the simultaneous optimization model becomes increasingly complicated and often very difficult to be solved with the increase of the number of combinatorial alternatives. In this paper, we propose a decentralized supply chain optimization method for single stage production systems in which the total decision variables are optimized by solving several sub-problems consisting of Material Requirement Planning, Scheduling and Distribution Planning. A supply chain planning problem for single production system is solved by the proposed method and a hierarchical planning method. Numerical results show that the proposed method generates better solutions than the conventional method for the problems in which the planning decisions are relatively concerned with scheduling decisions.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Decentralized Supply Chain Optimization Method for Single Stage Production Systems

twitter
facebook
mendeley

Bibtex

Ris

Nonlinear Optimal Control by Monte-Carlo Methods Applied to Path Integrals

Teturo ITAMI

pp. 637-648

DOI:

10.5687/iscie.16.637

Abstract

Nonlinear optimal control using Monte-Carlo calculation of path integrals is proposed. Wave functions appearing in a quantum mechanical theory of nonlinear optimal control are represented as superposition of various paths connecting initial and final points. A transformation of a characteristic designer's constant HR to a pure imaginary value, HR=iHR is applied to these path integrals. Wave functions are then calculated as statistical mean values under the Boltzmann distributions with temperatures proportional to HR, the transformed values of the designer, s constant. Monte-Carlo methods enforced by Metropolis algorithm are then applied to evaluate wave functions and optimal control calculations. Validities of proposed scheme will be shown in simple systems with 1-input and 1-state variables.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Nonlinear Optimal Control by Monte-Carlo Methods Applied to Path Integrals

twitter
facebook
mendeley

Bibtex

Ris

Relaxation Methods of Parametrized LMIs Based on D.C. and Multiconvex Technique

Hiroyuki ICHIHARA, Eitaku NOBUYAMA, Takanori ISHII

pp. 649-654

DOI:

10.5687/iscie.16.649

Abstract

This paper gives relaxation methods reducing a feasibility or optimization problem under a parametrized linear matrix inequality constraint to a finite number of LMIs constraint. The methods are based on convexification of difference of convex (d.c.) and multiconvexification. We propose a generalized relaxation method of d.c. convexification and a unified relaxation method between d.c convexification and multiconvexification techniques. These methods are applied to stability analysis and L2 gain analysis of parameter-dependent systems. Numerical examples are illustrated for each applications.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Relaxation Methods of Parametrized LMIs Based on D.C. and Multiconvex Technique

twitter
facebook
mendeley

Bibtex

Ris

MOR-tree : An Access Structure for Multi-levels of Road Networks on Distributed Environment

Jun FENG, Toyohide WATANABE

pp. 655-661

DOI:

10.5687/iscie.16.655

Abstract

With a view to attaining the sharability and consistency of map information under distributed environment, we propose a Multi-level/Multi-theme map information model to maintain maps in consistency with original source datasets under distributed environment. However, the distributed management of spatial datasets results in a complex maintenance processing, especially when the modification refers to several datasets. To solve this problem effectually, in this paper we propose an index structure, MOR-tree (Multi-levels of Object-Relation tree), for organizing integrated maintenance procedure. MOR-tree is an extension of R-tree for indexing spatial objects of multi-levels in one hierarchy and records relations among objects at different levels. The performance of MOR-tree is also evaluated with a prototype system in this paper.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

MOR-tree : An Access Structure for Multi-levels of Road Networks on Distributed Environment

twitter
facebook
mendeley

Bibtex

Ris

Constrained Global Optimization Methods by Using Inner State Models with Nonlinear Dissipative Dynamics

Takashi OKAMOTO, Eitaro AIYOSHI

pp. 662-669

DOI:

10.5687/iscie.16.662

Abstract

Optimization methods by using chaos dynamics are interesting as a class of global optimization methods by which the global minimum can be obtained without trapping in local minima. The chaos dynamics are classfied into discretized gradient models and continuous dissipative models with a nonlinear damping term. In this paper, two types of constrained optimization problems are considered in order to present nonlinear dissipative dynamics embedded in their constraints. One of types of the constraints is upper and lower bounds on each variable, and the other type is a simplex. For the each type of constraints, the inner state model with nonlinear dissipative dynamics w.r.t.inner states is introduced, which is composed of a nonlinear inertial model with the gradient and a nonlinear output function. As the nonlinear dissipative dynamics, Fujita-Yasuda's Model [6] and Tani's Model [7] are adopted. Especially, their revised models are proposed newly for the simplex type. The numerical simulations for a few constrained optimization problems demonstrate effectiveness of presented constrained global optimization methods.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Constrained Global Optimization Methods by Using Inner State Models with Nonlinear Dissipative Dynamics

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.