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

Computer Sciences Commons™

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 18601 - 18630 of 63046

Full-Text Articles in Computer Sciences

Mixed Dish Recognition With Contextual Relation And Domain Alignment, Lixi Deng, Jingjing Chen, Chong-Wah Ngo, Qianru Sun, Sheng Tang, Yongdong Zhang, Tat-Seng Chua Apr 2021

Mixed Dish Recognition With Contextual Relation And Domain Alignment, Lixi Deng, Jingjing Chen, Chong-Wah Ngo, Qianru Sun, Sheng Tang, Yongdong Zhang, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Mixed dish is a food category that contains different dishes mixed in one plate, and is popular in Eastern and Southeast Asia. Recognizing the individual dishes in a mixed dish image is important for health related applications, e.g. to calculate the nutrition values of the dish. However, most existing methods that focus on single dish classification are not applicable to the recognition of mixed dish images. The main challenge of mixed dish recognition comes from three aspects: a wide range of dish types, the complex dish combination with severe overlap between different dishes and the large visual variances of same …


Boundary Precedence Image Inpainting Method Based On Self-Organizing Maps, Haibo Pen, Quan Wang, Zhaoxia Wang Apr 2021

Boundary Precedence Image Inpainting Method Based On Self-Organizing Maps, Haibo Pen, Quan Wang, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

In addition to text data analysis, image analysis is an area that has increasingly gained importance in recent years because more and more image data have spread throughout the internet and real life. As an important segment of image analysis techniques, image restoration has been attracting a lot of researchers’ attention. As one of AI methodologies, Self-organizing Maps (SOMs) have been applied to a great number of useful applications. However, it has rarely been applied to the domain of image restoration. In this paper, we propose a novel image restoration method by leveraging the capability of SOMs, and we name …


Do Users Care About Ad's Performance Costs? Exploring The Effects Of The Performance Costs Of In-App Ads On User Experience, Cuiyun Gao, Jichuan Zeng, Federica Sarro, David Lo, Irwin King, Michael R. Lyu Apr 2021

Do Users Care About Ad's Performance Costs? Exploring The Effects Of The Performance Costs Of In-App Ads On User Experience, Cuiyun Gao, Jichuan Zeng, Federica Sarro, David Lo, Irwin King, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Context: In-app advertising is the primary source of revenue for many mobile apps. The cost of advertising (ad cost) is non-negligible for app developers to ensure a good user experience and continuous profits. Previous studies mainly focus on addressing the hidden performance costs generated by ads, including consumption of memory, CPU, data traffic, and battery. However, there is no research on analyzing users’ perceptions of ads’ performance costs to our knowledge.Objective: To fill this gap and better understand the effects of performance costs of in-app ads on user experience, we conduct a study on analyzing user concerns about ads’ performance …


How Successful Are Open Source Contributions From Countries With Different Levels Of Human Development?, Leonardo Furtado, Bruno Cartaxo, Christoph Treude, Gustavo Pinto Apr 2021

How Successful Are Open Source Contributions From Countries With Different Levels Of Human Development?, Leonardo Furtado, Bruno Cartaxo, Christoph Treude, Gustavo Pinto

Research Collection School Of Computing and Information Systems

In this article we studied whether developers? locations relate to the outcome of a pull request (PR). Our results suggest that developers from countries with low human development indexes perform a small fraction of the overall PRs and are the ones that face rejection the most.


Cyber Supply Chain Risk Management: Implications For The Sof Future Operating Environment, J. Philip Craiger, Laurie Lindamood-Craiger, Diane M. Zorri Apr 2021

Cyber Supply Chain Risk Management: Implications For The Sof Future Operating Environment, J. Philip Craiger, Laurie Lindamood-Craiger, Diane M. Zorri

Publications

The emerging Cyber Supply Chain Risk Management (C-SCRM) concept assists at all levels of the supply chain in managing and mitigating risks, and the authors define C-SCRM as the process of identifying, assessing, and mitigating the risks associated with the distributed and interconnected nature of information and operational technology products and service supply chains. As Special Operations Forces increasingly rely on sophisticated hardware and software products, this quick, well-researched monograph provides a detailed accounting of C-SCRM associated laws, regulations, instructions, tools, and strategies meant to mitigate vulnerabilities and risks—and how we might best manage the evolving and ever-changing array of …


Efficient Retrieval Of Matrix Factorization-Based Top-K Recommendations: A Survey Of Recent Approaches, Dung D. Le, Hady W. Lauw Apr 2021

Efficient Retrieval Of Matrix Factorization-Based Top-K Recommendations: A Survey Of Recent Approaches, Dung D. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Top-k recommendation seeks to deliver a personalized list of k items to each individual user. An established methodology in the literature based on matrix factorization (MF), which usually represents users and items as vectors in low-dimensional space, is an effective approach to recommender systems, thanks to its superior performance in terms of recommendation quality and scalability. A typical matrix factorization recommender system has two main phases: preference elicitation and recommendation retrieval. The former analyzes user-generated data to learn user preferences and item characteristics in the form of latent feature vectors, whereas the latter ranks the candidate items based on the …


Dbl: Efficient Reachability Queries On Dynamic Graphs, Qiuyi Lyu, Yuchen Li, Bingsheng He, Bin Gong Apr 2021

Dbl: Efficient Reachability Queries On Dynamic Graphs, Qiuyi Lyu, Yuchen Li, Bingsheng He, Bin Gong

Research Collection School Of Computing and Information Systems

Reachability query is a fundamental problem on graphs, which has been extensively studied in academia and industry. Since graphs are subject to frequent updates in many applications, it is essential to support efficient graph updates while offering good performance in reachability queries. Existing solutions compress the original graph with the Directed Acyclic Graph (DAG) and propose efficient query processing and index update techniques. However, they focus on optimizing the scenarios where the Strong Connected Components (SCCs) remain unchanged and have overlooked the prohibitively high cost of the DAG maintenance when SCCs are updated. In this paper, we propose DBL, an …


Towards Efficient Motif-Based Graph Partitioning: An Adaptive Sampling Approach, Shixun Huang, Yuchen Li, Zhifeng Bao, Zhao Li Apr 2021

Towards Efficient Motif-Based Graph Partitioning: An Adaptive Sampling Approach, Shixun Huang, Yuchen Li, Zhifeng Bao, Zhao Li

Research Collection School Of Computing and Information Systems

In this paper, we study the problem of efficient motif-based graph partitioning (MGP). We observe that existing methods require to enumerate all motif instances to compute the exact edge weights for partitioning. However, the enumeration is prohibitively expensive against large graphs. We thus propose a sampling-based MGP (SMGP) framework that employs an unbiased sampling mechanism to efficiently estimate the edge weights while trying to preserve the partitioning quality. To further improve the effectiveness, we propose a novel adaptive sampling framework called SMGP+. SMGP+ iteratively partitions the input graph based on up-to-date estimated edge weights, and adaptively adjusts the sampling distribution …


The Challenges Of Identifying Dangers Online And Predictors Of Victimization, Catherine D. Marcum Apr 2021

The Challenges Of Identifying Dangers Online And Predictors Of Victimization, Catherine D. Marcum

International Journal of Cybersecurity Intelligence & Cybercrime

This short paper will provide an overview of the impressive pieces included in this issue of the International Journal of Cybersecurity Intelligence and Cybercrime. This issue includes articles on the following pertinent topic, utilizing a range of approaches and methodologies: 1) online credibility; 2) cyberbullying; and 3) unauthorized access of information. An emphasis on the importance of policy development and better protection of potential victims is a common thread throughout the issue.


Powered By Ai, Christopher J. Smiley Apr 2021

Powered By Ai, Christopher J. Smiley

The Journal of the Michigan Dental Association

Artificial Intelligence (AI) is revolutionizing dental practice through its ability to process vast amounts of data, enhance diagnosis, and improve patient care. However, AI introduces the challenge of bias and ethical considerations. Dentists and dental benefit providers are utilizing AI for early disease detection and efficient data management, but transparency and fairness in AI algorithms are vital. The Rome Call for AI Ethics emphasizes ethical, non-biased AI development. In the broader context, AI-driven marketing and predictive behavior raise concerns about privacy and ethical data use. The dental community must embrace AI's power while upholding ethical standards and transparency.


Regularized Deep Network Learning For Multi-Label Visual Recognition, Hao Guo Apr 2021

Regularized Deep Network Learning For Multi-Label Visual Recognition, Hao Guo

Theses and Dissertations

This dissertation is focused on the task of multi-label visual recognition, a fundamental task of computer vision. It aims to tell the presence of multiple visual classes from the input image, where the visual classes, such as objects, scenes, attributes, etc., are usually defined as image labels. Due to the prosperous deep networks, this task has been widely studied and significantly improved in recent years. However, it remains a challenging task due to appearance complexity of multiple visual contents co-occurring in one image. This research explores to regularize the deep network learning for multi-label visual recognition.

First, an attention concentration …


Deep Learning Based Sound Event Detection And Classification, Alireza Nasiri Apr 2021

Deep Learning Based Sound Event Detection And Classification, Alireza Nasiri

Theses and Dissertations

Hearing sense has an important role in our daily lives. During the recent years, there has been many studies to transfer this capability to the computers. In this dissertation, we design and implement deep learning based algorithms to improve the ability of the computers in recognizing the different sound events.

In the first topic, we investigate sound event detection, which identifies the time boundaries of the sound events in addition to the type of the events. For sound event detection, we propose a new method, AudioMask, to benefit from the object-detection techniques in computer vision. In this method, we convert …


Deep Learning Based Models For Classification From Natural Language Processing To Computer Vision, Xianshan Qu Apr 2021

Deep Learning Based Models For Classification From Natural Language Processing To Computer Vision, Xianshan Qu

Theses and Dissertations

With the availability of large scale data sets, researchers in many different areas such as natural language processing, computer vision, recommender systems have started making use of deep learning models and have achieved great progress in recent years. In this dissertation, we study three important classification problems based on deep learning models.

First, with the fast growth of e-commerce, more people choose to purchase products online and browse reviews before making decisions. It is essential to build a model to identify helpful reviews automatically. Our work is inspired by the observation that a customer's expectation of a review can be …


Detecting The Intent Of Email Using Embeddings, Deep Learning And Transfer Learning, Zaid Alibadi Apr 2021

Detecting The Intent Of Email Using Embeddings, Deep Learning And Transfer Learning, Zaid Alibadi

Theses and Dissertations

Throughout the years' several strategies and tools were proposed and developed to help the users cope with the problem of email overload, but each of these solutions had its own limitations and, in some cases, contribute to further problems. One major theme that encapsulates many of these solutions is automatically classifying emails into predefined categories (ex: Finance, Sport, Promotion, etc.) then move/tag the incoming email to that particular category. In general, these solutions have two main limitations: 1) they need to adapt to changing user’s behavior. 2) they require handcrafted features engineering which in turn need a lot of time, …


Art 175 Website V1.0 Using Html5 And Css3, Gary Craig Hobbs Apr 2021

Art 175 Website V1.0 Using Html5 And Css3, Gary Craig Hobbs

All Assignment Prompts

No abstract provided.


Proximity-Based Video Communication With Cocktailparty, Addison Fabry, William Heffernan, Andrew Shroyer Apr 2021

Proximity-Based Video Communication With Cocktailparty, Addison Fabry, William Heffernan, Andrew Shroyer

Senior Theses

CocktailParty is a video communication application designed to uniquely and efficiently solve the problems faced by traditional online video communication. The proposal for this start-up project was accepted in August 2020. CocktailParty enables users to join a video chat room overlayed on top of a virtual house, in which each user can move their own video feed around the house. Each room in each house layout hosts a different video call, allowing users to easily host large virtual gatherings that facilitate multiple conversations taking place simultaneously. This functionality makes important steps towards effective simulation of the real-life gathering experience.


Best Practices In Industry And Cse Senior Design, Conner Hallett Apr 2021

Best Practices In Industry And Cse Senior Design, Conner Hallett

Honors Program: Senior Projects (Public)

The widespread use of Agile practices in the software development industry creates the need for new college graduates to be adept in Agile processes and teams. The University of Nebraska-Lincoln’s Computer Science and Engineering (CSE) Senior Design courses gives students an introduction to such processes, but is met with many challenges in doing so, such as time constraints and student inexperience. Following a detailed look at the Scrum Agile framework and its expanded practices in industry, potential improvements for CSE Senior Design’s practice of Agile are suggested. These include the creation of resource forums for students to accelerate the early …


Dismastd: An Efficient Distributed Multi-Aspect Streaming Tensor Decomposition, Keyu Yang, Yunjun Gao, Yifeng Shen, Baihua Zheng, Lu Chen Apr 2021

Dismastd: An Efficient Distributed Multi-Aspect Streaming Tensor Decomposition, Keyu Yang, Yunjun Gao, Yifeng Shen, Baihua Zheng, Lu Chen

Research Collection School Of Computing and Information Systems

Tensor decomposition is a fundamental multidimensional data analysis tool for many data-driven applications, such as social computing, computer vision, and bioinformatics, to name but a few. However, the rapidly increasing streaming data nowadays introduces new challenges to traditional static tensor decomposition. It requires an efficient distributed dynamic tensor decomposition without re-computing the whole tensor from scratch. In this paper, we propose DisMASTD, an efficient distributed multi-aspect streaming tensor decomposition. First, we prove the optimal tensor partitioning problem is NP-hard. Second, we present two heuristic tensor partitioning approaches to ensure the load balancing. Third, we develop a distributed multi-aspect streaming tensor …


Enconter: Entity Constrained Progressive Sequence Generation Via Insertion-Based Transformer, Lee Hsun Hsieh, Yang Yin Lee, Ee-Peng Lim Apr 2021

Enconter: Entity Constrained Progressive Sequence Generation Via Insertion-Based Transformer, Lee Hsun Hsieh, Yang Yin Lee, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Pretrained using large amount of data, autoregressive language models are able to generate high quality sequences. However, these models do not perform well under hard lexical constraints as they lack fine control of content generation process. Progressive insertion-based transformers can overcome the above limitation and efficiently generate a sequence in parallel given some input tokens as constraint. These transformers however may fail to support hard lexical constraints as their generation process is more likely to terminate prematurely. The paper analyses such early termination problems and proposes the ENtity-CONstrained insertion TransformER (ENCONTER), a new insertion transformer that addresses the above pitfall …


Practical Server-Side Wifi-Based Indoor Localization: Addressing Cardinality & Outlier Challenges For Improved Occupancy Estimation, Anuradha Ravi, Archan Misra Apr 2021

Practical Server-Side Wifi-Based Indoor Localization: Addressing Cardinality & Outlier Challenges For Improved Occupancy Estimation, Anuradha Ravi, Archan Misra

Research Collection School Of Computing and Information Systems

Server-side WiFi-based indoor localization offers a compelling approach for passive occupancy estimation (i.e., without requiring active participation by client devices, such as smartphones carried by visitors), but is known to suffer from median error of 6–8 meters. By analyzing the characteristics of an operationally-deployed, WiFi-based passive indoor location system, based on the classical RADAR algorithm, we identify and tackle 2 practical challenges for accurate individual device localization. The first challenge is the low-cardinality issue, whereby only the associated AP generates sufficiently frequent RSSI reports, causing a client to experience large localization error due to the absence of sufficient measurements from …


Sentiment-Oriented Metric Learning For Text-To-Image Retrieval, Quoc Tuan Truong, Hady W. Lauw Apr 2021

Sentiment-Oriented Metric Learning For Text-To-Image Retrieval, Quoc Tuan Truong, Hady W. Lauw

Research Collection School Of Computing and Information Systems

In this era of multimedia Web, text-to-image retrieval is a critical function of search engines and visually-oriented online platforms. Traditionally, the task primarily deals with matching a text query with the most relevant images available in the corpus. To an increasing extent, the Web also features visual expressions of preferences, imbuing images with sentiments that express those preferences. Cases in point include photos in online reviews as well as social media. In this work, we study the effects of sentiment information on text-to-image retrieval. Particularly, we present two approaches for incorporating sentiment orientation into metric learning for cross-modal retrieval. Each …


Out Of Sight, Out Of Mind? How Vulnerable Dependencies Affect Open-Source Projects, Gede Artha Azriadi Prana, Abhishek Sharma, Lwin Khin Shar, Darius Foo, Andrew E. Santosa, Asankhaya Sharma, David Lo Apr 2021

Out Of Sight, Out Of Mind? How Vulnerable Dependencies Affect Open-Source Projects, Gede Artha Azriadi Prana, Abhishek Sharma, Lwin Khin Shar, Darius Foo, Andrew E. Santosa, Asankhaya Sharma, David Lo

Research Collection School Of Computing and Information Systems

Context: Software developers often use open-source libraries in their project to improve development speed. However, such libraries may contain security vulnerabilities, and this has resulted in several high-profile incidents in re- cent years. As usage of open-source libraries grows, understanding of these dependency vulnerabilities becomes increasingly important. Objective: In this work, we analyze vulnerabilities in open-source libraries used by 450 software projects written in Java, Python, and Ruby. Our goal is to examine types, distribution, severity, and persistence of the vulnerabili- ties, along with relationships between their prevalence and project as well as commit attributes. Method: Our data is obtained …


Time Period-Based Top-K Semantic Trajectory Pattern Query, Munkh-Erdene Yadamjav, Farhana Murtaza Choudhury, Zhifeng Bao, Baihua Zheng Apr 2021

Time Period-Based Top-K Semantic Trajectory Pattern Query, Munkh-Erdene Yadamjav, Farhana Murtaza Choudhury, Zhifeng Bao, Baihua Zheng

Research Collection School Of Computing and Information Systems

The sequences of user check-ins form semantic trajectories that represent the movement of users through time, along with the types of POIs visited. Extracting patterns in semantic trajectories can be widely used in applications such as route planning and trip recommendation. Existing studies focus on the entire time duration of the data, which may miss some temporally significant patterns. In addition, they require thresholds to define the interestingness of the patterns. Motivated by the above, we study a new problem of finding top-k semantic trajectory patterns w.r.t. a given time period and categories by considering the spatial closeness of POIs. …


Detection Of Social Identification In Workgroups From A Passively-Sensed Wifi Infrastructure, Camelia Zakaria, Youngki Lee, Rajesh Krishna Balan Apr 2021

Detection Of Social Identification In Workgroups From A Passively-Sensed Wifi Infrastructure, Camelia Zakaria, Youngki Lee, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Social identification: how much individuals psychologically associate themselves with a group has been posited as an essential construct to measure individual and group dynamics. Studies have shown that individuals who identify very differently from their workgroup provides critical cues to the lack of social support or work overloads. However, measuring identification is typically achieved through time-consuming and privacy invasive surveys. We hypothesize that the extremitized in-group norm affects individuals' behaviors, thus more likely to give rise to negative appraisals. As a more convenient and less-invasive technique, we propose a method to predict individuals who are increasingly different in identifying themselves …


Spectest: Specification-Based Compiler Testing, Richard Schumi, Jun Sun Apr 2021

Spectest: Specification-Based Compiler Testing, Richard Schumi, Jun Sun

Research Collection School Of Computing and Information Systems

Compilers are error-prone due to their high complexity. They are relevant for not only general purpose programming languages, but also for many domain specific languages. Bugs in compilers can potentially render all programs at risk. It is thus crucial that compilers are systematically tested, if not verified. Recently, a number of efforts have been made to formalise and standardise programming language semantics, which can be applied to verify the correctness of the respective compilers. In this work, we present a novel specification-based testing method named SpecTest to better utilise these semantics for testing. By applying an executable semantics as test …


Dycuckoo: Dynamic Hash Tables On Gpus, Yuchen Li, Qiwei Zhu, Zheng Lyu, Zhongdong Huang, Jianling Sun Apr 2021

Dycuckoo: Dynamic Hash Tables On Gpus, Yuchen Li, Qiwei Zhu, Zheng Lyu, Zhongdong Huang, Jianling Sun

Research Collection School Of Computing and Information Systems

The hash table is a fundamental structure that has been implemented on graphics processing units (GPUs) to accelerate a wide range of analytics workloads. Most existing works have focused on static scenarios and occupy large GPU memory to maximize the insertion efficiency. In many cases, data stored in hash tables get updated dynamically, and existing approaches use unnecessarily large memory resources. One naïve solution is to rebuild a hash table (known as rehashing) whenever it is either filled or mostly empty. However, this approach renders significant overheads for rehashing. In this paper, we propose a novel dynamic cuckoo hash table …


A Fully Dynamic Algorithm For K-Regret Minimizing Sets, Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan Apr 2021

A Fully Dynamic Algorithm For K-Regret Minimizing Sets, Yanhao Wang, Yuchen Li, Raymond Chi-Wing Wong, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Selecting a small set of representatives from a large database is important in many applications such as multi-criteria decision making, web search, and recommendation. The k-regret minimizing set (k-RMS) problem was recently proposed for representative tuple discovery. Specifically, for a large database P of tuples with multiple numerical attributes, the k-RMS problem returns a size-r subset Q of P such that, for any possible ranking function, the score of the top-ranked tuple in Q is not much worse than the score of the kth-ranked tuple in P. Although the k-RMS problem has been extensively studied in the literature, existing methods …


Weakly Supervised Segmentation Via Instance-Aware Propagation, Huang Xin, Qianshu Zhu, Yongtuo Liu, Shengfeng He Apr 2021

Weakly Supervised Segmentation Via Instance-Aware Propagation, Huang Xin, Qianshu Zhu, Yongtuo Liu, Shengfeng He

Research Collection School Of Computing and Information Systems

Peak Response Map (PRM) highlighting the discriminative regions can be extracted from a pre-trained classification network. We can accurately localize instances of each class with the help of these response maps. However, these maps cannot provide reliable information for segmentation even with off-the-shelf object proposals. This is because neither PRM nor the proposals know which regions can be regarded as a complete instance. In this paper, we tackle this problem by proposing an Instance-aware Cue propagation Network (ICN) with a new proposal-matching strategy. In particular, the ICN aims to filter out background distractions and cover the complete instance, while our …


Dram Failure Prediction In Aiops: Empirical Evaluation, Challenges And Opportunities, Zhiyue Wu, Hongzuo Xu, Guansong Pang, Fengyuan Yu, Yijie Wang, Songlei Jian, Yongjun Wang Apr 2021

Dram Failure Prediction In Aiops: Empirical Evaluation, Challenges And Opportunities, Zhiyue Wu, Hongzuo Xu, Guansong Pang, Fengyuan Yu, Yijie Wang, Songlei Jian, Yongjun Wang

Research Collection School Of Computing and Information Systems

DRAM failure prediction is a vital task in AIOps, which is crucial to maintain the reliability and sustainable service of large-scale data centers. However, limited work has been done on DRAM failure prediction mainly due to the lack of public available datasets. This paper presents a comprehensive empirical evaluation of diverse machine learning techniques for DRAM failure prediction using a large-scale multisource dataset, including more than three millions of records of kernel, address, and mcelog data, provided by Alibaba Cloud through PAKDD 2021 competition. Particularly, we first formulate the problem as a multiclass classification task and exhaustively evaluate seven popular/stateof-the-art …


Urban Perception: Sensing Cities Via A Deep Interactive Multi-Task Learning Framework, Weili Guan, Zhaozheng Chen, Fuli Feng, Weifeng Liu, Liqiang Nie Apr 2021

Urban Perception: Sensing Cities Via A Deep Interactive Multi-Task Learning Framework, Weili Guan, Zhaozheng Chen, Fuli Feng, Weifeng Liu, Liqiang Nie

Research Collection School Of Computing and Information Systems

Social scientists have shown evidence that visual perceptions of urban attributes, such as safe, wealthy, and beautiful perspectives of the given cities, are highly correlated to the residents' behaviors and quality of life. Despite their significance, measuring visual perceptions of urban attributes is challenging due to the following facts: (1) Visual perceptions are subjectively contradistinctive rather than absolute. (2) Perception comparisons between image pairs are usually conducted region by region, and highly related to the specific urban attributes. And (3) the urban attributes have both the shared and specific information. To address these problems, in this article, we present a …