For several applications, it is very important to have an edge detection technique matching human visual contour perception and less sensitive to noise. The edge detection algorithm describes in this paper based on the results obtained by Maximum a posteriori (MAP) and Maximum Entropy (ME) deblurring algorithms. The technique makes a trade-off between sharpening and smoothing the noisy image. One of the advantages of the described algorithm is less sensitive to noise than that given by Marr and Geuen techniques that considered to be the best edge detection algorithms in terms of matching human visual contour perception.

   In this paper, a mathematical model for the oxidative desulfurization of kerosene had been developed. The mathematical model and simulation process is a very important process due to it provides a better understanding of a real process. The mathematical model in this study was based on experimental results which were taken from literature to calculate the optimal kinetic parameters where simulation and optimization were conducted using gPROMS software. The optimal kinetic parameters were Activation energy 18.63958 kJ/mol, Pre-exponential factor  2201.34 (wt)^-0.76636. min^-1  and the reaction order 1.76636. These optimal kinetic parameters were used to find the optimal reaction conditions which

In this paper, the Monte Carlo N-Particle extended  computer code (MCNP) were used to design a model of the European Sodium-cooled Fast Reactor. The multiplication factor, conversion factor, delayed neutrons fraction, doppler constant, control rod worth, sodium void worth, masses for major heavy nuclei, radial and axial power distribution at high burnup are studied. The results show that the reactor breeds fissile isotopes with a conversion ratio of 0.994 at fuel burnup 70 (GWd/T), and minor actinides are buildup inside the reactor core. The study aims to check the efficiency of the model on the calculation of the neutronic parameters of the core at high burnup.

Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

The software-defined network (SDN) is a new technology that separates the control plane from data ‎plane for the network devices. One of the most significant issues in the video ‎surveillance system is the link failure. When the path failure occurs, the monitoring center cannot receive the ‎video from the cameras. In this paper, two methods are proposed to solve this problem.  The first ‎method uses the Dijkstra algorithm to re-find the path at the source node switch. The second method ‎uses the Dijkstra algorithm to re-find the path at the ingress node switch (or failed link).

Inthisstudy,FourierTransformInfraredSpectrophotometry(FTIR),XRay Diffraction(XRD)andlossonignition(LOI),comparativelyemployedtoprovideaquick,relativelyinexpensiveandefficientmethodforidentifyingandquantifyingcalcitecontentofphosphateoresamplestakenfromAkashatsiteinIraq.Acomprehensivespectroscopicstudyofphosphate-calcitesystemwasreportedfirstintheMid-IRspectra(4004000cm-1)usingShimadzuIRAffinity-1,fordifferentcutsofphosphatefieldgradeswithsamplesbeneficiatedusingcalcinationandleachingwithorganicacidatdifferenttemperatures.Thenusingtheresultedspectratocreateacalibrationcurverelatesmaterialconcentrationstotheintensity(peaks)ofFTIRabsorbanceandappliesthiscalibrationtospecifyphosphate-calcitecontentinIraqicalcareousphosphateore.Theirpeakswereass

This paper is concerned with combining two different transforms to present a new joint transform FHET and its inverse transform IFHET. Also, the most important property of FHET was concluded and proved, which is called the finite Hankel – Elzaki transforms of the Bessel differential operator property, this property was discussed for two different boundary conditions, Dirichlet and Robin. Where the importance of this property is shown by solving axisymmetric partial differential equations and transitioning to an algebraic equation directly. Also, the joint Finite Hankel-Elzaki transform method was applied in solving a mathematical-physical problem, which is the Hotdog Problem. A steady state which does not depend on time was discussed f

  Time represented a significant element in building any film story, despite its inability to express itself, but by employing the rest of the elements of the cinematic mediator language to express it. Time factor is present and manifested in all the details of the picture, and the more important is its presence in the event narration process. The narration totally depends on temporal structure in which it appears, which makes time a dominating element in the development of the narrative shapes and patterns. The narrative propositions have come to take new workings that time streams appeared that manipulate the time structure, reversing it, stopping it or making it fluctuate between the three levels of time, or repeating it or make

Image compression is one of the data compression types applied to digital images in order to reduce their high cost for storage and/or transmission. Image compression algorithms may take the benefit of visual sensitivity and statistical properties of image data to deliver superior results in comparison with generic data compression schemes, which are used for other digital data. In the first approach, the input image is divided into blocks, each of which is 16 x 16, 32 x 32, or 64 x 64 pixels. The blocks are converted first into a string; then, encoded by using a lossless and dictionary-based algorithm known as arithmetic coding. The more occurrence of the pixels values is codded in few bits compare with pixel values of less occurre