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

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

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

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

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

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

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

This paper explores the capability of various machine learning algorithms, including Random Forests and advanced gradient boosting techniques such as XGBoost, LightGBM, and CatBoost, to predict customer churn in the telecommunications sector. For this analysis, a dataset available to the public was employed. The performance of these algorithms was assessed using recognized metrics, including Accuracy, Precision, Recall, F1-score, and the Receiver Operating Characteristic Area Under Curve (ROC AUC). These metrics were evaluated at different phases: subsequent to data preprocessing and feature selection; following the application of SMOTE and ADASYN sampling methods; and after conducting hyperparameter tuning on the data that had been adjusted by SMOTE and ADASYN. The outcomes underscore the notable efficiency of upsampling techniques such as SMOTE and ADASYN in addressing the imbalance inherent in customer churn prediction. Notably, the application of random grid search for hyperparameter optimization did not significantly alter the results, which remained comparatively unchanged. The algorithms' performance post- ADASYN application marginally surpassed that observed after SMOTE application. Remarkably, LightGBM achieved an exceptional F1-score of 89% and an ROC AUC of 95% subsequent to the ADASYN sampling technique. This underlines the effectiveness of advanced boosting algorithms and upsampling methods like SMOTE and ADASYN in navigating the complexities of imbalanced datasets and intricate feature interdependencies.

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

This paper presents an analysis of the number of zeros in the binary representation of natural numbers. The primary method of analysis involves the use of the concept of the fractional part of a number, which naturally emerges in the determination of binary representation. This idea is grounded in the fundamental property of the Riemann zeta function, constructed using the fractional part of a number. Understanding that the ratio between the fractional and integer parts of a number, analogous to the Riemann zeta function, reflects the profound laws of numbers becomes the key insight of this work. The findings suggest a new perspective on the interrelation between elementary properties of numbers and more complex mathematical concepts, potentially opening new directions in number theory and analysis.

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

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

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

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

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

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

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

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

This article develops duality principles and numerical results for a large class of non-convex variational models. The main results are based on fundamental tools of convex analysis, duality theory and calculus of variations. More specifically the approach is established for a class of non-convex functionals similar as those found in some models in phase transition. Finally, in some sections we present concerning numerical examples and the respective softwares.

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

This paper presents an analysis of the number of zeros in the binary representation of natural numbers. The primary method of analysis involves the use of the concept of the fractional part of a number, which naturally emerges in the determination of binary representation. This idea is grounded in the fundamental property of the Riemann zeta function, constructed using the fractional part of a number. Understanding that the ratio between the fractional and integer parts of a number, analogous to the Riemann zeta function, reflects the profound laws of numbers becomes the key insight of this work. The findings suggest a new perspective on the interrelation between elementary properties of numbers and more complex mathematical concepts, potentially opening new directions in number theory and analysis.

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

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

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

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

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

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

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

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

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

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

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

Aiming at effectively generating safe and reliable motion paths for quadruped robots, a hierar-chical path planning approach driven by dynamic 3D point cloud is proposed in this article. The developed path planning model is essentially constituted of two layers: global path planning layer and local path planning layer. At the global path planning layer, a new method is proposed for calculating terrain potential field based on point cloud height segmentation. Variable step size is employed to improve the path smoothness. At the local path planning layer, a real-time prediction method for potential collision area and a strategy for temporary target point selection is developed. Quadruped robot experiments were carried out in an outdoor complex environment. The experi-mental results verified that, for global path planning, the smoothness of the path is improved and the complexity of the passing ground is reduced. The effective step size is increased by a maxi-mum of 13.4 times, and the number of iterations is decreased by up to 1/6, compared with the traditional fixed step size planning algorithm. For local path planning, the path length is short-ened by 20%, more efficient dynamic obstacle avoidance and more stable velocity planning are achieved by using the improved dynamic window approach (DWA).

Floods, recognized for their erratic behavior and devastating effects, are a significant threat as a natural disaster. In Brunei Darussalam, the impact of climate change is becoming increasingly evident through higher temperatures and an expected increase in annual rainfall (5.0mm per year from 2021 to 2050), highlighting the critical need for updated flood risk management techniques. In line with the climate resilience and adaptation objectives of WAWASAN 2035, this paper introduces an innovative approach—a cutting-edge flood risk management framework that utilizes the capabilities of big data analytics, sophisticated machine learning algorithms, and smart Internet of Things (IoT) sensors. Traditional methods, which rely on numerical and physical data modeling, often do not provide precise short-term flood forecasts. Our suggested framework uses machine learning to analyze real-time flood forecasting, sensor data and enhance warning systems, addressing the shortcomings of traditional approaches. The key advantage of this approach is its potential to drastically decrease flood-related damages, protect lives, and boost infrastructure resilience. This proposal is not only in aligns with Brunei's vision for a safe and climate-adaptable future but also marks a significant step forward in adopting innovative and sustainable flood risk management solutions amidst an evolving climate.

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

This study investigates the pivotal areas where Artificial Intelligence (AI) integration in healthcare warrants further exploration, leveraging insights from Boston Specialists, a forefront healthcare provider in AI adoption. Employing a qualitative case study approach, enriched by in-depth interviews and comprehensive literature reviews, we identify three main domains for potential AI expansion: scheduling efficiency, clinical documentation, and AI-driven medical research. Our results underscore the substantial enhancements AI brings to operational workflows and patient care, notably through improved scheduling systems, accuracy in medical documentation, and the facilitation of data-driven research methodologies. These findings suggest a critical need for healthcare institutions to further invest in AI technologies, focusing on these key areas to harness AI's full potential in personalizing care, optimizing efficiency, and advancing medical knowledge. The study concludes with a call for continued investigation into AI's integration within healthcare settings, emphasizing the importance of a supportive organizational infrastructure, ethical considerations, and data security in realizing AI's transformative impact on healthcare delivery and patient outcomes.

In the dynamic landscape of modern education, characterized by an increasingly active involvement of IT technologies in learning, the imperative to transfer to students the skills necessary to integrate Artificial Intelligence (AI) into the process represents an important goal. This paper presents a novel framework for knowledge transfer, diverging from traditional programming language-centric approaches by integrating PSoC 6 microcontroller technology. This framework establishes a cyclical learning cycle encompassing theoretical fundamentals and practical experimentation, fostering AI literacy at the edge. Through a structured combination of theoretical instruction and hands-on experimentation, students develop proficiency in understanding and harnessing AI capabilities. Emphasizing critical thinking, problem-solving, and creativity, this approach equips students with the tools to navigate the complexities of real-world AI applications effectively. By leveraging PSoC 6 as an educational tool, a new generation of individuals is efficiently cultivated with essential AI skills. These individuals are adept at leveraging AI technologies to address societal challenges and drive innovation, thereby contributing to long-term sustainability initiatives. Specific strategies for experiential learning, curriculum recommendations, and results of knowledge application are presented, aimed at preparing students to excel in a future where AI will be omnipresent and indispensable.

Recently, Gohar et al. introduced a novel, local, and well-behaved fractional calculus. It possesses all the classical properties, and Its locality imposes simplicity and accuracy in modeling fractional order systems. In this article, we further develop the definitions and extend the classical properties of Gohar fractional calculus to address some of the open problems in Calculus. The fractional Gronwall's integral inequality, Taylor power series expansion, and Laplace transform are defined and applied to overcome some of the limitations in the classical integer-order calculus. The fractional Laplace transform is applied to solve Bernoulli-type logistic and Bertalanffy nonlinear fractional differential equations, and the criteria under which it can be applied to solve linear differential equations are investigated.

In recent years, large language models have demonstrated remarkable performance across various natural language processing (NLP) tasks. However, deploying these models for real-world applications often requires efficient inference solutions to handle the computational demands. In this paper, we explore the utilization of CPUs for accelerating the inference of large language models. Specifically, we introduce a parallelized approach to enhance throughput by 1) Exploiting the parallel processing capabilities of modern CPU architectures, 2) Batching the inference request. Our evaluation shows the accelerated inference engine gives an 18-22x improvement in the generated token per sec. The improvement is more with longer sequence and larger models. In addition to this, we can also run multiple workers in the same machine with NUMA node isolation to further improvement in tokens/s. Table 2, we have received 4x additional improvement with 4 workers. This would also make Gen-AI based products and companies’ environment friendly, our estimates shows that CPU usage for Inference could reduce the power consumption of LLMs by 48.9% (1252 W for A100 with AMD EPYC 7V13 vs 613 W for Intel® Xeon® Gold 6538N) while providing production ready throughput & latency.

Predicting human trajectories poses a significant challenge due to the complex interplay of pedestrian behavior, which is influenced by environmental layout and interpersonal dynamics. This complexity is further compounded by variations in scene density. To address this, we introduce a novel dataset from the Festival of Lights in Lyon 2022, characterized by a wide range of densities (0.2-2.2 ped/m2). Our analysis demonstrates that density-based classification of data can significantly enhance the accuracy of predictive algorithms. We propose an innovative two-stage processing approach, surpassing current state-of-the-art methods in performance. Additionally, we utilize a collision-based error metric to better account for collisions in trajectory predictions. Our findings indicate that the effectiveness of this error metric is density-dependent, offering prediction insights. This study not only advances our understanding of human trajectory prediction in dense environments but also presents a methodological framework for integrating density considerations into predictive modeling, thereby improving algorithmic performance and collision avoidance.

The Diophantine equation for which p is prime 2^n = p^2 + 7 and n is integers with p > 0, is examined in this work. It is demonstrated by examining the characteristics of the equation that the only solutions meeting these requirements are p = 3 with n = 5 and p = 5 with n = 7. In order to analyze the above equation, it is necessary to look at the properties of primes and how they relate to powers of two. These results advance our knowledge of prime numbers and how they behave in certain mathematical problems.

This research investigates the application of deep learning in sentiment analysis of Canadian maritime case law. It offers a framework for improving maritime law and legal analytics policy-making procedures. The automation of legal document extraction takes center stage, underscoring the vital role sentiment analysis plays at the document level. Therefore, this study introduces a novel strategy for sentiment analysis in Canadian maritime case law, combining sentiment case law approaches with state-of-the-art deep learning techniques. The overarching goal is to systematically unearth hidden biases within case law and investigate their impact on legal outcomes. Employing Convolutional Neural Network (CNN) and Long Short-Term Memory (LSTM) based models, this research achieves a remarkable accuracy of 98.05% for categorizing instances. In contrast, Conventional Machine Learning techniques such as Support Vector Machines (SVM) yield an accuracy rate of 52.57%, Naive Bayes at 57.44 %, and Logistic Regression at 61.86%. The superior accuracy of the CNN and STM model combination underscores its usefulness in legal sentiment analysis, offering promising future applications in diverse fields like legal analytics and policy design. These findings mark a significant choice for AI-powered legal tools, presenting more sophisticated and sentiment-aware options for the legal profession.

Image stitching is a crucial aspect of image processing. However, factors like perspective and environment often lead to irregular shapes in stitched images. Cropping or completion methods typically result in substantial loss of information. This paper proposes a method for rectifying irregularly images into rectangles using deformable meshes and residual networks. The method utilizes a convolutional neural network to quantify rigid structures of images. Choosing the most suitable mesh structure based on the extraction results, offering options such as triangular, rectangular, and hexagonal. Subsequently, the irregularly image, predefined mesh structure, and predicted mesh structure are input into a wide residual neural network for regression. The loss function comprises local and global, aimed at minimizing the loss of image information within the mesh and global target. This method not only significantly reduces information loss during rectification but also adapting to different images with various rigid structures. Validation on the DIR-D dataset shows this method outperforms state-of-the-art methods in image rectification.

When dealing with limited sample sizes or missing values in time series data, achieving high accuracy in forecasting becomes challenging. This challenge is particularly common in wind energy forecasting, where many wind farms lack complete data. In this paper, we employ the widely-used ARIMA (Autoregressive Integrated Moving Average) model for time series forecasting. To address the difficulties posed by limited sample sizes and missing values, we adopt a unique approach by utilizing multiple ARIMA models for different datasets. A key distinction from other multiple models methods for time series forecasting lies in each model within our approach using its own dataset, making the fusion process more intricate. To overcome this, we incorporate neural networks and two techniques for model fusion: direct fusion with a learning mechanism and compensation for missing data through training. For each ARIMA model, we introduce a noise estimation method to circumvent the white noise assumptions inherent in ARIMA models. Finally, we apply these methods to wind energy prediction, and our experimental results showcase a significant enhancement in forecasting accuracy.

Chinese texts often feature a substantial volume of normative content, and their analysis has increasingly become a focal point in recent semantic analysis endeavors. Enhancing the effectiveness of text classification and clustering is pivotal in unveiling the intricate semantics within extensive textual data. Empirical research within the realm of computational social science has underscored the need for improved explanatory power when it comes to general text clustering methods applied to normative texts. This study introduces an innovative hierarchical clustering method that incorporates part-of-speech (POS) features and pioneers a novel semantic network model. It achieves this by amalgamating a POS-based feature weight calculation method with hierarchical clustering techniques. To assess its efficacy, the method is rigorously evaluated across three diverse text datasets, encompassing normative reports, news articles, and social media content. The experimental results unequivocally demonstrate the superior performance of the POS-HC method, surpassing the traditional TF and TF-IDF feature extraction methods in terms of clustering accuracy, and surpassing some existing clustering methods. Furthermore, its classification effectiveness exhibits notable advantages, particularly in the semantic classification of normative texts.

The use of new assistive technologies in general, and Socially Assistive Robots (SAR) in particular is becoming increasingly common for supporting people’s health and well-being. However, it still faces many issues regarding long-term adherence, acceptability and utility. Most of these issues are due to design processes that insufficiently take into account the needs, preferences and values of intended users. Other issues are related to the currently very limited amount of long-term evaluations, performed in real world settings, for SAR. This study presents the results of two regional projects that consider as a starting hypothesis that the assessment in controlled environments and/or with short exposures may not be enough in the design of a SAR deployed in a retirement home and the necessity of designing for and with users. Thus, the proposed methodology has focused in use cases definitions that follow a human-centred and participatory design approach. The main goals have been facilitating system acceptance and attachment by involving stakeholders in the robots design and evaluation, overcoming usage barriers and considering user’s needs integration. The implementation of the first use case deployed and the two-phase pilot test performed in the retirement home are presented. In particular, a detailed description of the interface re-design process based on improving a basic prototype with users’ feedback and recommendations is presented together with main results of a formal evaluation that has highlighted the impact of changes and improvements addressed in the first redesign loop of the system.

Heavy rains have created significant threats to human health and life. Floods and other natural disasters, which have a global impact annually, can be attributed to extended durations of intense precipitation. Accurate rainfall predictions are crucial in nations such as Bangladesh, where agriculture is the predominant occupation. The efficiency of machine learning (ML) methods is enhanced by the non-linearity of rainfall, surpassing the effectiveness of other alternative ways. Machine learning techniques show that individual classifiers exhibit worse accuracy than ensemble learning (EL) methodologies. Ensemble Learning techniques are utilized for rainfall prediction and estimating rainfall quantity and daily average temperature to enhance comprehension of the diverse Machine Learning algorithms. This research implements the machine learning techniques and ensemble-based classifier to predict the rainfall occurrence, along with the machine learning regressor models and ensemble-based regressor for the rainfall amount prediction and daily average temperature prediction, using Bangladesh Weather Dataset. The results of the machine learning and ensemble-based models are compared using the Accuracy and F1 score for rainfall occurrence prediction. In contrast, MAE and RMSE evaluation metrics are used for ensemble regressor and regression algorithms for the rainfall amount and daily average temperature prediction. With an accuracy of 83.41% and a recall of 78.17%, the Ensemble Classifier is the best at predicting when it will rain, but its precision of 51.16% stands in for the lowest. The Ensemble Regression model outperforms Linear Regression, Random Forest, and SVR in rainfall amount prediction, with the lowest MAE of 0.36 and RMSE of 0.90. The Ensemble Regression provides the most precise results for daily average temperature prediction with the lowest MAE 0.42 and RMSE 0.54 highlighting its superiority over the other regression models in forecasting temperature with less error. Ensemble approaches consistently lead task performance metrics.

In the dynamic field of mental health care, the nuanced application of Artificial Intelligence (AI) through Natural Language Processing (NLP) and Automatic Speech Recognition (ASR) is a pivotal innovation in patient empowerment and service optimization. This study introduces a distinctive online therapy platform that capitalizes on the synergy of NLP and ASR to offer unprecedented levels of interactive and personalized therapeutic interventions. The architecture of our system is meticulously detailed, featuring an ASR component with an impressive Word Error Rate (WER) of 14% when trained on the diverse French subsets of the Mozilla Common Voice dataset, complemented by a high-precision NLP framework skilled in processing and responding to user inputs. The evaluation of our system highlights its efficacy in enhancing therapy sessions and user satisfaction, with an emphasis on the qualitative aspects of user feedback. The paper addresses challenges such as dataset representativeness and language model refinement and articulates the strategic solutions employed to overcome them. The paper concludes with forward-looking perspectives on AI's role in mental health services, advocating for the creation of sophisticated, language-specific datasets and models to satisfy the increasing demands of online therapy, reflecting a growing commitment of patients in the management of their therapy. This research underscores the transformative impact of AI in advancing mental health care into the digital age, representing a significant evolution over existing methodologies.

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

To secure computers and information systems from attackers taking advantage of vulnerabilities in the system to commit cybercrime, several methods have been proposed for real-time detection of vulnerabilities to improve security around information systems. Of all the proposed methods, machine learning had been the most effective method in securing a system with capabilities ranging from early detection of software vulnerabilities to real-time detection of ongoing compromise in a system. As there are different types of cyberattacks, each of the existing state-of-the-art machine learning models depends on different algorithms for training which also impact their suitability for detection of a particular type of cyberattack. In this research, we analyzed each of the current state-of-theart machine learning models for different types of cyberattack detection from the past 10 years with a major emphasis on the most recent works for comparative study to identify the knowledge gap where work is still needed to be done with regard to detection of each category of cyberattack

The ever-evolving ways attacker continues to im prove their phishing techniques to bypass existing state-of-the-art phishing detection methods pose a mountain of challenges to researchers in both industry and academia research due to the inability of current approaches to detect complex phishing attack. Thus, current anti-phishing methods remain vulnerable to complex phishing because of the increasingly sophistication tactics adopted by attacker coupled with the rate at which new tactics are being developed to evade detection. In this research, we proposed an adaptable framework that combines Deep learning and Randon Forest to read images, synthesize speech from deep-fake videos, and natural language processing at various predictions layered to significantly increase the performance of machine learning models for phishing attack detection.

In the era of Artificial Intelligence (AI), comprehending and responding to non-verbal communication is increasingly vital. This research extends AI's reach in bridging communication gaps, notably benefiting American Sign Language (ASL) and Taiwan Sign Language (TSL) communities. It focuses on employing various AI models, especially the Hierarchical Vision Transformer with Shifted Windows (Swin), for recognizing diverse sign language datasets. The study assesses Swin architecture's adaptability to different sign languages, aiming to create a universal platform for Unvoiced communities. Utilizing deep learning and transformer technologies, hybrid application prototypes have been developed for ASL-to-English translations and vice versa, with plans to expand this to multiple sign languages. The Swin models, trained on varied dataset sizes, show considerable accuracy, indicating their flexibility and effectiveness. This research underscores major advancements in sign language recognition and underlines a commitment to inclusive communication in the digital era. Future work will focus on enhancing these models and broadening their scope to include more sign languages, integrating multimodality and Large Language Models (LLMs), thereby fostering global inclusivity.

A model of a single-server queuing-inventory system (QIS) with catastrophes and a finite waiting room for consumer customers (c-customers) has been developed. When a catastrophe occurs, all inventory in the system's warehouse is destroyed, but c-customers in the system are still waiting for restocking. In addition to c-customers, negative customers (n-customers) are also taken into account, which displaces one c-customers (if any). The policy (?, ?) is used to replenish stocks. If upon arrival of the c-customer the inventory level is zero, then according to Bernoulli’s scheme this c-customer is either lost or joining the queue. The mathematical model of the studied QIS is constructed in the form of a two-dimensional continuous-time Markov chain (2D CTMC). Exact and approximate methods for calculating the steady-state probabilities of constructed 2D CTMCs are developed and closed-form expressions are derived for calculating the performance measures. The results of numerical experiments are presented, demonstrating the high accuracy of the developed approximate formulas, as well as the behavior of performance indicators depending on the reorder point. In addition, an optimization problem is solved to obtain the optimal reorder point to minimize the expected total cost.

Considering that cryptocurrencies are now present in practically every financial transaction because they are widely accepted as an alternate means of making payments and exchanging currencies, academics and economists have more opportunities to study cryptocurrency prices. Over the years, investors, traders and investment banks have found it difficult to predict the closing daily price of Ethereum due to its rapid price fluctuation. The daily closing price of cryptocurrency is essential to consider when trading or investing in Ethereum. This report focuses on carrying out a comparative study of the predictive capabilities of deep machine learning algorithms with a stacking ensemble modelling framework using daily historical observations of the price of Ethereum obtained from Coindesk, tweets extracted from Twitter ranging from the 1st of August 2022 to the 8th of August 2022 and other five covariates (closing price lag1, closing price lag2, noltrend, daytype and month) engineered from the closing price of Ethereum. Seven models are used to compute the forecasts for the daily closing price of Ethereum; these are the recurrent neural network, ensemble stacked recurrent neural network, gradient boosting machine, generalized linear model, distributed random forest, deep neural networks and stacked ensemble for gradient boosting machine, generalized linear model, distributed random forest and deep neural networks. The main evaluation metric used is the mean absolute error. According to MAE, RNN forecasts outperform the other model’s forecasts in this study, producing an MAE of 0.0309.

This paper analyses the application of deep learning techniques for predicting wave overtopping events in port environments using sea state and weather forecasts as inputs. The study was conducted in the outer port of Punta Langosteira, A Coruña, Spain. A video recording infrastructure was installed to monitor overtopping events from 2015 to 2022, identifying 3709 overtopping events. The data collected was merged with actual and predicted data for the sea state and weather conditions during the overtopping events, creating three datasets. We used these datasets to create several machine learning models to predict whether an overtopping event would occur based on sea state and weather conditions. The final models achieved a high accuracy level during the training and testing stages: 0.81, 0.73, and 0.84 average accuracy during training and 0.67, 0.48, and 0.86 average accuracy during testing, respectively. The results of this study have significant implications for port safety and efficiency, as wave overtopping events can cause disruptions and potential damage. Using deep learning techniques for overtopping prediction can help port managers take preventative measures and optimize operations, ultimately improving safety and helping to minimize the economic impact that overtopping events have on the port's activities.

This article presents a critical review of the current and future state of “business architecture” within the enterprise architecture frameworks. The review is conducted in the following four stages. In the first stage of analysis, the research and publication questions are established. In the second stage, the search for information is designed and implemented using the Prisma methodology, and once the selection criteria were applied, 75 article-type documents were selected from Scopus, WoS, and Dimensions databases. In the third stage, the information analysis is conducted, and then it is synthesized. Finally, in fourth stage, the discussion is elaborated. This research contributes in understanding the current and future trends of business architecture in Industry 4.0. Considering the challenges of the changing market, the results show the need to implement architectures and dynamic business models, including their artifacts, in a globalized context immersed in new technologies.

Let R be a commutative ring and m, n be positive integers. We define a proper submodule N of an R-module M to be (m,n)-closed if for r∈R and b∈M, r^{m}b∈N implies rⁿ∈(N:_{R}M) or b∈N. This class of submodules lies properly between the classes of prime and primary submodules. Many characterizations, properties and supporting examples concerning this class of submodules are provided. The notion of (m,n)-modules is introduced and characterized. Furhermore, the (m,n)-closed avoidance theorem is proved. Finally, the (m,n)-closed submodules in amalgamated modules are studied.

Among others, UWB-based multi anchor localization systems have been established for industrial indoor localization systems. However, multi anchor systems have high costs and installation effort. By exploiting the multipath propagation of the UWB signal, the infrastructure and thus the costs of conventional systems can be reduced. Our UWB Single Anchor Localization System (SALOS) successfully pursues this approach. The idea behind SALOS is to create a localization system with a sophisticated signal modeling. Therefore, neither measured reference like fingerprinting nor training is required for position estimation. Although SALOS has been implemented and tested successfully already in an outdoor scenario with multipath propagation, it has not yet been evaluated in indoor environment with challenging and hardly predictable multipath propagation. For this purpose, we have developed new algorithms for the existing hardware mainly a three-dimensional statistical multipath propagation model for arbitrary spatial geometries. The signal propagation between the anchor and predefined candidate points for the tag position is modeled in path length and complex-valued receive amplitudes. For position estimation, these modeled signals are combined to multiple sets and compared to UWB measurements via a similarity metric. In the end, a majority decision of multiple position estimates is performed. For evaluation, we implement SALOS in a modular fashion and install the system in a building. For a fixed grid of 20 positions, SALOS is evaluated in terms of position accuracy. The system results in correct position estimations for more than 73% of the measurements.

The main purpose of this article is to consider the smoothness control of a weak solution after some moment if there is known solution regularity until this moment. The necessary tools can be varied. It is possible to control kinetic energy dissipation to fix moment or changing of velocity square or summability of acceleration square to fix at point time.

Artistic image completion is fundamental for the preservation and restoration of invaluable art paintings and it has experienced significant progress through the implementation of deep learning methodologies. Despite these advancements, challenges persist, even with sophisticated approaches like Generative Adversarial Networks (GANs), particularly in achieving optimal results for high-resolution paintings. Small-scale texture synthesis and the inference of missing information from distant contexts present persistent issues, leading to distortions in lines and unnatural colors, especially in art paintings with complicated structures and textures. Concurrently, patch-based image synthesis has evolved by incorporating global optimization on the image pyramid to enhance structural coherence and details. However, methods relying on gradient-based synthesis encounter obstacles related to directionality, inconsistency, and the heavy computational burdens associated with solving the Poisson equation in non-integrable gradient fields. This paper introduces a groundbreaking approach, integrating Weighted Similarity-Confidence Laplacian Synthesis, to comprehensively address these challenges and advance the field of artistic image completion. This proposal addresses challenges not only in high-resolution artistic image completion but also makes a significant contribution to the broader field of patch-based synthesis by utilizing the Laplacian pyramid for enhanced edge-aware correspondence search. Experimental result confirms the effectiveness of our approach, offering promising outcomes for the preservation and restoration of art paintings with complicated details and irregular missing regions.

This paper addresses the critical issue of trust in Artificial Intelligence systems, especially when users might find it challenging to comprehend the internal decision-making processes of such systems. A relevant topic of research in this respect is Theory of Mind, which involves attempting to understand these systems as if they possessed beliefs, desires, and intentions. We focus on the latter: intentions, and we examine how producing explanations based on them can improve \emph{understandability} while allowing for a better interpretation of how they align with human values. We also review some existing methods for identifying intentions in AI systems and we conclude with a discussion on possible future directions in this line of research.

Epilepsy is a common neurological condition, typically diagnosed using Electroencephalogram (EEG). Large scale EEG datasets have recently been made publicly available, allowing the use of advanced Machine Learning (ML) algorithms to analyze EEG patterns associated with epilepsy. While most existing studies focus on identifying seizures in the EEG, few have tried to identify preictal EEG segments. Identifying preictal EEG segments are not only useful in developing early warning systems but also helps inform the course of treatment for the patient. In this study, we propose to represent EEG segments as images, instead of time-series data, and identify preictal EEG segments using a preexisting ML algorithm (YOLOv8) designed for image processing. Multiplexed images (containing the original EEG signal represented on a 2D grid, kurtosis, and spectral entropy) achieve the best accuracy of 95.75% on the dataset while images just containing the EEG signal result in an accuracy of 91.25%. Using only spectrograms, generated from the original EEG signal, results in an accuracy of 90.15%.

The predominance of English and Latin-based large language models (LLMs) has led to a notable deficit in native Arabic LLMs. This discrepancy is accentuated by the prevalent inclusion of English tokens in existing Arabic models, detracting from their efficacy in processing native Arabic's intricate morphology and syntax. Consequently, there is a theoretical and practical imperative for developing LLMs predominantly focused on Arabic linguistic elements. To address this gap, this paper proposes ArabianGPT, a series of transformer-based models within the ArabianLLM suite designed explicitly for Arabic. These models, including ArabianGPT-0.1B and ArabianGPT-0.3B, vary in size and complexity, aligning with the nuanced linguistic characteristics of Arabic. The AraNizer tokenizer, integral to these models, addresses the unique morphological aspects of Arabic script, ensuring more accurate text processing. Empirical results from fine-tuning the models on tasks like sentiment analysis and summarization demonstrate significant improvements. For sentiment analysis, the fine-tuned ArabianGPT-0.1B model achieved a remarkable accuracy of 95%, a substantial increase from the base model's 56%. Similarly, in summarization tasks, fine-tuned models showed enhanced F1 scores, indicating improved precision and recall in generating concise summaries. Comparative analysis of fine-tuned ArabianGPT models against their base versions across various benchmarks reveals nuanced differences in performance, with fine-tuning positively impacting specific tasks like question answering and summarization. These findings underscore the efficacy of fine-tuning in aligning ArabianGPT models more closely with specific NLP tasks, highlighting the potential of tailored transformer architectures in advancing Arabic NLP.

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

As data driven models gain importance in driving decisions and processes, recently it becomes increasingly important to visualize the data with both speed and accuracy. A massive amount of data is presently generated in the educational sphere from various learning platforms, tools, and institutions. Visual analytics of educational big data has capability to improve student learning, develop strategies for personalized learning, and improve faculty productivity. How-ever, there are limited advancements in the education domain for data-driven decision making leveraging the recent advancements in the field of machine learning. Some of the recent tools such as Tableau, Power BI, Microsoft Azure suite, Sisense etc. leverage artificial intelligence and machine learning techniques to visualize data and generate insights out of it, however their ap-plicability in educational advances is limited. This paper focuses on leveraging machine learn-ing and visualization techniques to demonstrate their utility through a practical implementation using k-12 state assessment data compiled from the institutional websites of the State of Texas and Louisiana. Effective modeling and predictive analytics are the focus of the sample use case presented in this research. Our approach demonstrates the applicability of web technology in conjunction with machine learning to provide a cost-effective and timely solution to visualize and analyze big educational data. Additionally, ad-hoc visualization provides contextual anal-ysis within areas of concern for Education Agencies (EA).

We prove an analog of the removable singularity theorem for bounded harmonic functions on stratified sets. The harmonic functions are understood in the sense of the soft Laplacian. The result can become one of the main technical components for extending the well-known Poincaré–Perron’s method of proving the solvability of the Dirichlet problem for the soft Laplacian.

We consider a constrained optimal control problem and an extension of it, in which the set of strict-sense trajectories is enlarged. Extension is a common procedure in optimal control, used to derive necessary and sufficient optimality conditions for the original problem from the extended one, which usually admits a minimizer and has a more regular structure. However, this procedure fails if the two problems have different infima. It is therefore relevant to identify such situations. Following on from earlier work by Warga but adopting perturbation techniques developed in non-smooth analysis, we investigate the relation between the occurrence of an infimum gap and abnormality of necessary conditions. For a notion of local minimizer based on control distance and an extension including the impulsive one, we prove that (i) a local extended minimizer which is not a local minimizer of the original problem and (ii) a local strict-sense minimizer which is not a local minimizer of the extended problem, both satisfy the extended maximum principle in abnormal form. The main novelty is result (ii), as until now it had only been shown that a strict-sense minimizer which is not an extended minimizer is abnormal for an `averaged version’ of the maximum principle.

Multimodal remote sensing data classification can enhance the model’s ability to distinguish land features through multimodal data fusion. In this context, how to help models understand the relationship between multimodal data and target tasks is the focus of researchers. Inspired by human feedback learning mechanisms, causal reasoning mechanisms, and knowledge induction mechanisms, this paper integrates causal learning, reinforcement learning, and meta learning into a unified remote sensing data classification framework and proposed the causal meta-reinforcement learning (CMRL). First, based on feedback learning mechanisms, we have overcome the limitations of traditional implicit optimization of fusion features and customized a reinforcement learning environment for multimodal remote sensing data classification tasks. Through feedback interactive learning between agents and the environment, we help them understand the complex relationships between multimodal data and labels, thereby achieving full mining of multimodal complementary information. Second, based on the causal inference mechanism we designed causal distribution prediction action, classification reward, and causal intervention reward, capturing pure causal factors in multimodal data and cutting off false statistical associations between non-causal factors and class labels. Finally, based on the knowledge induction mechanism, we designed a bi-layer optimization mechanism based on meta-learning. By constructing a meta training task and meta validation task simulation model in the generalization scenario of unseen data, we helped the model induce cross-task shared knowledge, thereby improving its generalization ability for unseen multimodal data. The experimental results on multiple sets of multimodal datasets show that the proposed method achieved state-of-the-art performance in multimodal remote sensing data classification tasks.

A human eye has about 120 million rod cells and 6 million cone cells. This huge number of light sensing cells inside a human eye will continuously produce a huge quantity of visual signals which flow into a human brain for daily processing. However, the real-time processing of these visual signals does not cause any fatigue to a human brain. This fact tells us the truth which is to say that human-like vision processes do not rely on complicated formulas to compute depth, displacement, and colors, etc. On the other hand, a human eye is like a PTZ camera. Here, PTZ stands for pan, tilt and zoom. We all know that in computer vision, each set of PTZ parameters (i.e., coefficients of pan, tilt and zoom) requires a dedicated calibration to determine a camera’s projection matrix. Since there is an infinite number of PTZ parameters which could be produced by a human eye, it is unlikely that a human brain stores an infinite number of calibration matrices for each human eye. Therefore, it is an interesting question for us to answer, which is to say whether simpler formulas of computing depth and displacement exist or not. Moreover, these formulas must be calibration friendly (i.e., easy process on the fly or on the go). In this paper, we disclose an important discovery of a new solution to 3D projection in a human-like binocular vision system. The purpose of doing 3D projection in binocular vision is to undertake forward and inverse transformations (or mappings) between coordinates in 2D digital images and coordinates in a 3D analogue scene. The formulas underlying the new solution are accurate, easily computable, easily tunable (i.e., to be calibrated on the fly or on the go) and could be easily implemented by a neural system (i.e., a network of neurons). Experimental results have validated the discovered formulas.

The rapid advancements and the merging of hybrid quantum-classical computing, artificial intelligence (AI), machine learning (ML), and deep learning (DL) pose a potentially unseen and significant threat to encryption that may impact Post-Quantum Cryptography (PQC) transition timelines. There is a direct hybrid quantum-classical computing threat on cryptography, and there is also a direct threat AI/ML on cryptography. However, the synergistic combination of these technologies presents known and unknown threats that need attention, focus action, and research. This paper reviews Grover's Adaptive Search (GAS), which combines Grover's Algorithm with adaptive techniques to optimize search further, potentially making it even more efficient for attacking encryption. This work also examines the quantum-accelerated Harrow-Hassidim-Lloyd (HHL) Algorithm, designed to solve systems of linear equations exponentially faster than classical algorithms in certain conditions. The HHL algorithm can solve some lattice-based problems, which have implications for lattice-based encryption. This technological confluence and its potential impact on cryptography and encryption necessitate a proactive and coordinated approach to developing and implementing quantum-resistant AI/ML cryptographic solutions. This paper reviews the technological confluence and its potential implications for classical cryptography and PQC transition timelines and calls for further research.

This paper presents an analysis of the number of zeros in the binary representation of natural numbers. The primary method of analysis involves the use of the concept of the fractional part of a number, which naturally emerges in the determination of binary representation. This idea is grounded in the fundamental property of the Riemann zeta function, constructed using the fractional part of a number. Understanding that the ratio between the fractional and integer parts of a number, analogous to the Riemann zeta function, reflects the profound laws of numbers becomes the key insight of this work. The findings suggest a new perspective on the interrelation between elementary properties of numbers and more complex mathematical concepts, potentially opening new directions in number theory and analysis.

This study focuses on the optimal deployment problem, and determines the optimal size of a military force to send to the battle field. The decision is optimized, based on an objective function, that considers the cost of deployment, the cost of the time it takes to win the battle, and the costs of killed and wounded soldiers with equipment. The cost of deployment is modeled as an explicit function of the number of deployed troops and the value of a victory with access to a free territory, is modeled as a function of the length of the time it takes to win the battle. The cost of lost troops and equipment, is a function of the size of the reduction of these lives and resources. An objective function, based on these values and costs, is optimized, under different parameter assumptions. The battle dynamics is modeled via the Lanchester differential equation system based on the principles of directed fire. First, the deterministic problem is solved analytically, via derivations and comparative statics analysis. General mathematical results are reported, including the directions of changes of the optimal deployment decisions, under the influence of alternative types of parameter changes. Then, the first order optimum condition from the analytical model, in combination with numerically specified parameter values, is used to determine optimal values of the levels of deployment in different situations. A concrete numerical case, based on documented facts from the Battle of Iwo Jima, during WW II, is analyzed, and the optimal US deployment decisions are determined under different assumptions. The known attrition coefficients of both armies, from USA and Japan, and the initial size of the Japanese force, are parameters. The analysis is also based on some parameters without empirical documentation, that are necessary to include to make optimization possible. These parameter values are motivated in the text. The optimal solutions are found via Newton- Raphson iteration. Finally, a stochastic version of the optimal deployment problem is defined. The attrition parameters are considered as stochastic, before the deployment decisions have been made. The attrition parameters of the two armies have the same expected values as in the deterministic analysis, are independent of each other, have correlation zero, and have relative standard deviations of 20%. All possible deployment decisions, with 5000 units intervals, from 0 to 150000 troops, are investigated, and the optimal decisions are selected. The analytical, and the two numerical, methods, all show that the optimal deployment level is a decreasing function of the marginal deployment cost, an increasing function of the marginal cost of the time to win the battle, an increasing function of the marginal cost of killed and wounded soldiers and lost equipment, an increasing function of the initial size of the opposing army, an increasing function of the efficiency of the soldiers in the opposing army and a decreasing function of the efficiency of the soldiers in the deployed army. With stochastic attrition parameters, the stochastic model also shows that the probability to win the battle is an increasing function of the size of the deployed army. When the optimal deployment level is selected, the probability of a victory is usually less than 100%, since it would be too expensive to guarantee a victory with 100% probability. Some of many results of relevance to the Battle of Iwo Jima, are the following: In the deterministic Case 0 analysis, the optimal US deployment level is 66200, the time to win the battle is 30 days and 14000 US soldiers are killed or wounded. If the marginal cost of the time it takes to win a victory doubles, the optimal deployment increases to 75400, the time to win a victory is reduced to 26 days, and less than 12000 soldiers are killed or wounded. In the stochastic Case 0 analysis, the optimal US deployment level is 65000, the expected time to win the battle is 46 days and almost 25000 US soldiers are expected to be killed or wounded. If the cost per killed or wounded soldier increases from 0 to 5 M $US, the optimal deployment level increases to 75000. Then, the victory is expected to appear after 35 days and 19900 US soldiers are expected to be killed or wounded.

This article develops duality principles and numerical results for a large class of non-convex variational models. The main results are based on fundamental tools of convex analysis, duality theory and calculus of variations. More specifically the approach is established for a class of non-convex functionals similar as those found in some models in phase transition. Finally, in some sections we present concerning numerical examples and the respective softwares.

The use of credit cards and online banking is expanding exponentially. As more individuals use debit cards, credit cards, and internet banking, the likelihood of falling victim to various forms of fraud also rises. Due to ignorance, credit card company customers have provided their card details, personal information, and one-time password to an unknown bogus caller on several occasions in the recent past. One of the biggest issues facing financial institutions and customers alike is credit card theft. It may result in large financial losses and harm to the financial institution's image. While there are several ways to identify credit card fraud, one of the best is machine learning.By using past data, machine learning algorithms may be trained to recognize trends and abnormalities that point to fraud. The state-of-the-art in machine learning for credit card fraud detection is reviewed in this study. Numerous research on the same subject have been conducted in the past with a variety of well-known machine-learning techniques. However, with a grasp of the notion of hybrid machine learning, we will now examine how well hybrid machine learning performs on the same problem statement.

Tourism is increasingly becoming one of the most important components of the economy. Coastal tourism is of particular importance in our country, this is because Albania has a very favorable geographical position. The tourist destination chosen for study in this paper is Durrës. It is analyzed as a complex dynamic system that evolves with a series of techniques and methods drawn from the area of network theory. The main objective of this paper is the comparison of technological and socio-economic networks, through different methods and techniques. The methodology of this research includes different data collection methods for both networks and their analysis. 504 nodes were taken into consideration. A significant part of the research is based on network theory, using algorithms and network analysis techniques to reveal their static and dynamic characteristics. Through this paper we show that the internet network and the socio-economic network of Durrës are similar in some aspects and have a great impact on the development of the tourist destination. The analysis of these two networks provides a deeper picture of the relations between the actors of the destination and helps to improve the tourism strategies and the economic development of the area. Thus, the research is an attempt to better understand the impact of technological and socio-economic networks in the development of the tourist destination of Durrës and uses different ways of network analysis to discover the similarities and differences between them.

The Distributed eLearning Center (DeLC) is a portal, providing extensive support in the day-to-day work when it comes to e-learning content – it helps students and teachers organize their learning materials, fill the gaps in knowledge (for students) and educational approaches (for teachers), organize and conduct exams, and overall, with providing proactive and personalized e-learning environment. The scope of DeLC as a project involves many extensions, covering the aspects of learning, teaching, exams, and collecting statistical information. Such extension is an agent-oriented environment, which enriches the functionalities with intelligent components, that are reactive and proactive, referred to as agents or assistants. This paper is focused on presenting the latest step in the evolution of FraudDetector software agent, which started with base functionality for fraud detection, and now it aims at usage of AI to accomplish its tasks, taking advantage not only from its knowledgebase, but from a much larger one, used by ChatGPT – through integration with it, which is the main contribution of this research, although the real results from production environment are still pending. In this process, agent’s architecture should stay open for collaboration with another external AI provider if necessary, trying to decouple the components, responsible for integration. As of now, the experiments show that involving ChatGPT in FraudDetector’s functionality enriches it and the agent’s precision could be improved this way.

This work uses a new approach to investigate the Riemann hypothesis, drawing conclusions about its trueness. It is based on the more general method presented in a very recent publication, by the same author, showing in detail how to approach that very well-known and interesting problem. This is achieved by means of the theory of dynamical systems (Poincaré index associated to equilibria of 2-dimensional systems) and the study of the zeros of the Dirichlet eta function, defined by a Dirichlet series. By using the well-known fact that the zeros of the eta function include all zeros of the Riemann zeta function in the (open) critical strip, excluded the critical line, ((0,1/2) ∪ (1/2,1)) × (−∞,∞), the development proceeds using only the eta function. In addition, the open and simply connected region (1/2,1) × (0,∞) is used along the text, taking into account the symmetries of zeros of the functions under analysis in the critical strip. The basic line of proof is to find the mathematical expression for the Poincaré index of the vector field associated to the eta function, assuming the existence of a zero of the eta function outside the critical line (in (1/2,1) × (0,∞)), and investigating the resulting unfoldings. Eventually, an inconsistency occurs and the proof ends by contradiction.

Radial basis function (RBF) networks are often viewed as instable when used in multi-layered architectures and therefore are mostly used in a single-layered manner. Universal approximation theorems for single-layered RBF networks further render deeper architectures useless. However, deep neural networks have proven their effectiveness on many different tasks. We show that deeper RBF architectures with multiple radial basis function layers are achievable and able to learn. We introduce an initialization scheme for deep RBF networks based on k-means clustering and covariance estimation. We further show how to make use of convolutions to speed up the calculation of a Mahalanobis distance in a partially-connected fashion, similar to convolutional neural networks (CNNs). Finally, we evaluate our approach on image classification as well as speech emotion recognition tasks. Our results show that deep RBF networks perform similar to simple CNNs.

Human action recognition (HAR) based on skeleton data is a challenging yet important technique because of its wide range of applications in many fields, including patient monitoring, security surveillance, and observing human-machine interactions. Many algorithms that attempt to distinguish between many types of activities have been proposed. However, most practical applications require highly accurate detection of specific types of activities. In this study, a novel and highly accurate spatiotemporal graph autoencoder network for HAR based on skeleton data is proposed. Furthermore, an extensive study was conducted using different modalities. For this purpose, a spatiotemporal graph autoencoder that automatically learns spatial as well as temporal patterns from human skeleton datasets was built. The powerful graph convolutional network named GA-GCN, developed in this study, notably outperforms most of the existing state-of-the-art methods based on two common datasets, namely NTU RGB+D and NTU RGB+D 120 . On the first dataset, we achieved an accuracy of 92.3% and 96.7% based on the cross-subject and cross-view evaluations, respectively. On the other more challenging dataset (i.e. NTU RGB+D 120), GA-GCN achieved 88.8% and 90.4% based on the cross-subject and cross-set evaluation, respectively.

Matrices and their inverses allow accurate calculations to be produced quickly and compactly and can be used to control any process represented by a system of equations. Singular matrices require extensive workarounds (costing time and money) to solve these systems of equations because they have no inverse. Finding their inverse involves division by zero. Nevertheless, recently a new number set called semi-structured complex numbers was developed to enable division by zero in algebraic equations. The aim of this research was to demonstrate that the inverse of a singular matrix can be found using semi-structured complex numbers. This research reveals (1) Singular matrices and their inverses can be used to find a unique solution to a pair of simultaneous equations that appear to have infinitely many solutions or appear to have no solution; (2) Singular matrices map coordinates in projective space to coordinates in Euclidean space and their inverse maps coordinates in Euclidean space to coordinates in projective space; (3) the inverse of a singular matrix proves that parallel lines in Euclidean space do not intersect but in projective space intersect at a “point at infinity” and (4) collinear lines that intersect at infinitely many points in Euclidean space only intersect at one point in projective space.

Deep learning (DL) algorithms used for DOTATATE PET lesion detection typically require large, well-annotated training datasets. These are difficult to obtain due to low incidence of gastroenteopancreatic neuroendocrine tumors (GEP-NETs), and the high cost of manual annotation. Furthermore, networks trained and tested with data acquired from site specific PET/CT instrumentation, acquisition and processing protocols have reduced performance when tested with offsite data. This lack of generalizability requires even larger, more diverse training datasets. The objective of this study is to investigate the feasibility of improving DL algorithm performance by better matching the background noise in training datasets to higher noise, out-of-domain testing datasets. 68Ga-DOTATATE PET/CT datasets were obtained from two scanners: Scanner1, a state-of-the-art digital PET/CT (GE DMI PET/CT; n=83 subjects), and Scanner2, an older-generation analog PET/CT (GE STE; n=123 subjects). Set1, the data set from Scanner1 was reconstructed with standard clinical parameters (5 minutes; Q.Clear) and list-mode reconstructions (VPFXS 2, 3, 4, and 5-minutes). Set2, data from Scanner2, representing out-of-domain clinical scans, used standard iterative reconstruction (5 minutes; OSEM). Reconstructed datasets were divided into training, validation, and testing datasets in a 60%, 20%, 20% proportion, and a deep neural network was trained with each: Network1 for Scanner1 and Network2 for Scanner2. DL performance (Network1) was tested with out-of-domain test data (Set2). To evaluate the effect of training sample size, we tested DL model performance using a fraction (25%, 50%, and 75%) of Set1 for training. Scanner1, list-mode 2-minute reconstructed data demonstrated the most similar noise level compared that of Set2, resulting in the best performance (F1=0.713). This was not significantly different compared to the highest performance, upper-bound limit using in-domain training for Network2 (F1=0.755; p-value=0.103). Regarding sample size, the F1 score significantly increased from 25% training data (F1=0.478) to 100% training data (F1=0.713; p&lt;0.001). List-mode data from modern PET scanners can be reconstructed to better match the noise properties of older scanners. Using existing data and their associated annotations dramatically reduces the cost and effort in generating these datasets, and significantly improves the performance of existing DL algorithms. List-mode reconstructions can provide an efficient, low-cost method to improve DL algorithm generalizability.

Identifying influential actors within social networks is pivotal for optimizing information flow and mitigating the spread of both rumors and diseases. Several methods have emerged to pinpoint these influential entities in networks that are represented as graphs. In these graphs, nodes corre-spond to individuals and edges indicate their connections. This study focuses on centrality measures, prized for their straightforwardness and effectiveness. We categorize structural central-ity into two: local, considering a node's immediate vicinity, and global, accounting for overarching path structures. Some techniques blend both centralities to highlight nodes influential at both mi-cro and macro levels. Our paper presents a novel centrality measure, accentuating node degree and incorporating the network's broader features, especially paths of different lengths. Through Spearman and Pearson's correlations tested on seven standard datasets, our method proves its merit against traditional centrality measures. Additionally, we employ the SIR model, portraying disease spread, to further validate our approach. The ultimate influential node is gauged by its capacity to infect the most nodes during the SIR model's progression. Our results indicate a nota-ble correlative efficacy across various real-world networks relative to other centrality metrics.

In recent years the field of computer science has experienced great changes, due to the incredible advances in the field of artificial intelligence. Deep Learning models are responsible for most of them since the biggest milestones occurred in 2012 when AlexNet won the image classification challenge called ImageNet. These models have demonstrated great performances in different types of complex tasks like image restoration, medical diagnosis or object recognition. Their disadvantages are related to their high data dependency, which forces experts in the field to follow a precise methodology to obtain accurate models. In this paper, we describe a complete workflow that begins with the management of the raw data until the in-depth interpretation of the performance of the models. This should be taken as a high-level consultation document describing good practices that should be applied. Apart from the step-by-step methodology, we present different use cases that correspond to the two main problems of the field: classification and regression.

Euler sums are alternating (or level two) extension of multiple zeta values (MZVs). Kaneko and Tsumura initiated the study of multiple T-values (MTVs), another level two generalization, by restricting the summation indices in the definition of MZVs to a fixed parity pattern. In this paper, we shall study finite MTVs and their alternating versions which are level two and level four variations of finite MZVs, respectively. We conjecture that all finite MZVs are in the Q-span of finite MTVs which in turn apparently lie in the span of finite Euler sums, and the inclusions are both proper. We shall first provide some structural results for Euler sums of small weights, guided by the author's previous conjecture that the finite Euler sum space of weight w is isomorphic to a quotient Euler sum space of weight w. Then, by utilizing some well-known properties of the classical alternating MTVs, we shall derive a few important Q-linear relations among the finite alternating MTVs, including the reversal, linear shuffle and sum relations. We then compute the upper bound for the dimension of the Q-span of weight w finite (alternating) MTVs for w<9, both rigorously using the newly discovered relations and numerically aided by computers.

The hard open problem of finding the lower bound for the Fokker Planck Kolmogorov’s time-dependent controller parameter probability density function is addressed for the first time in literature in this work. This revolutionary exposition will put control theory and other related inter-disciplinary fields to a higher level towards contemporary control theory. Notably, based on the influential role of control theory in both engineering and industry, this paper will be of great value to all engineering and industry professionals who seek to know more about advanced trends within control theory settings. On the other remit of the spectrum, Fokker Planck Kolmogorov(FPK) equations are of high importance to physicists as well as mathematicians, based on their multiple applicability to multi-interdisciplinary fields of human knowledge, and beyond. So, this by default adds more taste and credibility to this study. Concluding thoughts are included at the end of the work along with a difficult outstanding problem and the direction of future work.

This paper presents an analysis of the number of zeros in the binary representation of natural numbers. The primary method of analysis involves the use of the concept of the fractional part of a number, which naturally emerges in the determination of binary representation. This idea is grounded in the fundamental property of the Riemann zeta function, constructed using the fractional part of a number. Understanding that the ratio between the fractional and integer parts of a number, analogous to the Riemann zeta function, reflects the profound laws of numbers becomes the key insight of this work. The findings suggest a new perspective on the interrelation between elementary properties of numbers and more complex mathematical concepts, potentially opening new directions in number theory and analysis.

In a densely populated country like Bangladesh, universities grapple with the challenge of efficiently addressing myriad queries from a large student body, leading to a heightened workload for university stakeholders. To tackle these challenges, we introduce PixieGPT, a tailor-made Generative Pre-Trained Transformer for Bangladeshi universities. PixieGPT significantly mitigates workload by adeptly handling common university-related queries, thereby enhancing user experience. The hierarchical structure plays a crucial role in managing diverse queries from thousands of students about the university system. The solution introduces a modular hierarchical knowledge base (KB) with simpler complexities, addressing the intricacies of efficiently managing large volumes of queries. PixieGPT is designed in a modular way so that the solution is also adaptable for the implementation of other universities worldwide based on the requirements of a particular administrative system. The modular nature facilitates easy adaptation with minor changes based on specific university requirements, ensuring a seamless integration process. This paper delves into the intricacies of PixieGPT's design, emphasizing its pivotal role in mitigating workload challenges for university stakeholders in Bangladesh. The incorporation of BERT for Natural Language Understanding(NLU) and GPT models for Natural Language Generation(NLG) enhances PixieGPT's capabilities, contributing to the scalability and efficiency of the system. The presented use case underscores the practical benefits of PixieGPT, positioning it as a promising solution for universities globally with similar operational frameworks.

This paper provides the first-time ever analytic modelling for Pointwise Stationary Fluid Flow Approximation(PSFFA) model of the non-stationary

The human-readable simplicity with which the CSV format was devised, together with the absence of a standard that strictly defines this format, has allowed the proliferation of several variants in the dialects with which these files are written. The latter has meant that the exchange of information between data management systems, or between countries and regions, requires human intervention during the data mining and cleansing process. This has led to the development of various computational tools that aim to accurately determine the dialects of CSV files, in order to avoid data loss during data loading by a given system. However, current systems have limitations and make assumptions that need to be improved and/or extended. This paper proposes a method for determining CSV file dialects through table uniformity, a statistical approach based on table consistency and records dispersion measurement along with the detection of data type over each field. The new method has a 100% accuracy over a dataset with 147 sampling CSV files from a benchmark framework. Furthermore, the proposed method is accurate enough to determine dialects by reading only ten records, requiring more data to disambiguate those cases where the first records do not contain the necessary information to conclude with a dialect determination.

This study focuses on examining various approaches for Tensor Decompositions (TDs) and their potential applications in satellite imaging (SI) and deep learning (DL). The research highlights how these decompositions can contribute to the advancement of SI and DL, providing valuable insights for future utilization of TDs in research. It explores how these techniques contribute to the advancement of SI and DL methods, providing insights into their potential applications and suggesting future research directions. The study aims to enhance the use of TDs techniques to further advance research efforts in these fields. More importantly, the current investigation offers a thorough analysis of the potential advantages and reasons for employing TDs techniques in different domains, including satellite imaging and deep learning. The aim is to enhance research outcomes by utilizing TDs. The review also identifies unresolved issues and proposes future directions for further investigation in this field. Fundamentally, these proposed open problems will open new grounds to the research community to articulate, innovate, and provide more real-life applications to improve the current state of the art by delving into a wider vision for a higher-level performance of both satellite imaging (SI) and deep learning (DL). Looking at the bigger scenario, this also suggests that TDs could be potentially employed to revolutionize existing machine learning technologies as well as the current space AI industry.

The paper primarily demonstrates that the three internal triangles formed by connecting any point on a midsegment with the vertices of a generic triangle satisfy the geometric Proof of the Pythagorean theorem in Euclidean geometry. Moreover, this study elucidates the Pythagorean relationships inherent within three-dimensional geometric constructs resulting from the arrangement of three-dimensional spatial triangles. This geometric relationship, akin to a generalized extension of the Pythagorean theorem, unveils a unique spatial region characterized by this harmonious area interrelation among triangles.

This work is the first in literature to tackle the difficult open problem of determining the upper bound and threshold theorem for the TDCDP (time-dependent controller parameter) of the (Fokker Planck Kolmogorov) probability density function. This revolutionary exposition will put control theory and other related inter-disciplinary fields to a higher level towards contemporary control theory. Notably, based on the influential role of control theory in both engineering and industry, this paper will be of great value to all engineering and industry professionals who seek to know more about advanced trends within control theory settings. On the other remit of the spectrum, Fokker Planck Kolmogorov(FPK) equations are of high importance to physicists as well as mathematicians, based on their multiple applicability to information theory, graph theory, data science, finance, economics, and beyond. So, this by default adds more taste and credibility to this study. This leads by nature to introducing a different flavor to this ground-breaking research by highlighting the impact of Fokker Planck Kolmogorov(FPK) to revolutionize crypocurrency,which have received its name because it uses encryption to verify transactions, a new debatable digital payment system that doesn't rely on banks to verify transactions. It’s a peer-to-peer system that can enable anyone anywhere to send and receive payments. The paper ends with closing remarks combined with some challenging open problems and the next phase of research.

One of the most important unresolved mysteries in mathematics is the Riemann Hypothesis, which suggests a fundamental connection between the non-trivial zeros of the Riemann zeta function and the distribution of prime numbers. Here, we explore the fascinating union of trigonometric functions, prime numbers, and the Riemann zeta function through an examination of the zeros in the statement ln(sec(π·n log(n))). We demonstrate a strong mathematical connection between these components, providing information on the mysterious properties of prime numbers and their complex relationships to basic mathematical operations. Our thorough investigation adds to the current discussion of the Riemann Hypothesis by offering possible solutions and deepening our comprehension of the intricate relationship between number theory and analytic functions.

The main purpose of this article is to identify brain diseases such as Alzheimer's and Parkinson's in an intelligent way using Python software and processing the function of neurons in the neural network areas of the brain, which are classified into different components, and the data is based on the information obtained from FMRI images using algorithms artificial intelligence can intelligently diagnose the type of disease. Therefore, by using spatial clustering based on the deep learning method with noise algorithm (DBSCAN), fMRI brain image and fMRI brain surface complexity are classified, and then image preprocessing will be applied to fMRI images by using artificial intelligence neural networks (ANN) algorithm. became. Then, by using the ANN algorithm and Deep CNN topology of the brain neural network, the type of disease in the brain can be diagnosed by simulating the performance of an artificial neural network (ANN) in Python software. Deep machine learning-based methods, especially algorithms based on neural networks, have shown great success in medical image analysis for various tasks including brain tumor detection, segmentation, and classification, and Alzheimer's and epilepsy. In this research, we propose an integrated model based on a convolutional neural network for simultaneous recognition and classification of brain diseases for intelligent diagnosis of tumors and epilepsy. The average accuracy obtained from our proposed model is 97.89 percent accuracy and 91.66 percent specificity.

Spiking neural networks (SNNs) promise to perform tasks currently done by classical artificial neural networks (ANNs) faster, in smaller footprints and using less energy. Neuromorphic processors are set out to revolutionize computing at a large scale, but the move to edge-computing applications calls for finely-tuned custom implementations to keep pushing towards more efficient systems. To that end, we have examined the architectural design space for executing spiking neuron models on FPGA platforms, focusing on achieving ultra-low area and power consumption. This work presents an efficient clock-driven spiking neuron architecture used for the implementation of both fully-connected cores and 2D convolutional cores, which rely on deep pipelines for synaptic processing and distributed memory for weight and neuron states. With them, we have developed an accelerator for an SNN version of the LeNet-5 network trained on the MNIST dataset. At around 5.5 slices/neuron and only 348 mW, it is able to use 33% less area and 4 times as less power per neuron as current state-of-the-art implementations while keeping low simulation step times.

Recent advances in artificial intelligence combined with behavioral sciences have led to the development of cutting-edge tools for recognizing human emotions based on text, video, audio, and physiological data. However, these data sources are expensive, intrusive, and regulated, unlike plants which have been shown to be sensitive to human steps and sounds. A methodology is proposed to use plants as human emotion detectors. Electrical signals from plants are tracked and labeled based on video data. Labeled data are then used for classification. MLP, biLSTM, MFCC-CNN, MFCC-ResNet, and additionally, Random Forests, 1-Dimensional CNN, and biLSTM without windowing models are set using a grid search algorithm with cross-validation. Finally, best-parameterized models are trained and used with the test set for classification. The performance of this methodology is measured with a case study with 54 participants, who were watching an emotionally charged video, as ground truth their facial emotions were simultaneously measured using face emotion analysis. The Random Forest model shows the best performance, particularly in recognizing high-arousal emotions, achieving an overall weighted accuracy of 55.2% and demonstrating high weighted recall in emotions such as fear 61.0% and happiness 60.4%. The MFCC-ResNet model offers decently balanced results, with Accuracy(MFCC-ResNet)=0.318 and Recall (MFCC-ResNet)=0.324. With the MFCC-ResNet model fear and anger are recognized with 75% and 50% recall respectively. Thus, using plants as an emotion recognition tool seems worth investigating, addressing both cost and privacy concerns.

The SK model proposed by Sherrington and Kirkpatrick is an important mean field model for spin glasses. The dependence structure of Hamiltonians of the SK model is considered in this paper. We have investigated the covariance matrix of Hamiltonians of the SK model, and establish a relationship between the rank of the corresponding covariance matrix and the dimension of the space spanned by the Hamiltonians. Finally, we also give an upper bound for the rank of the covariance matrix, which might be the best.

With the rapid development of intelligent transportation, Vehicle Ad hoc Networks (VANETs) is becoming increasingly important.As a critical component of intelligent transportation systems, the Conditional Privacy-Preserving Authentication (CPPA) scheme plays a significant role in ensuring drivers' privacy and security.However, current CPPA schemes still face limitations in terms of security and efficiency, with these schemes either imposing higher computational overhead for enhanced security or compromising some level of security to reduce overhead. Motivated by this challenge, we propose a CPPA scheme that strikes a better balance between efficiency and security.By leveraging the token mechanism to achieve multiple authentication and minimizing information leakage. Furthermore, our performance analysis demonstrates that our ECC-based algorithm can significantly reduce overhead, with pseudonymous generation requiring only 0.0039ms.

The industrial metaverse paradigm is generally a virtual environment that integrates various technologies such as augmented reality (AR) and mixed reality (MR) to enhance business operations and processes. It aims to streamline workflows, reduce error rates, improve efficiency, and provide a more engaging experience for employees. The promise of the industrial Metaverse to drive sustainability and resource efficiency is compelling. Utilizing advanced technologies like the Industrial Metaverse is essential for staying competitive in today’s rapidly evolving business environment. However, the environmental impact of the technologies underpinning the industrial metaverse, like data centres and network infrastructure, should not be overlooked. The ecological footprint of these technologies must be considered in the sustainability equation. Researchers have warned that by 2025, without sustainable AI practices, AI will consume more energy than the human workforce, significantly offsetting carbon-zero gains. As the metaverse persists in evolving and gaining momentum, it will be necessary for companies to prioritize sustainability and explore new ways to balance technological advancements with environmental stewardship. However, recent studies have conjectured that the Metaverse holds the potential to reduce carbon emissions, as digital replacements for physical goods become more prevalent and physical activities like mobility and construction are reduced. However, the specific extent to which this substitution can alleviate environmental concerns remains understudied, presenting a knowledge gap in understanding the real-world impact of digital replacements. Thus, the objective of this paper is to provide a comprehensive review of the industrial metaverse as well as explore the environmental impact of the industrial metaverse. The methodological approach is that of integrative literature review design wherein multiple sources from web science and databases such as ACM library, IEEE Library, and Google Scholar, were analysed to provide a comprehensive understanding of the developments in the industrial metaverse. Specifically, firstly by considering the Industrial metaverse architecture we elucidate the concept of the "industrial metaverse" and the associated enabling technologies. Secondly, an exploration through discussion, of the prevalent use cases and deployment of the emerging industrial metaverse. Thirdly, exploration of the impact of the industrial metaverse on the environment. In the fourth instance, we address novel security and privacy risks as well as upcoming research challenges, keeping in mind that the industrial metaverse is based on a strong data fabric. Results point to the Industrial Metaverse as having both positive and negative environmental effects by energy consumption, e-waste, and pollution. Overall research, however, indicates that most industrial metaverse applications have a positive environmental impact and subsequently trend toward sustainability. Ultimately for sustainability in the industrial metaverse, enterprises may consider utilizing renewable energy sources and cloud services. Furthermore, examining the effects of products on the environment as well as creating a circular economy.

Bioinformatics is a rapidly developing field enabling scientific experiments through computer models and simulations. Considering the vast databases of biological data available, it is ex-tremely important to develop efficient methods and algorithms for their processing. Sequence comparison is the best method for studying the evolutionary interaction between genes. It is based on alignment – the process of arranging two or more sequences to achieve the maximum level of identity and degree of similarity. The paper presents a new version of the algorithm for pairwise DNA sequences alignment, based on a new method called CAT, where a dependency with a previous match and the closes neighbor are taken in consideration to increase uniqueness of the CAT profile and to reduce possible collisions, i.e. two or more sequence having same CAT profiles. This makes proposed algorithm suitable for finding exact match of a concrete DNA se-quence in a big set of DNA data faster. The generation of CAT profiles is made once before data has been uploaded to the database, allowing the profiles to be used as metadata for the sequenc-es. It consists of an algorithm to calculate a CAT profile against the selected reference sequences and an algorithm to compare two sequences based on the calculated CAT profiles. Improve-ments in generation of the CAT profiles, are detailed described in the paper. Block scheme, pseudo code tables and figures were updated according to the proposed new version and ex-perimental results. Experiments have been carried out with the new version of the method and different datasets to align DNA sequences based on the CAT method. New experimental results in terms of collisions, speed, and efficiency of the proposed solutions are presented. Experiments related to the performance comparison with Needleman-Wunsch were re-executed with the new version of the algorithm to confirm that we have the same performance. An analysis of the per-formance of the proposed CAT based algorithm against Knuth–Morris–Pratt algorithm, which has a complexity of O(n) and is one of the most widely used for searching biological data, was performed. The impact of prior matching dependencies on uniqueness for generated CAT pro-files is investigated. The analysis of the experimental results obtained by sequence alignment shows a small deviation of the proposed algorithm based on the CAT method, which can be ig-nored if this deviation is acceptable at the expense of performance. The time efficiency of the CAT algorithm remains constant, regardless of the length of the sequences. Therefore, the ad-vantage of the proposed method is its fast processing in the alignment of large sequences, for which the execution of the exact algorithms takes a long time. The example code realization of the CAT Method, under the protection of the GNU General Public License v3.0, can be accessed on GitHub at: https://github.com/HristoS/CATSequenceAnalysis.