An Agent-Based Simulation Approach To Experience Management In Theme Parks,
2013
Singapore Management University
An Agent-Based Simulation Approach To Experience Management In Theme Parks, Shih-Fen Cheng, Larry Junjie Lin, Jiali Du, Hoong Chuin Lau, Pradeep Reddy Varakantham
Research Collection School Of Computing and Information Systems
In this paper, we illustrate how massive agent-based simulation can be used to investigate an exciting new application domain of experience management in theme parks, which covers topics like congestion control, incentive design, and revenue management. Since all visitors are heterogeneous and self-interested, we argue that a high-quality agent-based simulation is necessary for studying various problems related to experience management. As in most agent-base simulations, a sound understanding of micro-level behaviors is essential to construct high-quality models. To achieve this, we designed and conducted a first-of-its-kind real-world experiment that helps us understand how typical visitors behave in a theme-park environment. …
Coupling Alignments With Recognition For Still-To-Video Face Recognition,
2013
Singapore Management University
Coupling Alignments With Recognition For Still-To-Video Face Recognition, Zhiwu Huang, X. Zhao, S. Shan, R. Wang, X. Chen
Research Collection School Of Computing and Information Systems
The Still-to-Video (S2V) face recognition systems typically need to match faces in low-quality videos captured under unconstrained conditions against high quality still face images, which is very challenging because of noise, image blur, low face resolutions, varying head pose, complex lighting, and alignment difficulty. To address the problem, one solution is to select the frames of `best quality' from videos (hereinafter called quality alignment in this paper). Meanwhile, the faces in the selected frames should also be geometrically aligned to the still faces offline well-aligned in the gallery. In this paper, we discover that the interactions among the three tasks-quality …
Adjust Decision-Making Targets Based On Psychological Thresholds,
2013
Missouri University of Science and Technology
Adjust Decision-Making Targets Based On Psychological Thresholds, Jian Liu, Shun Xiang Wu, Si Feng Liu, Qiao Wang
Electrical and Computer Engineering Faculty Research & Creative Works
This paper study the impact of psychological thresholds (PTs) on the decision maker's (DM's) decision target when making decision. A new approach of decision making is proposed in this paper. First, we construct criterion expected functions according to three different types of criteria: profit type, cost-type and intermediate-type, respectively. Then, we calculate the local degree of satisfaction (LDS) of each object when PTs exists, in order to adjust the initial decision target to make up new decision table. Later, by weighting the criteria reaching the DM's degree of satisfaction (DS) along with information aggregation algorithm, we obtain the overall satisfaction …
An Efficient Two Sample Capture-Recapture Model With High Recaptures,
2013
Department of Statistics and Operations Research, Modibbo Adama University of Technology Yola
An Efficient Two Sample Capture-Recapture Model With High Recaptures, Danjuma Jibasen, Yusuf J. Adams
CBN Journal of Applied Statistics (JAS)
This paper proposed an efficient two sample capture-recapture model (Ma) with high recaptures and compared it with the existing models like the model of no factor effect (Mo), behavioral response model (Mb) and the Petersen model (Ms), using simulated data. We found that the Petersen model provides a better estimate of the population size when the observations follow a hypergeometric distribution and the population is overestimated when recapture is high. It was also found that the proposed model provides a better estimator of the population size than the existing ones when the recapture is high. This model is particularly useful …
Investigating Chaos In The Nigerian Asset And Resource Management (Arm) Discovery Fund,
2013
Condensed Matter and Statistical Physics Research Group Department of Physics
Investigating Chaos In The Nigerian Asset And Resource Management (Arm) Discovery Fund, Ibiyinka A. Fuwape, Samuel T. Ogunjo
CBN Journal of Applied Statistics (JAS)
This paper investigates chaos in a Nigerian mutual fund, Asset and Resource Management Company Limited (ARM) for a period of eleven years. The existence of chaotic signals in the data was identified by the reconstruction of the phase space of the daily closing price of the fund and the delay time was quantified using mutual information function and the embedding dimension by the false nearest neighbours, where the values were identified to be 15 and 20 respectively. The presence of chaotic signals in the ARM data was further confirmed by the correlation dimension method which yielded a dimension of 2.2 …
Modeling The Nigerian Inflation Rates Using Periodogram And Fourier Series Analysis,
2013
Department of Statistics, Michael Okpara University of Agriculture, Umudike, Abia State, Nigeria
Modeling The Nigerian Inflation Rates Using Periodogram And Fourier Series Analysis, Chukwuemeka O. Omekara,, Emmanuel J. Ekpenyong, Micheal P. Ekerete
CBN Journal of Applied Statistics (JAS)
This work considers the application of Periodogram and Fourier Series Analysis to model all-items monthly inflation rates in Nigeria from 2003 to 2011. The main objectives are to identify inflation cycles, fit a suitable model to the data and make forecasts of future values. To achieve these objectives, monthly all-items inflation rates for the period were obtained from the Central Bank of Nigeria (CBN) website. Periodogram and Fourier series methods of analysis are used to analyze the data. Based on the analysis, it was found that inflation cycle within the period was fifty one (51) months, which coincides with the …
Nigerian Stock Index: A Search For Optimal Garch Model Using High Frequency Data,
2013
University of Ibadan
Nigerian Stock Index: A Search For Optimal Garch Model Using High Frequency Data, Olaoluwa Simon Yaya
CBN Journal of Applied Statistics (JAS)
This paper attempts to fit the best Generalized Autoregressive Conditional Heteroscedastic (GARCH) model for All Share Index (ASI) of Nigerian Stock Exchange (NSE) returns. A search is made on various GARCH variants specified on the assumptions of stationarity and asymmetry. Fractionally integrated types are also considered to capture the possibility of return series having property of long range dependency. The parameter estimations are carried out on the assumptions of normality and non-normality of GARCH innovations, with models and forecasts evaluated using information criteria and loss functions respectively. Under normality assumption, Hyperbolic GARCH (HYGARCH(1,d,1)) model is selected and Integrated GARCH (IGARCH(1,1)) …
Time Series Modeling Of Nigeria External Reserves,
2013
Department of Statistics, Federal University of Technology Owerri
Time Series Modeling Of Nigeria External Reserves, Iheanyichukwu S. Iwueze, Eleazar C. Nwogu, Valentine U. Nlebedim
CBN Journal of Applied Statistics (JAS)
This paper discusses the levels and trend of external reserves in Nigeria. The relevance of this lies in the fact that it could help to monitor the reserves and throw early warning signal about any economic crisis. Monthly data on Nigeria external reserves for the period January 1999 to December, 2008 derived from the 2008 CBN Statistical Bulletin was analyzed using ARIMA model. Results of the analyses show that (i) the data requires logarithmic transformation to stabilize the variance and make the distribution normal (ii) the appropriate model that best describes the pattern in the transformed data is the Autoregressive- …
A Markov Decision Process Approach To Optimal Control Of A Multi-Level Hierarchical Manpower System,
2013
Department of Statistics, University of Nigeria, Nsukka, Enugu State, Nigeria.
A Markov Decision Process Approach To Optimal Control Of A Multi-Level Hierarchical Manpower System, Akaninyene U. Udom
CBN Journal of Applied Statistics (JAS)
A recurrent problem in manpower control is how to attain the desired structural configuration in an optimal way, since it is possible to reach a desired structural configuration using different control inputs. The major aim of this paper is to develop a Markov Decision Process for optimal control of a Multi-level Hierarchical Manpower System (MHMS) by promotion and interdepartmental transfers. This is examined under control by intervention and contraction cost Markov Decision Process.
Adaptive Regret Minimization In Bounded-Memory Games,
2013
Singapore Management University
Adaptive Regret Minimization In Bounded-Memory Games, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha
Research Collection School Of Computing and Information Systems
Organizations that collect and use large volumes of personal information often use security audits to protect data subjects from inappropriate uses of this information by authorized insiders. In face of unknown incentives of employees, a reasonable audit strategy for the organization is one that minimizes its regret. While regret minimization has been extensively studied in repeated games, the standard notion of regret for repeated games cannot capture the complexity of the interaction between the organization (defender) and an adversary, which arises from dependence of rewards and actions on history. To account for this generality, we introduce a richer class of …
Getting It Right The First Time: Robot Mission Guarantees In The Presence Of Uncertainty,
2013
Fordham University
Getting It Right The First Time: Robot Mission Guarantees In The Presence Of Uncertainty, Damian Lyons, Ron Arkin, Paramesh Nirmal, Shu Jiang, Tsung-Ming Liu, Julia Deeb
Faculty Publications
Abstract—Certain robot missions need to perform predictably in a physical environment that may only be poorly characterized in advance. We have previously developed an approach to establishing performance guarantees for behavior-based controllers in a process-algebra framework. We extend that work here to include random variables, and we show how our prior results can be used to generate a Dynamic Bayesian Network for the coupled system of program and environment model. Verification is reduced to a filtering problem for this network. Finally, we present validation results that demonstrate the effectiveness of the verification of a multiple waypoint robot mission using this …
Symmetry Robust Descriptor For Non-Rigid Surface Matching,
2013
Singapore Management University
Symmetry Robust Descriptor For Non-Rigid Surface Matching, Zhiyuan Zhang, Kangkang Yin, Kelvin W. C. Foong
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel shape descriptor that is robust in differentiating intrinsic symmetric points on geometric surfaces. Our motivation is that even the state-of-theart shape descriptors and non-rigid surface matching algorithms suffer from symmetry flips. They cannot differentiate surface points that are symmetric or near symmetric. Hence a left hand of one human model may be matched to a right hand of another. Our Symmetry Robust Descriptor (SRD) is based on a signed angle field, which can be calculated from the gradient fields of the harmonic fields of two point pairs. Experiments show that the proposed shape …
Budgeted Personalized Incentive Approaches For Smoothing Congestion In Resource Networks,
2013
Singapore Management University
Budgeted Personalized Incentive Approaches For Smoothing Congestion In Resource Networks, Pradeep Varakantham, Na Fu, William Yeoh, Shih-Fen Cheng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Congestion occurs when there is competition for resources by sel sh agents. In this paper, we are concerned with smoothing out congestion in a network of resources by using personalized well-timed in- centives that are subject to budget constraints. To that end, we provide: (i) a mathematical formulation that computes equilibrium for the re- source sharing congestion game with incentives and budget constraints; (ii) an integrated approach that scales to larger problems by exploiting the factored network structure and approximating the attained equilib- rium; (iii) an iterative best response algorithm for solving the uncon- strained version (no budget) of the …
Optimization Approaches For Solving Chance Constrained Stochastic Orienteering Problems,
2013
Singapore Management University
Optimization Approaches For Solving Chance Constrained Stochastic Orienteering Problems, Pradeep Varakantham, Akshat Kumar
Research Collection School Of Computing and Information Systems
Orienteering problems (OPs) are typically used to model routing and trip planning problems. OP is a variant of the well known traveling salesman problem where the goal is to compute the highest reward path that includes a subset of nodes and has an overall travel time less than the specified deadline. Stochastic orienteering problems (SOPs) extend OPs to account for uncertain travel times and are significantly harder to solve than deterministic OPs. In this paper, we contribute a scalable mixed integer LP formulation for solving risk aware SOPs, which is a principled approximation of the underlying stochastic optimization problem. Empirically, …
Genetic Algorithm Based Model In Text Steganography,
2013
University of Nairobi
Genetic Algorithm Based Model In Text Steganography, Christine K. Mulunda, Peter W. Wagacha, Alfayo O. Adede
The African Journal of Information Systems
Steganography is an ancient art. It is used for security in open systems. It focuses on hiding secret messages inside a cover medium. The most important property of a cover medium is the amount of data that can be stored inside it without changing its noticeable properties. There are many sophisticated techniques with which to hide, analyze, and recover that hidden information. This paper discusses an exploration in the use of Genetic Algorithm operators on the cover medium. We worked with text as the cover medium with the aim of increasing robustness and capacity of hidden data. Elitism is used …
Computing The Grounded Semantics In All The Subgraphs Of An Argumentation Framework: An Empirical Evaluation,
2013
Technological University Dublin
Computing The Grounded Semantics In All The Subgraphs Of An Argumentation Framework: An Empirical Evaluation, Pierpaolo Dondio
Articles
Given an argumentation framework – with a finite set of arguments and the attack relation identifying the graph – we study how the grounded labelling of a generic argument a varies in all the subgraphs of . Since this is an intractable problem of above-polynomial complexity, we present two non-naïve algorithms to find the set of all the subgraphs where the grounded semantic assigns to argument a specific label . We report the results of a series of empirical tests over graphs of increasing complexity. The value of researching the above problem is two-fold. First, knowing how an argument behaves …
An Analysis Of Post-Selection In Automatic Configuration,
2013
Singapore Management University
An Analysis Of Post-Selection In Automatic Configuration, Zhi Yuan, Thomas St\303\274tzle, Marco A. Montes De Oca, Hoong Chuin Lau, Mauro Birattari
Research Collection School Of Computing and Information Systems
Automated algorithm configuration methods have proven to be instrumental in deriving high-performing algorithms and such methods are increasingly often used to configure evolutionary algorithms. One major challenge in devising automatic algorithm configuration techniques is to handle the inherent stochasticity in the configuration problems. This article analyses a post-selection mechanism that can also be used for this task. The central idea of the post-selection mechanism is to generate in a first phase a set of high-quality candidate algorithm configurations and then to select in a second phase from this candidate set the (statistically) best configuration. Our analysis of this mechanism indicates …
Audit Games,
2013
Singapore Management University
Audit Games, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha
Research Collection School Of Computing and Information Systems
Effective enforcement of laws and policies requires expending resources to prevent and detect offenders, as well as appropriate punishment schemes to deter violators. In particular, enforcement of privacy laws and policies in modern organizations that hold large volumes of personal information (e.g., hospitals, banks) relies heavily on internal audit mechanisms. We study economic considerations in the design of these mechanisms, focusing in particular on effective resource allocation and appropriate punishment schemes. We present an audit game model that is a natural generalization of a standard security game model for resource allocation with an additional punishment parameter. Computing the Stackelberg equilibrium …
Gesture-Based Robot Path Shaping,
2013
Clemson University
Gesture-Based Robot Path Shaping, Paul Yanik
All Dissertations
For many individuals, aging is frequently associated with diminished mobility and dexterity. Such decreases may be accompanied by a loss of independence, increased burden to caregivers, or institutionalization. It is foreseen that the ability to retain independence and quality of life as one ages will increasingly depend on environmental sensing and robotics which facilitate aging in place. The development of ubiquitous sensing strategies in the home underpins the promise of adaptive services, assistive robotics, and architectural design which would support a person's ability to live independently as they age. Instrumentation (sensors and processing) which is capable of recognizing the actions …
Traveltant: Social Interaction Based Personalized Recommendation System,
2013
University of Arkansas, Fayetteville
Traveltant: Social Interaction Based Personalized Recommendation System, Sultan Dawood Alfarhood
Graduate Theses and Dissertations
Trip planning is a time consuming task that most people do before going to any destination. Traveltant is an intelligent system that analyzes a user's Social network and suggests a complete trip plan detailed for every single day based on the user's interests extracted from the Social network. Traveltant also considers the interests of friends the user interacts with most by building a ranked friends list of interactivity, and then uses the interests of those people in this list to enrich the recommendation results. Traveltant provides a smooth user interface through a Windows Phone 7 application while doing most of …
