Research ArticleOpen accessEvery word in the titleComparison of Exact Algorithms for Rectilinear Distance Single-Source Capacitated Multi-Facility Weber ProblemsChansiri Singhtaun, Peerayuth CharnsethikulProblem statement: The objective of this study is to develop efficient exact algorithms for a single source capacitated multi-facility location problem with rectilinear distance. This problem is concerned with locating m capacitated facilities in the two dimensional plane to satisfy the demand of n customers with minimum total transportation cost which is proportional to the rectilinear distance between the facilities … …Journal of Computer Science, Vol. 6, Issue 2 · 28 Feb 2010 · 7,524 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Free Educational Java Framework for Graph AlgorithmsGianluca Costa, Claudia D’Ambrosio, Silvano MartelloProblem statement: In the teaching of graph theory algorithms it is important that students can experiment them on numerical instances in order to fully understand their logical meaning and to learn how they can be implemented. Approach: We developed an open source Java framework to help students in their approach to the study of graph algorithms. The framework was implemented … …Journal of Computer Science, Vol. 6, Issue 1 · 31 Jan 2010 · 7,397 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleTwo-Versions of Conjugate Gradient-Algorithms Based on Conjugacy Conditions for Unconstrained OptimizationAbbas Y. AL-Bayati, A.J. Salim, Khalel K. AbboProblem statement: (CG) algorithms, which we had investigated in this study, were widely used in optimization, especially for large scale optimization problems, because it did not need the storage of any matrix. The purpose of this construction was to find new CG-algorithms suitable for solving large scale optimization problems. Approach: Based on pure conjugacy condition and quadratic convex function two … …American Journal of Economics and Business Administration, Vol. 1, Issue 2 · 30 Jun 2009 · 8,108 accessesView PDFCite
Research ArticleOpen accessEvery word in the titlePerformance Optimization of Discrete Wavelets Transform Based Image Watermarking Using Genetic AlgorithmsA. Al-Haj, A. Abu-ErrubThe excellent spatial localization, frequency spread and multi-resolution characteristics of the Discrete Wavelets Transform (DWT), which were similar to the theoretical models of the human visual system, facilitated the development of many imperceptible and robust DWT-based watermarking algorithms. There had been extremely few proposed algorithms on optimized DWT-based image watermarking that can simultaneously provide perceptual transparency and robustness since these … …Journal of Computer Science, Vol. 4, Issue 10 · 31 Oct 2008 · 6,324 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleNew Graph Coloring AlgorithmsHussein Al-Omari, Khair E. SabriTwo new heuristic graph-coloring algorithms, based on known heuristic algorithms, have been introduced. One of them is a modification of the Largest Degree Ordering (LDO) algorithm, and the other one is a modification of the Saturation Degree Ordering (SDO) algorithm. The two new algorithms proposed in this paper, were compared empirically, in terms of used colors, with some of the … …Journal of Mathematics and Statistics, Vol. 2, Issue 4 · 31 Dec 2007 · 7,044 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSome P-RAM Algorithms for Sparse Linear SystemsRakesh Kumar Katare, N.S. ChaudhariPRAM algorithms for Symmetric Gaussian elimination is presented. We showed actual testing operations that will be performed during Symmetric Gaussian elimination, which caused symbolic factorization to occur for sparse linear systems. The array pattern of processing elements (PE) in row major order for the specialized sparse matrix in formulated. We showed that the access function in2+jn+k contains topological properties. We … …Journal of Computer Science, Vol. 3, Issue 12 · 31 Dec 2007 · 6,971 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleParallelisation of Algorithms of Mathematical MorphologyAbdallah Boukerram, Samira A.K. AzzouThe tools of mathematical morphology developed within the framework of the image processing, require of big capacity of data and the very high costs of execution. So today, the limits of the sequential machines are not to be any more to show, the passage in the new parallel machines of type Simd, Mimd, clusters or grids is imperative. This paper … …Journal of Computer Science, Vol. 2, Issue 8 · 31 Aug 2006 · 6,237 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Comparative Study of RSA Based Digital Signature AlgorithmsRamzi A. Haraty, A. N. El-Kassar, Bilal ShibaroA digital signature is a mechanism designed to allow secure communication through an insecure medium and can be traced in many applications where privacy is required. A digital signature is an electronic signature that can be used to authenticate the identity of the sender of a message or the signer of a document and possibly to ensure that the original … …Journal of Mathematics and Statistics, Vol. 2, Issue 1 · 31 Mar 2006 · 7,432 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleEstimation of the COCOMO Model Parameters Using Genetic Algorithms for NASA Software ProjectsAlaa F. ShetaDefining the project estimated cost, duration and maintenance effort early in the development life cycle is a valuable goal to be achieved for software projects. Many model structures evolved in the literature. These model structures consider modeling software effort as a function of the developed line of code (DLOC). Building such a function helps project managers to accurately allocate the … …Journal of Computer Science, Vol. 2, Issue 2 · 28 Feb 2006 · 9,357 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleHome Agent Architecture and Algorithms for Mobility Management in Mobile IP NetworksMarcellin Diha, Samuel PierreThis study proposes new Home Agent architecture and algorithms for real-time mobility management in mobile IP networks. The proposed architecture and algorithms offer a better performance based on the call-to-mobility ratio (CMR) and require less time for the location update and the tunneling compared with the Mobile IP model. These results are very useful and interesting for a real-time context … …Journal of Computer Science, Vol. 2, Issue 1 · 31 Jan 2006 · 6,899 accessesView PDFCite