Recent studies have shown correlations between the microbiota's composition and various health conditions. Machine learning (ML) techniques are essential for analyzing complex biological data, particularly in microbiome research. ML methods help analyze large datasets to uncover microbiota patterns and understand how these patterns affect human health. This study introduces a novel approach combining statistical physics with the Monte Carlo (MC) methods to characterize bacterial species in the human microbiota. We assess the significance of bacterial species in different age groups by using notions of statistical distances to evaluate species prevalence and abundance across age groups and employing MC simulations based on statistical mechanics principles. Our findings show that the microbiota composition experiences a significant transition from early childhood to adulthood. Species such as Bifidobacterium breve and Veillonella parvula decrease with age, while others like Agathobaculum butyriciproducens and Eubacterium rectale increase. Additionally, low-prevalence species may hold significant importance in characterizing age groups. Finally, we propose an overall species ranking by integrating the methods proposed here in a multicriteria classification strategy. Our research provides a comprehensive tool for microbiota analysis using statistical notions, ML techniques, and MC simulations.

The current surge in the deployment of web applications underscores the need to consider users' individual preferences in order to enhance their experience. In response to this, an innovative approach is emerging that focuses on the detailed analysis of interaction data captured by web browsers. This data, which includes metrics such as the number of mouse clicks, keystrokes, and navigation patterns, offers insights into user behaviour and preferences. By leveraging this information, developers can achieve a higher degree of personalization in web applications, particularly in the context of interactive elements such as online games. This paper presents the WebTraceSense project, which aims to pioneer this approach by developing a framework that encompasses a backend and frontend, advanced visualization modules, a DevOps cycle, and the integration of AI and statistical methods. The backend of this framework will be responsible for securely collecting, storing, and processing vast amounts of interaction data from various websites. The frontend will provide a user-friendly interface that allows developers to easily access and utilize the platform’s capabilities. One of the key components of this framework is the visualization modules, which will enable developers to monitor, analyse, and interpret user interactions in real-time, facilitating more informed decisions about user interface design and functionality. Furthermore, the WebTraceSense framework incorporates a DevOps cycle to ensure continuous integration and delivery, thereby promoting agile development practices and enhancing the overall efficiency of the development process. Moreover, the integration of AI methods and statistical techniques will be a cornerstone of this framework. By applying machine learning algorithms and statistical analysis, the platform will not only personalize user experiences based on historical interaction data but also infer new user behaviours and predict future preferences. In order to validate the proposed components, a case study was conducted which demonstrated the usefulness of the WebTraceSense framework in the creation of visualizations based on an existing dataset.

In manufacturing chatter is an unwanted phenomenon that can lead to product quality reduction and tool wear. Real time chatter detection is key to preventing these issues and improving overall machining efficiency. In this paper we propose an unsupervised chatter detection method using autoencoders (AE) and Density-Based Spatial Clustering of Applications with Noise (DBSCAN) clustering algorithm that uses internal signals of Computer Numerical Control (CNC) machines. The proposed method starts by using an AE to extract features from raw internal signals collected from CNC machines. This step reduces the dimensionality of the data and captures the underlying patterns of chatter. Then the extracted features are fed into DBSCAN clustering algorithm which is a density based algorithm that groups similar data points and identifies outliers. We tested the proposed method with real world data collected from various CNC machines. The results show that our unsupervised chatter detection method has high accuracy, precision and recall, can detect chatter and distinguish it from normal machining. Also the method is robust to noise and can adapt to dynamic machining conditions. In summary our work presents an unsupervised chatter detection method using AE and DBSCAN clustering that uses internal signals of CNC machines. This method is a reliable and efficient solution for real time chatter detection so manufacturers can improve product quality, optimize machining process and reduce tool wear during machining.

The grand antiprism A is an outlier among the uniform 4-polytopes, since it is not obtainable from Wythoff’s construction. Its symmetry group G(A) has been incorrectly described as [[10,2+,10]] or even as an `ionic diminished Coxeter group’. In fact, G(A) is another group of order 400, namely the group ±[D10×D10]·2, in the notation of Conway and Smith.

Objective: Interstitial fibrosis / tubular atrophy (IFTA) is a common, irreversible, and progressive form of chronic kidney allograft injury, and it is considered a critical predictor of kidney allograft outcomes. The extent of IFTA is estimated through a graft biopsy, while a non-invasive test is lacking. The aim of this study was to evaluate the feasibility and accuracy of an MRI radiomic-based machine learning (ML) algorithm in estimating the degree of IFTA in a cohort of transplanted patients. Approach: Patients who underwent MRI and renal biopsy within a 6-month interval from 1/1/2012 to 1/3/2021 were included. Stable MRI sequences were selected, and renal parenchyma, renal cortex and medulla were segmented. After image filtering and pre-processing, we computed radiomic features which were subsequently selected through a LASSO algorithm for their highest correlation with the outcome and lowest intercorrelation. Selected features and relevant patients’ clinical data were used to produce ML-algorithms using 70% of the study cases for feature selection, model training and validation with a 10-fold cross-validation, and 30% for model testing. Performances were evaluated using AUC with 95% confidence interval. Main results: 70 coupled tests (63 patients, 35.4% females, mean age 52.2 years) have been included and subdivided into a wider cohort of 50 for training and a smaller cohort of 20 for testing. For IFTA ≥ 25%, AUCs in test cohort were 0.60, 0.59, and 0.54 for radiomic features only, clinical variables only, and combined radiomic-clinical model, respectively. For IFTA ≥ 50%, AUCs in training cohort were 0.89, 0.84, 0.96, and in test cohort were 0.82, 0.83, and 0.86, for radiomic features only, clinical variables only, and combined radiomic-clinical model, respectively. Significance: An ML-based MRI radiomic algorithm showed promising discrimination capacity for IFTA>50%, especially when combined with clinical variables. These results need to be confirmed in larger cohorts.

The detection and recognition of tables in image-based documents is a challenging and essential task for automated data extraction and anal- ysis. This paper introduces a methodology that utilizes Convolutional Neural Networks (CNNs) to address this problem. By harnessing the ro- bust visual recognition abilities of CNNs, the proposed method effectively detects and extracts tables from image-based documents. Additionally, an Encoder-Dual Decoder (EDD) architecture is employed to extract the textual content from table cells, enabling the transformation of visual data into structured, machine-readable formats. This structured data is then further processed using a Vector Space Model (VSM)-based language modeling technique for query-based table retrieval. The methodology’s accuracy is assessed by analyzing the spatial relationships between the extracted cells and comparing them against a pre-defined table structure. The results provide an evidence to the effectiveness of the proposed ap- proach, with an impressive 85% accuracy rate and a corresponding error rate of 15%. This accurate extraction and recognition of tables from image-based documents can significantly enhance applications in data analysis, information retrieval, and knowledge extraction.

Quantum optimization is a significant area of quantum computing with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational Hamiltonian-based algorithms, struggle on present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning but often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for the Quantum Approximate Optimization Algorithm to satisfy all the requirements that correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities of measuring solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in linear number of entangleming gates instead of exponential and superior performance compared to standard formulations. Specifically, we achieve higher probabilities of measuring feasible solutions in 9 out of 9 instances compared to standard Hamiltonian formulations and surpass quadratic programming formulations known from quantum annealers in 7 out of 9 instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.

Video self-supervised learning (VideoSSL) offers significant potential for reducing annotation costs and enhancing a wide range of downstream tasks in video understanding. The ultimate goal of VideoSSL is to achieve human-level video intelligence across a spectrum of tasks, from low-level tasks such as pixel temporal correspondence to high-level complex spatio-temporal tasks like action recognition. However, most existing VideoSSL methods focus on isolated aspects of this spectrum and fail to integrate different levels of task complexity. Our study presents the first comprehensive survey that connects all families of VideoSSL methods. We provide a detailed review of the full spectrum of VideoSSL, from low to high levels, by conceptually linking their self-supervised learning objectives and including a comprehensive categorization. Our extensive evaluation highlights the strengths and limitations of each SSL objective across various downstream task families. We also detail the challenges in current VideoSSL research such as data curation, interpretability, deployment, and privacy concerns, an area that previous surveys have not thoroughly explored. In addressing these challenges, we recognize the strengths of existing methods in addressing these challenges and outline future directions for research.

The exponential growth of multimodal content across social media platforms, comprising text, images, audio, and video, has catalyzed substantial interest in artificial intelligence, particularly in multi-modal sentiment analysis (MSA). This study presents a comprehensive survey of 30 research papers published between 2020 and 2024 by eminent publishers such as Elsevier, ACM, IEEE, Springer, and others indexed in Google Scholar. Our analysis primarily focuses on exploring multimodal fusion techniques and features, with specific emphasis on the integration of text and image data. Additionally, the article offers an overview of the evolution, definition, and historical context of MSA. It delves into the current challenges and potential advantages of MSA, investigating recent datasets and sophisticated models. Furthermore, the study provides insights into prospective research directions. Notably, this review offers valuable recommendations for advancing research and developing more robust MSA models, thus serving as a valuable resource for both academic and industry researchers engaged in this burgeoning field.

The accelerated development of AI technology has brought about revolutionary changes in various fields of society. Recently, it has been emphasized that Fairness, Accountability, Transparency, Ethics (Explainability) (FATE) should be considered to support the reliability and validity of AI-based decision-making. However, in the case of autonomous driving technology, which is directly related to human life and requires real-time adaptation and response to various changes and risks in the real world, environmental adaptability must be considered in a more comprehensive and converged manner. In order to derive definitive evidence for each object in a convergent autonomous driving environment, it is necessary to transparently collect and provide various types of road environment information for driving objects and driving assistance, and to construct driving technology that is adaptable to various situations by considering all uncertainties in the real-time changing driving environment.This allows unbiased and fair results based on flexible contextual understanding, even in situations that do not conform to rules and patterns, by considering the convergent interactions and dynamic situations of various objects that are possible in a real-time road environment. The transparent, environmentally adaptive, and fairness-based outcomes provide the basis for the decision-making process and support clear interpretation and explainability of decisions. All of these processes enable autonomous vehicles to draw reliable conclusions and take responsibility for their decisions in autonomous driving situations. Therefore, this paper proposes an Adaptability, Fairness, Transparency, Explainability and Accountability (AFTEA) Framework to build a stable and reliable autonomous driving environment in dynamic situations. This paper explains the definition, role, and necessity of AFTEA in artificial intelligence technology and highlights its value when applied and integrated into autonomous driving technology. The AFTEA framework with environmental adaptability will support the establishment of a sustainable autonomous driving environment in dynamic environments, and aims to provide a direction for establishing a stable and reliable AI system that adapts to various real-world scenarios.

The integration of sign language recognition systems into digital platforms has the potential to bridge communication gaps between the deaf community and the broader population. This paper introduces an advanced Israeli Sign Language (ISL) recognition system designed to interpret dynamic motion gestures, addressing a critical need for more sophisticated and fluid communication tools. Unlike conventional systems that focus solely on static signs, our approach incorporates both Deep Learning and Computer Vision techniques to analyze and translate dynamic gestures captured in real-time video. We provide a comprehensive account of our preprocessing pipeline, detailing every stage from video collection to the extraction of landmarks using MediaPipe, including the mathematical equations used for preprocessing these landmarks and the final recognition process. The dataset utilized for training our model is unique in its comprehensiveness and is publicly accessible, enhancing the reproducibility and expansion of future research. The deployment of our model on a publicly accessible website allows users to engage with ISL interactively, facilitating both learning and practice. We discuss the development process, the challenges overcome, and the anticipated societal impact of our system in promoting greater inclusivity and understanding.

In recent years, the delivery of medical supplies has faced significant challenges due to natural disasters and recurrent public health emergencies. Addressing the need for improved logistics operations during such crises, this article presents an innovative approach integrating vehicle and Unmanned Aerial Vehicle (UAV) logistics to enhance the efficiency and resilience of medical supply chains. Our study introduces a dual-mode distribution framework that employs the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm for efficiently clustering demand zones unreachable by conventional vehicles, thereby identifying areas requiring UAV delivery. Furthermore, we categorize the demand for medical supplies into two distinct sets based on vehicle accessibility, optimizing distribution routes via both UAVs and vehicles. Through comparative analysis, our findings reveal that the artificial bee colony (ABC) algorithm significantly outperforms the genetic algorithm in terms of solving efficiency, iteration counts, and delivery speed. However, the ABC algorithm's tendency towards early local optimization and rapid convergence leads to potential stagnation in local optima. To mitigate this issue, we incorporate a simulated annealing technique into the ABC framework, culminating in a refined optimization approach that successfully overcomes the limitations of premature local optima convergence. The experimental results validate the efficacy of our enhanced algorithm, demonstrating reduced iteration counts, shorter computation times, and substantially improved solution quality over traditional logistic models. The proposed method holds promise for significantly improving the operational efficiency and service quality of the healthcare system's logistics during critical situations.

Frequently Asked Questions (FAQs) systems rely on semantic symmetry similarity measuring between two sentences. To address the challenges of insufficient training data and limited domain-specific understanding in low-resource FAQs, this paper proposes a general framework, PDAMF-FAQ, to solve these issues. Firstly, we propose a paraphrasing-based data augmentation model that integrates syntactic information and edit vectors. Using a rule-based approach, it retrieves template sentences from a corpus and masks relevant words with special characters. Edit vectors between the original and paraphrase sentences are added to a pre-trained model's encoding layer to enhance the model's ability to learn the differences between the original and reference paraphrase sentences. Additionally, this paper presents a mixed-feature semantic matching model based on SimBERT. The model extracts keyword features from the text, replacing these keywords with special characters to construct intent features. These intent features, along with the user question and keyword features, are then concatenated to form the model's input. Experiments were conducted respectively on the paraphrasing-based data augmentation model, mixed-feature semantic matching model and their comprehensive application in a low-resource domain-specific FAQ. The experimental results show that the proposed framework effectively improve the performance of domain-specific FAQ system.

Real-time image processing is crucial in applications such as video surveillance, diagnostic medicine, and autonomous vehicle systems. Parallel computing is essential to address the demands of real-time processing, but challenges persist in its practical implementation. This review analyzes parallel computing techniques applied to real-time image processing, examining parallel architectures and algorithms, identifying effective applications, and evaluating challenges and limitations. The results of this study will contribute to the development of more efficient solutions for real-time image processing. Keywords: Parallel computing, real-time image processing, video surveillance, diagnostic medicine, autonomous vehicle systems.

In solving the Collatz conjecture, it turns out that if we let all integers k be 6n, 6n+1, 6n+2, 6n+3, 6n+4, 6n+5, then we can solve the Collatz conjecture periodically. The Collatz conjecture states that for any positive integer P (initial value), if n is even, divide n by 2; if n is odd, repeat the rule of multiplying n by 3 and adding 1, which always converges to 1. One open problem has been proved by this paper. The authors hope to contribute to the mathematical community by presenting simple proofs of conjectures in the history of mathematics such as the Collatz conjecture.

The popularity of handheld devices for point-of-care ultrasound (POCUS) has increased in recent years due to their portability and cost-effectiveness. However, POCUS has the drawback of lower imaging quality compared to conventional ultrasound, because of hardware limitations. Improving the quality of POCUS through post-image processing would therefore be beneficial, with deep learning approaches showing promise in this regard. This review investigates the state-of-the-art progress of image enhancement using deep learning suitable for POCUS applications. A systematic search was conducted from January 2024 to February 2024 on PubMed and Scopus. From the 457 articles that were found, the full text was retrieved for 69 articles. From this selection, 15 articles were identified addressing multiple quality enhancement aspects. A disparity in the baseline performance of the low-quality input images was seen across these studies, ranging between 8.65–29.24 dB for the Peak Signal-to-Noise Ratio (PSNR) and 0.03-0.71 for the Structural Similarity Index Measure (SSIM). In six studies, where both PSNR and the SSIM metrics were reported for the baseline and the generated images a mean difference of 6.60 (SD ± 2.99) and 0.28 (SD ± 0.15) was observed for the PSNR and SSIM, respectively. The reported performances demonstrate the potential of deep-learning-based image enhancement for POCUS. However, variability in the extent of performance gain across datasets and articles was notable, and the heterogeneity across articles makes quantifying the exact improvements challenging.

This paper explores the geometric impossibility of angle trisection within Euclidean geometry, with a particular focus on the 90° angle. It presents a rigorous proof that highlights the fundamental limitations of various approaches to angle trisection, highlighting their failure to achieve universality. The paper critiques modern proofs that allow for the trisection of certain angles while dismissing others, arguing that such methods are inherently flawed due to their lack of geometric consistency. The paper introduces a new perspective through a new property named “inconsistent property”, a concept derived from geometric operations involving proportional magnitudes. This property reveals contradictions within the framework of Euclidean geometry, paralleling the logical challenges faced in proving the impossibility of trisecting an arbitrary angle. By drawing comparisons between traditional and contemporary proofs, the paper demonstrates that inconsistencies arise not only from specific cases but also from broader geometric principles. The findings reaffirm the robustness of Euclidean geometry in addressing the trisection problem and challenge the validity of alternative proofs that do not adhere to universal geometric principles. This paper contributes to a clearer understanding of the limitations of angle trisection methods and encourages further investigation into the technical implications and broader impact of the angle impossibility proof.

This work introduces the mathematical framework of the novel “First-Order Comprehensive Adjoint Sensitivity Analysis Methodology for Neural Ordinary Differential Equations (1st-CASAM-NODE)” which yields exact expressions for the first-order sensitivities of NODE decoder-responses to the NODE parameters, including encoder initial conditions, while enabling the most efficient computation of these sensitivities. The application of the 1st-CASAM-NODE is illustrated by using the Nordheim-Fuchs reactor dynamics/safety phenomenological model, which is representative of physical systems that would be modeled by NODE while admitting exact analytical solutions for all quantities of interest (hidden states, decoder outputs, sensitivities with respect to all parameters and initial conditions, etc.). This work also lays the foundation for the ongoing work on conceiving the “Second-Order Comprehensive Adjoint Sensitivity Analysis Methodology for Neural Ordinary Differential Equations (2nd-CASAM-NODE)” which aims at yielding exact expressions for the second-order sensitivities of NODE decoder-responses to the NODE parameters and initial conditions while enabling the most efficient computation of these sensitivities

The primary objective of this paper is to establish connections between two well-known but previously independently developed theories: the theory of violator spaces and the theory of greedoids. Violator spaces were introduced by Matoušek et al. in 2008 as a generalization of linear programming problems. Greedoids were introduced by Korte and Lovász in 1981 in an effort to characterize combinatorial structures where greedy algorithms yield optimal solutions. In this work, we explore the relationships between violator spaces and greedoids, demonstrating that greedoids can be defined using a variant of a violator operator. These interrelations provide a new characterization of antimatroids.

In this study, the complex interactions between the well-known Mittag-Leffler functions with two, three, and four parameters are explored. We first study the integral forms of the Mittag-Leffler function $\mathsf{E}_{\alpha, \beta}^{\rho,\kappa}(z)$ with the goal of clarifying its mathematical behaviours and features. Moreover, we create relations between these functions and generalised hypergeometric functions and Fox-Wright functions, expanding the range of their use and comprehension. We explore a number of unique situations by in-depth examination, providing insight into the subtle characteristics of these functions. This investigation advances our theoretical knowledge and opens up possibilities for future applications in a number of scientific fields. As such, this study adds to the current conversation in mathematical analysis and is an important tool for both practitioners and researchers.

Neural Fractional Differential Equations (Neural FDE) represent a neural network architecture specifically designed to fit the solution of a fractional differential equation to given data. This architecture combines an analytical component, represented by a fractional derivative, with a neural network component, forming an initial value problem. During the learning process, both the order of the derivative and the parameters of the neural network must be optimised. In this work, we investigate the non-uniqueness of the optimal order of the derivative and its interaction with the neural network component. Based on our findings, we perform a numerical analysis to examine how different initialisations and values of the order of the derivative (in the optimisation process) impact its final optimal value. Results show that the neural network on the right-hand side of the Neural FDE struggles to adjust its parameters to fit the FDE to the data dynamics for any given order of the fractional derivative. Consequently, Neural FDEs do not require a unique α value, instead, they can use a wide range of α values to fit data. This flexibility is beneficial when fitting to given data is required, and the underlying physics is not known.

In this study, we obtained results for the computation of eigen-pairs, singular value decomposition, pseudo-inverse, and the least square problem for elliptic quaternion matrices. Moreover, we established algorithms based on these results and provided illustrative numerical experiments to substantiate the accuracy of our conclusions. In the experiments, it was observed that the p-value in the algebra of elliptic quaternions and elliptic numbers directly affects the performance of the problem under consideration. Selecting the optimal p-value for problem-solving and the elliptic behavior of many physical systems make this number system advantageous in applied sciences.

Our world is increasingly challenged by managing the impacts of natural disasters, particularly floods, which are frequent, dangerous, and costly. Traditional flood mapping methods, reliant on Optical satellites (MSI), struggle under cloud cover which is typical during such events. Synthetic Aperture Radar (SAR) offers a promising alternative with its cloud-penetrating capability, though its use has been limited due to complexity and data labeling challenges. This project aims to develop a SAR-based flood segmentation model that can rapidly and accurately map floods globally, with high adaptability to different flood types and regions. By utilizing deep learning and a novel transfer-learning technique that combines the strengths of Optical/MSI and SAR data, the model seeks to bypass the challenges of manual labeling and improve mapping accuracy. Initial results show the model's effective generalization across various flood events, with superior performance indicated by an Intersection over Union (IoU) of 0.72, outperforming existing methods and demonstrating promising capabilities in precise flood mapping.

We explore the concept of Euclidean locality within treonic topological spaces. Our study establishes a foundational theoretical framework, elucidating the properties of continuity, homeomorphisms, and compactness in these spaces. We assess the Euclidean locality of treonic spaces through the analysis of specific homeomorphisms, which enables us to define manifolds in treonic spaces and extend recent research on Bermejo Algebras. For the first time, we characterize treonic manifolds by incorporating the property of Euclidean locality alongside previously studied properties such as Hausdorff spaces and second countable spaces. Our findings advance the understanding of the topological and geometric properties of treonic spaces, providing significant insights for advanced mathematical research.

The primary motivation for this work is to develop the concept of Marshall's quotient (\cite{ribeiro2016functorial}) applicable to non-commutative multirings endowed with involution, expanding the main ideas of the classical (= commutative, without involution) case presented in Marshall's seminal paper \cite{marshall2006real}. We define two multiplicative properties to deal with the involutive case and characterize their Marshall quotient. Besides, this article presents various cases showing that the ''multi'' version of rings with involution offers many examples, applications, and relatives in (multi) algebraic structures.

Artificial intelligence harbors significant, unrealized promise for educational reformers, adding benefit to low-resource settings, particularly in the Least Developed Nations where access to quality learning remains most acute. The purpose of the introduction is to summarize how AI can reduce the educational gap and increase the effectiveness of education in poor resource environments. This paper, in a critical way, reviews the existing literature on the integration of AI in the education systems of developing countries concerning the benefits and challenges. This is achieved by reviewing a cross-section of literature from MDPI, Taylor & Francis, Springer, Wiley Online Library, Science Direct, and IEEE Xplore databases. Much emphasis within the selection criteria is given to those studies that had either empirically or theoretically demonstrated the influence of AI on educational practices within developing countries. Key findings: AI has the potential to greatly improve learning outcomes; it somewhat increases access to education but bodes well for the personalization agenda. These, however, will be surmounted upon adoption if it is to be effective: there exist huge challenges such as limited access to the internet, infrastructural deficit, and socio-cultural barriers. This study can, therefore, give inference to the fact that AI can change education and further enhance new equity in developing countries if there are corresponding proper policy interventions, building the capacity of teachers, and involvement of the community. More research is required to inform the long-term implications of AI and new uses being developed for AI applications in many diverse educational contexts, on which to base strategies for more equitable and more inclusive global education.

In the era of cloud computing, guaranteeing the safety and effectiveness of data management is of utmost importance. This investigation presents a novel approach that amalgamates sharding concept, encryption, zero-knowledge proofs (zkp), and blockchain technology for secure data retrieval and data access control to improve data security, efficiency in cloud storage and migration. Further we utilize user-specific digital wallets for secure encryption keys in order to encrypt the file before storing into the cloud. As Large files ( greater than 50 MB) or Big data file ( grater than 1 TB) computational complexity is more we leverage on sharding concept to enhance both space and time complexity in cloud storage, hence the large files are divided into shards and stored in different database servers. We also employed blockchain smart contract to enhance secure retrieval of the file and also a secure access method which ensures the privacy of the user. The zk-snark protocol is utilized to ensure the safe transfer of data between different cloud services. By utilizing this approach, data privacy is preserved, as only the proof of the data’s authenticity is shared with the verifier at the destination cloud, rather than the actual data itself. The suggested method tackles important concerns related to data protection, privacy, and efficient resource utilization in cloud computing settings by ensuring it meets all the cloud policies require to store data. As the environment maintains privacy of the user data and by not storing the raw data of the user anywhere, the entire environment is setup as a Zero trust model.

Livestock marketplaces consist of infrastructure and rules through which information is exchanged and transactions are completed. Livestock trading incurs significant transaction costs, beyond just commission fees paid to marketplace owners (e.g., se-lecting, loading and transporting animals). In addition, animals being transported, held and transacted in a market setting increases the likelihood of injury or disease. The Covid-19 pandemic contributed to large-scale changes across typically physical marketplaces as stay-at-home orders and travel restrictions were invoked. Livestock marketplaces pivoted online rapidly, facilitated by the deployment of video feeds, al-lowing buyers to view/purchase animals via mobile phone. This shift offered the promise of mitigating many of the transaction costs associated with a fully physical marketplace. This study evaluated how computer vision (CV) approaches can con-tribute to the evolution of livestock marketplaces. It used livestock video data for 240 cattle (bulls) weighing 320-740 Kg from 16 different breeds to elicit additional trade-relevant data (livestock weight) and can be considered as an intermediary step to better understand how video data can be used to further digitalize livestock trade, price formation and transaction completion via technology solutions. The dataset comes from three sales held on different dates in a single mart location, which allows a consistent camera setup throughout. CV technologies were employed to solve the problem of cattle weight estimation and a distinctive achievement lies in curating a dataset cap-turing cattle in motion within the context of a cattle auction thereby injecting realism and complexity into the CV weight estimation task. Employing advanced object detection algorithms, the study created an intricate data pipeline to generate an appropriate modelling dataset and devised new multi-channel architectures for deeper analysis of diverse image inputs. The significance of sizable datasets and the challenge of man-aging inherent input variability for accurate CV regression is highlighted. Top-down view predictions demonstrate comparatively better performance, although failing to achieve benchmark precision. Challenges arise from camera angle variations, roaming behaviors, and breed diversity. Likewise, side-view predictions face challenges due to increased variability and lack of standardization. Despite this, these predictions offer insights into the value of incorporating Region of Interest (ROI) coordinates and data augmentation for enhanced performance. The study concludes with a multi-input ar-chitecture combining top-down and side-view predictions, demonstrating moderate success highlighting potential synergy between both perspectives. The central con-clusion resonates strongly – using standardized and multi-view images encompassing controlled movement and consistent poses could bolster accurate CV weight estima-tion.

GeoQuickView is a software application designed to bridge the gap between advanced Geographic Information Systems (GIS) and users with no prior experience in GIS. This paper explores the development, functionality, and user-centric design of GeoQuickView, highlighting its capabilities in loading, visualizing, and analyzing geographic data. Emphasis is placed on its use with LiDAR-derived Digital Terrain Models (DTMs), user-friendly interface, and robust tools for measurement and digitization. The application’s role in democratizing access to complex geospatial data is discussed. The software was designed to work seamlessly with data from Romania and can display various types of raster elevation data. While the Coordinate Reference System (CRS) may present challenges for data extraction outside of Romania, the data can still be visualized effectively within the app. The application is available upon request.

The metaverse is gradually expanding. There is a growing number of photo and video recordings of metaverse virtual worlds being used in multiple domains, with growing collections. An essential element of the metaverse and its recordings are avatars. In this paper, we present a novel task of avatar detection in metaverse recordings, supporting semantic retrieval in collections of metaverse recordings and other use cases. Our work addresses the characterizations and definitions of avatars and presents a new model supporting avatar detection. The latest object detection algorithms are trained and tested on a variety of avatar types in metaverse recordings. Our work achieves a higher level of accuracy than existing models, which encourages further research in this field.

This research explores the application of ARIMA (Autoregressive Integrated Moving Average) models and parallel computing techniques to analyze and forecast anemia diagnoses in children under 36 months in the Junín region of Peru. Using health data from 2023-2024, including insurance type, patient information, diagnosis dates, hemoglobin levels, and treatment details, we develop predictive models to understand trends and patterns in childhood anemia. The study aims to demonstrate the effectiveness of time series analysis and high-performance computing in addressing this critical public health issue. Results indicate improved forecasting accuracy and computational efficiency, potentially aiding in resource allocation and policy development for anemia prevention and treatment programs.

Recommender Systems (RecSys) are crucial in managing information overload and enhancing user satisfaction across various digital platforms, including e-commerce and entertainment. Evolving from traditional models to Deep Neural Networks (DNNs) and, more recently, Large Language Models (LLMs), these systems leverage sophisticated algorithms to analyze user behaviors and preferences. LLMs, such as GPT-4, are trained on extensive datasets to comprehend and generate natural language, significantly advancing their ability to deliver personalized recommendations. This tutorial explores the transformative impact of LLMs on RecSys, discussing their development, application in handling complex datasets, and the integration of contextual insights. Real-world examples illustrate how LLMs enhance recommendation accuracy and user experience, highlighting challenges and future directions in the field.

Glaucoma, a global leading cause of blindness, necessitates accurate segmentation of the optic disc (OD) and optic cup (OC) for effective screening. However, existing segmentation methods based on convolutional neural networks (CNNs) suffer from high computational complexity and long inference times. In this paper, we propose an end-to-end segmentation method for the OD and OC using a lightweight MobileNetv3 as the feature extraction network. Our approach incorporates boundary branches and an adversarial learning network to achieve multi-label segmentation of the OD and OC. We evaluate the proposed method on three publicly available datasets: Drishti-GS, RIM-ONE-r3, and REFUGE. The experimental results demonstrate segmentation accuracies of 0.974/0.900, 0.966/0.875, and 0.962/0.880 for the OD and OC on the respective datasets, while significantly reducing inference time.

The usage of classic segmentation methods has drastically decreased recently. Implementation of convolutional neural networks and their modifications leads to significantly improved results. With the help of U-net, you can perform automatic segmentation. However, this requires significantly more hardware and software resources. The use of cloud computing now provides a wide range of possibilities, which allows processing and sharing the obtained experience and results to improve the quality of diagnosis. This article presents an approach to implementing MLOPS for automatic image segmentation using U-net technology. The approach's key feature is the developed software block that allows the creation of a dataset based on given rules. The infrastructure also supports automatically deploying the necessary environment on the cloud, particularly on DigitalOcean.

Anxiety in older individuals is understudied despite its prevalence. Investigating its occurrence can be challenging, yet understanding the factors influencing its recurrence is important for improved management. This study aimed to model the recurrence of anxiety symptomatology in an older population within a five-month timeframe. Data included baseline socio-demographic and general health information for older adults aged 60 years or older with at least mild depressive symptoms. A Bayesian network model explored the relationship between baseline data and recurrent anxiety symptomatology. Model evaluation employed the Area Under the Receiver Operating Characteristic Curve (AUC). The Bayesian model was also compared to three machine learning models. The model achieved an AUC of 0.821 on the test data, using a threshold of 0.367. This result surpassed both the Logistic Regression and XGBoost models, but slightly behind SGDClassifier. Key factors associated with recurrence of anxiety symptomatology were: “Not being able to stop or control worrying”; “Becoming easily annoyed or irritable”; “Trouble relaxing”; and “depressive symptomatology severity”. The model demonstrated generalisation abilities and outperformed some machine learning models while being less complex and more explainable. These findings indicate a prioritised sequence of predictors to identify individuals most likely to experience recurrent anxiety symptomatology.

With the rapid development of Intelligent Transportation Systems (ITS), vehicle type classification, as a key link in Automatic Toll Collection systems (ATC), is of great significance in improving traffic efficiency and reducing economic losses. This study proposes an intelligent vehicle classification system based on deep learning and multi-sensor data fusion to address the accuracy issues existing in vehicle classification methods based on optical sensors (OS) and human observers. The system significantly improves the accuracy and robustness of vehicle classification by combining deep Convolutional Neural Networks (CNN), LiDAR sensors, and machine learning algorithms. We first constructed a large-scale annotated dataset containing multiple vehicle types and complex traffic scenes to improve our model's capability to identify different vehicle characteristics. Next, CNN models based on different architectures were designed to extract global and local features of the vehicle, respectively. In addition, the LiDAR sensor was used to achieve the spatial structure architectures of the vehicle and combined with the output of the CNN model to improve classification performance under occlusion and complex scenes.

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

Survivability is a critical concern in WSNs, heavily influenced by energy efficiency. Addressing severe energy constraints in WSNs requires solutions that meet application goals while prolonging network life. This paper presents an energy optimization approach (EOAMRCL) for WSNs, integrating the Grey Wolf Optimization (GWO) for enhanced performance. EOAMRCL aims to enhance energy efficiency by selecting the optimal duty-cycle schedule, transmission power, and routing paths. The proposed approach employs a centralized strategy using a hierarchical network architecture. During the cluster formation phase, an objective function, augmented with GWO, determines the ideal cluster heads (CHs). The routing protocol then selects routes with minimal energy consumption for data transmission to CHs, using transmission power as a metric. In the transmission phase, the MAC layer forms a duty-cycle schedule based on cross-layer routing information, enabling nodes to switch between active and sleep modes according to their network allocation vectors (NAV). This process is further optimized by an enhanced CSMA/CA mechanism, which incorporates sleep/activate modes and pairing nodes to alternate between active and sleep states. This integration reduces collisions, improves channel assessment accuracy, and lowers energy consumption, thereby enhancing overall network performance. EOAMRCL was evaluated in a MATLAB environment, demonstrating superior performance compared to EEUC, DWEHC, and CGA-GWO protocols, particularly in terms of network lifetime and energy consumption. This highlights the effectiveness of integrating GWO and the updated CSMA/CA mechanism in achieving optimal energy efficiency and network performance.

Let an odd integer be represented as $\sum \limits_{n > m} 2^n + 2^m - 1$ for $m \geq 1$. To transform $2^m - 1$ according to the Collatz rules, the $3x + 1$ step is applied, resulting in the even integer $2^{m + 1} + 2^m - 2$. This even integer, being exactly once divisible by 2, becomes the next odd integer $2^m + 2^{m - 1} - 1$. This represents the growth phase, as exactly one even step follows an odd step. However, while the overall value of the integer increases, terms with decreasing indices are generated after each odd-even cycle. After $m$ such cycles, a term $2^{m - m}$ (which equals 1) is generated, canceling the negative 1. Additional even steps are then performed until the integer becomes odd again, which occurs when the next smallest index becomes zero. The positive 1 thus obtained is written as $2^1 - 1$. If uninterrupted, the term $2^1 - 1$ has the trivial cycle $2^1 - 1 \rightarrow 2^2 \rightarrow 2^1 \rightarrow 2^1 - 1$. This represents the shrinkage phase, as two even steps follow an odd step. To interrupt the trivial cycle, a sequence such as $2^1 + 2^2 + \cdots$ must be available to combine with $2^1 - 1$ and produce $2^{\mathcal{M}} - 1$. This starts another growth phase that lasts for $\mathcal{M}$ odd-even cycles. Finally, there is an attempt to craft an integer that can escape the shrinkage phase in the Collatz dynamics.

Existing methods of hyperspectral anomaly detection still face several challenges: 1) Due to the limitations of self-supervision, avoiding the identity mapping of anomalies remains difficult; 2) The ineffective interaction between spatial and spectral features leads to the insufficient utilization of spatial information; 3) Current methods are not adaptable to the detection of multi-scale anomaly targets. To address the aforementioned challenges, we proposed a blind spot network based on multi-scale blind spot convolution for HAD. The multi-scale mask convolution module is employed to adapt to diverse scales of anomaly targets, while the dynamic fusion module is introduced to integrate the advantages of mask convolutions at different scales. The proposed approach includes a spatial-spectral joint module and a background feature attention mechanism to enhance the interaction between spatial-spectral features, with a specific emphasis on highlighting the significance of background features within the network. Furthermore, we propose a preprocessing technique that integrates pixel shuffle down-sampling (PD) operation with spatial spectral joint screening to address the issue of anomalous identity map-ping and facilitate finite-scale mask convolution to adapt to the detection of more scale targets. The proposed approach was assessed on four real hyperspectral datasets comprising anomaly targets of different scales. The experimental results demonstrate the effectiveness and superior performance of the proposed methodology compared with nine state-of-the art methods.

We propose an innovative approach called SMPTC3, designed specifically to enhance security and privacy in cross-chain transaction verification. This approach addresses multi-chain, multi-participant information exchange and large-scale cross-chain transfers, resisting various types of malicious attacks. We leverage the verifiability of cross-chain transactions based on smart contracts and innovatively transform transaction information into confidential sets, organizing them into quadratic secret polynomials. By utilizing secret sharing and random distribution techniques, we construct a secure multiparty computation method, tailored for cross-chain transactions. To enhance the efficiency of cross-chain transactions, we introduce cross-chain batch processing technology, grouping inter-chain transactions into cross-chain transaction sets. Unlike traditional distributed notary technologies, SMPTC3 designates honest participants as a cross-chain notary group, reducing the time required for redundant signature confirmations and significantly lowering the possibility of malicious notaries. Theoretical analysis and empirical experiments demonstrate that SMPTC3 is highly efficient in addressing cross-chain transaction security issues.

This article systematically studied the A-optimal designs of a high-order mixture central polynomial model, which is an advancement of the research results for the A-optimal design of the most recent third-order mixture central polynomial model and a more accurate response surface model. This article is based on the simplex center design, obtaining measurement values at various design points, and verifying them through the A-optimal equivalence theorem. We also compare the A-efficiency of designs through examples, which can be applied to the A-optimal precise design of the fourth-order mixture model.

Automated systems, regulated by algorithmic protocols and predefined set-points for feedback control, require the oversight and fine-tuning of skilled technicians. This necessity is particularly pronounced in automated greenhouses, where optimal environmental conditions depend on the specialized knowledge of dedicated technicians, emphasizing the need for expert involvement during installation and maintenance. To address these challenges, this study proposes the integration of data acquisition technologies using Internet of Things (IoT) protocols and optimization services via Reinforcement Learning (RL) methodologies. The proposed model was tested in an industrial production greenhouse for the cultivation of industrial hemp, applying adapted strategies to the crop, and was guided by an agronomic technician knowledgeable about the plant. The expertise of this technician was crucial in transferring the RL model to a real-world automated greenhouse equipped with IoT technology. The study concludes that the integration of IoT and RL technologies is effective, validating the model's ability to manage and optimize greenhouse operations efficiently and adapt to different types of crops. Moreover, this integration not only enhances operational efficiency but also reduces the need for constant human intervention, thereby minimizing labor costs and increasing scalability for larger agricultural enterprises. Furthermore, the RL-based control has demonstrated its ability to maintain selected temperatures and achieve energy savings compared to classical control methods.

With the exponential growth of internet usage and mobile devices, the volume of user behavior data has surged, offering significant opportunities and challenges for businesses. This paper explores user behavior analysis in the context of big data, highlighting its pivotal role in driving innovation and strategic decision-making. We begin by discussing the importance of user behavior data and reviewing technological advancements such as machine learning, natural language processing, and data mining that enable deep insights into user behavior. Through a case study on linguistic analysis in livestreaming e-commerce, we demonstrate how text-mining techniques can correlate linguistic characteristics with sales performance, providing actionable marketing insights. We further explore the broader business applications, including personalized recommendations, user portraits, product design, and strategic decision-making. Technical and ethical challenges, such as data integration, privacy concerns, and algorithmic bias, are also addressed. The paper concludes with a discussion on future trends, such as AI and ML advancements, edge computing, IoT proliferation, and ethical AI frameworks, poised to shape user behavior analysis. Our findings underscore the transformative potential of user behavior data in enhancing business operations and user experiences, providing recommendations for future research focused on real-time analytics, privacy-preserving techniques, and ethical implications of data-driven decisions.

Game-based learning assessments lean on educational data mining approaches such as stealth assessments and quasi mixed-methods that help gather student learning proficiency. Rarely do we see approaches where student proficiency in learning is woven into the game's design. Educational Burst Games (EBGs) is a new approach to improving learning proficiency by designing fast-paced, short, repetitive, and skill-based games. They have the potential to be effective learning interventions both during instruction in the classroom and during after-school activities such as assignments and homework. Over five years we have developed two EBGs aimed at improving linear algebra concepts of undergraduate students. In this study, we provide results of an in-depth evaluation of the two EBGs developed with 45 participants that represent our target population. We discuss the role of EBGs and their design constructs such as pace and repetition, the effect of the format (2D vs. 3D), the complexity of the levels and the influence of prior knowledge on the learning outcomes.

With the emergence of the Internet and WWW has become a comprehensive source of information for the extraction of meaningful information has become a significant challenge in the past decade. Furthermore, the available information is classified in unstructured, structured, and semi-structured forms. Numerous amount of information on the web is also characterized in an unstructured or semi-structured format. This usually extracts the potential useful information from these multiple forms and has been considered a leading area of research in this modern era. The authors presented web content mining as a subcategory of web mining that focuses on important extracting patterns from the contexts available in the documents on the web. Hence, this paper focuses on the multiple content mining concepts, tools, and techniques implemented on the documents available on WWW.

Military Internet of Things (MIoT) has emerged as a new research area in military intelligence. The MIoT frequently has to constitute a federation-capable IoT environment when the military needs to interact with other institutions and organizations or carry out joint missions as part of a coalition such as in NATO. One of the main challenges of deploying MIoT in such an environment is to acquire, analyze, and merge huge amounts of data from many different IoT devices and disseminate it in a secure, reliable, and context-dependent manner. In this work, we present a comprehensive solution for secure data dissemination based on the integration of Hyperledger Fabric's distributed registry technology, Apache Kafka message broker, and data processing microservices implemented using the Kafka Streams API library and applying attribute-based encryption (ABE), a cryptographic approach that facilitates controlling access to information based on data and user attributes rather than traditional methods that rely on specific keys. In the work, we built an experimental setup, implemented an access control scheme designed for mobile components, and performed an evaluation of its performance. Performance tests have confirmed the suitability of the developed cryptographic method for attribute-based data access control in MIoT systems, considering the federations of military networks. The results indicate that the proposed cryptographic scheme is viable for the number of attributes typically assumed to be used in battlefield networks, offering a good trade-off between security and performance for modern cryptographic applications.

The joint extraction of entities and relations is a critical task in information extraction, and its performance directly affects the performance of downstream tasks. However, existing joint extraction models based on deep learning exhibit weak processing capabilities for the phenomenon of multiple pronunciations of one character and multiple characters of one pronunciation when processing Chinese texts, resulting in performance loss. To address these issues, this paper introduces part-of-speech (POS) and pinyin features to aid the model in learning semantic features that are more contextually appropriate. A Chinese Joint Entity and Relation Extraction Model based on Progressive Contrastive Learning and Heterogeneous Feature Fusion is proposed (CJE-PCHF). During model training, an interactive fusion network based on progressive contrastive learning is employed to learn the dependencies between pinyin, POS, and semantic features. This guides the model in heterogeneous feature fusion, capturing higher-order semantic associations between heterogeneous features. On the commonly used DuIE evaluation dataset for joint extraction, this model achieved a significant improvement, with the F1 score increasing by 5.4% compared to the benchmark model CasRel.

The capacitated lot-sizing problem with product recovery (CLSP-RM) holds significant importance in reverse logistics but is notoriously complex (NP-hard). In this study, two techniques are introduced to confront this challenge. The first technique entails devising a linear optimization task that eliminates capacity limitations across a wide problem spectrum, yielding a remarkably accurate approximation of the optimal solution. This adaptable approach presents a potent alternative and holds potential for extension to diverse problem categories owing to its versatile nature. The second technique employs a simulation methodology utilizing Halton’s uniform random numbers to address the issue. This randomized production search method sidesteps considerations of production costs, inventory expenditures, and production order when determining production batches. The research’s novelty lies in its application of these techniques to the problem. The suggested methods undergo evaluation via a benchmark dataset of approximately 4200 instances, with comparison against solutions derived through the Gurobi solver. The results underscore the efficacy and resilience of the introduced methodology in tackling the CLSP-RM predicament.

The success of deep learning (DL) in offline brain-computer interfaces (BCIs) has not yet translated into efficient online applications. This is due to two limiting factors: the need for large amounts of training data in DL and the fact that current DL solutions are primarily developed for offline decoding. To enable real-time decoding, even across subjects without calibration data, we first introduce a novel method real-time adaptive pooling (RAP) to tune existing offline DL models towards online decoding by modifying the pooling layers. To reduce the amount of training data required, our approach leverages different levels of domain adaptation. We show how different settings enable different adaptation solutions. Our results demonstrate that our approach is both powerful and can be calibration-free, providing a robust and practical solution for real-time BCI applications. These findings pave the way for the development of co-adaptive and highly efficient DL-based BCI systems.

(1) Background: The rapid evolution of the internet and technological infrastructure has led to a surge in data generation across various contexts, increasing the use of machine learning tools to extract valuable information. Clustering, particularly using the K-means algorithm, is a common technique. However, determining the optimal number of clusters in K-means is challenging, as traditional methods like the elbow method can be imprecise and subjective. This study proposes a more accurate and objective method to identify the optimal number of clusters. (2) Methods: The proposed method utilizes the numerical derivative of cluster inertias and the maximum value of the ratio between contiguous derivatives. Implemented in Python using sklearn, numpy, and matplotlib, the method was validated with synthetic datasets generated by artificial intelligence, where cluster numbers are clearly distinguishable. (3) Results: The method proved to be more precise and less subjective than the traditional elbow method, accurately identifying the optimal number of clusters in all tested synthetic datasets. Additionally, it demonstrated computational efficiency with minimal RAM usage and execution time, making it suitable for practical data analysis applications. (4) Conclusions: This new mathematical and computational method significantly improves the determination of the optimal number of clusters in K-means, offering a more accurate and objective alternative to traditional techniques. Future work will extend this method to hierarchical clustering and develop a cloud service for wider accessibility.

This paper presents machine learning methods for approximate solutions of reaction-diffusion equations with multivalued interaction functions. This approach addresses the challenge of finding all possible solutions for such equations, which often lack uniqueness. The proposed method utilizes physics-informed neural networks (PINNs) to approximate generalized solutions.

The proliferation of fake news on social media platforms poses significant challenges to information authenticity and public trust. In this study, the impact of various word embedding techniques on the performance of both machine learning and deep learning models for fake news detection is systematically evaluated. The comprehensive TruthSeeker dataset, which spans over a decade of labeled news articles and social media posts, is utilized. Three popular word embedding techniques are analyzed: TF-IDF, Word2Vec, and FastText. These embeddings were tested with multiple machine learning classifiers, including logistic regression, naive Bayes, K-nearest neighbors, support vector machines, multilayer perceptrons, decision trees, and random forests, as well as deep learning models, specifically convolutional neural networks (CNNs). Among machine learning models, the Support Vector Machine (SVM) with TF-IDF achieved the highest accuracy of 99.03%, precision of 98.92%, recall of 99.15%, and F1 score of 99.03%. The Multilayer Perceptron (MLP) also demonstrated strong performance with Word2Vec, reaching an accuracy of 95.24%, precision of 94.95%, recall of 95.50%, and F1 score of 95.07%. For deep learning models, CNNs combined with TF-IDF embeddings showed outstanding results, achieving an accuracy of 98.99%, precision of 98.56%, recall of 99.48%, and F1 score of 99.02%. These results highlight the critical role of word embeddings in enhancing model accuracy and reliability in misinformation detection.

A prime number is a natural number with no divisors other than itself and the number 1. There are many unsolved problems related to prime numbers. One such problem is finding a general method for identifying prime numbers. Although it is known that all prime numbers fall under the categories of 2, 3, or 6n±1 (where n≥1), a formalized method for eliminating composite numbers (non-prime numbers) from these categories has yet to be developed. This paper aims to explore a possible method for such elimination, which involves checking whether there exists an n that satisfies n = 6km+k+m or n = 6km+k-m (where k and m are non-zero integers). This method is expected to be a major step forward in the derivation of prime numbers.

Internet of Things (IoT) devices are going to be the primary data source in smart cities, often generating and communicating critical, sensitive, and private data that face threats of confidentiality breaches due to the rise of quantum computers. Even though NIST has approved post-quantum cryptography (PQC) schemes that promise to protect from quantum computer threats, these schemes can not be implemented efficiently on IoT devices, which often have computational and memory constraints. Hence, due to the substantial key size requirements and computationally intensive nature of PQC schemes, their direct deployment on IoT devices within smart city architecture is impeded by inherent computational and storage limitations. Consequently, it is imperative to devise PQC-based, resource-efficient authentication protocols tailored to IoT devices operating within smart cities. In this paper, we propose an offloading scheme that uses PQ Edge Server (PQES) for the network that performs PQC-related computation and memory operations for IoT devices in the network. The suggested technique transfers all storage and processing responsibilities from IoT devices in a network to ensure their normal operation and performance without any compromise. PQES generates a distinct PQ key pair for every network device and oversees a separate stream for each device. Therefore, IoT devices in the network may function without cryptographic processes, improving their efficiency by removing the need for conventional cryptography. Our results show that the proposed scheme reduces RAM usage to 1.05 KB and CPU usage to 1.75%, with maximum CPU context switches of 92.8. The proposed scheme uses TCP, a transport layer protocol, which is applicable to lightweight end devices without application-level protocols like HTTP or MQTT. When benchmarked on a Raspberry Pi, the PQES can handle 1000 concurrent connections and use a maximum of 73.5% of RAM. In comparison, previous research used at least 5.1 MB of RAM for one concurrent connection and may use up to 552.6 MB of RAM for 1000 concurrent connections. The maximum CPU usage for our method was 1.75%, whereas the previous proposal had a utilization of 67.1%. The greatest CPU context switches for our system were 92.8, far lower than the 3449 observed for the usual approach. Hence, our proposed scheme reduces the computational, memory, and network load for IoT devices by manifolds and increases device performance while providing PQC security.

Zero-day threats are a more severe and constantly developing menace to various participants including large companies, government offices, and educational establishments. These entities may contain valuable information and essential operations that attract cyber attackers. These exploits are especially devastating as they target weaknesses that an organization’s vendors are not even aware of, making them have no protection against them. This paper focuses on the background and use of zero-day exploitation and the structure and technologies of these complex malware attacks. We examine two notable real-life cases: the case of ‘HAFNIUM targeting Exchange Servers with zero-day exploits’ that was investigated by Microsoft 365 Security and Microsoft Threat Intelligence, and the ‘Log4j vulnerability’ case that was reported by the National Cyber Security Centre. These cases show the critical effects of zero-day vulnerabilities and measures taken to combat them. Additionally, this paper outlines different strategies that can be used to prevent zero-day attacks with the help of modern technologies. These are fast patch release, effective IDS/IPS, and a security model that involves constant vigilance and use of behavioral analytics. Thus, by studying the lifecycle of zero-day vulnerabilities and the structure of the exploits, one can enhance the protection of the organization against the threats that are invisible to traditional security systems. This extensive survey is designed to be useful in understanding the characteristics of zero-day vulnerabilities, the technologies for their mitigation, and the constant threat and development in the field of cybersecurity. Thus, it is possible to strengthen the protection against these threats that are constant and develop with time by analyzing the previous events and predicting potential problems.

In this paper, we study nonlocal problems for a fractional diffusion equation and a degenerate hyperbolic equation with singular coefficients in the lower terms. The uniqueness of the solution to the problem is proved by the method of energy integrals. The existence of a solution is equivalently reduced to the question of the solvability of Volterra integral equations of the second kind and a fractional differential equation. For a particular solution of the proposed problem, its visualization is carried out for various values of the order of the fractional derivative. It is shown that the order of the derivative affects the intensity of the diffusion process (subdiffusion), as well as the shape of the wave front.

In this paper, we consider the Cauchy problem of a time fractional nonlinear diffusion equation. According to the Kaplan’s first eigenvalue method, we first prove the blow-up of the solutions in finite time for some sufficient conditions. We next give sufficient conditions for the existence of global solutions by using the result of Zhang and Sun. In conclusions, we find the second critical exponent for the existence of global and non-global solutions via the decay rates of the initial data at spatial infinity.

Countless disasters have resulted from climate change, with severe damage to infrastructure and the economy. Their societal impacts require mental health services for the millions affected. To prepare for and respond effectively to these events, it is important to understand people’s emotions and incidents both before and after a disaster strikes. The emotions and other life incidents expressed on Twitter during the 2017 Hurricane Harvey were mined in this case study. Between August 20 and August 30, we collected a dataset of approximately 400,000 public tweets that related to the storm. Using a BERT-based model, we predicted the emotions attached to each tweet. After that, we used various natural language processing techniques to analyze the tweets themselves to understand what kind of ’topics’ were being discussed when people expressed certain ’emotions’. Applying the Latent Dirichlet Allocation (LDA) technique for topic modeling sidesteps the need for manual content analysis and allows us to find meaningful patterns in the data. Results show that there is a significant change of emotions occurred when the hurricane is at most devastating and many of life incidents become pressing demands/concerns from population such as evacuation plan, animal safety, safety update, public policy, helps, flood, and fake news.

Traffic anomaly detection is crucial for urban management, yet current research is often confined to small-scale endeavors. This study collected nine months of real-time Wuhan traffic monitoring data from Amap. We proposed Traffic-ConvLSTM, a multi-scale spatial-temporal technique based on long and short-term memory networks (LSTM) and convolutional neural networks (CNN) to effectively achieve long-term anomaly detection at the city level. First, we convert the traffic flow data into image representation, which enables the capture of the spatial correlation between traffic flow and roads and the correlation between traffic flow and roads, as well as the surrounding environment. Second, The model utilizes convolution kernels of different sizes to extract spatial features at road-level, regional-level, and city-level scales, while incorporating temporal features of different time steps to capture hourly, daily, and weekly dynamics. Additionally, varying weights are assigned to the convolution kernels and temporal features of varying spatio-temporal scales to capture the heterogeneous strengths of spatio-temporal correlations within patterns of traffic anomalies. The proposed Traffic-ConvLSTM model exhibits improved performance over existing techniques in the task of identifying long-term and large-scale traffic anomaly occurrences. Furthermore, the analysis reveals significant traffic anomalies during holidays and urban sporting events. The diverse travel patterns observed in response to various activities offer insights for large-scale urban traffic anomaly management, providing recommendations for city-level traffic control strategies.

The different systems in the nuclear power plants (NPP) are critical and complex which requires a continuous rigorous monitoring for both normal and abnormal conditions. However, due to the nonlinearity of the dynamic behavior of these systems, implementation of artificial intelligence within the NPP components is crucial to enhance the monitoring and the predictability of the key operating parameters trend. On the other hand, lessons learned from large nuclear accident proves that a remote real-time coordination between the different stakeholders involved in the safety of the nuclear reactor is needed. This remote feature can be implemented in the existing power plants by embedding a mobile computing networks within the plant components. This network will send early warning and transmit the NPP data on real-time to different authorities such as the regulatory authority and the decision-making committees, to enhance the interpretability of the nuclear event and deliver a collaborative decision which in return mitigate the risk associated with these events and increase the overall safety of the plant. The integration of AI and mobile computing in NPP would be most of interest in countries where nuclear reactors data are challenged to reach during an accident. For instance, during the meltdown of Chernobyl, the Soviet government covered the accident from the news in an attempt to contain the consequences but there was a spread of radioactive contamination to some other Europe countries. Therefore, in the case of such scenario the implementation of mobile computing and AI would result in different outcomes as the European countries would be notified through the mobile networking and the spread of contamination would be forecasted by the AI algorithms. In this paper, we examine the different modern AI and mobile computing technologies, the different potential application, the associated features and challenges, and future work direction.

Machine learning has gained significant recognition within healthcare organizations as a potent technology for medical image analytics. Among various medical image modalities, Contrast-Enhanced CT (CECT) is widely utilized to acquire additional diagnostic information that can help to better visualize and evaluate certain structures or abnormalities in the human body. Accordingly, there is an increasing demand for machine learning systems for disease analytics using CECT. However, developing such systems presents two significant challenges: high technical complexity and high development effort. This paper presents a software platform that can effectively remedy these challenges. This platform embodies a unified software process for CECT-specific disease diagnosis including oncological diseases, cardiovascular diseases, and gastrointestinal diseases. It integrates multiple types of machine learning models into the disease diagnosis process, where the models can diagnose lesions, malignancies, tumors, medical features of tumors, temporal transitions with a contrast agent, and disease progress. The platform has been implemented in Python using Scikit-learn and TensorFlow libraries. To validate its applicability and reusability, a Hepatocellular Carcinoma (HCC) diagnosis system has been implemented.

In this paper, we give closed-form expressions of the $p$-Frobenius number for the triple of the generalized star numbers $a n(n-1)+1$ for an integer $a\ge 4$. When $a=6$, it is reduced to the famous star number. For the set of given positive integers $\{a_1,a_2,\dots,a_k\}$, the $p$-Frobenius number is the largest integer $N$ whose number of nonnegative integer representations $N=a_1 x_1+a_2 x_2+\dots+a_k x_k$ is at most $p$. When $p=0$, the $0$-Frobenius number is the classical Frobenius number, which is the central topic of the famous linear Diophantine problem of Frobenius.

The advancement of urban scholarship and the effective addressing of urban environment challenges necessitate the adoption of sophisticated analytical methods. Urban scholars and policymakers need advanced analytical methods to tackle issues like gentrification, housing affordability, and urban sprawl. Predictive models are crucial in the realm of urban sciences, and hyperparameter tuning methods can significantly improve their accuracy and efficiency. Our study compares three such methods — Optuna, Random Search, and Grid Search — using a housing transaction dataset. We find that Optuna is not only 5.58 to 70.50 times faster than the other two methods when applied to Random Forest and Gradient Boosting Machine algorithms, but also achieves lower error values in key evaluation metrics on the test set, such as mean absolute error, mean squared error, mean absolute percentage error and root mean squared error.

Hyperspectral small target detection (HSTD) is a promising pixel-level detection task. However, due to the low contrast and imbalance number between the target and background spatially and high dimensions spectrally, it is a challenging one. To address these issues, this work proposes a representation learning-based graph and generative network for hyperspectral small target detection. The model builds a fusion network through frequency representation for HSTD, where the novel architecture incorporates irregular topological data and the spatial-spectral feature to improve its representation ability. Firstly, a graph convolutional network (GCN) module better models the non-local topological relationship between samples to represent the hyperspectral scene’s underlying data structure. The mini-batch-training pattern of the GCN decreases the high computational cost of building an adjacency matrix for high-dimensional data sets. In parallel, the generative model enhances the differentiation reconstruction and the deep feature representation ability with respect to the target spectral signature. Finally, a fusion module compensates for the extracted different types of HS features and integrates their complementary merits for hyperspectral data interpretation while increasing detection and background suppression capabilities. Experiments on different hyperspectral data sets demonstrate the advantages of the proposed architecture.

Let S be a Fermat surface of degree 5 and let k be an algebraically closed field of characteristic p = 2. We give a fibration ƒ: S → P with upper limit 1 and lower limit k, and investigate the geometric properties of fiber of ƒ. Furthermore, we investigate the fibration-preserving automorphisms group Aut_{Pwith upper limit 1 and lower limit k}(S) of ƒ. We obtain that Aut_{Pwith upper limit 1 and lower limit k}(S) is a p-group of order 256.

In this paper we introduce the Adomian decomposition method for a class of first order fuzzy dynamic equations on arbitrary time scales for existence of solutions. The results are provided with suitable numerical examples.

This research article provides an unconditional proof of an inequality proposed by \textit{Srinivasa Ramanujan} involving the Prime Counting Function $\pi(x)$, \begin{align*} (\pi(x))^{2}<\frac{ex}{\log x}\pi\left(\frac{x}{e}\right) \end{align*} for every real $x\geq \exp(547)$, using specific order estimates of the \textit{Mertens Function}, $M(x)$. The proof primarily hinges upon investigating the underlying relation between $M(x)$ and the \textit{Second Chebyshev Function}, $\psi(x)$, in addition to applying the meromorphic properties of the \textit{Riemann Zeta Function}, $\zeta(s)$ with an intention of deriving an improved approximation for $\pi(x)$.

This paper comprehensively explores the integration of cloud computing and advanced recommendation systems, emphasizing their pivotal roles in enhancing user experiences and operational efficiencies across digital platforms. It reviews the evolution of recommendation algorithms, highlighting their application in diverse domains such as e-commerce and media. The study evaluates the performance of advanced models like UniLLMRec against traditional counterparts using datasets from news and e-commerce domains. Additionally, the paper discusses the infrastructure architecture of cloud computing, demonstrating its capability to support scalable and efficient data processing. Through experimental insights and methodology, the research underscores the transformative impact of cloud technologies on optimizing recommendation system performance, thereby advancing digital engagement and competitiveness.

Logistic Regression and Random Forest are used to identify risk factors that influence traffic accident fatalities in the United Kingdom. The mean decrease accuracy was used to measure variable importance. The speed limit, police attendance and quarter had an increasing influence on accident fatalities. They had a mean decrease of 102.1669, 221.5322, and 120.894 respectively. The speed limit, had a parameter estimate of 0.0046902 and a standard deviation of 0.0004875. Light Conditions: Night had a parameter estimate of 1.2657635 and a standard deviation of 0.0118409. Road Type Round About had a parameter estimate of -0.4055796 and a standard deviation of 0.0210848. Police Attendance classified as Yes had a parameter of 0.8546232 and a standard deviation of 0.0151043. The best predictors were speed limit, police attendance and quarter since they had p values that were less than 0.05. The findings of the study indicated that logistic Regression had a higher accuracy rate 79.85% as compared to 64.00% for Random Forest. A split test was used and a standard deviation of 0.0010486 was obtained for the Logistic Regression model.

Accurate and robust deep learning models for facial expression recognition are challenging to achieve, given the diversity of human faces and variations in images, including different facial poses and lighting conditions. In this work, we proposed a clock-driven convolutional Spiking Neural Network (SNN) and STDP fine-tune architecture, meticulously calibrated its hyperparameters, and experimented with various optimization methods. The best model resulted was trained and evaluated on the Fer2013 and FER+ database, obtaining an accuracy of 61.87% and 79.97% without requiring auxiliary training data or face registration. To our best knowledge, the proposed SNN achieved comparable accuracy to CNNs of similar depth and possessed the advantages of low energy consumption and high computational efficiency. The computational efficiency of the proposed SNN is approximately three times that of CNNs. Along with this, we introduced the very recent cumulative spike guided encoder visualization technique and revealed the strong encoding capability of the proposed SNN.

In India, the divorce rate is rising year after year. Divorces are thought to have increased by more than a factor of two during the past two decades. India has great cultural diversity, and each of its states has something unique to offer. The divorce rate in India, which differs from state to state, is among the most frequently discussed subjects. More than 30% of marriages end in divorce in big cities like Delhi, Mumbai, Chennai, and Bangalore. Divorce applications have nearly tripled in the past few years in cities like Delhi, Bangalore, Mumbai, Kolkata, and Lucknow. In India, the divorce rate has increased, especially in small cities. Hence, the reasons behind divorce in India were explored in this article. In order to analyze the causes of divorce, the current study aimed to combine the critical components of TOPSIS and COPRAS methodologies in a fuzzy environment. Additionally, it is shown that a comparison study may pinpoint the characteristics that influence divorces the most.

The primary purpose of this article is to provide a brief overview about the notion of the \textit{Mertens Function} $M(n)$ and \textit{Redheffer Matrices} $\mathbb{A}_{n}$ and, to derive specific order estimates for $M(n)$, in order to analyze the location of the non-trivial zeros of the \textit{Riemann Zeta function} $\zeta(s)$. A priori using the above concepts, the article aims at establishing a necessary and sufficient condition for the \textit{Riemann Hypothesis} to hold true.

Credit card payment platforms are increasingly used for e-commerce activities. Credit cards are payment cards issued to individuals so they can purchase products and services based on their accumulated debt. Since credit cards are becoming very popular and widely used, the number of related fraud cases is likewise increasing. Whereas, there are large numbers of credit card transactions daily; thus, it becomes complex to differentiate between fraudulent and non-fraudulent transactions. Accordingly, different machine learning (ML) tools have been deployed in the literature to filter credit card transactions to prevent cardholders and financial institutions from losing money. In this article, the ensemble hidden Markov model (EHMM) approach is deployed to predict credit card fraud. EHMM is a popular and flexible ML tool that can easily model randomly changing datasets. Yet, the performance of the EHMM solely depends on the adopted feature extraction technique. The more reliable the feature extraction technique, the better the performance of the EHMM. In this vein, this article analyses two feature extraction techniques that can be combined with the EHMM for the prediction of credit card fraud. First, the principal component analysis (PCA) feature extraction techniques are combined with the EHMM to effectively predict credit card fraud. Yet, the PCA increases the computational time complexity of the EHMM. Therefore, this article adapts some statistical features to reduce the computational time complexity imposed on the EHMM. These robust but simple statistical features termed MRE; Mean, Relative Amplitude, and Entropy, are merged to form a feature vector that can be combined with the EHMM to effectively predict credit card frauds. The performance of the PCA-EHMM and MRE-EHMM are evaluated using the credit card transactions dataset of European cardholders gathered within two days in September 2013. The results were documented using different performance metrics such as recall/sensitivity, specificity, precision, and F1-score. The findings of this article will offer solutions to the loss experienced by cardholders and financial institutions as a result of online banking which requires credit card details.

With the development of educational technology, machine learning and deep learning provide technical support for traditional classroom observation assessment. However, in real classroom scenarios, the technique faces challenges such as lack of clarity of raw images, complexity of datasets, multi-target detection errors and complexity of character interactions.Based on the above problems, a student classroom behavior recognition network incorporating super-resolution and target detection is proposed. To cope with the problem of unclear original images in the classroom scenario, SRGAN (Super Resolution Generative Adversarial Network for Images) is used to improve the image resolution and thus the recognition accuracy.To address the dataset complexity and multi-targeting problems, feature extraction is optimized and multi-scale feature recognition is enhanced by introducing AKConv and LASK attention mechanisms into the Backbone module of YOLOv8s algorithm. To improve the character interaction complexity problem, the CBAM attention mechanism is integrated to enhance the recognition of important feature channels and spatial regions. Experiments show that it can detect six behaviors of students raising their hands, reading, writing, playing cell phones, looking down, and lying on the table in high-definition images. And the accuracy and robustness of this network are verified.Compared with small target detection algorithms such as Faster R-CNN, YOLOv5, and YOLOv8s, this network has better detection performance and can efficiently deal with the behavior recognition of multiple students.

In this paper, a generic fractional derivative is defined as a set of the linear operators left-inverse to the Riemann-Liouville fractional integral. Then the theory of the left-invertible operators developed by Przeworska-Rolewicz is applied for derivation of its properties. In particular, we characterize its domain, null-space, and projector operator, establish the interrelations between its different realisations, and present a generalized fractional Taylor formula involving the generic fractional derivative. Then we consider the fractional relaxation equation containing the generic fractional derivative, derive a closed form formula for its unique solution, and study its complete monotonicity.

In order to reduce the environmental impact of energy enterprises, it is important to promptly identify cases of possible changes in the quality of wastewater generated at power plants, that is cases of exceeding the maximum permissible concentrations of pollutants in wastewater. The goal of the method for detecting complex anomalies in multidimensional time series obtained from smart energy station’s sensor channels is to increase the accuracy of detecting pollution levels in industrial wastewater. To achieve this goal, the following tasks were solved: methods for detecting time series anomalies were analyzed, the method for detecting complex anomalies was developed, software implementation of the algorithm was carried out and experiments were conducted. The developed method is proposed to be used in an smart energy monitoring system.

Nowadays and in the web era, there is a huge amount of information available due to automatically and easily generated websites. This information has many shared opinions from people toward different entities. Over the last decade there was a significant huge interest to determine the sentiment of any type of text especially on twitter. Twitter provides unstructured text that has many misspelling words, slang words and shortened forms. More complexity and challenges have come to the sentiment analysis researchers in the context of twitter. In this paper we conducted a literature review of the recent research of Twitter sentiment analysis on different languages. After that, we investigated challenges related to twitter sentiment analysis of Arabic language. Then we found a new solution for Sentiment analysis of Arabic twitter. So, we designed the main component of the proposed system and presented its algorithm. Finally, we performed many experiments under two kinds of datasets. The system achieves highest accuracy and shows many important results..

Generative Adversarial Networks (GANs) are powerful models for generative tasks but face significant challenges such as instability, mode collapse, and inefficient convergence. This paper introduces a theoretical framework leveraging Fermi-Dirac statistics, Ruppeiner geometry, phase transition dynamics, and graph theory to address these issues. The proposed theorems provide a robust mathematical foundation for enhancing GAN stability, diversity, and convergence. Experimental validation on the MNIST dataset demonstrates that the application of these theorems results in improved Inception Scores, reduced Fr´echet Inception Distances, and stable training dynamics, as indicated by Ruppeiner curvature analysis. The findings suggest that these theoretical insights offer a comprehensive solution to the persistent challenges in GAN training, paving the way for more reliable and effective generative models.

This Paper delves into a thorough analysis of the DC-DC buck converter tailored for renewable energy applications. Given the prevalent utilization of renewable resources producing DC voltages, this converter plays a pivotal role in stepping down high-level DC voltages to more manageable levels. The research focuses on varying the duty cycle to assess its impact on the converter's output voltage performance. Simulations conducted using PSIM are meticulously compared with hardware implementation results, demonstrating the converter's efficacy in generating significantly reduced output voltages. The findings underscore the practical applicability of this converter in renewable energy scenarios, offering a succinct yet insightful perspective on its performance and adaptability.

Magnetic resonance imaging (MRI) is crucial for its superior soft tissue contrast and high spatial resolution. Integrating deep learning algorithms into MRI reconstruction enhances image quality and efficiency, but a comprehensive review of optimization-based deep learning models for MRI reconstruction has been missing. This study fills that gap by examining the latest optimization-based algorithms in deep learning for MRI reconstruction, including gradient descent algorithms, proximal gradient descent algorithms, ADMM, PDHG, and diffusion models combined with gradient descent. Learnable optimization algorithms (LOA) are highlighted for their ability to map optimization processes to structured neural networks, improving model interpretability and performance. The study demonstrates significant advancements in MRI reconstruction through deep learning, with successful clinical applications. These findings provide valuable insights and resources for researchers aiming to advance medical imaging using innovative deep learning techniques.

The task of human action recognition (HAR) based on skeleton data is a challenging yet crucial technique owing to its wide-ranging applications in numerous domains, including patient monitoring, security surveillance, and observation of human-machine interactions. While numerous algorithms have been proposed in an attempt to distinguish between a myriad of activities, most practical applications necessitate highly accurate detection of specific activity types. This study proposes a novel and highly accurate spatiotemporal graph autoencoder network for HAR based on skeleton data. Furthermore, an extensive investigation was conducted employing diverse modalities. To this end, a spatiotemporal graph autoencoder was constructed to automatically learn both spatial and temporal patterns from human skeleton datasets. The powerful graph convolutional network, designated as GA-GCN, developed in this study, notably outperforms the majority of existing state-of-the-art methods when evaluated on two common datasets, namely NTU RGB+D and NTU RGB+D 120. On the first dataset, the proposed approach achieved accuracies of 92.3\% and 96.8\% for the cross-subject and cross-view evaluations, respectively. On the more challenging NTU RGB+D 120 dataset, GA-GCN attained accuracies of 88.8\% and 90.4\% for the cross-subject and cross-set evaluations, respectively.

It has been discovered that representing odd integers as modified binary expressions of the form $\sum \limits_{n > m}2^n + 2^m - 1$ for $m \geq 1$ helps in understanding the dynamics of Collatz-type sequences. Starting with the original Collatz sequence $3x + 1$, it is found that when the odd step is applied to an odd integer $\sum \limits_{n > m}2^n + 2^m - 1$, an even integer $3\left(\sum \limits_{n > m}2^{n}\right) + 2^{m + 1} + 2^m - 2$ is obtained, which is exactly once divisible by 2, unless the lowest index reduces to zero. This implies that the sequence alternates between odd and even steps $m$ times. This governs the dynamics of the Collatz-type sequences because the value of $m$ determines the number of times the integer can be divided by 2 in each even step. A shortcut method is developed based on this dynamics that states that the even integer after $m$ odd-even steps are completed is $\left(\left(\frac{3}{2}\right)^m \sum \limits_{n > m}2^n\right) + 3^m - 1$. A shortcut method of this magnitude has never been utilized anywhere. The shortcut method for the modified Collatz sequence $5x + 1$ is also presented.

Explosion monitoring is performed by infrasound and seismoacoustic sensor networks that are distributed globally, regionally, and locally. However, these networks are unevenly and sparsely distributed, especially in the local scale as maintaining and deploying networks is costly. With increasing interest in smaller yield explosions, the need for more dense networks has increased. To address this issue, we propose using smartphone sensors for explosion detection as they are cost-effective and easy to deploy. Although there are studies using smartphone sensors for explosion detection, the field is still in its infancy and new technologies need to be developed. We applied a machine learning model for explosion detection using smartphone microphones. The data used were from the Smartphone High-explosion Audio Recordings Dataset (SHAReD), a collection of 326 waveforms from 70 high-explosive (HE) events recorded on smartphones, and the ESC-50 dataset, a benchmarking dataset commonly used for environmental sound classification. Two machine learning models were trained and combined into an ensemble model for explosion detection. The resulting ensemble model classified audio signals as either “explosion,” “ambient,” or “other” with true positive rates (recall) greater than 96% for all three categories.

The primary purpose of this article is to study the asymptotic and numerical estimates in detail for higher degree polynomials in $\pi(x)$ having a general expression of the form, \begin{align*} P(\pi(x)) - \frac{e x}{\log x} Q(\pi(x/e)) + R(x) \end{align*} $P$, $Q$ and $R$ are arbitrarily chosen polynomials and $\pi(x)$ denotes the \textit{Prime Counting Function}. The proofs require specific order estimates involving $\pi(x)$ and the \textit{Second Chebyshev Function} $\psi(x)$, as well as the famous \textit{Prime Number Theorem} in addition to certain meromorphic properties of the \textit{Riemann Zeta Function} $\zeta(s)$ and results regarding its non-trivial zeros. A few generalizations of these concepts have also been discussed in detail towards the later stages of the paper, along with citing some important applications.

This work studies how the Elo rating system can be applied to score-based sports, where it’s gaining popularity, and in particular for predicting the result at any point of a game, extending its statistical basis to stochastic processes. We derive some new theoretical results for this model and use them to implement Elo ratings for basketball and soccer leagues, where the assumptions of our model are tested and found to be mostly accurate. We showcase several metrics for comparing the performance of different ratings systems and determine whether adding a feature has a statistically significant impact. Finally, we propose an Elo model based in a discrete process for the score that allows us to obtain draw probabilities for soccer matches, and has a performance competitive with alternatives like SPI ratings.

Renewable energy especially insights into solar energy are crucial in the energy business cycle. In this paper, an impact study of meteorological variables on solar energy production is conducted. The paper discusses the pipeline of data analysis specific to the case study and exploits open-source machine-learning algorithms to build predictive models. RandomForestRegressor and XGBoosting regressors are used to build the predictive model. The application code is integrated into an analytic software service (Power BI) and tested on Solar energy Open Data of Saudi Arabia. The solar energy production is found to be high between 800-1000 barometric pressure locations. Global Horizontal Irradiation is found to increase when the atmospheric temperature is more than 34∘ C. The impact of relative humidity is that the produced energy is high at lower humidity points. The wind speed effect is that the produced energy is significant between 2 to 4 m/s and reaches its maximum at 2.4 m/s. The predictive models produce nearly real-time predictions with Random Forest with R²: 0.909. The paper provides Global Horizontal Irradiation estimation equations using meteorological coefficients generated by the trained regressor. The paper presents implementation methodologies and records various instances of test results. It highlights the efficacy of machine learning in predictive modeling for renewable energy applications.

In an era where the proliferation of large language models blurs the lines between human and machine-generated content, discerning text authenticity is paramount. This study investigates transformer-based language models—BERT, RoBERTa, and DistilBERT—in distinguishing human-written from machine-generated text. By leveraging a comprehensive corpus, including human-written text from sources such as Wikipedia, WikiHow, various news articles in different languages, and texts generated by OpenAI's GPT-2, we conduct rigorous comparative experiments. Our findings highlight the superior effectiveness of ensemble learning models over single classifiers in this critical task. This research underscores the versatility and efficacy of transformer-based methodologies for a wide range of natural language processing applications, significantly advancing text authenticity detection systems. The results demonstrate competitive performance, with the transformer-based method achieving an F-score score of 0.83 with RoBERTa-large (monolingual) and 0.70 with DistilBERT-base-uncased (multilingual).

Big Data and blockchain technology are coming together to revolutionize how decisions are made in a decentralized way across various industries. This review looks at how these technologies, along with distributed systems, can improve data security, transparency, and real-time processing, making decision-making more efficient and informed. The integration enhances data security with unchangeable records, increases transparency and traceability, and supports real-time data analysis. However, there are challenges to overcome, including scalability, data privacy, interoperability, regulatory compliance, and high costs. By examining case studies such as Estonia's healthcare system, IBM and Walmart's Food Trust, and the Brooklyn Microgrid project, we explore the practical applications and benefits of combining Big Data with blockchain. Despite these hurdles, the review finds that the ongoing advancements and innovative solutions in these technologies offer significant promise. They are set to drive the adoption and effectiveness of decentralized decision-making, ultimately leading to better efficiency and outcomes across multiple sectors.

This study presents the Distilled MixUp Squeeze ResNet (DMSResNet), an optimized variant of the Residual Network architecture designed for high accuracy and computational efficiency. By integrating Squeeze-and-Excitation blocks, MixUp data augmentation, and knowledge distillation, it achieves competitive performance within strict parameter constraints and limited training resources. Evaluated on the CIFAR-10 dataset, the model attains a 96.56% accuracy with only 4.3 million total parameters. The results demonstrate that optimization of established architectures can yield performance comparable to newer models, especially in resource-limited scenarios. This work contributes to the development of efficient deep learning models for applications in constrained computational environments.

This paper introduces a quantitative methodology for assessing drone pilot performance, aiming to reduce drone-related incidents by understanding the human factors influencing performance. The challenge lies in balancing evaluations in operationally relevant environments with those in a standardized test environment for statistical relevance. The proposed methodology employs a novel virtual test environment that records not only basic flight metrics but also complex mission performance metrics, such as the video quality from a target. A group of Belgian Defence drone pilots were trained using this simulator system, yielding several practical results. These include a human performance model linking human factors to pilot performance, an AI co-pilot providing real-time flight performance guidance, a tool for generating optimal flight trajectories, a mission planning tool for ideal pilot assignment, and a method for iterative training improvement based on quantitative input. The training results with real pilots demonstrate the methodology’s effectiveness in evaluating pilot performance for complex military missions, suggesting its potential as a valuable addition to new pilot training programs.

The whimsical Las Vegas/Monte Carlo cubic dice are generalized to construct the combinatorial problem of enumerating all n-dimensional hypercube dice, and dice of other shapes that exhibit cubic, icosahedral and higher symmetries. By utilizing powerful generating function techniques for various irreducible representations, we derive the combinatorial enumerations of all possible dice in n-dimensional space with hyperoctahedral symmetries. Likewise a number of shapes that exhibit icosahedral symmetries such as a truncated dodecahedron and a truncated icosahedron are considered for the combinatorial problem of dice enumerations with the corresponding shapes. We consider several dice with cubic symmetries such as truncated octahedron, dodecahedron and Rubik’s cube shapes. It is shown that all enumerated dice are chiral and we provide the counts of chiral pairs of dice in the n-dimension space. During the combinatorial enumeration, it was discovered that two different shapes of dice exist with the same chiral pair count culminating into the novel concept of isochiral polyhedra. The combinatorial problem of dice enumeration is generalized to multi-coloring partitions. Applications to chirality in n-dimension, molecular clusters, zeolites, mesoporous materials, cryptography and biology are also pointed out. Applications to nonlinear n-dimensional hypercube and other dicey encryptions are exemplified with romantic, clandestine messages; “I love U” and “V Elope at 2”.

Many people, including Horadam, have studied the numbers $W_n$, satisfying the recurrence relation $W_n=u W_{n-1}+v W_{n-2}$ ($n\ge 2$) with $W_0=0$ and $W_1=1$. In this paper, we study the $p$-numerical semigroups of the triple $(W_i,W_{i+2},W_{i+k})$ for integers $i,k(\ge 3)$. For a nonnegative integer $p$, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose nonnegative integral linear combinations of given positive integers $a_1,a_2,\dots,a_\kappa$ with $\gcd(a_1,a_2,\dots,a_\kappa)=1$ are expressed in more than $p$ ways. When $p=0$, $S=S_0$ is the original numerical semigroup. The largest element and the cardinality of $\mathbb N_0\backslash S_p$ are called the $p$-Frobenius number and the $p$-genus, respectively.

For Sir Ronald Fisher, it is important to consistently obtain significant p-values to support an experimental hypothesis. So, replicating experiments to obtain independent p-values is a legitimate and desirable research practice. Several simple statistics have been proposed to meta-analyze p-values, all assuming that they are genuine, i.e. observations from independent standard Uniform random variables. But, as publication bias favors the studies that report "significant" p-values, when a p&gt;0.05 is obtained for the outcome of an experiment, some researchers will "fall into temptation" and decide to replicate the experiment in the hope of getting a smaller second p-value, ideally a significant one. Consequently, if the smallest of two p-values is reported, this is a Beta(1,2) distributed "fake" p-value, not a uniformly distributed genuine p-value. This is an unacceptable scientific research practice, and moreover the detection of fake p-values is unpractical. Even when it is possible, the analytic results to accommodate their existence in combined tests are cumbersome. For an informed decision, inclusive when the presence of fake p-values in a sample of p-values to be meta-analyzed is probable, tables with simulated critical values for the usual combined testing are supplied. This will also allow comparisons to be made between several combined tests.

Planar differential systems whose angular velocity is constant are called rigid differential systems. We characterize the existence and non-existence of limit cycles, and the finite and infinite singularities of the rigid polynomial differential systems with homogeneous nonlinearities of arbitrary degree in the Poincaré disc. Moreover, we classify the phase portraits in the Poincaré disc of the rigid polynomial differential systems of degree two, and of one class of rigid polynomial differential systems with cubic homogeneous nonlinearitie that can exhibit one limit cycle.

Financial market data analysts are increasingly turning towards machine learning techniques for data analysis and making decisions. This paper explores how knowledge graphs, essentially a network of real entities and their relationships, can be used to improve collaborative financial market data analysis and make it more efficient and user friendly. This paper reviews the current state of financial market data analysis, the challenges in deploying machine learning models in industrial environments, and the concepts such as ML-Ops and knowledge graphs. A software architecture comprising various roles, layers and services such as Data Engineers, Data Analysts, public users, APIs, workflows, analytics libraries, UX layer, Business Layer, etc. is introduced and described in detail. Then, it discusses how knowledge graphs can be used to enhance collaborative financial market data analysis. Finally, a case study is presented to demonstrate the usage of the whole system, within the context of financial market data analytics of equities.

This study provides an evaluation of a web-based platform for game management and sales, developed using PHP, MySQL, and SASS. The development process utilized the SCRUM methodology, concentrating on essential modules such as user management, game catalog, payment processing, and technical support. The platform's performance was assessed using Google's Lighthouse tool, which evaluates four critical areas: performance, accessibility, best practices, and SEO. The results demonstrated exceptional performance with a score of 99/100 and perfect adherence to best practices with a score of 100/100, reflecting high efficiency and compliance with web development standards. Accessibility received a score of 83/100, indicating potential areas for improvement, while SEO achieved a score of 91/100, suggesting effective search engine optimization. The findings reveal that the platform exhibits high levels of optimization and operational efficiency. However, there remains an opportunity to enhance accessibility features. This study highlights the significance of rigorous web development practices and optimization efforts in achieving superior performance and user experience in web-based systems.

The symptoms of multiple sclerosis (MS) are determined by the location of demyelinating lesions in the white matter of the brain and spinal cord. Currently, magnetic resonance imaging (MRI) is the most common tool for diagnosing MS, understanding the course of the disease, and analyzing the effects of treatments. However, undesirable components may appear during the generation of MRI, such as noise or intensity variations. Mathematical morphology (MM) is a powerful image analysis technique that helps to filter the image and extract relevant structures. Granulometry is an image measurement tool of MM that determines the size distribution of objects in an image without explicitly segmenting each object. While, several methods have been proposed for the automatic segmentation of MS lesions in MRI, in some cases only simple data preprocessing, such as image resizing to standardize the input dimensions, has been performed before the algorithm training. Therefore, this paper proposes an MRI preprocessing algorithm performing elementary morphological transformations in brain images of MS patients and healthy individuals to delete undesirable components and extract the relevant structures such as MS lesions. Also, the algorithm computes the granulometry in MRI to describe the size qualities of lesions and trains two artificial neural networks (ANN) to predict MS diagnosis. The computing of differences in granulometry measurements of an image with MS lesions and a reference image (without lesions) can determine the size characterization of the lesions. Then, the ANNs were evaluated with the validation set and the performance results (test accuracy = 0.9753, and cross-entropy loss = 0.0247) show the proposed algorithm can support the decision of specialists for diagnosing MS and estimating the disease progress, based on granulometry values.

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

In the future, smart cities will provide key services including seamless communication, intelligent transport systems, advanced healthcare platforms, urban and infrastructure management, and digital services for local and regional government. Therefore, a new service and networking paradigm, called the Intelligent Edge Environment, has been specified. and is known as the Intelligent Edge Environment. As a key part of this system, a new secure service ecosystem must be developed to provide the secure realtime movement of services on different High-Performance Edge Cloud Systems. This paper explores these issues by introducing the following mechanisms: the Resource Allocation Algorithm, the Resource Allocation Secure Protocol and finally the Secure Service Protocols. These systems were integrated into the Basic Capabilities System Library and a multithreaded FUSE client connected to the Service Management Framework. Docker was used as a migration mechanism. A prototype was developed and implemented using a FUSE-Network Memory System in which the Network Memory Server was migrated as users move around. The result shows that this approach was safe and could be used to develop new applications and services for smart cities.