Search

One important reason for the use of field categorization in bibliometrics is the necessity to make citation impact of papers published in different scientific fields comparable with each other. Raw citations are normalized by using field-categorization schemes to achieve comparable citation scores. There are different approaches to field categorization available. They can be broadly classified as intellectual and algorithmic approaches. A paper-based algorithmically constructed classification system (ACCS) was proposed which is based on citation relations. Using a few ACCS field-specific clusters, we investigate the discriminatory power of the ACCS. The micro study focusses on the topic ‘overall water splitting’ and related topics. The first part of the study investigates intellectually whether the ACCS is able to identify papers on overall water splitting reliably and validly. Next, we compare the ACCS with (1) a paper-based intellectual (INSPEC) classification and (2) a journal-based intellectual classification (Web of Science, WoS, subject categories). In the last part of our case study, we compare the average number of citations in selected ACCS clusters (on overall water splitting and related topics) with the average citation count of publications in WoS subject categories related to these clusters. The results of this micro study question the discriminatory power of the ACCS. We recommend larger follow-up studies on broad datasets. [ABSTRACT FROM AUTHOR]

This article explores the application of DNA computing in recyclable waste paper sorting. The primary challenge in paper recycling is to obtain raw materials with the highest purity. In recycling, waste papers are segregated according to their various grades, and these are subjected to different recycling processes. Highly sorted paper streams facilitate high quality end products, while saving on processing chemicals and energy. In the industry, different sensors are used in paper sorting systems, namely, ultrasonic, lignin, gloss, stiffness, infra-red, mid-infra red, and color sensors. Different mechanical and optical paper sorting systems have been developed based on the different sensors. However, due to inadequate throughput and some major drawbacks related to mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. The automated paper sorting systems offer significant advantages over the manual systems in terms of human fatigue, throughput, speed, and accuracy. This research has two objectives: (1) to use a web camera as an image sensor for the vision system in lieu of different sensors; and (2) to develop a new DNA computing algorithm based on the theme of template matching techniques for segregating recyclable waste papers according to paper grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method. This is the main strength of the DNA computing algorithm in actual inspections. The algorithm is implemented by using a silicon-based computer to verify the success rate in paper grade identification. [ABSTRACT FROM AUTHOR]

This article explores the applicability of DNA Computing in recyclable waste paper sorting. The primary challenge in the recycling of paper is to obtain raw material with the highest purity. In recycling, waste papers are segregated into various grades as they are subjected to different recycling processes. Highly sorted paper streams w ill facilitate high quality end product, and save processing chemicals and energy. Due to inadequate throughput and some major drawbacks of mechanical paper sorting systems, the popularity of optical paper sorting systems has increased. Automated paper sorting systems offer significant advantages over manual paper sorting systems in terms of fatigue, throughput, speed, and accuracy. In this research, a new DNA computing algorithm has been designed. It is based on the template matching technique for segregating recyclable waste paper according to its grades. Using the concepts of replication and massive parallelism operations, the DNA computing algorithm can efficiently reduce the computational time of the template matching method for real time inspection. The algorithm is implemented using silicon-based computer to verify the success rate in paper grade identification. [ABSTRACT FROM AUTHOR]

Electrocardiogram (ECG) paper records are used commonly for diagnosing heart abnormalities. The stored ECG paper records are recorded on thermal paper and may face ink evaporation problem over the time. Generally, to overcome this problem ECG paper record is scanned and stored as an image. However, the addition of noise during scanning such as low resolution scan, blurring, folding of paper, nonuniform lighting, orientation etc. can create difficulty in information retrieval. Current work robustly handles various degradation problems encountered in ECG paper scanning using modified k-fill algorithm. The proposed algorithm is tested with 836 ECG paper recordings with different types of degradations like aging effect, folding effect, ink evaporation effect, blurring effect and low resolution effect. We extracted clinically important parameters such as heart rate etc. with accuracy of 97.33% and abnormalities such as bradycardia, tachycardia, and atrial flutter from the ECG paper records using perceptual spectral centroid method. Overall accuracy of our prediction algorithm was found out to be 98.6%. We assume our work would be low cost, preliminary expert mechanism at rural places in the absence of expert cardiologist. [ABSTRACT FROM AUTHOR]

Abstract: Recommendation algorithms have been researched extensively to help people deal with abundance of information. In recent years, the incorporation of multiple relevance criteria has attracted increased interest. Such multi-criteria recommendation approaches are researched as a paradigm for building intelligent systems that can be tailored to multiple interest indicators of end-users – such as combinations of implicit and explicit interest indicators in the form of ratings or ratings on multiple relevance dimensions. Nevertheless, evaluation of these recommendation techniques in the context of real-life applications still remains rather limited. Previous studies dealing with the evaluation of recommender systems have outlined that the performance of such algorithms is often dependent on the dataset – and indicate the importance of carrying out careful testing and parameterization. Especially when looking at large scale datasets, it becomes very difficult to deploy evaluation methods that may help in assessing the effect that different system components have to the overall design. In this paper, we study how layered evaluation can be applied for the case of a multi-criteria recommendation service that we plan to deploy for paper recommendation using the Mendeley dataset. The paper introduces layered evaluation and suggests two experiments that may help assess the components of the envisaged system separately. [Copyright &y& Elsevier]

Abstract: A new approach of paper defect recognition is proposed. To implement this method, computer is used to acquire paper image and the subtraction algorithm is used to determine if the image contains defect at first. For the image with paper defect, wavelet packet decomposition is applied to extracting the feature vector of the defect. A BP neural network is designed for recognizing the defect type according to the feature vector. This approach provides a unified detection algorithm for different types of paper defects. The experiment data prove this method is valid and can be applied in modern paper defect inspection system. [Copyright &y& Elsevier]

Abstract: Combining previous image mosaicing algorithms, this paper puts forward a kind of damaged text restore image processing algorithm. The algorithm can restore the shredder pieces tape. A series of tapes which are obtained by scanner are treated through image processing such as binary, segmentation, denoising and enhancement and so on, Then we can get the ideal original text image from some leaflet tapes image. Experimental results show that such algorithm has certain effectiveness. [Copyright &y& Elsevier]

The large deformation of soft rock tunnel is an important problem to be solved urgently with the development of engineering technology. In order to improve the application effect of prestressed anchor cable adaptive active support system, this paper puts forward an optimization method based on adaptive genetic algorithm, reviews the research status of prestressed anchor support in soft rock tunnel, and analyzes and evaluates the existing methods. This paper introduces the construction process of AGA model, establishes the problem description model and genetic optimization algorithm selection model, and constructs the adaptive active support model of prestressed anchor cable. The model adopts an optimization algorithm with a total of 100 iterations. The Simple Genetic Algorithm and Parallel Genetic Algorithm are selected to evaluate the anchoring force, the control effect of surrounding rock displacement, the erosion of supporting structure and the construction time by comparative test. The test results show that AGA has a good effect on the anchoring force, the minimum anchoring force is 457 kN, and the displacement of surrounding rock is controlled within 1.21-1.59mm, which has a good influence on the quality of supporting structure and the construction completion time. Finally, the application of AGA model in parameter optimization of prestressed anchor cable in soft rock tunnel is summarized, and the future research direction is put forward. [ABSTRACT FROM AUTHOR]

Purpose: This study explores the potential of computational design processes in creating contextually responsive envelopes for high-rise residential buildings in the Middle East. This includes considering both physical constraints and social preferences, with a focus on balancing sunlight exposure, privacy and views. Design/methodology/approach: A two-phase simulation study analyzed various exterior envelope systems in Baghdad high-rise buildings. The first phase examined two commonly used exterior envelopes – fully glazed and window-based – to assess sunlight exposure, privacy and views. In the second phase, a multi-objective optimization process was applied to derive contextually optimized design solutions addressing the challenges identified in the first phase. Findings: The study reveals that contextually optimized design solutions significantly improved direct sunlight exposure and privacy while maintaining satisfactory views. Although fully glazed exterior envelopes provided better-uninterrupted views, the optimized solutions offered more balanced performance across all factors, demonstrating the potential of computational design processes in creating contextually responsive building envelopes. Originality/value: This paper emphasizes the importance of considering both physical and social contexts in the development of algorithms for architecture in the Middle East. This paper supports a progressive interpretation of traditional building references and demonstrates how computational design processes can create contextually responsive building envelopes that satisfy social needs and provide better-performing buildings for inhabitants. [ABSTRACT FROM AUTHOR]

Federated learning is a distributed machine learning framework that solves data security and data island problems faced by artificial intelligence. However, federated learning frameworks are not always secure, and attackers can attack customer privacy information by analyzing parameters in the training process of federated learning models. To solve the problems of data security and availability during federated learning training, this paper proposes an Efficient Differential Privacy Federated Learning Algorithm based on early stopping mechanism (EfficientDP-FL). This method inherits the advantages of differential privacy and federated learning and improves the performance of model training while protecting the parameter information uploaded by the client during the training process. Specifically, in the federated learning framework, this article uses an adaptive DP-FL method for gradient descent training, which makes the model converge faster than traditional stochastic gradient descent. In addition, due to model convergence, noise should be reduced accordingly. This paper introduces an early stopping mechanism to improve data availability. This paper demonstrates the performance improvement of the Efficient DP-FL algorithm through simulation experiments on real MNIST and Fashion-MNIST datasets. Experimental showthat the efficient DP-FL algorithm is significantly superior to other algorithms. [ABSTRACT FROM AUTHOR]

Multi-objective reinforcement learning (MORL) extends traditional RL by seeking policies making different compromises among conflicting objectives. The recent surge of interest in MORL has led to diverse studies and solving methods, often drawing from existing knowledge in multi-objective optimization based on decomposition (MOO/D). Yet, a clear categorization based on both RL and MOO/D is lacking in the existing literature. Consequently, MORL researchers face difficulties when trying to classify contributions within a broader context due to the absence of a standardized taxonomy. To tackle such an issue, this paper introduces multi-objective reinforcement learning based on decomposition (MORL/D), a novel methodology bridging the literature of RL and MOO. A comprehensive taxonomy for MORL/D is presented, providing a structured foundation for categorizing existing and potential MORL works. The introduced taxonomy is then used to scrutinize MORL research, enhancing clarity and conciseness through well-defined categorization. Moreover, a flexible framework derived from the taxonomy is introduced. This framework accommodates diverse instantiations using tools from both RL and MOO/D. Its versatility is demonstrated by implementing it in different configurations and assessing it on contrasting benchmark problems. Results indicate MORL/D instantiations achieve comparable performance to current state-of-the-art approaches on the studied problems. By presenting the taxonomy and framework, this paper offers a comprehensive perspective and a unified vocabulary for MORL. This not only facilitates the identification of algorithmic contributions but also lays the groundwork for novel research avenues in MORL. [ABSTRACT FROM AUTHOR]

To serve various tasks requested by various end devices with different requirements, end-edge-cloud (E2C) has attracted more and more attention from specialists in both academia and industry, by combining both benefits of edge and cloud computing. But nowadays, E2C still suffers from low service quality and resource efficiency, due to the geographical distribution of edge resources and the high dynamic of network topology and user mobility. To address these issues, this paper focuses on task offloading, which makes decisions that which resources are allocated to tasks for their processing. This paper first formulates the problem into binary non-linear programming and then proposes a particle swarm optimization (PSO)-based algorithm to solve the problem. The proposed algorithm exploits an imbalance mutation operator and a task rescheduling approach to improve the performance of PSO. The proposed algorithm concerns the resource heterogeneity by correlating the probability that a computing node is decided to process a task with its capacity, by the imbalance mutation. The task rescheduling approach improves the acceptance ratio for a task offloading solution, by reassigning rejected tasks to computing nodes with available resources. Extensive simulated experiments are conducted. And the results show that the proposed offloading algorithm has an 8.93%-37.0% higher acceptance ratio than ten of the classical and up-to-date algorithms, and verify the effectiveness of the imbalanced mutation and the task rescheduling. [ABSTRACT FROM AUTHOR]

Information and communication technologies are spreading rapidly due to their fast proliferation in many fields. The number of Internet users has led to a spike in cyber-attack incidents. E-commerce applications, such as online banking, marketing, trading, and other online businesses, play an integral role in our lives. Network Intrusion Detection System (NIDS) is essential to protect the network from unauthorized access and against other cyber-attacks. The existing NIDS systems are based on the Backward Oracle Matching (BOM) algorithm, which minimizes the false alarm rate and causes of high packet drop ratio. This paper discussed the existing NIDS systems and different used pattern-matching techniques regarding their weaknesses and limitations. To address the existing system issues, this paper proposes an enhanced version of the BOM algorithm by using multiple pattern-matching methods for the NIDS system to improve the network performance. The proposed solution is tested in simulation with existing solutions using the Snort and NSL-KDD datasets. The experimental results indicated that the proposed solution performed better than the existing solutions and achieved a 5.17% detection rate and a 0.22% lower false alarm rate than the existing solution. [ABSTRACT FROM AUTHOR]

Intelligent transportation systems (ITSs) are becoming increasingly popular as they support efficient coordinated transport. ITSs aim to improve the safety, efficiency and reliability of road transportation through integrated approaches to the exchange of relevant information. Mobile adhoc networks (MANETs) and vehicle ad-hoc networks (VANETs) are integral components of ITS. The VANET is composed of interconnected vehicles with sensitivity capabilities to exchange traffic, positioning, weather and emergency information. One of the main challenges in VANET is the reliable and timely dissemination of information between vehicular nodes to improve decision-making processes. This paper illustrates challenges in VANET and reviews possible solutions to improve road safety control and management using V2V and V2I communications. This paper also summarizes existing rules-based and optimized-based solutions, including reducing the effect of mixed environments, obstacles, malfunctions and short wireless ranges on transportation efficiency and reducing false messages that cause unintended vehicle actions and unreliable transportation systems. Additionally, an event simulation algorithm was designed to maximize the benefits of exchangeable messages among vehicles. Furthermore, simulatedVANETenvironmentswere developed to demonstrate how the algorithm can be used for transformable messages. Experimental results show that coupling of both V2V and V2I messages yielded better results in terms of end-to-end delay and average time. Future research directions were highlighted to be taken into account in the development of ITS and intelligent routing mechanisms. [ABSTRACT FROM AUTHOR]

3D models are essential in virtual reality, game development, architecture design, engineering drawing, medicine, and more. Compared to digital images, 3D models can provide more realistic visual effects. In recent years, significant progress has been made in the field of digital image encryption, and researchers have developed new algorithms that are more secure and efficient. However, there needs to be more research on 3D model encryption. This paper proposes a new 3D model encryption algorithm, called the 1D map with sin and logistic coupling (1D-MWSLC), because existing digital image encryption algorithms cannot be directly applied to 3D models. Firstly, this paper introduce 1D-MWSLC, which has a wider range of parameters compared to traditional 1D chaotic systems. When the parameter exceeds a specific range, the chaotic phenomenon does not weaken. Additionally, 1D-MWSLC has two control parameters, which increases the cryptosystem's parameter space. Next, 1D-MWSLC generates keystreams for confusion and diffusion. In the confusion stage, this paper use random confusion, and the keystream generates an index matrix that confuses the integer and decimal parts of the 3D model simultaneously. In the diffusion stage, this paper use parallel bidirectional diffusion to simultaneously diffuse the integer parts of the three coordinates of the 3D model. Finally, this paper verify the proposed algorithm through statistical analysis, and experimental results demonstrate that the proposed 3D model encryption algorithm has robust security. [ABSTRACT FROM AUTHOR]

Due to the anonymity of blockchain, frequent security incidents and attacks occur through it, among which the Ponzi scheme smart contract is a classic type of fraud resulting in huge economic losses. Machine learningbased methods are believed to be promising for detecting ethereum Ponzi schemes. However, there are still some flaws in current research, e.g., insufficient feature extraction of Ponzi scheme smart contracts, without considering class imbalance. In addition, there is room for improvement in detection precision. Aiming at the above problems, this paper proposes an ethereum Ponzi scheme detection scheme through opcode context analysis and adaptive boosting (AdaBoost) algorithm. Firstly, this paper uses the n-gram algorithm to extract more comprehensive contract opcode features and combine them with contract account features, which helps to improve the feature extraction effect. Meanwhile, adaptive synthetic sampling (ADASYN) is introduced to deal with class imbalanced data, and integrated with the Adaboost classifier. Finally, this paper uses the improved AdaBoost classifier for the identification of Ponzi scheme contracts. Experimentally, this paper tests our model in real-world smart contracts and compares it with representative methods in the aspect of F1-score and precision. Moreover, this article compares and discusses the state of art methods with our method in four aspects: data acquisition, data preprocessing, feature extraction, and classifier design. Both experiment and discussion validate the effectiveness of our model. [ABSTRACT FROM AUTHOR]

This paper considers various hybrid methods for solving a system of nonlinear equations. Extensive numerical experiments confirm the research hypothesis that one particular form of hybridization of the conjugate gradient algorithm with Newton's method outperforms other hybrid strategies considered in the paper. [ABSTRACT FROM AUTHOR]

The increasing value of facilities, on the one hand, and the complexity of the equipment used in them, on the other, have increased the importance of planning for the maintenance of facilities, especially for companies whose facilities are located in different locations. In this paper, a new hybrid model is presented to optimize facility maintenance scheduling by a combination of Genetic Algorithms (GA), Particle Swarm Optimization (PSO), and the Monte Carlo Simulation for organizing facilities located in different locations as well as determining the optimum number of crews with mechanical, electrical and simple skills. The main contributions of this paper include: (a) optimizing the number of crews by different skills in the first stage; (b) evaluation of fitness value for each solution through the Monte Carlo Simulation model; and (c) scheduling by considering different failure rates for different facilities in different locations. In order to evaluate the performance of the proposed model, the model has been compared with Golpira model, the results of which demonstrate that it is possible to reduce the cost by just over 39% and reduce Mean Time Between Failures (MTBF) by over half. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Donghua University (English Edition) is the property of Journal of Donghua University Editorial Board and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Path-based clustering algorithms typically generate clusters by optimizing a benchmark function. Most optimization methods in clustering algorithms often offer solutions close to the general optimal value. This study achieves the global optimum value for the criterion function in a shorter time using the minimax distance, Maximum Spanning Tree "MST", and meta-heuristic algorithms, including Genetic Algorithm "GA" and Particle Swarm Optimization "PSO". The Fast Path-based Clustering "FPC" algorithm proposed in this paper can find cluster centers correctly in most datasets and quickly perform clustering operations. The FPC does this operation using MST, the minimax distance, and a new hybrid meta-heuristic algorithm in a few rounds of algorithm iterations. This algorithm can achieve the global optimal value, and the main clustering process of the algorithm has a computational complexity of O (k² × n). However, due to the complexity of the minimum distance algorithm, the total computational complexity is O (n²). Experimental results of FPC on synthetic datasets with arbitrary shapes demonstrate that the algorithm is resistant to noise and outliers and can correctly identify clusters of varying sizes and numbers. In addition, the FPC requires the number of clusters as the only parameter to perform the clustering process. A comparative analysis of FPC and other clustering algorithms in this domain indicates that FPC exhibits superior speed, stability, and performance. [ABSTRACT FROM AUTHOR]

The Extensible Markup Language (XML) files, widely used for storing and exchanging information on the web require efficient parsingmechanisms to improve the performance of the applications. With the existing Document Object Model (DOM) based parsing, the performance degrades due to sequential processing and large memory requirements, thereby requiring an efficient XML parser to mitigate these issues. In this paper, we propose a Parallel XML Tree Generator (PXTG) algorithm for accelerating the parsing of XML files and a Regression-based XML Parsing Framework (RXPF) that analyzes and predicts performance through profiling, regression, and code generation for efficient parsing. The PXTG algorithm is based on dividing the XML file into n parts and producing n trees in parallel. The profiling phase of the RXPF framework produces a dataset by measuring the performance of various parsing models including StAX, SAX, DOM, JDOM, and PXTG on different cores by using multiple file sizes. The regression phase produces the prediction model, based on which the final code for efficient parsing of XML files is produced through the code generation phase. The RXPF framework has shown a significant improvement in performance varying from 9.54% to 32.34% over other existing models used for parsing XML files. [ABSTRACT FROM AUTHOR]

Computational linguistics is the scientific and engineering discipline related to comprehending written and spoken language from a computational perspective and building artefacts that effectively process and produce language, either in bulk or in a dialogue setting. This paper develops a Chaotic Bird Swarm Optimization with deep ensemble learning based Arabic poem classification and dictarization (CBSOEDL-APCD) technique. The presented CBSOEDL-APCD technique involves the classification and dictarization of Arabic text into Arabic poetries and prose. Primarily, the CBSOEDL-APCD technique carries out data pre-processing to convert it into a useful format. Besides, the ensemble deep learning (EDL) model comprising deep belief network (DBN), gated recurrent unit (GRU), and probabilistic neural network (PNN) are exploited. At last, the CBSO algorithm is employed for the optimal hyperparameter tuning of the deep learning (DL) models to enhance the overall classification performance. A wide range of experiments was performed to establish the enhanced outcomes of the CBSOEDL-APCD technique. Comparative experimental analysis indicates the better outcomes of the CBSOEDLAPCD technique over other recent approaches. [ABSTRACT FROM AUTHOR]

Purpose: With the help of basic physics, the application of computer algorithms in the form of recent advances such as machine learning and neural networking in textile Industry has been discussed in this review. Scientists have linked the underlying structural or chemical science of textile materials and discovered several strategies for completing some of the most time-consuming tasks with ease and precision. Since the 1980s, computer algorithms and machine learning have been used to aid the majority of the textile testing process. With the rise in demand for automation, deep learning, and neural networks, these two now handle the majority of testing and quality control operations in the form of image processing. Design/methodology/approach: The state-of-the-art of artificial intelligence (AI) applications in the textile sector is reviewed in this paper. Based on several research problems and AI-based methods, the current literature is evaluated. The research issues are categorized into three categories based on the operation processes of the textile industry, including yarn manufacturing, fabric manufacture and coloration. Findings: AI-assisted automation has improved not only machine efficiency but also overall industry operations. AI's fundamental concepts have been examined for real-world challenges. Several scientists conducted the majority of the case studies, and they confirmed that image analysis, backpropagation and neural networking may be specifically used as testing techniques in textile material testing. AI can be used to automate processes in various circumstances. Originality/value: This research conducts a thorough analysis of artificial neural network applications in the textile sector. [ABSTRACT FROM AUTHOR]

In recent years there has been an increasing interest in studying proof systems stronger than Resolution, with the aim of building more efficient SAT solvers based on them. In defining these proof systems, we try to find a balance between the power of the proof system (the size of the proofs required to refute a formula) and the difficulty of finding the proofs. In this paper we consider the proof systems circular Resolution, Sherali-Adams, Nullstellensatz and Weighted Resolution and we study their relative power from a theoretical perspective. We prove that circular Resolution, Sherali-Adams and Weighted Resolution are polynomially equivalent proof systems. We also prove that Nullstellensatz is polynomially equivalent to a restricted version of Weighted Resolution. The equivalences carry on also for versions of the systems where the coefficients/weights are expressed in unary. The practical interest in these systems comes from the fact that they admit efficient algorithms to find proofs in case these have small width/degree. [ABSTRACT FROM AUTHOR]

Artificial General Intelligence is the idea that someday an hypothetical agent will arise from artificial intelligence (AI) progresses, and will surpass by far the brightest and most gifted human minds. This idea has been around since the early development of AI. Since then, scenarios on how such AI may behave towards humans have been the subject of many fictional and research works. This paper analyzes the current state of artificial intelligence progresses, and how the current AI race with the ever faster release of impressive new AI methods (that can deceive humans, outperform them at tasks we thought impossible to tackle by AI a mere decade ago, and that disrupt the job market) have raised concerns that Artificial General Intelligence (AGI) might be coming faster that we thought. In particular, we focus on 3 specific families of modern AIs to develop the idea that deep neural networks, which are the current backbone of nearly all artificial intelligence methods, are poor candidates for any AGI to arise due to their many limitations, and therefore that any threat coming from the recent AI race does not lie in AGI but in the limitations, uses, and lack of regulations of our current models and algorithms. [ABSTRACT FROM AUTHOR]

This paper examines the income inequality among rideshare drivers resulting from discriminatory cancellations by riders, considering the impact of demographic factors such as gender, age, and race. We investigate the tradeoff between income inequality, referred to as the fairness objective, and system efficiency, known as the profit objective. To address this issue, we propose an online bipartite-matching model that captures the sequential arrival of riders according to a known distribution. The model incorporates the notion of acceptance rates between driver-rider types, which are defined based on demographic characteristics. Specifically, we analyze the probabilities of riders accepting or canceling their assigned drivers, reflecting the level of acceptance between different rider and driver types. We construct a bi-objective linear program as a valid benchmark and propose two LP-based parameterized online algorithms. Rigorous analysis of online competitive ratios is conducted to illustrate the flexibility and efficiency of our algorithms in achieving a balance between fairness and profit. Furthermore, we present experimental results based on real-world and synthetic datasets, validating the theoretical predictions put forth in our study. [ABSTRACT FROM AUTHOR]

This paper proposes an iterative Maximum Satisfiability (MaxSAT) approach designed to solve train scheduling optimization problems. The generation of railway timetables is known to be intractable for a single track. We consider hundreds of trains on interconnected multi-track railway networks with complex connections between trains. Furthermore, the proposed algorithm is incremental to reduce the impact of time discretization. The performance of our approach is evaluated with the real-world Swiss Federal Railway (SBB) Crowd Sourcing Challenge benchmark and Periodic Event Scheduling Problems benchmark (PESPLib). The execution time of the proposed approach is shown to be, on average, twice as fast as the best existing solution for the SBB instances. In addition, we achieve a significant improvement over SAT-based solutions for solving the PESPLib instances. We also analyzed real schedule data from Switzerland and the Netherlands to create a disruption generator based on probability distributions. The novel incremental algorithm allows solving the train scheduling problem under disruptions with better performance than traditional algorithms. [ABSTRACT FROM AUTHOR]

Many planning, scheduling or multi-dimensional packing problems involve the design of subtle logical combinations of temporal or spatial constraints. Recently, we introduced GEQCA-I, which stands for Generic Qualitative Constraint Acquisition, as a new active constraint acquisition method for learning qualitative constraints using qualitative queries. In this paper, we revise and extend GEQCA-I to GEQCA-II with a new type of query, universal query, for qualitative constraint acquisition, with a deeper query-driven acquisition algorithm. Our extended experimental evaluation shows the efficiency and usefulness of the concept of universal query in learning randomly-generated qualitative networks, including both temporal networks based on Allen's algebra and spatial networks based on region connection calculus. We also show the effectiveness of GEQCA-II in learning the qualitative part of real scheduling problems. [ABSTRACT FROM AUTHOR]

This paper presents a novel Adaptive Mutation Quantum-inspired Squirrel Search Algorithm (AM-QSSA). Firstly, based on the population mutation, a location-update of quantum state correlative and attractor method is proposed. By introducing a random process to modify the sliding factor of the local attractor, the inevitable lack of diversity in the population renewal method is solved. The premature convergence problem of adaptive mutation rate improvement algorithm based on squirrel position update mode is introduced. Meanwhile, the paper decomposes the location update process of the SSA, and improves it with quantum-behavior. Furthermore, it proposes a novel quantum-inspired squirrels search algorithm. This method finds the complementary effect between quantum behavior and squirrel search algorithm, and solves the problem of premature convergence probability of SSA. In addition, it improves population diversity, and achieves the balance between global and local search. The efficiency of the proposed AM-QSSA is evaluated using exploitation analysis, exploration analysis, success rate analysis, convergence rate analysis on classical benchmark functions as well as Congress on Evolutionary Computation (CEC) 2017 test functions. For further study, AM-QSSA optimizes an image registration problem for an extensive study to check its applicability. The results reveal that AM-QSSA is more efficient and stable than SSA. And it is comparable to the most advanced optimization algorithms. [ABSTRACT FROM AUTHOR]

Renewable energy sources like solar, wind, and hydro are becoming increasingly popular due to the fewer negative impacts they have on the environment. Because, Since the production of renewable energy sources is still in the process of being created, photovoltaic (PV) systems are commonly utilized for installation situations that are acceptable, clean, and simple. This study presents an adaptive artificial intelligence approach that can be used for maximum power point tracking (MPPT) in solar systems with the help of an embedded controller. The adaptive method incorporates both the Whale Optimization Algorithm (WOA) and the Artificial Neural Network (ANN). The WOA was implemented to enhance the process of the ANN model's training, and the ANN model was developed using the WOA. In addition to this, the inverter circuit is connected to the smart grid system, and the strengthening of the smart grid is achieved through the implementation of the CMCMAC protocol. This protocol prevents interference between customers and the organizations that provide their utilities. Using a protocol known as Cross-Layer Multi-Channel MAC (CMCMAC), the effect of interference is removed using the way that was suggested. Also, with the utilization of the ZIGBEE communication technology, bidirectional communication is made possible. The strategy that was suggested has been put into practice, and the results have shown that the PV system produces an output power of 73.32KWand an efficiency of 98.72%. In addition to this, a built-in regulator is utilized to validate the proposed model. In this paper, the results of various experiments are analyzed, and a comparison is made between the suggested WOA with the ANN controller approach and others, such as the Particle Swarm Optimization (PSO) based MPPT and the Cuckoo Search (CS) based MPPT. By examining the comparison findings, it was determined that the adaptive AI-based embedded controller was superior to the other alternatives. [ABSTRACT FROM AUTHOR]

The rapid advancement of data in web-based communication has created one of the biggest issues concerning the security of data carried over the internet fromunauthorized access. To improve data security, modern cryptosystems use substitution-boxes. Nowadays, data privacy has become a key concern for consumers who transfer sensitive data from one place to another. To address these problems, many companies rely on cryptographic techniques to secure data from illegal activities and assaults. Among these cryptographic approaches, AES is a well-known algorithm that transforms plain text into cipher text by employing substitution box (S-box). The S-box disguises the relationship between cipher text and the key to guard against cipher attacks. The security of a cipher using an S-box depends on the cryptographic strength of the respective S-box. Therefore, various researchers have employed different techniques to construct high order non-linear S-box. This paper provides a novel approach for evolving S-boxes using coset graphs for the action of the alternating group A5 over the finite field and the symmetric group S256. The motivation for this work is to study the symmetric group and coset graphs. The authors have performed various analyses against conventional security criteria such as nonlinearity, differential uniformity, linear probability, the bit independence criterion, and the strict avalanche criterion to determine its high cryptographic strength. To evaluate its image application performance, the proposed S-box is also used to encrypt digital images. The performance and comparison analyses show that the suggested S-box can secure data against cyber-attacks. [ABSTRACT FROM AUTHOR]

Nowadays, Web browsers have become an important carrier of 3D model visualization because of their convenience and portability. During the process of large-scale 3D model visualization based on Web scenes with the problems of slow rendering speed and low FPS (Frames Per Second), occlusion culling, as an important method for rendering optimization, can remove most of the occluded objects and improve rendering efficiency. The traditional occlusion culling algorithm (TOCA) is calculated by traversing all objects in the scene, which involves a large amount of repeated calculation and time consumption. To advance the rendering process and enhance rendering efficiency, this paper proposes an occlusion culling with three different optimization methods based on theWebGPU Computing Pipeline. Firstly, for the problem of large amounts of repeated calculation processes in TOCA, these units are moved from the CPU to the GPU for parallel computing, thereby accelerating the calculation of the Potential Visible Sets (PVS); Then, for the huge overhead of creating pipeline caused by too many 3D models in a certain scene, the Breaking Occlusion Culling Algorithm (BOCA) is introduced, which removes some nodes according to building a Hierarchical Bounding Volume (BVH) scene tree to reduce the overhead of creating pipelines; After that, the structure of the scene tree is transmitted to the GPU in the order of depth-first traversal and finally, the PVS is obtained by parallel computing. In the experiments, 3D geological models with five different scales from 1:5,000 to 1:500,000 are used for testing. The results show that the proposed methods can reduce the time overhead of repeated calculation caused by the computing pipeline creation and scene tree recursive traversal in the occlusion culling algorithm effectively, with 97% rendering efficiency improvement compared with BOCA, thereby accelerating the rendering process on Web browsers. [ABSTRACT FROM AUTHOR]

Federated learning has recently attracted significant attention as a cutting-edge technology that enables Artificial Intelligence (AI) algorithms to utilize global learning across the data of numerous individuals while safeguarding user data privacy. Recent advanced healthcare technologies have enabled the early diagnosis of various cognitive ailments like Parkinson's. Adequate user data is frequently used to train machine learning models for healthcare systems to track the health status of patients. The healthcare industry faces two significant challenges: security and privacy issues and the personalization of cloud-trained AI models. This paper proposes a Deep Neural Network (DNN) based approach embedded in a federated learning framework to detect and diagnose brain disorders. We extracted the data from the database of Kay Elemetrics voice disordered and divided the data into two windows to create training models for two clients, each with different data. To lessen the over-fitting aspect, every client reviewed the outcomes in three rounds. The proposed model identifies brain disorders without jeopardizing privacy and security. The results reveal that the global model achieves an accuracy of 82.82% for detecting brain disorders while preserving privacy. [ABSTRACT FROM AUTHOR]

Social engineering attacks are considered one of themost hazardous cyberattacks in cybersecurity, as human vulnerabilities are often the weakest link in the entire network. Such vulnerabilities are becoming increasingly susceptible to network security risks. Addressing the social engineering attack defense problem has been the focus of many studies. However, two main challenges hinder its successful resolution. Firstly, the vulnerabilities in social engineering attacks are unique due to multistage attacks, leading to incorrect social engineering defense strategies. Secondly, social engineering attacks are real-time, and the defense strategy algorithms based on gaming or reinforcement learning are too complex to make rapid decisions. This paper proposes a multiattribute quantitative incentive method based on human vulnerability and an improved Q-learning (IQL) reinforcement learning method on human vulnerability attributes. The proposed algorithm aims to address the two main challenges in social engineering attack defense by using a multiattribute incentive method based on human vulnerability to determine the optimal defense strategy. Furthermore, the IQL reinforcement learning method facilitates rapid decision-making during real-time attacks. The experimental results demonstrate that the proposed algorithm outperforms the traditional Qlearning (QL) and deep Q-network (DQN) approaches in terms of time efficiency, taking 9.1% and 19.4% less time, respectively. Moreover, the proposed algorithm effectively addresses the non-uniformity of vulnerabilities in social engineering attacks and provides a reliable defense strategy based on human vulnerability attributes. This study contributes to advancing social engineering attack defense by introducing an effective and efficient method for addressing the vulnerabilities of human factors in the cybersecurity domain. [ABSTRACT FROM AUTHOR]

Black fungus is a rare and dangerous mycology that usually affects the brain and lungs and could be life-threatening in diabetic cases. Recently, some COVID-19 survivors, especially those with co-morbid diseases, have been susceptible to black fungus. Therefore, recovered COVID-19 patients should seek medical support when they notice mucormycosis symptoms. This paper proposes a novel ensemble deep-learning model that includes three pre-trained models: reset (50), VGG (19), and Inception. Our approach is medically intuitive and efficient compared to the traditional deep learning models. An image dataset was aggregated from various resources and divided into two classes: a black fungus class and a skin infection class. To the best of our knowledge, our study is the first that is concerned with building black fungus detection models based on deep learning algorithms. The proposed approach can significantly improve the performance of the classification task and increase the generalization ability of such a binary classification task. According to the reported results, it has empirically achieved a sensitivity value of 0.9907, a specificity value of 0.9938, a precision value of 0.9938, and a negative predictive value of 0.9907. [ABSTRACT FROM AUTHOR]

Rubber producers, consumers, traders, and those who are involved in the rubber industry face major risks of rubber price fluctuations. As a result, decision-makers are required to make an accurate estimation of the price of rubber. This paper aims to propose hybrid intelligent models, which can be utilized to forecast the price of rubber in Malaysia by employing monthly Malaysia's rubber pricing data, spanning from January 2016 to March 2021. The projected hybrid model consists of different algorithms with the symbolic Radial Basis Functions Neural Network k-Satisfiability Logic Mining (RBFNN-kSAT). These algorithms, including GreyWolf Optimization Algorithm, Artificial Bee Colony Algorithm, and Particle Swarm Optimization Algorithm were utilized in the forecasting data analysis. Several factors, which affect the monthly price of rubber, such as rubber production, total exports of rubber, total imports of rubber, stocks of rubber, currency exchange rate, and crude oil prices were also considered in the analysis. To evaluate the results of the introduced model, a comparison has been conducted for each model to identify the most optimum model for forecasting the price of rubber. The findings showed that GWO with RBFNN-kSAT represents the most accurate and efficient model compared with ABC with RBFNNkSAT and PSO with RBFNN-kSAT in forecasting the price of rubber. The GWOwithRBFNN-kSAT obtained the greatest average accuracy (92%), with a better correlation coefficient R = 0.983871 than ABC with RBFNN-kSAT and PSO with RBFNN-kSAT. Furthermore, the empirical results of this study provided several directions for policymakers to make the right decision in terms of devising proper measures in the industry to address frequent price changes so that the Malaysian rubber industry maintains dominance in the international markets. [ABSTRACT FROM AUTHOR]

Acute leukemia is an aggressive disease that has high mortality rates worldwide. The error rate can be as high as 40% when classifying acute leukemia into its subtypes. So, there is an urgent need to support hematologists during the classification process. More than two decades ago, researchers used microarray gene expression data to classify cancer and adopted acute leukemia as a test case. The high classification accuracy they achieved confirmed that it is possible to classify cancer subtypes using microarray gene expression data. Ensemble machine learning is an effective method that combines individual classifiers to classify new samples. Ensemble classifiers are recognized as powerful algorithms with numerous advantages over traditional classifiers. Over the past few decades, researchers have focused a great deal of attention on ensemble classifiers in a wide variety of fields, including but not limited to disease diagnosis, finance, bioinformatics, healthcare, manufacturing, and geography. This paper reviews the recent ensemble classifier approaches utilized for acute leukemia gene expression data classification. Moreover, a framework for classifying acute leukemia gene expression data is proposed. The pairwise correlation gene selection method and the Rotation Forest of Bayesian Networks are both used in this framework. Experimental outcomes show that the classification accuracy achieved by the acute leukemia ensemble classifiers constructed according to the suggested framework is good compared to the classification accuracy achieved in other studies. [ABSTRACT FROM AUTHOR]

Radial Basis Function Neural Network (RBFNN) ensembles have long suffered from non-efficient training, where incorrect parameter settings can be computationally disastrous. This paper examines different evolutionary algorithms for training the Symbolic Radial Basis Function Neural Network (SRBFNN) through the behavior's integration of satisfiability programming. Inspired by evolutionary algorithms, which can iteratively find the nearoptimal solution, different Evolutionary Algorithms (EAs) were designed to optimize the producer output weight of the SRBFNN that corresponds to the embedded logic programming 2Satisfiability representation (SRBFNN-2SAT). The SRBFNN's objective function that corresponds to Satisfiability logic programming can be minimized by different algorithms, including Genetic Algorithm (GA), Evolution Strategy Algorithm (ES), Differential Evolution Algorithm (DE), and Evolutionary Programming Algorithm (EP). Each of these methods is presented in the steps in the flowchart form which can be used for its straightforward implementation in any programming language. With the use of SRBFNN-2SAT, a training method based on these algorithms has been presented, then training has been compared among algorithms, which were applied in Microsoft Visual C++ software using multiple metrics of performance, including Mean Absolute Relative Error (MARE), Root Mean Square Error (RMSE), Mean Absolute Percentage Error (MAPE), Mean Bias Error (MBE), Systematic Error (SD), Schwarz Bayesian Criterion (SBC), and Central Process Unit time (CPU time). Based on the results, the EP algorithm achieved a higher training rate and simple structure compared with the rest of the algorithms. It has been confirmed that the EP algorithm is quite effective in training and obtaining the best output weight, accompanied by the slightest iteration error, which minimizes the objective function of SRBFNN-2SAT. [ABSTRACT FROM AUTHOR]

Cloud computing technology provides flexible, on-demand, and completely controlled computing resources and services are highly desirable. Despite this, with its distributed and dynamic nature and shortcomings in virtualization deployment, the cloud environment is exposed to a wide variety of cyber-attacks and security difficulties. The Intrusion Detection System (IDS) is a specialized security tool that network professionals use for the safety and security of the networks against attacks launched from various sources. DDoS attacks are becoming more frequent and powerful, and their attack pathways are continually changing, which requiring the development of new detection methods. Here the purpose of the study is to improve detection accuracy. Feature Selection (FS) is critical. At the same time, the IDS's computational problem is limited by focusing on the most relevant elements, and its performance and accuracy increase. In this research work, the suggested Adaptive butterfly optimization algorithm (ABOA) framework is used to assess the effectiveness of a reduced feature subset during the feature selection phase, that was motivated by this motive Candidates. Accurate classification is not compromised by using an ABOA technique. The design of Deep Neural Networks (DNN) has simplified the categorization of network traffic into normal and DDoS threat traffic. DNN's parameters can be finetuned to detect DDoS attacks better using specially built algorithms. Reduced reconstruction error, no exploding or vanishing gradients, and reduced network are all benefits of the changes outlined in this paper. When it comes to performance criteria like accuracy, precision, recall, and F1-Score are the performance measures that show the suggested architecture outperforms the other existing approaches. Hence the proposed ABOA + DNN is an excellent method for obtaining accurate predictions, with an improved accuracy rate of 99.05% compared to other existing approaches. [ABSTRACT FROM AUTHOR]

The widespread penetration of distributed energy sources and the use of load response programs, especially in a microgrid, have caused many power system issues, such as control and operation of these networks, to be affected. The control and operation of many small-distributed generation units with different performance characteristics create another challenge for the safe and efficient operation of the microgrid. In this paper, the optimum operation of distributed generation resources and heat and power storage in a microgrid, was performed based on real-time pricing through the proposed gray wolf optimization (GWO) algorithm to reduce the energy supply cost with the microgrid. Distributed generation resources such as solar panels, diesel generators with battery storage, and boiler thermal resources with thermal storage were used in the studied microgrid. Also, a combined heat and power (CHP) unit was used to produce thermal and electrical energy simultaneously. In the simulations, in addition to the gray wolf algorithm, some optimization algorithms have also been used. Then the results of 20 runs for each algorithm confirmed the high accuracy of the proposed GWO algorithm. The results of the simulations indicated that the CHP energy resources must be managed to have a minimum cost of energy supply in the microgrid, considering the demand response program. [ABSTRACT FROM AUTHOR]

In the digital world, a wide range of handwritten and printed documents should be converted to digital format using a variety of tools, including mobile phones and scanners. Unfortunately, this is not an optimal procedure, and the entire document image might be degraded. Imperfect conversion effects due to noise, motion blur, and skew distortion can lead to significant impact on the accuracy and effectiveness of document image segmentation and analysis in Optical Character Recognition (OCR) systems. In Document Image Analysis Systems (DIAS), skew estimation of images is a crucial step. In this paper, a novel, fast, and reliable skew detection algorithm based on the Radon Transform and Curve Length Fitness Function (CLF), so-called Radon CLF, was proposed. The Radon CLF model aims to take advantage of the properties of Radon spaces. The Radon CLF explores the dominating angle more effectively for a 1D signal than it does for a 2D input image due to an innovative fitness function formulation for a projected signal of the Radon space. Several significant performance indicators, including Mean Square Error (MSE), Mean Absolute Error (MAE), Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Measure (SSIM), Accuracy, and run-time, were taken into consideration when assessing the performance of our model. In addition, a new dataset named DSI5000 was constructed to assess the accuracy of the CLF model. Both two-dimensional image signal and the Radon space have been used in our simulations to compare the noise effect. Obtained results show that the proposed method is more effective than other approaches already in use, with an accuracy of roughly 99.87% and a run-time of 0.048 (s). The introduced model is far more accurate and timeefficient than current approaches in detecting image skew. [ABSTRACT FROM AUTHOR]

Large cities suffer from traffic congestion, particularly at intersections, due to a large number of vehicles, which leads to the loss of time by increasing carbon emissions, including fuel consumption. Therefore, the need for optimising the flow of vehicles at different intersections and reducing the waiting time is a critical challenge. Conventional traffic lights have been used to control traffic flow at different intersections and have been improved to become more efficient by using different algorithms, sensors and cameras. However, they also face some challenges, such as high-cost installation, operation, and maintenance issues. This paper develops a new system based on the Virtual Traffic Light (VTL) technology to improve traffic flow at different intersections and reduce the encountered loss of time and vehicles' travel time. Additionally, it reduces the costs of installation, maintenance and operation over various conventional traffic light systems. Consequently, the system proposes algorithms for traffic scheduling and lane identification by using vehicle ID, priority and time of arrival. To evaluate the system, four scenarios were presented where each scenario uses a different number of vehicles consisting of three types (emergency vehicles, public buses and private vehicles), each given a different priority. The proposed system is evaluated by integrating two simulators, namely, (OMNeT++) and (SUMO), and two frameworks, namely, (VEINS) and (INET) to prepare an appropriate working environment. the results prove that an improvement in the average travel time for several vehicles reaches 44.43%-49.76% compared with conventional traffic lights. Further, it is proven from the obtained results that the average waiting time for emergency vehicles is enhanced by 96.63%-97.63%, while the average waiting time for public buses is improved by 94.81%-97.23%. On the other hand, the waiting time for private vehicles 'improved by 87.14% to 89.71%'. [ABSTRACT FROM AUTHOR]

Internet Protocol version 6 (IPv6) is the latest version of IP that goal to host 3.4 × 1038 unique IP addresses of devices in the network. IPv6 has introduced new features like Neighbour Discovery Protocol (NDP) and Address Auto-configuration Scheme. IPv6 needed several protocols like the Address Auto-configuration Scheme and Internet Control Message Protocol (ICMPv6). IPv6 is vulnerable to numerous attacks like Denial of Service (DoS) and Distributed Denial of Service (DDoS) which is one of the most dangerous attacks executed through ICMPv6 messages that impose security and financial implications. Therefore, an Intrusion Detection System (IDS) is a monitoring system of the security of a network that detects suspicious activities and deals with amassive amount of data comprised of repetitive and inappropriate features which affect the detection rate. A feature selection (FS) technique helps to reduce the computation time and complexity by selecting the optimum subset of features. This paper proposes a method for detecting DDoS flooding attacks (FA) based on ICMPv6 messages using a Binary Flower PollinationAlgorithm (BFPA-FA). The proposed method (BFPA-FA) employs FS technology with a support vector machine (SVM) to identify the most relevant, influential features. Moreover, The ICMPv6-DDoS dataset was used to demonstrate the effectiveness of the proposed method through different attack scenarios. The results show that the proposed method BFPAFA achieved the best accuracy rate (97.96%) for the ICMPv6 DDoS detection with a reduced number of features (9) to half the total (19) features. The proven proposed method BFPA-FAis effective in the ICMPv6 DDoS attacks via IDS. [ABSTRACT FROM AUTHOR]

Cloud computing facilitates the great potentiality of storing and managing remote access to services in terms of software as a service (SaaS). Several organizations have moved towards outsourcing over the cloud to reduce the burden on local resources. In this context, the metaheuristic optimization method is determined to be highly suitable for selecting appropriate services that comply with the requirements of the client's requests, as the services stored over the cloud are too complex and scalable. To achieve better service composition, the parameters of Quality of Service (QoS) related to each service considered to be the best resource need to be selected and optimized for attaining potential services over the cloud. Thus, the cloud service composition needs to concentrate on the selection and integration of services over the cloud to satisfy the client's requests. In this paper, a Hybrid Chameleon and Honey Badger Optimization Algorithm (HCHBOA)- based cloud service composition scheme is presented for achieving efficient services with satisfying the requirements ofQoS over the cloud. This proposed HCHBOA integrated the merits of the Chameleon Search Algorithm (CSA) and Honey Badger Optimization Algorithm (HBOA) for balancing the tradeoff between the rate of exploration and exploitation. It specifically used HBOA for tuning the parameters of CSA automatically so that CSA could adapt its performance depending on its incorporated tuning factors. The experimental results of the proposed HCHBOA with experimental datasets exhibited its predominance by improving the response time by 21.38%, availability by 20.93% and reliability by 19.31% with a minimized execution time of 23.18%, compared to the baseline cloud service composition schemes used for investigation. [ABSTRACT FROM AUTHOR]

Cognitive radio wireless sensor networks (CRWSN) can be defined as a promising technology for developing bandwidth-limited applications. CRWSN is widely utilized by future Internet of Things (IoT) applications. Since a promising technology, Cognitive Radio (CR) can be modelled to alleviate the spectrum scarcity issue. Generally, CRWSN has cognitive radioenabled sensor nodes (SNs), which are energy limited. Hierarchical clusterrelated techniques for overall network management can be suitable for the scalability and stability of the network. This paper focuses on designing the Modified Dwarf Mongoose Optimization Enabled Energy Aware Clustering (MDMO-EAC) Scheme for CRWSN. The MDMO-EAC technique mainly intends to group the nodes into clusters in the CRWSN. Besides, theMDMOEAC algorithm is based on the dwarf mongoose optimization (DMO) algorithm design with oppositional-based learning (OBL) concept for the clustering process, showing the novelty of the work. In addition, the presented MDMO-EAC algorithm computed a multi-objective function for improved network efficiency. The presented model is validated using a comprehensive range of experiments, and the outcomes were scrutinized in varying measures. The comparison study stated the improvements of the MDMO-EAC method over other recent approaches. [ABSTRACT FROM AUTHOR]

Health monitoring systems are now required, particularly for essential patients, following the COVID-19 pandemic, which was followed by its variants and other epidemics of a similar nature. Effective procedures and strategies are required, though, to react promptly to the enormous volume of real-time data offered by monitoring equipment. Although fog-based designs for IoT health systems typically result in enhanced services, they also give rise to issues that need to be resolved. In this paper, we propose a two-way strategy to reduce network latency and usewhile increasing real-time data transmission of device gateways used for sensors by making educated judgments for connection setup with BS and task assignment. For this, a simulation using iFogSim in the Eclipse IDE showed how effective the suggested strategy for massive IoT healthmonitoring systems is. The algorithm is analyzed for network usage and latency, and the results reveal 20%-25% improvements compared to the existing methods regarding network usage and latency. [ABSTRACT FROM AUTHOR]

This paper proposes a solution to the open vehicle routing problem with time windows (OVRPTW) considering third-party logistics (3PL). For the typical OVRPTW problem, most researchers consider time windows, capacity, routing limitations, vehicle destination, etc. Most researchers who previously investigated this problem assumed the vehicle would not return to the depot, but did not consider its final destination. However, by considering 3PL in the B2B e-commerce, the vehicle is required back to the nearest 3PL location with available space. This paper formulates the problem as a mixed integer linear programming (MILP) model with the objective of minimizing the total travel distance. A coordinate representation particle swarm optimization (CRPSO) algorithm is developed to obtain the best delivery sequencing and the capacity of each vehicle. Results of the computational study show that the proposed method provides solution within a reasonable amount of time. Finally, the result compared to PSO also indicates that the CRPSO is effective. [ABSTRACT FROM AUTHOR]

With the rise and development of computer networks, network security has become a major issue, and intrusion detection has emerged as a crucial aspect of network security. However, traditional intrusion detection methods suffer from issues like slow detection rates and low accuracy. This necessitates the exploration and development of optimized algorithms for improving intrusion detection efficiency and accuracy. Recently, the multi-objective differential evolution algorithm has shown promising results in the field of intrusion detection. This paper explored the application of the multi-objective differential evolution algorithm in computer network intrusion detection systems. The experimental results on the KDDCUP'99 dataset demonstrated that the algorithm delivers high levels of precision and recall, outperforming other intrusion detection methods. Therefore, combining the multi-objective differential evolution algorithm with traditional intrusion detection methods can lead to significant improvements in intrusion detection efficiency and accuracy. Further optimization of this algorithm can be required to meet complex intrusion detection requirements. The multi-objective differential evolution algorithm presents exciting prospects, which can help enhance the efficiency and accuracy of intrusion detection, and provide strong technical support for ensuring network security and preventing cyber-attacks. [ABSTRACT FROM AUTHOR]