In the light of time

The concept of time is examined using the second law of thermodynamics that was recently formulated as an equation of motion. According to the statistical notion of increasing entropy, flows of energy diminish differences between energy densities that form space. The flow of energy is identified with the flow of time. The non-Euclidean energy landscape, i.e. the curved space–time, is in evolution when energy is flowing down along gradients and levelling the density differences. The flows along the steepest descents, i.e. geodesics are obtained from the principle of least action for mechanics, electrodynamics and quantum mechanics. The arrow of time, associated with the expansion of the Universe, identifies with grand dispersal of energy when high-energy densities transform by various mechanisms to lower densities in energy and eventually to ever-diluting electromagnetic radiation. Likewise, time in a quantum system takes an increment forwards in the detection-associated dissipative transformation when the stationary-state system begins to evolve pictured as the wave function collapse. The energy dispersal is understood to underlie causality so that an energy gradient is a cause and the resulting energy flow is an effect. The account on causality by the concepts of physics does not imply determinism; on the contrary, evolution of space–time as a causal chain of events is non-deterministic

Generating realistic scaled complex networks

Research on generative models is a central project in the emerging field of network science, and it studies how statistical patterns found in real networks could be generated by formal rules. Output from these generative models is then the basis for designing and evaluating computational methods on networks, and for verification and simulation studies. During the last two decades, a variety of models has been proposed with an ultimate goal of achieving comprehensive realism for the generated networks. In this study, we (a) introduce a new generator, termed ReCoN; (b) explore how ReCoN and some existing models can be fitted to an original network to produce a structurally similar replica, (c) use ReCoN to produce networks much larger than the original exemplar, and finally (d) discuss open problems and promising research directions. In a comparative experimental study, we find that ReCoN is often superior to many other state-of-the-art network generation methods. We argue that ReCoN is a scalable and effective tool for modeling a given network while preserving important properties at both micro- and macroscopic scales, and for scaling the exemplar data by orders of magnitude in size.Comment: 26 pages, 13 figures, extended version, a preliminary version of the paper was presented at the 5th International Workshop on Complex Networks and their Application

Going Deeper into Action Recognition: A Survey

Understanding human actions in visual data is tied to advances in complementary research areas including object recognition, human dynamics, domain adaptation and semantic segmentation. Over the last decade, human action analysis evolved from earlier schemes that are often limited to controlled environments to nowadays advanced solutions that can learn from millions of videos and apply to almost all daily activities. Given the broad range of applications from video surveillance to human-computer interaction, scientific milestones in action recognition are achieved more rapidly, eventually leading to the demise of what used to be good in a short time. This motivated us to provide a comprehensive review of the notable steps taken towards recognizing human actions. To this end, we start our discussion with the pioneering methods that use handcrafted representations, and then, navigate into the realm of deep learning based approaches. We aim to remain objective throughout this survey, touching upon encouraging improvements as well as inevitable fallbacks, in the hope of raising fresh questions and motivating new research directions for the reader

Modeling complex cellular systems: from differential equations to constraint-based models

In the beginning of the 20th century, scientists realized the necessity of purifying enzymes to unravel their mechanistic nature. A century and tremendous progresses in the natural sciences later, molecular and systems biology became fundamental pillars of modern biology. Moreover, natural scientists developed an increasing interest in theoretical models. In the first part of my thesis, I present my contribution to the field of studying the dynamics of biological phenomena. I present fundamental issues arising, when neglecting substrate inhibition in kinetic modeling. Furthermore, I describe a model that considers experimental data to simulate the transition of normal proliferating into cellular senescent cells. Since large-scaled models are more comprehensive, they commonly prohibit a mechanistic modeling approach. In order to analyze such models, nevertheless, constraint-based methods proved to be suitable tools. In the second part of my thesis, I contribute three studies to constraint-based modeling. I describe the established concept of elementary flux modes, which resemble non-decomposable and theoretically feasible pathways of metabolic networks. Subsequently, I present the analysis of the nitrogen metabolism network of Chlamydomonas reinhardtii with respect to circadian regulation, which gives rise to about three million elementary flux modes. In the last study, I present a comprehensive work on metabolic costs of amino acid and protein production in Escherichia coli. These costs were manually calculated as well as based on a flux balance analysis of an E. coli genome-scale metabolic model. Both approaches, either dynamic or constraint-based modeling, proved to be suitable strategies to describe biological processes at different levels. Whereas dynamic modeling allowed for a precise description of the temporal behavior of biological species, constraint-based modeling enabled studies, where the complexity of the investigated phenomena prohibits kinetic modeling

Silicon compilation

Silicon compilation is a term used for many different purposes. In this paper we define silicon compilation as a mapping from some higher level description into layout. We define the basic issues in structural and behavioral silicon compilation and some possible solutions to those issues. Finally, we define the concept of an intelligent silicon compiler in which the compiler evaluates the quality of the generated design and attempts to improve it if it is not satisfactory