There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show MoreContinuous escalation of the cost of generating energy is preceded by the fact of scary depletion of the energy reserve of the fossil fuels and pollution of the environment as developed and developing countries burn these fuels. To meet the challenge of the impending energy crisis, renewable energy has been growing rapidly in the last decade. Among the renewable energy sources, solar energy is the most extensively available energy, has the least effect on the environment, and is very efficient in terms of energy conversion. Thus, solar energy has become one of the preferred sources of renewable energy. Flat-plate solar collectors are one of the extensively-used and well-known types of solar collectors. However, the effectiveness of the coll
... Show MoreThis paper presents a robust algorithm for the assessment of risk priority for medical equipment based on the calculation of static and dynamic risk factors and Kohnen Self Organization Maps (SOM). Four risk parameters have been calculated for 345 medical devices in two general hospitals in Baghdad. Static risk factor components (equipment function and physical risk) and dynamics risk components (maintenance requirements and risk points) have been calculated. These risk components are used as an input to the unsupervised Kohonen self organization maps. The accuracy of the network was found to be equal to 98% for the proposed system. We conclude that the proposed model gives fast and accurate assessment for risk priority and it works as p
... Show MoreFiber Bragg Grating has many advantages where it can be used as a temperature sensor, pressure sensor or even as a refractive index sensor. Designing each of this fiber Bragg grating sensors should include some requirements. Fiber Bragg grating refractive index sensor is a very important application. In order to increase the sensing ability of fiber Bragg gratings, many methods were followed. In our proposed work, the fiber Bragg grating was written in a D-shaped optical fiber by using a phase mask method with KrFexcimer. The resultant fiber Bragg grating has a high reflectivity 99.99% with a Bragg wavelength of 1551.2 nm as a best result obtained from a phase mask with a grating period of 1057 nm. In this work it was found that the rota
... Show MoreObstruct:  
... Show MoreUntil recently, researchers have utilized and applied various techniques for intrusion detection system (IDS), including DNA encoding and clustering that are widely used for this purpose. In addition to the other two major techniques for detection are anomaly and misuse detection, where anomaly detection is done based on user behavior, while misuse detection is done based on known attacks signatures. However, both techniques have some drawbacks, such as a high false alarm rate. Therefore, hybrid IDS takes advantage of combining the strength of both techniques to overcome their limitations. In this paper, a hybrid IDS is proposed based on the DNA encoding and clustering method. The proposed DNA encoding is done based on the UNSW-NB15
... Show MoreIn this study, an analysis of re-using the JPEG lossy algorithm on the quality of satellite imagery is presented. The standard JPEG compression algorithm is adopted and applied using Irfan view program, the rang of JPEG quality that used is 50-100.Depending on the calculated satellite image quality variation, the maximum number of the re-use of the JPEG lossy algorithm adopted in this study is 50 times. The image quality degradation to the JPEG quality factor and the number of re-use of the JPEG algorithm to store the satellite image is analyzed.
Humanoids or bipedal robots are other kinds of robots that have legs. The balance of humanoids is the general problem in these types when the other in the support phase and the leg in the swing phase. In this work, the walking pattern generation is studied by MATLAB for two types of degrees of freedom, 10 and 17 degrees of freedom. Besides, the KHR-2HV simulation model is used to simulate the experimental results by Webots. Similarly, Arduino and LOBOT LSC microcontrollers are used to program the bipedal robot. After the several methods for programming the bipedal robot by Arduino microcontroller, LOBOT LSC-32 driver model is the better than PCA 96685 Driver-16 channel servo driver for programming the bipedal walking rob
... Show MoreCurrently no one can deny the importance of data protection, especially with the proliferation of hackers and theft of personal information in all parts of the world .for these reasons the encryption has become one of the important fields in the protection of digital information.
This paper adopts a new image encryption method to overcome the obstacles to previous image encryption methods, where our method will be used Duffing map to shuffled all image pixels ,after that the resulting image will be divided into a group of blocks for perform the shuffling process via Cross Chaotic Map.
Finally, an image called key image was created by using Quadratic number spirals which will be used to generate nu
Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res
... Show More