In this paper, we investigate some methods to solve one of the multi-criteria machine scheduling problems. The discussed problem is the total completion time and the total earliness jobs  To solve this problem, some heuristic methods are proposed which provided good results. The Branch and Bound (BAB) method is applied with new suggested upper and lower bounds to solve the discussed problem, which produced exact results for  in a reasonable time.

The file upload is one of the controls of the tool bar of the VisualStodio.NET, but it can’t be used with Ajax technology (It's almost impossible today to be involved in web application design or development and not be aware of Ajax) because the file upload control don’t support Ajax technology that the execution of the instruction is not completed or the (object is not set) message will appear, although the essential need to use this control with Ajax to gain the asynchronous data transfer that supplied by Ajax, because the file upload don’t work without the Postback operation from the client to the server, and the main idea of Ajax technology is working without Postback operation to the server. After the deep resea

In this study, we present a new steganography method depend on quantizing the perceptual color spaces bands. Four perceptual color spaces are used to test the new method which is HSL, HSV, Lab and Luv, where different algorithms to calculate the last two-color spaces are used. The results reveal the validity of this method as a steganoic method and analysis for the effects of quantization and stegano process on the quality of the cover image and the quality of the perceptual color spaces bands are presented.

Given a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then performed on real-world and randomly generated matrices of the set covering type.  

Periodontitis is a chronic inflammatory disease resulted from aggravated immune response to a dysbiotic subgingival microbiota of a susceptible host. Consequences of periodontitis are not only limited to the devastating effect on the oral cavity but extends to affect general health of the individual and also exerts economic burdens on the health systems worldwide. Despite these serious outcomes of periodontitis; however, they are avoidable by early diagnosis with proper preventive measures or non-invasive interventions at earlier stages of the disease. Clinically, diagnosis of periodontitis could be overlooked due to certain limitations of the conventional diagnostic methods such as periodontal charting and radiographs. Utilization of re

     In project management process, the objective is to define and develop a model for planning, scheduling, controlling, and monitoring different activities of a particular project. Time scheduling plays an important role in successful implementation of various activities and general outcome of project. In practice, various factors cause projects to suffer from time delay in accomplishing the activities. One important reason is imprecise knowledge about time duration of activities. This study addresses the problem of project scheduling in uncertain resource environments, which are defined by uncertain activity durations.  The study presents a solution of the levelling and allocation problems for projects that have some uncertain ac

Watermarking operation can be defined as a process of embedding special wanted and reversible information in important secure files to protect the ownership or information of the wanted cover file based on the proposed singular value decomposition (SVD) watermark. The proposed method for digital watermark has very huge domain for constructing final number and this mean protecting watermark from conflict. The cover file is the important image need to be protected. A hidden watermark is a unique number extracted from the cover file by performing proposed related and successive operations, starting by dividing the original image into four various parts with unequal size. Each part of these four treated as a separate matrix and applying SVD

In this work, watershed transform method was implemented to detect and extract tumors and abnormalities in MRI brain skull stripped images. An adaptive technique has been proposed to improve the performance of this method.Watershed transform algorithm based on clustering techniques: K-Means and FCM were implemented to reduce the oversegmentation problem. The K-Means and FCM clustered images were utilized as input images to the watershed algorithm as well as of the original image. The relative surface area of the extracted tumor region was calculated for each application. The results showed that watershed trnsform algorithm succeedeed to detect and extract the brain tumor regions very well according to the consult of a specialist doctor a

In the current research work, a system of hiding a text in a digital grayscale image has been presented. The algorithm system that had been used was adopted two transforms Integer Wavelet transform and Discrete Cosine transformed. Huffman's code has been used to encoding the text before the embedding it in the cover image in the HL sub band. Peak Signal to Noise Ratio (PSNR) was used to measure the effect of embedding text in the watermarked image; also correlation coefficient has been used to measure the ratio of the recovered text after applying an attack on the watermarked image and we get a good result. The implementation of our proposed Algorithm is realized using MATLAB version 2010a.