Deep learning is based on matrix computing with a large amount of hidden parameters that is not visible outside the computing module. Deep learning is a non-linear system and a linear approach is not possible. It is natural for people to visualize the algorithm and to follow some hidden parameters. In this paper, we propose a simple graphical programming of a nonlinear system based on drawing the simplest unit, such as a single neuron model. A more complex scheme of a classical neural network is obtained by commands copy-move-place of one neuron. The number of neurons and layers can be chosen arbitrarily. Once the scheme is complete, the implementation code is evaluated with symbolic parameters and nonlinear activation functions. This cannot be done manually. With the symbolic expression of outputs in terms of inputs and symbolic parameters, including symbolic activation pure functions, some other properties can be derived in closed form. This unique original approach can help scientists and developers and design numerical algorithms for machine learning and to understand how deep learning algorithms work.

Here I describe an overlooked form of non-biological paralife (i.e., near-life) that has been evolving on Earth for millions of years, and is currently in the final stages of transitioning into a new form of life. Any consideration of non-biological life or paralife is complicated by the fact that there is no consensus among biologists for the definition of life. This ambiguity has caused disagreement about whether subcellular reproduction systems like viruses are a form of life, despite having genomes, mutations, heritable phenotypes and system-improving evolution. To resolve this problem, I develop a definition of life that is entirely functional and independent of any of the structural idiosyncrasies of biological life on Earth: an order-generating system controlled by internally-encoded information that perpetuates itself by functioning to counteract its entropic decay. Using this definition, subcellular transposons, plasmids, and viruses are paralife because they match the definition of life in all ways except that they induce their order-generating functioning by a living host rather through their own self-sustaining production system. Using this functional definition of life, I show that utility- products (UPs) like fabricated hand tools are part of induced-reproduction systems that have features equivalent to biological genomes, mutations, heritable phenotypes, and a process of system-improving evolution. The perceived benefit of utility-products causes them to induce their reproduction by a biological life-form (humans). For these reasons, human utility products are functionally just as close to being a form of life as subcellular transposons, plasmids, and viruses, i.e., they are Utility-Product paralife (UP-parlife). I also show that some forms of UP-paralife are currently evolving into mechanical life that is capable of both self- sustaining reproduction and system-improving evolution without outside assistance. This transition requires the development of a high level of factory and/or UP automation and artificial intelligence (AI) that is capable of complex reasoning, imagination and creativity. Finally, I consider the influence of UP-life and UP-paralife on the development of the level of structural complexity in the universe, and I briefly speculate about how these non-biological forms of life and paralife will influence the expansion of scientific knowledge about the universe.

Computation of circuit complexity has gained much attention in the Theoretical Physics community in recent times to gain insights about the chaotic features and random fluctuations of fields in the quantum regime. Recent studies of circuit complexity take inspiration from the geometric approach of Nielsen, which itself is based on the idea of optimal quantum control in which a cost function is introduced for the various possible path to determine the optimum circuit. In this paper, we study the relationship between the circuit complexity and Morse theory within the framework of algebraic topology using which we study circuit complexity in supersymmetric quantum field theory describing both simple and inverted harmonic oscillators up to higher orders of quantum corrections. The expression of circuit complexity in quantum regime would then be given by the Hessian of the Morse function in supersymmetric quantum field theory, and try to draw conclusion from their graphical behaviour. We also provide a technical proof of the well known universal connecting relation between quantum chaos and circuit complexity of the supersymmetric quantum field theories, using the general description of Morse theory.

In this review, our goal is to design and test quantum-like algorithms for Artificial Intelligence (AI) in open systems to structure a human-machine team to be able to reach its maximum performance. Unlike the laboratory, in open systems, teams face complexity, uncertainty and conflict. All task domains have complexity levels, some have low, and others high levels. Complexity in this new domain is affected by the environment and the task, which are both affected by uncertainty and conflict. We contrast the individual and interdependence approaches to teams. The traditional and individual approach focuses on building teams and systems by aggregating the best available information for individuals, their thoughts, behaviors and skills. Its concepts are characterized chiefly by one-to-one relations between mind and body, a summation of disembodied individual mental and physical attributes, and degrees of freedom corresponding to the number of members in a team; however, this approach is characterized by the many researchers who have invested in it for almost a century with few effects that can be generalized to human-machine interactions; by the replication crisis of today (e.g., the invalid scales for self-esteem, implicit racism, and honesty); and by its many disembodied concepts. In contrast, our approach is based on the quantum-like nature of interdependence. It allows us to theorize about the bistability of mind and body, but it proposes a measurement problem and a non-factorable nature. Bistability addresses team structure and performance; the measurement problem solves the replication crisis; and the non-factorable aspect of teams reduces the degrees of freedom and the information derivable from teammates to match findings by the National Academies of Science. We begin with a review of the science of teams and a focus on human-machine team research in the laboratory versus the open; justifications for rejecting traditional social science while supporting our approach; a full understand of the complexity of the domain, tasks in the domain, and how teams address both; the mathematics involved; a review of results from our model versus the open field; a discussion of the results; conclusions; and the path forward to successfully advance the science of interdependence and autonomy.

Background: Poor patient flow can lead to adverse outcomes for patients and organisational inefficiency. Many hospitals have addressed suboptimal patient flow by increasing resourcing, such as bed stock and staffing, however, this is an unsustainable approach. In determining the nature of poor patient flow issues, it is important to collect data from healthcare professionals who manage patient flow on a daily basis. Doing so provides insights into the current state of patient flow management in its entirety, whilst also helping with the development of sustainable solutions.; Methods: Thirteen semi-structured interviews were conducted with clinicians who were directly involved with patient flow at a tertiary care centre in Tasmania, Australia. Results: Through a thematic analysis method, four major themes were developed: managing patient flow, communication for decisions, tools as enablers and barriers and increasing complexity. Conclusions: The findings of this study provide great insights into patient flow issues, with potential solutions identified to address them.

The crystal structure of Pb₁₀(PO₄)₆O, the proposed matrix for the potential room-temperature superconductor LK-99, Pb_10-xCu_x(PO₄)₆O (x = 0.9-1.0), has been reinvestigated by single-crystal X-ray diffraction using crystals prepared by Merker and Wondratschek (The crystal structure is trigonal, P, a = 9.8109(6), c = 14.8403(12) Å, V = 1237.06(15), R₁ = 0.0413 using 3456 unique observed reflections. The crystal structure of Pb₁₀(PO₄)₆O is a superstructure with regard to the ‘standard’ P6₃/m apatite structure type. The doubling of the c parameter is induced by the ordering of ‘additional’ O’ atoms within the structure channels running parallel to the c axis and centered at (00z). The O’ atoms form short bonds to the Pb1 atoms, resulting in splitting the Pb1 site into two, Pb1A and Pb1B. The structural distortions are further transmitted to the Pb phosphate framework formed by four Pb2 sites and PO₄ groups. The structure data previously reported by Krivovichev and Burns (Z. Kristallogr. 2003, 218, 357-365) may either correspond to the Pb₁₀(PO₄)₆O_x(OH)_2-x (x ~ 0.4) member of the Pb₁₀(PO₄)₆O - Pb₁₀(PO₄)₆(OH)₂ solid solution series, or to the high-temperature polymorph of Pb₁₀(PO₄)₆O (with the phase with doubled c parameter being the low-temperature polymorph).

We report the results of the characterization of local Monte Carlo (MC) dynamics of an equilibrium bond fluctuation model polymer matrix (BFM), in time interval typical for MC simulations of non-linear optical phenomena in host-guest systems. The study contributes to the physical picture of the dynamical aspects of quasi-binary mosaic states characterized previously in the static regime. The polymer dynamics was studied at three temperatures (below, above and close to the glass transition), using time-dependent generalization of the static parameters which characterize local free volume and local mobility of the matrix. Those parameters play the central role in the kinetic MC model of host-guest systems. The analysis was done in terms of the probability distributions of instantaneous and time-averaged local parameters. The main result is the characterization of time scales characteristic of various local structural processes. Slowing down effects close to the glass transition are clearly marked. The approach yields an elegant geometric criterion for the glass transition temperature. A simplified quantitative physical picture of the dynamics of guest molecules dispersed in BFM matrix at low temperatures offers a starting point for stochastic modeling of host-guest systems.

Human language and social cognition are two key disciplines that have traditionally been studied as separate domains. However, emerging research from detailed studies of comparative animal behavior, human social behavior, language acquisition in children, social cognitive neuroscience, and the cognitive neuroscience of language suggest that language and social cognition are two deeply interrelated capacities of the human species. For instance, recent developmental studies on the acquisition of language in infants and young children, draw attention to the important crucial benefits associated with several different aspects of social stimulation for youngsters, including the quantity and quality of linguistic input, dyadic infant/child-to-parent verbal and non-verbal social interactions, and other important social cues integral for facilitating language learning and social bonding. Studies of the adult human brain further suggest a high degree of specialization for sociolinguistic information processing, memory retrieval, and comprehension, suggesting the function of these regions may link language with social cognition and social bonding. In effect, the social brain and social complexity hypotheses may jointly help to explain how neurotypical children and adults learn language, why autistic adults and children exhibit simultaneous deficits in language and social cognition, and why nonhuman primates and other animals with significant computational abilities do not acquire the capacity for language. But perhaps most critically, the following article argues that this and related research will allow scientists to generate a holistic profile and deeper understanding of the healthy adult social brain, while developing more innovative and effective diagnoses, prognoses, and treatments for maladies and deficits also associated with the social brain.

Alunogen, Al2(SO4)3·17H2O, occurs as an efflorescent in acid mine drainage, low-temperature fumarolic or pseudofumarolic (at coal fires) terrestrial environments. It is considered as one of the main Al-sulfates of Martian soils demanding comprehensive crystal chemical data of natural terrestrial samples. However, structural studies of natural alunogen were carried out in 1970s without localization of H atoms and have not previously been performed for samples from geothermal fields, despite the fact that these environments are considered as proxies of the Martian conditions. The studied alunogen sample comes from Verkhne-Koshelevsky geothermal field (Koshelev volcano, Kamchatka, Russia). Its chemical formula is somewhat dehydrated, Al2(SO4)3×15.8 H2O. The crystal structure was solved and refined to R1 = 0.068 based on 5112 unique observed reflections with I > 2σ(I). Alunogen crystalizes in P-1 space group, a = 7.4194(3), b = 26.9763(9), c = 6.0549(2) Å, α = 90.043(3), β = 97.703(3), γ = 91.673(3) °, V = 1200.41(7) Å3, Z = 2. The crystal structure consists of isolated SO4 tetrahedra, Al(H2O)6 octahedra and H2O molecules connected by hydrogen bonds. The structure refinement includes Al, S and O positions that are similar to previous structure determinations and thirty-four H positions localized for the natural sample first. The study also shows the absence of isomorphic substitutions in the composition of alunogen despite the iron-enriched environment of mineral crystallization. The variability of the alunogen crystal structure is reflected in the number of “zeolite” H2O molecules and their splitting. The structure complexity of alunogen and its modifications ranges from 333-346 bits/cell for models with non-localized H atoms to 783-828 bits/cell for models with localized H atoms. The higher values correspond to higher hydration state of alunogen.

Intelligence is a human construct to represent the ability to achieve goals. Given this wide berth, intelligence has been defined countless times, studied in a variety of ways and represented using numerous measures. Understanding intelligence ultimately requires theory and quantification, both of which have proved elusive. I develop a framework – the Theory of Intelligences (TIS) – that applies across all systems from physics, to biology, humans and AI. TIS likens intelligence to a calculus, differentiating, correlating and integrating information. Intelligence operates at many levels and scales and TIS distils these into a parsimonious macroscopic framework centered on solving, planning and their optimization to accomplish goals. Notably, intelligence can be expressed in informational units or in units relative to goal difficulty, the latter defined as complexity relative to system (individual or benchmarked) ability. I present general equations for intelligence and its components, and a simple expression for the evolution of intelligence traits. The measures developed here could serve to gauge different facets of intelligence for any step-wise transformation of information. I argue that proxies such as environment, technology, society and collectives are essential to a general theory of intelligence and to possible evolutionary transitions in intelligence, particularly in humans. I conclude with testable predictions of TIS and offer several speculations.

Traveling salesman problems (TSPs) are well-known combinatorial optimization problems, and most existing algorithms are challenging for solving TSPs when its scale is large. To improve the efficiency of solving large-scale TSPs, this work presents a novel adaptive layered clustering framework with improved genetic algorithm (ALC\_IGA). The primary idea behind ALC\_IGA is to break down a large-scale problem into a series of small-scale problems. First, the $k$-means and improved genetic algorithm are used to segment the large-scale TSPs layer by layer and generate the initial solution. Then, the developed two phases simplified $2$-opt algorithm is applied to further improve the quality of the initial solution. The analysis reveals that the computational complexity of the ALC\_IGA is between $O(n\log n)$ and $O(n^2)$. The results of numerical experiments on various TSP instances indicate that, in most situations, the ALC\_IGA surpasses the state-of-the-art algorithms in convergence speed, stability, and solution quality. Specifically, the ALC\_IGA can solve instances with $2 \times 10^5$ nodes within 0.15h, $1.4 \times 10^6$ nodes within 1h, and $2 \times 10^6$ nodes in three dimensions within 1.5h.

Neural networks were treated as black boxes for a long time. Previous works have unearthed what aspects of an image were important for convolutional layers at different positions in the network. This was done using deconvolutional networks. In this paper, we examine how well a convolutional neural network performs when those convolutional layers which are relatively unimportant for a particular image (i.e., the image does not produce one of the strongest activations) are skipped in the training, validating, and testing process.

In principle, modular or integral character of manufacturing lines depends on topological designs of products and determined operation tasks. On the other hand, in specific situations there is an articulated need for modular design in smart manufacturing systems, since modular layouts are a crucial step towards agile production via smart manufacturing. The aim of this paper is to explore how the modular layout relates to manufacturing lead time (MLT) and to operational complexity of smart manufacturing systems. For this purpose, topologically different models of alternative process layouts were simulated and tested, while MLT values were obtained using Tecnomatix Plant Simulation. Obtained positive findings of this research could be useful not only in selection of the most suitable process design from the alternative ones, but especially in deepening knowledge and better understanding of the concept of optimal network modularity.

We confidently approach current issues in Green Finance (GF) from the perspective of an international organization, where the first author has previous experience as a support assistant. In fact, the economy of the EU (European Union) is deeply involved in the changing needs related to the dramatic consequences of climate change and environmental degradation, which has placed the needs of a more sustainable economy at the top of the international agenda. The environmental, social and governance (ESG) aspects are marginally addressed to arouse a major interest in questions raised by green financial products which require long-term profit expectations, and which above all contain a margin of risk that is difficult to calculate in the landscape of traditional financial instruments. Through a careful approach akin to artificial intelligence research methods, we attempt to “materialize” at least the most visible clues of this fashionable economic shift through what we call SMC (sustainable material culture) objects. The presented SMC objects serve as tangible representations of sustainable practices and can promote awareness and action incorporating into everyday life and business practices a powerful reminder and catalyst for a shift towards more sustainable investment and consumption patterns.

The notion of information and complexity are important concepts in many scientific fields such as molecular biology, evolutionary theory, and exobiology. Many measures of these quantities, either rely on a statistical notion of information, are difficult to compute, or can only be applied to strings. Based on assembly theory, we propose the notion of a \textit{ladderpath}, which describes how an object can be decomposed into a hierarchical structure using repetitive elements. From the ladderpath two measures naturally emerge: the ladderpath-index and the order-index, which represent two axes of complexity. We show how the ladderpath approach can be applied to both strings and spatial patterns and argue that all systems that undergo evolution can be described as ladderpaths. Further, we discuss possible applications to human language and the origins of life. The ladderpath approach provides a novel characterization of the information that is contained in a single object (or a system) and could aid in our understanding of evolving systems and the origin of life in particular.

This article focuses on methods for designing heuristic models within the paradigm of systems theory and in the disciplinary context of intercultural communication. The main question arises from the striking observation that the common language is insufficient to develop knowledge about human communication, especially when many factors of complexity (such as ambiguity, paradoxes, or uncertainty) are involved in the composition of an abstract research object. This epistemological, theoretical, and methodological problematic is one of the main challenges to the scientificity of anthropological theories and concepts on culture. Moreover, these questions lie at the heart of research in intercultural communication. Authors and theorists in the complexity sciences have already stressed the need, in such case, to think in terms of models or semiotic representations, since these tools of thought can mediate much more effectively than unformalized language between the heterogeneous set of perceptions arising from the field of experience, on the one hand, and the philosophical principles that organize speculative thought, on the other. This sets the scene for a reflection on the need to master the theory of heuristic models when it comes to developing scientific knowledge in the field of intercultural communication. In this essay, my first aim is to make explicit the conditions likely to ensure the heuristic value of a model, while my second aim is to clarify the operational function and required level of abstraction of certain terms such as concepts, categories, headings, models, systems, or theories that are among the most commonly used by academics in their descriptive accounts or explanatory hypotheses. To achieve this second objective, I propose to create cognitive meta-categories to identify the three (nominal, cardinal or ordinal) roles of words in the reference grids we use to classify our ideas, and to specify how to use these meta-categories in the construction of our heuristic models. Alongside the theoretical presentation, examples of application are provided, almost all of which are drawn from my own research into the increased cultural vigilance of the majority population in Quebec since the reasonable accommodation crisis in this French-speaking province of Canada. The typology I propose will perhaps help to avoid the confusions regularly committed by authors who attribute only cosmetic functions to words that nevertheless have a highly heuristic value, and who forget to consider the logical leaps of their theoretical thinking in the construction of heuristic models.

Introduction: Identifying the complexity of palliative care needs is a key aspect of referral to specialised multidisciplinary early palliative care (EPC) teams. The PALCOM scale is an instrument consisting of five multidimensional assessment domains, developed in 2018 and validated in 2023, to identify the level of complexity in patients with advanced cancer. Objectives: The main objective of this study was to determine the degree of instability (likelihood of level change or death), health resource consumption and survival of patients according to the level of palliative complexity assigned at the baseline visit during a 6-month follow-up. Method: An observational, prospective, multicentre study was conducted using pooled data from the development and validation cohort of the PALCOM scale. The main outcome variables were: a) instability ratio (IR), defined as the probability of level change or death; b) emergency department visits; c) days of hospitalisation; d) hospital death; e) survival. All variables were analysed monthly according to the level of complexity assigned at the baseline visit. Results: A total of 607 patients with advanced cancer were enrolled. According to the PALCOM scale, 20% of patients were classified as low complexity, 50% as medium and 30% as high complexity. The overall IR was 45% in the low complexity group, 68% in the medium complexity group and 78% in the high complexity group (p

An overview of the link between nonequilibrium thermodynamics and complexity theory is offered. It is shown how the rate of entropy production can be quantified through the spectrum of the Lyapunov exponents. It was shown how the entropy production per unit of time meets the necessary and sufficient conditions to be a Lyapunov function and constitutes per se an extremal principle. The entropy production fractal dimension conjecture was established. It is shown how the rate of entropy production as a non-extremal criterion represents an alternative way of sensitivity analysis of differential equations. Finally, an extension to biophysical-chemical systems, on the one hand, the use of the dissipation function is shown, as a thermodynamic potential out of equilibrium, in the characterization of biological phase transitions. On the other hand, it was evidenced how the rate of entropy production represents a physical quantity to evaluate the complexity and robustness of cancer.

The origin of neurodegenerative diseases is linked to the abnormal folding of disease-associated proteins. The traditional amyloid hypothesis has been a focal point of research, but recent findings suggest a more complex picture. This review explores the role of physiological conformation of aggregation-prone domain (also known as prion-like low complexity domain) and multiple co-misfolded proteins in neurodegenerative diseases. We highlight the importance of targeting multi-heterotypic misfolded proteins for effective treatments and emphasize the irreversible neurodegeneration stemming from the loss of physiological folding in prion-like disease-causing proteins underscores the criticality of refolding. Additionally, we introduce the concept of ReproFold Therapeutics, a novel approach aimed at restoring the cellular prion-like folding of disease-causing proteins to rebuild normal cross-β interactomes and mitigate neurodegeneration. Baicalein, a potential drug candidate for this approach, shows promise in vitro and in animal models. Moreover, prion-like low complexity domains implicated in neurodegeneration are also associated with other disorders such as diabetes, cancers, and mental illnesses. Understanding the core pathology of neurodegenerative diseases and the broader implications of prion-like LC domains could revolutionize healthcare approaches and policies worldwide.

Using assembly theory, we investigate the assembly pathways of fixed-length binary strings formed by joining the individual bits present in the assembly pool and the strings that entered the pool as a result of previous joining operations. We show that the string assembly index is bounded from below and above, and we conjecture about the form of the upper bound. We show that a string having the smallest assembly index can be assembled by an elegant trivial program of length equal to this index, if the length of the string is expressible as a product of Fibonacci numbers. We conjecture that there is no binary program that has a length shorter than the length of the string having the largest assembly index that could assemble this string. We conjecture that a black hole surface is defined by a balanced distinct string that satisfies the upper bound of a distinct string assembly index. The results confirm that four Planck areas provide a minimum information capacity that provides a minimum thermodynamic (Bekenstein-Hawking) entropy. Knowing that the problem of determining the assembly index is at least NP-complete, we conjecture that the problem of determining the assembly index of a given binary string is NP-complete, while the problem of creating the string so that it would have a predetermined maximum assembly index is NP-hard. Therefore, once the new information is assembled by a dissipative structure or by a human, increasing the information entropy according to the second law of infodynamics, it is subject to the second law of thermodynamics, and nature seeks to optimize its assembly pathway.

The Internet of Things (also known as IoT), a revolution, has enhanced the relevance of mobile employees' job efficiency in mobile crowd sensing (MCS). Incentives based on reputation for mobile workers (MW) play an important role in increasing service utilization, motivating mobile employees, and developing confidence in the service. The cell phone is the most exploited entity in mobile crowd-sensing MCS and cloud computing. In the underlying investigation, we observed that they had not evaluated the complexity level of a task, resulting in a strong reputation for executing multiple basic tasks. A person who completes a tough task may have a lower reputation score. Complexity levels of tasks (CLT) were developed for reputation evaluation on a crowd-sensing network, which would be utilized to evaluate the MW reputation. We offered simple and complex levels of challenges to assess reputation scores. Tasks receive incentives based on their reputation. By measuring reputation on (CLT) complexity level of task, this research will help the system to Maintain the reputation of the mobile worker so that entities of the system get the maximum benefit out of it, by hiring well-reputed mobile workers and MW receive an incentive on it. Furthermore, we conduct a comparative analysis between our scheme and various machine learning algorithms to identify the algorithm that best performs in evaluating task complexity. Considering both the simple and complex reputation scores, the comparison suggests that after analyzing the data, it is clear that the CLT (proposed) scheme and the Linear regression scheme not only outperformed the Neural Network scheme in terms of Complex Reputation Scores but also in terms of Simple Reputation Scores. We also apply statistical tests, such as p-tests and t-tests, to determine the significance of the results obtained from different algorithms. Considering MW 308, MW 345, and MW 1045's efforts and abilities, the MCS system may offer incentives and awards to further motivate and consider their continuing contributions. This reputation-based incentivization technique not only encourages strong competition among mobile workers, but also makes sure the delivery of high-quality services inside the MCS system.

The algorithmic complexity vulnerability (ACV) that may lead to denial of service attacks greatly disrupts the security and availability of applications, and due to the widespread use of third-party libraries, its impact may be amplified through the software supply chain. The existing work in the field is dedicated to abstract loop or iterative patterns and fuzzing the entire application to discover algorithm complexity vulnerabilities, but they still face efficiency and effectiveness issues. Our research focuses on: (1) Proposing a representation and extraction method for code features related to algorithmic complexity vulnerabilities, helping analysts quickly understand program logic; (2) Providing a new ACV detecting model, focusing on the spatial complexity anomalies caused by deep recursion structures, and proposing a new filtering method; (3) Aiming at the difficulty of efficiently generating complex-data-type-related payloads using existing symbol execution techniques, a call-chain-guided payload construction method is proposed. We tested third-party components in the open-source Java Maven Repository, identified many unexposed vulnerabilities and 8 of them received CVE (Common Vulnerabilities & Exposures) identifiers, and demonstrated that our method can discover more algorithmic complexity vulnerabilities compared to existing tools with better performance.

Cellular automata are mathematical models that represent systems with complex behavior through simple interactions between their individual elements. These models can be used to study unconventional computational systems and complexity. One notable aspect of cellular automata is their ability to create structures known as gliders, which move in a regular pattern to represent the manipulation of information. This paper introduces the modification of mean-field theory applied to cellular automata, using random perturbations based on the system’s evolution rule. The original aspect of this approach is that the perturbation factor is tailored to the nature of the rule, altering the behavior of the mean-field polynomials. By combining the properties of both the original and perturbed polynomials, it is possible to detect when a cellular automaton is more likely to generate gliders without having to run evolutions of the system.This methodology is a useful approach to finding more examples of cellular automata that exhibit complex behavior. We start by examining elementary cellular automata, then move on to examples of automata that can generate gliders with more states. To illustrate the results of this methodology, we provide evolution examples of the detected automata.

The study aimed to assess the prevalence of the frailty syndrome in older patients hospitalized in the geriatric ward depending on the diagnostic criteria used, the feasibility of particular diagnostic scales in hospitalized patients, and their compatibility. Material and methods: Patients admitted to the Department of Geriatrics of Hospital of the Ministry of the Interior and Administration in Bialystok within eight months were included in the study. Four diagnostic scales were used to identify the frailty syndrome: Fried criteria, 7-point Clinical Frailty Scale (CFS), 40-item Frailty Index (FI), and FRAIL Scale. The compatibility of the scales was determined using Cohen's Kappa statistics. Results: 416 patients (mean age 81.2 ± 6.91 years, 77.4% women) were included in the study. Depending on the scale, the prevalence of frailty syndrome varied from 26.8% ( FRAIL Scale), 52.3% (Clinical Frailty Scale), and 58.1% (Fried criteria) up to 62.9% (Frailty Index). We observed the highest feasibility for CFS (100%), intermediate for Frailty Index (95.2%), FRAIL Scale (89.7%), and the lowest for Fried scale (79.8%). The highest level of agreement was found between the CFS and Fried scale, with 70.2% consistent ratings (Cohen Kappa 0.49). Conclusions: Patients in the geriatric ward are characterized by a high prevalence of frailty, although it differs depending on the criteria. The Frailty Index found the highest prevalence and the lowest in the case of the FRAIL scale. The feasibility of scales and their comparability differed; the most difficult to use in daily practice was the Fried scale, while the Clinical Frailty Scale was determined feasible in all patients. The highest agreement was observed between the Fried criteria and the Clinical Frailty Scale and the lowest between the FRAIL scale and the remaining ones.

We develop new theory from a broad case-study approach to explore a better understanding of what constitutes knowledge and its value as identifiable to human-machine teams. From past research, this trail of exploration will lead to these initial questions: What is the value of debate in the furtherance of knowledge? Will machines with AI be able to contribute to a debate if we humans cannot define it or determine its value sufficiently for a machine’s understanding, contribution, exploration and identification? Like humans, as teammates, machines must be able to determine with AI what constitutes the usable knowledge that contributes to a team’s success in the field (e.g., testing "knowledge" in the field, identifying new knowledge, using knowledge to develop innovation) or its failure (viz., trouble shooting; identifying weaknesses; discovering vulnerabilities, hiding by deception). It matters not whether a debate is public, private or unexpressed by an individual human or machine agent alone; we speculate in this exploration that the process advances the science of autonomous human-machine teams and assists in interpretable machine learning. We conclude with questions and a speculation: How does a human become aware or express its awareness of knowledge? Can a machine be as expressive as its human teammates? And how does a human-machine teammate become aware that its teammates possess sufficient knowledge to perform a task? We speculate that the structure of “knowledge," once found, is resistant to alternatives (i.e., it is ordered); that its functional utility is generalizable; and that its applications are multifaceted (akin to maximum entropy production). The complexity of the team is taken into consideration in our search for knowledge, which can also be used as an information metric.

Barley is an important crop grown on almost 49 Mha worldwide in 2021 and is particu-larly significant in Europe where powdery mildew is the most frequent disease on sus-ceptible varieties. The most suitable way for protecting crops is exploiting genetic re-sistance. However, the causal agent Blumeria hordei is an extremely adaptable pathogen. The aims of this research were to increase our knowledge of the rapidly changing path-ogen population and detect rare virulences. Random samples of the pathogen were ob-tained from the air by means of a mobile spore sampler. Spores were collected by driv-ing across the Czech Republic in 2019, 2021 and 2023 and 299 isolates were analyzed on 121 host varieties. No infection occurred on 35 differentials, rare virulence was recorded on 31 varieties and a higher virulence frequency was found on 55 differentials. A core set of differentials along with four additional varieties distinguish 295 pathotypes (Simple Index = 0.987) and virulence complexity of isolates varied from 4 to 19 with an average 10.39. The detection of new virulences, the increasing frequency of previously rare viru-lences and high pathotype diversity as well as high virulence complexity confirm that using nonspecific durable resistance is crucial for successfully breeding commercial va-rieties.

Global models have been developed to tackle the challenge of forecasting sets of series that are related or share similarities, but not for heterogeneous datasets. Various methods of partitioning by relatedness have been introduced to enhance the similarities of the set, resulting in improved forecasting accuracy but often at the cost of a reduced sample size, which could be harmful. To shed light on how the relatedness between series impacts the effectiveness of global models in real-world demand forecasting problems we perform an extensive empirical study using the M5 competition dataset. We examined cross-learning scenarios driven by the product hierarchy commonly employed in retail planning, which allow global models to capture interdependencies across products and regions more effectively. Our findings show that global models outperform state-of-the-art local benchmarks by a considerable margin, indicating that they are not inherently more limited than local models and can handle unrelated time series data effectively. The accuracy of data partitioning approaches increases, as the size of the data pools and the models' complexity decrease. However, there is a trade-off between data availability and data relatedness. Smaller data pools lead to increased similarity among time series, making it easier to capture cross-product and cross-region dependencies, but this comes at the cost of a reduced sample, which may not be beneficial. Finally, it's worth noting that the successful implementation of global models for heterogeneous datasets can significantly impact forecasting practice.

In this study, we present a novel approach to estimate the Hurst exponent of time series data using a variety of machine learning algorithms. The Hurst exponent is a crucial parameter in characterizing long-range dependence in time series, and traditional methods such as Rescaled Range (R/S) analysis and Detrended Fluctuation Analysis (DFA) have been widely used for its estimation. However, these methods have certain limitations, which we sought to address by modifying the R/S approach to distinguish between fractional Lévy and fractional Brownian motion, and by demonstrating the inadequacy of DFA and similar methods for data that resembles fractional Lévy motion. This inspired us to utilize machine learning techniques to improve the estimation process. In an unprecedented step, we train various machine learning models, including LightGBM, MLP, and AdaBoost, on synthetic data generated from random walks, namely fractional Brownian motion and fractional Lévy motion, where the ground truth Hurst exponent is known. Meaning that we can initialize and create these stochastic processes with a scaling Hurst/scaling exponent which, is then used as the ground truth for training. Furthermore, we perform the continuous estimation of the scaling exponent directly from the time series, without resorting to the calculation of the power spectrum or other sophisticated preprocessing steps, as done in past approaches. Our experiments reveal that the machine learning-based estimators outperform traditional R/S analysis and DFA methods in estimating the Hurst exponent, particularly for data akin to fractional Lévy motion. Validating our approach on real-world financial data, we observe a divergence between the estimated Hurst/scaling exponents and results reported in the literature. Nevertheless, the confirmation provided by known ground truths reinforces the superiority of our approach in terms of accuracy. This work highlights the potential of machine learning algorithms for accurately estimating the Hurst exponent, paving new paths for time series analysis. By marrying traditional finance methods with the capabilities of machine learning, our study provides a novel contribution towards the future of time series data analysis.

Detailed evaluation is provided for the likelihood statistics intrinsic to interlocking Sequential Bayes analysis, which allows estimation of evidential support for dendrograms charting the macroevolution of taxa. It involves complexity functions, such as fractal evolution, to generate well-supported evolutionary trees. Required are data on trait changes from ancestral species to descendant species, which is facilitated by reduction of large genera to monothetic groups (one ancestral species each), most conveniently named as separate genera. Assigning each species one Shannon informational bit per new trait, then adding the traits as sequential Bayesian analysis (each posterior probability used as the prior for the next iteration of Bayes Formula), then interpretation with an odds chart, provides a posterior probability that the ancestor-descendant order is correct, that is, entirely follows evolutionary theory involving adaptation and rarity of total trait reversals. The key fact is that the most recently acquired traits of the ancestral species are selectively inviolate and passed on without change to each descendant species. The details of sequential Bayesian analysis were clarified by calculation of likelihood ratios and Bayes factors that compare optimal models with the next most likely model. Such analysis demonstrated that the optimum arrangement of ancestor and descendant species leads to high support values for fitting evolutionary theory, comparable to statistical support levels reported for molecular evolutionary trees. The fact that phylogenetic analysis does not offer an ancestor-descendant model in is found to be conducive of precision at the expense of accuracy, and leads to wrong ancestor-free models with likelihoods explaining data at high credible levels. The number of advanced traits in the outgroup as a Bayesian prior greatly enhances posterior probability. The method is simple, free of special computer analysis, and well-suited to standard taxonomic practice.

Conceptual distance refers to the degree of proximity between two concepts within a conceptualization. It is closely linked with semantic similarity and relationship, but its computation relies entirely on the context of the given concepts. The DIS-C algorithm, which requires using search algorithms such as Breadth First Search, represents an advance in computing the semantic similarity/relation regardless of the type of knowledge structure and semantic relationships. The shortest path algorithm facilitates the determination of the semantic closeness between two indirectly connected concepts in an ontology by propagating local distances. This process is implemented for each concept pair to establish the most effective and efficient paths to connect these concepts. The algorithm identifies the shortest path between the concepts, allowing for the inference of the most relevant relationships between them. This approach contributes to developing a comprehensive understanding of the ontology and enhances the accuracy and precision of the semantic representation of the concepts. However, one of the critical issues is associated with the computational complexity due to the nature of the algorithm, which is errorn3. This paper studies alternatives to accelerate the DIS-C based on approximation and optimized algorithms, focusing on Dijkstra, pruned Dijkstra, and Sketched-based algorithms to compute conceptual distance. Based on the experiments, we discovered that the bottleneck can be avoided using the proposed 2-hop coverages, bringing DIS-C almost linearity.

This research investigates the complex transformation of the Baltic Clean and Dirty Tankers markets from 1998 to 2023. Our study quantifies the market multifractality in two distinct periods, from 1998 to 2010 and 2010 to 2023. We compare multifractal measures of the original, surrogated, and shuffled data, which indicate high multifractality and a complex market structure influenced by temporal organization and inherent volatility. Shuffled data analysis emphasizes the critical role of temporal sequences within market behaviour. Additionally, the study delves into external factors such as regulatory changes, economic disturbances, technological innovation, and environmental concerns contributing to market complexity. A distinct shift in multifractal values between the two periods suggests an evolution from crisis-induced complexities to a market influenced by diversified and modern dynamics. Our findings offer a concise understanding of the multifractal nature of the tanker markets and how global crises can impact the markets, emphasizing the importance of considering systemic risks in freight market analysis.

Paratemporal methods based on tree expansion have proven to be effective in efficiently generating trajectories of stochastic systems. However, combinatorial explosion of branching arising from multiple choice points presents a major hurdle that must be overcome to implement such techniques. In this paper we tackle this scalability problem by developing a systems theory-based framework covering both conventional and proposed tree expansion algorithms for speeding up discrete event system stochastic simulations while preserving desired accuracy. An example is discussed to illustrate the tree expansion framework in which a discrete event system specification (DEVS) Markov stochastic model takes the form of a tree isomorphic to a free monoid over the branching alphabet. We derive the computation times for baseline, non-merging, and merging tree expansion algorithms to compute the distribution of output values at any given depth. The results show the remarkable reduction from exponential to polynomial dependence on depth effectuated by node merging. We relate these results to the similarly reduced computation time of binomial coefficients underlying Pascal’s triangle. Finally, we discuss application of tree expansion to estimating temporal distributions in stochastic simulations involving serial and parallel compositions with potential real world use cases.

This article presents a new methodology for modeling and analyzing discrete dynamic systems through the construction of inverse algebraic models, giving rise to the Theory of Inverse Discrete Dynamical Systems. Key concepts such as inverse modeling, structural analysis in inverse algebraic trees, and the establishment of topological equivalences for the analytical transfer of properties between the canonical system and its inverted counterpart are introduced. Central theorems on homeomorphic invariance and topological transport are demonstrated, consolidating the validity of transferring cardinal attributes between both equivalent dynamic representations. As a concrete application, an alternative proof of the historic Collatz Conjecture is presented through the rigorous construction of the associated inverse model and the analytical transfer of properties exhibited in the inverted tree structure. Furthermore, evidence has been presented on Conway's Conjecture in the Game of Life through meticulous inverse modeling in bounded cases, overcoming initial limitations of the theory in combinatorial explosions. Although a complete proof of the conjecture is not achieved, this positively expands the modeling and analysis capacity of the methodology. The impact of properly applying this novel theory to expand understanding and solve open problems in discrete dynamical systems seems vast and profound.

The canonical decomposition of a bipartite graph is a new decompositionmethod that involves three operators, parallel, series and K+S. The class of weak bisblit graphs is totally decomposable with respect of these operators, and the class of bicographs is totally decomposable with respect of parallel and series operators. We prove in this paper that the class of bipartite (P_6,C_6)-free graphs is exactly the class of bipartite graphs that are totally decomposable with respect of parallel and K+S operators. We simplify the recognition algorithm of weak-bisplit graphs to adepte with bipartite (P_6,C_6)-free graphs. As a result of this adapted algorithm, we prsent efficient solutions in this class of graphs for two optimization graph problems, the first is the maximm balanced bi-clique problem and the the second is the maximum independent set problem.

We investigate \texorpdfstring{$L_2$}{}-approximation problems in the worst case setting in the weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} with weights \texorpdfstring{$R_{d,\a,{\bm \ga}}$}{} under parameters \texorpdfstring{$1\ge \ga_1\ge \ga_2\ge \cdots\ge 0$ and $1<\az_1\le \az_2\le \cdots$}{}. Several interesting weighted Hilbert spaces \texorpdfstring{$H(K_{R_{d,\a,\g}})$}{} appear in this paper. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. Multivariate approximation; information complexity; tractability; weighted Hilbert spacesWe discuss tractability of \texorpdfstring{$L_2$}{}-approximation problems for the involved Hilbert spaces, which describes how the information complexity depends on \texorpdfstring{$d$}{} and \texorpdfstring{$\va^{-1}$}{}. As a consequence we study the strongly polynomial tractability (SPT), polynomial tractability (PT), weak tractability (WT), and \texorpdfstring{$(t_1,t_2)$}{}-weak tractability (\texorpdfstring{$(t_1,t_2)$}{}-WT) for all \texorpdfstring{$t_1>1$}{} and \texorpdfstring{$t_2>0$}{} in terms of the introduced weights under the absolute error criterion or the normalized error criterion.

The concept of graphs with clique-width at most was first introduced by Courcelle et al.to be the graphs that can be characterized using -expressions derived from graph operations that use labels of vertices. If the clique-width for some graph is bounded then a grand number of algorithmic problems, in general NP-hard, can be solved in polynomial time when restricted to this graph. This important fact motivated the researchers to prove that the clique-width of certain graphs is bounded. Following this research direction, we prove in this paper that the clique-width of series-parallel digraphs is at most 6 and we present an time algorithm to construct a 6-expression for this class of digraphs. In another part, we present a linear time recognition algorithm for a similar class of series-parallel digraphs and prove that the clique-width of this class is at most 3.

{Here, we propose a new tool to estimate the complexity of a time series: the entropy of difference (ED). The method is based solely on the sign of the difference between neighbouring values in a time series. This makes it possible to describe the signal as efficiently as prior proposed parameters such as permutation entropy (PE) or modified permutation entropy (mPE), but (1) reduces the size of the sample that is necessary to estimate the parameter value, and (2) enables the use of the Kullback-Leibler divergence to estimate the "distance" between the time series data and random signals.

Cities are complex systems requiring urban design models that balance order and disorder. Collective creativity initiatives engage citizens in these processes, empowering bottom-up approaches that prioritize people and social well-being within urban development. This paper investigates an 'Urban Laboratory' as a case study, examining the potential of collective creativity to address urban complexity. The successful and ongoing project 'El Campo de Cebada' in Madrid, Spain, demonstrates how a community transformed a vacant lot into a vibrant social hub. The phases of this study include case selection, data collection, data analysis, and presentation of the results. This study identifies key enabling factors, including agents, management, social dynamics, infrastructure, and actions. These insights offer a methodological framework for designing future collaborative, resilient, and inclusive urban spaces, addressing the complex needs of communities within our cities.

As a result of increased energy consumption, global trade has surged, and serious environmental problems have arisen. The problem is made more complicated by the fact that either environmental damage or economic advancement cannot be compromised. The elements contributing to environmental contamination must be identified and dealt with accordingly if we are to have a healthier future. In this study, what causes CO₂ emissions in Malaysia are examined using the Autoregressive distributed lag (ARDL) model using time series data from 1995 to 2020. The paper also examines the impact of energy use and economic complexity on CO2 emissions. Firstly, it is noted that the Environmental Kuznets Curve (EKC) theory holds in Malaysia. Furthermore, energy consumption has a detrimental impact on reducing CO2 emissions. Furthermore, it has been noted that a greater degree of economic complexity leads to an elevated amount of CO2 emissions over an extended period. The findings suggest significant environmental policy implications for reducing CO2 emissions in Malaysia.

Throughout its history Western science has tended to treat complexity as a problem to be avoided or solved. A philosophy of simplification achieved significant improvements in human life and prevails as a model for achieving societal good. However, misplaced efforts to control complexity worsen our sustainability challenges. Effective responses to modern day dilemmas such as floods and climate change require ways of thinking that are more congruent with the complexity of the world. Further, governmental programs to reduce flood risk depend on the support of an informed and engaged public. It has proven difficult to communicate risk in ways that align scientific and technical expertise based on an objective worldview, with communal and individual under-standings of risk based on subjective experiences and perspectives. I introduce Paul Cilliers’ philosophy of critical complexity as the basis of a new conceptual framework that values and balances complexity and simplicity. This paper shows how objective strategies that rely on analytic and probabilistic thinking can be integrated with subjective approaches that draw on the experiential and possibilistic. An example depicts how the problematic framing of the “100-year flood” can be replaced by a model of the data that covers a range of possibilities within an experiential time frame. Cilliers’ work opens an ethical dimension in which we make more intentional choices and acknowledge our limitations. Complexability – understanding how to live with complexity rather than aiming to simplify it – is a vital component of sustainability communication and education.