Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8526)
- Computer Sciences (8509)
- Databases and Information Systems (3448)
- Software Engineering (2153)
- Artificial Intelligence and Robotics (1686)
-
- Information Security (1060)
- Numerical Analysis and Scientific Computing (1024)
- Graphics and Human Computer Interfaces (926)
- Engineering (887)
- Social and Behavioral Sciences (681)
- Business (641)
- Theory and Algorithms (493)
- Computer Engineering (450)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (323)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (217)
- Transportation (195)
- Medicine and Health Sciences (178)
- Education (168)
- Management Information Systems (166)
- Data Storage Systems (161)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (107)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (121)
- Social media (74)
- Artificial intelligence (71)
- Reinforcement learning (69)
-
- Data mining (64)
- Privacy (61)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (53)
- Visualization (51)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Task analysis (48)
- Anomaly detection (47)
- Twitter (46)
- Feature extraction (45)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Classification (38)
- Publication Year
- File Type
Articles 7411 - 7440 of 8567
Full-Text Articles in Entire DC Network
Critical Success Factors In Soa Implementation, J. Erickson, Keng Siau
Critical Success Factors In Soa Implementation, J. Erickson, Keng Siau
Research Collection School Of Computing and Information Systems
Service Oriented Architecture (SOA) has become flavor du jour for many businesses. Seemingly, almost every company has implemented, is in the midst of implementing or is seriously considering a SOA project. A critical question many organizations are facing now is – what are the critical success factors for SOA implementations? This research aims to identify a list of factors relating to SOA implementation success. A Delphi study forms the research method, and inputs regarding SOA critical success factors are requested from a panel of experts.
Mining Patterns And Rules For Software Specification Discovery, David Lo, Siau-Cheng Khoo
Mining Patterns And Rules For Software Specification Discovery, David Lo, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Software specifications are often lacking, incomplete and outdated in the industry. Lack and incomplete specifications cause various software engineering problems. Studies have shown that program comprehension takes up to 45% of software development costs. One of the root causes of the high cost is the lack-of documented specification. Also, outdated and incomplete specification might potentially cause bugs and compatibility issues. In this paper, we describe novel data mining techniques to mine or reverse engineer these specifications from the pool of software engineering data. A large amount of software data is available for analysis. One form of software data is program …
Learning Outcomes For A Business Information Systems Undergraduate Program, Joelle Elmaleh, Steven Miller, Paul S. Goodman
Learning Outcomes For A Business Information Systems Undergraduate Program, Joelle Elmaleh, Steven Miller, Paul S. Goodman
Research Collection School Of Computing and Information Systems
We present a learning outcomes framework for an Information Systems (IS) undergraduate program. This framework includes a supporting software application that goes beyond any other attempt reported to date to integrate learning outcomes into program-wide and course-wide curriculum development, ongoing curriculum redesign, and student learning support. The Learning Outcomes Management System (LOMS) described here is a first-of-a-kind information system created as part of implementing a program-wide learning outcomes framework in a university setting. Our learning outcomes framework is distinct in that 1) it is based on a three-level hierarchically structured definition of learning outcomes that consistently apply to both the …
Predicting Trusts Among Users Of Online Communities - An Epinions Case Study, Haifeng Liu, Ee-Peng Lim, Hady Wirawan Lauw, Minh-Tam Le, Aixin Sun, Jaideep Srivastava, Young Ae Kim
Predicting Trusts Among Users Of Online Communities - An Epinions Case Study, Haifeng Liu, Ee-Peng Lim, Hady Wirawan Lauw, Minh-Tam Le, Aixin Sun, Jaideep Srivastava, Young Ae Kim
Research Collection School Of Computing and Information Systems
Embedding deals with reducing the high-dimensional representation of data into a low-dimensional representation. Previous work mostly focuses on preserving similarities among objects. Here, not only do we explicitly recognize multiple types of objects, but we also focus on the ordinal relationships across types. Collaborative Ordinal Embedding or COE is based on generative modelling of ordinal triples. Experiments show that COE outperforms the baselines on objective metrics, revealing its capacity for information preservation for ordinal data.
Estimating Local Optimums In Em Algorithm Over Gaussian Mixture Model, Zhenjie Zhang, Bing Tian Dai, Anthony K.H. Tung
Estimating Local Optimums In Em Algorithm Over Gaussian Mixture Model, Zhenjie Zhang, Bing Tian Dai, Anthony K.H. Tung
Research Collection School Of Computing and Information Systems
EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is not guaranteed to converge to the global optimum. Instead, it stops at some local optimums, which can be much worse than the global optimum.
On Profiling Blogs With Representative Entries, Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun
On Profiling Blogs With Representative Entries, Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun
Research Collection School Of Computing and Information Systems
With an explosive growth of blogs, information seeking in blogosphere becomes more and more challenging. One example task is to find the most relevant topical blogs against a given query or an existing blog. Such a task requires concise representation of blogs for effective and efficient searching and matching. In this paper, we investigate a new problem of profiling a blog by choosing a set of m most representative entries from the blog, where m is a predefined number that is application-dependent. With the set of selected representative entries, applications on blogs avoid handling hundreds or even thousands of entries …
Bag-Of-Visual-Words Expansion Using Visual Relatedness For Video Indexing, Yu-Gang Jiang, Chong-Wah Ngo
Bag-Of-Visual-Words Expansion Using Visual Relatedness For Video Indexing, Yu-Gang Jiang, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Bag-of-visual-words (BoW) has been popular for visual classification in recent years. In this paper, we propose a novel BoW expansion method to alleviate the effect of visual word correlation problem. We achieve this by diffusing the weights of visual words in BoW based on visual word relatedness, which is rigorously defined within a visual ontology. The proposed method is tested in video indexing experiment on TRECVID-2006 video retrieval benchmark, and an improvement of 7% over the traditional BoW is reported.
A Self-Organizing Neural Model For Multimedia Information Fusion, Luong-Dong Nguyen, Kia-Yan Woon, Ah-Hwee Tan
A Self-Organizing Neural Model For Multimedia Information Fusion, Luong-Dong Nguyen, Kia-Yan Woon, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
This paper presents a self-organizing network model for the fusion of multimedia information. By synchronizing the encoding of information across multiple media channels, the neural model known as fusion Adaptive Resonance Theory (fusion ART) generates clusters that encode the associative mappings across multimedia information in a real-time and continuous manner. In addition, by incorporating a semantic category channel, fusion ART further enables multimedia information to be fused into predefined themes or semantic categories. We illustrate the fusion ART’s functionalities through experiments on two multimedia data sets in the terrorist domain and show the viability of the proposed approach.
Revenue Management In Business Services, Brenda Dietrich, Giuseppe A. Paleologo, Laura Wynter
Revenue Management In Business Services, Brenda Dietrich, Giuseppe A. Paleologo, Laura Wynter
Research Collection School Of Computing and Information Systems
A significant portion of the services industry is focused on providing services (medical, legal, financial, personal, and travel) to individuals. However, studies have shown that a less visible but rapidly growing segment of the service sector comprises firms that provide business functions to other businesses. The sector covers tasks such as payroll processing, procurement, and information systems management, as well as business consulting, technical support, call center operations, and software development. Firms may choose to purchase, rather than perform, these business functions to reduce costs, to mitigate risk, or simply to focus on their processes that provide marketplace differentiation. Transferring …
Comments-Oriented Document Summarization: Understanding Documents With Readers' Feedback, Meishan Hu, Aixin Sun, Ee Peng Lim
Comments-Oriented Document Summarization: Understanding Documents With Readers' Feedback, Meishan Hu, Aixin Sun, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Comments left by readers on Web documents contain valuable information that can be utilized in different information retrieval tasks including document search, visualization, and summarization. In this paper, we study the problem of comments-oriented document summarization and aim to summarize a Web document (e.g., a blog post) by considering not only its content, but also the comments left by its readers. We identify three relations (namely, topic, quotation, and mention) by which comments can be linked to one another, and model the relations in three graphs. The importance of each comment is then scored by: (i) graph-based method, where the …
Searching Correlated Objects In A Long Sequence, Ken C. K. Lee, Wang-Chien Lee, Donna Peuquet, Baihua Zheng
Searching Correlated Objects In A Long Sequence, Ken C. K. Lee, Wang-Chien Lee, Donna Peuquet, Baihua Zheng
Research Collection School Of Computing and Information Systems
Sequence, widely appearing in various applications (e.g. event logs, text documents, etc) is an ordered list of objects. Exploring correlated objects in a sequence can provide useful knowledge among the objects, e.g., event causality in event log and word phrases in documents. In this paper, we introduce correlation query that finds correlated pairs of objects often appearing closely to each other in a given sequence. A correlation query is specified by two control parameters, distance bound, the requirement of object closeness, and correlation threshold, the minimum requirement of correlation strength of result pairs. Instead of processing the query by scanning …
Spreadsheet Modeling Of Equipment Acquisition Plan, Thin Yin Leong, Michelle L. F. Cheong
Spreadsheet Modeling Of Equipment Acquisition Plan, Thin Yin Leong, Michelle L. F. Cheong
Research Collection School Of Computing and Information Systems
Excel spreadsheets have been used in many classrooms to teach modeling and analysis of real business problems. This can be done with relative ease but often the modeling approach may be inappropriate and the analysis results not easily implemented. In this article, we illustrate these difficulties with the modeling of the number of equipment required in future years, given demand (historical and projected) and the amount of equipment held. We show how the desired output can be, and needs to be related to the given input. For this purpose, we apply the TREND function to predict data into future years. …
Searching Blogs And News: A Study On Popular Queries, Aixin Sun, Meishan Hu, Ee Peng Lim
Searching Blogs And News: A Study On Popular Queries, Aixin Sun, Meishan Hu, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Blog/news search engines are very important channels to reach information about the real-time happenings. In this paper, we study the popular queries collected over one year period and compare their search results returned by a blog search engine (i.e., Technorati) and a news search engine (i.e., Google News). We observed that the numbers of hits returned by the two search engines for the same set of queries were highly correlated, suggesting that blogs often provide commentary to current events reported in news. As many popular queries are related to some events, we further observed a high cohesiveness among the returned …
Tree-Based Partition Querying: A Methodology For Computing Medoids In Large Spatial Datasets, Kyriakos Mouratidis, Dimitris Papadias, Spiros Papadimitriou
Tree-Based Partition Querying: A Methodology For Computing Medoids In Large Spatial Datasets, Kyriakos Mouratidis, Dimitris Papadias, Spiros Papadimitriou
Research Collection School Of Computing and Information Systems
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous emerging fields, such as location based services and sensor networks. Since the k-medoid problem is NP hard, all existing work deals with approximate solutions on relatively small datasets. This paper aims at efficient methods for very large spatial databases, motivated by: (i) the high and ever increasing availability of spatial data, and (ii) the need for novel query types and improved services. The proposed solutions exploit the intrinsic grouping properties of a data partition index in order …
User Guidance Of Resource-Adaptive Systems, João Pedro Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan
User Guidance Of Resource-Adaptive Systems, João Pedro Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan
Research Collection School Of Computing and Information Systems
This paper presents a framework for engineering resource-adaptive software systems targeted at small mobile devices. The proposed framework empowers users to control tradeoffs among a rich set of ervicespecific aspects of quality of service. After motivating the problem, the paper proposes a model for capturing user preferences with respect to quality of service, and illustrates prototype user interfaces to elicit such models. The paper then describes the extensions and integration work made to accommodate the proposed framework on top of an existing software infrastructure for ubiquitous computing. The research question addressed here is the feasibility of coordinating resource allocation and …
Active Kernel Learning, Steven C. H. Hoi, Rong Jin
Active Kernel Learning, Steven C. H. Hoi, Rong Jin
Research Collection School Of Computing and Information Systems
Identifying the appropriate kernel function/matrix for a given dataset is essential to all kernel-based learning techniques. A number of kernel learning algorithms have been proposed to learn kernel functions or matrices from side information (e.g., either labeled examples or pairwise constraints). However, most previous studies are limited to “passive” kernel learning in which side information is provided beforehand. In this paper we present a framework of Active Kernel Learning (AKL) that actively identifies the most informative pairwise constraints for kernel learning. The key challenge of active kernel learning is how to measure the informativeness of an example pair given its …
Bounded Model Checking Of Compositional Processes, Jun Sun, Yang Liu, Jin Song Dong, Jing Sun
Bounded Model Checking Of Compositional Processes, Jun Sun, Yang Liu, Jin Song Dong, Jing Sun
Research Collection School Of Computing and Information Systems
Verification techniques like SAT-based bounded model checking have been successfully applied to a variety of system models. Applying bounded model checking to compositional process algebras is, however, not a trivial task. One challenge is that the number of system states for process algebra models is not statically known, whereas exploring the full state space is computationally expensive. This paper presents a compositional encoding of hierarchical processes as SAT problems and then applies state-of-the-art SAT solvers for bounded model checking. The encoding avoids exploring the full state space for complex systems so as to deal with state space explosion. We developed …
Timeline Prediction Framework For Iterative Software Engineering Projects With Changes, Kay Berkling, Georgios Kiragiannis, Armin Zundel, Subhajit Datta
Timeline Prediction Framework For Iterative Software Engineering Projects With Changes, Kay Berkling, Georgios Kiragiannis, Armin Zundel, Subhajit Datta
Research Collection School Of Computing and Information Systems
Even today, software projects still suffer from delays and budget overspending. The causes for this problem are compounded when the project team is distributed across different locations and generally attributed to the decreasing ability to communicate well (due to cultural, linguistic, and physical distance). Many projects, especially those with off-shoring component, consist of small iterations with changes, deletions and additions, yet there is no formal model of the flow of iterations available. A number of commercially available project prediction tools for projects as a whole exist, but the model adaptation process by iteration, if it exists, is unclear. Furthermore, no …
Empirical Analysis Of Certificate Revocation Lists, Daryl Walleck, Yingjiu Li, Shouhuai Xu
Empirical Analysis Of Certificate Revocation Lists, Daryl Walleck, Yingjiu Li, Shouhuai Xu
Research Collection School Of Computing and Information Systems
Managing public key certificates revocation has long been a central issue in public key infrastructures. Though various certificate revocation mechanisms have been proposed to address this issue, little effort has been devoted to the empirical analysis of real-world certificate revocation data. In this paper, we conduct such an empirical analysis based on a large amount of data collected from VeriSign. Our study enables us to understand how long a revoked certificate lives and what the difference is in the lifetime of revoked certificates by certificate types, geographic locations, and organizations. Our study also provides a solid foundation for future research …
Issues And Procedures In Adopting Structural Equation Modelling Technique, Siu Loon Hoe
Issues And Procedures In Adopting Structural Equation Modelling Technique, Siu Loon Hoe
Research Collection School Of Computing and Information Systems
When applying structural equation modeling (SEM) technique for analytical procedures, various issues are involved. These issues may concern sample size, overall fit indices and approach. Initiates of SEM may find it somewhat daunting in resolving these technical issues. The purpose of this paper is to highlight key issues in adopting SEM technique and various approaches available. This paper provides a discussion on the sample size, fit indices, standardized paths, unidimensionality test and various approaches in relation to SEM. It is hoped that having reviewed the paper, new researchers can devote more time to data analysis instead of procedural issues involved.
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Ranked Reverse Nearest Neighbor Search, Ken C. K. Lee, Baihua Zheng, Wang-Chien Lee
Research Collection School Of Computing and Information Systems
Given a set of data points P and a query point q in a multidimensional space, Reverse Nearest Neighbor (RNN) query finds data points in P whose nearest neighbors are q. Reverse k-Nearest Neighbor (RkNN) query (where k ≥ 1) generalizes RNN query to find data points whose kNNs include q. For RkNN query semantics, q is said to have influence to all those answer data points. The degree of q's influence on a data point p (∈ P) is denoted by κp where q is the κp-th NN of p. We introduce a new variant of RNN query, namely, …
Linear Relaxation Techniques For Task Management In Uncertain Settings, Pradeep Varakantham, Stephen F. Smith
Linear Relaxation Techniques For Task Management In Uncertain Settings, Pradeep Varakantham, Stephen F. Smith
Research Collection School Of Computing and Information Systems
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably juggling multiple concurrent streams of tasks (or work flows) of varying importance and urgency. There is uncertainty with respect to the duration of a pending task as well as the amount of follow-on work that may be generated as a result of executing the task. The user’s goal is to be as productive as possible; i.e., to execute tasks that realize the maximum cumulative payoff. This is achieved by enabling …
Mobile Interaction Design: Integrating Individual And Organizational Perspectives, Peter Tarasewich, Jun Gong, Fiona Fui-Hoon Nah, David Dewester
Mobile Interaction Design: Integrating Individual And Organizational Perspectives, Peter Tarasewich, Jun Gong, Fiona Fui-Hoon Nah, David Dewester
Research Collection School Of Computing and Information Systems
While mobile computing provides organizations with many information systems implementation alternatives, it is often difficult to predict the potential benefits, limitations, and problems with mobile applications. Given the inherent portability of mobile devices, many design and use issues can arise which do not exist with desktop systems. While many existing rules of thumb for design of stationary systems apply to mobile systems, many new ones emerge. Issues such as the security and privacy of information take on new dimensions, and potential conflicts can develop when a single mobile device serves both personal and business needs. This paper identifies potential issues …
Mining Past-Time Temporal Rules From Execution Traces, David Lo, Siau-Cheng Khoo, Chao Liu
Mining Past-Time Temporal Rules From Execution Traces, David Lo, Siau-Cheng Khoo, Chao Liu
Research Collection School Of Computing and Information Systems
Specification mining is a process of extracting specifications, often from program execution traces. These specifications can in turn be used to aid program understanding, monitoring and verification. There are a number of dynamic-analysis-based specification mining tools in the literature, however none so far extract past time temporal expressions in the form of rules stating: whenever a series of events occurs, previously another series of events has happened. Rules of this format are commonly found in practice and useful for various purposes. Most rule-based specification mining tools only mine future-time temporal expression. Many past-time temporal rules like whenever a resource is …
Mining Temporal Rules For Software Maintenance, David Lo, Siau-Cheng Khoo, Chao Liu
Mining Temporal Rules For Software Maintenance, David Lo, Siau-Cheng Khoo, Chao Liu
Research Collection School Of Computing and Information Systems
Software evolution incurs difficulties in program comprehension and software verification, and hence it increases the cost of software maintenance. In this study, we propose a novel technique to mine from program execution traces a sound and complete set of statistically significant temporal rules of arbitrary lengths. The extracted temporal rules reveal invariants that the program observes, and will consequently guide developers to understand the program behaviors, and facilitate all downstream applications such as verification and debugging. Different from previous studies that were restricted to mining two-event rules (e.g., (lock) →(unlock)), our algorithm discovers rules of arbitrary lengths. In order to …
H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings
H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings
Research Collection School Of Computing and Information Systems
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together in fewer messages, which produce much less networking overhead than search. Nevertheless, these messages are exponential in size. The basic DPOP always communicates all possible assignments, even when some of them may be inconsistent due to hard constraints. Many real problems contain hard constraints that significantly reduce the space of feasible assignments. This paper introduces H-DPOP, a hybrid algorithm that is based on DPOP, which uses Constraint Decision Diagrams (CDD) to rule out infeasible assignments, and thus compactly …
Semi-Supervised Ensemble Ranking, Steven C. H. Hoi, Rong Jin
Semi-Supervised Ensemble Ranking, Steven C. H. Hoi, Rong Jin
Research Collection School Of Computing and Information Systems
Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance by combining the outputs from multiple ranking algorithms. Many ensemble ranking approaches employ supervised learning techniques to learn appropriate weights for combining multiple rankers. The main shortcoming with these approaches is that the learned weights for ranking algorithms are query independent. This is suboptimal since a ranking algorithm could perform well for certain queries but poorly for others. In this paper, we propose a novel semi-supervised ensemble ranking (SSER) algorithm that learns query-dependent weights when combining …
Mapping The Multi-Tiered Impacts Of The Growth Of It Industries In India: A Combined Scale-And-Scope Externalities Perspective, Robert J. Kauffman, Ajay Kumar
Mapping The Multi-Tiered Impacts Of The Growth Of It Industries In India: A Combined Scale-And-Scope Externalities Perspective, Robert J. Kauffman, Ajay Kumar
Research Collection School Of Computing and Information Systems
Externalities occur among agglomerated firms. Scale externalities occur between firms in the same industry. Scope externalities occur when heterogeneous industries are collocated. Combined scale-and-scope externalities exist when the scale of one industry is beneficial to the growth of another collocated industry. In the Sein and Haridranath (2004) framework of information technology (IT) impacts on development, scale externalities correspond to second-order impacts, while combined scale and scope eternalities correspond to third-order impacts. We use an agglomeration perspective to explain the growth of IT industries in India. We study growth patterns of four specific IT industries: computer and peripheral equipment manufacturing, semiconductor …
Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi
Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi
Research Collection School Of Computing and Information Systems
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variables. A number of automated analyzers for Timed Automata have been developed. However, Timed Automata lack composable patterns for high-level system design. Specification languages like Timed Communicating Sequential Process (CSP) and Timed Communicating Object-Z (TCOZ) are well suited for presenting compositional models of complex real-time systems. In this work, we define a set of composable Timed Automata patterns based on hierarchical constructs in time-enriched process algebras. The patterns facilitate the hierarchical design of complex systems …
An Office Survival Guide, M. Thulasidas
An Office Survival Guide, M. Thulasidas
Research Collection School Of Computing and Information Systems
In the unforgiving, dog-eat-dog corporate jungle, when you find yourself in a new corporate setting, you need to be sure of the welcome. More importantly, you need to prove yourself worthy of it.