logo
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. 30 (2017), No. 6

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

Backnumber

  1. 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

  2. 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

  3. 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

  4. 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

  5. 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

  6. 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

  7. 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

  8. 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

  9. 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

  10. 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

  11. 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

  12. 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

  13. 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

  14. 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

  15. 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

  16. 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

  17. 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

  18. 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

  19. 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

  20. 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

  21. 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

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

  23. 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

  24. 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

  25. 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

  26. 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

  27. 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

  28. 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

  29. 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

  30. 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

  31. 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

  32. 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

  33. 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

  34. 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

  35. Vol. 1 (1988)

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

Search Phrase Ranking

26 Mar. (Last 30 Days)

Transactions of the Institute of Systems, Control and Information Engineers Vol. 30 (2017), No. 6

Soft-sensor Development for Flow Measurement in Central Air-Conditioning System

Reiko Hattori, Toru Fujii, Manabu Kano

pp. 209-215

DOI:

10.5687/iscie.30.209

Abstract

In a central-air-conditioning system, a centralized unit cools or heats water before its circulation throughout a building. By using cooled or heated water, each air conditioner cools or heats each room. To control room temperature, the centralized unit needs to create heating value (heat demand) enough to cool or heat all rooms. To satisfy both indoor comfort and energy saving, the centralized unit needs to create the minimum heat demand that is necessary to satisfy indoor comfort. Heat demand is calculated from temperature difference and water flow rate. However, flow sensors are rarely attached because they are expensive. In this work, we developed a soft-sensor for predicting water flow rate. Although linear regression models have been widely used, they cannot always achieve high estimation accuracy because most of the systems are non-linear and changes in system characteristics make models not suitable. Thus, we adopted locally weighted regression, which is a type of Just-In-Time modeling methods, and achieved high estimation performance.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Soft-sensor Development for Flow Measurement in Central Air-Conditioning System

twitter
facebook
mendeley

Bibtex

Ris

Two-Fold Optimization by Evolutionary Computation and Simulated Annealing for Reconstructing Citizens' Attributes from Statistics

Daiki Masui, Tadahiko Murata

pp. 216-227

DOI:

10.5687/iscie.30.216

Abstract

In this paper, we propose a simulated annealing method with an evolutionary computation for reconstructing citizens’' attributes from statistics. To implement agent-based social simulations for real communities, it is needed to reconstruct citizens'’ attributes such as age, sex, income, occupation,academic background, and so on. Although such personal data are available in the local government,they are protected for privacy reason. In order to enable any body to implement agent-based social simulation, a reliable reconstruction method is required. In this paper, we modify a previous approach using simulated annealing by incorporating a method that minimizes errors between a generated population and the real statistics. Additionally we propose an evolutionary algorithm that is applied before the proposed modified simulated annealing. We show the effectivity of the proposed two-fold algorithm using some computational experiments.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Two-Fold Optimization by Evolutionary Computation and Simulated Annealing for Reconstructing Citizens' Attributes from Statistics

twitter
facebook
mendeley

Bibtex

Ris

Combination of MATLAB/Simulink Models and Code Libraries by Extended UML

Masatoshi Arai, Tohru Eguchi, Haruyuki Ishida, Norihiko Yoshida

pp. 228-237

DOI:

10.5687/iscie.30.228

Abstract

To improve development efficiency, model based techniques have been increasingly applied in embedded systems. For example, MATLAB/Simulink is regularly used for expressing physical phenomena, including signal processing and control systems. While it is very effective in these areas, it lacks object oriented capabilities that have been proven to increase development efficiency in related domains. UML is effective for descriptions of structures using object oriented abstraction, however it cannot express physical phenomenon easily. Furthermore, in conventional software engineering,code-libraries are regularly used to deliver significant development efficiency improvements across a wide range of domains, however neither MATLAB/Simulink nor UML include code-libraries. In this paper, we propose an extended UML to combine an UML model, MATLAB/Simulink models and code-libraries in a single system so as to realize efficient development. In the extended UML, an entire system is defined as a structure that consists of model parts. Each model part is integrated using UML. After generating source codes using UML, additional source code details are added from MATLAB/Simulink models and code-libraries. We demonstrate the efficiency of the extended UML with an experiment that shows behavioral equivalence between the system created with the extended UML and the original simulation model.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Combination of MATLAB/Simulink Models and Code Libraries by Extended UML

twitter
facebook
mendeley

Bibtex

Ris

Stability Analysis of Linear Multi-Agent Systems with Time Delays

Keita Yanagizawa, Takayuki Wada, Yasumasa Fujisaki

pp. 238-243

DOI:

10.5687/iscie.30.238

Abstract

A stability condition is investigated for linear multi-agent systems with time delays. The condition is represented as a region in the complex plane where all of the eigenvalues of the agent interconnection matrix must exist. The region is specified by the transfer function of the agent. Furthermore, by employing the stability condition, a consensus condition is also investigated for directed networks of dynamic agents each of which is described by a linear time invariant system with a time delay.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Stability Analysis of Linear Multi-Agent Systems with Time Delays

twitter
facebook
mendeley

Bibtex

Ris

A Heat Penetration Loss Evaluation Method of Existing Buildings for BEMS Energy Flow Visualization Function

Yasuo Takagi

pp. 244-252

DOI:

10.5687/iscie.30.244

Abstract

A new estimation method of heat loss coefficient for existing buildings is proposed. The method is focused on the heat loss through convective heat transfer, because the air infiltration is negligible in the buildings and the ventilation is controlled by the building Heating, Ventilation and Air Conditioning (HVAC) controller. The heat loss coefficient (Q-value) evaluation of the existing houses are reported in the prior arts and the energy performance of the existing buildings has been reported as one of the commissioning process. The methods enable the total energy performance, but they do not clarify the week insulation elements. In order to visualize the energy flow easily, the proposed method identifies system parameters based on the data-oriented building heat loss model,using heat transfer engineering, with the interior wall surface temperatures and room temperatures that are easily obtained. The correction factor is obtained for the window natural convection heat transfer, because the empirical heat transfer equation for the week natural heat transfer contains some inaccuracy.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

A Heat Penetration Loss Evaluation Method of Existing Buildings for BEMS Energy Flow Visualization Function

twitter
facebook
mendeley

Bibtex

Ris

Unconstrained Convex Optimization by Distributed Event-Driven Subgradient Algorithm based on Consensus Control

Yuichi Kajiyama, Naoki Hayashi, Shigemasa Takai

pp. 253-262

DOI:

10.5687/iscie.30.253

Abstract

This paper considers a distributed unconstrained optimization problem where each agent has a local convex cost function and the sum of these functions is defined as a global cost function. We propose an event-driven subgradient algorithm based on consensus control to minimize the global cost function. Each agent has an estimate of the optimal solution as a state. In the proposed algorithm, each agent sends its state to the neighbor agents only at trigger-times when the error of its state exceeds a threshold. We show that the error between the estimate of the global cost function of the agents given by the proposed event-driven algorithm and the optimal cost is upper bounded. The simulation results show that the convergence speed by the proposed event-driven algorithm improves and the number of trigger-times can be reduced compared with the existing subgradient methods.

mendeley

Bookmark

Detail

PDF Download

Share it with SNS

Article Title

Unconstrained Convex Optimization by Distributed Event-Driven Subgradient Algorithm based on Consensus Control

twitter
facebook
mendeley

Bibtex

Ris

Article Access Ranking

26 Mar. (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.