Ever since Varela and Maturana proposed the concept of autopoiesis as the minimal requirement for life, there has been a focus on cellular systems that erect topological boundaries to separate themselves from their surrounding environment. Here we reconsider whether the existence of such a spatial boundary is strictly necessary for self-producing entities. This work presents a novel computational model of a minimal autopoietic system inspired by dendrites and molecular dynamics simulations in three-dimensional space. A series of simulation experiments where the metabolic pathways of a particular autocatalytic set are successively inhibited until autocatalytic entities that could be considered autopoietic are produced. These entities maintain their distinctness in an environment containing multiple identical instances of the entities without the existence of a topological boundary. This gives rise to the concept of a metabolic boundary which manifests as emergent self-selection criteria for the processes of self-production without any need for unique identifiers. However, the adoption of such a boundary comes at a cost, as these autopoietic entities are less suited to their simulated environment than their autocatalytic counterparts. Finally, this work showcases a generalized metabolism-centered approach to the study of autopoiesis that can be applied to both physical and abstract systems alike.

This work presents a novel approach for the study of the movement of droplets on inclined surfaces under the influence of gravity and chemical heterogeneities. The developed numerical methodology uses data-driven modeling to extend the applicability limits of an analytically derived reduced-order model for the contact line velocity. More specifically, while the reduced-order model is able to capture the effects of the chemical heterogeneities to a satisfactory degree, it does not account for gravity. To alleviate this shortcoming, datasets generated from direct numerical simulations are used to train a data-driven model for the contact line velocity, which is based on the Fourier neural operator and corrects the reduced-order model predictions to match the reference solutions. This hybrid surrogate model, which comprises of both analytical and data-driven components, is then integrated in time to simulate the droplet movement, offering a speedup of five orders of magnitude compared to direct numerical simulations. The performance of this hybrid model is quantified and assessed in different wetting scenarios, by considering various inclination angles and values for the Bond number, demonstrating the accuracy of the predictions as long as the adopted parameters lie within the ranges considered in the training dataset.

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.

Warren Weaver, writing about the function that science should have in mankind’s developing future, ideas and ideals, proposed to classify scientific problems into ‘problems of simplicity’, ‘problems of disorganised complexity’, and ‘problems of organised complexity’ — the huge complementary class to which all biological, human, and social problems belong. Problems of simplicity have few components and variables and have been extensively addressed in the last 400 years. Problems of disorganised complexity have a huge number of individually erratic components and variables, but possess collective regularities that can be analysed by resourcing to stochastic methods. Yet, problems of organised complexity do not yield easily to classical or statistical treatment since interrelations among phenomenon elements change during its evolution alongside commonly used state variables, affecting behaviour and outcome. Moreover, organisation, the focal point in this complementary class, is still an elusive concept despite the gigantic efforts undertaken since a century ago to tame it. This paper addresses the description, representation and study of phenomena in the ‘problems of organised complexity’ class. Grounded on relational mathematical constructs, a theoretical framework providing operational definitions and schemes for formally modelling organisations and interaction of organisations is introduced. This framework extends the general systems’ concept and provides a novel perspective for addressing organised complexity phenomena as a collection of interacting organisations.

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

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

This paper's aim is to extend horizons in symbolic AI. The key to doing so is to establish a scientific basis for knowledge foundations, and specifically for the concept of meaning, and its computation. This led to the creation of the Meaning Computation AI (MCAI). Knowledge structures are at the heart of MCAI. The semantic triple chain, one of such structures, is the subject of this paper. This structure is the core of introducing computational semantic reasoning models across a variety of domains. To efficiently apply knowledge structures to create semantic reasoning applications MCAI contains a development framework consisting of four components. The first component stems from our discovery that knowledge is relational in nature. It can be expressed through implicit relations (which reflect meaning) and semantic relations (which describe how implicit relations act between entities). An algebraical apparatus for relational knowledge, specifically for implicit and semantic relations, represents the first component. Axiomatic models of relational domain ontologies and domain-oriented semantic reasoning models comprise the second and third components. The fourth component contains domain-oriented semantic reasoning engines.

The quiet-time solar wind electrons feature non-thermal characteristics when viewed from the perspective of their velocity distribution functions. They typically have an appearance of being composed of a denser thermal “core” population plus a tenuous energetic “halo” population. At first, such a feature was empirically fitted with the Kappa velocity space distribution function, but ever since the ground-breaking work by Tsallis, the space physics community has embraced the potential implication of the Kappa distribution as reflecting the non-extensive nature of the space plasma. From the viewpoint of microscopic plasma theory, the formation of non-thermal electron velocity distribution function can be interpreted in terms of the plasma being in a state of turbulent quasi equilibrium. Such a finding brings forth the possible existence of a profound inter-relationship between the non-extensive statistical state and the turbulent quasi-equilibrium state. The present paper further develops the idea of solar wind electrons being in the turbulent equilibrium, but unlike the previous model, which involves the electrostatic turbulence near the plasma oscillation frequency (i.e., Langmuir turbulence), the present paper considers the impact of transverse electromagnetic turbulence, particularly, the turbulence in the whistler-mode frequency range. It is found that the coupling of spontaneously-emitted thermal fluctuations and the background turbulence leads to the formation of non-thermal electron velocity distribution function of the type observed in the solar wind during quiet times. This demonstrates that the whistler-range turbulence represents an alternative mechanism for producing the Kappa-like non-thermal distribution, especially close to the Sun and in the near-Earth space environment.

This paper discusses about the quantum energy levels of muonic hydrogen considering only Coulomb interaction. The computational analysis in this paper will help the reader get a good understanding of how different a muonic hydrogen is from its electronic counterparts. Energy eigenvalues are calculated by numerical method and the probability density distribution of muon around the nucleus is plotted for different quantum states using special functions. The code is written in python. A comparative study of emission spectra between the muonic hydrogen and hydrogen has also been discussed.

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 this paper, the feasibility of automated and accurate in vivo measurements of vascular parameters continuously and non-invasively using ultrasound sensor is presented. Vascular parameters such as pulse wave velocity (PWV), blood pressure (BP), arterial compliance (AC) and stiffness index (SI) are affluent indicators of cardiovascular disorders and needs to be monitored non-invasively and continuously during surgeries and follow-up procedures. Cuff based or invasive catheter techniques are considered as gold standard to measure BP and are fed manually to compute AC and SI which employ imaging algorithms. In this context, a Continuous and Non-Invasive Vascular Stiffness and Arterial Compliance Screener (CaNVAS) is developed to measure said parameters continuously and non-invasively using ultrasound sensor. Acoustic waves of 5 MHz (2.2 – 10 MHz) are driven through target arterial walls, reflected echoes captured, pre-processed and frequency shift is used to calculate PWV. It is observed that PWV measured using CaNVAS varies exponentially with BP values obtained from sphygmomanometer (BPMR-120) and this relationship is used to compute instantaneous values of BP. The proposed device is validated by performing measurements on 250 subjects in pre and post exercise conditions and found to have 95% accuracy and an average of 12.5% coefficient of variation.

The problem of reliable function computation is extended by imposing privacy, secrecy, and storage constraints on a remote source whose noisy measurements are observed by multiple parties. The main additions to the classic function computation problem include 1) privacy leakage to an eavesdropper is measured with respect to the remote source rather than the transmitting terminals’ observed sequences; 2) the information leakage to a fusion center with respect to the remote source is considered as a new privacy leakage metric; 3) the function computed is allowed to be a distorted version of the target function, which allows to reduce the storage rate as compared to a reliable function computation scenario in addition to reducing secrecy and privacy leakages; 4) two transmitting node observations are used to compute a function. Inner and outer bounds on the rate regions are derived for lossless and lossy single-function computation with two transmitting nodes, which recover previous results in the literature. For special cases that include invertible and partially-invertible functions, and degraded measurement channels, exact lossless and lossy rate regions are characterized, and one exact region is evaluated for an example scenario.

The scientific fields of complexity, artificial life (ALife), and artificial intelligence (A.I.) share several commonalities: historic, conceptual, methodological, and philosophical. It was possible to develop them only because of information technology, while their origins can be traced back to cybernetics. In this perspective, I'll revise 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. The paper poses more questions than answers, but hopefully it will be useful to align efforts in these fields towards overcoming --- or accepting --- their limits.

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.

From the formalism of the thermodynamics of irreversible processes and the theory of complex systems, characterization of longevity and aging and its relationship with the emergence and evolution of cancer was carried out. It was found that: 1. The rate of entropy production can be used as an index of robustness, plasticity, the aggressiveness of cancer, and as a measure of biological age; 2. The aging process, as well as the evolution of cancer, goes through what we have called “biological phase transition”; 3. The process of metastasis, which occurs through epithelial-mesenchymal transition (EMT), appears as a phase transition far from thermodynamic equilibrium and exhibits Shilnikov chaos-like dynamic behavior. This dynamic guarantees the robustness of the process and, in turn, its unpredictability; 4. It was shown that as the ferroptosis process is strengthened, the complexity of the dynamics associated with the emergence and evolution of cancer decreases. The theoretical framework developed contributes to a better understanding of the biophysical-chemical phenomena of longevity and aging and their relationship with cancer.

The assessment of Histone deacetylases in conjunction with Curcumin, conducted through the Mcule Database employing the Autodock Vina algorithm, involves an examination of molecular interactions. This analysis includes the calculation of binding energies, revealing the strength and stability of the interactions between Curcumin and various Histone deacetylase targets. The comparison encompasses diverse aspects such as binding energies, specific binding sites, interactions across different targets, structural details, and potential implications for biological activity. The results imply that Curcumin shows heightened affinity for Histone deacetylase 4 in comparison to other investigated histone deacetylases.

An increasing amount of electric energy is consumed by computers as they progress in function and capabilities. All of it is dissipated in heat during the computing and communicating operations and we reached the point that further developments are hindered by the unbearable amount of heat produced. In this paper we briefly review the fundamental limits in energy dissipation, as imposed by the laws of physics, with specific reference to computing and memory storage activities.

We prove that the Legendre coefficients associated with a function f(x) can be represented as the Fourier coefficients of a suitable Abel-type transform of the function itself. Thus, the computation of N Legendre coefficients can be performed efficiently in O(NlogN) operations by means of a single Fast Fourier Transform of the Abel-type transform of f(x). We also show how the symmetries associated with the Abel-type transform can be exploited to further reduce the computational complexity. The dual problem of calculating the sum of Legendre expansions is also considered. We prove that a Legendre series can be written as the Abel transform of a suitable Fourier series. This fact allows us to state an efficient algorithm for the evaluation of Legendre expansions. Finally, numerical tests are presented to exemplify and confirm the theoretical results.

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.

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.

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

Bone Scan Index (BSI) is an image biomarker for quantification on bone metastasis of cancers. To compute BSI, not only the hotspots (metastasis) but also the bones have to be segmented. Most related researches focus on binary classification on bone scintigraphy: having metastasis or none. Rare studies focus on pixelwise segmentation. In this study we compare three advanced convolutional neural network (CNN) based models to explore the bone segmentation on dataset in house. The best model is Mask R-CNN, which reaches the precision, sensitivity and F1-score: 0.93, 0.87, 0.90 for prostate cancer patients and 0.92, 0.86, 0.88 for breast cancer patients, respectively. The results are the average of 10-fold cross-validation, which reveals the reliability for clinical use on bone segmentation.

We communicate the theoretical results in the study of utilizing the quantum phenomena in optical current for quantum computation in the context of high precision voltage measurements. These results can be used around computation by quantum sampling and quantum communication as the basis for further research and physical implementations. We propose a Main Optical Setup (MOS) for such computation which allows to make a superstructure to implement specific computations and algorithms. To create MOS we used the nonlinear units (e.g., beta- barium borate crystal), arranged in series, powered with pulsed laser pump, and ended with the beam splitter to generate the output state of a number of entangled photon pairs. The computation is made by propagation of entanglement with beam splitters applied crossword and adjustable phase shifters that are tools for parameter steering. We show how to implement the series of cosine-based components on the example of two-component case. The results opens a broad area for future research in the area of building quantum optimizer using the quantum sampling methods and in the area of high precision temporal measurement of voltage, which is the important process for building high-fidelity devices.

The authors previously found a model of universal quantum computation by making use of the coset structure of subgroups of a free group $G$ with relations. A valid subgroup $H$ of index $d$ in $G$ leads to a \lq magic' state $\left|\psi\right\rangle$ in $d$-dimensional Hilbert space that encodes a minimal informationally complete quantum measurement (or MIC), possibly carrying a finite \lq contextual' geometry. In the present work, we choose $G$ as the fundamental group $\pi_1(V)$ of an exotic $4$-manifold $V$, more precisely a \lq small exotic' (space-time) $R^4$ (that is homeomorphic and isometric, but not diffeomorphic to the Euclidean $\mathbb{R}^4$). Our selected example, due to to S. Akbulut and R.~E. Gompf, has two remarkable properties: (a) it shows the occurence of standard contextual geometries such as the Fano plane (at index $7$), Mermin's pentagram (at index $10$), the two-qubit commutation picture $GQ(2,2)$ (at index $15$) as well as the combinatorial Grassmannian Gr$(2,8)$ (at index $28$) , (b) it allows the interpretation of MICs measurements as arising from such exotic (space-time) $R^4$'s. Our new picture relating a topological quantum computing and exotic space-time is also intended to become an approach of \lq quantum gravity'.

Thrombosis is the pathological clot formation under abnormal hemodynamic conditions, which can result in vascular obstruction, causing ischemic strokes and myocardial infarction. Thrombus growth under moderate to low shear (<1000 s^-1) relies on platelet activation and coagulation. Thrombosis at elevated high shear rates (>10,000 s-1) is predominantly driven by unactivated platelet binding and aggregating mediated by von Willebrand factor (VWF), while platelet activation and coagulation are secondary in supporting and reinforcing the thrombus. Given the molecular and cellular level information it can access, multiscale computational modelling informed by biology can provide new pathphysiological mechanisms that are otherwise not accessible experimentally, holding promise for novel first-principle-based therapeutics. In this review, we summarize the key aspects of platelet biorheology and mechanobiology, focusing on the molecular and cellular scale events and how they build up to thrombosis through platelet adhesion and aggregation in the presence or absence of platelet activation. In particular, we highlight recent advancements in multiscale modeling of platelet biorheology and mechanobiology and how they can lead to better prediction and quantification of thrombus formation, exemplifying the exciting paradigm of digital medicine.

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

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.

Human language is a prime example of a complex system characterized by multiple scales of description. Understanding its origins and distinctiveness has sparked investigations with very different approaches, ranging from the Universal Grammar to statistical analyses of word usage, all of which highlight, from different angles, the potential existence of universal patterns shared by all languages. Yet, a cohesive perspective remains elusive. In this paper we address this challenge. First, we provide a basic structure of universality, and define recursion as a special case thereof. We cast generative grammars of formal languages, the Universal Grammar and the Greenberg Universals in our basic structure of universality, and compare their mathematical properties. We then define universality for writing systems and show that only those using the rebus principle are universal. Finally, we examine Zipf's law for the statistics of word usage, explain its role as a complexity attractor, and explore its relation to universal writing systems as well as its similarities with universal Turing machines. Overall, we find that there are two main kinds of universality, termed {\it mechanistic} and {\it emergent}, and unveil some connections between them.

From single-cell organisms to complex neural networks, all evolved to provide control solutions to generate context and goal-specific actions. Neural circuits performing sensorimotor computation to drive navigation employ inhibitory control as a gating mechanism, as they hierarchically transform (multi)sensory information into motor actions. Here, we focus on this literature to critically discuss the proposition that prominent inhibitory projections form sensorimotor circuits. After reviewing the neural circuits of navigation across various invertebrate species, we argue that with increased neural circuit complexity and the emergence of parallel computations inhibitory circuits acquire new functions. The contribution of inhibitory neurotransmission for navigation goes beyond shaping the communication that drives motor neurons, instead, include encoding of emergent sensorimotor representations. A mechanistic understanding of the neural circuits performing sensorimotor computations in invertebrates will unravel the minimum circuit requirements driving adaptive navigation.

The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.

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 &amp; Exposures) identifiers, and demonstrated that our method can discover more algorithmic complexity vulnerabilities compared to existing tools with better performance.

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.

Natural time is a new time domain introduced in 2001. The analysis of time series associated with a complex system in natural time may provide useful information and may reveal properties that are usually hidden when studying the system in conventional time. In this new time domain, an entropy has been defined and complexity measures based on this entropy as well as its value under time-reversal have been introduced and found applications in various complex systems. Here, we review these applications in the electric signals that precede rupture, e.g., earthquakes, in the analysis of electrocardiograms, as well as in global atmospheric phenomena like the El Nino/La Nina Southern Oscillation.

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.

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.

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.

The properties of photonic quasicrystals ultimate rely on their inherent long-range order, a hallmark that can be quantified in many ways depending on the specific aspects to be studied. We use the Lempel-Ziv measure, a basic tool for information theoretic problems, to characterize the complexity of the specific structure under consideration. Using the generalized Fibonacci quasicrystals as our thread, we adress the relation between the optical response and the associated complexity.

The paper describes a new formula for calculating the mutual inductance between a thin conical sheet inductor and a filamentary circular loop, which are coaxial. The presented formula is derived semi-analytically using the complete elliptic integrals of the first, second, and the third kind, along with the integral term which will be solved numerically. The results are validated using double and single integration methods, as well as the semi-analytical formula. The mutual inductance between a thin wall solenoid and a filamentary circular loop can be obtained using the new formula for the conical coil and circular loop. Presented formulas can be useful in various applications, such as broadband RF and wireless power transfer systems that utilize conical inductors. Overall, the paper presents a valuable contribution to the field of inductor design and can be useful in various applications involving conical inductors.

One of the most reliable methods of authentication used today is biometric matching. This authentication process, which is done by using biometrics information such as fingerprint, iris, face, etc. is used in many application areas. Authentication at border gates is one of these areas. However, some restrictions have been introduced to storing and using such data, especially with the General Data Protection Regulation (GDPR). The main goal of this work is to find the practical implementation of fully homomorphic encryption-based biometric matching in border controls. In this paper, we propose a biometric authentication system based on hash expansion and fully homomorphic encryption features, considering these restrictions. One of the most significant drawbacks of the homomorphic encryption method is the long execution time. We solved this problem by executing the matching algorithm in parallel manner. The proposed scheme is implemented as proof-of-concept in the SMILE, and its advantages in privacy preservation has been demonstrated.

A parallel shallow water flow model is introduced in this paper. The explicit-time finite volume approach is adopted to solve the 2D shallow water equations on an unstructured triangular mesh. The proposed scheme is second-order accurate in temporal and spatial terms using the two-stage Runge-Kutta and the monotone upwind scheme for conservation law (MUSCL) methods, respectively. Based on Message Passing Interface (MPI) and OpenACC, a multi-GPU model is presented with the METIS library to produce the domain decomposition. A CUDA-aware MPI library through GPUDirect for peer-to-peer (P2P) transfer between two GPUs and overlapping computation and MPI communication are used to speed up MPI memory exchange and the performance of the code. A 2D circular dam break test with wet and dry downstream beds and grid resolutions of about 2 million cells is considered to verify the accuracy of the code, and good results were achieved compared to the numerical simulations of published studies. Compared with the multi-CPU version of the 6-core CPU, maximum speedups of 56.18 and 331.51 were obtained using the single-GPU and multi-GPU versions, respectively. Results indicate that acceleration performance improves as the mesh resolution increases.

Most neuromorphic technologies use a point-neuron model, missing the spatiotemporal nature of neuronal computation performed in dendrites. Dendritic morphology and synaptic organization are structurally tailored for spatiotemporal information processing, enabling various computations like visual perception. Here, we report on a neuromorphic computational model termed ‘dendristor’, which integrates functional synaptic organization with dendritic tree-like morphology computation. The dendristor presents bioplausible nonlinear integration of excitatory and inhibitory synaptic inputs with silent synapses and diverse spatial distribution dependency. We show that the dendristor can emulate direction selectivity, which is the feature to react robustly to a preferred signal direction on the dendrite. We discover that silent synapses can remarkably enhance direction selectivity, turning out to be a crucial player in dendritic computation processing. Finally, we develop neuromorphic dendritic neural circuits that can emulate a cognitive function such as motion perception in the retina. Using dendritic morphology, we achieve visual perception of motion in 3D space by various mapping of spatial information on different dendritic branches. This neuromorphic dendritic computation innovates beyond current neuromorphic computation and provides solutions to explore new skylines in artificial intelligence, neurocomputation, and brain-inspired computing.

Drug design is used for different applications of bioinformatics tools analyze DNA, genome, and sequence target region of a small organic molecule in order to understand the molecules of disease. Bioinformatics tools are identified a newly wide research field and minimize future risks through web servers and data mining. Clinical sample test performed with the bioinformatics tools as the biomedical detective. A particular structure and configuration of protein obliging in Drug design concluded Bioinformatics. This review bioinformatics tools and webserver will discuss functions of small organic molecules according to clinical pharmacology.

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 paper addresses the issues of how we can quantify structural information for nonparametric distributions and how we can detect its changes. Structural information refers to an index for a global understanding of a data distribution. When we consider the problem of clustering using a parametric model such as a Gaussian mixture model, the number of mixture components (clusters) can be thought of as structural information in the model. However, there does not exist any notion of structural information for nonparametric modeling of data. In this paper we introduce a novel notion of {\em kernel complexity} (KC) as structural information in the nonparametric setting. The key idea of KC is to combine the information bias inspired by the Gini index with the information quantity measured in terms of the normalized maximum likelihood (NML) code length. We empirically show that KC has a property similar to the number of clusters in a parametric model. We further propose a framework for structural change detection with KC in nonparametric distributions. With synthetic and real data sets we empirically demonstrate that our framework enables us to detect structural changes underlying the data and their early warning signals.

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.

The Mann-Whitney effect is a measure for comparing survival distributions between two groups. The Mann-Whitney effect is interpreted as the probability that a randomly selected subject in a group survives longer than a randomly selected subject in the other group. Under the independence assumption of two groups, the Mann-Whitney effect can be expressed as the traditional integral formula of survival functions. However, when the survival times in two groups are not independent each other, the traditional expression of the Mann-Whitney effect has to be modified. In this article, we propose a copula-based approach to compute the Mann-Witney effect with parametric survival models under dependence of two groups, which may arise in the potential outcome framework. In addition, we develop a Shiny web app that can implement the proposed method via simple commands (https://nkosuke.shinyapps.io/shiny_survival/). Through a simulation study, we show the correctness of the proposed calculator. We apply the proposed methods to two real datasets.

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

In this work the existence and nonexistence of stationary radial solutions to the elliptic partial differential equation arising in the molecular beam epitaxy are studied. Since we are interested in radial solutions we arrive at the following fourth-order differential equation

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.

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.

We are concerned with the use of some classical spectral collocation methods as well as with the new software system Chebfun in order to compute high order (index) eigenpairs of singular as well as regular Schrodinger eigenproblems. We want to highlight both the qualities as well as the shortcomings of these methods and evaluate them vis-a-vis the usual ones. In order to resolve a boundary singularity we use Chebfun with the simple domain truncation technique. Although this method is equally easy to apply with spectral collocation, things are more nuanced in the case of these methods. A special technique to introduce boundary conditions as well as a coordinate transform which maps an unbounded domain to a nite one are the ingredients. A challenging set of "hard" benchmark problems, for which usual numerical methods (f. d., f. e. m., shooting etc.) fail, are analysed. In order to separate "good"and "bad"eigenvalues we estimate the drift of the set of eigenvalues of interest with respect to the order of approximation and/or scaling of domain parameter. It automatically provides us with a measure of the error within which the eigenvalues are computed and a hint on numerical stability. We pay a particular attention to problems with almost multiple eigenvalues as well as for problems with a mixed (continuous) spectrum. In the latter case we try to numerically highlight its existence. Special attention will be paid to the higher eigenpairs (the pair of eigenvalue and the corresponding eigenfunction approximated by an eigenvector spanning its nodal values).

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.

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.

Children’s health, development and education cannot be handled separated; they form one process and are profoundly interrelated. This article considers how to ensure children’s physical and mental fitness for school and maintain it once they are there. Rwanda Is a case study of health and development issues which render children unreceptive to education. This is not news to Rwanda’s government, but until recently the donor community was not interested in supporting implementation. The story of Rwanda illustrates the need to think about changes of policy and practice in their context of structures and culture – how they interact and how they are facilitated or constrained by structures and by cultural understandings. To grasp what is going on and for successful implementation of policy, it is necessary to look at situations as a whole and consider human and governmental agency as real influences rather than just consequences of causal mechanisms.

The performance analysis of the internal/external flows around a high speed vehicle in near-space is fundamental and critical to the configuration and structure design for high speed aircraft. In this paper, the two-dimensional coupled implicit Reynolds Average Navier-Stokes (RANS) solver and RNG k–ε turbulence model is employed to numerically simulate the flow field of an integrated high speed vehicle. The flow field are divided three parts to solve separately and compared with that solved by integrated simulation. The flow field are decomposed to save computer storage and simulation time. The first part is inlet/isolator, the second part is combustion chamber and the third is nozzle. In the computation process, the outlet condition of isolator is endowed to the inlet boundary of combustion chamber and the outlet boundary of combustion chamber is endowed to the inlet boundary of nozzle, then the whole flow field of integrated high speed vehicle is solved. Aerodynamic characteristic of fragment-computation and integration-computation is comparatively analyzed at different angles of attack, the results show that the maximum deviation of lift coefficient obtained by fragment-computation is less than 3% compared with that by integration, the maximum deviation of drag coefficient fragment-computation is less than 5% compared with that by integration, while pitching moment coefficient deviation less than 12%. However, for simulation time-consumption, the time used by fragment-computation reduces 45% compared with integration-computation. Meanwhile, by components force analysis, it can be concluded that the aerodynamic property of inlet/isolator can been obtained separately and hardly effected by other parts.

The two-scale method (TSM) is an effective approach to simulate electromagnetic (EM) scattering from rough sea surface, to interpret physical interaction of EM wave with rough sea surfaces. The sea surface roughness spectrum and the cutoff wavenumber are two key factors affecting the accuracy of TSM simulation. This paper takes the geophysical model functions (GMFs) of different band as reference, and quantitatively studies the two factors based on the numerical simulation of different polarization backscattering coefficients. The numerical simulation demonstrates that Apel spectrum is more suitable for the backscattering simulation in C/X/Ku-band, and the optimal cutoff wavenumbers are also derived for TSM simulation of EM scattering in C/X/Ku-band. Then an empirical model function of optimal cutoff wavenumbers with respect to frequency, incident angle and wind speed are obtained with regression method. Finally, the simulation results with the new model function of cutoff wavenumber are compared with the GMF and measured data in different bands and they are all consistent. Moreover, a physical explanation for the optimal cutoff wavenumber is also given.

Nature-inspired algorithms are very popular tools for solving optimization problems inspired by nature. However, there is no guarantee that optimal solution can be obtained using a randomly selected algorithm. As such, the problem can be addressed using trial and error via the use of different optimization algorithms. Therefore, the proposed study in this paper analyzes the time-complexity and efficacy of some nature-inspired algorithms which includes Artificial Bee Colony, Bat Algorithm and Particle Swarm Optimization. For each algorithm used, experiments were conducted several times with iterations and comparative analysis was made. The result obtained shows that Artificial Bee Colony outperformed other algorithms in terms of the quality of the solution, Particle Swarm Optimization is time efficient while Artificial Bee Colony yield a worst case scenario in terms of time complexity.

Nature-inspired algorithms are very popular tools for solving optimization problems inspired by nature. However, there is no guarantee that optimal solution can be obtained using a randomly selected algorithm. As such, the problem can be addressed using trial and error via the use of different optimization algorithms. Therefore, the proposed study in this paper analyzes the time-complexity and efficacy of some nature-inspired algorithms which includes Artificial Bee Colony, Bat Algorithm and Particle Swarm Optimization. For each algorithm used, experiments were conducted several times with iterations and comparative analysis was made. The result obtained shows that Artificial Bee Colony outperformed other algorithms in terms of the quality of the solution, Particle Swarm Optimization is time efficient while Artificial Bee Colony yield a worst case scenario in terms of time complexity.

The use of convolutional neural networks (CNNs) in image classification has become the standard method of approaching computer vision problems. Here we apply pre-trained networks to classify images of non-breaking, plunging and spilling breaking waves. The CNNs are used as basic feature extractors and a classifier is then trained on top of these networks. The dynamic nature of breaking waves is exploited by using image sequences to gain extra information and improve the classification results. We also see improved classification performance in using pre-computed image features such as the optical flow between image pairs. The inclusion of the dynamic information improves the classification between breaking wave classes. We also provide corrections to the methodology from the article from which the data originates to achieve a more accurate assessment of performance.

A critical discussion on the computation of the dispersion diagram in periodic one-dimensional guiding structures is carried out. In particular, an analysis is presented of the pros and cons of combined methods that make use of full-wave simulations done with commercial software packages with further analytical post-processing based on simplifications brought by an equivalent circuit model of the structure. Some of the most common methods reported in the literature are reviewed and their advantanges and limitations highlighted. Our discussion is complemented with several selected numerical examples in order to discuss the most relevant aspects that a potential user of these methods should be aware of. Special attention is paid to the relevant role played by the high-order coupling between the two halves of a symmetric unit cell of the periodic structure.

ABO incompatibility is not considered a contraindication for hematopoietic stem cell transplantation (HSCT). Approximately 30% of transplants from related donors and up to 50% of transplants from unrelated donors are ABO-incompatible. The immuno-hematologic investigationsmay evaluate donor/recipient ABO mismatch and anti-A/B isohemoagglutinins (IHAs) titration in pre-HSCT phase. Immediate hemolysis or delayed complications (passenger lymphocyte syndrome and pure red cell aplasia) can appear post-HSCT. Some preventive treatmentstake into consideration the manipulation of the product and decision-making algorithms based on the titration of IHAs in the recipient with clinical protocols for the removal/reduction of IHAs through plasma exchange or immunoadsorption procedures. Currently, the best approach in the managementof ABO-incompatibletransplant is not defined in expert consensus documents or with solid evidence. In addition, the methods for IHAs titration are not standardized. The transfusion strategy must consider both the blood group systems of the recipient and the donor until the RBC engraftment and the confirmed ABO conversion (forward and reverse typing) on two consecutive and independent samples. Therefore, ABO incompatibility in the HSCT is an important immuno-hematologic challenge and request all necessary preventive measures including the appropriate selection of ABO blood components for transfusion.

Multicellularity evolved repeatedly in the history of life, but how it unfolded varies greatly between different lineages. Dictyostelid social amoebas offer a good system to study the evolution of multicellular complexity, with a well-resolved phylogeny and molecular genetic tools being available. We compare the life cycles of the Dictyostelids with closely related amoebozoans to show that complex life cycles were already present in the unicellular common ancestor of Dictyostelids. We propose frost resistance as an early driver of multicellular evolution in Dictyostelids and show that the cell signalling pathways for differentiating spore and stalk cells evolved from that for encystation. The stalk cell differentiation program was further modified, possibly through gene duplication, to evolve a new cell type, cup cells, in Group 4 Dictyostelids. Studies in various multicellular organisms including Dictyostelids, volvocine algae, and metazoans suggest as a common principle in the evolution of multicellular complexity that unicellular regulatory programs for adapting to environmental change serve as “proto-cell types” for subsequent evolution of multicellular organisms. Later, new cell types could further evolve by duplicating and diversifying the “proto-cell type” gene regulatory networks.

Integrated landscape approaches (ILA) aim to reconcile multiple, often competing, interests across agriculture, nature conservation, and other land uses. Recognized ILA design principles provide guidance for their implementation, yet application remains challenging, and a strong performance evidence-base is yet to be formed. A comprehensive literature review and focus group discussions with practitioners identified considerable diversity of ILA in actors, temporal, and spatial scales, inter alia. This diversity hampers learning from and steering these integrated planning approaches because of its intractable nature. Therefore, we developed a tool—an ‘ILA mixing board’—to structure the complexity of ILA into selectable and scalable attributes in a replicable way to allow planning, diagnostics, and comparative assessment of ILA. The ILA mixing board tool presents seven qualifiers, each representing a key attribute of ILA design and performance such as project flexibility, inclusiveness of the dialogue, and the centrality of the power distribution. Each qualifier has five (non-normative) outcome indicators that can be registered as present or absent. This process in turn guides planners, evaluators and other participating stakeholders involved in landscape management to diagnose the ILA type, and or its performance. We apply the ILA mixing board as a diagnostic tool to three ILA cases in Nicaragua, Madagascar, and the Congo Basin to show some of the many possible configurations of qualifiers on the mixing board. Overall, the tool allows comparative analyses of the complexity of ILA in a structured and manageable way.

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.

Deep Neural Network (DNN) inference demands substantial computing power, resulting in significant energy consumption. A large number of negative output activations in convolution layers are rendered zero due to the invocation of the ReLU activation function. This results in a substantial number of unnecessary computations that consume significant amounts of energy. This paper presents ECHO: Energy-efficient Computation Harnessing Onilne Arithmetic - A MSDF-based accelerator for DNN inference, designed for computation pruning, utilizing an unconventional arithmetic paradigm known as online/ most-significant digit first (MSDF) arithmetic which performs computations in a digit-serial manner. The MSDF digital serial computation of online arithmetic enables overlapped computation of successive operations leading to substantial performance improvements. The online arithmetic, coupled with a negative output detection scheme, facilitates early and precise recognition of negative outputs. This, in turn, allows for the timely termination of unnecessary computations, resulting in a reduction of energy consumption. The implemented design has been realized on the Xilinx Virtex-7 VU3P FPGA and subjected to a comprehensive evaluation through a rigorous comparative analysis involving widely used performance metrics. Experimental results demonstrate promising power and throughput improvements compared to contemporary methods. In particular, the proposed design achieved an average improvement in power consumption of up to 81%, 82.9%, and 40.6% for VGG-16, ResNet-18, and ResNet-50 workloads compared to the conventional bit-serial design, respectively. Furthermore, significant average speedups of 2.39×, 2.6×, and 2.42 were observed when comparing the proposed design to conventional bit-serial designs for VGG-16, ResNet-18, and ResNet-50 models respectively.

Machine learning (ML) based on neural network (NN) facilitates data-driven techniques for handling large amounts of data, either obtained through experiments or simulations at multiple spatio-temporal scales, thereby finding the hidden patterns underlying these data and promoting efficient research methods. The main purpose of this paper is to extend the capabilities of a new solver, called realFluidReactingNNFoam, under development at University of Perugia in OpenFOAM with NN algorithm for replacing complex real-fluid thermophysical property evaluations, using the approach of coupling OpenFOAM and Python-trained NN models. Currently, NN models are trained against data generated using the Peng-Robinson equation of state (PR-EoS) assuming mixture frozen temperature. The OpenFOAM solver, where needed, calls the NN models in each grid-cell with appropriate inputs, and the returned results are used and stored in suitable OpenFOAM data structures. Such inference for the thermophysical properties is achieved via the “Neural Network Inference in C made Easy” (NNICE) library, which proved to be very efficient and robust. The overall model is validated considering a liquid-rocket benchmark comprised of liquid-oxygen (LOX) and gaseous-hydrogen (GH2) streams. The model accounts for real-fluid thermodynamics and transport properties, making use of the PR-EoS and the Chung transport models. First, the development of a real-fluid model (RFM) with artificial neural network is described in detail. Then, the numerical results of the transcritical mixing layer (LOX/GH2) benchmark are presented and analyzed in terms of accuracy and computational ef-ficiency. Results of the overall implementation indicate that the combined OpenFOAM and ML approach provides a speed-up factor higher than seven, while preserving the original solver accuracy.

In this work we develop a new algorithm for efficient computation of the Voigt/complex error function. In particular, in this approach we propose a two-domain scheme where number of the grid-points is dependent on the input parameter $y$. The error analysis we performed shows that the MATLAB implementation meets the requirements for radiative transfer applications involving the HITRAN spectroscopic database. The run-time test shows that this MATLAB implementation provides rapid computation especially at smaller range of the parameter x.

Zinc oxide (ZnO) as a semiconductor in its crystalline or amorphous form is still a promised material, especially under isobaric and isothermal ensembles. In this work, Parallel and Equilibrium Molecular Dynamics and DL_POLY_4 software are employed to predict the relationship between the behavior of ZnO chemical bonds and the phase transition literatures, using correlation function g(r) of Zn-Zn, Zn-O, and O-O pairs. Our system is composed of 5832 atoms of ZnO rocksalt structure (2916 atoms of Zn2+ and 2916 atoms of O2-), under the temperature of 300 (K) and the range of pressure 0-400 (GPa). The lengths of ZnO bonds, the standard error, standard deviation, the maximum of g(r), and the percentage of the variation of the bonds are analyzed. The interatomic interactions are modeled by the potential of Buckingham for short-range and Coulomb for long-range interactions. The calculations were run on the RAVEN Supercomputer of Cardiff University (UK). Our data are mostly in the vicinity of available information of bonds lengths; the rest can be deduced from the pressure of phase transition to use it as a new approach of phase transition confirmation. However, the rest of our results are still a prediction because of no results under extended pressure used in this work.

Musculoskeletal models (MSKMs) are used to estimate the muscle and joint forces involved in human locomotion, often associated with the onset of degenerative musculoskeletal pathologies (e.g. osteoarthritis). Subject-specific MSKMs offer more accurate predictions than their scaled-generic counterparts. This accuracy is achieved through time-consuming personalisation of models and manual tuning procedures that suffers from potential repeatability errors, hence limiting the wider application of this modelling approach. In this work we have developed a methodology for identifying and ranking the muscles that are more important to the determination of the joint forces, thus producing reduced but still accurate representation of the musculoskeletal system in shorter timeframes. The methodology hinges on Sobol's sensitivity analysis (SSA) for ranking the muscle importance. The thousands of data points required for SSA are generated using Gaussian Process emulators, a Bayesian technique to infer the input-output relationship between nonlinear models from a limited number of observations. Results show that there is a pool of muscles whose personalisation has little effects on the model predictions. Furthermore, joint forces in subject generic and subject generic models are influenced by different set of muscles, suggesting the existence of a model specific component of the sensitivity analysis.

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.

Optical motion capture systems are state-of-the-art in motion acquisition, however as any measurement systems they are not error free -- noise is their intrinsic feature. The works so far mostly employ simple noise model, expressing the uncertainty as a simple variance. In the work we prove the existence of several types of noise and demonstrate how to quantify them using Allan variance. For the automated readout of the noise coefficients we solve the multidimensional regression problem using sophisticated metaheuristics in exploration-exploitation scheme. Besides classic types of noise we identified the presence of the correlated noises and periodic distortion in our facility. We had also opportunity to observe the influence of camera failure to the overall performance.

The theory of the continuous two-dimensional (2D) Fourier Transform in polar coordinates has been recently developed but no discrete counterpart exists to date. In the first part of this two-paper series, we proposed and evaluated the theory of the 2D discrete Fourier Transform (DFT) in polar coordinates. The theory of the actual manipulated quantities was shown, including the standard set of shift, modulation, multiplication, and convolution rules. In this second part of the series, we address the computational aspects of the 2D DFT in polar coordinates. Specifically, we demonstrate how the decomposition of the 2D DFT as a DFT, Discrete Hankel Transform (DHT) and inverse DFT sequence can be exploited for efficient code. We also demonstrate how the proposed 2D DFT can be used to approximate the continuous forward and inverse Fourier transform in polar coordinates in the same manner that the 1D DFT can be used to approximate its continuous counterpart.

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 metrics, of which algorithmic complexity is the only one capable of revealing both transitions towards the chaotic regime and 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.

Bistatic scattering coefficient have important application of ocean active microwave remote sensing. In this paper, a general expression of the composite scattering coefficient for multiple dielectric targets of one-dimensional fractal sea surface is derived by MOM method. Secondly, the bistatic scattering coefficient is computed, there are two class missile targets and one class ship target of one-dimensional fractal sea surface, and the influence of the water dielectric constant, fractal dimension, wind speed, the target dielectric constant and spatial position is discussed, and the corresponding conclusions are given. The proposed algorithm is able to solve some composite scattering problems, such as “dielectric or conductive object + rough surface”, “dielectric or conductive floating object +rough ”and it has certain generalization and reference.

The role of fractional calculus in circuit systems has received increased attention in recent years. In order to evaluate the effectiveness of time-domain calculation methods in the analysis of fractional-order piecewise smooth circuit systems, an experimental prototype is developed and the effects of three typical calculation methods in different test scenarios are compared and studied in this paper. It is proved that Oustaloup’s rational approximation method usually overestimates the peak-to-peak current and brings in pulse-voltage phenomenon in piecewise smooth test scenarios, while the results of two iterative recurrence-form numerical methods are in good agreement with the experimental results. The study results are dedicated to provide a reference for efficiently deploying calculation methods in fractional-order piecewise smooth circuit systems. Some quantitative analysis results are concluded in this paper.

Often, when solving forward, inverse or data assimilation problems, only a part of the solution is needed. As a model, we consider the stationary diffusion problem. We demonstrate an algorithm that can compute only a part or a functional of the solution, without calculating the full inversion operator and the complete solution. It is a well-known fact about partial differential equations that the solution at each discretisation point depends on the solutions at all other discretisation points. Therefore, it is impossible to compute the solution only at one point, without calculating the solution at all other points. The standard numerical methods like a conjugate gradient or Gauss elimination compute the whole solution and/or the complete inverse operator. We suggest a method which can compute the solution of the given partial differential equation 1) at a point; 2) at few points; 3) on an interface; or a functional of the solution, without computing the solution at all points. The required storage cost and computational resources will be lower as in the standard approach. With this new method, we can speed up, for instance, computation of the innovation in filtering or the likelihood distribution, which measures the data misfit (mismatch). Further, we can speed up the solution of the regression, Bayesian inversion, data assimilation, and Kalman filter update problems. Applying additionally the hierarchical matrix approximation, we reduce the cubic computational cost to almost linear $\mathcal{O}(k^2n \log^2 n)$, where $k\ll n$ and $n$ is the number of degrees of freedom. Up to the hierarchical matrix approximation error, the computed solution is exact. One of the disadvantages of this method is the need to modify the existing deterministic solver.

We formulate a more straightforward, symmetry-based techniques in manually computing the determinant of any n×n matrix by revisiting Dodgson’s condensation method and strategically applying elementary row operations and the definition and properties of determinants. The result yields a more simplified mnemonical algorithm than the usual reduction by elementary row operations and co-factor expansion and with minimal terminal divisions performed compared to Dodgson’s internal divisions.

Current progress in the prediction of mechanical behavior of solids requires understanding of spatiotemporal complexity of plastic flow caused by self-organization of crystal defects. It may be particularly important in hexagonal materials because of their strong anisotropy and combination of different mechanisms of plasticity, such as dislocation glide and twinning. These materials often display complex behavior even on the macroscopic scale of deformation curves, e.g., a peculiar three-stage elastoplastic transition, the origin of which is a matter of debates. The present work is devoted to a multiscale study of plastic flow in α-Ti, based on simultaneous recording of deformation curves, 1D local strain field, and acoustic emission (AE). It is found that the average AE activity also reveals three-stage behavior, but in a qualitatively different way depending on the crystallographic orientation of the sample axis. On the finer scale, the statistical analysis of AE events and local strain rates testifies to an avalanche-like character of dislocation processes, reflected in power-law probability distribution functions. The results are discussed from the viewpoint of collective dislocation dynamics and are confronted to predictions of a recent micromechanical model of Ti strain hardening.

Throughout the evolution of machine learning, the size of models has steadily increased as researchers strive for higher accuracy by adding more layers. This escalation in model complexity necessitates enhanced hardware capabilities. Today, state-of-the-art machine learning models have become so large that effectively training them requires substantial hardware resources, which may be readily available to large companies but not to students or independent researchers. To make the research on machine learning models more accessible, this study introduces a size reduction technique that leverages stages in Pyramid Training and Similarity Comparison. Our results demonstrate that pyramid training can reduce model complexity while maintaining accuracy of conventional full-sized models, offering a scalable and resource-efficient solution for researchers and practitioners in hardware-constrained environments.

The rise of data science in biology stimulates interdisciplinary collaborations to address fundamental questions. Here, we report the outcome of the first SINFONIA symposium focused on revealing the mechanisms governing plant reproductive development across biological scales. The intricate and dynamic target networks of known regulators of flower development remain poorly understood. To analyze development from the genome to the final floral organ morphology, high-resolution data that capture spatiotemporal regulatory activities are necessary and require advanced computational methods for analysis and modeling. Moreover, frameworks to share data, practices and approaches that facilitate the combination of varied expertise to advance the field are called for. Training young researchers in interdisciplinary approaches and science communication offers the opportunity to establish a collaborative mindset to shape future research.

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.

In Model-Driven Development (MDD), the models, their generation, and imposing changes on them (model transformation) are used for the development of software. Models provide a framework to start from the imagination and abstraction to create and accomplish the final system. Models create a slow and steady transition from whatness to howness, i.e. from the natural path of the generation of software. For supporting this path, the Logic and Functionality of software must be changeable during its evolution. Here we provide a brief introduction to the concept of Model Driven Development.

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

In 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.

Hepatocellular Carcinoma (HCC) continues to pose a substantial global health challenge due to its high incidence and limited therapeutic options. In recent years, the Janus Kinase (JAK) and Signal Transducer and Activator of Transcription (STAT) pathway has emerged as a critical signaling cascade in HCC pathogenesis. The review commences with an overview of the JAK/STAT pathway, delving into the dynamic interplay between the JAK/STAT pathway and its numerous upstream activators, such as cytokines and growth factors enriched in pathogenic livers afflicted with chronic inflammation and cirrhosis. This paper also elucidates how the persistent activation of JAK/STAT signaling leads to diverse oncogenic processes during hepatocarcinogenesis, including uncontrolled cell proliferation, evasion of apoptosis, and immune escape. In the context of therapeutic implications, this review summarizes recent advancements in targeting the JAK/STAT pathway for HCC treatment. Preclinical and clinical studies investigating inhibitors and modulators of JAK/STAT signaling are discussed, highlighting their potential in suppressing the deadly disease. The insights presented herein underscore the necessity for continued research into targeting the JAK/STAT signaling pathway as a promising avenue for HCC therapy.

The paper describes a method of solving some stochastic processes using generating functions. A general theorem of generating functions of a particular type is derived. A generating function of this type is applied to a stochastic process yielding polynomial time algorithms for certain partitions. The method is generalized to a stochastic process describing a rather general linear transform. Finally, the main idea of the method is used in deriving a theoretical polynomial time algorithm to the knapsack problem.

Current paper reviews applications of luminescence bioassays for monitoring low-intensity factors, namely, radioactivity of different types (alpha, beta and gamma), and bioactive compounds (humic substances and fullerenols). Luminescence intensity is taken as a physiological parameter of luminous organisms. High rates of luminescence response can provide (1) a proper number of experiments under comparable conditions and, therefore, proper statistical processing, with this being highly important for ‘noisy’ low-dose exposures; (2) non-genetic, i.e. biochemical and physicochemical mechanisms of cellular response, in accordance to “exposome” concept. Bioassays based on luminous marine bacteria, their enzymes, and fluorescence coelenteramide-containing proteins were used to compare results of low-intensity exposures at cellular, biochemical and physicochemical levels, respectively. Results of the cellular exposures were discussed in terms of hormesis concept. Bioluminescence time dependence under low-dose radiation exposures corresponded to hormesis or threshold models; no bioluminescence monotonic dependency on intensity of exposure (dose rate, radioactivity, concentration) was found. Bioluminescence activation and absence of its dependency on intensity of exposure can be accepted as features of cellular adaptive response. Changes of biological luminescence were analyzed and discussed for bioassays of lower organization level – enzymes and florescent protein.

The complexity of software is increasing day by day due to the increase in the size of the projects being developed. For better planning and management of large software projects, estimation of software quality is important. During the development processes, complexity metrics are used for the indication of the attributes/characteristics of the quality software. There are many studies about the effect of the complexity of the software on the cost and quality. In this study, we discussed the effects of software complexity on the quality attributes of the software for open source and closed source software. Though, the quality metrics for open and closed source software are not distinct from each other. In this paper, we comparatively analyzed the impact of complexity metrics on open source and private software. We also presented various models for the management of the project complexity such as William’s Model, Stacey’s Agreement and Certainty matrix, Kahane’s Approach and UCP Model. Quality metrics here refer to the standards for the measurement of the quality of software which contains certain attributes or characteristics of the software that are related to the quality of the software. Certain quality attributes addressed in this study are Usability, Reliability, Security, Portability, Maintainability, Efficiency, Cost, Standards and Availability, etc. Both Open source and Closed source software are evaluated on the basis of these quality attributes. This study also recommended future approaches to manage the quality of project Open source and Closed source software and specify which one of them is mostly used in the industry.

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.

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.

Genetic code expansion has emerged as an enabling tool to provide insight into functions of understudied proteinogenic species such as small proteins and peptides, and to probe protein biophysics in the cellular context. Here we discuss recent technical advances and applications of genetic code expansion in cellular imaging of complex mammalian protein species, along with considerations and challenges upon using the method.

How robust is our assessment of impacts to ecosystems and species from a rapidly changing climate during the 21st century? We examine the challenges of uncertainty, complexity and constraints associated with applying climate projections to understanding future biological responses. This includes an evaluation of how to incorporate the uncertainty associated with different greenhouse gas emissions scenarios and climate models, and constraints of spatiotemporal scales and resolution of climate data into impact assessments. We describe the challenges of identifying relevant climate metrics for ecological models and evaluate the usefulness and limitations of different methodologies of applying climate change to both quantitative and qualitative ecological response models. We discuss the importance of incorporating extreme climate events and their stochastic tendencies in assessing ecological impacts and transformation, and provide recommendations for better integration of complex climate-ecological interactions at relevant spatiotemporal scales. We further recognize the compounding nature of uncertainty when accounting for our limited understanding of the interactions between climate and biological processes. Given the inherent complexity in ecological processes and their interactions with climate, we recommend integrating quantitative modeling with expert elicitation from diverse disciplines and experiential understanding of recent climate-driven ecological processes to develop more robust understanding of ecological responses under different scenarios of future climate change. Inherently complex interactions between climate and biological systems also provide an opportunity to develop wide-ranging strategies that resource managers can employ to prepare for the future.

The paper proposes a new principle of finding and removing elements of mathematical model, redundant in terms of parametric identification of the model. It allows reducing computational and time complexity of the applications built on the model. Especially this is important for AI based systems, systems based on IoT solutions, distributed systems etc. Besides, the complexity reduction allows increasing an accuracy of mathematical models implemented. Despite the model order reduction methods are well known, they are extremely depended however on the problem area. Thus, proposed reduction principles can be used in different areas, what is demonstrated in this paper. The proposed method for the reduction of mathematical models of dynamic systems allows also the assessment of the requirements for the parameters of the simulator elements to ensure the specified accuracy of dynamic similarity. Efficiency of the principle is shown on the ordinary differential equations and on the neural network model. The given examples demonstrate efficient normalizing properties of the reduction principle for the mathematical models in the form of neural networks.

As an emerging network paradigm, Space-Air-Ground integrated networks (SAGIN) has attracted the attentions from academia and industry. That is because SAGIN can implement seamless global coverage and connections among electronic devices in space, air, and ground spaces. Additionally, the shortages of computing and storage resources in mobile devices greatly affect the quality of experiences for intelligent applications. Hence, we devise to integrate SAGIN as an abundant resource pool into mobile edge computing environments (MEC). To facilitate efficient processing, we need to solve the optimal task offloading decisions. Different from the existing MEC task offloading solutions, we have to face some new challenges, such as the fluctuation of processing capability for an edge computing node, the uncertainty of the transmission latency caused by the heterogeneous network protocols, the uncertain amount of uploaded tasks during a period, and so on. In this paper, we firstly describe a task offloading decision problem in new challenge environments. But, we cannot use the standard robust optimization and stochastic optimization methods to obtain the optimal result under the uncertain network environments. In this paper, we propose the condition value at risk-aware distributionally robust optimization algorithm, named as CVAR-DRO, to solve the task offloading decision problem. The proposed CVAR-DRO method combines the distributionally robust optimization and the condition value at risk model for solving the optimal result. And then, We have evaluated our approach in simulation SAGIN environments with the confidence interval, the number of mobile task-offloading and the various parameters. We compare our proposed CVAR-DRO algorithm with the state-of-the-art algorithms, such as the standard robust optimization algorithm, the stochastic optimization algorithm, the DRO algorithm, and the brute algorithm. The experimental results show that CVAR-DRO can get a sub-optimal mobile task-offloading decision. Overall, CVAR-DRO is more robust than others to the new challenges mentioned above in SAGIN.

Over the past decade and a half, dynamic functional imaging has revolutionized the neuroimaging field. Since 2009, it has revealed low dimensional brain connectivity measures, has identified potential common human spatial connectivity states, has tracked the transition patterns of these states, and has demonstrated meaningful alterations in these transition and spatial patterns in neurological disorders, psychiatric disorders, and over the course of development. Recently, researchers have begun to analyze this data from the perspective of dynamic system and information theory in the hopes of understanding how these dynamics support less easily quantified processes, such as information processing, cortical hierarchy, and consciousness. Consciousness, in particular, appears to be strongly linked to entropy production in the brain. Little attention has been paid to the effects of psychiatric disease on entropy production in the human brain, however. Even disorders characterized by substantial changes in conscious experience have not been widely analyzed from this perspective. We begin to rectify this by examining the complexity of subject trajectories in state space through the lens of information theory. Specifically, we identify a basis for the dynamic functional connectivity state space and track subject trajectories through this space over the course of the scan. The dynamic complexity of these trajectories is assessed along each dimension of the proposed basis space. Using these estimates, we demonstrate that schizophrenia patients display substantially simpler trajectories than demographically matched healthy controls, and that this drop in complexity concentrates along specific dimensions. We also demonstrate that entropy generation in at least one of these dimensions is linked to cognitive performance. Overall, results suggest great value in applying dynamic systems theory to problems of neuroimaging and reveal a substantial drop in the complexity of schizophrenia patients’ brain function.

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 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.

Helicobacter pylori is a gastric oncopathogen that infects over half of the world’s human population. It is a Gram-negative, microaerophilic, helix-shaped bacterium that is equipped with flagella, which provide high motility. Colonization of the stomach is asymptomatic in up to 90% of people but is a recognized risk factor for developing various gastric disorders such as gastric ulcers, gastric cancer and gastritis. Invasion of the human stomach occurs via numerous virulence factors such as CagA and VacA. Similarly, outer membrane proteins (OMPs) play an important role in H. pylori pathogenicity as a means to adapt to the epithelial environment and thereby facilitate infection. While some OMPs are porins, others are adhesins. The epithelial cell receptors SabA, BabA, AlpA, OipA, HopQ and HopZ have been extensively researched to evaluate their epidemiology, structure, role and genes. Moreover, numerous studies have been performed to seek to understand the complex relationship between these factors and gastric diseases. Associations exist between different H. pylori virulence factors, the co-expression of which appears to boost pathogenicity of the bacterium. Improved knowledge of OMPs is a major step towards combatting this global disease. Here, we provide a current overview of different H. pylori OMPs and discuss their pathogenicity, epidemiology and correlation with various gastric diseases.

Low-complexity ultrasound systems are increasingly desired for wearable point-of-care ultra-sound and massive-channel ultrasound for 3-D matrix imaging. However, the system complexity is closely associated with the imaging capabilities, remaining as a challenge. To resolve this limitation, this study revisits the general structures of analog and digital beamformers and in-troduces a hybrid approach to implement efficient ultrasound systems. The suggested hybrid beamforming takes two stages, where the first analog stage partially beamforms M-channel RF signals to N sum-out data (M-to-N beamforming), and the second digital stage beamforms N partial sums to single final beamformed data (N-to-1 beamforming). Our approach was systematically designed and implemented, which was demonstrated with a customized 64-channel 1-D phased array using a tissue mimicking phantom. The demonstrated results indicate that the analog-digital hybrid beamforming can be applied to any kind of arrays for sophisticated 3-D imaging and tiny wearable ultrasound applications.

Background: Oral narratives are crucial for evaluating youngsters since they reveal a plethora of information about young children's language development. This study aimed to investigate the development of narrative productivity, lexical diversity, syntactic complexity and in Cypriot-Greek-speaking children during preschool and primary school years. An additional aim was to measure the effect of the children’s gender in their performance on the measures of narratives. Methods: One hundred and twenty-nine typically developing Cypriot-Greek-speaking children were recruited for the study. Results: The results showed that the linguistic structure of narrations reflects a subtle developmental trend. As expected, older children tended to produce longer and syntactically more complex stories than the younger ones, which is in line with previous studies. There were significant differences in all productivity measures between the four-year-olds and those aged seven and ten years old. In addition, the results illustrated that there was not any significant effect of gender in the measures of narrative skills. Specifically, gender did not affect the children’s performance in the sample. Boys and girls had similar narrative measurements in all the variables. Conclusions: This study aims to provide initial evidence in retelling narrative development patterns on typically developing Cypriot-Greek speaking children that could be used by speech and language to compare children’s performance and detect language disorders.