Computer Sciences Commons^™

Deep Q Learning Applied To Stock Trading, Agnibh Dasgupta

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Developing a strategy for stock trading is a vital task for investors. However, it is challenging to obtain an optimal strategy, given the complex and dynamic nature of the stock market. This thesis aims to explore the applications of Reinforcement Learning with the goal of maximizing returns from market investment, keeping in mind the human aspect of trading by utilizing stock prices represented as candlestick graphs. Furthermore, the algorithm studies public interest patterns in form of graphs extracted from Google Trends to make predictions. Deep Q learning has been used to train an agent based on fused images of stock …

Job Satisfaction And Employee Turnover Determinants In Fortune 50 Companies: Insights From Employee Reviews From Indeed.Com, Bishal Sainju

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

We explored 682176 employee reviews of Fortune 50 companies from Indeed.com using topic discovery techniques like Latent Dirichlet Allocation (LDA) and Structural Topic Modeling (STM) to identify salient aspects in employee reviews and automatically infer latent topics that tend to drive employee satisfaction. We also studied how various satisfaction factors could be related to employee turnover. We discovered important topics in the reviews, including Management and Leadership, Advancement Opportunity, Pay and Benefits, Work-Life Balance, and Culture, which we compare to the five Job Descriptive Index (JDI) facets. Both LDA and STM discovered well-separated and distinguishable topics. We also …

Micro Grid Control Optimization With Load And Solar Prediction, Shaju Saha

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Using renewable energy can save money and keep the environment cleaner. Installing a solar PV system is a one-time cost but it can generate energy for a lifetime. Solar PV does not generate carbon emissions while producing power. This thesis evaluates the value of being able to make accurate predictions in the use of solar energy. It uses predicted solar power and load for a system and a battery to store the energy for future use and calculates the operating cost or profit in several designed conditions. Various factors like a different place, tuning the capacity of sources, changing buy/sell …

Attentional Parsing Networks, Marcus Karr

Master's Theses

Convolutional neural networks (CNNs) have dominated the computer vision field since the early 2010s, when deep learning largely replaced previous approaches like hand-crafted feature engineering and hierarchical image parsing. Meanwhile transformer architectures have attained preeminence in natural language processing, and have even begun to supplant CNNs as the state of the art for some computer vision tasks.

This study proposes a novel transformer-based architecture, the attentional parsing network, that reconciles the deep learning and hierarchical image parsing approaches to computer vision. We recast unsupervised image representation as a sequence-to-sequence translation problem where image patches are mapped to successive layers …

Eelgrass (Zostera Marina) Population Decline In Morro Bay, Ca: A Meta-Analysis Of Herbicide Application In San Luis Obispo County And Morro Bay Watershed, Tyler King Sinnott

Master's Theses

The endemic eelgrass (Zostera marina) community of Morro Bay Estuary, located on the central coast of California, has experienced an estimated decline of 95% in occupied area (reduction of 344 acres to 20 acres) from 2008 to 2017 for reasons that are not yet definitively clear. One possible driver of degradation that has yet to be investigated is the role of herbicides from agricultural fields in the watershed that feeds into the estuary. Thus, the primary research goal of this project was to better understand temporal and spatial trends of herbicide use within the context of San Luis …

Engaging Empirical Dynamic Modeling To Detect Intrusions In Cyber-Physical Systems, David R. Crow, Scott R. Graham, Brett J. Borghetti, Patrick J. Sweeney

Faculty Publications

Modern cyber-physical systems require effective intrusion detection systems to ensure adequate critical infrastructure protection. Developing an intrusion detection capability requires an understanding of the behavior of a cyber-physical system and causality of its components. Such an understanding enables the characterization of normal behavior and the identification and reporting of anomalous behavior. This chapter explores a relatively new time series analysis technique, empirical dynamic modeling, that can contribute to system understanding. Specifically, it examines if the technique can adequately describe causality in cyber-physical systems and provides insights into it serving as a foundation for intrusion detection.

A Near-Optimal Change-Detection Based Algorithm For Piecewise-Stationary Combinatorial Semi-Bandits, Huozhi Zhou, Lingda Wang, Lav N. Varshney, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

We investigate the piecewise-stationary combinatorial semi-bandit problem. Compared to the original combinatorial semi-bandit problem, our setting assumes the reward distributions of base arms may change in a piecewise-stationary manner at unknown time steps. We propose an algorithm, GLR-CUCB, which incorporates an efficient combinatorial semi-bandit algorithm, CUCB, with an almost parameter-free change-point detector, the Generalized Likelihood Ratio Test (GLRT). Our analysis shows that the regret of GLR-CUCB is upper bounded by O(√NKT logT), where N is the number of piecewise-stationary segments, K is the number of base arms, and T is the number of time steps. As a complement, we also …

Graphmp: I/O-Efficient Big Graph Analytics On A Single Commodity Machine, Peng Sun, Yonggang Wen, Nguyen Binh Duong Ta, Xiaokui Xiao

Research Collection School Of Computing and Information Systems

Recent studies showed that single-machine graph processing systems can be as highly competitive as cluster-based approaches on large-scale problems. While several out-of-core graph processing systems and computation models have been proposed, the high disk I/O overhead could significantly reduce performance in many practical cases. In this paper, we propose GraphMP to tackle big graph analytics on a single machine. GraphMP achieves low disk I/O overhead with three techniques. First, we design a vertex-centric sliding window (VSW) computation model to avoid reading and writing vertices on disk. Second, we propose a selective scheduling method to skip loading and processing unnecessary edge …

Walls Have Ears: Eavesdropping User Behaviors Via Graphics-Interrupt-Based Side Channel, Haoyu Ma, Jianwen Tian, Debin Gao, Jia Chunfu

Research Collection School Of Computing and Information Systems

Graphics Processing Units (GPUs) are now playing a vital role in many devices and systems including computing devices, data centers, and clouds, making them the next target of side-channel attacks. Unlike those targeting CPUs, existing side-channel attacks on GPUs exploited vulnerabilities exposed by application interfaces like OpenGL and CUDA, which can be easily mitigated with software patches. In this paper, we investigate the lower-level and native interface between GPUs and CPUs, i.e., the graphics interrupts, and evaluate the side channel they expose. Being an intrinsic profile in the communication between a GPU and a CPU, the pattern of graphics interrupts …

Nearest Centroid: A Bridge Between Statistics And Machine Learning, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

In order to guide our students of machine learning in their statistical thinking, we need conceptually simple and mathematically defensible algorithms. In this paper, we present the Nearest Centroid algorithm (NC) algorithm as a pedagogical tool, combining the key concepts behind two foundational algorithms: K-Means clustering and K Nearest Neighbors (k- NN). In NC, we use the centroid (as defined in the K-Means algorithm) of the observations belonging to each class in our training data set and its distance from a new observation (similar to k-NN) for class prediction. Using this obvious extension, we will illustrate how the concepts of …

Secure Answer Book And Automatic Grading, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

In response to the growing need to perform assessments online, we have developed a secure answer book, as well as a tool for automatically grading it for our course on spread- sheet modeling. We applied these techniques to a cohort of about 160 students who took the course last term. In this paper, we describe the design, implementation and the techniques employed to enhance both the security of the answer book and the ease, accuracy and consistency of grading. In addition, we summarize the experience and takeaways, both from the instructor and the student perspectives. Although the answer book and …

Causal Intervention For Weakly-Supervised Semantic Segmentation, Zhang Dong, Hanwang Zhang, Jinhui Tang, Xian-Sheng Hua, Qianru Sun

Research Collection School Of Computing and Information Systems

We present a causal inference framework to improve Weakly-Supervised Semantic Segmentation (WSSS). Specifically, we aim to generate better pixel-level pseudo-masks by using only image-level labels --- the most crucial step in WSSS. We attribute the cause of the ambiguous boundaries of pseudo-masks to the confounding context, e.g., the correct image-level classification of "horse'' and "person'' may be not only due to the recognition of each instance, but also their co-occurrence context, making the model inspection (e.g., CAM) hard to distinguish between the boundaries. Inspired by this, we propose a structural causal model to analyze the causalities among images, contexts, and …

Debunking Rumors On Twitter With Tree Transformer, Jing Ma, Wei Gao

Research Collection School Of Computing and Information Systems

Rumors are manufactured with no respect for accuracy, but can circulate quickly and widely by "word-of-post" through social media conversations. Conversation tree encodes important information indicative of the credibility of rumor. Existing conversation-based techniques for rumor detection either just strictly follow tree edges or treat all the posts fully-connected during feature learning. In this paper, we propose a novel detection model based on tree transformer to better utilize user interactions in the dialogue where post-level self-attention plays the key role for aggregating the intra-/inter-subtree stances. Experimental results on the TWITTER and PHEME datasets show that the proposed approach consistently improves …

Smartfuzz: An Automated Smart Fuzzing Approach For Testing Smartthings Apps, Lwin Khin Shar, Nguyen Binh Duong Ta, Lingxiao Jiang, David Lo, Wei Minn, Kiah Yong Glenn Yeo, Eugene Kim

Research Collection School Of Computing and Information Systems

As IoT ecosystem has been fast-growing recently, there have been various security concerns of this new computing paradigm. Malicious IoT apps gaining access to IoT devices and capabilities to execute sensitive operations (sinks), e.g., controlling door locks and switches, may cause serious security and safety issues. Unlike traditional mobile/web apps, IoT apps highly interact with a wide variety of physical IoT devices and respond to environmental events, in addition to user inputs. It is therefore important to conduct comprehensive testing of IoT apps to identify possible anomalous behaviours. On the other hand, it is also important to optimize the number …

A Bert-Based Dual Embedding Model For Chinese Idiom Prediction, Minghuan Tan, Jing Jiang

Research Collection School Of Computing and Information Systems

Chinese idioms are special fixed phrases usually derived from ancient stories, whose meanings are oftentimes highly idiomatic and non-compositional. The Chinese idiom prediction task is to select the correct idiom from a set of candidate idioms given a context with a blank. We propose a BERT-based dual embedding model to encode the contextual words as well as to learn dual embeddings of the idioms. Specifically, we first match the embedding of each candidate idiom with the hidden representation corresponding to the blank in the context. We then match the embedding of each candidate idiom with the hidden representations of all …

Digital Social Listening On Conversations About Sexual Harassment, Xuesi Sim, Ern Rae Chang, Yu Xiang Ong, Jie Ying Yeo, Christine Bai Shuang Yan, Eugene Wen Jia Choy, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

In light of the #MeToo movement and publicized sexual harassment incidents in Singapore in recent years, we built an analytics pipeline for performing digital social listening on conversations about sexual harassment for AWARE (Association of Women for Action and Research). Our social network analysis results identified key influencers that AWARE can engage for sexual harassment awareness campaigns. Further, our analysis results suggest new hashtags that AWARE can use to run social media campaigns and achieve greater reach.

Robust, Fine-Grained Occupancy Estimation Via Combined Camera & Wifi Indoor Localization, Anuradha Ravi, Archan Misra

Research Collection School Of Computing and Information Systems

We describe the development of a robust, accurate and practically-validated technique for estimating the occupancy count in indoor spaces, based on a combination of WiFi & video sensing. While fusing these two sensing-based inputs is conceptually straightforward, the paper demonstrates and tackles the complexity that arises from several practical artefacts, such as (i) over-counting when a single individual uses multiple WiFi devices and under-counting when the individual has no such device; (ii) corresponding errors in image analysis due to real-world artefacts, such as occlusion, and (iii) the variable errors in mapping image bounding boxes (which can include multiple possible types …

Blockchain-Based Public Auditing And Secure Deduplication With Fair Arbitration, Haoran Yuan, Xiaofeng Chen, Jianfeng Wang, Jiaming Yuan, Hongyang Yan, Willy Susilo

Research Collection School Of Computing and Information Systems

Data auditing enables data owners to verify the integrity of their sensitive data stored at an untrusted cloud without retrieving them. This feature has been widely adopted by commercial cloud storage. However, the existing approaches still have some drawbacks. On the one hand, the existing schemes have a defect of fair arbitration, i.e., existing auditing schemes lack an effective method to punish the malicious cloud service provider (CSP) and compensate users whose data integrity is destroyed. On the other hand, a CSP may store redundant and repetitive data. These redundant data inevitably increase management overhead and computational cost during the …

Prediction Of Nocturia In Live Alone Elderly Using Unobtrusive In-Home Sensors, Barry Nuqoba, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

Nocturia, or the need to void (or urinate) one or more times in the middle of night time sleeping, represents a significant economic burden for individuals and healthcare systems. Although it can be diagnosed in the hospital, most people tend to regard nocturia as a usual event, resulting in underreported diagnosis and treatment. Data from self-reporting via a voiding diary may be irregular and subjective especially among the elderly due to memory problems. This study aims to detect the presence of nocturia through passive in-home monitoring to inform intervention (e.g., seeking diagnosis and treatment) to improve the physical and mental …

Secure And Verifiable Inference In Deep Neural Networks, Guowen Xu, Hongwei Li, Hao Ren, Jianfei Sun, Shengmin Xu, Jianting Ning, Haoming Yang, Kan Yang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Outsourced inference service has enormously promoted the popularity of deep learning, and helped users to customize a range of personalized applications. However, it also entails a variety of security and privacy issues brought by untrusted service providers. Particularly, a malicious adversary may violate user privacy during the inference process, or worse, return incorrect results to the client through compromising the integrity of the outsourced model. To address these problems, we propose SecureDL to protect the model’s integrity and user’s privacy in Deep Neural Networks (DNNs) inference process. In SecureDL, we first transform complicated non-linear activation functions of DNNs to low-degree …

A Deep Learning Framework Supporting Model Ownership Protection And Traitor Tracing, Guowen Xu, Hongwei Li, Yuan Zhang, Xiaodong Lin, Robert H. Deng, Xuemin (Sherman) Shen

Research Collection School Of Computing and Information Systems

Cloud-based deep learning (DL) solutions have been widely used in applications ranging from image recognition to speech recognition. Meanwhile, as commercial software and services, such solutions have raised the need for intellectual property rights protection of the underlying DL models. Watermarking is the mainstream of existing solutions to address this concern, by primarily embedding pre-defined secrets in a model's training process. However, existing efforts almost exclusively focus on detecting whether a target model is pirated, without considering traitor tracing. In this paper, we present SecureMark_DL, which enables a model owner to embed a unique fingerprint for every customer within parameters …

Optimal Collaborative Path Planning For Unmanned Surface Vehicles Carried By A Parent Boat Along A Planned Route, Ari Carisza Graha Prasetia, I-Lin Wang, Aldy Gunawan

Research Collection School Of Computing and Information Systems

In this paper, an effective mechanism using a fleet of unmanned surface vehicles (USVs) carried by a parent boat (PB) is proposed to complete search or scientific tasks over multiple target water areas within a shorter time . Specifically, multiple USVs can be launched from the PB to conduct such operations simultaneously, and each USV can return to the PB for battery recharging or swapping and data collection in order to continue missions in a more extended range. The PB itself follows a planned route with a flexible schedule taking into consideration locational constraints or collision avoidance in a real-world …

Business Practice Of Social Media - Platform And Customer Service Adoption, Shujing Sun, Yang Gao, Huaxia Rui

Research Collection School Of Computing and Information Systems

This paper examines the key drivers in business adoptions of the platform and customer service within the context of social media. We carry out the empirical analyses using the decision trajectories of the international airline industry on Twitter. We find that a firm's decision-making is subject to both peer influence and consumer pressure. Regarding peer influence, we find that the odds of both adoptions increase when the extent of peers' adoption increases. We also identify the distinctive role of consumers. Specifically, before the platform adoption, firms learn about potential consequences from consumer reactions to peers' adoptions. Upon the platform adoption, …

Audee: Automated Testing For Deep Learning Frameworks, Qianyu Guo, Xiaofei Xie, Yi Li, Xiaoyu Zhang, Yang Liu, Xiaohong Li, Chao Shen

Research Collection School Of Computing and Information Systems

Deep learning (DL) has been applied widely, and the quality of DL system becomes crucial, especially for safety-critical applications. Existing work mainly focuses on the quality analysis of DL models, but lacks attention to the underlying frameworks on which all DL models depend. In this work, we propose Audee, a novel approach for testing DL frameworks and localizing bugs. Audee adopts a search-based approach and implements three different mutation strategies to generate diverse test cases by exploring combinations of model structures, parameters, weights and inputs. Audee is able to detect three types of bugs: logical bugs, crashes and Not-a-Number (NaN) …

Sadt: Syntax-Aware Differential Testing Of Certificate Validation In Ssl/Tls Implementations, Lili Quan, Qianyu Guo, Hongxu Chen, Xiaofei Xie, Xiaohong Li, Yang Liu, Jing Hu

Research Collection School Of Computing and Information Systems

The security assurance of SSL/TLS critically depends on the correct validation of X.509 certificates. Therefore, it is important to check whether a certificate is correctly validated by the SSL/TLS implementations. Although differential testing has been proven to be effective in finding semantic bugs, it still suffers from the following limitations: (1) The syntax of test cases cannot be correctly guaranteed. (2) Current test cases are not diverse enough to cover more implementation behaviours. This paper tackles these problems by introducing SADT, a novel syntax-aware differential testing framework for evaluating the certificate validation process in SSL/TLS implementations. We first propose a …

Understanding Continuance Intention Toward Crowdsourcing Games: A Longitudinal Investigation, Xiaohui Wang, Dion Hoe-Lian Goh, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Given the increasing popularity of gamified crowdsourcing, the study reported here involved examining determinants of users' continuance intention toward crowdsourcing games, both with longitudinal data and reference to a revised unified theory of acceptance and use of technology (UTAUT). At three time points, data were collected from an online survey about playing crowdsourcing games. Time-lagged regression, cross-temporal correlation, and structural equation modeling were performed to examine determinants of the acceptance of crowdsourcing games. Results indicate that the revised UTAUT2 is applicable to explaining the acceptance of crowdsourcing games. Not only did effort expectancy, hedonic motivation, and social influence directly affect …

Sharper Generalisation Bounds For Pairwise Learning, Yunwen Lei, Antoine Ledent, Marius Kloft

Research Collection School Of Computing and Information Systems

Pairwise learning refers to learning tasks with loss functions depending on a pair of training examples, which includes ranking and metric learning as specific examples. Recently, there has been an increasing amount of attention on the generalization analysis of pairwise learning to understand its practical behavior. However, the existing stability analysis provides suboptimal high-probability generalization bounds. In this paper, we provide a refined stability analysis by developing generalization bounds which can be √nn-times faster than the existing results, where nn is the sample size. This implies excess risk bounds of the order O(n−1/2) (up to a logarithmic factor) for both …

Learning To Dispatch For Job Shop Scheduling Via Deep Reinforcement Learning, Cong Zhang, Wen Song, Zhiguang Cao, Jie Zhang, Puay Siew Tan, Xu Chi

Research Collection School Of Computing and Information Systems

Priority dispatching rule (PDR) is widely used for solving real-world Job-shop scheduling problem (JSSP). However, the design of effective PDRs is a tedious task, requiring a myriad of specialized knowledge and often delivering limited performance. In this paper, we propose to automatically learn PDRs via an end-to-end deep reinforcement learning agent. We exploit the disjunctive graph representation of JSSP, and propose a Graph Neural Network based scheme to embed the states encountered during solving. The resulting policy network is size-agnostic, effectively enabling generalization on large-scale instances. Experiments show that the agent can learn high-quality PDRs from scratch with elementary raw …

Theory-Inspired Path-Regularized Differential Network Architecture Search, Pan Zhou, Caiming Xiong, Richard Socher, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Despite its high search efficiency, differential architecture search (DARTS) often selects network architectures with dominated skip connections which lead to performance degradation. However, theoretical understandings on this issue remain absent, hindering the development of more advanced methods in a principled way. In this work, we solve this problem by theoretically analyzing the effects of various types of operations, e.g. convolution, skip connection and zero operation, to the network optimization. We prove that the architectures with more skip connections can converge faster than the other candidates, and thus are selected by DARTS. This result, for the first time, theoretically and explicitly …

Towards Theoretically Understanding Why Sgd Generalizes Better Than Adam In Deep Learning, Pan Zhou, Jiashi Feng, Chao Ma, Caiming Xiong, Steven C. H. Hoi, Weinan E

Research Collection School Of Computing and Information Systems

It is not clear yet why ADAM-alike adaptive gradient algorithms suffer from worse generalization performance than SGD despite their faster training speed. This work aims to provide understandings on this generalization gap by analyzing their local convergence behaviors. Specifically, we observe the heavy tails of gradient noise in these algorithms. This motivates us to analyze these algorithms through their Lévy-driven stochastic differential equations (SDEs) because of the similar convergence behaviors of an algorithm and its SDE. Then we establish the escaping time of these SDEs from a local basin. The result shows that (1) the escaping time of both SGD …