Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3560)
- Software Engineering (2204)
- Artificial Intelligence and Robotics (1897)
- Information Security (1107)
- 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 (123)
- 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 Library (10)
- Research Collection School of Computing and Information Systems (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 6271 - 6300 of 9024
Full-Text Articles in Computer Sciences
Fully Secure Key-Policy Attribute-Based Encryption With Constant-Size Ciphertexts And Fast Decryption, Junzuo Lai, Robert H. Deng, Yingjiu Li, Jian Weng
Fully Secure Key-Policy Attribute-Based Encryption With Constant-Size Ciphertexts And Fast Decryption, Junzuo Lai, Robert H. Deng, Yingjiu Li, Jian Weng
Research Collection School Of Computing and Information Systems
Attribute-based encryption (ABE), introduced by Sahai and Waters, is a promising cryptographic primitive, which has been widely applied to implement fine-grained access control system for encrypted data. In its key-policy flavor, attribute sets are used to annotate ciphertexts and secret keys are associated with access structures that specify which ciphertexts a user is entitled to decrypt. In most existing key-policy attribute-based encryption (KP-ABE) constructions, the size of the ciphertext is proportional to the number of attributes associated with it and the decryption cost is proportional to the number of attributes used during decryption. In this paper, we present a new …
It's Not A Bug, It's A Feature: Does Misclassification Affect Bug Localization?, Pavneet Singh Kocchar, Tien-Duy B. Le, David Lo
It's Not A Bug, It's A Feature: Does Misclassification Affect Bug Localization?, Pavneet Singh Kocchar, Tien-Duy B. Le, David Lo
Research Collection School Of Computing and Information Systems
Bug localization refers to the task of automatically processing bug reports to locate source code files that are responsible for the bugs. Many bug localization techniques have been proposed in the literature. These techniques are often evaluated on issue reports that are marked as bugs by their reporters in issue tracking systems. However, recent findings by Herzig et al. find that a substantial number of issue reports marked as bugs, are not bugs but other kinds of issues like refactorings, request for enhancement, documentation changes, test case creation, and so on. Herzig et al. report that these misclassifications affect bug …
On Modeling Brand Preferences In Item Adoptions, Minh Duc Luu, Ee Peng Lim, Freddy Chong-Tat Chua
On Modeling Brand Preferences In Item Adoptions, Minh Duc Luu, Ee Peng Lim, Freddy Chong-Tat Chua
Research Collection School Of Computing and Information Systems
In marketing and advertising, developing and managingbrands value represent the core activities performedby companies. Successful brands attract buyers andadopters, which in turn increase the companies’ value.Given a set of user-item adoption data, can we inferbrand effects from users adopting items? To answerthis question, we develop the Brand Item Topic Model(BITM) that incorporates users’ brand preferences inthe process of item adoption by the users. We evaluateour model using synthetic and two real world datasetsagainst baseline models which do not consider brand effects.The results show that BITM can determine userswho demonstrate brand preferences and predict itemadoptions more accurately.
The Case For Human-Centric Personal Analytics, Youngki Lee, Rajesh Krishna Balan
The Case For Human-Centric Personal Analytics, Youngki Lee, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
The rich context provided by smartphones has enabled many new context-aware applications. However, these applications still need to provide their own mechanisms to interpret low-level sensing data and generate high-level user states. In this paper, we propose the idea of building a personal analytics (PA) layer that will use inputs from multiple lower layer sources, such as sensor data (accelerometers, gyroscopes, etc.), phone data (call logs, application activity, etc.), and online sources (Twitter, Facebook posts, etc.) to generate high-level user contextual states (such as emotions, preferences, and engagements). Developers can then use the PA layer to easily build a new …
Constructive Visualization, Samuel Huron, Sheelagh Carpendale, Alice Thudt, Anthony Tang, Michael Mauerer
Constructive Visualization, Samuel Huron, Sheelagh Carpendale, Alice Thudt, Anthony Tang, Michael Mauerer
Research Collection School Of Computing and Information Systems
If visualization is to be democratized, we need to provide means for non-experts to create visualizations that allow them to engage directly with datasets. We present constructive visualization a new paradigm for the simple creation of flexible, dynamic visualizations. Constructive visualization is simple—in that the skills required to build and manipulate the visualizations are akin to kindergarten play; it is expressive— in that one can build within the constraints of the chosen environment, and it also supports dynamics — in that these constructed visualizations can be rebuilt and adjusted. We describe the conceptual components and processes underlying constructive visualization, and …
Placing Videos On A Semantic Hierarchy For Search Result Navigation, Song Tan, Yu-Gang Jiang, Chong-Wah Ngo
Placing Videos On A Semantic Hierarchy For Search Result Navigation, Song Tan, Yu-Gang Jiang, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Organizing video search results in a list view is widely adopted by current commercial search engines, which cannot support efficient browsing for complex search topics that have multiple semantic facets. In this article, we propose to organize video search results in a highly structured way. Specifically, videos are placed on a semantic hierarchy that accurately organizes various facets of a given search topic. To pick the most suitable videos for each node of the hierarchy, we define and utilize three important criteria: relevance, uniqueness, and diversity. Extensive evaluations on a large YouTube video dataset demonstrate the effectiveness of our approach.
Condensing Class Diagrams By Analyzing Design And Network Metrics Using Optimistic Classification, Ferdian Thung, David Lo, Mohd Hafeez Osman, Michel R.V. Chaudron
Condensing Class Diagrams By Analyzing Design And Network Metrics Using Optimistic Classification, Ferdian Thung, David Lo, Mohd Hafeez Osman, Michel R.V. Chaudron
Research Collection School Of Computing and Information Systems
A class diagram of a software system enhances our ability to understand software design. However, this diagram is often unavailable. Developers usually reconstruct the diagram by reverse engineering it from source code. Unfortunately, the resultant diagram is often very cluttered; making it difficult to learn anything valuable from it. Thus, it would be very beneficial if we are able to condense the reverse- engineered class diagram to contain only the important classes depicting the overall design of a software system. Such diagram would make program understanding much easier. A class can be important, for example, if its removal would break …
Cross-Language Bug Localization, Xin Xia, David Lo, Xingen Wang, Chenyi Zhang, Xinyu Wang
Cross-Language Bug Localization, Xin Xia, David Lo, Xingen Wang, Chenyi Zhang, Xinyu Wang
Research Collection School Of Computing and Information Systems
Bug localization refers to the process of identifying source code files that contain defects from textual descriptions in bug reports. Existing bug localization techniques work on the assumption that bug reports, and identifiers and comments in source code files, are written in the same language (i.e., English). However, software users from non-English speaking countries (e.g., China) often use their native languages (e.g., Chinese) to write bug reports. For this setting, existing studies on bug localization would not work as the terms that appear in the bug reports do not appear in the source code. We refer to this problem as …
An Air Index For Spatial Query Processing In Road Networks, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu
An Air Index For Spatial Query Processing In Road Networks, Weiwei Sun, Chunan Chen, Baihua Zheng, Chong Chen, Peng Liu
Research Collection School Of Computing and Information Systems
Spatial queries such as range query and kNN query in road networks have received a growing number of attention in real life. Considering the large population of the users and the high overhead of network distance computation, it is extremely important to guarantee the efficiency and scalability of query processing. Motivated by the scalable and secure properties of wireless broadcast model, this paper presents an air index called Network Partition Index (NPI) to support efficient spatial query processing in road networks via wireless broadcast. The main idea is to partition the road network into a number of regions and then …
On Efficient Reverse Skyline Query Processing, Yunjun Gao, Qing Liu, Baihua Zheng, Gang Chen
On Efficient Reverse Skyline Query Processing, Yunjun Gao, Qing Liu, Baihua Zheng, Gang Chen
Research Collection School Of Computing and Information Systems
Given a D-dimensional data set P and a query point q, a reverse skyline query (RSQ) returns all the data objects in P whose dynamic skyline contains q. It is important for many real life applications such as business planning and environmental monitoring. Currently, the state-of-the-art algorithm for answering the RSQ is the reverse skyline using skyline approximations (RSSA) algorithm, which is based on the precomputed approximations of the skylines. Although RSSA has some desirable features, e.g., applicability to arbitrary data distributions and dimensions, it needs for multiple accesses of the same nodes, incurring redundant I/O and CPU costs. In …
Revisiting Risk-Sensitive Mdps: New Algorithms And Results, Ping Hou, William Yeoh, Pradeep Reddy Varakantham
Revisiting Risk-Sensitive Mdps: New Algorithms And Results, Ping Hou, William Yeoh, Pradeep Reddy Varakantham
Research Collection School Of Computing and Information Systems
While Markov Decision Processes (MDPs) have been shown to be effective models for planning under uncertainty, theobjective to minimize the expected cumulative cost is inappropriate for high-stake planning problems. As such, Yu, Lin, and Yan (1998) introduced the Risk-Sensitive MDP (RSMDP) model, where the objective is to find a policy that maximizes the probability that the cumulative cost is within some user-defined cost threshold. In this paper, we revisit this problem and introduce new algorithms that are based on classical techniques, such as depth-first search and dynamic programming, and a recently introduced technique called Topological Value Iteration (TVI). We demonstrate …
Daisy Filter Flow: A Generalized Discrete Approach To Dense Correspondences, Hongsheng Yang, Wen-Yan Lin, Jiangbo Lu
Daisy Filter Flow: A Generalized Discrete Approach To Dense Correspondences, Hongsheng Yang, Wen-Yan Lin, Jiangbo Lu
Research Collection School Of Computing and Information Systems
No abstract provided.
Does Latitude Hurt While Longitude Kills? Geographical And Temporal Separation In A Large Scale Software Development Project, Patrick Wagstrom, Subhajit Datta
Does Latitude Hurt While Longitude Kills? Geographical And Temporal Separation In A Large Scale Software Development Project, Patrick Wagstrom, Subhajit Datta
Research Collection School Of Computing and Information Systems
Distributed software development allows firms to leverage cost advantages and place work near centers of competency. This distribution comes at a cost -- distributed teams face challenges from differing cultures, skill levels, and a lack of shared working hours. In this paper we examine whether and how geographic and temporal separation in a large scale distributed software development influences developer interactions. We mine the work item trackers for a large commercial software project with a globally distributed development team. We examine both the time to respond and the propensity of individuals to respond and find that when taken together, geographic …
Permission Based Android Security: Issues And Countermeasures, Zheran Fang, Weili Han, Yingjiu Li
Permission Based Android Security: Issues And Countermeasures, Zheran Fang, Weili Han, Yingjiu Li
Research Collection School Of Computing and Information Systems
Android security has been a hot spot recently in both academic research and public concerns due to numerous instances of security attacks and privacy leakage on Android platform. Android security has been built upon a permission based mechanism which restricts accesses of third-party Android applications to critical resources on an Android device. Such permission based mechanism is widely criticized for its coarse-grained control of application permissions and difficult management of permissions by developers, marketers, and end-users. In this paper, we investigate the arising issues in Android security, including coarse granularity of permissions, incompetent permission administration, insufficient permission documentation, over-claim of …
Optimal Performance Trade-Offs In Mac For Wireless Sensor Networks Powered By Heterogeneous Ambient Energy Harvesting, Jin Yunye, Hwee-Pink Tan
Optimal Performance Trade-Offs In Mac For Wireless Sensor Networks Powered By Heterogeneous Ambient Energy Harvesting, Jin Yunye, Hwee-Pink Tan
Research Collection School Of Computing and Information Systems
In wireless sensor networks powered by ambient energy harvesting (WSNs-HEAP), sensor nodes' energy harvesting rates are spatially heterogeneous and temporally variant, which impose difficulties for medium access control (MAC). In this paper, we first derive the necessary conditions under which channel utilization and fairness are optimal in a WSN-HEAP, respectively. Based on the analysis, we propose an earliest deadline first (EDF) polling MAC protocol, which regulates transmission sequence of the sensor nodes based on the spatially heterogeneous energy harvesting rates. It also mitigates temporal variations in energy harvesting rates by a prediction and update mechanism. Simulation results verify the performance …
Interactive Two-Sided Transparent Displays: Designing For Collaboration, Jiannan Li, Saul Greenberg, Ehud Sharlin, Joaquim Jorge
Interactive Two-Sided Transparent Displays: Designing For Collaboration, Jiannan Li, Saul Greenberg, Ehud Sharlin, Joaquim Jorge
Research Collection School Of Computing and Information Systems
Transparent displays can serve as an important collaborative medium supporting face-to-face interactions over a shared visual work surface. Such displays enhance workspace awareness: when a person is working on one side of a transparent display, the person on the other side can see the other's body, hand gestures, gaze and what he or she is actually manipulating on the shared screen. Even so, we argue that designing such transparent displays must go beyond current offerings if it is to support collaboration. First, both sides of the display must accept interactive input, preferably by at least touch and / or pen, …
Joint Virtual Machine And Bandwidth Allocation In Software Defined Network (Sdn) And Cloud Computing Environments, Jonathan David Chase, Rakpong Kaewpuang, Wen Yonggang, Dusit Niyato
Joint Virtual Machine And Bandwidth Allocation In Software Defined Network (Sdn) And Cloud Computing Environments, Jonathan David Chase, Rakpong Kaewpuang, Wen Yonggang, Dusit Niyato
Research Collection School Of Computing and Information Systems
Cloud computing provides users with great flexibility when provisioning resources, with cloud providers offering a choice of reservation and on-demand purchasing options. Reservation plans offer cheaper prices, but must be chosen in advance, and therefore must be appropriate to users' requirements. If demand is uncertain, the reservation plan may not be sufficient and on-demand resources have to be provisioned. Previous work focused on optimally placing virtual machines with cloud providers to minimize total cost. However, many applications require large amounts of network bandwidth. Therefore, considering only virtual machines offers an incomplete view of the system. Exploiting recent developments in software …
Fault Attacks On Hyperelliptic Curve Discrete Logarithm Problem Over Binary Field, Mingqiang Wang, Haiyang Xue, Tao Zhan
Fault Attacks On Hyperelliptic Curve Discrete Logarithm Problem Over Binary Field, Mingqiang Wang, Haiyang Xue, Tao Zhan
Research Collection School Of Computing and Information Systems
In this paper, we present invalid-curve attacks that apply to the hyperelliptic curve scalar multiplication (HECSM) algorithm proposed by Avanzi et al. on the genus 2 hyperelliptic curve over binary field. We observe some new properties of the HECSM. Our attacks are based on these new properties and the observation that the parameters f 0 and f 1 of the hyperelliptic curve equation are not utilized for the HECSM. We show that with different “values” for curve parameters f 0, f 1, there exsit cryptographically weak groups in the Koblitz hyperelliptic curve. Also, we compute the theoretical probability of getting …
Information Systems User Competency: A Conceptual Foundation, B. Eschenbrenner, Fiona Fui-Hoon Nah
Information Systems User Competency: A Conceptual Foundation, B. Eschenbrenner, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Research has identified a variety of factors that influence people’s intentions to use IS and their degree of IS use. However, what has not been well understood are the characteristics of competent IS users who are proficient in using IS and are able to achieve quality IS usage. Considering that improving IS users’ abilities to more efficiently and effectively use IS has always been and remains a challenge, research that provides a comprehensive view of the characteristics associated with competent IS users is warranted. This paper addresses this research question by proposing a conceptual foundation for IS user competency. Based …
Institutional Boundaries And Trust Of Virtual Teams In Collaborative Design: An Experimental Study In A Virtual World Environment, Shu Z. Schiller, Brian Mennecke, Fiona Fui-Hoon Nah, Andy Luse
Institutional Boundaries And Trust Of Virtual Teams In Collaborative Design: An Experimental Study In A Virtual World Environment, Shu Z. Schiller, Brian Mennecke, Fiona Fui-Hoon Nah, Andy Luse
Research Collection School Of Computing and Information Systems
Members of virtual teams often collaborate within and across institutional boundaries. This research investigates the effects of boundary spanning conditions on the development of team trust and team satisfaction. Two hundred and eighty-two participants carried out a collaborative design task over several weeks in a virtual world, Second Life. Multigroup structural equation modeling was used to examine our research model, which compares individual level measurement between two boundary spanning team conditions. The results indicate that trusting beliefs have a positive impact on team trust, which in turn, influences team satisfaction. Further, we found that, compared to cross-boundary teams, within-boundary teams …
Bootstrapping Simulation-Based Algorithms With A Suboptimal Policy, Nguyen T., Silander T., Lee W., Tze-Yun Leong
Bootstrapping Simulation-Based Algorithms With A Suboptimal Policy, Nguyen T., Silander T., Lee W., Tze-Yun Leong
Research Collection School Of Computing and Information Systems
Finding optimal policies for Markov Decision Processes with large state spaces is in general intractable. Nonetheless, simulation-based algorithms inspired by Sparse Sampling (SS) such as Upper Confidence Bound applied in Trees (UCT) and Forward Search Sparse Sampling (FSSS) have been shown to perform reasonably well in both theory and practice, despite the high computational demand. To improve the efficiency of these algorithms, we adopt a simple enhancement technique with a heuristic policy to speed up the selection of optimal actions. The general method, called Aux, augments the look-ahead tree with auxiliary arms that are evaluated by the heuristic policy. In …
Online Community Transition Detection, Biying Tan, Feida Zhu, Qiang Qu, Siyuan Liu
Online Community Transition Detection, Biying Tan, Feida Zhu, Qiang Qu, Siyuan Liu
Research Collection School Of Computing and Information Systems
Mining user behavior patterns in social networks is of great importance in user behavior analysis, targeted marketing, churn prediction and other applications. However, less effort has been made to study the evolution of user behavior in social communities. In particular, users join and leave communities over time. How to automatically detect the online community transitions of individual users is a research problem of immense practical value yet with great technical challenges. In this paper, we propose an algorithm based on the Minimum Description Length (MDL) principle to trace the evolution of community transition of individual users, adaptive to the noisy …
Global Immutable Region Computation, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Global Immutable Region Computation, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
A top-k query shortlists the k records in a dataset that best match the user's preferences. To indicate her preferences, the user typically determines a numeric weight for each data dimension (i.e., attribute). We refer to these weights collectively as the query vector. Based on this vector, each data record is implicitly mapped to a score value (via a weighted sum function). The records with the k largest scores are reported as the result. In this paper we propose an auxiliary feature to standard top-k query processing. Specifically, we compute the maximal locus within which the query vector incurs no …
Graph-Based Semi-Supervised Learning: Realizing Pointwise Smoothness Probabilistically, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw
Graph-Based Semi-Supervised Learning: Realizing Pointwise Smoothness Probabilistically, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw
Research Collection School Of Computing and Information Systems
As the central notion in semi-supervised learning, smoothness is often realized on a graph representation of the data. In this paper, we study two complementary dimensions of smoothness: its pointwise nature and probabilistic modeling. While no existing graph-based work exploits them in conjunction, we encompass both in a novel framework of Probabilistic Graph-based Pointwise Smoothness (PGP), building upon two foundational models of data closeness and label coupling. This new form of smoothness axiomatizes a set of probability constraints, which ultimately enables class prediction. Theoretically, we provide an error and robustness analysis of PGP. Empirically, we conduct extensive experiments to show …
Evolving An Information Systems Capstone Course To Align With The Fast Changing Singapore Marketplace, Chris Boesch, Benjamin Kok Siew Gan
Evolving An Information Systems Capstone Course To Align With The Fast Changing Singapore Marketplace, Chris Boesch, Benjamin Kok Siew Gan
Research Collection School Of Computing and Information Systems
Every year, around fifty-five undergraduate teams of four to six students are required to complete a capstone course for the School of Information Systems at Singapore Management University. Each team spends approximately five months working with an industry sponsor using the latest tools and techniques. Students actively learn by implementing the system to solve a real world problem. In addition to delivering value to the local sponsor, our students learn specialized skills currently needed in the marketplace, which might not yet be incorporated into electives and core courses. In this paper, we discuss the tradeoffs of providing students and project …
Towards More Accurate Content Categorization Of Api Discussions, Bo Zhou, Xin Xia, David Lo, Cong Tian, Xinyu Wang
Towards More Accurate Content Categorization Of Api Discussions, Bo Zhou, Xin Xia, David Lo, Cong Tian, Xinyu Wang
Research Collection School Of Computing and Information Systems
Nowadays, software developers often discuss the usage of various APIs in online forums. Automatically assigning pre-defined semantic categorizes to API discussions in these forums could help manage the data in online forums, and assist developers to search for useful information. We refer to this process as content categorization of API discussions. To solve this problem, Hou and Mo proposed the usage of naive Bayes multinomial, which is an effective classification algorithm. In this paper, we propose a Cache-bAsed compoSitE algorithm, short formed as CASE, to automatically categorize API discussions. Considering that the content of an API discussion contains both textual …
Version History, Similar Report, And Structure: Putting Them Together For Improved Bug Localization, Shaowei Wang, David Lo
Version History, Similar Report, And Structure: Putting Them Together For Improved Bug Localization, Shaowei Wang, David Lo
Research Collection School Of Computing and Information Systems
During the evolution of a software system, a large number of bug reports are submitted. Locating the source code files that need to be fixed to resolve the bugs is a challenging problem. Thus, there is a need for a technique that can automatically figure out these buggy files. A number of bug localization solutions that take in a bug report and output a ranked list of files sorted based on their likelihood to be buggy have been proposed in the literature. However, the accuracy of these tools still need to be improved. In this paper, to address this need, …
Sewordsim: Software-Specific Word Similarity Database, Yuan Tian, David Lo, Julia Lawall
Sewordsim: Software-Specific Word Similarity Database, Yuan Tian, David Lo, Julia Lawall
Research Collection School Of Computing and Information Systems
Measuring the similarity of words is important in accurately representing and comparing documents, and thus improves the results of many natural language processing (NLP) tasks. The NLP community has proposed various measurements based on WordNet, a lexical database that contains relationships between many pairs of words. Recently, a number of techniques have been proposed to address software engineering issues such as code search and fault localization that require understanding natural language documents, and a measure of word similarity could improve their results. However, WordNet only contains information about words senses in general-purpose conversation, which often differ from word senses in …
Boat: An Experimental Platform For Researchers To Comparatively And Reproducibly Evaluate Bug Localization Techniques, Xinyu Wang, David Lo, Xin Xia, Xingen Wang, Pavneet Singh Kochhar, Yuan Tian, Xiaohu Yang, Shanping Li, Jianling Sun, Bo Zhou
Boat: An Experimental Platform For Researchers To Comparatively And Reproducibly Evaluate Bug Localization Techniques, Xinyu Wang, David Lo, Xin Xia, Xingen Wang, Pavneet Singh Kochhar, Yuan Tian, Xiaohu Yang, Shanping Li, Jianling Sun, Bo Zhou
Research Collection School Of Computing and Information Systems
Bug localization refers to the process of identifying source code files that contain defects from descriptions of these defects which are typically contained in bug reports. There have been many bug localization techniques proposed in the literature. However, often it is hard to compare these techniques since different evaluation datasets are used. At times the datasets are not made publicly available and thus it is difficult to reproduce reported results. Furthermore, some techniques are only evaluated on small datasets and thus it is not clear whether the results are generalizable. Thus, there is a need for a platform that allows …
Air Indexing For On-Demand Xml Data Broadcast, Weiwei Sun, Rongrui Qin, Jinjin Wu, Baihua Zheng
Air Indexing For On-Demand Xml Data Broadcast, Weiwei Sun, Rongrui Qin, Jinjin Wu, Baihua Zheng
Research Collection School Of Computing and Information Systems
XML data broadcast is an efficient way to disseminate semi-structured information in wireless mobile environments. In this paper, we propose a novel two-tier index structure to facilitate the access of XML document in an on-demand broadcast system. It provides the clients with an overall image of all the XML documents available at the server side and hence enables the clients to locate complete result sets accordingly. A pruning strategy is developed to cut down the index size and a two-tier structure is proposed to further remove any redundant information. In addition, two index distribution strategies, namely naive distribution and partial …