Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the problems that are related to the optimization. This study presents a new adaptive distributed algorithm of routing on CSA. Because the search space may be modified according to the size and kind of the network, the algorithm can be easily customized to the issue space. In contrast to population-based algorithms that have a broad and time-consuming search space. For ten networks of various sizes, the technique was used to solve the shortest path issue. And its capability for solving the problem of the routing in the switched networks is examined: detecting the shortest path in the process of a data packet transfer amongst the networks. The suggested method was compared with four common metaheuristic algorithms (which are: ACO, AHA, PSO and GA) on 10 datasets (integer, weighted, and not negative graphs) with a variety of the node sizes (10 - 297 nodes). The results have proven that the efficiency of the suggested methods is promising as well as competing with other approaches.
Even though image retrieval is considered as one of the most important research areas in the last two decades, there is still room for improvement since it is still not satisfying for many users. Two of the major problems which need to be improved are the accuracy and the speed of the image retrieval system, in order to achieve user satisfaction and also to make the image retrieval system suitable for all platforms. In this work, the proposed retrieval system uses features with spatial information to analyze the visual content of the image. Then, the feature extraction process is followed by applying the fuzzy c-means (FCM) clustering algorithm to reduce the search space and speed up the retrieval process. The experimental results show t
... Show MoreThe research deals with Environmental Management and how to develop its programs with the use of Knowledge Management, the environmental programs that integrate with processes can add strategic value to business through improving rates of resource utilization , efficiencies , reduce waste, use risk management, cut costs, avoid fines and reduce insurance. All these activities and processes can improve it through knowledge management, the optimal usage for all organizations information , employ it in high value and share it among all organizations members who involves in modify its strategy . Choosing suitable environmental management information system, develop it and modify it with organization processes, can greatly serve the en
... Show MoreThe preparation of tin metal from stannous chloride solution by wet method in the presence of aluminum powder as a reducing agent is studied. The preparation is commenced through a reduction step in the presence of reducing agent followed by smelting step at elevated temperature in a programmable electrical furnace. In the reduction step, preliminary experiments are conducted to study the effect of initial acidity, time of addition of the aluminum powder and excess amount of reducing agent on the conversion of stannous to tin metal. Three different parameters are studied through smelting step, these are : heating rate, temperature and residence time.
To characterize the product, different instrumental analyses are used:
... Show MoreA loS.sless (reversible) data hiding (embedding) method inside an image (translating medium) - presented in the present work using L_SB (least significant bit). technique which enables us to translate data using an image (host image), using a secret key, to be undetectable without losing any data or without changing the size and the external scene (visible properties) of the image, the hid-ing data is then can be extracted (without losing) by reversing &n
... Show More This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type: , and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.
in this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators
Data hiding is the process of encoding extra information in an image by making small modification to its pixels. To be practical, the hidden data must be perceptually invisible yet robust to common signal processing operations. This paper introduces a scheme for hiding a signature image that could be as much as 25% of the host image data and hence could be used both in digital watermarking as well as image/data hiding. The proposed algorithm uses orthogonal discrete wavelet transforms with two zero moments and with improved time localization called discrete slantlet transform for both host and signature image. A scaling factor ? in frequency domain control the quality of the watermarked images. Experimental results of signature image
... Show MoreIn this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .
Due to the availability of technology stemming from in-depth research in this sector and the drawbacks of other identifying methods, biometrics has drawn maximum attention and established itself as the most reliable alternative for recognition in recent years. Efforts are still being made to develop a user-friendly system that is up to par with security-system requirements and yields more reliable outcomes while safeguarding assets and ensuring privacy. Human age estimation and Gender identification are both challenging endeavours. Biomarkers and methods for determining biological age and gender have been extensively researched, and each has advantages and disadvantages. Facial-image-based positioning is crucial for many application
... Show More