Computer Sciences Commons^™

The Use Of Mobile Payment Systems In Post-Covid-19 Economic Recovery: Primary Research On An Emerging Market For Experience Goods, Maiya M. Suyunchaliyeva, Raghav Nautiyal, Aijaz A. Shaikh, Ravishankar Sharma

All Works

This study investigated whether mobile payment services could drive post-COVID-19 pandemic recovery in the ‘experience goods’ sector (e.g., tourism) utilising Bandura’s self-efficacy or social cognitive theory. It explored the factors influencing the intention to continue using mobile payment services and the intention to recommend these to others. An empirical survey was conducted to assess the study variables, and the data obtained therefrom were analysed using the industry-standard Cross-Industry Standard Process for Data Mining method. The study results suggest that personal innovativeness and perceived trust influence consumers’ intention to continue using mobile payment services and that perceived trust, personal innovativeness and …

From Language Comprehension Towards General Ai, Binay Dahal

UNLV Theses, Dissertations, Professional Papers, and Capstones

Language comprehension or more formally, natural language understanding is one of the major undertakings in Artificial Intelligence. In this work, we explore a few of the problems in language understanding using fixed deep learning models. Specifically, first, we look into question generation. Asking questions relates to the cognitive ability of language comprehension and context understanding. For that reason, making progress in question generation is significant. We introduce a novel task called “question generation with masked target answer” and propose various models and present the baseline result for the task. Next, we extend on the question generation task and develop a …

Material Handling With Embodied Loco-Manipulation, Jean Chagas Vaz

UNLV Theses, Dissertations, Professional Papers, and Capstones

Material handling is an intrinsic component of disaster response. Typically, first responders, such as firefighters and/or paramedics, must carry, push, pull, and handle objects, facilitating the transportation of goods. For many years, researchers from around the globe have sought to enable full-sized humanoid robots to perform such essential material handling tasks. This work aims to tackle current limitations of humanoids in the realm of interaction with common objects such as carts, wheelbarrows, etc. Throughout this research, many methods will be applied to ensure a stable Zero Moment Point (ZMP) trajectory to allow a robust gait while loco-manipulating a cart. The …

Exploring The Latent Space Of Image Captioning Networks, Mikian J. Musser

UNLV Theses, Dissertations, Professional Papers, and Capstones

State-of-the-art image captioning models can successfully produce a diverse set of accurate captions. Previous research has focused on improving caption diversity while maintaining a high level of fidelity. We shift the focus from accuracy and diversity to controllability. We use a modified version of the traditional encoder-decoder network that allows the model to produce a meaningful and structured latent space. We then explore the latent space using several latent cartographic methods: lerp, slerp, analogy completion, attribute vector rotation, and interpolation graphs. Additionally, we discuss different categories of latent space and provide modifications for each of the cartographic methods. Finally, we …

Ferris Bakes, Ferris Dehart

Honors Capstones

No abstract provided.

Rmm: Reinforced Memory Management For Class-Incremental Learning, Yaoyao Liu, Qianru Sun, Qianru Sun

Research Collection School Of Computing and Information Systems

Class-Incremental Learning (CIL) [38] trains classifiers under a strict memory budget: in each incremental phase, learning is done for new data, most of which is abandoned to free space for the next phase. The preserved data are exemplars used for replaying. However, existing methods use a static and ad hoc strategy for memory allocation, which is often sub-optimal. In this work, we propose a dynamic memory management strategy that is optimized for the incremental phases and different object classes. We call our method reinforced memory management (RMM), leveraging reinforcement learning. RMM training is not naturally compatible with CIL as the …

Decentralized Deterministic Multi-Agent Reinforcement Learning, Antoine Grosnit, Desmond Cai, Laura Wynter

Research Collection School Of Computing and Information Systems

Recent work in multi-agent reinforcement learning (MARL) by [Zhang, ICML12018] provided the first decentralized actor-critic algorithm to offer convergence guarantees. In that work, policies are stochastic and are defined on finite action spaces. We extend those results to develop a provably-convergent decentralized actor-critic algorithm for learning deterministic policies on continuous action spaces. Deterministic policies are important in many real-world settings. To handle the lack of exploration inherent in deterministic policies we provide results for the off-policy setting as well as the on-policy setting. We provide the main ingredients needed for this problem: the expression of a local deterministic policy gradient, …

Achieving A Sequenced, Relational Query Language With Log-Segmented Timestamps, M. A. Manazir Ahsan

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

In a relational temporal database, typically each row of each table has a period timestamp to indicate the lifetime of that row. In order to evaluate a query in a temporal database, sequenced semantics comes into play. The semantics stipulates that the query must be evaluated simultaneously in each time instant using the data rows available at that point of time. Existing researches have proposed changes in the query evaluation engine to achieve sequenced semantics. In this paper we show a way to support sequenced semantics without modifying the query engine. We propose a noble construction log-segmented label to represent …

On Predicting Omnidirectional Honey Bee Traffic Using Weather And Electromagnetic Radiation, Daniel G. Hornberger

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Honey bees are responsible for pollinating many important crops in the United States. However, honey bee populations have declined significantly since 1961. While some causes of this decline are known, others are not. By utilizing electronic bee hive monitoring (EBM) systems, bee keepers and researchers have an added resource in determining the causes of these declines so that the issues can be remedied. For nearly five months (May through October) during the 2020 honey bee foraging season in Logan, Utah, USA, we collected on-site weather and electromagnetic radiation (EMR) readings and videos of the hive entrances of six bee hives …

An Assessment Of Image-Cloaking Techniques Against Automated Face Recognition For Biometric Privacy, Brandon Scott Ledford

Theses and Dissertations

Over the past two decades, Americans have aggressively increased the amount of facial data uploaded to the internet primarily via social media. This data is largely unprotected due to the dire lack of existing regulations protecting users from large scale face recognition in the United States, where the value of data trade is in the tens of billions. In its current state, facial privacy in the United States depends on American corporations opting not to collect the public data, an option rarely chosen. Much research has been done in the area of suppressing recognition abilities, giving users the ability to …

Extending R2rml-F To Support Dynamic Datatype And Language Tags, Aparna Nayak, Bojan Bozic, Luca Longo

Conference papers

Linked data is often generated from raw data with the help of mapping languages. Complex data transformation is one of the essential parts while uplifting data which either can be implemented as custom solutions or separated from the mapping process. In this paper, we propose an approach of separating complex data transformations from the mapping process that can still be reusable across the systems. In the proposed method, complex data transformations include the entailment of (i) language tag and (ii) datatype present at the data source. The proposed method also includes inferring missing datatype information. We extended R2RML-F to handle …

Data-Driven Operational And Safety Analysis Of Emerging Shared Electric Scooter Systems, Qingyu Ma

Computational Modeling & Simulation Engineering Theses & Dissertations

The rapid rise of shared electric scooter (E-Scooter) systems offers many urban areas a new micro-mobility solution. The portable and flexible characteristics have made E-Scooters a competitive mode for short-distance trips. Compared to other modes such as bikes, E-Scooters allow riders to freely ride on different facilities such as streets, sidewalks, and bike lanes. However, sharing lanes with vehicles and other users tends to cause safety issues for riding E-Scooters. Conventional methods are often not applicable for analyzing such safety issues because well-archived historical crash records are not commonly available for emerging E-Scooters.

Perceiving the growth of such a micro-mobility …

A Fine-Grained Attribute Based Data Retrieval With Proxy Re-Encryption Scheme For Data Outsourcing Systems, Hanshu Hong, Ximeng Liu, Zhixin Sun

Research Collection School Of Computing and Information Systems

Attribute based encryption is suitable for data protection in data outsourcing systems such as cloud computing. However, the leveraging of encryption technique may retrain some routine operations over the encrypted data, particularly in the field of data retrieval. This paper presents an attribute based date retrieval with proxy re-encryption (ABDR-PRE) to provide both fine-grained access control and retrieval over the ciphertexts. The proposed scheme achieves fine-grained data access management by adopting KP-ABE mechanism, a delegator can generate the re-encryption key and search indexes for the ciphertexts to be shared over the target delegatee’s attributes. Throughout the process of data sharing, …

Checking Smart Contracts With Structural Code Embedding, Zhipeng Gao, Lingxiao Jiang, Xin Xia, David Lo, John Grundy

Research Collection School Of Computing and Information Systems

Smart contracts have been increasingly used together with blockchains to automate financial and business transactions. However, many bugs and vulnerabilities have been identified in many contracts which raises serious concerns about smart contract security, not to mention that the blockchain systems on which the smart contracts are built can be buggy. Thus, there is a significant need to better maintain smart contract code and ensure its high reliability. In this paper, we propose an automated approach to learn characteristics of smart contracts in Solidity, useful for repetitive contract code, bug detection and contract validation. Our new approach is based on …

Graph Learning Assisted Multi-Objective Integer Programming, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Abhishek Gupta, Mingyan Simon Lin

Research Collection School Of Computing and Information Systems

Objective-space decomposition algorithms (ODAs) are widely studied for solvingmulti-objective integer programs. However, they often encounter difficulties inhandling scalarized problems, which could cause infeasibility or repetitive nondominatedpoints and thus induce redundant runtime. To mitigate the issue, we presenta graph neural network (GNN) based method to learn the reduction rule in the ODA.We formulate the algorithmic procedure of generic ODAs as a Markov decisionprocess, and parameterize the policy (reduction rule) with a novel two-stage GNNto fuse information from variables, constraints and especially objectives for betterstate representation. We train our model with imitation learning and deploy it ona state-of-the-art ODA. Results show that …

Learning Large Neighborhood Search Policy For Integer Programming, Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

We propose a deep reinforcement learning (RL) method to learn large neighborhood search (LNS) policy for integer programming (IP). The RL policy is trained as the destroy operator to select a subset of variables at each step, which is reoptimized by an IP solver as the repair operator. However, the combinatorial number of variable subsets prevents direct application of typical RL algorithms. To tackle this challenge, we represent all subsets by factorizing them into binary decisions on each variable. We then design a neural network to learn policies for each variable in parallel, trained by a customized actor-critic algorithm. We …

Neurolkh: Combining Deep Learning Model With Lin-Kernighan-Helsgaun Heuristic For Solving The Traveling Salesman Problem, Liang Xin, Wen Song, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

We present NeuroLKH, a novel algorithm that combines deep learning with the strong traditional heuristic Lin-Kernighan-Helsgaun (LKH) for solving Traveling Salesman Problem. Specifically, we train a Sparse Graph Network (SGN) with supervised learning for edge scores and unsupervised learning for node penalties, both of which are critical for improving the performance of LKH. Based on the output of SGN, NeuroLKH creates the edge candidate set and transforms edge distances to guide the searching process of LKH. Extensive experiments firmly demonstrate that, by training one model on a wide range of problem sizes, NeuroLKH significantly outperforms LKH and generalizes well to …

Linear Algebra For Computer Science, M. Thulasidas

Research Collection School Of Computing and Information Systems

This textbook introduces the essential concepts and practice of Linear Algebra to the undergraduate student of computer science. The focus of this book is on the elegance and beauty of the numerical techniques and algorithms originating from Linear Algebra. As a practical handbook for computer and data scientists, LA4CS restricts itself mostly to real fields and tractable discourses, rather than deep and theoretical mathematics.

Beyond Smoothness : Incorporating Low-Rank Analysis Into Nonparametric Density Estimation, Rob Vandermeulen, Antoine Ledent

Research Collection School Of Computing and Information Systems

The construction and theoretical analysis of the most popular universally consistent nonparametric density estimators hinge on one functional property: smoothness. In this paper we investigate the theoretical implications of incorporating a multi-view latent variable model, a type of low-rank model, into nonparametric density estimation. To do this we perform extensive analysis on histogram-style estimators that integrate a multi-view model. Our analysis culminates in showing that there exists a universally consistent histogram-style estimator that converges to any multi-view model with a finite number of Lipschitz continuous components at a rate of ˜O(1/3√n) in L1 error. In contrast, the standard histogram estimator …

Functional Signatures: New Definition And Constructions, Qingwen Guo, Qiong Huang, Sha Ma, Meiyan Xiao, Guomin Yang, Willy Susilo

Research Collection School Of Computing and Information Systems

Functional signatures (FS) enable a master authority to delegate its signing privilege to an assistant. Concretely, the master authority uses its secret key sk(F) to issue a signing key sk(f) for a designated function f is an element of F-FS and sends both f and sk(f) to the assistant E, which is then able to compute a signature sigma(f) with respect to pk(F) for a message y in the range of f. In this paper, we modify the syntax of FS slightly to support the application scenario where a certificate of authorization is necessary. Compared with the original FS, our …

Concise Mercurial Subvector Commitments: Definitions And Constructions, Yannan Li, Willy Susilo, Guomin Yang, Tran Viet Xuan Phuong, Yong Yu, Dongxi Liu

Research Collection School Of Computing and Information Systems

Vector commitment and its variants have attracted a lot of attention recently as they have been exposed to a wide range of applications in blockchain. Two special extensions of vector commitments, namely subvector commitments and mercurial commitments, have been proposed with attractive features that are desirable in many applications. Nevertheless, to the best of our knowledge, a single construction satisfying all those attractive features is still missing. In this work, we analyze those important properties and propose a new primitive called mercurial subvector commitments, which are efficiently updatable, mercurial hiding, position binding, and aggregatable. We formalize the system model and …

On Analysing Student Resilience In Higher Education Programs Using A Data-Driven Approach, Audrey Tedja Widjaja, Ee Peng Lim, Aldy Gunawan

Research Collection School Of Computing and Information Systems

Analysing student resilience is important as research has shown that resilience is related to students’ academic performance and their persistence through academic setbacks. While questionnaires can be conducted to assess student resilience directly, they suffer from human recall errors and deliberate suppression of true responses. In this paper, we propose ACREA, ACademic REsilience Analytics framework which adopts a datadriven approach to analyse student resilient behavior with the use of student-course data. ACREA defines academic setbacks experienced by students and measures how well students overcome such setbacks using a quasi-experimental design. By applying ACREA on a real world student-course dataset, we …

Degree Doesn't Matter: Identifying The Drivers Of Interaction In Software Development Ecosystem, Amrita Bhattacharjee, Subhajit Datta, Subhashis Majumder

Research Collection School Of Computing and Information Systems

Large scale software development ecosystems represent one of the most complex human enterprises. In such settings, developers are embedded in a web of shared concerns, responsibilities, and objectives at individual and collective levels. A deep understanding of the factors that influence developers to connect with one another is crucial in appreciating the challenges of such ecosystems as well as formulating strategies to overcome those challenges. We use real world data from multiple software development ecosystems to construct developer interaction networks and examine the mechanisms of such network formation using statistical models to identify developer attributes that have maximal influence on …

Channel Integration Services In Online Healthcare Communities, Anqi Zhao, Qian Tang

Research Collection School Of Computing and Information Systems

In online healthcare communities, channel integration services have become the bridge between online and offline channels, enabling patients to easily migrate across channels. Different from pure online services, online-to-offline (On2Off) and offline-to-online (Off2On) channel integration services involve both channels. This study examines the interrelationships between pure online services and channel integration services. Using a panel dataset composed of data from an online healthcare community, we find that pure online services decrease patients’ demand for On2Off integration services but increase their use of Off2On integration services. Our findings suggest that providing healthcare services online can reduce online patients’ needs to visit …

Integration Of Information Technology Certifications Into Undergraduate Computing Curriculum, Eng Lieh Ouh, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

This innovative practice full paper describes our experiences of integrating information technology certifications into an undergraduate computing curriculum. As the technology landscape evolves, a common challenge for educators in computing programs is designing an industry-relevant curriculum. Over the years, industry practitioners have taken technology certifications to validate themselves against a base level of technical knowledge currently in demand in industry. Information technology (IT) certifications can also offer paths for academic computing programs to stay relevant to industry needs. However, identifying relevant IT certifications and integrating it into an academic curriculum requires a careful design approach as substantial efforts are needed …

Adadeep: A Usage-Driven, Automated Deep Model Compression Framework For Enabling Ubiquitous Intelligent Mobiles, Sicong Liu, Junzhao Du, Kaiming Nan, Zimu Zhou, Hui Liu, Zhangyang Wang, Yingyan Lin

Research Collection School Of Computing and Information Systems

Recent breakthroughs in deep neural networks (DNNs) have fueled a tremendously growing demand for bringing DNN-powered intelligence into mobile platforms. While the potential of deploying DNNs on resource-constrained platforms has been demonstrated by DNN compression techniques, the current practice suffers from two limitations: 1) merely stand-alone compression schemes are investigated even though each compression technique only suit for certain types of DNN layers; and 2) mostly compression techniques are optimized for DNNs’ inference accuracy, without explicitly considering other application-driven system performance (e.g., latency and energy cost) and the varying resource availability across platforms (e.g., storage and processing capability). To this …

Ai And The Future Of Work: What We Know Today, Steven M. Miller, Thomas H. Davenport

Research Collection School Of Computing and Information Systems

To contribute to a better understanding of the contemporary realities of AI workplace deployments, the authors recently completed 29 case studies of people doing their everyday work with AI-enabled smart machines. Twenty-three of these examples were from North America, mostly in the US. Six were from Southeast Asia, mostly in Singapore. In this essay, we compare our findings on job and workplace impacts to those reported in the MIT Task Force on the Work of the Future report, as we consider that to be the most comprehensive recent study on this topic.

Solving The Vehicle Routing Problem With Simultaneous Pickup And Delivery And Occasional Drivers By Simulated Annealing, Vincent F. Yu, Grace Aloina, Panca Jodiawan, Aldy Gunawan, Tsung-Chi Huang

Research Collection School Of Computing and Information Systems

This research studies the vehicle routing problem with simultaneous pickup and delivery with an occasional driver (VRPSPDOD). VRPSPDOD is a new variant of the vehicle routing problems with simultaneous pickup and delivery (VRPSPD). Different from VRPSPD, in VRPSPDOD, occasional drivers are employed to work with regular vehicles to service customers’ pickup and delivery requests in order to minimize the total cost. We formulate a mixed integer linear programming model for VRPSPD and propose a heuristic algorithm based on simulated annealing (SA) to solve the problem. The results of comprehensive numerical experiments show that the proposed SA performs well in terms …

Imon: Appearance-Based Gaze Tracking System On Mobile Devices, Sinh Huynh, Rajesh Krishna Balan, Jeonggil Ko

Research Collection School Of Computing and Information Systems

Gaze tracking is a key building block used in many mobile applications including entertainment, personal productivity, accessibility, medical diagnosis, and visual attention monitoring. In this paper, we present iMon, an appearance-based gaze tracking system that is both designed for use on mobile phones and has significantly greater accuracy compared to prior state-of-the-art solutions. iMon achieves this by comprehensively considering the gaze estimation pipeline and then overcoming three different sources of errors. First, instead of assuming that the user's gaze is fixed to a single 2D coordinate, we construct each gaze label using a probabilistic 2D heatmap gaze representation input to …

Building Action Sets In A Deep Reinforcement Learner, Yongzhao Wang, Arunesh Sinha, Sky C.H. Wang, Michael P. Wellman

Research Collection School Of Computing and Information Systems

In many policy-learning applications, the agent may execute a set of actions at each decision stage. Choosing among an exponential number of alternatives poses a computational challenge, and even representing actions naturally expressed as sets can be a tricky design problem. Building upon prior approaches that employ deep neural networks and iterative construction of action sets, we introduce a reward-shaping approach to apportion reward to each atomic action based on its marginal contribution within an action set, thereby providing useful feedback for learning to build these sets. We demonstrate our method in two environments where action spaces are combinatorial. Experiments …