Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences Commons™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 7531 - 7560 of 9003

Full-Text Articles in Computer Sciences

Efficient Cca-Secure Pke From Identity-Based Techniques, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou Mar 2010

Efficient Cca-Secure Pke From Identity-Based Techniques, Junzuo Lai, Robert H. Deng, Shengli Liu, Weidong Kou

Research Collection School Of Computing and Information Systems

Boneh, Canetti, Halevi, and Katz showed a general method for constructing CCA-secure public key encryption (PKE) from any selective-ID CPA-secure identity-based encryption (IBE) schemes. Their approach treated IBE as a black box. Subsequently, Boyen, Mei, and Waters demonstrated how to build a direct CCA-secure PKE scheme from the Waters IBE scheme, which is adaptive-ID CPA secure. They made direct use of the underlying IBE structure, and required no cryptographic primitive other than the IBE scheme itself. However, their scheme requires long public key and the security reduction is loose. In this paper, we propose an efficient PKE scheme employing identity-based …

Go to article

Probabilistic Public Key Encryption With Equality Test, Guomin Yang, Chik How Tan, Qiong Huang, Duncan S. Wong Mar 2010

Probabilistic Public Key Encryption With Equality Test, Guomin Yang, Chik How Tan, Qiong Huang, Duncan S. Wong

Research Collection School Of Computing and Information Systems

We present a (probabilistic) public key encryption (PKE) scheme such that when being implemented in a bilinear group, anyone is able to check whether two ciphertexts are encryptions of the same message. Interestingly, bilinear map operations are not required in key generation, encryption or decryption procedures of the PKE scheme, but is only required when people want to do an equality test (on the encrypted messages) between two ciphertexts that may be generated using different public keys. We show that our PKE scheme can be used in different applications such as searchable encryption and partitioning encrypted data. Moreover, we show …

Go to article

Medially: A Provenance-Aware Remote Health Monitoring Middleware, Atanu Roy Chowdhury, Ben Falchuk, Archan Misra Mar 2010

Medially: A Provenance-Aware Remote Health Monitoring Middleware, Atanu Roy Chowdhury, Ben Falchuk, Archan Misra

Research Collection School Of Computing and Information Systems

This paper presents MediAlly, a middleware for supporting energy-efficient, long-term remote health monitoring. Data is collected using physiological sensors and transported back to the middleware using a smart phone. The key to MediAlly's energy efficient operations lies in the adoption of an Activity Triggered Deep Monitoring (ATDM) paradigm, where data collection episodes are triggered only when the subject is determined to possess a specified context. MediAlly supports the on-demand collection of contextual provenance using a novel low-overhead provenance collection sub-system. The behaviour of this sub-system is configured using an application-defined context composition graph. The resulting provenance stream provides valuable insight …

Go to article

A Multi-Key Pirate Decoder Against Traitor Tracing Schemes, Yongdong Wu, Robert H. Deng Mar 2010

A Multi-Key Pirate Decoder Against Traitor Tracing Schemes, Yongdong Wu, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper we introduce an architecture for a multi-key pirate decoder which employs decryption keys from multiple traitors. The decoder has built-in monitoring and self protection functionalities and is capable of defeating most multiple-round based traitor tracing schemes such as the schemes based on the black-box confirmation method. In particular, the proposed pirate decoder is customized to defeat the private key and the public key fully collusion resistant traitor tracing (FTT) schemes, respectively. We show how the decoder prolongs a trace process so that the tracer has to give up his effort. FTT schemes are designed to identify all …

Go to article

K-Anonymity In The Presence Of External Databases, Dimitris Sacharidis, Kyriakos Mouratidis, Dimitris Papadias Mar 2010

K-Anonymity In The Presence Of External Databases, Dimitris Sacharidis, Kyriakos Mouratidis, Dimitris Papadias

Research Collection School Of Computing and Information Systems

The concept of k-anonymity has received considerable attention due to the need of several organizations to release microdata without revealing the identity of individuals. Although all previous k-anonymity techniques assume the existence of a public database (PD) that can be used to breach privacy, none utilizes PD during the anonymization process. Specifically, existing generalization algorithms create anonymous tables using only the microdata table (MT) to be published, independently of the external knowledge available. This omission leads to high information loss. Motivated by this observation we first introduce the concept of k-join-anonymity (KJA), which permits more effective generalization to reduce the …

Go to article

Further Exploration On Relationship Between Crisp Sets And Fuzzy Sets, Zhaoxia Wang, Quan Wang, Ming Bai, Chen Zeng-Qiang, Zhen Sun Feb 2010

Further Exploration On Relationship Between Crisp Sets And Fuzzy Sets, Zhaoxia Wang, Quan Wang, Ming Bai, Chen Zeng-Qiang, Zhen Sun

Research Collection School Of Computing and Information Systems

This paper employs the concept of fuzzify upgrade operator to describe the relationship between crisp sets, fuzzy sets and higher order fuzzy sets, such as type-2 fuzzy sets. Theory analysis and case studies demonstrate that a crisp set can be represented by a type-1 fuzzy set, a type-1 fuzzy set can be represented by a type-2 fuzzy set, and a type-n (n>=2) fuzzy set can be represented by a type-(n+1) (n>=2) fuzzy set. The fuzzify upgrade operator makes crisp sets, type-1 fuzzy sets, type-2 fuzzy sets and any fuzzy sets much more accessible to all readers. The relationship …

Go to article

An Analysis Of Extreme Price Shocks And Illiquidity Among Trend Followers, Bernard Lee, Shih-Fen Cheng, Annie Koh Feb 2010

An Analysis Of Extreme Price Shocks And Illiquidity Among Trend Followers, Bernard Lee, Shih-Fen Cheng, Annie Koh

Research Collection School Of Computing and Information Systems

We construct an agent-based model to study the interplay between extreme price shocks and illiquidity in the presence of systematic traders known as trend followers. The agent-based approach is particularly attractive in modeling commodity markets because the approach allows for the explicit modeling of production, capacities, and storage constraints. Our study begins by using the price stream from a market simulation involving human participants and studies the behavior of various trend-following strategies, assuming initially that their participation will not impact the market. We notice an incremental deterioration in strategy performance as and when strategies deviate further and further from the …

Go to article

Efficient Valid Scope For Location-Dependent Spatial Queries In Mobile Environments, Ken C. K. Lee, Wang-Chien Lee, Hong Va Leong, Brandon Unger, Baihua Zheng Feb 2010

Efficient Valid Scope For Location-Dependent Spatial Queries In Mobile 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 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 a client located at nearby positions would likely return the same query results, we explore the idea of valid scope, which represents a spatial area in which a set of LDSQs will retrieve exactly the same set of query results. With a valid scope derived and an LDSQ result cached, a client …

Go to article

Player Performance Prediction In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Richa Sharan, Jaideep Srivastava Feb 2010

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

Recent years have seen an ever increasing number of people interacting in the online space. Massively multiplayer online role-playing games (MMORPGs) are personal computer or console-based digital games where thousands of players can simultaneously sign on to the same online, persistent virtual world to interact and collaborate with each other through their in-game characters. In recent years, researchers have found virtual environments to be a sound venue for studying learning, collaboration, social participation, literacy in online space, and learning trajectory at the individual level as well as at the group level. While many games today provide web and GUI-based reports …

Go to article

Twitterrank: Finding Topic-Sensitive Influential Twitterers, Jianshu Weng, Ee Peng Lim, Jing Jiang, Qi He Feb 2010

Twitterrank: Finding Topic-Sensitive Influential Twitterers, Jianshu Weng, Ee Peng Lim, Jing Jiang, Qi He

Research Collection School Of Computing and Information Systems

This paper focuses on the problem of identifying influential users of micro-blogging services. Twitter, one of the most notable micro-blogging services, employs a social-networking model called "following", in which each user can choose who she wants to "follow" to receive tweets from without requiring the latter to give permission first. In a dataset prepared for this study, it is observed that (1) 72.4% of the users in Twitter follow more than 80% of their followers, and (2) 80.5% of the users have 80% of users they are following follow them back. Our study reveals that the presence of "reciprocity" can …

Go to article

Estimating The Quality Of Postings In The Real-Time Web, Hady W. Lauw, Alexandros Ntoulas, Krishnaram Kenthapadi Feb 2010

Estimating The Quality Of Postings In The Real-Time Web, Hady W. Lauw, Alexandros Ntoulas, Krishnaram Kenthapadi

Research Collection School Of Computing and Information Systems

Millions of users are posting their status updates, interesting findings, news, ideas and observations in real-time on microblogging services such as Twitter, Jaiku and Plurk. This real-time Web can be a great resource of valuable timely information. Since the real-time Web is completely open and decentralized and anyone may post information at whim, distinguishing interesting and popular postings from the mundane ones is a challenging task. In this paper we study the problem of estimating the quality (or “interestingness”) of postings in the real-time Web. We identify several important factors that are indicative of the quality of postings, and present …

Go to article

Privacy-Preserving Similarity-Based Text Retrieval, Hwee Hwa Pang, Jialie Shen, Ramayya Krishnan Feb 2010

Privacy-Preserving Similarity-Based Text Retrieval, Hwee Hwa Pang, Jialie Shen, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

Users of online services are increasingly wary that their activities could disclose confidential information on their business or personal activities. It would be desirable for an online document service to perform text retrieval for users, while protecting the privacy of their activities. In this article, we introduce a privacy-preserving, similarity-based text retrieval scheme that (a) prevents the server from accurately reconstructing the term composition of queries and documents, and (b) anonymizes the search results from unauthorized observers. At the same time, our scheme preserves the relevance-ranking of the search server, and enables accounting of the number of documents that each …

Go to article

Applying Soft Cluster Analysis Techniques To Customer Interaction Information, Randall E. Duran, Li Zhang, Tom Hayhurst Jan 2010

Applying Soft Cluster Analysis Techniques To Customer Interaction Information, Randall E. Duran, Li Zhang, Tom Hayhurst

Research Collection School Of Computing and Information Systems

The number of channels available for companies and customers to communicate with one another has increased dramatically over the past several decades. Although some market segmentation efforts utilize high-level customer interaction statistics, in-depth information regarding customers’ use of different communication channels is often ignored. Detailed customer interaction information can help companies improve the way that they market to customers by taking into consideration customers’ behaviour patterns and preferences. However, a key challenge of interpreting customer contact information is that many channels have only been in existence for a relatively short period of time, and thus, there is limited understanding and …

Go to article

Motivated Learning As An Extension Of Reinforcement Learning, Janusz Starzyk, Pawel Raif, Ah-Hwee Tan Jan 2010

Motivated Learning As An Extension Of Reinforcement Learning, Janusz Starzyk, Pawel Raif, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

We have developed a unified framework to conduct computational experiments with both learning systems: Motivated learning based on Goal Creation System, and reinforcedment learning using RL Q-Learning Algorithm. Future work includes combining motivated learning to set abstract motivations and manage goals with reinforcement learning to learn proper actions. This will allow testing of motivated learning on typical reinforcement learning benchmarks with large dimensionality of the state/action spaces.

Go to article

Keep It Simple With Time: A Reexamination Of Probabilistic Topic Detection Models, Qi He, Kuiyu Chang, Ee Peng Lim, Arindam Banerjee Jan 2010

Keep It Simple With Time: A Reexamination Of Probabilistic Topic Detection Models, Qi He, Kuiyu Chang, Ee Peng Lim, Arindam Banerjee

Research Collection School Of Computing and Information Systems

Topic detection (TD) is a fundamental research issue in the Topic Detection and Tracking (TDT) community with practical implications; TD helps analysts to separate the wheat from the chaff among the thousands of incoming news streams. In this paper, we propose a simple and effective topic detection model called the temporal Discriminative Probabilistic Model (DPM), which is shown to be theoretically equivalent to the classic vector space model with feature selection and temporally discriminative weights. We compare DPM to its various probabilistic cousins, ranging from mixture models like von-Mises Fisher (vMF) to mixed membership models like Latent Dirichlet Allocation (LDA). …

Go to article

The Monetary Value Of Virtual Goods: An Exploratory Study In Mmorpgs, Qiu-Hong Wang, Viktor Mayer-Schonberger Jan 2010

The Monetary Value Of Virtual Goods: An Exploratory Study In Mmorpgs, Qiu-Hong Wang, Viktor Mayer-Schonberger

Research Collection School Of Computing and Information Systems

This study investigates the monetary value of time spent in virtual worlds in the context of 24 most popular MMORPGs Building on classic economic theory, we approach this issue through a combination of theoretical modeling, experiment, and cross-sectional time series data analysis. Our findings suggest that intensive social networking and flatter social hierarchy structures are associated with lower monetary value of time spent in-game. Further, two opposite network effects on the monetary value of in-game time spent were observed. One is the positive network effect from the active user base, the other is the negative network effect from the intensity …

Go to article

Modeling Anticipatory Event Transitions, He Qi, Kuiyu Chang, Ee Peng Lim Jan 2010

Modeling Anticipatory Event Transitions, He Qi, Kuiyu Chang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Major world events such as terrorist attacks, natural disasters, wars, etc. typically progress through various representative stages/states in time. For example, a volcano eruption could lead to earthquakes, tsunamis, aftershocks, evacuation, rescue efforts, international relief support, rebuilding, and resettlement, etc. By analyzing various types of catastrophical and historical events, we can derive corresponding event transition models to embed useful information at each state. The knowledge embedded in these models can be extremely valuable. For instance, a transition model of the 1918-1920 flu pandemic could be used for the planning and allocation of resources to decisively respond to future occurrences of …

Go to article

Wikipedia2onto: Building Concept Ontology Automatically, Experimenting With Web Image Retrieval, Huan Wang, Xing Jiang, Liang-Tien Chia, Ah-Hwee Tan Jan 2010

Wikipedia2onto: Building Concept Ontology Automatically, Experimenting With Web Image Retrieval, Huan Wang, Xing Jiang, Liang-Tien Chia, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Given its effectiveness to better understand data, ontology has been used in various domains including artificial intelligence, biomedical informatics and library science. What we have tried to promote is the use of ontology to better understand media (in particular, images) on the World Wide Web. This paper describes our preliminary attempt to construct a large-scale multi-modality ontology, called AutoMMOnto, for web image classification. Particularly, to enable the automation of text ontology construction, we take advantage of both structural and content features of Wikipedia and formalize real world objects in terms of concepts and relationships. For visual part, we train classifiers …

Go to article

An Empirical Analysis Of Mobile Voice Service And Sms: A Structural Model, Youngsoo Kim, Rahul Telang, William B. Vogt, Ramayya Krishnan Jan 2010

An Empirical Analysis Of Mobile Voice Service And Sms: A Structural Model, Youngsoo Kim, Rahul Telang, William B. Vogt, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

In addition to the wireless telephony boom, a similar exponentially increasing trend in wireless data service—for example, short message service (SMS)—is visible as technology advances. We develop a structural model to examine user demand for voice service and SMS. Specifically, we measure the own- and cross-price elasticities of these services. The cross-price elasticity is of significant importance because marketing activities are critically influenced by whether the goods are substitutes or complements. The research context poses significant econometric challenges due to three-part tariffs and sequential discrete plan choice and continuous quantity choice decisions. Using detailed individual consumption data of more than …

Go to article

Mining Antagonistic Communities From Social Networks, Kuan Zhang Jan 2010

Mining Antagonistic Communities From Social Networks, Kuan Zhang

Dissertations and Theses Collection (Open Access)

In this thesis, we examine the problem of mining antagonistic communities from social networks. In social networks, people with opposite opinions normally behave differently and form sub-communities each of which containing people sharing some common behaviors. In one scenario, people with opposite opinions show differences in their views on a set of items. Another scenario is people explicitly expressing whom they agree with, like or trust as well as whom they disagree with, dislike or distrust. We defined the indirect and direct antagonistic groups based on the two scenarios. We have developed algorithms to mine the two types of antagonistic …

Go to article

Security And Performance Analysis For Rfid Protocols, Bing Liang Jan 2010

Security And Performance Analysis For Rfid Protocols, Bing Liang

Dissertations and Theses Collection (Open Access)

Radio Frequency Identification (RFID) is an advanced object identification technology that has already been applied in various industries. However, the insecure nature of the communication channel between readers and tags makes RFID systems vulnerable to various kinds of attacks. In recent years, many new methods have been proposed to improve the security of RFID systems, such as disabling tags, agent management and establishing cryptographic protocols. Among them, we focus on the last approach, which is more economic and convenient in certain cases. The first part of our work is to categorize typical existing RFID protocols according to their security levels. …

Go to article

Smart Media: Bridging Interactions And Services For The Smart Internet, Margaret-Anne Storey, Lars Grammel, Christoph Treude Jan 2010

Smart Media: Bridging Interactions And Services For The Smart Internet, Margaret-Anne Storey, Lars Grammel, Christoph Treude

Research Collection School Of Computing and Information Systems

This chapter describes a need for Smart Media to enhance the vision of the Smart Internet. Smart Media is introduced as a mechanism to bridge Smart Services and Smart Interactions. Smart Media extends the existing notions of Media in HCI such as Hypermedia, New Media, Adaptive Hypermedia, and Social Media. There are three main contributions from this paper: (1) A historical perspective of media in HCI and how media could benefit from smartness; (2) through some high level sample scenarios, a proposal for Smart Media to meet the vision of the Smart Internet; and (3) a detailed example of how …

Go to article

Representations Of Keypoint-Based Semantic Concept Detection: A Comprehensive Study, Yu-Gang Jiang, Jun Yang, Chong-Wah Ngo Jan 2010

Representations Of Keypoint-Based Semantic Concept Detection: A Comprehensive Study, Yu-Gang Jiang, Jun Yang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Based on the local keypoints extracted as salient image patches, an image can be described as a "bag-of-visual-words (BoW)" and this representation has appeared promising for object and scene classification. The performance of BoW features in semantic concept detection for large-scale multimedia databases is subject to various representation choices. In this paper, we conduct a comprehensive study on the representation choices of BoW, including vocabulary size, weighting scheme, stop word removal, feature selection, spatial information, and visual bi-gram. We offer practical insights in how to optimize the performance of BoW by choosing appropriate representation choices. For the weighting scheme, we …

Go to article

Trust-Oriented Composite Service Selection With Qos Constraints, Lei Li, Yang Wang, Ee Peng Lim Jan 2010

Trust-Oriented Composite Service Selection With Qos Constraints, Lei Li, Yang Wang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In Service-Oriented Computing (SOC) environments, service clients interact with service providers for consuming services. From the viewpoint of service clients, the trust level of a service or a service provider is a critical factor to consider in service selection, particularlywhen a client is looking for a service from a large set of services or service providers. However, a invoked service may be composed of other services. The complex invocations in composite services greatly increase the complexity of trust-oriented service selection. In this paper, we propose novel approaches for composite service representation, trust evaluation and trust-oriented com-posite service selection (with QoS …

Go to article

Vulnerability Analysis Of Rfid Protocols For Tag Ownership Transfer, Pedro Peris-Lopez, Julio Hernandez-Castro, Juan Tapiador, Tieyan Li, Yingjiu Li Jan 2010

Vulnerability Analysis Of Rfid Protocols For Tag Ownership Transfer, Pedro Peris-Lopez, Julio Hernandez-Castro, Juan Tapiador, Tieyan Li, Yingjiu Li

Research Collection School Of Computing and Information Systems

In RFIDSec’08, Song proposed an ownership transfer scheme, which consists of an ownership transfer protocol and a secret update protocol [7]. The ownership transfer protocol is completely based on a mutual authentication protocol proposed in WiSec’08 [8]. In Rizomiliotis et al. (2009) [6], van Deursen and Radomirovic (2008), the first weaknesses to be identified (tag and server impersonation) were addressed and this paper completes the consideration of them all. We find that the mutual authentication protocol, and therefore the ownership transfer protocol, possesses certain weaknesses related to most of the security properties initially required in protocol design: tag information leakage, …

Go to article

A Boosting Framework For Visuality-Preserving Distance Metric Learning And Its Application To Medical Image Retrieval, Yang Liu, Rong Jin, Lily Mummert, Rahul Sukthankar, Adam Goode, Bin Zheng, Steven C. H. Hoi, Mahadev Satyanarayanan Jan 2010

A Boosting Framework For Visuality-Preserving Distance Metric Learning And Its Application To Medical Image Retrieval, Yang Liu, Rong Jin, Lily Mummert, Rahul Sukthankar, Adam Goode, Bin Zheng, Steven C. H. Hoi, Mahadev Satyanarayanan

Research Collection School Of Computing and Information Systems

Similarity measurement is a critical component in content-based image retrieval systems, and learning a good distance metric can significantly improve retrieval performance. However, despite extensive study, there are several major shortcomings with the existing approaches for distance metric learning that can significantly affect their application to medical image retrieval. In particular, "similarity" can mean very different things in image retrieval: resemblance in visual appearance (e.g., two images that look like one another) or similarity in semantic annotation (e.g., two images of tumors that look quite different yet are both malignant). Current approaches for distance metric learning typically address only one …

Go to article

Periodic Resource Reallocation In Two-Echelon Repairable Item Inventory Systems, Hoong Chuin Lau, Jie Pan, Huawei Song Jan 2010

Periodic Resource Reallocation In Two-Echelon Repairable Item Inventory Systems, Hoong Chuin Lau, Jie Pan, Huawei Song

Research Collection School Of Computing and Information Systems

Given an existing stock allocation in an inventory system, it is often necessary to perform reallocation over multiple time points to address inventory imbalance and maximize availability. In this paper, we focus on the situation where there are two opportunities to perform reallocation within a replenishment cycle. We derive a mathematical model to determine when and how to perform reallocation. Furthermore, we consider the extension of this model to the situation allowing an arbitrary number of reallocations. Experimental results show that the two-reallocation approach achieves better performance compared with the single-reallocation approach found in the literature. We also illustrate how …

Go to article

Anonymous Query Processing In Road Networks, Kyriakos Mouratidis, Man Lung Yiu Jan 2010

Anonymous Query Processing In Road Networks, Kyriakos Mouratidis, Man Lung Yiu

Research Collection School Of Computing and Information Systems

The increasing availability of location-aware mobile devices has given rise to a flurry of location-based services (LBSs). Due to the nature of spatial queries, an LBS needs the user position in order to process her requests. On the other hand, revealing exact user locations to a (potentially untrusted) LBS may pinpoint their identities and breach their privacy. To address this issue, spatial anonymity techniques obfuscate user locations, forwarding to the LBS a sufficiently large region instead. Existing methods explicitly target processing in the euclidean space and do not apply when proximity to the users is defined according to network distance …

Go to article

On The Potential Of Limitation-Oriented Malware Detection And Prevention Techniques On Mobile Phones, Qiang Yan, Robert H. Deng, Yingjiu Li, Tieyan Li Jan 2010

On The Potential Of Limitation-Oriented Malware Detection And Prevention Techniques On Mobile Phones, Qiang Yan, Robert H. Deng, Yingjiu Li, Tieyan Li

Research Collection School Of Computing and Information Systems

The malware threat for mobile phones is expected to increase with the functionality enhancement of mobile phones. This threat is exacerbated with the surge in population of smart phones instilled with stable Internet access which provides attractive targets for malware developers. Prior research on malware protection has focused on avoiding the negative impact of the functionality limitations of mobile phones to keep the performance cost within the limitations of mobile phones. Being different, this paper investigates the positive impact of these limitations on suppressing the development of mobile malware. We study the state-of-the-art mobile malware, as well as the progress …

Go to article

Information Integration For Graph Databases, Ee Peng Lim, Aixin Sun, Anwitaman Datta, Chang Kuiyu Jan 2010

Information Integration For Graph Databases, Ee Peng Lim, Aixin Sun, Anwitaman Datta, Chang Kuiyu

Research Collection School Of Computing and Information Systems

With increasing interest in querying and analyzing graph data from multiple sources, algorithms and tools to integrate different graphs become very important. Integration of graphs can take place at the schema and instance levels. While links among graph nodes pose additional challenges to graph information integration, they can also serve as useful features for matching nodes representing real-world entities. This chapter introduces a general framework to perform graph information integration. It then gives an overview of the state-of-the-art research and tools in graph information integration.

Go to article

First Prev Next Last