Evolving quorum sensing in digital organisms

For centuries it was thought that bacteria live asocial lives. However, recent discoveries show many species of bacteria communicate in order to perform tasks previously thought to be limited to multicellular organisms. Central to this capability is quorum sensing, whereby organisms detect cell density and use this information to trigger group behaviors. Quorum sensing is used by bacteria in the formation of biofilms, secretion of digestive enzymes and, in the case of pathogenic bacteria, release of toxins or other virulence factors. Indeed, methods to disrupt quorum sensing are currently being investigated as possible treatments for numerous diseases, including cystic fibrosis, epidemic cholera, and methicillin-resistant Staphylococcus aureus. In this paper we demonstrate the evolution of a quorum sensing behavior in populations of digital organisms. Specifically, we show that digital organisms are capable of evolving a strategy to collectively suppress self-replication, when the population density reaches a specific, evolved threshold. We present the evolved genome of an organism exhibiting this behavior and analyze the collective operation of this “algorithm. ” Finally, through a set of experiments we demonstrate that the behavior scales to populations up to 400 times larger than those in which the behavior evolved

Measuring the global 21-cm signal with the MWA-II: improved characterisation of lunar-reflected radio frequency interference

Radio interferometers can potentially detect the sky-averaged signal from the Cosmic Dawn (CD) and the Epoch of Reionisation (EoR) by studying the Moon as a thermal block to the foreground sky. The first step is to mitigate the Earth-based RFI reflections (Earthshine) from the Moon, which significantly contaminate the FM band $\approx 88-110$ MHz, crucial to CD-EoR science. We analysed MWA phase-I data from $72-180$ MHz at $40$ kHz resolution to understand the nature of Earthshine over three observing nights. We took two approaches to correct the Earthshine component from the Moon. In the first method, we mitigated the Earthshine using the flux density of the two components from the data, while in the second method, we used simulated flux density based on an FM catalogue to mitigate the Earthshine. Using these methods, we were able to recover the expected Galactic foreground temperature of the patch of sky obscured by the Moon. We performed a joint analysis of the Galactic foregrounds and the Moon's intrinsic temperature $(T_{\rm Moon})$ while assuming that the Moon has a constant thermal temperature throughout three epochs. We found $T_{\rm Moon}$ to be at $184.40\pm{2.65}\rm ~K$ and $173.77\pm{2.48}\rm ~K$ using the first and the second methods, respectively, and the best-fit values of the Galactic spectral index $(\alpha)$ were found to be within the $5\%$ uncertainty level when compared with the global sky model. Compared with our previous work, these results improved constraints on the Galactic spectral index and the Moon's intrinsic temperature. We also simulated the Earthshine at the MWA between November-December 2023 to find suitable observing times less affected by the Earthshine. Such time windows can be used to schedule future observations of CD-EoR using the MWA.Comment: 17 pages, 14 figures and 5 tables, submitted to PAS

Investigating whether HyperNEAT produces modular neural networks

HyperNEAT represents a class of neuroevolutionary algorithms that captures some of the power of natural development with a computationally efficient high-level abstraction of development. This class of algorithms is intended to provide many of the desirable properties produced in biological phenotypes by natural developmental processes, such as regularity, modularity and hierarchy. While it has been previously shown that HyperNEAT produces regular artificial neural network (ANN) phenotypes, in this paper we investigated the open question of whether HyperNEAT can produce modular ANNs. We conducted such research on problems where modularity should be beneficial, and found that HyperNEAT failed to generate modular ANNs. We then imposed modularity on HyperNEAT’s phenotypes and its performance improved, demonstrating that modularity increases performance on this problem. We next tested two techniques to encourage modularity in HyperNEAT, but did not observe an increase in either modularity or performance. Finally, we conducted tests on a simpler problem that requires modularity and found that HyperNEAT was able to rapidly produce modular solutions that solved the problem. We therefore present the first documented case of HyperNEAT producing a modular phenotype, but our inability to encourage modularity on harder problems where modularity would have been beneficial suggests that more work is needed to increase the likelihood that HyperNEAT and similar algorithms produce modular ANNs in response to challenging, decomposable problems

Automatically generating adaptive logic to balance non-functional tradeoffs during reconfiguration

Increasingly, high-assurance software systems apply selfreconfiguration in order to satisfy changing functional and non-functional requirements. Most self-reconfiguration approaches identify a target system configuration to provide the desired system behavior, then apply a series of reconfiguration instructions to reach the desired target configuration. Collectively, these reconfiguration instructions define an adaptation path. Although multiple satisfying adaptation paths may exist, most self-reconfiguration approaches select adaptation paths based on a single criterion, such as minimizing reconfiguration cost. However, different adaptation paths may represent tradeoffs between reconfiguration costs and other criteria, such as performance and reliability. This paper introduces an evolutionary computationbased approach to automatically evolve adaptation paths that safely transition an executing system from its current configuration to its desired target configuration, while balancing tradeoffs between functional and non-functional requirements. The proposed approach can be applied both at design time to generate suites of adaptation paths, as well as at run time to evolve safe adaptation paths to handle changing system and environmental conditions. We demonstrate the effectiveness of this approach by applying it to the dynamic reconfiguration of a collection of remote data mirrors, with the goal of minimizing reconfiguration costs while maximizing reconfiguration performance and reliability