Introduction to Khovanov Homologies. I. Unreduced Jones superpolynomial

An elementary introduction to Khovanov construction of superpolynomials. Despite its technical complexity, this method remains the only source of a definition of superpolynomials from the first principles and therefore is important for development and testing of alternative approaches. In this first part of the review series we concentrate on the most transparent and unambiguous part of the story: the unreduced Jones superpolynomials in the fundamental representation and consider the 2-strand braids as the main example. Already for the 5_1 knot the unreduced superpolynomial contains more items than the ordinary Jones.Comment: 33 page

Using genetic algorithms to generate test sequences for complex timed systems

The generation of test data for state based specifications is a computationally expensive process. This problem is magnified if we consider that time con- straints have to be taken into account to govern the transitions of the studied system. The main goal of this paper is to introduce a complete methodology, sup- ported by tools, that addresses this issue by represent- ing the test data generation problem as an optimisa- tion problem. We use heuristics to generate test cases. In order to assess the suitability of our approach we consider two different case studies: a communication protocol and the scientific application BIPS3D. We give details concerning how the test case generation problem can be presented as a search problem and automated. Genetic algorithms (GAs) and random search are used to generate test data and evaluate the approach. GAs outperform random search and seem to scale well as the problem size increases. It is worth to mention that we use a very simple fitness function that can be eas- ily adapted to be used with other evolutionary search techniques

Integrated Information in Discrete Dynamical Systems: Motivation and Theoretical Framework

This paper introduces a time- and state-dependent measure of integrated information, φ, which captures the repertoire of causal states available to a system as a whole. Specifically, φ quantifies how much information is generated (uncertainty is reduced) when a system enters a particular state through causal interactions among its elements, above and beyond the information generated independently by its parts. Such mathematical characterization is motivated by the observation that integrated information captures two key phenomenological properties of consciousness: (i) there is a large repertoire of conscious experiences so that, when one particular experience occurs, it generates a large amount of information by ruling out all the others; and (ii) this information is integrated, in that each experience appears as a whole that cannot be decomposed into independent parts. This paper extends previous work on stationary systems and applies integrated information to discrete networks as a function of their dynamics and causal architecture. An analysis of basic examples indicates the following: (i) φ varies depending on the state entered by a network, being higher if active and inactive elements are balanced and lower if the network is inactive or hyperactive. (ii) φ varies for systems with identical or similar surface dynamics depending on the underlying causal architecture, being low for systems that merely copy or replay activity states. (iii) φ varies as a function of network architecture. High φ values can be obtained by architectures that conjoin functional specialization with functional integration. Strictly modular and homogeneous systems cannot generate high φ because the former lack integration, whereas the latter lack information. Feedforward and lattice architectures are capable of generating high φ but are inefficient. (iv) In Hopfield networks, φ is low for attractor states and neutral states, but increases if the networks are optimized to achieve tension between local and global interactions. These basic examples appear to match well against neurobiological evidence concerning the neural substrates of consciousness. More generally, φ appears to be a useful metric to characterize the capacity of any physical system to integrate information

Reaction rates and transport in neutron stars

Understanding signals from neutron stars requires knowledge about the transport inside the star. We review the transport properties and the underlying reaction rates of dense hadronic and quark matter in the crust and the core of neutron stars and point out open problems and future directions.Comment: 74 pages; commissioned for the book "Physics and Astrophysics of Neutron Stars", NewCompStar COST Action MP1304; version 3: minor changes, references updated, overview graphic added in the introduction, improvements in Sec IV.A.

Towards a quantum probability theory of similarity judgments

We review recent progress in understanding similarity judgments in cognition by means of quantum probability theory (QP) models. We begin by outlining some features of similarity judgments that have proven difficult to model by traditional approaches. We then briefly present a model of similarity judgments based on QP, and show how it can solve many of the problems faced by traditional approaches. Finally we look at some areas where the quantum model is currently less satisfactory, and discuss some open questions and areas for further work

A proposal for a coordinated effort for the determination of brainwide neuroanatomical connectivity in model organisms at a mesoscopic scale

In this era of complete genomes, our knowledge of neuroanatomical circuitry remains surprisingly sparse. Such knowledge is however critical both for basic and clinical research into brain function. Here we advocate for a concerted effort to fill this gap, through systematic, experimental mapping of neural circuits at a mesoscopic scale of resolution suitable for comprehensive, brain-wide coverage, using injections of tracers or viral vectors. We detail the scientific and medical rationale and briefly review existing knowledge and experimental techniques. We define a set of desiderata, including brain-wide coverage; validated and extensible experimental techniques suitable for standardization and automation; centralized, open access data repository; compatibility with existing resources, and tractability with current informatics technology. We discuss a hypothetical but tractable plan for mouse, additional efforts for the macaque, and technique development for human. We estimate that the mouse connectivity project could be completed within five years with a comparatively modest budget.Comment: 41 page

Ecology: a prerequisite for malaria elimination and eradication

* Existing front-line vector control measures, such as insecticide-treated nets and residual sprays, cannot break the transmission cycle of Plasmodium falciparum in the most intensely endemic parts of Africa and the Pacific * The goal of malaria eradication will require urgent strategic investment into understanding the ecology and evolution of the mosquito vectors that transmit malaria * Priority areas will include understanding aspects of the mosquito life cycle beyond the blood feeding processes which directly mediate malaria transmission * Global commitment to malaria eradication necessitates a corresponding long-term commitment to vector ecolog