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

Artificial Intelligence and Robotics Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1681 - 1710 of 1897

Full-Text Articles in Artificial Intelligence and Robotics

Approximate Inference In Collective Graphical Models, Daniel Sheldon, Tao Sun, Akshat Kumar, Thomas G. Dietterich Jun 2013

Approximate Inference In Collective Graphical Models, Daniel Sheldon, Tao Sun, Akshat Kumar, Thomas G. Dietterich

Research Collection School Of Computing and Information Systems

We study the problem of approximate inference in collective graphical models (CGMs), which were recently introduced to model the problem of learning and inference with noisy aggregate observations. We first analyze the complexity of inference in CGMs: unlike inference in conventional graphical models, exact inference in CGMs is NP-hard even for tree-structured models. We then develop a tractable convex approximation to the NP-hard MAP inference problem in CGMs, and show how to use MAP inference for approximate marginal inference within the EM framework. We demonstrate empirically that these approximation techniques can reduce the computational cost of inference by two orders …

Go to article

Understanding Sequential Decisions Via Inverse Reinforcement Learning, Siyuan Liu, Miguel Araujo, Emma Brunskill, Rosaldo Rossetti, Joao Barros, Ramayya Krishnan Jun 2013

Understanding Sequential Decisions Via Inverse Reinforcement Learning, Siyuan Liu, Miguel Araujo, Emma Brunskill, Rosaldo Rossetti, Joao Barros, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

The execution of an agent's complex activities, comprising sequences of simpler actions, sometimes leads to the clash of conflicting functions that must be optimized. These functions represent satisfaction, short-term as well as long-term objectives, costs and individual preferences. The way that these functions are weighted is usually unknown even to the decision maker. But if we were able to understand the individual motivations and compare such motivations among individuals, then we would be able to actively change the environment so as to increase satisfaction and/or improve performance. In this work, we approach the problem of providing highlevel and intelligible descriptions …

Go to article

Traditional Media Seen From Social Media, Jisun An, Daniele Quercia, Meeyoung Cha, Krishna Gummadi, Jon Crowcroft May 2013

Traditional Media Seen From Social Media, Jisun An, Daniele Quercia, Meeyoung Cha, Krishna Gummadi, Jon Crowcroft

Research Collection School Of Computing and Information Systems

With the advent of social media services, media outlets have started reaching audiences on social-networking sites. On Twitter, users actively follow a wide set of media sources, form interpersonal networks, and propagate interesting stories to their peers. These media subscription and interaction patterns, which had previously been hidden behind media corporations' databases, offer new opportunities to understand media supply and demand on a large scale. Through a map that connects 77 media outlets based on Twitter subscription patterns, we are able to answer a variety of questions: to what extent New York Times and the Wall Street Journal readers overlap? …

Go to article

Why Individuals Seek Diverse Opinions (Or Why They Don't), Jisun An, Daniele Quercia, Jon Crowcroft May 2013

Why Individuals Seek Diverse Opinions (Or Why They Don't), Jisun An, Daniele Quercia, Jon Crowcroft

Research Collection School Of Computing and Information Systems

Fact checking has been hard enough to do in traditional settings, but, as news consumption is moving on the Internet and sources multiply, it is almost unmanageable. To solve this problem, researchers have created applications that expose people to diverse opinions and, as a result, expose them to balanced information. The wisdom of this solution is, however, placed in doubt by this paper. Survey responses of 60 individuals in the UK and South Korea and in-depth structured interviews of 10 respondents suggest that exposure to diverse opinions would not always work. That is partly because not all individuals equally value …

Go to article

Enabling Generative, Emergent Artificial Culture, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann May 2013

Enabling Generative, Emergent Artificial Culture, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann

Research Collection School Of Computing and Information Systems

Despite the demand for culturally placed agent models, an adequate simulation approach to the relationship between group-cultural and individual-psychological qualities, including culture emergence, is just appearing. It could be argued that we are at the beginning of a domain forming process, a dawn of generative, emergent artificial culture. In this context we discuss current limitations and argue e.g. that too far reaching agent simplicity within Agent Based Modeling limits the emergence of realistic cultural-conventional level and we advocate psychologically rich models of culture forming mechanisms. We propose an approach to cultural phenomena modeling based on the interaction of habitual, affective …

Go to article

Disclosing Climate Change Patterns Using An Adaptive Markov Chain Pattern Detection Method, Zhaoxia Wang, Gary Lee, Hoong Maeng Chan, Reuben Li, Xiuju Fu, Rick Goh, Pauline A. W. Poh Kim, Martin L. Hibberd, Hoong Chor Chin May 2013

Disclosing Climate Change Patterns Using An Adaptive Markov Chain Pattern Detection Method, Zhaoxia Wang, Gary Lee, Hoong Maeng Chan, Reuben Li, Xiuju Fu, Rick Goh, Pauline A. W. Poh Kim, Martin L. Hibberd, Hoong Chor Chin

Research Collection School Of Computing and Information Systems

This paper proposes an adaptive Markov chain pattern detection (AMCPD) method for disclosing the climate change patterns of Singapore through meteorological data mining. Meteorological variables, including daily mean temperature, mean dew point temperature, mean visibility, mean wind speed, maximum sustained wind speed, maximum temperature and minimum temperature are simultaneously considered for identifying climate change patterns in this study. The results depict various weather patterns from 1962 to 2011 in Singapore, based on the records of the Changi Meteorological Station. Different scenarios with varied cluster thresholds are employed for testing the sensitivity of the proposed method. The robustness of the proposed …

Go to article

Enhancing Robot Perception Using Human Teammates, Jean Oh, Arne Suppe, Anthony Stentz, Martial Hebert May 2013

Enhancing Robot Perception Using Human Teammates, Jean Oh, Arne Suppe, Anthony Stentz, Martial Hebert

Research Collection School Of Computing and Information Systems

In robotics research, perception is one of the most challenging tasks. In contrast to existing approaches that rely only on computer vision, we propose an alternative method for improving perception by learning from human teammates. To evaluate, we apply this idea to a door detection problem. A set of preliminary experiments has been completed using software agents with real vision data. Our results demonstrate that information inferred from teammate observations significantly improves the perception precision.

Go to article

Tesla: An Energy-Saving Agent That Leverages Schedule Flexibility, Jun Young Kwak, Pradeep Varakantham, Rajiv Maheswaran, Burcin Becerik-Gerber, Milind Tambe May 2013

Tesla: An Energy-Saving Agent That Leverages Schedule Flexibility, Jun Young Kwak, Pradeep Varakantham, Rajiv Maheswaran, Burcin Becerik-Gerber, Milind Tambe

Research Collection School Of Computing and Information Systems

This innovative application paper presents TESLA, an agent-based application for optimizing the energy use in commercial buildings. TESLA’s key insight is that adding flexibility to event/meeting schedules can lead to significant energy savings. TESLA provides three key contributions: (i) three online scheduling algorithms that consider flexibility of people’s preferences for energyefficient scheduling of incrementally/dynamically arriving meetings and events; (ii) an algorithm to effectively identify key meetings that lead to significant energy savings by adjusting their flexibility; and (iii) surveys of real users that indicate that TESLA’s assumptions exist in practice. TESLA was evaluated on data of over 110,000 meetings held …

Go to article

Anonymous Authentication Of Visitors For Mobile Crowd Sensing At Amusement Parks, Divyan Konidala, Robert H. Deng, Yingjiu Li, Hoong Chuin Lau, Stephen Fienberg May 2013

Anonymous Authentication Of Visitors For Mobile Crowd Sensing At Amusement Parks, Divyan Konidala, Robert H. Deng, Yingjiu Li, Hoong Chuin Lau, Stephen Fienberg

Research Collection School Of Computing and Information Systems

In this paper we focus on authentication and privacy aspects of an application scenario that utilizes mobile crowd sensing for the benefit of amusement park operators and their visitors. The scenario involves a mobile app that gathers visitors’ demographic details, preferences, and current location coordinates, and sends them to the park’s sever for various analyses. These analyses assist the park operators to efficiently deploy their resources, estimate waiting times and queue lengths, and understand the behavior of individual visitors and groups. The app server also offers visitors optimal recommendations on routes and attractions for an improved dynamic experience and minimized …

Go to article

Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau May 2013

Master Physician Scheduling Problem, Aldy Gunawan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We study a real-world problem arising from the operations of a hospital service provider, which we term the master physician scheduling problem. It is a planning problem of assigning physicians’ full range of day-to-day duties (including surgery, clinics, scopes, calls, administration) to the defined time slots/shifts over a time horizon, incorporating a large number of constraints and complex physician preferences. The goals are to satisfy as many physicians’ preferences and duty requirements as possible while ensuring optimum usage of available resources. We propose mathematical programming models that represent different variants of this problem. The models were tested on a real …

Go to article

Distributed Gibbs: A Memory-Bounded Sampling-Based Dcop Algorithm, Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau May 2013

Distributed Gibbs: A Memory-Bounded Sampling-Based Dcop Algorithm, Duc Thien Nguyen, William Yeoh, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Researchers have used distributed constraint optimization problems (DCOPs) to model various multi-agent coordination and resource allocation problems. Very recently, Ottens et al. proposed a promising new approach to solve DCOPs that is based on confidence bounds via their Distributed UCT (DUCT) sampling-based algorithm. Unfortunately, its memory requirement per agent is exponential in the number of agents in the problem, which prohibits it from scaling up to large problems. Thus, in this paper, we introduce a new sampling-based DCOP algorithm called Distributed Gibbs, whose memory requirements per agent is linear in the number of agents in the problem. Additionally, we show …

Go to article

Implementation Of Slowly Changing Dimension To Data Warehouse To Manage Marketing Campaigns In Banks, Lihui Wang, Junyu Choy, Michelle L. F. Cheong May 2013

Implementation Of Slowly Changing Dimension To Data Warehouse To Manage Marketing Campaigns In Banks, Lihui Wang, Junyu Choy, Michelle L. F. Cheong

Research Collection School Of Computing and Information Systems

Management of updating and recording campaign leads in data warehouse of any banking environment is complex especially with multiple campaigns are active simultaneously. As a way to avoid overly contacting customers for sales-based marketing contacts, the concept of Recency Frame is introduced to “lock” the customers who are targeted in Sales-based campaign for a specified time period. During this Recency Frame, the customer cannot be targeted by other Sales-based campaign under the same channel. This approach increased the difficulties of managing the customers’ data with proper data updating and storing and procedures have to be placed and made sufficiently robust …

Go to article

Delayed Insertion And Rule Effect Moderation Of Domain Knowledge For Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan Apr 2013

Delayed Insertion And Rule Effect Moderation Of Domain Knowledge For Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Though not a fundamental pre-requisite to efficient machine learning, insertion of domain knowledge into adaptive virtual agent is nonetheless known to improve learning efficiency and reduce model complexity. Conventionally, domain knowledge is inserted prior to learning. Despite being effective, such approach may not always be feasible. Firstly, the effect of domain knowledge is assumed and can be inaccurate. Also, domain knowledge may not be available prior to learning. In addition, the insertion of domain knowledge can frame learning and hamper the discovery of more effective knowledge. Therefore, this work advances the use of domain knowledge by proposing to delay the …

Go to article

Moving Object Detection With Laser Scanners, Christoph Mertz, Luis E. Navarro-Serment, Robert Maclachlan, Paul Rybski, Aaron Steinfeld, Arne Suppe, Christopher Urmson, Nicolas Vandapel, Martial Hebert, Chuck Thorpe, David Duggins, Jay Gowdy Jan 2013

Moving Object Detection With Laser Scanners, Christoph Mertz, Luis E. Navarro-Serment, Robert Maclachlan, Paul Rybski, Aaron Steinfeld, Arne Suppe, Christopher Urmson, Nicolas Vandapel, Martial Hebert, Chuck Thorpe, David Duggins, Jay Gowdy

Research Collection School Of Computing and Information Systems

The detection and tracking of moving objects is an essential task in robotics. The CMU-RI Navlab group has developed such a system that uses a laser scanner as its primary sensor. We will describe our algorithm and its use in several applications. Our system worked successfully on indoor and outdoor platforms and with several different kinds and configurations of two-dimensional and three-dimensional laser scanners. The applications vary from collision warning systems, people classification, observing human tracks, and input to a dynamic planner. Several of these systems were evaluated in live field tests and shown to be robust and reliable. (C) …

Go to article

Clustering Of Search Trajectory And Its Application To Parameter Tuning, Linda Lindawati, Hoong Chuin Lau, David Lo Jan 2013

Clustering Of Search Trajectory And Its Application To Parameter Tuning, Linda Lindawati, Hoong Chuin Lau, David Lo

Research Collection School Of Computing and Information Systems

This paper is concerned with automated classification of Combinatorial Optimization Problem instances for instance-specific parameter tuning purpose. We propose the CluPaTra Framework, a generic approach to CLUster instances based on similar PAtterns according to search TRAjectories and apply it on parameter tuning. The key idea is to use the search trajectory as a generic feature for clustering problem instances. The advantage of using search trajectory is that it can be obtained from any local-search based algorithm with small additional computation time. We explore and compare two different search trajectory representations, two sequence alignment techniques (to calculate similarities) as well as …

Go to article

Regret Based Robust Solutions For Uncertain Markov Decision Processes, Asrar Ahmed, Pradeep Reddy Varakantham, Yossiri Adulyasak, Patrick Jaillet Jan 2013

Regret Based Robust Solutions For Uncertain Markov Decision Processes, Asrar Ahmed, Pradeep Reddy Varakantham, Yossiri Adulyasak, Patrick Jaillet

Research Collection School Of Computing and Information Systems

In this paper, we seek robust policies for uncertain Markov Decision Processes (MDPs). Most robust optimization approaches for these problems have focussed on the computation of maximin policies which maximize the value corresponding to the worst realization of the uncertainty. Recent work has proposed minimax regret as a suitable alternative to the maximin objective for robust optimization. However, existing algorithms for handling minimax regret are restricted to models with uncertainty over rewards only. We provide algorithms that employ sampling to improve across multiple dimensions: (a) Handle uncertainties over both transition and reward models; (b) Dependence of model uncertainties across state, …

Go to article

Sensor Feature Selection And Combination For Stress Identification Using Combinatorial Fusion, Yong Deng, Zhonghai Wu, Chao-Hsien Chu, Qixun Zhang, D. Frank Hsu Jan 2013

Sensor Feature Selection And Combination For Stress Identification Using Combinatorial Fusion, Yong Deng, Zhonghai Wu, Chao-Hsien Chu, Qixun Zhang, D. Frank Hsu

Research Collection School Of Computing and Information Systems

The identification of stressfulness under certain driving condition is an important issue for safety, security and health. Sensors and systems have been placed or implemented as wearable devices for drivers. Features are extracted from the data collected and combined to predict symptoms. The challenge is to select the feature set most relevant for stress. In this paper, we propose a feature selection method based on the performance and the diversity between two features. The feature sets selected are then combined using a combinatorial fusion. We also compare our results with other combination methods such as naïve Bayes, support vector machine, …

Go to article

Decision Support For Assorted Populations In Uncertain And Congested Environments, Pradeep Reddy Varakantham, Asrar Ahmed, Shih-Fen Cheng Jan 2013

Decision Support For Assorted Populations In Uncertain And Congested Environments, Pradeep Reddy Varakantham, Asrar Ahmed, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

This research is motivated by large scale problems in urban transportation and labor mobility where there is congestion for resources and uncertainty in movement. In such domains, even though the individual agents do not have an identity of their own and do not explicitly interact with other agents, they effect other agents. While there has been much research in handling such implicit effects, it has primarily assumed deterministic movements of agents. We address the issue of decision support for individual agents that are identical and have involuntary movements in dynamic environments. For instance, in a taxi fleet serving a city, …

Go to article

Uncertain Congestion Games With Assorted Human Agent Populations , Pradeep Reddy Varakantham, Asrar Ahmed, Shih-Fen Cheng Jan 2013

Uncertain Congestion Games With Assorted Human Agent Populations , Pradeep Reddy Varakantham, Asrar Ahmed, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Congestion games model a wide variety of real-world resource congestion problems, such as selfish network routing, traffic route guidance in congested areas, taxi fleet optimization and crowd movement in busy areas. However, existing research in congestion games assumes: (a) deterministic movement of agents between resources; and (b) perfect rationality (i.e. maximizing their own expected value) of all agents. Such assumptions are not reasonable in dynamic domains where decision support has to be provided to humans. For instance, in optimizing the performance of a taxi fleet serving a city, movement of taxis can be involuntary or nondeterministic (decided by the specific …

Go to article

Automated Parameter Tuning Framework For Heterogeneous And Large Instances: Case Study In Quadratic Assignment Problem, Linda Lindawati, Zhi Yuan, Hoong Chuin Lau, Feida Zhu Jan 2013

Automated Parameter Tuning Framework For Heterogeneous And Large Instances: Case Study In Quadratic Assignment Problem, Linda Lindawati, Zhi Yuan, Hoong Chuin Lau, Feida Zhu

Research Collection School Of Computing and Information Systems

This paper is concerned with automated tuning of parameters of algorithms to handle heterogeneous and large instances. We propose an automated parameter tuning framework with the capability to provide instance-specific parameter configurations. We report preliminary results on the Quadratic Assignment Problem (QAP) and show that our framework provides a significant improvement on solutions qualities with much smaller tuning computational time.

Go to article

Agent-Based Virtual Humans In Co-Space: An Evaluative Study, Yilin Kang, Ah-Hwee Tan, Fiona Fui-Hoon Nah Dec 2012

Agent-Based Virtual Humans In Co-Space: An Evaluative Study, Yilin Kang, Ah-Hwee Tan, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

Co-Space refers to interactive virtual environment modelled after the real world in terms of look-and-feel, functionalities and services. We have developed a 3D virtual world named Nan yang Technological University (NTU) Co-Space populated with virtual human characters. Three key requirements of realistic virtual humans in the virtual world have been identified, namely (1) autonomy: agents can function on their own, (2) interactivity: agents can interact naturally with players, and (3) personality: agents can exhibit human traits and characteristics. Working towards these challenges, we propose a brain-inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personality. We conducted …

Go to article

Investigating Intelligent Agents In A 3d Virtual World, Yilin Kang, Fiona Fui-Hoon Nah, Ah-Hwee Tan Dec 2012

Investigating Intelligent Agents In A 3d Virtual World, Yilin Kang, Fiona Fui-Hoon Nah, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Web 3.0 involves "intelligent" web applications that utilize natural language processing, machine-based learning and reasoning, and intelligent techniques to analyze and understand user behavior. In this research, we empirically assess a specific form of Web 3.0 application in the form of intelligent agents that offer assistance to users in the virtual world. Using media naturalness theory, we hypothesize that the use of intelligent agents in the virtual world can enhance user experience by offering a more natural way of communication and assistance to users. We are interested to test if media naturalness theory holds in the context of intelligent agents …

Go to article

Knowledge-Based Exploration For Reinforcement Learning In Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan Dec 2012

Knowledge-Based Exploration For Reinforcement Learning In Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Exploration is necessary during reinforcement learning to discover new solutions in a given problem space. Most reinforcement learning systems, however, adopt a simple strategy, by randomly selecting an action among all the available actions. This paper proposes a novel exploration strategy, known as Knowledge-based Exploration, for guiding the exploration of a family of self-organizing neural networks in reinforcement learning. Specifically, exploration is directed towards unexplored and favorable action choices while steering away from those negative action choices that are likely to fail. This is achieved by using the learned knowledge of the agent to identify prior action choices leading to …

Go to article

Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoffrey J. Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay S. Aravamudhan, Shih-Fen Cheng Dec 2012

Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoffrey J. Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Ajay S. Aravamudhan, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Multi-agent planning is a well-studied problem with various applications including disaster rescue, urban transportation and logistics, both for autonomous agents and for decision support to humans. Due to computational constraints, existing research typically focuses on one of two scenarios: unstructured domains with many agents where we are content with heuristic solutions, or domains with small numbers of agents or special structure where we can provide provably near-optimal solutions. By contrast, in this paper, we focus on providing provably near-optimal solutions for domains with large numbers of agents, by exploiting a common domain-general property: if individual agents each have limited influence …

Go to article

Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Shih-Fen Cheng Dec 2012

Lagrangian Relaxation For Large-Scale Multi-Agent Planning, Geoff Gordon, Pradeep Varakantham, William Yeoh, Hoong Chuin Lau, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Multi-agent planning is a well-studied problem with various applications including disaster rescue, urban transportation and logistics, both for autonomous agents and for decision support to humans. Due to computational constraints, existing research typically focuses on one of two scenarios: unstructured domains with many agents where we are content with heuristic solutions, or domains with small numbers of agents or special structure where we can provide provably near-optimal solutions. By contrast, in this paper, we focus on providing provably near-optimal solutions for domains with large numbers of agents, by exploiting a common domain-general property: if individual agents each have limited influence …

Go to article

Effect Of Business Intelligence And It Infrastructure Flexibility On Organizational Agility, Xiaofeng Chen, Keng Siau Dec 2012

Effect Of Business Intelligence And It Infrastructure Flexibility On Organizational Agility, Xiaofeng Chen, Keng Siau

Research Collection School Of Computing and Information Systems

There is a growing use of business intelligence (BI) for better management decisions in different industries. However, empirical studies on BI are still scarce in academic research. This research investigates BI from an organizational agility perspective. Organizational agility is the ability to sense and respond to market opportunities and threats with speed. Drawing on systems theory and literature on organizational agility, business intelligence, and IT infrastructure flexibility, we hypothesize that BI use and IT infrastructure flexibility are two major antecedents to organizational agility. We developed a research model to examine the effect of BI use and IT infrastructure flexibility on …

Go to article

Agent-Based Virtual Humans In Co-Space: An Evaluative Study, Yilin Kang, Ah-Hwee Tan, Fiona Fui-Hoon Nah Dec 2012

Agent-Based Virtual Humans In Co-Space: An Evaluative Study, Yilin Kang, Ah-Hwee Tan, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

Co-Space refers to interactive virtual environment modelled after the real world in terms of look-and-feel, functionalities and services. We have developed a 3D virtual world named Nanyang Technological University (NTU) CoSpace populated with virtual human characters. Three key requirements of realistic virtual humans in the virtual world have been identified, namely (1) autonomy: agents can function on their own; (2) interactivity: agents can interact naturally with players; and (3) personality: agents can exhibit human traits and characteristics. Working towards these challenges, we propose a brain-inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personality. We conducted an …

Go to article

Knowledge-Driven Autonomous Commodity Trading Advisor, Yee Pin Lim, Shih-Fen Cheng Dec 2012

Knowledge-Driven Autonomous Commodity Trading Advisor, Yee Pin Lim, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

The myth that financial trading is an art has been mostly destroyed in the recent decade due to the proliferation of algorithmic trading. In equity markets, algorithmic trading has already bypass human traders in terms of traded volume. This trend seems to be irreversible, and other asset classes are also quickly becoming dominated by the machine traders. However, for asset that requires deeper understanding of physicality, like the trading of commodities, human traders still have significant edge over machines. The primary advantage of human traders in such market is the qualitative expert knowledge that requires traders to consider not just …

Go to article

A Mechanism For Organizing Last-Mile Service Using Non-Dedicated Fleet, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau Dec 2012

A Mechanism For Organizing Last-Mile Service Using Non-Dedicated Fleet, Shih-Fen Cheng, Duc Thien Nguyen, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Unprecedented pace of urbanization and rising income levels have fueled the growth of car ownership in almost all newly formed megacities. Such growth has congested the limited road space and significantly affected the quality of life in these megacities. Convincing residents to give up their cars and use public transport is the most effective way in reducing congestion; however, even with sufficient public transport capacity, the lack of last-mile (from the transport hub to the destination) travel services is the major deterrent for the adoption of public transport. Due to the dynamic nature of such travel demands, fixed-size fleets will …

Go to article

Benchmarking Still-To-Video Face Recognition Via Partial And Local Linear Discriminant Analysis On Cox-S2v Dataset, Zhiwu Huang, S. Shan, H. Zhang, S. Lao, A. Kuerban, X. Chen Nov 2012

Benchmarking Still-To-Video Face Recognition Via Partial And Local Linear Discriminant Analysis On Cox-S2v Dataset, Zhiwu Huang, S. Shan, H. Zhang, S. Lao, A. Kuerban, X. Chen

Research Collection School Of Computing and Information Systems

In this paper, we explore the real-world Still-to-Video (S2V) face recognition scenario, where only very few (single, in many cases) still images per person are enrolled into the gallery while it is usually possible to capture one or multiple video clips as probe. Typical application of S2V is mug-shot based watch list screening. Generally, in this scenario, the still image(s) were collected under controlled environment, thus of high quality and resolution, in frontal view, with normal lighting and neutral expression. On the contrary, the testing video frames are of low resolution and low quality, possibly with blur, and captured under …

Go to article

First Prev Next Last