﻿<?xml version="1.0" encoding="utf-8"?>
<feed xmlns:openSearch="http://a9.com/-/spec/opensearchrss/1.0/" xmlns:gd="http://schemas.google.com/g/2005" xmlns:x-trumba="http://schemas.trumba.com/atom/x-trumba" xmlns:gc="http://base.google.com/cns/1.0" xmlns="http://www.w3.org/2005/Atom">
	<id>http://uid.trumba.com/calendar/1254237</id>
	<updated>2026-06-10T03:42:01Z</updated>
	<title type="text">School of Computing and Information Systems</title>
	<subtitle type="text"></subtitle>
	<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events" />
	<link rel="self" type="application/atom+xml" href="http://sis.smu.edu.sg/events.xml" />
	<author>
		<name>School of Computing and Information Systems</name>
	</author>
	<generator version="11.25810" uri="http://www.trumba.com/">Trumba Calendar</generator>
	<gd:where valueString="" />
	<entry>
		<id>http://uid.trumba.com/event/204470398</id>
		<category scheme="http://schemas.google.com/g/2005#kind" term="http://schemas.google.com/g/2005#event" />
		<title type="text">Do LLMs Really Know What They Don't Know? Internal States Mainly Reflect Knowledge Recall Rather Than Truthfulness</title>
		<content type="html">Meeting room 4.4, Level 4. School of Computing and Information Systems 1, &lt;br /&gt;Singapore Management University, 80 Stamford Road, Singapore 178902 &lt;br/&gt;Thursday, June 11, 2026, 11&amp;nbsp;&amp;ndash;&amp;nbsp;11:30am &lt;br/&gt;&lt;br/&gt;&lt;img src="https://www.trumba.com/i/DgCYVot3ReQaVA60yuZmCnIM.jpeg?w=100&amp;h=56" title="Do LLMs Really Know What They Don&amp;#39;t Know? Internal States Mainly Reflect Knowledge Recall Rather Than Truthfulness" alt="Do LLMs Really Know What They Don&amp;#39;t Know? Internal States Mainly Reflect Knowledge Recall Rather Than Truthfulness" width="100" srcset="https://www.trumba.com/i/DgCYVot3ReQaVA60yuZmCnIM.jpeg?w=200&amp;amp;h=112 2x" /&gt;&lt;br/&gt;&lt;br/&gt;Recent work suggests that LLMs &amp;quot;know what they don&amp;#39;t know&amp;#8221;, positing that hallucinated and factually correct outputs arise from distinct internal processes and can therefore be distinguished using internal signals. However, hallucinations have multifaceted causes: beyond simple knowledge gaps, they can emerge from training incentives that encourage models to exploit statistical shortcuts or spurious associations learned during pretraining. In this paper, we argue that when LLMs rely on such learned associations to produce hallucinations, their internal processes are mechanistically similar to those of factual recall, as both stem from strong statistical correlations encoded in the model&amp;#39;s parameters. To verify this, we propose a novel taxonomy categorizing hallucinations into Unassociated Hallucinations (UHs), where outputs lack parametric grounding, and Associated Hallucinations (AHs), which are driven by spurious associations. Through mechanistic analysis, we compare their computational processes and hidden-state geometries with factually correct outputs. Our results show that hidden states primarily reflect whether the model is recalling parametric knowledge rather than the truthfulness of the output itself. Consequently, AHs exhibit hidden-state geometries that largely overlap with factual outputs, rendering standard detection methods ineffective. In contrast, UHs exhibit distinctive, clustered representations that facilitate reliable detection.&lt;br /&gt;&lt;br /&gt;This is a Pre-Conference talk for&amp;#160;&lt;a href="https://2026.aclweb.org/" target="_blank" rel="noopener"&gt;The 64th Annual Meeting of the Association for Computational Linguistics (ACL 2026)&lt;/a&gt;. &lt;br/&gt;&lt;br/&gt;&lt;b&gt;Subtitle&lt;/b&gt;:&amp;nbsp;Pre-Conference Talk by CHEANG Chi Seng &lt;br/&gt;&lt;b&gt;Contact&lt;/b&gt;:&amp;nbsp;&lt;a href="mailto:scisseminar@smu.edu.sg" target="_blank" rel="noopener"&gt;scisseminar@smu.edu.sg&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Speaker Details&lt;/b&gt;:&amp;nbsp;&lt;strong&gt;&lt;strong&gt;CHEANG Chi Seng&lt;/strong&gt;&lt;/strong&gt;, PhD Candidate, School of Computing and Information Systems, Singapore Management University, CHEANG Chi Seng is a first-year PhD student in Computer Science at Singapore Management University, supervised by Dr. DENG Yang. His research interests include natural language processing, trustworthy AI, and hallucination detection and mitigation in large language models. &lt;br/&gt;&lt;b&gt;RSVP&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UQ04wVUhNUFlKUk9SVjVZVjA2OUpDSElJOS4u" target="_blank" rel="noopener"&gt;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UMDJXNzQ5RkZWMUtKSVZFRDEzNUo5S001TC4u" target="_blank" rel="noopener"&gt;&lt;/a&gt;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Reserve a seat&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UMDJXNzQ5RkZWMUtKSVZFRDEzNUo5S001TC4u" target="_blank" rel="noopener" title="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UMDJXNzQ5RkZWMUtKSVZFRDEzNUo5S001TC4u"&gt;forms.cloud.microsoft&amp;#8230;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Type&lt;/b&gt;:&amp;nbsp;Seminars &amp;amp; Workshops &lt;br/&gt;&lt;b&gt;Subject&lt;/b&gt;:&amp;nbsp;Information Technology &amp;amp; Systems &lt;br/&gt;&lt;b&gt;Audience&lt;/b&gt;:&amp;nbsp;Public &lt;br/&gt;&lt;b&gt;More info&lt;/b&gt;:&amp;nbsp;&lt;a href="https://computing.smu.edu.sg/newsletter/pre-conference-talk-cheang-chi-seng-do-llms-really-know-what-they-dont-know-internal?newsletter" target="_blank" rel="noopener" title="https://computing.smu.edu.sg/newsletter/pre-conference-talk-cheang-chi-seng-do-llms-really-know-what-they-dont-know-internal?newsletter"&gt;computing.smu.edu.sg&amp;#8230;&lt;/a&gt;</content>
		<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events?trumbaEmbed=view%3Devent%26eventid%3D204470398" />
		<author>
			<name>School of Computing and Information Systems</name>
		</author>
		<gc:weblink>https://computing.smu.edu.sg/newsletter/pre-conference-talk-cheang-chi-seng-do-llms-really-know-what-they-dont-know-internal?newsletter</gc:weblink>
	</entry>
	<entry>
		<id>http://uid.trumba.com/event/204470396</id>
		<category scheme="http://schemas.google.com/g/2005#kind" term="http://schemas.google.com/g/2005#event" />
		<title type="text">A Pruning-based Question-Answering for Interactive Video Search: A Simple Baseline</title>
		<content type="html">Meeting room 4.4, Level 4. School of Computing and Information Systems 1, &lt;br /&gt;Singapore Management University, 80 Stamford Road, Singapore 178902 &lt;br/&gt;Thursday, June 11, 2026, 2&amp;nbsp;&amp;ndash;&amp;nbsp;2:15pm &lt;br/&gt;&lt;br/&gt;&lt;img src="https://www.trumba.com/i/DgCYVot3ReQaVA60yuZmCnIM.jpeg?w=100&amp;h=56" title="A Pruning-based Question-Answering for Interactive Video Search: A Simple Baseline" alt="A Pruning-based Question-Answering for Interactive Video Search: A Simple Baseline" width="100" srcset="https://www.trumba.com/i/DgCYVot3ReQaVA60yuZmCnIM.jpeg?w=200&amp;amp;h=112 2x" /&gt;&lt;br/&gt;&lt;br/&gt;Video search systems frequently struggle with imprecise user queries, which retrieve excessively broad and noisy sets of candidate videos and reduce the effectiveness of ranking functions. This issue is compounded by the sheer volume of visually and semantically similar videos in large datasets, forcing users to browse extensively and increasing cognitive load. While interactive questioning offers a promising strategy to progressively narrow down candidate videos, dynamically generating these questions remains a significant challenge. Relying on large language models for this task often introduces high computational latency and the risk of hallucination. In this talk, I will present a simple yet highly effective alternative grounded in Shannon&amp;#8217;s information theory. Rather than generating questions from scratch, our method mathematically selects the most discriminative concepts to compose targeted questions, allowing for rapid and reliable pruning of the search space. I will discuss the practical implementation mechanics of the system, specifically detailing dynamic search result updates and top-K rank list sampling. Furthermore, the presentation will address how our approach accounts for realistic system and user constraints, including imperfectly indexed video content and noisy or misleading user feedback. Finally, I will share our experimental findings, which demonstrate the strong retrieval performance of this method on the AVSD and TRECVid benchmarks.&lt;br /&gt;&lt;br /&gt;This is a Pre-Conference talk for&amp;#160;&lt;a href="https://icmr2026.org/" target="_blank" rel="noopener"&gt;16th ACM International Conference on Multimedia Retrieval (ICMR 2026)&lt;/a&gt;. &lt;br/&gt;&lt;br/&gt;&lt;b&gt;Subtitle&lt;/b&gt;:&amp;nbsp;Pre-Conference Talk by CHENG Yu Tong &lt;br/&gt;&lt;b&gt;Contact&lt;/b&gt;:&amp;nbsp;&lt;a href="mailto:scisseminar@smu.edu.sg" target="_blank" rel="noopener"&gt;scisseminar@smu.edu.sg&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Speaker Details&lt;/b&gt;:&amp;nbsp;&lt;strong&gt;&lt;strong&gt;CHENG Yu Tong&lt;/strong&gt;&lt;/strong&gt;, PhD Candidate, School of Computing and Information Systems, Singapore Management University, CHENG Yu Tong is a Ph.D. candidate supervised by Prof. NGO Chong Wah at Singapore Management University. His research primarily focuses on the field of multimedia retrieval, with a specialization in the known-item search task. He also has an extensive background in system design and competitive benchmarking, having participated in numerous iterations of the Video Browser Showdown (VBS). Notably, in the most recent VBS competition, his team&amp;#39;s retrieval system, VIREO, achieved first place in the visual known-item search category. His current research investigates the development of smart conversational search systems, aiming to leverage interactive querying to streamline user interaction and improve retrieval accuracy in large-scale video datasets like TRECVid. &lt;br/&gt;&lt;b&gt;RSVP&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9URjJIV0VSNkdMSkQ3MjAxOEpMVVRNVzhFMC4u" target="_blank" rel="noopener"&gt;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UQ04wVUhNUFlKUk9SVjVZVjA2OUpDSElJOS4u" target="_blank" rel="noopener"&gt;&lt;/a&gt;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Reserve a seat&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UQ04wVUhNUFlKUk9SVjVZVjA2OUpDSElJOS4u" target="_blank" rel="noopener" title="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UQ04wVUhNUFlKUk9SVjVZVjA2OUpDSElJOS4u"&gt;forms.cloud.microsoft&amp;#8230;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Type&lt;/b&gt;:&amp;nbsp;Seminars &amp;amp; Workshops &lt;br/&gt;&lt;b&gt;Subject&lt;/b&gt;:&amp;nbsp;Information Technology &amp;amp; Systems &lt;br/&gt;&lt;b&gt;Audience&lt;/b&gt;:&amp;nbsp;Public &lt;br/&gt;&lt;b&gt;More info&lt;/b&gt;:&amp;nbsp;&lt;a href="https://computing.smu.edu.sg/newsletter/pre-conference-talk-cheng-yu-tong-pruning-based-question-answering-interactive-video?newsletter" target="_blank" rel="noopener" title="https://computing.smu.edu.sg/newsletter/pre-conference-talk-cheng-yu-tong-pruning-based-question-answering-interactive-video?newsletter"&gt;computing.smu.edu.sg&amp;#8230;&lt;/a&gt;</content>
		<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events?trumbaEmbed=view%3Devent%26eventid%3D204470396" />
		<author>
			<name>School of Computing and Information Systems</name>
		</author>
		<gc:weblink>https://computing.smu.edu.sg/newsletter/pre-conference-talk-cheng-yu-tong-pruning-based-question-answering-interactive-video?newsletter</gc:weblink>
	</entry>
	<entry>
		<id>http://uid.trumba.com/event/204429932</id>
		<category scheme="http://schemas.google.com/g/2005#kind" term="http://schemas.google.com/g/2005#event" />
		<title type="text">Beyond Hard Constraints: Budget-Conditioned Reachability For Safe Offline Reinforcement Learning</title>
		<content type="html">Meeting room 5.1, Level 5. School of Computing and Information Systems 1, &lt;br /&gt;Singapore Management University, 80 Stamford Road, Singapore 178902 &lt;br/&gt;Tuesday, June 16, 2026, 11:30&amp;nbsp;&amp;ndash;&amp;nbsp;11:50am &lt;br/&gt;&lt;br/&gt;&lt;img src="https://www.trumba.com/i/DgCYVot3ReQaVA60yuZmCnIM.jpeg?w=100&amp;h=56" title="Beyond Hard Constraints: Budget-Conditioned Reachability For Safe Offline Reinforcement Learning" alt="Beyond Hard Constraints: Budget-Conditioned Reachability For Safe Offline Reinforcement Learning" width="100" srcset="https://www.trumba.com/i/DgCYVot3ReQaVA60yuZmCnIM.jpeg?w=200&amp;amp;h=112 2x" /&gt;&lt;br/&gt;&lt;br/&gt;Sequential decision-making using Markov Decision Process underpins many real-world applications. Both model-based and model-free methods have achieved strong results in these settings. However, real-world tasks must balance reward maximization with safety constraints, often conflicting objectives, that can lead to unstable min&amp;#8211;max, adversarial optimization. A promising alternative is safety reachability analysis, which precomputes a forward-invariant safe state&amp;#8211;action set, ensuring that an agent starting inside this set remains safe indefinitely. Yet, most reachability-based methods address only hard safety constraints, and little work extends reachability to cumulative cost constraints. To address this, first, we define a safety-conditioned reachability set that decouples reward maximization from cumulative safety cost constraints. Second, we show how this set enforces safety constraints without unstable min&amp;#8211;max or Lagrangian optimization, yielding a novel offline safe RL algorithm that learns a safe policy from a fixed dataset without environment interaction. Finally, experiments on standard offline safe-RL benchmarks, and a real-world maritime navigation task demonstrate that our method matches or outperforms state-of-the-art baselines while maintaining safety.&lt;br /&gt;&lt;br /&gt;This is a Pre-Conference talk for&amp;#160;&lt;a href="https://icaps26.icaps-conference.org/" target="_blank" rel="noopener"&gt;The 36th International Conference on Automated Planning and Scheduling (ICAPS 2026)&lt;/a&gt;. &lt;br/&gt;&lt;br/&gt;&lt;b&gt;Subtitle&lt;/b&gt;:&amp;nbsp;Pre-Conference Talk by Brahmanage Janaka Chathuranga THILAKARATHNA &lt;br/&gt;&lt;b&gt;Contact&lt;/b&gt;:&amp;nbsp;&lt;a href="mailto:scisseminar@smu.edu.sg" target="_blank" rel="noopener"&gt;scisseminar@smu.edu.sg&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Speaker Details&lt;/b&gt;:&amp;nbsp;&lt;strong&gt;&lt;strong&gt;Brahmanage Janaka Chathuranga THILAKARATHNA&lt;/strong&gt;&lt;/strong&gt;, PhD Candidate, School of Computing and Information Systems, Singapore Management University, Janaka Brahmanage is a fourth-year PhD candidate in Computer Science, conducting research under the guidance of Associate Prof. Akshat Kumar at the SMU School of Computing and Information Systems. His research focuses on safe reinforcement learning and multi-agent systems. &lt;br/&gt;&lt;b&gt;RSVP&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UM09YNlY1V0k4M0dENjdNQ1UwT1VMU0dXTy4u" target="_blank" rel="noopener"&gt;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9URjJIV0VSNkdMSkQ3MjAxOEpMVVRNVzhFMC4u" target="_blank" rel="noopener"&gt;&lt;/a&gt;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Reserve a seat&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9URjJIV0VSNkdMSkQ3MjAxOEpMVVRNVzhFMC4u" target="_blank" rel="noopener" title="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9URjJIV0VSNkdMSkQ3MjAxOEpMVVRNVzhFMC4u"&gt;forms.cloud.microsoft&amp;#8230;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Type&lt;/b&gt;:&amp;nbsp;Seminars &amp;amp; Workshops &lt;br/&gt;&lt;b&gt;Subject&lt;/b&gt;:&amp;nbsp;Information Technology &amp;amp; Systems &lt;br/&gt;&lt;b&gt;Audience&lt;/b&gt;:&amp;nbsp;Public &lt;br/&gt;&lt;b&gt;More info&lt;/b&gt;:&amp;nbsp;&lt;a href="https://computing.smu.edu.sg/newsletter/pre-conference-talk-brahmanage-janaka-chathuranga-thilakarathna-beyond-hard-constraints?newsletter" target="_blank" rel="noopener" title="https://computing.smu.edu.sg/newsletter/pre-conference-talk-brahmanage-janaka-chathuranga-thilakarathna-beyond-hard-constraints?newsletter"&gt;computing.smu.edu.sg&amp;#8230;&lt;/a&gt;</content>
		<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events?trumbaEmbed=view%3Devent%26eventid%3D204429932" />
		<author>
			<name>School of Computing and Information Systems</name>
		</author>
		<gc:weblink>https://computing.smu.edu.sg/newsletter/pre-conference-talk-brahmanage-janaka-chathuranga-thilakarathna-beyond-hard-constraints?newsletter</gc:weblink>
	</entry>
	<entry>
		<id>http://uid.trumba.com/event/204097547</id>
		<category scheme="http://schemas.google.com/g/2005#kind" term="http://schemas.google.com/g/2005#event" />
		<title type="text">Singapore HCI 2026 &amp; HRI Workshop 2026</title>
		<content type="html">School of Computing and Information Systems 2, Level 3, Classroom 3-1, Singapore Management University, 90 Stamford Road, 178903 &lt;br/&gt;Thursday, June 18, 2026, 9am&amp;nbsp;&amp;ndash;&amp;nbsp;5pm &lt;br/&gt;&lt;br/&gt;&lt;img src="https://www.trumba.com/i/DgBm%2AAD1%2AjM%2A2VnvMNBbOQjj.jpg?w=100&amp;h=56" title="Singapore HCI 2026 &amp;amp; HRI Workshop 2026" alt="Singapore HCI 2026 &amp;amp; HRI Workshop 2026" width="100" srcset="https://www.trumba.com/i/DgBm%2AAD1%2AjM%2A2VnvMNBbOQjj.jpg?w=200&amp;amp;h=112 2x" /&gt;&lt;br/&gt;&lt;br/&gt;We cordially invite you to a one-day event&amp;#8212;the&amp;#160;&lt;strong&gt;&lt;strong&gt;Singapore HCI Meetup 2026&lt;/strong&gt;&lt;/strong&gt;&amp;#160;and&amp;#160;&lt;strong&gt;&lt;strong&gt;HRI Workshop 2026&lt;/strong&gt;&lt;/strong&gt;&amp;#8212;where HCI researchers across the island share ideas, celebrate achievements, and, most importantly, reconnect with old friends and meet new ones. This year&amp;#39;s meetup will be hosted at the SMU campus on 18 June. &lt;br/&gt;&lt;br/&gt;&lt;b&gt;RSVP&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTc1sA3niBzxOi60foZ8X931URFBFMUlFOTFaMzAxRlFHVEFJSEZPUFBNSy4u&amp;amp;origin=lprLink&amp;amp;route=shorturl" target="_blank" rel="noopener"&gt;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Reserve a seat&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTc1sA3niBzxOi60foZ8X931URFBFMUlFOTFaMzAxRlFHVEFJSEZPUFBNSy4u&amp;origin=lprLink&amp;route=shorturl" target="_blank" rel="noopener" title="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTc1sA3niBzxOi60foZ8X931URFBFMUlFOTFaMzAxRlFHVEFJSEZPUFBNSy4u&amp;origin=lprLink&amp;route=shorturl"&gt;forms.office.com&amp;#8230;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Type&lt;/b&gt;:&amp;nbsp;Seminars &amp;amp; Workshops &lt;br/&gt;&lt;b&gt;Subject&lt;/b&gt;:&amp;nbsp;Information Technology &amp;amp; Systems &lt;br/&gt;&lt;b&gt;Audience&lt;/b&gt;:&amp;nbsp;Academic Community, Current Student, Public &lt;br/&gt;&lt;b&gt;More info&lt;/b&gt;:&amp;nbsp;&lt;a href="https://sghcimeetup26.notion.site/" target="_blank" rel="noopener"&gt;sghcimeetup26.notion.site&lt;/a&gt;</content>
		<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events?trumbaEmbed=view%3Devent%26eventid%3D204097547" />
		<author>
			<name>School of Computing and Information Systems</name>
		</author>
		<gc:weblink>https://sghcimeetup26.notion.site/</gc:weblink>
	</entry>
	<entry>
		<id>http://uid.trumba.com/event/204317614</id>
		<category scheme="http://schemas.google.com/g/2005#kind" term="http://schemas.google.com/g/2005#event" />
		<title type="text">SMU Postgraduate Fast Track</title>
		<content type="html">Hybrid&lt;br /&gt;&lt;br /&gt;Zoom details will be sent to you upon review of your profile. &lt;br/&gt;Friday, June 19, 10am&amp;nbsp;&amp;ndash; Saturday, June 20, 2026, 2:30pm &lt;br/&gt;&lt;br/&gt;&lt;img src="https://www.trumba.com/i/DgBspU-Ee8VxOLctfFGQNQaU.jpeg?w=100&amp;h=67" title="SMU Postgraduate Fast Track" alt="SMU Postgraduate Fast Track" width="100" srcset="https://www.trumba.com/i/DgBspU-Ee8VxOLctfFGQNQaU.jpeg?w=200&amp;amp;h=134 2x" /&gt;&lt;br/&gt;&lt;br/&gt;&lt;b&gt;Hourly Sessions&lt;/b&gt;:&amp;nbsp;Friday, 19 June 2026&amp;#160;, 10:00am - 8:00pm, Saturday, 20 June 2026&amp;#160;, 10:00am - 2:30pm *Refer to the registration link for specific slots of each programme &lt;br/&gt;&lt;b&gt;RSVP&lt;/b&gt;:&amp;nbsp;&lt;a href="https://postgraduate2.smu.edu.sg/acton/media/24273/FT2" target="_blank" rel="noopener"&gt;https://postgraduate2.smu.edu.sg/acton/media/24273/FT2&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Event Details&lt;/b&gt;:&amp;nbsp;We are conducting&amp;#160;Fast-Track Admission&amp;#160;for the abovementioned&amp;#160;SMU Postgraduate Programmes!, You will be able to expedite your application and be guided through the process by the Admissions Team. Eligible candidates* would be shortlisted for an interview with the admission committee.&amp;#160;Application fee will be waived for all fast-track attendees., If you&amp;#39;re ready to apply, register today!, You &amp;#8203;are &amp;#8203;welcome &amp;#8203;to &amp;#8203;bring &amp;#8203;a &amp;#8203;friend &amp;#8203;with &amp;#8203;you. &amp;#8203;Simply &amp;#8203;forward &amp;#8203;them &amp;#8203;this &amp;#8203;link:, &lt;a href="https://postgraduate2.smu.edu.sg/acton/media/24273/FT2" target="_blank" rel="noopener" title="https://postgraduate2.smu.edu.sg/acton/media/24273/FT2"&gt;postgraduate2.smu.edu.sg&amp;#8230;&lt;/a&gt;, *Shortlisted candidates will be contacted to confirm their registration status. &lt;br/&gt;&lt;b&gt;Type&lt;/b&gt;:&amp;nbsp;Information Sessions &lt;br/&gt;&lt;b&gt;Subject&lt;/b&gt;:&amp;nbsp;Accounting, Analytics for Business, Consumer &amp;amp; Social Insights, Economics, Finance &amp;amp; Financial Markets, Operations Management, Social Sciences &amp;amp; Humanities &lt;br/&gt;&lt;b&gt;Audience&lt;/b&gt;:&amp;nbsp;Prospective Student, Public</content>
		<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events?trumbaEmbed=view%3Devent%26eventid%3D204317614" />
		<author>
			<name>School of Computing and Information Systems</name>
		</author>
	</entry>
	<entry>
		<id>http://uid.trumba.com/event/203826836</id>
		<category scheme="http://schemas.google.com/g/2005#kind" term="http://schemas.google.com/g/2005#event" />
		<title type="text">Designing for “Just Enough”: How Elegance Drives Adoption and Innovation</title>
		<content type="html">Seminar Room 2-5, Level 2. SMU SCIS 2, Singapore 178903 &lt;br/&gt;Friday, June 19, 2026, 11:15am&amp;nbsp;&amp;ndash;&amp;nbsp;12:15pm &lt;br/&gt;&lt;br/&gt;&lt;img src="https://www.trumba.com/i/DgBbH2uT9IrSOn-X1j7XzIXS.jpg?w=100&amp;h=56" title="Designing for “Just Enough”: How Elegance Drives Adoption and Innovation" alt="Designing for “Just Enough”: How Elegance Drives Adoption and Innovation" width="100" srcset="https://www.trumba.com/i/DgBbH2uT9IrSOn-X1j7XzIXS.jpg?w=200&amp;amp;h=112 2x" /&gt;&lt;br/&gt;&lt;br/&gt;In an environment saturated with information, products, and interfaces, users increasingly expect designs that are both simple and effective. Elegant Design: A Designer&amp;#8217;s Guide to Harnessing Aesthetics examines how the tension between simplicity and complexity can be addressed by conceptualizing elegance as a form of ideal complexity: sufficiently rich to convey meaning, yet clear enough for immediate comprehension. Drawing on research at the intersection of cognitive science, information theory, and art, Luca Landoli demonstrates that aesthetic pleasure is not merely an optional enhancement, but a critical factor guiding decision-making in design, innovation, and product development. Utilizing over 100 visual examples and case studies, the book presents eight actionable strategies: four for enriching designs that lack engagement, and four for simplifying solutions that have become overly complex. This presentation is particularly relevant for scholars and students in information systems, human-computer interaction, innovation, and new product development who seek to understand how aesthetics can improve usability, sense-making, and adoption. Participants will gain a practical framework for iteratively balancing simplification and complexification to achieve elegant products, services, and user experiences. &lt;br/&gt;&lt;br/&gt;&lt;b&gt;Subtitle&lt;/b&gt;:&amp;nbsp;Research Seminar by Dr Luca Iandoli &lt;br/&gt;&lt;b&gt;Contact&lt;/b&gt;:&amp;nbsp;&lt;a href="mailto:scisseminars@smu.edu.sg" target="_blank" rel="noopener"&gt;scisseminars@smu.edu.sg&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Speaker Details&lt;/b&gt;:&amp;nbsp;&lt;strong&gt;&lt;strong&gt;Luca Iandoli&lt;/strong&gt;&lt;/strong&gt;, Distinguished Chair and, Dean of the Lesley H. and William L. Collins, College of Professional Studies, St. John&amp;#8217;s University, Luca Iandoli is Dean of the Collins College of Professional Studies at St. John&amp;#8217;s University. A scholar of collective intelligence, interaction design, and product aesthetics, his work explores how people and organizations make sense of complexity through design. A former Fulbright Visiting Scholar at the MIT Center for Collective Intelligence, he has also served as associate professor at the University of Naples Federico II and visiting professor at Stevens Institute of Technology.Luca is the co-author of Elegant Design: A Designer&amp;#8217;s Guide to Harnessing Aesthetics, which bridges cognitive science, art, and information systems to show how &amp;#8220;ideal complexity&amp;#8221; and aesthetic pleasure can drive better products, interfaces, and decisions. &lt;br/&gt;&lt;b&gt;RSVP&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTbOXO7ktpRtBsn62WuekYtpUMEQ4MjBFNFcxSkJINlROSU82SjRRWFcyRy4u&amp;amp;route=shorturl" target="_blank" rel="noopener"&gt;&lt;a href="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTbOXO7ktpRtBsn62WuekYtpUN0wxN0pDNjcyMEFTSDZKVFY1VThMWVNWVS4u&amp;amp;route=shorturl" target="_blank" rel="noopener"&gt;&lt;/a&gt;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Reserve a seat&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTbOXO7ktpRtBsn62WuekYtpUN0wxN0pDNjcyMEFTSDZKVFY1VThMWVNWVS4u&amp;route=shorturl" target="_blank" rel="noopener" title="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTbOXO7ktpRtBsn62WuekYtpUN0wxN0pDNjcyMEFTSDZKVFY1VThMWVNWVS4u&amp;route=shorturl"&gt;forms.office.com&amp;#8230;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Type&lt;/b&gt;:&amp;nbsp;Seminars &amp;amp; Workshops &lt;br/&gt;&lt;b&gt;Subject&lt;/b&gt;:&amp;nbsp;Information Technology &amp;amp; Systems &lt;br/&gt;&lt;b&gt;Audience&lt;/b&gt;:&amp;nbsp;Academic Community, Current Student, Public &lt;br/&gt;&lt;b&gt;More info&lt;/b&gt;:&amp;nbsp;&lt;a href="https://computing.smu.edu.sg/newsletter/research-seminar-dr-luca-iandoli?newsletter" target="_blank" rel="noopener" title="https://computing.smu.edu.sg/newsletter/research-seminar-dr-luca-iandoli?newsletter"&gt;computing.smu.edu.sg&amp;#8230;&lt;/a&gt;</content>
		<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events?trumbaEmbed=view%3Devent%26eventid%3D203826836" />
		<author>
			<name>School of Computing and Information Systems</name>
		</author>
		<gc:weblink>https://computing.smu.edu.sg/newsletter/research-seminar-dr-luca-iandoli?newsletter</gc:weblink>
	</entry>
	<entry>
		<id>http://uid.trumba.com/event/204290136</id>
		<category scheme="http://schemas.google.com/g/2005#kind" term="http://schemas.google.com/g/2005#event" />
		<title type="text">SMU Doctor of Engineering (EngD)  Virtual Information Session</title>
		<content type="html">Virtual via Zoom&lt;br /&gt;Details will be provided via email upon registration. &lt;br/&gt;Thursday, July 2, 2026, 7&amp;nbsp;&amp;ndash;&amp;nbsp;8pm &lt;br/&gt;&lt;br/&gt;&lt;img src="https://www.trumba.com/i/DgAlMnEREERPBjeySuQe1ifz.jpg?w=100&amp;h=41" title="SMU Doctor of Engineering (EngD)  Virtual Information Session" alt="SMU Doctor of Engineering (EngD)  Virtual Information Session" width="100" srcset="https://www.trumba.com/i/DgAlMnEREERPBjeySuQe1ifz.jpg?w=200&amp;amp;h=82 2x" /&gt;&lt;br/&gt;&lt;br/&gt;&lt;b&gt;RSVP&lt;/b&gt;:&amp;nbsp;&lt;a href="https://scispg.smu.edu.sg/acton/media/44865/engdis0725" target="_blank" rel="noopener"&gt;&lt;a href="https://scispg.smu.edu.sg/acton/media/44865/engdis0726" target="_blank" rel="noopener"&gt;&lt;/a&gt;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Reserve a seat&lt;/b&gt;:&amp;nbsp;&lt;a href="https://scispg.smu.edu.sg/acton/media/44865/engdis0726" target="_blank" rel="noopener" title="https://scispg.smu.edu.sg/acton/media/44865/engdis0726"&gt;scispg.smu.edu.sg&amp;#8230;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Type&lt;/b&gt;:&amp;nbsp;Information Sessions, Webinar &amp;amp; Online Learning &lt;br/&gt;&lt;b&gt;Subject&lt;/b&gt;:&amp;nbsp;Analytics for Business, Consumer &amp;amp; Social Insights, Business, Information Technology &amp;amp; Systems, Leadership, Operations Management, Organisational Behaviour, Strategic Management &lt;br/&gt;&lt;b&gt;Audience&lt;/b&gt;:&amp;nbsp;Professionals, Prospective Student</content>
		<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events?trumbaEmbed=view%3Devent%26eventid%3D204290136" />
		<author>
			<name>School of Computing and Information Systems</name>
		</author>
	</entry>
	<entry>
		<id>http://uid.trumba.com/event/204449799</id>
		<category scheme="http://schemas.google.com/g/2005#kind" term="http://schemas.google.com/g/2005#event" />
		<title type="text">Self-optimizing Static Program Analysis</title>
		<content type="html">Seminar Room 4-2, Level 4. SMU SCIS 2, Singapore 178903 &lt;br/&gt;Friday, July 3, 2026, 10&amp;nbsp;&amp;ndash;&amp;nbsp;11am &lt;br/&gt;&lt;br/&gt;&lt;img src="https://www.trumba.com/i/DgBbH2uT9IrSOn-X1j7XzIXS.jpg?w=100&amp;h=56" title="Self-optimizing Static Program Analysis" alt="Self-optimizing Static Program Analysis" width="100" srcset="https://www.trumba.com/i/DgBbH2uT9IrSOn-X1j7XzIXS.jpg?w=200&amp;amp;h=112 2x" /&gt;&lt;br/&gt;&lt;br/&gt;Software systems pervade our personal and professional lives, yet their insecurity threaten our society. To assure that software systems are dependable and secure, one must reason about their code. Static program analysis enables such reasoning. It can be applied to individual software components, and it can show not only the presence but also prove the absence of bugs and vulnerabilities. Yet, to be useful to software developers, static analyses must be adapted to the context in which they are used. Studies show that poorly adapted analyses slow down rather than assist development. They report large sets of false warnings that distract developers from actual bugs, which the analyses often miss. They often run so long that results are reported when they are already outdated. &amp;#160; In this talk I report on my ERC Advanced Grant on Self-optimizing Static Program Analysis (SOSA). Its research hypothesis is that one can generate precise and efficient static analyses of software systems by making static analysis self-aware and self-optimizing. With SOSA, a static analysis conducts analyses and optimizations not just of programs but of itself. The first ingredient to self-optimization in SOSA is a novel intermediate representation (IR) - not of the analyzed program - but the analysis of that program. Optimization potential for the analysis can be pinpointed directly on the level of this &amp;#8220;Abstract IR&amp;#8221;, and analysis optimizations are easily expressed as rewrites on the level of this Abstract IR. This mechanism, akin to JIT optimizations in general-purpose virtual machines, allows for instantaneous, online optimizations. The second ingredient becomes important in situation where the analysis struggles analyzing a given program for reasons unknown. In this case, we use Sequential Model-based Optimizations (SMO) to learn configurations of the analysis that will likely do better at least in subsequent analysis runs. &amp;#160; In this talk I will report on a first design of our Abstract IR &amp;#8220;FAIR&amp;#8221;, which supports different kinds of analyses of Java programs, and on initial experiments with SMO applied to the off-the-shelve static analyzer FlowDroid. &lt;br/&gt;&lt;br/&gt;&lt;b&gt;Subtitle&lt;/b&gt;:&amp;nbsp;Research Seminar by Dr Eric Bodden &lt;br/&gt;&lt;b&gt;Contact&lt;/b&gt;:&amp;nbsp;&lt;a href="mailto:scisseminars@smu.edu.sg" target="_blank" rel="noopener"&gt;scisseminars@smu.edu.sg&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Speaker Details&lt;/b&gt;:&amp;nbsp;&lt;strong&gt;&lt;strong&gt;Eric Bodden&lt;/strong&gt;&lt;/strong&gt;, Professor, Heinz Nixdorf Institute, Paderborn University, Eric Bodden is a leading expert on secure software engineering, especially in building highly precise tools for automated program analysis. He is Professor for Secure Software Engineering at Paderborn University and director for Software Engineering and IT-Security at Fraunhofer IEM. &lt;br/&gt;&lt;b&gt;RSVP&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTbOXO7ktpRtBsn62WuekYtpUQjZQS1k5TTNQWVZNTTlETE5VVEc0RTM2SC4u&amp;amp;route=shorturl" target="_blank" rel="noopener"&gt;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Reserve a seat&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTbOXO7ktpRtBsn62WuekYtpUQjZQS1k5TTNQWVZNTTlETE5VVEc0RTM2SC4u&amp;route=shorturl" target="_blank" rel="noopener" title="https://forms.office.com/pages/responsepage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTbOXO7ktpRtBsn62WuekYtpUQjZQS1k5TTNQWVZNTTlETE5VVEc0RTM2SC4u&amp;route=shorturl"&gt;forms.office.com&amp;#8230;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Type&lt;/b&gt;:&amp;nbsp;Seminars &amp;amp; Workshops &lt;br/&gt;&lt;b&gt;Subject&lt;/b&gt;:&amp;nbsp;Information Technology &amp;amp; Systems &lt;br/&gt;&lt;b&gt;Audience&lt;/b&gt;:&amp;nbsp;Academic Community, Current Student, Public &lt;br/&gt;&lt;b&gt;More info&lt;/b&gt;:&amp;nbsp;&lt;a href="https://computing.smu.edu.sg/newsletter/research-seminar-dr-luca-iandoli?newsletter" target="_blank" rel="noopener" title="https://computing.smu.edu.sg/newsletter/research-seminar-dr-luca-iandoli?newsletter"&gt;computing.smu.edu.sg&amp;#8230;&lt;/a&gt;</content>
		<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events?trumbaEmbed=view%3Devent%26eventid%3D204449799" />
		<author>
			<name>School of Computing and Information Systems</name>
		</author>
		<gc:weblink>https://computing.smu.edu.sg/newsletter/research-seminar-dr-luca-iandoli?newsletter</gc:weblink>
	</entry>
	<entry>
		<id>http://uid.trumba.com/event/204429875</id>
		<category scheme="http://schemas.google.com/g/2005#kind" term="http://schemas.google.com/g/2005#event" />
		<title type="text">The Voice of the Flow: A Graph-based Approach for Step-Wise Explanations of Constraint Satisfaction Problems</title>
		<content type="html">Meeting room 4.4, Level 4. School of Computing and Information Systems 1, &lt;br /&gt;Singapore Management University, 80 Stamford Road, Singapore 178902 &lt;br/&gt;Friday, July 3, 2026, 11:30&amp;nbsp;&amp;ndash;&amp;nbsp;11:50am &lt;br/&gt;&lt;br/&gt;&lt;img src="https://www.trumba.com/i/DgCYVot3ReQaVA60yuZmCnIM.jpeg?w=100&amp;h=56" title="The Voice of the Flow: A Graph-based Approach for Step-Wise Explanations of Constraint Satisfaction Problems" alt="The Voice of the Flow: A Graph-based Approach for Step-Wise Explanations of Constraint Satisfaction Problems" width="100" srcset="https://www.trumba.com/i/DgCYVot3ReQaVA60yuZmCnIM.jpeg?w=200&amp;amp;h=112 2x" /&gt;&lt;br/&gt;&lt;br/&gt;Stepwise explanations are an important tool for interpreting constraint programs. Existing methods rely heavily on repeated minimal unsatisfiable subsets (MUS) extraction or intensive SAT-based propagation, which are computationally prohibitive for large-scale problems with complex constraints. We propose a novel framework leveraging Multi-Valued Decision Diagrams (MDDs) to overcome these bottlenecks. By decomposing CSPs into smaller, graph-based subproblems compactly represented as MDDs, we enable highly efficient constraint propagation through network-flow reformulation. To further enhance efficiency, we propose a Divide-and-Conquer approach to improve the search for minimal explanation steps. Furthermore, we utilize the MDD&amp;#8217;s network-flow structure to generate nested explanations that break down complex derivation steps into granular, arc-level details, revealing specifically how variable-value assignments become infeasible. In this way, our approach equips the explainer agent with a voice that provides more intuitive and granular stepwise explanations. Evaluated on Graph Coloring and Nurse Rostering benchmarks, our framework significantly reduces explanation generation time while maintaining interpretability and conciseness compared to state-of-the-art methods.&amp;#160;&lt;br /&gt;&lt;br /&gt;This is a Pre-Conference talk for&amp;#160;&lt;a href="https://cp2026.a4cp.org/" target="_blank" rel="noopener"&gt;The 32nd International Conference on Principles and Practice of Constraint Programming (CP 2026)&lt;/a&gt;. &lt;br/&gt;&lt;br/&gt;&lt;b&gt;Subtitle&lt;/b&gt;:&amp;nbsp;Pre-Conference Talk by NGUYEN Minh Anh &lt;br/&gt;&lt;b&gt;Contact&lt;/b&gt;:&amp;nbsp;&lt;a href="mailto:scisseminar@smu.edu.sg" target="_blank" rel="noopener"&gt;scisseminar@smu.edu.sg&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Speaker Details&lt;/b&gt;:&amp;nbsp;&lt;strong&gt;&lt;strong&gt;NGUYEN Minh Anh&lt;/strong&gt;&lt;/strong&gt;, PhD Candidate, School of Computing and Information Systems, Singapore Management University, NGUYEN Minh Anh is a third-year PhD candidate in Computer Science at Singapore Management University, supervised by Prof. LAU Hoong Chuin. His research focuses on explainable optimization, where he develops methods such as step-wise and counterfactual explanations to provide transparency and trust in complex combinatorial optimization problems. His work explores the intersection of XAI and operations research, with a focus on practical applications like drone delivery and nurse scheduling. &lt;br/&gt;&lt;b&gt;RSVP&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UM09YNlY1V0k4M0dENjdNQ1UwT1VMU0dXTy4u" target="_blank" rel="noopener"&gt;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UNkdQQjJCWFRVN1FPM0FTOVZXMVFHUVFBNC4u" target="_blank" rel="noopener"&gt;&lt;/a&gt;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Reserve a seat&lt;/b&gt;:&amp;nbsp;&lt;a href="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UNkdQQjJCWFRVN1FPM0FTOVZXMVFHUVFBNC4u" target="_blank" rel="noopener" title="https://forms.cloud.microsoft/Pages/ResponsePage.aspx?id=ynmKyZpakUeiQ_Bq_WdGTejbEKPlArBJhZomj91naG9UNkdQQjJCWFRVN1FPM0FTOVZXMVFHUVFBNC4u"&gt;forms.cloud.microsoft&amp;#8230;&lt;/a&gt; &lt;br/&gt;&lt;b&gt;Type&lt;/b&gt;:&amp;nbsp;Seminars &amp;amp; Workshops &lt;br/&gt;&lt;b&gt;Subject&lt;/b&gt;:&amp;nbsp;Information Technology &amp;amp; Systems &lt;br/&gt;&lt;b&gt;Audience&lt;/b&gt;:&amp;nbsp;Public &lt;br/&gt;&lt;b&gt;More info&lt;/b&gt;:&amp;nbsp;&lt;a href="https://computing.smu.edu.sg/newsletter/pre-conference-talk-nguyen-minh-anh-voice-flow-graph-based-approach-step-wise?newsletter" target="_blank" rel="noopener" title="https://computing.smu.edu.sg/newsletter/pre-conference-talk-nguyen-minh-anh-voice-flow-graph-based-approach-step-wise?newsletter"&gt;computing.smu.edu.sg&amp;#8230;&lt;/a&gt;</content>
		<link rel="alternate" type="text/html" href="http://sis.smu.edu.sg/events?trumbaEmbed=view%3Devent%26eventid%3D204429875" />
		<author>
			<name>School of Computing and Information Systems</name>
		</author>
		<gc:weblink>https://computing.smu.edu.sg/newsletter/pre-conference-talk-nguyen-minh-anh-voice-flow-graph-based-approach-step-wise?newsletter</gc:weblink>
	</entry>
</feed>