Master Degree / Yüksek Lisans Tezleri
Permanent URI for this collectionhttps://hdl.handle.net/11147/3008
Browse
3 results
Search Results
Master Thesis Random Vibration of a Road Vehicle(Izmir Institute of Technology, 2010) Bayrakdar, Özgür; Yardımoğlu, BülentIn this study, considering four different car models, random vibration characteristics of a road vehicle are investigated by using Mathematica. A road vehicle is modeled as quarter car, half car, and bicycle car. Natural frequencies of each model are found in first step. Then, responses to harmonic and random base excitation for each models are determined. The accuracy of the developed programs for different car models in Mathematica is evaluated by comparing the natural frequencies available in the literature. The effects of modeling approach on natural frequencies and response to harmonic and random base excitation are obtained. The results are presented in graphical and functional forms.Master Thesis Edge Coloring of a Graph(Izmir Institute of Technology, 2004) Beşeri, Tina; Ufuktepe, ÜnalThe edge coloring problem is one of the fundamental problem on graphs which often appears in various scheduling problems like the le transfer problem on computer networks. In this thesis, we survey old and new results on the classical edge coloring as well as the generalized edge coloring problems. In addition, we developed some algorithms and modules by using Combinatorica package to color the edges of graphs with webMathematica which is the new web-based technology.Master Thesis Vertex Coloring of a Graph(Izmir Institute of Technology, 2004) Bacak, Gökşen; Ufuktepe, ÜnalVertex coloring is the following optimization problem; given a graph, how many colors are required to color its vertices in such a way that no two adjacent vertices receive the same color? The required number of colors is called the chromatic number of G and is denoted by (G). In this thesis, we reviewed the vertex coloring concepts and theorems. The package ColorG which we have improved has many functions for dealing with graph coloring. This package uses a heuristic method due to Brelaz to color the graph so that adjacent vertices have distinct colors.