Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Anomaly Detection (2)
- Artificial intelligence (2)
- Game theory (2)
- Mobile crowdsourcing (2)
- Vehicle routing problem (2)
-
- ATM failures (1)
- Adaptive Resonance Theory (1)
- Adaptive duty cycle (1)
- Adaptive parameter tuning (1)
- Adaptive resonance theory (1)
- Algorithms (1)
- Auction (1)
- Backscatter communication (1)
- Battery (1)
- Benchmarking (1)
- Bi-level programming (1)
- Big social media data (1)
- Blogging (1)
- Bus transit service (1)
- Calibration-free (1)
- Celebrity image (1)
- Channel state information (1)
- Click-boosting (1)
- Clustering (1)
- Combinatorial optimization (1)
- Commercial decentralization (1)
- Constrained optimization (1)
- Continuous sensing (1)
- Continuous-time Markov chain (1)
- Cross-modal retrieval (1)
Articles 1 - 30 of 40
Full-Text Articles in Physical Sciences and Mathematics
All Your Sessions Are Belong To Us: Investigating Authenticator Leakage Through Backup Channels On Android, Guangdong Bai, Jun Sun, Jianliang Wu, Quanqi Ye, Li Li, Jin Song Dong, Shanqing Guo
All Your Sessions Are Belong To Us: Investigating Authenticator Leakage Through Backup Channels On Android, Guangdong Bai, Jun Sun, Jianliang Wu, Quanqi Ye, Li Li, Jin Song Dong, Shanqing Guo
Research Collection School Of Computing and Information Systems
Security of authentication protocols heavily relies on the confidentiality of credentials (or authenticators) like passwords and session IDs. However, unlike browser-based web applications for which highly evolved browsers manage the authenticators, Android apps have to construct their own management. We find that most apps simply locate their authenticators into the persistent storage and entrust underlying Android OS for mediation. Consequently, these authenticators can be leaked through compromised backup channels. In this work, we conduct the first systematic investigation on this previously overlooked attack vector. We find that nearly all backup apps on Google Play inadvertently expose backup data to any …
Gpu Accelerated On-The-Fly Reachability Checking, Zhimin Wu, Yang Liu, Jun Sun, Jianqi Shi, Shengchao Qin
Gpu Accelerated On-The-Fly Reachability Checking, Zhimin Wu, Yang Liu, Jun Sun, Jianqi Shi, Shengchao Qin
Research Collection School Of Computing and Information Systems
Model checking suffers from the infamous state space explosion problem. In this paper, we propose an approach, named GPURC, to utilize the Graphics Processing Units (GPUs) to speed up the reachability verification. The key idea is to achieve a dynamic load balancing so that the many cores in GPUs are fully utilized during the state space exploration.To this end, we firstly construct a compact data encoding of the input transition systems to reduce the memory cost and fit the calculation in GPUs. To support a large number of concurrent components, we propose a multi-integer encoding with conflict-release accessing approach. We …
Learning Query And Image Similarities With Ranking Canonical Correlation Analysis, Ting Yao, Tao Mei, Chong-Wah Ngo
Learning Query And Image Similarities With Ranking Canonical Correlation Analysis, Ting Yao, Tao Mei, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
One of the fundamental problems in image search is to learn the ranking functions, i.e., similarity between the query and image. The research on this topic has evolved through two paradigms: feature-based vector model and image ranker learning. The former relies on the image surrounding texts, while the latter learns a ranker based on human labeled query-image pairs. Each of the paradigms has its own limitation. The vector model is sensitive to the quality of text descriptions, and the learning paradigm is difficult to be scaled up as human labeling is always too expensive to obtain. We demonstrate in this …
Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch
Research Collection School Of Computing and Information Systems
The large scale and complex nature of social media data raises the need to scale clustering techniques to big data and make them capable of automatically identifying data clusters with few empirical settings. In this paper, we present our investigation and three algorithms based on the fuzzy adaptive resonance theory (Fuzzy ART) that have linear computational complexity, use a single parameter, i.e., the vigilance parameter to identify data clusters, and are robust to modest parameter settings. The contribution of this paper lies in two aspects. First, we theoretically demonstrate how complement coding, commonly known as a normalization method, changes the …
Adaptive Duty Cycling In Sensor Networks With Energy Harvesting Using Continuous-Time Markov Chain And Fluid Models, Ronald Wai Hong Chan, Pengfei Zhang, Ido Nevat, Sai Ganesh Nagarajan, Alvin Cerdena Valera, Hwee Xian Tan
Adaptive Duty Cycling In Sensor Networks With Energy Harvesting Using Continuous-Time Markov Chain And Fluid Models, Ronald Wai Hong Chan, Pengfei Zhang, Ido Nevat, Sai Ganesh Nagarajan, Alvin Cerdena Valera, Hwee Xian Tan
Research Collection School Of Computing and Information Systems
The dynamic and unpredictable nature of energy harvesting sources available for wireless sensor networks, and the time variation in network statistics like packet transmission rates and link qualities, necessitate the use of adaptive duty cycling techniques. Such adaptive control allows sensor nodes to achieve long-run energy neutrality, where energy supply and demand are balanced in a dynamic environment such that the nodes function continuously. In this paper, we develop a new framework enabling an adaptive duty cycling scheme for sensor networks that takes into account the node battery level, ambient energy that can be harvested, and application-level QoS requirements. We …
Robust Execution Strategies For Project Scheduling With Unreliable Resources And Stochastic Durations, Na Fu, Hoong Chuin Lau, Pradeep Varakantham
Robust Execution Strategies For Project Scheduling With Unreliable Resources And Stochastic Durations, Na Fu, Hoong Chuin Lau, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
The resource-constrained project scheduling problem with minimum and maximum time lags (RCPSP/max) is a general model for resource scheduling in many real-world problems (such as manufacturing and construction engineering). We consider RCPSP/max problems where the durations of activities are stochastic and resources can have unforeseen breakdowns. Given a level of allowable risk, (Formula presented.), our mechanisms aim to compute the minimum robust makespan execution strategy. Robust makespan for an execution strategy is any makespan value that has a risk less than (Formula presented.). The risk for a makespan value, (Formula presented.) given an execution strategy, is the probability that a …
Shopminer: Mining Customer Shopping Behavior In Physical Clothing Stores With Passive Rfids, Longfei Shangguan, Zimu Zhou, Xiaolong Zheng, Lei Yang, Yunhao Liu, Jinsong Han
Shopminer: Mining Customer Shopping Behavior In Physical Clothing Stores With Passive Rfids, Longfei Shangguan, Zimu Zhou, Xiaolong Zheng, Lei Yang, Yunhao Liu, Jinsong Han
Research Collection School Of Computing and Information Systems
Shopping behavior data are of great importance to understand the effectiveness of marketing and merchandising efforts. Online clothing stores are capable capturing customer shopping behavior by analyzing the click stream and customer shopping carts. Retailers with physical clothing stores, however, still lack effective methods to identify comprehensive shopping behaviors. In this paper, we show that backscatter signals of passive RFID tags can be exploited to detect and record how customers browse stores, which items of clothes they pay attention to, and which items of clothes they usually match with. The intuition is that the phase readings of tags attached on …
Deep Multimodal Learning For Affective Analysis And Retrieval, Lei Pang, Shiai Zhu, Chong-Wah Ngo
Deep Multimodal Learning For Affective Analysis And Retrieval, Lei Pang, Shiai Zhu, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Social media has been a convenient platform for voicing opinions through posting messages, ranging from tweeting a short text to uploading a media file, or any combination of messages. Understanding the perceived emotions inherently underlying these user-generated contents (UGC) could bring light to emerging applications such as advertising and media analytics. Existing research efforts on affective computation are mostly dedicated to single media, either text captions or visual content. Few attempts for combined analysis of multiple media are made, despite that emotion can be viewed as an expression of multimodal experience. In this paper, we explore the learning of highly …
Lesinn: Detecting Anomalies By Identifying Least Similar Nearest Neighbours, Guansong Pang, Kai Ming Ting, David Albrecht
Lesinn: Detecting Anomalies By Identifying Least Similar Nearest Neighbours, Guansong Pang, Kai Ming Ting, David Albrecht
Research Collection School Of Computing and Information Systems
We introduce the concept of Least Similar Nearest Neighbours (LeSiNN) and use LeSiNN to detect anomalies directly. Although there is an existing method which is a special case of LeSiNN, this paper is the first to clearly articulate the underlying concept, as far as we know. LeSiNN is the first ensemble method which works well with models trained using samples of one instance. LeSiNN has linear time complexity with respect to data size and the number of dimensions, and it is one of the few anomaly detectors which can apply directly to both numeric and categorical data sets. Our extensive …
Direct Or Indirect Match? Selecting Right Concepts For Zero-Example Case, Yi-Jie Lu, Maaike De Boer, Hao Zhang, Klamer Schutte, Wessel Kraaij, Chong-Wah Ngo
Direct Or Indirect Match? Selecting Right Concepts For Zero-Example Case, Yi-Jie Lu, Maaike De Boer, Hao Zhang, Klamer Schutte, Wessel Kraaij, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
No abstract provided.
Vireo-Tno @ Trecvid 2015: Multimedia Event Detection, Hao Zhang, Yi-Jie Lu, Maaike De Boer, Frank Ter Haar, Zhaofan Qiu, Klamer Schutte, Wessel Kraaij, Chong-Wah Ngo
Vireo-Tno @ Trecvid 2015: Multimedia Event Detection, Hao Zhang, Yi-Jie Lu, Maaike De Boer, Frank Ter Haar, Zhaofan Qiu, Klamer Schutte, Wessel Kraaij, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
This paper presents an overview and comparative analysis of our systems designed for the TRECVID 2015 [1] multimedia event detection (MED) task. We submitted 17 runs, of which 5 each for the zeroexample, 10-example and 100-example subtasks for the Pre-Specified (PS) event detection and 2 runs for the 10-example subtask for the Ad-Hoc (AH) event detection. We did not participate in the Interactive Run. This year we focus on three different parts of the MED task: 1) extending the size of our concept bank and combining it with improved dense trajectories; 2) exploring strategies for semantic query generation (SQG); and …
Social Signal Processing For Real-Time Situational Understanding: A Vision And Approach, Kasthuri Jeyarajah, Shuchao Yao, Raghava Muthuraju, Archan Misra, Geeth De Mel, Julie Skipper, Tarek Abdelzaher, Michael Kolodny
Social Signal Processing For Real-Time Situational Understanding: A Vision And Approach, Kasthuri Jeyarajah, Shuchao Yao, Raghava Muthuraju, Archan Misra, Geeth De Mel, Julie Skipper, Tarek Abdelzaher, Michael Kolodny
Research Collection School Of Computing and Information Systems
The US Army Research Laboratory (ARL) and the Air Force Research Laboratory (AFRL) have established a collaborative research enterprise referred to as the Situational Understanding Research Institute (SURI). The goal is to develop an information processing framework to help the military obtain real-time situational awareness of physical events by harnessing the combined power of multiple sensing sources to obtain insights about events and their evolution. It is envisioned that one could use such information to predict behaviors of groups, be they local transient groups (e.g., protests) or widespread, networked groups, and thus enable proactive prevention of nefarious activities. This paper …
Enhancing Wifi-Based Localization With Visual Clues, Han Xu, Zheng Yang, Zimu Zhou, Longfei Shangguan, Yunhao Liu, Ke Yi
Enhancing Wifi-Based Localization With Visual Clues, Han Xu, Zheng Yang, Zimu Zhou, Longfei Shangguan, Yunhao Liu, Ke Yi
Research Collection School Of Computing and Information Systems
Indoor localization is of great importance to a wide range of applications in the era of mobile computing. Current mainstream solutions rely on Received Signal Strength (RSS) of wireless signals as fingerprints to distinguish and infer locations. However, those methods suffer from fingerprint ambiguity that roots in multipath fading and temporal dynamics of wireless signals. Though pioneer efforts have resorted to motion-assisted or peer-assisted localization, they neither work in real time nor work without the help of peer users, which introduces extra costs and constraints, and thus degrades their practicality. To get over these limitations, we propose Argus, an image-assisted …
Sandra Helps You Learn: The More You Walk, The More Battery Your Phone Drains, Chulhong Min, Chungkuk Yoo, Inseok Hwang, Seungwoo Kang, Youngki Lee, Seungchul Lee, Pillsoon Park, Changhun Lee, Seungpyo Choi Choi
Sandra Helps You Learn: The More You Walk, The More Battery Your Phone Drains, Chulhong Min, Chungkuk Yoo, Inseok Hwang, Seungwoo Kang, Youngki Lee, Seungchul Lee, Pillsoon Park, Changhun Lee, Seungpyo Choi Choi
Research Collection School Of Computing and Information Systems
Emerging continuous sensing apps introduce new major factors governing phones’ overall battery consumption behaviors: (1) added nontrivial persistent battery drain, and more importantly (2) different battery drain rate depending on the user’s different mobility condition. In this paper, we address the new battery impacting factors significant enough to outdate users’ existing battery model in real life. We explore an initial approach to help users understand the cause and effect between their physical activity and phones’ battery life. To this end, we present Sandra, a novel mobility-aware smartphone battery information advisor, and study its potential to help users redevelop their battery …
From Physical Security To Cybersecurity, Arunesh Sinha, Thanh H. Nguyen, Debarun Kar, Matthew Brown, Milind Tambe, Albert Xin Jiang
From Physical Security To Cybersecurity, Arunesh Sinha, Thanh H. Nguyen, Debarun Kar, Matthew Brown, Milind Tambe, Albert Xin Jiang
Research Collection School Of Computing and Information Systems
Security is a critical concern around the world. In many domains from cybersecurity to sustainability, limited security resources prevent complete security coverage at all times. Instead, these limited resources must be scheduled (or allocated or deployed), while simultaneously taking into account the importance of different targets, the responses of the adversaries to the security posture, and the potential uncertainties in adversary payoffs and observations, etc. Computational game theory can help generate such security schedules. Indeed, casting the problem as a Stackelberg game, we have developed new algorithms that are now deployed over multiple years in multiple applications for scheduling of …
Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau
Designing Bus Transit Services For Routine Crowd Situations At Large Event Venues, Jianli Du, Shih-Fen Cheng, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We are concerned with the routine crowd management problem after a major event at a known venue. Without properly design complementary transport services, such sudden crowd build-ups will overwhelm the existing infrastructure. In this paper, we introduce a novel flow-rate based model to model the dynamic movement of passengers over the transportation flow network. Based on this basic model, an integer linear programming model is proposed to solve the bus transit problem permanently. We validate our model against a real scenario in Singapore, where a newly constructed mega-stadium hosts various large events regularly. The results show that the proposed approach …
Ad-Hoc Automated Teller Machine Failure Forecast And Field Service Optimization, Michelle L. F. Cheong, Ping Shung Koo, B. Chandra Babu
Ad-Hoc Automated Teller Machine Failure Forecast And Field Service Optimization, Michelle L. F. Cheong, Ping Shung Koo, B. Chandra Babu
Research Collection School Of Computing and Information Systems
As part of its overall effort to maintain good customer service while managing operational efficiency and reducing cost, a bank in Singapore has embarked on using data and decision analytics methodologies to perform better ad-hoc ATM failure forecasting and plan the field service engineers to repair the machines. We propose using a combined Data and Decision Analytics Framework which helps the analyst to first understand the business problem by collecting, preparing and exploring data to gain business insights, before proposing what objectives and solutions can and should be done to solve the problem. This paper reports the work in analyzing …
Sails: Hybrid Algorithm For The Team Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Kun Lu
Sails: Hybrid Algorithm For The Team Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Kun Lu
Research Collection School Of Computing and Information Systems
The Team Orienteering Problem with Time Windows (TOPTW) is the extended version of the Orienteering Problem where each node is limited by a given time window. The objective is to maximize the total collected score from a certain number of paths. In this paper, a hybridization of Simulated Annealing and Iterated Local Search, namely SAILS, is proposed to solve the TOPTW. The efficacy of the proposed algorithm is tested using benchmark instances. The results show that the proposed algorithm is competitive with the state-of-the-art algorithms in the literature. SAILS is able to improve the best known solutions for 19 benchmark …
Neural Modeling Of Sequential Inferences And Learning Over Episodic Memory, Budhitama Subagdja, Ah-Hwee Tan
Neural Modeling Of Sequential Inferences And Learning Over Episodic Memory, Budhitama Subagdja, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Episodic memory is a significant part of cognition for reasoning and decision making. Retrieval in episodic memory depends on the order relationships of memory items which provides flexibility in reasoning and inferences regarding sequential relations for spatio-temporal domain. However, it is still unclear how they are encoded and how they differ from representations in other types of memory like semantic or procedural memory. This paper presents a neural model of sequential representation and inferences on episodic memory. It contrasts with the common views on sequential representation in neural networks that instead of maintaining transitions between events to represent sequences, they …
Towards City-Scale Mobile Crowdsourcing: Task Recommendations Under Trajectory Uncertainties, Chen Cen, Shih-Fen Cheng, Hoong Chuin Lau, Archan Misra
Towards City-Scale Mobile Crowdsourcing: Task Recommendations Under Trajectory Uncertainties, Chen Cen, Shih-Fen Cheng, Hoong Chuin Lau, Archan Misra
Research Collection School Of Computing and Information Systems
In this work, we investigate the problem of large-scale mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually pick tasks to perform, we automatically make task recommendation based on workers’ historical trajectories and desired time budgets. The challenge of predicting workers’ trajectories is that it is faced with uncertainties, as a worker does not take same routes every day. In this work, we depart from deterministic modeling and study the stochastic task recommendation problem where each worker is associated with several predicted routine routes with probabilities. We …
Probabilistic Inference Based Message-Passing For Resource Constrained Dcops, Supriyo Ghosh, Akshat Kumar, Pradeep Varakantham
Probabilistic Inference Based Message-Passing For Resource Constrained Dcops, Supriyo Ghosh, Akshat Kumar, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Distributed constraint optimization (DCOP) is an important framework for coordinated multiagent decision making. We address a practically useful variant of DCOP, called resource-constrained DCOP (RC-DCOP), which takes into account agents’ consumption of shared limited resources. We present a promising new class of algorithm for RC-DCOPs by translating the underlying co- ordination problem to probabilistic inference. Using inference techniques such as expectation- maximization and convex optimization machinery, we develop a novel convergent message-passing algorithm for RC-DCOPs. Experiments on standard benchmarks show that our approach provides better quality than previous best DCOP algorithms and has much lower failure rate. Comparisons against an …
History-Based Controller Design And Optimization For Partially Observable Mdps, Akshat Kumar, Shlomo Zilberstein
History-Based Controller Design And Optimization For Partially Observable Mdps, Akshat Kumar, Shlomo Zilberstein
Research Collection School Of Computing and Information Systems
Partially observable MDPs provide an elegant framework forsequential decision making. Finite-state controllers (FSCs) are often used to represent policies for infinite-horizon problems as they offer a compact representation, simple-to-execute plans, and adjustable tradeoff between computational complexityand policy size. We develop novel connections between optimizing FSCs for POMDPs and the dual linear programfor MDPs. Building on that, we present a dual mixed integer linear program (MIP) for optimizing FSCs. To assign well-defined meaning to FSC nodes as well as aid in policy search, we show how to associate history-based features with each FSC node. Using this representation, we address another challenging …
Retail Precinct Management: A Case Of Commercial Decentralization In Singapore, Robert De Souza, Hoong Chuin Lau, Mark Goh, Lindawati, Wee-Siong Ng, Puay-Siew Tan
Retail Precinct Management: A Case Of Commercial Decentralization In Singapore, Robert De Souza, Hoong Chuin Lau, Mark Goh, Lindawati, Wee-Siong Ng, Puay-Siew Tan
Research Collection School Of Computing and Information Systems
The synchronized last mile logistics concept seeks to address, through coordinated collaboration, several challenges that hinder reliability, cost efficiency, effective resource planning, scheduling and utilization; and increasingly, sustainability objectives. Subsequently, the meeting of service level and contractual commitments are competitively impacted with any loss of efficiency. These challenges, against a backdrop of Singapore, can essentially be addressed in selected industry sectors through a better understanding of logistics structures; innovative supply chain designs and coordination of services, operations and processes coupled with concerted policies and supply chain strategies.
Improving Automatic Name-Face Association Using Celebrity Images On The Web, Zhineng Chen, Bailan Feng, Chong-Wah Ngo, Caiyan Jia, Xiangsheng Huang
Improving Automatic Name-Face Association Using Celebrity Images On The Web, Zhineng Chen, Bailan Feng, Chong-Wah Ngo, Caiyan Jia, Xiangsheng Huang
Research Collection School Of Computing and Information Systems
This paper investigates the task of automatically associating faces appearing in images (or videos) with their names. Our novelty lies in the use of celebrity Web images to facilitate the task. Specifically, we first propose a method named Image Matching (IM), which uses the faces in images returned from name queries over an image search engine as the gallery set of the names, and a probe face is classified as one of the names, or none of them, according to their matching scores and compatibility characterized by a proposed Assigning-Thresholding (AT) pipeline. Noting IM could provide guidance for association for …
Non-Invasive Detection Of Moving And Stationary Human With Wifi, Chenshu Wu, Zheng Yang, Zimu Zhou, Xuefeng Liu, Yunhao Liu, Jiannong Cao
Non-Invasive Detection Of Moving And Stationary Human With Wifi, Chenshu Wu, Zheng Yang, Zimu Zhou, Xuefeng Liu, Yunhao Liu, Jiannong Cao
Research Collection School Of Computing and Information Systems
Non-invasive human sensing based on radio signals has attracted a great deal of research interest and fostered a broad range of innovative applications of localization, gesture recognition, smart health-care, etc., for which a primary primitive is to detect human presence. Previous works have studied the detection of moving humans via signal variations caused by human movements. For stationary people, however, existing approaches often employ a prerequisite scenario-tailored calibration of channel profile in human-free environments. Based on in-depth understanding of human motion induced signal attenuation reflected by PHY layer channel state information (CSI), we propose DeMan, a unified scheme for non-invasive …
Direct: A Scalable Approach For Route Guidance In Selfish Orienteering Problems, Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau
Direct: A Scalable Approach For Route Guidance In Selfish Orienteering Problems, Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We address the problem of crowd congestion at venues like theme parks, museums and world expos by providing route guidance to multiple selfish users (with budget constraints) moving through the venue simultaneously. To represent these settings, we introduce the Selfish Orienteering Problem (SeOP) that combines two well studied problems from literature, namely Orienteering Problem (OP) and Selfish Routing (SR). OP is a single agent routing problem where the goal is to minimize latency (or maximize reward) in traversing a subset of nodes while respecting budget constraints. SR is a game between selfish agents looking for minimum latency routes from source …
Matchmaking Game Players On Public Transport, Nairan Zhang, Youngki Lee, Rajesh Krishna Balan
Matchmaking Game Players On Public Transport, Nairan Zhang, Youngki Lee, Rajesh Krishna Balan
Research Collection School Of Computing and Information Systems
This paper extends our recent work, called GameOn, which presented a system for allowing public transport commuters to engage in multiplayer games with fellow commuters traveling on the same bus or train. An important challenge for GameOn is to group players with reliable connections into the same game. In this case, the meaning of reliability has two dimensions. First, the network connectivity (TCP, UDP etc.) should be robust. Second, the players should be collocated with each other for a sufficiently long duration so that a game session will not be terminated by players leaving the public transport modality such as …
Near-Optimal Decentralized Power Supply Restoration In Smart Grids, Pritee Agrawal, Akshat Kumar, Pradeep Varakantham
Near-Optimal Decentralized Power Supply Restoration In Smart Grids, Pritee Agrawal, Akshat Kumar, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Next generation of smart grids face a number of challenges including co-generation from intermittent renewable power sources, a shift away from monolithic control due to increased market deregulation, and robust operation in the face of disasters. Such heterogeneous nature and high operational readiness requirement of smart grids necessitates decentralized control for critical tasks such as power supply restoration (PSR) after line failures. We present a novel multiagent system based approach for PSR using Lagrangian dual decomposition. Our approach works on general graphs, provides provable quality-bounds and requires only local message-passing among different connected sub-regions of a smart grid, enabling decentralized …
Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu
Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu
Research Collection School Of Computing and Information Systems
In an urban city, its transportation network supports efficient flow of people between different parts of the city. Failures in the network can cause major disruptions to commuter and business activities which can result in both significant economic and time losses. In this paper, we investigate the use of centrality measures to determine critical nodes in a transportation network so as to improve the design of the network as well as to devise plans for coping with the network failures. Most centrality measures in social network analysis research unfortunately consider only topological structure of the network and are oblivious of …
Mining Patterns Of Unsatisfiable Constraints To Detect Infeasible Paths, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar
Mining Patterns Of Unsatisfiable Constraints To Detect Infeasible Paths, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar
Research Collection School Of Computing and Information Systems
Detection of infeasible paths is required in many areas including test coverage analysis, test case generation, security vulnerability analysis, etc. Existing approaches typically use static analysis coupled with symbolic evaluation, heuristics, or path-pattern analysis. This paper is related to these approaches but with a different objective. It is to analyze code of real systems to build patterns of unsatisfiable constraints in infeasible paths. The resulting patterns can be used to detect infeasible paths without the use of constraint solver and evaluation of function calls involved, thus improving scalability. The patterns can be built gradually. Evaluation of the proposed approach shows …