1,720,985 research outputs found
Proposal for an Organic Web, The missing link between the Web and the Semantic Web, Part 1
Get PDFA huge amount of information is produced in digital form. The Semantic Web
stems from the realisation that dealing efficiently with this production
requires getting better at interlinking digital informational resources
together. Its focus is on linking data. Linking data isn't enough. We need to
provide infrastructural support for linking all sorts of informational
resources including resources whose understanding and fine interlinking
requires domain-specific human expertise. At times when many problems scale to
planetary dimensions, it is essential to scale coordination of information
processing and information production, without giving up on expertise and depth
of analysis, nor forcing languages and formalisms onto thinkers,
decision-makers and innovators that are only suitable to some forms of
intelligence. This article makes a proposal in this direction and in line with
the idea of interlinking championed by the Semantic Web.Comment: Supplementary material by Guillaume Bouzige and Mathilde Noua
On update schedules and dynamics of Boolean networks
No full textGraduate internship repport supervised by Julio Aracena (rapport de stage de Master 1 dirigé par Julio Aracena)The dynamical properties of a Boolean network rely on several different parameters. In this document, we focus on three of them which are very closely tied to the definition itself of a Boolean network: the structure of a network, the type of local activation functions, and the update schedules. In other words, the dependencies between the elements of a network, the way each one of these elements is activated as a function of the other elements of the network and the order according to which the states of the elements of the network are updated.The central question of the work presented relates to the idea of the robustness of a Boolean network with respect to perturbations of its update schedule
Updating Automata Networks
No full textCette thèse s'intéresse aux évènements et aux ordonnancements d'évènements se produisant au sein de réseaux d'éléments conceptuels prédéterminés. Dans ces réseaux, les éléments, appelés plutôt "automates", s'incitent les uns les autres à changer d'état en accord avec des règles prédéfinies qui, précisément, définissent le (fonctionnement du) réseau. Lorsqu'un automate se conforme effectivement aux influences qu'il reçoit de la part des autres, on dit que son état est mis à jour. Les évènements élémentaires considérés sont les changements d'états des automates. Définir un mode de mise à jour pour l'ensemble des automates d'un réseau permet de sélectionner certains évènements parmi l'ensemble de ceux qui sont a priori possibles. Cela permet aussi d'organiser et d'ordonner les évènements les uns par rapport aux autres de façon, par exemple, à imposer que des évènements indépendants se produisent simultanément ou simplement, de manière assez rapprochée pour qu'aucun autre événement ne puisse se produire pendant leur occurrence. Informellement, les modes de mise à jour peuvent donc être interprétés comme l'expression d'influences extérieures au réseau interdisant certains changements, ou alors comme la formalisation d'une version relâchée et relative de l'écoulement de temps. Cette thèse propose d'étudier leur influence sur le comportement des réseaux. Et afin de distinguer cette influence de celle de la structure des réseaux, elle commence par mettre en évidence le rôle de certains motifs structurels. Après ça, elle s'intéresse en particulier à l'information "encodée" dans une séquence de mises à jour et à l'impact du synchronisme dans celles-ci.This thesis is concerned with the events and the organisation of events that take place within networks of abstract predetermined elements called "automata". In these networks, automata incite one another to switch states in agreement with predefined rules which, precisely, define the net-work. When an automaton effectively conforms to the influences it receives from others, its state is said to be updated. The elementary events that are considered here are thus automata state changes. To define an update mode for all the automata of a network allows to select some events among all those that are a priori possible. It also allows to organise and order the events relatively so as to impose, for example, that independent events occur simultaneously or so that simply, they happen close enough to disallow the occurrence of any other events in between. Informally, update modes can be interpreted as the expressions of influences incoming from outside the network, forbidding certain changes, or else, as the formalisation of a relaxed and relative version of time flow. This thesis proposes to study their influences on network behaviours. And to distinguish their influences from that of network structures, it starts by highlighting the role of certain structural motives. After that, it explores in particular the information that is "encoded" in a sequence of updates as well as the general impact of synchronism in updates
On the dynamics of two particular classes of Boolean automata networks: Boolean automata circuits and OR networks
No full textThe work presented here is set in line with fi elds of theoretical computer science and biology that study Boolean automata networks frequently seen as models of genetic regulation networks. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of regulation networks. This is why we first chose to concentrate on networks whose underlying interaction graphs are circuits, that is, Boolean automata circuits. Here, we examine the dynamical behaviour of these networks in the case of a synchronous update schedule of their automata as well as in that of more general update schedules such as sequential or block sequential update schedules. Next, driven by the will to develop our understanding of networks with arbitrary underlying structures, we focus on OR networks and give some properties of their dynamics in an attempt to fully classify these networks according to their asymptotic dynamical behaviour considering all of their synchronous, sequential and block sequential update schedules
Going Beyond Counting First Authors in Author Co-citation Analysis
Get PDFThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Mises à jour de réseaux d'automates
No full textThis thesis is concerned with the events and the organisation of events that take place within networks of abstract predetermined elements called "automata". In these networks, automata incite one another to switch states in agreement with predefined rules which, precisely, define the net-work. When an automaton effectively conforms to the influences it receives from others, its state is said to be updated. The elementary events that are considered here are thus automata state changes. To define an update mode for all the automata of a network allows to select some events among all those that are a priori possible. It also allows to organise and order the events relatively so as to impose, for example, that independent events occur simultaneously or so that simply, they happen close enough to disallow the occurrence of any other events in between. Informally, update modes can be interpreted as the expressions of influences incoming from outside the network, forbidding certain changes, or else, as the formalisation of a relaxed and relative version of time flow. This thesis proposes to study their influences on network behaviours. And to distinguish their influences from that of network structures, it starts by highlighting the role of certain structural motives. After that, it explores in particular the information that is "encoded" in a sequence of updates as well as the general impact of synchronism in updates.Cette thèse s'intéresse aux évènements et aux ordonnancements d'évènements se produisant au sein de réseaux d'éléments conceptuels prédéterminés. Dans ces réseaux, les éléments, appelés plutôt "automates", s'incitent les uns les autres à changer d'état en accord avec des règles prédéfinies qui, précisément, définissent le (fonctionnement du) réseau. Lorsqu'un automate se conforme effectivement aux influences qu'il reçoit de la part des autres, on dit que son état est mis à jour. Les évènements élémentaires considérés sont les changements d'états des automates. Définir un mode de mise à jour pour l'ensemble des automates d'un réseau permet de sélectionner certains évènements parmi l'ensemble de ceux qui sont a priori possibles. Cela permet aussi d'organiser et d'ordonner les évènements les uns par rapport aux autres de façon, par exemple, à imposer que des évènements indépendants se produisent simultanément ou simplement, de manière assez rapprochée pour qu'aucun autre événement ne puisse se produire pendant leur occurrence. Informellement, les modes de mise à jour peuvent donc être interprétés comme l'expression d'influences extérieures au réseau interdisant certains changements, ou alors comme la formalisation d'une version relâchée et relative de l'écoulement de temps. Cette thèse propose d'étudier leur influence sur le comportement des réseaux. Et afin de distinguer cette influence de celle de la structure des réseaux, elle commence par mettre en évidence le rôle de certains motifs structurels. Après ça, elle s'intéresse en particulier à l'information "encodée" dans une séquence de mises à jour et à l'impact du synchronisme dans celles-ci
On update schedules and dynamics of Boolean networks
No full textGraduate internship repport supervised by Julio Aracena (rapport de stage de Master 1 dirigé par Julio Aracena)The dynamical properties of a Boolean network rely on several different parameters. In this document, we focus on three of them which are very closely tied to the definition itself of a Boolean network: the structure of a network, the type of local activation functions, and the update schedules. In other words, the dependencies between the elements of a network, the way each one of these elements is activated as a function of the other elements of the network and the order according to which the states of the elements of the network are updated.The central question of the work presented relates to the idea of the robustness of a Boolean network with respect to perturbations of its update schedule
On the dynamics of two particular classes of Boolean automata networks: Boolean automata circuits and OR networks
No full textThe work presented here is set in line with fi elds of theoretical computer science and biology that study Boolean automata networks frequently seen as models of genetic regulation networks. In the context of biological regulation, former studies have highlighted the importance of circuits on the asymptotic dynamical behaviour of regulation networks. This is why we first chose to concentrate on networks whose underlying interaction graphs are circuits, that is, Boolean automata circuits. Here, we examine the dynamical behaviour of these networks in the case of a synchronous update schedule of their automata as well as in that of more general update schedules such as sequential or block sequential update schedules. Next, driven by the will to develop our understanding of networks with arbitrary underlying structures, we focus on OR networks and give some properties of their dynamics in an attempt to fully classify these networks according to their asymptotic dynamical behaviour considering all of their synchronous, sequential and block sequential update schedules
- …
