Open Access. Powered by Scholars. Published by Universities.®
Artificial Intelligence and Robotics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (360)
- Engineering (296)
- Operations Research, Systems Engineering and Industrial Engineering (256)
- Business (177)
- Graphics and Human Computer Interfaces (176)
-
- Social and Behavioral Sciences (173)
- Software Engineering (137)
- Numerical Analysis and Scientific Computing (112)
- Theory and Algorithms (103)
- Public Affairs, Public Policy and Public Administration (75)
- Transportation (63)
- Programming Languages and Compilers (62)
- Information Security (43)
- Medicine and Health Sciences (43)
- Technology and Innovation (38)
- OS and Networks (37)
- Education (36)
- Law (36)
- Asian Studies (35)
- Computer Engineering (35)
- International and Area Studies (35)
- Health Information Technology (30)
- Science and Technology Law (22)
- Psychology (21)
- Library and Information Science (20)
- Finance and Financial Management (18)
- Higher Education (18)
- Keyword
-
- Artificial intelligence (99)
- Machine learning (55)
- Reinforcement learning (42)
- Deep learning (38)
- Artificial Intelligence (30)
-
- Large Language Models (30)
- Generative AI (29)
- Large language models (24)
- ChatGPT (23)
- Large Language Model (23)
- Singapore (22)
- Computer vision (19)
- Large language model (18)
- Optimization (18)
- Reinforcement Learning (18)
- Scheduling (18)
- Anomaly detection (17)
- Natural language processing (17)
- Deep reinforcement learning (16)
- Deep Learning (15)
- LLMs (15)
- Machine Learning (15)
- Vehicle routing problem (15)
- AI (14)
- Neural networks (13)
- Uncertainty (13)
- Software engineering (12)
- Graph neural networks (11)
- Metaverse (10)
- Multi-agent systems (10)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (1664)
- Dissertations and Theses Collection (Open Access) (57)
- Research Collection Lee Kong Chian School Of Business (33)
- Research Collection Yong Pung How School Of Law (31)
- Research Collection School of Social Sciences (22)
-
- Asian Management Insights (16)
- FORCE 2026 (14)
- Perspectives@SMU (11)
- Research Collection College of Integrative Studies (10)
- Research Collection Library (8)
- PhD Student’s Publications Collection (6)
- MITB Thought Leadership Series (4)
- 2024 AI for Research Week (3)
- CCX Research (3)
- LARC Research Publications (2)
- Research Collection School Of Accountancy (2)
- CASTLe: Collection of Articles on Scholarship for Teaching and Learning (1)
- Centre for AI & Data Governance (2019-2025) (1)
- Centre for Computational Law (2022-2025) (1)
- ROSA Journal Articles and Publications (1)
- Research Collection Office of Research (1)
- Research Collection School Of Economics (1)
- Research@SMU Infographics (1)
- Research@SMU: Connecting the Dots (1)
- SMU Press Releases and News (1)
- Sim Kee Boon Institute for Financial Economics (1)
- Student Publications (1)
- Publication Type
- File Type
Articles 1201 - 1230 of 1897
Full-Text Articles in Artificial Intelligence and Robotics
Mmconv: An Environment For Multimodal Conversational Search Across Multiple Domains, Lizi Liao, Le Hong Long, Zheng Zhang, Minlie Huang, Tat-Seng Chua
Mmconv: An Environment For Multimodal Conversational Search Across Multiple Domains, Lizi Liao, Le Hong Long, Zheng Zhang, Minlie Huang, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Although conversational search has become a hot topic in both dialogue research and IR community, the real breakthrough has been limited by the scale and quality of datasets available. To address this fundamental obstacle, we introduce the Multimodal Multi-domain Conversational dataset (MMConv), a fully annotated collection of human-to-human role-playing dialogues spanning over multiple domains and tasks. The contribution is two-fold. First, beyond the task-oriented multimodal dialogues among user and agent pairs, dialogues are fully annotated with dialogue belief states and dialogue acts. More importantly, we create a relatively comprehensive environment for conducting multimodal conversational search with real user settings, structured …
How Important Is The Train-Validation Split In Meta-Learning?, Yu Bai, Minshuo Chen, Pan Zhou, Tuo Zhao, D. Jason Lee, Sham Kakade, Huan Wang, Caiming Xiong
How Important Is The Train-Validation Split In Meta-Learning?, Yu Bai, Minshuo Chen, Pan Zhou, Tuo Zhao, D. Jason Lee, Sham Kakade, Huan Wang, Caiming Xiong
Research Collection School Of Computing and Information Systems
Meta-learning aims to perform fast adaptation on a new task through learning a “prior” from multiple existing tasks. A common practice in meta-learning is to perform a train-validation split (train-val method) where the prior adapts to the task on one split of the data, and the resulting predictor is evaluated on another split. Despite its prevalence, the importance of the train-validation split is not well understood either in theory or in practice, particularly in comparison to the more direct train-train method, which uses all the pertask data for both training and evaluation. We provide a detailed theoretical study on whether …
Task Similarity Aware Meta Learning: Theory-Inspired Improvement On Maml, Pan Zhou, Yingtian Zpu, Xiaotong Yuan, Jiashi Feng, Caiming Xiong, Steven C. H. Hoi
Task Similarity Aware Meta Learning: Theory-Inspired Improvement On Maml, Pan Zhou, Yingtian Zpu, Xiaotong Yuan, Jiashi Feng, Caiming Xiong, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Few-shot learning ability is heavily desired for machine intelligence. By meta-learning a model initialization from training tasks with fast adaptation ability to new tasks, model-agnostic meta-learning (MAML) has achieved remarkable success in a number of few-shot learning applications. However, theoretical understandings on the learning ability of MAML remain absent yet, hindering developing new and more advanced meta learning methods in a principled way. In this work, we solve this problem by theoretically justifying the fast adaptation capability of MAML when applied to new tasks. Specifically, we prove that the learnt meta-initialization can benefit the fast adaptation to new tasks with …
Oesense: Employing Occlusion Effect For In-Ear Human Sensing, Dong Ma, Andrea Ferlini, Cecilia Mascolo
Oesense: Employing Occlusion Effect For In-Ear Human Sensing, Dong Ma, Andrea Ferlini, Cecilia Mascolo
Research Collection School Of Computing and Information Systems
Smart earbuds are recognized as a new wearable platform for personal-scale human motion sensing. However, due to the interference from head movement or background noise, commonly-used modalities (e.g. accelerometer and microphone) fail to reliably detect both intense and light motions. To obviate this, we propose OESense, an acoustic-based in-ear system for general human motion sensing. The core idea behind OESense is the joint use of the occlusion effect (i.e., the enhancement of low-frequency components of bone-conducted sounds in an occluded ear canal) and inward-facing microphone, which naturally boosts the sensing signal and suppresses external interference. We prototype OESense as an …
Constraint Answer Set Programming As A Tool To Improve Legislative Drafting, Jason Morris
Constraint Answer Set Programming As A Tool To Improve Legislative Drafting, Jason Morris
Centre for Computational Law (2022-2025)
Rules as Code" in this paper is used to refer to a proposed methodology of legislative and regulatory drafting.1 That legislation can be represented in declarative code for automation has long been recognized [6], as has the opportunity for improving the quality of legal drafting with the techniques of formal representation.
Grand-Vision: An Intelligent System For Optimized Deployment Scheduling Of Law Enforcement Agents, Jonathan Chase, Tran Phong, Kang Long, Tony Le, Hoong Chuin Lau
Grand-Vision: An Intelligent System For Optimized Deployment Scheduling Of Law Enforcement Agents, Jonathan Chase, Tran Phong, Kang Long, Tony Le, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Law enforcement agencies in dense urban environments, faced with a wide range of incidents to handle and limited manpower, are turning to data-driven AI to inform their policing strategy. In this paper we present a patrol scheduling system called GRAND-VISION: Ground Response Allocation and Deployment - Visualization, Simulation, and Optimization. The system employs deep learning to generate incident sets that are used to train a patrol schedule that can accommodate varying manpower, break times, manual pre-allocations, and a variety of spatio-temporal demand features. The complexity of the scenario results in a system with real world applicability, which we demonstrate through …
Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau
Coordinating Multi-Party Vehicle Routing With Location Congestion Via Iterative Best Response, Waldy Joe, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This work is motivated by a real-world problem of coordinating B2B pickup-delivery operations to shopping malls involving multiple non-collaborative Logistics Service Providers (LSPs) in a congested city where space is scarce. This problem can be categorized as a Vehicle Routing Problem with Pickup and Delivery, Time Windows and Location Congestion with multiple LSPs (or ML-VRPLC in short), and we propose a scalable, decentralized, coordinated planning approach via iterative best response. We formulate the problem as a strategic game where each LSP is a self-interested agent but is willing to participate in a coordinated planning as long as there are sufficient …
Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan
Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan
Research Collection School Of Computing and Information Systems
This research introduces an extension of the Orienteering Problem (OP), known as Set Team Orienteering Problem with Time Windows (STOPTW), in which customers are first grouped into clusters. Each cluster is associated with a profit that will be collected if at least one customer within the cluster is visited. The objective is to find the best route that maximizes the total collected profit without violating time windows and time budget constraints. We propose an adaptive large neighborhood search algorithm to solve newly introduced benchmark instances. The preliminary results show the capability of the proposed algorithm to obtain good solutions within …
Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun
Adaptive Aggregation Networks For Class-Incremental Learning, Yaoyao Liu, Bernt Schiele, Qianru Sun
Research Collection School Of Computing and Information Systems
Class-Incremental Learning (CIL) aims to learn a classification model with the number of classes increasing phase-by-phase. An inherent problem in CIL is the stability-plasticity dilemma between the learning of old and new classes, i.e., high-plasticity models easily forget old classes, but high-stability models are weak to learn new classes. We alleviate this issue by proposing a novel network architecture called Adaptive Aggregation Networks (AANets) in which we explicitly build two types of residual blocks at each residual level (taking ResNet as the baseline architecture): a stable block and a plastic block. We aggregate the output feature maps from these two …
Counterfactual Zero-Shot And Open-Set Visual Recognition, Zhongqi Yue, Tan Wang, Qianru Sun, Xian-Sheng Hua, Hanwang Zhang
Counterfactual Zero-Shot And Open-Set Visual Recognition, Zhongqi Yue, Tan Wang, Qianru Sun, Xian-Sheng Hua, Hanwang Zhang
Research Collection School Of Computing and Information Systems
We present a novel counterfactual framework for both Zero-Shot Learning (ZSL) and Open-Set Recognition (OSR), whose common challenge is generalizing to the unseen-classes by only training on the seen-classes. Our idea stems from the observation that the generated samples for unseen-classes are often out of the true distribution, which causes severe recognition rate imbalance between the seen-class (high) and unseen-class (low). We show that the key reason is that the generation is not Counterfactual Faithful, and thus we propose a faithful one, whose generation is from the sample-specific counterfactual question: What would the sample look like, if we set its …
Projecting Your View Attentively: Monocular Road Scene Layout Estimation Via Cross-View Transformation, Weixiang Yang, Qi Li, Wenxi Liu, Yuanlong Yu, Yuexin Ma, Shengfeng He, Jia Pan
Projecting Your View Attentively: Monocular Road Scene Layout Estimation Via Cross-View Transformation, Weixiang Yang, Qi Li, Wenxi Liu, Yuanlong Yu, Yuexin Ma, Shengfeng He, Jia Pan
Research Collection School Of Computing and Information Systems
HD map reconstruction is crucial for autonomous driving. LiDAR-based methods are limited due to the deployed expensive sensors and time-consuming computation. Camera-based methods usually need to separately perform road segmentation and view transformation, which often causes distortion and the absence of content. To push the limits of the technology, we present a novel framework that enables reconstructing a local map formed by road layout and vehicle occupancy in the bird's-eye view given a front-view monocular image only. In particular, we propose a cross-view transformation module, which takes the constraint of cycle consistency between views into account and makes full use …
When Program Analysis Meets Bytecode Search: Targeted And Efficient Inter-Procedural Analysis Of Modern Android Apps In Backdroid, Daoyuan Wu, Debin Gao, Robert H. Deng, Rocky Chang
When Program Analysis Meets Bytecode Search: Targeted And Efficient Inter-Procedural Analysis Of Modern Android Apps In Backdroid, Daoyuan Wu, Debin Gao, Robert H. Deng, Rocky Chang
Research Collection School Of Computing and Information Systems
Widely-used Android static program analysis tools,e.g., Amandroid and FlowDroid, perform the whole-app interprocedural analysis that is comprehensive but fundamentallydifficult to handle modern (large) apps. The average app size hasincreased three to four times over five years. In this paper, weexplore a new paradigm of targeted inter-procedural analysis thatcan skip irrelevant code and focus only on the flows of securitysensitive sink APIs. To this end, we propose a technique calledon-the-fly bytecode search, which searches the disassembled appbytecode text just in time when a caller needs to be located. In thisway, it guides targeted (and backward) inter-procedural analysisstep by step until reaching …
Engaging Drivers Via Competition: A Case Study With Arena, Hao Cheng, Shuyu Wei, Lingyu Zhang, Zimu Zhou, Yongxin. Tong
Engaging Drivers Via Competition: A Case Study With Arena, Hao Cheng, Shuyu Wei, Lingyu Zhang, Zimu Zhou, Yongxin. Tong
Research Collection School Of Computing and Information Systems
Sustained work enthusiasms of drivers are crucial for the success of large-scale ride-hailing platforms. In this paper, we conduct the first-of-its-kind exploration to encourage active participation of drivers via competition. We design Arena, a competition where drivers compete for prizes via completing more trips. Through a pilot study covering over 2,600 participants, we uncover the easy-win problem, an overlooked and serious issue in competition design for real-world drivers. It refers to situations where one competitor does not show up during competition whereas the other easily wins. To solve the easy-win problem without impairing motivation of drivers, we devise a novel …
Sequence-To-Sequence Learning For Automated Software Artifact Generation, Zhongxin Liu, Xin Xia, David Lo
Sequence-To-Sequence Learning For Automated Software Artifact Generation, Zhongxin Liu, Xin Xia, David Lo
Research Collection School Of Computing and Information Systems
During the development and maintenance of a software system, developers produce many digital artifacts besides source code, e.g., requirement documents, code comments, change history, bug reports, etc. Such artifacts are valuable for developers to understand and maintain the software system. However, creating software artifacts can be burdensome and developers sometimes neglect to write and maintain important artifacts. This problem can be alleviated by software artifact generation tools, which can assist developers in creating software artifacts and automatically generate artifacts to replace existing empty ones. The focus of this chapter is automated software artifact generation (hereon, SAG) using seq2seq learning. This …
A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method For Efficient Optimization And Generalization, Pan Zhou, Xiao-Tong Yuan, Lin Zhouchen, Steven C. H. Hoi
A Hybrid Stochastic-Deterministic Minibatch Proximal Gradient Method For Efficient Optimization And Generalization, Pan Zhou, Xiao-Tong Yuan, Lin Zhouchen, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Despite the success of stochastic variance-reduced gradient (SVRG) algorithms in solving large-scale problems, their stochastic gradient complexity often scales linearly with data size and is expensive for huge data. Accordingly, we propose a hybrid stochastic-deterministic minibatch proximal gradient (HSDMPG) algorithm for strongly convex problems with linear prediction structure, e.g. least squares and logistic/softmax regression. HSDMPG enjoys improved computational complexity that is data-size-independent for large-scale problems. It iteratively samples an evolving minibatch of individual losses to estimate the original problem, and can efficiently minimize the sampled subproblems. For strongly convex loss of n components, HSDMPG attains an -optimization-error within O κ …
Why Do Robots Have Smiley Faces?, Mark Findlay
Why Do Robots Have Smiley Faces?, Mark Findlay
Research Collection Yong Pung How School Of Law
The author discussed why engineers and designers provide machines with the semblance of friendliness, and why it takes more than that for humans to trust AI. The ground-breaking AI in community research and policy initiative by CAIDG, supported by the National Research Foundation Singapore under its Emerging Areas Research Projects Funding Initiative, seeks to understand how and why trust can be established when humans and machines come together.
Learning Contextual Causality Between Daily Events From Time-Consecutive Images, Hongming Zhang, Yintong Huo, Xinran Zhao, Yangqiu Song, Dan Roth
Learning Contextual Causality Between Daily Events From Time-Consecutive Images, Hongming Zhang, Yintong Huo, Xinran Zhao, Yangqiu Song, Dan Roth
Research Collection School Of Computing and Information Systems
Conventional textual-based causal knowledge acquisition methods typically require laborious and expensive human annotations. As a result, their scale is often limited. Moreover, as no context is provided during the annotation, the resulting causal knowledge records (e.g., ConceptNet) typically do not consider the context. In this paper, we move out of the textual domain to explore a more scalable way of acquiring causal knowledge and investigate the possibility of learning contextual causality from the visual signal. Specifically, we first propose a high-quality dataset Vis-Causal and then conduct experiments to demonstrate that with good language and visual representations, it is possible to …
Working With Smart Machines: Insights On The Future Of Work, Thomas H. Davenport, Steven M. Miller
Working With Smart Machines: Insights On The Future Of Work, Thomas H. Davenport, Steven M. Miller
Research Collection School Of Computing and Information Systems
In this article, we share our observations on how and why AI-based systems are being deployed. We look at how these systems have been integrated into existing and new work processes, especially the implications for the changing nature of work and how it will be conducted in future with AI-based smart machines. This will help companies that are in the earlier stages of considering, planning, or deploying these systems to know what to expect from recent developments in practice. We draw our analysis from 24 case studies that we have recently completed on AI system usage in actual operational settings.
A Smarter Way To Manage Mass Transit In A Smart City: Rail Network Management At Singapore’S Land Transport Authority, Steven M. Miller, Thomas H. Davenport
A Smarter Way To Manage Mass Transit In A Smart City: Rail Network Management At Singapore’S Land Transport Authority, Steven M. Miller, Thomas H. Davenport
Research Collection School Of Computing and Information Systems
There is no widely agreed upon definition of a supposed “Smart City.” Yet, when you see city employees — in this case city-state employees — working in what are obviously smarter ways, “you know it when you see it.” One such example of a smarter way to work in a smart city setting is the way that employees of the Land Transport Authority (LTA) in Singapore are using a new generation of data driven, AI-enabled support systems to manage the city’s urban rail network. We spoke to LTA officers Kong Wai, Ho (Director of Integrated Operations and Planning) and Chris …
Approximate Difference Rewards For Scalable Multigent Reinforcement Learning, Arambam James Singh, Akshat Kumar, Hoong Chuin Lau
Approximate Difference Rewards For Scalable Multigent Reinforcement Learning, Arambam James Singh, Akshat Kumar, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We address the problem ofmultiagent credit assignment in a large scale multiagent system. Difference rewards (DRs) are an effective tool to tackle this problem, but their exact computation is known to be challenging even for small number of agents. We propose a scalable method to compute difference rewards based on aggregate information in a multiagent system with large number of agents by exploiting the symmetry present in several practical applications. Empirical evaluation on two multiagent domains - air-traffic control and cooperative navigation, shows better solution quality than previous approaches.
A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
A Matheuristic Algorithm For The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
This paper studies the integration of the vehicle routing problem with cross-docking (VRPCD). The aim is to find a set of routes to deliver products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic based on column generation is proposed. The first phase focuses on generating a set of feasible candidate routes in both pickup and delivery processes by implementing an adaptive large neighborhood search algorithm. A set of destroy and repair operators are …
Edgeduet: Tiling Small Object Detection For Edge Assisted Autonomous Mobile Vision, Xu Wang, Zheng Yang, Jiahang Wu, Yi Zhao, Zimu Zhou
Edgeduet: Tiling Small Object Detection For Edge Assisted Autonomous Mobile Vision, Xu Wang, Zheng Yang, Jiahang Wu, Yi Zhao, Zimu Zhou
Research Collection School Of Computing and Information Systems
Accurate, real-time object detection on resource-constrained devices enables autonomous mobile vision applications such as traffic surveillance, situational awareness, and safety inspection, where it is crucial to detect both small and large objects in crowded scenes. Prior studies either perform object detection locally on-board or offload the task to the edge/cloud. Local object detection yields low accuracy on small objects since it operates on low-resolution videos to fit in mobile memory. Offloaded object detection incurs high latency due to uploading high-resolution videos to the edge/cloud. Rather than either pure local processing or offloading, we propose to detect large objects locally while …
Learning Index Policies For Restless Bandits With Application To Maternal Healthcare, Arpita Biswas, Gaurav Aggarwal, Pradeep Varakantham, Milind Tambe
Learning Index Policies For Restless Bandits With Application To Maternal Healthcare, Arpita Biswas, Gaurav Aggarwal, Pradeep Varakantham, Milind Tambe
Research Collection School Of Computing and Information Systems
In many community health settings, it is crucial to have a systematic monitoring and intervention process to ensure that the patients adhere to healthcare programs, such as periodic health checks or taking medications. When these interventions are expensive, they can be provided to only a fixed small fraction of the patients at any period of time. Hence, it is important to carefully choose the beneficiaries who should be provided with interventions and when. We model this scenario as a restless multi-armed bandit (RMAB) problem, where each beneficiary is assumed to transition from one state to another depending on the intervention …
A Differential Testing Approach For Evaluating Abstract Syntax Tree Mapping Algorithms, Yuanrui Fan, Xin Xia, David Lo, Ahmed E. Hassan, Yuan Wang, Shanping Li
A Differential Testing Approach For Evaluating Abstract Syntax Tree Mapping Algorithms, Yuanrui Fan, Xin Xia, David Lo, Ahmed E. Hassan, Yuan Wang, Shanping Li
Research Collection School Of Computing and Information Systems
Abstract syntax tree (AST) mapping algorithms are widely used to analyze changes in source code. Despite the foundational role of AST mapping algorithms, little effort has been made to evaluate the accuracy of AST mapping algorithms, i.e., the extent to which an algorithm captures the evolution of code. We observe that a program element often has only one best-mapped program element. Based on this observation, we propose a hierarchical approach to automatically compare the similarity of mapped statements and tokens by different algorithms. By performing the comparison, we determine if eachof the compared algorithms generates inaccurate mappings for a statement …
Unveiling The Mystery Of Api Evolution In Deep Learning Frameworks: A Case Study Of Tensorflow 2, Zejun Zhang, Yanming Yang, Xin Xia, David Lo, Xiaoxue Ren, John C. Grundy
Unveiling The Mystery Of Api Evolution In Deep Learning Frameworks: A Case Study Of Tensorflow 2, Zejun Zhang, Yanming Yang, Xin Xia, David Lo, Xiaoxue Ren, John C. Grundy
Research Collection School Of Computing and Information Systems
API developers have been working hard to evolve APIs to provide more simple, powerful, and robust API libraries. Although API evolution has been studied for multiple domains, such as Web and Android development, API evolution for deep learning frameworks has not yet been studied. It is not very clear how and why APIs evolve in deep learning frameworks, and yet these are being more and more heavily used in industry. To fill this gap, we conduct a large-scale and in-depth study on the API evolution of Tensorflow 2, which is currently the most popular deep learning framework. We first extract …
Ship-Gan: Generative Modeling Based Maritime Traffic Simulator, Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar
Ship-Gan: Generative Modeling Based Maritime Traffic Simulator, Chaithanya Basrur, Arambam James Singh, Arunesh Sinha, Akshat Kumar
Research Collection School Of Computing and Information Systems
Modeling vessel movement in a maritime environment is an extremely challenging task given the complex nature of vessel behavior. Several existing multiagent maritime decision making frameworks require access to an accurate traffic simulator. We develop a system using electronic navigation charts to generate realistic and high fidelity vessel traffic data using Generative Adversarial Networks (GANs). Our proposed Ship-GAN uses a conditional Wasserstein GAN to model a vessel's behavior. The generator can simulate the travel time of vessels across different maritime zones conditioned on vessels' speeds and traffic intensity. Furthermore, it can be used as an accurate simulator for prior decision …
Dialogue State Tracking With Incremental Reasoning, Lizi Liao, Le Hong Long, Yunshan Ma, Wenqiang Lei, Tat-Seng Chua
Dialogue State Tracking With Incremental Reasoning, Lizi Liao, Le Hong Long, Yunshan Ma, Wenqiang Lei, Tat-Seng Chua
Research Collection School Of Computing and Information Systems
Tracking dialogue states to better interpret user goals and feed downstream policy learning is a bottleneck in dialogue management. Common practice has been to treat it as a problem of classifying dialogue content into a set of pre-defined slot-value pairs, or generating values for different slots given the dialogue history. Both have limitations on considering dependencies that occur on dialogues, and are lacking of reasoning capabilities. This paper proposes to track dialogue states gradually with reasoning over dialogue turns with the help of the back-end data. Empirical results demonstrate that our method outperforms the state-of-theart methods in terms of joint …
Guest Editorial: Non-Iid Outlier Detection In Complex Contexts, Guansong Pang, Fabrizio Angiulli, Mihai Cucuringu, Huan Liu
Guest Editorial: Non-Iid Outlier Detection In Complex Contexts, Guansong Pang, Fabrizio Angiulli, Mihai Cucuringu, Huan Liu
Research Collection School Of Computing and Information Systems
Outlier detection, also known as anomaly detection, aims at identifying data instances that are rare or significantly different from the majority of instances. Due to its significance in many critical domains like cybersecurity, fintech, healthcare, public security, and AI safety, outlier detection has been one of the most active research areas in various communities, such as machine learning, data mining, computer vision, and statistics. Traditional outlier-detection techniques generally assume that data are independent and identically distributed (IID), which are significantly challenged in complex contexts where data are actually non-IID. These contexts are ubiquitous in not only graph data, sequence data, …
Adaptive Operating Hours For Improved Performance Of Taxi Fleets, Rajiv Ranjan Kumar, Pradeep Varakantham, Shih-Fen Cheng
Adaptive Operating Hours For Improved Performance Of Taxi Fleets, Rajiv Ranjan Kumar, Pradeep Varakantham, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
Taxi fleets and car aggregation systems are an important component of the urban public transportation system. Taxis and cars in taxi fleets and car aggregation systems (e.g., Uber) are dependent on a large number of self-controlled and profit-driven taxi drivers, which introduces inefficiencies in the system. There are two ways in which taxi fleet performance can be optimized: (i) Operational decision making: improve assignment of taxis/cars to customers, while accounting for future demand; (ii) strategic decision making: optimize operating hours of (taxi and car) drivers. Existing research has primarily focused on the operational decisions in (i) and we focus on …
Taiger Ai: Saas Bundling And Unbundling, Singapore Management University
Taiger Ai: Saas Bundling And Unbundling, Singapore Management University
Perspectives@SMU
Software companies bundle support services with their products as standard practice. Is it possible to be different…and profitable?