This study empirically analyzes the effectiveness of resource optimization utilizing artificial intelligence (AI) within cloud computing environments. It compares systems that have been transitioned from a Monolithic structure to Microservices Architecture (MSA) with those adopting a simple Rehost strategy, to validate the operational efficiency of two systems whose resource efficiency has been enhanced compared to traditional legacy systems. The research is based on systems that determined resource efficiency post-cloud migration using APM tools. It points out the limitations of traditional heuristic operation methods in resource optimization, which lead to issues such as application performance degradation, resource over-allocation, and increased operational costs. This study aims to overcome the conventional resource optimization standards that depended on the average peak usage of CPU and memory infrastructure, by introducing AI-based optimization tools, and applying on-premise standards to cloud and container environments to achieve resource optimization. The paper emphasizes the importance of resource optimization through AI-based automation tools, exploring the possibilities of resolving real-world application performance issues in cloud environments, reducing unnecessary resource usage costs, and cutting down on labor risks and operational expenses. Through this, it presents strategic directions on how AI technology can offer financial and operational advantages in managing cloud resources.

Energy distance is used to eigenvalue distributions in this new Wishart distribution study, providing a new perspective on high-dimensional data. Multivariate statistics relies on Wishart distribution to explain covariance matrices. This analysis shows how degrees of freedom and covariance matrix configurations affect eigenvalue dispersion. We use energy distance based on eigenvalue distributions to assess Wishart distribution differences without the "curse of dimensionality" via extensive simulation simulations. This approach improves measurement accuracy and processing efficiency in distribution comparisons and enables new analytical pathways in scientific fields that need data covariance comprehension. Our results show that degrees of freedom and matrix structure considerably affect energy distances, expanding the theoretical framework and practical applications of statistical models.

Taiwan’s auditors have suffered from processing excessive audit data, including drawing audit evidence. This study advances sampling techniques by integrating machine learning with sampling. This machine learning integration helps avoid sampling bias, keep randomness and variability, and target the risker samples. We first apply a Naive Bayes classifier to classify data into some classes. Next, a user-based, item-based, or hybrid approach is employed to draw audit evidence. The representativeness index is the primary metric for measuring the representativeness of audit evidence. The user-based approach denotes the selection of samples between two percentiles in a class as audit evidence. It may be equivalent to a combination of monetary and variable sampling methods. The item-based approach represents the choice of risky samples as audit evidence. It may be identical to a combination of non-statistical and monetary sampling methods. Auditors can hybridize those user-based and item-based approaches to balance representativeness and riskiness in selecting audit evidence. Three experiments show that sampling using machine learning integration has the benefits of drawing unbiased samples, handling complex patterns, correlations, and unstructured data, and improving efficiency in sampling big data. However, the limitations are the classification accuracy output by machine learning algorithms and the range of prior probabilities.

The widespread availability of tools to collect and share spatial data enables us to produce a large amount of geographic information on a daily basis. This enormous production of spatial data requires scalable data management systems. Geospatial architectures have changed from clusters to cloud architectures and more parallel and distributed processing platforms to be able to tackle these challenges. Peer-to-peer (P2P) systems as a backbone of distributed systems have been established in several application areas such as web3, blockchains, and crypto-currencies. Unlike centralized systems, data storage in P2P networks is distributed across network nodes, providing scalability and no single point of failure. However, managing and processing queries on these networks has always been challenging. In this work, we propose a spatio-temporal indexing data structure, DSTree. DSTree does not require additional Distributed Hash Trees (DHT) to perform multi-dimensional range queries. Inserting a piece of new geographic information updates only a portion of the tree structure and does not impact the entire graph of the data. For example, for time-series data, such as storing sensor data, the DSTree performs better. Despite the advantages of our proposed framework, challenges remain. We conclude that more significant research effort from GIScience and related fields in developing decentralized applications is needed. The need for the standardization of different geographic information when sharing data on the IPFS network is one of the requirements.

This paper presents a comprehensive investigation into the applicability and performance of two prominent growth models, namely the Verhulst model and the Montroll model, in the context of modeling tumor cell growth dynamics. Leveraging the power of Physics-Informed Neural Networks (PINNs), we aim to assess and compare the predictive capabilities of these models against experimental data obtained from the growth patterns of tumor cells. We employ a dataset comprising detailed measurements of tumor cell growth to train and evaluate the Verhulst and Montroll models. By integrating PINNs, we not only account for experimental noise but also embed physical insights into the learning process, enabling the models to capture the underlying mechanisms governing tumor cell growth. Our findings reveal the strengths and limitations of each growth model in accurately representing tumor cell proliferation dynamics. Furthermore, the study sheds light on the impact of incorporating physics-informed constraints on the model predictions. The insights gained from this comparative analysis contribute to advancing our understanding of growth models and their applications in predicting complex biological phenomena, particularly in the realm of tumor cell proliferation.

In recent years, advancements in brain science and neuroscience have significantly influenced the field of computer science, particularly in the domain of reinforcement learning (RL). Drawing insights from neurobiology and neuropsychology, researchers have leveraged these findings to develop novel mechanisms for understanding intelligent decision-making processes in the brain. Concurrently, the emergence of quantum computing has opened new frontiers in artificial intelligence, leading to the development of quantum machine learning (QML). This study introduces a novel model that integrates Quantum Spiking Neural Networks (QSNN) and Quantum Long Short-Term Memory (QLSTM) architectures, inspired by the complex workings of the human brain. Specifically designed for reinforcement learning tasks in energy-efficient environments, our approach progresses through two distinct stages mirroring sensory and memory systems. In the initial stage, analogous to the brain’s hypothalamus, low-level information is extracted to emulate sensory data processing patterns. Subsequently, resembling the hippocampus, this information is processed at a higher level, capturing and memorizing correlated patterns. We conduct a comparative analysis of our model against existing quantum models such as Quantum Neural Networks and their classical counterparts, elucidating its unique contributions. Through empirical results, we aim to underscore the effectiveness of our approach in optimizing energy consumption in practical scenarios.

The article is devoted to the research of economic cycles and crises, which are studied within the framework of the theory of long waves by N. D. Kondratiev (K-waves) using the mathematical apparatus of fractional calculus. The object of the study is the mathematical model of S.V. Dubovsky 3 and some of its modifications, which describe the dynamics of the economic system, characterizing the interaction between the efficiency of new technologies and the efficiency of capital productivity. Modifications in the model are determined by the following points: the mathematical model takes into account the dependence of the rate of accumulation on capital productivity, there is an external harmonic influence - the influx of investments and new technological solutions, the economic system has heredity, including time-dependent, which leads to a delayed effect - the system’s response to impact. The property of heredity in the mathematical model is taken into account using fractional derivatives of constant and variable orders. Mathematical model S.V. Dubovsky and its modifications are studied numerically using the Adams-Bashforth-Moulton algorithm. Oscillograms and phase trajectories are constructed, and an interpretation of the simulation results is given.

Asymptotic theories for fractional cointegrations have been extensively studied in the context of time series data, with numerous empirical studies and tests developed. However, most of the previously developed testing procedures for fractional cointegration were primarily designed for time series data. This paper proposes a generalized residual-based test for fractionally cointegrated panels with fixed effects. The test development is based on bivariate panel series with the regressor assumed to be fixed across cross-sectional units. The proposed test procedure accommodates any integration order between [0,1], and it is asymptotically normal under the null hypothesis. Monte Carlo experiments demonstrate that the test exhibits better size and power compared to a similar residual-based test across varying sample sizes.

In the realm of digital libraries, efficiently managing and accessing scientific publications necessitates automated bibliographic reference segmentation. This study addresses the challenge of accurately segmenting bibliographic references, a task complicated by the varied formats and styles of references. Focusing on the empirical evaluation of Conditional Random Fields (CRF), Bidirectional Long Short-Term Memory with CRF (BiLSTM+CRF), and Transformer Encoder with CRF (Transformer+CRF) architectures, this research employs Byte Pair Encoding and Character Embeddings for vector representation. The models underwent training on the extensive Giant corpus and subsequent evaluation on the Cora Corpus to ensure a balanced and rigorous comparison, maintaining uniformity across embedding layers, normalization techniques, and Dropout strategies. Results indicate that the BiLSTM+CRF architecture outperforms its counterparts by adeptly handling the syntactic structures prevalent in bibliographic data, achieving an F1-Score of 0.96. This outcome highlights the necessity of aligning model architecture with the specific syntactic demands of bibliographic reference segmentation tasks. Consequently, the study establishes the BiLSTM+CRF model as a superior approach within the current state-of-the-art, offering a robust solution for the challenges faced in digital library management and scholarly communication.

Transformation formula under the action of a general linear fractional transformation for generalized Dedekind eta-function has been a subject of intensive study, Rademacher, Dieter, Meyer et al. However, the (Hecke) modular relation structure has not been recognized until the work of Goldstein-de la Torre, and streamlining the classical proofs in the modular relation will reveal the meaning hidden in those works. Our main aim is to elucidate the works of these researchers in the context of modular relations.

The human-readable simplicity with which the CSV format was devised, together with the absence of a standard that strictly defines this format, has allowed the proliferation of several variants in the dialects with which these files are written. The latter has meant that the exchange of information between data management systems, or between countries and regions, requires human intervention during the data mining and cleansing process. This has led to the development of various computational tools that aim to accurately determine the dialects of CSV files, in order to avoid data loss at data loading stage in a given system. However, the dialect detection is a complex problem and current systems have limitations or make assumptions that need to be improved and/or extended. This paper proposes a method for determining CSV file dialects through table uniformity, a statistical approach based on table consistency and records dispersion measurement along with the detection of data type over each field. The new method has a 100\% accuracy on a dataset with 148 CSV files composed of samples coming from a data load testing framework and some others added as verification of the parsing routines. In tests on truly messy data, the proposed solution outperforms the state-of-the-art tool by achieving an improvement of about 10\% in the accuracy with which dialects are detected. Furthermore, the proposed method is accurate enough to determine dialects by reading only ten records, requiring more data to disambiguate those cases where the first records do not contain the necessary information to conclude with a dialect determination.

The adoption of technology and digital tools across various user groups has brought about a heightened risk of cyber-attacks targeting devices and shared data. These elevated levels of cybercrime necessitate thorough investigations to address victims’ inquiries about the nature, causes, affected data, and impacted resources of the attack. Digital forensics serves as a crucial means to answer these queries. Additionally, it enables the formulation of strategies and delineation of roles essential for fortifying future defenses against such attacks. Within digital forensics, digital evidence holds pivotal importance in the investigative process as it serves as a cornerstone in legal proceedings to identify perpetrators. Numerous research endeavors focus on devising solutions to safeguard evidence, including centralized storage centers or cloud computing. These efforts aim to create frameworks integrating diverse security levels for sharing and preserving evidence effectively. In this paper, a new framework is proposed that seeks to amalgamate novel technologies with forensic practices to address challenges in the preservation phase of digital forensics. Strategies include segmenting evidence into smaller components, leveraging steganography to support preservation, and employing blockchain technology to ensure the integrity of collected evidence.

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

This article delves into the intersection of generative AI and digital twins within drug discovery, exploring their synergistic potential to revolutionize pharmaceutical research and development. Through various instances and examples, we illuminate how generative AI algorithms, capable of simulating vast chemical spaces and predicting molecular properties, are increasingly integrated with digital twins of biological systems to expedite drug discovery. By harnessing the power of computational models and machine learning, researchers can design novel compounds tailored to specific targets, optimize drug candidates, and simulate their behavior within virtual biological environments. This paradigm shift offers unprecedented opportunities for accelerating drug development, reducing costs, and, ultimately, improving patient outcomes. As we navigate this rapidly evolving landscape, collaboration between interdisciplinary teams and continued innovation will be paramount in realizing the promise of generative AI and digital twins in advancing drug discovery.

This study demonstrates the efficacy of structured pruning and architectural fine-tuning on the YOLOv7-tiny model for eye state detection, emphasizing optimization for real-time applications. Structured pruning significantly reduced the model's complexity and storage size while maintaining high detection accuracy, as evidenced by stable precision, recall, and [email protected] metrics across iterations. Further fine-tuning adjusted the model's width and depth, optimizing efficiency and processing speed without compromising performance. These optimizations yielded YOLOv7-tiny variants that are both computationally efficient and accurate, suitable for resource-constrained environments. The findings highlight the critical role of model optimization in deploying effective neural networks for specific detection tasks in real-time scenarios.

The susceptible-infected-recovered-vaccinated-deceased (SIRVD) epidemic compartment model extends the SIR model to include the effects of vaccination campaigns and time-dependent fatality rates on epidemic outbreaks. It encompasses the SIR, SIRV, SIRD, and SI models as special cases, with individual time-dependent rates governing transitions between different fractions. We investigate a special class of exact solutions and accurate analytical approximations for the SIRVD and SIRD compartment models. While the SIRVD and SIRD equations pose complex integro-differential equations for the rate of new infections and the fractions as a function of time, a simpler approach considers determining equations for the sum of ratios for given variations. This approach enables us to derive fully exact analytical solutions for the SIRVD and SIRD models. For nonlinear models with a high-dimensional parameter space, such as the SIRVD and SIRD models, analytical solutions, exact or accurately approximative, are of high importance and interest: not only as suitable benchmarks for numerical codes, but especially as they allow us to understand the critical behavior of epidemic outbursts as well as the decisive role of certain parameters. In the second part of our study, we apply a recently developed analytical approximation for the SIR and SIRV models to the more general SIRVD model. This approximation offers accurate analytical expressions for epidemic quantities, such as the rate of new infections and the fraction of infected persons, particularly when the cumulative fraction of infections is small. The distinction between recovered and deceased individuals in the SIRVD model affects the calculation of the death rate, which is proportional to the infected fraction in the SIRVD/SIRD cases but often proportional to the rate of new infections in many SIR models using a posteriori approach. We demonstrate that the temporal dependence of the infected fraction and the rate of new infections differs when considering the effects of vaccinations and when the real-time dependence of fatality and recovery rates diverge. These differences are highlighted for stationary ratios and gradually decreasing fatality rates. \Revised{The case of stationary ratios allows one to construct a new powerful diagnostics method to extract analytically all SIRVD model parameters from measured COVID-19 data of a completed pandemic wave.

The application of artificial intelligence to point-of-care testing (POCT) disease detection has become a hot research field, in which breath detection which detects the patient's exhaled VOCs combined with sensor arrays of Convolutional Neural Network (CNN) algorithms as a new lung cancer detection is attracting more researchers' attention. However, due to low accuracy, high complexity computation and large number of parameters make the CNN algorithms difficult transplant to the embedded system of POCT devices. A lightweight neural network (LTNet) in this work is proposed to deal with this problem, and meanwhile, achieve high-precision classification of acetone and ethanol gases, which are respiratory markers for lung cancer patients. Compared to currently popular lightweight CNN models such as EfficientNet, LTNet has fewer parameters (32K) and its training weight size is only 0.155 MB. LTNet achieved an overall classification accuracy of 99.06% and 99.14% in the own mixed gas dataset and the University of California (UCI) dataset, which are both higher than that of the five existing models’, and it also offers the shortest training (844.38s and 584.67s) and inference time (23s and 14s) in the same validation set. Compared to the existing CNN models, LTNet is more suitable for resource-limited POCT devices.

The purpose of this paper is to explore the implementation of Retrieval-Augmented Gen- 14 eration (RAG) technology with open-source Large Language Models (LLMs). For this purpose, a 15 web-based application named PaSSER that integrates RAG with three models - Mistral:7b, 16 Llama2:7b: Orca2:7b, is developed. In its development various technologies are used, including 17 Blockchain for managing and storing assessment results of built-in testing modules. PaSSER em- 18 ploys a set of evaluation metrics for LLMs’ performance - METEOR, ROUGE, BLEU, Perplexity, 19 Cosine similarity, Pearson correlation, and F1 score. The specialized knowledge base is in the smart 20 agriculture domain. As an illustration, the paper presents results and analysis of two tests. First one 21 is assessing the performance of LLMs across different hardware configurations, the other is deter- 22 mining the model that delivers most accurate and contextually relevant responses within the RAG. 23 The paper also discusses the integration of blockchain technology with LLMs to manage and store 24 assessment results within a blockchain environment. The tests revealed that Mistral:7b demon- 25 strates the best results across most of the evaluated metrics. The discussion section comments on 26 technical and hardware considerations that affect the performance of LLMs. Future development 27 will focus in leveraging new larger pre-trained open-source LLMs, exploring different finetuning 28 approaches, and further integration with Blockchain and IPFS.

A cyclic antipodal points of a circle is a pair of points that are the intersection of the circle with a diameter of the circle. A recent proof of Ptolemy’s Theorem, simultaneously in both (i) Euclidean geometry; and (ii) the relativistic model of hyperbolic geometry (which is identified with the Klein model of hyperbolic geometry), motivates in this article the study of four cyclic antipodal points of a circle, ordered arbitrarily counterclockwise. The translation of results from Euclidean geometry into hyperbolic geometry is obtained by means of hyperbolic trigonometry, called gyrotrigonometry, to which Einstein addition gives rise. Formulas that extend the Pythagorean formula in both Euclidean and hyperbolic geometry are obtained as byproducts

This article introduces a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization (FLO), which emulates the hunting behavior of frilled lizards in their natural habitat. FLO draws in-spiration from the sit-and-wait strategy observed in frilled lizards during hunting. The underlying theory of FLO is presented and mathematically formulated in two phases: (i) an exploration phase, simulating the frilled lizard's attack towards prey, and (ii) an exploitation phase, simulating the lizard's retreat to the top of the tree after feeding. To assess FLO's efficacy in solving optimization problems, the algorithm's performance is evaluated across fifty-two standard benchmark functions, encompassing unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. Comparative analyses with twelve existing metaheuristic algorithms are conducted. The simulation results reveal that FLO, distinguished by its adeptness in exploration, exploitation, and balancing them during search process, outperforms competing algorithms. Additionally, FLO is implemented on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems, demonstrating its effectiveness in addressing real-world optimization applications.

High seismic activity in the Himalayas and the increasing urbanization of its surrounding areas in the northern Indian region pose significant threats to both lives and properties. To mitigate the risk of seismic events, an earthquake early warning system can be used in the region. This system would be particularly beneficial to cities and towns in the mountainous and foothill regions that are located near earthquake sources. The government and the science and engineering community have re-sponded to this call by establishing the Uttarakhand State Earthquake Early Warning System (UEEWS). The system became fully operational on August 4, 2021, after being launched by the government of Uttarakhand. The UEEWS includes 170 accelerometers in the seismogenic part of the Uttarakhand region of the Himalayas. Ground motion data is transmitted to a central server through a dedicated private telecommunication network 24 hours a day, seven days a week.The system is designed to issue warnings for moderate to high-magnitude earthquakes via a mobile application installed on users' devices and sirens installed in government-owned public buildings. The UEEWS has successfully issued alerts for light earthquakes that occurred in the instrumented region and warnings for moderate earthquakes that occurred in the vicinity of the instrumented area. This paper provides an overview of the design of the UEEWS, details of the instrumentation, adaptation of attributes and their relation to earthquake parameters, the operational flow of the system, and information about the dissemination of warnings

{This study investigates the coordinated behaviors and the underlying collective intelligence in biological groups, particularly those led by informed leaders. By establishing new convergence criteria based on real biological group experiments, this research introduces the concept of a volitional term and heterogeneous networks, constructing a coupled force Cucker-Smale model with informed leaders. The inclusion of the informed leader aspect distinctively characterizes the dynamics of leaders and followers, enabling a more accurate representation of biological group behavior. The paper then proposes the Flock Leadership Hierarchy Network (FLH), a model reflecting real biological interactions. By employing time slicing and rolling time windows, the study methodically analyses group behavior stages, using volatility and convergence time as metrics to examine the relationship between group consistency and interactions. Comparative experiments show the FLH network's superior performance. The Kolmogorov-Smirnov test indicates that the FLH network follows a power-law distribution, highlighting the evolutionary intelligence of biological groups. This research offers new perspectives on the evolution of biological groups, contributing to our understanding of both natural and artificial systems, such as animal migration and autonomous drone operations.

The segmentation of abnormal regions is vital in smart manufacturing. However, the existing segmentation system for detecting sauce-packet leakage on intelligent sensors encounters an issue of imaging blurring caused by uneven illumination. This issue adversely affects segmentation performance, thereby impeding the rapid production of industrial assembly lines. To alleviate this issue, we propose the two-stage Illumination-aware Sauce-packet Leakage Segmentation (ISLS) method for intelligent sensors. The ISLS comprises two main stages: Illumination-aware region enhancement and leakage region segmentation. In the first stage, YOLO-Fastestv2 is employed to capture the Region of Interest (ROI), which reduces redundancy computations. Additionally, we propose an image enhancement to relieve the impact of uneven illumination, enhancing the texture details of ROI. In the second stage, we propose a novel feature extraction network. Specifically, we propose the Multi-scale Feature Fusion Module (MFFM) and the Sequential Self-Attention Mechanism (SSAM) to capture discriminative representations of leakage. The multi-level features are fused by MFFM with a small number of parameters, which capture leakage semantics at different scales. The SSAM realizes the enhancement of valid features and the suppression of invalid features by adaptive weighting of spatial and channel dimensions. Furthermore, we generated a self-built dataset of sauce-packets, including 606 images with various leakage areas. Comprehensive experiments demonstrate that our ISLS method shows better results than several state-of-the-art methods, with additional performance analyses deployed on intelligent sensors to affirm the effectiveness of our proposed method. Our code is available at https://github.com/LSJ5106/SauceDetect.

The future index prices are viewed as a critical issue for any trader and investor. For this craving, various models have shown up in the literature. The Geometric Brownian motion (GBM) is one of the popular models. This work examines four types of GBM as per the presence of memory or kind of volatility. These models include classical GBM with memoryless and constant volatility assumptions, SVGBM with memoryless and stochastic volatility assumption, GFBM with memory and constant volatility assumption, and SVGFBM with memory and stochastic volatility assumption. These models are utilized in an empirical study to forecast the future index price of Energy Sector in the Saudi Stock Exchange Market. The assessment was led by utilizing two error standards, mean square error (MSE) and mean absolute percentage error (MAPE). The outcomes showed that the SVGFBM occupies the highest level of accuracy according to smallest values of MSE and MAPE. While the accuracy of GBM come in the tail of the list models under study. These results have affirmed the positive affection of combining memory and stochastic volatility assumption into the GBM model, which agreed findings of numerous earlier works. Furthermore, the findings showed the GFBM models are more accurate than GBM models regardless of the type of volatility. While, under the same type of memory, the models with stochastic volatility assumption are more accurate than the corresponding models of constant volatility assumption. In general, all models considered in this work uncovered high accuracy through the value of MAPE ≤ 10%. This indicates of the ability of applying these models in a real financial environment. Through this empirical study, we can say that the Energy Sector in Saudi Arabia is predictable and stable and afterward we urge financial investors and stockholder to trade and invest in this sector.

With the use of linear regression modeling, this study sought to forecast and analyze rainfall patterns in Ethiopia. The dataset included historical rainfall data as well as pertinent independent variables. The R-squared score and mean squared error (MSE) were used to assess the effectiveness of the linear regression model. The results showed that the model's ability to forecast and analyze rainfall patterns was not very good. Only around 5.3% of the variance in rainfall could be explained by the chosen independent variables, according to the R-squared score of 0.053. This low number indicated that there was little correlation between the selected variables and rainfall, and that a sizable percentage of the variation in the dependent variable was not captured by the model. The model's accuracy in forecasting rainfall was shown to be quite low by the MSE error, with significant squared discrepancies between the expected and actual amounts. These results support the notion that the linear regression model as it is now designed is not appropriate for studying or forecasting Ethiopia's rainfall patterns. Alternative modeling approaches, the inclusion of other pertinent factors, and the assurance of the availability of high-quality data that faithfully captures the intricate dynamics of rainfall in the area all require more investigation.

In the dynamic landscape of the telecommunications industry, understanding and mitigating customer churn is paramount for maintaining competitive advantage and sustaining revenue streams. This comprehensive literature review delves into the intricacies of customer churn prediction, a crucial aspect in fortifying the bond between telecom businesses and their customers. The review methodically analyzes 11 articles published between 2000 and March 2024, spotlighting the strategic role of Customer Relationship Management and the prevalence of high churn rates that necessitate a shift from customer acquisition to retention strategies. Furthermore, the review navigates through the challenges inherent in churn prediction, including the complexities of managing large, imbalanced, and noisy datasets and the intricacies involved in model selection and optimization. Despite these challenges, the paper highlights the superior capability of machine learning techniques in handling complex datasets to provide accurate predictions, albeit acknowledging their practical complexities. The main aim of the study is to provide an overview, serving as a knowledge base for researchers interested in machine learning techniques within the realm of telecommunications.

Cloud-induced atmospheric extinction and occlusion have a major effect on the effectiveness and quality of telescope observations. Real-time cloud cover distribution and long-term statistical data are essential for astronomical siting and telescope operations. At ground-based astronomical telescope sites, cloud cover distribution is currently analyzed using manual observation methods. However, the main disadvantages of manual observation methods are human subjective, heavy workloads and poor real-time performance. Therefore, a real-time automatic cloud images classification method is desperately needed. This paper presents a new cloud identification method, which is named PSO+XGBoost model by combining eXtreme Gradient Boosting (XGBoost) and Particle Swarm Optimization (PSO). The entire cloud image is divided into 37 sub-regions in order to more precisely identify the distribution of the clouds. 19 features are then extracted, including the sky background, star density, lighting conditions, and subregion grayscale values. The experimental results have shown that the overall classification accuracy of 96.91% and our model is able to outperform several state-of-the-art baseline methods. Our approach achieves high accuracy in comparison with the manual observation methods. Moreover, this method meets telescope real-time scheduling requirements.

In the present study. At first, some properties of r-fuzzy soft β-closed sets are introduced on fuzzy soft topological spaces based on the paper Aygunoglu et al. (Hacet. J. Math. Stat. 2014, 43, 193-208). Also, we define the closure and interior operators with respect to the classes of r-fuzzy soft β-closed and r-fuzzy soft β-open sets, and investigate some of their properties. In addition, the concept of r-fuzzy soft β-connected sets is introduced and characterized with help of fuzzy soft β-closure operators. Thereafter, some properties of a fuzzy soft β-continuity are studied. Furthermore, we introduce and study the concepts of fuzzy soft almost (weakly) β-continuous functions, which are weaker forms of a fuzzy soft β-continuity. Also, the relationships between these classes of functions are specified with the help of some illustrative examples. Finally, we explore new types of fuzzy soft functions called, fuzzy soft β-irresolute (strongly β-irresolute, β-irresolute open, β-irresolute closed and β-irresolute homeomorphism) functions, and discuss some properties of them. Also, we show that fuzzy soft strongly β-irresolute → fuzzy soft β-irresolute → fuzzy soft β-continuity, but the converse may not be true.

We give a series of numerical examples of competitive evolution in the predation system, showing in some cases how the choice is made to increase the efficiency of the predation mechanism (or other significant parameters) to the detriment of populations (both of prey and predators). We then develop the mathematical theory that enables us to understand the causality involved, and identify a trend towards the emergence of the functional predation mechanism as such (and not of populations of the species involved). The realization of this trend only takes place when the conditions for it are offered by the hazards proposed to successive competitive choices. The logical structure of this trend is similar to that of the « tendency of rate of profit to fall » in certain economic models.

The research of object classification and part segmentation is a hot topic in computer vision. A considerable number of studies have been carried out about deep learning on 3D point clouds. However,it is challenging to achieve effective feature learning due to sparsity of point clouds. Recently, a variety of Transformers have been adopted to improve point cloud processing and display great potential. Nevertheless, large numbers of Transformer layers tend to incur huge computational and memory costs. PointNet++ is one of the most influential neural architectures for point cloud understanding. Although the accuracy of PointNet++ has been largely surpassed by recent networks, this does not mean that PointNet++ has no potential.Thus, this paper offer two major contributions that significantly improve PointNet++ performance. Firstly, we introduce a novel contextual feature extraction (CFE) block that significantly enhances the feature extraction capabilities of PointNet++ networks. Secondly, to further enhance feature fusion, we seamlessly integrate a mutual learning (ML) block into the network architecture. By embedding these two innovative blocks within each layer of the network, we not only enrich the network's functionality but also impart it with greater robustness and adaptability. The specific experiments were conducted on the S3DIS (6-fold cross-validation) and Modelnet40 datasets with 86.5% and 92.7% accuracy, respectively, which proved that our model is comparable or even better than most existing methods for classification and segmentation tasks.

Accurate classification of objects in 3D point clouds is a significant problem in several applications, such as autonomous navigation and augmented/virtual reality scenarios, which has become a research hot spot. In this paper, we presented a deep learning strategy for 3D object classification in augmented reality. The proposed approach is a combination of the GRU and LSTM. LSTM networks learn longer dependencies well, but due to the number of gates, it takes longer to train; on the other hand, GRU networks have a weaker performance than LSTM, but their training speed is much higher than GRU, which is The speed is due to its fewer gates. The proposed approach used the combination of speed and accuracy of these two networks. The proposed approach achieved an accuracy of 0.99 in the 4,499,0641 points dataset, which includes eight classes (unlabeled, man-made terrain, natural terrain, high vegetation, low vegetation, buildings, hardscape, scanning artifacts, cars). Meanwhile, the traditional machine learning approaches could achieve a maximum accuracy of 0.9489 in the best case.

The pursuit of Artificial Intelligence (AI) that emulates human cognitive processes is a cornerstone of ethical AI development, ensuring that emerging technologies can integrate seamlessly into societal frameworks requiring nuanced understanding and decision-making. Zero-Shot Instance Retrieval (ZSIR) stands at the forefront of this endeavour, potentially providing a robust platform for AI systems, particularly large visual language models, to demonstrate and refine cognition-aligned learning without the need for direct experience. In this paper, we critically evaluate current cognition alignment methodologies within traditional zero-shot learning paradigms, using visual attributes and word embedding generated by large AI models. We propose a unified similarity function that quantifies the cognitive alignment level, bridging the gap between AI processes and human-like understanding. Through extensive experimentation, our findings illustrate that this similarity function can effectively mirror the visual-semantic gap, steering the model towards enhanced performance in zero-shot instance retrieval. This work not only benchmarks the cognition alignment of AI, but also sets a new precedent for the development of visual language models attuned to the complexities of human cognition.}

The growing impact of Artificial Intelligence (AI) on Humanity is unavoidable, and therefore, “AI literacy” is extremely important. In the field of education – AI in education (AIED) – this technology is having a huge impact on the educational community and on the education system itself. The present study seeks to assess the level of AI literacy of teachers at Portalegre Polytechnic University (PPU), aiming to identify gaps, find the main opportunities for innovation and development and seek the degree of relationship between the dimensions of AI literacy, as well as identifying the predictive variables in this matter. As a measuring instrument, a validated questionnaire based on three dimensions (AI Literacy, AI Self-Efficacy and AI Self-Management) was applied to a sample of 75 teachers in the various schools of PPU. This revealed an average level of AI literacy (3.28), highlighting that 62.4% of responses are at levels 3 and 4 (based on a Likert scale from 1 to 5). The results also demonstrate that the first dimension is highly significant for the total dimensions, i.e., for AI Literacy, and no factor characterizing the sample is a predictor, but finding a below-average result in the Learning factor indicates a pressing need to focus on developing these skills.

Confusion, fear and mixed sentiments prevail in the minds of people towards what is arguably one of the most important of dynamics of modern human society: Artificial Intelligence (AI). This study aims to explore the contributions of news media towards this phenomenon - we analyze nearly seventy thousand recent news headlines on AI, using natural language processing (NLP) informatics methods, machine learning (ML) and large language models (LLMs) to draw insights and discover dominant themes. Our theoretical framework was derived from extant literature which posits the power of fear producing articles and news headlines which produce significant impacts on public behavior even when available in small quantities. We applied extensive textual informatics methods using word and phrase frequency analytics, sentiment analysis and human experts based thematic analysis to discover insights on AI phobia inducing news headlines. Our rigorous analysis of nearly seventy thousand headlines using multiple validation methods in NLP (exploratory informatics including BERT, Llama 2 and Mistral based topic identification), ML (supervised informatics) and LLMs (neural nets for sentiment classification, with BERT, Llama 2 and Mistral) demonstrates the presence of an unreasonable level of emotional negativity and fear inducing verbiage in AI news headlines. The framing of AI as being dangerous or as being an existential threat to humanity can have a profound impact on public perception, and the resulting AI phobia and confusion in public perceptions are inherently detrimental to the science of AI. Furthermore, this can also impact AI policy and regulations, and harm society. We conclude with a discussion deducing implications for society and make recommendations for education and policies that could support human identity and dignity.

Recently, there has been considerable research on deepfake detection. However, most existing methods face challenges in adapting to the advancements in new generative models within unknown domains. In addition, the emergence of new generative models capable of producing and editing high-quality images, such as Diffusion, Consistency, and LCM, poses a challenge for traditional deepfake training models. These advancements highlight the need for adapting and evolving existing deepfake detection techniques to effectively counter the threats posed by sophisticated image manipulation technologies. In this paper, our objective is to detect deepfake videos in unknown domains using unlabeled data. Specifically, our proposed approach employs Meta Pseudo Labels (MPL) with Supervised Contrastive Learning, so-called SupCon-MPL, allowing the model to be trained on unlabeled images. MPL involves the simultaneous training of both a Teacher model and a Student model, where the Teacher model generates Pseudo Labels utilized to train the Student model. This method aims to enhance the adaptability and robustness of deepfake detection systems against emerging unknown domains. Supervised Contrastive Learning utilizes labels to compare samples within similar classes more intensively, while encouraging greater distinction from samples in dissimilar classes. This facilitates the learning of features in a diverse set of deepfake images by the model, consequently contributing to the performance of deepfake detection in unknown domains. When utilizing the ResNet50 model as the backbone, SupCon-MPL exhibited an improvement of 1.58% in accuracy compared to traditional MPL in known domain detection. Moreover, in the same generation of unknown domain detection, there was a 1.32% accuracy enhancement, while in the detection of post-generation unknown domains, there was an 8.74% increase in accuracy.

It is proved that there exist two odd prime numbers, p_i and p_j , such that p_i + p_j = 2r + 2(r ⩾ 2), where p_n denote the n-th odd prime number, 1 ⩽ i, j ⩽ n. By the theory of generating functions, we prove that there exist two positive integers, h_i and h_j , such that h_i + h_j = r(r ⩾ 2), where h_n = (p_n − 1)/2，(p_n ⩾ 3).Then we complete the proof.

As technology and multimedia production have advanced, there has been a significant rise in attacks on digital media, resulting in duplicated, fraudulent, and altered data and the infringement of copyright laws. This paper presents a robust and secure digital image watermarking technique that has been implemented in the spatial domain and exploits the erratic and chaotic behaviour of the powerful elementary cellular automata rule-30. The crucial characteristics of the watermarking system, i.e., imperceptibility, capacity, and robustness, have been perfectly balanced by the suggested blind watermarking technique. In this approach, prior to embedding, the grayscale watermark image is downsized to its two Most Significant Bits (MSBs). Then, the 2-MSBs watermark is encrypted using an ECA rule-30 so as to level up the security attribute of the system. Then, the host image is scrambled using ECA rule-30 to distribute the watermark pixels throughout the host image and thus achieve the highest robustness against geometrical attacks. Finally, the encrypted watermark data is embedded into the scrambled host image using the ECA rule-30-based embedding key. The proposed method performs better in terms of imperceptibility, capacity, and robustness when compared to several systems with similar competencies. The simulation's findings demonstrate strong imperceptibility as evaluated by the Peak Signal-to-Noise Ratio (PSNR), which has an average value of 58.3735 dB and a high payload. The experimental outcomes, observed across a diverse range of standardized attack scenarios, unequivocally establish the ascendancy of the proposed algorithm over competing methodologies in the realm of image watermarking.

The modern supply chain (SC) is growing in terms of data, devices, users, and stakeholders, which introduced new security challenges and threats, especially with the reliance on centralized servers or cloud platforms. In addition, increased trust among system participants exposes the SC to a higher risk of vulnerabilities which require strong security measures. This article proposes a hybrid security framework for SC systems, BC-DRLzSC, that integrates Blockchain (BC) and Deep Reinforcement Learning (DRL) designed to operate in a zero trust (ZT) environment. In particular, we propose a decentralized BC-based approach integrated with smart contracts to manage system participant registration and authentication and to control access to system resources. BC-DRLzSC adopts a ZT architecture to reinforce SC security, which can be achieved with an advocate to verify each entity’s trustworthiness before granting or retaining access to system resources. Incorporating the ZT architecture, with BC and DRL, can potentially and significantly bolster SC system security. DRL is employed to develop a proactive attack detection model that continuously monitors the incoming traffic from authenticated nodes within the network and predicts any malicious actions. Finally, we evaluate the performance of our proposed DRL solution using the NSL-KDD dataset.

In this paper we present two ways to solve the Jacobian conjecture. The first way is an equivalent statement to the Jacobian conjecture using idempotent ideals. The second way is to use an equivalent thesis to the thesis of the Jacobian conjecture. In both cases we will show that the Jacobian conjecture is true.

As matrix representations of magic labelings of related hypergraphs, magic squares and their various variants have been applied to many domains. Among various subclasses, trimagic squares have been investigated for over a hundred years. The existence problem for trimagic squares with singly even orders and orders 16n has been solved completely. However, very little is known for the existence of trimagic squares with other even orders except for the only three examples and three families. We construct normal trimagic squares by using product constructions, row-square magic rectangles, and trimagic pairs of orthogonal diagonal Latin squares. We give a new product construction: For positive integers p, q, and r having the same parity other than 1, 2, 3, 6, if normal p × q and r × q row-square magic rectangles exist, then a normal trimagic square with order pqr exists. As its application, we construct normal trimagic squares of orders 8q^3 and 8pqr for all odd integers q not less than 7 and p,r ∈ {7, 11, 13, 17, 19, 23, 29, 31, 37}. Our construction can easily be extended to construct multimagic squares.

Software stands as one of the most rapidly evolving technologies in the present era, characterized by its swift expansion in both scale and complexity which leads to challenges in quality assurance. Software Defect Prediction (SDP) emerges as a methodology crafted to anticipate undiscovered defects, leveraging known defect data from existing codes. This methodology serves to facilitate software quality management, thereby ensuring overall product quality. Machine Learning (ML) and Deep Learning (DL) methodologies exhibit superior accuracy and adaptability compared to traditional statistical approaches catalyzing active researches in this domain. However, it makes us hard to generalize not only because of the disparity between open-source project and commercial project but also the difference on each industrial sectors. Consequently, further research utilizing datasets sourced from diverse real-world sectors becomes imperative to bolster the applicability of these findings. In this study, we utilized embedded software for telecommunication systems of SAMSUNG ELECTRONICS, supplemented by the introduction of nine novel features to train the model, and subsequent analysis of results ensued. Experimental outcomes revealed that the F-measurement metric has been enhanced from 0.58 to 0.63 upon integration of the new features, thereby signifying a performance augmentation of 8.62%. This case study is anticipated to contribute to bolster the application of SDP methodologies within analogous industrial sectors.

Let $(\{f_n\}_{n=1}^\infty, \{\tau_n\}_{n=1}^\infty)$ and $(\{g_n\}_{n=1}^\infty, \{\omega_n\}_{n=1}^\infty)$ be unbounded continuous p-Schauder frames ($0<p<1$) for a disc Banach space $\mathcal{X}$. Then for every $x \in ( \mathcal{D}(\theta_f) \cap\mathcal{D}(\theta_g))\setminus\{0\}$, we show that \begin{align}\label{UB} \|\theta_f x\|_0\|\theta_g x\|_0 \geq \frac{1}{\left(\displaystyle\sup_{n,m \in \mathbb{N} }|f_n(\omega_m)|\right)^p\left(\displaystyle\sup_{n, m \in \mathbb{N}}|g_m(\tau_n)|\right)^p}, \end{align} where \begin{align*} & \theta_f: \mathcal{D}(\theta_f) \ni x \mapsto \theta_fx \coloneqq \{f_n(x)\}_{n=1}^\infty\in \ell^p(\mathbb{N}), \quad \theta_g: \mathcal{D}(\theta_g) \ni x \mapsto \theta_gx \coloneqq \{g_n(x)\}_{n=1}^\infty\in \ell^p(\mathbb{N}). \end{align*} Inequality (1) is unexpectedly different from both bounded uncertainty principle \textit{[arXiv:2308.00312v1]} and unbounded uncertainty principle \textit{[arXiv:2312.00366v1]} for Banach spaces.

Effective agricultural management in maize production operations starts with the early quantification of seedlings. Accurately determining plant presence allows growers to optimize planting density, allocate resources, and detect potential growth issues early on. This study presents an in-depth analysis of multiple object detection models used by drones to count maize seedlings, while concurrently investigating the influence of planting density, flight altitude, and plant growth stage. The findings of this study demonstrate that one-stage models are able to more accurately detect maize seedlings than two-stage models. In particular, YOLOv8n exhibits outstanding performance, achieving an F1-score of over 0.92 under various density conditions and maintaining a stable performance, especially under densities below 105,000 plants/ha. Additionally, planting density and growth stage were observed to significantly affect detection accuracy, with performance declining as density and growth stage increased. Image resolution and detection were impacted by flight altitude, with lower flights producing higher-quality results. Ultimately, YOLOv8n displays optimal performance under various conditions, providing crucial data to support intelligent decision-making. This research offers valuable insights into the application of object detection technology and provides a basis for the future development of precision agriculture.

The main sources of intrinsic noise in excitable cells at the microcircuit and network levels are the stochastic characteristics of ion channel gating and activation of the synaptic conductance. Studies using in vivo, in vitro, and in silico methods to examine the effects of synaptic background activity were not adequately investigated in non-neuronal excitatory cells, where neurotransmitter-based innervation also occurs. We created a mathematical model to replicate the background synaptic noise dynamics in a non-neuronal cell. We utilized the stochastic Ornstein-Uhlenbeck process to represent excitatory synaptic conductance, which was incorporated into a whole-cell model to produce spontaneous and evoked cellular electrical activities. The single-cell model includes many biophysically detailed ion channels represented by a set of ordinary differential equations in Hodgkin-Huxley and Markov formalisms. This paradigm effectively induced irregular spontaneous depolarizations (SDs) and spontaneous action potential (sAP) resembling in vitro-like electrical activity in the cells. The input resistance decreased by multiple factors, and the spontaneous action potential firing rate elevated. The potential to reach the action potential threshold is altered. Background synaptic activity can alter the input/output characteristics of non-neuronal excitatory cells. Suppressing these baseline activities would facilitate the discovery of new pharmaceutical targets for different clinical diseases.

Anticipating and planning for the urgent response to large-scale disasters is critical to increase the probability of survival in these events. These incidents present various challenges that complicate the response, such as unfavorable weather conditions, difficulties in accessing affected areas, and the geographical spread of the victims. Furthermore, local socioeconomic factors such as insufficient prevention education, limited disaster assets, and inadequate coordination between public and private emergency services may complicate these situations. In large-scale emergencies, multiple hotspots are usually observed, which requires efforts to coordinate the strategic allocation of human and material resources in different geographical areas. Therefore, the precise management of these resources based on the specific needs of each area becomes fundamental. To address these complexities, this paper proposes a methodology that models these scenarios as an optimization problem, focusing on the location and allocation of resources in mass casualty incidents. The proposed case study is Mexico City in a post-earthquake scenario, using voluntary geographic information, open government data, and historical data from the September 19, 2017 earthquake. Additionally, it is assumed that the resources that require optimal location and allocation are ambulances, which focus on medical issues that affect the survival of victims. The designed solution involves the use of a metaheuristic optimization technique, along with a parameter tuning technique, to find configurations that perform at different instances of the problem, i.e., different hypothetical scenarios that can be used as a reference for future possible situations. Finally, the objective is to present the different solutions graphically, accompanied by relevant information to facilitate the decision-making process of the authorities responsible for the practical implementation of these solutions.

The two-parameter distribution introduced by Kumaraswamy (1980) is a very flexible alternative to the Beta distribution with the same (0,1) support. Originally proposed in the field of hydrology, it has subsequently received a good deal of positive attention in both the theoretical and applied statistics literatures. Interestingly, the problem of testing formally for the appropriateness of the Kumaraswamy distribution appears to have received little or no attention to date. To fill this gap, in this paper we apply the “biased transformation” methodology proposed by Raschke (2009) to several standard goodness-of-fit tests based on the empirical distribution function. A simulation study reveals that these (modified) tests perform well in the context of the Kumaraswamy distribution, in terms of both low size distortion, and respectable power. In particular, the “biased transformation” Anderson-Darling test dominates the other tests that are considered.

Contemporary financial systems, despite their inherent complexity and resilience, face significant challenges related to transparency, efficiency, and security. Notable deficiencies in transparency and emerging security vulnerabilities underscore the pressing need for innovative solutions in current financial practices. Hence, this paper introduces a financial distribution system based on a consortium blockchain. Given organizations’ preference for keeping sensitive data private, the partially decentralized nature of consortium blockchains plays a pivotal role in the proposed system’s architecture. Moreover, within this system, the proposed smart contract serves a dual role. It functions not only as a transactional tool but also as a specialized solution designed to improve transactional procedures. Its multifaceted capabilities include ensuring data accuracy, facilitating swift execution, and ensuring adherence to regulatory requirements within the dynamic financial distribution landscape. Through rigorous testing and empirical analysis utilizing the Hyperledger Besu platform, it has been observed that the performance of the proposed system surpasses traditional blockchain frameworks. The results unequivocally demonstrate the proposed system’s proficiency in handling high-frequency financial transactions with minimal computational burden.

This paper considers a specific fragment of Linear Temporal Logic for Finite traces, DECLAREd, which, to the best of our knowledge, we prove for the first time to be a {polytime} fragment of LTLf. We derive this in terms of the following ancillary results: we propose a set of novel LTLf equivalence rules that, when applied to \LTLf specifications, lead to an equivalent specification which can be computed faster by any existing verified temporal artificial intelligence task. We also introduce the concept of temporal non-simultaneity, prescribing that two activities shall never satisfy the same atom, and temporal short-circuit, that occurs when a specification interpreted in LTL would accept an infinitely long trace while, on LTLf, it can be rewritten so to postulate the absence of certain activity labels. We test these considerations over formal synthesis (Lydia), SAT-Solvers (AALTAF) and formal verification (KnoBAB) tools, where formal verification can be also run on top of a relational database and can be therefore expressed in terms of relational query answering. We show that all these benefit from the aforementioned assumptions, as running their tasks over a rewritten equivalent specification will improve their running times.

Artificial intelligence (AI) is increasingly being used to improve the quality control of point-of-care diagnostics. This is caused by a number of factors, including the following: 1. AI can accelerate and improve testing accuracy. In comparison to humans, AI technology can review data more quickly and precisely, reducing errors and improving overall quality assurance. 2. When it comes to improving POC test findings on healthcare issues such as infectious diseases or medical crises such as heart attacks, AI can be used for sophisticated predictive analytics and modeling that aid in better decision-making. 3. Artificial intelligence facilitates process automation, increasing productivity and lowering labor costs in labor-intensive tasks such as testing and analyzing samples collected at point-of-care facilities. 4. The use of AI enables organizations implementing these solutions to gain insights from large volumes of raw diagnostic data generated faster and more accurately, allowing them to build solid frameworks around preventive care initiatives and significantly influence public health outcomes.5. Artificial intelligence (AI) has been demonstrated to be a useful tool for real-time monitoring systems that identify any problems with test results early so that they can be corrected before affected patients receive inaccurate diagnoses or treatment plans based on false information provided by diagnostic tests performed at points of care such as clinics or hospitals.Using these technologies would allow healthcare organizations to spend less on labor while still receiving exact diagnoses and rapid treatment delivery at a fraction of the cost that manual approaches required earlier.

The current paper provides a cutting-edge information data length- theoretic approach to human emotions. This is a revolutionary breakthrough that unifies information data length and the dynamics of emotions. The significant impact of both time and its mean value associate on both the upper and lower bounds of the obtained information data length is observed and noted. The paper concludes with some challenging open problems, combined with concluding remarks and future research pathways.

Artificial intelligence (AI) has witnessed an exponential increase in its use in various applications. Recently, the academic community started to research and inject new AI-based approaches to provide solutions to traditional software engineering problems. However, a comprehensive and holistic understanding of the current status is missing. To close the above gap, synthetic knowledge synthesis was used to induce a research landscape of the contemporary research literature on the use of AI in software engineering. The synthesis resulted in 15 research categories and five themes, namely natural language processing in software engineering, use of artificial intelligence in the management of software development life cycle, use of machine learning in fault/defect prediction and effort estimation, employment of deep learning in intelligent software engineering and code management, and mining software repositories to improve software quality. The most productive country was China (n=2042), followed by the United States (n=1193), India (n=934), Germany (n=445), and Canada (n=381). A high percentage (n=47.4%) of papers were funded, showing a strong interest in this research topic. The convergence of AI and software engineering can significantly reduce needed resources, improve quality, increase user experience, and improve the well-being of software developers.

SARS-CoV-2 Omicron variant spike RBD epitopes in complex with spike (S) -protein D614G mutations now predominate globally and increase infectivity by assembling more functional S proteins into the virion. On average, homeopathic medicine contains less than one molecule per dose on average. Single variable SphericalHarmonicY, LaguerreL, WhittakerM, SphericalBesselJ, LegendreP, LegendreQ, LaguerreL, ChebyshevT, and Hypergeometric1F1 Functions pFqarise in connection with the power series solution of the Schrodinger equation or in the summation of perturbation expansions in quantum mechanics. A quantum interpretation of the homeopathic method is presented here through a novel algebraic topology approach to supersymmetry and symmetry breaking in quantum fields and quantum gravity theory with the aim of developing a wide range of physical-based drug design applications in a Small Molecule Quantized Water Memory Network suggesting that the Hidden Black Hole Paradox of Information Loss might be solved under suitable conditions.

The basic idea is to expand the completed zeta function $\xi(s)$ in MacLaurin series (infinite polynomial), which can be further expressed as infinite product (Hadamard product) by conjugate complex roots. Finally, the functional equation $\xi(s)=\xi(1-s)$ leads to $(s-\alpha_i)^2 = (1-s-\alpha_i)^2, i \in \mathbb{N}$ with solution $\alpha_i= \frac{1}{2}, i \in \mathbb{N}$, where $\alpha_i$ are the real parts of the zeros of $\xi(s)$, i.e., $s_i =\alpha_i\pm j\beta_i, i\in \mathbb{N}$. Therefore, a proof of the Riemann Hypothesis is achieved.

The Eurasian grapevine (\textit{Vitis vinifera L.}) is the most widely grown horticultural crop in the world and is important for the economy of many countries. In the wine production chain, grape varieties play an important role, as they directly influence the authenticity and classification of the product. Identifying the different grape varieties is therefore fundamental for quality control and control activities, as well as for regulating production. Currently, ampelography and molecular analysis are the main approaches to identifying grape varieties. However, both methods have limitations. Ampelography is subjective and prone to errors and is experiencing enormous difficulties as ampelographers are increasingly scarce. On the other hand, molecular analyses are very demanding in terms of cost and time. In this scenario, Deep Learning (DL) methods have emerged as a classification alternative to deal with the scarcity of ampelographers and avoid molecular analyses. In this study, the most recent and current methods for identifying grapevine varieties using DL classification-based approaches are presented through a systematic literature review. The steps of the standard DL-based classification pipeline were described for the 18 most relevant studies found in the literature, highlighting their pros and cons. Potential directions for improving this field of research were also presented.

IMPORTANCE: On December 10, 2021, the FDA published a Determination Letter, along with a Statistical Review and Evaluation Report, and concluded that under the non-informative prior, the local Bayesian optimal interval design (BOIN) design, in its revised form, can be designated fit-for-purpose for identifying the maximum tolerated dose of a new drug, assuming that dose-toxicity relationship is monotonically increasing. Although setting the BOIN design parameter p.tox = 1.4 * target.DLT.rate is recommended in almost all BOIN methodology articles and is the default value in the R package BOIN, it's unclear if the choice of p.tox should only depend on the target DLT rate and if certain range of p.tox could produce the same BOIN boundary table. DESIGN: In this simulation study, following parameters were varied one at a time, using R package BOIN, to explore their effects on the equivalence intervals of p.saf and p.tox: 1) target DLT rate, 2) n.earlystop, 3) cutoff.eli, 4) cohortsize, and 5) ncohort. And a simple 3+3 design was used as an example to explore equivalent sets of BOIN design parameters that can generate the same boundary table. RESULTS: When the early stopping parameter n.earlystop is relatively small or the cohortsize value is not optimized via simulation, it might be better to use p.tox < 1.4 * target.DLT.rate, or try out different cohort sizes, or increase n.earlystop, whichever is both feasible and provides better operating characteristics. This is because if the cohortsize was not optimized via simulation, even when n.earlystop = 12 and cohortsize > 3, the BOIN escalation/de-escalation rules generated using p.tox = 1.4 * target.DLT.rate could be exactly the same as those calculated using p.tox > 3 * target.DLT.rate, which might not be acceptable for some pediatric trials targeting 10% DLT rate. The traditional 3+3 design stops the dose finding process when 3 patients have been treated at the current dose level, 0 DLT has been observed, and the next higher dose has already been eliminated. If additional 3 patients were required to be treated at the current dose in the situation described above, the decision rules of this commonly used 3+3 design could be generated using BOIN design with target DLT rates ranging from 18% to 29%, p.saf ranging from 8% to 26%, and different p.tox values ranging from 39% to 99%. These BOIN parameters also need to satisfy a set of conditions. Meaning: This study demonstrates the importance of interpreting BOIN design parameter p.tox as an interval of toxicity rates that are considered too toxic, rather than one prespecified value that corresponds to the lowest toxicity probability that is deemed overly toxic. When designing a dose-finding trial using BOIN, it is important to perform simulation studies to identify equivalent sets of BOIN design parameters that can generate the same boundary table so that we can better compare the safety properties of different boundary tables.

Count data analysis presents unique challenges due to its discrete nature, often exhibiting excessive zeros and overdispersion. To address these complexities, count models, such as Poisson regression and Negative Binomial regression, have been developed, enabling modeling and prediction of count-based phenomena. Additionally, it’s important to notice that zero inflation, a phenomenon commonly observed in count data, requires specialized techniques for robust analysis. This article provides an overview of count data and count models, explores zero inflation, introduces Likelihood Ratio Tests, and explains how the Vuong Test can be used as a model selection criteria. Furthermore, we created a Vuong Test implementation from scratch using the Python programming language. This implementation enhances the accessibility and applicability of the Vuong Test in real-world scenarios, providing a valuable contribution to the academic community, since Python didn’t have an implementation of this statistical test.

The paper delineates the developed vision system of the UR5 cobot and the operating algorithm of the robotic quality control station. The hardware-software architecture of the developed robotic station was shown, consisting of a UR5 cobot equipped with a web camera and a stationary industrial camera with a lighting system. Image processing and analysis algorithms were described, the method of control and communication between the station components was discussed, and two operating scenarios were presented as a single robotic station and a robotic line. Based on the results obtained, the level of measurement noise, accuracy, and repeatability of the developed vision system were estimated.

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.

In this work we looked for a stable and accurate procedure to perform feature selection in datasets with a much higher number of predictors than individuals, as in Genome-Wide Association Studies. Due to the instability in feature selection when many potential predictors are measured, a variable selection procedure is proposed that combines several replications of shrinkage regression models. A weighted formulation is used to define the final predictors. The procedure is applied to investigate Single Nucleotide Polymorphisms (SNPs) predictors associated to Alzheimer’s disease in the Alzheimer’s disease Neuroimaging Initiative (ADNI) dataset. Two data scenarios are investigated: one considering only the set of SNPs and another with the covariates age, sex, educational level and APOE4 genotype. The SNP rs2075650 and the APOE4 genotype are given as risk factors for AD, which is in line with the literature, and other four new SNPs are pointed, opening new hypotheses for in vivo analyses. These experiments demonstrate the potential of the new method for stable feature selection.

Software project estimating (SPE) is a powerful but necessary step in the production of projects for software. Software project estimating includes several components, estimating software time, software resources, software costs, and software effort estimation (SEE). SEE seeks to estimate the number of "hours-person" and "months-person" of work required for developing or managing a software program. During the initial phase of the development of software, future efforts are impossible to predict. To estimate effort, many deep learning (DL) and machine learning (ML) models were previously created. For estimate, single-model techniques and ensemble methods were investigated in this research. Ensemble methods involve a combination of multiple separate models. Bagging, boosting, and voting were the ensemble methods looked into for estimation. Datasets considered for estimation were COCOMO81, COCOMONasa I, COCOMONasa II, Albrecht, Maxwell, China, Desharnais, Desharnais_1_1, Kitchenham, Boehm, and Belady. The evaluation criteria used MAE, RAE, RMSE, RRSE, and CC. The result from previous studies is that the total size of the set of data utilized is small in predicting the effort, as the largest size of the set of data used is the China dataset containing only 499 projects. So, in this study, the dataset has been merged to increase the total size of the set of data and increase the accuracy of prediction. The results indicated that the suggested merged dataset increased effort estimation accuracy.

In this study, we propose the Signal Integration Reconstruction Peak Detection (SIRPD) algorithm for reliable Cardiac Beat Interval (CBI) measurement using functional Near-Infrared Spectroscopy (fNIRS) signals. This algorithm enhances reliability by identifying a regular waveform in cerebral blood flow associated with heartbeats. The SIRPD algorithm assesses the Signal Quality Index (SQI) per channel, discards signals from unavailable channels, and interpolates oxygenated and total hemoglobin concentration signals, thereby boosting resolution and integrating the signal into a single channel. The integrated and smoothed signal is transformed to identify the most significant periodic waveform, from which the CBI is extracted. Validated with data from 20 healthy subjects who simultaneously recorded fNIRS and ECG signals, our findings confirm the equivalence of the CBI derived from ECG and calculated through the SIRPD algorithm from fNIRS (R^2 = .98, RMSE = .011, ICC = .991). We also extracted heart rate variability (HRV) features, confirming no significant difference in all features between ECG and fNIRS devices. Uniquely, this study regards the fNIRS heart signal not as an artifact source but as a valuable bio signal. The proposed method, which allows for the detection of cardiac beat intervals from cerebral blood flow oscillations, suggests the potential clinical applicability of fNIRS as an auxiliary indicator for various cardiovascular factors.

Taekwondo has evolved from a traditional martial art into an official Olympic sport. This study introduces a novel action recognition model tailored for Taekwondo unit actions, utilizing joint motion data acquired via wearable inertial measurement unit (IMU) sensors. The utilization of IMU sensor-measured motion data facilitates the capture of the intricate and rapid movements characteristic of Taekwondo techniques. The model, underpinned by a conventional convolutional neural network (CNN)-based image classification framework, synthesizes action images to represent individual Taekwondo unit actions. These action images are generated by mapping joint motion profiles onto the RGB color space, thus encapsulating the motion dynamics of a single unit action within a solitary image. To further refine the representation of rapid movements within these images, a time-warping technique was applied, adjusting motion profiles in relation to the velocity of the action. The effectiveness of the proposed model was assessed using a dataset compiled from 40 Taekwondo experts, yielding remarkable outcomes: an accuracy of 0.998, precision of 0.983, recall of 0.982, and an F1-score of 0.982. These results underscore the time-warping technique's contribution to enhancing feature representation, as well as the proposed method's scalability and effectiveness in recognizing Taekwondo unit actions.

To secure logic circuits against the illegal copying the insertion of the so-called key bit inputs using XOR/XNOR gates has been proposed in . The inserted gates modify (lock) the behavior of the original circuit and only the correct choice of the secret key bits guarantees the equivalent behaviour of the locked circuit to the original circuit. To break this kind of security, i.e. to find the secret key bits, there was a SAT solver based attack proposed in . The aim of this work is to experimentally verify this attack on several locked circuits with various number of primary inputs and outputs and with various number of gates. Except for the random placement of the key gates we evaluate also the positioning with chaining elimination. The obtained and presented results show that we were able to unlock 10 of 11 circuits within few minutes on a common PC.

This study introduces a novel computational approach for testing conditional independence (BB CI test) within causal Directed Acyclic Graphs (DAGs), leveraging Bayesian non-parametric bootstrap and machine learning techniques. Our method offers an alternative for validating the assumptions underpinning causal DAGs. Through simulation studies and an industrial case analysis, we demonstrate the test procedure in accurately assessing conditional independence, comparing it with the Generalized Covariance Measure (GCM) test. Our findings suggest that the BB CI test is advantageous in scenarios where existing methods may falter due to violations of model assumptions. This research contributes to the causal inference literature by providing a computational tool for researchers and practitioners to validate causal models.

In this paper the one-to-one correspondences and equivalences between ideals, primals, filters and grills are introduced. It is shown the local functions and the topological spaces induced by them are the same. From this point of view, the topological properties with respect to one topology can be derived from topological properties valid in the corresponding topology.

Artificial intelligence (AI) has emerged as a powerful tool for addressing the challenges posed by climate change and their impact on public health. By leveraging its capacity to analyze and predict climatic patterns, AI offers opportunities to enhance resource management and develop effective strategies for climate change mitigation. Moreover, AI can contribute to generating sustainable solutions that address the complex and interconnected nature of climate change. For example, AI can enable the optimization of energy consumption and facilitate the integration of renewable energy sources into existing systems. It can also support the development of climate models that provide timely and accurate predictions, enabling policymakers to implement proactive measures for disaster preparedness and response. Furthermore, AI-powered disease surveillance and mitigation techniques can improve public health outcomes by identifying patterns and trends in the spread of diseases in relation to climatic factors.However, the widespread adoption of AI-based solutions is not without challenges. Ethical concerns surrounding privacy and data ownership must be addressed, as the use of AI requires access to large datasets, raising potential privacy risks. Technical constraints, such as limited computational power and the need for sophisticated algorithms, also pose obstacles to the implementation of AI in climate change mitigation strategies. Furthermore, issues related to the accessibility and affordability of AI technologies must be resolved to ensure equitable distribution and maximize its potential impact on public health.To fully harness the power of AI in addressing climate change and improving public health outcomes, it is crucial to promote innovation, multidisciplinary collaboration, and open data science. Innovation can drive the development of new AI algorithms and technologies specifically tailored to address climate change challenges. Multidisciplinary approaches that bring together experts from diverse fields, including climate science, public health, and computer science, can foster a holistic understanding of complex systems and enable the design of comprehensive solutions. Finally, open data science practices, such as sharing data and algorithms, can facilitate collaboration and accelerate progress in mitigating climate change and its public health impacts.In conclusion, AI offers promising opportunities for effectively addressing climate change and its impact on public health. However, to fully realize its potential, it is essential to tackle ethical and privacy concerns, overcome technical constraints, and ensure accessibility and affordability. By promoting innovation, multidisciplinary collaboration, and open data science, we can unlock the transformative power of AI in mitigating climate change and improving public health outcomes.

Over the years, the need for autonomous systems such as drones, also known as unmanned aerial vehicles (UAVs), has significantly increased in popularity across several industries, including the military. The Internet of Battlefield Things (IoBT) represents a modern technological advancement that significantly enhances the operational efficacy of defense systems. It establishes an integrated military force by connecting individuals to intelligent technology in drones, radios, equipment, antennas and ground stations. This is achieved through the utilization of cloud and edge computing, sensors, mobile devices, embedded systems, and IoT-based systems. However, IoBT security is significantly compromised by enemies that exploit the vulnerabilities and malicious intrusions that specifically target the external environment or to obtain sensitive data. In addition, a comprehensive understanding of cyberattacks and countermeasures is essential for assuring the security of IoBT. On the other hand, as cyber threats get more complicated, trust becomes increasingly important for the security of digital systems. Within this context, the zero trust architecture contends that the security of a complex network is inherently vulnerable to internal and external threats. In defense, UAV security system applications, for example, the primary purpose of the zero trust architecture is to limit the vulnerability of military UAV systems to cyberattacks, hence reducing the possibility of data breaches and illegal entry. This study conducts a systematic review aimed at identifying different aspects of cybersecurity strategies for protecting UAV systems within the IoBT domain. Furthermore, zero trust architecture is presented in the study as an effective prospective solution to the security issues that develop in defense UAV systems.

In the application domain, accurate word sense identification is crucial for improving the performance of machine translation, information retrieval and end-to-end communication tasks. However, word polysemy is a major obstacle to accurate semantic identification. Therefore, word semantic disambiguation has always been one of the key challenges in natural language processing and has attracted the attention of a large number of researchers. This research proposes an innovative disambiguation algorithm based on the large-scale Bert model and the Polly encoder framework, and introduces WordNet as a benchmark for word semantic. By exploiting the ability of the pre-trained model to extract and learn semantic information, and using a specially designed forward propagation algorithm and loss function to fine-tune the large-scale Bert model, the model has high Accuracy and robustness. In this research, several experiments were conducted on the Semcor 3.0 semantic dataset. The experimental results show that the model proposed in this research shows excellent performance on the Semcor test set, with an Accuracy of 86.1% and an F1 score of 0.847, which is a significant improvement over the traditional model.

This article focuses on the analysis of dynamics emerging in a Network of Hodgkin-Huxley Reaction-Diffusion equations. The network is forced with three external periodic stimulus input. A synchronization phenomenon is observed.

Partial Information Decompositions (PIDs) aim to categorize how a set of source variables provide information about a target variable redundantly, uniquely, or synergetically. The original proposal for such an analysis used a lattice-based approach and gained significant attention. However, finding a suitable underlying decomposition measure is still an open research question, even at an arbitrary number of discrete random variables. This work proposes a solution to this case with a non-negative PID that satisfies an inclusion-exclusion relation for any f-information measure. The decomposition is constructed from a pointwise perspective of the target variable to take advantage of the equivalence between the Blackwell and zonogon order in this setting. We prove that the decomposition satisfies the axioms of the original decomposition framework and guarantees non-negative partial information results. We highlight that our decomposition behaves differently depending on the used information measure, which can be utilized for different applications. We additionally show how our proposal can be used to obtain a non-negative decomposition of Rényi-information at a transformed inclusion-exclusion relation, and for tracing partial information flows through Markov chains.

The emergence of Internet of Things (IoT) devices is revolutionizing healthcare. This dynamic healthcare environment relies on Internet of Healthcare Things (IoHT) and Internet of Medical Things (IoMT) technologies. Economic, social, and technological opportunities from the IoHT are transforming healthcare systems. This article covers the history, present condition, and future prospects of IoHT, as well as its topologies, platforms, services, applications, market trends, and solution types. It examines security issues, requirements, and a threat taxonomy, studying smart healthcare privacy and security. It explores future research and the challenges IoHT-based solutions face. International health rules and regulations based on the IoT and their social and economic effects on long-term development are also examined. Integrating IoMT into healthcare infrastructures enhances scalability, efficiency, reliability, and accuracy. Through communication networks and data-processing algorithms, IoMT creates smart hardware and software platforms that enhance decision-making. IoMT devices' low resources raise privacy and security concerns. Security and privacy issues are organised by healthcare IoMT adoption in this study. We give an extensive attack taxonomy against the IoMT infrastructure, encompassing devices, security mechanisms, and their pros and cons. Furthermore, it describes the privacy and security requirements for any unique security solutions against IoMT's multiple attack vectors. This article explains the complicated difficulties, security concerns, and future research pathways needed to safeguard and ensure the long-term expansion of these game-changing technologies in the healthcare ecosystem.

ACL instability poses a significant challenge in traumatology and orthopedic medicine, often requiring accurate diagnosis for appropriate treatment. While the pivot-shift test offers a crucial means of assessment, its reliance on subjective interpretation underscores the need for supplementary imaging studies. This study aims to address this limitation by developing a Bayesian classification algorithm tailored for integration into a mobile application. Using the built-in inertial sensors of smartphones, this new approach aims to dynamically evaluate rotational stability during knee examinations. Orthopedic specialists conducted knee evaluations on 52 subjects, with subsequent analysis revealing interesting insights. Intraobserver and interobserver analyses, as measured by ICC, demonstrated strong agreement both in terms of timing between maneuvers (ICC = 0.94) and signal amplitude (ICC = 0.71-0.66). Notably, the Bayesian algorithm successfully classified 95% of joint hypermobility cases, with an additional 7 cases of hyperlaxity identified by the Pivot-Shift Meter (PSM). These findings highlight the practicality and effectiveness of implementing a Bayesian classification algorithm within a mobile application for assessing and categorizing signals captured by smartphone inertial sensors during the pivot-shift test.

This paper presents a comprehensive analysis of the SEIRS COVID-19 pandemic model with saturated incidence rate. By modifying the existing model and proposing a new simplified version, we investigate the dynamics of disease transmission, including the impact of saturation terms on disease spread. Through stability analysis at disease-free and endemic equilibria, we aim to enhance understanding of the spread of COVID-19 and inform effective control strategies. Drawing on mathematical models and epidemiological insights, this study contributes to the ongoing efforts to combat the global pandemic.

Data Meshes is an approach to data architecture and organization that treats data as a product and focuses on decentralizing data ownership and access. It has recently emerged as a field that presents quite a few challenges related to data ownership, governance, security, monitoring, and observability. To address these challenges, this paper introduces an innovative algorithmic framework leveraging data blueprints to enable the dynamic creation of Data Meshes and Data Products in response to user requests, ensuring that stakeholders will have access to specific portions of the Data Mesh as needed. Ownership and governance concerns are addressed through a unique mechanism involving Blockchain and Non-Fungible Tokens (NFTs). This facilitates secure and transparent transfer of data ownership, with the ability to mint time-based NFTs. By combining these advancements with the fundamental tenets of Data Meshes, this research offers a comprehensive solution to the challenges surrounding data ownership and governance. It empowers stakeholders to navigate the complexities of data management within a decentralized architecture, ensuring a secure, efficient, and user-centric approach to data utilization. The proposed framework is demonstrated using real-world data from a poultry meat production factory.

This study presents a dynamic modeling approach to investigate the impact of saturation dynamics on HIV/AIDS transmission in the presence of vertical transmission and treatment strategies. The proposed model incorporates disease-free and endemic equilibria, with a focus on analyzing the basic reproduction number and conducting stability analysis. Results indicate that the disease-free equilibrium is locally asymptotically stable under certain conditions. The findings suggest that a combination of treatment interventions and awareness campaigns, along with other control measures, may play a crucial role in curbing the spread of the HIV/AIDS virus. This research contributes to understanding the complex dynamics of HIV/AIDS epidemics and highlights the importance of considering saturation effects in epidemic modeling.

Through the use of Smart Sensor Networks (SSN), Marine Observatories (MO) provide continuous ocean monitoring. Deployed sensors may not perform as intended due to the heterogeneity of SSN devices’ hardware and software when combined with the Internet. Hence, SSN are regarded as complex distributed systems. As such, SSN designers will encounter challenges throughout the design phase related to time, complexity, sharing diverse domain experiences (viewpoints), and ensuring optimal performance for the deployed SSN. To this end, we describe in this article how we extended our previously proposed ArchiMO meta-model and design tool by extending an Enterprise Architecture Framework based on the ArchiMate Modeling Language. This extension proposes the incorporation of new Underwater Environmental Constraints (UEC) for SSN in ArchiMO which is coupled with the fusion of sensors with Artificial Intelligence. This serves as the basis for generating a new version of our ArchiMO design tool, which incorporates the new added constraints and invokes the AI created Database. To illustrate our proposal, we use the newly generated ArchiMO to create a model in the MO domain. Furthermore, we use our self-developed domain-specific model compiler to produce the relevant simulation code. Throughout the design phase, our approach contributes to handle and control the uncertainties and variances of the provided quality of service that may occur during the performance of the SSN, hence reducing the design activity’s complexity and time. It provides a way to share the different viewpoints of the designers in the domain of SSN.

The rapid evolution of technology has given rise to a connected world, where billions of devices interact seamlessly, forming what is known as the Internet of Things (IoT). While IoT offers incredible convenience and efficiency, it presents a significant challenge in cybersecurity and is characterized by various power, capacity, and computational process limitations. Machine learning techniques are employed within Intrusion Detection Systems (IDS) to enhance their capabilities in identifying and responding to security threats. The key features selected to improve IDS efficiency and reduce dataset size, thereby decreasing the time required for attack detection, are drawn from the extensive network dataset. This paper introduces an enhanced feature selection method designed to reduce the computational overhead on IoT resources while simultaneously strengthening intrusion detection capabilities within the IoT environment. Experimental results based on the InSDN dataset demonstrate that our proposed methodology achieves the highest accuracy with the fewest number of features and low computational cost. Specifically, we attain a 99.99% accuracy with 11 features and a computational time of 0.8599 seconds.

The only cases where exact distributions of estimates are known is for samples from exponential families, and then only for special functions of the parameters. So statistical inference was traditionally based on the asymptotic normality of estimates. To improve on this we need the {\it Edgeworth expansion} for the distribution of the standardized estimate. This is an expansion in $n^{-1/2}$ about the normal distribution, where $n$ is typically the sample size. The 1st few terms of this expansion were originally given for the special case of a sample mean. In earlier work we derived it for {\it any } standard estimate, hugely expanding its application. We call an estimate $\hat{w}$ of an unknown vector $w\in R^p$, a {\it standard estimate}, if $E\ \hat{w}\rightarrow w$ as $n\rightarrow \infty$, and for $r\geq 1$ the $r$th order cumulants of $\hat{w}$ have magnitude $n^{1-r}$ and can be expanded in $n^{-1}.$ Here we give another huge extension. We give the expansion of the distribution of {\it any smooth function} of $\hat{w}$, say $t(\hat{w})\in R^q,$ giving its distribution to $n^{-5/2}$. We do this by showing that $t(\hat{w})$, is a standard estimate of $t(w)$. This provides far more accurate approximations for the distribution of $t(\hat{w})$ than its asymptotic normality. %NOT USED: The building blocks of the Edgeworth expansions are the {\it cumulant coefficients } of the estimate. These cumulant coefficients are also needed for bias reduction, Bayes estimates and confidence regions. We give {\it chain rules} for the cumulant coefficients of $t(\hat{w})$ in terms of those of $\hat{w}$ and the derivatives of $t(w)$, up to those needed for 5th order Edgeworth expansions for $t(\hat{w})$ and its {\it tilted expansion}, useful for the tail of the distribution.

Classical Arabic poetry is a form of Arabic literature, and almost every piece of Arabic poetry follows one of the 16 meters. The rhythmic framework of the poems or the verses is called meters. The deep learning (DL) model was implemented using TensorFlow in this work using a large dataset of Arabic poetry. The character level encoding was used to convert text to integers for classifying the full-verse and half-verse data. The study evaluates the data without removing diacritics from the text. The train-test-split method with a 70-15-15 split was employed for classification. 15% of the total data was considered unseen test data for all models. The work was conducted with multiple deep learning models, including the Long Short-Term Memory (LSTM), Gated Recurrent Units (GRU), and Bidirectional LSTM (Bi-LSTM). The Bi-LSTM model shows the best accuracy of all the models specified, with 97.53% for full-verse and 95.23% for half-verse without removing diacritic data.

This review aims to consolidate varied information regarding Port Scanning, and examine the tools, techniques, and detection algorithms used. It explores TCP SYN, Full TCP, UDP, and stealth scans, and shows their functions and abilities. Paired with these techniques, it also shows the tools that they can be used by, such as NMap, Zmap, and MASSCAN. It discusses the various detection techniques such as Signature and Anomaly based detection, and discusses the real world impact of this technology, while commenting on the legal and ethical issues posed.

In this paper we describe a method which combines sentiment analysis with machine learning techniques and/or multivariate statistical analysis. By applying this methodology it is possible to classify a collection of texts into two or more groups or clusters. On the basis of a number of previously defined clusters, the novelty of the outlined approach is the use of the sentiment analysis results as input to the machine learning model or multivariate statistical analysis. Once the classifier has been obtained, we can assign a given text into one of the pre-established clusters. The groups or clusters can represent different time periods, classes of texts transcribed from different conversations, etc. The method is illustrated through an example taken from one of the two studies in which we have applied this methodology. In one of the studies, the method was used to classify press news of a volcanic eruption, while in the other study it was used to classify the conversations recorded between a chatbot with different kinds of speakers (humans or chatbots). This last study was the seminal work in which we introduced this methodology.

This study introduces SkinLiTE, a lightweight supervised contrastive learning model, tailored to enhance the detection and typification of skin lesions in dermoscopic images. The core of SkinLiTE lies in its unique integration of supervised and contrastive learning approaches, which leverages labeled data to learn generalizable representations. This approach is particularly adept at handling the complexities and imbalances inherent in skin lesions datasets. The methodology encompasses a two-phase learning process. In the first phase, SkinLiTE utilizes an encoder network and a projection head to transform and project dermoscopic images into a feature space where contrastive loss is applied, focusing on minimizing intra-class variations while maximizing inter-class differences. The second phase freezes the encoder's weights, leveraging the learned representations for classification through a series of dense and dropout layers. The model was evaluated using three datasets from Skin Cancer ISIC 2019-2020, covering a wide range of skin conditions. SkinLiTE demonstrated superior performance across various metrics—accuracy, AUC , and F1 score—particularly when compared with traditional supervised learning models. Notably, SkinLiTE achieved an accuracy of 0.9087 using AugMix augmentation for binary classification of skin lesions. It also showed comparable results with the state-of-the-art approaches of ISIC challenge without relying on external data, underscoring its efficacy and efficiency. The results highlight the potential of SkinLiTE as a significant step forward in the field of dermatological AI, offering a robust, efficient, and accurate tool for skin lesion detection and classification. Its lightweight architecture and ability to handle imbalanced datasets make it particularly suited for integration into Internet of Medical Things environments, paving the way for enhanced remote patient monitoring and diagnostic capabilities. This research contributes to the evolving landscape of AI in healthcare, demonstrating the impact of innovative learning methodologies in medical image analysis.

Machine Learning is increasingly and ubiquitously being used in the medical domain. Evaluation metrics like accuracy, precision, and recall may indicate the performance of the models but not necessarily the reliability of their outcomes. This paper assesses the effectiveness of a number of machine learning algorithms applied to an important dataset in the medical domain, specifically, mental health, by employing explainability methodologies. Using multiple machine learning algorithms and model explainability techniques, the project provides insights into the model workings to help determine the reliability of the machine learning algorithm predictions. The results are not intuitive. It was found that the models were focusing significantly on less relevant features and at times, unsound ranking of the features to make the predictions. The paper therefore argues that it is important for research in applied machine learning to provide insights into explainability of the models in addition to other performance metrics like accuracy. This is particularly important for applications in critical domains such as healthcare. A future direction is to investigate methods to quantify the effectiveness of the machine learning models in terms of the insights from their explainability.

Cellular Technology came into existence in Japan in 1979. From that time, we have seen many advances in technology. Currently, most of the person uses either 4G or 5G, among which 5G is a newer technology. 4G network was the first network to use LTE. LTE stands for Long Term Evaluation. Most people get confused between 4G and LTE, they assume both to be the same. In reality, LTE has evolved on the 4G technology. It was first introduced in 2008 to provide higher efficiency and data rates to the cellular network. It was designed to evolve the performance of the networks which includes the evolution of hardware components, optimization of software, power and cost efficiency. This work presents a study on LTE, LTE-A and VoLTE technology. We also discussed about the several packet scheduling algorithms that are being used for transmission of packets. It brings out new opportunities for the researchers to work on increasing the efficiency of those algorithms by modifications.

In this paper, a new full-Newton step feasible interior point method for convex quadratic programming is presented and analyzed. The idea behind this method is to replace the complementarity condition with a non-negative variable weight vector and use the algebraic equivalent transformation for the obtained equation. Under the selection of appropriate parameters, the quadratic rate of convergence of the new algorithm is established. In addition, the iteration complexity of the algorithm is obtained. Finally, some numerical results are presented to demonstrate the practical performance of the proposed algorithm.

Evolutionary algorithms and swarm intelligence algorithms find applicability in reinforcement learning of neural networks due to their independence from gradient-based methods. To achieve successful training of neural networks using these algorithms, careful considerations must be made to select appropriate algorithms due to the availability of various algorithmic variations. In Part1, 2 and 3, the author previously reported experimental evaluations on Evolution Strategy, Genetic Algorithm, and Differential Evolution for reinforcement learning of neural networks, utilizing the Acrobot control task. This article constitutes Part4 of the series of comparative research. In this study, Particle Swarm Optimization is adopted as an instance of major swarm intelligence algorithms. The experimental result shows that PSO performed worse than all of DE, GA and ES. The difference between PSO and DE was statistically significant (p<.01). In addition, PSO exhibited lower capability in exploring solutions in high-dimensional search spaces than DE, GA, and ES did. A larger swarm size compensated for the weakness of PSO in global exploration, thus making itself more beneficial than a larger number of swarm search iterations.

This paper introduces an Agent-Based Model (ABM) for investigating the dynamics of the Internet of Things (IoT) ecosystem, specifically focusing on dynamic coalition formation among IoT Service Providers (SPs). Extending our prior work in 5G network modeling, the ABM captures intricate interactions among device, network operator, SP, and customer agents, offering a versatile framework for studying IoT ecosystem dynamics. The simulation portrays the adaptive nature of collaborations, providing insights into the role of dynamic coalition formation in shaping the collaborative landscape of IoT.

This paper will discuss Data, Information, Knowledge, and Wisdom, which is commonly referred to as DIKW. The DIKW Pyramid Model that is often referenced in both academics and practitioner circles will be discussed and shown to be faulty on several levels, including. a lack of definitional agreement. A new DIKW framework will be proposed that focuses on what the DIKW elements do in the way humans think, not what they are by definition. Information as a replacement for wasted physical resources in goal-oriented tasks will be a central organizing point. The paper will move the DIKW discussion to the computer-based concept of Digital Twins (DTs) and its augmentation of how we can use DIKW to be more effective and efficient. This will especially be the case as we move to Intelligent Digital Twins (IDT) with Artificial Intelligence (AI).

Diabetic retinopathy (DR) is the primary factor leading to vision impairment and blindness in diabetic people. Uncontrolled diabetes can damage the retinal blood vessels. Initial detection and prompt medical intervention are vital in preventing progressive vision impairment. Today's growing medical field poses more significant workload and diagnostic demands on medical professionals. In the proposed study, a convolutional neural network (CNN) is employed to detect the stages of DR. This research is crucial for studying DR because of its innovative methodology incorporating two different public datasets. This strategy enhances the model's capacity to generalize unseen DR images, as each dataset encompasses unique demographics and clinical circumstances. The network can learn and capture complicated hierarchical image features with asymmetric weights. Each image undergoes preprocessing using contrast-limited adaptive histogram equalization (CLAHE) and the discrete wavelet transform (DWT). The model is trained and validated using the combined datasets of Dataset for Diabetic Retinopathy (DDR) and the Asia Pacific Tele-Ophthalmology Society (APTOS). The CNN model is tuned with different learning rates and optimizers. The CNN model with Adam optimizer achieved 70% accuracy and an area under curve (AUC) score of 0.82. The recommended study results may reduce diabetes-related vision impairment by early DR severity identification.

Deep Learning (DL) oriented document processing is widely used in different fields for extraction, recognition, and classification processes from raw corpora of data. The article examines the application of deep learning approaches, based on different neural network methods, including Gated Recurrent Unit (GRU), Long Short-Term Memory (LSTM), and Convolutional Neural Networks (CNN). The compared models were combined with two different word embedding techniques, namely: Bidirectional Encoder Representations from Transformers BERT and Gensim Word2Vec. The models are designed to evaluate the performance of architectures based on neural network techniques for the classification of CVs of Moroccan engineering students at ENSAK(National School of Applied Sciences of Kenitra, Ibn Tofail University). The used dataset included resumes collected from engineering students at ENSAK in 2023 for a project on the employability of Moroccan engineers in which new approaches were applied, especially machine learning, deep learning, and big data. Accordingly, 867 resumes were collected from five specialties of study (Electrical Engineering, Networks and Systems Telecommunications, Computer Engineering, Automotive Mechatronics Engineering, Industrial Engineering). The results revealed good performance of the proposed models based on the BERT embedding approach compared to models based on the Gensim Word2Vec embedding approach. Accordingly, the CNN-GRU/Bert model achieved slightly better accuracy with 0.9251 compared to other hybrid models.

The result of the multidisciplinary collaboration of researchers from different areas of knowledge to validate a solar radiation model is presented. The MAPsol is a 3D local-scale adaptive solar radiation model that allows to estimate direct, diffuse and reflected irradiance for clear sky conditions. The model includes the adaptation of the mesh to complex orography and albedo, and considers the shadows cast by the terrain and buildings. The surface mesh generation is based on surface refinement, smoothing and parameterisation techniques and allows the generation of high quality adapted meshes with a reasonable number of elements. Another key aspect of the paper is the generation of a high-resolution digital elevation model (DEM). This high-resolution DEM is constructed from LiDAR data and its resolution if two times more accurate than the publicly available DEMs. The validation process uses direct and global solar irradiance data obtained from pyranometers at the University of Salamanca located in an urban area affected by systematic shading from nearby buildings. This work provides an efficient protocol for studying solar resources, with particular emphasis on areas of complex orography and dense buildings where shadows can potentially make solar energy production facilities less efficient.

Proteins need to be located in appropriate spatiotemporal contexts to carry out their diverse biological functions. Mislocalized proteins may lead to a broad range of diseases, such as cancer and Alzheimer’s disease. Knowing where a target protein resides within a cell will give insights into tailored drug design for a disease. As the gold validation standard, the conventional wet lab uses fluorescent microscopy imaging, immunoelectron microscopy, and fluorescent biomarker tags for protein subcellular location identification. However, the booming era of proteomics and high-throughput sequencing generates tons of newly discovered proteins, making protein subcel-lular localization by wet-lab experiments a mission impossible. To tackle this concern, in the past decades, artificial intelligence (AI) and machine learning (ML), especially deep learning methods, have made significant progress in this research area. In this article, we review the latest advances in AI-based method development in three typical types of approaches, including sequence-based, knowledge-based, and image-based methods. We also elaborately discuss existing challenges and future directions in AI-based method development in this research field.

Predictions of mean values of statistical variables of large scale turbulent flow by the widely used basic k-ϵ model and a new fundamentally based model are verified against published results of Direct Numerical Simulations DNS of the Navier-Stokes equations. The verification concerns turbulent channel flow at shear Reynolds numbers of 950, 2000 and 104. The basic k-ϵ model is largely based on empirical formulations accompanied by calibration constants. This contrasts with the new model where descriptions of leading statistical quantities are based on the general principles of statistical turbulence at large Reynolds number. Predicted values of major output variables such as turbulent viscosity, diffusivity of passive admixture, temperature, and fluid velocities compare well with DNS in case of the new model. Significant differences are seen in case of the basic k-ϵ model.

The Brain-Computer Interface (BCI) technology has emerged as a groundbreaking innovation with profound implications across diverse domains, particularly in healthcare. By establishing a direct communication pathway between the human brain and external devices, BCI systems offer unprecedented opportunities for diagnosis, treatment, and rehabilitation, thereby reshaping the landscape of medical practice. However, despite its immense potential, the widespread adoption of BCI technology in clinical settings faces several challenges. These include the need for robust signal acquisition and processing techniques, ensuring user safety and privacy, addressing ethical considerations, and optimizing user training and adaptation. Overcoming these challenges is crucial to unleashing the complete potential of BCI technology in healthcare and realizing its promise of personalized, patient-centric care. This review work underscores the transformative potential of BCI technology in revolutionizing medical practice. This paper offers a comprehensive analysis of medical-oriented BCI applications by exploring the various uses of BCI technology and its potential to transform patient care.

Text mining is a technological trend often highlighted in the continuous exchange of information through interconnected media. Its applicability goes beyond private organizations, as the public sector also requires it to treat textual information regarding services offered. Within this scenario, public security emerges as a prominent user of text mining that seeks to ensure the construction of data and knowledgebases to support decision-making about law enforcement actions to ensure citizen welfare. The primary objectives of this article are: (i) to develop a survey to identify text mining applications, techniques, opportunities, and challenges in public security, and (ii) to outline research directions concerning these topics and provide insights so that interested researchers can develop new studies. The literature was searched within four databases: Scopus, IEEE Xplore, ACM Digital Library, and Web of Science. A filtering process was applied to extract the works most aligned with the target theme, resulting in the selection of 194 of the most relevant works for a literature review. There were identified nineteen key applications of text mining related to public security and the most recurrent techniques and technologies reported between 2014 to 2021, supporting outlining three axes for future directions: one with possible expansion of objectives for new research; another on changes and adaptations in scopes for the methodological context; and the last one on expansions and changes in application scenarios based on the literature.

This paper proposed an optimal tracking control scheme through adaptive dynamic programming(ADP) for a class of partially unknown discrete-time nonlinear systems based on radial basis function neural network(RBF-NN). In order to acquire the unknown system dynamics, we use two RBF-NNs, the one is used to construct the identifier, and the another is used to directly approximate the steady-state control input, where a novel adaptive law is proposed to update neural network weights. While the optimal feedback control and the cost function are derived via feedforward neural networks approximating, it is proposed to regulate the tracking error, the critic network and the actor network are then trained online to obtain the solution of the associated Hamilton–Jacobi–Bellman (HJB) equation being built under the ADP framework. Simulations verify the effectiveness of the optimal tracking control technique using the neural networks.

The increasing availability of longitudinal data (repeated numerical observations of same units at different times) requires the development of flexible techniques to automatically detect common errors in such data. Besides obvious and easily identifiable cases, such as missing or out-of-range data, large longitudinal dataset often present problems not easily traceable by the techniques used for generic datasets. In particular, elusive and baffling problems are i) inversion of one or more values from one unit to another; ii) anomalous jumps in the series of values, iii) errors in the timing of the values due to a recalculation operated by the data providers to compensate previous errors. This work proposes a statistical-mathematical approach based on a system of indicators that is able to capture the complexity of the described problems by working at the formal level, regardless of the specific meaning of the data. The proposed approach identifies suspect erroneous data and is applicable in a variety of contexts. We implement this approach in a relevant database of European Higher Education institutions (ETER) by analyzing Total academic staff, that is one of the most important variables, used in empirical analysis as proxy of size and also considered by policy makers at European level.

Collatz conjecture (3x+1 problem) is a natural phenomenon in set theory that may be reconstructed using known combinatorics and order theory. Construction begins by selecting a specific order isomorphism with a bijectional order-embedding. Mapping by 3x+1 induces a unique property to only members of the mapped embedding. Under selective congruence from recursive division by two, that complex controls sequence behavior. This demonstration uses an order isomorphism consisting of two linear orders: the (1) odd positive integers and the always odd (2) Rule 50 Jacobsthal numbers, as the embedding. The argument proceeds by cardinality. When the order isomorphism is mapped under 3x+1, all Rule 50 Jacobsthal numbers are mapped to all the powers of four. This one-to-one correspondence guarantees that every odd integer is assigned to a Rule 50 Jacobsthal number, and subsequently, to a power of four. To align this construction with the conjecture, expand the set to all positive integers by showing that: (1) the powers of four embed the powers of two, in a natural way, and (2) the unique factorization of any positive even integer, not congruent to a power of two, is simply an odd integer, once the factorized power of two is divided out. In other words, if the initial choice for a positive integer is not congruent to a power of two, then recursion continues until a Rule 50 Jacobsthal number (guaranteed by cardinality) is attained. Since this value mapped by 3x+1 is always a power of four, repeated division by two will always send the sequence to one. Because this same process occurs for any choice of positive integer, Collatz conjecture is true.

The reviews usefulness has been the aim of several research studies. However, results regarding the significance of usefulness determinants are often contradicting, thus decreasing the accuracy of reviews’ helpfulness estimation. Also, bias in user reviews attributed to differences e.g. in gender, nationality, etc., may result into misleading judgments thus diminishing reviews’ usefulness. Research is needed for sentiment analysis algorithms that incorporate bias embedded in reviews, thus improving their usefulness, readability, credibility, etc. This study utilizes fuzzy relations and fuzzy synthetic evaluation (FSE) in order to calculate reviews’ usefulness by incorporating users’ biases as expressed in terms of reviews’ articulacy and sentiment polarity. It selected and analysed 95.678 hotel user reviews from Tripadvisor, for five nationalities. The findings indicate that there are differences among nationalities. The British are most consistent in their judgments expressed in titles and review documents. The British and the Greek review titles suffice to convey any negative sentiments. The Dutch use fewer words in their reviews than the other nationalities. This study suggests that fuzzy logic captures subjectivity which is often found in reviews, and it can be used to quantify users’ behavioral differences, calculate reviews usefulness, and provide the means for developing more accurate voting systems.

Today, LLMs are not good at personalization providing recommendation. They advise physicians and financial advisors to ask professionals in respective fields for help, even having user information available. Answering questions of software professionals, LLM needs to deliver in-depth answers with codes or algorithms, whereas for professionals in other fields would need definitions and main concepts. The intent of this chapter is to make LLM answer tailored to the needs of users, taking into account available information about them. To do that, we need to generalize available information about a person like her health record, maintaining the privacy of this person. We rely on meta-learning techniques to design a LLM prompt to produce a personalization prompt to obtain a suitable relevant information. Such “meta-prompt” is produced by generalization operation applied to available documents for the user. These documents need to be de-identified so that they are sufficient for personalization on one hand and will maintain user privacy on the other hand. The second neuro-symbolic technique to support personalization is abductive reasoning, acting in parallel to LLM fine-tuning. Traditional recommendation and personalization techniques as well as modern, deep learning – based are presented, and the comparison is drawn to the proposed approach. We also share the evaluation and comparative analyses of these approaches. We consider an example for how to build personalization LLM systems coming from Langchain platform. We will explore how to construct chains to form a personalization profile for a user and apply it to user search and recommendation requests.