Search

Feature Selection (FS) is critically important for optimising the performance of Intrusion Detection Systems (IDSs) used in Wireless Sensor Networks (WSNs). However, selecting an optimal number of relevant features from massive IDS data sets has been an ongoing FS research problem. Many approaches use Machine Learning (ML), such as nature-inspired population-based and Differential Evolution (DE)-based algorithms for FS. However, the main drawback of DE is that it has a premature convergence issue, which leads to false convergence. In this paper, a novel mutation strategy is proposed to alleviate premature convergence and to develop a modified DE-based FS algorithm called DE with maturity extension (DE-ME). The novel mutation is achieved by changing the mutation factor in the DE\rnd\1 based on K-Nearest Neighbour (KNN) as the most efficient implementation without adding further complexity to the design process. The proposed DE-ME algorithm improves the FS operation with significant performance improvements in terms of overcoming premature convergence and increasing accuracy for selection. The DE-ME algorithm was used to select the most effective features from 41 features in the Network Security Laboratory Knowledge Discovery in Databases (NSL-KDD) dataset. The accuracy of DE-ME is high at 99.66 %, its False Positive Rate (FPR) is low at 0.464 %, and the true positive rate (TPR) achieved is 99.80 %. In addition, the number of features selected by DE-ME is 6 out of 41 features in the dataset. [ABSTRACT FROM AUTHOR]

Copyright of Medunarodni Problemi is the property of Institute of International Politics & Economics 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.)

In this paper, a fuzzy dual-hunting control based on auction algorithm is proposed. Relying on a single containment gives the small target the possibility of escape. Therefore, we design a dual-hunting framework for multiagent systems to hunt a small target. A hunting formation with double containment is designed to reduce the possibility of the target escaping. Then, an auction algorithm is designed to generate the desired formation and rationally plan the positions of the agents in the hunting formation. To improve the applicability of the dual-hunting framework, we take high-order multiagent systems as the research object, and the fuzzy logic system (FLS) is introduced to approximate the unknown nonlinear dynamics (UND) due to higher-order system model errors and environmental disturbances. Based on FLS and backstepping method, a hunting controller for high-order systems is designed, which enables multiagent systems to track targets and form hunting formations. Furthermore, the Lyapunov function is designed to prove the stability of the controller. Finally, the effectiveness of the proposed method is demonstrated by simulating a multiagent system containing 12 intelligences hunting for a dynamic target. [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]

All aspects of human life have become increasingly dependent on data in the last few decades. The development of several applications causes an enormous issue on data volume in current years. This information must be safeguarded and kept in safe locations. Massive volumes of data have been safely stored with cloud computing. This technology is developing rapidly because of its immense potentials. As a result, protecting data and the procedures to be handled from attackers has become a top priority in order to maintain its integrity, confidentiality, protection, and privacy. Therefore, it is important to implement the appropriate security measures in order to prevent security breaches and vulnerabilities. An improved version of Modular Encryption Standard (IMES) based on layered modelling of safety mechanisms is the major focus of this paper's research work. Key generation in IMES is done using a logistic map, which estimates the values of the input data. The performance analysis demonstrates that proposed work performs better than commonly used algorithms against cloud security in terms of higher performance and additional qualitative security features. The results prove that the proposed IMES has 0.015s of processing time, where existing models have 0.017s to 0.022s of processing time for a file size of 256KB. [ABSTRACT FROM AUTHOR]

Device-to-Device (D2D) communication has received increasing attention and been studied extensively thanks to its advantages in improving spectral efficiency and energy efficiency of cellular networks. This paper proposes a novel relay selection algorithm for multi-hop fullduplex D2D communications underlaying cellular networks. By selecting the relay of each hop in a reverse manner, the proposed algorithm reduces the heavy signaling overhead that traditional relay selection algorithms introduce. In addition, the social domain information of mobile terminals is taken into consideration and its influence on the performance of D2D communications studied, which is found significant enough not to be overlooked. Moreover, simulations show that the proposed algorithm, in absence of social relationship information, improves data throughput by around 70% and 7% and energy efficiency by 64% and 6%, compared with two benchmark algorithms, when D2D distance is 260 meters. In a more practical implementation considering social relationship information, although the proposed algorithm naturally achieves less throughput, it substantially increases the energy efficiency than the benchmarks. [ABSTRACT FROM AUTHOR]

Software-defined networking (SDN) is a networking approach that separates the network's control plane and data plane to provide better network control. The nature of SDN requires an essential focus on its reliability and availability, which includes failure detection aspects. Several techniques have been proposed to enhance SDN failure detection, including passive and active approaches. However, the Route Inspection (RI) algorithm, an example of the active probing method in failure detection, has scalability issues when deployed in large-scale networks as it generates inefficient and lengthy probe paths. To address this, we propose using Community Detection (CD) algorithms to improve the probe path generation of the RI algorithm, resulting in the 'Failure Detection using Community Detection and probing (FDCD)' framework. With the aim to reduce travel paths, the proposed framework minimises the network topology using CD algorithms to reduce the topology size into smaller communities. Then, the RI algorithm calculates the probe path in the communities instead of the single large topology, thus improving the efficiency of the failure detection mechanism. This paper adopts three CD algorithms: Louvain, Label Propagation (LP), and GirvanNewman (GN). We evaluate the framework using three well-known network topologies, COST266, PIORO40, and GERMANY50, in Mininet to observe the framework's performance. The results indicate that the proposed approach improves the algorithm's scalability against its baseline approach, improving the average probe round trip time by 66.87% and the average path installation time by 2.67%. [ABSTRACT FROM AUTHOR]

In this paper, I present a Foucauldian reflection on our datafied present. Following others, I characterize this present as a condition of "digital capitalism" and proceed to explore whether and how digital conditions present an important change of episteme and, accordingly, an importantly different mode of subjectivity. I answer both of these concerns affirmatively. In the process, I engage with Colin Koopman's recent work on infopower and argue that, despite changes in episteme and modes of subjectivity, the digital capitalist present is continuous with biopolitics as Foucault understood it, though it does raise serious worries about the possibility of transgressive resistance. [ABSTRACT FROM AUTHOR]

In this paper, a Two-Level, Three-Phase, Reduced-Switch (2L3PRS) Voltage Source Converter (VSC) based Distribution Static Synchronous Compensator (DSTATCOM) integrated with a grid-tied solar photo-voltaic (PV) array has been discussed, and its performance investigation has been carried out. A versatile control strategy is proposed, which gives the system maximum power point tracking capability with a stepped perturbation and observation (P&O) algorithm and the grid current is maintained at unity power factor. The layout, in addition to the control technique, helps in supplying active power to the power grid and feeding active and reactive power demand of the 3-phase reactive unbalanced load. Modified Synchronous Reference Frame (MSRF) theory-based current control methodology is implemented to sustain DC-link voltage and to maintain the voltage balancing across split capacitors under all loading conditions. This modified algorithm generates switching pulses for three-phase VSI with only four IGBT switches for fulfilling the desired objectives like maintaining a constant DC link voltage, balancing split-capacitor voltages, balancing the power-sharing between the power grid and the solar-PV energy system, balancing the grid currents and voltages in case of unbalanced loading conditions and maintaining unity power factor operation of the grid by making the D-STATCOM compensate for load reactive power. The proposed system is replicated in MATLAB/Simulink using SimPowerSystems software-based environment. The experimental outcomes have been obtained with a digital real-time simulator to vindicate the simulation results. The experimental, as well as simulation results of the proposed real-time-based model, are demonstrated for three unbalanced single-phase inductive linear loads and with a load on one Phase kept open in the Power Factor Correction (PFC)mode of operation of D-STATCOM. [ABSTRACT FROM AUTHOR]

This paper investigates the issue of multistatic target localization using measurements including angle of arrival (AOA), time delay (TD), and Doppler shift (DS). We delve into a practically driven nonideal localization scenario where the measurement noise powers remain unknown. An algorithm that jointly estimates target position-velocity and measurement noise powers is proposed. Initially, an optimization model for the joint estimation is developed following the maximum likelihood estimation criterion. Subsequently, we cyclically minimize the optimization model to yield estimates for target position-velocity and measurement noise powers. The Cramér-Rao lower bound (CRLB) for this joint estimation is also derived. Contrary to existing algorithms, our proposed method eliminates the need for prior knowledge of measurement noise powers, simultaneously estimating the target position-velocity and measurement noise powers. Simulation results indicate superior localization accuracy with our algorithm, particularly in scenarios with unknown measurement noise powers. Furthermore, at moderate noise levels, the algorithm's estimation accuracy for target position-velocity and measurement noise powers meets the CRLB. [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]

Complex systems in the real world often can be modeled as network structures, and community discovery algorithms for complex networks enable researchers to understand the internal structure and implicit information of networks. Existing community discovery algorithms are usually designed for single-layer networks or single-interaction relationships and do not consider the attribute information of nodes. However, many real-world networks consist of multiple types of nodes and edges, and there may be rich semantic information on nodes and edges. The methods for single-layer networks cannot effectively tackle multi-layer information, multi-relationship information, and attribute information. This paper proposes a community discovery algorithm based on multi-relationship embedding. The proposed algorithm first models the nodes in the network to obtain the embedding matrix for each node relationship type and generates the node embedding matrix for each specific relationship type in the network by node encoder. The node embedding matrix is provided as input for aggregating the node embedding matrix of each specific relationship type using a Graph Convolutional Network (GCN) to obtain the final node embedding matrix. This strategy allows capturing of rich structural and attributes information in multi-relational networks. Experiments were conducted on different datasets with baselines, and the results show that the proposed algorithm obtains significant performance improvement in community discovery, node clustering, and similarity search tasks, and compared to the baseline with the best performance, the proposed algorithm achieves an average improvement of 3.1% on Macro-F1 and 4.7% on Micro-F1, which proves the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

CC's (Cloud Computing) networks are distributed and dynamic as signals appear/disappear or lose significance. MLTs (Machine learning Techniques) train datasets which sometime are inadequate in terms of sample for inferring information. A dynamic strategy, DevMLOps (Development Machine Learning Operations) used in automatic selections and tunings of MLTs result in significant performance differences. But, the scheme has many disadvantages including continuity in training, more samples and training time in feature selections and increased classification execution times. RFEs (Recursive Feature Eliminations) are computationally very expensive in its operations as it traverses through each feature without considering correlations between them. This problem can be overcome by the use of Wrappers as they select better features by accounting for test and train datasets. The aim of this paper is to use DevQLMLOps for automated tuning and selections based on orchestrations and messaging between containers. The proposed AKFA (Adaptive Kernel Firefly Algorithm) is for selecting features for CNM (Cloud Network Monitoring) operations. AKFA methodology is demonstrated using CNSD (Cloud Network Security Dataset) with satisfactory results in the performance metrics like precision, recall, F-measure and accuracy used. [ABSTRACT FROM AUTHOR]

The problem of multi-detection multi-target tracking (MDMTT) using over-the-horizon radar in dense clutter environment is studied in this paper. The biggest challenge of MDMTT is the 3-dimensional multipath data association among measurements, detection models and targets. In particular, a lot of clutter measurements are generated in dense clutter environment, which increase the computational burden of 3-dimensional multipath data association greatly. A measurement based dimension descent association (DDA) algorithm is proposed to solve the 3-dimensional multipath data association, which decomposes the 3-dimensional multipath data association into two 2-dimensional data associations. The proposed algorithm can reduce the computational burden compared with the optimal 3-dimensional multipath data association and the computational complexity is analyzed. Besides, a time extension method is designed to detect the new-born targets that appear in the tracking scene, which is based on the sequential measurements. The convergence of the proposed measurement based DDA algorithm is analyzed. The estimation error can convergence to 0 as the number of Gaussian mixtures tends to infinity. The effectiveness and rapidity of the measurement based DDA algorithm are demonstrated by the comparative simulation with the previously proposed algorithms. • Multi-detection multi-target tracking using OTHR is studied by dimension descent. • The detection of new-born targets with unknown prior knowledge is considered. • The convergence of the novel multi-target tracking algorithm is analyzed. • The labeled GMPHD is proposed to reduce the computational burden. [ABSTRACT FROM AUTHOR]

This paper proposes an improved narrowband filtered-x least mean square(FxLMS) algorithm to overcome the thermal failure problems of the active controlled mount(ACM). Firstly, the temperature-rising model and the thermal demagnetization model of the ACM are respectively developed. Combining these two models with the powertrain mounting system model, an analytical method is established for the thermal–magnetic coupling analysis of the ACM. Then a numerical simulation is carried out to obtain the permanent magnet(PM) temperature and the coil current. The ACM failure problem is discussed according to the working point trajectory. Finally, an improved algorithm is proposed. This algorithm is able to overcome the thermal failure problems by sacrificing part of the vibration isolation performance. The effectiveness of this algorithm is validated by numerical simulations and a comparison with conventional algorithms. • Temperature rise and thermal demagnetization are mutual positive feedbacks in the active controlled mount. • Conventional algorithm leads to damage or even thermal failure in some working conditions. • An improved algorithm is able to avoid the irreversible demagnetization and stabilize the active controlled mount. • The improved algorithm maintains most part of the vibration isolation performance. [ABSTRACT FROM AUTHOR]

With the fast-moving deployment of IoT (Internet of Things) applications, a large amount of data is generated and the data is in need for processing to be able contribute to the user's requirements. All of the IoT applications require low latency and certain bandwidth to provide us with new features which are Time-Dependent. Thus, it would be advantageous to redesign the current IoT architecture by understanding the unique properties of communications and computational power to support intelligent processing of IoT data and its analysis. The paper is focused on topics such as characteristics of IoT data, trends in IoT network architecture, problems in IoT data analysis and their solutions. Thus, in particular, the paper is a discussion that Edge software-defined computing and CEP (Complex Event Processing) based fog computing as a architecture that promises to support the different requirements of IoT data analytics. And also, the paper is a discussion about how machine learning, deep learning are useful in removing data processing anomalies. The leader node election for data processing at cloud is also a time consuming task, the proposed genetic based Genetic based Leader Election Algorithm (GLEA) algorithm in the paper show promising results for the solution. [ABSTRACT FROM AUTHOR]

Sufficiently accurate, fast and computationally efficient solution of the system of linear equations is required in many estimation problems. Richardson iteration is one of the main solvers for linear equations, which provides optimization possibilities for time critical and accuracy critical applications. Convergence rate improvement and reduction of the computational complexity of the Richardson iteration are the most important problems in the area. The introduction of Newton–Schulz iterations is the efficient way for convergence rate improvement and the paper starts with systematic overview of the high-order Newton–Schulz matrix inversion algorithms. In addition, the unified framework for recursive computationally efficient convergence accelerators and error models for a number of combinations of Richardson and Newton–Schulz iterations is developed. A new nonrecursive parameter estimation concept is introduced and compared in this paper with recursive estimation. Recursive and nonrecursive Richardson algorithms together with the standard LU decomposition method were applied to the electric grid power quality monitoring problem. The algorithms were tested for the detection of the sag and swell signatures in the voltage and current signals on real data in three-phase power system. Nonrecursive Richardson algorithms which save close to half of the computational time compared to LU decomposition method were recommended for power quality monitoring applications. [ABSTRACT FROM AUTHOR]

Now, we have entered the "internet plus" era, and all industries are making use of information technology to seek a longer-term development. For vegetable distribution, we must rely on the power of information technology. Faced with complex global optimization problems, traditional optimization algorithms have many performance limitations, such as complex solution process and easy to fall into local optimization, which can't meet the needs of practical applications. This paper studies the design and application of optimization algorithm for vegetable planting and distribution based on adaptive differential evolution algorithm. The method adopted in this paper is adaptive differential evolution algorithm. In the original differential evolution algorithm, there are three undetermined parameters: population size (NP), variation factor (F) and crossover probability (CR). In the process of evolution, NP takes a fixed value, while the key control parameters F and CR, which affect the performance of the algorithm, will adaptively take different values on [0,1], and the values of F and CR will be recalculated for each individual in each generation. Let F and CR automatically adjust and change in the process of evolution. The research in this paper shows that the algorithm in this paper is effective and suitable for application. [ABSTRACT FROM AUTHOR]

Clustering is one of the most common technologies in data mining. The size, dimension and sparsity of data are all different aspects that restrict clustering analysis. Clustering machine learning is called unsupervised learning, which is different from classification in that the data objects used in clustering analysis have no class marks, so they need to be calculated by the clustering learning algorithm, while the classified data objects need class marks. At present, most of the sparse data algorithms with high attribute dimensions are oriented to binary data, and there is no evaluation method of clustering results, which brings great limitations to their application. The BP neural network, RBF neural network and Elman neural network model with feedback function, which are mature and widely used in pest prediction models, are studied. The purpose of this paper is to study diseases and pests based on sparse clustering algorithm. In this paper, algorithm formulas, models and data graphs are established to study. From the research, it can be seen that the damage index of pests and diseases is very high, reaching about 50. 54%. Through the research in this paper, we can know that the future will lay a certain foundation for the research of diseases and pests. [ABSTRACT FROM AUTHOR]

In order to be able to extract useful information from MRI medical images, we need to carry out effective image segmentation of MRI medical image and use appropriate operators to detect the edge of the image. Firstly, this paper adopts a research method based on the characteristics of horizontal, vertical and diagonal differences, and then carries out comparative analysis on different operators from different perspectives such as frequency domain and velocity domain. After analyzing the results, it is concluded that: Canny operator can detect complete, continuous and detailed edges at a faster speed. This paper uses edge detector based on Canny operator as the training output of artificial neural network. By training artificial neural network. The optimized parameters were obtained, and subjective analysis and computational analysis were performed on the quality of edge detection results of MRI medical images based on different methods. The results show that compared with the single Sobel, Canny and other traditional operators, the edge information of MRI medical image obtained by the neural network-based edge detection method is more complete and its processing time is nearly 3 times faster than the traditional edge detection method. [ABSTRACT FROM AUTHOR]

The focus of this paper is to determine how the mechanisms of each algorithm contribute to search performance. swarm-based algorithms are composed of several mechanisms. This paper regards these independent mechanisms as modules. The modules constituting each algorithm are classified into three categories: (1) the common module: a collection of mechanisms that all swarm-based algorithms have in common; (2) the main module: the unique mechanisms of each algorithm that updates the solution by interacting with other solutions; and (3) the sub module: the unique mechanisms of each algorithm that do not directly improve the quality of the solution. Testing the algorithms combined into these modules reveals the contribution of each module to performance. The experiments are conducted for the three algorithms PSO, ABC, and CS to test the usefulness of this concept. The results of these experiments revealed the following implications: (a) the main module of ABC alone can have good performance; (b) the main module of CS does not perform well as a stand-alone; (c) the combination algorithm with the main module of PSO and the sub module of ABC can improve applicability. [ABSTRACT FROM AUTHOR]

Accurate electric energy metering in micro-grid is one of the most urgent problems in the field of electric energy metering. In order to solve the problem that the lackness of electric energy metering can't be accurately calculated with the existing electric energy compensation algorithm when the electric energy metering device is completely faulty, this paper proposes an electric energy compensation algorithm that is limited in micro-grid and is based on standard particle swarm to optimize the deep belief network. Taking the historical electric energy data of each micro source metering point in micro-grid as an example, it is divided into the training set and the test set, the standard particle swarm optimization algorithm is used to determine the optimal learning layers and learning rate of deep belief network, and the electric energy algorithm model is established. The model verification results show that the proposed algorithm is nearly five times lower than the algorithm based on deep belief network solely. Further engineering case comparison shows that lackness of electric energy metering compensated by the algorithm studied in the paper is closer to the theoretical value, and the error is also less than the traditional average electricity algorithm. The real-time power curve is closer to the theoretical value, and has the higher accuracy. [ABSTRACT FROM AUTHOR]

This paper discusses the design and implementation of a Robust Shrine Affine Projection Sign (RSAPS) adaptive control algorithm for power quality improvement. Various limitations of conventional 2-level inverters can be overcome using a 5-level Cascaded H-Bridge multilevel inverter (CHB-MLI). Such a CHB-MLI is realized and controlled as a distribution static compensator (DSTATCOM) unit in this paper. The DC link of capacitors have been maintained to reference value by using proportional-integral (PI) controllers without using complex balancing circuits. Extensive simulation has been performed and a scaled -down experimental prototype model has been developed in the laboratory to test the system under steady state and dynamic load conditions using dSPACE-1104 digital signal processor. The simulation and experimental results show the source current harmonics, DC voltage regulation, power factor correction, weight updation etc. under varying load. The proposed algorithm gives satisfactory performance in terms of weight convergence, computational burden, mean square error (MSE) etc. under dynamic load conditions and in addition the THD obtained in source voltage and current is within acceptable IEEE-519 limits. [ABSTRACT FROM AUTHOR]

Classification is a common problem in various fields of life, and the key challenging task in data mining. The primary objective of the classification process is to classify the given dataset in a defined class label for all data. Many research papers widely used classification in the medical sector. Various researches have been carried out to classify medical data using different techniques, such as High Order Neural Network (HONN) combined with Back-Propagation Neural Network (BPNN) as a learning algorithm. Due to the increased data complexity, the back-propagation algorithm faced problems of slow convergence. The Back-Propagation (BP) using the gradient descent technique has the possibility of getting stuck in local minima. So, the BP algorithm may cause difficulties in finding the global minima of the error function. This paper proposed a high-order Functional Link Neural Network (FLNN). The proposed FLNN model is integrated with a metaheuristic-based searching algorithm called Accelerated Particle Swarm Optimization (APSO). The performance of the proposed Accelerated Particle Swarm Optimization Functional Link Neural Network (APSOFLNN) model is validated with various medical datasets and compared to traditional techniques such as Accelerated Particle Swarm Optimization Functional Link Back-Propagation (APSOFLBP), and Artificial Bee Colony Functional Link Neural Network (ABCFLNN). The simulation results showed that the proposed APSOFLNN algorithm for the used benchmarked datasets shows good results in terms of the mean square error (MSE) and accuracy in comparison to the traditional techniques. [ABSTRACT FROM AUTHOR]

Considering the ubiquity of WiFi enabled devices and user's mobility, location privacy within WiFi networks is one of the focus points of many researchers. Preferred Network Lists (PNL), within which devices store a list of names of previously used hotspots - Service Set Identifiers (SSIDs), is transmitted in clear by a portion of devices as a part of WiFi connection protocol. PNL has proven to be one exceptionally interesting source of private data on user's previous whereabouts. However, since the PNL datasets are anonymized, most of the available work focuses on groups of users as opposed to one particular user. In this paper we work towards finding the name of the person behind the device's PNL. We introduce a novel SSID - location tag matching function, followed by an algorithm used for intersecting large PNL datasets with localization tags on Instagram social network. The algorithm enables us to match the user's MAC address and PNL with his full name, photos and activities. We find that deanonymization of a MAC address provides serious implications for potential long term tracking. We tested our work in real life conditions on a large scale music festival. To approach the ground truth we conducted hand check tests performed by 10 testers who concluded that more than 50% of the proposed matches were correct. [ABSTRACT FROM AUTHOR]

This paper presents a novel optimal reference tracking control approach resulted from the combination of a popular policy gradient Reinforcement Learning (RL) algorithm, namely Proximal Policy Optimization (PPO), and a metaheuristic Slime Mould Algorithm (SMA). One of the most important parameters in the PPO-based RL process is the learning rate, which has a big impact on how the parameters of the actor neural network (NN) are iteratively updated. In every episode of the RL process, the weights and the biases of the actor NN are multiplied with the learning rate, determining how much the learning agent will step into a certain direction computed based on previous experiences. The classical PPO algorithm usually relies on fixed values for the learning rates which rarely change, or not at all, during the learning process. However, its main drawback is that the learning agent cannot take advantage of positive momentum in the learning process by accelerating towards good learning experiences or slow down and quickly change the direction in the case of consecutive negative learning experiences. The main objective of the combination proposed in this paper is to create an adaptive SMA-based PPO approach applied to control systems, which instead of using fixed learning rate values, it uses the SMA to compute optimal values of the learning rates in each time step of the learning process based on the progress of the learning agent. This paper investigates if the adaptive SMA-based PPO control approach can be considered as an alternative to the classical PPO version, which employs fixed values of the learning rate. A comparison is carried out using control system performance indices gathered while performing an optimal reference tracking control task on tower crane system laboratory equipment. [Display omitted] • A combination of Proximal Policy Optimization and metaheuristic SMA is given. • The adaptive approach mitigates the drawbacks of constant learning rates. • SMA computes optimal values of learning rates in each learning process step. • A comparison with classical Proximal Policy Optimization is carried out. • The validation is done on real-time nonlinear tower crane position control. [ABSTRACT FROM AUTHOR]

In this paper, an intelligent navigation system is developed to achieve accurate and rapid response to autonomous driving. The system is improved with three modules: target detection, distance measurement, and navigation obstacle avoidance. In the target detection module, the YOLOv7x-CM model is proposed to improve the efficiency and accuracy of target detection by introducing the CBAM attention mechanism and MPDioU loss function. In the obstacle distance measurement module, the concept of an off-center angle is introduced to optimize the traditional monocular distance measurement method. In the obstacle avoidance module, acceleration jump and steering speed constraints are introduced into the local path planning algorithm TEB, and the TEB-S algorithm is proposed. Finally, this paper evaluates the performance of the system modules using the KITTI dataset and the BDD100K dataset. It is demonstrated that YOLOv7x-CM improves the mAP @ 0.5 metrics by 5.3% and 6.8% on the KITTI dataset and the BDD100K dataset, respectively, and the FPS also increases by 35.4%. Secondly, for the optimized monocular detection method, the average relative distance error is reduced by 9 times. In addition, the proposed TEB-S algorithm has a shorter obstacle avoidance path and higher efficiency than the normal TEB algorithm. [ABSTRACT FROM AUTHOR]

With the advancement of remote sensing technology, the amount of remote sensing image (RSI) has increased sharply. The explosion in data volume requires higher standards of image compression and encryption technology. This paper proposes a lossless and lossy encryption-compression method for RSI. Because RSIs contain important and unimportant information, using a normal algorithm could ignore their important information or reduce the computational efficiency, so we use the trained model by DeepLabv3+ to segment the region of interest (ROI) and the region of non-interest (RONI), and implement lossless and lossy algorithms respectively. The whole algorithm is based on the newly proposed hyperchaotic system 2D Tent coupled Infinite collapse map (2D TICM). According to the 2D TICM, the dynamic 3D Latin cube is generated. This cube is then used for dynamic scrambling algorithms between multiple planes (3D LMBS), within planes (3D LMIS), and for the multiple dynamic S boxes substitution algorithm. Due to the large size of RSI, the image is divided into blocks, and MATLAB parallel mechanism is used to encrypt each block at the same time. First, the lossy part is scrambled by 3D LMIS, then compressed with 2D compressive sensing (2D CS). Finally, each block is substituted with a different S box. A CS reconstruction algorithm combining decryption and reconstruction, 2D projection gradient chaotic decryption algorithm (2D PG-CD), is proposed. The lossless part embeds the encryption into JPEG-LS, encrypts while compressing, and then encrypts according to 3D LMBS and S boxes. The algorithm in this paper considers the characteristics of RSI, experiments show that it has good security and compression performance. • A hyperchaotic system 2D Tent coupled infinite collapse map (2D-TICM) is proposed. • Lossy compression 2D CS and 2D PG-CD improves the computational efficiency. • Encryption step is integrated into JPEG-LS and compression to retain important information. • Dynamic 3D Latin cube is designed with chaos and multiple S boxes substitution are proposed. [ABSTRACT FROM AUTHOR]

Normalization of objectives plays a crucial role in evolutionary multi-objective optimization (EMO) to handle objective functions with different scales, which can be found in real-world problems. Although the effect of normalization methods on the performance of EMO algorithms has been investigated in the literature, that of preference-based EMO (PBEMO) algorithms is poorly understood. Since PBEMO aims to approximate a region of interest, its population generally does not cover the Pareto front in the objective space. This property may make normalization of objectives in PBEMO difficult. This paper investigates the effectiveness of three normalization methods in three representative PBEMO algorithms. We present a bounded archive-based method for approximating the nadir point. First, we demonstrate that the normalization methods in PBEMO perform significantly worse than that in conventional EMO in terms of approximating the ideal point, nadir point, and range of the PF. Then, we show that PBEMO requires normalization of objectives on problems with differently scaled objectives. Our results show that there is no clear "best normalization method" in PBEMO, but an external archive-based method performs relatively well. • This paper investigates the effectiveness of three normalization methods in three representative PBEMO algorithms. • We demonstrate that the normalization methods in PBEMO perform significantly worse than that in conventional EMO in terms of approximating the ideal point, nadir point, and range of the PF. scaled objectives. • We show that there is no clear "best normalization method" in PBEMO, but an external archive-based method performs relatively well. [ABSTRACT FROM AUTHOR]

Constrained multitasking optimization (CMTO) obtains increasing attention recently. The goal of CMTO is to handle multiple constrained tasks simultaneously. There are two limitations of existing studies on CMTO: (i) existing knowledge transfer techniques for CMTO may not work due to non-intersecting feasible domains and the unconsidered relationship between constraints and objectives; and (ii) knowledge diversity is lacking in existing CMTO algorithms because the representation of knowledge is biased to feasible solutions. To address these limitations, this paper proposes a co-evolution and domain adaptation (CEDA) method for CMTO. First, a new constraint relaxation-based domain adaptation technique for knowledge transfer is devised. Domain adaptation can effectively address the limitations imposed by non-intersecting feasible domains. In addition, as the population evolves, the knowledge representation is biased to different kinds of solutions. Second, a co-evolutionary strategy is proposed to improve the knowledge diversity. The two proposed techniques are with generality and can be readily integrated into different multitasking frameworks. In this paper, the CEDA method is combined with two popular multitasking (i.e., multifactorial-based and multi-population-based) frameworks. The constructed CEDA-based algorithms are compared with fifteen state-of-the-art algorithms on a CMTO benchmark suite and a real-world application. Experimental results demonstrate the superiority of the proposed CEDA method. [ABSTRACT FROM AUTHOR]

Elevator systems in buildings face challenges due to unpredictable passenger flow, which can make scheduling elevators complicated to optimize their operation. Most of the existing algorithms are developed based on pattern recognition and may not be effective in scenarios where patterns are difficult to classify, especially when elevator operations involve uncertain human behaviors. To address this issue, this paper proposes a time-dependent optimization model that considers long-term and multi-floor peaks, with a focus on peak floors. The proposed model accounts for dynamic scheduling patterns of elevators and represents passenger flow direction as a relation matrix. The proposed direction optimization method contains several functions to guide iteration direction and improve the efficiency of an iteration process based on classical algorithms. This method also ensures the stability of Markov chains by adjusting an iteration process. The feasibility of the proposed method is supported by the relevant theory, and experimental results show that the direction-optimized algorithms outperform classical algorithms, resulting in the superb operating efficiency of elevators at a lower cost. This paper contributes to the development of efficient algorithms for scheduling elevators in complex traffic patterns, which can improve performance of elevator group systems in buildings. The proposed method is not only limited to elevators but can also be extended to other transportation systems with flow requirements. • Estimating the relation between peak floors without pattern recognition. • Four relations are defined to classify the passenger flow. • Dynamically modifying three metaheuristic algorithms' iteration law. • The application for transportation systems with unpredictable flow. [ABSTRACT FROM AUTHOR]

With the development of the Internet, various forms of learning resources continue to flood the public, especially the promotion of video learning platforms. More and more people use their spare time to learn what they need. However, there is a general lack of intelligence in online learning platforms at present, which greatly reduced the utilization of online learning platforms and their educational advantages. The innovation of this paper is proposing and explaining that with the integration of big data, online education and artificial intelligence, the contradiction of online education has turned into one between the lack of intelligence in online education and the demand of users. To solve this contradiction, this paper researches from the perspective of an algorithm. Course recommendation is the core algorithm of online education. However, the current recommendation algorithm based on collaborative filtering has the disadvantages of cold start and useless recommendation content. In this paper, Apriori and ACO algorithms in artificial intelligence are studied, and the proposal of an algorithmic framework named Position-Apriori-ACO brings forth new ideas in solving online education problems. The Position-Apriori-ACO algorithm can effectively carry out course recommendation and learning path planning, and also provides a research direction for the intelligent development of online education. [ABSTRACT FROM AUTHOR]

The development of stereo matching algorithm is still one of the challenging problems, especially in ill-posed regions. Hence, this article presents a survey on the algorithm frameworks related to the stereo matching algorithm. Based on the early survey that had been conducted, two major frameworks available in current stereo matching algorithm development, they are traditional and artificial intelligence (AI) frameworks. Most of the traditional methods are very low accuracy compared to the AI-based approach. This can be observed in the standard benchmarking dataset, such as from the KITTI and the Middlebury, where AI methods rank at the top of the accuracy list. Additionally, the trend for solving computer vision problems uses AI or machine learning tools that become more apparent in recent years. Thus, this paper is focusing on the survey between the deep learning frameworks, which is one of the machine learning tools related to the convolutional neural network (CNN). Several mixed approaches between CNN based method and traditional handcraft method, as well as the end to end CNN method also discussed in this paper. [ABSTRACT FROM AUTHOR]

Cloud Computing is an alternative to conventional IT Outsourcing. As a result, cloud computing migration between organizations is rapidly growing. The adoption of this technology brings many positive aspects but prescribes various risks and concerns. An organization that officially provides its cloud computing services to external providers and implies that its IT functions and process are outsourced to third-party providers of BPO services. For privacy-making public audit processes in dynamic cloud data storage, a modified Boneh-Lynn-Shachame Dynamic Auditing (MBLSDA) algorithm is suggested in this paper. The proposed algorithm executes an audit process for multiple users based on a batch audit simultaneously and effectively to enable Third Party Auditing (TPA). This paper integrates the homomorphic authenticator in an algorithm of dynamic signing audit by random marking in terms of the privacy conserving public auditing process. When the user of cloud service, store or update the data, it encrypts using Rijndal algorithm, and Boneh-Lynn-Shacham signature generation is used for key generation. Finally, a hybrid of these a proposed Modified Boneh-Lynn-Shacham Signing Dynamic audit the data to provide the security. [ABSTRACT FROM AUTHOR]

More and more multi-objective evolutionary algorithms are proposed and used to solve many-objective optimization problems and large-scale optimization problems. However, most of the existing algorithms use fixed crossover probability (pc) and mutation probability (pm) in the generation process of offspring, which makes the performance of the algorithm poor when dealing with complex problems. In this paper, by analyzing the complex non-linear relationship between performance metrics and pc and pm in the search process of many-objective evolutionary algorithms. A fuzzy inference system is constructed to dynamically update the pc and pm in the iterative process. Therefore, a fuzzy adaptive NSGA-III algorithm is proposed and used to solve large-scale optimization problems. For the construction of fuzzy systems, this paper takes the number of iterations, convergence metric, and diversity metric as inputs, and pc and pm as outputs. Four different fuzzy systems are obtained, and the best fuzzy system is selected through experiments. In order to further verify the effectiveness of the algorithm, the proposed algorithm and the existing literature are tested on LSMOP problems. The results show that the fuzzy system can well describe the complex non-linear relationship between the performance metrics and the pc and the pm in the search process of the many-objective evolutionary algorithm. It also effectively improves the performance of the algorithm when solving large-scale optimization problems, resulting in maintenance of the convergence and diversity of the population. [ABSTRACT FROM AUTHOR]

Aiming at the shortcomings of the TextRank method (TM) which only considers the co-occurrence between words and the incipient word importance when extracting keywords, this paper proposes a tolerance rough set (TRS)-based unsupervised keyword extraction method. Generally, how to score the words in a document has a significant influence on the word graph modeling. In this paper, we improve TM in two aspects with TRS theory that is used to mine vocabulary, semantics, grammar and other information in the corpus. First, the degree of words belonging to each document is calculated to form a fuzzy membership matrix, which helps to characterize the incipient word importance. Second, the fuzzy membership of words to each word tolerance class is calculated to form a semantic correlation matrix, which contributes to optimize the transition probability of all graph edges. We apply the proposed methods to the clustering tasks of two datasets, outperforming the strong baselines. [ABSTRACT FROM AUTHOR]

Artificial Intelligence edge detection refers to a set of mathematical techniques used to recognize digital image locations. The picture brightness plays a vital role in detecting dissimilarities and making decisions. Edges are the sharp changes in pictures with respect to the brightness and are commonly categorized into a collection of curved line segments. The main focus of this paper is to find sharp corner edges and the false edges present in the MRI images. The canny edge algorithm is a popular method for detecting these types of edges. The traditional canny edge detection technique has various issues that are discussed in this paper. This study analyses the canny edge algorithm and enhances the smoothing filter, pixel identifier, and feature selection. The proposed Britwari technique, Tabu Search Heuristic Pattern Identifier (TSHPI) enhances the edge detection using SUSAN Filter. Feature Selection is performed to improvise the canny edge method. Deep Learning algorithm is used for classification of pre-trained neural networks to find a greater number of edge pixels. The implementation results show that the Britwari proposed technique (SUSAN Filter Tabu Search Heuristic Pattern Identifier Hill Climbing) reached better accuracy than the traditional Canny Edge Detection algorithms. The results produced better feature set selection using edge detection in MRI images. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika 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.)

Harmony Search Algorithm (HS) is a new meta-heuristic algorithm based on music creation process. The algorithm has been widely used in many fields because of its simple and flexible structure and fewer controlled parameters. However, HS is easy to be affected by the initial harmony memory and falls into local optimization. In addition, there are also problems, such as low searching accuracy and slow convergence speed of the optimal solution. Therefore, this paper proposes a hybrid harmony search algorithm based on firefly algorithm and boltzmann machine (HSFA-BM). First, in order to avoid the possibility of harmony search algorithm falling into local optimum, boltzmann machine (BM) mechanism is used to update the harmony memory in this paper. Second, in order to enhance the ability of the algorithm to exploit optimal solutions, this paper uses the movement mode of fireflies to generate new solutions. The improved algorithm enhances the ability of global optimization and search precision, and speeds up the convergence speed. In this paper, six classical test functions are used to test the effectiveness of the algorithm, and a very obvious optimization result is obtained. [ABSTRACT FROM AUTHOR]

Copyright of Informatica (03505596) is the property of Slovene Society Informatika 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.)

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]

Demand Side Management (DSM) plays a significant role in the smart grid to minimize Electricity Cost (EC). Home Energy Management Systems (HEMSs) have recently been studied and proposed explicitly for HEM. In this paper, we propose a novel nature-inspired hybrid Genetic Flower Pollination Algorithm (GFPA) to minimize cost with an affordable delay in appliance scheduling. Our proposed GFPA algorithm combines elements of the Genetic Algorithm (GA) and Flower Pollination Algorithm (FPA) to create a hybrid approach. To assess the effectiveness of the proposed algorithm, we consider a scalable town consisting of 1, 10, 30, and 50 homes, respectively. The proposed solution finds an optimal scheduling pattern that simultaneously minimizes EC and Peak to Average Ratio (PAR) while maximizing User Comfort (UC). We assume that all homes are homogeneous in terms of appliances and power consumption patterns. Simulation results show that our proposed scheme GFPA performs better when applying Critical Peak Pricing (CPP) signal using different Operational Time Intervals (OTIs) and compared with unscheduled, GA, and FPA-based solutions in terms of reducing cost since they achieve on average 98%, 36%, 23%, and 22%, respectively. Similarly, PAR averages 98%, 36%, 59%, and 55%, respectively. While, UC comparing to GA and FPA, are around 88%, 48%, and 63%, respectively. Our proposed scheme achieves better results by applying Real Time Pricing (RTP) signals and different OTIs. As these schemes, i.e., unscheduled, GA, FPA, and GFPA, achieve cost on average 92%, 50%, 29%, and 28%, respectively. While PAR on average 94%, 39%, 62%, and 56%, and UC for GA, FPA, and GFPA on average 98%, 52%, and 49%, respectively. Overall, our proposed GFPA algorithm offers a more effective solution for minimizing EC with an affordable delay in appliance scheduling while considering PAR and UC. [ABSTRACT FROM AUTHOR]