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

Articles 1801 - 1830 of 4266

Full-Text Articles in Entire DC Network

Voicecoach: Interactive Evidence-Based Training For Voice Modulation Skills In Public Speaking, Xingbo Wang, Haipeng Zeng, Yong Wang, Aoyu Wu, Zhida Sun, Xiaojuan Ma, Qu Huamin Apr 2020

Voicecoach: Interactive Evidence-Based Training For Voice Modulation Skills In Public Speaking, Xingbo Wang, Haipeng Zeng, Yong Wang, Aoyu Wu, Zhida Sun, Xiaojuan Ma, Qu Huamin

Research Collection School Of Computing and Information Systems

The modulation of voice properties, such as pitch, volume, and speed, is crucial for delivering a successful public speech. However, it is challenging to master different voice modulation skills. Though many guidelines are available, they are often not practical enough to be applied in different public speaking situations, especially for novice speakers. We present VoiceCoach, an interactive evidence-based approach to facilitate the effective training of voice modulation skills. Specifically, we have analyzed the voice modulation skills from 2623 high-quality speeches (i.e., TED Talks) and use them as the benchmark dataset. Given a voice input, VoiceCoach automatically recommends good voice modulation …


Detecting Fake News In Social Media: An Asia-Pacific Perspective, Meeyoung Cha, Wei Gao, Cheng-Te Li Mar 2020

Detecting Fake News In Social Media: An Asia-Pacific Perspective, Meeyoung Cha, Wei Gao, Cheng-Te Li

Research Collection School Of Computing and Information Systems

In March 2011, the catastrophic accident known as "The Fukushima Daiichi nuclear disaster" took place, initiated by the Tohoku earthquake and tsunami in Japan. The only nuclear accident to receive a Level-7 classification on the International Nuclear Event Scale since the Chernobyl nuclear power plant disaster in 1986, the Fukushima event triggered global concerns and rumors regarding radiation leaks. Among the false rumors was an image, which had been described as a map of radioactive discharge emanating into the Pacific Ocean, as illustrated in the accompanying figure. In fact, this figure, depicting the wave height of the tsunami that followed, …


S2n2: An Interpretive Semantic Structure Attention Neural Network For Trajectory Classification, Canghong Jin, Ting Tao, Xianzhe Luo, Zemin Liu, Minghui Wu Mar 2020

S2n2: An Interpretive Semantic Structure Attention Neural Network For Trajectory Classification, Canghong Jin, Ting Tao, Xianzhe Luo, Zemin Liu, Minghui Wu

Research Collection School Of Computing and Information Systems

We have witnessed a rapid growth over past decades in sensor data mining (SDM), which aims at extracting valuable information automatically from large repositories of moving activity data. One of the significant SDM tasks is identifying humans through their transit modes using a variety of user-tracking systems. However, to the best of our knowledge, distinguishing traces of users and understanding their behaviors are difficult tasks in most real-life cases for the following reasons: 1) activity data containing both temporal and spatial contexts are of high order and sparse; 2) living patterns are not as regular as expected, and the route …


W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meeralakshmi Radhakrishnan, Archan Misra, Rajesh Krishna Balan Mar 2020

W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meeralakshmi Radhakrishnan, Archan Misra, Rajesh Krishna 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 …


Space Efficient Revocable Ibe For Mobile Devices In Cloud Computing, Baodong Qin, Ximeng Liu, Zhuo Wei, Dong Zheng Mar 2020

Space Efficient Revocable Ibe For Mobile Devices In Cloud Computing, Baodong Qin, Ximeng Liu, Zhuo Wei, Dong Zheng

Research Collection School Of Computing and Information Systems

Revocation capacity is one of the main properties for an identity-based encryption (IBE), as in practice users’ private keys are possibly leaked or expired. However, existing revocable IBE schemes usually lack of short keys. Recently, Lin et al. proposed a method to design space efficient revocable IBE scheme from non-monotonic key-policy attribute-based encryption scheme. But, it requires too many pairings (linear to the number of revoked users) to decrypt an IBE ciphertext. In this study, we overcome this problem by adopting the technique of server-aided revocation, recently proposed by Qin et al. in ESORICS 2015. The main contribution is a …


Ifix: Fixing Concurrency Bugs While They Are Introduced, Zan Wang, Haichi Wang, Shuang Liu, Jun Sun, Haoyu Wang, Junjie Chen Mar 2020

Ifix: Fixing Concurrency Bugs While They Are Introduced, Zan Wang, Haichi Wang, Shuang Liu, Jun Sun, Haoyu Wang, Junjie Chen

Research Collection School Of Computing and Information Systems

Concurrency bugs are notoriously hard to identify and fix. A systematic way of avoiding concurrency bugs is to design and implement a locking policy that consistently guards all shared variables. Concurrency bugs thus can be viewed as the result of an illy-designed or poorly implemented locking policy. The trouble is that the locking policy is often not documented, which makes debugging concurrency bugs clueless. We argue that it is too late to debug concurrency bugs after programming is done and we instead detect and fix them while they are being implemented. In this work, we propose an approach named IFIX …


Automatic Verification Of Multi-Threaded Programs By Inference Of Rely-Guarantee Specifications, Xuan-Bach Le, David Sanan, Jun Sun, Shang-Wei Lin Mar 2020

Automatic Verification Of Multi-Threaded Programs By Inference Of Rely-Guarantee Specifications, Xuan-Bach Le, David Sanan, Jun Sun, Shang-Wei Lin

Research Collection School Of Computing and Information Systems

Rely-Guarantee is a comprehensive technique that supports compositional reasoning for concurrent programs. However, specifications of the Rely condition - environment interference, and Guarantee condition - local transformation of thread state - are challenging to establish. Thus the construction of these conditions becomes bottleneck in automating the technique. To tackle the above problem, we propose a verification framework that, based on Rely-Guarantee principles, constructs the correctness proof of concurrent program through inferring suitable Rely -Guarantee conditions automatically. Our framework first constructs a Hoare-style sequential proof for each thread and then applies abstraction refinement to elevate these proofs into concurrent ones with …


Towards K-Vertex Connected Component Discovery From Large Networks, Li Yuan, Guoren Wang, Yuhai Zhao, Feida Zhu Mar 2020

Towards K-Vertex Connected Component Discovery From Large Networks, Li Yuan, Guoren Wang, Yuhai Zhao, Feida Zhu

Research Collection School Of Computing and Information Systems

In many real life network-based applications such as social relation analysis, Web analysis, collaborative network, road network and bioinformatics, the discovery of components with high connectivity is an important problem. In particular, k-edge connected component (k-ECC) has recently been extensively studied to discover disjoint components. Yet many real scenarios present more needs and challenges for overlapping components. In this paper, we propose a k-vertex connected component (k-VCC) model, which is much more cohesive, and thus supports overlapping between components very well. To discover k-VCCs, we propose three frameworks including top-down, bottom-up and hybrid …


Securing Bring-Your-Own-Device (Byod) Programming Exams, Oka Kurniawan, Norman Lee, Christopher M. Poskitt Mar 2020

Securing Bring-Your-Own-Device (Byod) Programming Exams, Oka Kurniawan, Norman Lee, Christopher M. Poskitt

Research Collection School Of Computing and Information Systems

Traditional pen and paper exams are inadequate for modern university programming courses as they are misaligned with pedagogies and learning objectives that target practical coding ability. Unfortunately, many institutions lack the resources or space to be able to run assessments in dedicated computer labs. This has motivated the development of bring-your-own-device (BYOD) exam formats, allowing students to program in a similar environment to how they learnt, but presenting instructors with significant additional challenges in preventing plagiarism and cheating. In this paper, we describe a BYOD exam solution based on lockdown browsers, software which temporarily turns students' laptops into secure workstations …


Predicting Student Performance In Interactive Online Question Pools Using Mouse Interaction Features, Huan Wei, Haotian Li, Meng Xia, Yong Wang, Huamin Qu Mar 2020

Predicting Student Performance In Interactive Online Question Pools Using Mouse Interaction Features, Huan Wei, Haotian Li, Meng Xia, Yong Wang, Huamin Qu

Research Collection School Of Computing and Information Systems

Modeling student learning and further predicting the performance is a well-established task in online learning and is crucial to personalized education by recommending different learning resources to different students based on their needs. Interactive online question pools (e.g., educational game platforms), an important component of online education, have become increasingly popular in recent years. However, most existing work on student performance prediction targets at online learning platforms with a well-structured curriculum, predefined question order and accurate knowledge tags provided by domain experts. It remains unclear how to conduct student performance prediction in interactive online question pools without such well-organized question …


Stealthy And Efficient Adversarial Attacks Against Deep Reinforcement Learning, Jianwen Sun, Tianwei Zhang, Xiaofei Xie, Lei Ma, Yan Zheng, Kangjie Chen, Yang Liu Feb 2020

Stealthy And Efficient Adversarial Attacks Against Deep Reinforcement Learning, Jianwen Sun, Tianwei Zhang, Xiaofei Xie, Lei Ma, Yan Zheng, Kangjie Chen, Yang Liu

Research Collection School Of Computing and Information Systems

Adversarial attacks against conventional Deep Learning (DL) systems and algorithms have been widely studied, and various defenses were proposed. However, the possibility and feasibility of such attacks against Deep Reinforcement Learning (DRL) are less explored. As DRL has achieved great success in various complex tasks, designing effective adversarial attacks is an indispensable prerequisite towards building robust DRL algorithms. In this paper, we introduce two novel adversarial attack techniques to stealthily and efficiently attack the DRL agents. These two techniques enable an adversary to inject adversarial samples in a minimal set of critical moments while causing the most severe damage to …


Interpretable Rumor Detection In Microblogs By Attending To User Interactions, Ling Min Serena Khoo, Hai Leong Chieu, Zhong Qian, Jing Jiang Feb 2020

Interpretable Rumor Detection In Microblogs By Attending To User Interactions, Ling Min Serena Khoo, Hai Leong Chieu, Zhong Qian, Jing Jiang

Research Collection School Of Computing and Information Systems

We address rumor detection by learning to differentiate between the community’s response to real and fake claims in microblogs. Existing state-of-the-art models are based on tree models that model conversational trees. However, in social media, a user posting a reply might be replying to the entire thread rather than to a specific user. We propose a post-level attention model (PLAN) to model long distance interactions between tweets with the multi-head attention mechanism in a transformer network. We investigated variants of this model: (1) a structure aware self-attention model (StA-PLAN) that incorporates tree structure information in the transformer network, and (2) …


Deepbindiff: Learning Program-Wide Code Representations For Binary Diffing, Yue Duan, Xuezixiang Li, Jinghan Wang, Wang, Heng Yin Feb 2020

Deepbindiff: Learning Program-Wide Code Representations For Binary Diffing, Yue Duan, Xuezixiang Li, Jinghan Wang, Wang, Heng Yin

Research Collection School Of Computing and Information Systems

Binary diffing analysis quantitatively measures the differences between two given binaries and produces fine-grained basic block matching. It has been widely used to enable different kinds of critical security analysis. However, all existing program analysis and machine learning based techniques suffer from low accuracy, poor scalability, coarse granularity, or require extensive labeled training data to function. In this paper, we propose an unsupervised program-wide code representation learning technique to solve the problem. We rely on both the code semantic information and the program-wide control flow information to generate block embeddings. Furthermore, we propose a k-hop greedy matching algorithm to find …


Example-Based Colourization Via Dense Encoding Pyramids, Chufeng Xiao, Chu Han, Zhuming Zhang, Jing Qin, Tien-Tsin Wong, Guoqiang Han, Shengfeng He Feb 2020

Example-Based Colourization Via Dense Encoding Pyramids, Chufeng Xiao, Chu Han, Zhuming Zhang, Jing Qin, Tien-Tsin Wong, Guoqiang Han, Shengfeng He

Research Collection School Of Computing and Information Systems

We propose a novel deep example-based image colourization method called dense encoding pyramid network. In our study, we define the colourization as a multinomial classification problem. Given a greyscale image and a reference image, the proposed network leverages large-scale data and then predicts colours by analysing the colour distribution of the reference image. We design the network as a pyramid structure in order to exploit the inherent multi-scale, pyramidal hierarchy of colour representations. Between two adjacent levels, we propose a hierarchical decoder–encoder filter to pass the colour distributions from the lower level to higher level in order to take both …


Zero-Shot Ingredient Recognition By Multi-Relational Graph Convolutional Network, Jingjing Chen, Liangming Pan, Zhipeng Wei, Xiang Wang, Chong-Wah Ngo, Tat-Seng Chua Feb 2020

Zero-Shot Ingredient Recognition By Multi-Relational Graph Convolutional Network, Jingjing Chen, Liangming Pan, Zhipeng Wei, Xiang Wang, Chong-Wah Ngo, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Recognizing ingredients for a given dish image is at the core of automatic dietary assessment, attracting increasing attention from both industry and academia. Nevertheless, the task is challenging due to the difficulty of collecting and labeling sufficient training data. On one hand, there are hundred thousands of food ingredients in the world, ranging from the common to rare. Collecting training samples for all of the ingredient categories is difficult. On the other hand, as the ingredient appearances exhibit huge visual variance during the food preparation, it requires to collect the training samples under different cooking and cutting methods for robust …


Five Challenges In Cloud-Enabled Intelligence And Control, Tarek Abdelzaher, Yifan Hao, Kasthuri Jayarajah, Archan Misra, Per Skarin, Shuochao Yao, Dulanga Kaveesha Weerakoon Weerakoon Mudiyanselage, Karl-Erik Arzen Feb 2020

Five Challenges In Cloud-Enabled Intelligence And Control, Tarek Abdelzaher, Yifan Hao, Kasthuri Jayarajah, Archan Misra, Per Skarin, Shuochao Yao, Dulanga Kaveesha Weerakoon Weerakoon Mudiyanselage, Karl-Erik Arzen

Research Collection School Of Computing and Information Systems

The proliferation of connected embedded devices, or the Internet of Things (IoT), together with recent advances in machine intelligence, will change the profile of future cloud services and introduce a variety of new research problems, both in cloud applications and infrastructure layers. These problems are centered around empowering individually resource-limited devices to exhibit intelligent behavior, both in sensing and control, thanks to a judicious utilization of cloud resources. Cloud services will enable learning from data, performing inference, and executing control, all with assurances on outcomes. The paper discusses such emerging services and outlines five resulting new research directions towards enabling …


Image Enhanced Event Detection In News Articles, Meihan Tong, Shuai Wang, Yixin Cao, Bin Xu, Juaizi Li, Lei Hou, Tat-Seng Chua Feb 2020

Image Enhanced Event Detection In News Articles, Meihan Tong, Shuai Wang, Yixin Cao, Bin Xu, Juaizi Li, Lei Hou, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Event detection is a crucial and challenging sub-task of event extraction, which suffers from a severe ambiguity issue of trigger words. Existing works mainly focus on using textual context information, while there naturally exist many images accompanied by news articles that are yet to be explored. We believe that images not only reflect the core events of the text, but are also helpful for the disambiguation of trigger words. In this paper, we first contribute an image dataset supplement to ED benchmarks (i.e., ACE2005) for training and evaluation. We then propose a novel Dual Recurrent Multimodal Model, DRMM, to conduct …


Automated Deprecated-Api Usage Update For Android Apps: How Far Are We?, Ferdian Thung, Stefanus Agus Haryono, Lucas Serrano, Gilles Muller, Julia Lawall, David Lo, Lingxiao Jiang Feb 2020

Automated Deprecated-Api Usage Update For Android Apps: How Far Are We?, Ferdian Thung, Stefanus Agus Haryono, Lucas Serrano, Gilles Muller, Julia Lawall, David Lo, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

As the Android API evolves, some API methods may be deprecated, to be eventually removed. App developers face the challenge of keeping their apps up-to-date, to ensure that the apps work in both older and newer Android versions. Currently, AppEvolve is the state-of-the-art approach to automate such updates, and it has been shown to be quite effective. Still, the number of experiments reported is moderate, involving only API usage updates in 41 usage locations. In this work, we replicate the evaluation of AppEvolve and assess whether its effectiveness is generalizable. Given the set of APIs on which AppEvolve has been …


Joint Learning Of Answer Selection And Answer Summary Generation In Community Question Answering, Yang Deng, Wai Lam, Yuexiang Xie, Daoyuan Chen, Yaliang Li, Min Yang, Ying Shen Feb 2020

Joint Learning Of Answer Selection And Answer Summary Generation In Community Question Answering, Yang Deng, Wai Lam, Yuexiang Xie, Daoyuan Chen, Yaliang Li, Min Yang, Ying Shen

Research Collection School Of Computing and Information Systems

Community question answering (CQA) gains increasing popularity in both academy and industry recently. However, the redundancy and lengthiness issues of crowdsourced answers limit the performance of answer selection and lead to reading difficulties and misunderstandings for community users. To solve these problems, we tackle the tasks of answer selection and answer summary generation in CQA with a novel joint learning model. Specifically, we design a question-driven pointer-generator network, which exploits the correlation information between question-Answer pairs to aid in attending the essential information when generating answer summaries. Meanwhile, we leverage the answer summaries to alleviate noise in original lengthy answers …


Bounding Regret In Empirical Games, Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh Feb 2020

Bounding Regret In Empirical Games, Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh

Research Collection School Of Computing and Information Systems

Empirical game-theoretic analysis refers to a set of models and techniques for solving large-scale games. However, there is a lack of a quantitative guarantee about the quality of output approximate Nash equilibria (NE). A natural quantitative guarantee for such an approximate NE is the regret in the game (i.e. the best deviation gain). We formulate this deviation gain computation as a multi-armed bandit problem, with a new optimization goal unlike those studied in prior work. We propose an efficient algorithm Super-Arm UCB (SAUCB) for the problem and a number of variants. We present sample complexity results as well as extensive …


Stochastically Robust Personalized Ranking For Lsh Recommendation Retrieval, Dung D. Le, Hady W. Lauw Feb 2020

Stochastically Robust Personalized Ranking For Lsh Recommendation Retrieval, Dung D. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Locality Sensitive Hashing (LSH) has become one of the most commonly used approximate nearest neighbor search techniques to avoid the prohibitive cost of scanning through all data points. For recommender systems, LSH achieves efficient recommendation retrieval by encoding user and item vectors into binary hash codes, reducing the cost of exhaustively examining all the item vectors to identify the topk items. However, conventional matrix factorization models may suffer from performance degeneration caused by randomly-drawn LSH hash functions, directly affecting the ultimate quality of the recommendations. In this paper, we propose a framework named SRPR, which factors in the stochasticity of …


Example-Based Colourization Via Dense Encoding Pyramids, Chufeng Xiao, Chu Han, Zhuming Zhang, Jing Qin, Tien-Tsin Wong, Guoqiang Han, Shengfeng He Feb 2020

Example-Based Colourization Via Dense Encoding Pyramids, Chufeng Xiao, Chu Han, Zhuming Zhang, Jing Qin, Tien-Tsin Wong, Guoqiang Han, Shengfeng He

Research Collection School Of Computing and Information Systems

We propose a novel deep example-based image colourization method called dense encoding pyramid network. In our study, we define the colourization as a multinomial classification problem. Given a greyscale image and a reference image, the proposed network leverages large-scale data and then predicts colours by analysing the colour distribution of the reference image. We design the network as a pyramid structure in order to exploit the inherent multi-scale, pyramidal hierarchy of colour representations. Between two adjacent levels, we propose a hierarchical decoder-encoder filter to pass the colour distributions from the lower level to higher level in order to take both …


Are The Code Snippets What We Are Searching For? A Benchmark And An Empirical Study On Code Search With Natural-Language Queries, Shuhan Yan, Hang Yu, Yuting Chen, Beijun Shen Feb 2020

Are The Code Snippets What We Are Searching For? A Benchmark And An Empirical Study On Code Search With Natural-Language Queries, Shuhan Yan, Hang Yu, Yuting Chen, Beijun Shen

Research Collection School Of Computing and Information Systems

Code search methods, especially those that allow programmers to raise queries in a natural language, plays an important role in software development. It helps to improve programmers' productivity by returning sample code snippets from the Internet and/or source-code repositories for their natural-language queries. Meanwhile, there are many code search methods in the literature that support natural-language queries. Difficulties exist in recognizing the strengths and weaknesses of each method and choosing the right one for different usage scenarios, because (1) the implementations of those methods and the datasets for evaluating them are usually not publicly available, and (2) some methods leverage …


Privacy-Preserving Network Path Validation, Binanda Sengupta, Yingjiu Li, Kai Bu, Robert H. Deng Feb 2020

Privacy-Preserving Network Path Validation, Binanda Sengupta, Yingjiu Li, Kai Bu, Robert H. Deng

Research Collection School Of Computing and Information Systems

The end-users communicating over a network path currently have no control over the path. For a better quality of service, the source node often opts for a superior (or premium) network path to send packets to the destination node. However, the current Internet architecture provides no assurance that the packets indeed follow the designated path. Network path validation schemes address this issue and enable each node present on a network path to validate whether each packet has followed the specific path so far. In this work, we introduce two notions of privacy—path privacy and index privacy—in the context of network …


Deepdualmapper: A Gated Fusion Network For Automatic Map Extraction Using Aerial Images And Trajectories, Hao Wu, Hanyuan Zhang, Xinyu Zhang, Weiwei Sun, Baihua Zheng, Yuning Jiang Feb 2020

Deepdualmapper: A Gated Fusion Network For Automatic Map Extraction Using Aerial Images And Trajectories, Hao Wu, Hanyuan Zhang, Xinyu Zhang, Weiwei Sun, Baihua Zheng, Yuning Jiang

Research Collection School Of Computing and Information Systems

Automatic map extraction is of great importance to urban computing and location-based services. Aerial image and GPS trajectory data refer to two different data sources that could be leveraged to generate the map, although they carry different types of information. Most previous works on data fusion between aerial images and data from auxiliary sensors do not fully utilize the information of both modalities and hence suffer from the issue of information loss. We propose a deep convolutional neural network called DeepDualMapper which fuses the aerial image and trajectory data in a more seamless manner to extract the digital map. We …


Mcdpc: Multi‐Center Density Peak Clustering, Yizhang Wang, Di Wang, Xiaofeng Zhang, Wei Pang, Chunyan Miao, Ah-Hwee Tan, You Zhou Feb 2020

Mcdpc: Multi‐Center Density Peak Clustering, Yizhang Wang, Di Wang, Xiaofeng Zhang, Wei Pang, Chunyan Miao, Ah-Hwee Tan, You Zhou

Research Collection School Of Computing and Information Systems

Density peak clustering (DPC) is a recently developed density-based clustering algorithm that achieves competitive performance in a non-iterative manner. DPC is capable of effectively handling clusters with single density peak (single center), i.e., based on DPC’s hypothesis, one and only one data point is chosen as the center of any cluster. However, DPC may fail to identify clusters with multiple density peaks (multi-centers) and may not be able to identify natural clusters whose centers have relatively lower local density. To address these limitations, we propose a novel clustering algorithm based on a hierarchical approach, named multi-center density peak clustering (McDPC). …


Essential Sentences For Navigating Stack Overflow Answers, Sarah Nadi, Christoph Treude Feb 2020

Essential Sentences For Navigating Stack Overflow Answers, Sarah Nadi, Christoph Treude

Research Collection School Of Computing and Information Systems

Stack Overflow (SO) has become an essential resource for software development. Despite its success and prevalence, navigating SO remains a challenge. Ideally, SO users could benefit from highlighted navigational cues that help them decide if an answer is relevant to their task and context. Such navigational cues could be in the form of essential sentences that help the searcher decide whether they want to read the answer or skip over it. In this paper, we compare four potential approaches for identifying essential sentences. We adopt two existing approaches and develop two new approaches based on the idea that contextual information …


The Future Of Work Now: Medical Coding With Ai, Thomas H. Davenport, Steven M. Miller Jan 2020

The Future Of Work Now: Medical Coding With Ai, Thomas H. Davenport, Steven M. Miller

Research Collection School Of Computing and Information Systems

The coding of medical diagnosis and treatment has always been a challenging issue. Translating a patient’s complex symptoms, and a clinician’s efforts to address them, into a clear and unambiguous classification code was difficult even in simpler times. Now, however, hospitals and health insurance companies want very detailed information on what was wrong with a patient and the steps taken to treat them— for clinical record-keeping, for hospital operations review and planning, and perhaps most importantly, for financial reimbursement purposes.


Automatically Categorizing Software Technologies, Mathieu Nassif, Christoph Treude, Martin P. Robillard Jan 2020

Automatically Categorizing Software Technologies, Mathieu Nassif, Christoph Treude, Martin P. Robillard

Research Collection School Of Computing and Information Systems

Informal language and the absence of a standard taxonomy for software technologies make it difficult to reliably analyze technology trends on discussion forums and other on-line venues. We propose an automated approach called Witt for the categorization of software technologies (an expanded version of the hypernym discovery problem). Witt takes as input a phrase describing a software technology or concept and returns a general category that describes it (e.g., integrated development environment), along with attributes that further qualify it (commercial, php, etc.). By extension, the approach enables the dynamic creation of lists of all technologies of a given type (e.g., …


Deepdrawing: A Deep Learning Approach To Graph Drawing, Yong Wang, Zhihua Jin, Qianwen Wang, Weiwei Cui, Tengfei Ma, Huamin Qu Jan 2020

Deepdrawing: A Deep Learning Approach To Graph Drawing, Yong Wang, Zhihua Jin, Qianwen Wang, Weiwei Cui, Tengfei Ma, Huamin Qu

Research Collection School Of Computing and Information Systems

Node-link diagrams are widely used to facilitate network explorations. However, when using a graph drawing technique to visualize networks, users often need to tune different algorithm-specific parameters iteratively by comparing the corresponding drawing results in order to achieve a desired visual effect. This trial and error process is often tedious and time-consuming, especially for non-expert users. Inspired by the powerful data modelling and prediction capabilities of deep learning techniques, we explore the possibility of applying deep learning techniques to graph drawing. Specifically, we propose using a graph-LSTM-based approach to directly map network structures to graph drawings. Given a set of …