This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that

Among the metaheuristic algorithms, population-based algorithms are an explorative search algorithm superior to the local search algorithm in terms of exploring the search space to find globally optimal solutions. However, the primary downside of such algorithms is their low exploitative capability, which prevents the expansion of the search space neighborhood for more optimal solutions. The firefly algorithm (FA) is a population-based algorithm that has been widely used in clustering problems. However, FA is limited in terms of its premature convergence when no neighborhood search strategies are employed to improve the quality of clustering solutions in the neighborhood region and exploring the global regions in the search space. On the

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

Zigbee, which has the standard IEEE 802.15.4. It is advisable method to build wireless personal area network (WPAN) which demands a low power consumption that can be produced by Zigbee technique. Our paper gives measuring efficiency of Zigbee involving the Physical Layer (PL) and Media Access Control (MAC) sub-layer , which allow a simple interaction between the sensors. We model and simulate two different scenarios, in the first one, we tested the topological characteristics and performance of the IEEE802.15.4 standard in terms of throughput, node to node delay and figure of routers for three network layouts (Star, Mesh and Cluster Tree) using OPNET simulator. The second scenario investigates the self-healing feature on a mesh

Samples of gasoline engine oil (SAE 5W20) that had been exposed to various oxidation times were inspected with a UV-Visible (UV-Vis) spectrophotometer to select the best wavelengths and wavelength ranges for distinguishing oxidation times. Engine oil samples were subjected to different thermal oxidation periods of 0, 24, 48, 72, 96, 120, and 144 hours, resulting in a range of total base number (TBN) levels. Each wavelength (190.5 – 849.5 nm) and selected wavelength ranges were evaluated to determine the wavelength or wavelength ranges that could best distinguish among all oxidation times. The best wavelengths and wavelength ranges were analyzed with linear regression to determine the best wavelength or range to predict oxidation t

in this paper the collocation method will be solve ordinary differential equations of retarted arguments also some examples are presented in order to illustrate this approach

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).