Abstract heterarchy: Time/state-scale re-entrant form

被引:14
|
作者
Gunji, Yukio-Pegio [1 ,2 ]
Sasai, Kazauto [2 ]
Wakisaka, Sohei [2 ]
机构
[1] Kobe Univ, Grad Sch Sci & Technol, Kobe, Hyogo, Japan
[2] Kobe Univ, Fac Sci, Dept Earth & Planetary Sci, Kobe, Hyogo 6578501, Japan
关键词
heterarchy; chaotic liar; self-reference; frame problem; self-similar map;
D O I
10.1016/j.biosystems.2007.06.005
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
A heterarchy is a dynamical hierarchical system inheriting logical inconsistencies between levels. Because of these inconsistencies, it is very difficult to formalize a heterarchy as a dynamical system. Here, the essence of a heterarchy is proposed as a pair of the property of self-reference and the property of a frame problem interacting with each other. The coupling of them embodies a one-ity inheriting logical inconsistency. The property of self-reference and a frame problem are defined in terms of logical operations, and are replaced by two kinds of dynamical system, temporal dynamics and state-scale dynamics derived from the same "liar statement". A modified tent map serving as the temporal dynamics is twisted and coupled with a tent map serving as the state-scale dynamics, and this results in a discontinuous self-similar map as a dynamical system. This reveals that the state-scale and temporal dynamics attribute to the system, and shows both robust and emergent behaviors. (C) 2007 Elsevier Ireland Ltd. All rights reserved.
引用
收藏
页码:13 / 33
页数:21
相关论文
共 50 条
  • [21] Nano-scale Fabrication and Characterization of modified re-entrant structures with curved corners using EBL
    Bora, Kaustav Moni
    Dey, Ujjal
    Varshney, Shailendra Kumar
    Kumar, Cheuruvu Siva
    7TH INTERNATIONAL CONFERENCE ON MANIPULATION, AUTOMATION, AND ROBOTICS AT SMALL SCALES, MARSS 2024, 2024, : 38 - +
  • [22] Close-in blast resistance of large-scale auxetic re-entrant honeycomb sandwich panels
    Kalubadanage, Dulara
    Remennikov, Alex
    Ngo, Tuan
    Qi, Chang
    JOURNAL OF SANDWICH STRUCTURES & MATERIALS, 2021, 23 (08) : 4016 - 4053
  • [23] Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration
    Jianyou Xu
    Win-Chin Lin
    Junjie Wu
    Shuenn-Ren Cheng
    Zi-Ling Wang
    Chin-Chia Wu
    International Journal of Computational Intelligence Systems, 2016, 9 : 1082 - 1100
  • [24] Heuristic based genetic algorithms for the re-entrant total completion time flowshop scheduling with learning consideration
    Xu, Jianyou
    Lin, Win-Chin
    Wu, Junjie
    Cheng, Shuenn-Ren
    Wang, Zi-Ling
    Wu, Chin-Chia
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2016, 9 (06) : 1082 - 1100
  • [25] Optimization of Re-Entrant Hybrid Flows With Multiple Queue Time Constraints in Batch Processes of Semiconductor Manufacturing
    Arima, Sumika
    Kobayashi, Akihiro
    Wang, Yi-Fan
    Sakurai, Kazuho
    Monma, Yusuke
    IEEE TRANSACTIONS ON SEMICONDUCTOR MANUFACTURING, 2015, 28 (04) : 528 - 544
  • [26] A Fast and Efficient Fluid Relaxation Algorithm for Large-Scale Re-entrant Flexible Job Shop Scheduling
    Ding, Linshan
    Guan, Zailin
    Zhang, Zhengmin
    ADVANCES IN PRODUCTION MANAGEMENT SYSTEMS: ARTIFICIAL INTELLIGENCE FOR SUSTAINABLE AND RESILIENT PRODUCTION SYSTEMS, PT V, 2021, 634 : 396 - 404
  • [27] TIME-LIMITED NEXT ARRIVAL HEURISTIC FOR BATCH PROCESSING AND SETUP REDUCTION IN A RE-ENTRANT ENVIRONMENT
    Murray, Stephen
    Sievwright, Steve
    Geraghty, John
    Young, Paul
    2008 WINTER SIMULATION CONFERENCE, VOLS 1-5, 2008, : 2109 - +
  • [29] Re-entrant Cavities Enhance Resilience to the Cassie-to-Wenzel State Transition on Superhydrophobic Surfaces during Electrowetting
    Roy, Rishav
    Weibel, Justin A.
    Garimella, Suresh, V
    LANGMUIR, 2018, 34 (43) : 12787 - 12793
  • [30] Multi-objective re-entrant hybrid flow shop scheduling problem considering fuzzy processing time and delivery time
    Geng, Kaifeng
    Wu, Shaoxing
    Liu, Li
    JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2022, 43 (06) : 7877 - 7890