As one type of resistance furnace, the electrical tube furnace (ETF) typically experiences input noise, measurement noise, system uncertainties, unmodeled dynamics and external disturbances, which significantly degrade its temperature control performance. To provide precise, and robust temperature tracking performance for the ETF, a robust composite control (RCC) method is proposed in this paper. The overall RCC method consists of four elements: First, the mathematical model of the ETF system is deduced, then a state feedback control (SFC) is constructed. Third, a novel disturbance observer (DO) is designed to estimate the lumped disturbance with one observer parameter. Moreover, the stability of the closed loop system including controller

The reactive yellow azo dye (λmax = 420 nm) is widely utilized for textile coloring due to its low-cost stability and tolerance properties. Treatment of dye-containing wastewater by traditional methods is usually inadequate because of its resistance to biological and chemical degradation. From this research, the continuous reactor of an advanced oxidation method supported the use of H₂O₂/TiO₂/UV to remove the coloration of the reactive yellow dye from the discharge. At constant best conditions obtained from the batch reactor tests pH=7, H₂O₂ dosage = 400 mg/l and TiO₂=25mg/l , the aqueous solutions were tested in the continuous reactor at different dye concentration and d

The temperature distributions are to be evaluated for the furnace of Al-Mussaib power plant. Monte Carlo simulation procedure is used to evaluate the radiation heat transfer inside the furnace, where the radiative transfer is the most important process occurring there. Weighted sum of gray-gases model is used to evaluate the radiative properties of the non gray gas in the enclosure. The energy balance equations are applied for each gas, and surface zones, and by solving these equations, both the temperature, and the heat flux are found.

   Good degree of accuracy has been obtained, when comparing the results obtained by the simulation with the data of the designing company, and the data obtained by the zonal method. In

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

In the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

One of the most difficult issues in the history of communication technology is the transmission of secure images. On the internet, photos are used and shared by millions of individuals for both private and business reasons. Utilizing encryption methods to change the original image into an unintelligible or scrambled version is one way to achieve safe image transfer over the network. Cryptographic approaches based on chaotic logistic theory provide several new and promising options for developing secure Image encryption methods. The main aim of this paper is to build a secure system for encrypting gray and color images. The proposed system consists of two stages, the first stage is the encryption process, in which the keys are genera