This research aims at calculating the optimum cutting condition for various types of machining methods, assisted by computers, (the computer program in this research is designed to solve linear programs; the program is written in v. basic language). The program obtains the results automatically, this occur through entering the preliminary information about the work piece and the operating condition, the program makes the calculation actually by solving a group of experimental relations, depending on the type of machining method (turning, milling, drilling). The program was transferred to package and group of windows to facilitate the use; it will automatically print the initial input and optimal solution, and thus reduce the effort and t

      Data mining has the most important role in healthcare for discovering hidden relationships in big datasets, especially in breast cancer diagnostics, which is the most popular cause of death in the world. In this paper two algorithms are applied that are decision tree and K-Nearest Neighbour for diagnosing Breast Cancer Grad in order to reduce its risk on patients. In decision tree with feature selection, the Gini index gives an accuracy of %87.83, while with entropy, the feature selection gives an accuracy of %86.77. In both cases, Age appeared as the  most effective parameter, particularly when Age<49.5. Whereas  Ki67  appeared as a second effective parameter. Furthermore, K- Nearest Neighbor is based on the minimu

Image steganography is undoubtedly significant in the field of secure multimedia communication. The undetectability and high payload capacity are two of the important characteristics of any form of steganography. In this paper, the level of image security is improved by combining the steganography and cryptography techniques in order to produce the secured image. The proposed method depends on using LSBs as an indicator for hiding encrypted bits in dual tree complex wavelet coefficient DT-CWT. The cover image is divided into non overlapping blocks of size (3*3). After that, a Key is produced by extracting the center pixel (pc) from each block to encrypt each character in the secret text. The cover image is converted using DT-CWT, then the p

This research was conducted to study the histological structure of the eye in the tree frog (Hyla arborea savignyi) and showed that it is composed of the eyeball and the lens and optic nerve. Appeared eyeball is surrounded by three Tunica from the inside to the outside are Tunica Interna, Tunica vasculosa, Tunica fibrosa. The tunica interna consists of the retina that consists of 10 layers are from outer to inner pigment epithelial layer, rods and cones layer, external limiting membrane, outer nuclear layer, outer plexiform layer, inner nuclear layer, inner plexiform layer , ganglion cells layer , nerve fibers layer, internal limiting membrane .The vascular tunic or Uvea consists of the choroid, ciliary body , and iris . The fibrous coat co

This research include design and implementation of an Iraqi cities database using spatial data structure for storing data in two or more dimension called k-d tree .The proposed system should allow records to be inserted, deleted and searched by name or coordinate. All the programming of the proposed system written using Delphi ver. 7 and performed on personal computer (Intel core i3).

 

This work implements the face recognition system based on two stages, the first stage is feature extraction stage and the second stage is the classification stage. The feature extraction stage consists of Self-Organizing Maps (SOM) in a hierarchical format in conjunction with Gabor Filters and local image sampling. Different types of SOM’s were used and a comparison between the results from these SOM’s was given.

The next stage is the classification stage, and consists of self-organizing map neural network; the goal of this stage is to find the similar image to the input image. The proposal method algorithm implemented by using C++ packages, this work is successful classifier for a face database consist of 20

The main goal of this paper is to show that a
-arc in
and
is subset of a twisted cubic, that is, a normal rational curve. The maximum size of an arc in a projective space or equivalently the maximum length of a maximum distance separable linear code are classified. It is then shown that this maximum is
for all dimensions up to
.

Cloud computing offers a new way of service provision by rearranging various resources over the Internet. The most important and popular cloud service is data storage. In order to preserve the privacy of data holders, data are often stored in cloud in an encrypted form. However, encrypted data introduce new challenges for cloud data deduplication, which becomes crucial for big data storage and processing in the cloud. Traditional deduplication schemes cannot work on encrypted data. Among these data, digital videos are fairly huge in terms of storage cost and size; and techniques that can help the legal aspects of video owner such as copyright protection and reducing the cloud storage cost and size are always desired. This paper focuses on v

      Let S be a commutative ring with identity, and A is an S-module. This paper introduced an important concept, namely strongly maximal submodule. Some properties and many results were proved as well as the behavior of that concept with its localization was studied and shown.