Search

The International Institute of Knowledge Innovation and Invention (IIKII) is an institute that promotes the exchange of innovations and inventions, and establishes a communication platform for international innovations and researches. In 2019, IIKII cooperated with the Institute of Electrical and Electronics Engineers (IEEE) Tainan Section Sensors Council to hold IEEE conferences such as IEEE ICIASE 2019, IEEE ECBIOS 2019, IEEE ICKII 2019, ICUSA-GAME 2019, and IEEE ECICE 2019. This Special Issue entitled "Selected Papers from IIKII 2019 conferences" aims to select excellent papers from IIKII 2019 conferences, including symmetry in physics, chemistry, biology, mathematics, and computer science, etc. It selected 21 excellent papers from 750 papers presented in IIKII 2019 conferences on the topic of symmetry. The main goals of this Special Issue are to encourage scientists to publish their experimental and theoretical results in as much detail as possible, and to discover new scientific knowledge relevant to the topic of symmetry. [ABSTRACT FROM AUTHOR]

Symmetry is an international journal in the research fields of physics, chemistry, biology, mathematics, computer science, theory and methods, and other scientific disciplines and engineering. The first paper was published in 2009. Here, we make a bibliometric analysis of publications in Symmetry from 2009 to 2019. According to Web of Science (WoS), we obtained 3215 publications in this journal. First, we explore the publications, citation number, and citation structure based on bibliometric indicators. Second, we analyze the most influential objects, including countries/regions, institutions, authors, and papers. Cooperation networks are also presented. Next, the co-citation and burst detection analyses are conducted according to the techniques of visualization tools, i.e., VOSviewer and CiteSpace. Furthermore, the co-occurrence analyses and timeline view analyses of keywords are investigated, aiming to explore the research hotspots. Finally, this paper provides relatively thorough perspectives and reviews and discloses the future development trend of this journal and challenges for scholars, which will promote the development of the journal and in-depth research of scholars. [ABSTRACT FROM AUTHOR]

New molecular genetic algorithms, as tools for the visualization and analysis of big data, have made it possible not only to illustrate the internal structure of DNA molecules within their parameters but also to explore the field of chaos theory, particularly to display processes and signals close to chaotic ones. This provides a new perspective on the problem of determining criteria for borderline states between order and chaos. This article demonstrates the differences between chaotic and quasi-chaotic signals when visualized with molecular genetic algorithms. It presents examples of molecular genetic mappings of signals generated using various pseudorandom noise generators, as well as acoustic signals. This article considers structural and integral (folded) mappings as one-dimensional and two-dimensional projections of the pattern. The authors illustrate the internal structure of the reconstructed signal mappings in spaces of fractional dimensionality, which is considered as a visualization of the entropy structure based on functional mappings in spaces of the fractional dimension. As a result of this research, it was found that the use of molecular genetic algorithms for visualizing information signals makes it possible to identify the so-called entropy structure of these signals. At the same time, the entropy structure of chaotic signals is absent. [ABSTRACT FROM AUTHOR]

In this paper, a special subclass of reaction diffusion systems with two arbitrary constitutive functions Γ (v) and H (u , v) is considered in the framework of transformation groups. These systems arise, quite often, as mathematical models, in several biological problems and in population dynamics. By using weak equivalence transformation the principal Lie algebra, L P , is written and the classifying equations obtained. Then the extensions of L P are derived and classified with respect to Γ (v) and H (u , v) . Some wide special classes of special solutions are carried out. [ABSTRACT FROM AUTHOR]

Graphs are often used as models to solve problems in computer science, mathematics, and biology. A pancake sorting problem is modeled using a pancake graph whose classes include burnt pancake graphs, signed permutation graphs, and restricted pancake graphs. The network cost is degree × diameter. Finding a graph with a small network cost is like finding a good sorting algorithm. We propose a novel recursively divided pancake (RDP) graph that has a smaller network cost than other pancake-like graphs. In the pancake graph Pn, the number of nodes is n!, the degree is n − 1, and the network cost is O(n2). In an RDPn, the number of nodes is n!, the degree is 2log2n − 1, and the network cost is O(n(log2n)3). Because O(n(log2n)3) < O(n2), the RDP is superior to other pancake-like graphs. In this paper, we propose an RDPn and analyze its basic topological properties. Second, we show that the RDPn is recursive and symmetric. Third, a sorting algorithm is proposed, and the degree and diameter are derived. Finally, the network cost is compared between the RDP graph and other classes of pancake graphs. [ABSTRACT FROM AUTHOR]

Apart from its applications in Chemistry, Biology, Physics, Social Sciences, Anthropology, etc., there are close relations between graph theory and other areas of Mathematics. Fibonacci numbers are of utmost interest due to their relation with the golden ratio and also due to many applications in different areas from Biology, Architecture, Anatomy to Finance. In this paper, we define Fibonacci graphs as graphs having degree sequence consisting of n consecutive Fibonacci numbers and use the invariant Ω to obtain some more information on these graphs. We give the necessary and sufficient conditions for the realizability of a set D of n successive Fibonacci numbers for every n and also list all possible realizations called Fibonacci graphs for 1 ≤ n ≤ 4 . [ABSTRACT FROM AUTHOR]