Arşiv logosu
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
Arşiv logosu
  • Koleksiyonlar
  • Sistem İçeriği
  • Analiz
  • Talep/Soru
  • Türkçe
  • English
  • Giriş
    Yeni kullanıcı mısınız? Kayıt için tıklayın. Şifrenizi mi unuttunuz?
  1. Ana Sayfa
  2. Yazara Göre Listele

Yazar "Rahnama, Behnam" seçeneğine göre listele

Listeleniyor 1 - 4 / 4
Sayfa Başına Sonuç
Sıralama seçenekleri
  • Yükleniyor...
    Küçük Resim
    Öğe
    Design and implementation of a novel weighted Shortest path algorithm for maze solving robots
    (IEEE, 2013) Rahnama, Behnam; Özdemir, Makbule Canan; Kiran, Yunus; Elçi, Atilla
    This research presents design and implementation of the shortest path algorithm for labyrinth discovery application in a multi-agent environment. Robot agents are unaware of the maze at the beginning; they learn as they discover it. Each agent solves a part of the maze and updates the shared memory so that other robots also benefit from each other's' discovery. Finding of the destination cell by an agent helps others to interconnect their discovered paths to the one ending with the destination cell. The proposed shortest path algorithm considers the cost for not only coordinate distance but also number of turns and moves required to traverse the path. The Shortest Path algorithm is compared against various available maze solving algorithms including Flood-Fill, Modified Flood-Fill and ALCK(EF). The presented algorithm can be used also as an additional layer to enhance the available methods at second and subsequent runs.
  • Yükleniyor...
    Küçük Resim
    Öğe
    Design and implementation of cooperative labyrinth discovery algorithms in multi-agent environment
    (2013) Rahnama, Behnam; Elçi, Atilla; Özermen, Cankat
    This research focuses on design and implementation of cooperative labyrinth discovery algorithms, specifically, discovering an unexplored maze with multiple robots working collaboratively. Solving a known maze using a single robot is straightforward. The robot looks around and memorizes the structure of the maze and it generates the solution track as a stack of consequent positions from the starting cell to the destination cell. The labyrinth discovery is known as a method of solving the maze when the wall structure is not known. There are various labyrinth discovery algorithms already implemented for a single agent but their extension to cooperating multiple agents is not straight forward and may not produce optimal solutions either. We designed and implemented single agent algorithms, namely Flood Fill (FF) and Modified Flood Fill (MFF), for multi-agent environment. In addition, a cooperative labyrinth discovery algorithm has been implemented based on the ALCKEF semantic logic. Then we compared their efficiency in theory and practice against the ideal case where agents are aware of the full maze structure. The theoretical comparison is done based on examining the time and space complexity. On the other hand, the experimental comparison examines the total cost for each of those algorithms to solve and discover the maze. © 2013 IEEE.
  • [ X ]
    Öğe
    Fine Tuning the Advanced Encryption Standard (AES)
    (Association for Computing Machinery, 2012) Rahnama, Behnam; Elçi, Atilla; Eweoya, Ibukun
    The Advanced Encryption Standard has been playing a prominent role in embedded systems security for a decade after being announced by the National Institute of Standards and Technology (NIST). However, vulnerabilities have emerged, especially timing attacks, that challenges its security. This paper demonstrates the introduction of a unique diffusion and confusion scheme in Rijndael by incorporating ASCII codes manipulations using playfair ciphering into the algorithm; it is not depended on the key and input thereby making it a constant time module in AES algorithm. The concept counters possible leakages from the S-box lookups; intermediary operations (SubstituteByte, ShiftRows, MixColumns, AddRoundKey) of the AES are still applicable but it becomes impossible for cryptanalysis discovery of enciphering method and ciphertext bits. Success of cracking efforts will be beyond human patience as it avoids statistical precision, thereby curbing timing attacks.
  • Yükleniyor...
    Küçük Resim
    Öğe
    Message from the workshop organizers: ESAS 2013
    (2013) Çelik, Duygu; Elçi, Atilla; Orgun, Mehmet A.; Rahnama, Behnam; Unland, Rainer
    [No abstract available]

| Aksaray Üniversitesi | Kütüphane | Açık Bilim Politikası | Açık Erişim Politikası | Rehber | OAI-PMH |

Bu site Creative Commons Alıntı-Gayri Ticari-Türetilemez 4.0 Uluslararası Lisansı ile korunmaktadır.


Aksaray Üniversitesi Kütüphane ve Dokümantasyon Daire Başkanlığı, Aksaray, TÜRKİYE
İçerikte herhangi bir hata görürseniz lütfen bize bildirin

Powered by İdeal DSpace

DSpace yazılımı telif hakkı © 2002-2025 LYRASIS

  • Çerez Ayarları
  • Gizlilik Politikası
  • Son Kullanıcı Sözleşmesi
  • Geri Bildirim