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

375 articles for “T-graph”
Set a search alert
Research ArticleOpen accessEvery word in the titleANALYSIS OF MICROSTRIP PATCHES ANTENNAS ARRAY BY USING A NEW BOND GRAPH TECHNOLOGYRiadh Mehouachi, Taghouti Hichem, Abdelkader MamiThis study is the only one that combines the microstrip patch antennas representing the microwave domain and the bond graph technique representing the automatic domain. In this study, we propose a new methodology to analyses the microstrip patch antennas arrays: It is the bond graph technique and the wave scattering formalism. This method helps us to achieve our purpose which … …American Journal of Applied Sciences, Vol. 11, Issue 8 · 30 Jun 2014 · 6,555 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSIGNED GRAPH APPROACH IN ADAPTIVE TRANSMISSION POWER TO ENHANCE THE LIFETIME OF WIRELESS SENSOR NETWORKSA. Babu Karuppiah, S. RajaramA Wireless Sensor Network (WSN) comprises a collection of sensor nodes networked for applications like surveillance, battlefield, monitoring of habitat. Nodes in a WSN are usually highly energy-constrained and expected to operate for long periods from limited on-board energy reserves. When a node transmits data to a destination node the data is overheard by the nodes that are in the … …American Journal of Applied Sciences, Vol. 11, Issue 8 · 13 May 2014 · 6,729 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleGRAPHSJ 3: A MODERN DIDACTIC APPLICATION FOR GRAPH ALGORITHMSGianluca Costa, Claudia D’Ambrosio, Silvano MartelloIn 2009 the authors developed an open source Java application and framework, GraphsJ, to help the students in their approach to the study of graph algorithms, by guiding them to understand their logical structures through experiments on numerical instances. After four years, the availability of Java 7 and of new tools suggested the implementation of a new major release. We … …Journal of Computer Science, Vol. 10, Issue 7 · 10 Feb 2014 · 7,857 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAn Alternative Graph Cut Algorithm for Morphological Edge DetectionP. RadhakrishnanProblem statement: Image analysis has some basic importance of edge detection. Characterize the object boundaries are helpful for object segmentation, registration and identification in a scene. There are many methods for edge detection, but it can be identified by two major methods, search-based and zero-crossing based. Approach: Proposed method tries to follow searching the edge points by applying graph cuts … …American Journal of Applied Sciences, Vol. 9, Issue 7 · 29 May 2012 · 6,897 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleSome 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 accessEvery word in the titleDiscussion around the Scattering Matrix Realization of a Microwave Filter using the Bond Graph Approach and Scattering FormalismHichem Taghouti, Abdelkader MamiProblem statement: Further to research works made previously and which use collectively the scattering formalism and bond graph technique for the modeling of a physical systems often working in high frequencies, we propose, in this article, a comparative study (discussion) for the scattering matrix realization of a high-frequency physical system. Approach: This discussion is based, on the one hand, on … …American Journal of Applied Sciences, Vol. 9, Issue 4 · 7 Feb 2012 · 7,188 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Kind of Intersection Graphs on Ideals of a RingA. A. TalebiProblem statement: Let R be a ring. The graph G(R) is the graph whose vertices are nontrivial ideal of R and in which two vertices u, v are joined by an edge, if and only if u ∩ v #{0}. Approach: In this study we study some properties of G(R). Results: We obtain conditions of R such that G(R) is … …Journal of Mathematics and Statistics, Vol. 8, Issue 1 · 6 Feb 2012 · 7,258 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleMalware Detection Based on Hybrid Signature Behaviour Application Programming Interface Call GraphAmmar Ahmed E. Elhadi, Mohd Aizaini Maarof, Ahmed Hamza OsmanProblem statement: A malware is a program that has malicious intent. Nowadays, malware authors apply several sophisticated techniques such as packing and obfuscation to avoid malware detection. That makes zero-day attacks and false positives the most challenging problems in the malware detection field. Approach: In this study, the static and dynamic analysis techniques that are used in malware detection are … …American Journal of Applied Sciences, Vol. 9, Issue 3 · 9 Jan 2012 · 9,144 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleNumber 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 accessEvery word in the titleComplexity 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