Simple measures often couldn’t count a deep complexity. In the case of semantic complexity, conventional readability formulas share a common style, a common sort of achievements and a common borders of limitation: These formulas lack a semantics-aware approach and as a result, a precise measurement of semantic complexity couldn’t be done. In this paper, we introduce DASTEX, a novel semantics-aware complexity measure for semantic complexity of text. By DASTEX, a new layer of complexity analysis are opened for NLP, cognitive and computational tasks. This measure benefits from an intuitionistic underlying formal model which consider semantic as a lattice of intuitions. This yields to a well-defined definition for semantic of a text and its complexity. DASTEX is a practical analysis method upon this formal model. So a complete suite of idea, model and method are prepared to result in a simple but yet deep measure for semantic complexity of text. The evaluation of the proposed approach is done by 4 Experiments. The results show DASTEX is capable of measuring the semantic complexity of text in 6 application-tasks.

Software project complexity increases day by day because the software engineering products is being used in the solution of more technically difficult problem and the size of project continuous to grow. The increase complexity causes to high numbers of software project failures in term of time, cost and quality. The main question regarding to this problem is how to handle or cope with this complexity. There is no single way to handle this, software engineer uses different perspective to handle complexity without affecting the overall project performance. A management perspective recognizes that the success of complex project requires good project management. A technically perspective reveals new paradigms for software development i.e.; object oriented and formal methods etc. and software engineer also look for automation perspective in order to reduce the complexity issues. In this paper we will find out the main software project complexity factors by focusing on the management aspects of software project development and also the problems of managing complexity in software engineering products from these different perspectives. The paper is divided in three main sections; paradigms of software development, project management in term of time, cost and quality and third one is automated support that includes methods and tools used to manage the complexity.

I review previous attempts, including recent ones, to introduce technical aspects of digital information and computation into the discussion of ethics. I survey some limitations and advantages of these attempts to produce guiding principles at different scales. In particular, I briefly introduce and discuss questions, approaches, challenges, and limitations based on, or related to, simulation, information theory, integrated information, computer simulation, intractability, algorithmic complexity, and measures of computational organisation and sophistication. I discuss and propose a set of features that ethical frameworks must possess in order to be considered well-grounded, both in theoretical and methodological terms. I will show that while global ethical frameworks that are uncomputable are desirable because they provide non-teleological direction and open-ended meaning, constrained versions should be able to provide guidelines at more local and immediate time scales. In connection to the ethics of artificial intelligence, one point that must be underscored about computational approaches is that (General) AI should only embrace an ethical framework that we humans are willing to adopt. I think that such a framework is possible, taking the form of a general and universal (in the sense of computation) framework built from first computational principles.

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.

The question does P = NP has confounded mathematicians and computer scientists alike for over 50 years and although there is an almost unanimous agreement that it in fact does not, there still is no absolute proof. In this paper, I attempt to prove to that P does not equal NP.

Reconfiguration is concerned with relationships among solutions to a problem instance, where the reconfiguration of one solution to another is a sequence of steps such that each step produces an intermediate feasible solution. The solution space can be represented as a reconfiguration graph, where two vertices representing solutions are adjacent if one can be formed from the other in a single step. Work in the area encompasses both structural questions (Is the reconfiguration graph connected?) and algorithmic ones (How can one find the shortest sequence of steps between two solutions?) This survey discusses techniques, results, and future directions in the area.

Is it possible to develop a meaningful measure for the complexity of a simulation model? Algorithmic information theory provides concepts that have been applied in other areas of research for the practical measurement of object complexity. This article offers an overview of complexity from a variety of perspectives and provides a body of knowledge with respect to the complexity of simulation models. Key terms of model detail, resolution, and scope are defined. An important concept from algorithmic information theory, Kolmogorov complexity, and an application of this concept, normalized compression distance, are used to indicate the possibility of measuring changes in model detail. Additional research in this area can advance the modeling and simulation body of knowledge toward the practical application of measuring simulation model complexity. Examples show that KC and NCD measurements of simulation models can detect changes in scope and detail.

We present a general process for the halting problem, valid regardless of the time and space computational complexity of the decision problem. It can be interpreted as the maximization of entropy for the utility function of a given Shannon-Kolmogorov-Bernoulli process. Applications to non-polynomials problems are given. The new interpretation of information rate proposed in this work is a method that models the solution space boundaries of any decision problem (and non polynomial problems in general) as a communication channel by means of Information Theory. We described a sort method that order objects using the intrinsic information content distribution for the elements of a constrained solution space - modeled as messages transmitted through any communication systems. The limits of the search space are defined by the Kolmogorov-Chaitin complexity of the sequences encoded as Shannon-Bernoulli strings. We conclude with a discussion about the implications for general decision problems in Turing machines.

What is the function of cognition? On one influential account, cognition evolved to co-ordinate behaviour with environmental change or complexity (Godfrey-Smith 1996). Liberal interpretations of this view ascribe cognition to an extraordinarily broad set of biological systems – even bacteria, which modulate their activity in response to salient external cues, would seem to qualify as cognitive agents. However, equating cognition with adaptive flexibility per se glosses over important distinctions in the way biological organisms deal with environmental complexity. Drawing on contemporary advances in theoretical biology and computational neuroscience, we cash these distinctions out in terms of different kinds of generative models, and the representational and uncertainty-resolving capacities they afford. This analysis leads us to propose a formal criterion for delineating cognition from other, more pervasive forms of adaptive plasticity. On this view, biological cognition is rooted in a particular kind of functional organisation; namely, that which enables the agent to detach from the present and engage in counterfactual (active) inference.

Recently emerging data-driven citizen sciences need to harness increasing amount of massive data with varying quality. This paper develops essential theoretical frameworks and example models and examine its computational complexity for interactive data-driven citizen science within the context of guided self-organization. We first define a conceptual model that incorporates quality of observation in terms of accuracy and reproducibility, ranging between subjectivity, inter-subjectivity, and objectivity. Next, we examine the database's algebraic and topological structure in relation to informational complexity measures, and evaluate its computational complexities with respect to exhaustive optimization. Conjectures of criticality are obtained on self-organizing processes of observation and dynamical model development. Example analysis is demonstrated with the use of biodiversity assessment database, the process that inevitably involves human subjectivity for the management in open complex systems.

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 sub-Saharan Africa, malaria is a leading cause of mortality and morbidity. As a result of the interplay between many factors, the control of this disease can be challenging. However, few studies have demonstrated malaria's complexity, control, and modeling although this perspective could lead to effective policy recommendations. This paper aims to be a didactic material providing the reader with an overview of malaria. More importantly, using a system approach lens, we intend to highlight the debated topics and the multifaceted thematic aspects of malaria transmission mechanisms, while showing the control approaches used as well as the model supporting the dynamics of malaria. As there is a large amount of information on each subject, we have attempted to provide a basic understanding of malaria that needs to be further developed. Nevertheless, this study illustrates the importance of using a multidisciplinary approach to designing next-generation malaria control policies.

Why are simple, regular, and symmetric shapes common in nature? Many natural shapes arise as solutions to energy minimisation or other optimisation problems, but is there a general relation between optima and simple, regular shapes and geometries? Here we argue from algorithmic information theory that for objective functions common in nature --- based on physics and engineering laws --- optimal geometries will be simple, regular, and symmetric. Further, we derive a null model prediction that if a given geometry is an optimal solution for one natural objective function, then it is a priori more likely to be optimal or close to optimal for another objective function.

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.

In the Post-Colonial period, the influence of media complexity in the transition to civilian rule and in shaping and consolidating democracy is self-evident in one hand and the post-colonial period the media have continued to watch and shout at misrule and governance in Nigeria. This paper examined how the Nigerian mass media mirrored the Nigerian political landscape using their major functions such as surveillance, correlation, cultural transmission, status conferral, enforcement of cultural norms and values, education, information and narcotizing dysfunctional role. This study was conducted as a longitudinal non-empirical study that relied on secondary data to examine how the mass media showcase political activities in Nigeria from the pre-colonial era through the independent era till date (2023). In this historical account, the researchers examined all media forms which include print, broadcast and new/social media such as Facebook, Whatsapp, Twitter, Telegram, and Instagram. The study showed that the mass media have played a critical role in shaping the political system in Nigeria. The findings which stemmed mainly from secondary data also showed that the Nigerian mass media have shown great interest in the Nigerian political system and as well exposed some unethical dealings in the political structure, raised consciousness, empowered the vulnerable, and acted as the mouthpiece of the oppressed on the one hand and on the other hand have played to the gallery. The researchers conclude that Nigerian mass media have effectively mirrored the Nigerian political system, particularly in the age of social media.

Developing new ways to estimate probabilities can be valuable for science, statistics, and engineering. By considering the information content of different output patterns, recent work invoking algorithmic information theory has shown that a priori probability predictions based on pattern complexities can be made in a broad class of input-output maps. These algorithmic probability predictions do not depend on a detailed knowledge of how output patterns were produced, or historical statistical data. Although quantitatively fairly accurate, a main weakness of these predictions is that they are given as an upper bound on the probability of a pattern, but many low complexity, low probability patterns occur, for which the upper bound has little predictive value. Here we study this low complexity, low probability phenomenon by looking at example maps, namely a finite state transducer, natural time series data, RNA molecule structures, and polynomial curves. Some mechanisms causing low complexity, low probability behaviour are identified, and we argue this behaviour should be assumed as a default in the real world algorithmic probability studies. Additionally, we examine some applications of algorithmic probability and discuss some implications of low complexity, low probability patterns for several research areas including simplicity in physics and biology, a priori probability predictions, Solomonoff induction and Occam's razor, machine learning, and password guessing.

According to many researchers, Abstraction is the basis of mathematics, computing, counting devices, and computer science and engineering. What is more, all of the above deal with complexity management in some way, and abstraction is the most basic mechanism of complexity management.Generative software development - whether in the sense of empowering humans by machine to create software or in the sense of reusing products - has been and is one of the serious concerns and goals of software engineering. The interesting thing is that in both views of generativity, the main issue is still, in a way, complexity management: whether this complexity management is to achieve diversity and reuse management (Czarnecki’s approach) or to Structuring from existing structures (the approach of Alexander and his followers in an object-oriented society).In this article, we will first look at complexity and its various definitions. The definitions that show, despite the different perspectives on complexity in different disciplines and domains, all point in one direction. We will conclude that complexity is rooted in multiplicity. In the following, we will formally define complexity. In the following discussion, we will look at the generative patterns of software development, and then we will look at the complexity management patterns at seven levels.In this article, the author has tried to maintain a comprehensive approach to complexity and to consider the approaches of different domains to complexity.

Imagination is more important than knowledge, but if intellect does not provide the needed logical structures, capacities for envisioning new possibilities are overly constrained. The sustainability problems we face today cannot be solved with the same kind of thinking that created them, but clarity on what counts as a new kind of thinking is sorely lacking. This article proposes methodical, model-based ways of heeding Bateson's warning about the negative consequences for the ecology of mind that follow from ignoring the contexts of relationships. Informed by S. L. Star's sense of boundary objects, a sequence of increasingly complex logical types distinguishes and interconnects qualitatively different kinds of thinking in ways that liberate imaginative new possibilities for life. The economy of thought instantiated at each level of complexity is only as meaningful, useful, beautiful, ethical, and efficient as the standards informing local adaptive improvisations. Standards mediating the general and specific, global and local, universally transcendent and embodied particulars enable meaningful negotiations, agreements, and communications. Attending to the differences between levels of discourse sets up new possibilities for creative and imaginative entrepreneurial approaches to viable, feasible, and desirable goals for measuring and managing sustainable development.

Questions: Elevation, biodiversity, and forest structure are commonly correlated, but their relationships near the positive extremes of biodiversity and elevation are unclear. We asked 1) How does forest structure vary with elevation in a high biodiversity, high topographic complexity region? 2) Does forest structure predict vascular plant biodiversity? 3) Is plant biodiversity more strongly related to elevation or to forest structure? Location: Great Smoky Mountains National Park, USAMethods: We used terrestrial LiDAR scanning (TLS) to characterize vegetation structure in 12 forest plots. We combined two new canopy structural complexity metrics with traditional TLS-derived forest structural metrics and vascular plant biodiversity data to investigate correlations among forest structure metrics, biodiversity, and elevation. Results: Forest structure varied widely across plots spanning the elevational range of GRSM. Our new measures of canopy density (Depth) and structural complexity (σDepth) were sensitive to structural variations and effectively summarized horizontal and vertical dimensions of structural complexity. Vascular plant biodiversity was negatively correlated with elevation, and more strongly positively correlated with vegetation structure variables. Conclusions: The strong correlations we observed between canopy structural complexity and biodiversity suggest that structural complexity metrics could be used to assay plant biodiversity over large areas in concert with airborne and spaceborne platforms.

It is important to reduce the computation complexity while maintaining the accuracy of convolution neural networks. We deem it is possible to further reduce the network complexity while ensuring the accuracy. In this paper, we propose a novel feature extraction network called DSRNet which is lightweight but effective. DSRNet follows the basic ideas of stacking modules and short connection, introduces Depthwise Separable convolution and utilizes the Dilated convolution. The proposed network has fewer parameters and achieves outstanding speed. We conducted comprehensive experiments on CIFAR10, CIFAR100 and STL10 datasets, and the results showed the DSRNet has great performance improvement in terms of accuracy and speed.

We investigate the physics of a medium-size quantum particle' gases, of the order of hundreds or thousands of fermions/bosons (far below the thermodynamic limit $N \, \rightarrow \, 10^{24}$). Appeal to microcanonical ensemble becomes then unavoidable. The so-called statistical complexity is our protagonist. Interesting facts are uncovered, both for fermions and bosons, yielded by statistical quantifiers.

We compared performance of a novel encoding Lempel-Ziv complexity (ELZC) with approximate entropy (ApEn), sample entropy (SmpEn) and permutation entropy (PerEn) as nonlinear metric to assess ECG quality. Firstly to compare performance of discerning randomness and inherent nonlinear properties within time series, this study calculated the aforementioned four nonlinear complexity values on several typical artificial time series i.e., Gauss noise, two kinds of noisy time series, two kinds of Logistic series and periodic series, respectively. Then for analyzing sensitivity of the aforementioned four complexity methods to content level of different types noise within ECG recordings, we investigated variation trend of ELZC, ApEn, SmpEn and PerEn in several synthetic ECG recordings containing different types noise (i.e., baseline wander, muscle artefacts, electrode motion, power line and mixed noise) and different signal noise ratios (i.e., 15, 10, 5, 0, −5 and −10 dB). Finally, the four complexity methods were employed to classify the quality of real ECG recordings from the PhysioNet/Computing in Cardiology Challenge 2011 (CINC 2011) of the MIT databases, then receiver operating characteristic curves (ROC) and their corresponding area under curve (AUC) were yielded. The results showed ELZC could not only distinguish randomness and chaotic within time series but also reflect content level of noise within time series, and the highest AUC of PerEn, ELZC, SmpEn and ApEn were 0.850, 0.695, 0.474 and 0.461, respectively. The results demonstrated PerEn and ELZC were more effectively than ApEn and SmpEn for assessing ECG quality.

In the clinical electrophysiologic practice, the reading and comparing electroencephalographic (EEG) recordings some times is insufficient and take to much time. That is why in the last years it has begun to introduce new methods of EEG analysis, that give a better and faster understanding of the EEG dynamics and allow a rapid intervention in the patient's treatment. Tools coming from the information theory or nonlinear system as an entropy and complexity have been shown to be a very good alternative to address this problem. In this work we introduce a novel method -the permutation Lempel-ziv complexity vs permutation entropy map. This method was applied to EEG of two patients with specific diagnosed pathologies during respective follow up processes of pharmacological changes in order to detect changes that are not evident with the usual inspection method. Our results show that the proposed method are useful for observing an evolutionary retrospective clinical effects of pharmacological interventions in both patients, and from these, to follow the clinical response to the proposed treatment.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems, we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we looked at the duality of resource allocation problems. First, we chose a real world optimization problem and looked at its solution with linear programming. Then, we restudied this problem with a quantum algorithm in order to understand whether if there is a speedup of the solution. The improvement in computation is analysed and some interesting results are reported.

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 paper discusses complexity theory, that is, the many theories that have been proposed for emergence of complexity from the underlying physics. Our aim is to identify which aspects have turned out to be the more fundamental ones as regards the emergence of biology, engineering, and digital computing, as opposed to those that are in fact more peripheral in these contexts. In the cases we consider, complexity arises via adaptive modular hierarchical structures that are open systems involving broken symmetries. Each emergent level is causally effective because of the meshing together of upwards and downwards causation that takes place consistently with the underlying physics. Various physical constraints limit the outcomes that can be achieved. The underlying issue concerns the origin of consciousness and agency given the basis of life in physics, which is structured starting from symmetries and variational principles with no trace of agency. A possible solution is to admit that consciousness is an irreducible emergent property of matter.

Competing and complementary models of resting-state brain dynamics contribute to our phenomenological and mechanistic understanding of whole-brain coordination and communication, and provide potential evidence for differential brain functioning associated with normal and pathological behavior. These neuroscientific theories stem from the perspectives of physics, engineering, mathematics, and psychology and create a complicated landscape of domain-specific terminology and meaning, which, when used outside of that domain, may lead to incorrect assumptions and conclusions within the neuroscience community. Here we review and clarify the key concepts of Connectivity, Computation, Criticality, and Coherence — the 4C’s — and outline a potential role for metastability as a common denominator across these propositions. We analyze and synthesize whole-brain neuroimaging research, examined through functional magnetic imaging (fMRI), to demonstrate that complexity science offers a principled and integrated approach to describe, and potentially understand, macroscale spontaneous brain functioning.

A sparse language is a formal language such that the number of strings of length $n$ is bounded by a polynomial function of $n$. We create a class with the opposite definition, that is a class of languages that are dense instead of sparse. We define a dense language on $m$ as a formal language (a set of binary strings) where there exists a positive integer $n_{0}$ such that the counting of the number of strings of length $n \geq n_{0}$ in the language is greater than or equal to $2^{n - m}$ where $m$ is a real number and $0 < m \leq 1$. We call the complexity class of all dense languages on $m$ as $DENSE(m)$. We prove that there exists an $\textit{NP--complete}$ problem that belongs to $DENSE(m)$ for every possible value of $0 < m \leq 1$.

Within the spectrum of a natural image, the amplitude of modulation decreases with spatial frequency. The speed of such an amplitude decrease, or the amplitude spectrum slope, of an image affects the perceived aesthetic value. Additionally, a human observer would consider a symmetric image more appealing than they do an asymmetric one. We investigated how these two factors jointly affect aesthetic preferences by manipulating both the amplitude spectrum slope and the symmetric level of images to assess their effects on aesthetic preference on a 6-point Likert scale. Our results showed that the preference ratings increased with the symmetry level but had an inverted U-shape relation to amplitude spectrum slope. In addition, a strong interaction existed between symmetry level and amplitude spectrum slope on preference rating, in that symmetry can amplify the amplitude spectrum slope’s effects. Such effects can be described by a quadratic function of the spectrum slope. That is, preference is an inverted U-shape function of spectrum slope whose intercept is determined by the number of symmetry axis. In addition, the interaction between the two factors is manifested as the modulation depth of the quadratic function.

What is a complex system? The definition of a complex system remains somewhat ambiguous. A complex system can be defined as a system consisting of many interacting parts exhibiting emergent behaviors. The emerging field of complexity science entails a change in the language of scientific research and thinking. As such, the general properties, tools and definitions pertaining to complex systems must be made accessible to multi-disciplinary systems scientists and thinkers. With this intention, this literary survey presents the development and glossary of essential concepts steering complex systems.

In the last decades, it has been established that astrocytes play key roles in the regulation of neuronal morphology. However, the contribution of astrocyte-derived small extracellular vesicles (sEVs) to morphological differentiation of neurons has only recently been addressed. Here, we showed that cultured astrocytes expressing a GFP tagged version of the stress-regulated astrocytic enzyme Aldolase C (Aldo C-GFP) release small extracellular vesicles (sEVs) which are transferred into cultured hippocampal neurons. Surprisingly, Aldo C-GFP-containing sEVs (Aldo C-GFP sEVs) displayed an exacerbated capacity to reduce the dendritic complexity in developing hippocampal neurons compared to sEVs derived from control (i.e. GFP-expressing) astrocytes. Using bioinformatics and biochemical tools, we found that the total content of overexpressed Aldo C-GFP correlates with an increased content of endogenous miRNA-26a-5p in both total astrocyte homogenates and sEVs. Notably, neurons magnetofected with a nucleotide sequence that mimics endogenous miRNA-26a-5p (mimic 26a-5p) not only decreased the levels of neuronal proteins associated to morphogenesis regulation and also reproduced morphological changes induced by Aldo-C-GFP sEVs. Furthermore, neurons magnetofected with a sequence targeting miRNA-26a-5p (antago 26a-5p) were largely resistant to Aldo C-GFP sEVs. Our results support a novel and complex level of astrocyte-to-neuron communication mediated by astrocyte-derived sEVs and the activity of their miRNA content.

The perspective suggests an unorthodox interpretation of cancer dynamics in terms of strange attractors and fluid turbulence. The relevance of strange attractors in tumor growth-invasion dynamics and chemical pattern formation are reviewed. Chemical turbulence, fractals and chaos are discussed as the principal characteristics of tumor ecosystems and their complex cybernetics. To conclude, cancers are presented as complex systems exhibiting chaotic gene expression dynamics.

In mathematics, one always aims to obtain new frameworks from specific ones. This also stratified to the regality of graphs, where one can produce numerous new graphs from a specific set of graphs. In this work we define some classes of pyramid graphs created by a gear graph and we derive straightforward formulas of the complexity of these graphs, using linear algebra matrix analysis techniques and employing knowledges of Chebyshev polynomials.

We present a new method of estimating fitness of countries and complexity of products by exploiting a non-linear non-homogeneous map applied to the publicly available information on the goods exported by a country. The non homogeneous terms guarantee both convergence and stability. After a suitable rescaling of the relevant quantities, the non homogeneous terms are eventually set to zero so that this new method is parameter free. This new map reproduces the findings of the method proposed by Tacchella et al. [1], and allows for an approximate analytic solution in case of actual binarized matrices based on the Revealed Comparative Advantage (RCA) indicator. This solution is connected with a new quantity describing the neighborhood of nodes in bipartite graphs, representing in this work the relations between countries and exported products. Moreover, we define the new indicator of country net-efficiency quantifying how a country efficiently invests in capabilities able to generate innovative complex high quality products. Eventually, we demonstrate analytically the local convergence of the algorithm.

This work is a generalization of the Lopez-Ruiz, Mancini and Calbet (LMC); and Shiner, Davison and Landsberg (SDL) complexity measures, considering that the state of a system or process is represented by a dynamical variable during a certain time interval. As the two complexity measures are based on the calculation of informational entropy, an equivalent information source is defined and, as time passes, the individual information associated to the measured parameter is the seed to calculate instantaneous LMC and SDL measures. To show how the methodology works, an example with economic data is presented.

In this article, we investigate limitations of importing methods based on algorithmic information theory from monoplex networks into multidimensional networks (such as multilayer networks) that have a large number of extra dimensions (i.e., aspects). In the worst-case scenario, it has been previously shown that node-aligned multidimensional networks with non-uniform multidimensional spaces can display exponentially larger algorithmic information (or lossless compressibility) distortions with respect to their isomorphic monoplex networks, so that these distortions grow at least linearly with the number of extra dimensions. In the present article, we demonstrate that node-unaligned multidimensional networks, either with uniform or non-uniform multidimensional spaces, can also display exponentially larger algorithmic information distortions with respect to their isomorphic monoplex networks. However, unlike the node-aligned non-uniform case studied in previous work, these distortions in the node-unaligned case grow at least exponentially with the number of extra dimensions. On the other hand, for node-aligned multidimensional networks with uniform multidimensional spaces, we demonstrate that any distortion can only grow up to a logarithmic order of the number of extra dimensions. Thus, these results establish that isomorphisms between finite multidimensional networks and finite monoplex networks do not preserve algorithmic information in general and highlight that the algorithmic information of the multidimensional space itself needs to be taken into account in multidimensional network complexity analysis.

Healthy brain functioning depends on balancing stable integration between brain areas for effective coordinated functioning, with bursts of desynchronisation to allow subsystems to reconfigure and express functional specialisation. Metastability, a concept originated in statistical physics and dynamical systems theory, has been proposed as a key signature that characterises this balance. Building on this principle, the neuroscience literature has employed markers of metastability to investigate various aspects of brain function including cognitive performance, healthy ageing, meditation, sleep, responses to pharmacological challenges, and to characterise psychiatric conditions or disorders of consciousness. However, this body of work often uses the notion of metastability heuristically, and sometimes inaccurately, making it hard for the uninitiated to navigate the vast literature, interpret findings, and foster further development of theoretical and experimental methodologies. In this paper we provide a comprehensive review of metastability and its applications in neuroscience, covering its scientific and historical foundations and the practical estimators used to estimate it in empirical data. We also provide a critical analysis of recent theoretical developments, clarifying common misconceptions and paving the road for future developments.

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.

Human cancers comprise an heterogeneous array of diseases with different progression patterns and responses to therapy. However, they all develop within a host context that constraints their natural history. As it occurs with the diversity of organisms, one can conjecture that there is order in the cancer multiverse. Is there a way to capture the broad range of tumor types within a space of the possible? Here we define the oncospace, a coordinate system that integrates the ecological, evolutionary and developmental components of cancer complexity. The spatial position of a tumor results from its departure from the healthy tissue along these three axes, and progression trajectories inform about the components driving malignancy across cancer subtypes. We postulate that the oncospace topology encodes new information regarding tumorigenic pathways, subtype prognosis and therapeutic opportunities: treatment design could benefit from considering how to nudge tumors towards empty evolutionary deserts in the oncospace.

With the increasing number of connected devices, complex systems such as smart homes record a multitude of events of various types, magnitude and characteristics. Current systems struggle to identify which events can be considered more memorable than others. In contrast, human are able to quickly categorize some events as being more “memorable” than others. They do so without relying on knowledge of the system’s inner working or large previous datasets. Having this ability would allow the system to: i) identify and summarize a situation to the user by presenting only memorable events; ii) suggest the most memorable events as possible hypotheses in an abductive inference process. Our proposal is to use Algorithmic Information Theory to define a “memorability” score by retrieving events using predicative filters. We use smart-home examples to illustrate how our theoretical approach can be implemented in practice.

Leigh Van Valen was an American evolutionary biologist who made major contributions to evolutionary theory and is particularly remembered by his groundbreaking paper "A New Evolutionary Law" (1973) where he provided evidence from fossil record data that this law maintains that the probability of extinction within any group remains es­sentially constant through time. In order to explain such unexpected result, Van Valen formulated a very influential idea that he dubbed the "Red Queen hypothesis". It states that the constant decay must be a consequence of evolutionary interactions among connected species within ecological networks. In Van Valen's picture, species do not merely evolve: they also coevolve with other species. As a consequence, when thinking in adaptation to an external environment, the other species must be considered as part (may be a major part) of such external world. Van Valen's law provided the first complex systems theory of coevolutionary dynamics and inspired a whole range of theoretical and experimental developments and scholars from very diverse fields, from economics to physics. In that respect, Leigh Van Valen's contribution percolated far beyond its original formulation. Red Queen arms races are nowadays considered a widespread feature of complex adaptive systems.

This paper aims to analyze the effects of Covid-19 on financial markets from the perspective of Complexity. The Covid-19 pandemic has caused turmoil in financial markets and is already one of the most important financial crises in history, causing a fall in several stock markets as well as great volatility. Unlike past crises, which in most cases were caused either by problems of fiscal deficits or in the financial system, this crisis has its origin in an epidemic disease, which occurred in Wuhan, China, and quickly spread across the globe affecting transport networks, commerce and finance, and will affect the public debt of many countries. This is a systemic situation in which there is a need to consider several interconnected systems, financial instability and high financial risk, something that econophysics and some complexity theorists already do. Therefore, this paper intends to show, theoretically, the systemic and complex character of the recent financial crisis caused by Covid-19.

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. We prove the Riemann hypothesis using the Complexity Theory. Number theory is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. The Goldbach's conjecture is one of the most important and unsolved problems in number theory. Nowadays, it is one of the open problems of Hilbert and Landau. We show the Goldbach's conjecture is true using the Complexity Theory as well. An important complexity class is 1NSPACE(S(n)) for some S(n). These mathematical proofs are based on if some unary language belongs to 1NSPACE(S(log n)), then the binary version of that language belongs to 1NSPACE(S(n)) and vice versa.

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.

The dynamics of many complex systems can be classified as ordered, chaotic, or critical. Order offers stability and robustness, while chaos allows for change and adaptability. Criticality, then, is often seen as a balance required by living systems at different scales. In classical models, however, criticality is only found near phase transitions, restricting the parameter space (and thus the likelihood) of critical dynamics, as most parameters yield ``undesirable'' solutions. Here we show that this limitation is due to the homogeneity built-in these models, i.e., all elements sharing parameter values. By exploring heterogeneous versions of archetypal models in physics and computer science, we observe critical dynamics in a broader range of parameters, and thus could be more common than previously thought.

We explored the statistics of filtering of simple patterns on a number of deterministic and random graphs as a tractable simple example of information processing in complex systems. In this problem, multiple inputs map to the same output, and the statistics of filtering is represented by the distribution of this degeneracy. For a few simple filter patterns on a ring we obtained an exact solution of the problem and described numerically more difficult filter setups. For each of the filter patterns and networks we found a few numbers essentially describing the statistics of filtering and compared them for different networks. Our results for networks with diverse architectures appear to be essentially determined by two factors: whether the graphs structure is deterministic or random, and the vertex degree. We find that filtering in random graphs produces a much richer statistics than in deterministic graphs. This statistical richness is reduced by increasing the graph’s degree.

Project complexity is usually considered as one of main causes of cost overruns, resulting in poor performance and thus project failure. However, empirical studies focused on evaluating its effects on project cost remain lacking. Given this circumstance, this study attempts to develop the relationships between project cost and the multidimensional project complexity elements. We establish complexity as a multidimensional factor including the task, organization, market, legal, and environment complexities. This study uses an empirical evidence-based structural model to account for the relationships between project cost and project complexity. By doing so, a quantitative assessment of multi-dimensional project complexity has been developed. The findings suggest that task and organization complexities have direct effects on project cost, while market, legal and external environment complexities have indirect effects on project cost. The practical contribution is that the findings can improve the understanding of which dimension of complexity significantly influence project cost, and the need to focus efforts on strategically addressing that complexities.

In this paper we study the normal bases for Galois ring extension ${{R}} / {Z}_{p^r}$ where ${R}$ = ${GR}$(p^r, n). We present a criterion on normal basis for ${{R}} / {Z}_{p^r}$ and reduce this problem to one of finite field extension $\overline{R} / \overline{Z}_{p^r}=F_{q} / F_{p} (q=p^n)$ by Theorem 1. We determine all optimal normal bases for Galois ring extension.

Embryonic development proceeds through a series of differentiation events. The mosaic version of this process (binary cell divisions) can be analyzed by comparing early development of Ciona intestinalis and Caenorhabditis elegans. To do this, we reorganize lineage trees into differentiation trees using the graph theory ordering of relative cell volume. Lineage and differentiation trees provide us with means to classify each cell using binary codes. Extracting data characterizing lineage tree position, cell volume, and nucleus position for each cell during early embryogenesis, we conduct several statistical analyses, both within and between taxa. We compare both cell volume distributions and cell volume across developmental time within and between single species and assess differences between lineage tree and differentiation tree orderings. This enhances our understanding of the differentiation events in a model of pure mosaic embryogenesis and its relationship to evolutionary conservation. We also contribute several new techniques for assessing both differences between lineage trees and differentiation trees, and differences between differentiation trees of different species. The results suggest that at the level of differentiation trees, there are broad similarities between distantly related mosaic embryos that might be essential to understanding evolutionary change and phylogeny reconstruction. Differentiation trees may therefore provide a basis for an Evo-Devo Postmodern Synthesis.

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 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 consider the problem of scheduling $n$ jobs with identical processing times and given release as well as delivery times on $m$ uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job. This problem is well-known to have an open complexity status even if the number of jobs is fixed. We present a polynomial-time algorithm for the problem which is based on the earlier introduced algorithmic framework blesscmore (``branch less and cut more''). We extend the analysis of the so-called behavior alternatives developed earlier for the version of the problem with identical parallel machines and show how the earlier used technique for identical machines can be extended to the uniform machine environment if a special condition on the job parameters is imposed. The time complexity of the proposed algorithm is $O(\gamma m^2 n\log n)$, where $\gamma$ can be either $n$ or the maximum job delivery time $q_{\max}$. This complexity can even be reduced further by using a smaller number $\kappa<n$ in the estimation describing the number of jobs of particular types. However, this number $\kappa$ becomes only known when the algorithm has terminated.

Long-chain branched metallocene-catalyzed high-density polyethylenes (LCB-mHDPE) were solution blended to obtain blends with varying degrees of branching. A high molecular LCB-mHDPE was mixed with low molecular LCB-mHDPE are varying concentrations, whose rheological behavior is similar but whose molar mass and molar mass distribution is significantly different. Those blends were characterized rheologically to study the effects of concentration, molar mass distribution, and long-chain branching level of the low molecular LCB-mHDPE. Owing to the ultra-long relaxation times of the high molecular LCB-mHDPE, the blends started behaving clearly more long-chain branched than the base materials. The thermorheological complexity showed an apparent increase in the activation energies Ea determined from G’, G”, and especially δ. Ea(δ), which for LCB-mHDPE is a peak function, turned out to produce even more pronounced peaks than observed for regular LCB-mPE and also LCB-mPE with broader molar mass distribution. Thus, it is possible to estimate the molar mass distribution from the details of the thermorheological complexity.

It is impossible to fully grasp reality and the universe without a sound understanding of quantum science, i.e. theory. The aim of this paper is twofold, namely first presenting what quantum information processing consists of, and then consequently discussing the implications of quantum science to the understanding of reality. I shall claim that the world is fully quantum, and the classical world is but a limit case of the quantum world. The crux of the argument is that quantum information can be taken as a living phenomenon. Quantum information processing (QIP) has been mainly the subject of computational approaches (Cooper and Hodges, 2016). Here we take it as the way in which information allows for a non-dualistic explanation of the world. In this sense, quantum information processing consists in understanding how entanglement stands as the ground for a coherent reality yet highly dynamical, vibrant and vivid. Information, I argue, is a living phenomenon that creates itself out of nothing. Quantum information is a relational view of entities, systems, phenomena, and events (Auletta, 2005).

Cancers remain the lead cause of disease-related, pediatric death in North America. The emerging field of complex systems has redefined cancer networks as a computational system with intractable algorithmic complexity. Herein, a tumor and its heterogeneous phenotypes are discussed as dynamical systems having multiple, strange attractors. Machine learning, network science and algorithmic information dynamics are discussed as current tools for cancer network reconstruction. Deep Learning architectures and computational fluid models are proposed for better forecasting gene expression patterns in cancer ecosystems. Cancer cell decision-making is investigated within the framework of complex systems and complexity theory.

Integrated information theory (IIT) proposes a measure of integrated information (Φ) to capture the level of consciousness for a physical system in a given state. Unfortunately, calculating Φ itself is currently only possible for very small model systems, and far from computable for the kinds of systems typically associated with consciousness (brains). Here, we consider several proposed measures and computational approximations, some of which can be applied to larger systems, and test if they correlate well with Φ. While these measures and approximations capture intuitions underlying IIT and some have had success in practical applications, it has not been shown that they actually quantify the type of integrated information specified by the latest version of IIT. In this study, we evaluated these approximations and heuristic measures, based not on practical or clinical considerations, but rather based on how well they estimate the Φ values of model systems. To do this, we simulated networks consisting of 3–6 binary linear threshold nodes randomly connected with excitatory and inhibitory connections. For each system, we then constructed the system’s state transition probability matrix (TPM), as well as its state transition matrix (STM) over time for all possible initial states. From these matrices, we calculated, approximations to Φ, and measures based on state differentiation, state entropy, state uniqueness, and integrated information. All measures were correlated with Φ in a state dependent and state independent manner. Our findings suggest that Φ can be approximated closely in small binary systems by using one or more of the readily available approximations (r > 0.95), but without major reductions in computational demands. Furthermore, Φ correlated strongly with measures of signal complexity (LZ, r_s = 0.722), decoder based integrated information (Φ*, r_s = 0.816), and state differentiation (D1, r_s = 0.827), on the system level (state independent). These measures could allow for efficient estimation of Φ on a group level, or as accurate predictors of low, but not high, Φ systems. While it’s uncertain whether the results extend to larger systems or systems with other dynamics, we stress the importance that measures aimed at being practical alternatives to Φ are at a minimum rigorously tested in an environment where the ground truth can be established.

Cancers are complex, adaptive ecosystems. They remain the leading cause of disease-related death among children in North America. As we approach computational oncology and Deep Learning Healthcare, our mathematical models of cancer dynamics must be revised. Recent findings support the perspective that cancer-microenvironment interactions consist of turbulent flows. As such, cancer pattern formation, protein-folding and metastatic invasion are discussed herein as processes driven by chemical turbulence within the framework of complex systems theory. Current state-of-the-art quantitative approaches used in reconstructing cancer stem cell networks are reviewed. To conclude, cancer stem cells are presented as strange attractors of the Waddington landscape.

Spatial data conflation plays a fundamental role in in many aspects of modern Geographic Information Systems (GIS) research and development such as geospatial data visualization, incremental updating of databases and disaster evaluation. The primary objective of conflation is to derive valuable information based on the comparison of multiple spatial data sources of homogeneous or heterogeneous nature. This paper reviews the state of art of the concept of conflation, feature matching, the most important progresses of conflation between image and road network data, and the complexity of spatial conflation.

The aim of this study was to assess the ability of multiscale sample entropy (MSE), refined composite multiscale entropy (RCMSE), and complexity index (CI) to characterize gait complexity through trunk acceleration patterns in subjects with Parkinson's disease (swPD) and healthy subjects, regardless of age or gait speed. The trunk acceleration patterns of 51 swPD and 50 HS were acquired using a lumbar-mounted magneto-inertial measurement unit during their walking. MSE, RCMSE, and CI were calculated on 2000 data points, using scale factors (τ) 1-6. Differences between swPD and HS were calculated at each τ, and the area under the receiver operating characteristics, optimal cutoff points, post-test probabilities, and diagnostic odds ratios were calculated. MSE in the antero-posterior direction at τ 4 and τ 5, and MSE in the ML direction at τ 4 outperformed the other entropy measures in terms of discriminative ability and characterized the gait of swPD with 79%, 82%, and 78% probabilities, respectively, and correlated with the motor disability, pelvic kinematics, and stance phase. Using a time series of 2000 data points, a scale factor of 4 or 5 in the MSE procedure can be considered as a marker of gait variability and complexity in swPD.

In recent years, Neural networks are increasingly deployed in various fields to learn complex patterns and make accurate predictions. However, designing an effective neural network model is a challenging task that requires careful consideration of various factors, including architecture, optimization method, and regularization technique. This paper aims to comprehensively overview the state-of-the-art artificial neural network (ANN) generation and highlight key challenges and opportunities in machine learning applications. It provides a critical analysis of current neural network model design methodologies, focusing on the strengths and weaknesses of different approaches. Also, it explores the use of different learning approaches, including convolutional neural networks (CNN), deep neural networks (DNN), and recurrent neural networks (RNN) in image recognition, natural language processing, and time series analysis. Besides, it discusses the benefits of choosing the ideal values for the different components of ANN, such as the number of Input/output layers, hidden layers number, activation function type, epochs number, and model type selection, which help improve the model performance and generalization. Furthermore, it identifies some common pitfalls and limitations of existing design methodologies, such as overfitting, lack of interpretability, and computational complexity. Finally, it proposes some directions for future research, such as developing more efficient and interpretable neural network architectures, improving the scalability of training algorithms, and exploring the potential of new paradigms, such as Spiking Neural Networks, quantum neural networks, and neuromorphic computing.

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.

Since the second half of the second millennium AD, water management among the Chagga people of Kilimanjaro in Tanzania has involved community collaboration in the construction, ownership and management of water infrastructure. Chagga settlement on the lower slopes of Kilimanjaro transformed the landscape significantly to reflect an agrarian society characterised by decentralised forms of socio-political and economic organisation. Such organization involved conception, construction, and post-construction management of water distribution systems, constituting high-level socio-political complexity. The study employs ethnography, archaeological surveys and GIS to document water infrastructures on the lower slopes of Kilimanjaro. We conclude that community collaboration was key in management of the water infrastructure and by extension, agriculture, which sustained Chagga and chiefdoms for centuries.

Fractional calculus gained a lot of attention in the last couple of years. Researchers discovered that processes in various fields follow rather fractional dynamics than ordinary integer-ordered dynamics, meaning the corresponding differential equations feature non-integer valued derivatives. There are several arguments for why this is the case, one of them being that fractional derivatives’ inherit spatiotemporal memory and/or the ability to express complex naturally occurring phenomena. Another popular topic nowadays is machine learning, i.e., learning behavior and patterns from historical data. In our ever-changing world with ever-increasing amounts of data, machine learning is a powerful tool for data analysis, problem-solving, modeling, and prediction. It further provides many insights and discoveries in various scientific disciplines. As these two modern-day topics provide a lot of potential for combined approaches to describe complex dynamics, this article reviews combined approaches of fractional derivatives and machine learning from the past, puts them into context, and thus provides a list of possible combined approaches and the corresponding techniques. Note, however, that this article does not deal with neural networks, as there already is profound literature on neural networks and fractional calculus. We sorted past combined approaches from the literature into three categories, i.e., preprocessing, machine learning &amp; fractional dynamics, and optimization. The contributions of fractional derivatives to machine learning are manifold as they provide powerful preprocessing and feature augmentation techniques, can improve physically informed machine learning, and are capable of improving hyperparameter optimization. Thus, this article serves to motivate researchers dealing with data-based problems, to be specific machine learning practitioners, to adopt new tools and enhance their existing approaches.

Conventional academic debate on sustainability and transformation has begun to be disputed by researchers, policymakers and other stakeholders from the private sector. The complexity of linking sustainability with transformation necessitates the development of new ways of understanding and explaining actors, processes, issues, structures, and outcomes related to transformation to sustainability (T2S). A persistent problem in understanding and managing the T2S is the implied notion of a monolithic transformation to achieve sustainability. This notion underestimates the diversity of actors as well as the historical contexts of transformations. At the same time, achieving T2S is highly dependent on technical solutions as well as policies that can stir needed behavioural change, whereas these technical solutions and policies are not always socially acceptable or politically implementable. Therefore, achieving T2S also calls for evaluating normative foundations of policies and actions needed to advance T2S. This article argues that T2S is composed of different phases, each of which having a different set of actors, resources and audience. This article explains how collective decision can be achieved through multiple levels and types of negotiations that occur in an orchestrated manner. To understand this, this article introduces a theoretical model as an analytical framework to structure how T2S unfolds. This model uses insights from negotiation studies to focus on the actors’ perspectives on T2S. It proposes the division of the transformation process into phases – entry point, learning, sequencing, disrupting and fortifying. Using the Germany’s energy transition (Energiewende), each of these phases is analysed to determine the “quality” of cooperation that can help fulfil the tasks required to master the so-called “cognitive games” of T2S (ripeness game, power game, bargaining game, policy game, scaling game). Moreover, insights are presented to explain how the designated milestone can be achieved that indicates the advancing to the next phase and eventually entrench the transformation process. The lessons and findings resulting from the analysis of the phases of T2S suggest that there is also the need to revisit underlying assumptions on negotiations, sustainability and transformation.

We show that the van der Waals gas does not exhibit just the celebrated liquid-gas 1 transition but also a quantum-classical one. We study the issue with reference to the LMC statistical 2 complexity and in relation to the order-disorder contrast.

The world of science is drowned in a wealth of information. How to make sense of this wealth of published articles, blog posts and abstracts has become an important challenge given the importance of science to different aspects of societal function. At the crux of the issue lies the increasing trend where scientific discovery informs decision making at the societal level. One example, is the elucidation of the ozone hole to the promulgation of the Montreal Protocol in 1987, and documenting increasing atmospheric carbon dioxide concentration led to climate action and signing of the Paris Agreement in 2015. Hence, understanding a research field becomes an important need for many decision makers across different sectors of society. But, the scientific literature is cryptic and esoteric, and presents a significant barrier to comprehension. One approach to ameliorate the problem is statistical machine reading, which provides the critical capability of identifying key concepts that underpins a research field. Such important concepts help provide an incision point to gain further understanding of the field and initiating further conversation about the field. This work sought to validate the concept of whether applying statistical machine reading to a body of literature comprising short blog posts and abstracts of published articles help in understanding the field of metabolic engineering. One important angle pursued in this research is whether the tabulated list of terms and phrases identified by statistical machine reading could be creatively analyzed to gain a deeper understanding of the research field. For example, the most frequently occurring terms and phrases could describe key concepts of the research field. Moving down in frequency occurrence would be terms and phrases that describe methodologies and approaches of the field. Finally, less frequently occurring terms and phrases may be tools and resources used in the research field. Results validated the utility of statistical machine reading in identifying important terms and phrases associated with the research field. But the small dataset of blog posts and abstracts used in this study severely hampered the identification of most of the key concepts of metabolic engineering, which is a fairly broad field of research. Overall, statistical machine reading shows utility in identifying terms and phrases that could describe a field. However, the level of understanding is closely tied in to the breadth and depth of reading material available, which meant that the methodology is data intensive in nature. Future use of supercomputing or quantum computing could help alleviate constraints of computational capacity, and help tackle the exponential rise in computational complexity as the size of the reading material for machine reading expands.

The prevailing interpretations of physics are based on deeply entrenched assumptions, rooted in classical mechanics. Logical implications include: the denial of entropy and irreversible change as fundamental physical properties; the inability to explain random quantum measurements or nonlocality without untestable and implausible metaphysical implications; and the inability to define complexity or explain its evolution. We propose a conceptual model based on empirically justifiable assumptions. The WYSIWYG Conceptual Model (WCM) assumes no hidden properties: “What You can See Is What You Get.” The WCM defines a system’s state in the context of its actual ambient background, and it extends existing models of physical reality by defining entropy and exergy as objective contextual properties of state. The WCM establishes the irreversible production of entropy and the Second law of thermodynamics as a fundamental law of physics. It defines a dissipative system’s measurable rate of internal work as an objective measure of stability of its dissipative process. A dissipative system can follow either of two paths toward higher stability: it can 1) increase its rate of exergy supply (and maximize entropy production) or 2) utilize existing exergy supplies better to increase its internal work rate and functional complexity. These paths guide the evolution of both living and non-living systems.

Studies have found critical software malfunctions responsible for some of the worst accidents in recent times. These malfunctions are often only minor defects that snowball into large problems; a few lines of code is all it takes. Complexity, safety, quality, and resilience are among the key attributes defining a software’s operational success. There are many leading factors for complexity, such as increases in the product size, the rate of requirement changes, and the number and type of stakeholders, and failure to manage these issues efficiently always has the same consequence, i.e., massive failure and sometimes technological catastrophe. This work analyzes some of the architecture, design, and implementation guidelines used as detection and mitigation techniques. It also discusses the safety considerations, as considering how the steam industry has handled safety issues could offer some guidance for ensuring safety. Complexity in such systems also causes some of the worst side effects from the quality auditor's perspective. While failures in the software are hard to predict, one of the most significant ways of showing preparedness is practicing software resilience. New mitigation areas, such as the fragility spectrum and failure obviation, and their usage for building a safer system are analyzed. Also discussed are various architecture styles in practice and the dramatic effect human factors can have on the success of the software being developed.

Matrix multiplication is probably one of the most basic and important operations having a wide range of applications in studying Linear algebra. We will be primarily focused on reviewing different algorithms for the multiplication of two n×n matrices. The most Naive method has a complexity of O(n3) but interestingly, algorithms with better complexity have been achieved. We will get to see how the complexity can be improved further, occasionally giving a survey.

In order to understand the evolution of multicellularity, we must understand how and why selection favors the first steps in this process: the evolution of simple multicellular groups. Multicellularity has evolved many times in independent lineages with fundamentally different ecologies, yet no work has yet systematically examined these diverse selective drivers. Here we review recent developments in systematics, comparative biology, paleontology, synthetic biology, theory, and experimental evolution, highlighting ten selective drivers of simple multicellularity. Our survey highlights the many ecological opportunities available for simple multicellularity, and stresses the need for additional work examining how these first steps impact the subsequent evolution of complex multicellularity.

Multichannel EEGs were obtained from healthy participants in the eyes-closed no-task condition (where the alpha component is typically abolished). EEG dynamics in the two conditions were quantified with two related binary Lempel-Ziv measures of the first principal component and with three measures of integrated information including the more recently proposed integrated synergy. Both integrated information and integrated synergy with model order p=1 had greater values in the eyes closed condition. If the model order of integrated synergy was determined with the Bayesian Information Criterion, this pattern was reversed, and in common with other measures, integrated synergy was greater in the eyes open condition. Eyes open versus eyes closed separation was quantified by calculation of the between-condition effect size. Lempel-Ziv complexity of the first principal component showed greater separation than the measures of integrated information. The performance of the integrated information measures investigated here when distinguishing between indisputably different physiological states encourages caution when advocating for their use as measures of consciousness.

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.

Self-organized criticality (SOC) is a universal mechanism for self-sustained critical behavior in large-scale systems evolving outside equilibrium. Our report explores a tentative link between SOC and Lagrangian field theory, with the long-term goal of bridging the gap between complex dynamics and the non-perturbative behavior of quantum fields.

As shown earlier, the algorithmic complexity, like Shannon information and Boltzmann entropy, tends to increase in accordance with the general law of complification. However, the algorithmic complexity of most material systems does not reach its maximum, i.e. chaotic state, due to the various laws of nature that create certain structures. The complexity of such structures is very different from the algorithmic complexity, and we intuitively feel that its maximal value should be somewhere between order and chaos. I propose a formula for calculation such structural complexity, which can be called - structuredness. The structuredness of any material system is determined by structures of three main types: stable, dissipative, and post-dissipative. The latter are defined as stable structures created by dissipative ones, directly or indirectly. Post-dissipative structures, as well as stable, can exist for an unlimited time, but at the micro level only, without energy influx. The appearance of such structures leads to the “ratchet” process, which determines the structuregenesis in non-living and, especially, in living systems. This process allows systems with post-dissipative structures to develop in the direction of maximum structuring due to the gradual accumulation of these structures, even when such structuring contradicts the general law of complification.

We evaluate the complexity of Colombian climate from extreme behavior of gauge temperature and precipitation, using the the novel Tsallis' non-extensive entropy principle based on physical information through the q-index. We find the spatial structure of non additive universal categories (q-index) and compare with some complex systems with the potential to have some degree of dynamical affinity. Our results evidence the great dynamical variability of regional climate expressed in the large range of values of $q$-index, and the high degree of non-extensitivity for both temperature and precipitation.

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.

This paper addresses the grammatical challenges associated with the development of clause complexity, focusing on the performance of a group of monolingual Spanish-speaking schoolchildren with Specific Language Impairment/Developmental Language Disorder (SLI/DLD) in a longitudinal corpus of oral narrative samples. The study examines the presence of interclause relations of subordination and equivalence (hypotaxis and parataxis) in language samples of two groups: an experimental group made up of 24 schoolchildren with SLI/DLD and a control group made up of 24 schoolchildren with typical development (TD). The results show that while both groups use parataxis as the most common relation between clauses in all school grades, there is a significant decrease in paratactic relations and a significant increase in hypotactic relations from first to fourth grade of primary education. Although the development patterns are highly similar, the SLI/DLD group shows greater difficulties in mastering more complex (hypotactic) relations in fourth grade compared to the control group, indicating that they are less sophisticated in the use of these types of complex relations. These findings suggest that focused support on the most complex structures is needed towards the fourth grade of primary education, given the demands of the school academic register from 6 and 7 years of age, and the potential problems that the development of clause complexity can cause in school-age children.

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.

This article provides an overview of multi-fidelity modeling trends. Fidelity in modeling refers to the level of detail and accuracy provided by a predictive model or simulation. Generally, models with higher fidelity deliver more precise results but demand greater computational resources. Multi-fidelity models integrate high-fidelity and low-fidelity models to obtain fast yet accurate predictions. Their growing popularity is due to their ability to approximate high-fidelity models with high accuracy and low computational cost. This work classifies publications in multi-fidelity modeling based on various factors, including application, surrogate selection, fidelity difference, fidelity combination method, field of application, and year of publication. The study also examines the techniques used to combine fidelities, focusing on multi-fidelity surrogate models. To accurately evaluate the advantages of utilizing multi-fidelity models, it is necessary to report the achieved time savings. This paper includes guidelines for authors to present their multi-fidelity-related savings in a standard, succinct, yet thorough way to guide future users. According to a select group of publications that provided sufficient information, multi-fidelity models achieved savings of up to 90% while maintaining the desired level of accuracy. However, the savings achieved through multi-fidelity models depend highly on the problem.

Care coordination (CC) for children with special healthcare needs and medical complexity (CSHCN-CMC) is challenging, and medication management is especially difficult for providers, parents/caregivers, and patients alike. While numerous strategies for CC have been suggested and implemented, barriers to medication optimization remain. The report describes the creation of a pediatric clinical pharmacotherapy practice, related standard operating procedures to assure consistent application of screening tools and care provision through comprehensive medication management (CMM), and establishment of a collaborative practice agreement (CPA) to guide drug therapy delegation, monitoring, and modification. The methodology of a prospective case series is also presented to highlight drug therapy problems and their resolution in CSHCN-CMC. Future opportunities to expand the practice for engagement in population health management as well as prior authorization activities on behalf of physicians will be discussed.

Finding the key factor and possible "Newton's laws" in financial markets has remained the central issue in this area. However, with the development of information and communication technologies, financial models are becoming more and more realistic but complex which is contradictory to the objective law “Greatest truths are the simplest”. Therefore, this paper attempts to discover the most critical parameter and establishes an evolutionary model which is independent of micro features. In the model, information is the only key factor and stock price is the emergence of the collective behavior. The statistical properties of the model are significantly similar to the real market. It also explains the correlations of stocks within an industry, which provide a new idea for the study of key factors and core structures in the financial market.

This paper has examined the effect of economic complexity on poverty in developing countries. The analysis has used a sample of 84 countries over the period 1980-2017. Results indicate that greater economic complexity results in lower poverty headcount rates. This is particularly the case for countries that enjoy higher economic growth rates, lower levels of income inequality and lower degrees of economic growth volatility, including due to lower sizes of export demand and financial flows shocks. These findings have important policy implications for developing countries that are exploring ways and means to recover from the current COVID-19 pandemic crisis, and prepare for future crises.

This study presents an analysis of the spatial and temporal distribution of the two large destructive earthquakes that occurred in Lake Van area on October 23, and November 9, 2011, together with the azimuth-dependent distribution of the seismic activity and microseismicity clusters after the mainshocks, associated with the complex rupture processes of their aftershock sequence. The sequence began with the magnitude Mw 7.1 earthquake of 23 October and a second destructive earthquake of Mw 5.6. The aftershock sequences of the two mainshocks were linked to the local crustal faults beneath Lake Van area, followed successively and produced unusually intense activity and significant damage in the area. The main purposes of this study are to document the spatial and temporal distribution and evolution of the October 23, 2011 aftershock hypocenters and the azimuth-dependent distribution of seismic activity, and to understand the spatial and temporal character of the aftershock sequence using the distributional and evolutional patterns of the aftershock hypocenters. A total of 10,000 aftershocks were obtained from seismic data with a high signal-to-noise ratio over collected over three years from October 23, 2011 to March 2014. These aftershocks were plotted for the time periods from November 2011 through March 2012 to March 2014 and ≈ 5000 aftershocks were retained in the depth versus distance cross-sections to detect the clusters in the first step of study (November 2011–March 2012). The focal depth distribution of the aftershock clusters, the migration of hypocenter activity and microseismicity clusters were analyzed and the distributional patterns of the detected clusters were assessed using the geometric distribution of the aftershock hypocenters. The spatial and temporal distribution of aftershocks reveal interesting key features of the deep rupture complexity of the Van earthquake: (1) most prominent aftershocks have been located in the upper crust at depths shallower than 10 km beneath ruptured area, indicating that the upper crust is brittle and seismogenic; (2) two spatial clusters have been detected at 8-10 km depths and the upward extrapolation of these clusters intersects with faults; the main cluster (60 km wide) bounded by inferred reverse faults (f3 and f4) and the central cluster (25–30 km wide) bounded by faults (f1 and f2); (3) these spatial clusters form the largest volumetric pattern of the conical-shaped cluster at depths of about 25–30 km of the azimuth-dependent rotational projections, suggesting azimuthal distributions of deep rupture characteristics; and (4) the strongest temporal cluster of microseismicity derived from temporal distribution of aftershocks has been detected within an area of about 2.5–3.0 km² and it is spatially observed at 20 km depth within the central cluster, suggesting progressive failure of the adjacent patches of possible fault.

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.

In this study, our primary objective was to analyze the tradeoff between accuracy and complexity in machine learning models, with a specific focus on the impact of reducing complexity and entropy on the production of landslide susceptibility maps. We aimed to investigate how simplifying the model and reducing entropy can affect the capture of complex patterns in the susceptibility maps. To achieve this, we conducted a comprehensive evaluation of various machine-learning algorithms for classification tasks. We compared the performance of these algorithms in terms of accuracy and complexity, considering both "before" and "after" scenarios of dimensionality reduction using Principal Component Analysis (PCA). Our findings revealed that reducing complexity and lowering entropy can lead to an increase in model accuracy. However, we also observed that this reduction in complexity comes at the cost of losing important complex patterns in the produced landslide susceptibility maps. By simplifying the model and reducing entropy, certain intricate relationships and uncertain patterns may be overlooked, resulting in a loss of information and potentially compromising the accuracy of the susceptibility maps. The analysis encompassed a diverse range of machine learning algorithms, including Random Forest (RF), Extra Trees (EXT), XGboost, LightGBM, Catboost, Naive Bayes (NB), K-Nearest Neighbors (KNN), Gradient Boosting Machine (GBM), and Decision Trees (DT). Each algorithm was evaluated for its strengths and limitations, considering the tradeoff between accuracy and complexity. Before dimensionality reduction, the algorithms demonstrated promising results, with RF exhibiting excellent AUC/ROC scores and average accuracy. However, computational costs were noted as a potential drawback for RF, especially when dealing with large datasets. EXT showcased robust performance and good accuracy, while XGboost demonstrated its ability to handle complex relationships within large datasets, albeit requiring careful hyperparameter tuning. The efficiency and scalability of LightGBM made it a suitable choice for large datasets, although it displayed sensitivity to class imbalance. Catboost excelled in handling categorical features, but longer training times were observed for larger datasets. NB showcased simplicity and computational efficiency but assumed independence among features. KNN, known for its capability to capture local patterns and spatial relationships, was found to be sensitive to the choice of distance metric. GBM, while capturing complex relationships effectively, was prone to overfitting without proper regularization. DT, with its interpretability and ease of understanding, faced limitations in terms of overfitting and limited generalization. After dimensionality reduction, certain algorithms exhibited improvements in their AUC/ROC scores and average accuracy, including RF, EXT, XGboost, and LightGBM. However, for a few algorithms, such as NB and DT, a decrease in performance was observed. This study provides valuable insights into the performance characteristics, strengths, and limitations of various machine learning algorithms in classification tasks. Researchers and practitioners can utilize these findings to make informed decisions when selecting algorithms for their specific datasets and requirements. We also aim to identify the potential factors contributing to the high accuracy rates obtained from these ensembled algorithms and explore possible shortcomings of non-ensembled algorithms that may result in lower accuracy rates. By conducting a comprehensive analysis of these algorithms, we seek to provide valuable insights into the benefits and limitations of ensembled approaches for landslide susceptibility mapping. Our study sheds light on the challenges faced when balancing accuracy and complexity in machine learning models for landslide susceptibility mapping. It emphasizes the importance of carefully considering the level of complexity and entropy reduction in relation to the specific patterns and uncertainties present in the data. By providing insights into this tradeoff, our research aims to assist researchers and practitioners in making informed decisions regarding model complexity and entropy reduction, ultimately improving the quality and interpretability of landslide susceptibility maps.

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.

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.

High-entropy alloys (HEAs) are of great interest in the field of materials science and engineering. Unlike conventional alloys, which contain a maximum of two base metals, this new category of materials consists of multi-principle elements and the possible number of alloy compositions, in case of HEAs, is outstandingly higher than that for conventional alloys. Here, a review on the high-entropy alloys, has been provided, on the issue whether the earliest definition of High- Entropy alloys, proposed in 2004^{[2, 4]}, is consistent with one of the four-component equiatomic Compositionally complex alloys exhibiting a “High-entropy” effect.

The maximization of entropy S within a closed system is accepted as an inevitability (as the second law of thermodynamics) by statistical inference alone. The Maximum Entropy Production Principle (MEPP) states that not only S maximizes, but $\dot{S}$ as well: a system will dissipate as fast as possible. There is still no consensus on the general validity of this MEPP, even though it shows remarkable explanatory power (both qualitatively and quantitatively), and has been empirically demonstrated for many domains. In this theoretical paper I provide a generalization of entropy gradients, to show that the MEPP actually follows from the same statistical inference, as that of the 2nd law of thermodynamics. For this generalization I only use the concepts of super-statespaces and microstate-density. These concepts also allow for the abstraction of 'Self Organizing Criticality' to a bifurcating local difference in this density, and allow for a generalization of the fundamentally unresolved concepts of 'chaos' and 'order'.

Capturing complexity is both a conceptual and a practical challenge in palliative care. The HexCom model has proved to be an instrument with strong reliability and valid for describing the needs and strengths of patients in home care. In order to explore whether it is also perceived to be helpful in enhancing coordinated and patient-centered care at a practical level, a methodological study was carried out to assess the face validity of the model. Particularly, a Delphi method involving a group of 15 experts representing the full spectrum of healthcare professionals involved in palliative care was carried out. The results show that there is a high level of agreement, with a Content Validity Index-Item greater than 0.92 both with regard to the complexity model and the HexCom-Red, HexCom-Basic and HexCom-Clin instruments, and higher than 0.85 regarding the HexCom-Figure and the HexCom-Patient instruments. This consensus confirms that the HexCom model and the different instruments that are derived from it are valued as useful tools for a broad range of healthcare professional in coordinately capturing of complexity in healthcare practice.

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 basic challenges of this work are twofold: demonstrating the dependence between the functional and topological qualities of partition networks and finding the simplest—with respect to algorithmic complexity—network elements. The study of these problems is based on finding the solution to an appropriate antagonistic vertex game. The results of the numerical simulations of antagonistic partition games demonstrate that the winner’s graphs are “almost always” dense and hyperenergetic compared to the loser’s graphs. These observations reveal that successful evolutionary mechanisms can be realized, in principle, by the simplest objects (such as viruses).

Recent expansion in data sharing has created unprecedented opportunities to explore structure-function linkages in ecosystems across spatial and temporal scales. However, characteristics of the same data product, such as resolution, can change over time or spatial locations, as protocols are adapted to new technology or conditions, which may impact the data’s potential utility and accuracy for addressing end user scientific questions. The National Ecological Observatory Network (NEON) provides data products for users from 81 sites and over a planned 30-year time frame, including discrete return Light Detection and Range (LiDAR) from an airborne observatory platform. LiDAR is a well-established and increasingly available remote sensing technology for measuring three-dimensional (3D) characteristics of ecosystem and landscape structure, including forest structural diversity. The LiDAR product that NEON provides can vary in point density from 2 – 25+ points/m² depending on instrument and acquisition date. We used NEON LiDAR from five forested sites to (1) identify the minimum point density at which structural diversity metrics can be robustly estimated across forested sites from different ecoclimatic zones in the USA and (2) to test the effects of variable point density on the estimation of a suite of structural diversity metrics and multivariate structural complexity types within and across forested sites. Twelve out of sixteen structural diversity metrics were sensitive to LiDAR point density in at least one of the five NEON forested sites. The minimum point density to reliably estimate the metrics ranged from 2.0 to 7.5 pt/m^2, but our results indicate that point densities above 7-8 pt/m² should provide robust measurements of structural diversity in forests for temporal or spatial comparisons. The delineation of multivariate structural complexity types from a suite of 16 structural diversity metrics was robust within sites and across forest types for a LiDAR point density of 4 pt/m² and above. This study shows that different metrics of structural diversity can vary in their sensitivity to the resolution of LiDAR data and users of these open-source data products should consider the point density of their data and use caution in metric selection when making spatial or temporal comparisons from these datasets.

Recently in various theoretical works, path-breaking progress has been made in recovering the well-known Page Curve of an evaporating black hole with Quantum Extremal Islands, proposed to solve the long-standing black hole information loss problem related to the unitarity issue. Motivated by this concept, in this paper, we study cosmological circuit complexity in the presence (or absence) of Quantum Extremal Islands in negative (or positive) Cosmological Constant with radiation in the background of Friedmann-Lemaî tre-Robertson-Walker (FLRW) space-time. Without using any explicit details of any gravity model, we study the behaviour of the circuit complexity function with respect to the dynamical cosmological solution for the scale factors for the above mentioned two situations in FLRW space-time using squeezed state formalism. By studying the cosmological circuit complexity, Out-of-Time Ordered Correlators, and entanglement entropy of the modes of the squeezed state, in different parameter space, we conclude the non-universality of these measures. Their remarkably different features in the different parameter space suggests their dependence on the parameters of the model under consideration.

The notion of hierarchy is a key characteristic of any complex system. This paper explores which notions of hierarchy are being used in the field of management and organization studies. Four distinct types of hierarchy are identified: a ladder of formal decision-making authority, a ladder of achieved status, a self-organized ladder of responsibility, and an ideology-based ladder. A social mechanism-based perspective serves to define and distinguish these four types. Subsequently, the typology is further developed by comparing the four hierarchy types in terms of their tacit/explicitness, (in)transitivity, and behavior- versus cognition-centeredness. This review article contributes to the literature by dissecting the general metaphor of hierarchy into four different constructs and their social mechanisms, which serves to create a typology of the various ways in which complex systems can be characterized as being hierarchical. This typology can inform future research drawing on any type of hierarchy.

This work presents some characteristics of MoNet, a computerized platform for the modeling and visualization of complex systems. Emphasis is on the ideas that allowed the successful progressive development of this modeling platform, which goes along with the implementation of applications to the modeling of several studied systems. The platform has the capacity to represent different aspects of systems modeled at different observation scales. This tool offers advantages in the sense of favoring the perception of the phenomenon of the emergence of information, associated with changes of scale. Some criteria used for the construction of this modeling platform are included. The power of current computers has made practical representing graphic resources such as shapes, line thickness, overlaying-text tags, colors and transparencies, in the graphical modeling of systems made up of many elements. By visualizing diagrams conveniently designed to highlight contrasts, these modeling platforms allow the recognition of patterns that drive our understanding of systems and their structure. Graphs that reflect the benefits of the tool regarding the visualization of systems at different scales of observation are presented to illustrate the application of the platform.

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.

Self-organized criticality (SOC) is a celebrated paradigm from the 90’s for understanding dynamical systems naturally driven to its critical point, where the power-law dynamics taking place make predictions practically impossible, such as in stock prices, earthquakes, pandemics and many other problems in science related to phase transitions. Shortly thereafter, it was realized that traffic flow might be in the SOC category, implying that conventional traffic management strategies seeking to maximize the local flows can become detrimental. This paper shows that the Kinematic Wave model with triangular fundamental diagram, and many other related traffic models, indeed exhibit SOC, thanks in part to the fractal nature of traffic exposed here on the one hand, and our need to get to our destinations as soon as possible, on the other hand. Important implications for congestion management of traffic near the critical region are discussed, such as: (i) Jam sizes obey a power-law distribution with exponent 1/2, implying that both its mean and variance become ill-defined and therefore impossible to estimate. (ii) Traffic in the critical region is chaotic in the sense that predictions becomes extremely sensitive to initial conditions. (iii) However, aggregate measures of performance such as delays and average speeds are not heavy tailed, and can be characterized exactly by different scalings of the Airy distribution, (iv) Traffic state time-space “heat maps” are self-affine fractals where the basic unit is a triangle, in the shape of the fundamental diagram, containing 3 traffic states: voids, capacity and jams. This fractal nature of traffic flow calls for analysis methods currently not used in our field.

The issue of workplace toxicity constitutes a major problem for employers, employees and society at large. Toxicity in a workplace context relates to damaging behaviours perpetrated by individuals and organisations that netatively impact on the health and wellbeing of others. Workplace toxicty is habitually associated with activities such as bullying, harrassment, unethical and even illegal acts. In this article, today’s workplace is likenened to a cage where ambition and greed drive people to engage in toxic behaviour to fight for whatever scarce rewards are on offer. Set against a backdrop of continuous demands on employees in a era of constant change and challenge, leadership practice in the 21st century is understandably seeped in complexity. Whilst conditions of scarcity are in fact constructed by employers in today’s lean environments, workplace toxicity has significant implications for organisational leaders in terms of work place disputes, absenteeism and litigation etc. Twentieth century hierarchial and autocratic leadership models are now deemed to be both obsolete and wholly inadedgate to inform leadership practice in the knowledge era. This conceptual article looks at the efficacy of complexity leadership theory (CLT) in empowering today’s leader to better understand and address 21st century workplace toxicity.