The problem of reconstruction of a timewise dependent coefficient and free boundary at once in a nonlocal diffusion equation under Stefan and heat Flux as nonlocal overdetermination conditions have been considered. A Crank–Nicolson finite difference method (FDM) combined with the trapezoidal rule quadrature is used for the direct problem. While the inverse problem is reformulated as a nonlinear regularized least-square optimization problem with simple bound and solved efficiently by MATLAB subroutine lsqnonlin from the optimization toolbox. Since the problem under investigation is generally ill-posed, a small error in the input data leads to a huge error in the output, then Tikhonov’s regularization technique is app

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with

To improve the efficiency of a processor in recent multiprocessor systems to deal with data, cache memories are used to access data instead of main memory which reduces the latency of delay time. In such systems, when installing different caches in different processors in shared memory architecture, the difficulties appear when there is a need to maintain consistency between the cache memories of different processors. So, cache coherency protocol is very important in such kinds of system. MSI, MESI, MOSI, MOESI, etc. are the famous protocols to solve cache coherency problem. We have proposed in this research integrating two states of MESI's cache coherence protocol which are Exclusive and Modified, which responds to a request from reading

        In this paper, the necessary optimality conditions are studied and derived for a new class of the sum of two Caputo–Katugampola fractional derivatives of orders (α, ρ) and( β,ρ) with fixed the final boundary conditions. In the second study, the approximation of the left Caputo-Katugampola fractional derivative was obtained by using the shifted Chebyshev polynomials. We also use the Clenshaw and Curtis formula to approximate the integral from -1 to 1. Further, we find the critical points using the Rayleigh–Ritz method. The obtained approximation of the left fractional Caputo-Katugampola derivatives was added to the algorithm applied to the illustrative example so that we obtained the approximate results for the stat

 A simulation study is used to examine the robustness of some estimators on a multiple linear regression model with problems of multicollinearity and non-normal errors, the Ordinary least Squares (LS) ,Ridge Regression, Ridge Least Absolute Value (RLAV), Weighted Ridge (WRID), MM and a robust ridge regression estimator MM estimator, which denoted as RMM this is the modification of the Ridge regression by incorporating robust MM estimator . finialy, we show that RMM is the best among the other estimators

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric

The vision and philosophy of the economic system in Iraq after 2003 were not clear-cut because of overlapping internal factors was the novelty of the political system and the lack of political and economic decision makers to understanding and conviction full need shaping a new administration for the Iraqi economy is able to succeed economic development programs, and external factors was determinedly organizations international application of shock reforming style and contrary to the social reality and the security which reflected negatively on the work and consistency Lisseeash financial balance between stability and growth and raise the level of consumer spending and the importance of research lies in the ability of fiscal policy to achie

Load balancing in computer networks is one of the most subjects that has got researcher's attention in the last decade. Load balancing will lead to reduce processing time and memory usage that are the most two concerns of the network companies in now days, and they are the most two factors that determine if the approach is worthy applicable or not. There are two kinds of load balancing, distributing jobs among other servers before processing starts and stays at that server to the end of the process is called static load balancing, and moving jobs during processing is called dynamic load balancing. In this research, two algorithms are designed and implemented, the History Usage (HU) algorithm that statically balances the load of a Loaded

 The article critically analyzes traditional translation models. The most influential models of translation in the second half of the 20th century have been mentioned, among which the theory of formal and dynamic equivalence, the theory of regular correspondences, informative, situational-denotative, functional-pragmatic theory of communication levels have been considered. The selected models have been analyzed from the point of view of the universality of their use for different types and types of translation, as well as the ability to comprehend the deep links established between the original and the translation.

Аннотация