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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 4771 - 4800 of 5707

Full-Text Articles in Entire DC Network

Analysis Of Tradeoffs Between Buffer And Qos Requirements In Wireless Networks, Raphael Rom, Hwee-Pink Tan Oct 2009

Analysis Of Tradeoffs Between Buffer And Qos Requirements In Wireless Networks, Raphael Rom, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

In this paper, we consider the scheduling problem where data packets from K input-flows need to be delivered to K corresponding wireless receivers over a heterogeneous wireless channel. Our objective is to design a wireless scheduler that achieves good throughput and fairness performance while minimizing the buffer requirement at each wireless receiver. This is a challenging problem due to the unique characteristics of the wireless channel. We propose a novel idea of exploiting both the long-term and short-term error behavior of the wireless channel in the scheduler design. In addition to typical first-order Quality of Service (QoS) metrics such as …


A Study Of Content Authentication In Proxy-Enabled Multimedia Delivery Systems: Model, Techniques, And Applications, Robert H. Deng, Yanjiang Yang Oct 2009

A Study Of Content Authentication In Proxy-Enabled Multimedia Delivery Systems: Model, Techniques, And Applications, Robert H. Deng, Yanjiang Yang

Research Collection School Of Computing and Information Systems

Compared with the direct server-user approach, the server-proxy-user architecture for multimedia delivery promises significantly improved system scalability. The introduction of the intermediary transcoding proxies between content servers and end users in this architecture, however, brings unprecedented challenges to content security. In this article, we present a systematic study on the end-to-end content authentication problem in the server-proxy-user context, where intermediary proxies transcode multimedia content dynamically. We present a formal model for the authentication problem, propose a concrete construction for authenticating generic data modality and formally prove its security. We then apply the generic construction to authenticating specific multimedia formats, for …


A Service Choice Model For Optimizing Taxi Service Delivery, Shih-Fen Cheng, Xin Qu Oct 2009

A Service Choice Model For Optimizing Taxi Service Delivery, Shih-Fen Cheng, Xin Qu

Research Collection School Of Computing and Information Systems

Taxi service has undergone radical revamp in recent years. In particular, significant investments in communication system and GPS devices have improved quality of taxi services through better dispatches. In this paper, we propose to leverage on such infrastructure and build a service choice model that helps individual drivers in deciding whether to serve a specific taxi stand or not. We demonstrate the value of our model by applying it to a real-world scenario. We also highlight interesting new potential approaches that could significantly improve the quality of taxi services.


Continuous Monitoring Of Spatial Queries In Wireless Broadcast Environments, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias Oct 2009

Continuous Monitoring Of Spatial Queries In Wireless Broadcast Environments, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Wireless data broadcast is a promising technique for information dissemination that leverages the computational capabilities of the mobile devices in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may then tune in the broadcast channel and process their queries locally without contacting the server. Previous work on spatial query processing for wireless broadcast systems has only considered snapshot queries over static data. In this paper, we propose an air indexing framework that 1) outperforms the existing (i.e., snapshot) techniques in …


Semantics-Preserving Bag-Of-Words Models For Efficient Image Annotation, Lei Wu, Steven C. H. Hoi, Nenghai Yu Oct 2009

Semantics-Preserving Bag-Of-Words Models For Efficient Image Annotation, Lei Wu, Steven C. H. Hoi, Nenghai Yu

Research Collection School Of Computing and Information Systems

The Bag-of-Words (BoW) model is a promising image representation for annotation. One critical limitation of existing BoW models is the semantic loss during the codebook generation process, in which BoW simply clusters visual words in Euclidian space. However, distance between two visual words in Euclidean space does not necessarily reflect the semantic distance between the two concepts, due to the semantic gap between low-level features and high-level semantics. In this paper, we propose a novel scheme for learning a codebook such that semantically related features will be mapped to the same visual word. In particular, we consider the distance between …


Domain Adaptive Semantic Diffusion For Large Scale Context-Based Video Annotation, Yu-Gang Jiang, Jun Wang, Shih-Fu Chang, Chong-Wah Ngo Oct 2009

Domain Adaptive Semantic Diffusion For Large Scale Context-Based Video Annotation, Yu-Gang Jiang, Jun Wang, Shih-Fu Chang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Learning to cope with domain change has been known as a challenging problem in many real-world applications. This paper proposes a novel and efficient approach, named domain adaptive semantic diffusion (DASD), to exploit semantic context while considering the domain-shift-of-context for large scale video concept annotation. Starting with a large set of concept detectors, the proposed DASD refines the initial annotation results using graph diffusion technique, which preserves the consistency and smoothness of the annotation over a semantic graph. Different from the existing graph learning methods which capture relations among data samples, the semantic graph treats concepts as nodes and the …


A Surprise Triggered Adaptive And Reactive (Star) Framework For Online Adaptation In Non-Stationary Environments, Truong-Huy Dinh Nguyen, Tze-Yun Leong Oct 2009

A Surprise Triggered Adaptive And Reactive (Star) Framework For Online Adaptation In Non-Stationary Environments, Truong-Huy Dinh Nguyen, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

We consider the task of developing an adaptive autonomous agent that can interact with non-stationary environments. Traditional learning approaches such as Reinforcement Learning assume stationary characteristics over the course of the problem, and are therefore unable to learn the dynamically changing settings correctly. We introduce a novel adaptive framework that can detect dynamic changes due to non-stationary elements. The Surprise Triggered Adaptive and Reactive (STAR) framework is inspired by human adaptability in dealing with daily life changes. An agent adopting the STAR framework consists primarily of two components, Adapter and Reactor. The Reactor chooses suitable actions based on predictions made …


Verifying Stateful Timed Csp Using Implicit Clocks And Zone Abstraction, Jun Sun, Yang Liu, Jin Song Dong, Xian Zhang Sep 2009

Verifying Stateful Timed Csp Using Implicit Clocks And Zone Abstraction, Jun Sun, Yang Liu, Jin Song Dong, Xian Zhang

Research Collection School Of Computing and Information Systems

In this work, we study model checking of compositional real-time systems. A system is modeled using mutable data variables as well as a compositional timed process. Instead of explicitly manipulating clock variables, a number of compositional timed behavioral patterns are used to capture quantitative timing requirements, e.g. delay, timeout, deadline, timed interrupt, etc. A fully automated abstraction technique is developed to build an abstract finite state machine from the model. The idea is to dynamically create/delete clocks, and maintain/solve a constraint on the clocks. The abstract machine weakly bi-simulates the model and, therefore, LTL model checking or trace-refinement checking are …


Accelerating Sequence Searching: Dimensionality Reduction Method, Guojie Song, Bin Cui, Baihua Zheng, Kunqing Xie, Dongqing Yang Sep 2009

Accelerating Sequence Searching: Dimensionality Reduction Method, Guojie Song, Bin Cui, Baihua Zheng, Kunqing Xie, Dongqing Yang

Research Collection School Of Computing and Information Systems

Similarity search over long sequence dataset becomes increasingly popular in many emerging applications, such as text retrieval, genetic sequences exploring, etc. In this paper, a novel index structure, namely Sequence Embedding Multiset tree (SEM − tree), has been proposed to speed up the searching process over long sequences. The SEM-tree is a multi-level structure where each level represents the sequence data with different compression level of multiset, and the length of multiset increases towards the leaf level which contains original sequences. The multisets, obtained using sequence embedding algorithms, have the desirable property that they do not need to keep the …


Visible Reverse K-Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien Lee, Ken C. K. Lee, Qing Li Sep 2009

Visible Reverse K-Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Wang-Chien Lee, Ken C. K. Lee, Qing Li

Research Collection School Of Computing and Information Systems

Reverse nearest neighbor (RNN) queries have a broad application base such as decision support, profile-based marketing, resource allocation, etc. Previous work on RNN search does not take obstacles into consideration. In the real world, however, there are many physical obstacles (e.g., buildings) and their presence may affect the visibility between objects. In this paper, we introduce a novel variant of RNN queries, namely, visible reverse nearest neighbor (VRNN) search, which considers the impact of obstacles on the visibility of objects. Given a data set P, an obstacle set O, and a query point q in a 2D space, a VRNN …


Detecting Automotive Exhaust Gas Based On Fuzzy Inference System, Li. Shujin, Ming Bai, Quan Wang, Bo Chen, Xiaobing Zhao, Ting Yang, Zhaoxia Wang Sep 2009

Detecting Automotive Exhaust Gas Based On Fuzzy Inference System, Li. Shujin, Ming Bai, Quan Wang, Bo Chen, Xiaobing Zhao, Ting Yang, Zhaoxia Wang

Research Collection School Of Computing and Information Systems

This paper proposes a method of detecting automotive exhaust gas based on fuzzy logic inference after analyzing the principle of the infrared automobile exhaust gas analyzer and the influence of the environmental temperature on analyzer. This paper analyses the measurement error caused by environmental temperature, and then makes a non-linear error correction of temperature for the infrared sensor using fuzzy inference. The results of simulation have clearly demonstrated that the proposed fuzzy compensation scheme is better than the non-fuzzy method.


Batch Mode Active Learning With Applications To Text Categorization And Image Retrieval, Steven C. H. Hoi, Rong Jin, Michael R. Lyu Sep 2009

Batch Mode Active Learning With Applications To Text Categorization And Image Retrieval, Steven C. H. Hoi, Rong Jin, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Most machine learning tasks in data classification and information retrieval require manually labeled data examples in the training stage. The goal of active learning is to select the most informative examples for manual labeling in these learning tasks. Most of the previous studies in active learning have focused on selecting a single unlabeled example in each iteration. This could be inefficient, since the classification model has to be retrained for every acquired labeled example. It is also inappropriate for the setup of information retrieval tasks where the user's relevance feedback is often provided for the top K retrieved items. In …


A Latent Model For Visual Disambiguation Of Keyword-Based Image Search, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia, Sujoy Roy Sep 2009

A Latent Model For Visual Disambiguation Of Keyword-Based Image Search, Kong-Wah Wan, Ah-Hwee Tan, Joo-Hwee Lim, Liang-Tien Chia, Sujoy Roy

Research Collection School Of Computing and Information Systems

The problem of polysemy in keyword-based image search arises mainly from the inherent ambiguity in user queries. We propose a latent model based approach that resolves user search ambiguity by allowing sense specific diversity in search results. Given a query keyword and the images retrieved by issuing the query to an image search engine, we first learn a latent visual sense model of these polysemous images. Next, we use Wikipedia to disambiguate the word sense of the original query, and issue these Wiki-senses as new queries to retrieve sense specific images. A sense-specific image classifier is then learnt by combining …


Localized Matching Using Earth Mover's Distance Towards Discovery Of Common Patterns From Small Image Samples, Hung-Khoon Tan, Chong-Wah Ngo Sep 2009

Localized Matching Using Earth Mover's Distance Towards Discovery Of Common Patterns From Small Image Samples, Hung-Khoon Tan, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for the discovery of common patterns in a small set of images by region matching. The issues in feature robustness, matching robustness and noise artifact are addressed to delve into the potential of using regions as the basic matching unit. We novelly employ the many-to-many (M2M) matching strategy, specifically with the Earth Mover's Distance (EMD), to increase resilience towards the structural inconsistency from improper region segmentation. However, the matching pattern of M2M is dispersed and unregulated in nature, leading to the challenges of mining a common pattern while identifying the underlying transformation. To avoid …


Multi-View Ear Recognition Based On Moving Least Square Pose Interpolation, Heng Liu, David Zhang, Zhiyuan Zhang Sep 2009

Multi-View Ear Recognition Based On Moving Least Square Pose Interpolation, Heng Liu, David Zhang, Zhiyuan Zhang

Research Collection School Of Computing and Information Systems

Based on moving least square, a multi-view ear pose interpolation and corresponding recognition approach is proposed. This work firstly analyzes the shape characteristics of actual trace caused by ear pose varying in feature space. Then according to training samples pose projection, we manage to recover the complete multi-view ear pose manifold by using moving least square pose interpolation. The constructed multi-view ear pose manifolds can be easily utilized to recognize ear images captured under different views based on finding the minimal projection distance to the manifolds. The experimental results and some comparisons show the new method is superior to manifold …


Hierarchical Self-Healing Key Distribution For Heterogeneous Wireless Sensor Networks, Yanjiang Yang, Jianying Zhou, Robert H. Deng, Feng Bao Sep 2009

Hierarchical Self-Healing Key Distribution For Heterogeneous Wireless Sensor Networks, Yanjiang Yang, Jianying Zhou, Robert H. Deng, Feng Bao

Research Collection School Of Computing and Information Systems

Self-healing group key distribution aims to achieve robust key distribution over lossy channels in wireless sensor networks (WSNs). However, all existing self-healing group key distribution schemes in the literature consider homogenous WSNs which are known to be unscalable. Heterogeneous WSNs have better scalability and performance than homogenous ones. We are thus motivated to study hierarchial self-healing group key distribution, tailored to the heterogeneous WSN architecture. In particular, we revisit and adapt Dutta et al.’s model to the setting of hierarchical self-healing group key distribution, and propose a concrete scheme that achieves computational security and high efficiency.


Understanding Early Diffusion Of Digital Wireless Phones, Robert J. Kauffman, Angsana A. Techatassanasoontorn Sep 2009

Understanding Early Diffusion Of Digital Wireless Phones, Robert J. Kauffman, Angsana A. Techatassanasoontorn

Research Collection School Of Computing and Information Systems

There is increasing empirical evidence from academic research and strong recognition among policymakers that wide diffusion and innovative uses of digital wireless phones are important sources of a country's economic growth and social development. Adopters do not necessarily adopt digital wireless phones at the same time though. Although the diffusion of innovation theory suggests five adopter categories according to their degree of innovativeness, this approach lacks theoretical justification and, more importantly, it makes a critical assumption of a normal distribution of adopters that needs empirical validation. This study investigates the basis for defining different adopter categories and factors that affect …


A Hybrid Firm's Pricing Strategy In Electronic Commerce Under Channel Migration, Robert John Kauffman, Dongwon Lee, Jung Lee, Byungjoon Yoo Sep 2009

A Hybrid Firm's Pricing Strategy In Electronic Commerce Under Channel Migration, Robert John Kauffman, Dongwon Lee, Jung Lee, Byungjoon Yoo

Research Collection School Of Computing and Information Systems

Achieving an effective business design across the Internet and the off-line channel is a critical concern for a hybrid firm's choice of pricing strategy. Two pricing models are proposed to examine how consumer channel migration (one-way channel interaction from the traditional sales channel to the Internet) affects pricing strategy. One model has no interaction between the Internet and off-line channels. The other includes the possibility of one-way migration to the Internet channel and incorporates consumers' channel-switching costs and loyalty to the firm. The two models offer interesting results for understanding traditional and Internet-based selling. A high level of channel migration …


Admission Control For Differentiated Services In Future Generation Cdma Networks, Hwee-Pink Tan, Rudesindo Núñez-Queija, Adriana F. Gabor, Onno J. Boxma Sep 2009

Admission Control For Differentiated Services In Future Generation Cdma Networks, Hwee-Pink Tan, Rudesindo Núñez-Queija, Adriana F. Gabor, Onno J. Boxma

Research Collection School Of Computing and Information Systems

Future Generation CDMA wireless systems, e.g., 3G, can simultaneously accommodate flow transmissions of users with widely heterogeneous applications. As radio resources are limited, we propose an admission control rule that protects users with stringent transmission bit-rate requirements (“streaming traffic”) while offering sufficient capacity over longer time intervals to delay-tolerant users (“elastic traffic”). While our strategy may not satisfy classical notions of fairness, we aim to reduce congestion and increase overall throughput of elastic users. Using time-scale decomposition, we develop approximations to evaluate the performance of our differentiated admission control strategy to support integrated services with transmission bit-rate requirements in a …


Exploiting Bilingual Information To Improve Web Search, Wei Gao, John Bitzer, Ming Zhou, Kam-Fai Wong Aug 2009

Exploiting Bilingual Information To Improve Web Search, Wei Gao, John Bitzer, Ming Zhou, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Web search quality can vary widely across languages, even for the same information need. We propose to exploit this variation in quality by learning a ranking function on bilingual queries: queries that appear in query logs for two languages but represent equivalent search interests. For a given bilingual query, along with corresponding monolingual query log and monolingual ranking, we generate a ranking on pairs of documents, one from each language. Then we learn a linear ranking function which exploits bilingual features on pairs of documents, as well as standard monolingual features. Finally, we show how to reconstruct monolingual ranking from …


3-D Virtual Worlds And Higher Education, X. Chen, Keng Siau, Fiona Fui-Hoon Nah Aug 2009

3-D Virtual Worlds And Higher Education, X. Chen, Keng Siau, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

Conducting education in three-dimensional (3-D) virtual worlds is an emerging phenomenon in the educational arena. The objective of this research is to investigate the factors influencing students’ intention to adopt the 3-D virtual worlds for delivery of education. Drawing on existing technology acceptance models as well as studies in traditional and distance education, we developed a model to study students’ acceptance of using a 3-D virtual world for education and propose to test the model empirically using survey data collected from college students. We also study the use of two instructional methods in the 3-D virtual world. This study contributes …


Evaluating Straddle Carrier Deployment Policies: A Simulation Study For The Piraeus Container Terminal, Eleni Hadjiconstantinou, Nang Laik Ma Aug 2009

Evaluating Straddle Carrier Deployment Policies: A Simulation Study For The Piraeus Container Terminal, Eleni Hadjiconstantinou, Nang Laik Ma

Research Collection School Of Computing and Information Systems

Most container terminals in the world today are operating up to their capacities. In this paper, we have developed a decision support system to optimise yard operations by considering all container flows (import, export and transshipment) through the yard with the view to improving the terminal performance and efficiency. In another paper, we proposed an optimisation model that determines optimal container locations and straddle carrier (SC) movements with the objective of minimising the overall storage and handling cost of containers. In this paper, a discrete event simulation tool for container terminal operations has been developed with three objectives: (i) to …


Essential Spreadsheet Modeling Course For Business Students, Thin Yin Leong, Michelle L. F. Cheong Aug 2009

Essential Spreadsheet Modeling Course For Business Students, Thin Yin Leong, Michelle L. F. Cheong

Research Collection School Of Computing and Information Systems

Ask any student at the Singapore Management University (SMU) to name one of the most practical and useful courses offered by the university. The answer would inevitably include CAT. CAT stands for the "Computer as an Analysis Tool" course. Originally based on a course of the same title offered by the Wharton Business School, the focus of CAT was shifted to provide business students the essential practical skills and necessary "real-world" exposure to better use personal computers for resolving business problems. The course is basically centered on using the Excel spreadsheet to work on ambiguous ill-defined problems.


A Distributed Spatial Index For Error-Prone Wireless Data Broadcast, Baihua Zheng, Wang-Chien Lee, Ken C. K. Lee, Dik Lun Lee, Min Shao Aug 2009

A Distributed Spatial Index For Error-Prone Wireless Data Broadcast, Baihua Zheng, Wang-Chien Lee, Ken C. K. Lee, Dik Lun Lee, Min Shao

Research Collection School Of Computing and Information Systems

Information is valuable to users when it is available not only at the right time but also at the right place. To support efficient location-based data access in wireless data broadcast systems, a distributed spatial index (called DSI) is presented in this paper. DSI is highly efficient because it has a linear yet fully distributed structure that naturally shares links in different search paths. DSI is very resilient to the error-prone wireless communication environment because interrupted search operations based on DSI can be resumed easily. It supports search algorithms for classical location-based queries such as window queries and kNN queries …


Data Mining For Software Engineering, Tao Xie, Suresh Thummalapenta, David Lo, Chao Liu Aug 2009

Data Mining For Software Engineering, Tao Xie, Suresh Thummalapenta, David Lo, Chao Liu

Research Collection School Of Computing and Information Systems

To improve software productivity and quality, software engineers are increasingly applying data mining algorithms to various software engineering tasks. However, mining SE data poses several challenges. The authors present various algorithms to effectively mine sequences, graphs, and text from such data.


On Efficient Mutual Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li Aug 2009

On Efficient Mutual Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li

Research Collection School Of Computing and Information Systems

This paper studies a new form of nearest neighbor queries in spatial databases, namely, mutual nearest neighbour (MNN) search. Given a set D of objects and a query object q, an MNN query returns from D, the set of objects that are among the k1 (≥ 1) nearest neighbors (NNs) of q; meanwhile, have q as one of their k2(≥ 1) NNs. Although MNN queries are useful in many applications involving decision making, data mining, and pattern recognition, it cannot be efficiently handled by existing spatial query processing approaches. In this paper, we present …


Optimal-Location-Selection Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li Aug 2009

Optimal-Location-Selection Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li

Research Collection School Of Computing and Information Systems

This paper introduces and solves a novel type of spatial queries, namely, Optimal-Location-Selection (OLS) search, which has many applications in real life. Given a data object set D_A, a target object set D_B, a spatial region R, and a critical distance d_c in a multidimensional space, an OLS query retrieves those target objects in D_B that are outside R but have maximal optimality. Here, the optimality of a target object b \in D_B located outside R is defined as the number of the data objects from D_A that are inside R and meanwhile have their distances to b not exceeding …


Inferring Player Rating From Performance Data In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Muhammad Aurangzeb Ahmad, Nishith Pathak, Jaideep Srivastava Aug 2009

Inferring Player Rating From Performance Data In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Muhammad Aurangzeb Ahmad, Nishith Pathak, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

This paper examines online player performance in EverQuest II, a popular massively multiplayer online role-playing game (MMORPG) developed by Sony Online Entertainment. The study uses the game's player performance data to devise performance metrics for online players. We report three major findings. First, we show that the game's point-scaling system overestimates performances of lower level players and underestimates performances of higher level players. We present a novel point-scaling system based on the game's player performance data that addresses the underestimation and overestimation problems. Second, we present a highly accurate predictive model for player performance as a function of past behavior. …


Ssnetviz: A Visualization Engine For Heterogeneous Semantic Social Networks, Ee Peng Lim, Maureen Maureen, Nelman Lubis Ibrahim, Aixin Sun, Anwitaman Datta, Kuiyu Chang Aug 2009

Ssnetviz: A Visualization Engine For Heterogeneous Semantic Social Networks, Ee Peng Lim, Maureen Maureen, Nelman Lubis Ibrahim, Aixin Sun, Anwitaman Datta, Kuiyu Chang

Research Collection School Of Computing and Information Systems

SSnetViz is an ongoing research to design and implement a visualization engine for heterogeneous semantic social networks. A semantic social network is a multi-modal network that contains nodes representing di®erent types of people or object entities, and edges representing relationships among them. When multiple heterogeneous semantic social networks are to be visualized together, SSnetViz provides a suite of functions to store heterogeneous semantic social networks, to integrate them for searching and analysis. We will illustrate these functions using social networks related to terrorism research, one crafted by domain experts and another from Wikipedia.


Are Male And Female Avatars Perceived Equally In 3-D Virtual Worlds?, David Dewester, Fiona Fui-Hoon Nah, Sarah Gervais, Keng Siau Aug 2009

Are Male And Female Avatars Perceived Equally In 3-D Virtual Worlds?, David Dewester, Fiona Fui-Hoon Nah, Sarah Gervais, Keng Siau

Research Collection School Of Computing and Information Systems

Virtual worlds are three-dimensional, computer-generated worlds in which users take the form of avatars and use those avatars to interact with objects and other avatars in the virtual world. Virtual worlds are growing in importance in both educational institutions and businesses. Educational institutions have adopted virtual worlds as a medium for instructional delivery whereas businesses are using virtual worlds for recruitment, training, collaboration, and marketing. Given these emerging phenomena, a better understanding of behavioral and perceptual issues in virtual worlds is warranted. We propose a research model to study the interaction effects of gender stereotypicality of male and female avatars …