- Todo
- Actas de conferências
- Ambiente
- Biomecânica
- Ciências da saúde
- Ciências humanas e sociais
- Física
- Informática e matemática aplicada
- Matemática
- Mecânica
Informática e matemática aplicada
ARIMA
[Revue africaine de recherche en informatique et mathématiques appliquées]
ARIMA
Revue africaine de recherche en informatique et mathématiques appliquées
A ARIMA nasceu em 2002 de uma colaboração científica Norte/Sul realizada na base das atividades do Colóquio africano para a investigação em informática e matemática aplicada (CARI). A revista publica gradualmente, em francês e em inglês, os resultados provenientes destas colaborações.
- Diretor de publicação: Maurice Tchuenté
- Redators responsáveis: Nabil Gmati, Mathieu Roche, Tayou Djamegni Clémentin
- Tipo de suporte: digital
- Periodicidade: gradual
- Ano de criação: 2002
- Data de disponibilização online na Episciences: 2016
- eISSN: 1638-5713
- Disciplinas: informática e matemática aplicada
- Idiomas da publicação: inglês, francês
- Processo de avaliação: estudo cego
- CC BY 4.0 licence
- Editor: African Society in Digital Science
- Endereço postal: Department of Mathematics and Computer Science, Faculty of Science, University of Dschang, P.O. Box 96 Dschang
- País: Camarões
- Contacto: arima AT episciences.org
Últimos artigos
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
Ler o artigo
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
Ler o artigo
Informática e matemática aplicada
Compositionality
Compositionality
Fundada em 2017, a Compositionality acolhe artigos de investigação em inglês no domínio da matemática da composição em todas as disciplinas. A revista é publicada pela Compositionality Charitable Incorporated Organisation.
- Diretor de publicação: John Baez
- Editores-chefes: Aleks Kissinger ; Joachim Kock
- Tipo de suporte: digital
- Periodicidade: anual
- Ano de criação: 2017
- Data de disponibilização online na Episciences: 2024
- eISSN: 2631-4444
- Disciplinas: matemática, computação, lógica, física, química, engenharia, linguística, cognição
- Idiomas da publicação: inglês
- Processo de avaliação: estudo cego
- Licença CC BY 4.0
- Editor: Compositionality Charitable Incorporated Organisation
- Endereço postal: 108 Kennington Road, Kennington, Oxford, OX1 5PE
- País: Reino Unido
- Contacto: compositionality AT episciences.org
Últimos artigos
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
Ler o artigo
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
Ler o artigo
Informática e matemática aplicada
DMTCS
[Discrete Mathematics & Theoretical Computer Science]
DMTCS
Discrete Mathematics & Theoretical Computer Science
A Discrete Mathematics & Theoretical Computer Science (DMTCS) é uma revista especializada criada em 1997. Apoiada pela associação DMTCS, publica gradualmente artigos de investigação em inglês, nas áreas da matemática discreta e da informática teórica, em especial no cruzamento destas duas disciplinas.
- Diretor de publicação: Jens Gustedt
- Redators e redatora responsáveis: Christoph Haase, Dieter Rautenbach, Sergi Elizalde e Hadas Shachnai
- Tipo de suporte: digital
- Periodicidade: gradual
- Ano de criação
- Data de disponibilização online na Episciences
- eISSN: 1365-8050
- Disciplinas: matemática, informática
- Idiomas da publicação: inglês
- Processo de avaliação: estudo cego
- CC BY 4.0 licence
- Editor: Association DMTCS
- Endereço postal: c/o Jens Gustedt, 67A avenue Jean-Jaurès, 67100 Strasbourg
- País: França
- Contacto: dmtcs AT episciences.org
Últimos artigos
Uniquely hamiltonian graphs for many sets of degrees
We give constructive proofs for the existence of uniquely hamiltonian graphs for various sets of degrees. We give constructions for all sets with minimum 2 (a trivial case added for completeness), all sets with minimum 3 that contain an even number (for sets without an even number it is known that no uniquely hamiltonian graphs exist), and all sets with minimum 4, except {4}, {4,5}, and {4,6}. For minimum degree 3 and 4, the constructions also give 3-connected graphs. We also introduce the concept of seeds, which makes the above results possible and might be useful in the study of Sheehan's conjecture. Furthermore, we prove that 3-connected uniquely hamiltonian 4-regular graphs exist if and only if 2-connected uniquely hamiltonian 4-regular graphs exist.
Brinkmann, Gunnar
December 01, 2024
Ler o artigo
Spanning trees for many different numbers of leaves
Let $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous. It follows from work of Chen, Ren, and Shan that every connected and locally connected $n$-vertex graph -- this includes triangulations -- has a spanning tree with at least $n/2 + 1$ leaves, so by a classic theorem of Whitney and our result, in any plane $4$-connected $n$-vertex triangulation one can find for any integer $k$ which is at least $2$ and at most $n/2 + 1$ a spanning tree with exactly $k$ leaves (and each of these trees can be constructed in polynomial time). We also prove that there exist infinitely many $n$ such that there is a plane $4$-connected $n$-vertex triangulation containing a spanning tree with $2n/3$ leaves, but no spanning tree with more than $2n/3$ leaves.
Noguchi, Kenta
November 18, 2024
Ler o artigo
Actas de conferências
Informática e matemática aplicada
ENTICS
[Electronic Notes in Theoretical Informatics and Computer Science]
ENTICS
Electronic Notes in Theoretical Informatics and Computer Science
A ENTICS, Electronic Notes in Theoretical Informatics and Computer Science, criada em 2022, publica, gradualmente em inglês, atas de conferências e de workshops de informática teórica.
- Diretor de publicação: Bruno Sportisse
- Redator responsável: Michael Mislove
- Tipo de suporte: digital
- Periodicidade: gradual
- Ano de criação: 2022
- Data de disponibilização online na Episciences: 2023
- eISSN: 2969-2431
- Disciplinas: informática teórica
- Idiomas da publicação: inglês
- Processo de avaliação: estudo cego
- Licence CC BY 4.0
- Editor: Inria
- Endereço postal: Domaine de Voluceau Rocquencourt – B.P. 105 78153 Le Chesnay Cedex
- País: França
- Contacto: entics AT episciences.org
Últimos artigos
Profinite lambda-terms and parametricity
Combining ideas coming from Stone duality and Reynolds parametricity, we formulate in a clean and principled way a notion of profinite lambda-term which, we show, generalizes at every type the traditional notion of profinite word coming from automata theory. We start by defining the Stone space of profinite lambda-terms as a projective limit of finite sets of usual lambda-terms, considered modulo a notion of equivalence based on the finite standard model. One main contribution of the paper is to establish that, somewhat surprisingly, the resulting notion of profinite lambda-term coming from Stone duality lives in perfect harmony with the principles of Reynolds parametricity. In addition, we show that the notion of profinite lambda-term is compositional by constructing a cartesian closed category of profinite lambda-terms, and we establish that the embedding from lambda-terms modulo beta-eta-conversion to profinite lambda-terms is faithful using Statman's finite completeness theorem. Finally, we prove that the traditional Church encoding of finite words into lambda-terms can be extended to profinite words, and leads to a homeomorphism between the space of profinite words and the space of profinite lambda-terms of the corresponding Church type.
van Gool, Sam
November 23, 2023
Ler o artigo
Dependent Type Refinements for Futures
Type refinements combine the compositionality of typechecking with the expressivity of program logics, offering a synergistic approach to program verification. In this paper we apply dependent type refinements to SAX, a futures-based process calculus that arises from the Curry-Howard interpretation of the intuitionistic semi-axiomatic sequent calculus and includes unrestricted recursion both at the level of types and processes. With our type refinement system, we can reason about the partial correctness of SAX programs, complementing prior work on sized type refinements that supports reasoning about termination. Our design regime synthesizes the infinitary proof theory of SAX with that of bidirectional typing and Hoare logic, deriving some standard reasoning principles for data and (co)recursion while enabling information hiding for codata. We prove syntactic type soundness, which entails a notion of partial correctness that respects codata encapsulation. We illustrate our language through a few simple examples.
Somayyajula, Siva
November 23, 2023
Ler o artigo
Informática e matemática aplicada
FI
[Fundamenta Informaticae]
FI
Fundamenta Informaticae
Fundada em 1977, a Fundamenta Informaticae é uma revista científica especializada que abrange todas as áreas da informática, com um foco especial nos fundamentos teóricos. A revista é publicada na série IV das Annales Societatis Mathematicae Polonae, pela Sociedade matemática polaca.
- Diretor de publicação: Prof. Jacek Miękisz
- Redator responsável: Bartek Klin
- Tipo de suporte: papel e digital
- Periodicidade: 3 a 4 volumes por ano
- Ano de criação: 1977
- Data de disponibilização online na Episciences: 2020
- eISSN: 1875-8681
- Disciplinas: informática
- Idiomas da publicação: inglês
- Processo de avaliação: estudo cego
- CC BY 4.0 licence
- Editor: Polish Mathematical Society
- Endereço postal: ul. Śniadeckich 8, 00-656 Warszawa
- País: Polónia
- Contacto: fi AT episciences.org
Últimos artigos
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
Ler o artigo
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
Ler o artigo
Ciências humanas e sociais
Informática e matemática aplicada
JDMDH
[Journal of Data Mining and Digital Humanities]
JDMDH
Journal of Data Mining and Digital Humanities
Criada em 2014, a Journal of Data Mining and Digital Humanities (JDMDH) situa-se na interseção da extração de dados e das humanidades digitais. Os artigos publicados, em inglês ou em francês, referem-se tanto à prospeção e à gestão dos conhecimentos (análise das redes, extração de informação, web semântica, análise das preferências, aprendizagem automática) como nas ciências humanas e sociais (históricas, políticas, linguísticas, sociológicas, geográficas, da comunicação e do arquivo) na era do digital.
- Diretor de publicação: Bruno Sportisse
- Redators responsáveis: Richi Nayak, Laurent Romary e Nicolas Turenne
- Tipo de suporte: digital
- Periodicidade: gradual
- Ano de criação: 2014
- Data de disponibilização online na Episciences: 2014
- eISSN: 2416-5999
- Disciplinas: humanidades digitais
- Idiomas da publicação: inglês, francês
- Processo de avaliação: estudo cego
- CC BY 4.0 licence
- Editor: Inria
- Endereço postal: Domaine de Voluceau Rocquencourt – B.P. 105 78153 Le Chesnay Cedex
- País: França
- Contacto: jdmdh AT episciences.org
Últimos artigos
Reliable Part-of-Speech Tagging of Historical Corpora through Set-Valued Prediction
Syntactic annotation of corpora in the form of part-of-speech (POS) tags is a key requirement for both linguistic research and subsequent automated natural language processing (NLP) tasks. This problem is commonly tackled using machine learning methods, i.e., by training a POS tagger on a sufficiently large corpus of labeled data. While the problem of POS tagging can essentially be considered as solved for modern languages, historical corpora turn out to be much more difficult, especially due to the lack of native speakers and sparsity of training data. Moreover, most texts have no sentences as we know them today, nor a common orthography. These irregularities render the task of automated POS tagging more difficult and error-prone. Under these circumstances, instead of forcing the POS tagger to predict and commit to a single tag, it should be enabled to express its uncertainty. In this paper, we consider POS tagging within the framework of set-valued prediction, which allows the POS tagger to express its uncertainty via predicting a set of candidate POS tags instead of guessing a single one. The goal is to guarantee a high confidence that the correct POS tag is included while keeping the number of candidates small. In our experimental study, we find that extending state-of-the-art POS taggers to set-valued prediction yields more precise and robust taggings, especially for unknown words, i.e., words not occurring in the training data.
Heid, Stefan
October 21, 2024
Ler o artigo
Temporal Sequencing of Documents
We outline an unsupervised method for temporal rank ordering of sets of historical documents, namely American State of the Union Addresses and DEEDS, a corpus of medieval English property transfer documents. Our method relies upon effectively capturing the gradual change in word usage via a bandwidth estimate for the non-parametric Generalized Linear Models (Fan, Heckman, and Wand, 1995). The number of possible rank orders needed to search through for cost functions related to the bandwidth can be quite large, even for a small set of documents. We tackle this problem of combinatorial optimization using the Simulated Annealing algorithm, which allows us to obtain the optimal document temporal orders. Our rank ordering method significantly improved the temporal sequencing of both corpora compared to a randomly sequenced baseline. This unsupervised approach should enable the temporal ordering of undated document sets.
Gervers, Michael
September 24, 2024
Ler o artigo
Informática e matemática aplicada
JIPS
[Journal d’Interaction Personne-Système]
JIPS
Journal d’Interaction Personne-Système
Criada em 2008 pela Association francophone d’interaction humain-machine, a Journal d’Interaction Personne-Système (JIPS) sucede a Revue d’Interaction Homme-Machine (RIHM) fundada em 1997 e ativa até 2007 (tornando-se de seguida a Revue des Interactions Humaines Médiatisées).
A JIPS deixou de publicar em abril de 2022; os artigos publicados permanecem no site da revista.
- Diretora de publicação: Sophie Dupuy-Chessa
- Tipo de suporte: digital
- Estado da coleção: 2010-2020
- Ano de criação: 2008
- Data de disponibilização online na Episciences: 2014
- eISSN: 2418-1838
- Disciplinas: engenharia, tecnologias, ciências cognitivas
- Idiomas da publicação: inglês, francês
- CC BY 4.0 licence
- Editor: Association Francophone d’Interaction Homme-Machine (AFIHM)
- Endereço postal: 385 rue de la Bibliothèque, 38041 Grenoble Cedex
- País: França
- Contacto: presidence AT afihm.org
Últimos artigos
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
Ler o artigo
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
Ler o artigo
Informática e matemática aplicada
JoDaKISS
[Journal of Data- and Knowledge-integrated Simulation Science]
JoDaKISS
Journal of Data- and Knowledge-integrated Simulation Science
Em breve
O Journal of Data- and Knowledge-integrated Simulation Science (JoDaKISS) é uma revista internacional e multidisciplinar dedicada a apoiar e a fazer avançar a ciência da simulação através da publicação de dados e software de alta qualidade para simulações científicas em computador. É publicada pelo Centro de Ciência da Simulação de Estugarda (SC SimTech, Universidade de Estugarda, Alemanha).
- Diretor de publicação: Holger Steeb
- Conselho Editorial: Bernd Flemisch, Dominik Göddeke, Jeroen Hanselman, Jan Heiland, Sibylle Hermann, Melanie Herschel, Timo Koch, Holger Steeb
- Tipo de suporte: digital
- Periodicidade: gradual
- Ano de criação: 2024
- Disciplinas: ciência da simulação, experiências ricas em dados, simulações numéricas diretas
- Idiomas da publicação: inglês
- Processo de avaliação: estudo cego
- Licença CC BY 4.0
- Editor: Stuttgart Center of Simulation Science (SC SimTech)
- Endereço postal: Pfaffenwaldring 5a, 70569 Stuttgart
- País: Alemanha
- Contacto: jodakiss AT episciences.org
Informática e matemática aplicada
LMCS
[Logical Methods in Computer Science]
LMCS
Logical Methods in Computer Science
A Logical Methods in Computer Science (LMCS) publica gradualmente artigos de investigação em inglês sobre áreas teóricas e práticas da informática envolvendo métodos lógicos, no sentido mais amplo. Criada em 2014, a revista é editada pela Logical Methods in Computer Science e.V., uma organização sem fins lucrativos cujo objetivo é facilitar a difusão dos resultados científicos relativos à lógica em informática.
- Diretor de publicação: Lars Birkedal
- Redator responsável: Stefan Milius
- Tipo de suporte: digital
- Periodicidade: gradual
- Ano de criação: 2014
- Data de disponibilização online na Episciences: 2015
- eISSN: 1860-5974
- Disciplinas: métodos lógicos
- Idiomas da publicação: inglês
- Processo de avaliação: estudo cego
- CC BY 4.0 licence
- Editor: Logical Methods in Computer Science e.V.
- País: Alemanha
- Contacto: lmcs AT episciences.org
Últimos artigos
Universal Quantitative Algebra for Fuzzy Relations and Generalised Metric Spaces
We present a generalisation of the theory of quantitative algebras of Mardare, Panangaden and Plotkin where (i) the carriers of quantitative algebras are not restricted to be metric spaces and can be arbitrary fuzzy relations or generalised metric spaces, and (ii) the interpretations of the algebraic operations are not required to be nonexpansive. Our main results include: a novel sound and complete proof system, the proof that free quantitative algebras always exist, the proof of strict monadicity of the induced Free-Forgetful adjunction, the result that all monads (on fuzzy relations) that lift finitary monads (on sets) admit a quantitative equational presentation.
Mio, Matteo
December 03, 2024
Ler o artigo
Fine-grained Meta-Theorems for Vertex Integrity
Vertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter. In this paper we investigate the algorithmic trade-offs involved with this parameter from the point of view of algorithmic meta-theorems for First-Order (FO) and Monadic Second Order (MSO) logic. Our positive results are the following: (i) given a graph $G$ of vertex integrity $k$ and an FO formula $\phi$ with $q$ quantifiers, deciding if $G$ satisfies $\phi$ can be done in time $2^{O(k^2q+q\log q)}+n^{O(1)}$; (ii) for MSO formulas with $q$ quantifiers, the same can be done in time $2^{2^{O(k^2+kq)}}+n^{O(1)}$. Both results are obtained using kernelization arguments, which pre-process the input to sizes $2^{O(k^2)}q$ and $2^{O(k^2+kq)}$ respectively. The complexities of our meta-theorems are significantly better than the corresponding meta-theorems for tree-depth, which involve towers of exponentials. However, they are worse than the roughly $2^{O(kq)}$ and $2^{2^{O(k+q)}}$ complexities known for corresponding meta-theorems for vertex cover. To explain this deterioration we present two formula constructions which lead to fine-grained complexity lower bounds and establish that the dependence of our meta-theorems on $k$ is the best possible. More precisely, we show that it is not possible to decide FO formulas with $q$ quantifiers in time $2^{o(k^2q)}$, and that there exists a constant-size MSO formula which cannot be decided in time $2^{2^{o(k^2)}}$, both under the ETH. Hence, the quadratic blow-up in the dependence on $k$ is unavoidable and vertex integrity has a complexity for FO and MSO logic which is truly intermediate between vertex cover and tree-depth.
Lampis, Michael
December 03, 2024
Ler o artigo
Informática e matemática aplicada
MNA
[Mathematical Neuroscience and Applications]
MNA
Mathematical Neuroscience and Applications
Criada em 2021, a revista Mathematical Neuroscience and Applications (MNA) preocupa-se com a modelização e a análise matemática em todas as áreas das neurociências, isto é, o estudo do sistema nervoso e das suas disfunções. É a continuidade do Journal of Mathematical Neuroscience (2011-2021), anteriormente publicado na Springer. A revista acolha artigos na língua inglesa.
- Diretor de publicação: Bruno Sportisse
- Redator responsável: Olivier Faugeras
- Tipo de suporte: digital
- Periodicidade: anual
- Ano de criação: 2021
- Data de disponibilização online na Episciences: 2021
- eISSN: 2801-0159
- Disciplinas: neurociências
- Idiomas da publicação: inglês
- Processo de avaliação: estudo cego
- CC BY 4.0 licence
- Editor: Inria
- Endereço postal: Domaine de Voluceau Rocquencourt – B.P. 105 78153 Le Chesnay Cedex
- País: França
- Contacto: mna AT episciences.org
Últimos artigos
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
Ler o artigo
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
Ler o artigo
Informática e matemática aplicada
TheoretiCS
TheoretiCS
Criada em 2021, a TheoretiCS abrange todas as áreas da informática teórica (Theoretical Computer Science, TCS). Resultado de um esforço conjunto da comunidade TCS, a revista é publicada pela Fundação TheoretiCS, uma organização sem fins lucrativos situada na Alemanha. A revista publica gradualmente trabalhos de investigação em inglês, incluindo versões revistas e extensões de artigos de conferências.
- Diretor de publicação: Thomas Schwentick
- Redators responsáveis: Javier Esparza e Uri Zwick
- Tipo de suporte: digital
- Periodicidade: gradual
- Ano de criação: 2021
- Data de disponibilização online na Episciences: 2021
- eISSN: 2751-4838
- Disciplinas: informática teórica
- Idiomas da publicação: inglês
- Processo de avaliação: estudo cego
- CC BY 4.0 licence
- Editor: TheoretiCS Foundation e.V.
- Endereço postal: c/o Thomas Schwentick – Schillingstr. 23, D-44139 Dortmund
- País: Alemanha
- Contacto: theoretics AT episciences.org
Últimos artigos
On complete classes of valuated matroids
We characterize a rich class of valuated matroids, called R-minor valuated matroids that includes the indicator functions of matroids, and is closed under operations such as taking minors, duality, and induction by network. We exhibit a family of valuated matroids that are not R-minor based on sparse paving matroids. Valuated matroids are inherently related to gross substitute valuations in mathematical economics. By the same token we refute the Matroid Based Valuation Conjecture by Ostrovsky and Paes Leme (Theoretical Economics 2015) asserting that every gross substitute valuation arises from weighted matroid rank functions by repeated applications of merge and endowment operations. Our result also has implications in the context of Lorentzian polynomials: it reveals the limitations of known construction operations.
Husić, Edin
November 18, 2024
Ler o artigo
Optimal Algorithm for the Planar Two-Center Problem
We study a fundamental problem in Computational Geometry, the planar two-center problem. In this problem, the input is a set $S$ of $n$ points in the plane and the goal is to find two smallest congruent disks whose union contains all points of $S$. A longstanding open problem has been to obtain an $O(n\log n)$-time algorithm for planar two-center, matching the $\Omega(n\log n)$ lower bound given by Eppstein [SODA'97]. Towards this, researchers have made a lot of efforts over decades. The previous best algorithm, given by Wang [SoCG'20], solves the problem in $O(n\log^2 n)$ time. In this paper, we present an $O(n\log n)$-time (deterministic) algorithm for planar two-center, which completely resolves this open problem.
Cho, Kyungjin
November 05, 2024
Ler o artigo