Search

Conjugate gradient algorithm is widely used for solving large-scale unconstrained optimization problems, because they do not need the storage of matrices. In this paper, we suggest a modified Dai-Yuan conjucay coefficient of conjugate gradient algorithm and propose new spectral form three-term conjugate gradient algorithm. These algorithms are used inexact line searches and Wolf line search conditions. These algorithms satisfied sufficient descent condition and the converge globally are provided under some assumptions. The numerical results indicate that the proposed algorithm is very effective and the new spectral algorithm is of very robust results depending on iterations and the number of known functions.

In this paper, a modified spectral conjugate gradient method for solving unconstrained optimization problems is studied, which has sufficient descent direction and global convergence with an inexact line searches. The Fletcher-Reeves restarting criterion was employed to the standard and new versions and gave dramatic savings in the computational time. The Numerical results show that the proposed method is effective by comparing it with the FR-method.

In this paper, a high zero-sum weighting is applied to evaluate the nullity of a dendrimer graph for some special graphs such as cycles, paths, complete graphs, complete bipartite graphs and star graphs. Finally, we introduce and prove a sharp lower and a sharp upper bound for the nullity of the coalescence graph of two graphs.

The outgrowing of multimedia applications in communications network brought about an increasing need to provide qualified methods to protect these media and secure communication. These methods include encryption and information hiding. In this research, a new method has been improved to hide watermarking image in voice signal then send it through the network with no effect on the cover sound through the hiding process. This method is performed by applying two ways. The first one is the discrete wavelet transform (DWT) while the second one is singular value decomposition (SVD) by using wavelet transform, we get detail values which are arranged in a specific way and then entered to the singular value decomposition algorithm. Finally we get eign values, which embedding the data of the watermark image inside these values. So, we get the watermark signal with no effects. Also, the recovered image efficiency measurement is performed by using the correlation coefficient between the original and the recovered watermark image and also we apply the measurement of the difference between the original voice signal (cover) and the watermarked voiced signal by using signal to noise ratio (SNR). Matlab is the approval as a programming language in this paper.

In this paper we solved the Kuramoto-Sivashinsky Equation numerically by finite-difference methods, using two different schemes which are the Fully Implicit scheme and Exponential finite difference scheme, because of the existence of the fourth derivative in the equation we suggested a treatment for the numerical solution of the two previous scheme by parting the mesh grid into five regions, the first region represents the first boundary condition, the second at the grid point x1, while the third represents the grid points x2,x3,…xn-2, the fourth represents the grid point xn-1and the fifth is the second boundary condition. We also, studied the numerical stability by Fourier (Von-Neumann) method for the two scheme which used in the solution on all mesh points to ensure the stability of the point which had been treated in the suggested style, we using two interval with two initial condition and the numerical results obtained by using these schemes are compare with Exact Solution of Equation Excellent approximate is found between the Exact Solution and numerical Solutions of these methods.

In this paper, we study some Smarandache (S) notions in some types of rings. Conditions are given under which is a Smarandache ring. We study Smarandache ideals, Smarandache subrings and Smarandache weakly Boolean rings. We discuss some types of Smarandache elements in rings. Moreover, we get some other results.

This paper is devoted to the study of the effect of inclination into heat transfer by natural convection of fluid flowing through a channel with porous walls; the model has been created by using two-dimensional Cartesian co-ordinate and the resulting differential equations governing the model solved numerically in two phases (steady-state and unsteady-state) based on finite difference method.

Reverse engineering is one of the important operations performed on programming codes to get their design presented graphically. Reverse engineering is performed on various types of databases to get their particular designs represented by different models of relationships. In this paper, we found that a tool for performing reverse engineering on Oracle10g database located inside Oracle10g server , It has been designed in order to get its entity relationship model. Oracle10g data dictionary has been considered in performing reverse engineering. This dictionary includes all information that describes databases which is utilized for getting the important information relevant to the tables. It was necessary for presenting the entity relationship model. XML tags have been used in presenting the information of the data dictionary. These tags were utilized in creating the graphical entity relationship model.

In this paper, we deal with compatible (left, right)-group actions on posets, i.e; (G, H)-posets. Our main purpose in this work is to study the maximal chains in (G, H)-posets to observe that this study gives us indications on the type of some (G, H) actions on posets. Therefore, we shall study the behavior of the (G, H) actions on chains.

This paper has developed a method for hiding in images, as it was first encrypt the secret message chaoticlly using the chaotic encryption algorithm and secondly execute the steganography in two phases, the first divide the cover image (.BMP, .PNG) to a group of sections (Blocks) with the diagonal sequence and make hiding using the cell of the least Significant Bit (LSB) within (Bytes) of certain randomly, and then using the Genetic Algorithm (GA) and working at the expense of Peak Signal to Noise Ratio(PSNR) for each section after the steganography and then get the best PSNR value of the optimal section (ie, a better distribution of the random sites). The second include a final for all sections (Blocks) depending on the results of the first stage and the best for a random distribution of sites (Bytes) according to the results of genetic algorithm. Measuressuch as PSNR, BER, MSE and NC are used to prove the accuracy of the results and efficiency. The application implemented using Matlab 9.

In this paper, we study the moment of a non linear – autoregressive polynomial model of first order, also we analysis the stability of this model and find the singular point as well as the limit cycle by using the linear approximation technique.

Image enhancement is a useful and necessary part of image processing and its analysis. The quality of an image could be corrupted by different kinds of noises, added due to the undesired conditions or during the transmission. In this paper, a Hybrid Genetic Algorithm with Filters (HGAF ) is suggested for the removing of impulse noise from digital images. The new suggested algorithm HGAF uses popular (mean , median and min-max filters) and other proposed filters as fitness function for it in order to design eight proposed genetic filters. These eight proposed genetic filters are applied on several gray images corrupted by two types of noise (salt-and-pepper and gaussian noises) with different levels for comparison and to show the effectiveness of them by using the Peak Signal to Noise Ratio (PSNR) and Root Mean Square Error (RMSE). Also, proposed two methods of parents selection to compare between them and types of crossovers and mutations that are used.

As a generalization of right injective rings, we introduce the nation of right injective rings, that is for any right nonsingular element of R, there exists a positive integer and and any right - homomorphism , there exists such that for all . In this paper, we first introduce and characterize a right injective rings . Next , connection between such ring and quasi regular rings and weakly regular rings.

Let I be a right ideal of a ring R , then R/I is right N-flat module if and only if for each , there exists and a positive integer n such that and .In this paper, we first introduce and characterize rings whose every simple singular right R-module is N - flat. Next, we investigate the strong regularity of rings whose every simple singular right R - module is N-flat. It is proved that : R is strongly regular ring if and only if R is a wjc , MERT and 2 - primal ring whose simple singular right R- module is N - flat. Let R be a wjc ring satisfying condition (*). If every simple singular right R-module is N-flat .Then, the Center of R is a regular ring.

Steganography technique widely spread and varied. With the widening in using steganography, its misuse alarmists arisen. Thus steganalysis comes into sight to deter unwanted secret communications. In this paper a new scheme proposed for extracting hidden information, this scheme relies on the capability of artificial neural networks for prediction to estimate the original values of the pixels which values of some of them were changed by the affection of data embedding process, and then the present pixel values will be compared with estimated values to identify the embedded data. Multilayer Perceptron MLP neural network used in this scheme to estimate the pixel's original value using its neighbor pixels. The proposed schemes programmed using Matlab v. 7.10.0.499. The proposed schemes has been trained and tested using a data base prepared for this purpose. Then its performance compared with another work in the same field applied in similar conditions. The results showed that the proposed scheme has the ability to achieving the desired with a good rate of success.

In this paper, we proposed a new three-term nonlinear Conjugate Gradient (CG) method for solving unconstrained optimization problems. The new three-term method generates decent direction with an inexact line search under Wolfe conditions and the descent property of the new method is proved. Numerical results on some well-known test function with various dimensions showed that the new method is an efficient .

In this paper, the stability analysis is performed on two Galerkin finite element schemes for solving reaction-diffusion system with fast reversible reaction. Fourier (Von Neumann) method is implemented to propose time-step criteria for the consistent and the lumped schemes with four popular choices for . We have found that the two schemes are unconditionally stable when , while the consistent scheme is stable under the conditions and when . Also, the lumped scheme is stable under the conditions and when .

In this paper, we propose a new four-dimensional continuous autonomous hyperchaotic system which is built by adding a nonlinear controller to a three- dimensional chaotic Pan system. The new system is analyzed both theoretically and numerically by studying dynamical behaviors for this system, including equilibrium points, Lyapunov exponents, stability and bifurcation, also we study the stability, bifurcation andsymmetry for another four dimensional system which is generated by Pan in (2011) from the original system, we compared between two systems and found the difference between them. Finally, we show the effective of state u on the two systems.

Requirements engineering is the first phase of the software engineering process. This phase is the basis of other phases, so it is a very critical phase. Incomplete, ambiguous and misunderstanding requirements lead to fail in the product. For this reason, attention must be increased in requirements engineering to obtain accurate, complete and unambiguous requirements to satisfy users' needs in their products. In this paper, an attempt to analyze the requirement phase and produce analysis model is presented by using EA (Enterprise Architect) tool to offer a smart support for requirements engineering processes and introducing them as basis in requirements development in software engineering automation.

This paper presents two modified Quasi-Newton algorithms which are designed for solving nonlinear unconstrained optimization problems. These algorithms are based on different techniques namely: Quasi-Newton conditions on quadratic and non-quadratic objective functions. Experimental results indicate that the new proposed algorithms are more efficient than the Yuan and Biggs- algorithms.

A new graph distance based polynomial, called detour polynomial, is introduced. The detour polynomial and the detour index of the corona ○ of two connected disjoint graphs and are obtained in this paper.

In this paper, an operational matrix of integrations based on the Haar wavelet method is applied for finding the numerical solution of non-linear third-order boussinesq system and the numerical results were compared with the exact solution. The accuracy of the obtained solutions is quite high even if the number of calculation points is small, by increasing the number of collocation points the error of the solution rapidly decreases as shown by solving an example. We have been reduced the boundary conditions in the solution by using the finite differences method with respect to time. Also we have reduced the order of boundary conditions used in the numerical solution by using the boundary condition at x=L instead of the derivatives of order two with respect to space.

This paper is devoted to drive the matrix algebraic equation for the two-dimensional nonlinear coupled-BBM system which is obtained from using the implicit finite difference method. The convergence analysis of the solution is proved.Numerical experiment is presented with initial conditions describing the generation and evolution.

In this paper, we define and study extensively a new type of external sets in , we call it "convex galaxies". We show that these convex external sets may be classified in some definite types. More precisely, we obtain the following : (1)Let be a convex galaxy which is symmetric with respect to zero, then (i) is an - galaxy (0) if and only if there exists an internal strictly increasing sequence of strictly positive real numbers with such that and , for all , where, is some limited real number such that . (ii) is a non-linear galaxy if and only if there exists an internal strictly increasing sequence of strictly positive real numbers with such that is unlimited for all . (2)Let be a convex galaxy which is symmetric with respect to zero, then (i) is an - galaxy (0) iff there exists a real internal strictly increasing - function , such that , and for all limited , where is a positive real number. (ii) is a non-linear galaxy if and only if there exists a real internal strictly increasing - function , such that and is positive unlimited, for all appreciable .

This paper studies the bifurcations in dynamics of a family of semi-triangular maps . We will prove that this family has a series of Saddle-node bifurcations and a period doubling bifurcation. Also, we show that for some value of the parameter the functions will be chaotic.

In this paper, the hypernation of linear averaging algorithm for zooming images is achieved with genetic algorithm. It's applied on a number of samples of images that lack the indistinction of the outline and providing accurate images. The equation of linear averaging is utilized as an objective function in genetic algorithm using several types of crossovers and mutations. A compression among these types is accomplished using two measures (RMSE & PSNR) for evaluating the proposed algorithm. The ratio for zooming is twice as the original images. The accuracy and the efficiency of those images are RMSE = 6.6541 and PSNR = 31.6470 db. A MATLAB 7.10.0(R2010a) environment is used for the programming of proposed algorithm will all applied types of crossovers and mutations.

As the amount of information available on the internet grows so does the need for more effective data analysis methods. This paper utilizes the particle swarm optimization (PSO) algorithm in the field of web content classification, and used part of speech tagging algorithm to reduce the large numbers of attributes associated with web content mining. The proposed algorithm gave a good classification accuracy, which comparable to the accuracy of Ant-miner algorithm and acquire less training time.

The diameter, with respect to the n-distance of the graph which represents a straight chain consisting of m pentagonal rings, is obtained in this paper. The n-Hosoya polynomial of , for all m and n, where , is also obtained.

With the development of the Internet, technological innovation and the availability of information emerged new computer security threats. The researchers are developing new systems known as Intrusion Detection Systems IDSs for detecting the known and unknown attacks. IDS have two approaches depending on the detecting theories: Misuse Detection and Anomaly Detection. This paper aims to design and implement a misuse network intrusion detection system based on Genetic Algorithm. The efficiency of using GA for building IDS based on NSL-KDD is verified. For rules generation NSL-KDD Data Set is used which include, KDDTrain and KDDTest, 125973 and 22544 records respectively, each record consists of 41 features and one class attribute for specifying normal and abnormal connection (complete train and test data are used), In order to get rid of redundancy and inappropriate features Principal Component Analysis (PCA) is used for selecting (5) features. Number of experiments have been done. The experimental results show that the proposed system based on GA and using PCA (for selecting five features) on NSL-KDD able to speed up the process of intrusion detection and to minimize the CPU time cost and reducing time for training and testing, that the detection rate: 91.6% and false alarm is: 0% and classification rate (DoS 93.48 %), (Normal 99.52%) , (Probe 81.16%), (R2L 69.47%), (U2R 32.84%). C# programming language is used for system implementation.

In this paper, we present new algorithm for the solution of the nonlinear second order multi-point boundary value problem with suitable multi boundary conditions. The algorithm is based on the semi-analytic technique and the solutions are calculated in the form of a rapid convergent series. It is observed that the method gives more realistic series of solutions that converge very rapidly in physical problems. Illustrative examples are provided to demonstrate the efficiency and simplicity of the proposed method in solving this type of multipoint boundary value problems.

A ring R is called completely right YJ-injective (briefly, right CYJ injective ) if every homomorphic image of R is right YJ-injective. In this paper, we study completely right YJ-injective rings and their connection with Von Neumann regular rings. In addition, we also study regularity of rings whose ring homomorphic images are right YJ-injective as right R-modules

In this paper, we have investigated a new algorithm which employs an Augmented Lagrangian Method (ALM). It overcomes many of the difficulties associated with the Penalty function method. The new incorporate algorithm has been proved very effective with an efficient convergence criterion.

In 2005 J. T Wang investigated the zero divisor graphs of degrees 5 and 6. In this paper, we consider the zero divisor graphs of a commutative rings of degrees 7 and 8.

In this paper, a distributed real time security system for monitoring and remote control on building and protecting it from unauthorized entering is designed and implemented. This system is based on the transfer of signal in real time when there is a breach and image of an unauthorized person to enter the building to the mobile phone of the person who is responsible for the security of the building. The real time system consists of three main parts, the first one is the computer with an electronic circuit connected via the serial port. The designed electronic circuit contains the Microcontroller for reading sensors connected to ports of the building (G1, G2, and G3) and processing the signals. Also, there is a monitoring camera to capture an image when registering a case of breach. The program in the computer receives signals from the three ports and uses a fixed real time algorithm for scheduling signals and gives them priorities according to the importance of ports, then sends signals to the second part of the system. The second part of the system consists of a server on the Internet which receives signal and image of the breach, stores it in a database system and then transferring it in real time to the third part. The third part consists of several mobile phones to achieve the principle of distribution for this system, each mobile phone will be responsible for a single port in the building, while there is one mobile phone responsible for all ports which belongs to the person who is responsible for the building security. Each mobile phone contains three programs, the first program would receive a signal of the breach and give the alarm, the second program displays picture, and the third program sends a control signal.

In this paper, we derived a new conjugacy coefficient of conjugate gradient method which is based on non-linear function using inexact line searches. This method satisfied sufficient descent condition and the converges globally is provided. The numerical results indicate that the new approach yields very effective depending on number of iterations and number of functions evaluation .

In this paper, we apply He's variational iteration method (VIM) and the Adomian decomposition method (ADM) to approximate the solution of Duffing-Van Der Pol equation (DVP). In VIM, a correction functional is constructed by a general Lagrange multiplier which can be identified via a variational theory. The VIM yields an approximate solution in the form of a quickly convergent series. Comparisons of the two series solutions with the classical Runge-Kutta order four RK45 method show that the VIM is a powerful method for the solution of nonlinear equations. The convergent of He's variational iteration method to this equation is also considered.

In this paper we study the conditions under which the zero solution iscenter of Gravity in the semi-liner case for certain third order differential equation of the form: We have: The characteristic equation of the above differential equation has complex roots of the form : , and the other root has the following property .

Copyright of Dirasat: Educational Sciences is the property of University of Jordan and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Dirasat: Educational Sciences is the property of University of Jordan and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The increasing of security attacks and unauthorized intrusion have made network security one of the main subjects that should be considered in present data communication environment. Intrusion detection system is one of the suitable solutions to prevent and detect such attacks. This paper aims to design and implement a Network Intrusion Detection System (NIDS) based on genetic algorithm. In order to get rid of redundancy and inappropriate features principle component analysis (PCA) is useful for selecting features. The complete NSL-KDD dataset is used for training and testing data. Number of different experiments have been done. The experimental results show that the proposed system based on GA and using PCA (for selecting five features) on NSL-KDD able to speed up the process of intrusion detection and to minimize the CPU time cost and reducing time for training and testing. C# programming language is used for system implementation.

Mobile technology is rapidly developed, this developing leads the production of the multimedia smartphone that supports wireless LAN (WLAN) that are widely deployed because of its ease of use, flexibility, sharing application and support for multimedia transmission. In this paper, a system was designed and implemented to stream audio from the computer and displayed it on the smartphone model using the (Client Server) model. This work deals with real-time audio, using real-time streaming protocol (RTSP), the proposed work has achieved success of sending voice over the wireless network environments via heterogeneous operating system, Linux and Android.

Security has become an important issue for networks. Intrusion detection technology is an effective approach in dealing with the problems of network security. In this paper, we present an intrusion detection model based on PCA and MLP. The key idea is to take advantage of different feature of NSL-KDD data set and choose the best feature of data, and using neural network for classification of intrusion detection. The new model has ability to recognize an attack from normal connections. Training and testing data were obtained from the complete NSL-KDD intrusion detection evaluation data set.

In this paper addresses the multi-period single-item inventory problem with stochastic demands. In which the demand in each period is known but it varies from time to time for N replenishment periods. The main idea is to calculate expected the total minimum cost and the optimal quantity and the optimal replenishment periods using probabilistic dynamic programming. The results showed the optimal replenishment are (1, 10, 28), optimal quantity is (34974) and the expected total minimum cost is (883.487).

Data mining is the process of extracting hidden patterns from data. One of the most important activities in data mining is the association rule mining and the new head for data mining research area is privacy of mining. Privacy preserving data mining is a new research trend in privacy data for data mining and statistical database. Data mining can be applied on centered or distributed databases. Most efficient approaches for mining distributed databases suppose that all of the data at each site can be shared. Privacy concerns may prevent the sites from directly sharing the data, and some types of information about the data. Privacy Preserving Data Mining (PPDM) has become increasingly popular because it allows sharing of privacy sensitive data for analysis purposes. In this paper, the problem of privacy preserving association rule mining in horizontally distributed database is addressed by proposing a system to compute a global frequent itemsets or association rules from different sites without disclosing individual transactions. Indeed, a new algorithm is proposed to hide sensitive frequent itemsets or sensitive association rules from the global frequent itemsets by hiding them from each site individually. This can be done by modifying the original database for each site in order to decrease the support for each sensitive itemset or association rule. Experimental results show that the proposed algorithm hides rules in a distributed system with the good execution time, and with limited side effects. Also, the proposed system has the capability to calculate the global frequent itemsets from different sites and preserves the privacy for each site.