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

Physical Sciences and Mathematics Commons

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

Research Collection School Of Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 1 - 30 of 3288

Full-Text Articles in Physical Sciences and Mathematics

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

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

Research Collection School Of Information Systems

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


Experimental Comparison Of Features And Classifiers For Android Malware Detection, Lwin Khin Shar, Biniam Fisseha Demissie, Mariano Ceccato, Wei Minn Oct 2020

Experimental Comparison Of Features And Classifiers For Android Malware Detection, Lwin Khin Shar, Biniam Fisseha Demissie, Mariano Ceccato, Wei Minn

Research Collection School Of Information Systems

Android platform has dominated the smart phone market for years now and, consequently, gained a lot of attention from attackers. Malicious apps (malware) pose a serious threat to the security and privacy of Android smart phone users. Available approaches to detect mobile malware based on machine learning rely on features extracted with static analysis or dynamic analysis techniques. Dif- ferent types of machine learning classi ers (such as support vector machine and random forest) deep learning classi ers (based on deep neural networks) are then trained on extracted features, to produce models that can be used to detect mobile malware ...


Mg2vec: Learning Relationship-Preserving Heterogeneous Graph Representations Via Metagraph Embedding, Wentao Zhang, Yuan Fang, Zemin Liu, Min Wu, Xinming Zhang May 2020

Mg2vec: Learning Relationship-Preserving Heterogeneous Graph Representations Via Metagraph Embedding, Wentao Zhang, Yuan Fang, Zemin Liu, Min Wu, Xinming Zhang

Research Collection School Of Information Systems

Given that heterogeneous information networks (HIN) encompass nodes and edges belonging to different semantic types, they can model complex data in real-world scenarios. Thus, HIN embedding has received increasing attention, which aims to learn node representations in a low-dimensional space, in order to preserve the structural and semantic information on the HIN. In this regard, metagraphs, which model common and recurring patterns on HINs, emerge as a powerful tool to capture semantic-rich and often latent relationships on HINs. Although metagraphs have been employed to address several specific data mining tasks, they have not been thoroughly explored for the more general ...


Early Detection Of Mild Cognitive Impairment With In-Home Sensors To Monitor Behavior Patterns In Community-Dwelling Senior Citizens In Singapore: Cross-Sectional Feasibility Study, Iris Rawtaer, Rathi Mahendran, Ee Heok Kua, Hwee-Pink Tan, Hwee Xian Tan, Tih-Shih Lee, Tze Pin Ng May 2020

Early Detection Of Mild Cognitive Impairment With In-Home Sensors To Monitor Behavior Patterns In Community-Dwelling Senior Citizens In Singapore: Cross-Sectional Feasibility Study, Iris Rawtaer, Rathi Mahendran, Ee Heok Kua, Hwee-Pink Tan, Hwee Xian Tan, Tih-Shih Lee, Tze Pin Ng

Research Collection School Of Information Systems

Background: Dementia is a global epidemic and incurs substantial burden on the affected families and the health care system. A window of opportunity for intervention is the predementia stage known as mild cognitive impairment (MCI). Individuals often present to services late in the course of their disease and more needs to be done for early detection; sensor technology is a potential method for detection.Objective: The aim of this cross-sectional study was to establish the feasibility and acceptability of utilizing sensors in the homes of senior citizens to detect changes in behaviors unobtrusively.Methods: We recruited 59 community-dwelling seniors (aged ...


Symbolic Verification Of Message Passing Interface Programs, Hengbiao Yu, Zhenbang Chen, Xianjin Fu, Ji Wang, Zhendong Su, Jun Sun, Chun Huang, Wei Dong May 2020

Symbolic Verification Of Message Passing Interface Programs, Hengbiao Yu, Zhenbang Chen, Xianjin Fu, Ji Wang, Zhendong Su, Jun Sun, Chun Huang, Wei Dong

Research Collection School Of Information Systems

Message passing is the standard paradigm of programming in high-performance computing. However, verifying Message Passing Interface (MPI) programs is challenging, due to the complex program features (such as non-determinism and non-blocking operations). In this work, we present MPI symbolic verifier (MPI-SV), the first symbolic execution based tool for automatically verifying MPI programs with non-blocking operations. MPI-SV combines symbolic execution and model checking in a synergistic way to tackle the challenges in MPI program verification. The synergy improves the scalability and enlarges the scope of verifiable properties. We have implemented MPI-SV and evaluated it with 111 real-world MPI verification tasks. The ...


Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu May 2020

Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu

Research Collection School Of Information Systems

Learning graphs from data automatically have shown encouraging performance on clustering and semisupervised learning tasks. However, real data are often corrupted, which may cause the learned graph to be inexact or unreliable. In this paper, we propose a novel robust graph learning scheme to learn reliable graphs from the real-world noisy data by adaptively removing noise and errors in the raw data. We show that our proposed model can also be viewed as a robust version of manifold regularized robust principle component analysis (RPCA), where the quality of the graph plays a critical role. The proposed model is able to ...


A Cue Adaptive Decoder For Controllable Neural Response Generation, Weichao Wang, Shi Feng, Wei Gao, Daling Wang, Yifei Zhang Apr 2020

A Cue Adaptive Decoder For Controllable Neural Response Generation, Weichao Wang, Shi Feng, Wei Gao, Daling Wang, Yifei Zhang

Research Collection School Of Information Systems

In open-domain dialogue systems, dialogue cues such as emotion, persona, and emoji can be incorporated into conversation models for strengthening the semantic relevance of generated responses. Existing neural response generation models either incorporate dialogue cue into decoder’s initial state or embed the cue indiscriminately into the state of every generated word, which may cause the gradients of the embedded cue to vanish or disturb the semantic relevance of generated words during back propagation. In this paper, we propose a Cue Adaptive Decoder (CueAD) that aims to dynamically determine the involvement of a cue at each generation step in the ...


Recipegpt: Generative Pre-Training Based Cooking Recipe Generation And Evaluation System, Helena Huey Chong Lee, Ke Shu, Palakorn Achananuparp, Philips Kokoh Prasetyo, Yue Liu, Ee-Peng Lim, Lav R. Varshney Apr 2020

Recipegpt: Generative Pre-Training Based Cooking Recipe Generation And Evaluation System, Helena Huey Chong Lee, Ke Shu, Palakorn Achananuparp, Philips Kokoh Prasetyo, Yue Liu, Ee-Peng Lim, Lav R. Varshney

Research Collection School Of Information Systems

Interests in the automatic generation of cooking recipes have been growing steadily over the past few years thanks to a large amount of online cooking recipes. We present RecipeGPT, a novel online recipe generation and evaluation system. The system provides two modes of text generations: (1) instruction generation from given recipe title and ingredients; and (2) ingredient generation from recipe title and cooking instructions. Its back-end text generation module comprises a generative pre-trained language model GPT-2 fine-tuned on a large cooking recipe dataset. Moreover, the recipe evaluation module allows the users to conveniently inspect the quality of the generated recipe ...


Feature Agglomeration Networks For Single Stage Face Detection, Jialiang Zhang, Xiongwei Wu, Steven C. H. Hoi, Jianke Zhu Mar 2020

Feature Agglomeration Networks For Single Stage Face Detection, Jialiang Zhang, Xiongwei Wu, Steven C. H. Hoi, Jianke Zhu

Research Collection School Of Information Systems

Recent years have witnessed promising results of exploring deep convolutional neural network for face detection. Despite making remarkable progress, face detection in the wild remains challenging especially when detecting faces at vastly different scales and characteristics. In this paper, we propose a novel simple yet effective framework of “Feature Agglomeration Networks” (FANet) to build a new single-stage face detector, which not only achieves state-of-the-art performance but also runs efficiently. As inspired by Feature Pyramid Networks (FPN) (Lin et al., 2017), the key idea of our framework is to exploit inherent multi-scale features of a single convolutional neural network by aggregating ...


Automated Synthesis Of Local Time Requirement For Service Composition, Étienne André, Tian Huat Tan, Manman Chen, Shuang Liu, Jun Sun, Yang Liu, Jin Song Dong Mar 2020

Automated Synthesis Of Local Time Requirement For Service Composition, Étienne André, Tian Huat Tan, Manman Chen, Shuang Liu, Jun Sun, Yang Liu, Jin Song Dong

Research Collection School Of Information Systems

Service composition aims at achieving a business goal by composing existing service-based applications or components. The response time of a service is crucial, especially in time-critical business environments, which is often stated as a clause in service-level agreements between service providers and service users. To meet the guaranteed response time requirement of a composite service, it is important to select a feasible set of component services such that their response time will collectively satisfy the response time requirement of the composite service. In this work, we use the BPEL modeling language that aims at specifying Web services. We extend it ...


Space Efficient Revocable Ibe For Mobile Devices In Cloud Computing, Baodong Qin, Ximeng Liu, Zhuo Wei, Dong Zheng Mar 2020

Space Efficient Revocable Ibe For Mobile Devices In Cloud Computing, Baodong Qin, Ximeng Liu, Zhuo Wei, Dong Zheng

Research Collection School Of Information Systems

No abstract provided.


Securing Bring-Your-Own-Device (Byod) Programming Exams, Oka Kurniawan, Norman Tiong Seng Lee, Christopher M. Poskitt Mar 2020

Securing Bring-Your-Own-Device (Byod) Programming Exams, Oka Kurniawan, Norman Tiong Seng Lee, Christopher M. Poskitt

Research Collection School Of Information Systems

Traditional pen and paper exams are inadequate for modern university programming courses as they are misaligned with pedagogies and learning objectives that target practical coding ability. Unfortunately, many institutions lack the resources or space to be able to run assessments in dedicated computer labs. This has motivated the development of bring-your-own-device (BYOD) exam formats, allowing students to program in a similar environment to how they learnt, but presenting instructors with significant additional challenges in preventing plagiarism and cheating. In this paper, we describe a BYOD exam solution based on lockdown browsers, software which temporarily turns students' laptops into secure workstations ...


W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meeralakshmi Radhakrishnan, Archan Misra, Rajesh Krishna Balan Mar 2020

W8-Scope: Fine-Grained, Practical Monitoring Of Weight Stack-Based Exercises, Meeralakshmi Radhakrishnan, Archan Misra, Rajesh Krishna Balan

Research Collection School Of Information Systems

Fine-grained, unobtrusive monitoring of gym exercises can help users track their own exercise routines and also provide corrective feedback. We propose W8-Scope, a system that uses a simple magnetic-cum-accelerometer sensor, mounted on the weight stack of gym exercise machines, to infer variousattributes of gym exercise behavior. More specifically, using multiple machine learning models, W8-Scope helps identify who is exercising, what exercise she is doing, how much weight she is lifting, and whether she is committing any common mistakes. Real world studies, conducted with 50 subjects performing 14 different exercises over 103 distinct sessions in two gyms, show that W8-Scope can ...


Detecting Fake News In Social Media: An Asia-Pacific Perspective, Meeyoung Cha, Wei Gao, Cheng-Te Li Mar 2020

Detecting Fake News In Social Media: An Asia-Pacific Perspective, Meeyoung Cha, Wei Gao, Cheng-Te Li

Research Collection School Of Information Systems

In March 2011, the catastrophic accident known as "The Fukushima Daiichi nuclear disaster" took place, initiated by the Tohoku earthquake and tsunami in Japan. The only nuclear accident to receive a Level-7 classification on the International Nuclear Event Scale since the Chernobyl nuclear power plant disaster in 1986, the Fukushima event triggered global concerns and rumors regarding radiation leaks. Among the false rumors was an image, which had been described as a map of radioactive discharge emanating into the Pacific Ocean, as illustrated in the accompanying figure. In fact, this figure, depicting the wave height of the tsunami that followed ...


Pokeme: Applying Context-Driven Notifications To Increase Worker Engagement In Mobile Crowd-Sourcing, Thivya Kandappu, Abhinav Mehrotra, Archan Misra, Mirco Musolesi, Shih-Fen Cheng, Lakmal Buddika Meegahapola Mar 2020

Pokeme: Applying Context-Driven Notifications To Increase Worker Engagement In Mobile Crowd-Sourcing, Thivya Kandappu, Abhinav Mehrotra, Archan Misra, Mirco Musolesi, Shih-Fen Cheng, Lakmal Buddika Meegahapola

Research Collection School Of Information Systems

In mobile crowd-sourcing systems, simply relying on people to opportunistically select and perform tasks typically leads to drawbacks such as low task acceptance/completion rates and undesirable spatial skews. In this paper, we utilize data from "Smart Campus", a campus-based mobile crowd-sourcing platform, to empirically study and discover whether and how various context-aware notification strategies can help overcome such drawbacks. We first study worker interactions, in the absence of any notifications, to discover some spatio-temporal properties of task acceptance and completion. Based on these insights, we then experimentally demonstrate the effectiveness of two novel, non-personal, context-driven notification strategies, comparing the ...


Dual-Dropout Graph Convolutional Network For Predicting Synthetic Lethality In Human Cancers, Ruichu Cai, Xuexin Chen, Yuan Fang, Min Wu, Yuexing Hao Mar 2020

Dual-Dropout Graph Convolutional Network For Predicting Synthetic Lethality In Human Cancers, Ruichu Cai, Xuexin Chen, Yuan Fang, Min Wu, Yuexing Hao

Research Collection School Of Information Systems

Motivation: Synthetic lethality (SL) is a promising form of gene interaction for cancer therapy, as it isable to identify specific genes to target at cancer cells without disrupting normal cells. As high-throughputwet-lab settings are often costly and face various challenges, computational approaches have become apractical complement. In particular, predicting SLs can be formulated as a link prediction task on a graphof interacting genes. Although matrix factorization techniques have been widely adopted in link prediction,they focus on mapping genes to latent representations in isolation, without aggregating information fromneighboring genes. Graph convolutional networks (GCN) can capture such neighborhood dependency ina graph ...


The Spatial Optimization And Evaluation Of The Economic, Ecological, And Social Value Of Urban Green Space In Shenzhen, Yuhan Yu, Wenting Zhang, Peihong Fu, Wei Huang, Keke Li, Kai Cao Mar 2020

The Spatial Optimization And Evaluation Of The Economic, Ecological, And Social Value Of Urban Green Space In Shenzhen, Yuhan Yu, Wenting Zhang, Peihong Fu, Wei Huang, Keke Li, Kai Cao

Research Collection School Of Information Systems

Urban green space (UGS) is important in urban systems, as it benefits economic development, ecological conservation, and living conditions. Many studies have evaluated the economic, ecological, and social value of UGS worldwide, and spatial optimization for UGS has been carried out to maximize its value. However, few studies have simultaneously examined these three values of UGS in one optimization system. To fill this gap, this study evaluated the economic value of UGS in terms of promoting housing prices, its ecological value through the relief of high land surface temperature (LST), and its social value through the provision of recreation spaces ...


Bounding Regret In Empirical Games, Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh Feb 2020

Bounding Regret In Empirical Games, Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh

Research Collection School Of Information Systems

Empirical game-theoretic analysis refers to a set of models and techniques for solving large-scale games. However, there is a lack of a quantitative guarantee about the quality of output approximate Nash equilibria (NE). A natural quantitative guarantee for such an approximate NE is the regret in the game (i.e. the best deviation gain). We formulate this deviation gain computation as a multi-armed bandit problem, with a new optimization goal unlike those studied in prior work. We propose an efficient algorithm Super-Arm UCB (SAUCB) for the problem and a number of variants. We present sample complexity results as well as ...


Generating Realistic Stock Market Order Streams, Junyi Li, Xintong Wang, Yaoyang Lin, Arunesh Sinha, Michael P. Wellman Feb 2020

Generating Realistic Stock Market Order Streams, Junyi Li, Xintong Wang, Yaoyang Lin, Arunesh Sinha, Michael P. Wellman

Research Collection School Of Information Systems

We propose an approach to generate realistic and high-fidelity stock market data based on generative adversarial networks. We model the order stream as a stochastic process with finite history dependence, and employ a conditional Wasserstein GAN to capture history dependence of orders in a stock market. We test our approach with actual market and synthetic data on a number of different statistics, and find the generated data to be close to real data.


Topic Modeling On Document Networks With Adjacent-Encoder, Hady W. Lauw Feb 2020

Topic Modeling On Document Networks With Adjacent-Encoder, Hady W. Lauw

Research Collection School Of Information Systems

Oftentimes documents are linked to one another in a network structure,e.g., academic papers cite other papers, Web pages link to other pages. In this paper we propose a holistic topic model to learn meaningful and unified low-dimensional representations for networked documents that seek to preserve both textual content and network structure. On the basis of reconstructing not only the input document but also its adjacent neighbors, we develop two neural encoder architectures. Adjacent-Encoder, or AdjEnc, induces competition among documents for topic propagation, and reconstruction among neighbors for semantic capture. Adjacent-Encoder-X, or AdjEnc-X, extends this to also encode the ...


Solving Online Threat Screening Games Using Constrained Action Space Reinforcement Learning, Sanket Shah, Arunesh Sinha, Pradeep Varakantham, Andrew Perrault, Millind Tambe Feb 2020

Solving Online Threat Screening Games Using Constrained Action Space Reinforcement Learning, Sanket Shah, Arunesh Sinha, Pradeep Varakantham, Andrew Perrault, Millind Tambe

Research Collection School Of Information Systems

Large-scale screening for potential threats with limited resources and capacity for screening is a problem of interest at airports, seaports, and other ports of entry. Adversaries can observe screening procedures and arrive at a time when there will be gaps in screening due to limited resource capacities. To capture this game between ports and adversaries, this problem has been previously represented as a Stackelberg game, referred to as a Threat Screening Game (TSG). Given the significant complexity associated with solving TSGs and uncertainty in arrivals of customers, existing work has assumed that screenees arrive and are allocated security resources at ...


Expediting The Accuracy-Improving Process Of Svms For Class Imbalance Learning, Bin Cao, Yuqi Liu, Jing Fan, Baihua Zheng, Baihua Zheng Feb 2020

Expediting The Accuracy-Improving Process Of Svms For Class Imbalance Learning, Bin Cao, Yuqi Liu, Jing Fan, Baihua Zheng, Baihua Zheng

Research Collection School Of Information Systems

To improve the classification performance of support vector machines (SVMs) on imbalanced datasets, cost-sensitive learning methods have been proposed, e.g., DEC (Different Error Costs) and FSVM-CIL (Fuzzy SVM for Class Imbalance Learning). They relocate the hyperplane by adjusting the costs associated with misclassifying samples. However, the error costs are determined either empirically or by performing an exhaustive search in the parameter space. Both strategies can not guarantee effectiveness and efficiency simultaneously. In this paper, we propose ATEC, a solution that can efficiently find a preferable hyperplane by automatically tuning the error cost for between-class samples. ATEC distinguishes itself from ...


Privacy-Preserving Network Path Validation, Binanda Sengupta, Yingjiu Li, Kai Bu, Robert H. Deng Feb 2020

Privacy-Preserving Network Path Validation, Binanda Sengupta, Yingjiu Li, Kai Bu, Robert H. Deng

Research Collection School Of Information Systems

The end-users communicating over a network path currently have no control over the path. For a better quality of service, the source node often opts for a superior (or premium) network path to send packets to the destination node. However, the current Internet architecture provides no assurance that the packets indeed follow the designated path. Network path validation schemes address this issue and enable each node present on a network path to validate whether each packet has followed the specific path so far. In this work, we introduce two notions of privacy—path privacy and index privacy—in the context ...


Stochastically Robust Personalized Ranking For Lsh Recommendation Retrieval, Hady W. Lauw Feb 2020

Stochastically Robust Personalized Ranking For Lsh Recommendation Retrieval, Hady W. Lauw

Research Collection School Of Information Systems

Locality Sensitive Hashing (LSH) has become one of the most commonly used approximate nearest neighbor search techniques to avoid the prohibitive cost of scanning through all data points. For recommender systems, LSH achieves efficient recommendation retrieval by encoding user and item vectors into binary hash codes, reducing the cost of exhaustively examining all the item vectors to identify the topk items. However, conventional matrix factorization models may suffer from performance degeneration caused by randomly-drawn LSH hash functions, directly affecting the ultimate quality of the recommendations. In this paper, we propose a framework named SRPR, which factors in the stochasticity of ...


Practical Server-Side Indoor Localization: Tackling Cardinality & Outlier Challenges, Anuradha Ravi, Archan Misra Jan 2020

Practical Server-Side Indoor Localization: Tackling Cardinality & Outlier Challenges, Anuradha Ravi, Archan Misra

Research Collection School Of Information Systems

In spite of many advances in indoor localization techniques, practical implementation of robust deviceindependent, server-side Wi-Fi localization (i.e., without any active participation of client devices) remains a challenge. This work utilizes an operationally-deployed Wi-Fi based indoor location infrastructure, based on the classical RADAR algorithm, to tackle two such practical challenges: (a) low cardinality, whereby only the associated AP generates sufficient RSSI reports and (b) outlier identification, which requires explicit identification of mobile clients that are attached to the Wi-Fi network but outside the fingerprinted region. To tackle the low-cardinality problem, we present a technique that uses cardinality changes to ...


Learning-Guided Network Fuzzing For Testing Cyber-Physical System Defences, Yuqi Chen, Christopher M. Poskitt, Jun Sun, Sridhar Adepu, Fan Zhang Jan 2020

Learning-Guided Network Fuzzing For Testing Cyber-Physical System Defences, Yuqi Chen, Christopher M. Poskitt, Jun Sun, Sridhar Adepu, Fan Zhang

Research Collection School Of Information Systems

The threat of attack faced by cyber-physical systems (CPSs), especially when they play a critical role in automating public infrastructure, has motivated research into a wide variety of attack defence mechanisms. Assessing their effectiveness is challenging, however, as realistic sets of attacks to test them against are not always available. In this paper, we propose smart fuzzing, an automated, machine learning guided technique for systematically finding 'test suites' of CPS network attacks, without requiring any knowledge of the system's control programs or physical processes. Our approach uses predictive machine learning models and metaheuristic search algorithms to guide the fuzzing ...


Key Regeneration-Free Ciphertext-Policy Attribute-Based Encryption And Its Application, Hui Cui, Robert H. Deng, Baodong Qin, Jian Weng Jan 2020

Key Regeneration-Free Ciphertext-Policy Attribute-Based Encryption And Its Application, Hui Cui, Robert H. Deng, Baodong Qin, Jian Weng

Research Collection School Of Information Systems

Attribute-based encryption (ABE) provides a promising solution for enabling scalable access control over encrypted data stored in the untrusted servers (e.g., cloud) due to its ability to perform data encryption and decryption defined over descriptive attributes. In order to bind different components which correspond to different attributes in a user's attribute-based decryption key together, key randomization technique has been applied in most existing ABE schemes. This randomization method, however, also empowers a user the capability of regenerating a newly randomized decryption key over a subset of the attributes associated with the original decryption key. Because key randomization breaks ...


Game Theoretical Study On Client-Controlled Cloud Data Deduplication, Xueqin Liang, Zheng Yan, Robert H. Deng Jan 2020

Game Theoretical Study On Client-Controlled Cloud Data Deduplication, Xueqin Liang, Zheng Yan, Robert H. Deng

Research Collection School Of Information Systems

Data deduplication eliminates redundant data and is receiving increasing attention in cloud storage services due to the proliferation of big data and the demand for efficient storage. Data deduplication not only requires a consummate technological designing, but also involves multiple parties with conflict interests. Thus, how to design incentive mechanisms and study their acceptance by all relevant stakeholders remain important open issues. In this paper, we detail the payoff structure of a client-controlled deduplication scheme and analyze the feasibilities of unified discount and individualized discount under this structure. Through game theoretical study, a privacy-preserving individualized discount-based incentive mechanism is further ...


Migrating From Monoliths To Cloud-Based Microservices: A Banking Industry Example, Alan Megargel, Venky Shankararaman, David K. Walker Jan 2020

Migrating From Monoliths To Cloud-Based Microservices: A Banking Industry Example, Alan Megargel, Venky Shankararaman, David K. Walker

Research Collection School Of Information Systems

As more organizations are placing cloud computing at the heart of their digital transformation strategy, it is important that they adopt appropriate architectures and development methodologies to leverage the full benefits of the cloud. A mere “lift and move” approach, where traditional monolith applications are moved to the cloud will not support the demands of digital services. While, monolithic applications may be easier to develop and control, they are inflexible to change and lack the scalability needed for cloud environments. Microservices architecture, which adopts some of the concepts and principles from service-oriented architecture, provides a number of benefits when developing ...


The Future Of Work Now: Medical Coding With Ai, Thomas H. Davenport, Steven M. Miller Jan 2020

The Future Of Work Now: Medical Coding With Ai, Thomas H. Davenport, Steven M. Miller

Research Collection School Of Information Systems

The coding of medical diagnosis and treatment has always been a challenging issue. Translating a patient’s complex symptoms, and a clinician’s efforts to address them, into a clear and unambiguous classification code was difficult even in simpler times. Now, however, hospitals and health insurance companies want very detailed information on what was wrong with a patient and the steps taken to treat them— for clinical record-keeping, for hospital operations review and planning, and perhaps most importantly, for financial reimbursement purposes.