Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Deep learning (11)
- MITB student (6)
- Social media (6)
- Attribute-based encryption (5)
- Blockchain (5)
-
- Clustering (5)
- Deep Learning (5)
- Empirical study (5)
- Machine learning (5)
- Natural Language Processing (5)
- Neural networks (5)
- Categorization (4)
- Cloud computing (4)
- Fashion analysis (4)
- Fashion knowledge extraction (4)
- Privacy-preserving (4)
- Sentiment analysis (4)
- Algorithm (3)
- Authentication (3)
- Code search (3)
- Crowdsourcing (3)
- Cryptocurrency (3)
- Efficiency (3)
- Feature extraction (3)
- Internet of Things (IoT) (3)
- Online learning (3)
- Privacy (3)
- Program transformation (3)
- Query processing (3)
- Recognition: Detection (3)
Articles 1 - 30 of 375
Full-Text Articles in Physical Sciences and Mathematics
Designing Learning Activities For Experiential Learning In A Design Thinking Course, Benjamin Gan, Eng Lieh Ouh
Designing Learning Activities For Experiential Learning In A Design Thinking Course, Benjamin Gan, Eng Lieh Ouh
Research Collection School Of Computing and Information Systems
One experiential learning design challenge is the duration of learning activities. These learning activities take up time and effort for teachers to design and student to perform. Another design challenge is the minimum instructional guidance of these learning activities which potentially impact the learning effectiveness of novice students. In this paper, we describe our findings of applying experiential learning method in a design thinking course with a list of learning activities performed iteratively. Each of the learning activity varies in their duration required and level of instructional guidance. Our survey seeks to find out which of the learning activities are …
Optimal Management Of Virtual Infrastructures Under Flexible Cloud Service Agreements, Zhiling Guo, Jin Li, Ram Ramesh
Optimal Management Of Virtual Infrastructures Under Flexible Cloud Service Agreements, Zhiling Guo, Jin Li, Ram Ramesh
Research Collection School Of Computing and Information Systems
A cloud service agreement entails the provisioning of a required set of virtual infrastructure resources at a specified level of availability to a client. The agreement also lays out the price charged to the client and a penalty to the provider when the assured availability is not met. The availability assurance involves backup resource provisioning, and the provider needs to allocate backups cost-effectively by balancing the resource-provisioning costs with the potential penalty costs. We develop stochastic dynamic optimization models of the backup resource-provisioning problem, leading to cost-effective resource-management policies in different practical settings. We present two sets of dynamic provisioning …
Compositional Verification Of Heap-Manipulating Programs Through Property-Guided Learning, Long H. Pham, Jun Sun, Quang Loc Le
Compositional Verification Of Heap-Manipulating Programs Through Property-Guided Learning, Long H. Pham, Jun Sun, Quang Loc Le
Research Collection School Of Computing and Information Systems
Analyzing and verifying heap-manipulating programs automatically is challenging. A key for fighting the complexity is to develop compositional methods. For instance, many existing verifiers for heap-manipulating programs require user-provided specification for each function in the program in order to decompose the verification problem. The requirement, however, often hinders the users from applying such tools. To overcome the issue, we propose to automatically learn heap-related program invariants in a property-guided way for each function call. The invariants are learned based on the memory graphs observed during test execution and improved through memory graph mutation. We implemented a prototype of our approach …
Happy Toilet: A Social Analytics Approach To The Study Of Public Toilet Cleanliness, Eugene W. J. Choy, Winston M. K. Ho, Xiaohang Li, Ragini Verma, Li Jin Sim, Kyong Jin Shim
Happy Toilet: A Social Analytics Approach To The Study Of Public Toilet Cleanliness, Eugene W. J. Choy, Winston M. K. Ho, Xiaohang Li, Ragini Verma, Li Jin Sim, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
This study presents a social analytics approach to the study of public toilet cleanliness in Singapore. From popular social media platforms, our system automatically gathers and analyzes relevant public posts that mention about toilet cleanliness in highly frequented locations across the Singapore island - from busy shopping malls to food 'hawker' centers.
Automating Change-Level Self-Admitted Technical Debt Determination, Meng Yan, Xin Xia, Emad Shihab, David Lo, Jianwei Yin, Xiaohu Yang
Automating Change-Level Self-Admitted Technical Debt Determination, Meng Yan, Xin Xia, Emad Shihab, David Lo, Jianwei Yin, Xiaohu Yang
Research Collection School Of Computing and Information Systems
Self-Admitted Technical Debt (SATD) refers to technical debt that is introduced intentionally. Previous studies that identify SATD at the file-level in isolation cannot describe the TD context related to multiple files. Therefore, it is more beneficial to identify the SATD once a change is being made. We refer to this type of TD identification as “Change-level SATD Determination”, and identifying SATD at the change-level can help to manage and control TD by understanding the TD context through tracing the introducing changes. In this paper, we propose a change-level SATD Determination mode by extracting 25 features from software changes that are …
Finding Needles In A Haystack: Leveraging Co-Change Dependencies To Recommend Refactorings, Marcos César De Oliveira, Davi Freitas, Rodrigo Bonifacio, Gustavo Pinto, David Lo
Finding Needles In A Haystack: Leveraging Co-Change Dependencies To Recommend Refactorings, Marcos César De Oliveira, Davi Freitas, Rodrigo Bonifacio, Gustavo Pinto, David Lo
Research Collection School Of Computing and Information Systems
A fine-grained co-change dependency arises when two fine-grained source-code entities, e.g., a method,change frequently together. This kind of dependency is relevant when considering remodularization efforts (e.g., to keep methods that change together in the same class). However, existing approaches forrecommending refactorings that change software decomposition (such as a move method) do not explorethe use of fine-grained co-change dependencies. In this paper we present a novel approach for recommending move method and move field refactorings, which removes co-change dependencies and evolutionary smells, a particular type of dependency that arise when fine-grained entities that belong to different classes frequently change together. First …
Examining The Theoretical Mechanisms Underlying Health Information Exchange Impact On Healthcare Outcomes: A Physician Agency Perspective, Fang Zhou, Qiu-Hong Wang, Hock Hai Teo
Examining The Theoretical Mechanisms Underlying Health Information Exchange Impact On Healthcare Outcomes: A Physician Agency Perspective, Fang Zhou, Qiu-Hong Wang, Hock Hai Teo
Research Collection School Of Computing and Information Systems
Health information exchange (HIE) is presumed to reduce medical costs by facilitating information sharing across healthcare providers. Existing studies focused on different medical costs or one set of costs, and resulted in mixed findings. We examine the effects of patient access to HIE on two of the most important medical costs of a hospitalization episode - test costs and medication costs - through a natural experiment and the discharge data of a hospital. Besides the negative direct effect of access to HIT on tests costs, we also find its positive spillover effect on medication costs, such that more patients having …
Optimal Design And Ownership Structures Of Innovative Retail Payment Systems, Zhiling Guo, Dan Ma
Optimal Design And Ownership Structures Of Innovative Retail Payment Systems, Zhiling Guo, Dan Ma
Research Collection School Of Computing and Information Systems
In response to the Fintech trend, an ongoing debate in the banking industry is how to design the new-generation interbank retail payment and settlement system. We propose a two-stage analytical model that takes into account the value-risk tradeoff in the new payment system design, as well as banks’ participation incentives and adoption timing decisions. We find that, as the system base value increases, banks tend to synchronize their investment and adoption decisions. When the system base value is low and banks are heterogeneous, bank association ownership maximizes social welfare. When both the system base value and bank heterogeneity are moderate, …
A Unified Variance-Reduced Accelerated Gradient Method For Convex Optimization, Guanghui Lan, Zhize Li, Yi Zhou
A Unified Variance-Reduced Accelerated Gradient Method For Convex Optimization, Guanghui Lan, Zhize Li, Yi Zhou
Research Collection School Of Computing and Information Systems
We propose a novel randomized incremental gradient algorithm, namely, VAriance-Reduced Accelerated Gradient (Varag), for finite-sum optimization. Equipped with a unified step-size policy that adjusts itself to the value of the conditional number, Varag exhibits the unified optimal rates of convergence for solving smooth convex finite-sum problems directly regardless of their strong convexity. Moreover, Varag is the first accelerated randomized incremental gradient method that benefits from the strong convexity of the data-fidelity term to achieve the optimal linear convergence. It also establishes an optimal linear rate of convergence for solving a wide class of problems only satisfying a certain error bound …
Ssrgd: Simple Stochastic Recursive Gradient Descent For Escaping Saddle Points, Zhize Li
Ssrgd: Simple Stochastic Recursive Gradient Descent For Escaping Saddle Points, Zhize Li
Research Collection School Of Computing and Information Systems
We analyze stochastic gradient algorithms for optimizing nonconvex problems. In particular, our goal is to find local minima (second-order stationary points) instead of just finding first-order stationary points which may be some bad unstable saddle points. We show that a simple perturbed version of stochastic recursive gradient descent algorithm (called SSRGD) can find an $(\epsilon,\delta)$-second-order stationary point with $\widetilde{O}(\sqrt{n}/\epsilon^2 + \sqrt{n}/\delta^4 + n/\delta^3)$ stochastic gradient complexity for nonconvex finite-sum problems. As a by-product, SSRGD finds an $\epsilon$-first-order stationary point with $O(n+\sqrt{n}/\epsilon^2)$ stochastic gradients. These results are almost optimal since Fang et al. [2018] provided a lower bound $\Omega(\sqrt{n}/\epsilon^2)$ for finding …
Improved Generalisation Bounds For Deep Learning Through L∞ Covering Numbers, Antoine Ledent, Yunwen Lei, Marius Kloft
Improved Generalisation Bounds For Deep Learning Through L∞ Covering Numbers, Antoine Ledent, Yunwen Lei, Marius Kloft
Research Collection School Of Computing and Information Systems
Using proof techniques involving L∞ covering numbers, we show generalisation error bounds for deep learning with two main improvements over the state of the art. First, our bounds have no explicit dependence on the number of classes except for logarithmic factors. This holds even when formulating the bounds in terms of the L 2 norm of the weight matrices, while previous bounds exhibit at least a square-root dependence on the number of classes in this case. Second, we adapt the Rademacher analysis of DNNs to incorporate weight sharing—a task of fundamental theoretical importance which was previously attempted only under very …
Strongly Leakage Resilient Authenticated Key Exchange, Revisited, Guomin Yang, Rongmao Chen, Yi Mu, Willy Susilo, Guo Fuchun, Jie Li
Strongly Leakage Resilient Authenticated Key Exchange, Revisited, Guomin Yang, Rongmao Chen, Yi Mu, Willy Susilo, Guo Fuchun, Jie Li
Research Collection School Of Computing and Information Systems
Authenticated Key Exchange (AKE) protocols allow two (or multiple) parties to authenticate each other and agree on a common secret key, which is essential for establishing a secure communication channel over a public network. AKE protocols form a central component in many network security standards such as IPSec, TLS/SSL, and SSH. However, it has been demonstrated that many standardized AKE protocols are vulnerable to side-channel and key leakage attacks. In order to defend against such attacks, leakage resilient (LR-) AKE protocols have been proposed in the literature. Nevertheless, most of the existing LR-AKE protocols only focused on the resistance to …
Quantum Consensus, Jorden Seet, Paul Griffin
Quantum Consensus, Jorden Seet, Paul Griffin
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel consensus mechanism utilizing the quantum properties of qubits. This move from classical computing to quantum computing is shown to theoretically enhance the scalability and speed of distributed consensus as well as improve security and be a potential solution for the problem of blockchain interoperability. Using this method may circumvent the common problem known as the Blockchain Trilemma, enhancing scalability and speed without sacrificing de-centralization or byzantine fault tolerance. Consensus speed and scalability is shown by removing the need for multicast responses and exploiting quantum properties to ensure that only a single multicast is …
Objective Sleep Quality As A Predictor Of Mild Cognitive Impairment In Seniors Living Alone, Brian Chen, Hwee-Pink Tan, Irus Rawtaer, Hwee Xian Tan
Objective Sleep Quality As A Predictor Of Mild Cognitive Impairment In Seniors Living Alone, Brian Chen, Hwee-Pink Tan, Irus Rawtaer, Hwee Xian Tan
Research Collection School Of Computing and Information Systems
Singapore has the fastest ageing population in the Asia Pacific region, with an estimated 82,000 seniors living with dementia. These figures are projected to increase to more than 130,000 by 2030. The challenge is to identify more community dwelling seniors with Mild Cognitive Impairment (MCI), a prodromal state, as it provides an opportunity for evidence-based early intervention to delay the onset of dementia. In this paper, we explore the use of Internet of Things (IoT) systems in detecting MCI symptoms in seniors who are living alone, and accurately grouping them into MCI positive and negative subjects. We present feature extraction …
Digitalization In Practice: The Fifth Discipline Advantage, Siu Loon Hoe
Digitalization In Practice: The Fifth Discipline Advantage, Siu Loon Hoe
Research Collection School Of Computing and Information Systems
Purpose The purpose of this paper is to provide advice to organizations on how to become successful in the digital age. The paper revisits Peter Senge's (1990) notion of the learning organization and discusses the relevance of systems thinking and the other four disciplines, namely, personal mastery, mental models, shared vision and team learning in the context of the current digitalization megatrend. Design/methodology/approach This paper is based on content analysis of essays from international organizations, strategy experts and management scholars, and insights gained from the author's consulting experience. A comparative case study from the health and social sector is also …
Self-Organizing Neural Networks For Universal Learning And Multimodal Memory Encoding, Ah-Hwee Tan, Budhitama Subagdja, Di Wang, Lei Meng
Self-Organizing Neural Networks For Universal Learning And Multimodal Memory Encoding, Ah-Hwee Tan, Budhitama Subagdja, Di Wang, Lei Meng
Research Collection School Of Computing and Information Systems
Learning and memory are two intertwined cognitive functions of the human brain. This paper shows how a family of biologically-inspired self-organizing neural networks, known as fusion Adaptive Resonance Theory (fusion ART), may provide a viable approach to realizing the learning and memory functions. Fusion ART extends the single-channel Adaptive Resonance Theory (ART) model to learn multimodal pattern associative mappings. As a natural extension of ART, various forms of fusion ART have been developed for a myriad of learning paradigms, ranging from unsupervised learning to supervised learning, semi-supervised learning, multimodal learning, reinforcement learning, and sequence learning. In addition, fusion ART models …
Gms: Grid-Based Motion Statistics For Fast, Ultra-Robust Feature Correspondence, Jia-Wang Bian, Wen-Yan Lin, Yun Liu, Le Zhang, Sai-Kit Yeung, Ming-Ming Cheng, Ian Reid
Gms: Grid-Based Motion Statistics For Fast, Ultra-Robust Feature Correspondence, Jia-Wang Bian, Wen-Yan Lin, Yun Liu, Le Zhang, Sai-Kit Yeung, Ming-Ming Cheng, Ian Reid
Research Collection School Of Computing and Information Systems
Feature matching aims at generating correspondences across images, which is widely used in many computer vision tasks. Although considerable progress has been made on feature descriptors and fast matching for initial correspondence hypotheses, selecting good ones from them is still challenging and critical to the overall performance. More importantly, existing methods often take a long computational time, limiting their use in real-time applications. This paper attempts to separate true correspondences from false ones at high speed. We term the proposed method (GMS) grid-based motion Statistics, which incorporates the smoothness constraint into a statistic framework for separation and uses a grid-based …
Selective Discrete Particle Swarm Optimization For The Team Orienteering Problem With Time Windows And Partial Scores, Vincent F. Yu, Perwira A. A. N. Redi, Parida Jewpanya, Aldy Gunawan
Selective Discrete Particle Swarm Optimization For The Team Orienteering Problem With Time Windows And Partial Scores, Vincent F. Yu, Perwira A. A. N. Redi, Parida Jewpanya, Aldy Gunawan
Research Collection School Of Computing and Information Systems
This paper introduces the Team Orienteering Problem with Time Windows and Partial Scores (TOPTW-PS),which is an extension of the Team Orienteering Problem with Time Windows (TOPTW). In the context of theTOPTW-PS, each node is associated with a set of scores with respect to a set of attributes. The objective ofTOPTW-PS is to find a set of routes that maximizes the total score collected from a subset of attributes whenvisiting the nodes subject to the time budget and the time window at each visited node. We develop a mathematical model and propose a discrete version of the Particle Swarm Optimization (PSO), …
Study Group Travel Behaviour Patterns From Large-Scale Smart Card Data, Xiancai Tian, Baihua Zheng
Study Group Travel Behaviour Patterns From Large-Scale Smart Card Data, Xiancai Tian, Baihua Zheng
Research Collection School Of Computing and Information Systems
In this paper, we aim at studying the group travel behaviour (GTB) patterns from large-scale auto fare collection (AFC) data. GTB is defined as two or more commuters intentionally and regularly traveling together from an origin to a destination. We propose a method to identify GTB accurately and efficiently and apply our method to the Singapore AFC dataset to reveal the GTB patterns of Singapore commuters. The case study proves that our method is able to identify GTB patterns more accurately and efficiently than the state-of-the-art.
An Empirical Study Of Sms One-Time Password Authentication In Android Apps, Siqi Ma, Runhan Feng, Juanru Li, Yang Liu, Surya Nepal, Elisa Bertino, Robert H. Deng, Zhuo Ma, Sanjay Jha
An Empirical Study Of Sms One-Time Password Authentication In Android Apps, Siqi Ma, Runhan Feng, Juanru Li, Yang Liu, Surya Nepal, Elisa Bertino, Robert H. Deng, Zhuo Ma, Sanjay Jha
Research Collection School Of Computing and Information Systems
A great quantity of user passwords nowadays has been leaked through security breaches of user accounts. To enhance the security of the Password Authentication Protocol (PAP) in such circumstance, Android app developers often implement a complementary One-Time Password (OTP) authentication by utilizing the short message service (SMS). Unfortunately, SMS is not specially designed as a secure service and thus an SMS One-Time Password is vulnerable to many attacks. To check whether a wide variety of currently used SMS OTP authentication protocols in Android apps are properly implemented, this paper presents an empirical study against them. We first derive a set …
The Dynamic Impacts Of Online Healthcare Community On Physician Altruism: A Hidden Markov Model, Kai Luo, Qiu-Hong Wang, Hock Hai Teo
The Dynamic Impacts Of Online Healthcare Community On Physician Altruism: A Hidden Markov Model, Kai Luo, Qiu-Hong Wang, Hock Hai Teo
Research Collection School Of Computing and Information Systems
Physician altruism is not only a key foundation of modern medical professionalism, but also a critical component in the theoretical health economics study. There is considerable interest in understanding the impacts of contemporary healthcare technology on physician altruism. In this paper, we investigate the dynamic influence of multiple incentive mechanisms developed by an online healthcare community (OHC) on physician altruism. We model physician altruism as the degree of tendency to benefit the patients at the cost of oneself and focus on the incentive mechanisms that give physicians social and economic returns. The dynamics of physician altruism is characterized via a …
The Information Disclosure Trilemma: Privacy, Attribution And Dependency, Ping Fan Ke
The Information Disclosure Trilemma: Privacy, Attribution And Dependency, Ping Fan Ke
Research Collection School Of Computing and Information Systems
Information disclosure has been an important mechanism to increase transparency and welfare in various contexts, from rating a restaurant to whistleblowing the wrongdoing of government agencies. Yet, the author often needs to be sacrificed during information disclosure process – an anonymous disclosure will forgo the reputation and compensation whereas an identifiable disclosure will face the threat of retaliation. On the other hand, the adoption of privacy-enhancing technologies (PETs) lessens the tradeoff between privacy and attribution while introducing dependency and potential threats. This study will develop the desirable design principles and possible threats of an information disclosure system, and discuss how …
Identifying Regional Trends In Avatar Customization, Peter Mawhorter, Sercan Sengun, Haewoon Kwak, D. Fox Harrell
Identifying Regional Trends In Avatar Customization, Peter Mawhorter, Sercan Sengun, Haewoon Kwak, D. Fox Harrell
Research Collection School Of Computing and Information Systems
Since virtual identities such as social media profiles and avatars have become a common venue for self-expression, it has become important to consider the ways in which existing systems embed the values of their designers. In order to design virtual identity systems that reflect the needs and preferences of diverse users, understanding how the virtual identity construction differs between groups is important. This paper presents a new methodology that leverages deep learning and differential clustering for comparative analysis of profile images, with a case study of almost 100 000 avatars from a large online community using a popular avatar creation …
An Iot-Driven Smart Cafe Solution For Human Traffic Management, Maruthi Prithivirajan, Kyong Jin Shim
An Iot-Driven Smart Cafe Solution For Human Traffic Management, Maruthi Prithivirajan, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
In this study, we present an IoT-driven solution for human traffic management in a corporate cafe. Using IoT sensors, our system monitors human traffic in a physical cafe located at a large international corporation located in Singapore. The backend system analyzes the streaming data from the sensors and provides insights useful to the cafe visitors as well as the cafe manager.
Harmony Search Algorithm For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-Chia Liang, Vanny Minanda, Aldy Gunawan, Angela Hsiang-Ling Chen
Harmony Search Algorithm For Time-Dependent Vehicle Routing Problem With Time Windows, Yun-Chia Liang, Vanny Minanda, Aldy Gunawan, Angela Hsiang-Ling Chen
Research Collection School Of Computing and Information Systems
Vehicle Routing Problem (VRP) is a combinatorial problem where a certain set of nodes must be visited within a certain amount of time as well as the vehicle’s capacity. There are numerous variants of VRP such as VRP with time windows, where each node has opening and closing time, therefore, the visiting time must be during that interval. Another variant takes time-dependent constraint into account. This variant fits real-world scenarios, where at different period of time, the speed on the road varies depending on the traffic congestion. In this study, three objectives – total traveling time, total traveling distance, and …
A Mathematical Programming Model For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiwan, Aldy Gunawan, Audrey Tedja Widjaja
A Mathematical Programming Model For The Green Mixed Fleet Vehicle Routing Problem With Realistic Energy Consumption And Partial Recharges, Vincent F. Yu, Panca Jodiwan, Aldy Gunawan, Audrey Tedja Widjaja
Research Collection School Of Computing and Information Systems
A green mixed fleet vehicle routing with realistic energy consumption and partial recharges problem (GMFVRP-REC-PR) is addressed in this paper. This problem involves a fixed number of electric vehicles and internal combustion vehicles to serve a set of customers. The realistic energy consumption which depends on several variables is utilized to calculate the electricity consumption of an electric vehicle and fuel consumption of an internal combustion vehicle. Partial recharging policy is included into the problem to represent the real life scenario. The objective of this problem is to minimize the total travelled distance and the total emission produced by internal …
Appmod: Helping Older Adults Manage Mobile Security With Online Social Help, Zhiyuan Wan, Lingfeng Bao, Debin Gao, Eran Toch, Xin Xia, Tamir Mendel, David Lo
Appmod: Helping Older Adults Manage Mobile Security With Online Social Help, Zhiyuan Wan, Lingfeng Bao, Debin Gao, Eran Toch, Xin Xia, Tamir Mendel, David Lo
Research Collection School Of Computing and Information Systems
The rapid adoption of Smartphone devices has caused increasing security and privacy risks and breaches. Catching up with ever-evolving contemporary smartphone technology challenges leads older adults (aged 50+) to reduce or to abandon their use of mobile technology. To tackle this problem, we present AppMoD, a community-based approach that allows delegation of security and privacy decisions a trusted social connection, such as a family member or a close friend. The trusted social connection can assist in the appropriate decision or make it on behalf of the user. We implement the approach as an Android app and describe the results of …
Smu Teaching Bank: Case Study Of A Multiyear Development Project Utilizing Student Resources, Alan Megargel, Terence P. C. Fan, Venky Shankararaman
Smu Teaching Bank: Case Study Of A Multiyear Development Project Utilizing Student Resources, Alan Megargel, Terence P. C. Fan, Venky Shankararaman
Research Collection School Of Computing and Information Systems
A domain refers to a business sector such as banking, healthcare, insurance, manufacturing etc. For an IS student, it is imperative that the domain knowledge includes a comprehension and understanding of business processes, technology and data related to the chosen domain. For example, when learning the retail banking domain, an IS student must have an understanding of the transactions concerned with retail banking such as fund transfers and loan repayments. The student must also gain a strong foothold in transaction fulfilment processes, the various application services that are used, the data that is transferred, etc. Teaching domain knowledge is very …
Treecaps: Tree-Structured Capsule Networks For Program Source Code Processing, Vinoj Jayasundara, Duy Quoc Nghi Bui, Lingxiao Jiang, David Lo
Treecaps: Tree-Structured Capsule Networks For Program Source Code Processing, Vinoj Jayasundara, Duy Quoc Nghi Bui, Lingxiao Jiang, David Lo
Research Collection School Of Computing and Information Systems
Program comprehension is a fundamental task in software development and maintenance processes. Software developers often need to understand a large amount of existing code before they can develop new features or fix bugs in existing programs. Being able to process programming language code automatically and provide summaries of code functionality accurately can significantly help developers to reduce time spent in code navigation and understanding, and thus increase productivity. Different from natural language articles, source code in programming languages often follows rigid syntactical structures and there can exist dependencies among code elements that are located far away from each other through …
Online Content Consumption: Social Endorsements, Observational Learning And Word-Of-Mouth, Qian Tang, Tingting Song, Liangfei Qiu, Ashish Agarwal
Online Content Consumption: Social Endorsements, Observational Learning And Word-Of-Mouth, Qian Tang, Tingting Song, Liangfei Qiu, Ashish Agarwal
Research Collection School Of Computing and Information Systems
The consumption of online content can occur through observational learning (OL) whereby consumers follow previous consumers’ choices or social endorsement (SE) wherein consumers receive content sharing from their social ties. As users consume content, they also generate post-consumption word-of-mouth (WOM) signals. OL, SE and WOM together shape the diffusion of the content. This study examines the drivers of SE and the effect of SE on content consumption and post-consumption WOM. In particular, we compare SE with OL. Using a random sample of 8,945 new videos posted on YouTube, we collected a multi-platform dataset consisting of data on video consumption and …