4,956 research outputs found

    On Varieties of Ordered Automata

    Full text link
    The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of more complex algebraic structures on the other hand. It is also possible to consider classes of automata instead of algebraic structures as a natural counterpart of classes of languages. Here we deal with the correspondence relating positive C\mathcal C-varieties of languages to positive C\mathcal C-varieties of ordered automata and we present various specific instances of this correspondence. These bring certain well-known results from a new perspective and also some new observations. Moreover, complexity aspects of the membership problem are discussed both in the particular examples and in a general setting

    Neural‑Brane: Neural Bayesian Personalized Ranking for Attributed Network Embedding

    Get PDF
    Network embedding methodologies, which learn a distributed vector representation for each vertex in a network, have attracted considerable interest in recent years. Existing works have demonstrated that vertex representation learned through an embedding method provides superior performance in many real-world applications, such as node classification, link prediction, and community detection. However, most of the existing methods for network embedding only utilize topological information of a vertex, ignoring a rich set of nodal attributes (such as user profiles of an online social network, or textual contents of a citation network), which is abundant in all real-life networks. A joint network embedding that takes into account both attributional and relational information entails a complete network information and could further enrich the learned vector representations. In this work, we present Neural-Brane, a novel Neural Bayesian Personalized Ranking based Attributed Network Embedding. For a given network, Neural-Brane extracts latent feature representation of its vertices using a designed neural network model that unifies network topological information and nodal attributes. Besides, it utilizes Bayesian personalized ranking objective, which exploits the proximity ordering between a similar node pair and a dissimilar node pair. We evaluate the quality of vertex embedding produced by Neural-Brane by solving the node classification and clustering tasks on four real-world datasets. Experimental results demonstrate the superiority of our proposed method over the state-of-the-art existing methods

    Système d’indicateurs sur les addictions : Chiffres-clé sur la consommation de substances psychoactives dans la population âgée de 15 ans et plus dans le canton de Vaud

    Get PDF
    Le Département de la santé et de l’action sociale (DSAS) du canton de Vaud est chargé de la mise en oeuvre de la politique de prévention et de lutte contre les méfaits des addictions. Afin d’assurer le pilotage de cette politique, le DSAS souhaite disposer d’indicateurs fiables lui permettant d’évaluer les besoins, de planifier l’offre de prise en charge médico-sociale et d’évaluer les effets des projets et programmes soutenus financièrement. Le monitorage porte sur cinq thèmes: (1) la situation épidémiologique du canton de Vaud en matière de consommation de substances et de comportements addictifs; (2) le repérage et les interventions précoces dans la population jeune; (3) la prise en charge médico-sociale; (4) la réduction des risques, et (5) la répression et la régulation du marché. Ce document propose une synthèse des indicateurs retenus concernant la situation épidémiologique du canton de Vaud en matière de consommation d’alcool, de tabac, de cannabis et d’autres substances psychoactives illicites chez les personnes âgées de 15 ans et plus

    A designed phenylalanyl-tRNA synthetase variant allows efficient in vivo incorporation of aryl ketone functionality into proteins

    Get PDF
    Incorporation of non-natural amino acids into proteins in vivo expands the scope of protein synthesis and design. p-Acetylphenylalanine was incorporated into recombinant dihydrofolate reductase (DHFR) in Escherichia coli via a computationally designed mutant form of the phenylalanyl-tRNA synthetase of the host. DHFR outfitted with ketone functionality can be chemoselectively ligated with hydrazide reagents under mild conditions

    Système d’indicateurs sur les addictions : Chiffres-clé sur la consommation de substances psychoactives chez les jeunes de 11 à 24 ans dans le canton de Vaud

    Get PDF
    Le Département de la santé et de l’action sociale (DSAS) du canton de Vaud est chargé de la mise en oeuvre de la politique de prévention et de lutte contre les méfaits des addictions. Afin d’assurer le pilotage de cette politique, le DSAS souhaite disposer d’indicateurs fiables lui permettant d’évaluer les besoins, de planifier l’offre de prise en charge médico-sociale et d’évaluer les effets des projets et programmes soutenus financièrement. Le monitorage porte sur cinq thèmes : (1) la situation épidémiologique du canton de Vaud en matière de consommation de substances et de comportements addictifs ; (2) le repérage et les interventions précoces dans la population jeune ; (3) la prise en charge médico-sociale ; (4) la réduction des risques, et (5) la répression et la régulation du marché. Ce document propose une synthèse des indicateurs retenus concernant la situation épidémiologique du canton de Vaud en matière de consommation d’alcool, de tabac et de cannabis chez les jeunes de 11 à 24 ans

    Green's Relations in Finite Transformation Semigroups

    Get PDF
    We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then correspond to the strongly connected components. It is not difficult to show that, in the worst case, the number of equivalence classes is in the same order of magnitude as the number of elements. Another important parameter is the maximal length of a chain of components. Our main contribution is an exponential lower bound for this parameter. There is a simple construction for an arbitrary set of generators. However, the proof for constant alphabet is rather involved. Our results also apply to automata and their syntactic semigroups.Comment: Full version of a paper submitted to CSR 2017 on 2016-12-1
    corecore