SBML qualitative models: a model representation format and infrastructure to foster interactions between qualitative modelling formalisms and tools.

BACKGROUND: Qualitative frameworks, especially those based on the logical discrete formalism, are increasingly used to model regulatory and signalling networks. A major advantage of these frameworks is that they do not require precise quantitative data, and that they are well-suited for studies of large networks. While numerous groups have developed specific computational tools that provide original methods to analyse qualitative models, a standard format to exchange qualitative models has been missing. RESULTS: We present the Systems Biology Markup Language (SBML) Qualitative Models Package ("qual"), an extension of the SBML Level 3 standard designed for computer representation of qualitative models of biological networks. We demonstrate the interoperability of models via SBML qual through the analysis of a specific signalling network by three independent software tools. Furthermore, the collective effort to define the SBML qual format paved the way for the development of LogicalModel, an open-source model library, which will facilitate the adoption of the format as well as the collaborative development of algorithms to analyse qualitative models. CONCLUSIONS: SBML qual allows the exchange of qualitative models among a number of complementary software tools. SBML qual has the potential to promote collaborative work on the development of novel computational approaches, as well as on the specification and the analysis of comprehensive qualitative models of regulatory and signalling networks.

Chronically connected? Internet use among adolescents with chronic conditions.

Little is known about Internet use among adolescents with chronic conditions (CCs). Our results indicate that CC females, but not males, are more likely to be heavy Internet users than their peers. CC youths are also more likely to visit health-related web sites, but less frequently than other sites.

The Poor Representation of the Poor in a Comparative Perspective

Due to diverging levels of political influence of various income groups, political institutions likely reflect¦the policy preferences of certain groups of citizens better than others, independently of their numerical¦weight. This runs counter the egalitarian principle of 'one citizen, one vote'. The present article documents¦a general trend of underrepresentation of the preferences of relatively poor citizens both by¦parties and by governments across Western democracies, although important cross-national differences¦exist.

Spatial learning by rats across visually disconnected environments

Two spatial tasks were designed to test specific properties of spatial representation in rats. In the first task, rats were trained to locate an escape hole at a fixed position in a visually homogeneous arena. This arena was connected with a periphery where a full view of the room environment existed. Therefore, rats were dependent on their memory trace of the previous position in the periphery to discriminate a position within the central region. Under these experimental conditions, the test animals showed a significant discrimination of the training position without a specific local view. In the second task, rats were trained in a radial maze consisting of tunnels that were transparent at their distal ends only. Because the central part of the maze was non-transparent, rats had to plan and execute appropriate trajectories without specific visual feedback from the environment. This situation was intended to encourage the reliance on prospective memory of the non-visited arms in selecting the following move. Our results show that acquisition performance was only slightly decreased compared to that shown in a completely transparent maze and considerably higher than in a translucent maze or in darkness. These two series of experiments indicate (1) that rats can learn about the relative position of different places with no common visual panorama, and (2) that they are able to plan and execute a sequence of visits to several places without direct visual feed-back about their relative position.

Unequal Representation of Age Groups in Switzerland

The representation of age groups is becoming an increasingly discussed topic in Swiss politics. In this study, we explore inequalities in the descriptive and substantive representation of various age groups and find that despite important disparities in descriptive representation, the policy preferences of various age groups are relatively equally represented in the lower house of the Swiss parliament. Our analysis thus suggests that even if it is gaining visibility, the age cleavage is not central for parliamentary representation in Switzerland.

More Money, Fewer Problems? Cross-Level Effects of Economic Deprivation on Political Representation

While equal political representation of all citizens is a fundamental democratic goal, it is hampered empirically in a multitude of ways. This study examines how the societal level of economic inequality affects the representation of relatively poor citizens by parties and governments. Using CSES survey data for citizens' policy preferences and expert placements of political parties, empirical evidence is found that in economically more unequal societies, the party system represents the preferences of relatively poor citizens worse than in more equal societies. This moderating effect of economic equality is also found for policy congruence between citizens and governments, albeit slightly less clear-cut.

The Sanskrit epics' representation of Vedic myths

Abstract: This book studies several mythical motifs, found in the Veda (especially in the Ùgveda) on the one hand and in one or both Sanskrit epics on the other: Agni's hiding, the theft of the Soma, Indra's rape of Ahalyå, Upamanyu's salvation by the Aßvins, and finally the representation of the Great War of the Mahåbhårata as a sacrifice. While it is often said that the subsequent Indian literature only paid "lipservice" to the Vedas without really knowing and even less understanding these texts, the present study not only shows that many Vedic myths are still kept alive in the Epics, but more importantly that their deep underlying meaning was perfectly understood by the epic mythmakers, and reactualized to fit the changed religious conditions of epic times. Résumé: Descriptif du livre Ce livre étudie plusieur motifs mythologiques qui se trouvent à la fois dans les Vedas (et spécialement dans le Ùgveda), et dans l'une ou l'autre des grandes épopées sanskrites, le Mahåbhårata et le Råmåyana. Ces motifs sont: la disparition d'Agni, le rapt du Soma, le viol d'Ahalyå par Indra, le sauvetage d'Upamanyu par les Aßvins, et enfin, la représentation de la grande guerre du Mahåbhårata comme un rite sacrificiel. On maintient souvent que la littérature plus tardive ne fait référence aux Vedas que pour la forme, sans pour autant réellement connaître et encore moins comprendre ces textes. Mais la présente étude montre tout au contraire que non seulement beaucoup de mythes védiques se retrouvent dans les épopées, mais encore ? ce qui est plus important ? que les mythographes de l'épopée avaient parfaitement compris leur sens profond, et l'avaient réactualisé pour répondre aux changements religieux de l'époque épique.

On solving fair exchange and related distributed problems in Byzantine environments

Abstract The solvability of the problem of fair exchange in a synchronous system subject to Byzantine failures is investigated in this work. The fair exchange problem arises when a group of processes are required to exchange digital items in a fair manner, which means that either each process obtains the item it was expecting or no process obtains any information on, the inputs of others. After introducing a novel specification of fair exchange that clearly separates safety and liveness, we give an overview of the difficulty of solving such a problem in the context of a fully-connected topology. On one hand, we show that no solution to fair exchange exists in the absence of an identified process that every process can trust a priori; on the other, a well-known solution to fair exchange relying on a trusted third party is recalled. These two results lead us to complete our system model with a flexible representation of the notion of trust. We then show that fair exchange is solvable if and only if a connectivity condition, named the reachable majority condition, is satisfied. The necessity of the condition is proven by an impossibility result and its sufficiency by presenting a general solution to fair exchange relying on a set of trusted processes. The focus is then turned towards a specific network topology in order to provide a fully decentralized, yet realistic, solution to fair exchange. The general solution mentioned above is optimized by reducing the computational load assumed by trusted processes as far as possible. Accordingly, our fair exchange protocol relies on trusted tamperproof modules that have limited communication abilities and are only required in key steps of the algorithm. This modular solution is then implemented in the context of a pedagogical application developed for illustrating and apprehending the complexity of fair exchange. This application, which also includes the implementation of a wide range of Byzantine behaviors, allows executions of the algorithm to be set up and monitored through a graphical display. Surprisingly, some of our results on fair exchange seem contradictory with those found in the literature of secure multiparty computation, a problem from the field of modern cryptography, although the two problems have much in common. Both problems are closely related to the notion of trusted third party, but their approaches and descriptions differ greatly. By introducing a common specification framework, a comparison is proposed in order to clarify their differences and the possible origins of the confusion between them. This leads us to introduce the problem of generalized fair computation, a generalization of fair exchange. Finally, a solution to this new problem is given by generalizing our modular solution to fair exchange