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

Physical Sciences and Mathematics Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 5881 - 5910 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Event Detection With Common User Interests, Meishan Hu, Aixin Sun, Ee Peng Lim Oct 2008

Event Detection With Common User Interests, Meishan Hu, Aixin Sun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we aim at detecting events of common user interests from huge volume of user-generated content. The degree of interest from common users in an event is evidenced by a significant surge of event-related queries issued to search for documents (e.g., news articles, blog posts) relevant to the event. Taking the stream of queries from users and the stream of documents as input, our proposed framework seamlessly integrates the two streams into a single stream of query profiles. A query profile is a set of documents matching a query at a given time. With the single stream of …

Go to article

Bayesian Tensor Approach For 3-D Face Modeling, Dacheng Tao, Mingli Song, Xuelong Li, Jialie Shen, Jimeng Sun, Xindong Wu, Christos Faloutsos, Stephen J. Maybank Oct 2008

Bayesian Tensor Approach For 3-D Face Modeling, Dacheng Tao, Mingli Song, Xuelong Li, Jialie Shen, Jimeng Sun, Xindong Wu, Christos Faloutsos, Stephen J. Maybank

Research Collection School Of Computing and Information Systems

Effectively modeling a collection of three-dimensional (3-D) faces is an important task in various applications, especially facial expression-driven ones, e.g., expression generation, retargeting, and synthesis. These 3-D faces naturally form a set of second-order tensors-one modality for identity and the other for expression. The number of these second-order tensors is three times of that of the vertices for 3-D face modeling. As for algorithms, Bayesian data modeling, which is a natural data analysis tool, has been widely applied with great success; however, it works only for vector data. Therefore, there is a gap between tensor-based representation and vector-based data analysis …

Go to article

Comparison Of Online Social Relations In Volume Vs Interaction: A Case Study Of Cyworld, Hyunwoo Chun, Haewoon Kwak, Young-Ho Eom, Yong-Yeol Ahn, Sue Moon, Hawoong. Jeong Oct 2008

Comparison Of Online Social Relations In Volume Vs Interaction: A Case Study Of Cyworld, Hyunwoo Chun, Haewoon Kwak, Young-Ho Eom, Yong-Yeol Ahn, Sue Moon, Hawoong. Jeong

Research Collection School Of Computing and Information Systems

Online social networking services are among the most popular Internet services according to Alexa.com and have become a key feature in many Internet services. Users interact through various features of online social networking services: making friend relationships, sharing their photos, and writing comments. These friend relationships are expected to become a key to many other features in web services, such as recommendation engines, security measures, online search, and personalization issues. However, we have very limited knowledge on how much interaction actually takes place over friend relationships declared online. A friend relationship only marks the beginning of online interaction.Does the interaction …

Go to article

Near-Duplicate Keyframe Retrieval By Nonrigid Image Matching, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu, Shuicheng Yan Oct 2008

Near-Duplicate Keyframe Retrieval By Nonrigid Image Matching, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu, Shuicheng Yan

Research Collection School Of Computing and Information Systems

Near-duplicate image retrieval plays an important role in many real-world multimedia applications. Most previous approaches have some limitations. For example, conventional appearance-based methods may suffer from the illumination variations and occlusion issue, and local feature correspondence-based methods often do not consider local deformations and the spatial coherence between two point sets. In this paper, we propose a novel and effective Nonrigid Image Matching (NIM) approach to tackle the task of near-duplicate keyframe retrieval from real-world video corpora. In contrast to previous approaches, the NIM technique can recover an explicit mapping between two near-duplicate images with a few deformation parameters and …

Go to article

Using Trusted Computing Technology To Facilitate Security Enforcement In Wireless Sensor Networks, Yanjiang Yang, Robert H. Deng, Feng Bao, Jianying Zhou Oct 2008

Using Trusted Computing Technology To Facilitate Security Enforcement In Wireless Sensor Networks, Yanjiang Yang, Robert H. Deng, Feng Bao, Jianying Zhou

Research Collection School Of Computing and Information Systems

Security enforcement in wireless sensor networks is by no means an easy task, due to the inherent resource-constrained nature of sensor nodes. To facilitate security enforcement, we propose to incorporate more powerful high-end Security Enforcement Facilitators (SEFs) into wireless sensor networks. In particular, the SEFs are equipped with TCG-compliant Trusted Platform Modules (TPMs) to protect cryptographic secrets, perform authenticated booting and attest their platform state to a remote base station.As such, the SEFs act as online trusted third parties toeffectively monitor the states of sensor nodes, help in keymanagement, simplify secure routing, and facilitate accesscontrol.

Go to article

Resource-Aware Video Multicasting Via Access Gateways In Wireless Mesh Networks, Wanqing Tu, Cormac J. Sreenan, Chun Tung Chou, Archan Misra Oct 2008

Resource-Aware Video Multicasting Via Access Gateways In Wireless Mesh Networks, Wanqing Tu, Cormac J. Sreenan, Chun Tung Chou, Archan Misra

Research Collection School Of Computing and Information Systems

This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative routes to avoid potentially lengthy multi-hop wireless paths with low capacity. A set of heuristic-based algorithms are described that together aim to maximize network capacity: the two-tier integrated architecture algorithm, the weighted gateway uploading algorithm, the link-controlled routing tree algorithm, and the alternative channel assignment algorithm. These algorithms use different approaches to arrange multicast group members into a clustered and two-tier integrated architecture in which network protocols can make use of …

Go to article

Spreadsheet Data Resampling For Monte-Carlo Simulation, Thin Yin Leong, Wee Leong Lee Oct 2008

Spreadsheet Data Resampling For Monte-Carlo Simulation, Thin Yin Leong, Wee Leong Lee

Research Collection School Of Computing and Information Systems

The pervasiveness of spreadsheets software resulted in its increased application as a simulation tool for business analysis. Random values generation supporting such evaluations using spreadsheets are simple and yet powerful. However, the typical approach to Monte-Carlo simulations, which is what simulations with stochasticity are called, requires significant amount of time to be spent on data collection, data collation, and distribution function fitting. In fact, the latter can be overwhelming for undergraduate students to learn and do properly in a short time. Resampling eliminates both the need to fit distributions to the sample data, and to perform the ensuing tests of …

Go to article

Spatio-Temporal Efficiency In A Taxi Dispatch System, Darshan Santani, Rajesh Krishna Balan, C. Jason Woodard Oct 2008

Spatio-Temporal Efficiency In A Taxi Dispatch System, Darshan Santani, Rajesh Krishna Balan, C. Jason Woodard

Research Collection School Of Computing and Information Systems

In this paper, we present an empirical analysis of the GPS-enabled taxi dispatch system used by the world’s second largest land transportation company. We first summarize the collective dynamics of the more than 6,000 taxicabs in this fleet. Next, we propose a simple method for evaluating the efficiency of the system over a given period of time and geographic zone. Our method yields valuable insights into system performance—in particular, revealing significant inefficiencies that should command the attention of the fleet operator. For example, despite the state of the art dispatching system employed by the company, we find imbalances in supply …

Go to article

Recursive Pattern Based Hybrid Supervised Training, Kiruthika Ramanathan, Sheng Uei Guan Oct 2008

Recursive Pattern Based Hybrid Supervised Training, Kiruthika Ramanathan, Sheng Uei Guan

Research Collection School Of Computing and Information Systems

We propose, theorize and implement the Recursive Pattern-based Hybrid Supervised (RPHS) learning algorithm. The algorithm makes use of the concept of pseudo global optimal solutions to evolve a set of neural networks, each of which can solve correctly a subset of patterns. The pattern-based algorithm uses the topology of training and validation data patterns to find a set of pseudo-optima, each learning a subset of patterns. It is therefore well adapted to the pattern set provided. We begin by showing that finding a set of local optimal solutions is theoretically equivalent, and more efficient, to finding a single global optimum …

Go to article

Leveraging Social Context For Searching Social Media, Marc Smith, Vladimir Barash, Lise Getoor, Hady W. Lauw Oct 2008

Leveraging Social Context For Searching Social Media, Marc Smith, Vladimir Barash, Lise Getoor, Hady W. Lauw

Research Collection School Of Computing and Information Systems

The ability to utilize and benefit from today's explosion of social media sites depends on providing tools that allow users to productively participate. In order to participate, users must be able to find resources (both people and information) that they find valuable. Here, we argue that in order to do this effectively, we should make use of a user's "social context". A user's social context includes both their personal social context (their friends and the communities to which they belong) and their community social context (their role and identity in different communities).

Go to article

Link Layer Multicast Using Smart Antennas: No Client Left Behind, Souvik Sen, Jie Xiong, Rahul Ghosh, Romit Roy Choudhury Oct 2008

Link Layer Multicast Using Smart Antennas: No Client Left Behind, Souvik Sen, Jie Xiong, Rahul Ghosh, Romit Roy Choudhury

Research Collection School Of Computing and Information Systems

Wireless link layer multicast is an important service primitive for emerging applications, such as live video, streaming audio, and other content telecasts. The broadcast nature of the wireless channel is amenable to multicast because a single packet transmission may be received by all clients in the multicast group. However, in view of diverse channel conditions at different clients, the rate of such a transmission is bottlenecked by the rate of the weakest client. Multicast throughput degrades severely. Attempts to increase the data rate result in lower reliability and higher unfairness. This paper utilizes smart beamforming antennas to improve multicast performance …

Go to article

An Effective Approach To 3d Deformable Surface Tracking, Jianke Zhu, Steven C. H. Hoi, Zenglin Xu, Michael R. Lyu Oct 2008

An Effective Approach To 3d Deformable Surface Tracking, Jianke Zhu, Steven C. H. Hoi, Zenglin Xu, Michael R. Lyu

Research Collection School Of Computing and Information Systems

The key challenge with 3D deformable surface tracking arises from the difficulty in estimating a large number of 3D shape parameters from noisy observations. A recent state-of-the-art approach attacks this problem by formulating it as a Second Order Cone Programming (SOCP) feasibility problem. The main drawback of this solution is the high computational cost. In this paper, we first reformulate the problem into an unconstrained quadratic optimization problem. Instead of handling a large set of complicated SOCP constraints, our new formulation can be solved very efficiently by resolving a set of sparse linear equations. Based on the new framework, a …

Go to article

Structuring Low-Quality Videotaped Lectures For Cross-Reference Browsing By Video Text Analysis, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong Oct 2008

Structuring Low-Quality Videotaped Lectures For Cross-Reference Browsing By Video Text Analysis, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong

Research Collection School Of Computing and Information Systems

This paper presents an unified approach in analyzing and Structuring the content of videotaped lectures for distance learning applications. By Structuring lecture videos, we can Support topic indexing and semantic querying of multimedia documents captured in the traditional classrooms. Our goal in this paper is to automatically construct the cross references of lecture videos and textual documents so as to facilitate the synchronized browsing and presentation of multimedia information. The major issues involved in our approach are topical event detection, video text analysis and the matching of slide shots and external documents. In topical event detection, a novel transition detector …

Go to article

Accelerating Near-Duplicate Video Matching By Combining Visual Similarity And Alignment Distortion, Hung-Khoon Tan, Xiao Wu, Chong-Wah Ngo, Wan-Lei Zhao Oct 2008

Accelerating Near-Duplicate Video Matching By Combining Visual Similarity And Alignment Distortion, Hung-Khoon Tan, Xiao Wu, Chong-Wah Ngo, Wan-Lei Zhao

Research Collection School Of Computing and Information Systems

In this paper, we investigate a novel approach to accelerate the matching of two video clips by exploiting the temporal coherence property inherent in the keyframe sequence of a video. Motivated by the fact that keyframe correspondences between near-duplicate videos typically follow certain spatial arrangements, such property could be employed to guide the alignment of two keyframe sequences. We set the alignment problem as an integer quadratic programming problem, where the cost function takes into account both the visual similarity of the corresponding keyframes as well as the alignment distortion among the set of correspondences. The set of keyframe-pairs found …

Go to article

Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo Oct 2008

Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Effective utilization of semantic concept detectors for large-scale video search has recently become a topic of intensive studies. One of main challenges is the selection and fusion of appropriate detectors, which considers not only semantics but also the reliability of detectors, observability and diversity of detectors in target video domains. In this paper, we present a novel fusion technique which considers different aspects of detectors for query answering. In addition to utilizing detectors for bridging the semantic gap of user queries and multimedia data, we also address the issue of "observability gap" among detectors which could not be directly inferred …

Go to article

Using English Information In Non-English Web Search, Wei Gao, Wei Gao, Ming Zhou Oct 2008

Using English Information In Non-English Web Search, Wei Gao, Wei Gao, Ming Zhou

Research Collection School Of Computing and Information Systems

The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is that they are designed around features such as PageRank, automatic query and domain taxonomies, and click-through information, etc. Unfortunately, many of these features are absent or altered in other languages. In this work, we show how to exploit these English features for a subset of Chinese queries which we call linguistically non-local (LNL). LNL Chinese queries have a minimally ambiguous English translation which also functions as a good English query. We first …

Go to article

Specifying And Verifying Sensor Networks: An Experiment Of Formal Methods, Jin Song Dong, Jing Sun, Jun Sun, Kenji Taguchi, Xian Zhang Oct 2008

Specifying And Verifying Sensor Networks: An Experiment Of Formal Methods, Jin Song Dong, Jing Sun, Jun Sun, Kenji Taguchi, Xian Zhang

Research Collection School Of Computing and Information Systems

With the development of sensor technology and electronic miniaturization, wireless sensor networks have shown a wide range of promising applications as well as challenges. Early stage sensor network analysis is critical, which allows us to reveal design errors before sensor deployment. Due to their distinguishable features, system specification and verification of sensor networks are highly non-trivial tasks. On the other hand, numerous formal theories and analysis tools have been developed in formal methods community, which may offer a systematic method for formal analysis of sensor networks. This paper presents our attempt on applying formal methods to sensor network specification/verification. An …

Go to article

Relative Importance, Specific Investment And Ownership In Interorganizational Systems., Kunsoo Han, Robert J. Kauffman, Barrie R. Nault Sep 2008

Relative Importance, Specific Investment And Ownership In Interorganizational Systems., Kunsoo Han, Robert J. Kauffman, Barrie R. Nault

Research Collection School Of Computing and Information Systems

Implementation and maintenance of interorganizational systems (IOS) require investments by all the participating firms. Compared with intraorganizational systems, however, there are additional uncertainties and risks. This is because the benefits of IOS investment depend not only on a firm's own decisions, but also on those of its business partners. Without appropriate levels of investment by all the firms participating in an IOS, they cannot reap the full benefits. Drawing upon the literature in institutional economics, we examine IOS ownership as a means to induce value-maximizing noncontractible investments. We model the impact of two factors derived from the theory of incomplete …

Go to article

Tuning Into The Digital Channel: Evaluating Business Model Fit For Internet Firm Survival, Robert J. Kauffman, Bin Wang Sep 2008

Tuning Into The Digital Channel: Evaluating Business Model Fit For Internet Firm Survival, Robert J. Kauffman, Bin Wang

Research Collection School Of Computing and Information Systems

More than 5,000 Internet firms have failed since the beginning of 2000. One common perception is that the downturn in the economy drove many firms out of business. But then, why have some firms survived? In this research, we provide an empirical analysis by examining how the business model characteristics of an Internet firm affect its survival. We analyze a panel data set of 130 public Internet firms using two different techniques: non-parametric survival analysis, and the semiparametric Cox proportional hazards model. We characterize the survival rates throughout the lifetimes of the public Internet firms in our sample. Our results …

Go to article

An Efficient Pir Construction Using Trusted Hardware, Yanjiang Yang, Xuhua Ding, Robert H. Deng, Feng Bao Sep 2008

An Efficient Pir Construction Using Trusted Hardware, Yanjiang Yang, Xuhua Ding, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

For a private information retrieval (PIR) scheme to be deployed in practice, low communication complexity and low computation complexity are two fundamental requirements it must meet. Most existing PIR schemes only focus on the communication complexity. The reduction on the computational complexity did not receive the due treatment mainly because of its O(n) lower bound. By using the trusted hardware based model, we design a novel scheme which breaks this barrier. With constant storage, the computation complexity of our scheme, including offline computation, is linear to the number of queries and is bounded by after optimization.

Go to article

Generating Robust Schedules Subject To Resource And Duration Uncertainties, Na Fu, Hoong Chuin Lau, Fei Xiao Sep 2008

Generating Robust Schedules Subject To Resource And Duration Uncertainties, Na Fu, Hoong Chuin Lau, Fei Xiao

Research Collection School Of Computing and Information Systems

We consider the Resource-Constrained Project Scheduling Problem with minimal and maximal time lags under resource and duration uncertainties. To manage resource uncertainties, we build upon the work of Lambrechts et al 2007 and develop a method to analyze the effect of resource breakdowns on activity durations. We then extend the robust local search framework of Lau et al 2007 with additional considerations on the impact of unexpected resource breakdowns to the project makespan, so that partial order schedules (POS) can absorb both resource and duration uncertainties. Experiments show that our proposed model is capable of addressing the uncertainty of resources, …

Go to article

Distinguishing Between Fe And Ddos Using Randomness Check, Hyundo Park, Peng Li, Debin Gao, Heejo Lee, Robert H. Deng Sep 2008

Distinguishing Between Fe And Ddos Using Randomness Check, Hyundo Park, Peng Li, Debin Gao, Heejo Lee, Robert H. Deng

Research Collection School Of Computing and Information Systems

Threads posed by Distributed Denial of Service (DDoS) attacks are becoming more serious day by day. Accurately detecting DDoS becomes an important and necessary step in securing a computer network. However, Flash Event (FE), which is created by legitimate requests, shares very similar characteristics with DDoS in many aspects and makes it hard to be distinguished from DDoS attacks. In this paper, we propose a simple yet effective mechanism called FDD (FE and DDoS Distinguisher) to distinguish FE and DDoS. To the best of our knowledge, this is the first effective and practical mechanism that distinguishes FE and DDoS attacks. …

Go to article

A Heuristic Method For Job-Shop Scheduling With An Infinite Wait Buffer: From One-Machine To Multi-Machine Problems, Z. J. Zhao, J. Kim, M. Luo, Hoong Chuin Lau, S. S. Ge Sep 2008

A Heuristic Method For Job-Shop Scheduling With An Infinite Wait Buffer: From One-Machine To Multi-Machine Problems, Z. J. Zhao, J. Kim, M. Luo, Hoong Chuin Lau, S. S. Ge

Research Collection School Of Computing and Information Systems

Through empirical comparison of classical job shop problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimization Micro-model (IMM) heuristic method with the mixed integer programming (MIP) solution by CPLEX. For multi-machine problems, the IMM heuristic method is faster and achieves a better solution. Finally, for a large problem instance with 409 jobs and 30 types of machines, IMM-heuristic method is compared with ProModel and we find that the heuristic method is slightly …

Go to article

Do Online Reviews Affect Product Sales? The Role Of Reviewer Characteristics And Temporal Effects, Nan Hu, Ling Liu, Jennifer Zhang Sep 2008

Do Online Reviews Affect Product Sales? The Role Of Reviewer Characteristics And Temporal Effects, Nan Hu, Ling Liu, Jennifer Zhang

Research Collection School Of Computing and Information Systems

Online product reviews provided by consumers who previously purchased products have become a major information source for consumers and marketers regarding product quality. This study extends previous research by conducting a more compelling test of the effect of online reviews on sales. In particular, we consider both quantitative and qualitative aspects of online reviews, such as reviewer quality, reviewer exposure, product coverage, and temporal effects. Using transaction cost economics and uncertainty reduction theories, this study adopts a portfolio approach to assess the effectiveness of the online review market. We show that consumers understand the value difference between favorable news and …

Go to article

Cascade Rsvm In Peer-To-Peer Network, Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng Sep 2008

Cascade Rsvm In Peer-To-Peer Network, Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng

Research Collection School Of Computing and Information Systems

The goal of distributed learning in P2P networks is to achieve results as close as possible to those from centralized approaches. Learning models of classification in a P2P network faces several challenges like scalability, peer dynamism, asynchronism and data privacy preservation. In this paper, we study the feasibility of building SVM classifiers in a P2P network. We show how cascading SVM can be mapped to a P2P network of data propagation. Our proposed P2P SVM provides a method for constructing classifiers in P2P networks with classification accuracy comparable to centralized classifiers and better than other distributed classifiers. The proposed algorithm …

Go to article

Tagnsearch: Searching And Navigating Geo-Referenced Collections Of Photographs, Quang Minh Nguyen, Thi Nhu Quynh Kim, Dion Hoe-Lian Goh, Yin-Leng Theng, Ee Peng Lim, Aixin Sun, Chew-Hung Chang, Kalyani Chatterjea Sep 2008

Tagnsearch: Searching And Navigating Geo-Referenced Collections Of Photographs, Quang Minh Nguyen, Thi Nhu Quynh Kim, Dion Hoe-Lian Goh, Yin-Leng Theng, Ee Peng Lim, Aixin Sun, Chew-Hung Chang, Kalyani Chatterjea

Research Collection School Of Computing and Information Systems

TagNSearch is a map-based tool for searching and browsing geo-tagged photographs based on their associated tags. Using Flickr as the dataset, TagNSearch returns, for a given query, photographs clustered by locations, and summarizes each cluster of photographs by cluster-specific tags. A map-based interface is also provided to help users better search, navigate and browse photographs and their clusters. A qualitative evaluation comparing TagNSearch and an existing tag search support in Flickr was also conducted. The task involved finding locations associated with a set of photographs. Participants were found to perform this task better using TagNSearch than Flickr.

Go to article

Software Nightmares, Manoj Thulasidas Sep 2008

Software Nightmares, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

To err is human, but to really foul things up, you need a computer. So states the remarkably insightful Murphy’s Law. And nowhere else does this ring truer than in our financial workplace. After all, it is the financial sector that drove the rapid progress in the computing industry – which is why the first computing giant had the word “business” in its name. The financial industry keeps up with the developments in the computer industry for one simple reason. Stronger computers and smarter programs mean more money — a concept we readily grasp. As we use the latest and …

Go to article

Simulating A Smartboard By Real-Time Gesture Detection In Lecture Videos, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong Aug 2008

Simulating A Smartboard By Real-Time Gesture Detection In Lecture Videos, Feng Wang, Chong-Wah Ngo, Ting-Chuen Pong

Research Collection School Of Computing and Information Systems

Gesture plays an important role for recognizing lecture activities in video content analysis. In this paper, we propose a real-time gesture detection algorithm by integrating cues from visual, speech and electronic slides. In contrast to the conventional "complete gesture" recognition, we emphasize detection by the prediction from "incomplete gesture". Specifically, intentional gestures are predicted by the modified hidden Markov model (HMM) which can recognize incomplete gestures before the whole gesture paths are observed. The multimodal correspondence between speech and gesture is exploited to increase the accuracy and responsiveness of gesture detection. In lecture presentation, this algorithm enables the on-the-fly editing …

Go to article

Classification In P2p Networks By Bagging Cascade Rsvms, Hock Hee Ang, Vikvekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng, Anwitaman Datta Aug 2008

Classification In P2p Networks By Bagging Cascade Rsvms, Hock Hee Ang, Vikvekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng, Anwitaman Datta

Research Collection School Of Computing and Information Systems

Data mining tasks in P2P are bound by issues like scalability, peer dynamism, asynchronism, and data privacy preservation. These challenges pose difficulties for deploying conventional machine learning techniques in P2P networks, which may be hard to achieve classification accuracies comparable to regular centralized solutions. We recently investigated the classification problem in P2P networks and proposed a novel P2P classification approach by cascading Reduced Support Vector Machines (RSVM). Although promising results were obtained, the existing solution has some drawback of redundancy in both communication and computation. In this paper, we present a new approach to over the limitation of the previous …

Go to article

The Pricing Strategy Analysis For The Software-As-A-Service Business Model, Dan Ma, Abraham Seidmann Aug 2008

The Pricing Strategy Analysis For The Software-As-A-Service Business Model, Dan Ma, Abraham Seidmann

Research Collection School Of Computing and Information Systems

The Software-as-a-Service (SaaS) model is a novel way of delivering software applications. In this paper, we present an analytical model to study the competition between the SaaS and the traditional COTS (Commercial off-the-shelf) software. The main research goal is to analyze the pricing strategy of the SaaS in a competitive setting. The model captures the most salient differences between the SaaS and COTS, including their distinct pricing structures, user initial setup costs, system customization levels, and delivery channels. We find that the two could coexist in a competitive market in the long run, and more importantly, we show how the …

Go to article

First Prev Next Last