Computer Engineering Commons^™

Practical Considerations And Applications For Autonomous Robot Swarms, Rory Alan Hector

LSU Doctoral Dissertations

In recent years, the study of autonomous entities such as unmanned vehicles has begun to revolutionize both military and civilian devices. One important research focus of autonomous entities has been coordination problems for autonomous robot swarms. Traditionally, robot models are used for algorithms that account for the minimum specifications needed to operate the swarm. However, these theoretical models also gloss over important practical details. Some of these details, such as time, have been considered before (as epochs of execution). In this dissertation, we examine these details in the context of several problems and introduce new performance measures to capture practical …

Optimization Of Real-Time Wireless Sensor Based Big Data With Deep Autoencoder Network: A Tourism Sector Application With Distributed Computing, Beki̇r Aksoy, Utku Kose

Turkish Journal of Electrical Engineering and Computer Sciences

Internet usage has increased rapidly with the development of information communication technologies. The increase in internet usage led to the growth of data volumes on the internet and the emergence of the big data concept. Therefore, it has become even more important to analyze the data and make it meaningful. In this study, 690 million queries and approximately 5.9 quadrillion data collected daily from different servers were recorded on the Redis servers by using real-time big data analysis method and load balance structure for a company operating in the tourism sector. Here, wireless networks were used as a triggering factor …

Distributed Iterative Graph Processing Using Nosql With Data Locality, Ayam Pokhrel

LSU Master's Theses

A tremendous amount of data is generated every day from a wide range of sources such as social networks, sensors, and application logs. Among them, graph data is one type that represents valuable relationships between various entities. Analytics of large graphs has become an essential part of business processes and scientific studies because it leads to deep and meaningful insights into the related domain based on the connections between various entities. However, the optimal processing of large-scale iterative graph computations is very challenging due to the issues like fault tolerance, high memory requirement, parallelization, and scalability. Most of the contemporary …

Distributed Knowledge Discovery For Diverse Data, Hossein Hamooni

Computer Science ETDs

In the era of new technologies, computer scientists deal with massive data of size hundreds of terabytes. Smart cities, social networks, health care systems, large sensor networks, etc. are constantly generating new data. It is non-trivial to extract knowledge from big datasets because traditional data mining algorithms run impractically on such big datasets. However, distributed systems have come to aid this problem while introducing new challenges in designing scalable algorithms. The transition from traditional algorithms to the ones that can be run on a distributed platform should be done carefully. Researchers should design the modern distributed algorithms based on the …

On Efficiency Of Distributed Password Recovery, Radek Hranický, Martin Holkovič, Petr Matoušek

Journal of Digital Forensics, Security and Law

One of the major challenges in digital forensics today is data encryption. Due to the leaked information about unlawful sniffing, many users decided to protect their data by encryption. In case of criminal activities, forensic experts are challenged how to decipher suspect's data that are subject to investigation. A common method how to overcome password-based protection is a brute force password recovery using GPU-accelerated hardware. This approach seems to be expensive. This paper presents an alternative approach using task distribution based on BOINC platform. The cost, time and energy efficiency of this approach is discussed and compared to the GPU-based …

Reconfigurable Technologies For Next Generation Internet And Cluster Computing, Deepak C. Unnikrishnan

Open Access Dissertations

Modern web applications are marked by distinct networking and computing characteristics. As applications evolve, they continue to operate over a large monolithic framework of networking and computing equipment built from general-purpose microprocessors and Application Specific Integrated Circuits (ASICs) that offers few architectural choices. This dissertation presents techniques to diversify the next-generation Internet infrastructure by integrating Field-programmable Gate Arrays (FPGAs), a class of reconfigurable integrated circuits, with general-purpose microprocessor-based techniques. Specifically, our solutions are demonstrated in the context of two applications - network virtualization and distributed cluster computing.

Network virtualization enables the physical network infrastructure to be shared among several …

Load Sharing Based On Moving Roles In Multiagent Systems, Şebnem Bora, Ali̇ Murat Ti̇ryaki̇, Oğuz Di̇kenelli̇

Turkish Journal of Electrical Engineering and Computer Sciences

In this paper, we present a load-sharing approach based on the refactoring of agents. According to our approach, the role(s) that makes an agent overloaded is identified and transferred to less loaded agents. The excess workload of this heavily loaded agent is then transferred to the new agent. This approach defines a new agent, called the ``monitor agent,'' which monitors the workload of agents in the organization and decides about the refactoring of the agents. The monitor agent uses the platform ontology, which explicitly describes the components of the agent organization, including agents and their roles, plans, and workloads. This …

3d Outside Cell Interference Factor For An Air-Ground Cdma ‘Cellular’ System, David W. Matolak

Faculty Publications

We compute the outside-cell interference factor of a code-division multiple-access (CDMA) system for a three-dimensional (3-D) air-to-ground (AG) "cellular-like" network consisting of a set of uniformly distributed ground base stations and airborne mobile users. The CDMA capacity is roughly inversely proportional to the outside-cell interference factor. It is shown that for the nearly free-space propagation environment of these systems, the outside-cell interference factor can be larger than that for terrestrial propagation models (as expected) and depends approximately logarithmically upon both the cell height and cell radius.