Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7148
Browse
7 results
Search Results
Now showing 1 - 7 of 7
Article Citation - WoS: 8Citation - Scopus: 7A New Approach To the Generation of Retractable Plate Structures Based on One-Uniform Tessellations(The American Society of Mechanical Engineers(ASME), 2017) Gazi Gezgin, Aylin; Korkmaz, KorayRetractable plate structure (RPS) is a family of structures that is a set of cover plates connected by revolute joints. There exists wide range of possibilities related with these structures in architecture. Configuring the suitable shape of rigid plates that are able to be enclosed without any gaps or overlaps in both closed and open configurations and eliminating the possibility of contact between the plates during the deployment have been the most important issues in RPS design process. Many researchers have tried to find the most suitable shape by using kinematical or empirical analysis so far. This study presents a novel approach to find the suitable shape of the plates and their assembly order without any kinematical or empirical analysis. This approach is benefited from the one-uniform mathematical tessellation technique that gives the possibilities of tiling a plate using regular polygons without any gaps or overlaps. In the light of this technique, the shape of the plates is determined as regular polygons and two conditions are introduced to form RPS in which regular polygonal plates are connected by only revolute joints. It should be noted that these plates are not allowed to become overlapped during deployment and form gaps in closed configuration. Additionally, this study aims to reach a single degreeof- freedom (DoF) RPS. It presents a systematic method to convert multi-DoF RPS into single DoF RPS by using the similarity between graph theory and the duality of tessellation.Conference Object Citation - Scopus: 7New Mathematical Model for Finding Minimum Vertex Cut Set(Institute of Electrical and Electronics Engineers Inc., 2012) Beşeri Sevim, Tina; Kutucu, Hakan; Berberler, Murat ErşenIn this paper, we consider the vertex separator problem. Given an undirected graph G, the vertex separator problem consists in identifying a minimum number of vertex set whose removal disconnects G. We present a new mathematical model for solving this problem and also present computational results on graphs with various density. © 2012 IEEE.Article Citation - WoS: 2Citation - Scopus: 2Applying Mathematica and Webmathematica To Graph Coloring(Elsevier Ltd., 2007) Ufuktepe, Ünal; Bacak, GökşenThis paper analyzes some graph issues by using the symbolic program Mathematica and its version for the Web, webMathematica. In particular, we consider the problem of graph coloring: the assignment of colors to the vertices/edges of the graph such that adjacent vertices/edges are colored differently. In addition, we address the problem of obtaining the tenacity of binomial trees with Mathematica. Finally, we describe briefly an example of the application of our software to a scheduling problem.Conference Object Citation - WoS: 3Citation - Scopus: 5Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers(Springer Verlag, 2005) Erciyeş, Kayhan; Alp, Ali; Marshall, GeoffreyWe present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes which are at least a specified distance away from each other and coarsen them with their neighbor nodes in the coarsening phase using various heuristics. Using this algorithm, it is possible to obtain theoretically and experimentally much more balanced partitions with substantially decreased total edge costs between the partitions than other algorithms. We also developed a parallel method for the fixed centered partitioning algorithm. It is shown that parallel fixed centered partitioning obtains significant speedups compared to the serial case.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 ColorGArticle Citation - WoS: 1Graph Coloring With Webmathematica(Springer Verlag, 2004) Ufuktepe, Ünal; Bacak, Gökşen; Beşeri Sevim, TinaColoring of a graph is an assignment of colors either to the edges of the graph G, or to vertices, or to maps in such a way that adjacent edges/vertices/maps are colored differently. We consider the problem of coloring graphs by using webMathematica which is the new web-based technology. In this paper, we describe some web-based interactive examples on graph coloring with webMathematica.Article Citation - WoS: 1Citation - Scopus: 1Device length requirement in slab/fiber evanescent coupler(Taylor and Francis Ltd., 2000) Dinleyici, Mehmet SalihThe effective device lengths of the fiber half-coupler for various radii of curvatures was found. This calculated length was about a thousand times greater than that calculated by the model method. The device has enough effective interaction length. It also helps in finding the accuracy of estimations made by the CMT and modal method.