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 5311 - 5340 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Heuristic Algorithms For Balanced Multi-Way Number Partitioning, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang Jul 2011

Heuristic Algorithms For Balanced Multi-Way Number Partitioning, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Balanced multi-way number partitioning (BMNP) seeks to split a collection of numbers into subsets with (roughly) the same cardinality and subset sum. The problem is NP-hard, and there are several exact and approximate algorithms for it. However, existing exact algorithms solve only the simpler, balanced two-way number partitioning variant, whereas the most effective approximate algorithm, BLDM, may produce widely varying subset sums. In this paper, we introduce the LRM algorithm that lowers the expected spread in subset sums to one third that of BLDM for uniformly distributed numbers and odd subset cardinalities. We also propose Meld, a novel strategy for …

Go to article

Unsupervised Information Extraction With Distributional Prior Knowledge, Cane Wing-Ki Leung, Jing Jiang, Kian Ming A. Chai, Hai Leong Chieu, Loo-Nin Teow Jul 2011

Unsupervised Information Extraction With Distributional Prior Knowledge, Cane Wing-Ki Leung, Jing Jiang, Kian Ming A. Chai, Hai Leong Chieu, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

We address the task of automatic discovery of information extraction template from a given text collection. Our approach clusters candidate slot fillers to identify meaningful template slots. We propose a generative model that incorporates distributional prior knowledge to help distribute candidates in a document into appropriate slots. Empirical results suggest that the proposed prior can bring substantial improvements to our task as compared to a K-means baseline and a Gaussian mixture model baseline. Specifically, the proposed prior has shown to be effective when coupled with discriminative features of the candidates.

Go to article

Generating Aspect-Oriented Multi-Document Summarization With Event-Aspect Model, Peng Li, Yinglin Wang, Wei Gao, Jing Jiang Jul 2011

Generating Aspect-Oriented Multi-Document Summarization With Event-Aspect Model, Peng Li, Yinglin Wang, Wei Gao, Jing Jiang

Research Collection School Of Computing and Information Systems

In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sentences into aspects. We then use extended LexRank algorithm to rank the sentences in each cluster. We use Integer Linear Programming for sentence selection. Key features of our method include automatic grouping of semantically related sentences and sentence ranking based on extension of random walk model. Also, we implement a new sentence compression algorithm which use dependency tree instead of parser tree. We compare our method with four baseline methods. Quantitative evaluation based on …

Go to article

Effects Of Mentoring On Player Performance In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Kuo-Wei Hsu, Jaideep Srivastava Jul 2011

Effects Of Mentoring On Player Performance In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Kuo-Wei Hsu, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

Massively Multiplayer Online Role-Playing Games (MMORPGs) have become increasingly popular and have communities comprising millions of subscribers. With their increasing popularity, researchers are realizing that video games can be a means to fully observe an entire isolated universe. In this study, we examine and report our findings on the effects of mentoring activities on player performance in Ever Quest II, a popular MMORPG developed by Sony Online Entertainment.

Go to article

A Hybrid Agent Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yew-Soon Ong, Akejariyawong Tapanuj Jul 2011

A Hybrid Agent Architecture Integrating Desire, Intention And Reinforcement Learning, Ah-Hwee Tan, Yew-Soon Ong, Akejariyawong Tapanuj

Research Collection School Of Computing and Information Systems

This paper presents a hybrid agent architecture that integrates the behaviours of BDI agents, specifically desire and intention, with a neural network based reinforcement learner known as Temporal DifferenceFusion Architecture for Learning and COgNition (TD-FALCON). With the explicit maintenance of goals, the agent performs reinforcement learning with the awareness of its objectives instead of relying on external reinforcement signals. More importantly, the intention module equips the hybrid architecture with deliberative planning capabilities, enabling the agent to purposefully maintain an agenda of actions to perform and reducing the need of constantly sensing the environment. Through reinforcement learning, plans can also be …

Go to article

Linking Entities To A Knowledge Base With Query Expansion, Swapna Gottipati, Jing Jiang Jul 2011

Linking Entities To A Knowledge Base With Query Expansion, Swapna Gottipati, Jing Jiang

Research Collection School Of Computing and Information Systems

In this paper we present a novel approach to entity linking based on a statistical language model-based information retrieval with query expansion. We use both local contexts and global world knowledge to expand query language models. We place a strong emphasis on named entities in the local contexts and explore a positional language model to weigh them differently based on their distances to the query. Our experiments on the TAC-KBP 2010 data show that incorporating such contextual information indeed aids in disambiguating the named entities and consistently improves the entity linking performance. Compared with the official results from KBP 2010 …

Go to article

Message-Passing Algorithms For Quadratic Programming Formulations Of Map Estimation, Akshat Kumar, Shlomo Zilberstein Jul 2011

Message-Passing Algorithms For Quadratic Programming Formulations Of Map Estimation, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Computing maximum a posteriori (MAP) estimation in graphical models is an important inference problem with many applications. We present message-passing algorithms for quadratic programming (QP) formulations of MAP estimation for pairwise Markov random fields. In particular, we use the concave-convex procedure (CCCP) to obtain a locally optimal algorithm for the non-convex QP formulation. A similar technique is used to derive a globally convergent algorithm for the convex QP relaxation of MAP. We also show that a recently developed expectation-maximization (EM) algorithm for the QP formulation of MAP can be derived from the CCCP perspective. Experiments on synthetic and real-world problems …

Go to article

Trust Network Inference For Online Rating Data Using Generative Models, Freddy Tat Chua Chua, Ee Peng Lim Jul 2011

Trust Network Inference For Online Rating Data Using Generative Models, Freddy Tat Chua Chua, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In an online rating system, raters assign ratings to objects contributed by other users. In addition, raters can develop trust and distrust on object contributors depending on a few rating and trust related factors. Previous study has shown that ratings and trust links can influence each other but there has been a lack of a formal model to relate these factors together. In this paper, we therefore propose Trust Antecedent Factor (TAF)Model, a novel probabilistic model that generate ratings based on a number of rater’s and contributor’s factors. We demonstrate that parameters of the model can be learnt by Collapsed …

Go to article

Mining Weakly Labeled Web Facial Images For Search-Based Face Annotation, Dayang Wang, Steven C. H. Hoi, Ying He Jul 2011

Mining Weakly Labeled Web Facial Images For Search-Based Face Annotation, Dayang Wang, Steven C. H. Hoi, Ying He

Research Collection School Of Computing and Information Systems

In this paper, we investigate a search-based face annotation framework by mining weakly labeled facial images that are freely available on the internet. A key component of such a search-based annotation paradigm is to build a database of facial images with accurate labels. This is however challenging since facial images on the WWW are often noisy and incomplete. To improve the label quality of raw web facial images, we propose an effective Unsupervised Label Refinement (ULR) approach for refining the labels of web facial images by exploring machine learning techniques. We develop effective optimization algorithms to solve the large-scale learning …

Go to article

Solution Pluralism And Metaheuristics, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau, Frederic H. Murphy, David Harlan Wood Jul 2011

Solution Pluralism And Metaheuristics, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau, Frederic H. Murphy, David Harlan Wood

Research Collection School Of Computing and Information Systems

Solution pluralism is an approach to problem solving and deliberation. It employs a plurality of distinct solutions for a decision problem for aiding decision making. The concept is well established in existing practice, although perhaps not recognized as such. This paper: (1) presents the concept as a generalization of established practice, (2) briefly describes successful uses of the concept in practice, and (3) presents several areas that appear would benefit from application of the concept. Throughout, the role of metaheuristics in finding the pluralities of solutions is emphasized.

Go to article

Finding Robust-Under-Risk Solutions For Flowshop Scheduling, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau Jul 2011

Finding Robust-Under-Risk Solutions For Flowshop Scheduling, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We propose and explore, in the context of benchmark problems for flowshop scheduling, a risk-based concept of robustness for optimization problems. This risk-based concept is in distinction to, and complements, the uncertainty-based concept employed in the field known as robust optimization. Implementation of our concept requires problem solution methods that sample the solution space intelligently and that produce large numbers of distinct sample points. With these solutions to hand, their robustness scores are easily obtained and heuristically robust solutions found. We find evolutionary computation to be effective for this purpose on these problems.

Go to article

Query Weighting For Ranking Model Adaptation, Peng Cai, Wei Gao, Aoying Zhou, Kam-Fai Wong Jun 2011

Query Weighting For Ranking Model Adaptation, Peng Cai, Wei Gao, Aoying Zhou, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

We propose to directly measure the importance of queries in the source domain to the target domain where no rank labels of documents are available, which is referred to as query weighting. Query weighting is a key step in ranking model adaptation. As the learning object of ranking algorithms is divided by query instances, we argue that it’s more reasonable to conduct importance weighting at query level than document level. We present two query weighting schemes. The first compresses the query into a query feature vector, which aggregates all document instances in the same query, and then conducts query weighting …

Go to article

Link Type Based Pre-Cluster Pair Model For Coreference Resolution, Yang Song, Houfeng Wang, Jing Jiang Jun 2011

Link Type Based Pre-Cluster Pair Model For Coreference Resolution, Yang Song, Houfeng Wang, Jing Jiang

Research Collection School Of Computing and Information Systems

This paper presents our participation in the CoNLL-2011 shared task, Modeling Unrestricted Coreference in OntoNotes. Coreference resolution, as a difficult and challenging problem in NLP, has attracted a lot of attention in the research community for a long time. Its objective is to determine whether two mentions in a piece of text refer to the same entity. In our system, we implement mention detection and coreference resolution seperately. For mention detection, a simple classification based method combined with several effective features is developed. For coreference resolution, we propose a link type based pre-cluster pair model. In this model, pre-clustering of …

Go to article

Smoothly Varying Affine Stitching, Wen-Yan Lin, Siying Liu, Yasuyuki Matsuhita, Tian-Tsong Ng, Loong-Fah Cheong Jun 2011

Smoothly Varying Affine Stitching, Wen-Yan Lin, Siying Liu, Yasuyuki Matsuhita, Tian-Tsong Ng, Loong-Fah Cheong

Research Collection School Of Computing and Information Systems

Traditional image stitching using parametric transforms such as homography, only produces perceptually correct composites for planar scenes or parallax free camera motion between source frames. This limits mosaicing to source images taken from the same physical location. In this paper, we introduce a smoothly varying affine stitching field which is flexible enough to handle parallax while retaining the good extrapolation and occlusion handling properties of parametric transforms. Our algorithm which jointly estimates both the stitching field and correspondence, permits the stitching of general motion source images, provided the scenes do not contain abrupt protrusions.

Go to article

On Combining State Space Reductions With Global Fairness Assumptions, Shao Jie Zhang, Jun Sun, Jun Pang, Yang Liu, Jin Song Dong Jun 2011

On Combining State Space Reductions With Global Fairness Assumptions, Shao Jie Zhang, Jun Sun, Jun Pang, Yang Liu, Jin Song Dong

Research Collection School Of Computing and Information Systems

Model checking has established itself as an effective system analysis method, as it is capable of proving/dis-proving properties automatically. Its application to practical systems is however limited by state space explosion. Among effective state reduction techniques are symmetry reduction and partial order reduction. Global fairness often plays a vital role in designing self-stabilizing population protocols. It is known that combining fairness and symmetry reduction is nontrivial. In this work, we first show that global fairness, unlike weak/strong fairness, can be combined with symmetry reduction. We extend the PAT model checker with the technique and demonstrate its usability by verifying recently …

Go to article

Online Fault Detection Of Induction Motors Using Frequency Domain Independent Components Analysis, Zhaoxia Wang, C. S. Chang Jun 2011

Online Fault Detection Of Induction Motors Using Frequency Domain Independent Components Analysis, Zhaoxia Wang, C. S. Chang

Research Collection School Of Computing and Information Systems

This paper proposes an online fault detection method for induction motors using frequency-domain independent component analysis. Frequency-domain results, which are obtained by applying Fast Fourier Transform (FFT) to measured stator current time-domain waveforms, are analyzed with the aim of extracting frequency signatures of healthy and faulty motors with broken rotor-bar or bearing problem. Independent components analysis (ICA) is applied for such an aim to the FFT results. The obtained independent components as well as the FFT results are then used to obtain the combined fault signatures. The proposed method overcomes problems occurring in many existing FFT-based methods. Results using laboratory-collected …

Go to article

Kb-Anonymity: A Model For Anonymized Behavior-Preserving Test And Debugging Data, Aditya Budi, David Lo, Lingxiao Jiang, Lucia Lucia Jun 2011

Kb-Anonymity: A Model For Anonymized Behavior-Preserving Test And Debugging Data, Aditya Budi, David Lo, Lingxiao Jiang, Lucia Lucia

Research Collection School Of Computing and Information Systems

It is often very expensive and practically infeasible to generate test cases that can exercise all possible program states in a program. This is especially true for a medium or large industrial system. In practice, industrial clients of the system often have a set of input data collected either before the system is built or after the deployment of a previous version of the system. Such data are highly valuable as they represent the operations that matter in a client's daily business and may be used to extensively test the system. However, such data often carries sensitive information and cannot …

Go to article

Fully Secure Cipertext-Policy Hiding Cp-Abe, Junzuo Lai, Robert H. Deng, Yingjiu Li Jun 2011

Fully Secure Cipertext-Policy Hiding Cp-Abe, Junzuo Lai, Robert H. Deng, Yingjiu Li

Research Collection School Of Computing and Information Systems

In ciphertext-policy attributed-based encryption (CP-ABE), each ciphertext is labeled by the encryptor with an access structure (also called ciphertext policy) and each private key is associated with a set of attributes. A user should be able to decrypt a ciphertext if and only if his private key attributes satisfy the access structure.The traditional security property of CP-ABE is plaintext privacy, which ciphertexts reveal no information about the underlying plaintext. At ACNS’08, Nishide, Yoneyama and Ohta introduced the notion of ciphertext-policy hiding CP-ABE. In addition to protecting the privacy of plaintexts, ciphertext-policy hiding CP-ABE also protects the description of the access …

Go to article

Hierarchical Identity-Based Chameleon Hash And Its Applications, Feng Bao, Robert H. Deng, Xuhua Ding, Junzuo Lai, Yunlei Zhao Jun 2011

Hierarchical Identity-Based Chameleon Hash And Its Applications, Feng Bao, Robert H. Deng, Xuhua Ding, Junzuo Lai, Yunlei Zhao

Research Collection School Of Computing and Information Systems

At ACNS 2008, Canard et al. introduced the notion of trapdoor sanitizable signature (TSS) based on identity-based chameleon hash (IBCH). Trapdoor sanitizable signatures allow the signer of a message to delegate, at any time, the power of sanitization to possibly several entities who can modify predetermined parts of the message and generate a new signature on the sanitized message without interacting with the original signer. In this paper, we introduce the notion of hierarchical identity-based chameleon hash (HIBCH), which is a hierarchical extension of IBCH. We show that HIBCH can be used to construct other cryptographic primitives, including hierarchical trapdoor …

Go to article

Preserving Transparency And Accountability In Optimistic Fair Exchange Of Digital Signatures, Xinyi Huang, Yi Mu, Willy Susilo, Jianying Zhou, Robert H. Deng Jun 2011

Preserving Transparency And Accountability In Optimistic Fair Exchange Of Digital Signatures, Xinyi Huang, Yi Mu, Willy Susilo, Jianying Zhou, Robert H. Deng

Research Collection School Of Computing and Information Systems

Optimistic fair exchange (OFE) protocols are useful tools for two participants to fairly exchange items with the aid of a third party who is only involved if needed. A widely accepted requirement is that the third party's involvement in the exchange must be transparent, to protect privacy and avoid bad publicity. At the same time, a dishonest third party would compromise the fairness of the exchange and the third party thus must be responsible for its behaviors. This is achieved in OFE protocols with another property called accountability. It is unfortunate that the accountability has never been formally studied in …

Go to article

Supervisory Evolutionary Optimization Strategy For Adaptive Maintenance Schedules, Zhaoxia Wang, C. S. Chang Jun 2011

Supervisory Evolutionary Optimization Strategy For Adaptive Maintenance Schedules, Zhaoxia Wang, C. S. Chang

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Topical Keyphrase Extraction From Twitter, Xin Zhao, Jing Jiang, Jing He, Yang Song, Palakorn Achananuparp, Ee Peng Lim, Xiaoming Li Jun 2011

Topical Keyphrase Extraction From Twitter, Xin Zhao, Jing Jiang, Jing He, Yang Song, Palakorn Achananuparp, Ee Peng Lim, Xiaoming Li

Research Collection School Of Computing and Information Systems

Summarizing and analyzing Twitter content is an important and challenging task. In this paper, we propose to extract topical keyphrases as one way to summarize Twitter. We propose a context-sensitive topical PageRank method for keyword ranking and a probabilistic scoring function that considers both relevance and interestingness of keyphrases for keyphrase ranking. We evaluate our proposed methods on a large Twitter data set. Experiments show that these methods are very effective for topical keyphrase extraction.

Go to article

Real-Time Trip Information Service For A Large Taxi Fleet, Rajesh Krishna Balan, Nguyen Xuan Khoa, Lingxiao Jiang Jun 2011

Real-Time Trip Information Service For A Large Taxi Fleet, Rajesh Krishna Balan, Nguyen Xuan Khoa, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

In this paper, we describe the design, analysis, implementation, and operational deployment of a real-time trip information system that provides passengers with the expected fare and trip duration of the taxi ride they are planning to take. This system was built in cooperation with a taxi operator that operates more than 15,000 taxis in Singapore. We first describe the overall system design and then explain the efficient algorithms used to achieve our predictions based on up to 21 months of historical data consisting of approximately 250 million paid taxi trips. We then describe various optimisations (involving region sizes, amount of …

Go to article

Optimizing Sensor Data Acquisition For Energy-Efficient Smartphone-Based Continuous Event Processing, Archan Misra, Lipyeow Lim Jun 2011

Optimizing Sensor Data Acquisition For Energy-Efficient Smartphone-Based Continuous Event Processing, Archan Misra, Lipyeow Lim

Research Collection School Of Computing and Information Systems

Many pervasive applications, such as activity recognition or remote wellness monitoring, utilize a personal mobile device (aka smartphone) to perform continuous processing of data streams acquired from locally-connected, wearable, sensors. To ensure the continuous operation of such applications on a battery-limited mobile device, it is essential to dramatically reduce the energy overhead associated with the process of sensor data acquisition and processing. To achieve this goal, this paper introduces a technique of "acquisition-cost" aware continuous query processing, as part of the Acquisition Cost-Aware Query Adaptation (ACQUA) framework. ACQUA replaces the current paradigm, where the data is typically streamed (pushed) from …

Go to article

Getting To Global Yes! Designing A Distributed Student Collaboration, Selma Limam Mansar, Randy Weinberg, Benjamin Kok Siew Gan Jun 2011

Getting To Global Yes! Designing A Distributed Student Collaboration, Selma Limam Mansar, Randy Weinberg, Benjamin Kok Siew Gan

Research Collection School Of Computing and Information Systems

The authors have taught a course called 'Global Project Management' for four years, engaging students in three international locations in hands-on distance projects. The distance projects are intended to provide students with enriching, realistic global project experience. With experience, improved planning and better coordination, each iteration of the distance projects has improved. In this paper, the authors present lessons learned and a mind map demonstrating key aspects of design of global hands-on projects.

Go to article

Continuous Visible Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Xiaofa Guo Jun 2011

Continuous Visible Nearest Neighbor Query Processing In Spatial Databases, Yunjun Gao, Baihua Zheng, Gencai Chen, Qing Li, Xiaofa Guo

Research Collection School Of Computing and Information Systems

In this paper, we identify and solve a new type of spatial queries, called continuous visible nearest neighbor (CVNN) search. Given a data set P, an obstacle set O, and a query line segment q in a two-dimensional space, a CVNN query returns a set of $${\langle p, R\rangle}$$ tuples such that $${p \in P}$$ is the nearest neighbor to every point r along the interval $${R \subseteq q}$$ as well as pis visible to r. Note that p may be NULL, meaning that all points in P are invisible to all points in R due to the obstruction of …

Go to article

A Feature Based Frequency Domain Analysis Algorithm For Fault Detection Of Induction Motors, Zhaoxia Wang, C. S. Chang, Zhang Yifan Jun 2011

A Feature Based Frequency Domain Analysis Algorithm For Fault Detection Of Induction Motors, Zhaoxia Wang, C. S. Chang, Zhang Yifan

Research Collection School Of Computing and Information Systems

This paper studies the stator currents collected from several inverter-fed laboratory induction motors and proposes a new feature based frequency domain analysis method for performing the detection of induction motor faults, such as the broken rotor-bar or bearing fault. The mathematical formulation is presented to calculate the features, which are called FFT-ICA features in this paper. The obtained FFT-ICA features are normalized by using healthy motor as benchmarks to establish a feature database for fault detection. Compare with conventional frequency-domain analysis method, no prior knowledge of the motor parameters or other measurements are required for calculating features. Only one phase …

Go to article

Towards Human-Like Social Multi-Agents With Memetic Automaton, Liang Feng, Yew-Soon Ong, Ah-Hwee Tan, Xian-Shun Chen Jun 2011

Towards Human-Like Social Multi-Agents With Memetic Automaton, Liang Feng, Yew-Soon Ong, Ah-Hwee Tan, Xian-Shun Chen

Research Collection School Of Computing and Information Systems

Memetics is a new science that has attracted increasing attentions in the recent decades. Beyond the formalism of simple hybrids, adaptive hybrids and memetic algorithms, the notion of memetic automaton as an adaptive entity that is self-contained and uses memes as building blocks of information is recently conceptualized in the context of computational intelligence as potential tools for effective problem-solving [1]. Taking this cue, this paper embarks a study on Memetic Multiagent system (MeM) towards human-like social agents with memetic automaton. Particularly, we introduce a potentially rich meme-inspired design and operational model, with Darwin’s theory of natural selections and Dawkins’ …

Go to article

Adaptive Display Power Management For Mobile Games, Bhojan Anand, Karthik Thirugnanam, Jeena Sebastian, Pravein G. Kannan, Akhihebbal L. Ananda, Mun Choon Chan, Rajesh Krishna Balan Jun 2011

Adaptive Display Power Management For Mobile Games, Bhojan Anand, Karthik Thirugnanam, Jeena Sebastian, Pravein G. Kannan, Akhihebbal L. Ananda, Mun Choon Chan, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

In this paper, we show how tone mapping techniques can be used to dynamically increase the image brightness, thus allowing the LCD backlight levels to be reduced. This saves significant power as the majority of the LCD’s display power is consumed by its backlight. The Gamma function (or equivalent) can be efficiently implemented in smartphones with minimal resource cost. We describe how we overcame the Gamma function’s non-linear nature by using adaptive thresholds to apply different Gamma values to images with differing brightness levels. These adaptive thresholds allow us to save significant amounts of power while preserving the image quality. …

Go to article

A Solution With Security Concern For Rfid-Based Track And Trace Services In Epcglobal-Enabled Supply Chains, Wei He, Yingjiu Li, Kevin Chiew, Tieyan Li, Eng Wah Lee Jun 2011

A Solution With Security Concern For Rfid-Based Track And Trace Services In Epcglobal-Enabled Supply Chains, Wei He, Yingjiu Li, Kevin Chiew, Tieyan Li, Eng Wah Lee

Research Collection School Of Computing and Information Systems

A supply chain represents the flow of materials, information, and finance as they move through supply chain partners such as manufacturers, suppliers, distributors, retailers, and consumers. The track & trace services in supply chains can help improve supply chain visibility and efficiency, and prevent counterfeiting and stealing of products thus enhance security. Track & trace services in supply chains require identification of items, capture of events as items move through supply chains, and query of events of items. RFID (radio frequency identification) is a technology that allows to identify objects simultaneously in a fully automated manner via radio waves. This …

Go to article

First Prev Next Last