Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3560)
- Software Engineering (2205)
- Artificial Intelligence and Robotics (1897)
- Information Security (1108)
- Numerical Analysis and Scientific Computing (1060)
-
- Graphics and Human Computer Interfaces (947)
- Engineering (884)
- Social and Behavioral Sciences (808)
- Business (748)
- Theory and Algorithms (513)
- Computer Engineering (449)
- Programming Languages and Compilers (413)
- Operations Research, Systems Engineering and Industrial Engineering (407)
- OS and Networks (345)
- Communication (326)
- Social Media (264)
- Public Affairs, Public Policy and Public Administration (230)
- Medicine and Health Sciences (197)
- Education (194)
- Transportation (194)
- Management Information Systems (176)
- Data Storage Systems (167)
- E-Commerce (154)
- International and Area Studies (147)
- Technology and Innovation (146)
- Asian Studies (145)
- Health Information Technology (118)
- Higher Education (105)
- Keyword
-
- Machine learning (145)
- Deep learning (129)
- Artificial intelligence (124)
- Social media (82)
- Singapore (73)
-
- Reinforcement learning (72)
- Data mining (70)
- Privacy (67)
- Security (62)
- Cloud computing (60)
- Deep Learning (58)
- Empirical study (55)
- Software engineering (55)
- Optimization (54)
- Online learning (51)
- Visualization (51)
- Neural networks (50)
- Anomaly detection (49)
- Training (49)
- Twitter (49)
- Task analysis (48)
- Blockchain (47)
- Large Language Models (47)
- Natural language processing (47)
- Collaboration (46)
- Feature extraction (45)
- Algorithms (44)
- Access control (43)
- Machine Learning (43)
- Semantics (43)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8479)
- Dissertations and Theses Collection (Open Access) (189)
- Research Collection Lee Kong Chian School Of Business (59)
- Research Collection Yong Pung How School Of Law (49)
- Research Collection School of Social Sciences (27)
-
- Asian Management Insights (26)
- Research Collection College of Integrative Studies (23)
- Perspectives@SMU (21)
- Research Collection School Of Accountancy (18)
- Dissertations and Theses Collection (15)
- FORCE 2026 (14)
- SMU Press Releases and News (12)
- MITB Thought Leadership Series (11)
- Research Collection School of Computing and Information Systems (11)
- Research Collection Library (10)
- Research@SMU: Connecting the Dots (10)
- PhD Student’s Publications Collection (8)
- LARC Research Publications (7)
- Research Collection School Of Economics (6)
- CCX Research (4)
- SMU Research Data (4)
- Student Publications (4)
- 2024 AI for Research Week (3)
- SCIS Student Publications (3)
- Centre for AI & Data Governance (2019-2025) (2)
- Research Collection Office of Research (2)
- CASTLe: Collection of Articles on Scholarship for Teaching and Learning (1)
- Centre for Computational Law (2022-2025) (1)
- Library Events (1)
- ROSA Journal Articles and Publications (1)
- Publication Type
- File Type
Articles 5191 - 5220 of 9025
Full-Text Articles in Computer Sciences
Improving Automated Bug Triaging With Specialized Topic Model, Xin Xia, David Lo, Ying Ding, Jafar M. Al-Kofahi, Tien N. Nguyen, Xinyu Wang
Improving Automated Bug Triaging With Specialized Topic Model, Xin Xia, David Lo, Ying Ding, Jafar M. Al-Kofahi, Tien N. Nguyen, Xinyu Wang
Research Collection School Of Computing and Information Systems
Bug triaging refers to the process of assigning a bug to the most appropriate developer to fix. It becomes more and more difficult and complicated as the size of software and the number of developers increase. In this paper, we propose a new framework for bug triaging, which maps the words in the bug reports (i.e., the term space) to their corresponding topics (i.e., the topic space). We propose a specialized topic modeling algorithm named multi-feature topic model (MTM) which extends Latent Dirichlet Allocation (LDA) for bug triaging. MTM considers product and component information of bug reports to map the …
Are The Trade-Offs For Reducing Cross-Border Cybercrime Manageable?, Steven Mark Miller, Qiu-Hong Wang, Robert John Kauffman
Are The Trade-Offs For Reducing Cross-Border Cybercrime Manageable?, Steven Mark Miller, Qiu-Hong Wang, Robert John Kauffman
Research Collection School Of Computing and Information Systems
Without increased government intervention andgovernment-industry collaboration, the advantages inherent in the next wave ofInternet-enabled digital transformation will increasingly tilt towardcyber criminals, and their influence will disproportionately increase. The dilemma that immediately presents itself in such ascenario, however, is that an increased level of government involvement canalso lead to undesirable consequences. Increasing security always comes withtrade-offs that must be managed. The obvious concerns relate to the erosion ofprivacy, illegal or extralegal persecution, the abuse of Internet censorshipand the impediment to or stifling of innovation.
Inferring User Consumption Preferences From Social Media, Yang Li, Jing Jiang, Ting Liu
Inferring User Consumption Preferences From Social Media, Yang Li, Jing Jiang, Ting Liu
Research Collection School Of Computing and Information Systems
Social Media has already become a new arena of our lives and involved different aspects of our social presence. Users' personal information and activities on social media presumably reveal their personal interests, which offer great opportunities for many e-commerce applications. In this paper, we propose a principled latent variable model to infer user consumption preferences at the category level (e.g. inferring what categories of products a user would like to buy). Our model naturally links users' published content and following relations on microblogs with their consumption behaviors on e-commerce websites. Experimental results show our model outperforms the state-of-the-art methods significantly …
The Wonders Of The Spreadsheet Tool For Data Management And Insights, Michelle L. F. Cheong
The Wonders Of The Spreadsheet Tool For Data Management And Insights, Michelle L. F. Cheong
Research Collection School Of Computing and Information Systems
Ask any student at the Singapore Management University (SMU) toname one of the most practical and useful courses offered by theuniversity. The answer would inevitably include CAT. CAT stands forthe "Computer as an Analysis Tool" course. Originally based on acourse of the same title offered by the Wharton Business School, thefocus of CAT was shifted to provide business students the essentialpractical skills and necessary “real-world” exposure to better usepersonal computers for resolving business problems. The course isbasically centred on using the Excel spreadsheet to work onambiguous ill-defined problems (Leong & Cheong, 2009). Over theyears, three editions of a textbook have …
Are The Trade-Offs For Reducing Cross-Border Cybercrime Manageable?, Steven Mark Miller, Qiu-Hong Wang, Robert John Kauffman
Are The Trade-Offs For Reducing Cross-Border Cybercrime Manageable?, Steven Mark Miller, Qiu-Hong Wang, Robert John Kauffman
Research Collection School Of Computing and Information Systems
Without increased government intervention and government-industry collaboration, the advantages inherent in the next wave of Internet-enabled digital transformation will increasingly tilt toward cybercriminals, and their influence will disproportionately increase. The dilemma that immediately presents itself in such a scenario, however, is that an increased level of government involvement can also lead to undesirable consequences. Increasing security always comes with trade-offs that must be managed. The obvious concerns relate to the erosion of privacy, illegal or extralegal persecution, the abuse of Internet censorship and the impediment to or stifling of innovation.
Collaboration Trumps Homophily In Urban Mobile Crowdsourcing, Thivya Kandappu, Archan Misra, Randy Tandriansyah
Collaboration Trumps Homophily In Urban Mobile Crowdsourcing, Thivya Kandappu, Archan Misra, Randy Tandriansyah
Research Collection School Of Computing and Information Systems
This paper establishes the power of dynamic collaborative task completion among workers for urban mobile crowdsourcing. Collaboration is defined via the notion of peer referrals, whereby a worker who has accepted a location-specific task, but is unlikely to visit that location, offloads the task to a willing friend. Such a collaborative framework might be particularly useful for task bundles, especially for bundles that have higher geographic dispersion. The challenge, however, comes from the high similarity observed in the spatiotemporal pattern of task completion among friends. Using extensive real-world crowd-sourcing studies conducted over 7 weeks and 1000+ workers on a campus-based …
Ui X-Ray: Interactive Mobile Ui Testing Based On Computer Vision, Chun-Fu Richard Chen, Marco Pistoia, Conglei Shi, Paolo Girolami, Joseph W. Ligman, Yong Wang
Ui X-Ray: Interactive Mobile Ui Testing Based On Computer Vision, Chun-Fu Richard Chen, Marco Pistoia, Conglei Shi, Paolo Girolami, Joseph W. Ligman, Yong Wang
Research Collection School Of Computing and Information Systems
User Interface/eXperience (UI/UX) significantly affects the lifetime of any software program, particularly mobile apps. A bad UX can undermine the success of a mobile app even if that app enables sophisticated capabilities. A good UX, however, needs to be supported of a highly functional and user friendly UI design. In spite of the importance of building mobile apps based on solid UI designs, UI discrepancies- inconsistencies between UI design and implementation-Are among the most numerous and expensive defects encountered during testing. This paper presents UI X-RAY, an interactive UI testing system that integrates computer-vision methods to facilitate the correction of …
Mining Sandboxes For Linux Containers, Zhiyuan Wan, David Lo, Xin Xia, Liang Cai, Shanping Li
Mining Sandboxes For Linux Containers, Zhiyuan Wan, David Lo, Xin Xia, Liang Cai, Shanping Li
Research Collection School Of Computing and Information Systems
A container is a group of processes isolated from other groups via distinct kernel namespaces and resource allocation quota. Attacks against containers often leverage kernel exploits through system call interface. In this paper, we present an approach that mines sandboxes for containers. We first explore the behaviors of a container by leveraging automatic testing, and extract the set of system calls accessed during testing. The set of system calls then results as a sandbox of the container. The mined sandbox restricts the container's access to system calls which are not seen during testing and thus reduces the attack surface. In …
Feature Learning Via Partial Differential Equation With Applications To Face Recognition, Cong Fang, Zhenyu Zhao, Pan Zhou, Zhouchen Lin
Feature Learning Via Partial Differential Equation With Applications To Face Recognition, Cong Fang, Zhenyu Zhao, Pan Zhou, Zhouchen Lin
Research Collection School Of Computing and Information Systems
Feature learning is a critical step in pattern recognition, such as image classification. However, most of the existing methods cannot extract features that are discriminative and at the same time invariant under some transforms. This limits the classification performance, especially in the case of small training sets. To address this issue, in this paper we propose a novel Partial Differential Equation (PDE) based method for feature learning. The feature learned by our PDE is discriminative, also translationally and rotationally invariant, and robust to illumination variation. To our best knowledge, this is the first work that applies PDE to feature learning …
Modeling Adoption Dynamics In Social Networks, Minh Duc Luu
Modeling Adoption Dynamics In Social Networks, Minh Duc Luu
Dissertations and Theses Collection
This dissertation studies the modeling of user-item adoption dynamics where an item can be an innovation, a piece of contagious information or a product. By “adoption dynamics” we refer to the process of users making decision choices to adopt items based on a variety of user and item factors. In the context of social networks, “adoption dynamics” is closely related to “item diffusion”. When a user in a social network adopts an item, she may influence her network neighbors to adopt the item. Those neighbors of her who adopt the item then continue to trigger more adoptions. As this progress …
Maximizing The Probability Of Arriving On Time: A Practical Q-Learning Method, Zhiguang Cao, Hongliang Guo, Jie Zhang, Frans Oliehoek, Ulrich Fastenrath
Maximizing The Probability Of Arriving On Time: A Practical Q-Learning Method, Zhiguang Cao, Hongliang Guo, Jie Zhang, Frans Oliehoek, Ulrich Fastenrath
Research Collection School Of Computing and Information Systems
The stochastic shortest path problem is of crucial importance for the development of sustainable transportation systems. Existing methods based on the probability tail model seek for the path that maximizes the probability of arriving at the destination before a deadline. However, they suffer from low accuracy and/or high computational cost. We design a novel Q-learning method where the converged Q-values have the practical meaning as the actual probabilities of arriving on time so as to improve accuracy. By further adopting dynamic neural networks to learn the value function, our method can scale well to large road networks with arbitrary deadlines. …
A Riemannian Network For Spd Matrix Learning, Zhiwu Huang, Gool L. Van
A Riemannian Network For Spd Matrix Learning, Zhiwu Huang, Gool L. Van
Research Collection School Of Computing and Information Systems
Symmetric Positive Definite (SPD) matrix learning methods have become popular in many image and video processing tasks, thanks to their ability to learn appropriate statistical representations while respecting Riemannian geometry of underlying SPD manifolds. In this paper we build a Riemannian network architecture to open up a new direction of SPD matrix non-linear learning in a deep model. In particular, we devise bilinear mapping layers to transform input SPD matrices to more desirable SPD matrices, exploit eigenvalue rectification layers to apply a non-linear activation function to the new SPD matrices, and design an eigenvalue logarithm layer to perform Riemannian computing …
Security Slicing For Auditing Common Injection Vulnerabilities, Julian Thome, Lwin Khin Shar, Domenico Bianculli, Lionel Briand
Security Slicing For Auditing Common Injection Vulnerabilities, Julian Thome, Lwin Khin Shar, Domenico Bianculli, Lionel Briand
Research Collection School Of Computing and Information Systems
Cross-site scripting and injection vulnerabilities are among the most common and serious security issues for Web applications. Although existing static analysis approaches can detect potential vulnerabilities in source code, they generate many false warnings and source-sink traces with irrelevant information, making their adoption impractical for security auditing. One suitable approach to support security auditing is to compute a program slice for each sink, which contains all the information required for security auditing. However, such slices are likely to contain a large amount of information that is irrelevant to security, thus raising scalability issues for security audits. In this paper, we …
Soal: Second-Order Online Active Learning, Shuji Hao, Peilin Zhao, Jing Lu, Steven C. H. Hoi, Chunyan Miao, Chi Zhang
Soal: Second-Order Online Active Learning, Shuji Hao, Peilin Zhao, Jing Lu, Steven C. H. Hoi, Chunyan Miao, Chi Zhang
Research Collection School Of Computing and Information Systems
This paper investigates the problem of online active learning for training classification models from sequentially arriving data. This is more challenging than conventional online learning tasks since the learner not only needs to figure out how to effectively update the classifier but also needs to decide when is the best time to query the label of an incoming instance given limited label budget. The existing online active learning approaches are often based on first-order online learning methods which generally fall short in slow convergence rate and suboptimal exploitation of available information when querying the labeled data. To overcome the limitations, …
Robust Optimization For Tree-Structured Stochastic Network Design, Xiaojian Wu, Akshat Kumar, Daniel Sheldon
Robust Optimization For Tree-Structured Stochastic Network Design, Xiaojian Wu, Akshat Kumar, Daniel Sheldon
Research Collection School Of Computing and Information Systems
Stochastic network design is a general framework for optimizing network connectivity. It has several applications in computational sustainability including spatial conservation planning, pre-disaster network preparation, and river network optimization. A common assumption in previous work has been made that network parameters (e.g., probability of species colonization) are precisely known, which is unrealistic in real- world settings. We therefore address the robust river network design problem where the goal is to optimize river connectivity for fish movement by removing barriers. We assume that fish passability probabilities are known only imprecisely, but are within some interval bounds. We then develop a planning …
Collective Multiagent Sequential Decision Making Under Uncertainty, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau
Collective Multiagent Sequential Decision Making Under Uncertainty, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Multiagent sequential decision making has seen rapid progress with formal models such as decentralized MDPs and POMDPs. However, scalability to large multiagent systems and applicability to real world problems remain limited. To address these challenges, we study multiagent planning problems where the collective behavior of a population of agents affects the joint-reward and environment dynamics. Our work exploits recent advances in graphical models for modeling and inference with a population of individuals such as collective graphical models and the notion of finite partial exchangeability in lifted inference. We develop a collective decentralized MDP model where policies can be computed based …
Recurrent Neural Networks With Auxiliary Labels For Cross-Domain Opinion Target Extraction, Ying Ding, Jianfei Yu, Jing Jiang
Recurrent Neural Networks With Auxiliary Labels For Cross-Domain Opinion Target Extraction, Ying Ding, Jianfei Yu, Jing Jiang
Research Collection School Of Computing and Information Systems
Opinion target extraction is a fundamental task in opinion mining. In recent years, neural network based supervised learning methods have achieved competitive performance on this task. However, as with any supervised learning method, neural network based methods for this task cannot work well when the training data comes from a different domain than the test data. On the other hand, some rule-based unsupervised methods have shown to be robust when applied to different domains. In this work, we use rule-based unsupervised methods to create auxiliary labels and use neural network models to learn a hidden representation that works well for …
Decentralized Planning In Stochastic Environments With Submodular Rewards, Rajiv Ranjan Kumar, Pradeep Varakantham, Akshat Kumar
Decentralized Planning In Stochastic Environments With Submodular Rewards, Rajiv Ranjan Kumar, Pradeep Varakantham, Akshat Kumar
Research Collection School Of Computing and Information Systems
Decentralized Markov Decision Process (Dec-MDP) providesa rich framework to represent cooperative decentralizedand stochastic planning problems under transition uncertainty.However, solving a Dec-MDP to generate coordinatedyet decentralized policies is NEXP-Hard. Researchershave made significant progress in providing approximate approachesto improve scalability with respect to number ofagents. However, there has been little or no research devotedto finding guarantees on solution quality for approximateapproaches considering multiple (more than 2 agents)agents. We have a similar situation with respect to the competitivedecentralized planning problem and the StochasticGame (SG) model. To address this, we identify models in thecooperative and competitive case that rely on submodular rewards,where we show …
Streaming Classification With Emerging New Class By Class Matrix Sketching, Xin Mu, Feida Zhu, Juan Du, Ee-Peng Lim, Zhi-Hua Zhou
Streaming Classification With Emerging New Class By Class Matrix Sketching, Xin Mu, Feida Zhu, Juan Du, Ee-Peng Lim, Zhi-Hua Zhou
Research Collection School Of Computing and Information Systems
Streaming classification with emerging new class is an important problem of great research challenge and practical value. In many real applications, the task often needs to handle large matrices issues such as textual data in the bag-of-words model and large-scale image analysis. However, the methodologies and approaches adopted by the existing solutions, most of which involve massive distance calculation, have so far fallen short of successfully addressing a real-time requested task. In this paper, the proposed method dynamically maintains two low-dimensional matrix sketches to 1) detect emerging new classes; 2) classify known classes; and 3) update the model in the …
Discovering Burst Patterns Of Burst Topic In Twitter, Guozhong Dong, Wu Yang, Feida Zhu, Wei Wang
Discovering Burst Patterns Of Burst Topic In Twitter, Guozhong Dong, Wu Yang, Feida Zhu, Wei Wang
Research Collection School Of Computing and Information Systems
Twitter has become one of largest social networks for users to broadcast burst topics. There have been many studies on how to detect burst topics. However, mining burst patterns in burst topics has not been solved by the existing works. In this paper, we investigate the problem of mining burst patterns of burst topic in Twitter. A burst topic user graph model is proposed, which can represent the topology structure of burst topic propagation across a large number of Twitter users. Based on the model, hierarchical clustering is applied to cluster burst topics and reveal burst patterns from the macro …
Detecting Similar Repositories On Github, Yun Zhang, David Lo, Pavneet Singh Kochhar, Xin Xia, Quanlai Li, Jianling Sun
Detecting Similar Repositories On Github, Yun Zhang, David Lo, Pavneet Singh Kochhar, Xin Xia, Quanlai Li, Jianling Sun
Research Collection School Of Computing and Information Systems
GitHub contains millions of repositories among which many are similar with one another (i.e., having similar source codes or implementing similar functionalities). Finding similar repositories on GitHub can be helpful for software engineers as it can help them reuse source code, build prototypes, identify alternative implementations, explore related projects, find projects to contribute to, and discover code theft and plagiarism. Previous studies have proposed techniques to detect similar applications by analyzing API usage patterns and software tags. However, these prior studies either only make use of a limited source of information or use information not available for projects on GitHub. …
Collaboration Trumps Homophily In Urban Mobile Crowd-Sourcing, Thivya Kandappu, Archan Misra, Randy Tandriansyah Daratan
Collaboration Trumps Homophily In Urban Mobile Crowd-Sourcing, Thivya Kandappu, Archan Misra, Randy Tandriansyah Daratan
Research Collection School Of Computing and Information Systems
This paper establishes the power of dynamic collaborative task completion among workers for urban mobile crowdsourcing. Collaboration is defined via the notion of peer referrals, whereby a worker who has accepted a location-specific task, but is unlikely to visit that location, offloads the task to a willing friend. Such a collaborative framework might be particularly useful for task bundles, especially for bundles that have higher geographic dispersion. The challenge, however, comes from the high similarity observed in the spatiotemporal pattern of task completion among friends. Using extensive real-world crowd-sourcing studies conducted over 7 weeks and 1000+ workers on a campus-based …
Empath-D: Empathetic Design For Accessibility, Kenny Tsu Wei Choo, Rajesh Krishna Balan, Kiat Wee Tan, Archan Misra, Youngki Lee
Empath-D: Empathetic Design For Accessibility, Kenny Tsu Wei Choo, Rajesh Krishna Balan, Kiat Wee Tan, Archan Misra, Youngki Lee
Research Collection School Of Computing and Information Systems
We describe our vision for Empath-D, our system to enable Empathetic User Interface Design. Our key idea is to leverage Virtual and Augmented Reality (VR / AR) displays to provide an Immersive Reality environment, where developers/designers can emulate impaired interactions by elderly or disabled users while testing the usability of their applications. Our early experiences with the Empath-D prototype show that Empath-D can emulate a cataract vision impairment of the elderly and guide designers to create accessible web pages with less mental workload.
Clcminer: Detecting Cross-Language Clones Without Intermediates, Xiao Cheng, Zhiming Peng, Lingxiao Jiang, Hao Zhong, Haibo Yu, Jianjun Zhao
Clcminer: Detecting Cross-Language Clones Without Intermediates, Xiao Cheng, Zhiming Peng, Lingxiao Jiang, Hao Zhong, Haibo Yu, Jianjun Zhao
Research Collection School Of Computing and Information Systems
The proliferation of diverse kinds of programming languages and platforms makes it a common need to have the same functionality implemented in different languages for different platforms, such as Java for Android applications and C# forWindows phone applications. Although versions of code written in different languages appear syntactically quite different from each other, they are intended to implement the same software and typically contain many code snippets that implement similar functionalities, which we call cross-language clones. When the version of code in one language evolves according to changing functionality requirements and/or bug fixes, its cross-language clones may also need be …
Harnessing Twitter To Support Serendipitous Learning Of Developers, Abhabhisheksh Sharma, Yuan Tian, Agus Sulistya, David Lo, Aiko Yamashita
Harnessing Twitter To Support Serendipitous Learning Of Developers, Abhabhisheksh Sharma, Yuan Tian, Agus Sulistya, David Lo, Aiko Yamashita
Research Collection School Of Computing and Information Systems
Developers often rely on various online resources, such as blogs, to keep themselves up-to-date with the fast pace at which software technologies are evolving. Singer et al. found that developers tend to use channels such as Twitter to keep themselves updated and support learning, often in an undirected or serendipitous way, coming across things that they may not apply presently, but which should be helpful in supporting their developer activities in future. However, identifying relevant and useful articles among the millions of pieces of information shared on Twitter is a non-trivial task. In this work to support serendipitous discovery of …
Crowdsensing And Analyzing Micro-Event Tweets For Public Transportation Insights, Thoong Hoang, Pei Hua (Xu Peihua) Cher, Philips Kokoh Prasetyo, Ee-Peng Lim
Crowdsensing And Analyzing Micro-Event Tweets For Public Transportation Insights, Thoong Hoang, Pei Hua (Xu Peihua) Cher, Philips Kokoh Prasetyo, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Efficient and commuter friendly public transportation system is a critical part of a thriving and sustainable city. As cities experience fast growing resident population, their public transportation systems will have to cope with more demands for improvements. In this paper, we propose a crowdsensing and analysis framework to gather and analyze realtime commuter feedback from Twitter. We perform a series of text mining tasks identifying those feedback comments capturing bus related micro-events; extracting relevant entities; and, predicting event and sentiment labels. We conduct a series of experiments involving more than 14K labeled tweets. The experiments show that incorporating domain knowledge …
Dynamic Repositioning To Reduce Lost Demand In Bike Sharing Systems, Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet
Dynamic Repositioning To Reduce Lost Demand In Bike Sharing Systems, Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet
Research Collection School Of Computing and Information Systems
Bike Sharing Systems (BSSs) are widely adopted in major cities of the world due to concerns associated with extensive private vehicle usage, namely, increased carbon emissions, traffic congestion and usage of nonrenewable resources. In a BSS, base stations are strategically placed throughout a city and each station is stocked with a pre-determined number of bikes at the beginning of the day. Customers hire the bikes from one station and return them at another station. Due to unpredictable movements of customers hiring bikes, there is either congestion (more than required) or starvation (fewer than required) of bikes at base stations. Existing …
Why And How Developers Fork What From Whom In Github, Jing Jiang, David Lo, Jiahuan He, Xin Xia, Pavneet Singh Kochhar, Li Zhang
Why And How Developers Fork What From Whom In Github, Jing Jiang, David Lo, Jiahuan He, Xin Xia, Pavneet Singh Kochhar, Li Zhang
Research Collection School Of Computing and Information Systems
Forking is the creation of a new software repository by copying another repository. Though forking is controversial in traditional open source software (OSS) community, it is encouraged and is a built-in feature in GitHub. Developers freely fork repositories, use codes as their own and make changes. A deep understanding of repository forking can provide important insights for OSS community and GitHub. In this paper, we explore why and how developers fork what from whom in GitHub. We collect a dataset containing 236,344 developers and 1,841,324 forks. We make surveys, and analyze programming languages and owners of forked repositories. Our main …
Toward A Collaborative Ai Framework For Assistive Dementia Care, Tze-Yun Leong
Toward A Collaborative Ai Framework For Assistive Dementia Care, Tze-Yun Leong
Research Collection School Of Computing and Information Systems
We envision an integrated framework for supporting the development and deployment of human-aware, general artificial intelligence (AI) that needs to collaborate in uncertain, changing environments. We examine the technology and system requirements of building assistive care agents for dementia or cognitive impaired patients through the continuum of care. We summarize the new AI capabilities and show examples of how an evolving, adaptive development approach would be able to support the basic functionalities and applications in a sound, practical, and scalable manner. We highlight the challenges and the opportunities involved in realizing the proposed framework, and call for future research and …
Attribute-Based Secure Messaging In The Public Cloud, Zhi Yuan Poh, Hui Cui, Robert H. Deng, Yingjiu Li
Attribute-Based Secure Messaging In The Public Cloud, Zhi Yuan Poh, Hui Cui, Robert H. Deng, Yingjiu Li
Research Collection School Of Computing and Information Systems
Messaging systems operating within the public cloud are gaining popularity. To protect message confidentiality from the public cloud including the public messaging servers, we propose to encrypt messages in messaging systems using Attribute-Based Encryption (ABE). ABE is an one-to-many public key encryption system in which data are encrypted with access policies and only users with attributes that satisfy the access policies can decrypt the ciphertexts, and hence is considered as a promising solution for realizing expressive and fine-grained access control of encrypted data in public servers. Our proposed system, called Attribute-Based Secure Messaging System with Outsourced Decryption (ABSM-OD), has three …