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

Physical Sciences and Mathematics Commons™

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

Computer Sciences

2019

Series

Institution
Keyword
Publication
File Type

Articles 31 - 60 of 1234

Full-Text Articles in Physical Sciences and Mathematics

Joule's 19th Century Energy Conservation Meta-Law And The 20th Century Physics (Quantum Mechanics And General Relativity): 21st Century Analysis, Vladik Kreinovich, Olga Kosheleva Dec 2019

Joule's 19th Century Energy Conservation Meta-Law And The 20th Century Physics (Quantum Mechanics And General Relativity): 21st Century Analysis, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

Joule's Energy Conservation Law was the first "meta-law": a general principle that all physical equations must satisfy. It has led to many important and useful physical discoveries. However, a recent analysis seems to indicate that this meta-law is inconsistent with other principles -- such as the existence of free will. We show that this conclusion about inconsistency is based on a seemingly reasonable -- but simplified -- analysis of the situation. We also show that a more detailed mathematical and physical analysis of the situation reveals that not only Joule's principle remains true -- it is actually strengthened: it is …

Go to article

Which Distributions (Or Families Of Distributions) Best Represent Interval Uncertainty: Case Of Permutation-Invariant Criteria, Michael Beer, Julio Urenda, Olga Kosheleva, Vladik Kreinovich Dec 2019

Which Distributions (Or Families Of Distributions) Best Represent Interval Uncertainty: Case Of Permutation-Invariant Criteria, Michael Beer, Julio Urenda, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In many practical situations, we only know the interval containing the quantity of interest, we have no information about the probability of different values within this interval. In contrast to the cases when we know the distributions and can thus use Monte-Carlo simulations, processing such interval uncertainty is difficult -- crudely speaking, because we need to try all possible distributions on this interval. Sometimes, the problem can be simplified: namely, it is possible to select a single distribution (or a small family of distributions) whose analysis provides a good understanding of the situation. The most known case is when we …

Go to article

An Ai Approach To Measuring Financial Risk, Lining Yu, Wolfgang Karl Hardle, Lukas Borke, Thijs Benschop Dec 2019

An Ai Approach To Measuring Financial Risk, Lining Yu, Wolfgang Karl Hardle, Lukas Borke, Thijs Benschop

Sim Kee Boon Institute for Financial Economics

AI artificial intelligence brings about new quantitative techniques to assess the state of an economy. Here, we describe a new measure for systemic risk: the Financial Risk Meter (FRM). This measure is based on the penalization parameter (λ" role="presentation" style="box-sizing: border-box; display: inline; font-style: normal; font-weight: normal; line-height: normal; font-size: 18px; text-indent: 0px; text-align: left; text-transform: none; letter-spacing: normal; word-spacing: normal; overflow-wrap: normal; white-space: nowrap; float: none; direction: ltr; max-width: none; max-height: none; min-width: 0px; min-height: 0px; border: 0px; padding: 0px; margin: 0px; position: relative;">λλ) of a linear quantile lasso regression. The FRM is calculated by taking the average …

Go to article

Feasibility And Acceptability Of A Rural, Pragmatic, Telemedicine‐ Delivered Healthy Lifestyle Programme, John A. Batsis, Auden C. Mcclure, Aaron B. Weintraub, David F. Kotz, Sivan Rotenberg, Summer B. Cook, Diane Gilbert-Diamond, Kevin Curtis, Courtney J. Stevens, Diane Sette, Richard I. Rothstein Dec 2019

Feasibility And Acceptability Of A Rural, Pragmatic, Telemedicine‐ Delivered Healthy Lifestyle Programme, John A. Batsis, Auden C. Mcclure, Aaron B. Weintraub, David F. Kotz, Sivan Rotenberg, Summer B. Cook, Diane Gilbert-Diamond, Kevin Curtis, Courtney J. Stevens, Diane Sette, Richard I. Rothstein

Dartmouth Scholarship

Background: The public health crisis of obesity leads to increasing morbidity that are even more profound in certain populations such as rural adults. Live, two‐way video‐conferencing is a modality that can potentially surmount geographic barriers and staffing shortages. Methods: Patients from the Dartmouth‐Hitchcock Weight and Wellness Center were recruited into a pragmatic, single‐arm, nonrandomized study of a remotely delivered 16‐week evidence‐based healthy lifestyle programme. Patients were provided hardware and appropriate software allowing for remote participation in all sessions, outside of the clinic setting. Our primary outcomes were feasibility and acceptability of the telemedicine intervention, as well as potential effectiveness on …

Go to article

Exploring The State-Of-Receptivity For Mhealth Interventions, Florian Künzler, Varun Mishra, Jan-Niklas Kramer, David Kotz, Elgar Fleisch, Tobias Kowatsch Dec 2019

Exploring The State-Of-Receptivity For Mhealth Interventions, Florian Künzler, Varun Mishra, Jan-Niklas Kramer, David Kotz, Elgar Fleisch, Tobias Kowatsch

Dartmouth Scholarship

Recent advancements in sensing techniques for mHealth applications have led to successful development and deployments of several mHealth intervention designs, including Just-In-Time Adaptive Interventions (JITAI). JITAIs show great potential because they aim to provide the right type and amount of support, at the right time. Timing the delivery of a JITAI such as the user is receptive and available to engage with the intervention is crucial for a JITAI to succeed. Although previous research has extensively explored the role of context in users’ responsiveness towards generic phone notiications, it has not been thoroughly explored for actual mHealth interventions. In this …

Go to article

Why Gamma Distribution Of Seismic Inter-Event Times: A Theoretical Explanation, Laxman Bokati, Aaron A. Velasco, Vladik Kreinovich Dec 2019

Why Gamma Distribution Of Seismic Inter-Event Times: A Theoretical Explanation, Laxman Bokati, Aaron A. Velasco, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that the distribution of seismic inter-event times is well described by the Gamma distribution. Recently, this fact has been used to successfully predict major seismic events. In this paper, we explain that the Gamma distribution of seismic inter-event times can be naturally derived from the first principles.

Go to article

Rating News Claims: Feature Selection And Evaluation, Izzat Alsmadi, Michael J. O'Brien Dec 2019

Rating News Claims: Feature Selection And Evaluation, Izzat Alsmadi, Michael J. O'Brien

Computer Science Faculty Publications

News claims that travel the Internet and online social networks (OSNs) originate from different, sometimes unknown sources, which raises issues related to the credibility of those claims and the drivers behind them. Fact-checking websites such as Snopes, FactCheck, and Emergent use human evaluators to investigate and label news claims, but the process is labor- and time-intensive. Driven by the need to use data analytics and algorithms in assessing the credibility of news claims, we focus on what can be generalized about evaluating human-labeled claims. We developed tools to extract claims from Snopes and Emergent and used public datasets collected by …

Go to article

Overlap Matrix Completion For Predicting Drug-Associated Indications, Menhyun Yang, Huimin Luo, Yaohang Li, Fang-Xiang Wu, Jianxin Wang Dec 2019

Overlap Matrix Completion For Predicting Drug-Associated Indications, Menhyun Yang, Huimin Luo, Yaohang Li, Fang-Xiang Wu, Jianxin Wang

Computer Science Faculty Publications

Identification of potential drug-associated indications is critical for either approved or novel drugs in drug repositioning. Current computational methods based on drug similarity and disease similarity have been developed to predict drug-disease associations. When more reliable drug- or disease-related information becomes available and is integrated, the prediction precision can be continuously improved. However, it is a challenging problem to effectively incorporate multiple types of prior information, representing different characteristics of drugs and diseases, to identify promising drug-disease associations. In this study, we propose an overlap matrix completion (OMC) for bilayer networks (OMC2) and tri-layer networks (OMC3) to predict potential drug-associated …

Go to article

Why Spiking Neural Networks Are Efficient: A Theorem, Michael Beer, Julio Urenda, Olga Kosheleva, Vladik Kreinovich Dec 2019

Why Spiking Neural Networks Are Efficient: A Theorem, Michael Beer, Julio Urenda, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Current artificial neural networks are very successful in many machine learning applications, but in some cases they still lag behind human abilities. To improve their performance, a natural idea is to simulate features of biological neurons which are not yet implemented in machine learning. One of such features is the fact that in biological neural networks, signals are represented by a train of spikes. Researchers have tried adding this spikiness to machine learning and indeed got very good results, especially when processing time series (and, more generally, spatio-temporal data). In this paper, we provide a theoretical explanation for this empirical …

Go to article

Automating Change-Level Self-Admitted Technical Debt Determination, Meng Yan, Xin Xia, Emad Shihab, David Lo, Jianwei Yin, Xiaohu Yang Dec 2019

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 …

Go to article

Improved Generalisation Bounds For Deep Learning Through L∞ Covering Numbers, Antoine Ledent, Yunwen Lei, Marius Kloft Dec 2019

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 …

Go to article

Iomt Malware Detection Approaches: Analysis And Research Challenges, Mohammad Wazid, Ashok Kumar Das, Joel J.P.C. Rodrigues, Sachin Shetty, Youngho Park Dec 2019

Iomt Malware Detection Approaches: Analysis And Research Challenges, Mohammad Wazid, Ashok Kumar Das, Joel J.P.C. Rodrigues, Sachin Shetty, Youngho Park

VMASC Publications

The advancement in Information and Communications Technology (ICT) has changed the entire paradigm of computing. Because of such advancement, we have new types of computing and communication environments, for example, Internet of Things (IoT) that is a collection of smart IoT devices. The Internet of Medical Things (IoMT) is a specific type of IoT communication environment which deals with communication through the smart healthcare (medical) devices. Though IoT communication environment facilitates and supports our day-to-day activities, but at the same time it has also certain drawbacks as it suffers from several security and privacy issues, such as replay, man-in-the-middle, impersonation, …

Go to article

Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao Dec 2019

Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

Sparse data is known to pose challenges to cluster analysis, as the similarity between data tends to be ill-posed in the high-dimensional Hilbert space. Solutions in the literature typically extend either k-means or spectral clustering with additional steps on representation learning and/or feature weighting. However, adding these usually introduces new parameters and increases computational cost, thus inevitably lowering the robustness of these algorithms when handling massive ill-represented data. To alleviate these issues, this paper presents a class of self-organizing neural networks, called the salience-aware adaptive resonance theory (SA-ART) model. SA-ART extends Fuzzy ART with measures for cluster-wise salient feature modeling. …

Go to article

Identifying Regional Trends In Avatar Customization, Peter Mawhorter, Sercan Sengun, Haewoon Kwak, D. Fox Harrell Dec 2019

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 …

Go to article

Influence, Information And Team Outcomes In Large Scale Software Development, Subhajit Datta Dec 2019

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 …

Go to article

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 Dec 2019

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 …

Go to article

Quantum Consensus, Jorden Seet, Paul Griffin Dec 2019

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 …

Go to article

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 Dec 2019

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.

Go to article

A Unified Variance-Reduced Accelerated Gradient Method For Convex Optimization, Guanghui Lan, Zhize Li, Yi Zhou Dec 2019

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 …

Go to article

Ssrgd: Simple Stochastic Recursive Gradient Descent For Escaping Saddle Points, Zhize Li Dec 2019

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 …

Go to article

Strongly Leakage Resilient Authenticated Key Exchange, Revisited, Guomin Yang, Rongmao Chen, Yi Mu, Willy Susilo, Guo Fuchun, Jie Li Dec 2019

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 …

Go to article

Blockchain In Libraries, Michael Meth Dec 2019

Blockchain In Libraries, Michael Meth

Faculty Research, Scholarly, and Creative Activity

This issue of Library Technology Reports (vol. 55, no. 8), “Blockchain in Libraries,” examines the application of blockchain in libraries. Blockchain technology has the ability to transform how libraries provide services and organize information. To date, most of these applications are still in the conceptual stage. However, sooner or later, development and implementation will follow. This report is intended to provide a primer on the technology and some thought starters. In chapter 2, the concept of blockchain is explained. Chapter 3 provides eight thought and conversation starters that look at how blockchain could be applied in libraries. Chapter 4 looks …

Go to article

Testing Isomorphism Of Graded Algebras, Peter A. Brooksbank, James B. Wilson, Eamonn A. O'Brien Dec 2019

Testing Isomorphism Of Graded Algebras, Peter A. Brooksbank, James B. Wilson, Eamonn A. O'Brien

Faculty Journal Articles

We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that often dramatically improve the performance of the algorithm and report on an implementation in Magma.

Go to article

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 Dec 2019

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 …

Go to article

Punctuation Prediction For Vietnamese Texts Using Conditional Random Fields, Hong Quang Pham, Binh T. Nguyen, Nguyen Viet Cuong Dec 2019

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 …

Go to article

Seer: An Explainable Deep Learning Midi-Based Hybrid Song Recommender System, Khalil Damak, Olfa Nasraoui Dec 2019

Seer: An Explainable Deep Learning Midi-Based Hybrid Song Recommender System, Khalil Damak, Olfa Nasraoui

Faculty Scholarship

State of the art music recommender systems mainly rely on either matrix factorization-based collaborative filtering approaches or deep learning architectures. Deep learning models usually use metadata for content-based filtering or predict the next user interaction by learning from temporal sequences of user actions. Despite advances in deep learning for song recommendation, none has taken advantage of the sequential nature of songs by learning sequence models that are based on content. Aside from the importance of prediction accuracy, other significant aspects are important, such as explainability and solving the cold start problem. In this work, we propose a hybrid deep learning …

Go to article

Learning To Self-Train For Semi-Supervised Few-Shot Classification, Xinzhe Li, Qianru Sun, Yaoyao Liu, Shibao Zheng, Qin Zhou, Tat-Seng Chua, Bernt Schiele Dec 2019

Learning To Self-Train For Semi-Supervised Few-Shot Classification, Xinzhe Li, Qianru Sun, Yaoyao Liu, Shibao Zheng, Qin Zhou, Tat-Seng Chua, Bernt Schiele

Research Collection School Of Computing and Information Systems

Few-shot classification (FSC) is challenging due to the scarcity of labeled training data (e.g. only one labeled data point per class). Meta-learning has shown to achieve promising results by learning to initialize a classification model for FSC. In this paper we propose a novel semi-supervised meta-learning method called learning to self-train (LST) that leverages unlabeled data and specifically meta-learns how to cherry-pick and label such unsupervised data to further improve performance. To this end, we train the LST model through a large number of semi-supervised few-shot tasks. On each task, we train a few-shot model to predict pseudo labels for …

Go to article

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 Dec 2019

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 …

Go to article

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 Dec 2019

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 …

Go to article

Examining The Theoretical Mechanisms Underlying Health Information Exchange Impact On Healthcare Outcomes: A Physician Agency Perspective, Fang Zhou, Qiu-Hong Wang, Hock Hai Teo Dec 2019

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 …

Go to article

First Prev Next Last