Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 841 - 870 of 7017

Full-Text Articles in Entire DC Network

Esem: To Harden Process Synchronization For Servers, Zhanbo Wang, Jiaxin Zhan, Xuhua Ding, Fengwei Zhang, Ning Hu Jul 2024

Esem: To Harden Process Synchronization For Servers, Zhanbo Wang, Jiaxin Zhan, Xuhua Ding, Fengwei Zhang, Ning Hu

Research Collection School Of Computing and Information Systems

Process synchronization primitives lubricate server computing involving a group of processes as they ensure those processes to properly coordinate their executions for a common purpose such as provisioning a web service. A malfunctioned synchronization due to attacks causes friction among processes and leads to unexpected, and often hard-to-detect, application transaction errors. Unfortunately, synchronization primitives are not naturally protected by existing hardware-assisted isolation techniques e.g., SGX, because their process-oriented isolation conflicts with the primitive's demand for cross-process operations.This paper introduces the Enclave-Semaphore service (ESem) which shelters application semaphores and their operations against kernel-privileged attacks. ESem encapsulates all semaphores in the platform …


Fedstem-Adl: A Federated Spatial-Temporal Episodic Memory Model For Adl Prediction, Doudou Wu, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan Jul 2024

Fedstem-Adl: A Federated Spatial-Temporal Episodic Memory Model For Adl Prediction, Doudou Wu, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Learning of Activities of Daily Living (ADLs) provides insights into an individual’s habits, lifestyle, and well-being. However, it is crucial to address data privacy concerns in practical situations when learning the ADL routines of individuals. In this paper, we introduce FedSTEM-ADL, a federated spatial-temporal episodic memory model to address this privacy issue. FedSTEM-ADL utilizes a federation of Spatial-Temporal Episodic Memory for ADLs (STEM-ADL) for federated learning, wherein multiple local STEM-ADL models from individual users are combined into a global model while preserving the privacy of the original data. Specifically, each local model is designed to learn the spatio-temporal ADL routines …


On The Sustainability Of Deep Learning Projects: Maintainers' Perspective, Junxiao Han, Jiakun Liu, David Lo, Chen Zhi, Yishan Chen, Shuiguang Deng Jul 2024

On The Sustainability Of Deep Learning Projects: Maintainers' Perspective, Junxiao Han, Jiakun Liu, David Lo, Chen Zhi, Yishan Chen, Shuiguang Deng

Research Collection School Of Computing and Information Systems

Deep learning (DL) techniques have grown in leaps and bounds in both academia and industry over the past few years. Despite the growth of DL projects, there has been little study on how DL projects evolve, whether maintainers in this domain encounter a dramatic increase in workload and whether or not existing maintainers can guarantee the sustained development of projects. To address this gap, we perform an empirical study to investigate the sustainability of DL projects, understand maintainers' workloads and workloads growth in DL projects, and compare them with traditional open-source software (OSS) projects. In this regard, we first investigate …


Privacy-Preserving Arbitrary Geometric Range Query In Mobile Internet Of Vehicles, Yinbin Miao, Lin Song, Xinghua Li, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng Jul 2024

Privacy-Preserving Arbitrary Geometric Range Query In Mobile Internet Of Vehicles, Yinbin Miao, Lin Song, Xinghua Li, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng

Research Collection School Of Computing and Information Systems

The mobile Internet of Vehicles (IoVs) has great potential for intelligent transportation, and creates spatial data query demands to realize the value of data. Outsourcing spatial data to a cloud server eliminates the need for local computation and storage, but it leads to data security and privacy threats caused by untrusted third-parties. Existing privacy-preserving spatial range query solutions based on Homomorphic Encryption (HE) have been developed to increase security. However, in the single server model, the private key is held by the query user, which incurs high computation and communication burdens on query users due to multiple rounds of interactions. …


Prioritising Github Priority Labels, James Caddy, Christoph Treude Jul 2024

Prioritising Github Priority Labels, James Caddy, Christoph Treude

Research Collection School Of Computing and Information Systems

Communities on GitHub often use issue labels as a way of triaging issues by assigning them priority ratings based on how urgently they should be addressed. The labels used are determined by the repository contributors and notstandardisedbyGitHub.Thismakes it difficult for priority-related reasoning across repositories for both researchers and contributors. Previous work shows interest in how issues are labelled and what the consequences for those labels are. For instance, some previous work has used clustering models and natural language processing to categorise labels without a particular emphasis on priority. With this publication, we introduce a unique data set of 812 manually …


Configurable Mirror Descent : Towards A Unification Of Decision Making, Pengdeng Li, Shuxin Li, Chang Yang, Xinrun Wang, Hau Chan, Bo An Jul 2024

Configurable Mirror Descent : Towards A Unification Of Decision Making, Pengdeng Li, Shuxin Li, Chang Yang, Xinrun Wang, Hau Chan, Bo An

Research Collection School Of Computing and Information Systems

Decision-making problems, categorized as single-agent, e.g., Atari, cooperative multi-agent, e.g., Hanabi, competitive multi-agent, e.g., Hold’em poker, and mixed cooperative and competitive, e.g., football, are ubiquitous in the real world. Although various methods have been proposed to address the specific decision-making categories, these methods typically evolve independently and cannot generalize to other categories. Therefore, a fundamental question for decision-making is: Can we develop a single algorithm to tackle ALL categories of decision-making problems? There are several main challenges to address this question: i) different decision-making categories involve different numbers of agents and different relationships between agents, ii) different categories have different …


Augmenting Decision With Hypothesis In Reinforcement Learning, Minh Quang Nguyen, Hady Wirawan Lauw Jul 2024

Augmenting Decision With Hypothesis In Reinforcement Learning, Minh Quang Nguyen, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Value-based reinforcement learning is the current State-Of-The-Art due to high sampling efficiency. However, our study shows it suffers from low exploitation in early training period and bias sensitiveness. To address these issues, we propose to augment the decision-making process with hypothesis, a weak form of environment description. Our approach relies on prompting the learning agent with accurate hypotheses, and designing a ready-to-adapt policy through incremental learning. We propose the ALH algorithm, showing detailed analyses on a typical learning scheme and a diverse set of Mujoco benchmarks. Our algorithm produces a significant improvement over value-based learning algorithms and other strong baselines. …


An Exploratory Study Of Conventional Machine Learning And Large Language Models For Sentiment Analysis, Cui Zou, Jingyuan Cai, Langtao Chen, Fiona Fui-Hoon Nah Jul 2024

An Exploratory Study Of Conventional Machine Learning And Large Language Models For Sentiment Analysis, Cui Zou, Jingyuan Cai, Langtao Chen, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

Sentiment analysis is the use of natural language processing to identify affective states and determine people’s opinions in various analytical applications such as customer reviews and social media analyses. Large language models (LLMs) such as GPT-4o demonstrate impressive performance in text generation tasks. Despite numerous studies in the extant literature, few have compared the performance of conventional machine learning models with LLMs for sentiment analysis. This study aims to fill this gap by conducting an evaluation of these models using a balanced dataset of 2,000 IMDb movie reviews. Our study shows that GPT-4o achieves the highest performance, while GPT-3.5 and …


A Computational Aesthetic Design Science Study On Online Video Based On Triple-Dimensional Multimodal Analysis, Zhangguang Kang, Fiona Fui-Hoon Nah, Keng Siau Jul 2024

A Computational Aesthetic Design Science Study On Online Video Based On Triple-Dimensional Multimodal Analysis, Zhangguang Kang, Fiona Fui-Hoon Nah, Keng Siau

Research Collection School Of Computing and Information Systems

Computational video aesthetic prediction refers to using models that automatically evaluate the features of videos to produce their aesthetic scores. Current video aesthetic prediction models are designed based on bimodal frameworks. To address their limitations, we developed the Triple-Dimensional Multimodal Temporal Video Aesthetic neural network (TMTVA-net) model. The Long Short-Term Memory (LSTM) forms the conceptual foundation for the design framework. In the multimodal transformer layer, we employed two distinct transformers: the multimodal transformer and the feature transformer, enabling the acquisition of modality-specific patterns and representational features uniquely adapted to each modality. The fusion layer has also been redesigned to compute …


Hierarchical Damage Correlations For Old Photo Restoration, Weiwei Cai, Xuemiao Xu, Jiajia Xu, Huaidong Zhang, Haoxin Yang, Kun Zhang, Shengfeng He Jul 2024

Hierarchical Damage Correlations For Old Photo Restoration, Weiwei Cai, Xuemiao Xu, Jiajia Xu, Huaidong Zhang, Haoxin Yang, Kun Zhang, Shengfeng He

Research Collection School Of Computing and Information Systems

Restoring old photographs can preserve cherished memories. Previous methods handled diverse damages within the same network structure, which proved impractical. In addition, these methods cannot exploit correlations among artifacts, especially in scratches versus patch-misses issues. Hence, a tailored network is particularly crucial. In light of this, we propose a unified framework consisting of two key components: ScratchNet and PatchNet. In detail, ScratchNet employs the parallel Multi-scale Partial Convolution Module to effectively repair scratches, learning from multi-scale local receptive fields. In contrast, the patch-misses necessitate the network to emphasize global information. To this end, we incorporate a transformer-based encoder and decoder …


Double Issuer-Hiding Attribute-Based Credentials From Tag-Based Aggregatable Mercurial Signatures, Rui Shi, Yang Yang, Yingjiu Li, Huamin Feng, Guozhen Shi, Hwee Hwa Pang, Robert H. Deng Jul 2024

Double Issuer-Hiding Attribute-Based Credentials From Tag-Based Aggregatable Mercurial Signatures, Rui Shi, Yang Yang, Yingjiu Li, Huamin Feng, Guozhen Shi, Hwee Hwa Pang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Attribute-based anonymous credentials offer users fine-grained access control in a privacy-preserving manner. However, in such schemes obtaining a user's credentials requires knowledge of the issuer's public key, which obviously reveals the issuer's identity that must be hidden from users in certain scenarios. Moreover, verifying a user's credentials also requires the knowledge of issuer's public key, which may infer the user's private information from their choice of issuer. In this article, we introduce the notion of double issuer-hiding attribute-based credentials ( DIHAC ) to tackle these two problems. In our model, a central authority can issue public-key credentials for a group …


A Feasibility-Preserved Quantum Approximate Solver For The Capacitated Vehicle Routing Problem, Ningyi Xie, Xinwei Lee, Dongsheng Cai, Yoshiyuki Saito, Nobuyoshi Asai, Hoong Chuin Lau Jul 2024

A Feasibility-Preserved Quantum Approximate Solver For The Capacitated Vehicle Routing Problem, Ningyi Xie, Xinwei Lee, Dongsheng Cai, Yoshiyuki Saito, Nobuyoshi Asai, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. The CVRP extends from the Vehicle Routing Problem (VRP), aiming to determine the most efficient plan for a fleet of vehicles to deliver goods to a set of customers, subject to the limited carrying capacity of each vehicle. As the number of possible solutions increases exponentially with the number of customers, finding high-quality solutions remains a significant challenge. Recently, the Quantum Approximate Optimization Algorithm (QAOA), a quantum–classical hybrid algorithm, has exhibited enhanced performance in certain combinatorial optimization problems, such as …


Comparative Analysis Of Hate Speech Detection: Traditional Vs. Deep Learning Approaches, Haibo Pen, Nicole Anne Huiying Teo, Zhaoxia Wang Jul 2024

Comparative Analysis Of Hate Speech Detection: Traditional Vs. Deep Learning Approaches, Haibo Pen, Nicole Anne Huiying Teo, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

Detecting hate speech on social media poses a significant challenge, especially in distinguishing it from offensive language, as learning-based models often struggle due to nuanced differences between them, which leads to frequent misclassifications of hate speech instances, with most research focusing on refining hate speech detection methods. Thus, this paper seeks to know if traditional learning-based methods should still be used, considering the perceived advantages of deep learning in this domain. This is done by investigating advancements in hate speech detection. It involves the utilization of deep learning-based models for detailed hate speech detection tasks and compares the results with …


Toward Effective Secure Code Reviews: An Empirical Study Of Security-Related Coding Weaknesses, Wachiraphan Charoenwet, Patanamon Thongtanunam, Thuan Pham, Christoph Treude Jul 2024

Toward Effective Secure Code Reviews: An Empirical Study Of Security-Related Coding Weaknesses, Wachiraphan Charoenwet, Patanamon Thongtanunam, Thuan Pham, Christoph Treude

Research Collection School Of Computing and Information Systems

Identifying security issues early is encouraged to reduce the latent negative impacts on software systems. Code review is a widely-used method that allows developers to manually inspect modified code, catching security issues during a software development cycle. However, existing code review studies often focus on known vulnerabilities, neglecting coding weaknesses, which can introduce real-world security issues that are more visible through code review. The practices of code reviews in identifying such coding weaknesses are not yet fully investigated. To better understand this, we conducted an empirical case study in two large open-source projects, OpenSSL and PHP. Based on 135,560 code …


Transformer Models With Explainability For It Telemetry And Business Events, Shiau Hong Lim, Laura Wynter Jul 2024

Transformer Models With Explainability For It Telemetry And Business Events, Shiau Hong Lim, Laura Wynter

Research Collection School Of Computing and Information Systems

Temporal event data are commonly encountered in software applications across a wide range of domains, from IT telemetry and system logs to business process automation. Temporal event data in software applications carry information in various forms: both structured and unstructured, and with both regular and irregular occurrence frequency, making the representation of temporal event data challenging. Further chal-lenges come from the diversity in terms of the scale and volume of events that need to be summarized by the representation. We propose a general and unified approach to handle temporal event data for the purpose of learning a predictive transformer model. …


Reproducibility Debt: Challenges And Future Pathways, Zara Hassan, Christoph Treude, Michael Norrish, Graham Williams, Alex Potanin Jul 2024

Reproducibility Debt: Challenges And Future Pathways, Zara Hassan, Christoph Treude, Michael Norrish, Graham Williams, Alex Potanin

Research Collection School Of Computing and Information Systems

Reproducibility of scientic computation is a critical factor in validating its underlying process, but it is often elusive. Complexity and continuous evolution in software systems have introduced new challenges for reproducibility across a myriad of computational sciences, resulting in growing debt. This requires a comprehensive domain-agnostic study to dene and asses Reproducibility Debt (RpD) in scientic software, thus uncovering and classifying all underlying factors attributed towards its emergence and identication i.e., causes and eects. Moreover, an organised map of prevention strategies is imperative to guide researchers for its proactive management. This vision paper highlights the challenges that hinder eective management …


Generalization Analysis Of Deep Nonlinear Matrix Completion, Antoine Ledent, Rodrigo Alves Jul 2024

Generalization Analysis Of Deep Nonlinear Matrix Completion, Antoine Ledent, Rodrigo Alves

Research Collection School Of Computing and Information Systems

We provide generalization bounds for matrix completion with Schatten $p$ quasi-norm constraints, which is equivalent to deep matrix factorization with Frobenius constraints. In the uniform sampling regime, the sample complexity scales like $\widetilde{O}\left( rn\right)$ where $n$ is the size of the matrix and $r$ is a constraint of the same order as the ground truth rank in the isotropic case. In the distribution-free setting, the bounds scale as $\widetilde{O}\left(r^{1-\frac{p}{2}}n^{1+\frac{p}{2}}\right)$, which reduces to the familiar $\sqrt{r}n^{\frac{3}{2}}$ for $p=1$. Furthermore, we provide an analogue of the weighted trace norm for this setting which brings the sample complexity down to $\widetilde{O}(nr)$ in all …


Secure And Flexible Wildcard Queries, Qing Wang, Donghui Hu, Meng Li, Guomin Yang Jul 2024

Secure And Flexible Wildcard Queries, Qing Wang, Donghui Hu, Meng Li, Guomin Yang

Research Collection School Of Computing and Information Systems

Wildcard Keyword Searchable Encryption (WKSE) enables users to search desired encrypted files with wildcard queries. Previous schemes only enabled single-character wildcard queries or restricted multi-character wildcard queries. Even if the two types of queries are supported by several schemes, they are vulnerable to correlation attacks and composition attacks. In this paper, we propose a WKSE scheme Secure Flexible Wildcard Queries (SFWQ) that supports highly flexible wildcard queries and resists correlation and composition attacks. Specifically, we adopt the interval matching method instead of traditional position matching, so that SFWQ supports a variety of queries, including single-character wildcard queries, multi-character wildcard queries, …


Evilscreen Attack: Smart Tv Hijacking Via Multi-Channel Remote Control Mimicry, Yiwei Zhang, Siqi Ma, Tiancheng Chen, Juanru Li, Robert H. Deng, Elisa Bertino Jul 2024

Evilscreen Attack: Smart Tv Hijacking Via Multi-Channel Remote Control Mimicry, Yiwei Zhang, Siqi Ma, Tiancheng Chen, Juanru Li, Robert H. Deng, Elisa Bertino

Research Collection School Of Computing and Information Systems

Modern smart TVs often communicate with their remote controls (including the smartphone simulated ones) using multiple wireless channels (e.g., Infrared, Bluetooth, and Wi-Fi). However, this multi-channel remote control communication introduces a new attack surface. An inherent security flaw is that remote controls of most smart TVs are designed to work in a benign environment rather than an adversarial one, and thus wireless communications between a smart TV and its remote controls are not strongly protected. Attackers can leverage such a flaw to abuse the remote control communication and compromise smart TV systems. In this paper, we propose EvilScreen, a novel …


Fine-Grained Passenger Load Prediction Inside Metro Network Via Smart Card Data, Xiancai Tian, Chen Zhang, Baihua Zheng Jul 2024

Fine-Grained Passenger Load Prediction Inside Metro Network Via Smart Card Data, Xiancai Tian, Chen Zhang, Baihua Zheng

Research Collection School Of Computing and Information Systems

Metro system serves as the backbone for urban public transportation. Accurate passenger load prediction for the metro system plays a crucial role in metro service quality improvement, such as helping operators schedule train timetables and passengers plan their trips. However, existing works can only predict low-grained passenger flows of origin-destination (O-D) paths or inflows/outflows of each station but cannot predict passenger load distribution over the whole metro network. To this end, this paper proposes an end-to-end inference framework, PIPE, for passenger load prediction of every metro segment between two adjacent stations, by only utilizing smart card data. In particular, PIPE …


Verifiable Outsourced Attribute-Based Encryption Scheme For Cloud-Assisted Mobile E-Health System, Yinbin Miao, Feng Li, Xinghua Li, Jianting Ning, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng Jul 2024

Verifiable Outsourced Attribute-Based Encryption Scheme For Cloud-Assisted Mobile E-Health System, Yinbin Miao, Feng Li, Xinghua Li, Jianting Ning, Hongwei Li, Kim-Kwang Raymond Choo, Robert H. Deng

Research Collection School Of Computing and Information Systems

The cloud-assisted mobile electronic health (e-health) system facilitates e-health data sharing between healthcare providers and patients, but also raises the security and privacy concerns of e-health data. Although Ciphertext-Policy Attribute-Based Encryption (CP-ABE) has been a promising technique to achieve fine-grained access control over encrypted e-health data, it still incurs high encryption and decryption burdens on mobile users such as smartphones and sensors. In addition, malicious cloud servers may conduct incorrect operations due to various interest incentives (e.g., leaking sensitive information to illegal users, saving computation and storage costs). To solve the above issues, in this paper we first propose an …


Privacy-Preserved Data Trading Via Verifiable Data Disturbance, Man Zhang, Xinghua Li, Yanbing Ren, Bin Luo, Yinbin Miao, Ximeng Liu, Robert H. Deng Jul 2024

Privacy-Preserved Data Trading Via Verifiable Data Disturbance, Man Zhang, Xinghua Li, Yanbing Ren, Bin Luo, Yinbin Miao, Ximeng Liu, Robert H. Deng

Research Collection School Of Computing and Information Systems

To motivate data owner (DO) to trade data, the existing data trading allows DO to sell the disturbed data to the data consumer (DC), where the disturbance parameter and the data price are negotiated by them, and DO independently adds the disturbance noise to data (usually continuous type) following the negotiation result. However, DOs may violate the negotiated parameter and add more noise to data while obtaining the negotiated price, which damages DC's disturbed data availability. This deficiency is rooted in the absence of supervision and verifiability on DOs’ independent disturbances. Aiming at the above problem, we devise a privacy-preserved …


Towards Automated Slide Augmentation To Discover Credible And Relevant Links, Dilan Dinushka Senarath Arachchige, Christopher M. Poskitt, Kwan Chin (Xu Guangjin) Koh, Heng Ngee Mok, Hady Wirawan Lauw Jul 2024

Towards Automated Slide Augmentation To Discover Credible And Relevant Links, Dilan Dinushka Senarath Arachchige, Christopher M. Poskitt, Kwan Chin (Xu Guangjin) Koh, Heng Ngee Mok, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Learning from concise educational materials, such as lecture notes and presentation slides, often prompts students to seek additional resources. Newcomers to a subject may struggle to find the best keywords or lack confidence in the credibility of the supplementary materials they discover. To address these problems, we introduce Slide++, an automated tool that identifies keywords from lecture slides, and uses them to search for relevant links, videos, and Q&As. This interactive website integrates the original slides with recommended resources, and further allows instructors to 'pin' the most important ones. To evaluate the effectiveness of the tool, we trialled the system …


Microkarta: Visualising Microservice Architectures, Oscar Manglaras, Alex Farkas, Peter Fule, Christoph Treude, Markus Wagner Jul 2024

Microkarta: Visualising Microservice Architectures, Oscar Manglaras, Alex Farkas, Peter Fule, Christoph Treude, Markus Wagner

Research Collection School Of Computing and Information Systems

Conceptualising and debugging a microservice architecture can be a challenge for developers due to the complex topology of inter-service communication, which may only apparent when viewing the architecture as a whole. In this paper, we present MicroKarta, a dashboard containing three types of network diagram that visualise complex microservice architectures, and that are designed to address problems faced by developers of these architectures. Initial feedback from industry developers has been positive. This dashboard can be used by developers to explore and debug microservice architectures, and can be used to compare the effectiveness of different types of network visualisation for assisting …


Partial Solution Based Constraint Solving Cache In Symbolic Execution, Ziqi Shuai, Zhenbang Chen, Kelin Ma, Kunlin Liu, Yufeng Zhang, Jun Sun, Ji Wang Jul 2024

Partial Solution Based Constraint Solving Cache In Symbolic Execution, Ziqi Shuai, Zhenbang Chen, Kelin Ma, Kunlin Liu, Yufeng Zhang, Jun Sun, Ji Wang

Research Collection School Of Computing and Information Systems

Constraint solving is one of the main challenges for symbolic execution. Caching is an effective mechanism to reduce the number of the solver invocations in symbolic execution and is adopted by many mainstream symbolic execution engines. However, caching can not perform well on all programs. How to improve caching’s effectiveness is challenging in general. In this work, we propose a partial solution-based caching method for improving caching’s effectiveness. Our key idea is to utilize the partial solutions inside the constraint solving to generate more cache entries. A partial solution may satisfy other constraints of symbolic execution. Hence, our partial solution-based …


A Bottom-Up Multi-Disciplinary Approach For Sustainability Education: Un-Sdg 13.3, Benjamin Gan, Thomas Menkhoff, Eng Lieh Ouh, Kevin Cheong Jul 2024

A Bottom-Up Multi-Disciplinary Approach For Sustainability Education: Un-Sdg 13.3, Benjamin Gan, Thomas Menkhoff, Eng Lieh Ouh, Kevin Cheong

Research Collection School Of Computing and Information Systems

Teaching both information systems and business undergraduates to break the current inertia in sustainability action requires innovative teaching & learning approaches as well as inter-disciplinary knowledge inputs. This study presents a bottom-up T&L approach delivered by a group of educators from different disciplines aimed at addressing UN-SDG Goal 13 ‘Climate Action’ with a novel approach. Integrating a problem-centric community project assignment into existing courses, our students worked on different disciplinary elements such as persuasive technologies and awareness campaigns to help to address local sustainability initiatives by community partners. We collected data to measure how students’ motivation, engagement, teamwork, and community …


Jigsaw: Edge-Based Streaming Perception Over Spatially Overlapped Multi-Camera Deployments, Ila Gokarn, Yigong Hu, Tarek Abdelzaher, Archan Misra Jul 2024

Jigsaw: Edge-Based Streaming Perception Over Spatially Overlapped Multi-Camera Deployments, Ila Gokarn, Yigong Hu, Tarek Abdelzaher, Archan Misra

Research Collection School Of Computing and Information Systems

We present JIGSAW, a novel system that performs edge-based streaming perception over multiple video streams, while additionally factoring in the redundancy offered by the spatial overlap often exhibited in urban, multi-camera deployments. To assure high streaming throughput, JIGSAW extracts and spatially multiplexes multiple regions-of-interest from different camera frames into a smaller canvas frame. Moreover, to ensure that perception stays abreast of evolving object kinematics, JIGSAW includes a utility-based weighted scheduler to preferentially prioritize and even skip object-specific tiles extracted from an incoming stream of camera frames. Using the CityflowV2 traffic surveillance dataset, we show that JIGSAW can simultaneously process 25 …


Violet: Visual Analytics For Explainable Quantum Neural Networks, Shaolun Ruan, Zhiding Liang, Qiang Guan, Paul Robert Griffin, Xiaolin Wen, Yanna Lin, Yong Wang Jun 2024

Violet: Visual Analytics For Explainable Quantum Neural Networks, Shaolun Ruan, Zhiding Liang, Qiang Guan, Paul Robert Griffin, Xiaolin Wen, Yanna Lin, Yong Wang

Research Collection School Of Computing and Information Systems

With the rapid development of Quantum Machine Learning, quantum neural networks (QNN) have experienced great advancement in the past few years, harnessing the advantages of quantum computing to significantly speed up classical machine learning tasks. Despite their increasing popularity, the quantum neural network is quite counter-intuitive and difficult to understand, due to their unique quantum-specific layers (e.g., data encoding and measurement) in their architecture. It prevents QNN users and researchers from effectively understanding its inner workings and exploring the model training status. To fill the research gap, we propose VIOLET , a novel visual analytics approach to improve the explainability …


Learning Dynamic Multimodal Network Slot Concepts From The Web For Forecasting Environmental, Social And Governance Ratings, Gary Ang, Ee-Peng Lim Jun 2024

Learning Dynamic Multimodal Network Slot Concepts From The Web For Forecasting Environmental, Social And Governance Ratings, Gary Ang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Dynamic multimodal networks are networks with node attributes from different modalities where the at- tributes and network relationships evolve across time, i.e., both networks and multimodal attributes are dynamic; for example, dynamic relationship networks between companies that evolve across time due to changes in business strategies and alliances, which are associated with dynamic company attributes from multiple modalities such as textual online news, categorical events, and numerical financial-related data. Such information can be useful in predictive tasks involving companies. Environmental, social, and gov- ernance (ESG) ratings of companies are important for assessing the sustainability risks of companies. The process of …


Locality-Aware Tail Node Embeddings On Homogeneous And Heterogeneous Networks, Zemin Liu, Yuan Fang, Wentao Zhang, Xinming Zhang, Steven C. H. Hoi Jun 2024

Locality-Aware Tail Node Embeddings On Homogeneous And Heterogeneous Networks, Zemin Liu, Yuan Fang, Wentao Zhang, Xinming Zhang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

While the state-of-the-art network embedding approaches often learn high-quality embeddings for high-degree nodes with abundant structural connectivity, the quality of the embeddings for low-degree or nodes is often suboptimal due to their limited structural connectivity. While many real-world networks are long-tailed, to date little effort has been devoted to tail node embeddings. In this article, we formulate the goal of learning tail node embeddings as a problem, given the few links on each tail node. In particular, since each node resides in its own local context, we personalize the regression model for each tail node. To reduce overfitting in the …