{"id":664,"date":"2024-12-09T11:03:12","date_gmt":"2024-12-09T10:03:12","guid":{"rendered":"https:\/\/blogg.lnu.se\/disa\/?p=664"},"modified":"2024-12-09T11:03:14","modified_gmt":"2024-12-09T10:03:14","slug":"welcome-to-higher-research-seminar-241213","status":"publish","type":"post","link":"https:\/\/blogg.lnu.se\/disa\/?p=664","title":{"rendered":"Welcome to Higher Research Seminar 241213"},"content":{"rendered":"\n

When? Friday December 13th 14-16
Where? Onsite: D2272 and via zoom
Registration: Please sign up for the PhD-seminar via this link by https:\/\/forms.gle\/94Gb6pGdQ5qj2BeD7 <\/a>December 11th (especially important if you plan on attending onsite so we have fika for everyone)<\/p>\n\n\n\n

Agenda<\/strong><\/p>\n\n\n\n

14.00-14.10 Welcome and practical information from Welf L\u00f6we<\/em>
14.10-14.55 Presentation and discussion: The deterministic pancake forest \u2013 Jonas Nordqvist<\/em>
14.55 \u2013 15.05 Coffee break
15.05 \u2013 15.50 Presentation and discussion \u2013 “Will It Hold? Predicting the Joinability of Metals Before Welding Them” and “A Foundational Approach for Fine-Grained Commit Quantification” \u2013 Sebastian H\u00f6nel<\/em>
15.50 -16.00 Sum up and plan for the spring seminars<\/p>\n\n\n\n

Abstracts<\/strong><\/p>\n\n\n\n

The deterministic pancake forest \u2013 Jonas Nordqvist<\/em><\/strong>

In this talk, we will discuss a classical problem in computer science, namely sorting by prefix reversal. Its more popular name, Pancake Sorting, aside, it is actually more than just a toy problem. The long-standing question is: given a list of length n, what is the minimal number of prefix reversals needed to sort it? However, in the 70s, Conway proposed that one might study a deterministic version of this problem. Doing so, the problem, formulated as a discrete dynamical system, gives rise to an adjacency graph that is a collection of trees, i.e., a forest; more precisely, the deterministic pancake forest. Besides discussing the problem in general, I will present some results on the pancake forest and how this relates back to the original problem.<\/p>\n\n\n\n

Will It Hold? Predicting the Joinability of Metals Before Welding Them \u2013 Sebastian H\u00f6nel<\/em><\/strong>

In the context of automotive applications, a common task is to join two or more parts, such as sections of a car\u2019s frame.The joining of dissimilar metals presents a critical challenge in automotive manufacturing due to the differing thickness, as well as thermal, mechanical, and electrical properties of the base materials.

The challenge further lies in joining a varying number of materials reliably, that is, obtaining a joint that is sufficiently large and stable. Extensive laboratory tests using spot welding were conducted to gather an understanding of which materials using which parameters can be welded together. However, performing these tests is costly and trials need to be repeated multiple times to get robust and dependable estimates.

This study focuses on A) establishing a probabilistic understanding of selected parameters, materials, and welding outcome, and B) prediction of joint quality given the desired materials and parameters. To address these challenges, we employ deep conditional density estimation in conjunction with regression models.

Some preliminary results show that predicting joint size is within a reasonable error of margin, especially since we have not yet considered material properties just yet. Furthermore, a conditional normalizing flow was able to accurately capture the joint density of our dataset, allowing us to estimate the probability that a joint is sufficiently stable and to efficiently oversample the underrepresented test cases.<\/p>\n\n\n\n

A Foundational Approach for Fine-Grained Commit Quantification \u2013 Sebastian H\u00f6nel<\/em><\/strong>

Commits are sets of changed made continuously to a software repository. Understanding commits and the purpose behind them is crucial for a wider range of applications, such as commit classification, fault prediction and -localization, or automated commit message generation.
Extracting features from commits is and has historically been a challenging task. In the past, many studies were limited to commit metadata or human-engineered features specific to the downstream task at hand. Such features are almost always far inferior to semi- or unsupervised approaches used in representation learning.

With the recent advent of large language models (LLMs), the ability to largely capture the underlying (changed) source code in a commit has significantly improved. However, the inherent tree-like structure of a commit, together with a variable number of affected files, hunks, etc., which are also of variable length, poses a challenge for, e.g., regression- or discriminative models.

We attempt to alleviate these challenges once and for all by suggesting a foundational approach that consists of A) a language-agnostic, fine-grained, and multi-scale source code and metadata commit extraction, and B) a flexible deep-learning-based framework for the embedding, reduction, and projection of commits. The framework is agnostic with regard to the choice of LLM(s) and exploits transformers as well as recurrence-based architectures.

We evaluate our framework using an enhanced version of the downstream task of commit classification. We add uncertainty estimation which allows the trained model to quantify the risk of misclassification. The model exploits multiple-instance learning and optionally a stochastic version of what constitutes a commit to not only allow classification, but to also enable intent-disentanglement of merge- and ordinary commits and classification of fractional commits.<\/p>\n\n\n\n


<\/p>\n","protected":false},"excerpt":{"rendered":"

When? Friday December 13th 14-16Where? Onsite: D2272 and via zoomRegistration: Please sign up for the PhD-seminar via this link by https:\/\/forms.gle\/94Gb6pGdQ5qj2BeD7 December 11th (especially important if you plan on attending onsite so we have fika for everyone) Agenda 14.00-14.10 Welcome and practical information from Welf L\u00f6we14.10-14.55 Presentation and discussion: The deterministic pancake forest \u2013 Jonas […]<\/p>\n","protected":false},"author":401,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[93],"tags":[],"class_list":["post-664","post","type-post","status-publish","format-standard","hentry","category-blogg"],"acf":[],"yoast_head":"\r\nWelcome to Higher Research Seminar 241213 - DISA<\/title>\r\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\r\n<link rel=\"canonical\" href=\"https:\/\/blogg.lnu.se\/disa\/?p=664\" \/>\r\n<meta property=\"og:locale\" content=\"en_US\" \/>\r\n<meta property=\"og:type\" content=\"article\" \/>\r\n<meta property=\"og:title\" content=\"Welcome to Higher Research Seminar 241213 - DISA\" \/>\r\n<meta property=\"og:description\" content=\"When? Friday December 13th 14-16Where? Onsite: D2272 and via zoomRegistration: Please sign up for the PhD-seminar via this link by https:\/\/forms.gle\/94Gb6pGdQ5qj2BeD7 December 11th (especially important if you plan on attending onsite so we have fika for everyone) Agenda 14.00-14.10 Welcome and practical information from Welf L\u00f6we14.10-14.55 Presentation and discussion: The deterministic pancake forest \u2013 Jonas […]\" \/>\r\n<meta property=\"og:url\" content=\"https:\/\/blogg.lnu.se\/disa\/?p=664\" \/>\r\n<meta property=\"og:site_name\" content=\"DISA\" \/>\r\n<meta property=\"article:published_time\" content=\"2024-12-09T10:03:12+00:00\" \/>\r\n<meta property=\"article:modified_time\" content=\"2024-12-09T10:03:14+00:00\" \/>\r\n<meta name=\"author\" content=\"Diana Unander\" \/>\r\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\r\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Diana Unander\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"4 minutes\" \/>\r\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/blogg.lnu.se\/disa\/?p=664\",\"url\":\"https:\/\/blogg.lnu.se\/disa\/?p=664\",\"name\":\"Welcome to Higher Research Seminar 241213 - DISA\",\"isPartOf\":{\"@id\":\"https:\/\/blogg.lnu.se\/disa\/#website\"},\"datePublished\":\"2024-12-09T10:03:12+00:00\",\"dateModified\":\"2024-12-09T10:03:14+00:00\",\"author\":{\"@id\":\"https:\/\/blogg.lnu.se\/disa\/#\/schema\/person\/a322baa56840d8b8d7320bc36fc73c42\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/blogg.lnu.se\/disa\/?p=664\"]}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/blogg.lnu.se\/disa\/#website\",\"url\":\"https:\/\/blogg.lnu.se\/disa\/\",\"name\":\"DISA\",\"description\":\"Centre for Data Intensive Sciences and Applications\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/blogg.lnu.se\/disa\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/blogg.lnu.se\/disa\/#\/schema\/person\/a322baa56840d8b8d7320bc36fc73c42\",\"name\":\"Diana Unander\",\"sameAs\":[\"https:\/\/lnu.se\/en\/disa\"],\"url\":\"https:\/\/blogg.lnu.se\/disa\/?author=401\"}]}<\/script>\r\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Welcome to Higher Research Seminar 241213 - DISA","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/blogg.lnu.se\/disa\/?p=664","og_locale":"en_US","og_type":"article","og_title":"Welcome to Higher Research Seminar 241213 - DISA","og_description":"When? Friday December 13th 14-16Where? Onsite: D2272 and via zoomRegistration: Please sign up for the PhD-seminar via this link by https:\/\/forms.gle\/94Gb6pGdQ5qj2BeD7 December 11th (especially important if you plan on attending onsite so we have fika for everyone) Agenda 14.00-14.10 Welcome and practical information from Welf L\u00f6we14.10-14.55 Presentation and discussion: The deterministic pancake forest \u2013 Jonas […]","og_url":"https:\/\/blogg.lnu.se\/disa\/?p=664","og_site_name":"DISA","article_published_time":"2024-12-09T10:03:12+00:00","article_modified_time":"2024-12-09T10:03:14+00:00","author":"Diana Unander","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Diana Unander","Est. reading time":"4 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/blogg.lnu.se\/disa\/?p=664","url":"https:\/\/blogg.lnu.se\/disa\/?p=664","name":"Welcome to Higher Research Seminar 241213 - DISA","isPartOf":{"@id":"https:\/\/blogg.lnu.se\/disa\/#website"},"datePublished":"2024-12-09T10:03:12+00:00","dateModified":"2024-12-09T10:03:14+00:00","author":{"@id":"https:\/\/blogg.lnu.se\/disa\/#\/schema\/person\/a322baa56840d8b8d7320bc36fc73c42"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/blogg.lnu.se\/disa\/?p=664"]}]},{"@type":"WebSite","@id":"https:\/\/blogg.lnu.se\/disa\/#website","url":"https:\/\/blogg.lnu.se\/disa\/","name":"DISA","description":"Centre for Data Intensive Sciences and Applications","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/blogg.lnu.se\/disa\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/blogg.lnu.se\/disa\/#\/schema\/person\/a322baa56840d8b8d7320bc36fc73c42","name":"Diana Unander","sameAs":["https:\/\/lnu.se\/en\/disa"],"url":"https:\/\/blogg.lnu.se\/disa\/?author=401"}]}},"_links":{"self":[{"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=\/wp\/v2\/posts\/664","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=\/wp\/v2\/users\/401"}],"replies":[{"embeddable":true,"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=664"}],"version-history":[{"count":1,"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=\/wp\/v2\/posts\/664\/revisions"}],"predecessor-version":[{"id":665,"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=\/wp\/v2\/posts\/664\/revisions\/665"}],"wp:attachment":[{"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=664"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=664"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogg.lnu.se\/disa\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=664"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}