Research ArticleOpen accessIn the abstractMulti Microkernel Operating Systems for Multi-Core ProcessorsRami MatarnehProblem statement: In the midst of the huge development in processors industry as a response to the increasing demand for high-speed processors manufacturers were able to achieve the goal of producing the required processors, but this industry disappointed hopes, because it faced problems not amenable to solution, such as complexity, hard management and large consumption of energy. These problems forced … …Journal of Computer Science, Vol. 5, Issue 7 · 31 Jul 2009 · 7,547 accessesView PDFCite
Research ArticleOpen accessIn the abstractA New Digital Signature Scheme Based on Factoring and Discrete LogarithmsE.S. Ismail, N.M.F. Tahat, R.R. AhmadProblem statement: A digital signature scheme allows one to sign an electronic message and later the produced signature can be validated by the owner of the message or by any verifier. Most of the existing digital signature schemes were developed based on a single hard problem like factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. Although these schemes … …Journal of Mathematics and Statistics, Vol. 4, Issue 4 · 31 Dec 2008 · 7,259 accessesView PDFCite
Research ArticleOpen accessIn the abstractData Clustering using Two-Stage Eagle Strategy Based on Slime Mould AlgorithmRachid Oucheikh, Achraf Touil, Mouhsene FriDataclustering is considered an important component of data mining which aims tosplit a given dataset into disjoint groups having the same similarities. Thedeveloped techniques for clustering have some challenges to cluster entities incomplex search space and most of them aim to maximize the sum of inter-clusterdistances and minimize the sum of intra-cluster distances. This objectivefunction is nonlinear and hard to … …Journal of Computer Science, Vol. 18, Issue 11 · 7 Nov 2022 · 5,791 accessesView PDFCite
Research ArticleOpen accessIn the abstractCavern Design Philosophy under High Stress Rock Condition a Case Study in Sri LankaBahram SalehiFor stabilizing of rock cavern stress condition and orientation, rock properties and cavern geometry have determinant effects. Numerical and analytical study and knowledge about self-support arching can assist to designer in appropriate understanding of cavern and ground interaction. The comparative studies by E. Hoek, showed that the mushroom shaped cavern was not an acceptable design because of high value stress … …American Journal of Applied Sciences, Vol. 14, Issue 3 · 21 Mar 2017 · 7,978 accessesView PDFCite
Research ArticleOpen accessIn the abstractVolatile Organic Compounds Removal Methods: A ReviewAydin Berenjian, Natalie Chan, Hoda Jafarizadeh MalmiriVolatile Organic Compounds (VOCs) are among the most toxic chemicals which are detrimental to humans and environment. There is a significant need of fully satisfactory method for removal of VOCs. There are several methods including physical, chemical and biological treatments available to remove VOCs by either recovery or destruction. The aim of the present study is to summarize the available … …American Journal of Biochemistry and Biotechnology, Vol. 8, Issue 4 · 25 Dec 2012 · 24,317 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Gaussian Process Regression Model for the Traveling Salesman ProblemWanatchapong Kongkaew, Juta PichitlamkenProblem statement: Traveling Salesman Problem (TSP) is a famous NP hard problem. Many approaches have been proposed up to date for solving TSP. We consider a TSP tour as a dependent variable and its corresponding distance as an independent variable. If a predictive function can be formulated from arbitrary sample tours, the optimal tour may be predicted from this function. … …Journal of Computer Science, Vol. 8, Issue 10 · 30 Aug 2012 · 7,367 accessesView PDFCite
Research ArticleOpen accessIn the abstractAdaptive Channel Estimation for Multiuser Underwater Communication SystemsS. Aliesawi, C. C. Tsimenidis, B. S. Sharif, M. JohnstonProblem statement: Multiple Access Interference (MAI) signals and poor estimation of the unknown channel parameters in the presence of limited training sequences are two of the major problems that degrade the systems’ performance. Two synchronous multiuser receivers with Rake reception of Interleave Division Multiple Access (IDMA) and Code Division Multiple Access (CDMA) systems, in conjunction with channel estimation, are considered … …American Journal of Engineering and Applied Sciences, Vol. 4, Issue 4 · 20 Feb 2012 · 7,355 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 abstractNumber of Spanning Trees of Circulant Graphs C6n and their ApplicationsS. N. DaoudProblem statement: The number of spanning trees of a graph G is usually denoted by τ(G). A circulant graph with n vertices and k jumps is Cn (a1,…..,ak). Approach: In this study the number τ(G) of spanning trees of the circulant graphs C6n with some non-fixed jumps such as C6n (1, n), C6n (1, n, 2n), C6n (1, n, 3n), … …Journal of Mathematics and Statistics, Vol. 8, Issue 1 · 12 Dec 2011 · 7,626 accessesView PDFCite
Research ArticleOpen accessIn the abstractComplexity of Cocktail Party Graph and Crown GraphS. N. DaoudProblem statement: The number of spanning trees τ(G) in graphs (networks) was an important invariant. Approach: Using the properties of the Chebyshev polynomials of the second kind and the linear algebra techniques to evaluate the associated determinants. Results: The complexity, number of spanning trees, of the cocktail party graph on 2n vertices, given in detail in the text was proved. … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 12 Dec 2011 · 7,868 accessesView PDFCite