Skip to main content

More right-solid
More right-solid
SHOW DETAILS
up-solid down-solid
eye
Title
Date Archived
Creator
Community Texts
Nov 7, 2018 Yahya Hassanzadeh-Nazarabadi, Alptekin Küpçü, and Öznur Özkasap
texts
eye 5
favorite 0
comment 0
Skip Graph, a type of DHT, plays an important role in P2P cloud storage applications, where nodes publicly or privately store, share, and access data. Nowadays P2P storage systems are widely using replication to support data availability, reliability, and maintainability. With replication, the main consideration is determining peers to replicate the data. Traditional replication algorithms are partially randomized and employ rigid assumptions about nodes’ distribution. This results in high...
Topics: Latency Constrained, Locality Awareness, P2P, DHT, Skip Graph, Low Latency, Overlay, Replication
Community Texts
Nov 7, 2018 Yahya Hassanzadeh-Nazarabadi, Canberk Ekmekçi, Esin Menceloglu, and Öznur Özkasap
texts
eye 13
favorite 0
comment 0
Skip Graph is a network overlay structure utilized in distributed data storage services as well as systems such as P2P cloud storage, search engines, Internet-of-Things, and mobile sensor networks. We propose SkipVis: a Skip Graph overlay visualizer that facilitates the flaw detection of Skip Graph-based algorithms in their design phase and also the implementation correctness verifiability. To the best of our knowledge, there exists no overlay visualizer for Skip Graph structure. Therefore,...
Topics: Skip Graph, Visualizer, P2P, DHT
Community Texts
Nov 7, 2018 Yahya Hassanzadeh-Nazarabadi and Öznur Özkasap
texts
eye 26
favorite 0
comment 0
As a distributed hash table (DHT), Skip Graph acts as the underlying routing infrastructure of peer-to-peer (P2P) storage systems, distributed online social networks, search engines, and other DHT-based applications. For many P2P applications, data aggregation is vital, however, it is a missing feature of Skip Graph. The traditional aggregation algorithms cost noticeable message overhead which degrades the energy efficiency while increasing the response time. Likewise, the aggregation trees...
Topics: Aggregation Tree, Skip Graph, P2P, Energy Efficiency, Latency Constrained
Community Texts
Nov 6, 2018 Yahya Hassanzadeh-Nazarabadi Alptekin Küpçü Öznur Özkasap
texts
eye 14
favorite 0
comment 0
The traditional decentralized availability-based replication algorithms suffer from high dependence on the underlying system's churn behavior, randomness in replica selection, and the inability of maximizing the replicas availability. These drawbacks result in poor data availability especially in low available systems as well as where the churn behavior is mispredicted. In this paper, we propose dynamic, fully decentralized availability aware algorithm named Awake, with the goal of maximizing...
Topics: Replication, High Availability, Fault Tolerant, Data Availability, Cloud Storage
Community Texts
Nov 6, 2018 Yahya Hassanzadeh-Nazarabadi, Alptekin Küpçü, and Öznur Özkasap
texts
eye 19
favorite 0
comment 0
Skip Graph, a member of the distributed hash table (DHT) family, has several benefits as an underlying structure in peer-to-peer (P2P) storage systems. In such systems, replication plays a key role on the system's performance. The traditional decentralized replication algorithms do not consider the locations of Skip Graph nodes in the network. Negligence of node locations in the placement of the replicas results in high access delays between the nodes and their closest replicas. This negatively...
Topics: Replication, DHT, Skip Graph, Latency Constrained, Low Latency, Locality Aware, Optimization
Community Texts
Nov 6, 2018 Yahya Hassanzadeh-Nazarabadi, Alptekin Küpçü, and Öznur Özkasap
texts
eye 14
favorite 0
comment 0
  Skip Graph, as a distributed hash table (DHT) based data structure, plays a key role in peer-to-peer (P2P) storage systems, distributed online social networks, search engines, and several DHT-based applications. In the Skip Graph structure, node identifiers define the connectivity. However, traditional identifier assignment algorithms do not consider the Skip Graph nodes' locations. Neglecting the nodes' localities in the identifier assignments results in high end-to-end latency in the...
Topics: Low Latency, P2P, Locality Aware, Latency Constraint, Overlay, Skip Graph
Community Texts
Sep 6, 2018 Yahya Hassanzadeh-Nazarabadi- Sanaz Taheri-Boshrooyeh
texts
eye 19
favorite 0
comment 0
This project is about sorting Karyotypes in a way that the result is self-explanatory. Karyotypes mean the number and visual appearance of the chromosomes in the cell nuclei of an organism or species. Most of the time (almost always) Karyotypes contain chromosomes positioned in a disordered manner i.e. they are rotated, they have overlap and there is no predefined and uniform distribution for them and etc  
Topics: Karyotype, Chromosome
Community Texts
Aug 30, 2018 Yahya Hassanzadeh
texts
eye 27
favorite 0
comment 0
Voice Controlled Camera (vCamera) is a course project Android Application that was developed by me while I was taking the Intelligent User Interface course. By interacting with the user over the voice, vCamera can offer the following services: The user can adjust the common features of an embedded camera using voice. The set of features is effect, flashlight, focus mode, scene mode and white balance mode. (Novel Feature) The user can take a photo or captures a video by saying a predefined...
Topics: Android Application, Camera, Voice Recognition, Intelligent User Interface
Community Texts
Aug 27, 2018 Yahya Hassanzadeh-Nazarabadi
texts
eye 11
favorite 0
comment 0
My BSc Thesis of Computer Hardware Engineering at the Ferdowsi University of Mashhad, Iran. The thesis is in Persian. 
Topics: Robot, Platform Robot, Sensor
Community Texts
Aug 27, 2018 Yahya Hassanzadeh
texts
eye 99
favorite 0
comment 0
My COMP546 (Algorithm Design and Analysis) Course Project while I was doing my Ph.D. at KU. It is the Java implementation of my designed algorithm to break a knapsack encrypted user input password and reveal the plaintext. My implementation is available at:  https://github.com/yhassanzadeh13/breaking-knapsack-encryption
Topics: Knapsack Encryption, Java, Divide and Conquer