Bilgi Teknolojisi Bölümü Tezleri

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/298

Browse

Browsing Bilgi Teknolojisi Bölümü Tezleri by Language "en"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Item
    Citation Count: ÖZBEY, E. (2013). Expanding m-commerce possibilities through technology enabled devices. Yayımlanmamış yüksek lisans tezi. Ankara: Çankaya Üniversitesi Fen Bilimleri Enstitüsü.
    Expanding m-commerce possibilities through technology enabled devices
    (2013-09) Özbey, Engin; Çankaya Üniversitesi, Fen Bilimleri Enstitüsü, Matematik ve Bilgisayar Bölümü
    Popular payment systems including asynchronous, online and mobile payments are investigated. Mobile phone payment systems are targeted after finding that mcommerce is projected to rise. With this increase in the market share, mobile devices are found-out to share physical wallets’ load as they can merge credit and ATM cards. The possibilities increase with the adoption of new technologies, such as NFC (Near Field Communication), so that the handsets can house loyalty, mass transport cards as well as electronically held money transfer ability. On the other side, the security issues including identity and money theft remain important although the expectations on converging physical wallets into the handsets are strong. However, this is not a definite obstacle and big service providers and vendors give signals to adopt such a technology in their services and products. As the conclusion, the thesis argues that e-commerce can expand more through additional technologies on the mobile devices.
  • Item
    Citation Count: AL-TAMEEMİ, H.L.H. (2014). Using dijkstra algorithm in calculating alternative shortest paths for public transportation with transfers and walking. Yayımlanmamış yüksek lisans tezi. Ankara: Çankaya Üniversitesi Fen Bilimleri Enstitüsü.
    Using dijkstra algorithm in calculating alternative shortest paths for public transportation with transfers and walking
    (2014-06) Al-Tameemi, Haitham Latif Hassan; Çankaya Üniversitesi, Fen Bilimleri Enstitüsü, Bilgi Teknolojisi Bölümü
    In this study, the possibility of using the Dijkstra algorithm in calculate shortest paths and using GIS to connect transport lines for increasing efficiency in the accessibility to shortest paths was studied. The results are presented as spatial maps. Basically, the research question this thesis addresses is: “Can Iraqi authorities use graph theory and shortest path algorithm to build a system to develop a public transit system including exchanging lines and walking, based on the experiences of transport systems in Turkey?"As a research methodology, Ankara’s mass transportation has been examined as considerable similarities are found between Ankara and Baghdad in terms of population in number and in density. Hence, an introduction is given on both cities. Additionally, information technologies to investigate and promote public transport systems in the literature are visited. As gathering spatial data has required considerable time and resources, sample datasets of Ankara’s mass transport system are used to run demonstrative applications to highlight potential problems in the technical side. The surveyed literature also includes graph theory, transportation network, shortest path problems and GIS usage in the public transportation. The used MapInfo Professional and MapBasic software tools are available on the market. Specific application programs are developed in MapBasic to ease analyses and implementation in MapInfo. Additionally, programs are coded in C++ to apply Dijkstra algorithm to feed data to GIS software. Limitations are also reported to open further research avenues including other algorithms for path optimization. The results show that Dijkstra algorithm can be successfully applied to reform and design mass transportation systems. An unfortunate finding underlined that it is too early to jump to application design as the primary problem is to collect reliable and up to date spatial data of Baghdad.