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

86 articles for “graphs”
Set a search alert
Research ArticleOpen accessIn the abstractGraph Coloring Program of Exam Scheduling Modeling Based on Bitwise Coloring Algorithm Using PythonSamsul Arifin, Indra Bayu Muktyas, Wikky Fawwaz Al Maki, Mohd Khairul Bazli Mohd AzizA graph coloring is the process of assigning labels to the vertices of a graph in such a way that no two adjacent vertices have the same color. The chromatic number of a graph G is the smallest number of colors that can be assigned to it. Graph coloring has a wide range of applications and is commonly used to … …Journal of Computer Science, Vol. 18, Issue 1 · 1 Feb 2022 · 9,702 accessesView PDFCite
Research ArticleOpen accessIn the abstractTechnical Buckling, Stress and Strain Simplified Analysis of Semi-Slender Thin-Walled Cylindrical Pinned ColumnKrzysztof MurawskiThe stability of load-bearing members is a challenging issue for designers. The avoidance of possible stability troubles is a mandatory step of the overall design process. The paper presents and discusses two simplified methods based on the Technical Stability Theory (TSTh) of loss of stability of lateral buckling in elastic-plastic states of semi-slender columns axially compressed by force. It is … …International Journal of Structural Glass and Advanced Materials Research, Vol. 5, Issue 1 · 27 May 2021 · 6,823 accessesView PDFCite
Research ArticleOpen accessIn the abstractLocal Large Deviations: A McMillian Theorem for Typed Random Graph ProcessesKwabena Doku-AmponsahFor a finite typed graph on n nodes and with type law µ on finite alphabet Γ, we define the spectral potential ρλ(., µ), of the graph. From the ρλ(., µ) we define the Kullback action or the divergence function, Hλ(π || v), with respect to an empirical link measure, π, as the Legendre dual. For the finite typed random … …Journal of Mathematics and Statistics, Vol. 13, Issue 4 · 29 Nov 2017 · 7,114 accessesView PDFCite
Research ArticleOpen accessIn the abstractLossy Asymptotic Equipartition Property for Networked Data StructuresKwabena Doku-AmponsahIn this study, we prove a Generalized Information Theory for Networked Data Structures modelled as random graphs. The main tools in this study remain large deviation principles for properly defined empirical measures on random graphs. To motivate the paper, we apply our main result to a concrete example from the field of Biology. …Journal of Mathematics and Statistics, Vol. 13, Issue 2 · 24 May 2017 · 6,979 accessesView PDFCite
Research ArticleOpen accessIn the abstractA REFINEMENT OF DIJKSTRA'S ALGORITHM FOR EXTRACTION OF SHORTEST PATHS IN GENERALIZED REAL TIME-MULTIGRAPHSSiddhartha Sankar Biswas, Bashir Alam, M. N. DojaThe networks of the present day communication systems, be it a public road transportation system or a MANET or an Adhoc Network, frequently face a lot of uncertainties in particular regarding traffic jam, flood or water logging or PWD maintenance work (in case of public road network), attack or damage from internal or external agents, sudden failure of one or … …Journal of Computer Science, Vol. 10, Issue 4 · 14 Dec 2013 · 7,260 accessesView PDFCite
Research ArticleOpen accessIn the abstractGeneralization of Dijkstra’s Algorithm for Extraction of Shortest Paths in Directed MultigraphsBashir Alam, Siddhartha Sankar Biswas, M. N. DojaThe classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to multigraphs. In this study the authors generalize the classical Dijkstra’s algorithm to make it applicable to directed multigraphs. The modified algorithm is called by Generalized Dijkstra’s algorithm or GD Algorithm (GDA in short). The GDA outputs the shortest paths and the corresponding min cost. It … …Journal of Computer Science, Vol. 9, Issue 3 · 29 Apr 2013 · 7,466 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Design and Development of Word Sense Disambiguation Algorithm for English Language Understanding for Database AccessM. Munusamy, G. Tholkappia Arasu, V. Palanisamy, S. SelvarajanProblem statement: This study attempts to present an object-net method for word sense disambiguation. It is proposed to model the elementary meanings which assist the machine to autonomously undertake the analysis and synthesis processes of meaning. Approach: In the proposed methodology, the disambiguation process was performed in context manner. Starting from natural text, the context of the sentence was identified, … …Journal of Computer Science, Vol. 7, Issue 10 · 11 Aug 2011 · 6,780 accessesView PDFCite
Research ArticleOpen accessIn the abstractExact Simulating of Human Arteries using Lumped Model and Probing Constriction in Femoral and Carotid ArteriesMohammad Reza Mirzaee, Omid Ghasemalizadeh, Bahar FiroozabadiProblem statement: Modeling Human cardiovascular system was always an important issue from long past because by doing such modeling, investigation in cardiovascular system and its abnormities would be simpler. One of the most effective ways to do such modeling is using lumped method (Electrical analogy). Approach: Lumped method was used for simulating a complete model in this approach. A 36-vessel … …American Journal of Applied Sciences, Vol. 6, Issue 5 · 31 May 2009 · 7,304 accessesView PDFCite
Research ArticleOpen accessIn the abstractAbdominal and Thoracic Aortic Aneurysm ModelingMona Abdolrazaghi, Mehdi NavidBakhsh, Kamran HassaniModeling is a beneficial tool for understanding cardiovascular system functioning and pathophysiology of the system. The present study is concerned with left ventricle Pressure-Volume diagrams obtained by modeling of aortic aneurysms using the cardiovascular electronic system. In addition, these graphs were compared with a normal condition. The electrical circuit of the cardiovascular system consists of 42 segments including the main … …American Journal of Applied Sciences, Vol. 5, Issue 8 · 31 Aug 2008 · 6,606 accessesView PDFCite
Research ArticleOpen accessIn the abstractOn The Integration of Decision Diagrams in High Order Logic Based Theorem Provers: a SurveySa'ed Abed, Otmane Ait Mohamed, Ghiath Al SammaneThis survey discuss approaches that integrate Decision Diagrams inside High Order Logic based Theorem provers. The approaches can be divided in two kinds, one is based on building a translation between model checker and theorem prover, the second is based on embedding the model checker algorithms inside the theorem prover. A comparison between both is discussed in detail. The paper … …Journal of Computer Science, Vol. 3, Issue 10 · 31 Oct 2007 · 6,980 accessesView PDFCite