Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- China Simulation Federation (3363)
- Singapore Management University (1081)
- Old Dominion University (333)
- San Jose State University (267)
- MBZUAI (233)
-
- Selected Works (225)
- Western University (160)
- Technological University Dublin (150)
- SelectedWorks (109)
- Air Force Institute of Technology (102)
- City University of New York (CUNY) (94)
- California Polytechnic State University, San Luis Obispo (86)
- Lindenwood University (64)
- University of Arkansas, Fayetteville (62)
- University of Kentucky (62)
- University of Nebraska - Lincoln (59)
- University of South Florida (50)
- Edith Cowan University (46)
- University of Tennessee, Knoxville (43)
- Purdue University (40)
- University of Nevada, Las Vegas (40)
- University of Denver (39)
- Clemson University (38)
- University of Central Florida (37)
- Chinese Academy of Sciences (35)
- Dartmouth College (35)
- New Jersey Institute of Technology (34)
- University of Windsor (33)
- Kennesaw State University (32)
- Portland State University (32)
- Keyword
-
- Machine learning (517)
- Artificial intelligence (467)
- Deep learning (335)
- Machine Learning (298)
- Artificial Intelligence (216)
-
- Deep Learning (173)
- Simulation (152)
- Computer vision (118)
- AI (115)
- Neural networks (113)
- Reinforcement learning (96)
- Robotics (86)
- Optimization (75)
- Natural language processing (68)
- Natural Language Processing (67)
- Classification (64)
- Virtual reality (60)
- Neural network (55)
- Computer Vision (53)
- Neural Networks (53)
- Reinforcement Learning (52)
- Computer Science (49)
- Genetic algorithm (48)
- Modeling (47)
- Algorithms (45)
- Path planning (45)
- ChatGPT (41)
- Numerical simulation (41)
- Scheduling (41)
- Visualization (40)
- Publication Year
- Publication
-
- Journal of System Simulation (3363)
- Research Collection School Of Computing and Information Systems (989)
- Master's Projects (246)
- Theses and Dissertations (145)
- Electronic Thesis and Dissertation Repository (132)
-
- Electronic Theses and Dissertations (115)
- Computer Vision Faculty Publications (98)
- Conference papers (88)
- Machine Learning Faculty Publications (86)
- Marcel Adam Just (78)
- Computer Science Faculty Publications (68)
- Faculty Scholarship (63)
- Master's Theses (60)
- Doctoral Dissertations (53)
- Jeremy Straub (52)
- Faculty Publications (50)
- Dissertations (48)
- Articles (47)
- Electrical & Computer Engineering Faculty Publications (46)
- Natural Language Processing Faculty Publications (46)
- Dissertations, Theses, and Capstone Projects (44)
- Theses and Dissertations--Computer Science (43)
- USF Tampa Graduate Theses and Dissertations (41)
- Publications and Research (36)
- Bulletin of Chinese Academy of Sciences (Chinese Version) (35)
- Electrical & Computer Engineering Theses & Dissertations (32)
- Graduate Theses and Dissertations (31)
- Masters Theses (31)
- Rudolf Kaehr (31)
- Honors Theses (30)
- Publication Type
Articles 7651 - 7680 of 8493
Full-Text Articles in Physical Sciences and Mathematics
Roofsat: Teaching Students Skills For Software Development For Gis Data Collection And Other Activities, Jeremy Straub, Ronald Marsh, Donovan Torgerson, Christoffer Korvald
Roofsat: Teaching Students Skills For Software Development For Gis Data Collection And Other Activities, Jeremy Straub, Ronald Marsh, Donovan Torgerson, Christoffer Korvald
Jeremy Straub
Small Spacecraft provide an excellent platform for the collection of geospatial data. In order to enable the low-cost creation of small remote sensing space-craft in a university environment, a training pathway for students is required. The Realistic Operational Ob-ject for Facilitating Software Assessment and Testing (RoofSat) serves to provide students with experience developing software for a small satellite platform typi-cal of those used for remote sensing missions. It al-lows software to be tested with hardware that re-sponds in a similar manner to that found on the satel-lite for a fraction of the cost of development. This poster details the goals …
Coupling Alignments With Recognition For Still-To-Video Face Recognition, Zhiwu Huang, X. Zhao, S. Shan, R. Wang, X. Chen
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 …
Improving Patient Length-Of-Stay In Emergency Department Through Dynamic Queue Management, Kar Way Tan, Hoong Chuin Lau, Francis Chun Yue Lee
Improving Patient Length-Of-Stay In Emergency Department Through Dynamic Queue Management, Kar Way Tan, Hoong Chuin Lau, Francis Chun Yue Lee
Research Collection School Of Computing and Information Systems
Addressing issue of crowding in an Emergency Department (ED) typically takes the form of process engineering or single-faceted queue management strategies such as demand restriction, queue prioritization or staffing the ED. This work provides an integrated framework to manage queue dynamically from both demand and supply perspectives. More precisely, we introduce intelligent dynamic patient prioritization strategies to manage the demand concurrently with dynamic resource adjustment policies to manage supply. Our framework allows decision-makers to select both the demand-side and supply-side strategies to suit the needs of their ED. We verify through a simulation that such a framework improves the patients' …
An Efficient Partial Shape Matching Algorithm For 3d Tooth Recognition, Zhiyuan Zhang, Xin Zhong, Sim Heng Ong, Kelvin W. C. Foong
An Efficient Partial Shape Matching Algorithm For 3d Tooth Recognition, Zhiyuan Zhang, Xin Zhong, Sim Heng Ong, Kelvin W. C. Foong
Research Collection School Of Computing and Information Systems
As a new biometric strategy, tooth recognition has drawn much attention in recent years. However, most existing work focus mainly on 2D dental radiographs which are less informative and vulnerable to noise and pose variance. Although there are already several attempts on 3D tooth recognition, the results are still inaccurate and performance is inefficient. Moreover, existing methods cannot recognize precisely when the post-mortem data contains incomplete teeth. In this work, we propose an efficient and accurate partial shape matching algorithm to recognize 3D teeth for human identification. Given the ante-mortem and post-mortem teeth models which were taken from patients using …
A Dynamic Programming Approach To Achieving An Optimal End State Along A Serial Production Line, Shih-Fen Cheng, Blake E. Nicholson, Marina A. Epelman, Daniel J. Reaume, Robert L. Smith
A Dynamic Programming Approach To Achieving An Optimal End State Along A Serial Production Line, Shih-Fen Cheng, Blake E. Nicholson, Marina A. Epelman, Daniel J. Reaume, Robert L. Smith
Research Collection School Of Computing and Information Systems
In modern production systems, it is critical to perform maintenance, calibration, installation, and upgrade tasks during planned downtime. Otherwise, the systems become unreliable and new product introductions are delayed. For reasons of safety, testing, and access, task performance often requires the vicinity of impacted equipment to be left in a specific “end state” when production halts. Therefore, planning the shutdown of a production system to balance production goals against enabling non-production tasks yields a challenging optimization problem. In this paper, we propose a mathematical formulation of this problem and a dynamic programming approach that efficiently finds optimal shutdown policies for …
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
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. …
Adaptive Regret Minimization In Bounded-Memory Games, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha
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, Damian Lyons, Ron Arkin, Paramesh Nirmal, Shu Jiang, Tsung-Ming Liu, Julia Deeb
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 …
Characterization Of Extended And Simplified Intelligent Water Drop (Siwd) Approaches And Their Comparison To The Intelligent Water Drop (Iwd) Approach, Jeremy Straub, Eunjin Kim
Characterization Of Extended And Simplified Intelligent Water Drop (Siwd) Approaches And Their Comparison To The Intelligent Water Drop (Iwd) Approach, Jeremy Straub, Eunjin Kim
Jeremy Straub
This paper presents a simplified approach to performing the Intelligent Water Drops (IWD) process. This approach is designed to be comparatively lightweight while approximating the results of the full IWD process. The Simplified Intelligent Water Drops (SIWD) approach is specifically designed for applications where IWD must be run in a computationally limited environment (such as on a robot, UAV or small spacecraft) or where performance speed must be maximized for time sensitive applications. The SWID approach is described and compared and contracted to the base IWD approach.
Symmetry Robust Descriptor For Non-Rigid Surface Matching, Zhiyuan Zhang, Kangkang Yin, Kelvin W. C. Foong
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 …
Optimization Approaches For Solving Chance Constrained Stochastic Orienteering Problems, Pradeep Varakantham, Akshat Kumar
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, …
Budgeted Personalized Incentive Approaches For Smoothing Congestion In Resource Networks, Pradeep Varakantham, Na Fu, William Yeoh, Shih-Fen Cheng, Hoong Chuin Lau
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 …
Mobimed: Framework For Rapid Application Development Of Medical Mobile Apps, Frank Hernadez
Mobimed: Framework For Rapid Application Development Of Medical Mobile Apps, Frank Hernadez
FIU Electronic Theses and Dissertations
In the medical field images obtained from high definition cameras and other medical imaging systems are an integral part of medical diagnosis. The analysis of these images are usually performed by the physicians who sometimes need to spend long hours reviewing the images before they are able to come up with a diagnosis and then decide on the course of action. In this dissertation we present a framework for a computer-aided analysis of medical imagery via the use of an expert system. While this problem has been discussed before, we will consider a system based on mobile devices.
Since the …
Genetic Algorithm Based Model In Text Steganography, Christine K. Mulunda, Peter W. Wagacha, Alfayo O. Adede
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 …
Towards Real-Time, On-Board, Hardware-Supported Sensor And Software Health Management For Unmanned Aerial Systems, Johann Schumann, Kristin Y. Rozier, Thomas Reinbacher, Ole J. Mengshoel, Timmy Mbaya, Corey Ippolito
Towards Real-Time, On-Board, Hardware-Supported Sensor And Software Health Management For Unmanned Aerial Systems, Johann Schumann, Kristin Y. Rozier, Thomas Reinbacher, Ole J. Mengshoel, Timmy Mbaya, Corey Ippolito
Ole J Mengshoel
Reinforcement Learning With Motivations For Realistic Agents, Jacquelyne T. Forgette
Reinforcement Learning With Motivations For Realistic Agents, Jacquelyne T. Forgette
Electronic Thesis and Dissertation Repository
Believable virtual humans have important applications in various fields, including computer based video games. The challenge in programming video games is to produce a non-player controlled character that is autonomous, and capable of action selections that appear human. In this thesis, motivations are used as a basis for learning using reinforcements. With motives driving the decisions of the agents, their actions will appear less structured and repetitious, and more human in nature. This will also allow developers to easily create game agents with specific motivations, based mostly on their narrative purposes. With minimum and maximum desirable motive values, the agents …
Vehicular Instrumentation And Data Processing For The Study Of Driver Intent, Taha Kowsari
Vehicular Instrumentation And Data Processing For The Study Of Driver Intent, Taha Kowsari
Electronic Thesis and Dissertation Repository
The primary goal of this thesis is to provide processed experimental data needed to determine whether driver intentionality and driving-related actions can be predicted from quantitative and qualitative analysis of driver behaviour. Towards this end, an instrumented experimental vehicle capable of recording several synchronized streams of data from the surroundings of the vehicle, the driver gaze with head pose and the vehicle state in a naturalistic driving environment was designed and developed. Several driving data sequences in both urban and rural environments were recorded with the instrumented vehicle. These sequences were automatically annotated for relevant artifacts such as lanes, vehicles …
Computing The Grounded Semantics In All The Subgraphs Of An Argumentation Framework: An Empirical Evaluation, Pierpaolo Dondio
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, Zhi Yuan, Thomas St\303\274tzle, Marco A. Montes De Oca, Hoong Chuin Lau, Mauro Birattari
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 …
Hierarchical Classification And Its Application In University Search, Xiao Li
Hierarchical Classification And Its Application In University Search, Xiao Li
Electronic Thesis and Dissertation Repository
Web search engines have been adopted by most universities for searching webpages in their own domains. Basically, a user sends keywords to the search engine and the search engine returns a flat ranked list of webpages. However, in university search, user queries are usually related to topics. Simple keyword queries are often insufficient to express topics as keywords. On the other hand, most E-commerce sites allow users to browse and search products in various hierarchies. It would be ideal if hierarchical browsing and keyword search can be seamlessly combined for university search engines. The main difficulty is to automatically classify …
Audit Games, Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha
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 …
Online Multi-Stage Deep Architectures For Feature Extraction And Object Recognition, Derek Christopher Rose
Online Multi-Stage Deep Architectures For Feature Extraction And Object Recognition, Derek Christopher Rose
Doctoral Dissertations
Multi-stage visual architectures have recently found success in achieving high classification accuracies over image datasets with large variations in pose, lighting, and scale. Inspired by techniques currently at the forefront of deep learning, such architectures are typically composed of one or more layers of preprocessing, feature encoding, and pooling to extract features from raw images. Training these components traditionally relies on large sets of patches that are extracted from a potentially large image dataset. In this context, high-dimensional feature space representations are often helpful for obtaining the best classification performances and providing a higher degree of invariance to object transformations. …
Gesture-Based Robot Path Shaping, Paul Yanik
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 …
Self-Organizing Cognitive Models For Virtual Agents, Yilin Kang, Ah-Hwee Tan
Self-Organizing Cognitive Models For Virtual Agents, Yilin Kang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Three key requirements of realistic characters or agents in virtual world can be identified as autonomy, interactivity, and personification. Working towards these challenges, this paper proposes a brain inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personification. Based on self-organizing neural models, the agent architecture maintains explicit mental representation of desires, intention, personalities, self-awareness, situation awareness and user awareness. Autonomous behaviors are generated via evaluating the current situation with active goals and learning the most appropriate social or goal-directed rule from the available knowledge, in accordance with the personality of each individual agent. We have built …
Scalable Randomized Patrolling For Securing Rapid Transit Networks, Pradeep Varakantham, Hoong Chuin Lau, Zhi Yuan
Scalable Randomized Patrolling For Securing Rapid Transit Networks, Pradeep Varakantham, Hoong Chuin Lau, Zhi Yuan
Research Collection School Of Computing and Information Systems
Mass Rapid Transit using rail is a popular mode of transport employed by millions of people in many urban cities across the world. Typically, these networks are massive, used by many and thus, can be a soft target for criminals. In this paper, we consider the problem of scheduling randomised patrols for improving security of such rail networks. Similar to existing work in randomised patrols for protecting critical infrastructure, we also employ Stackelberg Games to represent the problem. In solving the Stackelberg games for massive rail networks, we make two key contributions. Firstly, we provide an approach called RaPtoR for …
A Multi-Objective Memetic Algorithm For Vehicle Resource Allocation In Sustainable Transportation Planning, Hoong Chuin Lau, Lucas Agussurja, Shih-Fen Cheng, Pang Jin Tan
A Multi-Objective Memetic Algorithm For Vehicle Resource Allocation In Sustainable Transportation Planning, Hoong Chuin Lau, Lucas Agussurja, Shih-Fen Cheng, Pang Jin Tan
Research Collection School Of Computing and Information Systems
Sustainable supply chain management has been an increasingly important topic of research in recent years. At the strategic level, there are computational models which study supply and distribution networks with environmental considerations. At the operational level, there are, for example, routing and scheduling models which are constrained by carbon emissions. Our paper explores work in tactical planning with regards to vehicle resource allocation from distribution centers to customer locations in a multi-echelon logistics network. We formulate the bi-objective optimization problem exactly and design a memetic algorithm to efficiently derive an approximate Pareto front. We illustrate the applicability of our approach …
Flotra: Flower-Shape Trajectory Mining For Instance-Specific Parameter Tuning, Lindawati Lindawati, Feida Zhu, Hoong Chuin Lau
Flotra: Flower-Shape Trajectory Mining For Instance-Specific Parameter Tuning, Lindawati Lindawati, Feida Zhu, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The performance of a heuristic algorithm is highly dependent on its parameter configuration, yet finding a good parameter configuration is often a time-consuming task. In this paper we propose FloTra, a Flower graph mining for graph search Trajectory pattern extraction for generic instance-specific automated parameter tuning. This algorithm provides efficient extraction of compact and discriminative features of the search trajectory, upon which problem instances are clustered and the corresponding optimal parameter configurations are computed. Experimental evaluations of our approach on the Quadratic Assignment Problem (QAP) show that our approach offers promising improvement over existing parameter tuning algorithms. In this work, …
Interacting Knapsack Problem In Designing Resource Bundles, Truong Huy D. Nguyen, Pradeep Reddy Varakantham, Hoong Chuin Lau, Shih-Fen Cheng
Interacting Knapsack Problem In Designing Resource Bundles, Truong Huy D. Nguyen, Pradeep Reddy Varakantham, Hoong Chuin Lau, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
In many real-life businesses, the service provider/seller keeps a log of the visitors’ behavior as a way to assess the efficiency of the current business/operation model and find room for improvement. For example, by tracking when visitors entering attractions in a theme park, theme park owners can detect when and where congestion may occur, thus having contingency plans to reroute the visitors accordingly. Similarly, a Cable TV service provider can track channel switching events at each household to identify uninteresting channels. Subsequently, the repertoire of channels up for subscription can evolve over time to better serve the entertainment demand of …
Parameter Learning For Latent Network Diffusion, Xiaojian Wu, Akshat Kumar, Daniel Sheldon, Shlomo Zilberstein
Parameter Learning For Latent Network Diffusion, Xiaojian Wu, Akshat Kumar, Daniel Sheldon, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Diffusion processes in networks are increasingly used to model dynamic phenomena such as the spread of information, wildlife, or social influence. Our work addresses the problem of learning the underlying parameters that govern such a diffusion process by observing the time at which nodes become active. A key advantage of our approach is that, unlike previous work, it can tolerate missing observations for some nodes in the diffusion process. Having incomplete observations is characteristic of offline networks used to model the spread of wildlife. We develop an EM algorithm to address parameter learning in such settings. Since both the E …
Improving Patient Length-Of-Stay In Emergency Department Through Dynamic Resource Allocation Policies, Kar Way Tan, Wei Hao Tan, Hoong Chuin Lau
Improving Patient Length-Of-Stay In Emergency Department Through Dynamic Resource Allocation Policies, Kar Way Tan, Wei Hao Tan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this work, we consider the problem of allocating doctors in the ambulatory area of a hospital's emergency department (ED) based on a set of policies. Traditional staffing methods are static, hence do not react well to surges in patient demands. We study strategies that intelligently adjust the number of doctors based on current and historical information about the patient arrival. Our main contribution is our proposed data-driven online approach that performs adaptive allocation by utilizing historical as well as current arrivals by running symbiotic simulation in real-time. We build a simulation prototype that models ED process that is close …