WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7150
Browse
5 results
Search Results
Article Citation - WoS: 22Citation - Scopus: 26On the Application of the Exp-Function Method To the Kp Equation for N-Soliton Solutions(Elsevier, 2012) Aslan, İsmailWe observe that the form of the Kadomstev-Petviashvili equation studied by Yu (2011) [S. Yu, N-soliton solutions of the KP equation by Exp-function method, Appl. Math. Comput. (2011) doi:10.1016/j.amc.2010.12.095] is incorrect. We claim that the N-soliton solutions obtained by means of the basic Exp-function method and some of its known generalizations do not satisfy the equation considered. We emphasize that Yu's results (except only one) cannot be solutions of the correct form of the Kadomstev-Petviashvili equation. In addition, we provide some correct results using the same approach.Conference Object Citation - WoS: 23Citation - Scopus: 31A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks(Springer Verlag, 2006) Çokuslu, Deniz; Erciyeş, Kayhan; Dağdeviren, OrhanWe propose a new Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is based on Wu and Li's [14] algorithm, however we provide significant modifications by considering the degrees of the nodes during marking process and also provide further heuristics to determine the color of a node in the initial phase. We describe, analyze and measure performance of this new algorithm by simulation and show that it performs better than Wu and Li's [14] algorithm especially in the case of dense networks.Conference Object Citation - WoS: 1Citation - Scopus: 2Applications of Graph Coloring(Springer Verlag, 2005) Ufuktepe, Ünal; Bacak, GökşenA graph G is a mathematical structure consisting of two sets V(G) (vertices of G) and E(G) (edges of G). Proper coloring of a graph is an assignment of colors either to the vertices of the graphs, or to the edges, in such a way that adjacent vertices / edges are colored differently. This paper discusses coloring and operations on graphs with Mathematica and webMathematica. We consider many classes of graphs to color with applications. We draw any graph and also try to show whether it has an Eulerian and Hamiltonian cycles by using our package ColorGConference Object Citation - WoS: 6Citation - Scopus: 11Dynamically Adaptive Partition-Based Data Distribution Management(Institute of Electrical and Electronics Engineers Inc., 2005) Kumova, Bora İsmailPerformance and scalability of distributed simulations depends primarily on the effectiveness of the employed data distribution management (DDM) algorithm, which aims at reducing the overall computational and messaging effort on the shared data to a necessary minimum. Existing DDM approaches, which are variations and combinations of two basic techniques, namely region-based and grid-based techniques, perform purely in the presence of load differences. We introduce the partition-based technique that allows for variable-size partitioning shared data. Based on this technique, a novel DDM algorithm is introduced that is dynamically adaptive to cluster formations in the shared data as well as in the physical location of the simulation objects. Since the re-distribution is sensitive to inter-relationships between shared data and simulation objects, a balanced constellation has the additional advantage to be of minimal messaging effort. Furthermore, dynamic system scalability is facilitated, as bottlenecks are avoided.Article Citation - WoS: 21Citation - Scopus: 37Determination of Wavelet Ridges of Nonstationary Signals by Singular Value Decomposition(Institute of Electrical and Electronics Engineers Inc., 2005) Özkurt, Nalan; Savacı, Ferit AcarThe ridges obtained from chaotic signals can give the relevant information about the phase structures of the dynamical systems. Therefore, a new wavelet ridge determination method for the noisy signals and nonstationary signals, which is based on the singular value decomposition (SVD) has been proposed in this paper. The proposed method has been compared with Carmona method for monocomponent signals, and multicomponent signals. The proposed method is computationally more effective than the Carmona method to determine the actual ridges. Also, the ridges of the periodic limit cycles and chaotic attractors have been determined by using the SVD-based method to find the degree of chaoticity.