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 titleDisjoint Sets in Graphs and its Application to Electrical NetworksFord Lumban GaolProblem statement: One of the well known problems in Telecommunication and Electrical Power System is how to put Electrical Sensor Unit (ESU) in some various selected locations in the system. Approach: This problem was modeled as the vertex covering problems in graphs. The graph modeling of this problem as the minimum vertex covering set problem. Results: The degree covering set … …Journal of Mathematics and Statistics, Vol. 7, Issue 1 · 25 Mar 2011 · 7,617 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleModeling Method of a Low-Pass Filter Based on Microstrip T-Lines with Cut-Off Frequency 10 GHz by the Extraction of its Wave-Scattering Parameters from its Causal Bond Graph ModelHichem Taghouti, Abdelkader MamiProblem statement: This study presented a jointly application of bond graph technique and wave-scattering formalism for a new realization called scattering bond graph model which has the main advantage to show up explicitly the different wave propagation. Approach: For that, we proposed to find the scattering matrix from the causal bond graph model of a low-pass filter based on Microstrip … …American Journal of Engineering and Applied Sciences, Vol. 3, Issue 4 · 4 Nov 2010 · 8,262 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleHow to Find Wave-Scattering Parameters from the Causal Bond Graph Model of a High Frequency FilterHichem Taghouti, Abdelkader MamiProblem statement: The aim of this study is to use the bond graph technique and the wave-scattering formalism, jointly, to determine the scattering matrix of a high frequency filter with cut-off frequency 10 GHz. Approach: The first step consist to model the high frequency filter by bond graph approach, afterward, we decomposed the obtained causal bond graph model under an … …American Journal of Applied Sciences, Vol. 7, Issue 5 · 31 May 2010 · 7,654 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAn Adaptive Updating Topic Specific Web Search System Using T-GraphAhmed PatelProblem statement: The main goal of a Web crawler is to collect documents that are relevant to a given topic in which the search engine specializes. These topic specific search systems typically take the whole document's content in predicting the importance of an unvisited link. But current research had proven that the document's content pointed to by an unvisited link … …Journal of Computer Science, Vol. 6, Issue 4 · 30 Apr 2010 · 6,595 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleGraph Folding of Some Special GraphsE. El-Kholy, A. El-EsawyIn this study we introduced the definition of graph folding then, we proved that we cannot fold any complete graph except the bipartite graph. By using incidence matrices we described the graph folding. …Journal of Mathematics and Statistics, Vol. 1, Issue 1 · 30 Mar 2010 · 7,351 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Free Educational Java Framework for Graph AlgorithmsGianluca Costa, Claudia D’Ambrosio, Silvano MartelloProblem statement: In the teaching of graph theory algorithms it is important that students can experiment them on numerical instances in order to fully understand their logical meaning and to learn how they can be implemented. Approach: We developed an open source Java framework to help students in their approach to the study of graph algorithms. The framework was implemented … …Journal of Computer Science, Vol. 6, Issue 1 · 31 Jan 2010 · 7,397 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleUsing Both a Probabilistic Evolutionary Graph and the Evidence Theory for Color Scene AnalysisNassim Ammour, Abderrezak Guessoum, Daoud BerkaniIn this research, we introduce a new color images segmentation algorithm. The color scene analytic method is based on the progress of a probabilistic evolutionary graph. The strategy consists in making grow an evolutionary graph, which presents the scene elements in an unsupervised segmented image. The graph evolution development is based on the computation of the belonging probabilities to the … …American Journal of Applied Sciences, Vol. 5, Issue 12 · 31 Dec 2008 · 7,013 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleGraph Based Segmentation in Content Based Image RetrievalP. S. Suhasini, K. S.R. Krishna, I. V.M. KrishnaProblem statement: Traditional image retrieval systems are content based image retrieval systems which rely on low-level features for indexing and retrieval of images. CBIR systems fail to meet user expectations because of the gap between the low level features used by such systems and the high level perception of images by humans. To meet the requirement as a preprocessing step … …Journal of Computer Science, Vol. 4, Issue 8 · 31 Aug 2008 · 6,581 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleAn Improved Handwritten Tamil Character Recognition System using Octal GraphR. J. Kannan, R. PrabhakarProblem Statement: Handwriting recognition has attracted voluminous research in recent times. The segmentation and recognition of the characters from handwritten scripts incorporates considerable overhead. Almost all the existing handwritten character recognition techniques use neural network approach, which requires lot of preprocessing and hence accomplishing these problems using neural network is a tedious task. Approach: In this study we propose a … …Journal of Computer Science, Vol. 4, Issue 7 · 31 Jul 2008 · 7,405 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleNew Graph Coloring AlgorithmsHussein Al-Omari, Khair E. SabriTwo new heuristic graph-coloring algorithms, based on known heuristic algorithms, have been introduced. One of them is a modification of the Largest Degree Ordering (LDO) algorithm, and the other one is a modification of the Saturation Degree Ordering (SDO) algorithm. The two new algorithms proposed in this paper, were compared empirically, in terms of used colors, with some of the … …Journal of Mathematics and Statistics, Vol. 2, Issue 4 · 31 Dec 2007 · 7,044 accessesView PDFCite