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

Computer Sciences Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 6781 - 6810 of 8479

Full-Text Articles in Computer Sciences

Secure Mobile Subscription Of Sensor-Encrypted Data, Cheng-Kang Chu, Wen-Tao Zhu, Sherman S. M. Chow, Jianying Zhou, Robert H. Deng Mar 2011

Secure Mobile Subscription Of Sensor-Encrypted Data, Cheng-Kang Chu, Wen-Tao Zhu, Sherman S. M. Chow, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

In an end-to-end encryption model for a wireless sensor network (WSN), the network control center preloads encryption and decryption keys to the sensor nodes and the subscribers respectively, such that a subscriber can use a mobile device in the deployment field to decrypt the sensed data encrypted by the more resource-constrained sensor nodes. This paper proposes SMS-SED, a provably secure yet practically efficient key assignment system featuring a discrete time-based access control, to better support a business model where the sensors deployer rents the WSN to customers who desires a higher flexibility beyond subscribing to strictly consecutive periods. In SMS-SED, …

Go to article

Chameleon All-But-One Tdfs And Their Application To Chosen-Ciphertext Security, Junzuo Lai, Robert H. Deng, Shengli Liu Mar 2011

Chameleon All-But-One Tdfs And Their Application To Chosen-Ciphertext Security, Junzuo Lai, Robert H. Deng, Shengli Liu

Research Collection School Of Computing and Information Systems

In STOC’08, Peikert and Waters introduced a new powerful primitive called lossy trapdoor functions (LTDFs) and a richer abstraction called all-but-one trapdoor functions (ABO-TDFs). They also presented a black-box construction of CCA-secure PKE from an LTDF and an ABO-TDF. An important component of their construction is the use of a strongly unforgeable one-time signature scheme for CCA-security.In this paper, we introduce the notion of chameleon ABO-TDFs, which is a special kind of ABO-TDFs. We give a generic as well as a concrete construction of chameleon ABO-TDFs. Based on an LTDF and a chameleon ABO-TDF, we presented a black-box construction, free …

Go to article

Multi-Objective Zone Mapping In Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou, Wentong Cai, Xueyan Tang, Rassul Avani Mar 2011

Multi-Objective Zone Mapping In Large-Scale Distributed Virtual Environments, Nguyen Binh Duong Ta, Suiping Zhou, Wentong Cai, Xueyan Tang, Rassul Avani

Research Collection School Of Computing and Information Systems

In large-scale distributed virtual environments (DVEs), the NP-hard zone mapping problem concerns how to assign distinct zones of the virtual world to a number of distributed servers to improve overall interactivity. Previously, this problem has been formulated as a single-objective optimization problem, in which the objective is to minimize the total number of clients that are without QoS. This approach may cause considerable network traffic and processing overhead, as a large number of zones may need to be migrated across servers. In this paper, we introduce a multi-objective approach to the zone mapping problem, in which both the total number …

Go to article

Modeling Link Formation Behaviors In Dynamic Social Networks, Viet-An Nguyen, Cane Wing-Ki Leung, Ee Peng Lim Mar 2011

Modeling Link Formation Behaviors In Dynamic Social Networks, Viet-An Nguyen, Cane Wing-Ki Leung, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Online social networks are dynamic in nature. While links between users are seemingly formed and removed randomly, there exists some interested link formation behaviors demonstrated by users performing link creation and removal activities. Uncovering these behaviors not only allows us to gain deep insights of the users, but also pave the way to decipher how social links are formed. In this paper, we propose a general framework to define user link formation behaviors using well studied local link structures (i.e., triads and dyads) in a dynamic social network where links are formed at different timestamps. Depending on the role a …

Go to article

An Energy Efficient Quality Adaptive Multi-Modal Sensor Framework For Context Recognition, Nirmalya Roy, Archan Misra, Christine Julien, Sajal K. Das, Jit Biswas Mar 2011

An Energy Efficient Quality Adaptive Multi-Modal Sensor Framework For Context Recognition, Nirmalya Roy, Archan Misra, Christine Julien, Sajal K. Das, Jit Biswas

Research Collection School Of Computing and Information Systems

Proliferation of mobile applications in unpredictable and changing environments requires applications to sense and act on changing operational contexts. In such environments, understanding the context of an entity is essential for adaptability of the application behavior to changing situations. In our view, context is a high-level representation of a user or entity’s state and can capture activities, relationships, capabilities, etc. Inherently, however, these high-level context measures are difficult to sense directly and instead must be inferred through the combination of many data sources. In pervasive computing environments where this context is of significant importance, a multitude of sensors is already …

Go to article

Strongly Secure Certificateless Key Exchange Without Pairing, Guomin Yang, Chik How Tan Mar 2011

Strongly Secure Certificateless Key Exchange Without Pairing, Guomin Yang, Chik How Tan

Research Collection School Of Computing and Information Systems

In certificateless cryptography, a user secret key is derived from two partial secrets: one is the identity-based secret key (corresponding to the user identity) generated by a Key Generation Center (KGC), and the other is the user selfgenerated secret key (corresponding to a user self-generated and uncertified public key). Two types of adversaries are considered for certificateless cryptography: a Type-I adversary who can replace the user self-generated public key (in transmission or in a public directory), and a Type-II adversary who is an honest-but-curious KGC. In this paper, we present a formal study on certificateless key exchange (CLKE). We show …

Go to article

Artificial Cognitive Memory - Changing From Density Driven To Functionality Driven, Luping Shi, Kaijun Yi, Kiruthika Ramanathan, Rong Zhao, Ning Ning, Ding Ding, Tow Chong Chong Feb 2011

Artificial Cognitive Memory - Changing From Density Driven To Functionality Driven, Luping Shi, Kaijun Yi, Kiruthika Ramanathan, Rong Zhao, Ning Ning, Ding Ding, Tow Chong Chong

Research Collection School Of Computing and Information Systems

Increasing density based on bit size reduction is currently a main driving force for the development of data storage technologies. However, it is expected that all of the current available storage technologies might approach their physical limits in around 15 to 20 years due to miniaturization. To further advance the storage technologies, it is required to explore a new development trend that is different from density driven. One possible direction is to derive insights from biological counterparts. Unlike physical memories that have a single function of data storage, human memory is versatile. It contributes to functions of data storage, information …

Go to article

Mining Iterative Generators And Representative Rules For Software Specification Discovery, David Lo, Jinyan Li, Limsoon Wong, Siau-Cheng Khoo Feb 2011

Mining Iterative Generators And Representative Rules For Software Specification Discovery, David Lo, Jinyan Li, Limsoon Wong, Siau-Cheng Khoo

Research Collection School Of Computing and Information Systems

Billions of dollars are spent annually on software-related cost. It is estimated that up to 45 percent of software cost is due to the difficulty in understanding existing systems when performing maintenance tasks (i.e., adding features, removing bugs, etc.). One of the root causes is that software products often come with poor, incomplete, or even without any documented specifications. In an effort to improve program understanding, Lo et al. have proposed iterative pattern mining which outputs patterns that are repeated frequently within a program trace, or across multiple traces, or both. Frequent iterative patterns reflect frequent program behaviors that likely …

Go to article

Mining Social Images With Distance Metric Learning For Automated Image Tagging, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Ying He Feb 2011

Mining Social Images With Distance Metric Learning For Automated Image Tagging, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Ying He

Research Collection School Of Computing and Information Systems

With the popularity of various social media applications, massive social images associated with high quality tags have been made available in many social media web sites nowadays. Mining social images on the web has become an emerging important research topic in web search and data mining. In this paper, we propose a machine learning framework for mining social images and investigate its application to automated image tagging. To effectively discover knowledge from social images that are often associated with multimodal contents (including visual images and textual tags), we propose a novel Unified Distance Metric Learning (UDML) scheme, which not only …

Go to article

A Two-View Learning Approach For Image Tag Ranking, Jinfeng Zhuang, Steven C. H. Hoi Feb 2011

A Two-View Learning Approach For Image Tag Ranking, Jinfeng Zhuang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Tags of social images play a central role for text-based social image retrieval and browsing tasks. However, the original tags annotated by web users could be noisy, irrelevant, and often incomplete for describing the image contents, which may severely deteriorate the performance of text-based image retrieval models. In this paper, we aim to overcome the challenge of social tag ranking for a corpus of social images with rich user-generated tags by proposing a novel two-view learning approach. It can effectively exploit both textual and visual contents of social images to discover the complicated relationship between tags and images. Unlike the …

Go to article

Adnext: A Visit-Pattern-Aware Mobile Advertising System For Urban Commercial Complexes, Byoungjip Kim, Jin-Young Ha, Sangjeong Lee, Seungwoo Kang, Youngki Lee, Yunseok Rhee, Lama Nachman, Junehwa Song Feb 2011

Adnext: A Visit-Pattern-Aware Mobile Advertising System For Urban Commercial Complexes, Byoungjip Kim, Jin-Young Ha, Sangjeong Lee, Seungwoo Kang, Youngki Lee, Yunseok Rhee, Lama Nachman, Junehwa Song

Research Collection School Of Computing and Information Systems

As smartphones have become prevalent, mobile advertising is getting significant attention as being not only a killer application in future mobile commerce, but also as an important business model of emerging mobile applications to monetize them. In this paper, we present AdNext, a visit-pattern-aware mobile advertising system for urban commercial complexes. AdNext can provide highly relevant ads to users by predicting places that the users will next visit. AdNext predicts the next visit place by learning the sequential visit patterns of commercial complex users in a collective manner. As one of the key enabling techniques for AdNext, we develop a …

Go to article

Distance Metric Learning From Uncertain Side Information For Automated Photo Tagging, Lei Wu, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Nenghai Yu Feb 2011

Distance Metric Learning From Uncertain Side Information For Automated Photo Tagging, Lei Wu, Steven C. H. Hoi, Rong Jin, Jianke Zhu, Nenghai Yu

Research Collection School Of Computing and Information Systems

Automated photo tagging is an important technique for many intelligent multimedia information systems, for example, smart photo management system and intelligent digital media library. To attack the challenge, several machine learning techniques have been developed and applied for automated photo tagging. For example, supervised learning techniques have been applied to automated photo tagging by training statistical classifiers from a collection of manually labeled examples. Although the existing approaches work well for small testbeds with relatively small number of annotation words, due to the long-standing challenge of object recognition, they often perform poorly in large-scale problems. Another limitation of the existing …

Go to article

Evolution Of Developer Collaboration On The Jazz Platform: A Study Of A Large Scale Agile Project, Subhajit Datta, Renuka Sindhgatta, Bikram Sengupta Feb 2011

Evolution Of Developer Collaboration On The Jazz Platform: A Study Of A Large Scale Agile Project, Subhajit Datta, Renuka Sindhgatta, Bikram Sengupta

Research Collection School Of Computing and Information Systems

Collaboration is a key aspect of the agile philosophy of software development. As a software system matures over iterations, trends of developer collaboration can offer valuable insights into project dynamics. In this paper, we study evolution of developer collaboration for a large scale agile project on the Jazz platform. We construct networks of collaboration based on developer affiliations across comments on work items and file changes; and then compare parameters of such networks with established results from networks of scientific collaborations. The comparisons illuminate interesting facets of developer collaboration on the Jazz platform. Such perception helps deeper understanding of the …

Go to article

Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallabh Sambamurthy Feb 2011

Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallabh Sambamurthy

Research Collection School Of Computing and Information Systems

Increasingly, consumers depend on social information channels, such as user-posted online reviews, to make purchase decisions. These reviews are assumed to be unbiased reflections of other consumers' experiences with the products or services. While extensively assumed, the literature has not tested the existence or non-existence of review manipulation. By using data from Amazon and Barnes & Noble, our study investigates if vendors, publishers, and writers consistently manipulate online consumer reviews. We document the existence of online review manipulation and show that the manipulation strategy of firms seems to be a monotonically decreasing function of the product's true quality or the …

Go to article

Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallbh Sambamurthy Feb 2011

Fraud Detection In Online Consumer Reviews, Nan Hu, Ling Liu, Vallbh Sambamurthy

Research Collection School Of Computing and Information Systems

Increasingly, consumers depend on social information channels, such as user-posted online reviews, to make purchase decisions. These reviews are assumed to be unbiased reflections of other consumers' experiences with the products or services. While extensively assumed, the literature has not tested the existence or non-existence of review manipulation. By using data from Amazon and Barnes & Noble, our study investigates if vendors, publishers, and writers consistently manipulate online consumer reviews. We document the existence of online review manipulation and show that the manipulation strategy of firms seems to be a monotonically decreasing function of the product's true quality or the …

Go to article

Database Access Pattern Protection Without Full-Shuffles, Xuhua Ding, Yanjiang Yang, Robert H. Deng Feb 2011

Database Access Pattern Protection Without Full-Shuffles, Xuhua Ding, Yanjiang Yang, Robert H. Deng

Research Collection School Of Computing and Information Systems

Privacy protection is one of the fundamental security requirements for database outsourcing. A major threat is information leakage from database access patterns generated by query executions. The standard private information retrieval (PIR) schemes, which are widely regarded as theoretical solutions, entail O(n) computational overhead per query for a database with items. Recent works propose to protect access patterns by introducing a trusted component with constant storage size. The resulting privacy assurance is as strong as PIR, though with O(1) online computation cost, they still have O(n) amortized cost per query due to periodically full database shuffles. In this paper, we …

Go to article

Cryptanalysis Of A Certificateless Signcryption Scheme In The Standard Model, Jian Weng, Guoxiang Yao, Robert H. Deng, Min-Rong Chen, Xianxue Li Feb 2011

Cryptanalysis Of A Certificateless Signcryption Scheme In The Standard Model, Jian Weng, Guoxiang Yao, Robert H. Deng, Min-Rong Chen, Xianxue Li

Research Collection School Of Computing and Information Systems

Certificateless signcryption is a useful primitive which simultaneously provides the functionalities of certificateless encryption and certificateless signature. Recently, Liu et al. [15] proposed a new certificateless signcryption scheme, and claimed that their scheme is provably secure without random oracles in a strengthened security model, where the malicious-but-passive KGC attack is considered. Unfortunately, by giving concrete attacks, we indicate that Liu et al. certificateless signcryption scheme is not secure in this strengthened security model.

Go to article

Pgtp: Power Aware Game Transport Protocol For Multi-Player Mobile Games, Bhojan Anand, Jeena Sebastian, Soh Yu Ming, Akhihebbal L. Ananda, Mun Choon Chan, Rajesh Krishna Balan Feb 2011

Pgtp: Power Aware Game Transport Protocol For Multi-Player Mobile Games, Bhojan Anand, Jeena Sebastian, Soh Yu Ming, Akhihebbal L. Ananda, Mun Choon Chan, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Applications on the smartphones are able to capitalize on the increasingly advanced hardware to provide a user experience reasonably impressive. However, the advancement of these applications are hindered battery lifetime of the smartphones. The battery technologies have a relatively low growth rate. Applications like mobile multiplayer games are especially power hungry as they maximize the use of the network, display and CPU resources. The PGTP, presented in this paper is aware of both the transport requirement of these multiplayer mobile games and the limitation posed by battery resource. PGTP dynamically controls the transport based on the criticality of game state …

Go to article

Searching Patterns For Relation Extraction Over The Web: Rediscovering The Pattern-Relation Duality, Yuan Fang, Kevin Chen-Chuan Chang Feb 2011

Searching Patterns For Relation Extraction Over The Web: Rediscovering The Pattern-Relation Duality, Yuan Fang, Kevin Chen-Chuan Chang

Research Collection School Of Computing and Information Systems

While tuple extraction for a given relation has been an active research area, its dual problem of pattern search- to find and rank patterns in a principled way- has not been studied explicitly. In this paper, we propose and address the problem of pattern search, in addition to tuple extraction. As our objectives, we stress reusability for pattern search and scalability of tuple extraction, such that our approach can be applied to very large corpora like the Web. As the key foundation, we propose a conceptual model PRDualRank to capture the notion of precision and recall for both tuples and …

Go to article

Manipulation In Digital Word-Of-Mouth: A Reality Check For Book Reviews, Nan Hu, Indranil Bose, Yunjun Gao, Ling Liu Feb 2011

Manipulation In Digital Word-Of-Mouth: A Reality Check For Book Reviews, Nan Hu, Indranil Bose, Yunjun Gao, Ling Liu

Research Collection School Of Computing and Information Systems

Built upon the discretionary accrual-based earnings management framework, our paper develops a discretionary manipulation proxy to study the management of online reviews. We reveal that fraudulent review manipulation is a serious problem for 1) non-bestseller books; 2) books whose reviews are classified as not very helpful; 3) books that experience greater variability in the helpfulness of their online reviews; and 4) popular books as well as high-priced books. We also show that review management decreases with the passage of time. Just like fraudulent earnings management, manipulated online reviews reflect inauthentic information from which consumers might derive wrong valuation especially for …

Go to article

Near-Duplicate Keyframe Retrieval By Semi-Supervised Learning And Nonrigid Image Matching, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu, Shuicheng Yan Jan 2011

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

Research Collection School Of Computing and Information Systems

Near-duplicate keyframe (NDK) retrieval techniques are critical to many real-world multimedia applications. Over the last few years, we have witnessed a surge of attention on studying near-duplicate image/keyframe retrieval in multimedia community. To facilitate an effective approach to NDK retrieval on large-scale data, we suggest an effective Multi-Level Ranking (MLR) scheme that effectively retrieves NDKs in a coarse-to-fine manner. One key stage of the MLR ranking scheme is how to learn an effective ranking function with extremely small training examples in a near-duplicate detection task. To attack this challenge, we employ a semi-supervised learning method, semi-supervised support vector machines, which …

Go to article

Randomly Projected Kd-Trees With Distance Metric Learning For Image Retrieval, Pengcheng Wu, Steven Hoi, Duc Dung Nguyen, Ying He Jan 2011

Randomly Projected Kd-Trees With Distance Metric Learning For Image Retrieval, Pengcheng Wu, Steven Hoi, Duc Dung Nguyen, Ying He

Research Collection School Of Computing and Information Systems

Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree) usually are only efficient for low dimensional data, but often perform no better than a simple exhaustive linear search when the number of dimensions is large enough. Recently, approximate NN search techniques have been proposed for high-dimensional search, such as Locality-Sensitive Hashing (LSH), which adopts some random projection approach. Motivated by similar idea, in this paper, we propose a new high dimensional NN search method, called Randomly Projected kd-Trees (RP-kd-Trees), which is to project data points into a lower-dimensional …

Go to article

Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy Gunawan, Kien Ming Ng Jan 2011

Solving The Teacher Assignment Problem By Two Metaheuristics, Aldy Gunawan, Kien Ming Ng

Research Collection School Of Computing and Information Systems

The timetabling problem arising from a university in Indonesia is addressed in this paper.It involves the assignment of teachers to the courses and course sections. We formulate theproblem as a mathematical programming model. Two different algorithms, mainly basedon simulated annealing (SA) and tabu search (TS) algorithms, are proposed for solving theproblem. The proposed algorithms consist of two phases. The first phase involves allocatingthe teachers to the courses and determining the number of courses to be assigned to eachteacher. The second phase involves assigning the teachers to the course sections in order tobalance the teachers’ load. The performance of the proposed …

Go to article

Solving The Quadratic Assignment Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh Jan 2011

Solving The Quadratic Assignment Problem By A Hybrid Algorithm, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh

Research Collection School Of Computing and Information Systems

This paper presents a hybrid algorithm to solve the Quadratic Assignment Problem (QAP). The proposed algorithminvolves using the Greedy Randomized Adaptive Search Procedure (GRASP) to obtain an initial solution, and then using a combinedSimulated Annealing (SA) and Tabu Search (TS) algorithm to improve the solution. Experimental results indicate that the hybridalgorithm is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time.

Go to article

Development Of An Instrument To Measure The Adoption Of Mobile Services, Shang Gao, John Krogstie, Keng Siau Jan 2011

Development Of An Instrument To Measure The Adoption Of Mobile Services, Shang Gao, John Krogstie, Keng Siau

Research Collection School Of Computing and Information Systems

Currently, there is no standard instrument for measuring user adoption of mobile services. Based on the mobile service acceptance model, this paper reports on the development of a survey instrument designed to measure user perception on mobile services acceptance. A survey instrument was developed by using some existing scales from prior instruments and by creating additional items which might appear to fit the construct definitions. In addition, a pilot study was conducted by distributing the survey to 25 users of a mobile service called Mobile Student Information Systems. As a result, a survey instrument containing 22 items were retained. Furthermore, …

Go to article

Improving Service Through Just-In-Time Concept In A Dynamic Operational Environment, Kar Way Tan, Hoong Chuin Lau, Na Fu Jan 2011

Improving Service Through Just-In-Time Concept In A Dynamic Operational Environment, Kar Way Tan, Hoong Chuin Lau, Na Fu

Research Collection School Of Computing and Information Systems

This paper is concerned with the problem of Just-In-Time (JIT) job scheduling in a dynamic environment under uncertainty to attain timely service. We provide an approach, based on robust scheduling concepts, to analytically evaluate the expected cost of earliness and tardiness for each job and also the project. In addition, we search for a schedule execution policy with the minimum robust cost such that for a given risk level (epsilon), the actual realized schedule has (1 - epsilon) probability of completing with less than or equal to this robust cost. Our method is quite generic, and can be applied to …

Go to article

Lightweight Delegated Subset Test With Privacy Protection, Xuhua Zhou, Xuhua Ding, Kefei Chen Jan 2011

Lightweight Delegated Subset Test With Privacy Protection, Xuhua Zhou, Xuhua Ding, Kefei Chen

Research Collection School Of Computing and Information Systems

Delegated subset tests are mandatory in many applications, such as content-based networks and outsourced text retrieval, where an untrusted server evaluates the degree of matching between two data sets. We design a novel scheme to protect the privacy of the data sets in comparison against the untrusted server, with half of the computation cost and half of the ciphertext size of existing solutions based on predicate only encryption supporting inner product.

Go to article

Would Price Limits Have Made Any Difference To The 'Flash Crash' On May 6, 2010, Wing Bernard Lee, Shih-Fen Cheng, Annie Koh Jan 2011

Would Price Limits Have Made Any Difference To The 'Flash Crash' On May 6, 2010, Wing Bernard Lee, Shih-Fen Cheng, Annie Koh

Research Collection School Of Computing and Information Systems

On May 6, 2010, the U.S. equity markets experienced a brief but highly unusual drop in prices across a number of stocks and indices. The Dow Jones Industrial Average (see Figure 1) fell by approximately 9% in a matter of minutes, and several stocks were traded down sharply before recovering a short time later. The authors contend that the events of May 6, 2010 exhibit patterns consistent with the type of "flash crash" observed in their earlier study (2010). This paper describes the results of nine different simulations created by using a large-scale computer model to reconstruct the critical elements …

Go to article

A Usability Study Of A Mobile Content Sharing System, Alton Yeow-Kuan Chua, Dion Hoe-Lian Goh, Khasfariyati Razikin, Ee Peng Lim Jan 2011

A Usability Study Of A Mobile Content Sharing System, Alton Yeow-Kuan Chua, Dion Hoe-Lian Goh, Khasfariyati Razikin, Ee Peng Lim

Research Collection School Of Computing and Information Systems

We investigate the usability of MobiTOP (Mobile Tagging of Objects and People), a mobile location-based content sharing system. MobiTOP allows users to annotate real world locations with both multimedia and textual content and concurrently, share the annotations among its users. In addition, MobiTOP provides additional functionality such as clustering of annotations and advanced search and filtering options. A usability evaluation of the system was conducted in the context of a travel companion for tourists. The results suggested the potential of the system in terms of functionality for mobile content sharing. Participants agreed that the features in MobiTOP were generally usable …

Go to article

Enhancing Bag-Of-Words Models By Efficient Semantics-Preserving Metric Learning, Lei Wu, Steven C. H. Hoi Jan 2011

Enhancing Bag-Of-Words Models By Efficient Semantics-Preserving Metric Learning, Lei Wu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The authors present an online semantics preserving, metric learning technique for improving the bag-of-words model and addressing the semantic-gap issue. This article investigates the challenge of reducing the semantic gap for building BoW models for image representation; propose a novel OSPML algorithm for enhancing BoW by minimizing the semantic loss, which is efficient and scalable for enhancing BoW models for large-scale applications; apply the proposed technique for large-scale image annotation and object recognition; and compare it to the state of the art.

Go to article

First Prev Next Last