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

Digital Commons Network™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 9181 - 9210 of 10474

Full-Text Articles in Entire DC Network

Comment-Oriented Blog Summarization By Sentence Extraction, Meishan Hu, Ee Peng Lim, Aixin Sun Nov 2007

Comment-Oriented Blog Summarization By Sentence Extraction, Meishan Hu, Ee Peng Lim, Aixin Sun

Research Collection School Of Computing and Information Systems

Much existing research on blogs focused on posts only, ignoring their comments. Our user study conducted on summarizing blog posts, however, showed that reading comments does change one's understanding about blog posts. In this research, we aim to extract representative sentences from a blog post that best represent the topics discussed among its comments. The proposed solution first derives representative words from comments and then selects sentences containing representative words. The representativeness of words is measured using ReQuT (i.e., Reader, Quotation, and Topic). Evaluated on human labeled sentences, ReQuT together with summation-based sentence selection showed promising results.

Go to article

Model Checking In The Absence Of Code, Model And Properties, David Lo, Siau-Cheng Khoo Nov 2007

Model Checking In The Absence Of Code, Model And Properties, David Lo, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Model checking is a major approach in ensuring software correctness. It verifies a model converted from code against some formal properties. However, difficulties and programmers ’ reluctance to formalize formal properties have been some hurdles to its widespread industrial adoption. Also, with the advent of commercial off-the-shelf (COTS) components provided by third party vendors, model checking is further challenged as often only a binary version of the code is provided by vendors. Interestingly, latest instrumentation tools like PIN and Valgrind have enable execution traces to be collected dynamically from a running program. In this preliminary study, we investigate what can …

Go to article

S-Made: Interactive Storytelling Architecture Through Goal Execution And Decomposition, Yundong Cai, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan Nov 2007

S-Made: Interactive Storytelling Architecture Through Goal Execution And Decomposition, Yundong Cai, Zhiqi Shen, Chunyan Miao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Interactive storytelling, emerging with virtual reality technology, has attracted a lot of research interests in recent years. In order to bridge the gap between story generation and story presentation, some hybrid narrative models are raised. In this paper, we propose a new hybrid interactive storytelling architecture S-MADE. It combines the story plot generation and character performance through goal execution and decomposition mechanism. Fuzzy Cognitive Goal Net (FCGN) is a goal modeling tool for modeling the story scenario and character behaviors. The goal decomposition algorithm enables for director agent to dispatch acts to characters easily. With this system, dynamic storylines as …

Go to article

Light-Weight Encryption Schemes For Multimedia Data, Feng Bao, Robert H. Deng Nov 2007

Light-Weight Encryption Schemes For Multimedia Data, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Due to the pervasiveness of high-speed networks and multimedia communications and storage, the demand for highspeed cryptosystems is ever increasing. It is widely believed that there is a tradeoff between speed and security in cryptosystem design. No existing encryption algorithms are both fast enough for high-speed operation and sufficiently secure to withstand powerful cryptanalysis. In this paper, we propose and analyze a generic construction of high-speed encryption schemes. Our solution is based on the fact that there exist secure but relatively slow block ciphers, e. g. AES, and super-fast but relatively weaker stream ciphers. We then combine a secure block …

Go to article

Multi-Period Combinatorial Auction Mechanism For Distributed Resource Allocation And Scheduling, Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, Jong Han Park, Zhengyi Zhao Nov 2007

Multi-Period Combinatorial Auction Mechanism For Distributed Resource Allocation And Scheduling, Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, Jong Han Park, Zhengyi Zhao

Research Collection School Of Computing and Information Systems

We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resources from a central resource pool to be allocated to distributed decision makers (agents) that seek to optimize their respective scheduling goals. We propose a generic combinatorial auction mechanism that allows agents to competitively bid for the resources needed in a multi-period setting, regardless of the respective scheduling problem faced by the agent, and show how agents can design optimal bidding strategies to respond to price adjustment strategies from the auctioneer. We apply our …

Go to article

A Two-Phase Approach To Interactivity Enhancement For Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou Oct 2007

A Two-Phase Approach To Interactivity Enhancement For Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou

Research Collection School Of Computing and Information Systems

Distributed virtual environments (DVEs) are distributed systems that allow multiple geographically distributed clients (users) to interact simultaneously in a computer-generated, shared virtual world. Applications of DVEs can be seen in many areas nowadays, such as online games, military simulations, collaborative designs, etc. To support large-scale DVEs with real-time interactions among thousands or even more distributed clients, a geographically distributed server architecture (GDSA) is generally needed, and the virtual world can be partitioned into many distinct zones to distribute the load among the servers. Due to the geographic distributions of clients and servers in such architectures, it is essential to efficiently …

Go to article

Mining Modal Scenarios From Execution Traces, David Lo, Shahar Maoz, Siau-Cheng Khoo Oct 2007

Mining Modal Scenarios From Execution Traces, David Lo, Shahar Maoz, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Specification mining is a dynamic analysis process aimed at automatically inferring suggested specifications of a program from its execution traces. We describe a method, a framework, and a tool, for mining inter-object scenario-based specifications in the form of a UML2-compliant variant of Damm and Harel's Live Sequence Charts (LSC), which extends the classical partial order semantics of sequence diagrams with temporal liveness and symbolic class level lifelines, in order to generate compact and expressive specifications. Moreover, we use previous research work and tools developed for LSC to visualize, analyze, manipulate, test, and thus evaluate the scenario-based specifications we mine. Our …

Go to article

Efficient Discovery Of Frequent Approximate Sequential Patterns, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu Oct 2007

Efficient Discovery Of Frequent Approximate Sequential Patterns, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu

Research Collection School Of Computing and Information Systems

We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "break-down-and-build-up" methodology. The "breakdown" is based on the observation that all occurrences of a frequent pattern can be classified into groups, which we call strands. We developed efficient algorithms to quickly mine out all strands by iterative growth. In the "build-up" stage, these strands are grouped up to form the support sets from which all approximate patterns would be identified. A salient feature of our algorithm is its ability to grow the frequent patterns by iteratively …

Go to article

I Tube, You Tube, Everybody Tubes: Analyzing The World’S Largest User Generated Content Video System, Meeyoung Cha, Haewoon Kwak, Pablo Rodriguez, Yong-Yeol Ahn, Sue. Moon Oct 2007

I Tube, You Tube, Everybody Tubes: Analyzing The World’S Largest User Generated Content Video System, Meeyoung Cha, Haewoon Kwak, Pablo Rodriguez, Yong-Yeol Ahn, Sue. Moon

Research Collection School Of Computing and Information Systems

User Generated Content (UGC) is re-shaping the way people watch video and TV, with millions of video producers and consumers. In particular, UGC sites are creating new viewing patterns and social interactions, empowering users to be more creative, and developing new business opportunities. To better understand the impact of UGC systems, we have analyzed YouTube, the world's largest UGC VoD system. Based on a large amount of data collected, we provide an in-depth study of YouTube and other similar UGC systems. In particular, we study the popularity life-cycle of videos, the intrinsic statistical properties of requests and their relationship with …

Go to article

Gapprox: Mining Frequent Approximate Patterns From A Massive Network, Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han Oct 2007

Gapprox: Mining Frequent Approximate Patterns From A Massive Network, Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han

Research Collection School Of Computing and Information Systems

Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, demanding powerful data mining methods. Due to inherent noise or data diversity, it is crucial to address the issue of approximation, if one wants to mine patterns that are potentially interesting with tolerable variations. In this paper, we investigate the problem of mining frequent approximate patterns from a massive network and propose a method called gApprox. gApprox not only finds approximate network patterns, which is the key for many knowledge discovery applications on …

Go to article

Option-Based Risk Management: A Field Study Of Sequential Information Technology Investment Decisions, Michel Benaroch, Mark Jeffery, Robert John Kauffman, Sandeep Shah Oct 2007

Option-Based Risk Management: A Field Study Of Sequential Information Technology Investment Decisions, Michel Benaroch, Mark Jeffery, Robert John Kauffman, Sandeep Shah

Research Collection School Of Computing and Information Systems

This field study research evaluates the viability of applying an option-based risk management (OBRiM) framework, and its accompanying theoretical perspective and methodology, to real-world sequential information technology (IT) investment problems. These problems involve alternative investment structures that bear different risk profiles for the firm, and also may improve the payoffs of the associated projects and the organization's performance. We sought to surface the costs, benefits, and risks associated with a complex sequential investment setting that has the key features that OBRiM treats. We combine traditional, purchased real options that subsequently create strategic flexibility for the decision maker, with implicit or …

Go to article

Follow The Leader? Price Change Timing In Internet-Based Selling, R. J. Kauffman, Charles A. Wood Oct 2007

Follow The Leader? Price Change Timing In Internet-Based Selling, R. J. Kauffman, Charles A. Wood

Research Collection School Of Computing and Information Systems

Internet technologies should lessen information asymmetry, prompting competitive price reactions, but this does not seem to be happening in Internet-based selling. We study empirical regularities of price change timing for music CD vendors and booksellers to assess several theoretical explanations. Our sample includes 123, 680 daily prices for 169 products and 53 firms. Bertrand competition is insufficient to explain our observation that sellers do not shift prices this way. Tacitly collusive responses to competitors' price changes are observed rather than price changes solely in response to demand or cost shifts as would be expected with Bertrand competition. We find evidence …

Go to article

Analyzing Service Usage Patterns: Methodology And Simulation, Qianhui (Althea) Liang, Jen-Yao Chung Oct 2007

Analyzing Service Usage Patterns: Methodology And Simulation, Qianhui (Althea) Liang, Jen-Yao Chung

Research Collection School Of Computing and Information Systems

This paper proposes that service mining technology will power the construction of new business services via both intra- and inter-enterprise service assembly within the Service Oriented Architecture (SOA) framework. We investigate the methodologies of service mining at the component level of service usage. We also demonstrate how mining of service usage patterns is intended to be used to improve different aspects of service composition. Simulation experiments conducted for mining at the component level are analyzed. The processing details within a general service mining deployment are demonstrated.

Go to article

Performance Of Network-Coding In Multi-Rate Wireless Environments For Multicast Applications, Luiz F. M. Viera, Archan Misra, Mario Gerla Oct 2007

Performance Of Network-Coding In Multi-Rate Wireless Environments For Multicast Applications, Luiz F. M. Viera, Archan Misra, Mario Gerla

Research Collection School Of Computing and Information Systems

This paper investigates the interaction between net-work coding and link-layer transmission rate diversity in multi-hop wireless networks. By appropriately mixing data packets at intermediate nodes, network coding allows a single multicast flow to achieve higher throughput to a set of receivers. Broadcast applications can also exploit link-layer rate diversity, whereby individual nodes can transmit at faster rates at the expense of corresponding smaller coverage area. We first demonstrate how combining rate-diversity with network coding can provide a larger capacity for data dissemination of a single multicast flow, and how consideration of rate diversity is critical for maximizing system throughput. We …

Go to article

Om-Based Video Shot Retrieval By One-To-One Matching, Yuxin Peng, Chong-Wah Ngo, Jianguo Xiao Oct 2007

Om-Based Video Shot Retrieval By One-To-One Matching, Yuxin Peng, Chong-Wah Ngo, Jianguo Xiao

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for shot-based retrieval by optimal matching (OM), which provides an effective mechanism for the similarity measure and ranking of shots by one-to-one matching. In the proposed approach, a weighted bipartite graph is constructed to model the color similarity between two shots. Then OM based on Kuhn-Munkres algorithm is employed to compute the maximum weight of a constructed bipartite graph as the shot similarity value by one-to-one matching among frames. To improve the speed efficiency of OM, two improved algorithms are also proposed: bipartite graph construction based on subshots and bipartite graph construction based on …

Go to article

Flexible Access Control To Jpeg 2000 Image Code-Streams, Yongdong Wu, Di Ma, Robert H. Deng Oct 2007

Flexible Access Control To Jpeg 2000 Image Code-Streams, Yongdong Wu, Di Ma, Robert H. Deng

Research Collection School Of Computing and Information Systems

JPEG 2000 is an international standard for still image compression in the 21st century. Part 8 of the standard, named JPSEC, is concerned with all the security aspects, in particular to access control and authentication. This paper presents a novel access control scheme for JPEG 2000 image code-streams. The proposed scheme is secure against collusion attacks and highly efficient. The scheme is also very flexible, allowing access control to JPEG 2000 image code-streams according to any combination of resolution, quality layer and region of interest. The "encrypt once, decrypt many ways" property of our scheme is designed to work seamlessly …

Go to article

A Multitude Of Opinions: Mining Online Rating Data, Hady Wirawan Lauw, Ee Peng Lim Oct 2007

A Multitude Of Opinions: Mining Online Rating Data, Hady Wirawan Lauw, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Online rating system is a popular feature of Web 2.0 applications. It typically involves a set of reviewers assigning rating scores (based on various evaluation criteria) to a set of objects. We identify two objectives for research on online rating data, namely achieving effective evaluation of objects and learning behaviors of reviewers/objects. These two objectives have conventionally been pursued separately. We argue that the future research direction should focus on the integration of these two objectives, as well as the integration between rating data and other types of data.

Go to article

Npake+: A Hierarchical Group Password-Authenticated Key Exchange Protocol Using Different Passwords, Zhiguo Wan, Robert H. Deng, Feng Bao, Bart Preneel Oct 2007

Npake+: A Hierarchical Group Password-Authenticated Key Exchange Protocol Using Different Passwords, Zhiguo Wan, Robert H. Deng, Feng Bao, Bart Preneel

Research Collection School Of Computing and Information Systems

Although two-party password-authenticated key exchange (PAKE) protocols have been intensively studied in recent years, group PAKE protocols have received little attention. In this paper, we propose a hierarchical group PAKE protocol nPAKE+ protocol under the setting where each party shares an independent password with a trusted server. The nPAKE+ protocol is a novel combination of the hierarchical key tree structure and the password-based Diffie-Hellman exchange, and hence it achieves substantial gain in computation efficiency. In particular, the computation cost for each client in our protocol is only O(logn). Additionally, the hierarchical feature of nPAKE+ enables every subgroup obtains their own …

Go to article

Sketchwizard: Wizard Of Oz Prototyping Of Pen-Based User Interfaces, Richard C. Davis, T. Scott Saponas, Michael Shilman, James A. Landay Oct 2007

Sketchwizard: Wizard Of Oz Prototyping Of Pen-Based User Interfaces, Richard C. Davis, T. Scott Saponas, Michael Shilman, James A. Landay

Research Collection School Of Computing and Information Systems

SketchWizard allows designers to create Wizard of Oz prototypes of pen-based user interfaces in the early stages of design. In the past, designers have been inhibited from participating in the design of pen-based interfaces because of the inadequacy of paper prototypes and the difficulty of developing functional prototypes. In SketchWizard, designers and end users share a drawing canvas between two computers, allowing the designer to simulate the behavior of recognition or other technologies. Special editing features are provided to help designers respond quickly to end-user input. This paper describes the SketchWizard system and presents two evaluations of our approach. The …

Go to article

Preserving Privacy In Supply Chain Management: A Challenge For Next Generation Data Mining, Madhu Ahluwalia, Zhiyuan Chen, Arrya Gangopadhyay, Zhiling Guo Oct 2007

Preserving Privacy In Supply Chain Management: A Challenge For Next Generation Data Mining, Madhu Ahluwalia, Zhiyuan Chen, Arrya Gangopadhyay, Zhiling Guo

Research Collection School Of Computing and Information Systems

In this paper we identify a major area of research as a topic for next generation data mining. The research effort in the last decade on privacy preserving data mining has resulted in the development of numerous algorithms. However, most of the existing research has not been applied in any particular application context. Hence it is unclear whether the current algorithms are directly applicable in any particular problem context. In this paper we identify a significant application context that not only requires protection of privacy but also sophisticated data analysis. The area in question is supply chain management, arguably one …

Go to article

Forecasting In Rapidly Changing Environments: An Application To The Us Motion Picture Industry, Anirban Mukherjee, Kadiyali Vrinda Oct 2007

Forecasting In Rapidly Changing Environments: An Application To The Us Motion Picture Industry, Anirban Mukherjee, Kadiyali Vrinda

Research Collection Lee Kong Chian School Of Business

Markets with rapidly changing environments provide forecasting challenges because of fewer similarities between past and future outcomes. In this paper, we provide a methodology that enables forecasting with relatively short histories. The application is to the U.S. motion picture industry where we forecast revenues in theatrical, sales (DVD and VHS), and rental channels. Using short market histories of similar products, we account for (1) observed and unobserved movie-specific characteristics, (2) seasonality of demand, (3) competition within and across multiple distribution channels (4) market expansion, substitution and complementarity between movies inside and across distribution channels. We extend the multiplicative competitive interaction …

Go to article

Measuring The Trade-Offs Between Economic Growth And Unequal Distribution Of The Benefits, Knowledge@Smu Sep 2007

Measuring The Trade-Offs Between Economic Growth And Unequal Distribution Of The Benefits, Knowledge@Smu

Knowledge@SMU

In an unequal world, how should countries evaluate the trade-offs between pursuing economic growth and the risks of unequal distribution of the benefits amongst individuals? London School of Economics professor and department head Danny Quah recently delivered an address on "Life in Unequal Growing Economies”, as part of the Singapore Management University School of Economics Distinguished Lecture Series. His paper proposes an empirical model to measure the trade-offs between economic growth and income inequality, and to assess the implications of such trade-offs for poverty alleviation and individual welfare.

Go to article

Ntu: Solution For The Object Retrieval Task Of The Imageclef2007, Steven C. H. Hoi Sep 2007

Ntu: Solution For The Object Retrieval Task Of The Imageclef2007, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Object retrieval is an interdisciplinary research problem between object recognition and content-based image retrieval (CBIR). It is commonly expected that object retrieval can be solved more effectively with the joint maximization of CBIR and object recognition techniques. We study a typical CBIR solution with application to the object retrieval tasks [26,27]. We expect that the empirical study in this work will serve as a baseline for future research when using CBIR techniques for object recognition.

Go to article

Rushes Video Summarization By Object And Event Understanding, Feng Wang, Chong-Wah Ngo Sep 2007

Rushes Video Summarization By Object And Event Understanding, Feng Wang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper explores a variety of visual and audio analysis techniques in selecting the most representative video clips for rushes summarization at TRECVID 2007. These techniques include object detection, camera motion estimation, keypoint matching and tracking, audio classification and speech recognition. Our system is composed of two major steps. First, based on video structuring, we filter undesirable shots and minimize the inter-shot redundancy by repetitive shot detection. Second, a representability measure is proposed to model the presence of objects and four audio-visual events: motion activity of objects, camera motion, scene changes, and speech content, in a video clip. The video …

Go to article

Ontology-Enriched Semantic Space For Video Search, Xiao-Yong Wei, Chong-Wah Ngo Sep 2007

Ontology-Enriched Semantic Space For Video Search, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Multimedia-based ontology construction and reasoning have recently been recognized as two important issues in video search, particularly for bridging semantic gap. The lack of coincidence between low-level features and user expectation makes concept-based ontology reasoning an attractive midlevel framework for interpreting high-level semantics. In this paper, we propose a novel model, namely ontology-enriched semantic space (OSS), to provide a computable platform for modeling and reasoning concepts in a linear space. OSS enlightens the possibility of answering conceptual questions such as a high coverage of semantic space with minimal set of concepts, and the set of concepts to be developed for …

Go to article

Taking Stock Of The Creative Commons Experiment: Monitoring The Use Of Creative Commons Licenses And Evaluating Its Implications For The Future Of Creative Commons And For Copyright Law, Giorgos Cheliotis, Warren B. Chik, Ankit Guglani, Giri Kumar Tayi Sep 2007

Taking Stock Of The Creative Commons Experiment: Monitoring The Use Of Creative Commons Licenses And Evaluating Its Implications For The Future Of Creative Commons And For Copyright Law, Giorgos Cheliotis, Warren B. Chik, Ankit Guglani, Giri Kumar Tayi

Research Collection Yong Pung How School Of Law

We provide an analysis of the use of Creative Commons (CC) licenses, an approach to licens-ing creative works which has become very popular among authors who wish to promote more liberal sharing and use of their work. We provide data demonstrating the popularity of CC, ex-amine which specific license types within the CC framework are most popular, and then iden-tify contributing factors for the relative popularity of some of the license types. This includes in-dividual author incentives, the consistency and aims of the online communities which adopt CC as a licensing model, the underlying medium (text, photography, audio, video or …

Go to article

Practical Elimination Of Near-Duplicates From Web Video Search, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo Sep 2007

Practical Elimination Of Near-Duplicates From Web Video Search, Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Current web video search results rely exclusively on text keywords or user-supplied tags. A search on typical popular video often returns many duplicate and near-duplicate videos in the top results. This paper outlines ways to cluster and filter out the nearduplicate video using a hierarchical approach. Initial triage is performed using fast signatures derived from color histograms. Only when a video cannot be clearly classified as novel or nearduplicate using global signatures, we apply a more expensive local feature based near-duplicate detection which provides very accurate duplicate analysis through more costly computation. The results of 24 queries in a data …

Go to article

Evolutionary Combinatorial Optimization For Recursive Supervised Learning With Clustering, Kiruthika Ramanathan, Sheng Uei Guan Sep 2007

Evolutionary Combinatorial Optimization For Recursive Supervised Learning With Clustering, Kiruthika Ramanathan, Sheng Uei Guan

Research Collection School Of Computing and Information Systems

The idea of using a team of weak learners to learn a dataset is a successful one in literature. In this paper, we explore a recursive incremental approach to ensemble learning. In this paper, patterns are clustered according to the output space of the problem, i.e., natural clusters are formed based on patterns belonging to each class. A combinatorial optimization problem is therefore formed, which is solved using evolutionary algorithms. The evolutionary algorithms identify the "easy" and the "difficult" clusters in the system. The removal of the easy patterns then gives way to the focused learning of the more complicated …

Go to article

Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng Sep 2007

Anonymous And Authenticated Key Exchange For Roaming Networks, Guomin Yang, Duncan S. Wong, Xiaotie Deng

Research Collection School Of Computing and Information Systems

User privacy is a notable security issue in wireless communications. It concerns about user identities from being exposed and user movements and whereabouts from being tracked. The concern of user privacy is particularly signified in systems which support roaming when users are able to hop across networks administered by different operators. In this paper, we propose a novel construction approach of anonymous and authenticated key exchange protocols for a roaming user and a visiting server to establish a random session key in such a way that the visiting server authenticates the user's home server without knowing exactly who the user …

Go to article

Deception In Cyberspace: A Comparison Of Text-Only Vs. Avatar-Supported Medium, Holtjona Galanxhi, Fiona Fui-Hoon Nah Sep 2007

Deception In Cyberspace: A Comparison Of Text-Only Vs. Avatar-Supported Medium, Holtjona Galanxhi, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

The use of anthropomorphic avatars provides Internet users the opportunity and freedom to manipulate their identity. As cyberspace becomes a haven for deceptive behavior, human–computer interaction research will need to be carried out to study and understand these deceptive behaviors. The objective of this research is to investigate the behavior of deceivers and non-deceivers (or truth-tellers) in the cyberspace environment. We examine if the intention to deceive others influences one's choice of avatars in the online chat environment. We also investigate if communication medium (text-only vs. avatar-supported chat) influences one's perception of trustworthiness of the communication partner. A lab experiment …

Go to article

First Prev Next Last