In recent years, ontology plays an important role in facilitating the semantic description of images which consists of describing the image by a set of words to describe the scene which signifies the belonging of the image. This description specified in several archaeological fields such as cultural, religious objects and heritage objects of France. However, the description of archaeological images is not yet exploited because this field is very diverse. In this article, we present a panel of ontology construction methods as well as archaeological ontologies. Also, we show our own OntunAr ontology to describe Tunisian archaeological images. In addition, we integrate OnTunAr into the automatic annotation of Tunisian archaeological images.

Image encryption based on chaotic maps is an important way to ensure the secure communication of digital multimedia on the Internet. To improve the encryption performance and security of image encryption systems, a new image encryption algorithm is proposed by employing a compound chaotic map and random cyclic shift. Firstly, an improved Hybrid chaotic system is designed by coupling Logistic, ICMIC, Tent, and Chebyshev maps (HLITC). Comparison tests with previous chaotic maps in terms of chaotic trajectory, Lyapunov exponent, and Kolmogorov entropy illustrate the new hybrid chaotic map has better chaotic performance. Then the proposed HLITC chaotic system is used to develop a new chaotic image encryption scheme with the double cyclic shift. The improved HLITC chaotic system is performed to generate key sequences used in the image scrambling and diffusion stage. The spiral transformation controlled by chaotic sequence is used to scramble the pixels of the plaintext image, while the XOR operation based on a chaotic map is used for pixel diffusion. Extensive experiments of statistical analysis, key sensitivity, and keyspace analysis are conducted. Experimental results show the proposed encryption scheme has good robustness against brute force attacks, statistical attacks, and differential attacks, and is more effective than many existing chaotic image encryption algorithms.

Recently, smart mobility intelligent traffic services have become a critical task in Intelligent Transportation Systems (ITS). This involves not only the use of advanced sensors and controllers but also the ability to respond to real-time traffic situations at intersections, alleviate congestion, and generate policies to prevent traffic jams. DRL (Deep Reinforcement Learning) provides a natural framework for processing tasks. In DRL, each intersection can control itself and coordinate with neighbors to achieve optimal network-wide policies. However, comparing approaches remains a challenging task due to the existence of numerous possible configurations. This research performs a critical comparison of various traffic controllers found in the literature. It demonstrates that using a nonlinear approximator for coordination mechanisms and enhancing observability at each intersection are key performance drivers.

Conducting computational stress-strain analysis using finite element methods (FEM) is a common approach when dealing with the complex geometries of atherosclerosis, which is a leading cause of global mortality and complex cardiovascular disease. The considerable expense linked to FEM analysis encourages the substitution of FEM with a considerably faster data-driven machine learning (ML) approach. This study investigated the potential of end-to-end deep learning tools as a more effective substitute for FEM in predicting stress-strain fields within 2D cross sections of arterial wall. We first proposed a U-Net based fully convolutional neural network (CNN) to predict the von Mises stress and strain distribution based on the spatial arrangement of calcification within arterial wall cross-sections. Further, we developed a conditional generative adversarial network (cGAN) to enhance, particularly from the perceptual perspective, the prediction accuracy of stress and strain field maps for arterial walls with various calcification quantities and spatial configurations. On top of U-Net and cGAN, we also proposed their ensemble approaches to further improve the prediction accuracy of field maps. Our dataset, consisting of input and output images, was generated by implementing boundary conditions and extracting stress-strain field maps. The trained U-Net models can accurately predict von Mises stress and strain fields, with structural similarity index scores (SSIM) of 0.854 and 0.830 and mean squared errors of 0.017 and 0.018 for stress and strain, respectively, on a reserved test set. Meanwhile, the cGAN models in a combination of ensemble and transfer learning techniques demonstrate high accuracy in predicting von Mises stress and strain fields, as evidenced by SSIM scores of 0.890 for stress and 0.803 for strain. Additionally, mean squared errors of 0.008 for stress and 0.017 for strain further support the model's performance on a designated test set. Overall, this study developed a surrogate model for finite element analysis, which can accurately and efficiently predict stress-strain fields of arterial walls regardless of complex geometries and boundary conditions.

With the widespread Application of Virtual Reality (VR) in education, optimizing foreign language learning in VR has become a focal point of research. This paper introduces a comprehensive theoretical framework (VR-CCL) based on constructivism and cognitive load theory to enhance foreign language learning in VR. Through a literature review, we explore the applications of VR in education, foreign language learning theories, and prior works on technology-assisted language learning. We further detail the three main components of the VR-CCL framework and validate its effectiveness through two case studies: Duolingo VR and Rosetta Stone VR. Finally, we discuss the strengths and limitations of the framework and its implications for educators and developers.

The work of this paper presents multiple novel findings from a comprehensive analysis of about 150,000 tweets about exoskeletons posted between May 2017 and May 2023. First, findings from content analysis and temporal analysis of these tweets reveal the specific months per year when a significantly higher volume of Tweets was posted and the time windows when the highest number of tweets, the lowest number of tweets, tweets with the highest number of hashtags, and tweets with the highest number of user mentions were posted. Second, the paper shows that there are statistically significant correlations between the number of tweets posted per hour and different characteristics of these tweets. Third, the paper presents a multiple linear regression model to predict the number of tweets posted per hour in terms of these characteristics of tweets. The R2 score of this model was observed to be 0.9540. Fourth, the paper reports that the 10 most popular hashtags were #exoskeleton, #robotics, #iot, #technology, #tech #innovation, #ai, #sci, #construction and #news. Fifth, sentiment analysis of these tweets was performed using VADER and the DistilRoBERTa-base library. The results show that the percentage of positive, neutral, and negative tweets were 46.8%, 33.1%, and 20.1%, respectively. The results also show that in the tweets that did not express a neutral sentiment, the sentiment of surprise was the most common sentiment. It was followed by the sentiments of joy, disgust, sadness, fear, and anger. Furthermore, analysis of hashtag-specific sentiments revealed several novel insights, for instance, for almost all the months in 2022, the usage of #ai in tweets about exoskeletons was mainly associated with a positive sentiment. Sixth, text processing-based approaches were used to detect possibly sarcastic tweets and tweets that contained news. Finally, a comparison of positive tweets, negative tweets, neutral tweets, possibly sarcastic tweets, and tweets that contained news, in terms of different characteristic properties of these tweets are presented. The findings reveal multiple novel insights, for instance, the average number of hashtags used in tweets that contained news has considerably increased since January 2022.

Cloud computing is a strong and efficient technology facing some efficiency challenges attributable to its decentralized nature. The emergence of fog computing has subdivided the expansive cloud into numerous smaller units known as "cloudlets." Fog computing is one of the most recent advancements in today’s cloud computing landscape. Each cloudlet is a novel and diminutive architectural element extending the contemporary cloud computing infrastructure. The term "cloudlets" has been integrated with fog computing due to its augmenting impact on the attributes of cloud computing. F fog computing is a significant foundation and an indispensable cloud component. Consequently, this technology holds the potential to address efficiency concerns effectively. As a result, this paper focuses on enhancing the efficiency of the cloud computing environment by fine-tuning the efficiency parameters derived from fog computing. These parameters encompass response time, latency, and network utilization. The proposed solution involves developing a simulation system to minimize task redundancy and increase performance levels in the healthcare environment. The outcomes manifest a substantial improvement in the performance of the suggested system, with a clear increase depending on the three key parameters (response time, network utilization, and latency). Therefore, these findings are encouraging and carry significant implications, promoting the application of the proposed system in the real healthcare environment.

Texture is essential information for image representation, capturing patterns, and structures. Consequently, texture plays a crucial role in the manufacturing industry and has been extensively studied in the fields of computer vision and pattern recognition. However, real-world textures are susceptible to defects, which can degrade the image quality and cause various issues. Therefore, there is a need for accurate and effective methods to detect texture defects. In this study, a simple autoencoder and Fourier transform were employed for texture defect detection. The proposed method combines Fourier transform analysis with the reconstructed template obtained from the simple autoencoder. Fourier transform is a powerful tool for analyzing the frequency domain of images and signals. Moreover, analyzing the frequency domain enables effective defect detection because texture defects often exhibit characteristic changes in specific frequency ranges. The proposed method demonstrates effectiveness and accuracy in detecting texture defects. Experimental results are presented to evaluate its performance and compare it with those of existing approaches.

Requirements Engineering (RE) is an important step in the whole software development lifecycle. The problem in RE is to determine the class of the software requirements as functional and non-functional. Proper and early identification of these requirements is vital for the entire development cycle. On the other hand, manual government of requirement classes is a timewasting task, and it needs intensive effort. Automatic requirement classification techniques through advanced Machine Learning (ML) strategies are started to be developed to address this problem. Basically, software requirements are generated as natural language explanations and therefore requirement classification may be handled as a particular Natural Language Processing (NLP) problem. From ML point of view, classification strategies require dataset to be used in the training/learning phase. For this goal, we generated a unique Turkish dataset having collected the requiremenst from real-world software projects with 4600 samples. Of these requirements, 3000 and 1600 were labeled as functional and non-functional, respectively. The data set has been evaluated using (i) traditional machine learning algorithms, (ii) deep learning algorithms, and (iii) transformer models respectively. As a result BERTurk was found to be the most successful algorithm to discriminate functional and non-functional requirements in terms of 95% f-score metric.

Cellular automata are mathematical models that represent systems with complex behavior through simple interactions between their individual elements. These models can be used to study unconventional computational systems and complexity. One notable aspect of cellular automata is their ability to create structures known as gliders, which move in a regular pattern to represent the manipulation of information. This paper introduces the modification of mean-field theory applied to cellular automata, using random perturbations based on the system’s evolution rule. The original aspect of this approach is that the perturbation factor is tailored to the nature of the rule, altering the behavior of the mean-field polynomials. By combining the properties of both the original and perturbed polynomials, it is possible to detect when a cellular automaton is more likely to generate gliders without having to run evolutions of the system.This methodology is a useful approach to finding more examples of cellular automata that exhibit complex behavior. We start by examining elementary cellular automata, then move on to examples of automata that can generate gliders with more states. To illustrate the results of this methodology, we provide evolution examples of the detected automata.

This study proposes a short- and medium-term electricity consumption prediction algorithm by combining the GRU model suitable for long-term forecasting and the Prophet model suitable for seasonality and event handling. (1) Manufacturing Company B's Electricity consumption data and meteorological data in Naju, Jeollanam-do, South Korea are collected and preprocessed. (2) The preprocessed data proposes the Prophet model in the first step for seasonality and event handling prediction. (3) In the second step, seven multivariate data are experimented with GRU. Specifically, the seven multivariate data consist of six meteorological data and the residuals between the predicted data from the proposed Prophet model in Step 1 and the observed data. These are utilized to predict electricity consumption at 15-minute intervals. (4) Electricity consumption is predicted for short-term (2 days and 7 days) and medium-term (15 days and 30 days) scenarios. The experimental results demonstrate that the proposed method outperforms the conventional Prophet model by more than 23 times and the modified GRU model by more than 2 times in terms of MAPE.

This article obtains data through questionnaire survey, and then uses the Multiple Indicators Multiple Causes (MIMIC) Model to establish the Taoyuan City’s quality of life quantifying framework in a city-level community context. Statistical test results show that the reliability of overall model is high and is suitable for policy analysis. There are thirteen variables in the structural model that significantly affect the quality of life as well as eleven indicators in the measurement model that can significantly measure the quality of life. Then, half of the observations are substituted back to calculate the quality of life. Via ArcGis operation, it finds that the quality of life of Longtan District is the best as well as Dayuan District is the worst one. LISA cluster of quality of life illustrates hot spots areas are distributed in Longtan, Daxi, and Pingzhen Districts.

Fish feeding behavior analysis plays a critical role in aquaculture, marine fisheries, and ecological monitoring. At present, the accuracy of current fish feeding behavior analysis is easily affected by the environment, and the hypoxia state in water and high temperature have a huge impact on behavior. In addition, the poor stability, and the speed is affected by the calculation amount of the model, so it cannot be applied to aquaculture ponds. In order to solve the above problems, we propose an improved RepVGG-based method for fish feeding behavior analysis to identify nine behavioral states of fish populations, including hypoxia, hot, and normal states of none, medium, and strong feeding. Firstly, our method adds the identity and residual branches to the block of the VGG network, focusing on the acceleration operation to ensure accuracy. At the same time, the Efficient Channel Attention (ECA) module is added to reduce dimensionality to balance speed and accuracy. To evaluate the effectiveness of the method, it is validated on a constructed fish feeding behavior dataset and compared with a Convolutional Neural Network (CNN) including AlexNet, VGG16, ResNet34, MobileNet V3, and RepVGG. The experimental results show that after 15 epochs of training, the average precision of proposed method reached 97%. Compared with the basic classification algorithm, our method can increase by at least 3% while the inference speed exceeds 85 Frames Per Second (FPS). This study can be integrated into the aquaculture vision system to guide users to plan feeding strategies, and provide new ideas and methods for water quality monitoring.

Data Extraction is a technique is called as clustering which is used to retrieve data either from the files or data bases or both. This paper focuses on the performance evaluation parameters of the clustering algorithms based on different parameters or conditions or constraints and parameters which are used to perform the clustering process to get the clusters on the data sets. Therefore best clusters are retrieved when best parameters or conditions or constraints or preferences which are applied on the data sources for the clustering process. These parameters or conditions or constraints are opted by the user called as user preferences.

Abstract: The two-dimensional Fuzzy Transform was applied in image compression. The quality of the image compressed with this methodis better than that obtained using methods based on fuzzy relation equations and comparable with that of the JPEG method, with better compression execution times. In this paper we propose a variation of the method based on the two-dimensional Fuzzy Transform of image compression, in which the image is first partitioned into blocks and then each block is compressed with the higher compression rate. The advantage of this method consistsinto a greater compression of the image, guaranteeing a high quality of the reconstructed image.The results show that our method is better than the Fuzzy Transform method improving also the quality of the reconstructed image.

In this paper, we study properties of formal concepts from an order-theoretic perspective. We first establish a natural correspondence between formal contexts and preorders as well as their induced posets. Then, based on the poset induced from a formal context, we provide characterization for join-irreducible or meet-irreducible elements of finite concept lattices. In addition, we introduce the notion of rough conceptual approximations based on topological closure and interior operators. In contrast with the conventional definition of equivalence class of an object used in Pawlakian approximation spaces, we instead utilize the extent of an object concept. We show that rough conceptual approximations are equivalent to approximation operators in the generalized approximation space associated with the preorder corresponding to a formal context. We also illustrate these theoretical results with examples and discuss their potential applications.

The smart grid system, an improvised form of the traditional grid, is considered a critical cyber-physical system. Due to its complex combination of smart and legacy technologies, this technology is characterized by a wide range of features such as full duplex communication, advanced metering infrastructure, remote monitoring, and control. However, despite this system’s substantial environmental and socio-economic impact on modern life, it poses severe security vulnerabilities due to its integration and interconnected and interdependent cyber-physical components. Based on the rapid development of cyber-physical systems (CPS), academics and industries have investigated relevant techniques to enhance and strengthen the security measures of the SG system. The intrusion detection system is a countermeasure, a powerful safeguard against various cyber-attacks and threats. The contribution of the IDSs to the SG paradigm is examined in this study. A comprehensive review has been presented in this study, highlighting different techniques, basic ideas, and analyses. Besides discussing the contemporary pertinent research studies, the shortcomings of the existing IDS for the SG system are also identified with a recommendation for future research direction.

Log collection and storage is a crucial process for enterprises around the globe. Log analysis helps identify potential security breaches and, in some cases, is required by law for compliance. However, enterprises often delegate these responsibilities to third-party Cloud Service Providers (CSPs), where the logs are collected and processed for anomaly detection and stored in a data warehouse for archiving. Prevalent schemes rely on plain (unencrypted) data for anomaly detection. More often, these logs can reveal sensitive information about an organization or the customers of that organization. Hence, it is best to keep it encrypted at all times. This paper presents "SigML++," an extension of work done in "SigML." We utilize Fully Homomorphic Encryption (FHE) with the Cheon-Kim-Kim-Song (CKKS) scheme for supervised log anomaly detection on encrypted data. We use an Artificial Neural Network (ANN) based probabilistic polynomial approximations using a Perceptron with linear activation. We probabilistically approximate the Sigmoid activation function (σ(x)) in the encrypted domain for the intervals [−10,10] and [−50,50]. Experiments show better approximations for Logistic Regression (LR) and Support Vector Machine (SVM) for low-order polynomials.

Over the years, network analysis became a promising strategy to analyze complex system, i.e. systems composed by a large number of interacting elements. In particular, multilayer networks have emerged as a powerful framework for modelling and analysing complex systems with multiple types of interactions. Network analysis can be applied to pharmacogenomics to gain insights into the interactions between genes, drugs, and diseases. By integrating network analysis techniques with pharmacogenomic data, the goal consists to uncover complex relationships and identify key genes to use in pathway enrichment analysis to figure out biological pathways involved in drug response and adverse reactions. In this study, we model omics, diseases and drugs data together through the multilayer network representation. Then, we mined the multilayer network with a community detection algorithm by obtaining top communities. After that, we used the identified list of genes from the communities to perform pathway enrichment analysis (PEA) to figure out the biological function affected form the selected genes. The results show that the genes forming the top community have the multiple roles through different pathways.

Low-resource languages often face the problem of insufficient data, which leads to poor quality in machine translation. One approach to address this issue is data augmentation. Data augmentation involves creating new data by transforming existing data through methods such as flipping, cropping, rotating, and adding noise. Traditionally, pseudo-parallel corpora are generated by randomly replacing words in low-resource language machine translation. However, this method can introduce ambiguity as the same word may have different meanings in different contexts. This study proposes a new approach for low-resource language machine translation, which involves generating pseudo-parallel corpora by replacing phrases. The performance of this approach is compared with other data augmentation methods, and it is observed that combining it with other data augmentation methods further improves performance. To enhance the robustness of the model, R-Drop regularization is also used. R-Drop is an effective method for improving the quality of machine translation. The proposed method was tested on Chinese-Kazakh (Latin script) translation tasks, resulting in performance improvements of 4.99 and 7.7 for Chinese-to-Kazakh and Kazakh-to-Chinese translations, respectively.

The predominance of traffic lights in urban settings often induces fluctuations in traffic patterns and energy utilization among vehicles. To counteract the adverse effects of traffic lights on the energy efficiency of electric vehicles (EVs), a Multi-Intersections-Based Eco-Approach and Departure strategy (M-EAD) is proposed. This strategy aims to enhance vehicle energy efficiency, traffic flow, and battery longevity, all while upholding satisfactory driving comfort. The M-EAD strategy unfolds in two distinct stages: the optimization of an eco-friendly green signal window and the refinement of speed trajectories. The initial stage tackles the optimization of traffic light green signal windows, underpinned by the minimization of travel delays via solving the shortest path problem. In the subsequent stage, a receding horizon framework takes center stage, leveraging an iterative dynamic programming algorithm to tackle the speed optimization challenge. The objective here is to curtail energy consumption and reduce battery wear by finding an optimal speed trajectory. Furthermore, the real-world efficacy of this approach is substantiated through on-road vehicle tests, attesting to its viability in actual road scenarios.

In recent years, there has been an increasing demand for personalized experiences in various domains, including the cultural and educational sectors. Museums, as custodians of art, history, and scientific knowledge, are seeking innovative ways to engage their visitors and provide tailored content that enhances their understanding and appreciation of the exhibits. This article presents ExhibitXplorer, a distributed architecture service that leverages geofencing, artificial intelligence, and microservices to enable personalized content delivery in museums. By combining implicit and explicit segmentation of museum visitors and utilizing the GPT API for content generation, ExhibitXplorer offers a dynamic experience to different visitor segments, including researchers, students, casual visitors, and children. The system utilizes push notifications triggered by visitor location changes, allowing seamless delivery of personalized information both indoors and outdoors. Tests were conducted to evaluate the user experience of visitors to an outdoor ethnographic museum. The results showed that 55% of the test participants were satisfied and 45% very satisfied with the way personalized content was delivered.

Recently, various applications of indoor location-based services using Wi-Fi fingerprint data have been studied. However, since fingerprint data collected at a specific location does not have continuous information between signals and correlation information between signals, path data cannot exist in principle. Therefore, most indoor positioning technologies are based on predicting the position of a stationary positioner at a specific location based on signal data collected at a specific location in the indoor space. Due to the discontinuous nature of these signals, they are unable to account for user movement. Therefore, there is a need for techniques to improve the accuracy of indoor positioning in moving situations. This paper proposes a method for enriching all data points with relevant information to obtain improved indoor positioning results and an improved technique for generating movement path data. The proposed technique generates relevant information with continuity by expressing data points as Bounding Boxes (BB) and subsequently clustering them using grid cells. Through the proposed method, we represented and expanded the indoor location data, which consists of data points, as BB. However, data points represented by BB do not have any adjacency information with each other, and as a result, it is not possible to create a movement path between neighboring BB. To solve the problem, we used clustering, a machine learning technique that categorizes data points into groups, to group BBs. This was done by constructing a YOLO (You Only Look Once) grid cell that included all BBs and clustered them into grid cells that were divided into specific regions through the suggestion phase. The clustering results align with the indoor structure of the building, indicating that the data points have been appropriately clustered. BBs inside a grid cell are contained within a moveable area and have related information. We also generated association information between neighboring grid cells through the proposal technique, and then generated path information that can be traveled between grid cells. In this paper, we use the movement path information generated from a dataset as training data for machine learning, and through this, we propose an enhanced indoor positioning technology.

Recent digital transformations have significantly impacted the current society, economy, and culture. This includes adoption of rapidly emerging technologies, such as artificial intelligence (AI), immersive technology (e.g., virtual, augmented, mixed and extended reality (VR/AR/MR/XR)), cloud services, and internet of things, in our day-to-day life. `Metaverse’ has emerged as a technology that incorporates many of these transforming technologies to deliver personalised immersive experience related to specific application areas. A potential major beneficiary of Metaverse is the educational ecosystem, where highly immersive learning experiences can be delivered to students, catering to their personal learning needs and train them on life skills such as empathy, ethical qualities, and communication skills. The present-day Metaverse allows physical engagement, enabling users to utilise limb movements to interact with the presented materials. However, ethical concerns and technical limitations impede the widespread implementation of the Metaverse in the real-world. This paper provides a comprehensive survey of the existing literature covering the architecture, type and components of Metaverse, followed by practical aspects of metaverse implementation. The paper is concluded by discussing on the open challenges and issues along with their mitigation strategies and future research directions after the detailed usecase of Metaverse in Education.

E-commerce recommendation systems usually deal with massive customer sequential databases, such as historical purchase or click stream sequences. Recommendation systems’ accuracy can be improved if complex sequential patterns of user purchase behavior are learned by integrating sequential patterns of customer clicks and/or purchases into the user-item rating matrix input of collaborative filtering. This reviews focuses on algorithmic techniques of existing E-commerce recommendation systems that are sequential pattern based such as ChoRec05, ChenRec09, HuangRec09, LiuRec09, ChoiRec12, Hybrid Model RecSys16, Product RecSys16, SainiRec17, HPCRec18 and HSPCRec19. It provides a comprehensive and comparative performance analysis of these systems, exposing their methodologies, achievements, limitations, and potentials for solving more important problems in this domain. The review showed that integrating sequential pattern mining of historical purchase and/or click sequences into user-item matrix for collaborative filtering (i) improved recommendation accuracy (ii) reduced user-item rating data sparsity (iii) increased novelty rate of recommendations and (iv) improved scalability of the recommendation system.

Data is present in the data sources like Files and Data bases, Retrieval of information from that data sources is one of the important issue nowadays. So for retrieval information from the data sources clustering is used. In the present market different types of clustering algorithms were available. But opting of the clustering is based on user requirements. This paper focuses on the study of hierarchical clustering approach on different conditions or measures or with customer choices like clustering process number of clusters generated at each level, number of levels, attributes range for performing the clustering on the given data set. In brief overview we discuss the hierarchical approach for clustering algorithm with the user opting choices.

Students in their first year of computer science (CS1) at universities typically struggle to grasp programming concepts. This paper covers research using a Java programming language-guided visual execution environment (VEE) to teach CS1 students about programming concepts. The topics covered include input and output, conditionals, loops, functions, arrays, recursion, and files, all of which are covered in an introductory programming course. The VEE walks beginner programmers through the fundamentals of programming, utilizing visual metaphors to explain and direct interactive Java tasks. The primary goal of this study is to determine whether a cohort of 105 CS1 students from four different groups who are enrolled in two universities—one in Madrid, Spain, and the other in Galway, Ireland—can advance their programming abilities under the guidance of the VEE. Second, does the improvement vary depending on the programming concept? The findings demonstrate that students' programming knowledge has greatly increased. This improvement is significant for all programming concepts, while it is more pronounced for some topics than others, such as operators, conditionals, and loops. Additionally, it demonstrates that students had little prior understanding of files and recursion. The most well-known concept to them was the sequence concept.

Convolutional Neural Networks (CNNs) and Recurrent Neural Networks (RNNs) have been utilised to forecast the foreign exchange market (Forex). However, such models usually exhibit unstable behaviour, as data perturbations often downgrade the functionality of the entire network due to their monolithic architecture. Hence, this study proposes a novel neuroscience-informed modular network applied to the closing prices and the sentiments retrieved from Yahoo Finance and Twitter APIs, aiming to anticipate better price fluctuations in Euro to British Pound Sterling (EUR/GBP) rather than monolithic methods. The proposed model is based on a new modular CNN, replacing pooling layers with orthogonal kernel initialisation RNNs coupled with Monte Carlo Dropout (MCD), namely MCoRNNMCD. It combines two modules: i) a convolutional simple RNN and ii) a convolutional Gated Recurrent Unit (GRU), where orthogonality and MCD are added to reduce the overfitting, assessing each module's uncertainty. These parallel feature extraction modules concatenate their outputs to a final three-layer Artificial Neural Network (ANN) decision-making module. A comprehensive comparison viewing objective evaluation metrics such as the Mean Square Error (MSE) proved that the proposed MCoRNNMCD-ANN outperformed single CNN, LSTM, GRU, and the state-of-the-art hybrid BiCuDNNLSTM, CLSTM, CNN-LSTM, and LSTM-GRU in forecasting hourly EUR/GBP closing price fluctuations.

. Various elements such as evolutions in IoT services resulting from sensoring by vehicle parts and advances in small communication technology devices have significantly impacted the mass spread of mobility services that are provided to users in need of limited resources. In particular, business models are progressing away from one-off cost towards longer term cost as represented by shared services utilizing kick-boards or bicycles and subscription services for vehicle software. Advances in shared mobility services as described are calling for solutions that can enhance reliability of data aggregate by users leveraging mobility services in the next-generation mobility areas. However, mining process to renew status, ensures continued network communication and block creation demands high performance in public block chain. This thesis proposes random certificate node selection mechanism in block network that creates blocks via node that has tokens issued for block creation and lets only specific nodes selected by encrypting token information acquires token.

The aim of this work is to broaden the theory of computation by making use of fuzzy sets and multisets, which are generalization of ordinary sets. We study fuzzy multiset finite automata (FMFA), which are characterized by the incorporation of vagueness when it comes to the choice of the next state and multiple occurrences of the same input symbol. The resulting automaton is a genaralization of both classical automata and fuzzy automata. We discuss the algebraic characteristics of FMFA sub-automata—separatedness, strongly connectedness, cyclic, directable, and triangular FMFA in terms of equivalence classes induced by an equivalence relation defined on state set of FMFA. Intrestingly, for a given FMFA, a new FMFA can be constructed that is a homomorphic image of the original FMFA. We define different posets structures that can be associated with a given FMFA and show that some of them are upper semilattices and discuss the inter-relationship of a given poset, a finite upper semilattice (FUSL), a FMFA and a posets/FUSL associated with a given FMFA. Finally, we introduce the concept of decomposition of a FMFA in two different ways and characterize the strongly connected, triangular and directable FMFA.

Recent SDN advances address traditional network management challenges through centralized control and plane separation. SDN prevents breaches using a centralized controller but introduces risks. The controller can be a single point of failure. Thus, an OpenFlow Controller's flow-based anomaly detection enhances SDN security. Our research explored two OpenFlow intrusion detection methods. The first employed machine learning, NSL-KDD dataset, and feature selection, yielding 82% accuracy with random forest. The second combined deep neural networks with GRU-LSTM, achieving 88% accuracy using ANOVA F-Test and feature elimination. Experiments highlighted deep learning as superior for OpenFlow intrusion detection.

In this systematic review of the literature on using Machine Learning (ML) for credit risk prediction, we raise the need for financial institutions to use AI and ML to assess credit risk, analyzing large volumes of information. We posed research questions about algorithms, metrics, results, data sets, variables, and related limitations in predicting credit risk. We searched renowned databases to answer them and identified 52 relevant studies with the credit industry microfinance. Challenges and approaches in credit risk prediction using ML models we identified, difficulties with the implemented models such as the black box model, the need for explanatory artificial intelligence, the importance of selecting relevant features, addressing multicollinearity, and the problem of the imbalance in the input data. By answering the questions, we identified that the Boosted Category is the most researched family of ML models; the most commonly used metrics for evaluation are Area Under Curve (AUC), Accuracy (ACC), Recall, precision measure F1 (F1), and Precision; Research mainly uses public data sets to compare models, and private ones to generate new knowledge when applied to the real world. The most significant limitation identified is the representativeness of reality, and the variables primarily used in the microcredit industry are related data to the demographic, the operation, and payment behavior. This study aims to guide the developers of credit risk management tools and software towards the existing offer of ML methods, metrics, and techniques used to forecast it, thereby minimizing possible losses due to default and guiding risk appetite.

Quantitative evaluation of the musical timbre and its variations is important for the analysis of audio recordings and computer-aided music composition. Using the FFT acoustic descriptors and their representation in an abstract timbral space, variations of a sample of monophonic sounds of chordophones (violin, cello) and aerophones (trumpet, transverse flute, and clarinet) sounds are analyzed. It is concluded that the FFT acoustic descriptors allow us to distinguish the timbral variations of the musical dynamics, including crescendo and vibrato. Furthermore, using the Random Forest algorithm, it is shown that the FFT-Acoustic provides a statistically significant classification to distinguish musical instruments, family of instruments, and dynamics. We observed a better behavior for the FFT-Acoustic descriptors when classifying pitch compared to some timbral features of Librosa.

Accurately predicting electrical signals of three-phase Direct Torque Control (DTC) induction motors is crucial for optimal motor performance and effective condition monitoring. However, multiple DTC motors’ complexity and operating conditions’ variations pose challenges for traditional prediction methods. To overcome these challenges, we propose an innovative approach that combines Fast Fourier Transform (FFT) to transform electrical motor simulation data and a Bi-directional Long Short-Term Memory (Bi-LSTM) network to forecast processed motor data. By transforming the DTC induction motor signals from the time domain to the frequency domain, we enhance the capability of learning models to capture subtle differences and generate various input features. The Bi-LSTM model effectively captures both forward and backward dependencies in time series data, enabling accurate prediction of electrical signals. We evaluate the proposed approach using our simulated dataset and compare the proposed method to a state-of-the-art model, the Gated Recurrent Unit (GRU), demonstrating its effectiveness in improving the accuracy and reliability of induction motor signals forecasting. The finding provides valuable insights for advancing motor control and operation in industrial applications.

The primary goal of picture compression is to reduce the amount of unused image data while still storing or transmitting it in a format that is appropriate. The compression of raw binary data is quite different from the compression of a picture, and these differences may be rather substantial. In light of this, compression is often regarded as an essential technique for the purposes of both data storage an d transmission in order to mitigate the excessive amounts of data that are generated by these images. In order to transmit enormous datasets, particularly for the purposes of telemedicine and teleradiology, one needs a significant amount of storage capacity as well as an expansive network. As a result, compression is an important aspect of medical imaging. In addition to the importance of compression, the quality of the photos themselves is also an essential factor in the success of analysis. In addition to this, the amount of time necessary to compress the photographs before sending them should be reduced.

This research uses the computing of conceptual distance to measure information content in Wikipedia categories. The proposed metric, generality, relates information content to conceptual distance by determining the ratio of information a concept provides to others compared to the information it receives. The DIS-C algorithm calculates generality values for each concept, considering each relationship's conceptual distance and distance weight. The findings of this study were compared to current methods in the field and found to be comparable to results obtained using the WordNet corpus. This method offers a new approach to measuring information content applied to any relationship or topology in conceptualization.

Image compression is a top priority today due to the need for faster encoding and decoding. To achieve this, the present study has proposed the use of Canonical Huffman Coding (CHC) as an entropy coder, which has a lower decoding time complexity than binary Huffman codes. For image compression, combining of the Discrete Wavelet Transform (DWT) and CHC with Principal Component Analysis (PCA) has been recommended. The lossy method has been introduced by using PCA, followed by DWT and CHC to enhance compression efficiency. By using DWT and CHC instead of PCA alone, the reconstructed image has been found to have a better peak signal-to-noise ratio (PSNR) value. This study has developed a hybrid compression model combining the advantages of DWT, CHC and PCA. With the increasing use of image data, better image compression techniques are necessary for efficient use of storage space. The proposed technique has achieved up to 60% compression while maintaining high visual quality. This method has also outperformed the currently available techniques in terms of both PSNR (in dB) and bit-per-pixel (bpp) scores. This approach has been tested on various color images, including Peppers 512×512 and Couple 256×256, showing improvement by 17 dB and 22 dB, respectively, while reducing bpp by 0.56 and 0.10, respectively. For grayscale images, i.e., Lena 512×512 and Boat 256×256, the proposed method has shown an improvement by 5 dB and 8 dB, respectively, with a decrease of 0.02 bpp in both cases.

The main channel for disseminating information is now the Internet. Users have different expectations for the calibre of websites regarding the posted and presented content. The WEB site's quality is influenced by up to 120 factors, each represented by two to fifteen attributes. A major challenge is quantifying the features and evaluating the quality of a website based on the feature counts. One of the aspects that determines a website's quality is its completeness, which focuses on the existence of all the objects and their connections with one another. It isn’t easy to build an expert model based on feature counts to evaluate website quality, so this paper has focused on that challenge. Both a methodology for calculating a website's quality and a parser-based approach for measuring feature counts are offered. We provide a multi-layer perceptron model that is an expert model for forecasting website quality from the "Completeness" perspective. The accuracy of the predictions is 98%, whilst the accuracy of the nearest model is 87%.

The volume of vehicular traffic in large cities has increased in recent years, the devices that collect vehicular GPS data such as cameras, GPS receivers and others generate millions of records at every instant of time generating problems in processing and storage of these data which becomes important for researchers. Intelligent Transportation Systems perform vehicle monitoring and control by collecting GPS trajectories, this large volume of information is necessary to have an optimal storage process. Its processing by means of compression techniques and simplification algorithms allow to reduce the necessary storage space. This paper presents a GPS trajectory simplification algorithm that considers noise reduction, point simplification and analysis of road network information. The results obtained on two data sets from the cities of California and Beijing are satisfactory, achieving a higher compression ratio without affecting data quality

The core reasoning task for datalog engines is materialization, the evaluation of a datalog program over a database alongside its phys- ical incorporation into the database itself. The de-facto method of computing it, is through the recursive application of inference rules. Due to it being a costly operation, it is a must for datalog engines to provide incremental materialization, that is, to adjust the computation to new data, instead of restarting from scratch. One of the major caveats, is that deleting data is notoriously more involved than adding, since one has to take into account all possible data that has been entailed from what is being deleted. Differential Dataflow is a computational model that provides efficient incremen- tal maintenance, notoriously with equal performance between ad- ditions and deletions, and work distribution, of iterative dataflows. In this paper we investigate the performance of materialization with three reference datalog implementations, out of which one is built on top of a lightweight relational engine, and the two others are differential-dataflow and non-differential versions of the same rewrite algorithm, with the same optimizations.

It is standard for blockchain platforms to issue native tokens, currencies, that users must own to operate within the platform. Some blockchains however decided to issue two tokens, a dual system, one typically for governance and the other for implementing functions on the blockchain, such as executing transactions or smart contracts. Therefore, the two tokens are used for different activities. Typically, owning the governance tokens gives right to receive the other token for free, as a reward for participating to the blockchain decision-making process. However, both tokens can also be traded on some exchange nodes, which means that platform functions could be implemented even without owning governance tokens. In the paper we discuss some economic fundamentals of dual-token blockchain platforms. In particular, we investigate the market relative attractiveness of the two tokens by introducing some simple numerical indicators, based on prices, traded and circulating monetary quantities. Such indicators, which are meant to reflect the platform view on the tokens’ market desirability, could be computed in real time and used to support the platform’s policy making.

Advancements in computing technology have resulted in significant changes in education, healthcare, and manufacturing fields. Thus, personnel training in computer-related fields is directly related to national competitiveness. Therefore, the importance of programming education has been emphasized worldwide. Programming education has been conducted since the 1980s, however beginners often find programming tedious and difficult because of the cognitive burden of using text commands. Therefore, block-based programming environments, such as Scratch and Code.org, and beginner-oriented programming environments, such as Blockly and Pencil Code, have been de-veloped. However, they have limitations when transitioning from block to text-based programming. In this study, we conducted one semester of classes for 128 middle school, high school, and uni-versity students to determine whether an environment that allows using a text-based programming language in a block-based programming environment aids beginners’ understanding of program-ming instructions, command usage confidence, and programming usefulness. The results confirm that the usability of a block-based environment positively influences programming perception. This study is significant because it verifies the necessity and effectiveness of a block-based environment that employs a text-based programming language in programming education for beginners.

Accurate localization of the fovea in fundus images is essential for diagnosing retinal diseases. Existing methods often require extensive data and complex processes to achieve high accuracy, posing challenges for practical implementation. In this paper, we propose an effective and efficient approach for fovea detection using simple image processing operations and a geometric approach based on the optical disc's position. A key contribution of this study is the successful determination of the temporal direction by leveraging readable asymmetries related to the optical disc and its surroundings. We discuss three methods based on asymmetry conditions, including blood vessel distribution, cup disc inclination, and optic disc location ratio, for detecting the temporal direction. This enables precise determination of the optimal foveal region of interest (ROI). Through this optimized fovea region, fovea detection is achieved using straightforward morphological and image processing operations. Extensive testing on popular datasets (DRIVE, DiaretDB1, and Messidor) demonstrates outstanding accuracy of 99.04% and a rapid execution time of 0.251 seconds per image. The utilization of asymmetrical conditions for temporal direction detection provides a significant advantage, offering high accuracy and efficiency while competing with existing methods.

Nowadays, people like to travel to alleviate the stress and depression in their busy lives, and if they can do so at a low cost, it will be even more beneficial to them. The usual way for a traveler to book a ticket or to contact a travel agency is to book a ticket. It becomes more expensive for travelers. Due to the lack of vehicle management, travel agencies don’t get their appropriate profit. In this journal, we have provided proficient solutions for vehicle optimization to minimize travel costs. However, when travelers want to travel, they don’t find a proper tour guide, and it is sometimes expensive to arrange a proper tour guide. Moreover, travelers often don’t find a suitable package, and occasionally they do not know the place where they may want to visit. In this paper, we have discussed how we used effective methods to reduce vehicle costs for tour purposes. Further, we have developed a solution where bus seats are optimally occupied, and the package system and tour guide are included in it. We have also added a blog portal to our web-based software to introduce all tourist places and their information. In this journal, the proposed optimal vehicle usage system has been developed using Hypertext Markup Language (HTML), Cascading Style Sheets (CSS), the Tailwind Framework, React, and Node.js.

This paper explores the potential of using the SAM segmentator to enhance the segmentation capability of known methods. SAM is a promptable segmentation system that offers zero-shot generalization to unfamiliar objects and images, eliminating the need for additional training. The open-source nature of SAM on GitHub allows for easy access and implementation. In our experiments, we aim to improve the segmentation performance by providing SAM with checkpoints extracted from the masks produced by DeepLabv3+, then merging the segmentation masks provided by these two networks. Additionally, we examine the \enquote{oracle} method (as upper bound baseline performance), where segmentation masks are inferred only by SAM with checkpoints extracted from ground truth. In addition, we tested in the CAMO datasets an ensemble of PVTv2 transformers; combining the ensemble and SAM yields state-of-the-art performance in that dataset. The results of our study provide valuable insights into the potential of incorporating the SAM segmentator into existing segmentation techniques. We release with this paper the open-source implementation of our method.

This paper presents the development of a housing information system application using the Agile development method. The rapid development of information technology has necessitated the use of systems in various fields for efficient administration and data processing. However, traditional soft- ware development approaches are time-consuming and may not meet user requirements. The Agile methodology, with its flexible and iterative approach, addresses these challenges by focusing on delivering a functional system quickly. In this study, credit scoring and background related to housing information systems are examined, along with an overview of related work in Agile software development methodologies. The methods used in developing the housing information system application are explained, including the Agile development process and the stages involved. The results show that the Agile development method effectively produces user-friendly and functional housing information system applications. The system provides a simple and intuitive interface that facilitates easy navigation and access to information. Overall, the Agile development method is a valuable approach for software development to meet evolving user needs.

Currently Single Board Computers (SBCs) are sufficiently powerful to run Real-Time Operating Systems (RTOSs) and applications with real-time attributes and requirements. SBCs serve as a foundation in Industrial Internet of Things (IIoT). The NXP Semiconductors produces a series of SBCs based on ARM-processors for a variety of industrial applications. The continuous increase in real-time data generated by IoT devices adds further research issues about the efficiency of such systems and applications. The purpose of this research was to investigate the timing performance of an NXP TWR-K70F120M device with μClinux OS on running concurrently tasks with real-time features and constraints. A custom-built multithreaded application with specific compute-intensive sorting and matrix operations was developed and applied to obtain measurements in specific timing metrics, including task’s execution time, threads waiting time, and response time, under different threads variations. The performance of this device was additionally benchmarked and validated against favorite platforms, a Raspberry Pi4 and BeagleBone AI SBCs. The experimental results showed that this device stands well both in terms of timing and efficiency metrics. Execution times were quite lower than the others, by approximately 56% in the case of two threads, and by 29% in the case of thirty-two threads configurations.

Federated learning (FL) has become a burgeoning and attractive research area, which provides a collaborative training scheme for distributed data sources with privacy concerns. Most existing FL studies focus on taking unimodal data, such as images and text, as the model input and resolving the heterogeneity challenge, i.e., the non-identically distributed (non-IID) challenge caused by data distribution imbalance related to data labels and data amount. In real-world applications, data are usually described by multiple modalities. However, to the best of our knowledge, only a handful of studies have been proposed to improve the system performance by utilizing multimodal data. In this survey paper, we identify the significance of this emerging research topic – multimodal federated learning (MFL) and perform a literature review on the state-of-art MFL methods. Furthermore, we categorize multi-modal federated learning into congruent and incongruent multimodal federated learning based on whether all clients possess the same modal combinations. We investigate the feasible application tasks and related benchmarks for MFL. Lastly, we summarize the promising directions and fundamental challenges in this field for future research.

As various services have been generating large scale graphs to represent multiple relationships between objects, studies have been conducted to obtain subgraphs with particular patterns. In this paper, we propose a distributed query processing method to efficiently search a subgraph for a large graph on Spark. To reduce unnecessary processing costs, the search order is determined by filtering scores using the probability distribution. The partitioned queries are searched in parallel in the distributed graph of each slave node according to the search order, and the local search results obtained from each slave node are combined and returned. The query is partitioned in triplets based on the determined search order. The performance of the proposed method is compared with the performance of existing methods to demonstrate its superiority.

Accurate detection and state analysis of traffic flows are essential for effectively reconstructing traffic flows and reducing the risk of severe injury and fatality. For this reason, several studies on resolving traffic problems have proposed the use of crowdsourcing, in which drivers provide real-time traffic information using mobile devices, to monitor traffic conditions. Using data collected via crowdsourcing for traffic event detection has advantages in terms of improved accuracy and reduced time cost in collecting relevant data. In this paper, we propose a technique that employs crowdsourcing to collect traffic-related data and uses these data to detect events that influence traffic. The proposed technique uses various machine-learning methods to more accurately identify events and find accurate location information. Therefore, it is able to resolve problems typically encountered with conventionally provided location information, such as broadly defined locations or inaccurate location information. The proposed technique has advantages in terms of reducing time and cost while increasing accuracy. Its validity and effectiveness were also demonstrated through various performance evaluations.

The Internet of Things technology opens the horizon for a broader scope of intelligent applications in smart cities. However, the massive amount of traffic exchanged among devices may cause security risks, significantly when devices are compromised or vulnerable to cyber-attack. An intrusion detection system is the most powerful tool to detect unauthorized attempts to access smart systems. It identifies malicious and benign traffic by analyzing network traffic. In most cases, only a fraction of network traffic can be considered malicious. As a result, it is difficult for an intrusion detection system to detect attacks at high detection rates while maintaining a low false alarm rate. This work proposes an integrated framework to detect suspicious traffic to address secure data communication in smart cities. This paper presents an approach to developing an intrusion detection system to detect various attack types. It can be done by implementing a Principal Component Analysis method that eliminates redundancy and reduces system dimensionality. Furthermore, the proposed model shows how to improve intrusion detection system performance by implementing an ensemble model.

Life in the modern century is heavily reliant on an enormous amount of electricity consumption as technology has become the most integral part of daily life. In this context, smart grid systems play a pivotal role to maintain the uninterrupted power supply which needs to be monitored in a timely fashion to keep track of the electric consumers’ usage pattern. The smart meter is the one of smart applications of the smart grid that collects huge amounts of consumer load data on a daily basis which has become a focus for various researchers and analyzers to study load characterization. In this paper, an approach has been proposed to recognize the energy consumption patterns among diverse types of consumers ranging from residential to industrial levels. This approach is worth considering not only for load pattern recognition but also for involving customers in different events such as demand response or peak shaving. In such a way, this analytical mechanism certainly assists in reducing power wastage and saving costs. The proposed methodology is based on a two-fold clustering algorithm with the use of state-of-the-art technology, machine learning. The primary goal is to classify electric customers' data collected from smart meters. Then, analyzing the classified results with an aim to predict power consumption patterns for the customers in the future and making the right energy policy that will benefit both the grid operator and consumers as well.

Patient value is an important factor in clinical decision-making, but conventionally, it is not incorporated in the decision processes. In this paper, a value-based therapy recommendation comprehensive model is proposed. A literature analysis is conducted to collect value-based evidence. Categorized values and candidate therapies are used in combination as filtering keywords to build this evidence. Then a formalism model is put forward to integrate the value-based evidence with clinical evidence. The relative importance of two evidence can be adjusted dynamically by decision-makers during the decision-making processes. A prototype system was implemented using a case study for breast cancer and validated for feasibility and effectiveness.

With the abundance of conversations happening everywhere, dialogue summarization plays an increasingly important role in the real world. However, dialogues inevitably involve lots of personal pronouns, which hinder the performance of existing dialogue summarization models. This work proposes a framework named WHORU to inject external personal pronoun resolution (PPR) information into abstractive dialogue summarization models. To reduce time and space consumption, we further propose a simple and effective PPR method for the dialogue domain. Experiments demonstrated the superiority of the proposed methods. More importantly, we achieve new SOTA results on SAMSum and AMI datasets.

Antifragility, a concept pioneered by Nassim Nicholas Taleb, has undergone significant development over the past decades. In his work, Taleb describes antifragility as the opposite of fragility—a system that not only withstands stress and volatility but actually thrives and improves as a result. However, many existing systems, including those in Information Technology (IT) and complex economic models, tend to fail under stress. This paper aims to explore the potential implementation of antifragility principles into software architecture. By embracing the concept of an- tifragility, software systems could be designed to not only withstand stressors but also harness them to enhance their robustness and performance. The authors recognize that traditional approaches to software architecture often focus on minimizing failure points and ensuring stability. While these approaches are valuable, they often neglect the dynamic nature of real-world systems and fail to adapt to unforeseen challenges. The paper proposes an alternative perspective that considers stress as an opportunity for improvement. By introducing antifragile elements into software architec- ture, such as decentralized decision-making, self-healing mechanisms, and adaptive resource allocation, the authors argue that software systems can become more resilient, responsive, and capable of capitalizing on stress-induced dis- ruptions. To validate their ideas, the authors present case studies and practical examples of how antifragile software architectures could operate in various domains. They also discuss potential challenges and trade-offs associated with implementing antifragility, such as increased complexity and resource requirements. By shedding light on the possi- bility of embracing antifragility in software architecture, this paper seeks to inspire further research and innovation in creating more adaptive and robust software systems that thrive in the face of stress and uncertainty.

This report discusses the application of approximate dynamic programming (ADP) and Krylov subspace methods in solving sequential decision-making problems in machine learning. ADP is used when dealing with large state spaces or when the exact dynamics are unknown. The paper explores various ADP methods such as temporal difference learning and least-squares policy evaluation. The authors also focus on the use of Krylov subspace methods for solving the Bellman equation in ADP. The report provides insights into linear approximation, stochastic algorithms, and the Arnoldi algorithm for orthonormal basis. Overall, the paper highlights the theoretical foundation provided by ADP and its connection with Krylov subspace methods, shedding light on their application in computer science.

Low-Level Virtual Machine (LLVM) compiler infrastructure is a useful tool for building Just-in-time (JIT) compilers, besides its reliable front-end represented by clang compiler and its elaborated middle-end containing different optimizations that improve the runtime performance. This paper addresses specifically the part of building a JIT compiler using LLVM with the scope of getting the hardware architecture details of the underlying machine such as the number of cores and the number of logical cores per processing unit and providing them to NUMA-BTLP static thread classification algorithm and to NUMA-BTDM static thread mapping algorithm. Afterwards, the hardware-aware algorithms are run by the JIT compiler within an optimization pass. JIT compiler in this paper is designed to run on a parallel C/C++ application (which creates threads using Pthreads), before the first time the application is executed on a machine. To do that, the JIT compiler takes the native code of the application, gets the corresponding LLVM IR (Intermediate Representation) for the native code and executes the hardware-aware thread classification and the thread mapping algorithms on the IR. The NUMA-Balanced Task and Loop Parallelism (NUMA-BTLP) and NUMA-Balanced Thread and Data Mapping (NUMA-BTDM) are expected to optimize the energy consumption up to 15%, on NUMA systems.

Algorithms for machine learning have found extensive use in numerous fields and applications. One important aspect of effectively utilizing these algorithms is tuning the hyperparameters to match the specific task at hand. The selection and configuration of hyperparameters directly impact the performance of machine learning models. Achieving optimal hyperparameter settings often requires a deep understanding of the underlying models and the appropriate optimization techniques. While there are many automatic optimization techniques available, each with its own advantages and disadvantages, this article focuses on hyperparameter optimization for well-known machine learning models. It explores cutting-edge optimization methods and provides guidance on applying them to different machine learning algorithms. The article also presents real-world applications of hyperparameter optimization by conducting tests on spatial data collections for landslide susceptibility mapping. Based on the experiment's results, both Bayesian optimization and metaheuristic algorithms showed promising performance compared to baseline algorithms. For example, the metaheuristic algorithm improved the overall accuracy of the random forest model. Additionally, Bayesian algorithms, such as Gaussian processes, performed well for models like KNN and SVM. The paper thoroughly discusses the reasons behind the efficiency of these algorithms. By successfully identifying appropriate hyperparameter configurations, this research paper aims to assist researchers, spatial data analysts, and industrial users in developing machine learning models more effectively. The findings and insights provided in this paper can contribute to enhancing the performance and applicability of machine learning algorithms in various domains.

The recent COVID-19 pandemic has showcased the implications of using virtual private networks (VPNs) as home-working is now common. Establishing the current state of knowledge on VPNs and their processes is vital. This corroborates an up to date understanding on the fundamentals of VPNs and their usage in today’s society; it informs on how to better use VPNs too. Insight into the security issues VPNs face and possible solutions to these allows for the identification of gaps for potential future research. Addressing these gaps would then indicate how to further improve VPNs, making sure VPNs are indeed beneficial to users.

The need for cohesive detection and defence methods against cyberattacks is significant now more than ever before to enforce security and privacy of user data and information. The inevitable increase in demand for home and flexible working from employees quite recently has meant there is a lack of awareness and training for cyberattacks. Hence, they have become prominent as attackers are aware of this and are benefitting from individuals’ lack of knowledge in how to better protect themselves and their confidential information. Employees are becoming more susceptible to such attacks and falling victim to these, resulting in economic losses for companies, data losses and decreased faith.

Forensic document examiners can determine the authenticity of questioned documents by analyzing the ink used to create them. If an ink mismatch is found, it could be a sign of scam, backdating, or forgery. In this research a Hyperspectral Images of iVision HHID dataset is used to detect number of possible inks used in document. By using Hyperspectral Images, it’s possible to detect ink mismatch in a given document. In this research unsupervised learning method K-means is used to detect number of inks. Approximate number of clusters are determined by Elbow and Silhouette method before implementation of K-means.

A blockchain-based continuous micropayment is a crucial component of the digital economy as it facilitates transactions and promotes small purchases. However, due to the throughput limitations of blockchain, payment channels (PC) are often used to process a large volume of transactions through an off-chain mode. Nevertheless, the introduction of PC requires a trusted third party to ensure transaction security, which creates an additional security assumption since only the first and last transactions can be witnessed by other system users. To address this issue, we propose a novel micropayment scheme based on lockable signatures. All transactions in the PC form a continuous microtransaction hash-chain (CMHC) to prevent malicious users from obtaining transaction information during the process. Furthermore, all locks in the CMHC are invisible during the entire transaction process, and all information is transferred in a tamper-resistant manner. We provide corresponding security analysis and conduct a series of evaluations. The results show that the proposed scheme performs better than the state-of-the-art solutions in terms of transaction time and verification costs. This lockable signature-based micropayment scheme not only guarantees security but also improves transaction speed and efficiency, thereby promoting the development of the digital economy.

This paper intends to discuss SSLs, how they work, their advantages and drawbacks. It will end with the author’s thoughts on the efficacy of the system and whether it is a viable solution for the majority of network security problems or if those drawbacks prevent that.

Power and energy efficiency are among the most crucial requirements in high-performance and other computing platforms. This work examines through extensive experimentation methods and procedures suitable for assessing the power and energy efficiency of fundamental hardware building blocks inside a typical high-performance CPU, focusing on the dynamic branch predictor (DBP). The investigation relies on the Running Average Power Limit (RAPL) interface from Intel, a software tool for credibly reporting the power and energy based on instrumentation inside the CPU. We use well-known microbenchmarks under various run conditions to explore potential pitfalls and to develop precautions to raise the precision of the measurements obtained from RAPL for more reliable power estimation. The authors discuss the factors that affect measurements and share the difficulties encountered and the lessons learned.

Hand gestures are an essential part of human-to-human communication and interaction, and therefore for technical applications, the aim is increasingly to achieve interaction between humans and computers that is as natural as possible, for example by means of natural language or hand gestures. In the context of human-machine interaction research, these methods are consequently being explored more and more. However, the realization of natural communication between humans and computers is a major challenge. In the field of hand gesture recognition, research approaches are being pursued that use additional hardware such as special gloves to classify gestures with high accuracy. Recently, deep learning techniques using artificial neural networks have been increasingly proposed for the problem of gesture recognition without using such tools. In this context, in our approach convolutional neural network (CNN) will be explored in detail for the task of hand gesture recognition. CNN is a deep neural network that can be used in the field of visual object processing and classification. The goal of this work is to recognize ten types of static hand gestures in front of complex backgrounds and different hand sizes based on raw images without the use of extra hardware. We achieved good results with a CNN network architecture consisting of seven layers. Through data augmentation and skin segmentation, a significant increase of the model accuracy was achieved. On public benchmarks the ten gestures have been classified almost perfectly with a testing accuracy of 96.5%

With the increase of intelligent voice phishing and the increasing reliance on open banking systems, there has been a rise in cases where individuals' personal information has been exposed, resulting in significant financial losses for the victims. Non-face-to-face transactions in the financial sector face challenges such as customer identification, ensuring transaction integrity, and preventing transaction rejection. Blockchain-based distributed ledgers have been proposed as a solution, but their adoption is limited due to the difficulty of managing private keys and the burden of gas fees management. This paper proposes a non-face-to-face P2P real-time token payment system that minimizes the risk of key loss by storing private keys in a keystore file and database through a server-based key management module. The proposed system simplifies token creation and management through a server-based token management module and implements an automatic gas charging function for smooth token transactions. Transaction integrity and non-repudiation are ensured through a transaction confirmation module that uses transaction IDs without exposing personal information. Furthermore, advanced security measures such as blocking foreign IP access and DDoS defense are implemented to securely protect user data. The proposed system aims to provide a convenient, secure, and accessible online payment solution to the public by implementing a self-authentication function using a web application that is not limited to smart phones or application platforms.

Several studies have shown that the traditional way of learning is not optimal when we aim to improve ICT users’ actual privacy behavior. In this research, we present a literature review of the theories that are followed in other fields to modify human behavior. Our findings show that the cognitive theory and the health belief model present optimistic results. Further, we examine various learning methods and we conclude that experiential learning is advantageous compared to other methods. In this paper aggregate the privacy behavior determinant factors found in the literature and we use the cognitive theory to we synthesize a theoretical framework. The proposed framework can be beneficial to educational policy makers and practitioners, such as public and private schools, and universities. Also, our framework provides a fertile ground for more research on experiential privacy learning and privacy behavior enhancement.

Data-Flow and Higher-Order Mutation are white-box testing techniques. To our knowledge, no work has been proposed to compare data flow and higher-order mutation. This paper compares all def-uses data-flow and second-order mutation criteria. This compassion investigates the subsumption relation between these two criteria and evaluates the effectiveness of test data developed for each. To compare the two criteria, a set of test data satisfying each criterion is generated, which is used to explore whether one criterion subsumes the other criterion and assess the effectiveness of the test set that was developed for one methodology in terms of the other. The results showed that the mean mutation coverage ratio of the all du-pairs adequate test cover is 80.9%, and the mean data flow coverage ratio of the 2nd-order mutant adequate test cover is 98.7%. Consequently, 2nd-order mutation “ProbSubsumes” the all du-pairs data flow. The failure detection efficiency of the mutation (98%) is significantly better than the failure detection efficiency of data flow (86%). Consequently, 2nd-order mutation testing is “ProbBetter” than all du-pairs data flow testing. In contrast, the size of the test suite of 2nd-order mutation is more significant than the size of the test suite of all du-pairs.

This study delves into the essential characteristics of the Metaverse and its impact on the real world. The Metaverse, a parallel universe composed of countless 3D virtual worlds, has become a hot topic in technology. With the development of advanced technologies such as Virtual Reality (VR), Augmented Reality (AR), blockchain, and Artificial Intelligence, the Metaverse is gradually changing people's lifestyles and work methods, expanding the boundaries of the digital economy. This study profoundly investigates the attributes of the Metaverse, such as asset digitization, application scenario-based, scope economy, industry universality, integrated innovation, and the platform ecosystem. Additionally, we propose a theoretical framework to aid in understanding and shaping this emerging field. We conducted a thorough study and analysis of a specific case, explored the key features of the Metaverse, unveiled the profound impact of Metaverse characteristics on social and economic development, and verified our theoretical framework with this case. This research provides new perspectives and methods for academic studies and offers robust support and guidance for practical applications and decision-making.

A medical entity (hospital, nursing home, rest home, revalidation center, etc.) usually includes a multitude of information systems that allow for quick decision-making close to the medical sensors. The Internet of Medical Things (IoMT) is an area of IoT that generates a lot of data of different natures (radio, CT scan, medical reports, medical sensor data). However, these systems need to share and exchange medical information in a seamless, timely, and efficient manner with systems that are either located within the same entity or located in other healthcare entities. The lack of inter and intra entity interoperability causes major problems in the analysis of patient records and leads to additional financial costs (e.g., redone examinations). In order to develop a medical data interoperability architecture model that will allow providers and different actors in the medical community to exchange patient summary information with other caregivers and partners in order to improve the quality of care, the level of data security, and the efficiency of care, we take stock of the state of knowledge.

In this paper we exploit concepts from Information Theory to improve the classical Chvatal’s greedy algorithm for the Set Covering Problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the computation of a “surprisal” measure when selecting the solution columns. Computational experiments, performed on instances from the OR-Library, show that SBH yields a 2.5% improvement in terms of the objective function value over the Chvatal’s algorithm while retaining similar execution times, making it suitable for real-time applications. The new heuristic was also compared with Kordalewski’s greedy algorithm, obtaining similar solutions with much lower times on large instances, and Grossmann and Wool’s algorithm for unicost instances, where SBH obtained better solutions.

To assist Java programming learning of novice students, we have developed the web-based Java programming learning assistant system (JPLAS). JPLAS provides several types of exercise problems to cultivate code reading/writing skills at various levels. In JPLAS, the code writing problem (CWP) asks a student to write a source code that will pass the test code given in the assignment where the correctness is verified by running them on JUnit. In this paper, to reduce the teacher load at marking process, we present the answer code validation program that verifies all the source codes from a lot of students for each assignment at a time and reports the number of passing tests for each source code in the CSV file. Besides, to test a source code with various input data, we implement the test data generation algorithm that identifies the data type, generates a new data, and replaces it for each test data in the test code. Furthermore, to verify the correctness of the implemented procedure in the source code, we introduce the intermediate state testing in the test code. For evaluations, we applied the proposal to source codes and test codes in a Java programming course in Okayama university, Japan, and confirmed the validity and effectiveness.

Transformers are increasing replacing older generation of deep neural networks due to their success in a wide range of application. The dominant approach of using transformers is to pre-train them on a large training dataset and then fine-tune them on a downstream task. However, as transformers becoming larger, the fine-tuning approach is become an infeasible approach for transfer learning. In this short survey, we list a few recent methods that makes using transformers based on transfer learning more efficient.

significant security threats to Ransomware attacks provide serious security hazards to personal and corporate data and information. The owners of computer-based resources suffer serious verification and privacy violations, monetary losses, and reputational damage due to a successful ransomware assault. As a result, it is reported critically, accurately, and swiftly identifying ransomware. Numerous methods have been proposed for ransomware, each with pros and cons. The main objective of this study is to discuss current trends and potential future debates on automated ransomware detection. The document includes an overview of ransomware, a timeline of assaults, and details on their background. It also provides a comprehensive study of existing methods for identifying, avoiding, minimizing, and recovering from ransomware. An analysis of studies between 2017 and 2022 is another advantage of the study. This provides readers with up-to-date knowledge of the most recent developments in ransomware detection. It also highlights advancements in methods for combating ransomware attacks. In conclusion, this study highlights unanswered concerns and potential research challenges in ransomware detection.

The Internet of Things (IoT) generates a large volume of data whenever devices are interconnected and exchange data across a network. As a result, there is a range of services with varying needs, for example, capacity requirements, data quality, and latency demands. These services operate on fog computing devices, which are limited in power and bandwidth compared to the cloud. The main challenge is deciding where to implement services on the fog, the cloud, or the hybrid. This paper proposes an efficient allocation technique that pushes processing closer to the network's fog side. It investigates which devices and services may best allocate while preserving resource usage in the IoT architecture. It also examines the importance of allocating services to devices and optimizing resource use in fog computing. In IoT settings, there is a wide range of services and devices; thus, it is critical to effectively assign the services to the devices. We propose Priority-based Service allocation (PSA) and Sort-based Service Allocation (SSA) techniques, which are used to enable an optimum order to employ devices to perform the various services. The experimental results indicate that our proposed technique minimize the data communication over the network by 82% by allocating most of the services locally in fog. We have maximized the number of distributed services to fog devices by 90% while minimizing the wastage of fog resources.

Software engineering is a comprehensive process that requires developers and team members to collaborate across multiple tasks. In software testing, bug triaging is a tedious and time-consuming process. Assigning bugs to the appropriate developers can save time and maintain their motivation. However, without knowledge about a bug's class, triaging is difficult. Motivated by this challenge, this paper focuses on the problem of assigning the suitable developer to new bug by analyzing the history of developers’ profiles and analyzing history of bugs for all developers using machine learning-based recommender systems. Explainable AI (XAI) is AI that humans can understand. It contrasts with "black box" AI, which even its designers can't explain. By providing appropriate explanations for results, users can better comprehend the underlying insight behind the outcomes, boosting the recommender system's effectiveness, transparency, and confidence. In this paper, we propose two explainable models for recommendation. The first one is an explainable recommender model for personalized developers generated from bug history to know what the preferred type of bug is for each developer. The second model is an explainable recommender model based on bugs to generate the best developer for each bug from bug history.

Chi-squared automatic interaction detector (CHAID) algorithm is considered to be one of the mostly used supervised learning methods as it is adaptable to solving any kind of problem at hand. We have been starkly aware of CHAID maps non-linear relationships quite well, and it can empower predictive models with stability. But we don’t know how high its accuracy is precisely. To find out the perfect scope CHAID algorithm fits into, this paper presents the analysis of the accuracy of the CHAID algorithm. We introduce the causes, applicable conditions and application scope of CHAID algorithm at first, and then highlight the difference of branching principal between the CHAID algorithm and several other common decision tree algorithms, which is our first step towards basic analysis on CHAID algorithm. We next employee an actual branching case to help us understand CHAID algorithm better. Specifically, we use vehicle customer satisfaction data to compare multiple decision tree algorithms, and cite some factors that affecting the accuracy and some corresponding countermeasures which are more conducive to us to obtain accurate results. The results show that CHAID can analyze the data very well, and detect the significantly correlated factors surely. In this paper, we learn the clear information required to understand CHAID algorithm, thereby make better choices when we need to use decision tree algorithms.

Structured extraction of emergency event information can effectively enhance the ability to re-spond to emergency events. This article focuses on the extraction of Chinese document-level emergency events, which mainly faces two key issues in this field: first, related datasets; Secondly, existing DEE (document-level event extraction) studies mostly use sequence annotation to extract candidate entities in the subtask of candidate entity extraction without considering the problem of role overlapping between candidate entities. On the one hand, this article constructs a Chinese document-level emergency extraction dataset, CDEEE, which first annotates the issues of argu-ment scattering, multiple events, and role overlapping. On the other hand, this article proposes a model RODEE for the problem of role overlapping in DEE tasks. This model first uses two in-dependent modules to represent the head and tail positions of candidate entities, then uses a multiplication attention mechanism to interact with the two to obtain a scoring matrix. Finally, role-overlapping candidate entities are predicted to assist in completing DEE tasks. Experiments were conducted on our manually annotated dataset, CDEEE, and the results showed that RODEE can effectively solve the problem of role overlapping in candidate entities and improve the performance of the DEE model.

Reinforcement learning is used for air combat problems in recent years, and the idea of curriculum learning is often used for reinforcement learning, but traditional curriculum learning suffers from the problem of plasticity loss in neural networks. Plasticity loss is the difficulty of learning new knowledge after the network has converged. To this end, we propose a motivational curriculum learning distributed proximal policy optimization (MCLDPPO) algorithm, through which agents trained can significantly outperform the predictive game tree and mainstream reinforcement learning methods. The motivational curriculum learning is to help the agent gradually improve their combat ability by observing the agent's unsatisfactory performance and providing corresponding rewards as a guide. Additionally, a complete tactical maneuver is encapsulated based on existing air combat knowledge, and through the flexible use of these maneuvers, some tactics beyond human knowledge can be realized. In addition, we designed an interruption mechanism for the agent to increase the frequency of decision-making when the agent faces an emergency. When the number of threats the agent receives changes, the current action will be interrupted to reacquire observations and make decisions again. Using the interruption mechanism can significantly improve the ability of the agent. To simulate actual air combat better, we built an air combat environment based on digital twin technology to create an air combat engine core such as missiles and radars. Based on this environment, we develop a distributed intelligent training system that employs Redis as the cache and obtains the data generated in the distributed environment through a multi-threaded TCP/IP protocol, which significantly increases the training data throughput and helps the agent accelerates convergence. The experimental results demonstrate that the agent can fully exploit the situational information to make reasonable decisions and affords air combat tactical adaption, verifying the effectiveness of the algorithmic framework proposed in this paper.

With the spread of compulsory education emerged school management problems continued, and the quality of school management in compulsory education has attracted a great deal of attention in China. However, the application of information technology in the field is not yet detailed and wide, resulting in problems of heavy workload and high difficulty in the whole evaluation process. Accordingly, we use big data technologies such as Apache Spark, Apache Hive, and SPSS to carry out data cleaning, correlation analysis, dynamic factor analysis, principal component analysis, and visual display on 1760 sample data from 40 primary and secondary schools in Q Province in China, and constructs a model school management of quality evaluation in the compulsory education stage, which reduces the 22 management tasks required for previous evaluation to 5, greatly reducing the workload and difficulty of evaluation. It has improved the efficiency and accuracy of evaluation, and further promoted the simultaneous development of education of five domains and education equity in the compulsory education stage.

Physics-informed machine learning (PIML) refers to the emerging area of extracting physically relevant solutions to complex multiscale modeling problems and has enjoyed significant interest from the research community. This paper discusses the recent critical advancements in the PIML domain. Novel methods and applications of domain decomposition in physics-informed neural networks (PINN) in particular are highlighted. Additionally, we explore recent Works toward utilizing neural operator learning to intuit relationships in physics systems traditionally modeled by sets of complex governing equations and solved with expensive differentiation techniques. Finally, expansive applications of traditional physics-informed machine learning and potential limitations are discussed. In addition to summarizing recent work, we propose a novel taxonomic structure to catalog physics-informed machine learning based on how the physics-information is derived and injected into the machine learning process. The taxonomy assumes the explicit objectives of facilitating interdisciplinary collaboration in methodology, thereby promoting a wider characterization of what types of physics-problems are served by the physics-informed learning machines, and assisting in identifying apt targets for future work. To summarize, the major twofold goal of this work is to summarize recent advancements and introduce a taxonomic catalog for applications of physics-informed machine learning.

With the recent advances in science and technology, more processing capability and data have become available, allowing a more straightforward implementation of data analysis techniques. Fortunately, the available online data storage capacity follows this trend, and vast amounts of data can be stored online freely or at accessible costs. As happens with every evolution (or revolution) in any science field, organizing and sharing this data is essential to contribute to new studies or validate the obtained results quickly. To facilitate this, we must guarantee interoperability between the existing datasets and the developed software, whether commercial or open source. This article explores this issue, analyzing the current initiatives to establish data standards and comparing some of the existing dataset online storage platforms. Through a Strengths, Weaknesses, Opportunities, and Threats (SWOT) analysis, it is possible to understand better the strategy that should be taken to improve the efficiency in this field, which directly depends on the data characteristics.

Expressive clinical terminologies are of utmost importance for achieving an semantically interoperable data exchange and reuse in healthcare. SNOMED CT, widely respected as the most comprehensive terminology in medicine, provides formal concept definitions based on description logic which not only allows for advanced querying of SNOMED CT-coded data but also for flexibly augmenting its 350,000 concepts. This ability for postcoordination largely increases the expressivity of the terminology but correlates with an intrinsic complexity. Complicated by the current lack of tooling support, postcoordination is widely either ignored or applied in an error-prone way. To help facilitate the adoption of postcoordination, we implemented a web application that guides through the creation of Postcoordinated expressions (PCEs) while ensuring the adherence to syntactic and semantic constraints. Our approach was largely facilitated by making use of the extensive SNOMED CT specifications as well as advanced HL7 FHIR Terminology Services. Qualitative evaluations confirmed the usability of the developed application and the correctness of PCEs created with it.

With the rise of Internet of Things (IoT) devices and Cyber-Physical Systems, the demand for more functional and high-quality software has increased tremendously. To meet this need, we must reengineer and reuse existing software, as well as develop new software formal verification methods. One such method is based on physical quantities defined by the System International, which have physical dimensions. The homogeneity of physical dimensions in software code enables us to check the software code in the space of base units, making it the first basis of the new software verification method. However, this method cannot check expressions with angles, angle speed, and other similar features. To address this, a transformation for physical value orientation introduced by Siano allows us to check software code for orientational, stabilization, and other related branches. This makes the orientational homogeneity the second basis of the new software verification method. To assess the effectiveness of the proposed method, we developed special software defect models based on the statistical characteristics of software code. We used a special statistical analysis tool to define the statistical characteristics of modern software and analyzed over 2 GB of C++ GITHUB code for drones. Based on the actual distribution of software characteristics, the proposed method can detect over 60% of latent software defects. Implementing this method can significantly reduce testing time, improve reliability, and enhance overall software quality.

Studying concurrent systems is to sort the read/write and control events in the concurrent system according to the order, or in partial order, or in strict order. Because of the concurrency of events and the timeliness of writing events, there will be overlap between events, which requires interval order analysis. A single start and end sequence to represent the entire hierarchical order structure as well as all equivalent spaced order observations.a single sequence of beginnings and endings to represent the entire stratified order structures as well as all equivalent interval order observations. Mazurkiewicz traces and Comtracks are hierarchical traces, but they cannot describe interval traces. In a few sentences of this summary, we can tell the problems (petri interval traces with data), the previous work (Mazurkiewicz traces, Comtracks), the reasons that cannot be solved, and our own solutions (DPN: Petri nets with data, interval traces). This paper focuses on a BE (Beginnings and Endings) sequence representing an equivalent class of runs, or targets. Our goal is to have a BE sequence to represent the entire hierarchical order structure, that is, all equivalent observable interval orders.

Safe, high-quality and economical electric energy transportation is the basic requirements of modern power system operation. Transformer, as one of the core equipment of power system and national grid system, has the characteristics of diverse types, variable models and wide deployment. It is the basic equipment for power system to realize voltage change and electric energy distribution. Because the power system transformer needs to operate with load for a long time, the probability of failure is usually higher than that of other power equipment in general. This paper starts from the transformer fault and fault diagnosis. Firstly, the transformer fault types, traditional transformer fault diagnosis techniques and the advantages of machine learning in transformer fault diagnosis are reviewed. Secondly, the application of information system theory and information entropy in transformer fault diagnosis is introduced. Then it introduces machine learning technology, feature selection and extraction technology in transformer fault diagnosis, and machine learning algorithms such as support vector machine and extreme learning machine for transformer fault diagnosis. Finally, the potential development trend of information system theory, information entropy and machine learning in transformer fault diagnosis is forecasted. The combination of transformer fault prediction and machine learning algorithm is helpful for power system maintenance personnel to accurately predict the running state of power equipment, and also provides a new method and technology for the safe and reliable operation and regular maintenance of power system.

Threshing device is the core component of grain combine harvester, and its working performance determines the working quality and production efficiency of the harvester to a great extent. The straw guide plate plays an important role in the threshing device to dredge the threshing matter and control the threshing time of the combine harvester matter in the threshing chamber. In the past, the guiding structure of threshing device could not optimize the working performance of the machine by adjusting the spiral angle, that is, most cereal combine harvester may not be fed smoothly or even clogged when operating under different crop types, yield differences and operating environments, a kind of threshing device with adjustable guide straw board was studied. In this study, the movement model of the straw on the straw guide plate was analyzed, and it was found that the spiral angle “α”of the straw guide was 0<α<58°.Three-factor and three-level response surface method was used to carry out field experiment on drum speed, working speed and guide grass plate spiral angle, and the experimental data were analyzed by quadratic polynomial regression.The results show that the drum speed, working speed and the spiral angle of the guide grass plate have significant effects on the loss rate (PLR) , impurity content (PIR) and breakage rate (PBR) , the drum speed and working speed have an interactive effect on the impurity ratio (PIR) , and the working speed and the helical angle of the guide grass plate have an interactive effect on the loss ratio (PLR) and breakage ratio (PBR) , there is an interaction between the rotary speed of the roller and the helical angle of the guide grass plate on the crushing rate (PBR) .Further optimization analysis showed that the predicted value was PLR = 1.18% , PIR = 0.72% , PBR = 0.53% , the experimental verification value was PLR = 1.26% , PIR = 0.73% , PBR = 0.61% . The absolute error between the experimental value and the predicted value was very small, however, the optimized field test verified value decreased by 8.31% , 50.04% and 60.30% respectively, which indicated that the optimized harvester had better operation quality, in particular, PIR, PBR and other two indicators have a greater increase in the effect.

The research proposes a self-directed paradigm with self-design using the existing technology with LMS modules, discussions, and self-tests. The research establishes its criteria for assurance of teaching and learning known as 7x2C for the compliance of content, and appearance along with other criteria for the analysis. The above technology of web and LMS is tested for a business course that is technology-oriented in creating an experiential learning system for Covid-19 awareness. Similarly, among other ideas, an environment for educating learners about diabetes and obesity has been designed. The project is known as Sunchoke with its theme of Grow, Eat, and Heal. The educators can use their technology and apply self-directed pedagogy to transform this approach to their customized ways by using their content and rubrics.

Semi-structured complex numbers H was a number set developed to enable division by zero in ordinary algebraic equations. Its utility has been shown in mathematics and engineering. However, very little has been done to show its usefulness in computer science. Consequently, the aim of this paper was to show the utility of semi-structured complex numbers in computer science by developing a division by zero calculator. First two computer programs were written, one for a standard (STD) calculator and the other for a division by zero (DBZ) calculator. The programs were fed 20000 randomly generated arithmetic equations of varying lengths and the space and time complexity associated with processing these equations were measured and compared to determine the efficiency of each calculator. In the process, three major contributions were made: (1) A representation for semi-structured complex numbers that enables it to be easily used by a computer was developed; (2) It was demonstrated that the DBZ calculator outperforms the STD calculator in terms of efficiency; and, (3) It was shown that the number set H reduced the amount of error handling required to run a computer program. These results provide a firm foundation to advance the number set as a useful tool in computer science.

Computer extended Descriptive Geometry (CeDG) is a new approach to solve and build computer models of three dimensional (3D) geometrical systems through descriptive geometry procedures that have demonstrated reliability and accuracy. CeDG may calculate a parametric algebraic exact form for the spatial curves generated in the intersection of two surfaces, as well as of the flattened pattern of any developable surface involved in those encounters. This study presents first the theoretical foundations and methodology to calculate those parametric algebraic curves. Secondly, a compound hopper is defined and modelled through CeDG (implemented in GeoGebra) and CAD (Solid Edge 2023) approaches to evaluate the advantages of CeDG against CAD. The results demonstrate the robustness and accuracy of the CeDG technique for surfaces intersection and flattening and the advantages of CeDG against Solid Edge 2023 in solving the hopper case study.

Peptides are promising drug development frameworks thanks to their high target selectivity, tolerability and relatively low production cost. However, despite the fact that several thousand potentially therapeutic peptides reported, only sixty have arrived at the market. This concerning low proportion is partially explained by undesired properties such as peptide-induced hemolytic activity. Hence, we aim to get a better insight into the chemical space of hemolytic peptides using a novel approach based on network science and interactive data mining as an alternative to design more effective peptide drugs with low hemolytic activity. Metadata networks (METNs) were used to characterize and find general patterns associated to hemolytic peptides, whereas Half-Space Proximal Networks (HSPNs), created using five different two-way dissimilarity measures, represented the hemolytic peptide space. Then, using the best candidate HSPNs, we extracted various scaffolds that capture information of almost all the chemical space but avoiding peptide overrepresentation. Such scaffolds can have many applications, such as training accurate ML-based prediction models, constructing one-class multi-query similarity searching models and characterizing the diversity of hemolytic peptides using a manageable set of peptides. Finally, by means of an alignment-free approach, we reported 47 putative hemolytic motifs, which might provide hints about the mechanisms of hemolysis and can also be used as toxic signatures when developing novel peptide-based drugs.

While modeling data in reality, uncertainties in both data (aleatoric) and model (epistemic) are not necessarily Gaussian. The uncertainties could appear with multimodality or any other particular forms which need to be captured. Gaussian mixture models (GMMs) are powerful tools that allow us to capture those features from a unknown density with a peculiar shape. Inspired by Fourier expansion, we propose a GMM model structure to decompose arbitrary unknown densities and prove the property of convergence. A simple learning method is introduced to learn GMMs through sampled datasets. We applied GMMs as well as our learning method to two classic neural network applications. The first one is learning encoder output of autoencoder as GMMs for handwritten digits images generation. The another one is learning gram matrices as GMMs for style-transfer algorithm. Comparing with the classic Expectation maximization (EM) algorithm, our method does not involve complex formulations and is capable of achieving applicable accuracy.

In the fast-paced internet world that we live in today, internet technologies and tools that enable us to connect online are rapidly changing and improving. To adapt to the changing environment, many game developers are changing their business models to adjust to this online environment by developing games that are centred around online gaming. As such, the internet demands of consumers such as gamers are increasing because of the need for quality internet connection for optimal gameplay. There are too many factors that can affect online gameplay. Moreover, not all gamers are equipped with the network knowledge and skills to diagnose and troubleshoot any internet issues that may arise during their gameplay session. The main contribution of this research was to gather insights from Malaysian broadband internet consumers, mainly from gamers and general users regarding their opinions of their ISP service experience in gaming, general use and service quality. A 1-click solution is presented as a smart autonomous network monitoring tool that can autonomously monitor, diagnose, and troubleshoot network problems with minimal input from the user. This research was conducted using a mixed-mode research methodology where the participants were asked to fill up a questionnaire regarding the user experience of their Internet Service Provider (ISP), and their perception of the 1 click-automated networking tool for their personal use. It is shown that there is a market demand for a 1 click-automated networking tool as gamers and general users both agree that such a tool would be beneficial to them by improving the internet quality of a network.

The number and size of computational models in biology have drastically increased over the past years and continue to grow. Modeled networks are becoming more complex, and reconstructing them from the beginning in an exchangeable and reproducible manner is challenging. Using precisely defined ontologies enables the encoding of field-specific knowledge and the association of disparate data types. In computational modeling, the medium for representing domain knowledge is the set of orthogonal structured controlled vocabularies named Systems Biology Ontology ( SBO). The SBO terms enable modelers to explicitly define and unambiguously describe model entities, including their roles and characteristics. Here, we present the first standalone tool that automatically assigns SBO terms to multiple entities of a given SBML model, named the SBOannotator. The main focus lies on the reactions, as the correct assignment of precise SBO annotations requires their extensive classification. Our implementation does not consider only top-level terms but examines the functionality of the underlying enzymes to allocate precise and highly specific ontology terms to biochemical reactions. Transport reactions are examined separately and are classified based on the mechanism of molecule transport. Pseudo-reactions that serve modeling purposes are given reasonable terms to distinguish between biomass production and the import or export of metabolites. Finally, other model entities, such as metabolites and genes, are annotated with appropriate terms. Including SBO annotations in the models will enhance the reproducibility, usability, and analysis of biochemical networks. Availability: The open-source project SBOannotator is freely available under the terms of LGPL version 3.0 from https://github.com/draeger-lab/SBOannotator/.

Deepfakes are manipulated or altered images, or video, that are created using deep learning models with high levels of photorealism. The two popular methods of producing a deepfake are based on either convolutional neural networks (CNN), or autoencoders. Deepfakes created using CNN comparatively show higher qualities of realism, yet oftentimes leave artifacts and distortions in the generated media that can be detected using machine learning and deep learning algorithms. In recent years, there has been an influx of periocular image and video data because of the increase usage of face masks. By wearing masks, much of what is used for facial recognition is hidden, leaving only the periocular region visible to an observer. This loss of vital information leads to easier misidentification of media, allowing deepfakes to less likely be identified as fake. In this work, feature extraction methods, such as Scale-Invariant Feature Transform (SIFT), Histogram of Oriented Gradients (HOG), and CNN, are used to train an ensemble deep learning model to detect deepfakes in videos on a frame-by-frame level based on the periocular region. Our proposed model is able to distinguish original and manipulated images with accuracies around 98.9 percent, which is an improvement to previous works by combining SIFT and HOG for deepfake detection in convolutional neural networks.

The increase in life expectancy, according to the World Health Organization, is a fact, and with it rises the incidence of age-related neurodegenerative diseases. The most recurrent symptoms are those associated with tremors resulting from Parkinson's Disease (PD) or Essential Tremors (ET). The main alternatives for the treatment of these patients are medication and surgical intervention, which sometimes have restrictions and side effects. Through computer simulations in Matlab software, this work investigates the performance of adaptive algorithms based on least mean squares (LMS) to suppress tremors in upper limbs, especially in the hands. The signals resulting from pathological hand tremors, related to PD, present components at frequencies that vary between 3~Hz and 6~Hz, with the more significant energy present in the fundamental and second harmonics, while physiological hand tremors, referred to as ET, vary between 4~Hz and 12~Hz. We simulated and used these signals as reference signals in adaptive algorithms, Filtered-x Least Mean Square (Fx-LMS), Filtered-x Normalized Least Mean Square (Fx-NLMS), and a hybrid Fx-LMS\&NLMS purpose. Our results showed that the vibration control provided by the Fx-LMS\&LMS algorithm is the most suitable for physiological tremors. For pathological tremors, we have used a proposed algorithm with a filtered sinusoidal input signal, Fsinx-LMS, which presented the best results in this specific case.

Requirements are predominantly written in Natural Language (NL), which makes them accessible to stakeholders with varying degrees of experience, as compared to a model-based language which requires special training. However, despite its benefits, NL can introduce ambiguities and inconsistencies in requirements, which may eventually result in system quality degradation and system failure altogether. The system complexity that characterizes current systems warrants an integrated and comprehensive approach to system design and development. This need has brought about a paradigm shift towards Model-Based Systems Engineering (MBSE) approaches to system design and a departure from traditional document-centric methods. While, MBSE shows great promise, the ambiguities and inconsistencies present in NL requirements hinder their conversion to models directly. The field of Natural Language Processing (NLP) has demonstrated great potential in facilitating the conversion of NL requirements into a semi-machine-readable format that enables their standardization and use in a model-based environment. A first step towards standardizing requirements consists of classifying them according to the ``type'' (design, functional, performance, etc.) they represent. To that end, a language model capable of classifying requirements needs to be fine-tuned on labeled aerospace requirements. This paper presents the development of an annotated aerospace requirements corpus and its use to fine-tune BERT$_\text{BASE-UNCASED}$ to obtain aeroBERT-Classifier: a new language model for classifying aerospace requirements into design, functional, or performance requirements. A comparison between aeroBERT-Classifier and bart-large-mnli (zero-shot text classification) showcased the superior performance of aeroBERT-Classifier on classifying aerospace requirements despite being fine-tuned on a small labeled dataset.

Time series data having low signal-to-noise ratio, non-stationarity and non-linearity are commonly seen in high-frequency stock trading, where the objective is to increase the likelihood of profit by taking advantage of tiny discrepancies in prices and trading on them quickly and in huge quantities. For this purpose, it is essential to apply a trading method that is capable of fast and accurate prediction from such time series data. In this paper, we develop an online time series forecasting method for high-frequency trading (HFT) by integrating three neural network deep learning models, i.e., Long Short-Term Memory (LSTM), Gated Recurrent Unit (GRU) and Transformer; and we abbreviate the new method to online LGT or O-LGT. The key innovation underlying our method is its efficient storage management, which enables super-fast computing. Specifically, when computing the forecast for the immediate future time, we use only the output calculated from the previous trading data (rather than the previous trading data themselves) together with the current trading data. Thus, the computing involves updating only the current data into the process. We evaluate the performance of O-LGT by analyzing the high-frequency Limit Order Book (LOB) data from the China market. It shows that our model in most cases achieves similar speed with much higher accuracy than the conventional fast supervised learning models for HFT. However, with a slight sacrifice in accuracy, O-LGT is approximately 40 times faster than the existing high-accuracy neural network models for the LOB data in China market.

Working memory (WM) is a brain system for short-term storage and manipulation of information and plays an important role in complex cognitive tasks. In the synaptic theory of WM memorized elements are stored in the form of short-term potentiated connections in a sample population of neurons. In this paper, we show that such populations can be formed due to the mechanisms of spike-timing-dependent plasticity (STDP) – the phase dependence associated with the ratio of the pulse times of the interacting neurons. We propose a WM model considering two types of plasticity: short-term plasticity and STDP. We have shown formation of neuronal clusters encoding items in the WM model, that can be formed by external stimulation of a group of neurons due to the mechanisms of STDP and hold and reactivated by short-term plasticity mechanisms. The dynamic formation of neuronal clusters instead of pre-formed clusters gives additional flexibility to the model.

This paper extends our seminal paper on KnoBAB for efficient Conformance Checking computations performed on top of a customised relational model. After defining our proposed temporal algebra for temporal queries (xtLTLf ), we show that this can express existing temporal languages over finite and non-empty traces such as LTLf . This paper also proposes a parallelisation strategy for such queries thus reducing conformance checking into an embarrassingly parallel problem leading to super-linear speed up. This paper also presents how a single xtLTLf operator (or even entire sub-expressions) might be efficiently implemented via different algorithms thus paving the way to future algorithmic improvements. Finally, our benchmarks remark that our proposed implementation of xtLTLf (KnoBAB) outperforms state-of-the-art conformance checking software running on LTLf logic, be it data or dateless.