Publications

Practical Dynamic SC-Flip Polar Decoders: Algorithm and Implementation
Furkan Ercan
Thibaud Tonnellier
Nghia Doan
Warren Gross
SC-Flip (SCF) is a low-complexity polar code decoding algorithm with improved performance, and is an alternative to high-complexity (CRC)-ai… (voir plus)ded SC-List (CA-SCL) decoding. However, the performance improvement of SCF is limited since it can correct up to only one channel error (
2020-09-17
ArXiv (preprint)
doi.org
arxiv.org
A normative modelling approach reveals age-atypical cortical thickness in a subgroup of males with autism spectrum disorder
Richard A.I. Bethlehem
Jakob Seidlitz
Rafael Romero-Garcia
Stavros Trakoshis
Guillaume Dumas
Michael V. Lombardo
2020-09-04
Communications Biology (publié)
doi.org
Shared Decision Making in Surgery: A Meta-Analysis of Existing Literature
Kacper Niburski
Elena Guadagno
Samira Abbasgholizadeh-Rahimi
Dan Poenaru
2020-09-03
The Patient - Patient-Centered Outcomes Research (publié)
doi.org
Correction to: Why public health matters today and tomorrow: the role of applied public health research
Lindsay McLaren
Paula Braitstein
David Buckeridge
Damien Contandriopoulos
Maria I. Creatore
Guy Faulkner
David Hammond
Steven J. Hoffman
Yan Kestens
Scott Leatherdale
Jonathan McGavock
Wendy V. Norman
Candace Nykiforuk
Valéry Ridde
Janet Smylie
The article “Why public health matters today and tomorrow: the role of applied public health research,” written by Lindsay McLaren et al… (voir plus)., was originally published Online First without Open Access.
2020-09-02
Canadian Journal of Public Health = Revue Canadienne de Santé Publique (publié)
doi.org
Traceability Network Analysis: A Case Study of Links in Issue Tracking Systems
Alexander Nicholson
Deeksha M. Arya
Jin Guo
Traceability links between software artifacts serve as an invaluable resource for reasoning about software products and their development pr… (voir plus)ocess. Most conventional methods for capturing traceability are based on pair-wise artifact relations such as trace matrices or navigable links between two directly related artifacts. However, this limited view of trace links ignores the propagating effect of artifact connections as well as the trace link properties at a project level. In this work, we propose the use of network structures to provide another perspective from which reasoning on a collective of trace events is possible. We explore various network analysis techniques in the issue tracking system of sixty-six open source projects. Our observation reveals two salient properties of the traceability network, i.e. scale free and triadic closure. These properties provide a strong indication of the applicability of network analysis tools and can be used to identify and examine important "hub" issues. As a stepping stone, these properties can further support project status analysis and link type prediction. As a proof-of-concept, we demonstrate the effectiveness of applying the triadic closure property to link type prediction.
2020-09-01
International Workshop on Artificial Intelligence for Requirements Engineering (publié)
doi.org
A Neural Network Based Approach to Domain Modelling Relationships and Patterns Recognition
Rijul Saini
Gunter Mussbacher
Jin Guo
Jörg Kienzle
Model-Driven Software Engineering advocates the use of models and their transformations across different stages of software engineering to b… (voir plus)etter understand and analyze systems under development. Domain modelling is used during requirements analysis or the early stages of design to transform informal requirements written in natural language to domain models which are analyzable and more concise. Since domain modelling is time-consuming and requires modelling skills and experience, many approaches have been proposed to extract domain concepts and relationships automatically using extraction rules. However, relationships and patterns are often hidden in the sentences of a problem description. Automatic recognition of relationships or patterns in those cases requires context information and external knowledge of participating domain concepts, which goes beyond what is possible with extraction rules. In this paper, we draw on recent work on domain model extraction and envision a novel technique where sentence boundaries are customized and clusters of sentences are created for domain concepts. The technique further exploits a BiLSTM neural network model to identify relationships and patterns among domain concepts. We also present a classification strategy for relationships and patterns and use it to instantiate our technique. Preliminary results indicate that this novel idea is promising and warrants further research.
2020-08-31
2020 IEEE Tenth International Model-Driven Requirements Engineering (MoDRE) (publié)
doi.org
Information correspondence between types of documentation for APIs
Deeksha M. Arya
Jin Guo
Martin P. Robillard
2020-08-26
Empirical Software Engineering (publié)
doi.org
Different scaling of linear models and deep learning in UKBiobank brain images versus machine-learning datasets
Marc-Andre Schulz
B.T. Thomas Yeo
Joshua T. Vogelstein
Janaina Mourao-Miranada
Jakob N. Kather
Konrad Paul Kording
Blake Richards
Danilo Bzdok
2020-08-25
Nature Communications (publié)
doi.org
BIAS: Transparent reporting of biomedical image analysis challenges
Lena Maier-Hein
Annika Reinke
Michal Kozubek
Anne L. Martel
Tal Arbel
Matthias Eisenmann
Allan Hanbury
Pierre Jannin
Henning Müller
Sinan Onogur
Julio Saez-Rodriguez
Bram van Ginneken
Annette Kopp-Schneider
Bennett Landman
2020-08-21
Medical Image Analysis (publié)
doi.org
arxiv.org
Laplacian Change Point Detection for Dynamic Graphs
Shenyang Huang
Yasmeen Hitti
Guillaume Rabusseau
Reihaneh Rabbany
2020-08-20
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (publié)
doi.org
arxiv.org
Adaptive Learning of Tensor Network Structures
Meraj Hashemizadeh
Michelle Liu
Jacob Miller
Guillaume Rabusseau
Tensor Networks (TN) offer a powerful framework to efficiently represent very high-dimensional objects. TN have recently shown their potenti… (voir plus)al for machine learning applications and offer a unifying view of common tensor decomposition models such as Tucker, tensor train (TT) and tensor ring (TR). However, identifying the best tensor network structure from data for a given task is challenging. In this work, we leverage the TN formalism to develop a generic and efficient adaptive algorithm to jointly learn the structure and the parameters of a TN from data. Our method is based on a simple greedy approach starting from a rank one tensor and successively identifying the most promising tensor network edges for small rank increments. Our algorithm can adaptively identify TN structures with small number of parameters that effectively optimize any differentiable objective function. Experiments on tensor decomposition, tensor completion and model compression tasks demonstrate the effectiveness of the proposed algorithm. In particular, our method outperforms the state-of-the-art evolutionary topology search [Li and Sun, 2020] for tensor decomposition of images (while being orders of magnitude faster) and finds efficient tensor network structures to compress neural networks outperforming popular TT based approaches [Novikov et al., 2015].
2020-08-12
ArXiv (prépublication)
openreview.net
openreview.net
''COGITO in Space'': a thought experiment in exo-neurobiology
Daniela de Paulis
Stephen Whitmarsh
Robert Oostenveld
Guillaume Dumas
Michael Sanders
2020-08-04
(publié)
doi.org