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 7801 - 7830 of 8567
Full-Text Articles in Entire DC Network
E-Healthcare In Abc County Health Department (Abcchd): Trade-Offs Analysis And Evaluation, Keng Siau, Hwee-Joo Kam
E-Healthcare In Abc County Health Department (Abcchd): Trade-Offs Analysis And Evaluation, Keng Siau, Hwee-Joo Kam
Research Collection School Of Computing and Information Systems
The issue of privacy stirred a tumultuous uproar when the ABC County Health Department (ABCCHD) was planning for an e-Healthcare system that utilized information technology to streamline the administration process of patients. ABCCHD had hired a software vendor, Info-Health, a company that specialized in information system development for the healthcare industry to help in the project. The privacy of patients with Sexually Transmitted Diseases/Human Immunity System was a thorny issue in the implementation of the e-Healthcare system. A trade-off between privacy and cost was discussed and debated. Three alternatives, with varying degrees of privacy and cost, were considered.
Systems Analysis & Design: An Essential Part Of Is Education, Albert L. Harris, Michael Lang, Briony J. Oates, Keng Siau
Systems Analysis & Design: An Essential Part Of Is Education, Albert L. Harris, Michael Lang, Briony J. Oates, Keng Siau
Research Collection School Of Computing and Information Systems
Systems analysis and design has been as critical building block in Information Systems (IS) education since the inception of the IS major. Whether it is taught using the traditional or "structured approach or the object-oriented approach, it exposes students to the different methods, tools, and techniques used in developing new systems, develops students analytical and problem-solving skills, teaches fact-finding and data gathering techniques, and provides teamwork skills. All of these are valuable skills for systems analysts. This paper introduces the reader of this special issue on systems analysis and design education to the issue, discusses the two approaches to teaching …
A Survey On Networking Games In Telecommunications, E. Altman, T. Boulogne, R. El-Azouzi, T. Jiménez, Laura Wynter
A Survey On Networking Games In Telecommunications, E. Altman, T. Boulogne, R. El-Azouzi, T. Jiménez, Laura Wynter
Research Collection School Of Computing and Information Systems
In this survey, we summarize different modeling and solution concepts of networking games, as well as a number of different applications in telecommunications that make use of or can make use of networking games. We identify some of the mathematical challenges and methodologies that are involved in these problems. We include here work that has relevance to networking games in telecommunications from other areas, in particular from transportation planning.
Advances In Data Modeling Research, G. Allen, A. Bajaj, V. Khatri, S. Ram, Keng Siau
Advances In Data Modeling Research, G. Allen, A. Bajaj, V. Khatri, S. Ram, Keng Siau
Research Collection School Of Computing and Information Systems
In this paper, we summarize the discussions of the panel on "Advances in Data Modeling Research," held at the Americas Conference on Information Systems (AMCIS) in 2005. We focus on four primary areas where data modeling research offers rich opportunities: spatio-temporal semantics, genome research, ontological analysis and empirical evaluation of existing models. We highlight past work in each area and also discuss open questions, with a view to promoting future research in the overall data modeling area.
Grid-Partition Index: A Hybrid Approach To Nearest-Neighbor Queries In Wireless Location-Based Services, Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lun Lee
Grid-Partition Index: A Hybrid Approach To Nearest-Neighbor Queries In Wireless Location-Based Services, Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lun Lee
Research Collection School Of Computing and Information Systems
Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on the locations of data objects: using some distance heuristics on object locations. The latter is built on a precomputed solution space. Thus, NN queries can be reduced to and processed as simple point queries in this solution space. Both approaches exhibit some disadvantages, especially when employed for wireless data broadcast in mobile computing environments. In this paper, we introduce a new index method, called the grid-partition index, to support NN search in both ondemand access and periodic broadcast …
Towards Better Quality Specification Miners, David Lo, Siau-Cheng Khoo
Towards Better Quality Specification Miners, David Lo, Siau-Cheng Khoo
Research Collection School Of Computing and Information Systems
Softwares are often built without specification. Tools to automatically extract specification from software are needed and many techniques have been proposed. One type of these specifications – temporal API specification – is often specified in the form of automaton (i.e., FSA/PFSA). There have been many work on mining software temporal specification using dynamic analysis techniques; i.e., analysis of software program traces. Unfortunately, the issues of scalability, robustness and accuracy of these techniques have not been comprehensively addressed. In this paper, we describe a framework that enables assessments of the performance of a specification miner in generating temporal specification of software …
In-Network Join Processing For Sensor Networks, Hai Yu, Ee Peng Lim, Jun Zhang
In-Network Join Processing For Sensor Networks, Hai Yu, Ee Peng Lim, Jun Zhang
Research Collection School Of Computing and Information Systems
Recent advances in hardware and wireless technologies have led to sensor networks consisting of large number of sensors capable of gathering and processing data collectively. Query processing on these sensor networks has to consider various inherent constraints. While simple queries such as select and aggregate queries in wireless sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. In this paper, we present a synopsis join strategy for evaluating join queries in sensor networks with communication efficiency. In this strategy, instead of directly joining two relations distributed in a sensor …
Improving The Quality Of Conceptual Modeling Using Cognitive Mapping Techniques, Keng Siau, X. Tan
Improving The Quality Of Conceptual Modeling Using Cognitive Mapping Techniques, Keng Siau, X. Tan
Research Collection School Of Computing and Information Systems
Conceptual modeling involves the understanding and communication between system analysts and end-users. Many factors may affect the quality of conceptual modeling processes as well as the models per se. Human cognition plays a pivotal role in understanding these factors and cognitive mapping techniques are effective tools to elicit and represent human cognition. In this paper, we look at the use of cognitive mapping techniques to improve the quality of conceptual modeling. We review frameworks on quality in conceptual modeling and examine the role of human cognition in conceptual modeling. The paper also discusses how human cognition is related to quality …
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
New Efficient Mds Array Codes For Raid Part Ii: Rabin-Like Codes For Tolerating Multiple (>=4) Disk Failures, Gui-Liang Feng, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
A new class of Binary Maximum Distance Separable (MDS) array codes which are based on circular permutation matrices are introduced in this paper. These array codes are used for tolerating multiple (greater than or equal to 4) disk failures in Redundant Arrays of Inexpensive Disks (RAID) architecture. The size of the information part is m \times n, where n is the number of information disks and (m+1) is a prime integer; the size of the parity-check part is m \times r, the minimum distance is r+1, and the number of parity-check disks is r. In practical applications, m can be …
Matrix: Adaptive Middleware For Distributed Multiplayer Games, Rajesh Krishna Balan, Maria Ebling, Paul Castro, Archan Misra
Matrix: Adaptive Middleware For Distributed Multiplayer Games, Rajesh Krishna Balan, Maria Ebling, Paul Castro, Archan Misra
Research Collection School Of Computing and Information Systems
Building a distributed middleware infrastructure that provides the low latency required for massively multiplayer games while still maintaining consistency is non-trivial. Previous attempts have used static partitioning or client-based peer-to-peer techniques that do not scale well to a large number of players, perform poorly under dynamic workloads or hotspots, and impose significant programming burdens on game developers. We show that it is possible to build a scalable distributed system, called Matrix, that is easily usable by game developers. We show experimentally that Matrix provides good performance, especially when hotspots occur.
Giving Users The Steering Wheel For Guiding Resource-Adaptive Systems, Joao Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan
Giving Users The Steering Wheel For Guiding Resource-Adaptive Systems, Joao Sousa, Rajesh Krishna Balan, Vahe Poladian, David Garlan, Mahadev Satyanarayanan
Research Collection School Of Computing and Information Systems
Addressing resource variation plays an increasingly important role in engineering today's software systems. Research in resource-adaptive applications takes an important step towards addressing this problem. However, existing solutions stop short of addressing the fact that different user tasks often have specific goals of quality of service, and that such goals often entail multiple aspects of quality of service. This paper presents a framework for engineering software systems capable of adapting to resource variations in ways that are specific to the quality goals of each user task. For that, users are empowered to specify their task-specific preferences with respect to multiple …
Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng
Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
The contribution of this paper has two folds. In the first fold, we propose a generic construction of sequential aggregate signatures from families of certificated trapdoor one-way permutations. We show that our construction is provably secure in the random oracle model assuming that the underlying homomorphic permutations are trapdoor one-way. Compared to Lysyanskaya et al’s generic construction that is constructed from a trapdoor one-way permutation family working over the same domain [16], our scheme works over independent trapdoor one-way permutation domains. The flexible choice of the underlying permutation domains benefits our scheme to its applications in the real world where …
Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou
Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou
Research Collection School Of Computing and Information Systems
We propose a communication-efficient authentication scheme to authenticate query results disseminated by untrusted data publishing servers. In our scheme, signatures of multiple tuples in the result set are aggregated into one and thus the communication overhead incurred by the signature keeps constant. Next attr-MHTs (tuple based Merkle Hash Tree) are built to further reduce the communication overhead incurred by auxiliary authentication information (AAI). Besides the property of communication-efficiency, our scheme also supports dynamic SET operations (UNION, INTERSECTION) and dynamic JOIN with immunity to reordering attack.
An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra
An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra
Research Collection School Of Computing and Information Systems
In this paper we investigate the expected lifetime and information capacity, defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless sensor network. We develop a fluid-flow based computational framework that extends the existing approach, which requires precise knowledge of the layout/deployment of the network, i.e., exact sensor positions. Our method, on the other hand, views a specific network deployment as a particular instance (sample path) from an underlying distribution of sensor node layouts and sensor data rates. To compute the expected information capacity under this distribution-based …
Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang
Tailored Watermarking Schemes For Authentication Of Electronic Clinical Atlases, Feng Bao, Robert H. Deng, Beng-Chin Ooi, Yanjiang Yang
Research Collection School Of Computing and Information Systems
It is accepted that digital watermarking is quite relevant in medical imaging. However, due to the special nature of clinical practice, it is often required that watermarking not introduce irreversible distortions to medical images. The electronic clinical atlas has such a need of "lossless" watermarking. We present two tailored reversible watermarking schemes for the clinical atlas by exploiting its inherent characteristics. We have implemented the schemes and our experimental results look very promising.
Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa
Webarc: Website Archival Using A Structured Approach, Ee Peng Lim, Maria Marissa
Research Collection School Of Computing and Information Systems
Website archival refers to the task of monitoring and storing snapshots of website(s) for future retrieval and analysis. This task is particularly important for websites that have content changing over time with older information constantly overwritten by newer one. In this paper, we propose WEBARC as a set of software tools to allow users to construct a logical structure for a website to be archived. Classifiers are trained to. determine relevant web pages and their categories, and subsequently used in website downloading. The archival schedule can be specified and executed by a scheduler. A website viewer is also developed to …
Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong
Integration Of Probabilistic Graphic Models For Decision Support, Jiang C., Poh K., Tze-Yun Leong
Research Collection School Of Computing and Information Systems
It is a frequently encountered problem that new knowledge arrived when making decisions in a dynamic world. Usually, domain experts cannot afford enough time and knowledge to effectively assess and combine both qualitative and quantitative information in these models. Existing approaches can solve only one of two tasks instead of both. We propose a four-step algorithm to integrate multiple probabilistic graphic models, which can effectively update existing models with newly acquired models. In this algorithm, the qualitative part of model integration is performed first, followed by the quantitative combination. We illustrate our method with an example of combining three models. …
A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao
A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao
Research Collection School Of Computing and Information Systems
The need for protecting rights over relational data is of ever increasing concern. There have recently been some pioneering works in this area. In this paper, we propose an effective fingerprinting scheme based on the idea of block method in the area of multimedia fingerprinting. The scheme ensures that certain bit positions of the data contain specific values. The bit positions are determined by the keys known only to the owner of the data and different buyers of the database have different bit positions and different specific values for those bit positions. The detection of the fingerprint can be completed …
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan
A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan
Research Collection School Of Computing and Information Systems
Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that …
Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng
Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
A forward secure blind signature scheme was proposed by Duc, Cheon and Kim, in ICICS 2003. The security of the scheme was proved to be equivalent to the strong RSA assumption in the random oracle model. In this paper we present an attack to the scheme by forging valid signatures with public keys only. The attack is so efficient that forging a valid signature needs less computation than legally generating a signature, even considering only the user side. Our result implies that the security proof of the scheme must be invalid. Furthermore we point out the fault of the proof …
A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong
A Framework To Learn Bayesian Network From Changing, Multiple-Source Biomedical Data, Li G., Tze-Yun Leong
Research Collection School Of Computing and Information Systems
Structure learning in Bayesian network is a big issue. Many efforts have tried to solve this problem and quite a few algorithms have been proposed. However, when we attempt to apply the existing methods to microarray data, there are three main challenges: 1) there are many variables in the data set, 2) the sample size is small, and 3) microarray data are changing from experiment to experiment and new data are available quickly. To address these three problems, we assume that the major functions of a kind of cells do not change too much in different experiments, and propose a …
Selective Object Stabilization For Home Video Consumers, Zailiang Pan, Chong-Wah Ngo
Selective Object Stabilization For Home Video Consumers, Zailiang Pan, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
This paper describes a unified approach for video stabilization. The essential goal is to stabilize image sequences that consist of moving foreground objects, which appear frequently in today's home videos captured by hand-held consumer cameras. Our proposed techniques mainly, rely on the analysis of;motion content. Three major components area initialization, segmentation and stabilization. In motion initialization, we propose a novel algorithm to efficiently search for the best possible frame in a sequence to start segmentation. Our segmentation algorithm is based on Expectation-Maximization (EM) framework which provides the mechanism for simultaneous estimation of motion models and their layers of support. Based …
Exploiting Self-Adaptive Posture-Based Focus Estimation For Lecture Video Editing, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
Exploiting Self-Adaptive Posture-Based Focus Estimation For Lecture Video Editing, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong
Research Collection School Of Computing and Information Systems
Head pose plays a special role in estimating a presenter’s focuses and actions for lecture video editing. This paper presents an efficient and robust head pose estimation algorithm to cope with the new challenges arising in the content management of lecture videos. These challenges include speed requirement, low video quality, variant presenting styles and complex settings in modern classrooms. Our algorithm is based on a robust hierarchical representation of skin color clustering and a set of pose templates that are automatically trained. Contextual information is also considered to refine pose estimation. Most importantly, we propose an online learning approach to …
Anonymous Dos-Resistant Access Control Protocol Using Passwords For Wireless Networks, Zhiguo Wan, Robert H. Deng, Feng Bao, Akkihebbal L. Ananda
Anonymous Dos-Resistant Access Control Protocol Using Passwords For Wireless Networks, Zhiguo Wan, Robert H. Deng, Feng Bao, Akkihebbal L. Ananda
Research Collection School Of Computing and Information Systems
Wireless networks have gained overwhelming popularity over their wired counterpart due to their great flexibility and convenience, but access control of wireless networks has been a serious problem because of the open medium. Passwords remain the most popular way for access control as well as authentication and key exchange. But existing password-based access control protocols are not satisfactory in that they do not provide DoS-resistance or anonymity. In this paper we analyze the weaknesses of an access control protocol using passwords for wireless networks in IEEE LCN 2001, and propose a different access control protocol using passwords for wireless networks. …
Query Processing In Spatial Databases Containing Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu
Query Processing In Spatial Databases Containing Obstacles, Jun Zhang, Dimitris Papadias, Kyriakos Mouratidis, Manli Zhu
Research Collection School Of Computing and Information Systems
Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossing any obstacles. We propose efficient algorithms for the most important query types, namely, range search, nearest neighbours, e-distance joins, closest pairs and distance semi-joins, assuming that both data objects and obstacles are indexed by R-trees. The effectiveness of the proposed …
Motion-Based Approach For Bbc Rushes Structuring And Characterization, Chong-Wah Ngo, Zailiang Pan
Motion-Based Approach For Bbc Rushes Structuring And Characterization, Chong-Wah Ngo, Zailiang Pan
Research Collection School Of Computing and Information Systems
No abstract provided.
Mining Ontological Knowledge From Domain-Specific Text Documents, Xing Jiang, Ah-Hwee Tan
Mining Ontological Knowledge From Domain-Specific Text Documents, Xing Jiang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Traditional text mining systems employ shallow parsing techniques and focus on concept extraction and taxonomic relation extraction. This paper presents a novel system called CRCTOL for mining rich semantic knowledge in the form of ontology from domain-specific text documents. By using a full text parsing technique and incorporating both statistical and lexico-syntactic methods, the knowledge extracted by our system is more concise and contains a richer semantics compared with alternative systems. We conduct a case study wherein CRCTOL extracts ontological knowledge, specifically key concepts and semantic relations, from a terrorism domain text collection. Quantitative evaluation, by comparing with a state-of-the-art …
Accurately Extracting Coherent Relevant Passages Using Hidden Markov Models, Jing Jiang, Chengxiang Zhai
Accurately Extracting Coherent Relevant Passages Using Hidden Markov Models, Jing Jiang, Chengxiang Zhai
Research Collection School Of Computing and Information Systems
In this paper, we present a principled method for accurately extracting coherent relevant passages of variable lengths using HMMs. We show that with appropriate parameter estimation, the HMM method outperforms a number of strong baseline methods on two data sets.
A Threshold-Based Algorithm For Continuous Monitoring Of K Nearest Neighbors, Kyriakos Mouratidis, Dimitris Papadias, Spiridon Bakiras, Yufei Tao
A Threshold-Based Algorithm For Continuous Monitoring Of K Nearest Neighbors, Kyriakos Mouratidis, Dimitris Papadias, Spiridon Bakiras, Yufei Tao
Research Collection School Of Computing and Information Systems
Assume a set of moving objects and a central server that monitors their positions over time, while processing continuous nearest neighbor queries from geographically distributed clients. In order to always report up-to-date results, the server could constantly obtain the most recent position of all objects. However, this naïve solution requires the transmission of a large number of rapid data streams corresponding to location updates. Intuitively, current information is necessary only for objects that may influence some query result (i.e., they may be included in the nearest neighbor set of some client). Motivated by this observation, we present a threshold-based algorithm …
On Security Notions Of Steganographic Systems, Kisik Chang, Robert H. Deng, Feng Bao, Sangjin Lee, Hyungjun Kim
On Security Notions Of Steganographic Systems, Kisik Chang, Robert H. Deng, Feng Bao, Sangjin Lee, Hyungjun Kim
Research Collection School Of Computing and Information Systems
We define the notion of pseudoprocessingness to formulate chosen-input-attack, chosen-stego-attack, and key-recovery. We then construct a efficient, provable secure steganographic algorithm against chosen-input-attack and key-recovery. So far as we know, this is the first paper dealing with those security notions.