- home
- Advanced Search
- Neuroinformatics
- Publications
- Research data
- Hyper Article en Ligne
- Mémoires en Sciences de l'Informati...
- Neuroinformatics
- Publications
- Research data
- Hyper Article en Ligne
- Mémoires en Sciences de l'Informati...
Loading
description Publicationkeyboard_double_arrow_right Preprint , Article , Other literature type 2030 FrancePublisher:CAIRN Funded by:ANR | AMSE (EUR)ANR| AMSE (EUR)Authors: Grillo, Alberto; Raiber, Eva;Grillo, Alberto; Raiber, Eva;Belgian and Swiss media regularly interfere during French elections by releasing exit polls before polling stations close. These foreign media profit from a law forbidding the same behavior by their French counterparts to receive large inflows of web visits from France. We exploit the unusual timing and degree of confidence with which exit polls were released in the second round of the 2017 presidential elections to investigate their effect on voter turnout. Our analysis is based on comparing turnout rates at different times on the election day, in the first and second round, and with respect to previous elections. We find a significant decrease in turnout of around 3 to 4 percentage points after the exit polls' publication which is suggestive of a causal effect, although similar trends were observed in previous elections. The effect is stronger in departments close to the Belgian border shortly after the release of the exit polls. We do not find clear evidence that either candidate benefited from the decrease in turnout, yet we cannot exclude the presence of a small underdog effect which reduced the winning margin by around 1 percentage point.
Hyper Article en Lig... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationPreprint . 2022add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.3917/reco.pr2.0188&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationPreprint . 2022add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.3917/reco.pr2.0188&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Preprint 2024Publisher:Elsevier BV Funded by:ANR | HIGGSAUTOMATOR, ANR | DMwithLLPatLHCANR| HIGGSAUTOMATOR ,ANR| DMwithLLPatLHCAuthors: Mark D. Goodsell; Ari Joury;Mark D. Goodsell; Ari Joury;We introduce BSMArt, a python program for the exploration of parameter spaces of theories Beyond the Standard Model. Especially designed for use with the SARAH family of tools, it is also sufficiently flexible to be used with a wide variety of external codes. BSMArt contains the first public release of the Active Learning scan by the same authors; but contains several additional scanning algorithms, ranging from the very simple to MultiNest and Diver. A BSMArt scan can be set up in a matter of minutes with only minimal editing of configuration files; installation scripts for all relevant tools and examples are provided. Comment: 33 pages; no figures. Code available at https://goodsell.pages.in2p3.fr/bsmart/
arXiv.org e-Print Ar... arrow_drop_down Computer Physics CommunicationsArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: CrossrefHyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Article . 2024 . 2023https://doi.org/10.48550/arxiv...Article . 2023License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cpc.2023.109057&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down Computer Physics CommunicationsArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: CrossrefHyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Article . 2024 . 2023https://doi.org/10.48550/arxiv...Article . 2023License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cpc.2023.109057&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Other literature type , Conference object 2024Publisher:Elsevier BV Authors: Zacharie Ales; Valentine Huré; Amélie Lambert;Zacharie Ales; Valentine Huré; Amélie Lambert;International audience; Interpretability is a growing concept in Machine Learning. Decision-making algorithms are more and more used in healthcare, finance or other high stakes contexts. Therefore, the need for algorithms whose decisions are understandable is of the utmost importance. Intrinsically interpretable classifiers such as decision trees are often seen as less accurate than black box models such as neural networks. For decision trees, state-of-the-art methods are recursive heuristics (e.g. CART) that may fail to find underlying characteristics in datasets. Recently, linear formulations were introduced to model the problem of the construction of the best decision tree for a given dataset. Notably, a MIO formulation, introduced by Bertsimas and al., has shown better accuracy than CART. However this model does not scale up to datasets with more than 1000 data points. Our work focuses on improvements of MIOs that speed up their resolution in order to handle larger problems. We present a quadratic formulation of the MIP devised by Bertsimas and al. as well as its linearization and another that extends a flow-formulation (from binary dataset to real-value dataset). We prove that our new formulations have stronger continuous relaxation than the MIP introduced by Bertsimas and al.. Finally, our experiments show that they have a significantly smaller resolution time than the MIP of Bertsimas and al. while maintaining or improving performances on test sets.
Computers & Operatio... arrow_drop_down Computers & Operations ResearchArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationArticle . 2023Full-Text: https://hal.science/hal-03865931v2/documentMémoires en Sciences de l'Information et de la CommunicationConference object . 2022add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cor.2023.106515&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Computers & Operatio... arrow_drop_down Computers & Operations ResearchArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationArticle . 2023Full-Text: https://hal.science/hal-03865931v2/documentMémoires en Sciences de l'Information et de la CommunicationConference object . 2022add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cor.2023.106515&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article 2024 FrancePublisher:Elsevier BV Authors: Alev, Jacques; Dumas, François; Lecoutre, César;Alev, Jacques; Dumas, François; Lecoutre, César;International audience; We study from the point of view of rational equivalence the enveloping algebras of Lie algebras of dimension 3 whose derived Lie subalgebra is of dimension 2, over an algebraically closed base field in arbitrary characteristics.
HAL Clermont Univers... arrow_drop_down HAL Clermont Université; Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Article . 2022 . 2024Full-Text: https://hal.science/hal-03848568/documentJournal of Pure and Applied AlgebraArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2022License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.jpaa.2023.107504&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert HAL Clermont Univers... arrow_drop_down HAL Clermont Université; Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Article . 2022 . 2024Full-Text: https://hal.science/hal-03848568/documentJournal of Pure and Applied AlgebraArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2022License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.jpaa.2023.107504&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article 2024 FrancePublisher:Elsevier BV Authors: Pang, Gang; Ji, Songsong; Antoine, Xavier;Pang, Gang; Ji, Songsong; Antoine, Xavier;The construction of exact absorbing boundary conditions (ABCs) for the one-dimensional nonlocal fully-discrete Schrödinger equation is proposed. The computation of the Green's functions for the discrete nonlocal Schrödinger equation is stated and used to build the ABCs. Numerical error estimates are then proved for the case of a singular interaction kernel. The theory and numerical analysis is supported by numerical examples.
Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Hal-DiderotOther literature type . Preprint . 2021Journal of Computational and Applied MathematicsArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cam.2023.115623&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Hal-DiderotOther literature type . Preprint . 2021Journal of Computational and Applied MathematicsArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cam.2023.115623&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Preprint 2024 FrancePublisher:Elsevier BV Éric Duchêne; Valentin Gledel; Sylvain Gravier; Fionn Mc Inerney; Mehdi Mhalla; Aline Parreau;In this paper, we introduce and study a new scoring game on graphs called SMASH AND GRAB. In this game, two players, called Left and Right, take turns removing a vertex of the graph as well as all of its neighbours that become isolated by this removal. For each player and each of their turns, they score the number of vertices that were removed on their turn. The game ends when there are no more vertices remaining, and the player with the highest final score wins. We denote by $Ls(G)$ the difference between Left and Right's final scores in $G$ when Left starts and both players play optimally (they both aim to maximise their scores). We mainly study this parameter for different graph classes. We notably prove that $Ls(F) ≥ 0$ for any forest $F$ (i.e., the first player cannot lose). We then use this result to compute the exact value of $Ls(G)$ for particular forests such as unions of paths and subdivided stars. The result in paths then solves the case of a unique cycle. Finally, we prove that, for a generalisation of the game, computing the score is PSPACE-complete.
Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Other literature type . Preprint . 2021Full-Text: https://hal.science/hal-03371099/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.tcs.2024.114417&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Other literature type . Preprint . 2021Full-Text: https://hal.science/hal-03371099/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.tcs.2024.114417&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Other literature type 2024 FrancePublisher:Elsevier BV Funded by:NIH | Alzheimers Disease Neuroi..., ANR | PRAIRIE, ANR | IHU-A-ICM +1 projectsNIH| Alzheimers Disease Neuroimaging Initiative ,ANR| PRAIRIE ,ANR| IHU-A-ICM ,CIHRSophie Loizillon; Simona Bottani; Aurélien Maire; Sebastian Ströer; Didier Dormont; Olivier Colliot; Ninon Burgos;International audience; Containing the medical data of millions of patients, clinical data warehouses (CDWs) represent a great opportunity to develop computational tools. Magnetic resonance images (MRIs) are particularly sensitive to patient movements during image acquisition, which will result in artefacts (blurring, ghosting and ringing) in the reconstructed image. As a result, a significant number of MRIs in CDWs are corrupted by these artefacts and may be unusable. Since their manual detection is impossible due to the large number of scans, it is necessary to develop tools to automatically exclude (or at least identify) images with motion in order to fully exploit CDWs. In this paper, we propose a novel transfer learning method for the automatic detection of motion in 3D T1-weighted brain MRI. The method consists of two steps: a pre-training on research data using synthetic motion, followed by a fine-tuning step to generalise our pre-trained model to clinical data, relying on the labelling of 4045 images. The objectives were both (1) to be able to exclude images with severe motion, (2) to detect mild motion artefacts. Our approach achieved excellent accuracy for the first objective with a balanced accuracy nearly similar to that of the annotators (balanced accuracy>80 %). However, for the second objective, the performance was weaker and substantially lower than that of human raters. Overall, our framework will be useful to take advantage of CDWs in medical imaging and highlight the importance of a clinical validation of models trained on research data.
add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.media.2023.103073&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.media.2023.103073&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article 2024 FrancePublisher:Elsevier BV Funded by:ANR | CARPLOANR| CARPLOAuthors: Falque, Justine; Novelli, Jean-Christophe; Thibon, Jean-Yves;Falque, Justine; Novelli, Jean-Christophe; Thibon, Jean-Yves;In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249--3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute $p_n(S)$, the number of permutations of $S_n$ with pinnacle set $S$, and a conjectural closed formula for the related numbers $q_n(S)$. We determine the lexicographically minimal elements of the orbits of the modified Foata-Strehl action, prove that these elements form a lower ideal of the left weak order and characterize and count the maximal elements of this ideal. 16 pages, LaTEX
arXiv.org e-Print Ar... arrow_drop_down Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Preprint . 2022https://doi.org/10.48550/arxiv...Article . 2021License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.disc.2023.113834&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Preprint . 2022https://doi.org/10.48550/arxiv...Article . 2021License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.disc.2023.113834&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint 2024 France EnglishPublisher:HAL CCSD Authors: Lefort-Besnard, Jeremy; Nichols, Thomas E.; Maumet, Camille;Lefort-Besnard, Jeremy; Nichols, Thomas E.; Maumet, Camille;National audience; Les chercheurs utilisant des données d'IRMf de tâche disposent d'une vaste gamme d'outils d'analyse pour modéliser l'activité cérébrale. Cette diversité d'approches analytiques signifie qu'il existe de nombreuses variations possibles du même résultat d'imagerie. L'analyse d'un ensemble de données avec une seule approche peut donc être trompeuse. Une solution efficace est d’utiliser une analyse multivers, où plusieurs ensembles de résultats sont obtenus en exécutant différents pipelines sur les mêmes données. Toutefois, le postulat de départ pour les méta-analyses traditionnelles est l'indépendance des données d'entrée. C’est pourquoi nous présentons ici des méthodes de "méta-analyse sur mêmes données" afin d’examiner plusieurs ensembles de résultats de neuro-imagerie issus d'une analyse multivers, tout en tenant compte de la dépendance entre les analyses. La validité de ces méthodes est évaluée et comparée aux méthodes de méta-analyse traditionnelles. Nous évaluons la validité des méthodes sur des simulations ainsi que sur des données réelles provenant de l’étude "NARPS" (Botvinik-Nezer et al. 2020), une analyse multivers avec 70 cartes statistiques issues des mêmes données. Nos résultats montrent que les méthodes développées précisément pour l’analyse multivers sont valides et présentent différents profils de significativité en fonction de leurs spécificités. Ces différents résultats illustrent différents types d’inférences que les analystes pourraient souhaiter mener en fonction des hypothèses sous-jacentes de leurs études.
All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=od_______212::17c3a6573ebde38221424847858e74c3&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=od_______212::17c3a6573ebde38221424847858e74c3&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Other literature type , Article 2024 FrancePublisher:Elsevier BV Funded by:ANR | PING-ACKANR| PING-ACKAuthors: Grandjean, Etienne; Grente, Théo; Terrier, Véronique;Grandjean, Etienne; Grente, Théo; Terrier, Véronique;Descriptive complexity provides intrinsic, that is,machine-independent, characterizations of the major complexity classes. On the other hand, logic can be useful for designing programs in a natural declarative way. This is particularly important for parallel computation models such as cellular automata, because designing parallel programs is considered a difficult task.This paper establishes three logical characterizations of the three classical complexity classes modeling minimal time, called real-time, of one-dimensional cellular automata according to their canonical variants: unidirectional or bidirectional communication, input word given in a parallel or sequential way.Our three logics are natural restrictions of existential second-order Horn logic with built-in successor and predecessor functions. These logics correspond exactly to the three ways of deciding a language on a square grid circuit of side n according to one of the three canonical locations of an input word of length n: along a side of the grid, on the diagonal that contains the output cell, or on the diagonal opposite to the output cell.The key ingredient of our results is a normalization method that transforms a formula from one of our three logics into an equivalent normalized formula that faithfully mimics a grid circuit.Then, we extend our logics by allowing a limited use of negation on hypotheses like in Stratified Datalog. By revisiting in detail a number of representative classical problems - recognition of the set of primes by Fisher’s algorithm, Dyck language recognition, Firing Squad Synchronization problem,etc. - we show that this extension makes easier programming and we prove that it does not change the complexity of our logics in real-time.Finally, starting from our experience in expressing those representative problems in logic, we argue that our logics are high-level programming languages: they allow to express in a natural,precise and synthetic way the algorithms of literature, based on signals, and to translate them automatically into cellular automata of the same complexity.
Hyper Article en Lig... arrow_drop_down Theoretical Computer ScienceArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.tcs.2023.114355&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Theoretical Computer ScienceArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.tcs.2023.114355&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu
Loading
description Publicationkeyboard_double_arrow_right Preprint , Article , Other literature type 2030 FrancePublisher:CAIRN Funded by:ANR | AMSE (EUR)ANR| AMSE (EUR)Authors: Grillo, Alberto; Raiber, Eva;Grillo, Alberto; Raiber, Eva;Belgian and Swiss media regularly interfere during French elections by releasing exit polls before polling stations close. These foreign media profit from a law forbidding the same behavior by their French counterparts to receive large inflows of web visits from France. We exploit the unusual timing and degree of confidence with which exit polls were released in the second round of the 2017 presidential elections to investigate their effect on voter turnout. Our analysis is based on comparing turnout rates at different times on the election day, in the first and second round, and with respect to previous elections. We find a significant decrease in turnout of around 3 to 4 percentage points after the exit polls' publication which is suggestive of a causal effect, although similar trends were observed in previous elections. The effect is stronger in departments close to the Belgian border shortly after the release of the exit polls. We do not find clear evidence that either candidate benefited from the decrease in turnout, yet we cannot exclude the presence of a small underdog effect which reduced the winning margin by around 1 percentage point.
Hyper Article en Lig... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationPreprint . 2022add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.3917/reco.pr2.0188&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Mémoires en Sciences de l'Information et de la CommunicationPreprint . 2022add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.3917/reco.pr2.0188&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Preprint 2024Publisher:Elsevier BV Funded by:ANR | HIGGSAUTOMATOR, ANR | DMwithLLPatLHCANR| HIGGSAUTOMATOR ,ANR| DMwithLLPatLHCAuthors: Mark D. Goodsell; Ari Joury;Mark D. Goodsell; Ari Joury;We introduce BSMArt, a python program for the exploration of parameter spaces of theories Beyond the Standard Model. Especially designed for use with the SARAH family of tools, it is also sufficiently flexible to be used with a wide variety of external codes. BSMArt contains the first public release of the Active Learning scan by the same authors; but contains several additional scanning algorithms, ranging from the very simple to MultiNest and Diver. A BSMArt scan can be set up in a matter of minutes with only minimal editing of configuration files; installation scripts for all relevant tools and examples are provided. Comment: 33 pages; no figures. Code available at https://goodsell.pages.in2p3.fr/bsmart/
arXiv.org e-Print Ar... arrow_drop_down Computer Physics CommunicationsArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: CrossrefHyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Article . 2024 . 2023https://doi.org/10.48550/arxiv...Article . 2023License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cpc.2023.109057&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down Computer Physics CommunicationsArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: CrossrefHyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Article . 2024 . 2023https://doi.org/10.48550/arxiv...Article . 2023License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cpc.2023.109057&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Other literature type , Conference object 2024Publisher:Elsevier BV Authors: Zacharie Ales; Valentine Huré; Amélie Lambert;Zacharie Ales; Valentine Huré; Amélie Lambert;International audience; Interpretability is a growing concept in Machine Learning. Decision-making algorithms are more and more used in healthcare, finance or other high stakes contexts. Therefore, the need for algorithms whose decisions are understandable is of the utmost importance. Intrinsically interpretable classifiers such as decision trees are often seen as less accurate than black box models such as neural networks. For decision trees, state-of-the-art methods are recursive heuristics (e.g. CART) that may fail to find underlying characteristics in datasets. Recently, linear formulations were introduced to model the problem of the construction of the best decision tree for a given dataset. Notably, a MIO formulation, introduced by Bertsimas and al., has shown better accuracy than CART. However this model does not scale up to datasets with more than 1000 data points. Our work focuses on improvements of MIOs that speed up their resolution in order to handle larger problems. We present a quadratic formulation of the MIP devised by Bertsimas and al. as well as its linearization and another that extends a flow-formulation (from binary dataset to real-value dataset). We prove that our new formulations have stronger continuous relaxation than the MIP introduced by Bertsimas and al.. Finally, our experiments show that they have a significantly smaller resolution time than the MIP of Bertsimas and al. while maintaining or improving performances on test sets.
Computers & Operatio... arrow_drop_down Computers & Operations ResearchArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationArticle . 2023Full-Text: https://hal.science/hal-03865931v2/documentMémoires en Sciences de l'Information et de la CommunicationConference object . 2022add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cor.2023.106515&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Computers & Operatio... arrow_drop_down Computers & Operations ResearchArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: CrossrefMémoires en Sciences de l'Information et de la CommunicationArticle . 2023Full-Text: https://hal.science/hal-03865931v2/documentMémoires en Sciences de l'Information et de la CommunicationConference object . 2022add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cor.2023.106515&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article 2024 FrancePublisher:Elsevier BV Authors: Alev, Jacques; Dumas, François; Lecoutre, César;Alev, Jacques; Dumas, François; Lecoutre, César;International audience; We study from the point of view of rational equivalence the enveloping algebras of Lie algebras of dimension 3 whose derived Lie subalgebra is of dimension 2, over an algebraically closed base field in arbitrary characteristics.
HAL Clermont Univers... arrow_drop_down HAL Clermont Université; Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Article . 2022 . 2024Full-Text: https://hal.science/hal-03848568/documentJournal of Pure and Applied AlgebraArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2022License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.jpaa.2023.107504&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert HAL Clermont Univers... arrow_drop_down HAL Clermont Université; Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Article . 2022 . 2024Full-Text: https://hal.science/hal-03848568/documentJournal of Pure and Applied AlgebraArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefhttps://doi.org/10.48550/arxiv...Article . 2022License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.jpaa.2023.107504&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article 2024 FrancePublisher:Elsevier BV Authors: Pang, Gang; Ji, Songsong; Antoine, Xavier;Pang, Gang; Ji, Songsong; Antoine, Xavier;The construction of exact absorbing boundary conditions (ABCs) for the one-dimensional nonlocal fully-discrete Schrödinger equation is proposed. The computation of the Green's functions for the discrete nonlocal Schrödinger equation is stated and used to build the ABCs. Numerical error estimates are then proved for the case of a singular interaction kernel. The theory and numerical analysis is supported by numerical examples.
Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Hal-DiderotOther literature type . Preprint . 2021Journal of Computational and Applied MathematicsArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cam.2023.115623&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Hal-DiderotOther literature type . Preprint . 2021Journal of Computational and Applied MathematicsArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.cam.2023.115623&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Preprint 2024 FrancePublisher:Elsevier BV Éric Duchêne; Valentin Gledel; Sylvain Gravier; Fionn Mc Inerney; Mehdi Mhalla; Aline Parreau;In this paper, we introduce and study a new scoring game on graphs called SMASH AND GRAB. In this game, two players, called Left and Right, take turns removing a vertex of the graph as well as all of its neighbours that become isolated by this removal. For each player and each of their turns, they score the number of vertices that were removed on their turn. The game ends when there are no more vertices remaining, and the player with the highest final score wins. We denote by $Ls(G)$ the difference between Left and Right's final scores in $G$ when Left starts and both players play optimally (they both aim to maximise their scores). We mainly study this parameter for different graph classes. We notably prove that $Ls(F) ≥ 0$ for any forest $F$ (i.e., the first player cannot lose). We then use this result to compute the exact value of $Ls(G)$ for particular forests such as unions of paths and subdivided stars. The result in paths then solves the case of a unique cycle. Finally, we prove that, for a generalisation of the game, computing the score is PSPACE-complete.
Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Other literature type . Preprint . 2021Full-Text: https://hal.science/hal-03371099/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.tcs.2024.114417&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la Communication; HAL Lumiere Lyon 2Other literature type . Preprint . 2021Full-Text: https://hal.science/hal-03371099/documentadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.tcs.2024.114417&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Article , Other literature type 2024 FrancePublisher:Elsevier BV Funded by:NIH | Alzheimers Disease Neuroi..., ANR | PRAIRIE, ANR | IHU-A-ICM +1 projectsNIH| Alzheimers Disease Neuroimaging Initiative ,ANR| PRAIRIE ,ANR| IHU-A-ICM ,CIHRSophie Loizillon; Simona Bottani; Aurélien Maire; Sebastian Ströer; Didier Dormont; Olivier Colliot; Ninon Burgos;International audience; Containing the medical data of millions of patients, clinical data warehouses (CDWs) represent a great opportunity to develop computational tools. Magnetic resonance images (MRIs) are particularly sensitive to patient movements during image acquisition, which will result in artefacts (blurring, ghosting and ringing) in the reconstructed image. As a result, a significant number of MRIs in CDWs are corrupted by these artefacts and may be unusable. Since their manual detection is impossible due to the large number of scans, it is necessary to develop tools to automatically exclude (or at least identify) images with motion in order to fully exploit CDWs. In this paper, we propose a novel transfer learning method for the automatic detection of motion in 3D T1-weighted brain MRI. The method consists of two steps: a pre-training on research data using synthetic motion, followed by a fine-tuning step to generalise our pre-trained model to clinical data, relying on the labelling of 4045 images. The objectives were both (1) to be able to exclude images with severe motion, (2) to detect mild motion artefacts. Our approach achieved excellent accuracy for the first objective with a balanced accuracy nearly similar to that of the annotators (balanced accuracy>80 %). However, for the second objective, the performance was weaker and substantially lower than that of human raters. Overall, our framework will be useful to take advantage of CDWs in medical imaging and highlight the importance of a clinical validation of models trained on research data.
add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.media.2023.103073&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert add ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.media.2023.103073&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Article 2024 FrancePublisher:Elsevier BV Funded by:ANR | CARPLOANR| CARPLOAuthors: Falque, Justine; Novelli, Jean-Christophe; Thibon, Jean-Yves;Falque, Justine; Novelli, Jean-Christophe; Thibon, Jean-Yves;In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249--3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute $p_n(S)$, the number of permutations of $S_n$ with pinnacle set $S$, and a conjectural closed formula for the related numbers $q_n(S)$. We determine the lexicographically minimal elements of the orbits of the modified Foata-Strehl action, prove that these elements form a lower ideal of the left weak order and characterize and count the maximal elements of this ideal. 16 pages, LaTEX
arXiv.org e-Print Ar... arrow_drop_down Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Preprint . 2022https://doi.org/10.48550/arxiv...Article . 2021License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.disc.2023.113834&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.euAccess RoutesGreen 0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert arXiv.org e-Print Ar... arrow_drop_down Hyper Article en Ligne; Mémoires en Sciences de l'Information et de la CommunicationOther literature type . Preprint . 2022https://doi.org/10.48550/arxiv...Article . 2021License: arXiv Non-Exclusive DistributionData sources: Dataciteadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.disc.2023.113834&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint 2024 France EnglishPublisher:HAL CCSD Authors: Lefort-Besnard, Jeremy; Nichols, Thomas E.; Maumet, Camille;Lefort-Besnard, Jeremy; Nichols, Thomas E.; Maumet, Camille;National audience; Les chercheurs utilisant des données d'IRMf de tâche disposent d'une vaste gamme d'outils d'analyse pour modéliser l'activité cérébrale. Cette diversité d'approches analytiques signifie qu'il existe de nombreuses variations possibles du même résultat d'imagerie. L'analyse d'un ensemble de données avec une seule approche peut donc être trompeuse. Une solution efficace est d’utiliser une analyse multivers, où plusieurs ensembles de résultats sont obtenus en exécutant différents pipelines sur les mêmes données. Toutefois, le postulat de départ pour les méta-analyses traditionnelles est l'indépendance des données d'entrée. C’est pourquoi nous présentons ici des méthodes de "méta-analyse sur mêmes données" afin d’examiner plusieurs ensembles de résultats de neuro-imagerie issus d'une analyse multivers, tout en tenant compte de la dépendance entre les analyses. La validité de ces méthodes est évaluée et comparée aux méthodes de méta-analyse traditionnelles. Nous évaluons la validité des méthodes sur des simulations ainsi que sur des données réelles provenant de l’étude "NARPS" (Botvinik-Nezer et al. 2020), une analyse multivers avec 70 cartes statistiques issues des mêmes données. Nos résultats montrent que les méthodes développées précisément pour l’analyse multivers sont valides et présentent différents profils de significativité en fonction de leurs spécificités. Ces différents résultats illustrent différents types d’inférences que les analystes pourraient souhaiter mener en fonction des hypothèses sous-jacentes de leurs études.
All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=od_______212::17c3a6573ebde38221424847858e74c3&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=od_______212::17c3a6573ebde38221424847858e74c3&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eudescription Publicationkeyboard_double_arrow_right Preprint , Other literature type , Article 2024 FrancePublisher:Elsevier BV Funded by:ANR | PING-ACKANR| PING-ACKAuthors: Grandjean, Etienne; Grente, Théo; Terrier, Véronique;Grandjean, Etienne; Grente, Théo; Terrier, Véronique;Descriptive complexity provides intrinsic, that is,machine-independent, characterizations of the major complexity classes. On the other hand, logic can be useful for designing programs in a natural declarative way. This is particularly important for parallel computation models such as cellular automata, because designing parallel programs is considered a difficult task.This paper establishes three logical characterizations of the three classical complexity classes modeling minimal time, called real-time, of one-dimensional cellular automata according to their canonical variants: unidirectional or bidirectional communication, input word given in a parallel or sequential way.Our three logics are natural restrictions of existential second-order Horn logic with built-in successor and predecessor functions. These logics correspond exactly to the three ways of deciding a language on a square grid circuit of side n according to one of the three canonical locations of an input word of length n: along a side of the grid, on the diagonal that contains the output cell, or on the diagonal opposite to the output cell.The key ingredient of our results is a normalization method that transforms a formula from one of our three logics into an equivalent normalized formula that faithfully mimics a grid circuit.Then, we extend our logics by allowing a limited use of negation on hypotheses like in Stratified Datalog. By revisiting in detail a number of representative classical problems - recognition of the set of primes by Fisher’s algorithm, Dyck language recognition, Firing Squad Synchronization problem,etc. - we show that this extension makes easier programming and we prove that it does not change the complexity of our logics in real-time.Finally, starting from our experience in expressing those representative problems in logic, we argue that our logics are high-level programming languages: they allow to express in a natural,precise and synthetic way the algorithms of literature, based on signals, and to translate them automatically into cellular automata of the same complexity.
Hyper Article en Lig... arrow_drop_down Theoretical Computer ScienceArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.tcs.2023.114355&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu0 citations 0 popularity Average influence Average impulse Average Powered by BIP!more_vert Hyper Article en Lig... arrow_drop_down Theoretical Computer ScienceArticle . 2024 . Peer-reviewedLicense: Elsevier TDMData sources: Crossrefadd ClaimPlease grant OpenAIRE to access and update your ORCID works.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.This Research product is the result of merged Research products in OpenAIRE.
You have already added works in your ORCID record related to the merged Research product.All Research productsarrow_drop_down <script type="text/javascript"> <!-- document.write('<div id="oa_widget"></div>'); document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=10.1016/j.tcs.2023.114355&type=result"></script>'); --> </script>
For further information contact us at helpdesk@openaire.eu