Research ArticleOpen accessIn the abstractAI-Based Feature Extraction Approaches for Dual Modalities of Autism Spectrum Disorder NeuroimagesMeenakshi Malviya, Chandra J, Nagendra NHigh-dimensional data, lower detection accuracy, susceptibility to manual errors, and the requirement of clinical experts are some drawbacks of conventional classification models available for Autism Spectrum Disorder (ASD) detection. To address these challenges and explore the affiliated information from advanced imaging modalities such as Magnetic Resonance Imaging (MRI) in structural MRI (sMRI) and resting state-functional MRI (rs-fMRI), the study applied … …Journal of Computer Science, Vol. 20, Issue 11 · 28 Sep 2024 · 5,087 accessesView PDFCite
Research ArticleOpen accessIn the abstractSemSimp: A Parametric Method for Evaluating the Semantic Similarity of Digital ResourcesAntonio De Nicola, Anna Formica, Ida Mele, Francesco TaglinoAbioui, H., Idarrou, A., Bouzit, A., & Mammass, D. (2018). Towards a Novel and Generic Approach for OWL Ontology Weighting. Procedia Computer Science, 127, 426–435. https://doi.org/10.1016/j.procs.2018.01.140 Adhikari, A., Dutta, B., Dutta, A., Mondal, D., & Singh, S. (2018). An intrinsic information content-based semantic similarity measure considering the disjoint common subsumers of concepts of an ontology. Journal of the Association for … …Journal of Computer Science, Vol. 20, Issue 8 · 27 May 2024 · 5,773 accessesView PDFCite
Research ArticleOpen accessIn the abstractComputational Analysis of Network ODE Systems in Metric Spaces: An ApproachSusmit BagchiTraditionally, the concepts of graph theory are applied to design stationary computer networks and, to analyze dynamics of social networks. However, the majority of non-stationary network models are formulated by using Ordinary Differential Equations (ODE) with varying orders having homogeneous or non-homogeneous forms. However, the analysis of continuous solution spaces of ODE and understanding of the interplay of spaces in … …Journal of Computer Science, Vol. 13, Issue 1 · 1 Mar 2017 · 7,891 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
Research ArticleOpen accessIn the abstractPerformance of Thin-Film as Wavelength Filter in Wdm-Pof NetworkMohd Syuhaimi Ab. Rahman, L. S. Supian, Hadi Guna et al.Problem statement: Huge capacity for data transmission and bandwidth are becoming a need nowadays. High cost of implementation using optical fibers prevents utilization of the technology as wide as possible. Approach: Wavelength Division Multiplexing (WDM) was a technique that offers the solution for providing better bandwidth. WDM technique allows several signals that have different wavelengths to be transmitted in a … …American Journal of Applied Sciences, Vol. 9, Issue 2 · 9 Dec 2011 · 7,270 accessesView PDFCite
Research ArticleOpen accessIn the abstractComparison between Vertex Merge Algorithm and Dsatur AlgorithmHandrizal, A. Noraziah, Ahmed N. AbdallaProblem statement: In this study, the channel allocation problem in direct sequence spread spectrum was investigated. First, Coloring in channel allocation has been discussed in detail. Second; a new graph model is proposed that namely Vertex Merge Algorithm (VMA). Approach: VMA try to solve channel allocation based on graph theory. Results: The problem is to assign channel to Access Point … …Journal of Computer Science, Vol. 7, Issue 5 · 7 May 2011 · 7,254 accessesView PDFCite
Research ArticleOpen accessIn the abstractComputer-Aided Design Data Extraction Approach to Identify Product InformationMohamad Faizal Ab. Jabal, Mohd. Shafry Mohd. Rahim, Nur Zuraifah Syazrah Othman, Daut DamanProblem statement: Many approaches have been proposed in previous such as AUTOFEAT algorithm, feature recognition, Intelligent Feature Recognition Methodology (IFRM), a part recognition algorithm and graph theory-based approach in order to solve the integration issue between CAD and CAM. However, there is no direct connection from CAD database and machine database. Therefore, comparison among the approaches has been conducted because … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Sep 2009 · 7,170 accessesView PDFCite