Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (6878)
- Databases and Information Systems (2867)
- Software Engineering (1846)
- Artificial Intelligence and Robotics (989)
- Numerical Analysis and Scientific Computing (931)
-
- Information Security (895)
- Engineering (770)
- Graphics and Human Computer Interfaces (661)
- Social and Behavioral Sciences (586)
- Business (530)
- Theory and Algorithms (438)
- Computer Engineering (394)
- Operations Research, Systems Engineering and Industrial Engineering (358)
- Programming Languages and Compilers (287)
- OS and Networks (282)
- Communication (272)
- Social Media (220)
- Public Affairs, Public Policy and Public Administration (175)
- Data Storage Systems (157)
- Transportation (156)
- Medicine and Health Sciences (145)
- Management Information Systems (141)
- Education (126)
- E-Commerce (114)
- International and Area Studies (95)
- Asian Studies (94)
- Technology and Innovation (84)
- Health Information Technology (83)
- Finance and Financial Management (77)
- Keyword
-
- Deep learning (103)
- Machine learning (86)
- Social media (65)
- Data mining (56)
- Artificial intelligence (55)
-
- Cloud computing (55)
- Reinforcement learning (51)
- Optimization (49)
- Twitter (46)
- Visualization (46)
- Online learning (45)
- Privacy (45)
- Deep Learning (44)
- Empirical study (44)
- Security (44)
- Software engineering (44)
- Task analysis (44)
- Neural networks (43)
- Feature extraction (41)
- Singapore (40)
- Access control (39)
- Semantics (39)
- Algorithms (38)
- Blockchain (36)
- Classification (36)
- Anomaly detection (34)
- Clustering (34)
- Collaboration (34)
- Android (33)
- Software (32)
- Publication Year
- File Type
Articles 5551 - 5580 of 6891
Full-Text Articles in Physical Sciences and Mathematics
Designing The Dynamics Of Service Innovations, Arcot Desai Narasimhalu
Designing The Dynamics Of Service Innovations, Arcot Desai Narasimhalu
Research Collection School Of Computing and Information Systems
There is no serious tool available to design service innovations even as it is gaining in important attention from the academic and industrial worlds. This paper presents a method that is specifically developed to help service innovators plan and design their innovations. The method recognizes the dependencies that exist across a service provider, customers and suppliers and help identify potential inconsistencies in the design of service innovations.
Player Performance Prediction In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Richa Sharan, Jaideep Srivastava
Player Performance Prediction In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Richa Sharan, Jaideep Srivastava
Research Collection School Of Computing and Information Systems
In this study, we propose a comprehensive performance management tool for measuring and reporting operational activities of game players. This study uses performance data of game players in EverQuest II, a popular MMORPG developed by Sony Online Entertainment, to build performance prediction models forgame players. The prediction models provide a projection of player’s future performance based on his past performance, which is expected to be a useful addition to existing player performance monitoring tools. First, we show that variations of PECOTA [2] and MARCEL [3], two most popular baseball home run prediction methods, can be used for game player performance …
Weakly-Supervised Hashing In Kernel Space, Yadong Mu, Jialie Shen, Shuicheng Yan
Weakly-Supervised Hashing In Kernel Space, Yadong Mu, Jialie Shen, Shuicheng Yan
Research Collection School Of Computing and Information Systems
The explosive growth of the vision data motivates the recent studies on efficient data indexing methods such as locality-sensitive hashing (LSH). Most existing approaches perform hashing in an unsupervised way. In this paper we move one step forward and propose a supervised hashing method, i.e., the LAbel-regularized Max-margin Partition (LAMP) algorithm. The proposed method generates hash functions in weakly-supervised setting, where a small portion of sample pairs are manually labeled to be “similar” or “dissimilar”. We formulate the task as a Constrained Convex-Concave Procedure (CCCP), which can be relaxed into a series of convex sub-problems solvable with efficient Quadratic-Program (QP). …
Mining Antagonistic Communities From Social Networks, Kuan Zhang, David Lo, Ee Peng Lim
Mining Antagonistic Communities From Social Networks, Kuan Zhang, David Lo, Ee Peng Lim
Research Collection School Of Computing and Information Systems
During social interactions in a community, there are often sub-communities that behave in opposite manner. These antagonistic sub-communities could represent groups of people with opposite tastes, factions within a community distrusting one another, etc. Taking as input a set of interactions within a community, we develop a novel pattern mining approach that extracts for a set of antagonistic sub-communities. In particular, based on a set of user specified thresholds, we extract a set of pairs of sub-communities that behave in opposite ways with one another. To prevent a blow up in these set of pairs, we focus on extracting a …
A Discriminative Model Approach For Accurate Duplicate Bug Report Retrieval, Chengnian Sun, David Lo, Xiaoyin Wang, Siau-Cheng Khoo
A Discriminative Model Approach For Accurate Duplicate Bug Report Retrieval, Chengnian Sun, David Lo, Xiaoyin Wang, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Bug repositories are usually maintained in software projects. Testers or users submit bug reports to identify various issues with systems. Sometimes two or more bug reports correspond to the same defect. To address the problem with duplicate bug reports, a person called a triager needs to manually label these bug reports as duplicates, and link them to their "master" reports for subsequent maintenance work. However, in practice there are considerable duplicate bug reports sent daily; requesting triagers to manually label these bugs could be highly time consuming. To address this issue, recently, several techniques have be proposed using various similarity …
Exploiting Query Logs For Cross-Lingual Query Suggestions., Wei Gao, Cheng Niu, Jian-Yun Nie, Ming Zhou, Kam-Fai Wong, Hsiao-Wuen Hon
Exploiting Query Logs For Cross-Lingual Query Suggestions., Wei Gao, Cheng Niu, Jian-Yun Nie, Ming Zhou, Kam-Fai Wong, Hsiao-Wuen Hon
Research Collection School Of Computing and Information Systems
Query suggestion aims to suggest relevant queries for a given query, which helps users better specify their information needs. Previous work on query suggestion has been limited to the same language. In this article, we extend it to cross-lingual query suggestion (CLQS): for a query in one language, we suggest similar or relevant queries in other languages. This is very important to the scenarios of cross-language information retrieval (CLIR) and other related cross-lingual applications. Instead of relying on existing query translation technologies for CLQS, we present an effective means to map the input query of one language to queries of …
Open Innovation In Platform Competition, Mei Lin
Open Innovation In Platform Competition, Mei Lin
Research Collection School Of Computing and Information Systems
We examine the competition between a proprietary platform and an open platform,where each platform holds a two-sided market consisted of app developers and users.The open platform cultivates an innovative environment by inviting public efforts todevelop the platform itself and permitting distribution of apps outside of its own appmarket; the proprietary platform restricts apps sales solely within its app market. Weuse a game theoretic model to capture this competitive phenomenon and analyze theimpact of growth of the open source community on the platform competition. We foundthat growth of the open community mitigates the platform rivalry, and balances the developernetwork sizes on …
A Scalable And Energy-Efficient Context Monitoring Framework For Mobile Personal Sensor Networks, Seungwoo Kang, Jinwon Lee, Hyukjae Jang, Youngki Lee, Souneil Park, Junehwa Song
A Scalable And Energy-Efficient Context Monitoring Framework For Mobile Personal Sensor Networks, Seungwoo Kang, Jinwon Lee, Hyukjae Jang, Youngki Lee, Souneil Park, Junehwa Song
Research Collection School Of Computing and Information Systems
The key feature of many emerging pervasive computing applications is to proactively provide services to mobile individuals. One major challenge in providing users with proactive services lies in continuously monitoring users’ context based on numerous sensors in their PAN/BAN environments. The context monitoring in such environments imposes heavy workloads on mobile devices and sensor nodes with limited computing and battery power. We present SeeMon, a scalable and energy-efficient context monitoring framework for sensor-rich, resource-limited mobile environments. Running on a personal mobile device, SeeMon effectively performs context monitoring involving numerous sensors and applications. On top of SeeMon, multiple applications on the …
Point-Based Backup For Decentralized Pompds: Complexity And New Algorithms, Akshat Kumar, Shlomo Zilberstein
Point-Based Backup For Decentralized Pompds: Complexity And New Algorithms, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up existing algorithms, largely due to the use of point-based methods. Performing point-based backup is a fundamental operation in state-of-the-art algorithms. We show that even a single backup step in the multi-agent setting is NP-Complete. Despite this negative worst-case result, we present an efficient and scalable optimal algorithm as well as a principled approximation scheme. The optimal algorithm exploits recent advances in the weighted CSP literature to overcome the complexity of the backup operation. The polytime approximation scheme …
Exclusive Lasso For Multi-Task Feature Selection, Yang Zhou, Rong Jin, Steven C. H. Hoi
Exclusive Lasso For Multi-Task Feature Selection, Yang Zhou, Rong Jin, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
We propose a novel group regularization which we call exclusive lasso. Unlike the group lasso regularizer that assumes co-varying variables in groups, the proposed exclusive lasso regularizer models the scenario when variables in the same group compete with each other. Analysis is presented to illustrate the properties of the proposed regularizer. We present a framework of kernel-based multi-task feature selection algorithm based on the proposed exclusive lasso regularizer. An efficient algorithm is derived to solve the related optimization problem. Experiments with document categorization show that our approach outperforms state-of-the-art algorithms for multi-task feature selection.
Innovative Entrepreneurs Workbook, Arcot Desai Narasimhalu
Innovative Entrepreneurs Workbook, Arcot Desai Narasimhalu
Research Collection School Of Computing and Information Systems
The workbook provides a step by step approach to identifying innovation opportunities and the key aspects of Innovation development
Bridging Lightweight And Heavyweight Task Organization: The Role Of Tags In Adopting New Task Categories, Christoph Treude, Margaret-Anne Storey
Bridging Lightweight And Heavyweight Task Organization: The Role Of Tags In Adopting New Task Categories, Christoph Treude, Margaret-Anne Storey
Research Collection School Of Computing and Information Systems
In collaborative software development projects, tasks are often used as a mechanism to coordinate and track shared development work. Modern development environments provide explicit support for task management where tasks are typically organized and managed through predefined categories. Although there have been many studies that analyze data available from task management systems, there has been relatively little work on the design of task management tools. In this paper we explore how tagging with freely assigned keywords provides developers with a lightweight mechanism to further categorize and annotate development tasks. We investigate how tags that are frequently used over a long …
Web2se: First Workshop On Web 2.0 For Software Engineering, Christoph Treude, Margaret-Anne Storey, Kate Ehrlich, Arie Van Deursen
Web2se: First Workshop On Web 2.0 For Software Engineering, Christoph Treude, Margaret-Anne Storey, Kate Ehrlich, Arie Van Deursen
Research Collection School Of Computing and Information Systems
Social software is built around an "architecture of participation" where user data is aggregated as a side-effect of using Web 2.0 applications. Web 2.0 implies that processes and tools are socially open, and that content can be used in several different contexts. Web 2.0 tools and technologies support interactive information sharing, data interoperability and user centered design. For instance, wikis, blogs, tags and feeds help us organize, manage and categorize content in an informal and collaborative way. One goal of this workshop is to investigate how these technologies can improve software development practices. Some of these technologies have made their …
Towards Finding Robust Execution Strategies For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau
Towards Finding Robust Execution Strategies For Rcpsp/Max With Durational Uncertainty, Na Fu, Pradeep Varakantham, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Resource Constrained Project Scheduling Problems with minimum and maximum time lags (RCPSP/max) have been studied extensively in the literature. However, the more realistic RCPSP/max problems — ones where durations of activities are not known with certainty – have received scant interest and hence are the main focus of the paper. Towards addressing the significant computational complexity involved in tackling RCPSP/max with durational uncertainty, we employ a local search mechanism to generate robust schedules. In this regard, we make two key contributions: (a) Introducing and studying the key properties of a new decision rule to specify start times of activities with …
The Role Of Emergent Knowledge Structures In Collaborative Software Development, Christoph Treude
The Role Of Emergent Knowledge Structures In Collaborative Software Development, Christoph Treude
Research Collection School Of Computing and Information Systems
Many collaboration features in software development tools draw on lightweight technologies such as tagging and wikis. We propose to study the role of emergent knowledge structures created through these features. Using a mixed-methods approach, we investigate which processes emergent knowledge structures support and how tool support can leverage them.
Awareness 2.0: Staying Aware Of Projects, Developers And Tasks Using Dashboards And Feeds, Christoph Treude, Margaret-Anne Storey
Awareness 2.0: Staying Aware Of Projects, Developers And Tasks Using Dashboards And Feeds, Christoph Treude, Margaret-Anne Storey
Research Collection School Of Computing and Information Systems
Software development teams need to maintain awareness of various different aspects ranging from overall project status and process bottlenecks to current tasks and incoming artifacts. Currently, there is a lack of theoretical foundations to guide tool selection and tool design to best support awareness tasks. In this paper, we explore how the combination of highly configurable project, team and contributor dashboards along with individual event feeds is used to accomplish extensive awareness. Our results stem from an empirical study of several large development teams, with a detailed study of a team of 150 developers and additional data from another four …
Time-Bound Hierarchical Key Assignment: An Overview, Wen Tao Zhu, Robert H. Deng, Jianying Zhou, Feng Bao
Time-Bound Hierarchical Key Assignment: An Overview, Wen Tao Zhu, Robert H. Deng, Jianying Zhou, Feng Bao
Research Collection School Of Computing and Information Systems
The access privileges in distributed systems can be effectively organized as a partial-order hierarchy that consists of distinct security classes, and the access rights are often designated with certain temporal restrictions. The time-bound hierarchical key assignment problem is to assign distinct cryptographic keys to distinct security classes according to their privileges so that users from a higher class can use their class key to derive the keys of lower classes, and these keys are time-variant with respect to sequentially allocated temporal units called time slots. In this paper, we present the involved principle, survey the state of the art, and …
Learning User Profiles For Personalized Information Dissemination, Ah-Hwee Tan, Christine Teo
Learning User Profiles For Personalized Information Dissemination, Ah-Hwee Tan, Christine Teo
Research Collection School Of Computing and Information Systems
Personalized information systems represent the recent effort of delivering information to users more effectively in the modern electronic age. This paper illustrates how a supervised Adaptive Resonance Theory (ART) system, known as fuzzy ARAM, can be used to learn user profiles for personalized information dissemination. ARAM learning is on-line, fast, and incremental. Acquisition of new knowledge does not require re-training on previously learned cases. ARAM integrates both user-defined and system-learned knowledge in a single framework. Therefore inconsistency between the two knowledge sources will not arise. ARAM has been used to develop a personalized news system known as PIN. Preliminary experiments …
Efficient Unidirectional Proxy Re-Encryption, Sherman Chow, Weng Jian, Yanjiang Yang, Robert H. Deng
Efficient Unidirectional Proxy Re-Encryption, Sherman Chow, Weng Jian, Yanjiang Yang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Proxy re-encryption (PRE) allows a semi-trusted proxy to convert a ciphertext originally intended for Alice into one encrypting the same plaintext for Bob. The proxy only needs a re-encryption key given by Alice, and cannot learn anything about the plaintext encrypted. This adds flexibility in various applications, such as confidential email, digital right management and distributed storage. In this paper, we study unidirectional PRE, which the re-encryption key only enables delegation in one direction but not the opposite. In PKC 2009, Shao and Cao proposed a unidirectional PRE assuming the random oracle. However, we show that it is vulnerable to …
Global Project Management: Pedagogy For Distributed Teams, Benjamin Kok Siew Gan, Randy Weinberg, Selma Limam Mansar
Global Project Management: Pedagogy For Distributed Teams, Benjamin Kok Siew Gan, Randy Weinberg, Selma Limam Mansar
Research Collection School Of Computing and Information Systems
This paper reflects on pedagogy for teaching collaborative global projects across universities in different countries. Over a period of four years, students at three universities - one in the United States, one in Singapore and one in the Middle East - enrolled in a course called "Global Project Management". In this course, coordinated across locations, students experience a global project with distant team members. We describe the course experience and student perceptions of the requisite skills, collaboration tools and challenges bearing on effective global project work.
Two-View Transductive Support Vector Machines, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang
Two-View Transductive Support Vector Machines, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang
Research Collection School Of Computing and Information Systems
Obtaining high-quality and up-to-date labeled data can be difficult in many real-world machine learning applications, especially for Internet classification tasks like review spam detection, which changes at a very brisk pace. For some problems, there may exist multiple perspectives, so called views, of each data sample. For example, in text classification, the typical view contains a large number of raw content features such as term frequency, while a second view may contain a small but highly-informative number of domain specific features. We thus propose a novel two-view transductive SVM that takes advantage of both the abundant amount of unlabeled data …
A Comparative Exploration Of Freebsd Bug Lifetimes, Gargi Bougie, Christoph Treude, Daniel M. Germán, Margaret-Anne Storey
A Comparative Exploration Of Freebsd Bug Lifetimes, Gargi Bougie, Christoph Treude, Daniel M. Germán, Margaret-Anne Storey
Research Collection School Of Computing and Information Systems
In this paper, we explore the viability of mining the basic data provided in bug repositories to predict bug lifetimes. We follow the method of Lucas D. Panjer as described in his paper, Predicting Eclipse Bug Lifetimes. However, in place of Eclipse data, the FreeBSD bug repository is used. We compare the predictive accuracy of five different classification algorithms applied to the two data sets. In addition, we propose future work on whether there is a more informative way of classifying bugs than is considered by current bug tracking systems.
Shifting Inference Control To User Side: Architecture And Protocol, Yanjiang Yang, Yingjiu Li, Robert H. Deng, Feng Bao
Shifting Inference Control To User Side: Architecture And Protocol, Yanjiang Yang, Yingjiu Li, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
Inference has been a longstanding issue in database security, and inference control, aiming to curb inference, provides an extra line of defense to the confidentiality of databases by complementing access control. However, in traditional inference control architecture, database server is a crucial bottleneck, as it enforces highly computation-intensive auditing for all users who query the protected database. As a result, most auditing methods, though rigorously studied, are not practical for protecting large-scale real-world database systems. In this paper, we shift this paradigm by proposing a new inference control architecture, entrusting inference control to each user's platform that is equipped with …
A Verification System For Interval-Based Specification Languages, Chunqing Chen, Jin Song Dong, Jun Sun, Andrew P. Martin
A Verification System For Interval-Based Specification Languages, Chunqing Chen, Jin Song Dong, Jun Sun, Andrew P. Martin
Research Collection School Of Computing and Information Systems
Interval-based specification languages have been used to formally model and rigorously reason about real-time computing systems. This usually involves logical reasoning and mathematical computation with respect to continuous or discrete time. When these systems are complex, analyzing their models by hand becomes error-prone and difficult. In this article, we develop a verification system to facilitate the formal analysis of interval-based specification languages with machine-assisted proof support. The verification system is developed using a generic theorem prover, Prototype Verification System (PVS). Our system elaborately encodes a highly expressive set-based notation, Timed Interval Calculus (TIC), and can rigorously carry out the verification …
Finding Influentials Based On The Temporal Order Of Information Adoption In Twitter, Changhyun Lee, Haewoon Kwak, Hosung Park, Sue Moon
Finding Influentials Based On The Temporal Order Of Information Adoption In Twitter, Changhyun Lee, Haewoon Kwak, Hosung Park, Sue Moon
Research Collection School Of Computing and Information Systems
Twitter offers an explicit mechanism to facilitate information diffusion and has emerged as a new medium for communication. Many approaches to find influentials have been proposed, but they do not consider the temporal order of information adoption. In this work, we propose a novel method to find influentials by considering both the link structure and the temporal order of information adoption in Twitter. Our method finds distinct influentials who are not discovered by other methods.
What Is Twitter, A Social Network Or A News Media?, Haewoon Kwak, Changhyun Lee, Hosung: Moon Park
What Is Twitter, A Social Network Or A News Media?, Haewoon Kwak, Changhyun Lee, Hosung: Moon Park
Research Collection School Of Computing and Information Systems
Twitter, a microblogging service less than three years old, commands more than 41 million users as of July 2009 and is growing fast. Twitter users tweet about any topic within the 140-character limit and follow others to receive their tweets. The goal of this paper is to study the topological characteristics of Twitter and its power as a new medium of information sharing.We have crawled the entire Twitter site and obtained 41.7 million user profiles, 1.47 billion social relations, 4,262 trending topics, and 106 million tweets. In its follower-following topology analysis we have found a non-power-law follower distribution, a short …
Mashup Environments In Software Engineering, Lars Grammel, Christoph Treude, Margaret-Anne Storey
Mashup Environments In Software Engineering, Lars Grammel, Christoph Treude, Margaret-Anne Storey
Research Collection School Of Computing and Information Systems
Too often, software engineering (SE) tool research is focused on creating small, stand-alone tools that address rarely understood developer needs. We believe that research should instead provide developers with flexible environments and interoperable tools, and then study how developers appropriate and tailor these tools in practice. Although there has been some prior work on this, we feel that flexible tool environments for SE have not yet been fully explored. In particular, we propose adopting the Web 2.0 idea of mashups and mashup environments to support SE practitioners in analytic activities involving multiple information sources.
Generating Synonyms Based On Query Log Data, Stelios Paparizos, Tao Cheng, Hady W. Lauw
Generating Synonyms Based On Query Log Data, Stelios Paparizos, Tao Cheng, Hady W. Lauw
Research Collection School Of Computing and Information Systems
An approach is described for generating synonyms to supplement at least one information item, such as, in one case, a set of related items. The approach can involve an expansion phase, a clean-up phase, and a reduction phase. In the expansion phase, the approach identifies, for each related item, a set of initial synonym candidates. In the clean-up phase, the approach removes noise from the set of initial synonym candidates (if such noise exists), to provide a set of filtered synonym candidate items. In the reduction phase, the approach ranks and applies a threshold (or thresholds) to the set of …
Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis
Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis
Research Collection School Of Computing and Information Systems
Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The capacity constrained assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms are applicable …
Practical Id-Based Encryption For Wireless Sensor Network, Cheng-Kang Chu, Joseph K. Liu, Jianying Zhou, Feng Bao, Robert H. Deng
Practical Id-Based Encryption For Wireless Sensor Network, Cheng-Kang Chu, Joseph K. Liu, Jianying Zhou, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
In this paper, we propose a new practical identity-based encryption scheme which is suitable for wireless sensor network (WSN). We call it Receiver-Bounded Online/Offline Identity-based Encryption (RB-OOIBE). It splits the encryption process into two parts -- the offline and the online part. In the offline part, all heavy computations are done without the knowledge of the receiver's identity and the plaintext message. In the online stage, only light computations such as modular operation and symmetric key encryption are required, together with the receiver's identity and the plaintext message. Moreover, since each offline ciphertext can be re-used for the same receiver, …