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

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.

I present a personal account of self-organizing systems. As such, it is necessarily biased and partial. Nevertheless, it should be useful to motivate useful discussions. The relevant contribution is not my attempts at answering questions (maybe all my answers are wrong), but the steps towards framing relevant questions to better understand self-organization, information, complexity, and emergence. With this aim, I start with a notion and examples of self-organizing systems (what?), continue with their properties and related concepts (how?), and close with applications (why?).

The scientific fields of complexity, artificial life (ALife), and artificial intelligence (A.I.) share commonalities: historic, conceptual, methodological, and philosophical. Although their origins trace back to the 1940s birth of cybernetics, they were only able to properly develop as modern information technology became available. In this perspective, I offer a personal (and thus biased) account of the expectations and limitations of these fields, some of which have their roots in the limits of formal systems. I will use interactions, self-organization, emergence, and balance to compare different aspects of complexity, ALife, and A.I. Even when the trajectory of the paper is influenced by my personal experience, the general questions posed (which outweigh the answers) hopefully will be useful to align efforts in these fields toward overcoming --- or accepting --- their limits.

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

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.

This study explores the potential trajectories of human civilization influenced by the development and competition of advanced artificial intelligence (AI) systems. Using a system of stochastic partial differential equations (SPDEs), we model the probability density function representing the state of civilization in a phase space defined by prosperity and knowledge. The model incorporates diffusion, growth, saturation, and drift terms, alongside stochastic noise to reflect the uncertainties and random fluctuations in AI impacts.The simulation results are visualized in a probability density graph, revealing the likelihood of various outcomes ranging from extinction and regression, to prosperity and technological advancement. The analysis highlights the balanced prospects of human future, with significant probabilities in both positive and negative directions. Positive scenarios suggest potential for increased prosperity and knowledge, emphasizing the importance of effective AI management and international cooperation. Conversely, the notable risks of regression and extinction underline the need for strategic interventions to mitigate adverse impacts. Our findings stress the stochastic nature of future developments and the critical role of adaptive and flexible policies in steering human civilization towards favorable outcomes. This study provides a simple yet comprehensive framework for understanding the complex dynamics at play and underscores the importance of proactive strategies in the age of AI.

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

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.

The P versus NP problem is a fundamental question in computer science. It asks whether problems whose solutions can be quickly verified can also be quickly solved. Here, "quickly" refers to computational time that grows proportionally to the size of the input (polynomial time). While the problem's roots trace back to a 1955 letter from John Nash, its formalization is attributed to Stephen Cook and Leonid Levin. Despite extensive research, a definitive answer remains elusive. Closely tied to this is the concept of NP-completeness. If a single NP-complete problem could be solved efficiently, it would imply that all problems in NP can be solved efficiently, proving that P equals NP. This work posits that MONOTONE ONE-IN-THREE 3SAT, a notoriously difficult NP-complete problem, can be solved efficiently, thereby establishing the equivalence of P and NP.

In this work, several random Boolean networks (RBN) are generated and analyzed from two characteristics: their time evolution diagram and their transition diagram. To do this, its randomness is estimated using three measures, of which Algorithmic Complexity is the only one capable of both a) revealing transitions towards the chaotic regime, and b) disclosing the algorithmic contribution of certain states to the transition diagram and their relationship with the order they occupy in the temporal evolution of the respective RBN. The results obtained from both types of analysis are useful for the introduction of both Algorithmic Complexity and Perturbation Analysis in the context of Boolean networks, and their potential applications in regulatory network models.

The paper describes schemes for the resource-efficient generation of twiddle factors for the fixed-radix version of the ubiquitous fast Fourier transform (FFT) algorithm. The schemes, which are targeted at a parallel implementation of the FFT, provide one with the facility for trading off arithmetic complexity, as expressed in terms of the required numbers of multiplications and additions (or subtractions), against the memory requirement, as expressed in terms of the amount of random access memory (RAM) required for constructing the look-up tables (LUTs) needed for the storage of the two twiddle factor components – one component being derived from the sine function and the other from the cosine function. Examples are provided which illustrate the advantages and disadvantages of each scheme – which are very much dependent upon the length of the FFT to be computed – for both the single-level and multi-level LUTs, highlighting those situations where their adoption might be most appropriate. More specifically, it is seen that the adoption of a multi‑level LUT scheme may be used to facilitate significant reductions in memory – namely, from an O(N) to an memory requirement, for the case of an N‑point FFT, where β ≥ 2 corresponds to the number of distinct angular resolutions used – at a relatively small cost in terms of increased FFT latency and arithmetic complexity.

The phenomenon of emergence in complex systems is vividly exemplified by the coordinated behaviors of ant colonies, where apparent chaos evolves into order. This article delves into the essence of complexity and emergence through interdisciplinary research spanning biology, computer science, and information theory. It begins by examining the foundational principles of swarm intelligence, revealing how simple ant behaviors culminate in sophisticated collective intelligence. The discussion then transitions to the philosophical dimensions of emergent phenomena and the principles of self-organization that underpin systemic order. Key concepts such as ant colony optimization algorithms and stigmergy are synthesized, highlighting their relevance in both natural and artificial systems. The broader societal implications are considered through the lens of collective intelligence, drawing parallels between ant colonies and human social structures. Complementary online resources and multimedia content enrich the narrative, providing accessible insights and dynamic representations of ant intelligence. This convergence of diverse perspectives underscores the remarkable capacity for simplicity to generate complexity, culminating in a profound understanding of collective wisdom.

This article explores the intricate dynamics of complexity and emergence through the lens of a graphical model representing hippocampal functions. Utilizing a series of overlapping curves that intersect at varying degrees and frequencies, we create a visual metaphor for the sophisticated processes to store information observed in the hippocampus. This model not only depicts the spatial and frequency-related interactions of these curves but also illustrates the emergent patterns that arise from these interactions. These patterns exemplify the principles of complexity and emergence, where the collective behavior of simple elements results in intricate and unexpected outcomes. This graphical representation serves as a bridge between the abstract mathematical concepts of complexity theory and the tangible biological processes observed in neuroscience. By drawing parallels to the hippocampus, known for its role in memory formation and spatial navigation, the article sheds light on how complex systems, such as neural networks, exhibit properties that are more than just the sum of their parts. The model thus offers a unique perspective on understanding complex systems, not only in neuroscience but in broader scientific inquiries where complexity and emergent phenomena are pivotal.

This is a study on fractals existing in music. The application case is the composition DIAPHONIES of Michael Paouris. Sliding-window fractal analysis indicate areas of continuous fractality dipped in non-fractal areas of possibly deterministic and stochastic nature. Diverging cases of pronounced non-fractal areas are addressed and also areas of mixed fractality and non-fractality. Many segments exhibit persistency-P (2

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

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.

P versus NP is considered as one of the most fundamental open problems in computer science. This consists in knowing the answer of the following question: Is P equal to NP? It was essentially mentioned in 1955 from a letter written by John Nash to the United States National Security Agency. However, a precise statement of the P versus NP problem was introduced independently by Stephen Cook and Leonid Levin. Since that date, all efforts to find a proof for this problem have failed. Another major complexity class is NP-complete. It is well-known that P is equal to NP under the assumption of the existence of a polynomial time algorithm for some NP-complete. We show that the Monotone Weighted Xor 2-satisfiability problem (MWX2SAT) is NP-complete and P at the same time. Certainly, we make a polynomial time reduction from every directed graph and positive integer k in the K-CLOSURE problem to an instance of MWX2SAT. In this way, we show that MWX2SAT is also an NP-complete problem. Moreover, we create and implement a polynomial time algorithm which decides the instances of MWX2SAT. Consequently, we prove that P = NP.

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.

The P versus NP problem is a cornerstone of theoretical computer science, asking whether problems that are easy to check are also easy to solve. "Easy" here means solvable in polynomial time, where the computation time grows proportionally to the input size. While this problem's origins can be traced to John Nash's 1955 letter, its formalization is credited to Stephen Cook and Leonid Levin. Despite decades of research, a definitive answer remains elusive. Central to this question is the concept of NP-completeness. If even one NP-complete problem could be solved efficiently, it would imply that all problems in NP could be solved efficiently, proving P equals NP. This research proposes that EXACT CLOSURE, a notoriously difficult NP-complete problem, can be solved efficiently, thereby potentially establishing the equivalence of P and NP. This work is an expansion and refinement of the article "Note for the P versus NP problem", published in IPI Letters.

Using assembly theory of strings of any natural radix $b$ we find some of their salient regularities. In particular, we show that the upper bound of the assembly index depends quantitatively on the radix $b$ and the longest length $N$ of a string that has the assembly index of $N-k$ is given by $N_{(N-k)}=b^2+b+3k-2$ for $k=\{1,2\}$ and by $N_{(N-3)}=b^2+b+6$. We also provide particular forms of such strings. Knowing the latter bound we conjecture that the maximum assembly index of a string of length $N>N_{(N-2)}$ is given by $a_{\text{max}}^{(N,b)} = \lfloor N/2 \rfloor + b(b+1)/2$. For $k=1$ such odd length strings are nearly balanced and there are four such different strings if $b=2$ and seventy-two if $b=3$. We also show that a string containing $k$ copies of an $n$-plet has the assembly index of at most $N-1 - (n-1)k - a$, where $a$ is the assembly index of this $n$-plet. Finally, we show that the assembly depth of a minimum assembly index string is equal to the assembly index of this string, while the assembly depth of a maximum assembly index string has a value between $\left\lceil \log_2(N) \right\rceil$ and the assembly index of this string. Since these results are also valid for $b=1$, assembly theory subsumes information theory.

We study L_2-approximation problems in the weighted Hilbert spaces in the worst case setting. Three interesting weighted Hilbert spaces appear in this paper, whose weights are equipped with two positive parameters $\ga_j$ and $\az_j$ for $j=1,\,2,\dots,\,d$. We consider the worst case error of algorithms that use finitely many arbitrary continuous linear functionals. We discuss the exponential convergence-(t,s)-weak tractability (EC-(t,s)-WT) of these L_2-approximation problems under the absolute or normalized error criterion. In particular, we obtain the sufficient and necessary conditions for EC-(1,1)-WT and EC-(t,1)-WT with t

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

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

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.

The argument of this article is threefold. First, the article argues that, from its rise in the sixteenth century to our own time, the advancement of modern physics, as mathematical-experimental science, has been defined by the invention of new mathematical structures. Secondly, the article argues that quantum theory, specifically with quantum mechanics, gave this thesis a radically new meaning by virtue of the following two features: one the one hand, quantum phenomena themselves are defined by purely physical features, as essentially different from all previous physics; and on the other, quantum mechanics and quantum field theory are defined by purely mathematical postulates, which connect them to quantum phenomena strictly in terms of probabilities, without representing or otherwise relating to how these phenomena physically come about. While these two features may appear discordant, if not inconsistent, I argue that they are in accord with each other, at least in certain interpretations (including the one adopted here), designated as “reality without realism,” RWR, interpretations. This argument allows this article to offer a new perspective on a thorny problem of the relationships between continuity and discontinuity in quantum physics. In particular, rather than being concern only with the discreteness and continuity of quantum objects or phenomena, quantum mechanics and quantum field theory relate their continuous mathematics to the irreducibly discrete quantum phenomena, in terms of probabilistic predictions, while, at least in RWR interpretations, precluding a representation or even conception of how these phenomena come about. This subject is rarely, if ever discussed, apart from previous work by the present author. It will, however, be given a new dimension in this article which introduces, as one of its main contributions, a new principle: the mathematical complexity principle.

The human brain, a highly complex dynamical system, exhibits various states of consciousness—such as wakefulness, sleep, and altered states—each characterized by distinct patterns of neural activity. To capture the dynamical properties of these states, a range of complexity measures is utilized, with a primary focus on Statistical Complexity (SC) and Lempel-Ziv complexity (LZc), and supplemented by Approximate Entropy (ApEn) and Kolmogorov Complexity (KC). These measures are applied to both simulated data, generated through logistic maps and Multivariate Autoregressive (MVAR) models, and intracranial depth electrode recordings from patients. The results demonstrate that these complexity measures effectively capture intricate dynamics of the brain across different states. Specifically, SC captures the structural complexity and information processing within the system, reflecting organized and predictive neural behavior by accounting for temporal correlations in the data. In contrast, LZc is more sensitive to randomness, measuring the diversity and unpredictability of patterns within the data. This distinction allows SC to serve as a more reliable indicator of organized information processing, while LZc highlights the variability in neural signals. Notably, the study reveals that states of higher consciousness are associated with greater complexity, supporting the entropic brain hypothesis. This research contributes to the ongoing efforts to quantify consciousness through mathematical frameworks and offers insights into the neural correlates of different states of awareness.

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

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.

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

Complexity of care, adequate staffing levels, and workflow are key factors affecting nurses’ workloads. Clinical complexity classification and related staffing adjustment remain notable gaps in the current evidence limiting the capacity for optimal staffing practices. This study aimed to adapt and validate the WANNNT-SC to the Italian context to allow the assessment of newborns admitted to the NICUs. To evaluate the reliability of the tool among different profes-sionals, a correlation test was performed using Pearson’s correlation, which resulted in a strong correlation (r = 0.967, p = 0.01). In the test-retest phase, there was a significant correlation (r = 0.910 and p = 0.01). Using an analysis of variance, we found that the higher the I-WANNNT-SC score, the higher the predicted death rate (F = 13.05 and p < 0.001). The Italian Winnipeg Surgical Complex Assessment of Neonatal Nursing Needs Tool represents the first tool available for the Italian context that aims to measure the nursing workload in neonatal intensive care. It could allow adjustments in nursing staffing based on NICU activities and patient needs. This study was prospectively approved by the local Ethics Committee “Palermo 1” (Protocol CI-NICU-00).

Polar auxin transport (PAT) and auxin efflux carriers are known components controlling leaf complexity and venation patterns in some model plant species. Evidence indicates that PAT generates auxin converge points (CPs) that in turn lead to local leaf formation and internally into major vein formation. However, the role of PAT in more diverse leaf arrangements and vein patterns is largely unknown. We used pharmacological inhibition of PAT in developing pinnate tomato, trifoliate clover, palmate lupin, and bipinnate carrot leaves and observed dosage-dependent reduction to simple leaves in these eudicots. Leaf venation patterns changed from craspedodromous (clover, carrot), semi-craspedodromous (tomato) and brochidodromous (lupin) to more parallel patterning with PAT inhibition. The visualization of auxin responses in transgenic tomato plants showed that discrete and separate CPs in control plants were replaced by diffuse convergence areas near the margin. These effects indicate that PAT plays a universal role in the formation of different leaf and vein patterns in eudicot species via a mechanism that depends on the generation as well as separation of auxin CPs. Computer simulations indicate that variations in PAT can alter the number of CPs, corresponding leaf lobe formation and position of major leaf veins along the leaf margin in support of experimental results.

College students play an important role in higher education and future social life. Research has a significant impact on college students' self-efficacy. Taking college students in Chengdu, China as an example, this study adopts the fuzzy-set qualitative comparative analysis (fsQCA) method, comprehensively incorporating various influencing factors such as demographic characteristics, physical exercise behavior, and life satisfaction. From the perspective of physical exercise behavior and life satisfaction, an asymmetric causal model that affects college students' high self-efficacy is constructed. The research results support the main principles of complexity theory, confirming the heterogeneity and complexity of the antecedent conditions for high self-efficacy among college students. Nineteen causal condition combinations that can promote high self-efficacy among college students are obtained. This study conducts exploratory research on the introduction of complexity theory analysis into the study of college students' physical exercise, life satisfaction, and self-efficacy. It also provides a decision-making reference path for improving the life satisfaction, physical exercise behavior, and self-efficacy of college students.

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

The consequences of climate change and anthropogenic stressors, such as habitat loss and overexploitation, are threatening the subsistence of species and communities across the planet. Therefore, it is crucial to analyze the impact of environmental perturbations on the diversity, structure and function of ecosystems. In this work, in silico simulations of biodiversity loss were carried out on the marine food web of Caleta Potter (25 de Mayo Island, Antarctica) where global warming has caused critical changes in the abundance and distribution of benthic and pelagic communities during the last 30 years. We performed species removal considering their degree and trophic level and including four different thresholds on the occurrence of secondary extinctions. We examined the impact of extinctions on connectance, modularity and stability of the food web. We found different responses of these properties depending on the extinction criteria used, e.g., large increase in modularity and rapid decrease in stability when most-connected and relatively high-trophic level species were removed. Additionally, we studied the complexity-stability relationship of the food web founding two regimes: 1) high sensitivity to small perturbations suggesting that Potter Cove would be locally unstable, and 2) high persistence to long-range perturbations suggesting global stability of this ecosystem.

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.

We study multivariate $L_2$-approximation problem $\textrm{APP}_d$ defined over a Banach space in the average case setting. The space is equipped with a zero-mean Gaussian measure with weighted covariance kernel which depends on parameter sequences \texorpdfstring{$\a=\{\az_j\}_{j\in\N}$ and $\ba=\{\bz_j\}_{j\in\N}$}{} with $1 0$. In this paper two interesting weighted covariance kernels are considered, which model the importance of the covariance kernels. Under the absolute error criterion or the normalized error criterion, we discuss \texorpdfstring{$(s,t)$}{}-weak tractability of the \texorpdfstring{$L_2$}{}-approximation problem $\textrm{APP}=\{\textrm{APP}_d\}_{d\in\N}$ with the above two weighted covariance kernels for some positive numbers $s$ and $t$ in the average case setting, where \texorpdfstring{$(s,t)$}{}-weak tractability means that how the information complexity depends on $d$ and $\va^{-1}$ for large dimension $d$ and small threshold $\va$. In particular, for all $s>0$ and $t\in(0,1)$ we find the matching sufficient and necessary condition on the parameter sequences \texorpdfstring{$\a=\{\az_j\}_{j\in\N}$ and $\ba=\{\bz_j\}_{j\in\N}$}{} to obtain average case \texorpdfstring{$(s,t)$}{}-weak tractability under the absolute error criterion or the normalized error criterion.

Background and Aim: Patients with Type 2-diabetes condition tend to have multiple medications in various dosage which leads to complex medication regimens. Complexity of regimen results in poor adherence, uncontrolled glycemic value and treatment failure. The research aimed to investigate medication regimen complexity index, medication adherence, and impact of medication regimen complexity on glycemic control and medication adherence.Materials and Methods: A Crossectional Study methods was conducted at Bheri Hospital Nepalgunj, among 145 Diabetes patients. Medication adherence was assessed by using a General Medication Adherence Scale (GMAS Nep-Tool). Medication regimen complexity was assessed by using a Medication Regimen Complexity Index (MRCI) tool. Chi-square test, One-way ANOVA, Paired t-test, and binary logistic regression were used for inferential statistics. Results: This study shows that most of the participants were female and aged group 50-59 years. Hypertension was the most common comorbidity, followed by hypothyroidism. The majority of participants exhibited partial adherence 90 (62.1%) to their medication regimen. It was seen that medications prescribed for diabetes were more complex than non-diabetes medications (Mean±SD MRCI: 8.28±3.155 vs. 4.57±2.107). The negative correlation was seen with diabetes MRCI and medication adherence (r=-0.090). There was statistically significant association between diabetes MRCI and glycemic control, (p<0.05). Binary logistic regression revealed that females had lower odds of high MRCI compared to males ( multivariate p-value: 0.014, AOR: 0.403, 95% CI: 0.195-0.832), while sedentary lifestyle showed high Diabetes MRCI (COR: 4.709, 95% CI: 0.962-23.05) and abnormal BMI were associated with higher MRCI (binary p-value: 0.067, COR: 2.30, 95% CI: 0.942-5.65; multivariate p-value: 0.092, AOR: 2.323, 95% CI: 0.878-5.67). Conclusion: Diabetes medications are more complex, reducing adherence and worsening A1C outcomes. Simplifying regimens improves results, with MRCI being valuable for healthcare providers. The medication adherence and therapeutic outcomes can be improved by the improved by the involvement of clinical pharmacist using MRCI.

Supply chain risk management (SCRM) is a critical aspect of contemporary business operations, necessitated by the complex and interconnected nature of global supply chains. This qualitative research delves into the intricacies of SCRM through in-depth interviews with industry experts, aiming to unravel the multifaceted nature of supply chain risks and the strategies employed for mitigation. Key themes emerged, including the diverse sources of risks encompassing operational, financial, environmental, and geopolitical factors, highlighting the need for a comprehensive approach to risk management. Challenges such as limited visibility, resource constraints, and organizational silos were identified, underscoring the importance of addressing these barriers to enhance SCRM effectiveness. Strategies for risk mitigation encompassed technological investments for enhanced visibility and predictive capabilities, collaboration and information sharing among supply chain partners, and the integration of sustainability principles into risk management practices. Leadership, organizational culture, and continuous learning emerged as critical factors in driving effective SCRM practices, emphasizing the need for proactive and adaptable approaches to navigate evolving risks. Overall, this study contributes to the existing body of knowledge on SCRM by providing valuable insights for practitioners and academics, and underscores the importance of holistic and proactive approaches to enhance supply chain resilience and agility in today's dynamic business environment.

Chimeric antigen receptor (CAR) T-cell therapy has greatly improved outcomes for patients with relapsed or refractory hematological malignancies. However, challenges such as treatment resistance, relapse, and severe toxicity still hinder its widespread clinical application. Traditional transcriptome analysis has provided limited insights into the complex transcriptional landscape of both leukemia cells and engineered CAR-T cells, as well as their interactions within the tumor microenvironment. However, with the advent of single-cell sequencing techniques, a paradigm shift has occurred, providing robust tools to unravel the complexities of these factors. These techniques enable unbiased analysis of cellular heterogeneity and molecular patterns. These insights are invaluable for precise receptor design, guiding gene-based T cell modification, and optimizing manufacturing conditions. Consequently, this review utilizes modern single-cell sequencing techniques to clarify the transcriptional intricacies of leukemia cells and CAR-Ts. The aim of this manuscript is to discuss the potential mechanisms that contribute to the clinical failures of CAR-T immunotherapy. We will examine the biological characteristics of CAR-Ts, the mechanisms that govern clinical responses, and the intricacies of adverse events. By exploring these aspects, we hope to gain a deeper understanding of CAR-T therapy, which will ultimately lead to improved clinical outcomes and broader therapeutic applications.

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

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.