Yazar "Malek, A." seçeneğine göre listele
Listeleniyor 1 - 6 / 6
Sayfa Başına Sonuç
Sıralama seçenekleri
Yayın Color Gamut computation using neural networks(Maltepe Üniversitesi, 2009) Malek, A.; Hosseinipour-Mahani, N.; Ezazipour, S.In this research our focus is on image gamuts of digital images. We discuss the implication of gamut and introduce a mathematical method for describing and visualizing color gamuts. We apply a novel neural network model to solve the associated optimization problem with an image gamut, that described first by Joachin Giesen et al. (2006). The optimal solution of the corresponding constrained optimization problems gives the cofficients of a function that is used for drawing the gamut boundary. Two work examples are demonstrated to show the feasibility and efficiency of this approach. Numerical results are given.Yayın Design, manufacture and optimization of intelligent cane for blinds by avr microcontroller(Maltepe Üniversitesi, 2009) Reza, M.; Malek, A.Sight is one of the most important blessing of God that in case privation of it, there are many problems for blind persons. Blind persons use of white cane for informing of obstacles and for finding suitable route, but application of it is not enough for their requests, so they are confronted with many dangers. The aim of this article is design, manufacture and optimization of electronic circuits in intelligent cane with advanced features and better application. In these electronic circuits we can determine distance and depth by ultrasonic waves. After sending waves by transmitter circuit and their encounter with an obstacle, receiver circuit receives return waves, then AVR microcontroller processes data, auditory alarms become active and LCD shows distance to an obstacle and the depth of hole. The basis of distance distinction is given by X = V t. X stands for distance, V is velocity of sound and t is the time of transmitting and receiving ultrasonic waves. The velocity of sound is 330 m/s - 340 m/s, but its changes depends on temperature and properties of matter in air. In this article we use of AVR ( ATMEGA8 ) microcontroller and have designed, manufactured and optimized transmitting and receiving circuits. Distance distinction is computed with our written program.Yayın Fully spectral methods for the solution of high order differential equations(Maltepe Üniversitesi, 2009) Vaissmoradi, N.; Malek, A.; Momeni-Masuleh, S. H.In the recent years spectral methods are used for solving stiff and non-stiff partial differential equations and ordinary differential equations. Various types of spectral methods for steady and unsteady problems are proposed to solve stiff and non-stiff partial differential equations effciently. In this article some schemes for solving stiff partial differential equations are derived. There are twofold: first method is based on Chebyshev polynomials for solving high-order boundary value problems. Second methods are based on Fourier-Galerkin and collocation spectral methods in space and Runge-Kutta, exponential time differencing, Taylor expansion and contour integral in time for solving stiff PDEs. Numerical results show the effciency of proposed schemes.Yayın Fully spectral methods for the solution of high order differential equations(Maltepe Üniversitesi, 2009) Vaissmoradi, N.; Malek, A.; Momeni-Masuleh, S. H.In the recent years spectral methods are used for solving stiff and non-stiff partial differential equations and ordinary differential equations. Various types of spectral methods for steady and unsteady problems are proposed to solve stiff and non-stiff partial differential equations efficiently. In this article some schemes for solving stiff partial differential equations are derived. There are twofold: first method is based on Chebyshev polynomials for solving high-order boundary value problems. Second methods are based on Fourier-Galerkin and collocation spectral methods in space and Runge-Kutta, exponential time differencing, Taylor expansion and contour integral in time for solving stiff PDEs. Numerical results show the efficiency of proposed schemes.Yayın New algorithms based on the interior point method for convex quadratic programming(Maltepe Üniversitesi, 2009) Tahmasebzadeh, S.; Navidi, H.; Malek, A.This paper presents three new algorithms for solving convex quadratic programming problems subject to the linear constraints. These algorithms are based on the general theory of Karmarkar interior points techniques. The first one uses the Karmarkar idea and linearization of the objective function. The second and third algorithms are modification of the first algorithm using the Schrijver and Malek-Naseri approaches respectively. These three new schemes are tested against the algorithm of Kebbiche-Keraghel-Yassine (KKY). It is shown that these three new algorithms are more efficient and converge to the correct optimal solution, while the KKY algorithm does not converge in some cases. Numerical results are given to illustrate the performance of the new algorithms.Yayın Solving linear programming using Newton method and Goldstein conditions(Maltepe Üniversitesi, 2009) Khosravi, P.; Navidi, H.; Malek, A.The aim of this paper is to find an exact least 2-norm solution to the dual linear programming problem and to generate an exact solution to the primal programming problem. The Newton method is proposed for solving linear programs with very large numbers of constraints and variables. We use Goldstein conditions in order to find a suitable step-size in each iteration. The proposed method is based on the apparently overlooked fact that the dual of an exterior penalty formulation of a linear program provides an exact least 2-norm solution to the dual of the linear program. Solving the dual yields an exact least 2-norm solution to the dual and the exact least 2-norm solution to dual problem can be used to generate an exact primal solution. A simple prototype of the method is given in eleven lines of MATLAB code. Encouraging computational results are presented.