Unirse

Revistas

Informática y matemáticas aplicadas

ARIMA

[Revue africaine de recherche en informatique et mathématiques appliquées]

ARIMA

Revue africaine de recherche en informatique et mathématiques appliquées

ARIMA nació en 2002 de una colaboración científica Norte/Sur llevada a cabo a raíz de las actividades del Coloquio Africano para la Investigación en Informática y Matemáticas Aplicadas (CARI). La revista publica regularmente, en francés e inglés, los resultados de las investigaciones resultantes de estas cooperaciones.

  • Director de publicación: Maurice Tchuenté
  • Redactores en jefe: Nabil Gmati ; Mathieu Roche ; Tayou Djamegni Clémentin
  • Tipo de soporte: electrónico
  • Periodicidad: sobre la marcha
  • Año de creación: 2002
  • Fecha de publicación en Episciences: 2016
  • eISSN: 1638-5713
  • Disciplinas: Informática y Matemáticas Aplicadas
  • Idiomas de publicación: inglés, francés
  • Procedimiento de evaluación: evaluación simple ciega
  • CC BY 4.0 licence
  • Editor: African Society in Digital Science
    • Dirección postal: Department of Mathematics and Computer Science, Faculty of Science, University of Dschang, P.O. Box 96 Dschang
    • País: Camerún
  • Contacto: arima AT episciences.org
Ver el sitio web

Últimos artículos

Deux Schémas de Stéganographie Textuelles basés sur le codage des couleurs.

La stéganographie textuelle est un mécanisme permettant de cacher un message secret dans un texte. Dans ce papier, nous proposons un schéma stéganographique basé sur le codage de couleurs. Ce schéma comprend deux méthodes différentes : la première, basée sur les permutations et la seconde, basée sur les systèmes de numération. Etant donné un message secret et un texte de couverture, les méthodes proposées cachent le message secret dans le texte de couverture en le coloriant. Le stégo-texte est ensuite envoyé au destinataire par mail. Après expérimentations, les résultats obtenus montrent que nos modèles proposent un meilleure capacité d'embarquement par rapport au schéma d'Aruna Malik et al. sur laquelle repose notre idée.
Karnel Sadie, Juvet
October 28, 2024
Read article

Application du modèle de représentation acoustique multilingue XLSR pour la transcription de l'Ewondo

Les modèles auto-supervisés récemment popularisés apparaissent comme une solution au problème de la faible disponibilité des données grâce à un transfert d'apprentissage parcimonieux. Nous étudions l'efficacité de ces modèles acoustiques multilingues, en l'occurrence wav2vec 2.0 XLSR-53 et wav2vec 2.0 XLSR-128, pour la tâche de transcription de la langue Ewondo (parlée au Cameroun). Les expériences ont été menées sur 11 minutes de discours construits à partir de 103 phrases lues. Malgré une forte capacité de généralisation du modèle acoustique multilingue, les résultats préliminaires montrent que la distance entre les langues intégrées dans le XLSR (anglais, français, espagnol, allemand, mandarin, . . .) et l'ewondo a un impact important sur la performance du modèle de transcription. Les performances les plus élevées obtenues sont de l'ordre de 69% pour le WER et de 28.1% pour le CER. Une analyse de ces résultats préliminaires est effectuée et interprétée afin de proposer des pistes d'amélioration efficaces.
Yannick Yomie, Nzeuhang
October 28, 2024
Read article
Informática y matemáticas aplicadas

Compositionality

Compositionality

Fundada en 2017, Compositionality acoge artículos de investigación en inglés en el campo de las matemáticas de la composición en todas las disciplinas. La revista está publicada por la Compositionality Charitable Incorporated Organisation.

  • Director de publicación: John Baez
  • Redactores jefe: Aleks Kissinger ; Joachim Kock
  • Tipo de soporte: electrónico
  • Periodicidad: anual
  • Año de creación: 2017
  • Fecha de publicación en Episciences: 2024
  • eISSN: 2631-4444
  • Disciplinas: matemáticas, cálculo, lógica, física, química, ingeniería, lingüística, cognición
  • Idiomas de publicación: inglés
  • Procedimiento de evaluación: evaluación simple ciega
  • Licencia CC BY 4.0
  • Editor: Compositionality Charitable Incorporated Organisation
    • Dirección postal: 108 Kennington Road, Kennington, Oxford, OX1 5PE
    • País: Reino Unido
  • Contacto: compositionality AT episciences.org
Ver el sitio web

Últimos artículos

Homotopy Theoretic and Categorical Models of Neural Information Networks

In this paper we develop a novel mathematical formalism for the modeling of neural information networks endowed with additional structure in the form of assignments of resources, either computational or metabolic or informational. The starting point for this construction is the notion of summing functors and of Segal's Gamma-spaces in homotopy theory. The main results in this paper include functorial assignments of concurrent/distributed computing architectures and associated binary codes to networks and their subsystems, a categorical form of the Hopfield network dynamics, which recovers the usual Hopfield equations when applied to a suitable category of weighted codes, a functorial assignment to networks of corresponding information structures and information cohomology, and a cohomological version of integrated information.
Manin, Yuri
September 06, 2024
Read article

A Framework for Universality in Physics, Computer Science, and Beyond

Turing machines and spin models share a notion of universality according to which some simulate all others. Is there a theory of universality that captures this notion? We set up a categorical framework for universality which includes as instances universal Turing machines, universal spin models, NP completeness, top of a preorder, denseness of a subset, and more. By identifying necessary conditions for universality, we show that universal spin models cannot be finite. We also characterize when universality can be distinguished from a trivial one and use it to show that universal Turing machines are non-trivial in this sense. Our framework allows not only to compare universalities within each instance, but also instances themselves. We leverage a Fixed Point Theorem inspired by a result of Lawvere to establish that universality and negation give rise to unreachability (such as uncomputability). As such, this work sets the basis for a unified approach to universality and invites the study of further examples within the framework.
Gonda, Tomáš
August 29, 2024
Read article
Informática y matemáticas aplicadas

DMTCS

[Discrete Mathematics & Theoretical Computer Science]

DMTCS

Discrete Mathematics & Theoretical Computer Science

Discrete Mathematics & Theoretical Computer Science (DMTCS) es una revista con comité de lectura creada en 1997. Respaldada por la asociación DMTCS, publica artículos de investigación en inglés, en los campos de las matemáticas discretas y la informática teórica, en particular en la intersección de estas dos disciplinas.

  • Director de publicación: Jens Gustedt
  • Redactores y redactora en jefe: Christoph Haase, Dieter Rautenbach, Sergi Elizalde y Hadas Shachnai
  • Tipo de soporte: electrónico
  • Periodicidad: sobre la marcha
  • Año de creación: 1997
  • Fecha de publicación en Episciences: 2016
  • eISSN: 1365-8050
  • Disciplinas: matemáticas, informática
  • Idiomas de publicación: inglés
  • Procedimiento de evaluación: evaluación simple ciega
  • CC BY 4.0 licence
  • Editor: Association DMTCS
    • Dirección postal: c/o Jens Gustedt, 67A avenue Jean-Jaurès, 67100 Strasbourg
    • País: Francia
  • Contacto: dmtcs AT episciences.org
Ver el sitio web

Últimos artículos

Approximating optimization problems in graphs with locational uncertainty

Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take any position in given uncertainty sets. Then, the cost function to be minimized is the sum of the distances for the worst positions of the vertices in their uncertainty sets. We propose two types of polynomial-time approximation algorithms. The first one relies on solving a deterministic counterpart of the problem where the uncertain distances are replaced with maximum pairwise distances. We study in details the resulting approximation ratio, which depends on the structure of the feasible subgraphs and whether the metric space is Ptolemaic or not. The second algorithm is a fully-polynomial time approximation scheme for the special case of $s-t$ paths.
Bougeret, Marin
December 17, 2024
Read article

On the Advice Complexity of Online Matching on the Line

We consider the matching problem on the line with advice complexity. We give a 1-competitive online algorithm with advice complexity $n-1,$ and show that there is no 1-competitive online algorithm reading less than $n-1$ bits of advice. Moreover, for each $0
Csaba, Béla
December 06, 2024
Read article
Actas de conferencias
Informática y matemáticas aplicadas

ENTICS

[Electronic Notes in Theoretical Informatics and Computer Science]

ENTICS

Electronic Notes in Theoretical Informatics and Computer Science

ENTICS, Electronic Notes in Theoretical Informatics and Computer Science, creada en 2022, publica en inglés actas de conferencias y talleres de informática teórica.

  • Director de publicación: Bruno Sportisse
  • Redactor en jefe: Michael Mislove
  • Tipo de soporte: electrónico
  • Periodicidad: sobre la marcha
  • Año de creación: 2022
  • Fecha de publicación en Episciences: 2023
  • eISSN: 2969-2431
  • Disciplinas: informática teórica
  • Idiomas de publicación: inglés
  • Procedimiento de evaluación: evaluación simple ciega
  • Licence CC BY 4.0
  • Editor: Inria
    • Dirección postal: Domaine de Voluceau Rocquencourt – B.P. 105 78153 Le Chesnay Cedex
    • País: Francia
  • Contacto: entics AT episciences.org
Ver el sitio web

Últimos artículos

Implicit automata in {\lambda}-calculi III: affine planar string-to-string functions

We prove a characterization of first-order string-to-string transduction via $\lambda$-terms typed in non-commutative affine logic that compute with Church encoding, extending the analogous known characterization of star-free languages. We show that every first-order transduction can be computed by a $\lambda$-term using a known Krohn-Rhodes-style decomposition lemma. The converse direction is given by compiling $\lambda$-terms into two-way reversible planar transducers. The soundness of this translation involves showing that the transition functions of those transducers live in a monoidal closed category of diagrams in which we can interpret purely affine $\lambda$-terms. One challenge is that the unit of the tensor of the category in question is not a terminal object. As a result, our interpretation does not identify $\beta$-equivalent terms, but it does turn $\beta$-reductions into inequalities in a poset-enrichment of the category of diagrams.
Pradic, Cécilia
December 11, 2024
Read article

Cost-sensitive computational adequacy of higher-order recursion in synthetic domain theory

We study a cost-aware programming language for higher-order recursion dubbed $\textbf{PCF}_\mathsf{cost}$ in the setting of synthetic domain theory (SDT). Our main contribution relates the denotational cost semantics of $\textbf{PCF}_\mathsf{cost}$ to its computational cost semantics, a new kind of dynamic semantics for program execution that serves as a mathematically natural alternative to operational semantics in SDT. In particular we prove an internal, cost-sensitive version of Plotkin's computational adequacy theorem, giving a precise correspondence between the denotational and computational semantics for complete programs at base type. The constructions and proofs of this paper take place in the internal dependent type theory of an SDT topos extended by a phase distinction in the sense of Sterling and Harper. By controlling the interpretation of cost structure via the phase distinction in the denotational semantics, we show that $\textbf{PCF}_\mathsf{cost}$ programs also evince a noninterference property of cost and behavior. We verify the axioms of the type theory by means of a model construction based on relative sheaf models of SDT.
Niu, Yue
December 11, 2024
Read article
Informática y matemáticas aplicadas

FI

[Fundamenta Informaticae]

FI

Fundamenta Informaticae

Fundada en 1977, Fundamenta Informaticae es una revista científica con comité de lectura que cubre todas las áreas de la informática, con un enfoque particular en los fundamentos teóricos. La revista se publica en la serie IV de los Annales Societatis Mathematicae Polonae por la Sociedad Matemática Polaca.

  • Director de publicación: Prof. Jacek Miękisz
  • Redactor en jefe: Bartek Klin
  • Tipo de soporte: papel y electrónico
  • Periodicidad: 3 a 4 volúmenes al año
  • Año de creación: 1977
  • Fecha de publicación en Episciences: 2020
  • eISSN: 1875-8681
  • Disciplinas: informática
  • Idiomas de publicación: inglés
  • Procedimiento de evaluación: evaluación simple ciega
  • CC BY 4.0 licence
  • Editor: Polish Mathematical Society
    • Dirección postal: ul. Śniadeckich 8, 00-656 Warszawa
    • País: Polonia
  • Contacto: fi AT episciences.org
Ver el sitio web

Últimos artículos

Proving Confluence in the Confluence Framework with CONFident

This article describes the *Confluence Framework*, a novel framework for proving and disproving confluence using a divide-and-conquer modular strategy, and its implementation in CONFident. Using this approach, we are able to automatically prove and disprove confluence of *Generalized Term Rewriting Systems*, where (i) only selected arguments of function symbols can be rewritten and (ii) a rather general class of conditional rules can be used. This includes, as particular cases, several variants of rewrite systems such as (context-sensitive) *term rewriting systems*, *string rewriting systems*, and (context-sensitive) *conditional term rewriting systems*. The divide-and-conquer modular strategy allows us to combine in a proof tree different techniques for proving confluence, including modular decompositions, checking joinability of (conditional) critical and variable pairs, transformations, etc., and auxiliary tasks required by them, e.g., joinability of terms, joinability of conditional pairs, etc.
Gutiérrez, Raúl
November 10, 2024
Read article

On Complexity Bounds and Confluence of Parallel Term Rewriting

We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in the size of the start term. We propose automatic techniques to derive both upper and lower bounds on parallel complexity of rewriting that enable a direct reuse of existing techniques for sequential complexity. Our approach to find lower bounds requires confluence of the parallel-innermost rewrite relation, thus we also provide effective sufficient criteria for proving confluence. The applicability and the precision of the method are demonstrated by the relatively light effort in extending the program analysis tool AProVE and by experiments on numerous benchmarks from the literature.
Baudon, Thaïs
November 10, 2024
Read article
Ciencias humanas y sociales
Informática y matemáticas aplicadas

JDMDH

[Journal of Data Mining and Digital Humanities]

JDMDH

Journal of Data Mining and Digital Humanities

Creada en 2014, Journal of Data Mining and Digital Humanities (JDMDH) se encuentra en la intersección de la prospección de datos y las humanidades digitales. Los artículos publicados, en inglés o en francés, se refieren tanto a la extracción y gestión de conocimientos (análisis de redes, extracción de información, web semántica, análisis de preferencias, aprendizaje automático) como a las ciencias humanas y sociales (históricas, políticas, lingüísticas, sociológicas, geográficas, de comunicación y archivo) en la era digital.

  • Director de publicación: Bruno Sportisse
  • Redactores en jefe: Richi Nayak, Laurent Romary y Nicolas Turenne
  • Tipo de soporte: electrónico
  • Periodicidad: sobre la marcha
  • Año de creación: 2014
  • Fecha de publicación en Episciences: 2014
  • eISSN: 2416-5999
  • Disciplinas: humanidades digitales
  • Idiomas de publicación: inglés, francés
  • Procedimiento de evaluación: evaluación simple ciega
  • CC BY 4.0 licence
  • Editor: Inria
    • Dirección postal: Domaine de Voluceau Rocquencourt – B.P. 105 78153 Le Chesnay Cedex
    • País: Francia
  • Contacto: jdmdh AT episciences.org
Ver el sitio web

Últimos artículos

SegmOnto: A Controlled Vocabulary to Describe and Process Digital Facsimiles

Our initiative aims at designing a controlled vocabulary for the description of the layout of textual sources: SegmOnto. Following a more physical approach rather than a strictly semantic one, it is designed as a pragmatic and generic typology, coping with most of the Western historical documents rather than answering specific needs. The harmonisation of the layout description has a double objective: on the one hand it facilitates the mutualisation of annotated data and therefore the training of better models for page segmentation (a crucial preliminary step for text recognition), on the other hand it allows the development of a shared post-processing workflow and pipeline for the transformation of ALTO or PAGE files into DH standard formats, which preserves as much as possible the link between the extracted information and the digital facsimile. To demonstrate the capacity of SegmOnto to answer both these objectives, we aggregate data from multiple projects to train a layout analysis model, and we propose a prototype of a generic pipeline for converting ALTO-XMLs into XML-TEI.
Gabay, Simon
December 17, 2024
Read article

Notebook and Open science : toward more FAIR play

Notebooks are now commonly used in digital research practices. Despite their increasing ubiquity, the characteristics, roles, and uses associated with notebooks have seldom been studied from a social science perspective. In this article, we present an overview of the available empirical work on notebooks in order to describe existing practices, typologies crafted to grasp their diversity, and their limitations when used in data analysis workflows. Following this review, which highlights a focus of studies on interactive computational notebooks specifically within data science rather than research practices in academic contexts, we discuss the role of notebooks as a vector and lever for the FAIR (Findable, Accessible, Interoperable, Reusable) principles associated with open science.
Le Béchec, Mariannig
December 16, 2024
Read article
Informática y matemáticas aplicadas

JIPS

[Journal d’Interaction Personne-Système]

JIPS

Journal d’Interaction Personne-Système

Creada en 2008 por la Asociación Francófona para la Interacción Humano-Máquina, Journal d’Interaction Personne-Système (JIPS) sucedió a la Revue d’Interaction Homme-Machine (RIHM), fundada en 1997 y activa hasta 2007 (luego se convirtió en la Revue des Interactions Humaines Médiatisées).

JIPS dejó de publicarse en abril de 2022; los artículos publicados permanecen accesibles en el sitio web de la revista.

  • Directora de publicación: Sophie Dupuy-Chessa
  • Tipo de soporte: electrónico
  • Estado de la colección: 2010-2020
  • Año de creación: 2008
  • Fecha de publicación en Episciences: 2014
  • eISSN: 2418-1838
  • Disciplinas: ingeniería, tecnologías, ciencias cognitivas
  • Idiomas de publicación: inglés, francés
  • CC BY 4.0 licence
  • Editor: Association Francophone d’Interaction Homme-Machine (AFIHM)
    • Dirección postal: 385 rue de la Bibliothèque, 38041 Grenoble Cedex
    • País: Francia
  • Contacto: presidence AT afihm.org
Ver el sitio web

Últimos artículos

Processus de changement de comportement : états, transitions et déterminants du comportement

Si le but et les garde-fous éthiques de la persuasion sont aujourd’hui bien compris, la littérature est abondante et les analyses critiques multiples, sans qu’un langage de comparaison n’ait été défini. Cet article propose les concepts d’états, de transitions et de déterminants pour caractériser les travaux de la littérature et ainsi en faciliter la compréhension et la comparaison. L’opérationnalisation de ce cadre ouvre des perspectives intéressantes au domaine.
Fenicio, Alessandro
February 08, 2021
Read article

L’adaptation pour une persuasion durable

Persuader est difficile ; persuader sur la durée l’est encore plus. Nous explorons l’adaptation pour apporter de la variété et de la pertinence à la persuasion et ainsi pallier l’usure de l’efficacité des messages persuasifs. Le cas d’étude est TILT, un dispositif persuasif pour la régulation du temps d’usage du smartphone. La persuasion de TILT s’appuie sur le principe d’auto-surveillance. L’expérimentation démontre la pertinence de l’adaptation du message persuasif comme renfort de l’efficacité du principe d’auto-surveillance dans le temps.
Foulonneau, Anthony
January 22, 2021
Read article
Informática y matemáticas aplicadas

JoDaKISS

[Journal of Data- and Knowledge-integrated Simulation Science]

JoDaKISS

Journal of Data- and Knowledge-integrated Simulation Science

Próximamente

Journal of Data- and Knowledge-integrated Simulation Science (JoDaKISS) es una revista internacional multidisciplinar dedicada a apoyar y hacer avanzar la ciencia de la simulación mediante la publicación de datos y software de alta calidad para simulaciones científicas por ordenador. La publica el Centro de Ciencias de la Simulación de Stuttgart (SC SimTech, Universidad de Stuttgart, Alemania).

  • Director de publicación: Holger Steeb
  • Consejo de redacción: Bernd Flemisch, Dominik Göddeke, Jeroen Hanselman, Jan Heiland, Sibylle Hermann, Melanie Herschel, Timo Koch, Holger Steeb
  • Tipo de soporte: electrónico
  • Periodicidad: sobre la marcha
  • Año de creación: 2024
  • eISSN: 2944-7666
  • Disciplinas: ciencia de la simulación, experimentos ricos en datos, simulaciones numéricas directas
  • Idiomas de publicación: inglés
  • Procedimiento de evaluación: evaluación simple ciega
  • Licencia CC BY 4.0
  • Editor: Stuttgart Center of Simulation Science (SC SimTech)
    • Dirección postal: Pfaffenwaldring 5a, 70569 Stuttgart
    • País: Alemania
  • Contacto: jodakiss AT episciences.org
Ver el sitio web
Informática y matemáticas aplicadas

LMCS

[Logical Methods in Computer Science]

LMCS

Logical Methods in Computer Science

Logical Methods in Computer Science (LMCS) publica regularmente artículos de investigación en inglés sobre áreas teóricas y prácticas de la informática que involucran métodos lógicos, tomados en un sentido amplio. Creada en 2014, la revista es publicada por Logical Methods in Computer Science eV, una organización sin fines de lucro cuyo objetivo es facilitar la difusión de resultados científicos relacionados con la lógica en informática.

  • Director de publicación: Lars Birkedal
  • Redactor en jefe: Stefan Milius
  • Tipo de soporte: electrónico
  • Periodicidad: sobre la marcha
  • Año de creación: 2014
  • Fecha de publicación en Episciences: 2015
  • eISSN: 1860-5974
  • Disciplinas: métodos lógicos
  • Idiomas de publicación: inglés
  • Procedimiento de evaluación: evaluación simple ciega
  • CC BY 4.0 licence
  • Editor: Logical Methods in Computer Science e.V.
    • País: Alemania
  • Contacto: lmcs AT episciences.org
Ver el sitio web

Últimos artículos

Unifying cubical and multimodal type theory

In this paper we combine the principled approach to modalities from multimodal type theory (MTT) with the computationally well-behaved realization of identity types from cubical type theory (CTT). The result -- cubical modal type theory (Cubical MTT) -- has the desirable features of both systems. In fact, the whole is more than the sum of its parts: Cubical MTT validates desirable extensionality principles for modalities that MTT only supported through ad hoc means. We investigate the semantics of Cubical MTT and provide an axiomatic approach to producing models of Cubical MTT based on the internal language of topoi and use it to construct presheaf models. Finally, we demonstrate the practicality and utility of this axiomatic approach to models by constructing a model of (cubical) guarded recursion in a cubical version of the topos of trees. We then use this model to justify an axiomatization of L\"ob induction and thereby use Cubical MTT to smoothly reason about guarded recursion.
Aagaard, Frederik Lerbjerg
December 12, 2024
Read article

Equivalence of eval-readback and eval-apply big-step evaluators by structuring the lambda-calculus's strategy space

We study the equivalence between eval-readback and eval-apply big-step evaluators in the general setting of the pure lambda calculus. We study `one-step' equivalence (same strategy) and also discuss `big-step' equivalence (same final result). One-step equivalence extends for free to evaluators in other settings (calculi, programming languages, proof assistants, etc.) by restricting the terms (closed, convergent) while maintaining the strategy. We present a proof that one-step equivalence holds when (1) the `readback' stage satisfies straightforward well-formedness provisos, (2) the `eval' stage implements a `uniform' strategy, and (3) the eval-apply evaluator implements a `balanced hybrid' strategy that has `eval' as a subsidiary strategy. The proof proceeds the `lightweight fusion by fixed-point promotion' program transformation on evaluator implementations to fuse readback and eval into the balanced hybrid. The proof can be followed with no previous knowledge of the transformation. We use Haskell 2010 as the implementation language, with all evaluators written in monadic style to guarantee semantics (strategy) preservation, but the choice of implementation language is immaterial. To illustrate the large scope of the equivalence, we provide an extensive survey of the strategy space using canonical eval-apply evaluators in code and big-step `natural' operational semantics. We discuss the strategies' properties, some of their uses, and their abstract machines. We improve the formal definition of uniform and hybrid strategy, use it to structure the strategy space, and to obtain generic higher-order evaluators which are used in the equivalence proof. We introduce a systematic notation for both evaluator styles and use it to summarise strategy and evaluator equivalences, including (non-)equivalences within a style and (non-)equivalences between styles not proven by the transformation.
Nogueira, Pablo
December 12, 2024
Read article
Informática y matemáticas aplicadas

MNA

[Mathematical Neuroscience and Applications]

MNA

Mathematical Neuroscience and Applications

Creada en 2021, la revista Mathematical Neuroscience and Applications (MNA) se interesa por la modelización y el análisis matemático en todas las áreas de la neurociencia, es decir, el estudio del sistema nervioso y sus disfunciones. Es la continuación del Journal of Mathematical Neuroscience (2011-2021), publicado anteriormente por Springer. La revista acepta artículos en inglés.

  • Director de publicación: Bruno Sportisse
  • Redactor en jefe: Olivier Faugeras
  • Tipo de soporte: electrónico
  • Periodicidad: anual
  • Año de creación: 2021
  • Fecha de publicación en Episciences: 2021
  • eISSN: 2801-0159
  • Disciplinas: neurociencia
  • Idiomas de publicación: inglés
  • Procedimiento de evaluación: evaluación simple ciega
  • CC BY 4.0 licence
  • Editor: Inria
    • Dirección postal: Domaine de Voluceau Rocquencourt – B.P. 105 78153 Le Chesnay Cedex
    • País: Francia
  • Contacto: mna AT episciences.org
Ver el sitio web

Últimos artículos

A mean-field model of Integrate-and-Fire neurons: non-linear stability of the stationary solutions

We investigate a stochastic network composed of Integrate-and-Fire spiking neurons, focusing on its mean-field asymptotics. We consider an invariant probability measure of the McKean-Vlasov equation and establish an explicit sufficient condition to ensure the local stability of this invariant distribution. Furthermore, we prove a conjecture proposed initially by J. Touboul and P. Robert regarding the bistable nature of a specific instance of this neuronal model.
Cormier, Quentin
September 27, 2024
Read article

Neural Coding as a Statistical Testing Problem

We take the testing perspective to understand what the minimal discrimination time between two stimuli is for different types of rate coding neurons. Our main goal is to describe the testing abilities of two different encoding systems: place cells and grid cells. In particular, we show, through the notion of adaptation, that a fixed place cell system can have a minimum discrimination time that decreases when the stimuli are further away. This could be a considerable advantage for the place cell system that could complement the grid cell system, which is able to discriminate stimuli that are much closer than place cells.
Ost, Guilherme
December 29, 2023
Read article
Informática y matemáticas aplicadas

TheoretiCS

TheoretiCS

Creada en 2021, TheoretiCS cubre todas las áreas de la informática teórica (Theoretical Computer Science, TCS). Esfuerzo conjunto de la comunidad TCS, la revista es publicada por la Fundación TheoretiCS, una organización sin ánimo de lucro situada en Alemania. La revista publica regularmente en inglés trabajos de investigación, incluyendo versiones revisadas y ampliadas de documentos de conferencias.

  • Director de publicación: Thomas Schwentick
  • Redactores en jefe: Javier Esparza y Uri Zwick
  • Tipo de soporte: electrónico
  • Periodicidad: sobre la marcha
  • Año de creación: 2021
  • Fecha de publicación en Episciences: 2021
  • eISSN: 2751-4838
  • Disciplinas: informática teórica
  • Idiomas de publicación: inglés
  • Procedimiento de evaluación: evaluación simple ciega
  • CC BY 4.0 licence
  • Editor: TheoretiCS Foundation e.V.
    • Dirección postal: c/o Thomas Schwentick – Schillingstr. 23, D-44139 Dortmund
    • País: Alemania
  • Contacto: theoretics AT episciences.org
Ver el sitio web

Últimos artículos

An Enumerative Perspective on Connectivity

Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph $G$ with vertices $s$ and $t$, the connectivity $\lambda(s,t)$ from $s$ to $t$ is defined to be the maximum number of edge-disjoint paths from $s$ to $t$ in $G$. Much research has gone into designing fast algorithms for computing connectivities in graphs. Previous work showed that it is possible to compute connectivities for all pairs of vertices in directed graphs with $m$ edges in $\tilde{O}(m^\omega)$ time [Chueng, Lau, and Leung, FOCS 2011], where $\omega \in [2,2.3716)$ is the exponent of matrix multiplication. For the related problem of computing "small connectivities," it was recently shown that for any positive integer $k$, we can compute $\min(k,\lambda(s,t))$ for all pairs of vertices $(s,t)$ in a directed graph with $n$ nodes in $\tilde{O}((kn)^\omega)$ time [Akmal and Jin, ICALP 2023]. In this paper, we present an alternate exposition of these $\tilde{O}(m^\omega)$ and $\tilde{O}((kn)^\omega)$ time algorithms, with simpler proofs of correctness. Earlier proofs were somewhat indirect, introducing an elegant but ad hoc "flow vector framework" for showing correctness of these algorithms. In contrast, we observe that these algorithms for computing exact and small connectivity values can be interpreted as testing whether certain generating functions enumerating families of edge-disjoint paths are nonzero. This new perspective yields more transparent proofs, and ties the approach for these problems more closely to the literature surrounding algebraic graph algorithms.
Akmal, Shyan
December 19, 2024
Read article

The Descriptive Complexity of Graph Neural Networks

We analyse the power of graph neural networks (GNNs) in terms of Boolean circuit complexity and descriptive complexity. We prove that the graph queries that can be computed by a polynomial-size bounded-depth family of GNNs are exactly those definable in the guarded fragment GFO+C of first-order logic with counting and with built-in relations. This puts GNNs in the circuit complexity class (non-uniform) $\text{TC}^0$. Remarkably, the GNN families may use arbitrary real weights and a wide class of activation functions that includes the standard ReLU, logistic "sigmoid", and hyperbolic tangent functions. If the GNNs are allowed to use random initialisation and global readout (both standard features of GNNs widely used in practice), they can compute exactly the same queries as bounded depth Boolean circuits with threshold gates, that is, exactly the queries in $\text{TC}^0$. Moreover, we show that queries computable by a single GNN with piecewise linear activations and rational weights are definable in GFO+C without built-in relations. Therefore, they are contained in uniform $\text{TC}^0$.
Grohe, Martin
December 04, 2024
Read article