Filters








4,211 Hits in 1.6 sec

Untwisting twisted spectral triples [article]

Magnus Goffeng, Bram Mesland, Adam Rennie
2019 arXiv   pre-print
We examine the index data associated to twisted spectral triples and higher order spectral triples. In particular, we show that a Lipschitz regular twisted spectral triple can always be 'logarithmically dampened' through functional calculus, to obtain an ordinary (ie untwisted) spectral triple. The same procedure turns higher order spectral triples into spectral triples. We provide examples of highly regular twisted spectral triples with nontrivial index data for which Moscovici's ansatz for a twisted local index formula is identically zero.
arXiv:1903.02463v1 fatcat:tqz22ilyuney5ezjj3kiquluqy

Failure-Tolerant Connectivity Maintenance for Robot Swarms [article]

Vivek Shankar Varadharajan, Bram Adams, Giovanni Beltrame
2019 arXiv   pre-print
Connectivity maintenance plays a key role in achieving a desired global behavior among a swarm of robots. However, connectivity maintenance in realistic environments is hampered by lack of computation resources, low communication bandwidth, robot failures, and unstable links. In this paper, we propose a novel decentralized connectivity-preserving algorithm that can be deployed on top of other behaviors to enforce connectivity constraints. The algorithm takes a set of targets to be reached while
more » ... keeping a minimum number of redundant links between robots, with the goal of guaranteeing bandwidth and reliability. Robots then incrementally build and maintain a communication backbone with the specified number of links. We empirically study the performance of the algorithm, analyzing its time to convergence, as well as robustness to faults injected into the backbone robots. Our results statistically demonstrate the algorithm's ability to preserve the desired connectivity constraints and to reach the targets with up to 70 percent of individual robot failures in the communication backbone.
arXiv:1905.04771v1 fatcat:jpucejcr3jdibfkg5hwm5ppi4a

Boundaries, spectral triples and K-homology [article]

Iain Forsyth, Magnus Goffeng, Bram Mesland, Adam Rennie
2016 arXiv   pre-print
This paper extends the notion of a spectral triple to a relative spectral triple, an unbounded analogue of a relative Fredholm module for an ideal J A. Examples include manifolds with boundary, manifolds with conical singularities, dimension drop algebras, θ-deformations and Cuntz-Pimsner algebras of vector bundles. The bounded transform of a relative spectral triple is a relative Fredholm module, making the image of a relative spectral triple under the boundary mapping in K-homology easy to
more » ... pute. We introduce an additional operator called a Clifford normal with which a relative spectral triple can be doubled into a spectral triple. The Clifford normal also provides a boundary Hilbert space, a representation of the quotient algebra, a boundary Dirac operator and an analogue of the Calderon projection. In the examples this data does assemble to give a boundary spectral triple, though we can not prove this in general. When we do obtain a boundary spectral triple, we provide sufficient conditions for the boundary triple to represent the K-homological boundary. Thus we abstract the proof of Baum-Douglas-Taylor's "boundary of Dirac is Dirac on the boundary" theorem into the realm of non-commutative geometry.
arXiv:1607.07143v1 fatcat:4bf7xd4eujasbbdqjxs2nxqv7i

Toward a traceable, explainable, and fairJD/Resume recommendation system [article]

Amine Barrak, Bram Adams, Amal Zouaq
2022 arXiv   pre-print
In the last few decades, companies are interested to adopt an online automated recruitment process in an international recruitment environment. The problem is that the recruitment of employees through the manual procedure is a time and money consuming process. As a result, processing a significant number of applications through conventional methods can lead to the recruitment of clumsy individuals. Different JD/Resume matching model architectures have been proposed and reveal a high accuracy
more » ... el in selecting relevant candidatesfor the required job positions. However, the development of an automatic recruitment system is still one of the main challenges. The reason is that the development of a fully automated recruitment system is a difficult task and poses different challenges. For example, providing a detailed matching explanation for the targeted stakeholders is needed to ensure a transparent recommendation. There are several knowledge bases that represent skills and competencies (e.g, ESCO, O*NET) that are used to identify the candidate and the required job skills for a matching purpose. Besides, modernpre-trained language models are fine-tuned for this context such as identifying lines where a specific feature was introduced. Typically, pre-trained language models use transfer-based machine learning models to be fine-tuned for a specific field. In this proposal, our aim is to explore how modern language models (based on transformers) can be combined with knowledge bases and ontologies to enhance the JD/Resume matching process. Our system aims at using knowledge bases and features to support the explainability of the JD/Resume matching. Finally, given that multiple software components, datasets, ontology, andmachine learning models will be explored, we aim at proposing a fair, ex-plainable, and traceable architecture for a Resume/JD matching purpose.
arXiv:2202.08960v1 fatcat:52mjmfklefhsfh7fhflmkgrime

Curvature of differentiable Hilbert modules and Kasparov modules [article]

Bram Mesland, Adam Rennie, Walter D. van Suijlekom
2019 arXiv   pre-print
In this paper we introduce the curvature of densely defined universal connections on Hilbert C^*-modules relative to a spectral triple (or unbounded Kasparov module), obtaining a well-defined curvature operator. Fixing the spectral triple, we find that modulo junk forms, the curvature only depends on the represented form of the universal connection. We refine our definition of curvature to factorisations of unbounded Kasparov modules. Our refined definition recovers all the curvature data of a
more » ... iemannian submersion of compact manifolds, viewed as a KK-factorisation.
arXiv:1911.05008v1 fatcat:pihwwnt2r5cajdoiv6j733fota

Towards an interdisciplinary, socio-technical analysis of software ecosystem health [article]

Tom Mens and Bram Adams and Josianne Marsan
2017 arXiv   pre-print
This extended abstract presents the research goals and preliminary research results of the interdisciplinary research project SECOHealth, an ongoing collaboration between research teams of Polytechnique Montreal (Canada), the University of Mons (Belgium) and Laval University (Canada). SECOHealth aims to contribute to research and practice in software engineering by delivering a validated interdisciplinary scientific methodology and a catalog of guidelines and recommendation tools for improving software ecosystem health.
arXiv:1711.04532v1 fatcat:nfyx3bsbjjhmrasmkrxg7ocgq4

Management of community contributions

Nicolas Bettenburg, Ahmed E. Hassan, Bram Adams, Daniel M. German
2013 Empirical Software Engineering  
Bram Adams is an assistant professor at the École Polytechnique de Montréal, where he heads the MCIS lab on Maintenance, Construction and Intelligence of Software (http://mcis.polymtl.ca).  ...  Bram has beem program co-chair of the ERA-track at the 2013 IEEE International Conference on Software Maintenance (ICSM) and of the 2013 International Working Conference on Source Code Analysis and Manipulation  ... 
doi:10.1007/s10664-013-9284-6 fatcat:wiyonpqalfefxi4sjru4vkyxg4

Release Engineering 3.0

Bram Adams, Stephany Bellomo, Christian Bird, Boris Debic, Foutse Khomh, Kim Moir, John ODuinn
2018 IEEE Software  
BRAM ADAMS is an associate professor at Polytechnique Montreal, where he heads the Lab on Maintenance, Construction, and Intelligence of Software.  ...  Adams obtained his PhD in computer science engineering from Ghent University.  ... 
doi:10.1109/ms.2018.1661327 fatcat:qvtjubbiajeqjjz2zbga3s4554

Release Practices for Mobile Apps–What do Users and Developers Think? [article]

Maleknaz Nayebi and Bram Adams and Guenther Ruhe
2019 arXiv   pre-print
Large software organizations such as Facebook or Netflix, who otherwise make daily or even hourly releases of their web applications using continuous delivery, have had to invest heavily into a customized release strategy for their mobile apps, because the vetting process of app stores introduces lag and uncertainty into the release process. Amidst these large, resourceful organizations, it is unknown how the average mobile app developer organizes her app's releases, even though an incorrect
more » ... ategy might bring a premature app update to the market that drives away customers towards the heavy market competition. To understand the common release strategies used for mobile apps, the rationale behind them and their perceived impact on users, we performed two surveys with users and developers. We found that half of the developers have a clear strategy for their mobile app releases, since especially the more experienced developers believe that it affects user feedback. We also found that users are aware of new app updates, yet only half of the surveyed users enables automatic updating of apps. While the release date and frequency is not a decisive factor to install an app, users prefer to install apps that were updated more recently and less frequently. Our study suggests that an app's release strategy is a factor that affects the ongoing success of mobile apps.
arXiv:1910.08876v1 fatcat:2vmheeuwe5c4lfybq6ror3ej4m

On the Threat of npm Vulnerable Dependencies in Node.js Applications [article]

Mahmoud Alfadel, Diego Elias Costa, Mouafak Mokhallalati, Emad Shihab, Bram Adams
2020 arXiv   pre-print
Software vulnerabilities have a large negative impact on the software systems that we depend on daily. Reports on software vulnerabilities always paint a grim picture, with some reports showing that 83% of organizations depend on vulnerable software. However, our experience leads us to believe that, in the grand scheme of things, these software vulnerabilities may have less impact than what is reported. Therefore, we perform a study to better understand the threat of npm vulnerable packages
more » ... in Node.js applications. We define three threat levels for vulnerabilities in packages, based on their lifecycle, where a package vulnerability is assigned a low threat level if it was hidden or still unknown at the time it was used in the dependent application (t), medium threat level if the vulnerability was reported but not yet published at t, and high if it was publicly announced at t. Then, we perform an empirical study involving 6,673 real-world, active, and mature open source Node.js applications. Our findings show that although 67.93% of the examined applications depend on at least one vulnerable package, 94.91% of the vulnerable packages in those affected applications are classified as having low threat. Moreover, we find that in the case of vulnerable packages classified as having high threat, it is the application's lack of updating that makes them vulnerable, i.e., it is not the existence of the vulnerability that is the real problem. Furthermore, we verify our findings at different stages of the application's lifetime and find that our findings still hold. Our study argues that when it comes to software vulnerabilities, things may not be as bad as they seem and that considering vulnerability threat is key.
arXiv:2009.09019v1 fatcat:pgsi6ptzmvhsddrazedk63wcv4

Towards language-independent Brown Build Detection

Doriane Olewicki, Mathieu Nayrolles, Bram Adams
2022 International Conference on Software Engineering  
In principle, continuous integration (CI) practices allow modern software organizations to build and test their products after each code change to detect quality issues as soon as possible. In reality, issues with the build scripts (e.g., missing dependencies) and/or the presence of "flaky tests" lead to build failures that essentially are false positives, not indicative of actual quality problems of the source code. For our industrial partner, which is active in the video game industry, such
more » ... rown builds" not only require multidisciplinary teams to spend more effort interpreting or even re-running the build, leading to substantial redundant build activity, but also slows down the integration pipeline. Hence, this paper aims to prototype and evaluate approaches for early detection of brown build results based on textual similarity to build logs of prior brown builds. The approach is tested on 7 projects (6 closed-source from our industrial collaborators and 1 open-source, Graphviz). We find that our model manages to detect brown builds with a mean F1score of 53% on the studied projects, which is three times more than the best baseline considered, and at least as good as human experts (but with less effort). Furthermore, we found that cross-project prediction can be used for a project's onboarding phase, that a training set of 30-weeks works best, and that our retraining heuristics keep the F1-score higher than the baseline, while retraining only every 4-5 weeks.
doi:10.1145/3510003.3510122 dblp:conf/icse/OlewickiNA22 fatcat:h6rtultmqzazplp6ldzjuzhyjm

On Ad Library Updates in Android Apps

Israel Mojica Ruiz, Meiyappan Nagappan, Bram Adams, Thorsten Berger, Steffen Dienst, Ahmed Hassan
2017 IEEE Software  
Bram Adams is an assistant professor at the Ecole Polytechnique de Montreal, where he heads the MCIS (Maintenance, Construction, and Intelligence of Software) lab.  ...  Adams received a PhD in computer science engineering from Ghent University. He was an organizer of the First International Workshop on Release Engineering (RELENG 13) and is a member of IEEE.  ... 
doi:10.1109/ms.2017.265094629 fatcat:dvxfhamcrnh6ba3wvogdvf2sf4

Studying software evolution using topic models

Stephen W. Thomas, Bram Adams, Ahmed E. Hassan, Dorothea Blostein
2014 Science of Computer Programming  
Topic models are generative probabilistic models which have been applied to information retrieval to automatically organize and provide structure to a text corpus. Topic models discover topics in the corpus, which represent real world concepts by frequently cooccurring words. Recently, researchers found topics to be effective tools for structuring various software artifacts, such as source code, requirements documents, and bug reports. This research also hypothesized that using topics to
more » ... e the evolution of software repositories could be useful for maintenance and understanding tasks. However, research has yet to determine whether these automatically discovered topic evolutions describe the evolution of source code in a way that is relevant or meaningful to project stakeholders, and thus it is not clear whether topic models are a suitable tool for this task. In this paper, we take a first step towards evaluating topic models in the analysis of software evolution by performing a detailed manual analysis on the source code histories of two well-known and well-documented systems, JHotDraw and jEdit. We define and compute various metrics on the discovered topic evolutions and manually investigate how and why the metrics evolve over time. We find that the large majority (87%-89%) of topic evolutions correspond well with actual code change activities by developers. We are thus encouraged to use topic models as tools for studying the evolution of a software system.
doi:10.1016/j.scico.2012.08.003 fatcat:dke4f6bp4jadheoyf63z3einum

Aspect-orientation For Revitalising Legacy Business Software

Kris De Schutter, Bram Adams
2007 Electronical Notes in Theoretical Computer Science  
This paper relates on a first attempt to see if aspect-oriented programming (AOP) and logic meta-programming (LMP) can help with the revitalisation of legacy business software. By means of four realistic case studies covering reverse engineering, restructuring and integration, we discuss the applicability of the aspect-oriented paradigm in the context of two major programming languages for legacy environments: Cobol and C.
doi:10.1016/j.entcs.2006.08.002 fatcat:l26qjbaxkbhyxo4x6doagdri3i

Self-Healing Ground-and-Air Connectivity Chains [article]

Vivek Shankar Varadharajan, David St-Onge, Bram Adams, Giovanni Beltrame
2019 arXiv   pre-print
Adams and Dr.  ... 
arXiv:1909.10496v1 fatcat:7vja73qugjbcpjljnc3tefvqjm
« Previous Showing results 1 — 15 out of 4,211 results