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

Databases and Information Systems Commons™

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

2021

Discipline
Institution
Keyword
Publication
Publication Type

Articles 421 - 436 of 436

Full-Text Articles in Databases and Information Systems

Technical Q8a Site Answer Recommendation Via Question Boosting, Zhipeng Gao, Xin Xia, David Lo, John Grundy Jan 2021

Technical Q8a Site Answer Recommendation Via Question Boosting, Zhipeng Gao, Xin Xia, David Lo, John Grundy

Research Collection School Of Computing and Information Systems

Software developers have heavily used online question and answer platforms to seek help to solve their technical problems. However, a major problem with these technical Q&A sites is "answer hungriness" i.e., a large number of questions remain unanswered or unresolved, and users have to wait for a long time or painstakingly go through the provided answers with various levels of quality. To alleviate this time-consuming problem, we propose a novel DeepAns neural network-based approach to identify the most relevant answer among a set of answer candidates. Our approach follows a three-stage process: question boosting, label establishment, and answer recommendation. Given …

Go to article

Understanding The Impact Of Encrypted Dns On Internet Censorship, Lin Jin, Shuai Hao, Haining Wang, Chase Cotton Jan 2021

Understanding The Impact Of Encrypted Dns On Internet Censorship, Lin Jin, Shuai Hao, Haining Wang, Chase Cotton

Computer Science Faculty Publications

DNS traffic is transmitted in plaintext, resulting in privacy leakage. To combat this problem, secure protocols have been used to encrypt DNS messages. Existing studies have investigated the performance overhead and privacy benefits of encrypted DNS communications, yet little has been done from the perspective of censorship. In this paper, we study the impact of the encrypted DNS on Internet censorship in two aspects. On one hand, we explore the severity of DNS manipulation, which could be leveraged for Internet censorship, given the use of encrypted DNS resolvers. In particular, we perform 7.4 million DNS lookup measurements on 3,813 DoT …

Go to article

Ranked List Fusion And Re-Ranking With Pre-Trained Transformers For Arqmath Lab, Shaurya Rohatgi, Jian Wu, C. Lee Giles Jan 2021

Ranked List Fusion And Re-Ranking With Pre-Trained Transformers For Arqmath Lab, Shaurya Rohatgi, Jian Wu, C. Lee Giles

Computer Science Faculty Publications

This paper elaborates on our submission to the ARQMath track at CLEF 2021. For our submission this year we use a collection of methods to retrieve and re-rank the answers in Math Stack Exchange in addition to our two-stage model which was comparable to the best model last year in terms of NDCG’. We also provide a detailed analysis of what the transformers are learning and why is it hard to train a math language model using transformers. This year’s submission to Task-1 includes summarizing long question-answer pairs to augment and index documents, using byte-pair encoding to tokenize formula and …

Go to article

See-Trend: Secure Traffic-Related Event Detection In Smart Communities, Stephan Olariu, Dimitrie C. Popescu Jan 2021

See-Trend: Secure Traffic-Related Event Detection In Smart Communities, Stephan Olariu, Dimitrie C. Popescu

Computer Science Faculty Publications

It has been widely recognized that one of the critical services provided by Smart Cities and Smart Communities is Smart Mobility. This paper lays the theoretical foundations of SEE-TREND, a system for Secure Early Traffic-Related EveNt Detection in Smart Cities and Smart Communities. SEE-TREND promotes Smart Mobility by implementing an anonymous, probabilistic collection of traffic-related data from passing vehicles. The collected data are then aggregated and used by its inference engine to build beliefs about the state of the traffic, to detect traffic trends, and to disseminate relevant traffic-related information along the roadway to help the driving public make informed …

Go to article

Automatic Metadata Extraction Incorporating Visual Features From Scanned Electronic Theses And Dissertations, Muntabir Hasan Choudhury, Himarsha R. Jayanetti, Jian Wu, William A. Ingram, Edward A. Fox Jan 2021

Automatic Metadata Extraction Incorporating Visual Features From Scanned Electronic Theses And Dissertations, Muntabir Hasan Choudhury, Himarsha R. Jayanetti, Jian Wu, William A. Ingram, Edward A. Fox

Computer Science Faculty Publications

Electronic Theses and Dissertations (ETDs) contain domain knowledge that can be used for many digital library tasks, such as analyzing citation networks and predicting research trends. Automatic metadata extraction is important to build scalable digital library search engines. Most existing methods are designed for born-digital documents, so they often fail to extract metadata from scanned documents such as ETDs. Traditional sequence tagging methods mainly rely on text-based features. In this paper, we propose a conditional random field (CRF) model that combines text-based and visual features. To verify the robustness of our model, we extended an existing corpus and created a …

Go to article

Deep Unsupervised Anomaly Detection, Tangqing Li, Zheng Wang, Siying Liu, Wen-Yan Lin Jan 2021

Deep Unsupervised Anomaly Detection, Tangqing Li, Zheng Wang, Siying Liu, Wen-Yan Lin

Research Collection School Of Computing and Information Systems

This paper proposes a novel method to detect anomalies in large datasets under a fully unsupervised setting. The key idea behind our algorithm is to learn the representation underlying normal data. To this end, we leverage the latest clustering technique suitable for handling high dimensional data. This hypothesis provides a reliable starting point for normal data selection. We train an autoencoder from the normal data subset, and iterate between hypothesizing normal candidate subset based on clustering and representation learning. The reconstruction error from the learned autoencoder serves as a scoring function to assess the normality of the data. Experimental results …

Go to article

Coherence And Identity Learning For Arbitrary-Length Face Video Generation, Shuquan Ye, Chu Han, Jiaying Lin, Guoqiang Han, Shengfeng He Jan 2021

Coherence And Identity Learning For Arbitrary-Length Face Video Generation, Shuquan Ye, Chu Han, Jiaying Lin, Guoqiang Han, Shengfeng He

Research Collection School Of Computing and Information Systems

Face synthesis is an interesting yet challenging task in computer vision. It is even much harder to generate a portrait video than a single image. In this paper, we propose a novel video generation framework for synthesizing arbitrary-length face videos without any face exemplar or landmark. To overcome the synthesis ambiguity of face video, we propose a divide-and-conquer strategy to separately address the video face synthesis problem from two aspects, face identity synthesis and rearrangement. To this end, we design a cascaded network which contains three components, Identity-aware GAN (IA-GAN), Face Coherence Network, and Interpolation Network. IA-GAN is proposed to …

Go to article

A Continual Deepfake Detection Benchmark: Dataset, Methods, And Essentials, Chuqiao Li, Zhiwu Huang, Danda Pani Paudel, Yabin Wang, Mohamad Shahbazi, Xiaopeng Hong, Van Gool Luc Jan 2021

A Continual Deepfake Detection Benchmark: Dataset, Methods, And Essentials, Chuqiao Li, Zhiwu Huang, Danda Pani Paudel, Yabin Wang, Mohamad Shahbazi, Xiaopeng Hong, Van Gool Luc

Research Collection School Of Computing and Information Systems

There have been emerging a number of benchmarks and techniques for the detection of deepfakes. However, very few works study the detection of incrementally appearing deepfakes in the real-world scenarios. To simulate the wild scenes, this paper suggests a continual deepfake detection benchmark (CDDB) over a new collection of deepfakes from both known and unknown generative models. The suggested CDDB designs multiple evaluations on the detection over easy, hard, and long sequence of deepfake tasks, with a set of appropriate measures. In addition, we exploit multiple approaches to adapt multiclass incremental learning methods, commonly used in the continual visual recognition, …

Go to article

Facial Emotion Recognition With Noisy Multi-Task Annotations, S. Zhang, Zhiwu Huang, D.P. Paudel, Gool L. Van Jan 2021

Facial Emotion Recognition With Noisy Multi-Task Annotations, S. Zhang, Zhiwu Huang, D.P. Paudel, Gool L. Van

Research Collection School Of Computing and Information Systems

Human emotions can be inferred from facial expressions. However, the annotations of facial expressions are often highly noisy in common emotion coding models, including categorical and dimensional ones. To reduce human labelling effort on multi-task labels, we introduce a new problem of facial emotion recognition with noisy multitask annotations. For this new problem, we suggest a formulation from the point of joint distribution match view, which aims at learning more reliable correlations among raw facial images and multi-task labels, resulting in the reduction of noise influence. In our formulation, we exploit a new method to enable the emotion prediction and …

Go to article

Why My Code Summarization Model Does Not Work: Code Comment Improvement With Category Prediction, Qiuyuan Chen, Xin Xia, Han Hu, David Lo, Shanping Li Jan 2021

Why My Code Summarization Model Does Not Work: Code Comment Improvement With Category Prediction, Qiuyuan Chen, Xin Xia, Han Hu, David Lo, Shanping Li

Research Collection School Of Computing and Information Systems

Code summarization aims at generating a code comment given a block of source code and it is normally performed by training machine learning algorithms on existing code block-comment pairs. Code comments in practice have different intentions. For example, some code comments might explain how the methods work, while others explain why some methods are written. Previous works have shown that a relationship exists between a code block and the category of a comment associated with it. In this article, we aim to investigate to which extent we can exploit this relationship to improve code summarization performance. We first classify comments …

Go to article

Context-Aware Retrieval-Based Deep Commit Message Generation, Haoye Wang, Xin Xia, David Lo, Qiang He, Xinyu Wang, John Grundy Jan 2021

Context-Aware Retrieval-Based Deep Commit Message Generation, Haoye Wang, Xin Xia, David Lo, Qiang He, Xinyu Wang, John Grundy

Research Collection School Of Computing and Information Systems

Commit messages recorded in version control systems contain valuable information for software development, maintenance, and comprehension. Unfortunately, developers often commit code with empty or poor quality commit messages. To address this issue, several studies have proposed approaches to generate commit messages from commit diffs. Recent studies make use of neural machine translation algorithms to try and translate git diffs into commit messages and have achieved some promising results. However, these learning-based methods tend to generate high-frequency words but ignore low-frequency ones. In addition, they suffer from exposure bias issues, which leads to a gap between training phase and testing phase. …

Go to article

Sustainability Of Rewards-Based Crowdfunding: A Quasi-Experimental Analysis Of Funding Targets And Backer Satisfaction, Michael Wessel, Rob Gleasure, Robert John Kauffman Jan 2021

Sustainability Of Rewards-Based Crowdfunding: A Quasi-Experimental Analysis Of Funding Targets And Backer Satisfaction, Michael Wessel, Rob Gleasure, Robert John Kauffman

Research Collection School Of Computing and Information Systems

Rewards-based crowdfunding presents an information asymmetry for participants due to the funding mechanism used. Campaign-backers trust creators to complete projects and deliver rewards as outlined prior to the fundraising process, but creators may discover better opportunities as they progress with a project. Despite this, the all-or-nothing (AON) mechanism on crowdfunding platforms incentivizes creators to set meager funding-targets that are easier to achieve but may offer limited slack when creators wish to simultaneously pursue emerging opportunities later in the project. We explore the related issues of how funding targets seem to be selected by the creators, and how dissatisfaction with the …

Go to article

Three Stages Of Consumers’ Multi-Stage Dichotomic Switching Process: Pre-Switch, Switch, And Post-Switch, Jussi Nykanen, Virpi K. Tuunainen, Tuure Tuunanen, Fiona Fui-Hoon Nah Jan 2021

Three Stages Of Consumers’ Multi-Stage Dichotomic Switching Process: Pre-Switch, Switch, And Post-Switch, Jussi Nykanen, Virpi K. Tuunainen, Tuure Tuunanen, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

This research examines why and how consumers switch their mobile phones. We propose a framework that is grounded on decision-making and motivational theories and draws on the findings from a multinational qualitative survey on consumers’ mobile phone switching process. We show that consumers’ pre-switching decisions are affected by push and pull factors, their mobile phone selections are based on utilitarian or hedonic values, and their justifications for switching are based on cognition or affect. Furthermore, we identify two archetypical routes (i.e., cognitive and affective routes) and three conjoint routes that explain the dichotomic switching processes in pre-switch, switch, and post-switch …

Go to article

Enabling Efficient Spatial Keyword Queries On Encrypted Data With Strong Security Guarantees, Xiangyu Wang, Jianfeng Ma, Feng Li, Ximeng Liu, Yinbin Miao, Robert H. Deng Jan 2021

Enabling Efficient Spatial Keyword Queries On Encrypted Data With Strong Security Guarantees, Xiangyu Wang, Jianfeng Ma, Feng Li, Ximeng Liu, Yinbin Miao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Structured Encryption (STE), which allows a server to provide secure search services on encrypted data structures, has been widely investigated in recent years. To meet expressive search requirements in practical applications, a large number of STE constructions have been proposed either on textual keywords or spatial data. However, STE on spatio-textual data, which are widely used in location-based services, has not been fully investigated. In this paper, we formally define the notion of Spatial Keyword Structured Encryption (SKSE) and propose several concrete SKSE constructions with various efficiencysecurity trade-offs. Firstly, we propose a basic construction with linear search complexity, which only …

Go to article

Chronic Customers Or Increased Awareness? The Dynamics Of Social Media Customer Service, Shujing Sun, Yang Gao, Huaxia Rui Jan 2021

Chronic Customers Or Increased Awareness? The Dynamics Of Social Media Customer Service, Shujing Sun, Yang Gao, Huaxia Rui

Research Collection School Of Computing and Information Systems

Despite that social media has become a promising alternative to traditional call centers, managers hesitate to fully harness its power because they worry that active service intervention may encourage excessive use of the channel by disgruntled customers. This paper sheds light on such a concern by examining the dynamics between brand-level customer complaints and service interventions on social media. Using details of customer-brand interactions of 40 airlines on Twitter, we find that more service interventions indeed cause more customer complaints, accounting for the online customer population and service quality. However, the increased complaints are primarily driven by the awareness enhancement …

Go to article

Single And Differential Morph Attack Detection, Baaria Chaudhary Jan 2021

Single And Differential Morph Attack Detection, Baaria Chaudhary

Graduate Theses, Dissertations, and Problem Reports (ETD)

Face recognition systems operate on the assumption that a person's face serves as the unique link to their identity. In this thesis, we explore the problem of morph attacks, which have become a viable threat to face verification scenarios precisely because of their inherent ability to break this unique link. A morph attack occurs when two people who share similar facial features morph their faces together such that the resulting face image is recognized as either of two contributing individuals. Morphs inherit enough visual features from both individuals that both humans and automatic algorithms confuse them. The contributions of this …

Go to article

First Prev