Browsing by Author "Kalayci T.E."
Now showing 1 - 7 of 7
Results Per Page
Sort Options
Item How wireless sensor networks can benefit from Brain Emotional learning Based Intelligent Controller (BELBIC)(Elsevier B.V., 2011) Kalayci T.E.; Bahrepour M.; Meratnia N.; Havinga P.J.M.Wireless sensor networks (WSNs) are composed of small sensing and actuating devices that collaboratively monitor a phenomena, process and reason about sensor measurements, and provide adequate feedback or take actions. One of WSNs tasks is event detection, in which occurrence of events of interest is detected in situ whenever and wherever they occur. Some examples of these events include environmental (e.g. fire), personal (e.g. activities), and data-related (e.g. outlier) events. Simply speaking, event detection is a classification process, in which membership of data measurements to each event class is determined. Neural network is one of the classifiers that have often been used for detecting events with known patterns. One of the techniques to maximise the neural network performance during classification process is enabling a learning process. Through this learning process, neural network can learn from errors generated in each round of classification to gradually improve its performance. In this paper we investigate applicability of Brain Emotional Based Intelligent Controller (BELBIC) to improve neural network performance. Empirical results show that incorporating the BELBIC with neural networks improves the accuracy of event detection in many circumstances. © 2011 Published by Elsevier Ltd.Item Genetic algorithm-based sensor deployment with area priority(2011) Kalayci T.E.; Uǧur A.We are introducing a new design goal called area priority to determine optimal sensor node distribution. The environment in which the wireless sensor network (WSN) will be placed is divided into parts and priorities are attached to these parts. Priorities make the deployment problem adaptable to nonhomogeneous environments with regions that have different importance levels such as forests. Various tree=animal types and densities, residential in the forest can be classified by the area priority concept that we propose. We also develop a genetic algorithm-based method to optimize the total importance in a fully connected WSN. Experimental results obtained for different priorities are presented and discussed. Copyright © 2011 Taylor & Francis Group, LLC.Item Reordering triple patterns of sparql queries using ant colony optimization(Brno University of Technology, 2012) Kalayci E.G.; Kalayci T.E.Semantic web is a paradigm that is proposed for configuring and controlling the overwhelming volumes of information on the web. One important challenge in semantic web is decreasing execution times of queries. Reordering triple patterns is an approach for decreasing execution times of queries. In this study, an ant colony optimization approach for optimizing SPARQL queries by reordering triple patterns is proposed. Contributions of this approach are optimizing order of triple patterns in SPARQL queries using ant colony optimization for lesser execution time and real time optimization without requiring any prior domain knowledge. This proposed novel method is implemented using ARQ query engine and it optimizes the queries for in-memory models of ontologies. Experiments show that proposed method reduces execution time considerably.Item An ant colony optimisation approach for optimising SPARQL queries by reordering triple patterns(Elsevier Ltd, 2015) Kalayci E.G.; Kalayci T.E.; Birant D.Processing the excessive volumes of information on the Web is an important issue. The Semantic Web paradigm has been proposed as the solution. However, this approach generates several challenges, such as query processing and optimisation. This paper proposes a novel approach for optimising SPARQL queries with different graph shapes. This new method reorders the triple patterns using Ant Colony Optimisation (ACO) algorithms. Reordering the triple patterns is a way of decreasing the execution times of the SPARQL queries. The proposed approach is focused on in-memory models of RDF data, and it optimises the SPARQL queries by means of Ant System, Elitist Ant System and MAX-MIN Ant System algorithms. The approach is implemented in the Apache Jena ARQ query engine, which is used for the experimentation, and the new method is compared with Normal Execution, Jena Reorder Algorithms, and the Stocker et al. Algorithms. All of the experiments are performed using the LUBM dataset for various shapes of queries, such as chain, star, cyclic, and chain-star. The first contribution is the real-time optimisation of SPARQL query triple pattern orders using ACO algorithms, and the second contribution is the concrete implementation for the ARQ query engine, which is a component of the widely used Semantic Web framework Apache Jena. The experiments demonstrate that the proposed method reduces the execution time of the queries significantly. © 2015 Elsevier Ltd. All rights reserved.Item Can wireless sensor networks be emotional? A survey of computational models of emotions and their applications for wireless sensor networks(Inderscience Publishers, 2017) Kalayci T.E.; Bahrepour M.; Meratnia N.; Havinga P.J.M.Advances in psychology have revealed that emotions and rationality are interlinked and emotions are essential for rational behaviour and decision making. Therefore, integration of emotions with intelligent systems has become an important topic in engineering. The integration of emotions into intelligent systems requires computational models to generate emotions from external and internal sources. This paper first provides a survey of current computational models of emotion and their applications in engineering. Finally, it assesses potential of integrating emotions in wireless sensor networks (WSNs) by listing some use scenarios and by giving one model application. In this model application performance of a neural network for event detection has been improved using brain emotional learning based intelligent controller (BELBIC). Copyright © 2017 Inderscience Enterprises Ltd.Item Area-priority-based sensor deployment optimisation with priority estimation using K-means(Institution of Engineering and Technology, 2017) Ateş E.; Kalayci T.E.; Uğur A.Deployment in wireless sensor networks (WSN) addresses maximising the coverage of sensors and reducing the total cost of deployment. The area-priority concept for WSN deployment that the authors contributed to the literature recently allows environments with regions that have different importance or priority levels. In this study, the authors propose the first priority-estimation method for area-priority-based WSN deployments. First, a satellite image of the environment that will be used in the deployment of the sensors is clustered by a K-means algorithm using the colour features of the regions. In the sensor deployment phase, this cluster information is used to determine the priorities of the sensor coverage areas on positions of the image. Sensors are initially deployed quickly using a priority queue-based technique. Then, a simulated annealing algorithm is used to maximise the total covered area priority and to minimise the gaps between the sensors. Various experiments are performed for different scenarios (land, sea, and forest) on images captured from Google Maps using different parameter values. The experiments confirm that the proposed approach performs well and outperforms the random deployment of sensors. © 2017 The Institution of Engineering and Technology.Item A reactive self-tuning scheme for multilevel graph partitioning(Elsevier Inc., 2018) Kalayci T.E.; Battiti R.We propose a new multilevel graph bi-partitioning approach (M-RRTS) using greedy construction and reactive-randomized tabu search (RRTS). RRTS builds upon local search by adding prohibitions (to enforce diversification) and self-tuning mechanisms to adapt meta-parameters in an online manner to the instance being solved. The novel M-RRTS approach adds a multi-scale structure to the previous method. The original graph is summarized through a hierarchy of coarser graphs. At each step, more densely-interconnected nodes at a given level of the hierarchy are coalesced together. The coarsest graph is then partitioned, and uncoarsening phases followed by refinement steps build solutions at finer levels until the original graph is partitioned. A variation of RRTS is applied for the refinement of partitions after each uncoarsening phase. We investigate various building blocks of the proposed multilevel scheme, such as different initial greedy constructions, different tie-breaking options and various matching mechanisms to build the coarser levels. Detailed experimental results are presented on the benchmark graphs from Walshaw's graph partitioning repository and potentially hard graphs. The proposed approach produces the record results for 14 of 34 graphs from the repository in lower CPU times with respect to competing approaches. These results confirm the value of the new self-tuning and multilevel strategy to rapidly adapt to new instances. © 2017 Elsevier Inc.