Solid waste is a major issue in today's world. Which can be a contributing factor to pollution and the spread of vector-borne diseases. Because of its complicated nonlinear processes, this problem is difficult to model and optimize using traditional methods. In this study, a mathematical model was developed to optimize the cost of solid waste recycling and management. In the optimization phase, the salp swarm algorithm (SSA) is utilized to determine the level of discarded solid waste and reclaimed solid waste. An optimization technique SSA is a new method of finding the ideal solution for a mathematical relationship based on leaders and followers. It takes a lot of random solutions, as well as their outward or inward fluctuations, to find the optimal solution. This method also included multiple adaptive and random variables to guarantee that the solution space was explored and used in various optimization tasks. When all criteria are considered, the results of this study show that the SSA is efficient for least-distance path allocation. The simulation findings reveal a significant improvement over the well-known particle swarm optimization (PSO) algorithm, with recycling and disposal costs decreasing by 10% to 30%.
Nowadays, information systems constitute a crucial part of organizations; by losing security, these organizations will lose plenty of competitive advantages as well. The core point of information security (InfoSecu) is risk management. There are a great deal of research works and standards in security risk management (ISRM) including NIST 800-30 and ISO/IEC 27005. However, only few works of research focus on InfoSecu risk reduction, while the standards explain general principles and guidelines. They do not provide any implementation details regarding ISRM; as such reducing the InfoSecu risks in uncertain environments is painstaking. Thus, this paper applied a genetic algorithm (GA) for InfoSecu risk reduction in uncertainty. Finally, the ef
... Show MoreImplementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.
In this paper, we will present proposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consists of ten BMP 24-bit true color images, building an application by using visual basic 6.0 to show the size after and before compression process and computing the compression ratio for RLE and for the enhanced RLE algorithm.
Features is the description of the image contents which could be corner, blob or edge. Corners are one of the most important feature to describe image, therefore there are many algorithms to detect corners such as Harris, FAST, SUSAN, etc. Harris is a method for corner detection and it is an efficient and accurate feature detection method. Harris corner detection is rotation invariant but it isn’t scale invariant. This paper presents an efficient harris corner detector invariant to scale, this improvement done by using gaussian function with different scales. The experimental results illustrate that it is very useful to use Gaussian linear equation to deal with harris weakness.
Several attempts have been made to modify the quasi-Newton condition in order to obtain rapid convergence with complete properties (symmetric and positive definite) of the inverse of Hessian matrix (second derivative of the objective function). There are many unconstrained optimization methods that do not generate positive definiteness of the inverse of Hessian matrix. One of those methods is the symmetric rank 1( H-version) update (SR1 update), where this update satisfies the quasi-Newton condition and the symmetric property of inverse of Hessian matrix, but does not preserve the positive definite property of the inverse of Hessian matrix where the initial inverse of Hessian matrix is positive definiteness. The positive definite prope
... Show MoreThe behavior of AC conductivity (σac), loss tangent (tan δ), and relative permittivity (ε′) for composites of PVC-P/graphite electrode waste (GEW) was investigated, and a qualitative explanation was provided as a function of PVC-P weight fractions (0, 5, 10, 15, 20, and 25) wt. percent, temperature (30-90) °C, and frequency (100Hz-2MHz). The behaviors of the composites' ac. conductivity and impedance as a frequency function and temperature have been examined. The permittivity was shown to rise with increasing temperature (Tg). The relative permittivity increased as the GEW filler concentration increased and was highest in the low-frequency range; nevertheless decreased as the frequency increased.
The current study suggested a thermal treatment as a necessary proactive step in improving the adsorption capacity of bio-waste for contaminants removal in wastewater. This approach was based on the experimental and histological investigation of biowaste pods shell. This investigation showed that these shells compose of parenchyma cells that store secondary metabolites compounds produced from cells were exhibited in present study. The results also reported that these compounds are extracted directly from the cells as soon as they are exposed to an aqueous solution, hampering their use as an adsorbent material. The increase in the weight of bio-waste adsorbent at unit liquid volume increases the production of secondary metabolites compounds
... Show More