Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Query processing (3)
- Spatial database (3)
- Algorithm (2)
- Music (2)
- Nearest neighbor (2)
-
- Spatial databases (2)
- Trust prediction (2)
- Wireless broadcast (2)
- Access latency (1)
- Adaptive maintenance advisor (1)
- Aggregate signature (1)
- Air indexes (1)
- Algorithm. (1)
- Algorithms (1)
- Answer quality (1)
- Arrival rates (1)
- Artificial Intelligence (1)
- As graph (1)
- Authentication in outsourced databases (1)
- Authentication methods (1)
- Automotive exhaust gas (1)
- Broadcast channels (1)
- Browsing (1)
- Case studies (1)
- Categorical data (1)
- Classic western paintings (1)
- Classification (1)
- Classification performance prediction (1)
- Cnm (1)
- Collaborative Filtering (1)
Articles 31 - 43 of 43
Full-Text Articles in Physical Sciences and Mathematics
Describing Fuzzy Sets Using A New Concept: Fuzzify Functor, Kexin Wei, Zhaoxia Wang, Quan Wang
Describing Fuzzy Sets Using A New Concept: Fuzzify Functor, Kexin Wei, Zhaoxia Wang, Quan Wang
Research Collection School Of Computing and Information Systems
This paper proposed a fuzzify functor as an extension of the concept of fuzzy sets. The fuzzify functor and the first-order operated fuzzy set are defined. From the theory analysis, it can be observed that when the fuzzify functor acts on a simple crisp set, we get the first order fuzzy set or type-1 fuzzy set. By operating the fuzzify functor on fuzzy sets, we get the higher order fuzzy sets or higher type fuzzy sets and their membership functions. Using the fuzzify functor we can exactly describe the type-1 fuzzy sets, type-2 fuzzy sets and higher type or higher …
Continuous Visible Nearest Neighbour Queries, Yunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai Chen
Continuous Visible Nearest Neighbour Queries, Yunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai Chen
Research Collection School Of Computing and Information Systems
In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query line segment q, a CVNN query returns a set of (p, R) tuples such that p ? P is the nearest neighbor (NN) to every point r along the interval R ? q as well as p is visible to r. Note that p may be NULL, meaning that all points in P are invisible to all points in R, due to the obstruction of some obstacles in …
Fast Object Search On Road Networks, Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
Fast Object Search On Road Networks, Ken C. K. Lee, Wang-Chien Lee, Baihua Zheng
Research Collection School Of Computing and Information Systems
In this paper, we present ROAD, a general framework to evaluate Location-Dependent Spatial Queries (LDSQ)s that searches for spatial objects on road networks. By exploiting search space pruning technique and providing a dynamic object mapping mechanism, ROAD is very efficient and flexible for various types of queries, namely, range search and nearest neighbor search, on objects over large-scale networks. ROAD is named after its two components, namely, Route Overlay and Association Directory, designed to address the network traversal and object access aspects of the framework. In ROAD, a large road network is organized as a hierarchy of interconnected regional sub-networks …
Stochastic Modeling Western Paintings For Effective Classification, Jialie Shen
Stochastic Modeling Western Paintings For Effective Classification, Jialie Shen
Research Collection School Of Computing and Information Systems
As one of the most important cultural heritages, classical western paintings have always played a special role in human live and been applied for many different purposes. While image classification is the subject of a plethora of related publications, relatively little attention has been paid to automatic categorization of western classical paintings which could be a key technique of modern digital library, museums and art galleries. This paper studies automatic classification on large western painting image collection. We propose a novel framework to support automatic classification on large western painting image collections. With this framework, multiple visual features can be …
Localized Monitoring Of Knn Queries In Wireless Sensor Networks, Yuxia Yao, Xueyan Tang, Ee Peng Lim
Localized Monitoring Of Knn Queries In Wireless Sensor Networks, Yuxia Yao, Xueyan Tang, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Wireless sensor networks have been widely used in civilian and military applications. Primarily designed for monitoring purposes, many sensor applications require continuous collection and processing of sensed data. Due to the limited power supply for sensor nodes, energy efficiency is a major performance concern in query processing. In this paper, we focus on continuous kNN query processing in object tracking sensor networks. We propose a localized scheme to monitor nearest neighbors to a query point. The key idea is to establish a monitoring area for each query so that only the updates relevant to the query are collected. The monitoring …
Partially Materialized Digest Scheme: An Efficient Verification Method For Outsourced Databases, Kyriakos Mouratidis, Dimitris Sacharidis, Hwee Hwa Pang
Partially Materialized Digest Scheme: An Efficient Verification Method For Outsourced Databases, Kyriakos Mouratidis, Dimitris Sacharidis, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
In the outsourced database model, a data owner publishes her database through a third-party server; i.e., the server hosts the data and answers user queries on behalf of the owner. Since the server may not be trusted, or may be compromised, users need a means to verify that answers received are both authentic and complete, i.e., that the returned data have not been tampered with, and that no qualifying results have been omitted. We propose a result verification approach for one-dimensional queries, called Partially Materialized Digest scheme (PMD), that applies to both static and dynamic databases. PMD uses separate indexes …
Quc-Tree: Integrating Query Context Information For Efficient Music Retrieval, Jialie Shen, Dacheng Tao, Xuelong Li
Quc-Tree: Integrating Query Context Information For Efficient Music Retrieval, Jialie Shen, Dacheng Tao, Xuelong Li
Research Collection School Of Computing and Information Systems
In this paper, we introduce a novel indexing scheme-query context tree (QUC-tree) to facilitate efficient query sensitive music search under different query contexts. Distinguished from the previous approaches, QUC-tree is a balanced multiway tree structure, where each level represents the data space at different dimensionality. Before the tree structure construction, principle component analysis (PCA) is applied for data analysis and transforming the raw composite features into a new feature space sorted by the importance of acoustic features. The PCA transformed data and reduced dimensions in the upper levels can alleviate suffering from dimensionality curse. To accurately mimic human perception, an …
Computing Medoids In Large Spatial Datasets, Kyriakos Mouratidis, Dimitris Papadias, Spiros Papadimitriou
Computing Medoids In Large Spatial Datasets, Kyriakos Mouratidis, Dimitris Papadias, Spiros Papadimitriou
Research Collection School Of Computing and Information Systems
In this chapter, we consider a class of queries that arise in spatial decision making and resource allocation applications. Assume that a company wants to open a number of warehouses in a city. Let P be the set of residential blocks in the city. P represents customer locations to be potentially served by the company. At the same time, P also comprises the candidate warehouse locations because the warehouses themselves must be opened in some residential blocks.
Web Social Mining, Hady W. Lauw, Ee Peng Lim
Web Social Mining, Hady W. Lauw, Ee Peng Lim
Research Collection School Of Computing and Information Systems
No abstract provided.
Quality-Aware Collaborative Question Answering: Methods And Evaluation, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang
Quality-Aware Collaborative Question Answering: Methods And Evaluation, Maggy Anastasia Suryanto, Ee Peng Lim, Aixin Sun, Roger Hsiang-Li Chiang
Research Collection School Of Computing and Information Systems
Community Question Answering (QA) portals contain questions and answers contributed by hundreds of millions of users. These databases of questions and answers are of great value if they can be used directly to answer questions from any user. In this research, we address this collaborative QA task by drawing knowledge from the crowds in community QA portals such as Yahoo! Answers. Despite their popularity, it is well known that answers in community QA portals have unequal quality. We therefore propose a quality-aware framework to design methods that select answers from a community QA portal considering answer quality in addition to …
Tuning On-Air Signatures For Balancing Performance And Confidentiality, Baihua Zheng, Wang-Chien Lee, Peng Liu, Dik Lun Lee, Xuhua Ding
Tuning On-Air Signatures For Balancing Performance And Confidentiality, Baihua Zheng, Wang-Chien Lee, Peng Liu, Dik Lun Lee, Xuhua Ding
Research Collection School Of Computing and Information Systems
In this paper, we investigate the trade off between performance and confidentiality in signature-based air indexing schemes for wireless data broadcast. Two metrics, namely, false drop probability and false guess probability, are defined to quantify the filtering efficiency and confidentiality loss of a signature scheme. Our analysis reveals that false drop probability and false guess probability share a similar trend as the tuning parameters of a signature scheme change and it is impossible to achieve a low false drop probability and a high false guess probability simultaneously. In order to balance the performance and confidentiality, we perform an analysis to …
Dynamic Web Service Selection For Reliable Web Service Composition, San-Yih Hwang, Ee Peng Lim, Chien-Hsiang Lee, Cheng-Hung Chen
Dynamic Web Service Selection For Reliable Web Service Composition, San-Yih Hwang, Ee Peng Lim, Chien-Hsiang Lee, Cheng-Hung Chen
Research Collection School Of Computing and Information Systems
This paper studies the dynamic web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at run-time so as to successfully orchestrate a composite web service. We observe that both the composite and constituent web services often constrain the sequences of invoking their operations and therefore propose to use finite state machine to model the permitted invocation sequences of Web service operations. We assign each state of execution an aggregated reliability to measure the probability that the given state will lead to successful execution in the context where each web …
Efficient Valid Scope Computation For Location-Dependent Spatial Queries In Mobile And Wireless Environments, Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng
Efficient Valid Scope Computation For Location-Dependent Spatial Queries In Mobile And Wireless Environments, Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng
Research Collection School Of Computing and Information Systems
In mobile and wireless environments, mobile clients can access information with respect to their locations by submitting Location-Dependent Spatial Queries (LDSQs) to Location-Based Service (LBS) servers. Owing to scarce wireless channel bandwidth and limited client battery life, frequent LDSQ submission from clients must be avoided. Observing that LDSQs issued from similar client positions would normally return the same results, we explore the idea of valid scope, that represents a spatial area in which a set of LDSQs will retrieve exactly the same query results. With a valid scope derived and an LDSQ result cached at the client side, a client …