Impact of parameter control on the performance of APSO and PSO algorithms for the CSTHTS problem: An improvement in algorithmic structure and results

Cascaded Short Term Hydro-Thermal Scheduling problem (CSTHTS) is a single objective, non-linear multi-modal or convex (depending upon the cost function of thermal generation) type of Short Term Hydro-Thermal Scheduling (STHTS), having complex hydel constraints. It has been solved by many metaheuristic optimization algorithms, as found in the literature. Recently, the authors have published the best-achieved results of the CSTHTS problem having quadratic fuel cost function of thermal generation using an improved variant of the Accelerated PSO (APSO) algorithm, as compared to the other previously implemented algorithms. This article discusses and presents further improvement in the results obtained by both improved variants of APSO and PSO algorithms, implemented on the CSTHTS problem.

Geometric Variational Inference

Efficiently accessing the information contained in non-linear and high dimensional probability distributions remains a core challenge in modern statistics. Traditionally, estimators that go beyond point estimates are either categorized as Variational Inference (VI) or Markov-Chain Monte-Carlo (MCMC) techniques. While MCMC methods that utilize the geometric properties of continuous probability distributions to increase their efficiency have been proposed, VI methods rarely use the geometry. This work aims to fill this gap and proposes geometric Variational Inference (geoVI), a method based on Riemannian geometry and the Fisher information metric. It is used to construct a coordinate transformation that relates the Riemannian manifold associated with the metric to Euclidean space. The distribution, expressed in the coordinate system induced by the transformation, takes a particularly simple form that allows for an accurate variational approximation by a normal distribution. Furthermore, the algorithmic structure allows for an efficient implementation of geoVI which is demonstrated on multiple examples, ranging from low-dimensional illustrative ones to non-linear, hierarchical Bayesian inverse problems in thousands of dimensions.

NEURO-FUZZY CLASSIFIER OF STATE OF THE TECHNOLOGICAL PROCESS

The algorithmic structure of the classifier of the state of the technological process is proposed, which provides processing of data coming through several channels of information support of the cyberphysical system. The structure contains an ensemble of deep recurrent neural networks and an output hybrid neural network. The ensemble solves the regression problems for information channels, and the output network serves for their generalization and classification based on fuzzy logic methods. The proposed hybrid architecture makes it possible to take advantage of two methodologies for constructing neural networks – to perform a retrospective analysis of time series using the DRNN ensemble and to generalize the results of their work by the ANFIS system. The structure of the software developed for simulation experiments is described and their results are presented.

On Algorithmic Descriptions and Software Implementations for Multi-objective Optimisation: A Comparative Study

Multi-objective optimisation is a prominent subfield of optimisation with high relevance in real-world problems, such as engineering design. Over the past 2 decades, a multitude of heuristic algorithms for multi-objective optimisation have been introduced and some of them have become extremely popular. Some of the most promising and versatile algorithms have been implemented in software platforms. This article experimentally investigates the process of interpreting and implementing algorithms by examining multiple popular implementations of three well-known algorithms for multi-objective optimisation. We observed that official and broadly employed software platforms interpreted and thus implemented the same heuristic search algorithm differently. These different interpretations affect the algorithmic structure as well as the software implementation. Numerical results show that these differences cause statistically significant differences in performance.

Computational Visualization for Critical Thinking

This paper looks back at historical precedents for how computational systems and ideas have been visualized as a means of access to and engagement with a broader audience, and to develop a new more tangible language to address abstraction. These precedents share a subversive ground in using a visual language to provoke new ways of engaging with about complex ideas. Two new approaches to visualizing algorithmic systems are proposed for the emerging context of algorithmic ethics in society, looking at prototypical algorithms in computer vision and machine learning systems, to think through the meaning created by algorithmic structure and process. The aim is to use visual design to provoke new kinds of thinking and criticality that can offer opportunities to address algorithms in their increasingly more politicized role today. These new approaches are developed from an arts research perspective to support critical thinking and arts knowledge through creative coding and interactive design.

An Optimisation-Driven Prediction Method for Automated Diagnosis and Prognosis

This article presents a novel hybrid classification paradigm for medical diagnoses and prognoses prediction. The core mechanism of the proposed method relies on a centroid classification algorithm whose logic is exploited to formulate the classification task as a real-valued optimisation problem. A novel metaheuristic combining the algorithmic structure of Swarm Intelligence optimisers with the probabilistic search models of Estimation of Distribution Algorithms is designed to optimise such a problem, thus leading to high-accuracy predictions. This method is tested over 11 medical datasets and compared against 14 cherry-picked classification algorithms. Results show that the proposed approach is competitive and superior to the state-of-the-art on several occasions.

Model genotype–phenotype mappings and the algorithmic structure of evolution

Cancers are complex dynamic systems that undergo evolution and selection. Personalized medicine approaches in the clinic increasingly rely on predictions of tumour response to one or more therapies; these predictions are complicated by the inevitable evolution of the tumour. Despite enormous amounts of data on the mutational status of cancers and numerous therapies developed in recent decades to target these mutations, many of these treatments fail after a time due to the development of resistance in the tumour. The emergence of these resistant phenotypes is not easily predicted from genomic data, since the relationship between genotypes and phenotypes, termed the genotype–phenotype (GP) mapping, is neither injective nor functional. We present a review of models of this mapping within a generalized evolutionary framework that takes into account the relation between genotype, phenotype, environment and fitness. Different modelling approaches are described and compared, and many evolutionary results are shown to be conserved across studies despite using different underlying model systems. In addition, several areas for future work that remain understudied are identified, including plasticity and bet-hedging. The GP-mapping provides a pathway for understanding the potential routes of evolution taken by cancers, which will be necessary knowledge for improving personalized therapies.

Secure and Efficient Hybrid Random Number Generator Based on Sponge Constructions for Cryptographic Applications

Random numbers constitute the most important part of many applications and have a vital importance in the security of these applications, especially in cryptography. Therefore, there is a need for secure random numbers to provide their security. This study is concerned with the development of a secure and efficient random number generator that is primarily intended for cryptographic applications. The generator consists of two subsystems. The first is algorithmic structure, Keccak, which is the latest standard for hash functions. The structure provides to generate secure random numbers. The second is additional input that generates with ring oscillators that are implemented on the FPGA. The additional inputs prevent reproduction and prediction of the subsequent random numbers. It is shown that the proposed generator is satisfies security requirements for cryptographic applications. In addition, NIST 800-22 test suite and autocorrelation test are used to demonstrate that generated random numbers have no statistical weaknesses and relationship among itself, respectively. Successful results from these tests show that generated numbers have no statistical weaknesses. Moreover, important advantage of the proposed generator is that it is more efficient than existing RNGs in the literature.