Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection

Permanent URI for this collectionhttps://hdl.handle.net/11147/7755

Browse

Filters

2006 - 200922010 - 20154

Settings

Department: search.filters.department.İzmir Institute of Technology. Computer EngineeringPublisher: search.filters.publisher.Springer Verlag

Search Results

Now showing 1 - 6 of 6
  • Conference Object
    Citation - Scopus: 4
    An Aspect-Lexicon Creation and Evaluation Tool for Sentiment Analysis Researchers
    (Springer Verlag, 2012) Husaini, Mus'ab; Koçyiğit, Ahmet; Tapucu, Dilek; Yanıkoğlu, Berrin; Saygın, Yücel
    In this demo paper, we present SARE, a modular and extendable semi-automatic system that 1) assists researchers in building gold-standard lexicons and evaluating their lexicon extraction algorithms; and 2) provides a general and extendable sentiment analysis environment to help researchers analyze the behavior and errors of a core sentiment analysis engine using a particular lexicon.
  • Conference Object
    Citation - Scopus: 7
    Orderbased Labeling Scheme for Dynamic Xml Query Processing
    (Springer Verlag, 2012) Assefa, Beakal Gizachew; Ergenç, Belgin
    Need for robust and high performance XML database systems increased due to growing XML data produced by today's applications. Like indexes in relational databases, XML labeling is the key to XML querying. Assigning unique labels to nodes of a dynamic XML tree in which the labels encode all structural relationships between the nodes is a challenging problem. Early labeling schemes designed for static XML document generate short labels; however, their performance degrades in update intensive environments due to the need for relabeling. On the other hand, dynamic labeling schemes achieve dynamicity at the cost of large label size or complexity which results in poor query performance. This paper presents OrderBased labeling scheme which is dynamic, simple and compact yet able to identify structural relationships among nodes. A set of performance tests show promising labeling, querying, update performance and optimum label size. © 2012 IFIP International Federation for Information Processing.
  • Conference Object
    Citation - Scopus: 2
    A Maximum Degree Self-Stabilizing Spanning Tree Algorithm
    (Springer Verlag, 2010) Çokuslu, Deniz; Erciyeş, Kayhan; Hameurlain, Abdelkader
    Spanning trees are fundamental topological structures in distributed environments which ease many applications that require frequent communication between nodes. In this paper, we examine and compare two spanning tree construction algorithms which rely on classical and self stabilization approach. Then, we propose a new self-stabilizing spanning tree construction algorithm which uses maximum degree heuristic while choosing the root node. We show experimentally that our new algorithm provides smaller tree diameters than the two existing approaches with favorable run-times. © 2011 Springer Science+Business Media B.V.
  • Article
    Citation - WoS: 24
    Citation - Scopus: 31
    Dynamic Replication Strategies in Data Grid Systems: A Survey
    (Springer Verlag, 2015) Tos, Uras; Mokadem, Riad; Hameurlain, Abdelkader; Ayav, Tolga; Bora, Şebnem
    In data grid systems, data replication aims to increase availability, fault tolerance, load balancing and scalability while reducing bandwidth consumption, and job execution time. Several classification schemes for data replication were proposed in the literature, (i) static vs. dynamic, (ii) centralized vs. decentralized, (iii) push vs. pull, and (iv) objective function based. Dynamic data replication is a form of data replication that is performed with respect to the changing conditions of the grid environment. In this paper, we present a survey of recent dynamic data replication strategies. We study and classify these strategies by taking the target data grid architecture as the sole classifier. We discuss the key points of the studied strategies and provide feature comparison of them according to important metrics. Furthermore, the impact of data grid architecture on dynamic replication performance is investigated in a simulation study. Finally, some important issues and open research problems in the area are pointed out.
  • Conference Object
    Citation - WoS: 6
    Citation - Scopus: 6
    A Merging Clustering Algorithm for Mobile Ad Hoc Networks
    (Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, Deniz
    Clustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and provide results in the simulation environment of ns2. Our results conform that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithms
  • Conference Object
    Citation - WoS: 8
    Citation - Scopus: 13
    A Distributed Backbone Formation Algorithm for Mobile Ad Hoc Networks
    (Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, Kayhan
    Construction of a backbone architecture is an important issue in mobile ad hoc networks(MANET)s to ease routing and resource management. We propose a new fully distributed algorithm for backbone formation in MANETs that constructs a directed ring architecture. We show the operation of the algorithm, analyze its message complexity and provide results in the simulation environment of ns2. Our results conform that the algorithm is scalable in terms of its running time and roundtrip delay against mobility, surface area, number of nodes and number of clusterheads.