Recently, there has been, on the one hand, an increase in the complexity of digital device designs and, on the other hand, an increase in the requirements for the development time and the reliability of the designs. One of the directions of solving this problem is developing new techniques for designing digital devices.This paper proposes a new technique for designing digital devices based on finite state machines with datapath (FSMD), when the functioning of the device is described in the form of an algorithm state machine with datapath (ASMD) charts. The new technique is called ASMD-FSMD. Different digital device design techniques are compared to each other using design examples of a synchronous multiplier on field programmable gate array (FPGA). The efficiency of the ASMD-FSMD technique compared to the traditional approach in terms of area and performance was investigated. The ASMD-FSMD technique, compared to the traditional one, reduces the area from 28.6% to 39.7% and increases the speed for some designs to 17.6%. In addition, using the ASMD-FSMD technique significantly reduces design time and increases design reliability. In conclusion, recommendations for using the ASMD-FSMD technique are made.

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.

Academic publishing appears to be the most important key of the academic functions (academic research, excellence in teaching and learning and community services). Selecting the right journal to publish research results is a challenge to academics. Yet, there is inadequate knowledge about a model specifically directed at the topic of the journal selection process with a mathematical certainty. The objectives of this research are: to identify the main factors that an author or researchers consider when selecting an academic journal for submitting a manuscript, and, to develop a mathematical algorithm of journal selection that provide the best journal choice with a mathematical certainty based on difficulty of each factor. Quantitative research through questionnaires has been applied as an appropriate instrument base to address the researcher’s identification of the factors that should be considered when selecting a journal. Questionnaire developed and emailed to academics in 31 public and private universities in the developing countries. Academics reported that the most important publication difficulty factors were publishing in reputable journals, and publishing in a journal that has an impact factor. However, the most least publication difficulty factors were found to be: number of issues per year and if the journal is an open access. The proposed mathematical algorithm of journal’s publication difficulty factors was developed and tested.

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.

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.

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.

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 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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

In industrial environments, nesting consists in cutting or extracting pieces from a material sheet, with the purpose of minimizing the surface of the sheet used. This problem is present in different types of industries, such as shipping, aeronautics, woodworking, footwear, and so on. In this work, the aim is to find an acceptable solution to solve complex nesting problems. The research developed is oriented to sacrifice accuracy for speed so as to obtain robust solutions in less computational time. To achieve this, a greedy method and a genetic algorithm have been implemented, being the latter responsible for generating a sequence for the placement of the pieces, where each piece is placed in its current optimal position with the help of a representation system for both the pieces and the material sheet.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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 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.

Fluctuating stock prices make it difficult for investors to see investment opportunities. One tool that can help investors overcome this is forecasting techniques. Long Short-Term Memory (LSTM) is one of deep learning methods used in forecasting time series. The training and success of deep learning is strongly influenced by the selection of hyperparameters. This research uses a hybrid method between the Genetic Algorithm (GA) and LSTM to find a suitable model for predicting stock prices. GA is used in optimizing the architecture such as the number of epochs, window size, and the number of LSTM units in the hidden layer. Tuning optimizer is also carried out using several optimizers to achieve the best value. From method that has been applied, it shows that the method has a good level of accuracy with MAPE values below 10% in every optimizer used. The error rate generated is quite low, in case-1 with a minimum RMSE value of 93.03 and 94.40, & in case-2 with an RMSE value of 104.99 and 150.06 during training and testing. A fairly stable and small value is generated by setting it using the Adam Optimizer.

A finite-difference approach with non-uniform meshes was presented for simulating magnetotelluric responses in 2D structures. We presented the formulation of this scheme and gave some sights into its successful implementation, and compared finite-difference solution with known numerical results and simple analytical solutions. First, a homogeneous half-space model was tested and the finite-difference approach can provide very good accuracy for 2D magnetotelluric modeling. Then we compared to the analytical solutions for the two-layered model, the relative errors of the apparent resistivity and the impedance phase were both increased when the frequency was increased. In the end, we compare our finite-difference simulation results with COMMEMI 2D-0 model with the finite-element solutions. Both results are in close agreement to each other. These comparisons confirm the validity and reliability of our finite-difference algorithm.

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.

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).

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.

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.

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.

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.

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.

Despite the number of studies on bankruptcy prediction using financial ratios, very little is known about how external audit information can contribute to anticipating financial distress. A handful of papers show that a combination of ratios and audit data can provide significant predictive purposes, but a recent paper by Muñoz-Izquierdo et al. (2018) provided an 80% predictive accuracy solely by using the disclosures of audit reports. We complement this study. Applying an artificial intelligence method (the PART algorithm), we examine the predictive ability of more easily extracted information from the report and suggest a practical implication for each user. Simply by (1) finding the audit opinion, (2) identifying if a matter section exist, (3) and the number of comments disclosed, then any user may predict a bankruptcy situation with the same accuracy as if they had scrutinised the whole report. In addition, we also provide an extended literature review about previous studies on the interaction between bankruptcy prediction and the external audit information.

Upper confidence bound multi-armed bandit algorithms (UCB) typically rely on concentration in- equalities (such as Hoeffding’s inequality) for the creation of the upper confidence bound. Intu- itively, the tighter the bound is, the more likely the respective arm is or isn’t judged appropriately for selection. Hence we derive and utilise an optimal inequality. Usually the sample mean (and sometimes the sample variance) of previous rewards are the information which are used in the bounds which drive the algorithm, but intuitively the more infor- mation that taken from the previous rewards, the tighter the bound could be. Hence our inequality explicitly considers the values of each and every past reward into the upper bound expression which drives the method. We show how this UCB method fits into the broader scope of other information theoretic UCB algorithms, but unlike them is free from assumptions about the distribution of the data, We conclude by reporting some already established regret information, and give some numerical simulations to demonstrate the method’s effectiveness.

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.

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.

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.

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.

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.

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 novel metaheuristic optimization method is proposed based on an earthquake that is a geology phenomenon. The novel Earthquake Algorithm (EA) proposed, adapts the principle of propagation of geology waves P and S through the earth material composed by random density to ensure the dynamic balance between exploration and exploitation, in order to reach the best solution to optimization complex problems by searching for the optimum into the search space. The performance and validation of the EA are compared against the Bat Algorithm (BA) and the Particle Swarm Optimization (PSO) by using 10 diverse benchmark functions. In addition, an experimental engineering application is implemented to evaluate the proposed algorithm. Early results show a feasibility of the proposed method with a clearly constancy and stability. It is important highlight the fact that the main purpose of this paper is to present a new line of research, which is opened from the novel EA.

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.

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.

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.

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.

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.

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.

Wearable sensors for human physiological monitoring have attracted tremendous interest from researchers in recent years. However, most of the research was only done in simple trials without any significant analytical algorithms. This study provides a way of recognizing human motion by combining textile stretch sensors based on single-walled carbon nanotubes (SWCNTs) and spandex fabric (PET/SP) and machine learning algorithms in a realistic applications. In the study, the performance of the system will be evaluated by identification rate and accuracy of the motion standardized. This research aims to provide a realistic motion sensing wearable products without unnecessary heavy and uncomfortable electronic devices.

This research presents a solution to the problem of planning the optimum area for economic crops by developed mathematical models and developed an algorithm to solve the problem of planning the optimum area by considered economic value for the maximize profit of farmers. The data were collected from farmers in 8 provinces in the northeastern region of Thailand. The 3 economic crops studied were rice, cassava and sugarcane. The solving problem methods were 1) Created mathematical models and solved the problems with Lingo V.11. 2) Improved Differential Evolution algorithms (I-DE) to solve the problems, which had 3 local search methods included (Swap, Cyclic Move and K-variable moves). The results of this study showed that in the small and medium problems instances, Lingo V.11 and DE provided equal profit outcome but DE was faster but in the large size of test instances DE generated better solution than that of Lingo v.11 when Lingo simulation time is set to 250 hours and DE simulation time has set to maximum 21.82 minutes. 2) Comparing DE and I-DE , I-DE outperforms DE in finding the better solution for all size of test instances (small, medium and large).

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.

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.

Abstract: As the policies and regulations currently in place concentrate on environmental protection and greenhouse gas reduction, we are steadily witnessing a shift in the transportation industry towards electromobility. There are, though, several issues that need to be addressed to encourage the adoption of EVs at a larger scale. To this end, we propose a solution capable of addressing multiple EV charging scheduling issues, such as congestion management, scheduling a charging station in advance, and allowing EV drivers to plan optimized long trips using their EVs. The smart charging scheduling system we propose considers a variety of factors such as battery charge level, trip distance, nearby charging stations, other appointments, and average speed. Given the scarcity of data sets required to train the Reinforcement Learning algorithms, the novelty of the recommended solution lies in the scenario simulator, which generates the labelled datasets needed to train the algorithm. Based on the generated scenarios, we created and trained a neural network that uses a history of previous situations to identify the optimal charging station and time interval for recharging. The results are promising and for future work we are planning to train the DQN model using real-world data.

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.

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.

We developed a novel hybrid approach for solving global optimization, computer science, bio-medical and engineering real life applications that is based on the coupling of the Whale Optimizer and Sine Cosine Algorithms via a surrogate model. We relate the whale optimizer algorithm to balance between the exploitation and the exploration process in the proposed method. There exist confirmed techniques for searching approximate best optimal solutions, but our algorithm will further guarantee that such numerical and statistical solutions satisfy physical bounds of the standard and real life functions. Our experiments with the benchmark, bio-medical, computer science and engineering real life problems have illustrated the advantages of using a newly hybrid approach based on mixing Whale Optimizer and Sine Cosine algorithms. It holds considerable potential for reducing execution time for solving standard and real life problems and at the same time improving the quality of the solution.

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.

\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.

The widespread adoption of electromobility constitutes one of the measures designed to reduce air pollution caused by traditional fossil fuels. However, several factors are currently impending this process, ranging from insufficient charging infrastructure, battery capacity, long queueing and charging time, to psychological factors. On top of range anxiety, the frustration of the EV drivers is further fueled by the lack the uncertainty of finding an available charging point on their route. To address this issue, we propose a solution that comes to bypass the limitations of the Reserve now function of the OCPP standard, enabling drivers to make charging reservations for the upcoming days, especially when planning a longer trip. We created an algorithm that generates reservation intervals based on the charging station's reservation and transaction history. Subsequently, we ran a series of test cases that yielded promising results, with no overlapping reservations.

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 tsscds method, recently developed in our group, discovers chemical reaction mechanisms with minimal human intervention. It employs accelerated molecular dynamics, spectral graph theory, statistical rate theory and stochastic simulations to uncover chemical reaction paths and to solve the kinetics at the experimental conditions. In the present review, its application to solve mechanistic/kinetics problems in different research areas will be presented. Examples will be given of reactions involved in photodissociation dynamics, mass spectrometry, combustion chemistry and organometallic catalysis. Some planned improvements will also be described.

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.

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.

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.

PEM fuel cell is a technology successfully used in the production of energy from hydrogen, allowing the use of hydrogen as an energy vector. It is scalable for stationary and mobile applications. However, the technology demands more research. An important research topic is fault diagnosis and condition monitoring to improve the life and the efficiency and to reduce the operation costs of PEMFC devices. Consequently, there is a need of physical models that let deep analysis. These models must be accurate enough to represent the PEMFC behavior and to allow the identification of different internal signals of a PEM fuel cell. This work presents a PEM fuel cell model that uses the output temperature in a closed loop, so it can represent the thermal and the electrical behavior. The model is used to represent a NEXA Ballard 1.2 kW; therefore it is necessary to fit the coefficients to represent the real behavior. Five optimization algorithms were tested to fit the model, three of them were taken from literature and two were proposed. Finally, the model with the parameters identified was validated with real.

In the past, Unmanned Aerial Vehicles (UAVs) were mostly used in the military operations to prevent pilot losses. Nowadays, the fast technological evolution enables the production of a class of cost-effective UAVs which can service a plethora of public and civilian applications, specially when configured to work cooperatively to accomplish a task. However, designing a communication network among the UAVs is challenging task. In this article, we propose a centralized UAV placement strategy, where UAVs are used as flying access points forming a mesh network, providing connectivity to ground nodes deployed in a target area. The geographical placement of UAVs is optimized based on a Multi-Objective Evolutionary Algorithm (MOEA). The goal of the proposed scheme is to cover all ground nodes using a minimum number of UAVs, while maximizing the fulfillment of their data rate requirements. The UAVs can employ different data rates depending on the channel conditions, which are expressed by the Signal-to-Noise-Ratio (SNR). In this work, elitist Non-Dominated Sorting Genetic Algorithm II (NSGA-II) is used to find a set of optimal positions to place UAVs, given the positions of the ground nodes. We evaluate the trade-off between the number of UAVs used to cover the target area and the data rate requirement of the ground nodes. Simulation results show that the proposed algorithm can optimize the UAV placement given the requirement and the positions of the ground nodes in the geographical area.

In a wireless network, locations of base stations (BSs)/access points (APs)/sensor nodes can be modeled based on stochastic processes, e.g., a Poisson point process (PPP) or a deterministic pattern planned ahead by providers. While deterministic deployment does not provide tractable interference analysis in general, PPP yields tractable analysis for interference. However, PPP allows APs to be deployed very close to each other and gives pessimistic results compared to the field measurements. In this study, in order to address this issue, Lloyd’s algorithm, which functions as a bridge between random and structural APs deployments, is investigated for analyzing coverage probability in a network. The link distance distribution is modeled as a mixture of Weibull distributions and its parameters are obtained by using the expectation-maximization (EM) algorithm for each iteration of Lloyd’s algorithm. The link distance distribution is further utilized for calculating the coverage probability approximately by exploiting the tractability of PPP.

This study presents application of demand response strategy in a standalone wind-solar-battery hybrid energy system (HES). Inputs for the designed HES are wind speed, solar radiation, temperature and load demand which is variable with time. In this study, hourly values of meteorological data and hourly load demand are considered in one year. An improved gravitational search algorithm (IGSA) is used to optimize the configuration of the standalone wind-solar-battery hybrid power system. The optimal objectives of the system are cost of the system in life cycle, the loss of power supply probability（LPSP）and the energy excess percentage（EXC）.The effect of demand response on economic benefit and energy storage allocation of the standalone wind-solar-battery system is studied. The obtained optimal configuration of the proposed HES can provide minimal energy cost with excellent performance and reduced waste and unmet load.

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.

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.

A swarm based nature-inspired optimization algorithm namely fruit fly optimization algorithm (FOA) has simple structure and ease of implementation. However, FOA has a low success rate and a slow convergence because FOA generates new positions around the best location using fixed search radius. Several improved FOAs have been proposed. But their exploration ability is questionable. To make the search process to transit from the exploration phase to the exploitation phase smoothly, this paper proposes a new FOA constructed from a cooperation of the multileader and the probabilistic random walk strategies (CPFOA). It has two population types working together. CPFOA's performance is evaluated by 18 well-known standard benchmark, and 30 CEC’2017 functions. The results showed that CPFOA outperforms both the original FOA and its variants in terms of convergence speed and performance accuracy. The results base on CEC’2017 show that CPFOA can achieve a very promising accuracy when compared with the well-known competitive algorithms. CPFOA is applied to optimize two applications; the MLPs classifying real datasets and extracting parameters of T-S fuzzy system for modelling Box and Jenkins gas furnace data set. CPFOA can find parameters having a very high quality compared with the best known competitive algorithms.

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.

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.

Prediction of crop yield is essential for food security policymaking, planning, and trade. The objective of the current study is to propose novel crop yield prediction models based on hybrid machine learning methods. In this study, the performance of artificial neural networks-imperialist competitive algorithm (ANN-ICA) and artificial neural networks-gray wolf optimizer (ANN-GWO) models for the crop yield prediction is evaluated. According to the results, ANNGWO, with R of 0.48, RMSE of 3.19, and MEA of 26.65, proved a better performance in the crop yield prediction compared to the ANN-ICA model. The results can be used by either practitioners, researchers or policymakers for food security.

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.

The identification of linear dynamic systems with static nonlinearities in the delta domain has been presented in this paper applying a firefly based hybrid meta-heuristic algorithm integrating Firefly algorithm (FA) and Gray wolf optimizer (GWO). FA diversifies the search space globally while GWO intensifies the solutions through its local search abilities. A test system with continuous polynomial nonlinearities has been considered for hammerstein and wiener system identification in continuous, discrete and delta domain. Delta operator modelling unifies system identification of continuous-time systems with discrete domain at higher sampling frequency. Pseudo random binary sequence, contaminated with white noise, has been taken up as the input signal to estimate the unknown model parameters as well as static nonlinear coefficients. The hybrid algorithm not only outperforms the parent heuristics of which they are constituted but also proves better as compared to some standard and latest heuristic approaches reported in the literature.

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.

By the study of the pattern book Ying Zao Fa Shi (building regulations of Song Dynasty, 1103 AD), while analyzing the combining and dimensioning rule of timber framework and tile work, a model self-generating program has been compiled for the first time. The operating framework has been firstly defined, while solving the issues of clustering principle, connecting method, output classification, etc. with the detailed description of algorithm theory. Taking the corner bracket set and nine-ridge roof for example, after the compilation and debug by Grasshopper, according to various input parameters, various models have been generated automatically by the plugin, proving the velocity and the veracity of the algorithm.

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.

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.

Owing to the time-varying characteristics and nonlinearities of industrial processes, control has higher difficulties and results in challenges for advanced technology. In this paper, a self-tuning controller that includes a nonlinear proportional-integral-derivative (NPID) control function as well as a self-tuning function is proposed for first-order plus time delay (FOPTD) process control. The NPID control function is implemented using the nonlinear PID controller whose optimum parameters are adapted by a neural network (NN). The self-tuning function is able to identify the process dynamics using a short period of process behavior and tune NPID parameters based on the identified parameters. The advantage of the proposed method is validated with a set of simulation works on three processes and the comparison results are presented.

Robotic path planning is a field of research which is gaining traction given the broad domains of interest to which path planning is an important systemic requirement; the aim being to optimise the efficacy of robotic movements in a defined operational environment. For example, robots have been employed in many domains including: cleaning robots (such as vacuum cleaners), automated paint spraying robots, window cleaning robots, forest monitoring robots, agricultural robots (often driven using satellite and geostationary positional satellite data). Additionally, mobile robotic systems have been utilised in disaster areas and locations hazardous to humans (such as war zones in mine clearance). The coverage path planning problem describes an approach which is designed to determine the path that traverses all points in a defined operational environment while avoiding static and dynamic (moving) obstacles. In this paper we present our proposed Smooth-STC model, the aim of the model being to identify an optimal path, avoid all obstacles, prevent (or at least minimise) backtracking, and maximise the coverage in any defined operational environment. The experimental results in a simulation show that, in uncertain environments, our proposed smooth STC method achieves an almost absolute coverage rate and demonstrates improvement when measured against alternative conventional algorithms.

There are some limitations in the null test measurement in the stitching interferometry. In order to meet the null test conditions, the moving distance between the sub-apertures often deviates from the theoretical preset distance, which leads to a position deviation of sub-apertures under measurements. To overcome this problem, an algorithm for data processing is proposed. We used iterative calculation of the deviations between the sub-apertures to adjust their positions, to ensure the local validity of the linear approximation algorithm and realize the exact stitching. A cylindrical lens as an object for experimental examination of the proposed method was taken. The obtained results demonstrate the validity, reliability and feasibility of our iterative stitching algorithm.

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/

Drying food involves complex physical atmospheric mechanisms with non-linear relations from the air-food interactions and those relations are strongly dependent on the moisture contents and the type of food. Such dependence makes it complex to design suitable dryers dedicated to a single drying process. To streamline the design of a novel compact food-drying machine, a heat pump dryer component design optimization algorithm was developed as a subprogram of a Computer Aided Engineering tool. The algorithm requires inputting food and air properties, the volume of the drying container and the technical specifications of the heat-pump off-the shelf components. The heat required to dehumidify the food supplied by the heat exchange process from condenser to evaporator, and the compressor’s requirements (refrigerant mass flow rate and operating pressures) are then calculated. Compressors can then be selected based in the volume and type of food to be dried. The algorithm is shown via a flow chart to guide the user through 3 different stages: Changes in drying air properties, Heat flow within dryer and Product moisture content. Example results of how different compressors are selected for different type of produces and quantities (Agaricus Blazei mushroom with 3 different moisture contents or fish from Thunnini tribe) conclude this article.

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.

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.

Densimetric Froude (Fr) is the minimum velocity required to prevent sediment deposition in pipes. Prediction of Fr is of utmost importance in numerous applications in civil engineering. In this paper through using a new hybrid method. Genetic Algorithm (GA) is used for optimum selection of membership functions of Adaptive Neuro-Fuzzy Inference System (ANFIS), and Singular Value Decomposition (SVD) method is used to compute the linear parameters of ANFIS’s results section (ANFIS-GA/SVD). Also, two different target functions are known as training error (TE) and prediction error (PE) by Pareto curve, the trade-off between these functions is selected as the optimal modeling point. First, different models will be presented using the parameters affecting Fr prediction, classifying them in different groups; then the Fr parameter will be predicted for all the different models through utilizing three different sets of data and the ANFIS-GA/SVD technique. The results of the models indicate that the best Fr prediction is obtained when independent parameters such as volumetric sediment concentration (CV), ratio of median diameter of particle size to pipe diameter (d/D), ratio of median diameter of particle size to hydraulic radius (d/R) and overall friction factor of sediment (λs) use as input variables in prediction of Fr. A sensitivity analysis is also conducted for the purpose of examining the effect of each of the dimensionless parameters on Fr prediction accuracy. Comparing the results of the suggested models with the existing regression-based equations shows that ANFIS-GA/SVD (R²=0.986, MAPE=4.397, RMSE=0.206, SI=0.053, ρ=0.026, BIAS=-0.025) is more accurate than the rest of the models.

The continuous development in the field of industrial automation and electric mobility has led to the need for more efficient electrical machines with high power density. The improvement of electrical machines slot filling factors is one of the measures to satisfy these requirements. In recent years, this topic has aroused greater interest in the industrial sector, since the evolution of the winding technological manufacturing processes allows an economically sustainable realization of ordered winding arrangements, rather than random ones. Moreover, the manufacture of electrical machines windings must be preceded by an accurate design phase in which it is possible to evaluate the maximum slot filling factor obtainable for a given wire shape and for its dimensions. For this purpose, this paper presents an algorithmic approach for the evaluation of maximum slot filling factors in electrical machines under ideal geometric premise. In particular, this algorithm has a greater degree of flexibility with respect to the algorithm approaches found in the literature, since the study has been extended to round, rectangular and hexagonal wire sections. Furthermore, the slot filling factor calculation was carried out both for standard and non-standard slots. The algorithmic approach proposed can be considered as an additional useful tool for the fast design of electrical machine windings.

Nowadays, the wasting of resources is one of the fundamental challenges of the industrial sector. The rectangle packing problem can be very effective in this context. Practical applications of this issue in the timing and designing of the industries and businesses are very remarkable. The purpose of this issue is to arrange a set of rectangles with specific dimensions in a rectangular page with a specific width and unlimited height without overlapping. The fundamental challenge in this issue is that this is an NP-complete issue. Therefore, it is difficult to achieve the best arrangement, which has the maximum rate of resource utilization and also has a linear running time. Many algorithms have been presented to estimate a practical solution for this issue. In the past decades, the best fit method has been one of the most useful methods for this purpose. This study presents a combinatorial algorithm based on two algorithms, including the lowest front-line strategy and the best-fit algorithm. The running results indicate that the suggested algorithm performs well, despite its simplicity. The time complexity of the suggested algorithm is O(nm), in which n is the number of input rectangles and m is the number of the created front lines.

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.