Complex Systems最新文献

Analyzing and Extending Cellular Automaton Simulations of Dynamic Recrystallization 动态再结晶的元胞自动机仿真分析与扩展

Complex Systems Pub Date : 2023-10-15 DOI: 10.25088/complexsystems.32.2.189

R. S. Subramanian, R. S. Shree, P. G. Kubendran Amos

{"title":"Analyzing and Extending Cellular Automaton Simulations of Dynamic Recrystallization","authors":"R. S. Subramanian, R. S. Shree, P. G. Kubendran Amos","doi":"10.25088/complexsystems.32.2.189","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.189","url":null,"abstract":"A polycrystalline system corroborating experimentally observed microstructure is developed in this paper by employing cellular automata techniques. Moreover, through appropriate transition functions, microstructural changes accompanying dynamic recrystallization, a manufacturing technique associated with the production of a wide range of components, is simulated. The grain growth that characterizes this change is analyzed to explicate the trend in the temporal evolution of mean grain size and its kinetics. As opposed to a progressive increase in mean grain size, which generally typifies a conventional grain growth, in dynamic recrystallization it is observed that the mean grain size increases and decreases sequentially, thereby rendering an oscillating pattern. A perceptive investigation of the fluctuating trend unravels individual growth events, characterized by monotonic increase in mean grain size, whose kinetics follows the third-order power law. Additionally, the existing approach of modeling dynamic recrystallization is extended to facilitate unrestricted yet energetically favored growth of defect-free nuclei across their neighboring grains.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Cellular Automaton-Based Technique for Estimating Mineral Resources 基于元胞自动机的矿产资源估算技术

Complex Systems Pub Date : 2023-10-15 DOI: 10.25088/complexsystems.32.2.101

Soumyadeep Paty, Supreeti Kamilya

引用次数: 0

Hash Function Design Based on Hybrid Five-Neighborhood Cellular Automata and Sponge Functions 基于混合五邻域元胞自动机和海绵函数的哈希函数设计

Complex Systems Pub Date : 2023-10-15 DOI: 10.25088/complexsystems.32.2.171

Anita John, Jimmy Jose

引用次数: 0

Special Issue: Selected Papers from the First Asian Symposium on Cellular Automata Technology, 2022 (ASCAT 2022) 特刊:第一届亚洲元胞自动机技术研讨会论文选集，2022 (ASCAT 2022)

Complex Systems Pub Date : 2023-10-15 DOI: 10.25088/complexsystems.32.2.i

Sukanta Das, Genaro J. Martínez

{"title":"Special Issue: Selected Papers from the First Asian Symposium on Cellular Automata Technology, 2022 (ASCAT 2022)","authors":"Sukanta Das, Genaro J. Martínez","doi":"10.25088/complexsystems.32.2.i","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.i","url":null,"abstract":"This special issue contains six papers that are the extended versions of six selected contributions that were presented at the First Asian Symposium on Cellular Automata Technology, 2022 (ASCAT 2022). The symposium was officially organized by the departments of Information Technology and Computer Science and Technology, Indian Institute of Engineering Science and Technology, Shibpur (IIEST, Shibpur), India, March 3–5, 2022, in online mode. Cellular Automata India (https://www.cellularautomata.in) is an open research group that was created during the pandemic period by a group of Indian researchers and took a leading role in organizing the event. There are a number of international conferences and workshops that consider cellular automata as the primary theme and deal with various aspects of cellular automata and their theoretical, modeling and application development issues. Since the late 1980s, cellular automata have been used to devise solutions for technological problems, particularly in the domain of very large-scale integration (VLSI) design and test, pattern recognition and classification, security and image processing. The aim of this symposium was to focus on the issue of technology development by cellular automata. In our view, ASCAT was the first event of this kind. Since technology cannot mature without a solid theoretical base, this symposium invited theoreticians and engineers to exchange their views and ideas. In this symposium, 14 papers were selected for presentation. We invited all the authors of the 14 papers to submit extended versions of their works for inclusion in the planned special issue. The submitted extended versions were reviewed again and finally six papers were chosen for this special issue. We thank all the authors of this issue for their efforts to beautifully extend their research. We are very greatly thankful to the reviewers who gave their efforts to review the papers and to select these six papers. We hope that these papers will be a good contribution to the field of cellular automata.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Evaluating Community Detection Algorithms for Multilayer Networks: Effectiveness of Link Weights and Link Direction 评价多层网络的团体检测算法:链路权重和链路方向的有效性

Complex Systems Pub Date : 2023-10-15 DOI: 10.25088/complexsystems.32.2.211

Daiki Suzuki, Sho Tsugawa

{"title":"Evaluating Community Detection Algorithms for Multilayer Networks: Effectiveness of Link Weights and Link Direction","authors":"Daiki Suzuki, Sho Tsugawa","doi":"10.25088/complexsystems.32.2.211","DOIUrl":"https://doi.org/10.25088/complexsystems.32.2.211","url":null,"abstract":"Analyzing the structures of multilayer networks (MLNs) has been a hot research topic in network science. Community detection algorithms are important tools for analyzing MLNs. In the literature, several community detection algorithms for MLNs have been proposed. Moreover, there are several options for the graph representation of an MLN: for example, directed or undirected, weighted or unweighted, and using information from all or only some layers. Although these options may affect the results of community detection in MLNs, representations that are effective for community detection have not yet been clarified. In this paper, we experimentally evaluate the effectiveness of three types of community detection algorithms for MLNs and examine how the graph representation of an MLN affects the results of these algorithms. Our main findings are as follows: (1) The flattening approach is particularly effective, whereas the layer-by-layer approach is not applicable to detecting communities in MLNs of Twitter users. (2) Using a directed graph for each layer of an MLN increases the accuracy of community detection. (3) The Leiden method, which is a community detection algorithm for single-layer networks, achieves comparable accuracy with the community detection algorithms for MLNs, which suggests that there exists room for improvement in multilayer community detection algorithms for effectively utilizing the multilayer structures of MLNs.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136183216","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Cellular Automaton-Based Emulation of the Mersenne Twiste 基于元胞自动机的Mersenne扭转仿真

Complex Systems Pub Date : 2023-10-15 DOI: 10.25088/complexsystems.32.2.139

Kamalika Bhattacharjee, Nitin More, Shobhit Kumar Singh, Nikhil Verma

引用次数: 0

One-Dimensional Cellular Automaton Transitions and Integral Value Transformations Representing Deoxyribonucleic Acid Sequence Evolutions 代表脱氧核糖核酸序列演化的一维元胞自动机转换和积分值转换

Complex Systems Pub Date : 2023-10-15 DOI: 10.25088/complexsystems.32.2.115

Sreeya Ghosh, Sudhakar Sahoo, Sk. Sarif Hassan, Jayanta Kumar Das, Pabitra Pal Choudhury, Antara Sengupta

引用次数: 0

The Domino Problem of the Hyperbolic Plane Is Undecidable: New Proof 双曲平面的多米诺问题是不可判定的:新的证明

Complex Systems Pub Date : 2023-06-15 DOI: 10.25088/complexsystems.32.1.19

Maurice Margenstern

引用次数: 0

Fungal Automata

IF 1.2

Complex Systems Pub Date : 2020-03-18 DOI: 10.25088/complexsystems.29.4.759

A. Adamatzky, E. Goles, G. J. Martínez, Michail-Antisthenis I. Tsompanas, M. Tegelaar, H. Wosten

{"title":"Fungal Automata","authors":"A. Adamatzky, E. Goles, G. J. Martínez, Michail-Antisthenis I. Tsompanas, M. Tegelaar, H. Wosten","doi":"10.25088/complexsystems.29.4.759","DOIUrl":"https://doi.org/10.25088/complexsystems.29.4.759","url":null,"abstract":"We study a cellular automaton (CA) model of information dynamics on a single hypha of a fungal mycelium. Such a filament is divided in compartments (here also called cells) by septa. These septa are invaginations of the cell wall and their pores allow for the flow of cytoplasm between compartments and hyphae. The septal pores of the fungal phylum of the Ascomycota can be closed by organelles called Woronin bodies. Septal closure is increased when the septa become older and when exposed to stress conditions. Thus, Woronin bodies act as informational flow valves. The one-dimensional fungal automaton is a binary-state ternary neighborhood CA, where every compartment follows one of the elementary cellular automaton (ECA) rules if its pores are open and either remains in state 0 (first species of fungal automata) or its previous state (second species of fungal automata) if its pores are closed. The Woronin bodies closing the pores are also governed by ECA rules. We analyze a structure of the composition space of cell-state transition and pore-state transition rules and the complexity of fungal automata with just a few Woronin bodies, and exemplify several important local events in the automaton dynamics.","PeriodicalId":46935,"journal":{"name":"Complex Systems","volume":"1 1","pages":"323-339"},"PeriodicalIF":1.2,"publicationDate":"2020-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43862746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Statistical Scaling Laws for Competing Biological Species 竞争生物物种的统计标度定律

IF 1.2

Complex Systems Pub Date : 2018-12-15 DOI: 10.25088/complexsystems.27.4.355

Vinícius Barros da Silva

引用次数: 0