Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

33 results for “Matrix Computation”
Set a search alert
Research ArticleOpen accessIn the abstractA Novel Enhancement Technique of the Hill Cipher for Effective Cryptographic PurposesA. F.A. Abidin, O. Y. Chuan, M. R.K. AriffinProblem statement: The Hill cipher is the first polygraph cipher which has a few advantages in data encryption. However, it is vulnerable to known plaintext attack. Besides, an invertible key matrix is needed for decryption. It may become problematic since an invertible key matrix does not always exist. Approach: In this study, a robust Hill algorithm (Hill++) has been proposed. … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 8,545 accessesView PDFCite
Research ArticleOpen accessIn the abstractEstimating the Parameters of the Negative-Lindley Distribution using Broyden-Fletcher-Goldfarb-ShannoNaushad Mamode KhanProblem statement: The Maximum Likelihood Estimation (MLE) technique is the most efficient statistical approach to estimate parameters in a cross-sectional model. Often, MLE gives rise to a set of non-linear systems of equations that need to be solved iteratively using the Newton-Raphson technique. However, in some situations such as in the Negative-Lindley distribution where it involves more than one unknown … …Journal of Mathematics and Statistics, Vol. 7, Issue 1 · 29 Jan 2011 · 7,378 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Newton's Method with Diagonal Jacobian Approximation for Systems of Nonlinear EquationsM. Y. Waziri, W. J. Leong, M. A. Hassan, M. MonsiProblem statement: The major weaknesses of Newton method for nonlinear equations entail computation of Jacobian matrix and solving systems of n linear equations in each of the iterations. Approach: In some extent function derivatives are quit costly and Jacobian is computationally expensive which requires evaluation (storage) of n×n matrix in every iteration. Results: This storage requirement became unrealistic when n … …Journal of Mathematics and Statistics, Vol. 6, Issue 3 · 30 Sep 2010 · 8,538 accessesView PDFCite
Research ArticleOpen accessIn the abstractGreatest Common Divisor and Least Common Multiple Matrices on Factor Closed Sets in a Principal Ideal DomainA. N. El-Kassar, S. S. Habre, Y. A. AwadProblem statement: Let T be a set of n distinct positive integers, x1, x2, ..., xn. The n×n matrix [T] having (xi, xj), the greatest common divisor of xi and xj, as its (i,j)-entry is called the greatest common divisor (GCD) matrix on T. The matrix [[T]] whose (i,j)-entry is [xi, xj], the least common multiple of xi and xj, … …Journal of Mathematics and Statistics, Vol. 5, Issue 4 · 31 Dec 2009 · 8,379 accessesView PDFCite
Research ArticleOpen accessIn the abstractUsing Both a Probabilistic Evolutionary Graph and the Evidence Theory for Color Scene AnalysisNassim Ammour, Abderrezak Guessoum, Daoud BerkaniIn this research, we introduce a new color images segmentation algorithm. The color scene analytic method is based on the progress of a probabilistic evolutionary graph. The strategy consists in making grow an evolutionary graph, which presents the scene elements in an unsupervised segmented image. The graph evolution development is based on the computation of the belonging probabilities to the … …American Journal of Applied Sciences, Vol. 5, Issue 12 · 31 Dec 2008 · 7,013 accessesView PDFCite
Research ArticleOpen accessIn the abstractParallel Iterative Algorithms with Accelerate Convergence for Solving Implicit Difference EquationsQing-Fu Liu, Wei-Jun Zhong, Mancho ManevThis study focuses on the solution of implicit difference equations, which are very difficult to compute in parallel for the diffusion equation. For improving the convergence rates and the properties of gradual-approach convergence of Segment-Classic-Implicit-Iterative (SCII) and Segment-Crank-Nicolson-Iterative (SCNI) algorithms realizing efficient iterative computation in parallel by segmenting grid domains, SCII and SCNI algorithms with accelerated convergence are studied and … …American Journal of Applied Sciences, Vol. 1, Issue 1 · 31 Mar 2004 · 6,799 accessesView PDFCite
Research ArticleOpen accessIn the abstractMatching LSI for Scalable Information RetrievalRajagopal Palsonkennedy, T. V. GopalLatent Semantic Indexing (LSI) is one of the well-liked techniques in the information retrieval fields. Different from the traditional information retrieval techniques, LSI is not based on the keyword matching simply. It uses statistics and algebraic computations. Based on Singular Value Decomposition (SVD), the higher dimensional matrix is converted to a lower dimensional approximate matrix, of which the noises could … …Journal of Computer Science, Vol. 8, Issue 12 · 2 Jan 2013 · 6,668 accessesView PDFCite
Research ArticleOpen accessIn the abstractDetection of Occluded Face Image using Mean Based Weight Matrix and Support Vector MachineG. Nirmala Priya, R. S.D. Wahida BanuProblem statement: Face occlusion is a very challenging problem in face recognition. The performance of face recognition system decreases drastically due to the presence of partial occlusion on the face. Extracting discriminative features to achieve accurate detection versus computational overhead in extracting the features, which affects the classification speed, would be a sustained problem. The objective of this study is … …Journal of Computer Science, Vol. 8, Issue 7 · 5 Jul 2012 · 7,043 accessesView PDFCite
Research ArticleOpen accessIn the abstractSome Applications of Spanning Trees in Complete and Complete Bipartite GraphsS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) is an important invariant, it is also an important measure of reliability of a network. Approach: Using linear algebra and matrix analysis techniques to evaluate the associated determinants. Results: In this study we derive simple formulas for the number of spanning trees of complete graph Kn and complete bipartite … …American Journal of Applied Sciences, Vol. 9, Issue 4 · 15 Feb 2012 · 7,263 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Efficient Low Complexity Lossless Coding Algorithm for Medical ImagesS. E. Ghrare, M.A. Mohd. Ali, K. Jumari, M. IsmailProblem statement: Nowadays a large number of various medical images are generated from hospitals and medical centers with sophisticated image acquisition devices, the movement toward digital images in radiology presents the problem of how to conveniently and economically store, retrieve and transmit the volume of digital images. Thus digital image data compression is necessary in order to solve this problem. … …American Journal of Applied Sciences, Vol. 6, Issue 8 · 31 Aug 2009 · 7,091 accessesView PDFCite