Optimization of Minimum Spanning Tree and Traveling Salesman Problems Arising in a University Campus Network

The network problem of a university campus is investigated in this study. The facilities such as departments, administration buildings, dormitory and etc. on the network are considered as the nodes. The aims of this study are twofold: finding the shortest distance which visits all nodes and finding the minimum path which connects all nodes. To achieve the aforementioned goals, the problem is modeled as a traveling salesman problem (TSP) and minimum spanning tree (MST), respectively. Two different binary integer programming models are developed and applied to the case study of Gaziantep University campus network with 72 nodes. The results of the models provide the feasible route to visit all nodes and the feasible path which interconnects every node pair of

Weighing Diverse Theoretical Models on Turkish Maqam

Since the early 20th century, various theories have been advanced in order to mathematically explain and notate modes of Traditional Turkish music known as maqams. In this article, maqam scales according to various theoretical models based on different tunings are compared with pitch measurements obtained from select recordings of master Turkish performers in order to study their level of match with analysed data. Chosen recordings are subjected to a fully computerized sequence of signal processing algorithms for the automatic determination of the set of relative pitches for each maqam scale: f0 estimation, histogram computation, tonic detection + histogram alignment, and peak picking. For nine well-recognized maqams, automatically derived relative pitches are compared with scale tones defined by theoretical models using quantitative distance measures. We analyse and interpret histogram peaks based on these measures to find the theoretical models most conforming with all the recordings, and hence, with the quotidian performance trends influenced by them.TÜBİTA