In this work we experimentally investigated SWCNTs and MWCNTs to increase their thermal conductivity and electrically functionalization process using different reagents ((nitric acid, HNO3 followed by acid treatment with H2SO4), then washed with deionized water (DW) and then treated with H2O2 via ultrasonic technique. Then repeated the steps with MWCNTs and compare their results in an effort to improve experimental conditions that efficiently differentiate the surface of the single walled carbon nanotubes (SWCNTs) and multi walled carbon nanotubesi(MWCNTs) that less nanotubes destroy and to enhance the properties of them and also to reduce aggregation in liquid. the results were prove by XRD, and infrared spectroscopy (FTIR). The FTIR sp

he assignment model represents a mathematical model that aims at expressing an important problem facing enterprises and companies in the public and private sectors, which are characterized by ensuring their activities, in order to take the appropriate decision to get the best allocation of tasks for machines or jobs or workers on the machines that he owns in order to increase profits or reduce costs and time As this model is called multi-objective assignment because it takes into account the factors of time and cost together and hence we have two goals for the assignment problem, so it is not possible to solve by the usual methods and has been resorted to the use of multiple programming The objectives were to solve the problem of

Diabetes is a disease caused by high sugar levels. Currently, diabetes is one of the most common diseases in the number of people with diabetes worldwide. The increase in diabetes is caused by the delay in establishing the diagnosis of the disease. Therefore, an initial action is needed as a solution that requires the most appropriate and accurate data mining to manage diabetes mellitus. The algorithms used are artificial neural network algorithms, namely Restricted Boltzmann Machine and Backpropagation. This research aims to compare the two algorithms to find which algorithm can produce high accuracy, and determine which algorithm is more accurate in detecting diabetes mellitus. Several stages were involved in this research, including d

Wireless sensor networks (WSNs) are emerging in various application like military, area monitoring, health monitoring, industry monitoring and many more. The challenges of the successful WSN application are the energy consumption problem. since the small, portable batteries integrated into the sensor chips cannot be re-charged easily from an economical point of view. This work focusses on prolonging the network lifetime of WSNs by reducing and balancing energy consumption during routing process from hop number point of view. In this paper, performance simulation was done between two types of protocols LEACH that uses single hop path and MODLEACH that uses multi hop path by using Intel Care i3 CPU (2.13GHz) laptop with MATLAB (R2014a). Th

Digital image manipulation has become increasingly prevalent due to the widespread availability of sophisticated image editing tools. In copy-move forgery, a portion of an image is copied and pasted into another area within the same image. The proposed methodology begins with extracting the image's Local Binary Pattern (LBP) algorithm features. Two main statistical functions, Stander Deviation (STD) and Angler Second Moment (ASM), are computed for each LBP feature, capturing additional statistical information about the local textures. Next, a multi-level LBP feature selection is applied to select the most relevant features. This process involves performing LBP computation at multiple scales or levels, capturing textures at different

In this study, the harvest of maize silage with the cross double row sowing method were tested with a single row disc silage machine in two different PTO applications (540 and 540E min-1) and at two different working speeds v1, v2 (1.8 and 2.5 km h-1). The possibilities of harvesting with a single row machine were revealed, and performance characteristics such as hourly fuel consumption, field-product fuel consumption and PTO power consumption were determined in the trials. The best results in terms of hourly fuel consumption and PTO power consumption were determined in the 540E PTO application and V1 working speed. When the fuel consumption of the field-product is evaluated, it is obtained with V2 working speed and 540E PTO application. As

In this paper, a compact genetic algorithm (CGA) is enhanced by integrating its selection strategy with a steepest descent algorithm (SDA) as a local search method to give I-CGA-SDA. This system is an attempt to avoid the large CPU time and computational complexity of the standard genetic algorithm. Here, CGA dramatically reduces the number of bits required to store the population and has a faster convergence. Consequently, this integrated system is used to optimize the maximum likelihood function lnL(φ1, θ1) of the mixed model. Simulation results based on MSE were compared with those obtained from the SDA and showed that the hybrid genetic algorithm (HGA) and I-CGA-SDA can give a good estimator of (φ1, θ1) for the ARMA(1,1) model. Anot

Rivest Cipher 4 (RC4) is an efficient stream cipher that is commonly used in internet protocols. However, there are several flaws in the key scheduling algorithm (KSA) of RC4. The contribution of this paper is to overcome some of these weaknesses by proposing a new version of KSA coined as modified KSA . In the initial state of the array is suggested to contain random values instead of the identity permutation. Moreover, the permutation of the array is modified to depend on the key value itself. The proposed performance is assessed in terms of cipher secrecy, randomness test and time under a set of experiments with variable key size and different plaintext size. The results show that the RC4 with improves the randomness and secrecy with

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith