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,048 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,974 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,438 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,902 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleIntroduction to the New Type of Algorithms for Accelerating Convergence of SequenceR. ThukralA collection of new algorithms for accelerating the convergence of sequence of functions was described. The definitions and connections of these new algorithms with the improved functional epsilon algorithms are given. The effectiveness of these new algorithms was examined, namely the α-algorithms, the β-algorithms, the γ-algorithms, the δ-algorithms and the improved functional epsilon algorithms, for approximating solutions of a given … …Journal of Mathematics and Statistics, Vol. 1, Issue 1 · 31 Mar 2005 · 6,362 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAN EFFICIENT CELL PLACEMENT USING GRAVITATIONAL SEARCH ALGORITHMSRose Al Qasem, Taisir EldosIn modern chip design, cell placement is a stage in which cells representing well-defined functions are assigned physical locations, in a way that optimizes the total area and routing length. Cell placement is an NP-complete problem and the exact solution is generally far from reach for a practically sized instance. Hence, diversified heuristic algorithms are used to solve this problem. … …Journal of Computer Science, Vol. 9, Issue 8 · 25 Jun 2013 · 7,375 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleOptimal Control Algorithms for Second Order SystemsDanilo Pelusi, Raffaele MascellaProportional Integral Derivative (PID) controllers are widely used in industrial processes for their simplicity and robustness. The main application problems are the tuning of PID parameters to obtain good settling time, rise time and overshoot. The challenge is to improve the timing parameters to achieve optimal control performances. Remarkable findings are obtained through the use of Artificial Intelligence techniques as … …Journal of Computer Science, Vol. 9, Issue 2 · 2 Apr 2013 · 7,034 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleUsing Threads to Overcome Synchronization Delays in Parallel Multiple Progressive Alignment AlgorithmsEvandro A. Marucci, Geraldo F.D. Zafalon, Julio C. Momente et al.Problem statement: The parallelization of multiple progressive alignment algorithms is a difficult task. All known methods have strong bottlenecks resulting from synchronization delays. This is even more constraining in distributed memory systems, where message passing also delays the interprocess communication. Despite these drawbacks, parallel computing is becoming increasingly necessary to perform multiple sequence alignment. Approach: In this study, it is … …Current Research in Bioinformatics, Vol. 1, Issue 1 · 8 Mar 2012 · 14,199 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleProviding Collaborative Algorithms Support for Personal Health CareVladimir Trajkovik, Elena Vlahu-Gjorgievska, Igor Kulev, Saso KoceskiProblem statement: Today, there is a growing interest towards the adoption of novel technology in the field of medical monitoring and personal health care systems in general. This is especially case with certain categories of people suffering from chronicle diseases that need 24 h access to medical care. Approach: To solve this challenging issue, a model of a system containing … …Current Research in Bioinformatics, Vol. 1, Issue 1 · 8 Mar 2012 · 7,293 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,239 accessesView PDFCite