The application of a new PID autotuning method for the steam/water loop in large scale ships

In large scale ships, the most used controllers for the steam/water loop are still the proportional-integral-derivative (PID) controllers. However, the tuning rules for the PID parameters are based on empirical knowledge and the performance for the loops is not satisfying. In order to improve the control performance of the steam/water loop, the application of a recently developed PID autotuning method is studied. Firstly, a 'forbidden region' on the Nyquist plane can be obtained based on user-defined performance requirements such as robustness or gain margin and phase margin. Secondly, the dynamic of the system can be obtained with a sine test around the operation point. Finally, the PID controller's parameters can be obtained by locating the frequency response of the controlled system at the edge of the 'forbidden region'. To verify the effectiveness of the new PID autotuning method, comparisons are presented with other PID autotuning methods, as well as the model predictive control. The results show the superiority of the new PID autotuning method

Artificial and Natural Genetic Information Processing

Conventional methods of genetic engineering and more recent genome editing techniques focus on identifying genetic target sequences for manipulation. This is a result of historical concept of the gene which was also the main assumption of the ENCODE project designed to identify all functional elements in the human genome sequence. However, the theoretical core concept changed dramatically. The old concept of genetic sequences which can be assembled and manipulated like molecular bricks has problems in explaining the natural genome-editing competences of viruses and RNA consortia that are able to insert or delete, combine and recombine genetic sequences more precisely than random-like into cellular host organisms according to adaptational needs or even generate sequences de novo. Increasing knowledge about natural genome editing questions the traditional narrative of mutations (error replications) as essential for generating genetic diversity and genetic content arrangements in biological systems. This may have far-reaching consequences for our understanding of artificial genome editing

Practopoiesis: Or how life fosters a mind

The mind is a biological phenomenon. Thus, biological principles of organization should also be the principles underlying mental operations. Practopoiesis states that the key for achieving intelligence through adaptation is an arrangement in which mechanisms laying a lower level of organization, by their operations and interaction with the environment, enable creation of mechanisms lying at a higher level of organization. When such an organizational advance of a system occurs, it is called a traverse. A case of traverse is when plasticity mechanisms (at a lower level of organization), by their operations, create a neural network anatomy (at a higher level of organization). Another case is the actual production of behavior by that network, whereby the mechanisms of neuronal activity operate to create motor actions. Practopoietic theory explains why the adaptability of a system increases with each increase in the number of traverses. With a larger number of traverses, a system can be relatively small and yet, produce a higher degree of adaptive/intelligent behavior than a system with a lower number of traverses. The present analyses indicate that the two well-known traverses-neural plasticity and neural activity-are not sufficient to explain human mental capabilities. At least one additional traverse is needed, which is named anapoiesis for its contribution in reconstructing knowledge e.g., from long-term memory into working memory. The conclusions bear implications for brain theory, the mind-body explanatory gap, and developments of artificial intelligence technologies.Comment: Revised version in response to reviewer comment

Random graph ensembles with many short loops

Networks observed in the real world often have many short loops. This violates the tree-like assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible research routes to be explored in order to make progress on networks with many short loops, involving old and new random graph models and ideas for novel mathematical methods. We do not present conclusive solutions of problems, but aim to encourage and stimulate new activity and in what we believe to be an important but under-exposed area of research. We discuss in more detail the Strauss model, which can be seen as the `harmonic oscillator' of `loopy' random graphs, and a recent exactly solvable immunological model that involves random graphs with extensively many cliques and short loops.Comment: 18 pages, 10 figures,Mathematical Modelling of Complex Systems (Paris 2013) conferenc

Local Tomography of Large Networks under the Low-Observability Regime

This article studies the problem of reconstructing the topology of a network of interacting agents via observations of the state-evolution of the agents. We focus on the large-scale network setting with the additional constraint of $partial$ observations, where only a small fraction of the agents can be feasibly observed. The goal is to infer the underlying subnetwork of interactions and we refer to this problem as $local$ $tomography$. In order to study the large-scale setting, we adopt a proper stochastic formulation where the unobserved part of the network is modeled as an Erd\"{o}s-R\'enyi random graph, while the observable subnetwork is left arbitrary. The main result of this work is establishing that, under this setting, local tomography is actually possible with high probability, provided that certain conditions on the network model are met (such as stability and symmetry of the network combination matrix). Remarkably, such conclusion is established under the $low$-$observability$ $regime$, where the cardinality of the observable subnetwork is fixed, while the size of the overall network scales to infinity.Comment: To appear in IEEE Transactions on Information Theor