Support vector machine (SVM) is a popular supervised learning algorithm based on margin maximization. It has a high training cost and does not scale well to a large number of data points. We propose a multiresolution algorithm MRH-SVM that trains SVM on a hierarchical data aggregation structure, which also serves as a common data input to other learning algorithms. The proposed algorithm learns SVM models using high-level data aggregates and only visits data aggregates at more detailed levels where support vectors reside. In addition to performance improvements, the algorithm has advantages such as the ability to handle data streams and datasets with imbalanced classes. Experimental results show significant performance improvements in compa

CNC machine is used to machine complex or simple shapes at higher speed with maximum accuracy and minimum error. In this paper a previously designed CNC control system is used to machine ellipses and polylines. The sample needs to be machined is drawn by using one of the drawing software like AUTOCAD® or 3D MAX and is saved in a well-known file format (DXF) then that file is fed to the CNC machine controller by the CNC operator then that part will be machined by the CNC machine. The CNC controller using developed algorithms that reads the DXF file feeds to the machine, extracts the shapes from the file and generates commands to move the CNC machine axes so that these shapes can be machined.

   Real life scheduling problems require the decision maker to consider a number of criteria before arriving at any decision. In this paper, we consider the multi-criteria scheduling problem of n jobs on single machine to minimize a function of five criteria denoted by total completion times (∑), total tardiness (∑), total earliness (∑), maximum tardiness () and maximum earliness (). The single machine total tardiness problem and total earliness problem are already NP-hard, so the considered problem is strongly NP-hard.

We apply two local search algorithms (LSAs) descent method (DM) and simulated annealing method (SM) for the 1// (∑∑∑

The research aimed at designing teaching program using jigsaw in learning spiking in volleyball as well as identifying the effect of these exercises on learning spring in volleyball. The researchers used the experimental method on (25) students as experimental group and (27) students as controlling group and (15) students as pilot study group. The researchers conducted spiking tests then the data was collected and treated using proper statistical operations to conclude that the strategy have a positive effect in experimental group. Finally, the researchers recommended using the strategy in making similar studies on other subjects and skills.

Distributed Denial of Service (DDoS) attacks on Web-based services have grown in both number and sophistication with the rise of advanced wireless technology and modern computing paradigms. Detecting these attacks in the sea of communication packets is very important. There were a lot of DDoS attacks that were directed at the network and transport layers at first. During the past few years, attackers have changed their strategies to try to get into the application layer. The application layer attacks could be more harmful and stealthier because the attack traffic and the normal traffic flows cannot be told apart. Distributed attacks are hard to fight because they can affect real computing resources as well as network bandwidth. DDoS attacks

The aim of this research is to diagnose the impact of competitive dimensions represented by quality, cost, time, flexibility on the efficiency of e-learning, The research adopted the descriptive analytical method by identifying the impact of these dimensions on the efficiency of e-learning, as well as the use of the statistical method for the purpose of eliciting results. The research concluded that there is an impact of the competitive dimensions on the efficiency of e-learning, as it has been proven that the special models for each of the research hypotheses are statistically significant and at a level of significance of 5%, and that each of these dimensions has a positive impact on the dependent variable, and the research recommended

The  lossy-FDNR  based  aclive  fil ter has an  important   property among  many  design  realizations. 'This includes  a significant reduction in component count particularly in the number  of OP-AMP which consumes   power.  However  the·  problem  of  this   type  is the  large component spreads  which affect the fdter performance.

In  this  paper   Genetic   Algorithm   is  applied   to  minimize   the component  spread   (capacitance  and  resistance  p,read). The minimization of these spreads allow the fil

     Detection moving car in front view is difficult operation because of the dynamic background due to the movement of moving car and the complex environment that surround the car, to solve that, this paper proposed new method based on linear equation to determine the region of interest by building more effective background model to deal with dynamic background scenes. This method exploited the permitted region between cars according to traffic law to determine the region (road) that in front the moving car which the moving cars move on. The experimental results show that the proposed method can define the region that represents the lane in front of moving car successfully with precision over 94%and detection rate 86

      In this paper an algorithm for Steganography using DCT for cover image and DWT for hidden image with an embedding order key is proposed. For more security and complexity the cover image convert from RGB to YIQ, Y plane is used and divided into four equally parts and then converted to DCT domain. The four coefficient of the DWT of the hidden image are embedded into each part of cover DCT, the embedding order based on the order key of which is stored with cover in a database table in both the sender and receiver sender. Experimental results show that the proposed algorithm gets successful hiding information into the cover image. We use Microsoft Office Access 2003 database as DBMS, the hiding, extracting algo