In this article, the inverse source problem is determined by the partition hyperbolic equation under the left end flux tension of the string, where the extra measurement is considered. The approximate solution is obtained in the form of splitting and applying the finite difference method (FDM). Moreover, this problem is ill-posed, dealing with instability of force after adding noise to the additional condition. To stabilize the solution, the regularization matrix is considered. Consequently, it is proved by error estimates between the regularized solution and the exact solution. The numerical results show that the method is efficient and stable.

            In this paper, new method have been investigated using evolving algorithms (EA's) to cryptanalysis one of the nonlinear stream cipher cryptosystems which depends on the Linear Feedback Shift Register (LFSR) unit by using cipher text-only attack. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) which are used for attacking one of the nonlinear cryptosystems called "shrinking generator" using different lengths of cipher text and different lengths of combined LFSRs. GA and ACO proved their good performance in finding the initial values of the combined LFSRs. This work can be considered as a warning for a stream cipher designer to avoid the weak points, which may be f

      This paper examines the finding of spacewise dependent heat source function in pseudoparabolic equation with initial and homogeneous Dirichlet boundary conditions, as well as the final time value / integral specification as additional conditions that ensure the uniqueness solvability of the inverse problem. However, the problem remains ill-posed because tiny perturbations in input data cause huge errors in outputs. Thus, we employ Tikhonov’s regularization method to restore this instability. In order to choose the best regularization parameter, we employ L-curve method. On the other hand, the direct (forward) problem is solved by a finite difference scheme while the inverse one is reformulated as an optimization problem. The

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s

The main aim of this research is to introduce financing cost optimization and different financing alternatives. There are many studies about financing cost optimization. All previous studies considering the cost of financing have many shortcomings, some considered only one source of financing as a credit line without taking into account different financing alternatives. Having only one funding alternative powers, restricts contractors and leads to a very specific financing model. Although it is beneficial for the contractor to use a long-term loan to minimize interest charges and prevent a substantial withdrawal from his credit line, none of the existing financial-based planning models have considered long-term loans in

     The main task of creating new digital images of different skin diseases is to increase the resolution of the specific textures and colors of each skin disease. In this paper, the performance of generative adversarial networks has been optimized to generate multicolor and histological color digital images of a variety of skin diseases (melanoma, birthmarks, and basal cell carcinomas). Two architectures for generative adversarial networks were built using two models: the first is a model for generating new images of dermatology through training processes, and the second is a discrimination model whose main task is to identify the generated digital images as either real or fake. The gray wolf swarm algorithm and the whale swarm alg

     In this research, an unknown space-dependent force function in the wave equation is studied. This is a natural continuation of [1] and chapter 2 of [2] and [3], where the finite difference method (FDM)/boundary element method (BEM), with the separation of variables method, were considered. Additional data are given by the one end displacement measurement. Moreover, it is a continuation of [3], with exchanging the boundary condition, where  are extra data, by the initial condition. This is an ill-posed inverse force problem for linear hyperbolic equation. Therefore, in order to stabilize the solution, a zeroth-order Tikhonov regularization method is provided. To assess the accuracy, the minimum error between

The approximate solution of a nonlinear parabolic boundary value problem with variable coefficients (NLPBVPVC) is found by using mixed Galekin finite element method (GFEM) in space variable with Crank Nicolson (C-N) scheme in time variable. The problem is reduced to solve a Galerkin nonlinear algebraic system (NLAS), which is solved by applying the predictor and the corrector method (PCM), which transforms the NLAS into a Galerkin linear algebraic system (LAS). This LAS is solved once using the Cholesky technique (CHT) as it appears in the MATLAB package and once again using the General Cholesky Reduction Order Technique (GCHROT), the GCHROT is employed here at first time to play an important role for saving a massive time. Illustrative