By definition, the detection of protein complexes that form protein-protein interaction networks (PPINs) is an NP-hard problem. Evolutionary algorithms (EAs), as global search methods, are proven in the literature to be more successful than greedy methods in detecting protein complexes. However, the design of most of these EA-based approaches relies on the topological information of the proteins in the PPIN. Biological information, as a key resource for molecular profiles, on the other hand, acquired a little interest in the design of the components in these EA-based methods. The main aim of this paper is to redesign two operators in the EA based on the functional domain rather than the graph topological domain. The perturb

The aim of this paper is to derive a posteriori error estimates for semilinear parabolic interface problems. More specifically, optimal order a posteriori error analysis in the - norm for semidiscrete semilinear parabolic interface problems is derived by using elliptic reconstruction technique introduced by Makridakis and Nochetto in (2003). A key idea for this technique is the use of error estimators derived for elliptic interface problems to obtain parabolic estimators that are of optimal order in space and time.

The aim of our study is to solve a nonlinear epidemic model, which is the COVID-19 epidemic model in Iraq, through the application of initial value problems in the current study. The model has been presented as a system of ordinary differential equations that has parameters that change with time. Two numerical simulation methods are proposed to solve this model as suitable methods for solving systems whose coefficients change over time. These methods are the Mean Monte Carlo Runge-Kutta method (MMC_RK) and the Mean Latin Hypercube Runge-Kutta method (MLH_RK). The results of numerical simulation methods are compared with the results of the numerical Runge-Kutta 4th order method (RK4) from 2021 to 2025 using the absolute error, which prove

In this paper, two new simple, fast and efficient block matching algorithms are introduced, both methods begins blocks matching process from the image center block and moves across the blocks toward image boundaries. With each block, its motion vector is initialized using linear prediction that depending on the motion vectors of its neighbor blocks that are already scanned and their motion vectors are assessed. Also, a hybrid mechanism is introduced, it depends on mixing the proposed two predictive mechanisms with Exhaustive Search (ES) mechanism in order to gain matching accuracy near or similar to ES but with Search Time ST less than 80% of the ES. Also, it offers more control capability to reduce the search errors. The experimental tests

The regressor-based adaptive control is useful for controlling robotic systems with uncertain parameters but with known structure of robot dynamics. Unmodeled dynamics could lead to instability problems unless modification of control law is used. In addition, exact calculation of regressor for robots with more than 6 degrees of freedom is hard to be calculated, and the task could be more complex for robots. Whereas the adaptive approximation control is a powerful tool for controlling robotic systems with unmodeled dynamics. The local (partitioned) approximation-based adaptive control includes representation of the uncertain matrices and vectors in the robot model as finite combinations of basis functions. Update laws for the weighting matri

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

       In this study, a simulation model inside a channel of rectangular section with high of (0.16 m) containing two rectangular obstruction plates were aligned variable heights normal to the direction of flow, use six model of the obstructions height of (0.059, 0.066, 0.073, 0.08 and 0.087 m) were compared with the flow behavior of the same duct without obstructions. To predict the velocity profile, pressure distribution, pressure coefficient and turbulence kinetic energy flow of air, the differential equations which describe the flow were approximated by the finite volumes method for two dimensional, by using commercial software package (FLUENT) with standard of k-ε model two dimensions turbulence flow.

As the temperature of combustion gases is higher than the melting temperature of the turbine materials, cooling of turbine parts in a gas turbine engine is necessary for safe operation. Cooling methods investigated in this computational study included cooling flow losses. Film-cooling is one typically used cooling method whereby coolant is supplied through holes passage, in present study the holes placed along the camber line of the blade. The subject of this paper is to evaluate the heat transfer that occur on the holes of blade through different
blowing coolant rates. The cases of this study were performed in a low speed wind tunnel with two tip gap at small and large (0.03 and 0.09cm) and multiple coolant flow rates through the fil