The analysis and measurement of poverty is a crucial issue in the field of social science. Poverty is a multidimensional notion that can be measured using composite indicators relevant to synthesizing statistical indicators. Subjective choices could, however, affect these indicators. We propose interval-based composite indicators to avoid the problem, enabling us in this context to obtain robust and reliable measures. Based on a relevant conceptual model of poverty we have identified, we will consider all the various factors identified. Then, considering a different random configuration of the various factors, we will compute a different composite indicator. We can obtain a different interval for each region based on the distinct factor choices on the different assumptions for constructing the composite indicator. So we will create an interval-based composite indicator based on the results obtained by the Monte-Carlo simulation of all the different assumptions. The different intervals can be compared, and various rankings for poverty can be obtained. For their parameters, such as center, minimum, maximum, and range, the poverty interval composite indicator can be considered and compared. The results demonstrate a relevant and consistent measurement of the indicator and the shadow sector's relevant impact on the final measures.

The holy grail of Artificial Intelligence (AI) has been to mimic human intelligence using computing machines. Autopoiesis which refers to a system with well-defined identity and is capable of re-producing and maintaining itself and cognition which is the ability to process information, apply knowledge, and change the circumstance are associated with resilience and intelligence. While classical computer science (CCS) with symbolic and sub-symbolic computing has given us tools to decipher the mysteries of physical, chemical and biological systems in nature and allowed us to model, analyze various observations and use information to optimize our interactions with each other and with our environment, it falls short in reproducing even the basic behaviors of living organisms. We present the foundational shortcomings of CCS and discuss the science of infor-mation processing structures (SIPS) that allows us to fill the gaps. SIPS allows us to model su-per-symbolic computations and infuse autopoietic and cognitive behaviors into digital machines. They use common knowledge representation from the information gained using both symbolic and sub-symbolic computations in the form of system-wide knowledge networks consisting of knowledge nodes and information sharing channels with other knowledge nodes. The knowledge nodes wired together fire together to exhibit autopoietic and cognitive behaviors.

Goyor sarong is a cultural heritage of Tegal, Central Java made using Non-Machine Looms (ATBM) with characteristic motifs that describe the character of the Tegal people. This study aims to analyze the symbolic meaning of the goyor sarong and its existence in the gloved culture of contemporary Tegal society. The approach used in this study is qualitative with the type of research is descriptive qualitative. The informants interviewed were gloved cultural actors from diverse professions and socio-cultural backgrounds. Data were also obtained from literature studies including online media. The results of this study show that the typical motifs on the goyor sarong include lung, bottled, ceplok, prilik, and balian motifs. Goyor sarong are viewed from a symbolic point of view, have a symbiotic understanding between humans and symbolic objects, and understand the cultural meaning of goyor sarong to shape social life. The motifs in the goyor sarong are increasingly developing according to the times and consumer needs in the modern era. This is closely related to the gloved culture of contemporary Tegal society. The use of goyor sarongs in contemporary society usually indicates the strata and events attended. In the era of orientation development, the goyor sarong has more meaning than just symbolic elaboration. Sarong goyor as a culture has an important role for the community that depicts local fashion life in line with the issue of zero waste in the latest international fashion industry.

AI research and implementations are growing, and so are the risks associated with AI (Artificial Intelligence) developments, especially when it’s difficult to understand exactly what they do and how they work, both at a localized level, and at deployment, in particular when distributed and on a large scale. Governments are pouring massive funding to promote AI research and education, yet research results and claims, as well as the effectiveness of educational programmes, can be difficult to evaluate given the limited reproducibility of computations based on ML (machine learning) and poor explainability, which in turn limits the accountability of the systems and can cause cascading systemic problems and challenges including poor reproducibility, reliability, and overall lack of trustworthiness. This paper addresses some of the issues in Knowledge Representation for AI at system level, identifies a number of knowledge gaps and epistemological challenges as root causes of risks and challenges for AI, and proposes that neurosymbolic and hybrid KR approaches can serve as mechanisms to address some of the challenges. The paper concludes with a postulate and points to related and future research

The importance of detecting and diagnosing the imminence of aneurysm rupture before it occurs cannot be overstated. However, this process is often time-consuming and challenging, with variability in conclusions not uncommon among experts. Furthermore, current state-of-the-art models in medical image segmentation suffer from limited availability of large annotated datasets for training, exacerbated by an immense data imbalance. In most segmentation tasks, 3D segmentation is preferred due to its capacity to leverage more contextual information. However, these models require more data, which is constrained by the aforementioned issues. In the realm of current diagnosis models, those lacking geographic context are notably ineffective. To address these issues, the aim is to develop a model pipeline to accurately detect cerebral intracranial aneurysms and diagnose rupture imminence through 3D magnetic resonance angiography (MRA) and tabular input, augmented with the implementation of neuro-symbolic ai. The utilization of data fusion to tackle the lack of context in tabular models is proposed, leveraging extracted geographical features from a segmentation model. To enhance segmentation results and tackle the data imbalance in aneurysm segmentation, a two-stage model pipeline that extracts contextual geographic features before aneurysm segmentation is suggested. Segmentation results are additionally improved through ensemble techniques and novel preprocessing techniques. Finally, a neuro-symbolic aspect is introduced to enhance model diagnosis, interpretability and performance. The multi-step Integrated Neuro-Symbolic Analysis Pipeline for Cerebral Aneurysm Rupture Diagnosis is introduced.

Semantically meaningless strings that are associated with affective attributes (US) can become emotionally valenced CS. Jurchiș et al (2020) recently demonstrated CS-US associations may influence evaluations towards previously-unseen letter strings if the latter share grammar construction rules with CS. We replicated those authors' findings in a modified extension (Experiment 1; N₁ = 108), where happy/angry faces (US) were differentially associated with letter strings (CS) constructed using familiar (English) or non-familiar (Phoenician) alphabets. CS-US sequences were sandwiched by evaluations of strings that never appeared as CS, but shared grammar construction rules. However, post-hoc tests indicated valence effects were restricted to participants classified as 'high awareness' or those who had been exposed to longer stimulus durations, suggesting resource-intense deliberations were central during evaluations. Qualitative awareness checks additionally showcased many participants had attributed valences to recurring elements across conditioned and evaluated exemplars. These limitations were collectively addressed in Experiment 2 (N₂ = 140), where participants viewed Phoenician (/English) CS during conditioning but viewed English (/Phoenician) strings during evaluations, meaning no strings nor elements recurred between phases. We found credible valence effects across English and Phoenician strings, with the latter observed across all awareness categories. Because participants were unable to consciously specify any evaluative strategies while evaluating Phoenician strings, we speculate grammar construction rules (organizing relations) may have been non-consciously acquired during conditioning.

The development of artificial intelligence systems assumes that a machine can independently generate an algorithm of actions or a control system to solve the tasks. To do this, the machine must have a formal description of the problem and possess computational methods for solving it. The article deals with the problem of optimal control, which is the main task in the development of control systems, insofar as all systems being developed must be optimal from the point of view of a certain criterion. However, there are certain difficulties in implementing the resulting optimal control modes. The paper considers an extended formulation of the optimal control problem, which implies the creation of such systems that would have the necessary properties for its practical implementation. To solve it, an adaptive synthesized optimal control approach based on the use of numerical methods of machine learning is proposed. The method moves the control object, optimally changing the position of the stable equilibrium point in the presence of some initial position uncertainty. As a result, from all possible synthesized controls, he chooses one that is less sensitive to changes in the initial states. As an example, the optimal control problem of quadcopter with complex phase constraints is considered. To solve this problem? according to the proposed approach, the control synthesis problem is firstly solved to obtain a stable equilibrium point in the state space by a machine learning method of symbolic regression. After that optimal positions of the stable equilibrium point are searched according to source functional from the optimal control problem by particle swarm optimization algorithm. It is shown that such approach allows generating the control system automatically by computer basing on the formal statement of the problem and then directly implementing it onboard as far as they have already had a stabilization system inserted.

Single-cell RNA sequencing (scRNA-seq) technology has significantly advanced our understanding of the diversity of cells and how this diversity is implicated in diseases. Yet, translating these findings across various scRNA-seq datasets poses challenges due to technical variability and dataset-specific biases. To overcome this, we present a novel approach that employs both an LLM-based framework and explainable machine learning to facilitate generalization across single-cell datasets and identify gene signatures to capture disease-driven transcriptional changes. Our approach uses scBERT, which harnesses shared transcriptomic features among cell types to establish consistent cell-type annotations across multiple scRNA-seq datasets. Additionally, we employ a symbolic regression algorithm to pinpoint highly relevant yet minimally redundant models and features for inferring a cell type’s disease state based on its transcriptomic profile. We ascertain the versatility of these cell-specific gene signatures across datasets, showcasing their resilience as molecular markers to pinpoint and characterize disease-associated cell types. Validation is carried out using four publicly available scRNA-seq datasets from both healthy individuals and those suffering from ulcerative colitis (UC). This demonstrates our approach’s efficacy in bridging disparities specific to different datasets, fostering comparative analyses. Notably, the simplicity and symbolic nature of the retrieved gene signatures facilitate their interpretability, allowing us to elucidate underlying molecular disease mechanisms using these models.

Using a scaling symmetry, it is shown how to compute polynomial conservation laws, generalized symmetries, recursion operators, Lax pairs, and bilinear forms of polynomial nonlinear partial differential equations thereby establishing their complete integrability. The Gardner equation is chosen as the key example for it comprises both the Korteweg-de Vries and modified Korteweg de Vries (mKdV) equations. The Gardner and Miura transformations which connect these equations are also computed using the concept of scaling homogeneity. Exact solitary wave solutions and solitons of the Gardner equation are derived using Hirota’s method and other direct methods. The nature of these solutions depends on the sign of the cubic term in the Gardner equation and the underlying mKdV equation. It is shown that flat (table-top) waves of large amplitude only occur when the sign of the cubic nonlinearity is negative (defocusing case) whereas the focusing Gardner equation has the standard elastically colliding solitons. The paper’s aim is to provide a review of integrability properties and solutions of the Gardner equation and illustrate the applicability of the scaling symmetry approach. The methods and algorithms used in this paper have been implemented in Mathematica but can be adapted for major computer algebra systems.

The enhanced multi-objective symbolic discretization for time series (eMODiTS) method employs a flexible discretization scheme using different value cuts for each non-equal time interval, which requires a computational cost for evaluating each objective function. Therefore, surrogate models were implemented to minimize this disadvantage. Nevertheless, each solution found by eMODiTS is a different-sized vector, so the surrogate model must be able to handle data sets under this characteristic. Consequently, this work's contribution lies in analyzing the surrogate models' implementation on the time series discretization, where each potential scheme is a real-number different-sized vector. For this reason, the surrogate model proposed was k-nearest Neighbors for regression with Dynamic Time Warping as a distance measure. Results suggest our proposal finds a suitable approximation to the final eMODiTS solutions with a functions evaluation reduction rate between 15% and 95%. However, according to Pareto front performance measures, the proposal Pareto front is competitive compared to the eMODiTS Pareto front, reaching an average Generational Distance (GD) between 0.0447 and 0.0536. Moreover, the average Hypervolume Ratio (HVR) ranges between 0.334 and 0.3891. Finally, our proposal compared against SAX-based methods presents a similar behavior regarding classification tasks and statistical tests.

This paper aims to search for lump waves in a spatial symmetric (2+1)-dimensional dispersive wave model. Through an ansatz on positive quadratic functions, we conduct symbolic computations with Maple to generate lump waves for the proposed nonlinear model. A line of critical points of the lump waves is computed, whose two spatial coordinates travel at constant speeds. The corresponding maximum and minimum values are evaluated in terms of the wave numbers, and interestingly, all those extreme values do not change with time, either. The last section is the conclusion.

The extensive use of polypropylene (PP) in various industries has heightened interest in devel-oping efficient methods for recycling and optimising its mixtures. This study focuses on formu-lating predictive models for the Melt Flow Rate (MFR) and shear viscosity of PP blends. The in-vestigation involved characterising various grades, including virgin homopolymers, copolymers, and post-consumer recyclates, in accordance with ISO 1133 standards. The research examined both binary and ternary blends, utilising traditional mixing rules and symbolic regression to predict rheological properties. High accuracy was achieved with the Arrhenius and Cragoe models, at-taining R² values over 0.99. Symbolic regression further enhanced these models, offering signif-icant improvements. To mitigate overfitting, empirical noise and variable swapping were in-troduced, increasing the models' robustness and generalisability. The results demonstrated that the developed models could reliably predict MFR and shear viscosity, providing a valuable tool for improving the quality and consistency of PP mixtures. These advancements support the de-velopment of recycling technologies and sustainable practices in the polymer industry by opti-mising processing and enhancing the use of recycled materials.

Anomaly detection plays a significant role in helping gas turbines run reliably and economically. Considering collective anomalous data and both sensitivity and robustness of the anomaly detection model, a sequential symbolic anomaly detection method is proposed and applied to the gas turbine fuel system. A structural Finite State Machine is to evaluate posterior probabilities of observing symbolic sequences and most probable state sequences they may locate. Hence an estimating based model and a decoding based model are used to identify anomalies in two different ways. Experimental results indicates that these two models have both ideal performance overall, and estimating based model has a strong ability in robustness, while decoding based model has a strong ability in accuracy, particularly in a certain range of length of sequence. Therefore, the proposed method can well facilitate existing symbolic dynamic analysis based anomaly detection methods especially in gas turbine domain.

We leverage the explainability feature of KAN network and build an explainable language model where certain neurons encode individual words and neuron activation is fully interpretable in terms of the basis of a word. To do that, we propose a continuous word2vec model where a meaning of a word is expressed by a continuous profile of distances of this word from the words in the basis of words which is interpolated. As a result, the whole KAN network can be interpreted as a sequential procedure with word expressions. We then proceed from words to logic programs and develop a clause learning technique based on KAN. A logic program construction process from facts now become fully interpretable. We follow the differentiable inductive logic programming technique, representing a logic program as a matrix learned by KAN. Hence, we obtain an efficient and fully interpretable rule learning approach.

The calculation of moments of area is one of the most fundamental aspects of engineering mechanics for calculating the properties of beams or for the determination of invariants in different kind of geometries. While a variety of shapes such as circles, rectangles, ellipses or their combinations can be described symbolically, such symbolic expressions are missing for freeform cross-sections. In particular, periodic B-spline cross-sections are suitable for an alternative beam cross-section, e.g. for the representation of topology optimization results. In this work, therefore, a symbolic description of the moments of area of various parametric representations of such B-splines is computed. The expressions found are then compared with alternative computational methods and checked for validity. The resulting equations show a simple way for fast conceptual computation of such moments of area of periodic B-splines.

Natural circulation loop (NCL) systems are buoyancy-driven heat exchangers that are used in various industrial applications. The concept of passive heat exchange in NCL systems is attractive, because there is no need for an externally driven equipment (e.g., a pump) to maintain the fluid circulation. However, relying on buoyancy as the sole driving force may lead to several potential difficulties, one of which is generation of (possibly) time-varying nonlinearities in the dynamical system, where a difference in the time scales of heat transfer and fluid flow causes the flow to change from a steady-state regime to either an oscillatory regime or a flow-reversal regime, both of which are undesirable. In this paper, tools of symbolic time series analysis (e.g., probabilistic finite state automata (PFSA)) are proposed to identify selected regimes of operation in NCL systems, where the underlying principle is built upon the concept of pattern classification from measurements of fluid-flow dynamics. The proposed method is shown to be capable of identifying the current regime of operation from the initial time response under a given set of operational parameters. The efficacy of regime classification is demonstrated by testing on two data sets, generated from numerical simulation of a MATLAB SimuLink model that has previously been validated with experimental data. The results of the proposed PFSA-based classification are compared with those of a hidden Markov model (HMM) that serves as the baseline.

Widely used in hydraulics, the Colebrook equation for flow friction relates implicitly to the input parameters; the Reynolds number, Re and the relative roughness of inner pipe surface, ε/D with the output unknown parameter; the flow friction factor, λ; λ=f(λ, Re, ε/D). In this paper, a few explicit approximations to the Colebrook equation; λ≈f(Re, ε/D), are generated using the ability of artificial intelligence to make inner patterns to connect input and output parameters in explicit way not knowing their nature or the physical law that connects them, but only knowing raw numbers, {Re, ε/D}→{λ}. The fact that the used genetic programming tool does not know the structure of the Colebrook equation which is based on computationally expensive logarithmic law, is used to obtain better structure of the approximations which is less demanding for calculation but also enough accurate. All generated approximations are with low computational cost because they contain a limited number of logarithmic forms used although for normalization of input parameters or for acceleration, but they are also sufficiently accurate. The relative error regarding the friction factor λ, in best case is up to 0.13% with only two logarithmic forms used. As the second logarithm can be accurately approximated by the Padé approximation, practically the same error is obtained also using only one logarithm.

Symbolic pole/zero analysis is an important step when designing an analog operational amplifier. Generally, a simplified symbolic analysis of analog circuits suffers from NP-hardness, i.e., an exponential growth of the number of symbolic terms of the transfer function with the circuit size. In this study, we present a mathematical model combined with a heuristic-metaheuristic solution method for the symbolic pole/zero simplification in operational transconductance amplifiers (OTA). At first, the circuit is symbolically solved and an improved root splitting method is applied to extract symbolic poles/zeroes from the exact expanded transfer function. Then, a hybrid algorithm based on heuristic information and a metaheuristic technique using simulated annealing is performed for the simplification of the derived symbolic pole/zero expressions. The developed method has been tested on three analog OTAs. The obtained results show the effectiveness of the proposed method to achieve accurate simplified symbolic pole/zero expressions with the least complexity.

Using only a limited number of computationally expensive functions, we show a way how to construct accurate and computationally efficient approximations of the Colebrook equation for flow friction. The presented approximations are based on the asymptotic series expansion of the Wright ω-function and symbolic regression. The results are verified with 8 million of Quasi-Monte Carlo points covering the domain of interest for engineers. In comparison with the built-in “wrightOmega” feature of Matlab R2016a, the herein introduced related approximations of the Wright ω-function significantly accelerate the computation. With only two logarithms and several basic arithmetic operations used, the presented approximations are not only computationally efficient but also extremely accurate. The maximal relative error of the most promising approximation which is given in the form suitable for engineers’ use is limited to 0.0012%, while for a little bit more complex variant is limited to 0.000024%.

In this paper, we exhibit new dynamical properties of the two-mode Caudrey-Dodd-Gibbon (TMCDG) equation. This model describes the motion of dual-waves in dispersive and nonlinear media, which mainly depends on the nonlinearity and dispersion parameters. The overlapping of such two-mode waves is affected by the phase-velocity parameter. The study takes a full advantages of the Kudryashov method and of the exponential-expansion method. For the first time, dual-wave solutions are obtained for arbitrary values of the nonlinearity and dispersive factors. The graphs of the novel solutions are also provided in order to depict the waves propagation, as well as to show the influence of the parameters.

With 500+ papers and 20+ books spanning many scientific disciplines, Mark Burgin has left an indelible mark and legacy for future explorers of human thought and information technology professionals. In this paper, I discuss his contribution to the evolution of machine intelligence using his general theory of information (GTI) based on my discussions with him and various papers I co-authored during the past eight years. His construction of a new class of digital automata to overcome the barrier posed by the Church-Turing Thesis, and his contribution to Super-Symbolic Computing with Knowledge Structures, Cognizing Oracles, and Structural Machines are leading to practical applications changing the future landscape of information systems. GTI provides a model for the operational knowledge of biological systems to build, operate, and manage life processes using 30+ trillion cells capable of replication and metabolism. The schema, and associated operations derived from GTI are also used to model a digital genome specifying the operational knowledge of algorithms executing the software life processes with specific purposes using replication and metabolism. The result is a digital software system with a super-symbolic computing structure exhibiting autopoietic and cognitive behaviors that biological systems also exhibit. We discuss here one of these applications.

A new framework in quantum chemistry has been proposed recently ("An approach to first principles electronic structure calculation by symbolic-numeric computation'' by A. Kikuchi). It is based on the modern technique of computational algebraic geometry, viz. the symbolic computation of polynomial systems. Although this framework belongs to molecular orbital theory, it fully adopts the symbolic method. The analytic integrals in the secular equations are approximated by the polynomials. The indeterminate variables of polynomials represent the wave-functions and other parameters for the optimization, such as atomic positions and contraction coefficients of atomic orbitals. Then the symbolic computation digests and decomposes the polynomials into a tame form of the set of equations, to which numerical computations are easily applied. The key technique is Grröbner basis theory, by which one can investigate the electronic structure by unraveling the entangled relations of the involved variables. In this article, at first, we demonstrate the featured result of this new theory. Next, we expound the mathematical basics concerning computational algebraic geometry, which are necessitated in our study. We will see how highly abstract ideas of polynomial algebra would be applied to the solution of the definite problems in quantum mechanics. We solve simple problems in "quantum chemistry in algebraic variety'' by means of algebraic approach. Finally, we review several topics related to polynomial computation, whereby we shall have an outlook for the future direction of the research.

Building electric energy is characterized by a significant increase of its uses (e.g. vehicle charging), a rapidly declining cost of all related data collection and a proliferation of smart grid concepts, including diverse and flexible electricity pricing schemes. Not surprisingly, an increased number of approaches have been proposed for its modeling and forecasting. In this work, we place our emphasis on three forecasting related issues. First, on the forecasting explainability, i.e. the ability to understand and explain to the user what shapes the forecast. To this extent we rely on concepts and approaches that are inherently explainable, such as the evolutionary approach of genetic programming (GP) and its associated symbolic expressions, as well as the so-called SHAP (SHapley Additive eXplanations) values, which is a well established model agnostic approach for explainability, especially in terms of feature importance. Second, we investigate the impact of the training timeframe on the forecasting accuracy; this is driven by the realization that a fast training would allow for faster deployment of forecasting in real life solutions. And third, we explore the concept of counterfactual analysis on actionable features, i.e. features that the user can really act upon and which therefore present an inherent advantage when it comes to decision support. We have found that SHAP values can provide important insights into the model explainability. As for GP models, we have found comparable and in some cases superior accuracy when compared to its neural-network and time-series counterparts but a rather questionable potential to produce crisp and insightful symbolic expressions, allowing a better insight into the model performance. We have also found, and report here on an important potential especially for practical, decision support, solutions of counterfactuals built on actionable features and short training timeframes.

Quantum mechanics could be studied through polynomial algebra, as has been demonstrated by a work (“An approach to first-principles electronic structure calculation by symbolic-numeric computation” by A. Kikuchi). We carry forward the algebraic method of quantum mechanics through algebraic number theory; the basic equations are represented by the multivariate polynomial ideals; the symbolic computations process the ideal and disentangle the eigenstates as the algebraic variety; upon which one canbuild the Galois extension of the number field, in analogy with the univariate polynomial case, to investigate the hierarchy of solutions; the Galois extension is accompanied with the group operations, which permute the eigenstates from one to another, and furnish the quantum system with a non-apparent symmetry. Besides, this sort of algebraic quantum mechanics is an embodiment of the class field theory; some of the important consequences of the latter emerge in quantum mechanics. We shall demonstrate these points through simple models; we will see the use of computational algebra facilitates such sort of analysis, which might often be complicated if we try to solve them manually.