Content-based image retrieval has been keenly developed in numerous fields. This provides more active management and retrieval of images than the keyword-based method. So the content based image retrieval becomes one of the liveliest researches in the past few years. In a given set of objects, the retrieval of information suggests solutions to search for those in response to a particular description. The set of objects which can be considered are documents, images, videos, or sounds. This paper proposes a method to retrieve a multi-view face from a large face database according to color and texture attributes. Some of the features used for retrieval are color attributes such as the mean, the variance, and the color image's bitmap. In addition, the energy, and the entropy which based on the gray level values in an image is too considered as the features. In addition to statistical approaches, models of artificial intelligence produce a desirable methodology that enhances performance in information retrieval systems, and the genetic algorithm depicts one of them. The GA is preferred for its power and because it can be used without any specific information of the domain. The experimental results conclude that using GA gives a good performance and it decreases the average search time to (60.15 milliseconds) compared with (722.25milliseconds) for traditional search.
(2)
With wireless sensor network (WSN) wide applications in popularity, securing its data becomes a requirement. This can be accomplished by encrypting sensor node data. In this paper a new an efficient symmetric cryptographic algorithm is presented. This algorithm is called wireless sensor network wavelet curve ciphering system (WSN-WCCS). The algorithm idea based on discrete wavelet transformation to generate keys for each node in WSN. It implements on hierarchical clustering WSN using LEACH protocol. Python programming language version 2.7 was used to create the simulator of WSN framework and implement a WSN-WCCS algorithm. The simulation result of the proposed WSN-WCCS with other symmetric algorithms has show
... Show More
(1)
In order to select the optimal tracking of fast time variation of multipath fast time variation Rayleigh fading channel, this paper focuses on the recursive least-squares (RLS) and Extended recursive least-squares (E-RLS) algorithms and reaches the conclusion that E-RLS is more feasible according to the comparison output of the simulation program from tracking performance and mean square error over five fast time variation of Rayleigh fading channels and more than one time (send/receive) reach to 100 times to make sure from efficiency of these algorithms.
This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)
... Show More
In this study, light elements for 13C , 16O for (α,n) and (n,α) reactions as well as α-particle energy from 2.7 MeV to 3.08 MeV are used as far as the data of reaction cross sections are available. The more recent cross sections data of (α,n) and (n,α) reactions are reproduced in fine steps 0.02 MeV for 16O (n,α) 13C in the specified energy range, as well as cross section (α,n) values were derived from the published data of (n,α) as a function of α-energy in the same fine energy steps by using the principle inverse reactions. This calculation involves only the ground state of 13C , 16O in the reactions 13C (α,n) 16O and 16O (n,α) 13C.
Actinopolyspora iraqiensis IQ-H1 is a novel strain of actinobacteria isolated from extremely halophilic soil samples in Iraq. The whole-genome sequence of this strain is deposited in the National Center for Biotechnology Information (NCBI) GenBank under the accession number NZ_AICW01000000. In this study, the genome features and the molecular phylogenetic tree of Act. iraqiensis IQ-H1are analyzed. The RAST tool was used for genome annotation. The genomic features were elucidated using QUAST tool. The circular genome map, and the core and pan-genome map of Act. iraqiensis IQ-H1 was generated using CGView and the GView tools respectively. The JSpeciesWS server was used for the tetranucleotide signature analysis a
... Show More
Antimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct. Where the vertex-weights of a vertex under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph , strong face fan graph , strong face prism graph and finally strong face friendship graph .
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.
A new blind restoration algorithm is presented and shows high quality restoration. This
is done by enforcing Wiener filtering approach in the Fourier domains of the image and the
psf environments
Fourteen morphologically varied Ricinus communis L. seeds were collected from different localities in Egypt, El-Sudan and Saudi Arabia. Seed morphology and ITS barcoding analysis were performed to assess their diversity and phylogenetic relationship. Sequence’s alignment of nrITS region from different accessions display high levels of genetic similarities. Cluster analysis could not group different accessions according to their geographical distribution. Nevertheless, the genetic barcodes are interestingly matched with the morphological features of the Ricinus seeds. In conclusion, seed morphology proved to be a valuable tool in evaluating biodiversity and phylogenetic relationship in plant species with different loca
... Show More
(2)
(1)
