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

8 results for “Dependence Graph”
Set a search alert
Research ArticleOpen accessEvery word in the titleEffectiveness Analysis of Aspect-Oriented Dependence Flow Graph as an Intermediate Representation ToolSyarbaini Ahmad, Abdul Azim A. GhaniGraph-based representations of programs such as control flow graph or dependence graph have been used to support program analysis tasks such as program comprehension and software maintenance. However, in the case of Aspect-Oriented Programming (AOP), such graph representations individually is not enough to represent the features of aspect-oriented programs because it could need to identify the flow of control and … …Journal of Computer Science, Vol. 14, Issue 6 · 20 Feb 2018 · 9,104 accessesView PDFCite
Research ArticleOpen accessIn the keywordsObject Recognition Based on Image Segmentation and ClusteringS. Thilagamani, N. ShanthiProblem statement: This study deals with object recognition based on image segmentation and clustering. Acquiring prior information of an image is done via two separate processes. Approach: The first process deals with detecting object parts of an image and integration of detected parts into several clusters. All these cluster centers form the visual words. The second process deals with over … …Journal of Computer Science, Vol. 7, Issue 11 · 6 Sep 2011 · 7,074 accessesView PDFCite
Research ArticleOpen accessIn the abstractTechnical Stability of Very Slender Rectangular Columns Compressed by Ball-And-Socket Joints without FrictionKrzysztof MurawskiStability of load-bearing members, as known, is a challenging issue and several tools are available for designers. Disregarding the material properties in use, the avoidance of possible stability troubles is a mandatory and challenging step of the overall design process. In this study, a theoretical model is presented for the of loss of stability in elastic states of very slender … …International Journal of Structural Glass and Advanced Materials Research, Vol. 4, Issue 1 · 16 Nov 2020 · 5,995 accessesView PDFCite
Research ArticleOpen accessIn the abstractStability, Stress and Strain Analysis of Very Slender Pinned Thin-Walled Box Columns according to FEM, Euler and TSThKrzysztof Murawski, Alexandre de Macêdo WahrhaftigIn this study, a Finite Element Method (FEM) analysis is presented for the loss of stability in elastic states of very slender pinned without friction box-section thin-walled column axially compressed. From the FEM buckling linear stress analyses are determined the compressing critical forces for 36 cases, presented in tables and as the surface functions in dependence on the slenderness ratio … …American Journal of Engineering and Applied Sciences, Vol. 14, Issue 2 · 11 May 2021 · 7,192 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 abstractNumerical Solution For Frank-Kamenetskii And Activation Energy Parameters in Reactive-Diffusive Equation with Variable One-Exponential FactorO. K. Koriko, A. J. OmowayeIn this study, we considered a steady state, exothermic chemical reaction, taking the diffusion of the reactant into account and assuming an Arrhenius temperature dependence with variable pre-exponent factor. Numerical solution is constructed for the governing nonlinear boundary value problem using finite difference scheme .The effect of Frank-Kamenetskii, activation energy parameter and pre-exponent factor on the temperature were also examined, … …Journal of Mathematics and Statistics, Vol. 3, Issue 4 · 31 Dec 2007 · 6,920 accessesView PDFCite