Complexity Analysis of Multilayer Perceptron Neural Network Embedded into a Wireless Sensor Network

AbstractThis paper presents computational and message complexity analysis for a multi-layer perceptron neural network, which is implemented in fully distributed and parallel form across a wireless sensor network. Wireless sensor networks offer a promising platform for parallel and distributed neurocomputing as well as potentially benefiting from artificial neural networks for enhancing their adaptation abilities and computational intelligence. Multilayer perceptron (MLP) neural networks are generic function approximators and classifiers with countless domain-specific applications as reported in the literature. Accordingly, embedding a multilayer perceptron neural network in a wireless sensor network in parallel and distributed mode offers synergy and is very promising. Accordingly, assessing the computational and communication complexity of such hybrid designs, namely an artificial neural network such as a multilayer perceptron network embedded within a wireless sensor network, of interest. This paper presents bounds and results of empirical study on the time, space and message complexity aspects of a wireless sensor network and multilayer perceptron neural network design

Cognitive Model for Image Sensor Motion Control

This paper presents a neurobiology and cognitive psychology inspired model, implemented using a neural-network-like parallel computational strategy. The goal of the model is to show how a visual cortex inspired system can control camera alignment using a given camera hardware setup, in a similar way to the brain´s controlling eye movements. The system (computational model and camera hardware) are integrated into an experimental environment, the Intelligent Space, a room of ubiquitous computing. The intelligent space is based on several Distributed Intelligent Network Devices (DIND). A DIND has a sensor input, integrated intelligence and a communication interface. The model presented in this paper serves as the integrated intelligence component of a particular DIND. The proposed model implemented in a parallel hardware performs real time operation

Adaptive Parallel Iterative Deepening Search

Many of the artificial intelligence techniques developed to date rely on heuristic search through large spaces. Unfortunately, the size of these spaces and the corresponding computational effort reduce the applicability of otherwise novel and effective algorithms. A number of parallel and distributed approaches to search have considerably improved the performance of the search process. Our goal is to develop an architecture that automatically selects parallel search strategies for optimal performance on a variety of search problems. In this paper we describe one such architecture realized in the Eureka system, which combines the benefits of many different approaches to parallel heuristic search. Through empirical and theoretical analyses we observe that features of the problem space directly affect the choice of optimal parallel search strategy. We then employ machine learning techniques to select the optimal parallel search strategy for a given problem space. When a new search task is input to the system, Eureka uses features describing the search space and the chosen architecture to automatically select the appropriate search strategy. Eureka has been tested on a MIMD parallel processor, a distributed network of workstations, and a single workstation using multithreading. Results generated from fifteen puzzle problems, robot arm motion problems, artificial search spaces, and planning problems indicate that Eureka outperforms any of the tested strategies used exclusively for all problem instances and is able to greatly reduce the search time for these applications

Parallel and Distributed Computing for High-Performance Applications

The study of parallel and distributed computing has become an important area in computer science because it makes it possible to create high-performance software that can effectively handle challenging computational tasks. In terms of their use in the world of high-performance applications, parallel and distributed computing techniques are given a thorough introduction in this study. The partitioning of computational processes into smaller subtasks that may be completed concurrently on numerous processors or computers is the core idea underpinning parallel and distributed computing. This strategy enables quicker execution times and enhanced performance in general. Parallel and distributed computing are essential for high-performance applications like scientific simulations, data analysis, and artificial intelligence since they frequently call for significant computational resources. High-performance apps are able to effectively handle computationally demanding tasks thanks in large part to parallel and distributed computing. This article offers a thorough review of the theories, methods, difficulties, and developments in parallel and distributed computing for high-performance applications. Researchers and practitioners may fully utilize the potential of parallel and distributed computing to open up new vistas in computational science and engineering by comprehending the underlying concepts and utilizing the most recent breakthroughs

Parallel Toolkit for Measuring the Quality of Network Community Structure

Many networks display community structure which identifies groups of nodes within which connections are denser than between them. Detecting and characterizing such community structure, which is known as community detection, is one of the fundamental issues in the study of network systems. It has received a considerable attention in the last years. Numerous techniques have been developed for both efficient and effective community detection. Among them, the most efficient algorithm is the label propagation algorithm whose computational complexity is O(|E|). Although it is linear in the number of edges, the running time is still too long for very large networks, creating the need for parallel community detection. Also, computing community quality metrics for community structure is computationally expensive both with and without ground truth. However, to date we are not aware of any effort to introduce parallelism for this problem. In this paper, we provide a parallel toolkit to calculate the values of such metrics. We evaluate the parallel algorithms on both distributed memory machine and shared memory machine. The experimental results show that they yield a significant performance gain over sequential execution in terms of total running time, speedup, and efficiency.Comment: 8 pages; in Network Intelligence Conference (ENIC), 2014 Europea

Applications of Evolutionary Computation

This book constitutes the refereed conference proceedings of the 18th International Conference on the Applications of Evolutionary Computation, EvoApplications 2015, held in Copenhagen, Spain, in April 2015, colocated with the Evo* 2015 events EuroGP, EvoCOP, and EvoMUSART. The 72 revised full papers presented were carefully reviewed and selected from 125 submissions. EvoApplications 2015 consisted of the following 13 tracks: EvoBIO (evolutionary computation, machine learning and data mining in computational biology), EvoCOMNET (nature-inspired techniques for telecommunication networks and other parallel and distributed systems), EvoCOMPLEX (evolutionary algorithms and complex systems), EvoENERGY (evolutionary computation in energy applications), EvoFIN (evolutionary and natural computation in finance and economics), EvoGAMES (bio-inspired algorithms in games), EvoIASP (evolutionary computation in image analysis, signal processing, and pattern recognition), EvoINDUSTRY (nature-inspired techniques in industrial settings), EvoNUM (bio-inspired algorithms for continuous parameter optimization), EvoPAR (parallel implementation of evolutionary algorithms), EvoRISK (computational intelligence for risk management, security and defence applications), EvoROBOT (evolutionary computation in robotics), and EvoSTOC (evolutionary algorithms in stochastic and dynamic environments)