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

The use of unmanned aerial vehicle (UAV) during emergency response of a disaster has been widespread in recent years and the terrain images captured by the cameras on board these vehicles are significant sources of information for such disaster monitoring operations. Thus, analyzing such images are important for assessing the terrain of interest during such emergency response operations. Further, these UAVs are mainly used in disaster monitoring systems for the automated deployment of sensor nodes in real time. Therefore, deploying and localizing the wireless sensor nodes optimally, only in the regions of interest that are identified by segmenting the images captured by UAVs, hold paramount significance thereby effecting their performance. In this paper, the highly effective nature-inspired Plant Growth Simulation Algorithm (PGSA) has been applied for the segmentation of such terrestrial images and also for the localization of the deployed sensor nodes. The problem is formulated as a multi-dimensional optimization problem and PGSA has been used to solve it. Furthermore, the proposed method has been compared to other existing evolutionary methods and simulation results show that PGSA gives better performance with respect to both speed and accuracy unlike other techniques in literature.

The key links of face recognition are digital image preprocessing, facial feature extraction and pattern recognition, this article aimed at the current problem of slow speed and low recognition accuracy of face recognition , from the above three key links, on the basic of analyzing the therories of Fractional Differential Masks Operator (FDMO), Principal Component Analysis (PCA) and Support Vector Machine (SVM), design a kind of FDMO+PVA+SVM coupling algorithm that applies to face recognition to improve the speed and accuracy of it. To realize FDMO+PCA+SVM coupling algorithm, first, we should apply FDMO to face image processing binary marginalization, the purpose is getting face contour; Then, we apply PCA to get the feature of face image which is disposed by binary marainalization. At last, we can apply One-Against All of the SVM classifier and LibSVM software package to realize face recognition. Beside, the article with nine different coupling algorithm design four groups of experimental reaults on the ORL face database verified by comparative analysic FDMO+PCA+SVM coupling algorithm in the superiority of face recognition accuracy and speed.

In this paper, we first discuss the research status and application progress of the finite element method and the smoothed particle method. By analyzing the advantages of the smoothed particle method and the finite element method, a new coupling algorithm, namely FEM-SPH algorithm, is proposed. By the method of comparison, it shows that finite element method and SPH method in the simulation of large deformation problems each have advantages and disadvantages, the finite element method smoothed particle coupling algorithm is effective to achieve the performance of high computational efficiency and can naturally simulate large deformation problems across. In the process of calculation, the large deformation unit can be freely into an algorithm to facilitate the calculation accuracy and efficiency of three methods of numerical simulation. Through the study found, FEM-SPH algorithm not only overcome the defect of smooth particle tensile instability, but also overcomes the problem of low efficiency of finite element computation. To further test the FEM-SPH algorithm has advantages in the practical engineering, we have carried out the actual test to the example of the super high speed collision, concluded that, since the target of most of the computational domain is always finite element, smoothed particle focused only in contact with the projectile and target of local area, particle number is not much, the whole calculation process just ten minutes, computational efficiency has been greatly improved, at the same time in the simulation of large deformation, the advantage is very obvious .This provides a criterion for the actual project, depending on the specific material deformation mode and choose a more appropriate conversion algorithm.

As with many of the non-deterministic search algorithms, particularly those are analogous to complex biological systems, there are a number of inherent difficulties, and the Bees Algorithm (BA) is no exception. Basic versions and variations of the BA have their own drawbacks. Some of these drawbacks are a large number of parameters to be set, lack of methodology for parameter setting and computational complexity. This paper describes a Grouped version of the Bees Algorithm (GBA) addressing these issues. Unlike its conventional version, in this algorithm bees are grouped to search different sites with different neighbourhood sizes rather than just discovering two types of sites, namely elite and selected. Following a description of the GBA, the results gained for 12 benchmark functions are presented and compared with those of the basic BA, enhanced BA, standard BA and modified BA to demonstrate the efficacy of the proposed algorithm. Compared to the conventional implementations of the BA, the proposed version requires setting of fewer parameters, while producing the optimum solutions much faster.

We present a very computationally light and fast approximation algorithm and then verify it with genetic algorithm and simulated annealing. We show that our algorithm is on par with GA and SA in terms of output produced while having a tightly bounded time complexity. Our algorithm works best when there is a strong positive correlation between the reliability of a component and its cost. We present two algorithms with the same essence. One of them is system cost bounded and the other is target reliability bounded. Our proposed algorithm works on a subsystem level redundancy instead of component level redundancy.

The Microwave Humidity and Temperature sounder (MWHTS) on board the Fengyun (FY)-3C satellite measure the outgoing radiance form the Earth surface and atmospheric constituents. MWHTS makes measurements in the isolated oxygen absorption line near 118 GHz and the vicinity of strong water vapor line around 183 GHz, can provide fine vertical distribution structure of both atmospheric humidity and temperature. However, in order to obtain the accurate soundings of humidity and temperature by the physical retrieval method, bias between the observed radiance and those simulated by radiative transfer model from the background or first guess profiles must be correct. In this study, two bias correction methods are developed through the correlation analysis between MWHTS measurements and air mass identified by the first guess profiles of the physical inversion, one is the linear regression correction (LRC) and the other is neural networks correction (NNC), representing the linear and nonlinear nature between MWHTS measurements and air mass, respectively. Both correction methods have been applied to MWHTS observed brightness temperatures over the geographic area (180° W-180° E, 60° S-60° N). The corrected results are evaluated by the probability density function of the difference between corrected observations and simulated values and the root mean square error (RMSE) with respect to simulated observations. The numerical results show that the NNC method perform better, especially in MWHTS channels 1 and 7-9 whose peak weight function heights are close to the surface. In order to assess the effects of bias correction methods proposed in this study on the retrieval accuracy, a one-dimensional variational system was built and applied to the MWHTS uncorrected and corrected brightness temperatures to estimated atmospheric temperature and humidity profiles, The retrieval results show that the NNC has better performance which is to be expected. An indication of the stability and robustness of NNC method is given which suggests that the NNC method has promising application perspectives in the physical retrieval.

A reinforcement learning algorithm is proposed to improve the accuracy of short-term load forecasting (STLF) in this article. The proposed model integrates radial basis function neural network (RBFNN), support vector regression (SVR), and adaptive annealing learning algorithm (AALA). In the proposed methodology, firstly, the initial structure of RBFNN is determined by using SVR. Then, an AALA with time-varying learning rates is used to optimize the initial parameters of SVR-RBFNN (AALA-SVR-RBFNN). In order to overcome the stagnation for searching optimal RBFNN, a particle swarm optimization (PSO) is applied to simultaneously find promising learning rates in AALA. Finally, the short-term load demands are predicted by using the optimal RBFNN. The performance of the proposed methodology is verified on the actual load dataset from Taiwan Power Company (TPC). Simulation results reveal that the proposed AALA-SVR-RBFNN can achieve a better load forecasting precision as compared to various RBFNNs.

With the increasing concern of environment, the energy-efficiency scheduling of manufacturing industry is becoming urgent and popular. In turning processes, both spindle speed and processing time can affect the final energy consumption and thus the spindle speed and scheduling scheme need to be optimized simultaneously. Since the turning workshop can be regarded as the flexible flow shop, this paper formulates a mixed integer linear programming model for energy-efficient scheduling of flexible flow shop. Accordingly, a new decoding method is developed by considering of the optimization of spindle speed and scheduling scheme simultaneously, and an estimation of distribution algorithm adopting the new decoding method is proposed to solve large-size problems. The parameters of this algorithm are determined by statistical technique with a simplified practical case. In order to validate the proposed method, a case from practical factories is studied, in which the makespan can be shortened by 25.22%, and the consumed energy can be saved by 5.48%. These results demonstrate the effectiveness of the proposed mathematical model and algorithm.

Accurate forecasting of icing thickness has a great significance for ensuring the security and stability of power grid. In order to improve the forecasting accuracy, this paper proposes an icing forecasting system based on fireworks algorithm and weighted least square support vector machine (W-LSSVM). The method of fireworks algorithm is employed to select the proper input features with the purpose of eliminating the redundant influence. In addition, the aim of W-LSSVM model is to train and test the historical data-set with the selected features. The capability of this proposed icing forecasting model and framework is tested through the simulation experiments using real-world icing data from monitoring center of key laboratory of anti-ice disaster, Hunan, South China. The results show that the proposed W-LSSVM-FA method has a higher prediction accuracy and it may be a promising alternative for icing thickness forecasting.

Clock Network Design (CDN) is a critical step while designing any Integrated-Circuits (ICs). It holds vital importance in the performance of entire circuit. Due to continuous scaling, 3D ICs stacked with TSV are gaining importance, with an objective to continue with the Moore's law. Through-Silicon-Via (TSV) provides the vertical interconnection between two die, which allows the electrical signal to flow through it. 3D ICs has many advantages over conventional 2D planar ICs like reduced power, area, cost, wire-length etc. The proposed work is mainly focused on power reduction and obstacle avoidance for 3D ICs. Various techniques have already been introduced for minimizing clock power within specified clock constraints of the 3D CND network. Proposed 3D Clock Tree Synthesis (CTS) is a combination of various algorithms with an objective to meet reduction in power as well as avoidance of obstacle or blockages while routing the clock signal from one sink to other sink. These blockages like RAM, ROM, PLL etc. are fixed during the placement process. The work is carried out mainly in three steps- first is Generation of 3D Clock tree avoiding the blockages, then Buffering and Embedding and finally validating the results by SPICE simulation. The experimental result shows that our CTS approach results in significant 9% reduction in power as compare to the existing work.

In order to improve the performance of the draft tube in hydraulic turbine, a multi–objective optimization method for the draft tube is developed by combining the design of experiment (DOE), the radial basis function (RBF) and the non–dominated sorting genetic algorithm (NSGA–II) in this paper. The geometrical design variables of the median section in the draft tube and the cross section in its exit diffuser are considered as design parameters in this optimization, which objective function is to maximize the pressure recovery factor (Cp) and minimize the energy loss coefficient (ζ). The limited numbers of design matrix required for the shape optimization of the draft tube is generated by optimal Latin hypercube (OLH) method of the DOE technique, of which performances are evaluated through computational fluid dynamic (CFD) numerical simulation. For reducing of the computational consumption, the approximate model is used based on the RBF. The Pareto optimal solutions are finally performed using the NSGA–II for obtaining the best geometrical parameters of the draft tube. The optimization result of the draft tube shows a marked performance improvement over the original, which verifies the theoretical validity and feasibility of the proposed method in this paper.

With the development of higher voltage power grid, the high and low voltage parallel loops are emerging, which lead to energy losses, even threaten the security and stability of power system. The multi-infeed HVDC configurations widely appearing in AC/DC interconnected power system make this situation even worse. Aimed at energy saving and system security, a decision optimization method for power grid operating condition with high and low voltage parallel loops is proposed in this paper. Firstly, considering hub substation distribution and power grid structure, parallel loop opening schemes are generated with GN algorithm. Then, candidate opening schemes are preliminarily selected from all these generated schemes based on a filtering index. Finally, with the influence on power system security, stability and operation economy in consideration, an evaluation model for candidate opening schemes is founded based on analytic hierarchy process (AHP). And a fuzzy evaluation algorithm is used to find the optimal scheme. Simulation results of New England 39-bus system and an actual power system validate the effectiveness and superiority of this proposed method.

In this brief paper a quantum algorithm to calculate the Hamming distance of two binary strings of equal length (or messages in theory information) is presented. The algorithm calculates the Hamming weight of two binary strings in one query of an oracle. To calculate the hamming distance of these two strings we only have to calculate the Hamming weight of the xor operation of both strings. To test the algorithms the quantum computer prototype that IBM has given open access to on the cloud has been used to test the results.

Reservoirs are recognized as one of the most efficient infrastructure components in integrated water resources management and development. At present, with the ongoing advancement of social economy and requirement of water, the water resources shortage problem has worsened, and the operation of reservoirs, in terms of consumption of flood water, has become significantly important. Reservoirs perform both regulation of flood and integrated water resources management, in which the flood limited water level is considered as the most important parameter for trade-off between regulation of flood and conservation. To achieve optimal operating policies for reservoirs, large numbers of simulation and optimization models have been developed in the course of recent decades, which vary notably in their applications and working. Since each model has their own limitations, the determination of fitting model for derivation of reservoir operating policies is challenging and most often there is always a scope for further improvement as the selection of model depends on availability of data. Subsequently, assessment and evaluation associated with the operation of reservoir stays conventional. In the present study, the Soil and Water Assessment Tool (SWAT) models and a Genetic Algorithm model has been developed and applied to two reservoirs in Ganga River basin, India to derive the optimal operational policies. The objective function is set to minimize the annual sum of squared deviation form desired irrigation release and desired storage volume. The decision variables are release for irrigation and other demands (industrial and municipal demands), from the reservoir. As a result, a simulation-based optimization model was recommended for optimal reservoir operation, such as allocation of water, flood regulation, hydropower generation, irrigation demands and navigation and e-flows using a definite combination of decision variables. Since the rule curves are derived through random search it is found that the releases are same as that of demand requirements. Hence based on simulated result, in the present case study it is concluded that GA-derived policies are promising and competitive and can be effectively used operation of the reservoir.

the intermittency and variability of these permeated Distributed Generators (DGs) could critically cause many security and economy risks to distribution systems. This paper applied a certain mathematical distribution to imitate the output variability and uncertainty of DGs. And then, four risk indices EENS, PLC, EFLC and SI were established to reflect the system risk level of distribution system. For the certain mathematical distribution of the DGs' output power, a developed PEM (point estimate method)-based method was proposed to calculate these four system risk indices. In this developed PEM-based method, enumeration method was used to list the states of distribution systems, an improved PEM was presented to deal with the uncertainties of DGs and the value of load curtailment in distribution systems was calculated by an optimal power flow algorithm. Finally, the effectiveness and advantages of this proposed PEM-based method for distribution system assessment were verified by the tests of a modified IEEE 30-bus system. Simulation results have shown that this proposed PEM-based method has a high computational accuracy and highly reduced computational costs compared with other risk assessment methods and is very effective for risk assessments.

The k-means is one of the most popular and widely used clustering algorithm, however, it is limited to only numeric data. The k-prototypes algorithm is one of the famous algorithms for dealing with both numeric and categorical data. However, there have been no studies to accelerate k-prototypes algorithm. In this paper, we propose a new fast k-prototypes algorithm that gives the same answer as original k-prototypes. The proposed algorithm avoids distance computations using partial distance computation. Our k-prototypes algorithm finds minimum distance without distance computations of all attributes between an object and a cluster center, which allows it to reduce time complexity. A partial distance computation uses a fact that a value of the maximum difference between two categorical attributes is 1 during distance computations. If data objects have m categorical attributes, maximum difference of categorical attributes between an object and a cluster center is m. Our algorithm first computes distance with only numeric attributes. If a difference of the minimum distance and the second smallest with numeric attributes is higher than m, we can find minimum distance between an object and a cluster center without distance computations of categorical attributes. The experimental shows proposed k-prototypes algorithm improves computational performance than original k-prototypes algorithm in our dataset.

Information security plays a major role in the dynamics of today’s interconnected world. Despite the successful implementation and effectiveness of modern cryptographic techniques, their inherent limitations can be exploited by quantum computers. In this article we discuss Grover’s quantum searching algorithm and its impact on the security of modern symmetric ciphers. More specifically, we present its formal description and give an implementation of the algorithm using IBM’s Qiskit framework, which allows us to simulate and run the program on a real device. The developed program is modular and scalable, managing to properly run on any input state. We compare the performance of the algorithm running on the local simulator against its execution on a quantum processor from IBM’s lineup, noting the discrepancies between the results due to physical characteristics of the chip.

Variational mode decomposition (VMD) is a recently introduced adaptive signal decomposition algorithm with a solid theoretical foundation and good noise robustness compared with empirical mode decomposition (EMD). There is a lot of background noise in the vibration signal of diesel engine. To solve the problem, a denoising algorithm based on VMD and Euclidean Distance is proposed. Firstly, a multi-component, non-Gauss, and noisy simulation signal is established, and decomposed into a given number K of band-limited intrinsic mode functions by VMD. Then the Euclidean distance between the probability density function of each mode and that of the simulation signal are calculated. The signal is reconstructed using the relevant modes, which are selected on the basis of noticeable similarities between the probability density function of the simulation signal and that of each mode. Finally, the vibration signals of diesel engine connecting rod bearing faults are analyzed by the proposed method. The results show that compared with other denoising algorithms, the proposed method has better denoising effect, and the fault characteristics of vibration signals of diesel engine connecting rod bearings can be effectively enhanced.

The optimization of guide vane closing schemes (OGVCS) of pumped storage hydro unit (PSHU) is the research field of cooperative control and optimal operation of pumped storage, wind power and solar power generation. This paper presents a OGVCS model of PSHU considering the rise rate of the unit rotational speed and the specific node pressure of each hydraulic unit, as well as various complicated hydraulic and mechanical constraints. OGVCS model is formulated as a multi-objective optimization problem to optimize conflictive objectives, i.e., unit rotational speed and water hammer pressure criteria. In order to realize the efficient solution of the OGVCS model, an enhanced multi-objective bacterial-foraging chemotaxis gravitational search algorithm (EMOBCGSA) is proposed to solve this problem, which adopts population reconstruction, adaptive selection chemotaxis operator of local searching strategy and Elite archive set to efficiently solve the multi-objective problem. Especially, novel constraints-handling strategy with eliminating and local search based on violation ranking is used to balance various hydraulic and mechanical constraints. Finally, simulation cases of complex extreme operating conditions (i.e., load rejection and pump outage) of ‘single tube-double units’ type PSHU system are conducted to verify the feasibility and effectiveness of the proposed EMOBCGSA in solving OGVCS problem. The simulation results indicate that the proposed EMOBCGSA can provide lower rise rate of the unit rotational speed and smaller water hammer pressure than other method established recently while considering various complex constraints in OGVCS problem.

Multidisciplinary Design Optimization (MDO) is the most active field in the design of current complex system engineering, which is possessed with such two difficulties as subsystem information exchange and analytical and computational complexity of systems. Therefore, an improved collaborative optimization algorithm based on ANN (artificial neural network) response surface was proposed dependent on the consistency constraint algorithm and concurrent subspace algorithm. As an optimization method with secondary structure, it satisfied only local constraints in discipline layer, but provided a coordinated mechanism for interdisciplinary conflict in system layer. Finally, it was applied in the multidisciplinary design optimization of autonomous underwater vehicle (AUV). As shown from the result, the MDO convergence stability and reliability of low resistance, low noise and high maneuvering performance of the AUV shape can be ensured by the improved collaborative optimization algorithm, thus verifying the effectiveness of the algorithm.

The global climate change mitigation efforts have increased the efforts of national government to incentivize local households in adopting individual renewable energy as a mean to help reduce the usage of electricity generated using fossil fuels and to gain independence from the grid. Since the majority of residential generation is made by PV panels that generate electricity at off-peak hours, the optimal management of such installations often considers local storage that can defer the use of locally generated electricity at later times. On the other hand, the presence of distributed generation can affect negatively the operating conditions of low-voltage distribution networks. The energy stored in batteries located in optimal places in the network can be used by the utility to improve the operation of the network. This paper proposes a metaheuristic approach based on a Genetic Algorithm that considers three different scenarios of using energy storage for reducing the losses in the network. Prosumer and network operator priorities can be considered in different scenarios inside the same algorithm, to provide a comparative study of different priorities in storage placement. A case study performed on a real distribution network provides insightful results.

Breast cancer is a significant health issue across the world. Breast cancer is the most widely-diagnosed cancer in women; early-stage diagnosis of disease and therapies increase patient safety. This paper proposes a synthetic model set of features focused on the optimization of the genetic algorithm (CHFS-BOGA) to forecast breast cancer. This hybrid feature selection approach combines the advantages of three filter feature selection approaches with an optimize Genetic Algorithm (OGA) to select the best features to improve the performance of the classification process and scalability. We propose OGA by improving the initial population generating and genetic operators using the results of filter approaches as some prior information with using the C4.5 decision tree classifier as a fitness function instead of probability and random selection. The authors collected available updated data from Wisconsin UCI machine learning with a total of 569 rows and 32 columns. The dataset evaluated using an explorer set of weka data mining open-source software for the analysis purpose. The results show that the proposed hybrid feature selection approach significantly outperforms the single filter approaches and principal component analysis (PCA) for optimum feature selection. These characteristics are good indicators for the return prediction. The highest accuracy achieved with the proposed system before (CHFS-BOGA) using the support vector machine (SVM) classifiers was 97.3%. The highest accuracy after (CHFS-BOGA-SVM) was 98.25% on split 70.0% train, remainder test, and 100% on the full training set. Moreover, the receiver operating characteristic (ROC) curve was equal to 1.0. The results showed that the proposed (CHFS-BOGA-SVM) system was able to accurately classify the type of breast tumor, whether malignant or benign.

Computer network attacks are evolving in parallel with the evolution of hardware and neural network architecture. Despite major advancements in Network Intrusion Detection System (NIDS) technology, most implementations still depend on signature-based intrusion detection systems, which can’t identify unknown attacks. Deep learning can help NIDS to detect novel threats since it has a strong generalization ability. The deep neural network’s architecture has a significant impact on the model’s results. We propose a genetic algorithm based model to find the optimal number of hidden layers and the number of neurons in each layer of the deep neural network (DNN) architecture for the network intrusion detection binary classification problem. Experimental results demonstrate that the proposed DNN architecture shows better performance than classical machine learning algorithms at a lower computational cost.

The current work addresses the control of two-input two-output (TITO) Wood and Berry model of a binary distillation column. The controller design problem is formulated in terms of multivariable H_∞ control synthesis. The controller structure takes the form of simplest static output feedback (SOF) control. The controller synthesis is performed using a hybrid approach of blending linear matrix inequalities (LMI) and genetic algorithm (GA). The performance of the static output feedback controller is compared with three other controllers designed for Wood and Berry model available in the literature. The first simulation study is performed for the case of tracking a unit step command in the presence of a step change in output disturbance. A second simulation study is performed for rejecting a change in sinusoidal output disturbance.

An acrobot is a planar robot with a passive actuator in its first joint. The control problem of the acrobot tries to make it rise from the rest position to the inverted pendulum position. This control problem can be divided in the swing-up problem, when the robot has to rise itself through swinging up as a human acrobat does, and the balancing problem, when the robot has to maintain itself on the inverted pendulum position. We have developed three controllers for the swing-up problem applied to two types of motors: small and big. For small motors, we used the SARSA controller and the PD with a trajectory generator. For big motors, we propose a new controller to control the acrobot, a PWM controller. All controllers except SARSA are tuned using a Genetic Algorithm.

The greenhouse gases and air pollution generated by extensive energy use have exacerbated climate change. An electric-bus (e-bus) transportation system favors reducing pollution and carbon emissions. This study analyzed the minimization of construction costs for an all battery-swapping public e-bus transportation system. A simulation was conducted according to existing timetables and routes. Daytime charging was incorporated during the hours of operation; the two parameters of the daytime charging scheme were the residual battery capacity and battery-charging energy during various intervals of daytime peak electricity hours. The parameters were optimized using three algorithms: particle swarm optimization (PSO), a genetic algorithm (GA), and a PSO–GA. This study observed the effects of optimization on cost changes (e.g., number of e-buses, on-board battery capacity, number of extra batteries, charging facilities, and energy consumption) and compared the plug-in and battery-swapping e-bus systems. The results revealed that daytime charging can reduce the construction costs of both systems. In contrast to the other two algorithms, the PSO–GA yielded the most favorable optimization results for the charging scheme. Finally, according to the cases investigated and the parameters of this study, the construction cost of the plug-in e-bus system was lower than that of the battery-swapping e-bus system.

In this paper, the methods and their analysis for estimating the location of three dimension (3-D) single source buried in lossy medium are presented with uniform circular array (UCA). The mathematical model of the signal in the lossy medium is proposed. Using location information in the covariance matrix obtained by sensors’ output, the equations of the source location (azimuth angle, elevation angle and range) are obtained. The phase and amplitude of the covariance matrix function are used to process these equations respectively. Then, the phase and amplitude of the covariance matrix function are used to process the source localization in the conductive medium together. By analyzing the characteristics of the proposed methods and MUSIC method, the computational complexity and the valid range of these methods are given. From the results, whether the loss is known, we can choose the appropriate method to process the issues (localization in lossless medium or lossy medium).

In this paper a variable’s involved in assessing the quality of a distributed generation system are reviewed, aiming to minimize the electric power losses (unused power consumption) and optimize the voltage profile. To provide this assessment, several experiments have been made to the IEEE 34-bus test case and various actual test cases with the respect of multiple DG units. The possibility and effectiveness of the proposed algorithm for optimal placement and sizing of DG in distribution systems have been verified. Finally, four algorithms were trailed: simulated annealing (SA), hybrid genetic algorithm (HGA), genetic algorithm (GA) and variable neighbourhood search. The HGA algorithm was found to produce the best solution at a cost of longer processing time.

The precise prediction of air contaminant dispersion is essential to the air quality monitoring and the emergency management of the contaminant gases leakage incidents in the chemical industry park. The conventional atmospheric dispersion models can seldom give precise prediction due to inaccurate input parameters. In order to improve the prediction accuracy of dispersion model, two data assimilation methods (i.e. one is merely based on the typical particle filter while the other is a combination of particle filter and expectation-maximization algorithm) are proposed to assimilate the UAV observations into the atmospheric dispersion model. Two emission cases are taken into consideration, the difference between which is the different dimensions of state variables. To test the performances of the proposed methods, experiments corresponding to the two emission cases are designed and implemented. The results show that the particle filter can effectively estimate the model parameters and improve the accuracy of model prediction when the dimension of state variables is low. In contrast, when the dimension of state variables becomes higher, the method of particle filter combining expectation-maximization algorithm performs better in the parameter estimation accuracy and warm-up time. Therefore, the data assimilation methods are able to effectively support the air quality monitoring and emergency management in chemical industry parks.

Proteins are the workhorses of the cell that perform biological functions by interacting with other proteins. Many statistical methods for protein-protein interaction (PPI) have been studied without considering time-dependent changes in networks and the functionalities. I introduced a novel method that models PPI networks as being dynamic in nature and evolving time-varying multivariate distribution with Conditional Random Fields (CRF). This research is directed towards implementing this new combinatorial algorithm on massively parallel architectures such as Graphics Processing Units (GPUs) for efficient computations for large scale bioinformatics datasets. I compared Conditional Random Fields (CRF) and the proposed novel method using CRF combined with the Block Coordinate Descent algorithm for human protein-protein interaction data set. Both are implemented on GPU-Accelerated Computing Architecture and the proposed novel method showed the advantages in predicting protein-protein interaction sites. I also show that the proposed approach is more efficient in 6.13% than standalone CRF++ in predicting protein-protein interaction sites.

A new variant of two-echelon routing problem is investigated, where the truck and the drone are used to cooperatively complete the deliveries of all parcels. The truck not only acts as a tool for parcel delivery, but also serves as a moving depot for the drone. The drone can carry several parcels and take off from the truck, while returning to the truck after completing the delivery. The energy consumption model for the routing process of the drone is analyzed, when it is utilized to deliver multiple parcels. A two-stage route-based modelling approach is proposed to optimize both the truck’s main route and the drone’s adjoint flying routes. A hybrid heuristic integrating nearest neighbor and cost saving strategies is developed to quickly construct a feasible solution. The simulated annealing algorithm is applied to improve the quality of the solution, where a Tabu list is employed to improve the search efficiency. Random instances at different scales are used to test the performance of the proposed algorithm. A case study based on the practical road network in Changsha, China, is presented, through which the sensitivity analysis is conducted with respect to some critical factors.

A radial basis function network (RBFN) method is proposed to reconstruct daily Sea surface temperatures (SSTs) with limited SST samples. For the purpose of evaluating the SSTs using this method, non-biased SST samples in the Pacific Ocean (10°N–30°N, 115°E–135°E) are selected when the tropical storm Hagibis arrived in June 2014, and these SST samples are obtained from the OISST products according to the distribution of AVHRR L2p SST and in-situ SST data. Furthermore, an improved nearest neighbor cluster (INNC) algorithm is designed to search the optimal hidden knots for RBFNs from both the SST samples and the background fields. Then the reconstructed SSTs from the RBFN method are compared with the results from the optimum interpolation (OI) method. The statistical results show that the RBFN method has a better performance of reconstructing SST than the OI method in the study, and the average RMSE is 0.48°C for the RBFN method, which is quite smaller than the value of 0.69°C for the OI method. Additionally, the RBFN methods with different basis functions and clustering algorithms are tested, and we discover that the INNC algorithm with multi-quadric function is quite suitable for the RBFN method to reconstruct SSTs when the SST samples are sparsely distributed.

This paper proposes a method based on genetic algorithm (GA) for the security-constrained optimal dispatch of integrated natural gas and electricity networks, considering operating scenarios in both energy systems. The mathematical formulation of the optimization problem consists of a multi-objective function which aims to minimize both cost of thermal generation (diesel and natural gas) as well as the production and transportation of natural gas. The joint gas-electricity system is modeled by two separate groups of nonlinear equation, which are solved by the combination of Newton's method with the GA. The applicability of the proposed method is tested in the Belgian gas network integrated with the IEEE 14-bus test system and a 15-node natural gas network integrated with the IEEE 118-bus test system. The results demonstrate that the proposed method provides efficient and secure solutions for different operating scenarios in both energy systems.

Nowadays genetic algorithm (GA) is greatly used in engineering pedagogy as an adaptive technique to learn and solve complex problems and issues. It is a meta-heuristic approach that is used to solve hybrid computation challenges. GA utilizes selection, crossover, and mutation operators to effectively manage the searching system strategy. This algorithm is derived from natural selection and genetics concepts. GA is an intelligent use of random search supported with historical data to contribute the search in an area of the improved outcome within a coverage framework. Such algorithms are widely used for maintaining high-quality reactions to optimize issues and problems investigation. These techniques are recognized to be somewhat of a statistical investigation process to search for a suitable solution or prevent an accurate strategy for challenges in optimization or searches. These techniques have been produced from natural selection or genetics principles. For random testing, historical information is provided with intelligent enslavement to continue moving the search out from the area of improved features for processing of the outcomes. It is a category of heuristics of evolutionary history using behavioral science-influenced methods like an annuity, gene, preference, or combination (sometimes refers to as hybridization). This method seemed to be a valuable tool to find solutions for problems optimization. In this paper, the author has explored the GAs, its role in engineering pedagogies, and the emerging areas where it is using, and its implementation.

Automatic methods for constructing navigation routes do not fully meet all requirements. The aim of this study was to modify the methodology for generating indoor navigation models based on the Medial Axis Transformation (MAT) algorithm. The simplified method for generating corridor axes relies on the Node-Relation Structure (NRS) methodology. The axis of the modeled structure (corridor) is determined based the points of the middle lines intersecting the structure (polygon). The proposed solution involves a modified approach to the segmentation of corridor space. Traditional approaches rely on algorithms to construct Triangulated Irregular Networks (TINs) by Delaunay triangulation or algorithms for generating Thiessen polygons known as Voronoi diagrams (VDs). In this study, both algorithms were used in the segmentation process. The edges of TINs intersect structures. Selected midpoints on TIN edges, which are located in the central part of the structure, are used to generate VDs. Polygon VDs segment corridor structures. The identifiers or structure nodes are the midpoints on TIN edges rather than the calculated centroids. The generated routes are not zigzag lines, and they approximate natural paths. The main advantage of the proposed solution is its simplicity which can be attributed to the use of standard tools for processing spatial data in a geographic information system.

The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications. In this work, we present an efficient algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex Cover) for CVC in general graphs. The algorithm has two main phases, i.e., construction phase and local search phase. To construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list in the construction phase. The configuration checking strategy is adopted to decrease the cycling problem in the local search phase. The experimental results demonstrate that GRASP-CVC is competitive with the other competitive algorithm, which validate the effectivity and efficiency of our GRASP-CVC solver.

This paper describes a polynomial time algorithm for solving graph isomorphism and automorphism. We introduce a new tree data structure called Walk Length Tree. We show that such tree can be both constructed and compared with another in polynomial time. We prove that graph isomorphism and automorphism can be solved in polynomial time using Walk Length Trees.

A transform approach based on a variable initial time (VIT) formulation is developed for discrete-time signals and linear time-varying discrete-time systems or digital filters. The VIT transform is a formal power series in z^(-1) which converts functions given by linear time-varying difference equations into left polynomial fractions with variable coefficients, and with initial conditions incorporated into the framework. It is shown that the transform satisfies a number of properties that are analogous to those of the ordinary z-transform, and that it is possible to do scaling of z^(- i) by time functions which results in left-fraction forms for the transform of a large class of functions including sinusoids with general time-varying amplitudes and frequencies. Using the extended right Euclidean algorithm in a skew polynomial ring with time-varying coefficients, it is shown that a sum of left polynomial fractions can be written as a single fraction, which results in linear time-varying recursions for the inverse transform of the combined fraction. The extraction of a first-order term from a given polynomial fraction is carried out in terms of the evaluation of z^(i) at time functions. In the application to linear time-varying systems, it is proved that the VIT transform of the system output is equal to the product of the VIT transform of the input and the VIT transform of the unit-pulse response function. For systems given by a time-varying moving average or an autoregressive model, the transform framework is used to determine the steady-state output response resulting from various signal inputs such as the step and cosine functions.

The key objective of the present paper is to propose a numerical scheme based on the homotopy analysis transform technique to analyze the time-fractional nonlinear predator-prey population model. The population model is coupled fractional order nonlinear partial differential equations often employed to narrate the dynamics of biological systems in which two species interact, first is a predator and the second is a prey. The proposed scheme provides the series solution with great freedom and flexibility by choosing appropriate parameters. The convergence of results is free from small or large parameters. Three examples are discussed to demonstrate the correctness and efficiency of the used computational approach.

Delineating the cropping area of cocoa agroforests is a major challenge for quantifying the contribution of the land use expansion to tropical deforestation. Discriminating cocoa agroforests from tropical transition forests using multi-spectral optical images is difficult due to a similarity in the spectral characteristics of their canopy; moreover, optical sensors are largely impeded by the frequent cloud cover in the tropics. This study explores multi-season Sentinel-1 C-band SAR image to discriminate cocoa agroforests from transition forests for a heterogeneous landscape in central Cameroon. We use an ensemble classifier, random forest, to average SAR image texture features of GLCM (Grey Level Co-occurrence Matrix) across seasons; next, we compare classification performance with results from RapidEye optical data. Moreover, we assess the performance of GLCM texture feature extraction at four different grey level quantization: 32bits, 8bits, 6bits, and 4bits. The classification overall accuracy (OA) of texture-based maps outperformed that from an optical image; the highest OA of 88.8% was recorded at 6bits grey level. This quantization level, in comparison to the initial 32bits in SAR images, reduced the class prediction error by 2.9%. Although this prediction gain may be large for the landscape area, the resultant thematic map reveals the decrease and fragmentation of forest cover by cocoa agroforests. According to our classification validation, the Shannon entropy (H) or uncertainty provides a reliable validation for class predictions and reveals detail inference for discriminating inherently heterogeneous vegetation categories. The texture-based classification achieved a reliable accuracy considering the heterogeneity of the landscape and vegetation classes.

A programmable DC power supply with Real-time Digital Simulator (RTDS)-based photovoltaic (PV) Power Hardware-In-the-Loop (PHIL) simulators have been used to improve the control algorithm and reliability of PV Inverter. This paper proposes a supervisory control algorithm for PV PHIL simulator with non-RTDS device that is an alternative solution of high cost PHIL simulator. However, when such a simulator with conventional algorithm which is used in RTDS is connected to a PV inverter, the output is in the transient state and it makes it impossible to evaluate the performance of the PV Inverter. Therefore proposed algorithm controls the voltage and current target values according to the constant voltage (CV) and constant current (CC) modes to overcome the limitation of the Computing Unit, DC power supply and also uses a multi-rate system to account for the characteristics of each component of simulator. A mathematical models of a PV system, programmable DC power supply, isolated DC measurement device and Computing Unit are integrated to form a real-time processing simulator. Performance tests using a PV PHIL simulator which is applied proposed algorithm connected a PV inverter are carried out and proved superiority and utility of this method against conventional methods.

AIUS (Atmospheric Infrared Ultraspectral Sounder) is an infrared occultation spectrometer onboard the Chinese GaoFen-5 satellite, which covers a spectral range of 2.4–13.3 μm (750–4100 cm⁻¹) with a spectral resolution of about 0.02 cm⁻¹. AIUS is designed to measure and study chemical processes of ozone (O₃) and other trace gases in the upper troposphere and stratosphere around Antarctic. In this study, the corresponding retrieval methodology is described. The retrieval simulations based on the simulated spectra of AIUS have been carried out, with a focus on O₃. The relative difference between the retrieved and the true O₃ profiles is within 5% from the 15 km to 70 km and about 10% below 15 km. The corresponding averaging kernels illustrate that the overall retrieval information mainly come from the spectra, not the a priori. The retrieval experiments also demonstrate that the shape of the retrieved profiles resembles the shape of the true profile even if the shape of the a priori profile is different from that of the true profile. Further, we perform the O₃ retrieval from the real ACE-FTS (Atmospheric Chemistry Experiment-Fourier Transform Spectrometer) measurements and compare the results with the official ACE-FTS Level-2 products. Overall, both profiles agree well in the stratosphere where the retrieval sensitivity is high. The relative difference between both profiles is about 15% below 70 km, which may due to the measurement errors and different forward model parameters.

It is difficult to capture the real-time online measurement data for biochemical oxygen demand (BOD) in wastewater treatment processes. An optimized extreme learning machine (ELM) based on an improved cuckoo search algorithm (ICS) is proposed in this paper for the design of soft BOD measurement model. In ICS-ELM, the input weights matrices of the extreme learning machine (ELM) and the threshold of the hidden layer are encoded as the cuckoo's nest locations. The best input weights matrices and threshold are obtained by using the strong global search ability of improved cuckoo search (ICS) algorithm. The optimal results can be used to improve the precision of forecasting based on less number of neurons of the hidden layer in ELM. Simulation results show that the soft sensor model has good real-time performance, high prediction accuracy and stronger generalization performance for BOD measurement of the effluent quality compared to other modeling methods such as back propagation (BP) network in most cases.

Multi-objective optimization (MOO) is the subset of optimization which deals with minimization of several objective functions more than the conventional one objective optimization. These have useful application in decision making. Many of the current methodologies addresses challenges and solutions to multi-objective optimization problem which attempt to simultaneously solve several objectives with multiple constraints subjoined to each objective. Such as evolutionary algorithm, genetic algorithm, flower pollination algorithm, and many more. However, most challenges in MOO are generally subjected to linear inequality constraints that prevent all objectives from being optimized at once. This paper discusses some approaches presented by scholars in MOO and then presents some new concepts by introducing methods in solving problem in MOO which comes due to periodical objectives that do not stay for the entire duration of process life time unlike permanent objectives which are optimized once for the entire process life time. A methodology based on partial optimization which optimizes each objective iteratively and weight convergence method which optimizes sub-group of objectives is given. Furthermore, another methods is introduced which involve objective classification ranking, estimation and prediction where objectives are classified base on their properties, and rank using a given criteria and in addition estimated for its optimal weight point if it certifies a coveted optimal weight point. Then finally predicted to find how much it deviates from the estimated point.

Synthetic Aperture RADAR (SAR) is a radar imaging technique in which the relative motion of the sensor is used to synthesize a very long antenna and obtain high spatial resolution. Standard SAR raw data processing techniques assume uniform motion of the satellite (or aerial vehicle) and a fixed antenna beam pointing sideway orthogonally to the motion path, assumed rectilinear. Despite SAR data processing is a well established imaging technology that has become fundamental in several fields and applications, in this paper a novel approach has been used to exploit coherent illumination, demonstrating the possibility of extracting a large part of the ancillary data information from the raw data itself, to be used in the focusing procedure. In this work an effort has been carried out to try to focus the raw SAR complex data matrix without the knowledge of anyof the parameters needed in standard focusing procedures as Range Doppler (RD) algorithm, ω - K algorithm and Chirp Scaling (CS) algorithm. All the literature references regarding the algorithms needed to obtain a precise image from raw data use such parameters that refer both to the SAR system acquisition geometry and its radiometric specific parameters. In [12], authors introduced a preliminary work dealing with this problem and able to obtain, in the presence of a strong point scatterer in the observed scene, good quality images, if compared to the standard processing techniques. In this work the proposed technique is described and performances parameters are extracted to compare the proposed approach to RD.

This paper presents a new adaptive and optimal algorithm for the trajectory tracking control of a quadrotor using iterative learning algorithm (ILA) and enumerative learning algorithm. Ordinarily the ILA, as an adaptive method, can perform well with PID control to improve the controller’s performance for a nonlinear system. Quadrotors are considered as non-linear and unstable systems which the use of an adaptive and optimal controller can increase its stability and decrease error level. In this method, a PID controller is proposed for the outer and inner control loops of a quadrotor and the ILA is used to adapt PID control gains. Subsequently, an enumerative learning algorithm is used to optimize the learning rates of the ILA. For this purpose, at first, the dynamic model of the quadrotor is acquired. After that, the structure of the inner and outer control loops is defined. In the end, the simulation results for the trajectory tracking control of a quadrotor are demonstrated. Through simulation, it is concluded that as time increases, the performance of the suggested control method in trajectory tracking control becomes better and better and error signals convergence to zero.

A graph based path planning method consisting of off-line part and on-line part for multi-UAV system in windy condition is proposed. In the off-line part, the task area is divided into grids. When two nodes is close enough, they are connected and weighted by the cost, obtained by solving an optimization problem based on difference method, between them. In order to ensure the accuracy of the difference method, the adjacent radius is set to be small enough. In order to ensure the generated paths close to analytical solution, the grid size is set to be much smaller than the adjacent radius. The shortest path algorithm is used to update the adjacent matrix and path matrix. In the on-line part, the target position assignment and optimal velocity can be obtained by accessing the adjacent matrix and path matrix. At the end of this paper, some numerical examples are taken to illustrate the validity of our method and the influence of the parameters.

In order to coordinate the damping performance and energy regenerative performance of energy regenerative suspension, this paper proposes a structure of vehicle semi-active energy regenerative suspension with electro-hydraulic actuator (EHA). In light of the proposed concept, a specific energy regenerative scheme is designed and the mechanical properties test is carried out. Based on the test results, the parameter identification for the system model is conducted using recursive least squares algorithm. On the basis of system principle, the nonlinear model of the semi-active energy regenerative suspension with EHA is built. Meanwhile, LQG control strategy of the system is designed. And then the influence of the main parameters of EHA on the damping performance and energy regenerative performance of suspension is analyzed. Finally, the main parameters of EHA actuator are optimized via genetic algorithm. The test results show that when sinusoidal is input at the frequency of 2Hz and the amplitude of 30mm, the spring mass acceleration RMS value of optimized EHA semi-active energy regenerative suspension is reduced by 22.23% and energy regenerative power RMS value is increased by 40.51%, which means while meeting the requirements of certain vehicle ride comfort and driving safety, energy regenerative performance is improved significantly.

A lightweight composite bridge deck system composed of steel orthotropic deck stiffened with thin Ultra-High Performance Concrete (UHPC) layer is developed to eliminate fatigue cracks in orthotropic steel decks. During the construction and operation period of the bridge, the debonding between the steel deck and the UHPC layer may introduce the several issues, such as crack-induced water invasion and distinct reduction of the shear resistance. In the study, an effective and novel non-destructive interface condition monitoring approach using piezoelectric lead zirconate titanate (PZT)-based technologies is proposed to detect interfacial delamination between steel deck and UHPC layer. Experimental tests are performed on several steel-UHPC composite slabs and a conventional steel-concrete composite slab. The thin styrofoam sheets with different sizes and thicknesses are set on different locations of the steel deck as the artificial debondings. The PZT ceramic patches are bonded on the surfaces of the steel deck and UHPC layer as the actuators/sensors. An improved PSO (Particle Swarm Optimization)-K-means clustering algorithms is proposed to obtain the debonding patterns based on the feature data set. The laboratory tests demonstrate that the proposed approach provides an effective and accurate way to detect interfacial debonding of steel-UHPC composite slab.

This work addresses the energy-based source localization problem in wireless sensors networks. Instead of circumventing the maximum likelihood (ML) problem by applying convex relaxations and approximations (like all existing approaches do), we here tackle it directly by the use of metaheuristics. To the best of our knowledge, this is the first time that metaheuristics is applied to this type of problems. More specifically an elephant herding optimization (EHO) algorithm is applied. Through extensive simulations, the key parameters of the EHO algorithm are optimized such that they match the energy decay model between two sensor nodes. A detailed analysis of the computational complexity is presented, as well as performance comparison between the proposed algorithm and existing non-metaheuristic ones. Simulation results show that the new approach significantly outperforms the existing solutions in noisy environments, encouraging further improvement and testing of metaheuristic methods.

The underground complicated testing environment and the fan operation instability cause large random errors and outliers of the wind speed signals. The outliers and large random errors result in distortion of mine wind speed monitoring, which possesses safety hazards in mine ventilation system. Application of Kalman filter in velocity monitoring can improve the accuracy of velocity measurement and eliminate the outliers. Adaptive Kalman Filter was built by automatically adjusting process noise covariance and measurement noise covariance depending on the differences between measured and expected speed signals. We analyzed the fluctuation of airflow flow using data of wind speed flow and distribution characteristics of the tunnel obtained by the Laser Doppler Velocimetry system (LDV) studies. A state-space model was built based on the tunnel airflow fluctuations and wind speed signal distribution. The adaptive Kalman Filter was calculated according to the actual measurement data and the Expectation Maximization (EM) algorithm. The adaptive Kalman filter was used to shield fluid pulsation while preserving system-induced fluctuations. Using the Kalman filter to treat offline wind speed signal acquired by LDV, the reliability of Kalman filter wind speed state model and the characteristics of adaptive Kalman Filter were investigated. Results showed that the adaptive Kalman filter effectively eliminated the outliers and reduced the root-mean-squares error (RMSE), and the adaptive Kalman filter had better performance than the traditional Kalman filter in eliminating outliers and reducing RMSE. Field experiments in online wind speed monitoring were conducted using the optimized adaptive Kalman Filter. Results showed that adaptive Kalman filter treatment could monitor the wind speed with smaller RMSE compared with LVD monitor. The study data demonstrated that the adaptive Kalman filter is reliable and suitable for online signal processing of mine wind speed monitor.

This paper presents a novel micro-segmented genetic algorithm (μsGA) to identify the best solution for the locomotion of a quadruped robot designed on a rectangular ABS plastic platform. We compare our algorithm with three similar algorithms found in the specialized literature: a standard genetic algorithm (GA), a micro-genetic algorithm (μGA), and a micro artificial immune system (μAIS). The quadruped robot prototype guarantees the same conditions for each test. The platform was developed using 3D printing for the structure and can accommodate the mechanisms, sensors, servomechanisms as actuators. It also has an internal battery and a multicore embedded system (mES) to process and control the robot locomotion. This research proposes a μsGA that segments the individual into specific bytes. μGA techniques are applied to each segment to reduce the processing time; the same benefits as the GA are obtained, while the use of a computer and the high computational resources characteristic of the GA are avoided. This is the reason why some research in robot locomotion is limited to simulation. The results show that the performance of μsGA is better than the three other algorithms (GA, μGA and AIS). The processing time was reduced using a mES architecture that enables parallel processing, meaning that the requirements for resources and memory were reduced. This research solves the problem of continuous locomotion of a quadruped robot, and gives a feasible solution with real performance parameters using a μsGA bio-micro algorithm and a mES architecture.

In recent years, distributed generation technology has developed rapidly. Renewable energy, represented by wind energy and solar energy, has been widely studied and utilized. In order to give full play to the advantages of Distributed Generation (DG) and meet the challenges after power grid access, Active Distribution Network (ADN) is considered as the future development direction of traditional distribution network because of its ability of active management. Nowadays, multi-scenario analysis is widely used in the research of optimal allocation of distributed power supply in active distribution network. Aiming at the problems that may arise when using multi-scenario analysis to plan DG with uncertainties in large-scale scenarios, a scenario reduction method based on improved clustering algorithm is proposed. The validity of the scene reduction method is tested, and the feasibility of the method is verified. At present, there are few studies on the optimal allocation of DG in ADN under fault state. In this paper, comprehensive safety indicators are introduced. Considering the timing characteristics of DG and the influence of active management mode, a bi-level programming model is established, which aims at minimizing the investment of annual life cycle and the removal of active power. The bi-level model is a complex mixed integer non-linear programming model. A hybrid algorithm combining cuckoo search algorithm and primal dual interior point method is used to solve the model. Finally, through the simulation of the IEEE-33 node system, the superiority of the scenario reduction method and the comprehensive security index used in this paper to optimize the configuration of DG in ADN is verified.

Nowadays, we live in a world in which people are facing with a lot of data that should be stored or displayed. One of the key methods to control and manage this data refers to grouping and classifying them in clusters. Today, clustering has a critical role in information retrieval methods for organizing large collections inside a few significant clusters. One of the main motivations for the use of clustering is to determine and reveal the hidden and inherent structure of a set of data. Ensemble clustering algorithms combine multiple clustering algorithms to finally reach an overall clustering system. Ensemble clustering methods by lack of information fusing utilize several primary partitions of data to find better ways. Since various clustering algorithms look at the different data points, they can produce various partitions from such data. It is possible to create a partition with high performance by combining the partitions obtained from different algorithms, even if the clusters to be very dense from each other. Most studies in this area have examined all the initial clusters. In this study, a new method is used in which the most sustainable clusters are utilized instead of all primary produced clusters. Consensus function based on co-association matrixes used to select more stable clusters. The most stable clusters selection method is done by cluster stability criterion based on F-measure. Optimization functions are used to optimize the obtained final clusters. The genetic algorithm is the optimizer used in this article to find the ultimate clusters participated in a consensus. Experimental results on several datasets show that the output of proposed method is various clusters with high stability.

Proper management of solar energy, as an effective renewable source, is of high importance toward sustainable energy harvesting. This paper offers a novel sophisticated method for predicting solar irradiance (SIr) from environmental conditions. To this end, an efficient metaheuristic technique, namely electromagnetic field optimization (EFO) is employed for optimizing a neural network. This algorithm quickly mines a publicly available dataset for non-linearly tuning the network parameters. To suggest an optimal configuration, five influential parameters of the EFO (i.e., N_Pop, R_rate, Ps_rate, P_field, and N_field) are optimized by an extensive trial and error practice. Analyzing the results showed that the proposed model can learn the SIr pattern and predict it for unseen conditions with high accuracy. Furthermore, it provided about 10% and 16% higher accuracy compared to two benchmark optimizers, namely shuffled complex evolution and shuffled frog leaping algorithm. Hence, the EFO-supervised neural network can be a promising tool for the early prediction of SIr in practice. The findings of this research may shed light on the use of advanced intelligent models for efficient energy development.

Remaining service life (RSL) of pavement, as a sign of future pavement performance, has always received growing attention from pavement engineers. The RSL describes the time from the moment of pavement inspection until such a time when a major repair or reconstruction is required. The conventional approach to determining RSL involves using non-destructive tests. These tests, in addition to being costly, interfere with traffic flow and compromise users' safety. In this paper, surface distresses of pavement have been used to estimate the pavement’s RSL in order to eliminate the aforementioned problems and challenges. To implement the proposed theory, 105 flexible pavement segments were taken from Shahrood-Damghan Highway (Highway 44) in Iran. For each pavement segment, the type, severity, and extent of surface damage and pavement condition index (PCI) were determined. The pavement RSL was then estimated using non-destructive tests include Falling Weight Deflectometer (FWD) and Ground Penetrating Radar (GPR). After completing the dataset, the modeling was conducted to predict RSL using three techniques include Support Vector Regression (SVR), Support Vector Regression Optimized by Fruit Fly Optimization Algorithm (SVR-FOA), and Gene Expression Programming (GEP). All three techniques estimated the RSL of the pavement by selecting the PCI as input. The Correlation Coefficient (CC), Nash-Sutcliffe efficiency (NSE), Scattered Index (SI), and Willmott’s Index of agreement (WI) criteria were used to examine the performance of the three techniques adopted in this study. In the end, it was found that GEP with values of 0.874, 0.598, 0.601, and 0.807 for CC, SI, NSE, and WI criteria, respectively, had the highest accuracy in predicting the RSL of pavement.

Online reinforcement learning (RL) algorithms are increasingly used to personalize digital interventions in the fields of mobile health and online education. Common challenges in designing and testing an RL algorithm in these settings include ensuring the RL algorithm can learn and run stably under real-time constraints, and accounting for the complexity of the environment, e.g., a lack of accurate mechanistic models for the user dynamics. To guide how one can tackle these challenges, we extend the PCS (Predictability, Computability, Stability) framework, a data science framework that incorporates best practices from machine learning and statistics in supervised learning (Yu and Kumbier, 2020), to the design of RL algorithms for the digital interventions setting. Further, we provide guidelines on how to design simulation environments, a crucial tool for evaluating RL candidate algorithms using the PCS framework. We illustrate the use of the PCS framework for designing an RL algorithm for Oralytics, a mobile health study aiming to improve users' tooth-brushing behaviors through the personalized delivery of intervention messages. Oralytics will go into the field in late 2022.

Nipah virus (NiV) is responsible to cause various outbreaks in Asian countries, with latest from Kerala state of India. Till date there is no drug available despite its urgent requirement. In the current study, we have provided a computational one-stop solution for NiV inhibitors. We have developed “anti-Nipah” web resource, which comprised of a data repository, prediction method, and data visualization modules. The database comprised of 313 (181 unique) inhibitors from different strains and outbreaks of NiV extracted from research articles and patents. However, the quantitative structure–activity relationship (QSAR) based predictors were accomplished using classification approach employing 10-fold cross validation through support vector machine with 120 (68p + 52n) inhibitors. The overall predictor showed the accuracy and Matthew’s correlation coefficient of 88.89% and 0.77 on training/testing dataset respectively. The independent validation dataset also performed equally well. The data visualization modules from chemical clustering and principal component analyses displayed the diversity in the NiV inhibitors. Therefore, our web platform would be of immense help to the researchers working in developing effective inhibitors against NiV. The user-friendly webserver is freely available on URL: http://bioinfo.imtech.res.in/manojk/antinipah/

Many corner detector techniques have already been used in extracting information from UAV images to perform various photogrammetric and mapping activities. Among these techniques is the Feature from Accelerated Segment Test (FAST) and the Harris corner detector. It is widely agreed that the evaluation of detectors is of great importance because it evaluates and enhances the accuracy of the detected features. This research evaluates the performance of FAST-9 and FAST-12 as well as the Harris detector in terms of the repeatability rate, completeness, and correctness under different threshold values. Each method is evaluated in terms of its ability for detection UAV objects (crowd and cars features). Then the common detected features between both FAST versions and the Harris detector are extracted. This is to determine which method performs best under different image conditions (e.g., illumination variations, camera position and orientation, and image noise). The results show that the size of the threshold plays a crucial role in determining the number of detected feature points. An increase in the threshold value leads to a decrease in the number of detected points and vice versa. Thus, the correctness decreases whereas the completeness increases as a function of the threshold values. Furthermore, the relationship between the FAST-9 and the Harris detector is slightly better than those between the FAST-12 and the Harris detector. This is because the number of common features between the FAST-9 and the Harris detector are relatively higher than those between the FAST-12 and the Harris detector.

For the task planning problem of the command and control architecture, the existing algorithms have problems such as low efficiency and poor re-planning quality under abnormal conditions. Based on the requirements of the current accusation architecture, this paper constructs a distributed command and control architecture model based on multi-agents, which makes use of the superiority of multi-agents in dealing with complex tasks. The concept of MultiAgents-HTN is proposed under the framework. The original hierarchical task network planning algorithm is optimized, the multi-agent collaboration framework is redefined, and the coordination mechanism of local conflict is designed. Taking the classical resource scheduling problem as the experimental background, the comparison between the proposed algorithm and the classical HTN algorithm is carried out. The experimental results show that the proposed algorithm has higher quality and higher efficiency than the existing algorithm, and the space anomaly is heavy during processing. The planning is more efficient, and the time is more complicated and superior in dealing with the same problem, with good convergence and adaptability. The conclusion proves that the distributed command and control architecture proposed in this paper has high practicability in related fields and can solve the problem of distributed command and control architecture in multi-agent environment.

In this paper, several two-dimensional clustering scenarios are given. In those scenarios, soft partitioning clustering algorithms (Fuzzy C-means (FCM) and Possibilistic c-means (PCM)) are applied. Afterward, VAT is used to investigate the clustering tendency visually, and then in order of checking cluster validation, three types of indices (e.g., PC, DI, and DBI) were used. After observing the clustering algorithms, it was evident that each of them has its limitations; however, PCM is more robust to noise than FCM as in case of FCM a noise point has to be considered as a member of any of the cluster.

The study presents a comparative approach between response surface methodology (RSM) and hybridized, genetic algorithm artificial neural network (GA-ANN) in predicting the water absorption, compressive strength, flexural strength split tensile strength and slump for steel fiber reinforced concrete. The effect of process variables such as aspect ratio, water cement ratio and cement content were investigated using the central composite design of response surface methodology. This same experimental design was used in training the hybrid-training approach of artificial neural network. The predicting ability of both methodologies were compared using the root mean sqaured error (RMSE), mean absolute error (MAE), model predictive error (MPE) and absolute average deviation (AAD). The RSM model was found more accurate in prediction compared to hybrid GA-ANN.

The aim of this study has been to develop a novel two-level multi-objective genetic algorithm (GA) to optimize time series forecasting data for fans used in road tunnels by the Swedish Transport Administration (Trafikverket). Level 1 is for the process of forecasting time series cost data, while level 2 evaluates the forecasting. Level 1 implements either a multi-objective GA based on the ARIMA model or a multi-objective GA based on the dynamic regression model. Level 2 utilises a multi-objective GA based on different forecasting error rates to identify a proper forecasting. Our method is compared with using the ARIMA model only. The results show the drawbacks of time series forecasting using only the ARIMA model. In addition, the results of the two-level model show the drawbacks of forecasting using a multi-objective GA based on the dynamic regression model. A multi-objective GA based on the ARIMA model produces better forecasting results. In level 2, five forecasting accuracy functions help in selecting the best forecasting. Selecting a proper methodology for forecasting is based on the averages of the forecasted data, the historical data, the actual data and the polynomial trends. The forecasted data can be used for life cycle cost (LCC) analysis.

Histamine intolerance is defined as disequilibrium of accumulated histamine and the capacity for histamine degradation. This clinical term addresses a non-immunologically mediated pathology when histamine ingested with food is not particularly high, but its degradation is decreased. Clinical picture of histamine intolerance in children is similar to that observed in adults apart from male predominance found in paediatric patients. Both in children and adults, histamine-free diet seems to be the treatment of choice. Diamine oxidase supplementation offers another treatment option. There is no symptom and\or test pathognomonic for histamine intolerance. Nevertheless, manifestations of chronic gastrointestinal symptoms, measurement of diamine oxidase deficits, positive results of histamine provocation tests and improvement of symptoms with histamine-free diet greatly increase the probability of histamine intolerance diagnosis. These factors have been included in the proposed in this paper diagnostic algorithm for histamine intolerance. In children histamine intolerance probably co-occur with allergies and bowel diseases, which creates an additional diagnostic challenge. As the evidence for children is weak, further research is needed the establish epidemiology, validate diagnostic algorithms and establish possible treatment options regarding histamine intolerance.

In this preprint, we introduce a dataset containing students enrolment applications combined with the related result of their filing procedure. The dataset contains 73 variable. Student candidates, at the time of applying for study, fill a web form for filing the procedure. A committee at Tilburg University review each single application and decide if the student is admissible or not. This dataset is suitable for algorithmic studies and has been used in a comparison between the Naïve Bayes and the C5.0 Decision Tree Algorithms. They have been used for predicting the decision of the committee in admitting candidates at various bachelor programs. Our analysis shows that, in this particular case, a combination of the approaches outperform a both of them in term of precision and recall.

An optimal scheduling strategy for cooling, heating and power (CCHP) joint-power-supply system is proposed to improve energy utilization and minimize costs in this paper. Firstly, the mathematical model of CCHP system is established. Particle swarm optimization (PSO) is used to optimize the regularization coefficient C and the kernel parameter λ which can affect the prediction accuracy of KELM(PSO-KELM). Then PV generation and load prediction model are established by PSO-KELM. In order to jump out of local optimal solution, Cauchy variation is introduced in SFLA local update, and adaptive mutation operation is carried out on SFLA individuals. The predictions of PV generation and load power by PSO-KELM are imported into the objective function, and the microgrid dispatching model is solved by the improved SFLA algorithm. Compared with the traditional GA-KELM and KELM, PSO-KELM has faster convergence and prediction accuracy. Compared with the power supply division, the operation cost of the power grid is reduced by the proposed optimization dispatching strategy of CCHP micro-grid.

This work describes and compares the backpropagation algorithm with the Extended Kalman filter, a second-order training method which can be applied to the problem of learning neural network parameters and is known to converge in only a few iterations. The algorithms are compared with respect to their effectiveness and speed of convergence using simulated data for both, a regression and a classification task.

Numerical weather prediction is an initial-value problem, for determination of the initial conditions, there are many methods and one of the most classical methods is variational methods in three dimensions, or 3D-Var. In this approach, with a defined cost function proportional to the square of the distance between the analysis and both the background and the observations, one can obtain the analysis. In the cost function, the background and the observations are reshaped to vectors; within this step, the order of the background error covariance matrix and the observational error covariance matrix becomes huge, which is not convenient to one to obtain the analysis. In this paper, according to the matrix analysis approach, we put forward some possible improvements to the dimension-reduction algorithm of 3D-Var, so that provide some references for data assimilation.

Fetal weight estimation before delivery is important in obstetrics, which assists doctors diagnose abnormal or diseased cases. Linear regression based on ultrasound measures such as bi-parietal diameter (bpd), head circumference (hc), abdominal circumference (ac), and fetal length (fl) is common statistical method for weight estimation but the regression model requires that time points of collecting such measures must not be too far from last ultrasound scans. Therefore this research proposes a method of early weight estimation based on expectation maximization (EM) algorithm so that ultrasound measures can be taken at any time points in gestational period. In other words, gestational sample can lack some or many fetus weights, which gives facilities to practitioners because practitioners need not concern fetus weights when taking ultrasound examinations. The proposed method is called dual regression expectation maximization (DREM) algorithm. Experimental results indicate that accuracy of DREM decreases insignificantly when completion of ultrasound sample decreases significantly. So it is proved that DREM withstands missing values in incomplete sample or sparse sample.

In recent years, several industries have registered an impressive improvement in technological advances such as Internet of Things (IoT), e-commerce, vehicular networks, etc. These advances have sparked an increase in the volume of information that gets transmitted from different nodes of a computer network (CN). As a result, it is crucial to safeguard CNs against security threats and intrusions that can compromise the integrity of those systems. In this paper, we propose a machine mearning (ML) intrusion detection system (IDS) in conjunction with the Genetic Algorithm (GA) for feature selection. To assess the effectiveness of the proposed framework, we use the NSL-KDD dataset. Furthermore, we consider the following ML methods in the modelling process: decision tree (DT), support vector machine (SVM), random forest (RF), extra-trees (ET), extreme gradient boosting (XGB), and naïve Bayes (NB). The results demonstrated that using the GA algorithm has a positive impact on the performance of the selected classifiers. Moreover, the results obtained by the proposed ML methods were superior to existing methodologies.

Selecting a feature in data mining is one of the most challenging and important activities in pattern recognition. The issue of feature selection is to find the most important subset of the main features in a specific domain, the main purpose of which is to remove additional or unrelated features and ultimately improve the accuracy of the categorization algorithms. As a result, the issue of feature selection can be considered as an optimization problem and to solve it, meta-innovative algorithms can be used. In this paper, a new hybrid model with a combination of whale optimization algorithms and flower pollination algorithms is presented to address the problem of feature selection based on the concept of opposition-based learning. In the proposed method, we tried to solve the problem of optimization of feature selection by using natural processes of whale optimization and flower pollination algorithms, and on the other hand, we used opposition-based learning method to ensure the convergence speed and accuracy of the proposed algorithm. In fact, in the proposed method, the whale optimization algorithm uses the bait siege process, bubble attack method and bait search, creates solutions in its search space and tries to improve the solutions to the feature selection problem, and along with this algorithm, Flower pollination algorithm with two national and local search processes improves the solution of the problem selection feature in contrasting solutions with the whale optimization algorithm. In fact, we used both search space solutions and contrasting search space solutions, all possible solutions to the feature selection problem. To evaluate the performance of the proposed algorithm, experiments are performed in two stages. In the first phase, experiments were performed on 10 sets of data selection features from the UCI data repository. In the second step, we tried to test the performance of the proposed algorithm by detecting spam emails. The results obtained from the first step show that the proposed algorithm, by running on 10 UCI data sets, has been able to be more successful in terms of average selection size and classification accuracy than other basic meta-heuristic algorithms. Also, the results obtained from the second step show that the proposed algorithm has been able to perform spam emails more accurately than other similar algorithms in terms of accuracy by detecting spam emails.

Sequence analysis program is outlined that analyzes and investigates homology between various nucleic acid or protein sequence. The dot matrix technique compares the sequences and the consensus sequence is obtained by superimposing on each other all the dot matrices. Local Alignment and Global Alignment both sequence from start to end is the best possible alignment over the entire duration between the two sequences. This method is more important to align with two closely related sequences roughly the same length. This method may not able to generate optimal results for divergent sequences and variable length sequence because between the two sequences it does not recognize very similar local region.

The Needleman-Wunsch process is a classic tool in bioinformatics, being a dynamic programming algorithm that performs a pairwise alignment of two input biological sequences, either protein or nucleic acid. A distance matrix between the tokens used in the sequences is also required as input. The distance matrix is used to generate a positional pairwise similarity matrix between the input sequences, which is in turn used to generate a dynamic programming matrix. The best path through the dynamic programming matrix is navigated using a traceback procedure that maximises similarity, inserting gaps as necessary. Needleman-Wunsch can align both nucleic acids or proteins, which use alphabets of size 4 and 20 tokens respectively. It can also be applied to any other kind of sequence where distance matrices can be specified. Here, we apply it to chains of Pousseur’s Scambi electronic music fragments, of which there are 32, and which Pousseur categorised by their sonic properties, thus permitting the consecutive construction of distance, similarity and dynamic programming matrices. Traceback through the dynamic programming matrix thus produces contrapuntal duet compositions in which two Scambi chains are played in the maximally euphonious manner, providing also an illustration of the principles of biological sequence alignment in sound.

Expectation maximization (EM) algorithm is a powerful mathematical tool for estimating statistical parameter when data sample contains hidden part and observed part. EM is applied to learn finite mixture model in which the whole distribution of observed variable is average sum of partial distributions. Coverage ratio of every partial distribution is specified by the probability of hidden variable. An application of mixture model is soft clustering in which cluster is modeled by hidden variable whereas each data point can be assigned to more than one cluster and degree of such assignment is represented by the probability of hidden variable. However, such probability in traditional mixture model is simplified as a parameter, which can cause loss of valuable information. Therefore, in this research I propose a so-called conditional mixture model (CMM) in which the probability of hidden variable is modeled as a full probabilistic density function (PDF) that owns individual parameter. CMM aims to extend mixture model. I also propose an application of CMM which is called adaptive regressive model (ARM). Traditional regression model is effective when data sample is scattered equally. If data points are grouped into clusters, regression model tries to learn a unified regression function which goes through all data points. Obviously, such unified function is not effective to evaluate response variable based on grouped data points. The concept “adaptive” of ARM means that ARM solves the ineffectiveness problem by selecting the best cluster of data points firstly and then evaluating response variable within such best cluster. In order words, ARM reduces estimation space of regression model so as to gain high accuracy in calculation.

The world is attesting a tremendous change today which is remarkably coined as industry 4.0. Several terminologies have developed as a result of the emergency of industry 4.0, notably is cybersecurity which entails the security of communication and network operations activities either on or offline and the measures taken to achieve such security. The most common form of communication by organizations and Business today is the electronic mails (Email), although email is a valuable tool, it also creates security challenges when not properly managed. There is a growing adoption of email as official form of communication in many organizations with majority of users on mobile android devices due to the popularity of the android operating systems and the proliferation of mobile devices. Banks, health care, educational institutions and many other service providers are communicating to their clients through email where sensitive and confidential information are shared. One major threat to email communication is lack of confidentiality for emails accessed via android mobile devices due to weaknesses of android operating system (OS) platform that presents possibilities to penetrate by hackers and android email client since it accepts a onetime login and password authentication which is only required again if the email account is deleted from the android mobile device. In this study, an algorithm was designed and implemented on an android application that allows an email sender to compose an email and set the time the email will stay in the receiver inbox before it automatically wipes off. Primary data was collected from email users using tightly structured questionnaires and respondents comprised of those with email technical background and those that are typical email users inorder to get their opinion on the lack of confidentiality on the android mobile email client, while secondary data from scholarly journals and articles informed the study design. The designed algorithm was tested and evaluated through expert opinion. The result of the study indicates that the designed algorithm addresses the confidentiality issues and threats on android email clients.

The study presents a mathematical modeling for supporting the premise that our body is composed of blockchain systems. A cell population is considered a space with peer-to-peer communication networks for applying blockchain protocol. Transaction is defined as gene expression that constantly occurs for protein synthesis in each cell. The transaction process proceeds according to the blockchain protocol with sharing and recording the data on the blockchain ledger. The premise comes from the clues of the previous research such that the cell population is a complex structured network system having cell-to-cell connections. Although individual cells exhibit stochastic nonlinear dynamic behavior, cell population shows consensus behavior that reaches to ensemble through interaction among cells. It is inferred that gene expression is not regulated by the corresponding cell only nor determined by external intelligence such as the brain. This is achieved through a consensus through stochastic interactions between cells over the whole cell population. These findings imply that mathematical blockchain modeling is a suitable for gene expression process. The original contribution of the study is a methodology for applying mathematically the blockchain protocol to the real biological gene expression process. In other words, the DNA sequence is converted into a numeral bit sequence that makes it possible to implement the blockchain protocol. A new DNA sequence scheme is proposed with adding methylated cytosine and adenine as the 5th and 6th bases for including epigenetic information which has profound effect on gene expression and regulation. The methodology was applied to the real biological synthesis process of protein samples. The protein is composed of amino acids that are encoded by triplet codons of 216 kinds with 6 base RNA sequence. The gene expression information is traced backward from a synthesized protein sample, amino acids of codons, RNA transcript up to DNA sequence. One of the results is a numeric value in the form of a bit sequence with which mathematical blockchain modeling is applicable. The cryptographic authentication and the consensus process are mathematically proven to work properly by the blockchain protocol. It implies that the same protein is synthesized, but with different epigenetic data, then protein's latent material properties will certainly be different. Although the result has not been justified by the biologic experiment yet, it is sure that the biological hidden algorithm inside DNA sequence will be revealed by the binary bit-logic with physical on/off states which is mathematically proven. The research will greatly contribute to disease treatment and medicine development as well as epigenetics in the future.

AIUS (Atmospheric Infrared Ultraspectral Sounder) is an infrared occultation spectrometer onboard the Chinese GaoFen-5 satellite, which covers a spectral range of 2.4--13.3 μm (750--4100 cm-1) with a spectral resolution of about 0.02 cm-1. AIUS was designed to measure and to study chemical processes of ozone (O3) and other trace gases in the upper troposphere and stratosphere over Antarctic. In this study, the corresponding retrieval methodology is described. The comparison between AIUS measurements and simulated spectra illustrates that AIUS measurements agree well to the simulated spectra. To first evaluate the reliability of our retrieval algorithm, three retrieval O3 experiments are performed based on ACE-FTS observation spectra. A comparison between our retrieved profiles and the ACE-FTS official products shows that the relative difference of these three retrieval experiments is mostly within 10% between 20 km and 70 km. These retrieval experiments demonstrate that the retrieval algorithm described in this study work fine and reliable. Furthermore, O3, H2O and HCl profiles are retrieved from eight orbits of AIUS measurements and compared with the official AURA/MLS level-2 v4.2 profiles. Comparison experiments show that the relative difference is mostly within 10% (about 0.02 - 0.4 ppm) between 18 and 58 km for O3 retrieval, within 10% (0-0.5 ppm) between 15 and 80 km for H2O retrieval, and within 10% (about 0.1 ppb) between 30 and 60 km for HCl retrieval. There is a good agreement in the retrieved trace gas profiles obtained from AIUS and from coincident profiles from MLS.

This paper proposes a radiation pattern synthesis of the almost periodic antenna arrays including mutual coupling effects (that extracted by the Floquet analysis according to our previous work), which principally has a high directivity and large bandwidth. For modeling the given structures, the moment method combined with the Generalized Equivalent Circuit (MoM-GEC) is proposed. The artificial neural network (ANN) as a powerful computational model has been successfully applied to the antenna array pattern synthesis. The results showed that the multilayer feedforward neural networks are rugged and can successfully and efficiently resolve various distinctive complex almost periodic antenna patterns (with different source amplitudes) (in particular, both periodic and randomly aperiodic structures are taken into account). However, the artificial neural network (ANN) is capable of quickly producing the synthesis results using generalization with the early stopping (ES) method. A significant time gain and memory consumption are achieved by using this given method to improve the generalization (called early stopping). To justify this work, several examples are developed and discussed.

This paper presents a study on optimization of Overcurrent relay (OCR) coordination protection scheme for Sustainable Standalone Hydrokinetic Renewable Energy (SHRE) distribution network at Batang Rajang river, located at Kapit Sarawak, Malaysia by turning river stream into power generation source. The purpose of the project is to develop rural electrification system for native long houses along the river. The research study is tested on a DigSILENT develop model of the SHRE distribution network and in accordance with all respectively unique parameters and relevant standards. Since this is a new standalone distribution system, an efficient and properly coordinated overcurrent protection system must be provided. Improper and miscoordination among OCRs result in maloperation of the protection system that can lead to false tripping and an unnecessary outage and power system instability. Thus, the objective of this work is to employ Genetic Algorithm (GA) technique in Matlab/Simulink for optimal overcurrent coordination and settings among all OCRs in the proposed distribution network in order to improve the speed of OCR tripping operation. The GA is used because the project is fast track and requiring the simplest method available. In this strategy, time dial setting (TDS) is optimized by using plug setting multiplier (PSM) as the constraint. The obtained results show a significant improvement of the relay operating time of 36.01% faster than that of conventional numerical technique during fault occurrence. Thus, an efficient and reliable overcurrent protection scheme has been achieved for the SHRE distribution network.

Increasing demand for food production with limited available water resources pose the threat to agricultural activities. The conjunctive allocation of water resources maximizes the net benefit of farmers efficiently. In this study, a novel hybrid optimization model was developed based on a genetic algorithm (GA), bacterial foraging optimization (BFO) and ant colony optimization (ACO) to maximize the net benefit of water deficit Sathanur reservoir command. The GA-based opti-mization model considered crop-related physical and economical parameters to derive optimal cropping patterns for three different conjunctive use policies and further allocation of surface and groundwater for different crops are enhanced with the BFO. The allocation of surface and groundwater for the head, middle and tail reach obtained from BFO is considered as input to ACO as a guiding mechanism to attain an optimal cropping pattern. Comparing the average produc-tivity values Policy 3 (3.665 Rs/m3) has better values relating to Policy 1 (3.662 Rs/m3) and Policy 2 (3.440 Rs/m3). Thus, the developed novel hybrid optimization model (GA-BFO-ACO) is very promising to enhance the farmer's net income as well as for the command area water conservation and can be replicated in other irrigated regions of the globe to overcome chronic land and water problems.

Directional Modulation (DM) technique, as an emerging promising approach to secure wireless communications, has been attracting increasing attention for its unique characteristic in the past decade. The baseband signal is synthesized at the antenna level for maintaining the standard constellation format along the prescribed direction(s) while simultaneously distorting the signal constellations in other undesired directions. In this paper, we present a novel DM signal synthesis method based on phased array using a hybrid genetic algorithm (GA) and particle swarm optimization (PSO) algorithm, which takes advantages of both GA and PSO algorithm. Then, the bit error rate of the proposed method is analyzed and simulated. Simulation results are presented to verify that the proposed DM signal have a narrower information beam-width. Therefore, it can offer a better physical layer security (PLS) performance compared with the conventional directional modulation signal.

This article proposes a monitoring system that allows to track transitions between different stages in the berry harvesting process (berry picking, waiting for transport, transport, and arrival to the packing) solely using information from temperature and vibration sensors located in the basket. The monitoring system assumes a characterization of the process based on Hidden Markov Models and uses the Viterbi algorithm to perform inference and estimate the most likely state trajectory. The obtained state trajectory estimate is then used to compute a potential damage indicator in real-time. The proposed methodology does not require information about the weight of the basket to identify each of the different stages, which makes it effective and more efficient than other alternatives available in the industry.

In the paper, an improved smart meter data-based three-stage algorithm to calculate the power/energy losses in the three-phase networks with the voltage level below 0.4 kV (low voltage - LV) is presented. In the first stage, a loading function of input data was built having as main feature the working at the same time with files from the database of smart metering system (SMS) containing the hourly electricity records, and files including the characteristic load profiles established by the Distribution Network Operator (DNO) for the consumers with standard energy meters depending the following factors: consumption class, day and season. In the second stage, a function which is based on the work with the structure vectors was implemented to identify easy the configuration of analysed networks. In the third stage, an improved version of forward/backward sweep-based algorithm was proposed to calculate fast the power/energy losses to three-phase LV distribution networks in balanced and unbalanced regime. A real LV rural distribution network from a pilot zone belonging to a Distribution Network Operator (DNO) from Romania was used to confirm the accuracy of the proposed approach. The comparison with the results obtained using the DigSilent PowerFactory Simulation Package certified the performance of the algorithm, the mean absolute percentage error (MAPE) being 0.94%.

Single nucleotide polymorphisms (SNP) are associated with diseases and drug response variabilities in humans. Elucidating the damaging and disease-associated SNPs using wet-laboratory approaches can be challenging and resource-demanding due to the large number of SNPs in the human genome. Due to the growth in the field of computational biology and bioinformatics, algorithms have been developed to help screen and filter out the most deleterious SNPs that are worth considering for wet-laboratory studies. Here we review the existing in-silico based methods used to predict and characterize the effects of SNPs on protein structure and function. This cutting-edge approach will facilitate the search for novel therapeutics, help understand the etiology of diseases and fast-track the personalized medicine agenda.

Recently natural gas (NG) global market attracted much attention in case it is cleaner than oil, and simultaneously in most regions is cheaper than renewable energy sources. However, price fluctuations, environmental concerns, technological development, emerging unconventional resources, energy security challenges, and shipment are some of the forces that made the NG market more dynamic and complex. From a policy-making perspective, it is vital to uncover demand-side future trends. This paper proposed an intelligent forecasting model to forecast NG global demand, however investigating a multi-dimensional purified input vector. The model starts with a data mining (DM) step to purify input features, identify the best time lags, and to pre-process selected input vector. Then a hybrid artificial neural network (ANN) which equipped with genetic optimizer is applied to set up ANN’s characteristics. Among 13 available input features, six features (e.g. Alternative and Nuclear Energy, CO2 Emissions, GDP per Capita, Urban Population, Natural Gas Production, Oil Consumption) selected as the most critical feature via the DM step. Then, the hybrid prediction model is designed to extrapolate the consumption of future trends. The proposed model overcomes competitive models refer to different error based evaluation statistics. Besides, as the model proposed the best input feature set, results compared to the model which used the raw input set, with no DM purification process.

Properties of spatially explicit data are often ignored or inadequately handled in machine learning for spatial domains of application. At the same time, resources that would identify these properties and investigate their influence and methods to handle them in machine learning applications are lagging behind. In this survey of the literature, we seek to identify and discuss spatial properties of data that influence the performance of machine learning. We review some of the best practices in handling such properties in spatial domains and discuss their advantages and disadvantages. We recognize two broad strands in this literature. In the first, the properties of spatial data are developed in the spatial observation matrix without amending the substance of the learning algorithm; in the other, spatial data properties are handled in the learning algorithm itself. While the latter have been far less explored, we argue they offer the most promising prospects for the future of spatial machine learning.

Adequate knowledge about the development and operation of the components of water systems is of high importance in order to optimize them. For this reason, forecasting of future events becomes greatly significant due to making the appropriate decision. Moreover, operational river management severely depends on accurate and reliable flow forecasts. In this regard, current study inspects the accuracy of support vector regression (SVR), and SVR regulated with fruit fly optimization algorithm (FOASVR) and M5 model tree (M5), in river flow forecasting. Monthly data of river flow in two stations of the Lake Urmia Basin (Vaniar and Babarud stations on the Aji Chay and the Barandouz Rivers) were utilized in the current research. Additionally, the influence of periodicity (π) on the forecasting enactment was examined. To assess the performance of mentioned models, different statistical meters were implemented, including root mean squared error (RMSE), mean absolute error (MAE), correlation coefficient (R), and Bayesian information criterion (BIC). Results showed that the FOASVR with RMSE (4.36 and 6.33 m3/s), MAE (2.40 and 3.71 m3/s) and R (0.82 and 0.81) values had the best performances in forecasting river flows in Babarud and Vaniar stations, respectively. Also, regarding BIC parameters, Q_t-1 and π were selected as parsimonious inputs for predicting river flow one month ahead. Overall findings indicated that, although both FOASVR and M5 predicted the river flows in suitable accordance with observed river flows, the performance of FOASVR was moderately better than the M5 and periodicity noticeably increased the performances of the models; consequently, FOASVR can be suggested as the accurate method for forecasting river flows.

In this study, the resource blocks (RB) are allocated to user equipment (UE) according to the evolutional algorithms for long term evolution (LTE) systems. Particle Swarm Optimization (PSO) algorithm is one of the evolutionary algorithms, based on the imitation of a flock of birds foraging behavior through learning and grouping the best experience. In previous work, the Simple Particle Swarm Optimization (SPSO) algorithm was proposed for RB allocation to enhance the throughput of Device-to-Device (D2D) communications and improve the system capacity performance. In simulation results, with less population size of M = 10, the SPSO can perform quickly convergence to sub-optimal solution in the 100^th generation and obtained sub-optimum performance with more 2 UEs than the Rand method. Genetic algorithm (GA) is one of the evolutionary algorithms, based on Darwinian models of natural selection and evolution. Therefore, we further proposed a Refined PSO (RPSO) and a novel GA to enhance the throughput of UEs and to improve the system capacity performance. Simulation results show that the proposed GA with 100 populations, in 200 generations can converge to suboptimal solutions. Therefore, with comparing with the SPSO algorithm the proposed GA and RPSO can improve system capacity performance with 1.8 and 0.4 UEs, respectively.

In this paper, a thermodynamic investigation is done on a Kalina-flash cycle. This work is initially validated with the Kalina cycle power plant, Wich is commissioned in Husavic. Low-temperature Kalina-flash is considered for this study. This cycle is working with the ammonia-water mixture. The Kalina-flash cycle was optimized in the view of exergy and thermal efficiency. A multi-objective genetic algorithm is used to accomplish optimization. The optimum values of the objective functions are observed to be 40.20 and 11.70% respectively. At last, The influence of the separator inlet dryness fraction, basic ammonia mass fraction, temperature and flash pressure ratio on the first and second law efficiencies are analysed.

The node position information is critical in the wireless sensor network (WSN). However, the existing positioning algorithms commonly have low positioning accuracy because of noise interferences in communication. To solve this problem, this paper presents an iterative positioning model based on distance correction to improve the positioning accuracy of the target node in WSN. First, the log-distance distribution model of received signal strength indication (RSSI) ranging is built and the noise impact factor is derived based on the model. Second, the initial position coordinates of the target node are obtained based on the triangle centroid localization algorithm, thereby calculating the distance deviation coefficient under the influence of noise. Then, the ratio of the distance measured by the log-normal distribution model to the median distance deviation coefficient is taken as the new distance between the anchor node and the target node. Based on the new distance, the triangular centroid positioning algorithm is used again to calculate the target node coordinates. Finally, the iterative positioning model is constructed, and the distance deviation coefficient is updated repeatedly to update the positioning result until the set number of iterations is reached. Experiment results show that the proposed iterative positioning model can improve positioning accuracy effectively.

The efficiency of data sorting algorithms is the key aspect which determines the speed of data processing and searching. The best known efficiency of sorting algorithm has been Log (N) if there are N terms. All of the well-known sorting algorithms use various techniques to sort data. The basis for most of these are comparing the data terms with each other. In this manuscript, we are introducing a new approach for sorting data. This method is postulated to have the highest efficiency ever achieved by any of the sorting algorithms. We achieve this by sorting data without comparing the data terms. Or achieving results of data comparison without comparing the terms explicitly.

Cracking in a wide array of industrial components and structures pose a significant threat to their integrity. Detecting cracks using ultrasonic inspection techniques is a widespread activity for economic reasons but there are limitations to the techniques due to the morphology of cracks, such as fatigue cracks. In addition to detection there is a need to measure the size of the cracks which are often within the volume of the material. Ultrasonic techniques are well-suited to look inside the volume of the material but achieving sufficient sensitivity to the tip of the cracks in particular is practically difficult. Without an accurate knowledge of where the tip of the crack lies there can be significant uncertainty in sizing measurements. Machine Learning (ML) techniques are being developed to aid in the inspection and monitoring tasks but presenting the ultrasonic data in a suitable way for ML is very important. Following on from recent work presenting the development of the snooker algorithm to create images termed parameter-spaces, this paper presents how these images can be input into neural network based ML systems to automatically size these critical cracks.

Freeway travelling time is affected by many factors including traffic volume, adverse weather, accident, traffic control and so on. We employ the multiple source data-mining method to analyze freeway travelling time. We collected toll data, weather data, traffic accident disposal logs and other historical data of freeway G5513 in Hunan province, China. Using Support Vector Machine (SVM), we proposed the travelling time model based on these databases. The new SVM model can simulate the nonlinear relationship between travelling time and those factors. In order to improve the precision of the SVM model, we applied Artificial Fish Swarm algorithm to optimize the SVM model parameters, which include the kernel parameter σ, non-sensitive loss function parameter ε, and penalty parameter C. We compared the new optimized SVM model with Back Propagation (BP) neural network and common SVM model, using the historical data collected from freeway G5513. The results show that the accuracy of the optimized SVM model is 17.27% and 16.44% higher than those of the BP neural network model and the common SVM model respectively.

Nowadays industrial dryers are used instead of traditional methods for drying. In designing dryers suitable for controlling the process of drying and reaching a high quality product, it is necessary to predict the instantaneous moisture loss during drying. For this purpose, ten mathematical-experimental models with a neural network model based on the kinetic data of pistachio drying are studied. The data obtained from the cabinet dryer will be evaluated at four temperatures of inlet air and different air velocities. The pistachio seeds will be placed in a thin layer on an aluminum sheet on a drying tray and weighed by a scale attached to the computer at different times. In the neural network, data are divided into three parts: educational (60%), validation (20%) and test (20%). Finally, the best mathematical-experimental model using genetic algorithm and the best neural network structure for predicting instantaneous moisture are selected based on the least squared error and the highest correlation coefficient.

\textsc{Background} Often, in biology, we are faced with the problem of exploring relevant unknown biological hypotheses in the form of myriads of combination of factors that might be affecting the pathway under certain conditions. Currently, a major problem in biology is to cherry pick the combinations based on expert advice, literature survey or guesses for investigation. The search and wet lab testing of these combinations costs a lot in terms of time, investment and energy. In a recent development of the PORCN-WNT inhibitor ETC-1922159 for colorectal cancer, a list of down-regulated genes were recorded in a time buffer after the administration of the drug. The regulation of the genes were recorded individually but for a majority, it is still not known which higher ($\geq 2$) order combinations might be playing a greater role in the pathway. \textsc{Results} The pipeline provides a prioritised list of important $2^{nd}$ order combinations of a range of family of genes involved in the Wnt pathway. More specifically, it reveals the various unexplored FZD-WNT combinations that have been untested till now in the pathway. In relation to ETC-1922159 affected combinations, the down-regulation of LGR-RNF family after the drug treatment is evident in these rankings as it takes bottom priorities for LGR5-RNF43 combination. The LGR6-RNF43 takes higher ranking than LGR5-RNF43, indicating that it might not be playing a greater role as LGR5 during the Wnt enhancing signals. These rankings confirm the efficacy of the proposed search engine design. \textsc{Conclusion} A pipeline has been developed to prioritise an $n^{th}$ order combination of factors that affect a signaling pathway. It takes into account the sensitivity indices computed from variance based (SOBOL) and density-kernel based (HSIC) methods to estimate the influence of each factor or combination of factors. These are then fed as feature vectors into a powerful support vector ranking algorithm that produces a ranked list of the interactions/combinations.

Background: Accurate prediction of patients’ response to therapy is clinically indispensable, howbeit challenging. With increased understanding of the human genome and malignancies, there is the renaissance of in silico pharmacogenomics with renewed interest in drug response predictability based on gene-drug interaction. Objective: Evidence-based transcript-proteome profiling is essential for synthesizing clinically applicable algorithms for predicting response to anticancer therapy, including immune checkpoint blockade (ICBT); thus, saving physicians’ time, reducing polypharmacy, and curtailing unnecessary treatment expense. In this study, we tested and validated the hypothesis that a selected proteomic signature in ICBT-naïve patients is sufficient for the prediction of response to ICBT. Methods: Using a multimodal approach consisting of computational pharmacogenomics, transcript-proteome analytics, mathematical modeling, and machine learning systems; we delineated therapy-sensitivity and stratified patients into graduated response groups based on their proteomic profile. Protein expression levels in our cohort tissue specimens were evaluated based on T cell- and non-T cell- inflamed phenotypes by immunohistochemistry. Results: We established β-catenin, PDL1, CD3 and CD8 expression-based ICBT response model. Statistical regression models validated the predictive association between our predefined algorithms and therapeutic outcome. Interestingly, our 4-gene prediction classifier was constitutively independent of tumor tissue origin, correctly stratified patients into high-, low-, and non- responders pre-treatment, with high prediction accuracy, and exhibited good association with patients’ performance status and prognosis (p < 0.01). Conclusion: Our findings demonstrate the possibility of accurate proteomics based ICBT response prediction and provide a putative basis for drug response prediction based on selective proteome profile in untreated cancer patients.

Water distribution networks are vital infrastructure, needed for providing consumers with sufficient water of appropriate quality. The cost of construction, operation, and maintenance of such networks is extremely large. The problem of optimization of a water distribution network is governed by the type of water distribution network and the size of pipelines placed in the distribution network. This problem of the optimal diameter allocation of pipes in a distribution network has been heavily researched over the past few decades. This study describes the development of a computer program, ‘Smart Optimization Program for Water Distribution Networks’ (SOP–WDN), which applies Genetic Algorithm to the problem of the least-cost design of water distribution networks. SOP–WDN demonstrates the application of an evolutionary optimization technique, Genetic Algorithm, linked with a hydraulic simulation solver EPANET, for the optimal design of water distribution networks. The developed program was applied to three benchmark water distribution network optimization problems and produced consistently good results. SOP–WDN can be utilized as a tool for guiding engineers during the design and rehabilitation of water distribution pipelines.

Due to advancement in hacking/reverse engineering tools, threat against transfer of sensitive data or highly classified information is always at risk of being intercepted by an attacker. Covert communication outwit this malicious breach of privacy act better than cryptography as it camouflage secret information inside another innocent looking information, while cryptography shows scrambled information that might arouse attention of an attacker. However, the challenges in Steganography are the modification of carrier that causes some abnormalities, which is detectable and often the methods are not optimize. This paper presents an approach in Covert communication Chanel, which utilizes mathematical concept of combination to optimize time of transmission using sets of multiple transmitter’s, and receiver’s addresses where each abstractly represents a set of bits or characters combination without modifying the address. To minimize the number of physical address to be use, a combinatorial and permutation concept of virtual address generation from physical address is introduce. The paper in addition presents some technique like relationship and their application in both re-enforcing resistivity against Steganalysis and generating combinations. Furthermore, a concept of dynamical clockwise and anti-clockwise rotation of combination over addresses after every transmission is introduce to further improve on resistivity against Steganalysis. A simple test was performed for demonstrating relay address, combination and permutation concepts. Based on test results and analysis, the method is effective as expected and it is quite easy to use as it can be implemented in different platform without much difficulties.

Accurate and stable cost forecasting of substation projects is of great significance to ensure the economic construction and sustainable operation of power engineering projects. In this paper, a forecasting model based on the improved least squares support vector machine (ILSSVM) optimized by wolf pack algorithm(WPA) is proposed to improve the accuracy and stability of the cost forecasting of substation projects. Firstly, the optimal features are selected through the data inconsistency rate (DIR), which helps reduce redundant input vectors. Secondly, the wolf pack algorithm is used to optimize the parameters of the improved least square support vector machine. Lastly, the cost forecasting method of WPA-DIR-ILSSVM is established. In this paper, 88 substation projects in different regions from 2015 to 2017 are chosen to conduct the training tests to verify the validity of the model. The results indicate that the new hybrid WPA-DIR-ILSSVM model presents better accuracy, robustness and generality in cost forecasting of substation projects.