Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8588)
- Computer Sciences (8571)
- Databases and Information Systems (3465)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1728)
-
- Information Security (1068)
- Numerical Analysis and Scientific Computing (1024)
- Engineering (979)
- Graphics and Human Computer Interfaces (936)
- Social and Behavioral Sciences (734)
- Business (688)
- Computer Engineering (512)
- Theory and Algorithms (493)
- Operations Research, Systems Engineering and Industrial Engineering (439)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (310)
- Social Media (248)
- Public Affairs, Public Policy and Public Administration (227)
- Transportation (204)
- Medicine and Health Sciences (189)
- Education (180)
- Management Information Systems (178)
- Data Storage Systems (176)
- E-Commerce (151)
- International and Area Studies (125)
- Asian Studies (124)
- Digital Communications and Networking (123)
- Technology and Innovation (114)
- Health Information Technology (113)
- Keyword
-
- Machine learning (125)
- Deep learning (124)
- Social media (80)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Data mining (65)
- Privacy (65)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (55)
- Optimization (55)
- Security (54)
- Singapore (52)
- Visualization (52)
- Task analysis (50)
- Twitter (50)
- Neural networks (49)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Anomaly detection (47)
- Large Language Models (47)
- Feature extraction (46)
- Collaboration (45)
- Blockchain (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 3631 - 3660 of 8762
Full-Text Articles in Entire DC Network
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 …
Computing Maximum And Minimum With Privacy Preservation And Flexible Access Control, Wenxiu Ding, Zheng Yan, Xinren Qian, Robert H. Deng
Computing Maximum And Minimum With Privacy Preservation And Flexible Access Control, Wenxiu Ding, Zheng Yan, Xinren Qian, Robert H. Deng
Research Collection School Of Computing and Information Systems
With the fast development of Internet of Things, huge volume of data is being collected from various sensors and devices, aggregated at gateways, and processed in the cloud. Due to privacy concern, data are usually encrypted before being outsourced to the cloud. However, encryption seriously impedes both computation over the data and sharing of the computation results. Computing maximum and minimum among a data set are two of the most basic operations in machine learning and data mining algorithms. In this paper, we study how to compute maximum and minimum over encrypted data and control the access to the computation …
Pieces Of Contextual Information Suitable For Predicting Co-Changes? An Empirical Study, Igor Scaliante Wiese, Rodrigo Takashi Kuroda, Igor Steinmacher, Gustavo A. Oliva, Reginaldo Ré, Christoph Treude, Marco Aurélio Gerosa
Pieces Of Contextual Information Suitable For Predicting Co-Changes? An Empirical Study, Igor Scaliante Wiese, Rodrigo Takashi Kuroda, Igor Steinmacher, Gustavo A. Oliva, Reginaldo Ré, Christoph Treude, Marco Aurélio Gerosa
Research Collection School Of Computing and Information Systems
Models that predict software artifact co-changes have been proposed to assist developers in altering a software system and they often rely on coupling. However, developers have not yet widely adopted these approaches, presumably because of the high number of false recommendations. In this work, we conjecture that the contextual information related to software changes, which is collected from issues (e.g., issue type and reporter), developers’ communication (e.g., number of issue comments, issue discussants and words in the discussion), and commit metadata (e.g., number of lines added, removed, and modified), improves the accuracy of co-change prediction. We built customized prediction models …
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 …
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.
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 …
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, …
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 …
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 …
Punctuation Prediction For Vietnamese Texts Using Conditional Random Fields, Hong Quang Pham, Binh T. Nguyen, Nguyen Viet Cuong
Punctuation Prediction For Vietnamese Texts Using Conditional Random Fields, Hong Quang Pham, Binh T. Nguyen, Nguyen Viet Cuong
Research Collection School Of Computing and Information Systems
We investigate the punctuation prediction for the Vietnamese language. This problem is crucial as it can be used to add suitable punctuation marks to machine-transcribed speeches, which usually do not have such information. Similar to previous works for English and Chinese languages, we formulate this task as a sequence labeling problem. After that, we apply the conditional random field model for solving the problem and propose a set of appropriate features that are useful for prediction. Moreover, we build two corpora from Vietnamese online news and movie subtitles and perform extensive experiments on these data. Finally, we ask four volunteers …
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.
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 …
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 …
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 …
Twenty Years Of Open Source Software: From Skepticism To Mainstream, Gregorio Robles, Igor Steinmacher, Paul Adams, Christoph Treude
Twenty Years Of Open Source Software: From Skepticism To Mainstream, Gregorio Robles, Igor Steinmacher, Paul Adams, Christoph Treude
Research Collection School Of Computing and Information Systems
Open source software (OSS) has conquered the software world. You can see it nearly everywhere, from Internet infrastructure to mobile phones to the desktop. In addition to that, although many OSS practices were viewed with skepticism 20 years ago, several have become mainstream in software engineering today: from development tools such as Git to practices such as modern code reviews.
Efficient Meta Learning Via Minibatch Proximal Update, Pan Zhou, Xiao-Tong Yuan, Huan Xu, Shuicheng Yan, Jiashi Feng
Efficient Meta Learning Via Minibatch Proximal Update, Pan Zhou, Xiao-Tong Yuan, Huan Xu, Shuicheng Yan, Jiashi Feng
Research Collection School Of Computing and Information Systems
We address the problem of meta-learning which learns a prior over hypothesis from a sample of meta-training tasks for fast adaptation on meta-testing tasks. A particularly simple yet successful paradigm for this research is model-agnostic meta-learning (MAML). Implementation and analysis of MAML, however, can be tricky; first-order approximation is usually adopted to avoid directly computing Hessian matrix but as a result the convergence and generalization guarantees remain largely mysterious for MAML. To remedy this deficiency, in this paper we propose a minibatch proximal update based meta-learning approach for learning to efficient hypothesis transfer. The principle is to learn a prior …
Strongly Secure Authenticated Key Exchange From Supersingular Isogenies, Xiu Xu, Haiyang Xue, Kunpeng Wang, Ho Man Au, Song Tian
Strongly Secure Authenticated Key Exchange From Supersingular Isogenies, Xiu Xu, Haiyang Xue, Kunpeng Wang, Ho Man Au, Song Tian
Research Collection School Of Computing and Information Systems
This paper aims to address the open problem, namely, to find new techniques to design and prove security of supersingular isogeny-based authenticated key exchange (AKE) protocols against the widest possible adversarial attacks, raised by Galbraith in 2018. Concretely, we present two AKEs based on a double-key PKE in the supersingular isogeny setting secure in the sense of CK+, one of the strongest security models for AKE. Our contributions are summarised as follows. Firstly, we propose a strong OW-CPA secure PKE, 2PKEsidh, based on SI-DDH assumption. By applying modified Fujisaki-Okamoto transformation, we obtain a [OW-CCA, OW-CPA] secure KEM, 2KEMsidh. Secondly, we …
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 …
Influence, Information And Team Outcomes In Large Scale Software Development, Subhajit Datta
Influence, Information And Team Outcomes In Large Scale Software Development, Subhajit Datta
Research Collection School Of Computing and Information Systems
It is widely perceived that the egalitarian ecosystems of large scale open source software development foster effective team outcomes. In this study, we question this conventional wisdom by examining whether and how the centralization of information and influence in a software development team relate to the quality of the team's work products. Analyzing data from more than a hundred real world projects that include development activities over close to a decade, involving 2000+ developers, who collectively resolve more than two hundred thousand defects through discussions covering more than six hundred thousand comments, we arrive at statistically significant evidence indicating that …
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 …
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 …
Tracking Political Events In Social Media: A Case Study Of Hong Kong Protests, Haodi Qi, Hanyu Jiang, Wende Bu, Chengzi Zhang, Kyong Jin Shim
Tracking Political Events In Social Media: A Case Study Of Hong Kong Protests, Haodi Qi, Hanyu Jiang, Wende Bu, Chengzi Zhang, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
In this study, we analyze social conversations about Hong Kong Protests, a series of events that were widely seen and debated in social media in 2019. Our system collects data from Twitter and Reddit using their APIs. It performs sentiment analysis, and the analysis results show changes in public sentiment around major events. Social network analysis reveals influencers - users that are in the center of social conversations. Our interactive Tableau dashboard allows the user to easily monitor live social conversations about Hong Kong protests.
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 …
Do My Students Understand? Automated Identification Of Doubts From Informal Reflections, Siaw Ling Lo, Kar Way Tan, Eng Lieh Ouh
Do My Students Understand? Automated Identification Of Doubts From Informal Reflections, Siaw Ling Lo, Kar Way Tan, Eng Lieh Ouh
Research Collection School Of Computing and Information Systems
Traditionally teaching is usually one directional where the instructor imparts knowledge and there is minimal interaction between learners and instructor. With the focus on learner-centred pedagogy, it can be a challenge to provide timely and relevant guidance to individual learners according to their levels of understanding. One of the options available is to collect reflections from learners after each lesson to extract relevant and high-value feedback so that doubts or questions can be addressed in a timely manner. In this paper, we derived an approach to automate the identification of doubts from the informal reflections through features analysis and machine …
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 …
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 …
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 …