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

Computer Sciences Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 2641 - 2670 of 8479

Full-Text Articles in Computer Sciences

Biasheal: On-The-Fly Black-Box Healing Of Bias In Sentiment Analysis Systems, Zhou Yang, Harshit Jain, Jieke Shi, Muhammad Hilmi Asyrofi, David Lo Sep 2021

Biasheal: On-The-Fly Black-Box Healing Of Bias In Sentiment Analysis Systems, Zhou Yang, Harshit Jain, Jieke Shi, Muhammad Hilmi Asyrofi, David Lo

Research Collection School Of Computing and Information Systems

Although Sentiment Analysis (SA) is widely applied in many domains, existing research has revealed that the unfairness in SA systems can be harmful to the welfare of less privileged people. Several works propose pre-processing and in-processing methods to eliminate bias in SA systems, but little attention is paid to utilizing post-processing methods to heal bias. Postprocessing methods are particularly important for systems that use third-party SA services. Systems that use such services have no access to the SA engine or its training data and thus cannot apply pre-processing nor in-processing methods. Therefore, this paper proposes a black-box post-processing method to …

Go to article

Does Bert Understand Idioms? A Probing-Based Empirical Study Of Bert Encodings Of Idioms, Minghuan Tan, Jing Jiang Sep 2021

Does Bert Understand Idioms? A Probing-Based Empirical Study Of Bert Encodings Of Idioms, Minghuan Tan, Jing Jiang

Research Collection School Of Computing and Information Systems

Understanding idioms is important in NLP. In this paper, we study to what extent pre-trained BERT model can encode the meaning of a potentially idiomatic expression (PIE) in a certain context. We make use of a few existing datasets and perform two probing tasks: PIE usage classification and idiom paraphrase identification. Our experiment results suggest that BERT indeed can separate the literal and idiomatic usages of a PIE with high accuracy. It is also able to encode the idiomatic meaning of a PIE to some extent.

Go to article

Learning And Evaluating Chinese Idiom Embeddings, Minghuan Tan, Jing Jiang Sep 2021

Learning And Evaluating Chinese Idiom Embeddings, Minghuan Tan, Jing Jiang

Research Collection School Of Computing and Information Systems

We study the task of learning and evaluating Chinese idiom embeddings. We first construct a new evaluation dataset that contains idiom synonyms and antonyms. Observing that existing Chinese word embedding methods may not be suitable for learning idiom embeddings, we further present a BERT-based method that directly learns embedding vectors for individual idioms. We empirically compare representative existing methods and our method. We find that our method substantially outperforms existing methods on the evaluation dataset we have constructed.

Go to article

Secure And Verifiable Outsourced Data Dimension Reduction On Dynamic Data, Zhenzhu Chen, Anmin Fu, Robert H. Deng, Ximeng Liu, Yang Yang, Yinghui Zhang Sep 2021

Secure And Verifiable Outsourced Data Dimension Reduction On Dynamic Data, Zhenzhu Chen, Anmin Fu, Robert H. Deng, Ximeng Liu, Yang Yang, Yinghui Zhang

Research Collection School Of Computing and Information Systems

Dimensionality reduction aims at reducing redundant information in big data and hence making data analysis more efficient. Resource-constrained enterprises or individuals often outsource this time-consuming job to the cloud for saving storage and computing resources. However, due to inadequate supervision, the privacy and security of outsourced data have been a serious concern to data owners. In this paper, we propose a privacypreserving and verifiable outsourcing scheme for data dimension reduction, based on incremental Non-negative Matrix Factorization (NMF) method. We emphasize the importance of incremental data processing, exploiting the properties of NMF to enable data dynamics in consideration of data updating …

Go to article

Enhancing Project Based Learning With Unsupervised Learning Of Project Reflections, Hua Leong Fwa Sep 2021

Enhancing Project Based Learning With Unsupervised Learning Of Project Reflections, Hua Leong Fwa

Research Collection School Of Computing and Information Systems

Natural Language Processing (NLP) is an area of research and application that uses computers to analyze human text. It has seen wide adoption within several industries but few studies have investigated it for use in evaluating the effectiveness of educational interventions and pedagogies. Pedagogies such as Project based learning (PBL) centers on learners solving an authentic problem or challenge which leads to knowledge creation and higher engagement. PBL also lends itself well in plugging the gap between what is taught in classrooms and applying the knowledge gained to the real working environment. In this study, we seek to investigate how …

Go to article

Dynamic Heterogeneous Graph Embedding Via Heterogeneous Hawkes Process, Yugang Ji, Tianrui Jia, Yuan Fang, Chuan Shi Sep 2021

Dynamic Heterogeneous Graph Embedding Via Heterogeneous Hawkes Process, Yugang Ji, Tianrui Jia, Yuan Fang, Chuan Shi

Research Collection School Of Computing and Information Systems

Graph embedding, aiming to learn low-dimensional representations of nodes while preserving valuable structure information, has played a key role in graph analysis and inference. However, most existing methods deal with static homogeneous topologies, while graphs in real-world scenarios are gradually generated with different-typed temporal events, containing abundant semantics and dynamics. Limited work has been done for embedding dynamic heterogeneous graphs since it is very challenging to model the complete formation process of heterogeneous events. In this paper, we propose a novel Heterogeneous Hawkes Process based dynamic Graph Embedding (HPGE) to handle this problem. HPGE effectively integrates the Hawkes process into …

Go to article

Quantum Computing For Supply Chain Finance, Paul R. Griffin, Ritesh Sampat Sep 2021

Quantum Computing For Supply Chain Finance, Paul R. Griffin, Ritesh Sampat

Research Collection School Of Computing and Information Systems

Applying quantum computing to real world applications to assess the potential efficacy is a daunting task for non-quantum specialists. This paper shows an implementation of two quantum optimization algorithms applied to portfolios of trade finance portfolios and compares the selections to those chosen by experienced underwriters and a classical optimizer. The method used is to map the financial risk and returns for a trade finance portfolio to an optimization function of a quantum algorithm developed in a Qiskit tutorial. The results show that whilst there is no advantage seen by using the quantum algorithms, the performance of the quantum algorithms …

Go to article

Artificial Intelligence And Work: Two Perspectives, Steven Miller, Thomas H. Davenport Sep 2021

Artificial Intelligence And Work: Two Perspectives, Steven Miller, Thomas H. Davenport

Research Collection School Of Computing and Information Systems

One of the most important issues in contemporary societies is the impact of intelligent technologies on human work. For an empirical perspective on the issue, we recently completed 30 case studies of people collaborating with AI-enabled smart machines. Twenty-four were from North America, mostly in the US. Six were from Southeast Asia, mostly in Singapore. We compare some of our observations to one of the broadest academic examinations of the issue. In particular, we focus on our case study observations with regard to key findings from the MIT Task Force on the Work of the Future report.

Go to article

Routing Policy Choice Prediction In A Stochastic Network: Recursive Model And Solution Algorithm, Tien Mai, Xinlian Yu, Song Gao, Emma Frejinger Sep 2021

Routing Policy Choice Prediction In A Stochastic Network: Recursive Model And Solution Algorithm, Tien Mai, Xinlian Yu, Song Gao, Emma Frejinger

Research Collection School Of Computing and Information Systems

We propose a Recursive Logit (STD-RL) model for routing policy choice in a stochastic time-dependent (STD) network, where a routing policy is a mapping from states to actions on which link to take next, and a state is defined by node, time and information. A routing policy encapsulates travelers’ adaptation to revealed traffic conditions when making route choices. The STD-RL model circumvents choice set generation, a procedure with known issues related to estimation and prediction. In a given state, travelers make their link choice maximizing the sum of the utility of the outgoing link and the expected maximum utility until …

Go to article

A Learning And Optimization Framework For Collaborative Urban Delivery Problems With Alliances, Jingfeng Yang, Hoong Chuin Lau Sep 2021

A Learning And Optimization Framework For Collaborative Urban Delivery Problems With Alliances, Jingfeng Yang, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The emergence of e-Commerce imposes a tremendous strain on urban logistics which in turn raises concerns on environmental sustainability if not performed efficiently. While large logistics service providers (LSPs) can perform fulfillment sustainably as they operate extensive logistic networks, last-mile logistics are typically performed by small LSPs who need to form alliances to reduce delivery costs and improve efficiency, and to compete with large players. In this paper, we consider a multi-alliance multi-depot pickup and delivery problem with time windows (MAD-PDPTW) and formulate it as a mixed-integer programming (MIP) model. To cope with large-scale problem instances, we propose a two-stage …

Go to article

Injecting Descriptive Meta-Information Into Pre-Trained Language Models With Hypernetworks, Wenying Duan, Xiaoxi He, Zimu Zhou, Hong Rao, Lothar Thiele Sep 2021

Injecting Descriptive Meta-Information Into Pre-Trained Language Models With Hypernetworks, Wenying Duan, Xiaoxi He, Zimu Zhou, Hong Rao, Lothar Thiele

Research Collection School Of Computing and Information Systems

Pre-trained language models have been widely adopted as backbones in various natural language processing tasks. However, existing pre-trained language models ignore the descriptive meta-information in the text such as the distinction between the title and the mainbody, leading to over-weighted attention to insignificant text. In this paper, we propose a hypernetwork-based architecture to model the descriptive meta-information and integrate it into pre-trained language models. Evaluations on three natural language processing tasks show that our method notably improves the performance of pre-trained language models and achieves the state-of-the-art results on keyphrase extraction.

Go to article

The Empathetic Car: Exploring Emotion Inference Via Driver Behaviour And Traffic Context, Shu Liu, Kevin Koch, Zimu Zhou, Simon Foll, Xiaoxi He, Tina Menke, Elgar Fleisch, Felix Wortmann Sep 2021

The Empathetic Car: Exploring Emotion Inference Via Driver Behaviour And Traffic Context, Shu Liu, Kevin Koch, Zimu Zhou, Simon Foll, Xiaoxi He, Tina Menke, Elgar Fleisch, Felix Wortmann

Research Collection School Of Computing and Information Systems

An empathetic car that is capable of reading the driver’s emotions has been envisioned by many car manufacturers. Emotion inference enables in-vehicle applications to improve driver comfort, well-being, and safety. Available emotion inference approaches use physiological, facial, and speech-related data to infer emotions during driving trips. However, existing solutions have two major limitations: Relying on sensors that are not built into the vehicle restricts emotion inference to those people leveraging corresponding devices (e.g., smartwatches). Relying on modalities such as facial expressions and speech raises privacy concerns. By contrast, researchers in mobile health have been able to infer affective states (e.g., …

Go to article

Feeder Vessel Routing And Transshipment Coordination At A Congested Hub Port, Jiangang Jin, Qiang Meng, Hai Wang Sep 2021

Feeder Vessel Routing And Transshipment Coordination At A Congested Hub Port, Jiangang Jin, Qiang Meng, Hai Wang

Research Collection School Of Computing and Information Systems

With increasing container-shipping traffic, congestion at transshipment hub ports happens from time to time incurring longer-than-expected waiting time for vessels and loss of transshipment connections. This situation is even worse for feeder companies, due to their relatively lower berthing priority. It is essential to design the feeder vessel routes and schedules in response to hub port congestion while ensuring efficient transshipment connection with their connecting long-haul services. In this paper, we study the vessel routing and transshipment coordination problem for a feeder liner company where only limited choices of berthing time slots are available at the hub port. We proposed …

Go to article

Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie He, Shukai Li, Chen Zhang, Baihua Zheng, Fugee Tsung Sep 2021

Holistic Prediction For Public Transport Crowd Flows: A Spatio Dynamic Graph Network Approach, Bingjie He, Shukai Li, Chen Zhang, Baihua Zheng, Fugee Tsung

Research Collection School Of Computing and Information Systems

This paper targets at predicting public transport in-out crowd flows of different regions together with transit flows between them in a city. The main challenge is the complex dynamic spatial correlation of crowd flows of different regions and origin-destination (OD) paths. Different from road traffic flows whose spatial correlations mainly depend on geographical distance, public transport crowd flows significantly relate to the region’s functionality and connectivity in the public transport network. Furthermore, influenced by commuters’ time-varying travel patterns, the spatial correlations change over time. Though there exist many works focusing on either predicting in-out flows or OD transit flows of …

Go to article

Which Variables Should I Log?, Zhongxin Liu, Xin Xia, David Lo, Zhenchang Xing, Ahmed E. Hassan, Shanping Li Sep 2021

Which Variables Should I Log?, Zhongxin Liu, Xin Xia, David Lo, Zhenchang Xing, Ahmed E. Hassan, Shanping Li

Research Collection School Of Computing and Information Systems

Developers usually depend on inserting logging statements into the source code to collect system runtime information. Such logged information is valuable for software maintenance. A logging statement usually prints one or more variables to record vital system status. However, due to the lack of rigorous logging guidance and the requirement of domain-specific knowledge, it is not easy for developers to make proper decisions about which variables to log. To address this need, in this work, we propose an approach to recommend logging variables for developers during development by learning from existing logging statements. Different from other prediction tasks in software …

Go to article

Orthogonal Inductive Matrix Completion, Antoine Ledent, Rrodrigo Alves, Marius Kloft Sep 2021

Orthogonal Inductive Matrix Completion, Antoine Ledent, Rrodrigo Alves, Marius Kloft

Research Collection School Of Computing and Information Systems

We propose orthogonal inductive matrix completion (OMIC), an interpretable approach to matrix completion based on a sum of multiple orthonormal side information terms, together with nuclear-norm regularization. The approach allows us to inject prior knowledge about the singular vectors of the ground-truth matrix. We optimize the approach by a provably converging algorithm, which optimizes all components of the model simultaneously. We study the generalization capabilities of our method in both the distribution-free setting and in the case where the sampling distribution admits uniform marginals, yielding learning guarantees that improve with the quality of the injected knowledge in both cases. As …

Go to article

Unified And Incremental Simrank: Index-Free Approximation With Scheduled Principle, Fanwei Zhu, Yuan Fang, Kai Zhang, Kevin C.-C. Chang, Hongtai Cao, Zhen Jiang, Minghui Wu Sep 2021

Unified And Incremental Simrank: Index-Free Approximation With Scheduled Principle, Fanwei Zhu, Yuan Fang, Kai Zhang, Kevin C.-C. Chang, Hongtai Cao, Zhen Jiang, Minghui Wu

Research Collection School Of Computing and Information Systems

SimRank is a popular link-based similarity measure on graphs. It enables a variety of applications with different modes of querying (e.g., single-pair, single-source and all-pair modes). In this paper, we propose UISim, a unified and incremental framework for all SimRank modes based on a scheduled approximation principle. UISim processes queries with incremental and prioritized exploration of the entire computation space, and thus allows flexible tradeoff of time and accuracy. On the other hand, it creates and shares common “building blocks” for online computation without relying on indexes, and thus is efficient to handle both static and dynamic graphs. Our experiments …

Go to article

Cosy: Counterfactual Syntax For Cross-Lingual Understanding, Sicheng Yu, Hao Zhang, Yulei Niu, Qianru Sun, Jing Jiang Aug 2021

Cosy: Counterfactual Syntax For Cross-Lingual Understanding, Sicheng Yu, Hao Zhang, Yulei Niu, Qianru Sun, Jing Jiang

Research Collection School Of Computing and Information Systems

Pre-trained multilingual language models, e.g., multilingual-BERT, are widely used in cross-lingual tasks, yielding the state-of-the-art performance. However, such models suffer from a large performance gap between source and target languages, especially in the zero-shot setting, where the models are fine-tuned only on English but tested on other languages for the same task. We tackle this issue by incorporating language-agnostic information, specifically, universal syntax such as dependency relations and POS tags, into language models, based on the observation that universal syntax is transferable across different languages. Our approach, named COunterfactual SYntax (COSY), includes the design of SYntax-aware networks as well as …

Go to article

Boundary Detection With Bert For Span-Level Emotion Cause Analysis, Xiangju Li, Wei Gao, Shi Feng, Yifei Zhang, Daling Wang Aug 2021

Boundary Detection With Bert For Span-Level Emotion Cause Analysis, Xiangju Li, Wei Gao, Shi Feng, Yifei Zhang, Daling Wang

Research Collection School Of Computing and Information Systems

Emotion cause analysis (ECA) has been anemerging topic in natural language processing,which aims to identify the reasons behind acertain emotion expressed in the text. MostECA methods intend to identify the clausewhich contains the cause of a given emotion,but such clause-level ECA (CECA) can be ambiguous and imprecise. In this paper, we aimat span-level ECA (SECA) by detecting theprecise boundaries of text spans conveying accurate emotion causes from the given context.We formulate this task as sequence labelingand position identification problems and design two neural methods to solve them. Experiments on two benchmark ECA datasets showthat the proposed methods substantially outperform the …

Go to article

Code Integrity Attestation For Plcs Using Black Box Neural Network Predictions, Yuqi Chen, Christopher M. Poskitt, Jun Sun Aug 2021

Code Integrity Attestation For Plcs Using Black Box Neural Network Predictions, Yuqi Chen, Christopher M. Poskitt, Jun Sun

Research Collection School Of Computing and Information Systems

Cyber-physical systems (CPSs) are widespread in critical domains, and significant damage can be caused if an attacker is able to modify the code of their programmable logic controllers (PLCs). Unfortunately, traditional techniques for attesting code integrity (i.e. verifying that it has not been modified) rely on firmware access or roots-of-trust, neither of which proprietary or legacy PLCs are likely to provide. In this paper, we propose a practical code integrity checking solution based on privacy-preserving black box models that instead attest the input/output behaviour of PLC programs. Using faithful offline copies of the PLC programs, we identify their most important …

Go to article

Biasrv: Uncovering Biased Sentiment Predictions At Runtime, Zhou Yang, Muhammad Hilmi Asyrofi, David Lo Aug 2021

Biasrv: Uncovering Biased Sentiment Predictions At Runtime, Zhou Yang, Muhammad Hilmi Asyrofi, David Lo

Research Collection School Of Computing and Information Systems

Sentiment analysis (SA) systems, though widely applied in many domains, have been demonstrated to produce biased results. Some research works have been done in automatically generating test cases to reveal unfairness in SA systems, but the community still lacks tools that can monitor and uncover biased predictions at runtime. This paper fills this gap by proposing BiasRV, the first tool to raise an alarm when a deployed SA system makes a biased prediction on a given input text. To implement this feature, BiasRV dynamically extracts a template from an input text and from the template generates gender-discriminatory mutants (semanticallyequivalent texts …

Go to article

Discovery Of Mental Wellness Via Social Analytics For Liveability In An Urban City, Kar Way Tan Aug 2021

Discovery Of Mental Wellness Via Social Analytics For Liveability In An Urban City, Kar Way Tan

Research Collection School Of Computing and Information Systems

Smart cities, are often perceived as urban areas that use technologies to manage resources, improve economy and enhance community livelihood. In this paper, we share an approach which uses multiple sources of data for evidence-based analysis of the public's views, concerns and sentiments on the topic related to mental wellness. We hope to bring forth a better understanding of the existing concerns of the citizens and available social support. Our study leverages on social sensing via text mining and social network analysis to listen to the voices of the citizens through revealed content from web data sources, such as social …

Go to article

W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meera Radhakrishnan, Archan Misra, Rajesh K. Balan Aug 2021

W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meera Radhakrishnan, Archan Misra, Rajesh K. Balan

Research Collection School Of Computing and Information Systems

Fine-grained, unobtrusive monitoring of gym exercises can help users track their own exercise routines and also provide corrective feedback. We propose W8-Scope, a system that uses a simple magnetic-cum-accelerometer sensor, mounted on the weight stack of gym exercise machines, to infer various attributes of gym exercise behavior. More specifically, using multiple machine learning models, W8-Scope helps identify who is exercising, what exercise she is doing, how much weight she is lifting, and whether she is committing any common mistakes. Real world studies, conducted with 50 subjects performing 14 different exercises over 103 distinct sessions in two gyms, show that W8-Scope …

Go to article

Automating The Removal Of Obsolete Todo Comments, Zhipeng Gao, Xin Xia, David Lo, John C. Grundy, Thomas Zimmermann Aug 2021

Automating The Removal Of Obsolete Todo Comments, Zhipeng Gao, Xin Xia, David Lo, John C. Grundy, Thomas Zimmermann

Research Collection School Of Computing and Information Systems

TODO comments are very widely used by software developers to describe their pending tasks during software development. However, after performing the task developers sometimes neglect or simply forget to remove the TODO comment, resulting in obsolete TODO comments. These obsolete TODO comments can confuse development teams and may cause the introduction of bugs in the future, decreasing the software’s quality and maintainability. Manually identifying obsolete TODO comments is time-consuming and expensive. It is thus necessary to detect obsolete TODO comments and remove them automatically before they cause any unwanted side effects. In this work, we propose a novel model, named …

Go to article

A Survey On Complex Knowledge Base Question Answering: Methods, Challenges And Solutions, Yunshi Lan, Gaole He, Jinhao Jiang, Jing Jiang, Wayne Xin Zhao, Ji-Rong Wen Aug 2021

A Survey On Complex Knowledge Base Question Answering: Methods, Challenges And Solutions, Yunshi Lan, Gaole He, Jinhao Jiang, Jing Jiang, Wayne Xin Zhao, Ji-Rong Wen

Research Collection School Of Computing and Information Systems

Knowledge base question answering (KBQA) aims to answer a question over a knowledge base (KB). Recently, a large number of studies focus on semantically or syntactically complicated questions. In this paper, we elaborately summarize the typical challenges and solutions for complex KBQA. We begin with introducing the background about the KBQA task. Next, we present the two mainstream categories of methods for complex KBQA, namely semantic parsing-based (SP-based) methods and information retrieval-based (IR-based) methods. We then review the advanced methods comprehensively from the perspective of the two categories. Specifically, we explicate their solutions to the typical challenges. Finally, we conclude …

Go to article

Modeling Transitions Of Focal Entities For Conversational Knowledge Base Question Answering, Yunshi Lan, Jing Jiang Aug 2021

Modeling Transitions Of Focal Entities For Conversational Knowledge Base Question Answering, Yunshi Lan, Jing Jiang

Research Collection School Of Computing and Information Systems

Conversational KBQA is about answering a sequence of questions related to a KB. Follow-up questions in conversational KBQA often have missing information referring to entities from the conversation history. In this paper, we propose to model these implied entities, which we refer to as the focal entities of the conversation. We propose a novel graph-based model to capture the transitions of focal entities and apply a graph neural network to derive a probability distribution of focal entities for each question, which is then combined with a standard KBQA module to perform answer ranking. Our experiments on two datasets demonstrate the …

Go to article

Learn To Intervene: An Adaptive Learning Policy For Restless Bandits In Application To Preventive Healthcare, Arpita Biswas, Gaurav Aggarwal, Pradeep Varakantham, Milind Tambe Aug 2021

Learn To Intervene: An Adaptive Learning Policy For Restless Bandits In Application To Preventive Healthcare, Arpita Biswas, Gaurav Aggarwal, Pradeep Varakantham, Milind Tambe

Research Collection School Of Computing and Information Systems

In many public health settings, it is important for patients to adhere to health programs, such as taking medications and periodic health checks. Unfortunately, beneficiaries may gradually disengage from such programs, which is detrimental to their health. A concrete example of gradual disengagement has been observed by an organization that carries out a free automated call-based program for spreading preventive care information among pregnant women. Many women stop picking up calls after being enrolled for a few months. To avoid such disengagements, it is important to provide timely interventions. Such interventions are often expensive and can be provided to only …

Go to article

Pruning-Aware Merging For Efficient Multitask Inference, Dawei Gao, Xiaoxi He, Zimu Zhou, Yongxin Tong, Lothar Thiele Aug 2021

Pruning-Aware Merging For Efficient Multitask Inference, Dawei Gao, Xiaoxi He, Zimu Zhou, Yongxin Tong, Lothar Thiele

Research Collection School Of Computing and Information Systems

Many mobile applications demand selective execution of multiple correlated deep learning inference tasks on resource-constrained platforms. Given a set of deep neural networks, each pre-trained for a single task, it is desired that executing arbitrary combinations of tasks yields minimal computation cost. Pruning each network separately yields suboptimal computation cost due to task relatedness. A promising remedy is to merge the networks into a multitask network to eliminate redundancy across tasks before network pruning. However, pruning a multitask network combined by existing network merging schemes cannot minimise the computation cost of every task combination because they do not consider such …

Go to article

Crossasr++: A Modular Differential Testing Framework For Automatic Speech Recognition, Muhammad Hilmi Asyrofi, Zhou Yang, David Lo Aug 2021

Crossasr++: A Modular Differential Testing Framework For Automatic Speech Recognition, Muhammad Hilmi Asyrofi, Zhou Yang, David Lo

Research Collection School Of Computing and Information Systems

Developers need to perform adequate testing to ensure the quality of Automatic Speech Recognition (ASR) systems. However, manually collecting required test cases is tedious and time-consuming. Our recent work proposes CrossASR, a differential testing method for ASR systems. This method first utilizes Text-to-Speech (TTS) to generate audios from texts automatically and then feed these audios into different ASR systems for cross-referencing to uncover failed test cases. It also leverages a failure estimator to find failing test cases more efficiently. Such a method is inherently self-improvable: the performance can increase by leveraging more advanced TTS and ASR systems. So, in this …

Go to article

Mining Informal And Short Weekly Student Self-Reflections For Improving Student Learning Experience, Gottipati Swapna, Rafael Jose Barros Barrios, Kyong Jin Shim Aug 2021

Mining Informal And Short Weekly Student Self-Reflections For Improving Student Learning Experience, Gottipati Swapna, Rafael Jose Barros Barrios, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

Having students write short self-reflections at the end of each weekly session enables them to reflect on what they have learned in the session and what concepts they find challenging. Analyzing these selfreflections provides instructors with insights on how to address the missing conceptions and misconceptions of the students and appropriately plan and deliver the next session. In this paper, we study the impact of informal and short weekly self-reflections on students’ learning. Our methodology includes an approach to effective collection and mining of the textual reflections based on Google survey forms and TIBCO Spotfire. To evaluate our research questions, …

Go to article

First Prev Next Last