Slime mould algorithm: A new method for stochastic optimization

Deep Convolutional Neural Network (CNN) is a special type of Neural Networks, which has shown exemplary performance on several competitions related to Computer Vision and Image Processing. Some of the exciting application areas of CNN include Image Classification and Segmentation, Object Detection, Video Processing, Natural Language Processing, and Speech Recognition. The powerful learning ability of deep CNN is primarily due to the use of multiple feature extraction stages that can automatically learn representations from the data. The availability of a large amount of data and improvement in the hardware technology has accelerated the research in CNNs, and recently interesting deep CNN architectures have been reported. Several inspiring ideas to bring advancements in CNNs have been explored, such as the use of different activation and loss functions, parameter optimization, regularization, and architectural innovations. However, the significant improvement in the representational capacity of the deep CNN is achieved through architectural innovations. Notably, the ideas of exploiting spatial and channel information, depth and width of architecture, and multi-path information processing have gained substantial attention. Similarly, the idea of using a block of layers as a structural unit is also gaining popularity. This survey thus focuses on the intrinsic taxonomy present in the recently reported deep CNN architectures and, consequently, classifies the recent innovations in CNN architectures into seven different categories. These seven categories are based on spatial exploitation, depth, multi-path, width, feature-map exploitation, channel boosting, and attention. Additionally, the elementary understanding of CNN components, current challenges, and applications of CNN are also provided.

https://link.springer.com/content/pdf/10.1007/s10462-020-09825-6.pdf

A survey of the recent architectures of deep convolutional neural networks

Context Electroencephalography (EEG) is a complex signal and can require several years of training, as well as advanced signal processing and feature extraction methodologies to be correctly interpreted. Recently, deep learning (DL) has shown great promise in helping make sense of EEG signals due to its capacity to learn good feature representations from raw data. Whether DL truly presents advantages as compared to more traditional EEG processing approaches, however, remains an open question. Objective In this work, we review 154 papers that apply DL to EEG, published between January 2010 and July 2018, and spanning different application domains such as epilepsy, sleep, brain-computer interfacing, and cognitive and affective monitoring. We extract trends and highlight interesting approaches from this large body of literature in order to inform future research and formulate recommendations. Methods Major databases spanning the fields of science and engineering were queried to identify relevant studies published in scientific journals, conferences, and electronic preprint repositories. Various data items were extracted for each study pertaining to (1) the data, (2) the preprocessing methodology, (3) the DL design choices, (4) the results, and (5) the reproducibility of the experiments. These items were then analyzed one by one to uncover trends. Results Our analysis reveals that the amount of EEG data used across studies varies from less than ten minutes to thousands of hours, while the number of samples seen during training by a network varies from a few dozens to several millions, depending on how epochs are extracted. Interestingly, we saw that more than half the studies used publicly available data and that there has also been a clear shift from intra-subject to inter-subject approaches over the last few years. About [Formula: see text] of the studies used convolutional neural networks (CNNs), while [Formula: see text] used recurrent neural networks (RNNs), most often with a total of 3-10 layers. Moreover, almost one-half of the studies trained their models on raw or preprocessed EEG time series. Finally, the median gain in accuracy of DL approaches over traditional baselines was [Formula: see text] across all relevant studies. More importantly, however, we noticed studies often suffer from poor reproducibility: a majority of papers would be hard or impossible to reproduce given the unavailability of their data and code. Significance To help the community progress and share work more effectively, we provide a list of recommendations for future studies and emphasize the need for more reproducible research. We also make our summary table of DL and EEG papers available and invite authors of published work to contribute to it directly. A planned follow-up to this work will be an online public benchmarking portal listing reproducible results.

https://iopscience.iop.org/article/10.1088/1741-2552/ab260c/pdf

Deep learning-based electroencephalography analysis: a systematic review.

Deep learning--based models have surpassed classical machine learning--based approaches in various text classification tasks, including sentiment analysis, news categorization, question answering, and natural language inference. In this article, we provide a comprehensive review of more than 150 deep learning--based models for text classification developed in recent years, and we discuss their technical contributions, similarities, and strengths. We also provide a summary of more than 40 popular datasets widely used for text classification. Finally, we provide a quantitative analysis of the performance of different deep learning models on popular benchmarks, and we discuss future research directions.

Deep Learning--based Text Classification: A Comprehensive Review

Many swarm optimization algorithms have been introduced since the early 60’s, Evolutionary Programming to the most recent, Grey Wolf Optimization. All of these algorithms have demonstrated their potential to solve many optimization problems. This paper provides an in-depth survey of well-known optimization algorithms. Selected algorithms are briefly explained and compared with each other comprehensively through experiments conducted using thirty well-known benchmark functions. Their advantages and disadvantages are also discussed. A number of statistical tests are then carried out to determine the significant performances. The results indicate the overall advantage of Differential Evolution (DE) and is closely followed by Particle Swarm Optimization (PSO), compared with other considered approaches.

/pdf/a-comprehensive-review-of-swarm-optimization-algorithms-34u47p9l9e.pdf

A Comprehensive Review of Swarm Optimization Algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Two key components contribute to task completion time: execution cost and communication cost. The communication cost is induced by data transfers from one task to another residing on separate nodes. To reduce communication cost, interdependent tasks are allocated to closely located nodes. However, once tasks are allocated, nodes can move within a Grid. The node mobility within a Grid can increase communication distance and may result into multi-hop communication between nodes executing dependent tasks. The multi-hop communication increases communication cost and thus task completion time. In order to avoid multi-hop communication between dependent tasks, we have developed an adaptive and distance-based resource allocation scheme which exploits the characteristics of an application and nodes, and applies migration heuristics to reduce communication cost. The scheme is validated in a simulated environment using various workloads and parameters.

Adaptive resource allocation in mobile ad hoc computational grids

Two key components contribute to task completion time: execution cost and communication cost. The communication cost is induced by data transfers between tasks residing on separate nodes. The communication is always expensive and unreliable in mobile ad hoc Grids and therefore plays a critical role in application performance. To reduce communication cost, interdependent tasks are allocated to nodes located close to one another. However, once the tasks have been allocated, nodes can move within a Grid. The movement of nodes within a Grid may result in multi-hop communication between nodes executing dependent tasks.  In order to deal with node mobility within a Grid, an effective resource allocation scheme is required, but the design of such a scheme for mobile ad hoc computational Grids is challenging due to the constrained communication environment, node mobility, and infrastructure-less network environment. In this paper, we have developed an adaptive and distance-based resource allocation scheme which takes into account the characteristics of an application and nodes and applies migration heuristics to address the local node mobility problem. The scheme is validated in a simulated environment using various workloads and parameters. DOI: http://dx.doi.org/10.5755/j01.itc.41.4.877

/pdf/an-adaptive-distance-based-resource-allocation-scheme-for-1sd1oiz8qf.pdf

An Adaptive Distance-based Resource Allocation Scheme for Interdependent Tasks in Mobile Ad Hoc Computational Grids

Mobile ad hoc computational Grids are characterized by unreliable and dynamic communication environment. The bandwidth at different network portions varies over the time and different nodes often experience different connection quality at the same time due to traffic load and constrained communication environment. Therefore, an effective and robust resource allocation scheme should consider connection quality between nodes in addition to other factors such as transmission power, processing speed and task size. In this paper, two resource allocation schemes are described with their pros and cons. The first resource scheme exploits transmission power control mechanism in order to improve energy efficiency and network capacity whereas the second resource allocation scheme takes into account the connection quality and traffic load in order to reduce data transfer time. The relationship between data transfer time and transmission energy consumption has also been investigated in detail. The schemes are validated in a simulated environment using various workloads and parameters.

Network Aware Resource Allocation Scheme for Mobile Ad Hoc Computational Grid

요 약 문 Satellite Based Augmentation Systems (SBAS) broadcast standard correction messages for aiding GNSS receivers. The SBAS implementation is envisaged under Development Wide Area Differential GNSS (WA-DGNSS) Systems project. WA-DGNSS correction messages are meant to provide an extensive set of information on corrections along with the confidence bounds. The end-user receiver should decode and interpret these messages every second. An individual message is composed of 250 bits. This levies strict limitation on information carrying capacity of each message. Therefore all correction information is distributed into several interconnected messages and each message is designed to carry certain portion of the corrections. It is responsibility of the end-user receiver not only to decode and interpret a message but also interconnect with other messages in order to obtain complete set of corrections.

/pdf/processing-of-wa-dgnss-correction-messages-a-functional-5g1o2706e0.pdf

Wan Sik Choi

Papers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Adaptive resource allocation in mobile ad hoc computational grids

An Adaptive Distance-based Resource Allocation Scheme for Interdependent Tasks in Mobile Ad Hoc Computational Grids

Network Aware Resource Allocation Scheme for Mobile Ad Hoc Computational Grid

Processing of WA-DGNSS Correction Messages: A Functional Perspective