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

OS and Networks Commons

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 211 - 240 of 322

Full-Text Articles in OS and Networks

Situation-Aware Authenticated Video Broadcasting Over Train-Trackside Wifi Networks, Yongdong Wu, Dengpan Ye, Zhuo Wei, Qian Wang, William Tan, Robert H. Deng Jul 2018

Situation-Aware Authenticated Video Broadcasting Over Train-Trackside Wifi Networks, Yongdong Wu, Dengpan Ye, Zhuo Wei, Qian Wang, William Tan, Robert H. Deng

Research Collection School Of Computing and Information Systems

Live video programmes can bring in better travel experience for subway passengers and earn abundant advertisement revenue for subway operators. However, because the train-trackside channels for video dissemination are easily accessible to anyone, the video traffic are vulnerable to attacks which may cause deadly tragedies. This paper presents a situation-aware authenticated video broadcasting scheme in the railway network which consists of train, on-board sensor, trackside GSM-R (Global System for Mobile Communications-Railway) device, WiFi AP (Access Point), and train control center. Specifically, the scheme has four modules: (1) a train uses its on-board sensors to obtain its speed, location, and RSSI …


Region-Aware Reflection Removal With Unified Content And Gradient Priors, Renjie Wan, Boxin Shi, Ling-Yu Duan, Ah-Hwee Tan, Wen Gao, Alex C. Kot Jun 2018

Region-Aware Reflection Removal With Unified Content And Gradient Priors, Renjie Wan, Boxin Shi, Ling-Yu Duan, Ah-Hwee Tan, Wen Gao, Alex C. Kot

Research Collection School Of Computing and Information Systems

Removing the undesired reflections in images taken through the glass is of broad application to various image processing and computer vision tasks. Existing single image-based solutions heavily rely on scene priors such as separable sparse gradients caused by different levels of blur, and they are fragile when such priors are not observed. In this paper, we notice that strong reflections usually dominant a limited region in the whole image, and propose a region-aware reflection removal approach by automatically detecting and heterogeneously processing regions with and without reflections. We integrate content and gradient priors to jointly achieve missing contents restoration, as …


Crrn: Multi-Scale Guided Concurrent Reflection Removal Network, Renjie Wan, Boxin Shi, Ling-Yu Duan, Ah-Hwee Tan, Alex C. Kot Jun 2018

Crrn: Multi-Scale Guided Concurrent Reflection Removal Network, Renjie Wan, Boxin Shi, Ling-Yu Duan, Ah-Hwee Tan, Alex C. Kot

Research Collection School Of Computing and Information Systems

Removing the undesired reflections from images taken through the glass is of broad application to various computer vision tasks. Non-learning based methods utilize different handcrafted priors such as the separable sparse gradients caused by different levels of blurs, which often fail due to their limited description capability to the properties of real-world reflections. In this paper, we propose the Concurrent Reflection Removal Network (CRRN) to tackle this problem in a unified framework. Our proposed network integrates image appearance information and multi-scale gradient information with human perception inspired loss function, and is trained on a new dataset with 3250 reflection images …


Survey Of Randomization Defenses On Cloud Computing, Jianming Fu, Yan Lin, Xiuwen Liu, Xu Zhang Jun 2018

Survey Of Randomization Defenses On Cloud Computing, Jianming Fu, Yan Lin, Xiuwen Liu, Xu Zhang

Research Collection School Of Computing and Information Systems

Cloud computing has changed the processing mode on resources of individuals and industries by providing computing and storage services to users. However, existing defenses on cloud, such as virtual machine monitoring and integrity detection, cannot counter against attacks result from the homogeneity and vulnerability of services effectively. In this paper, we have investigated the threats on cloud computing platform from the perspective of cloud service, service interface and network interface, such as code reuse attack, side channel attack and SQL injection. Code reuse attack chains code snippets (gadgets) located in binaries to bypass Data Execution Prevention (DEP). Side channel attack …


Empirical Risk Landscape Analysis For Understanding Deep Neural Networks, Pan Zhou, Jiashi Feng May 2018

Empirical Risk Landscape Analysis For Understanding Deep Neural Networks, Pan Zhou, Jiashi Feng

Research Collection School Of Computing and Information Systems

This work aims to provide comprehensive landscape analysis of empirical risk in deep neural networks (DNNs), including the convergence behavior of its gradient, its stationary points and the empirical risk itself to their corresponding population counterparts, which reveals how various network parameters determine the convergence performance. In particular, for an l-layer linear neural network consisting of di neurons in the i-th layer, we prove the gradient of its empirical risk uniformly converges to the one of its population risk, at the rate of O(r 2l p l √ maxi dis log(d/l)/n). Here d is the total weight dimension, s is …


Breathing-Based Authentication On Resource-Constrained Iot Devices Using Recurrent Neural Networks, Jagmohan Chauhan, Suranga Seneviratne, Yining Hu, Archan Misra, Aruna Seneviratne, Youngki Lee May 2018

Breathing-Based Authentication On Resource-Constrained Iot Devices Using Recurrent Neural Networks, Jagmohan Chauhan, Suranga Seneviratne, Yining Hu, Archan Misra, Aruna Seneviratne, Youngki Lee

Research Collection School Of Computing and Information Systems

Recurrent neural networks (RNNs) have shown promising resultsin audio and speech-processing applications. The increasingpopularity of Internet of Things (IoT) devices makes a strongcase for implementing RNN-based inferences for applicationssuch as acoustics-based authentication and voice commandsfor smart homes. However, the feasibility and performance ofthese inferences on resource-constrained devices remain largelyunexplored. The authors compare traditional machine-learningmodels with deep-learning RNN models for an end-to-endauthentication system based on breathing acoustics.


Virtualization In Wireless Sensor Networks: Fault Tolerant Embedding For Internet Of Things, Omprakash Kaiwartya, Abdul Hanan Abdullah, Yue Cao, Jaime Lloret, Sushil Kumar, Rajiv Ratn Shah, Mukesh Prasad, Shiv Prakash Apr 2018

Virtualization In Wireless Sensor Networks: Fault Tolerant Embedding For Internet Of Things, Omprakash Kaiwartya, Abdul Hanan Abdullah, Yue Cao, Jaime Lloret, Sushil Kumar, Rajiv Ratn Shah, Mukesh Prasad, Shiv Prakash

Research Collection School Of Computing and Information Systems

Recently, virtualization in wireless sensor networks (WSNs) has witnessed significant attention due to the growing service domain for IoT. Related literature on virtualization in WSNs explored resource optimization without considering communication failure in WSNs environments. The failure of a communication link in WSNs impacts many virtual networks running IoT services. In this context, this paper proposes a framework for optimizing fault tolerance in virtualization in WSNs, focusing on heterogeneous networks for service-oriented IoT applications. An optimization problem is formulated considering fault tolerance and communication delay as two conflicting objectives. An adapted non-dominated sorting based genetic algorithm (A-NSGA) is developed to …


Scaling Human Activity Recognition Via Deep Learning-Based Domain Adaptation, Md Abdullah Hafiz Khan, Nirmalya Roy, Archan Misra Mar 2018

Scaling Human Activity Recognition Via Deep Learning-Based Domain Adaptation, Md Abdullah Hafiz Khan, Nirmalya Roy, Archan Misra

Research Collection School Of Computing and Information Systems

We investigate the problem of making human activityrecognition (AR) scalable–i.e., allowing AR classifiers trainedin one context to be readily adapted to a different contextualdomain. This is important because AR technologies can achievehigh accuracy if the classifiers are trained for a specific individualor device, but show significant degradation when the sameclassifier is applied context–e.g., to a different device located ata different on-body position. To allow such adaptation withoutrequiring the onerous step of collecting large volumes of labeledtraining data in the target domain, we proposed a transductivetransfer learning model that is specifically tuned to the propertiesof convolutional neural networks (CNNs). Our model, …


Sequential Recommendation With User Memory Networks, Xu Chen, Hongteng Xu, Yongfeng Zhang, Jiaxi Tang, Yixin Cao, Zheng Qin, Hongyuan Zha Feb 2018

Sequential Recommendation With User Memory Networks, Xu Chen, Hongteng Xu, Yongfeng Zhang, Jiaxi Tang, Yixin Cao, Zheng Qin, Hongyuan Zha

Research Collection School Of Computing and Information Systems

User preferences are usually dynamic in real-world recommender systems, and a user»s historical behavior records may not be equally important when predicting his/her future interests. Existing recommendation algorithms -- including both shallow and deep approaches -- usually embed a user»s historical records into a single latent vector/representation, which may have lost the per item- or feature-level correlations between a user»s historical records and future interests. In this paper, we aim to express, store, and manipulate users» historical records in a more explicit, dynamic, and effective manner. To do so, we introduce the memory mechanism to recommender systems. Specifically, we design …


Building Deep Networks On Grassmann Manifolds, Zhiwu Huang, J. Wu, Gool L. Van Feb 2018

Building Deep Networks On Grassmann Manifolds, Zhiwu Huang, J. Wu, Gool L. Van

Research Collection School Of Computing and Information Systems

Learning representations on Grassmann manifolds is popular in quite a few visual recognition tasks. In order to enable deep learning on Grassmann manifolds, this paper proposes a deep network architecture by generalizing the Euclidean network paradigm to Grassmann manifolds. In particular, we design full rank mapping layers to transform input Grassmannian data to more desirable ones, exploit re-orthonormalization layers to normalize the resulting matrices, study projection pooling layers to reduce the model complexity in the Grassmannian context, and devise projection mapping layers to respect Grassmannian geometry and meanwhile achieve Euclidean forms for regular output layers. To train the Grassmann networks, …


Collaborative Fall Detection Using Smartphone And Kinect, Xue Li, Lanshun Nie, Hanchuan Xu, Xianzhi Wang Jan 2018

Collaborative Fall Detection Using Smartphone And Kinect, Xue Li, Lanshun Nie, Hanchuan Xu, Xianzhi Wang

Research Collection School Of Computing and Information Systems

Humanfall detection has attracted broad attentions as sensors and mobile devices are increasingly adopted in real-life scenarios such as smart homes. The complexity of activities in home environments pose severe challenges to the fall detection research with respect to the detection accuracy. We propose a collaborative detection platform that combines two subsystems: a threshold-based fall detection subsystem using mobile phones and a support vector machine (SVM)-based fall detection subsystem using Kinects. Both subsystems have their respective confidence models and the platform detects falls by fusing the data of both subsystems using two methods: the logical rules-based and D-S evidence fusion …


Multi-Target Deep Neural Networks: Theoretical Analysis And Implementation, Zeng Zeng, Nanying Liang, Xulei Yang, Steven C. H. Hoi Jan 2018

Multi-Target Deep Neural Networks: Theoretical Analysis And Implementation, Zeng Zeng, Nanying Liang, Xulei Yang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

In this work, we propose a novel deep neural network referred to as Multi-Target Deep Neural Network (MT-DNN). We theoretically prove that different stable target models with shared learning paths are stable and can achieve optimal solutions respectively. Based on GoogleNet, we design a single model with three different targets, one for classification, one for regression, and one for masks that is composed of 256  ×  256 sub-models. Unlike bounding boxes used in ImageNet, our single model can draw the shapes of target objects, and in the meanwhile, classify the objects and calculate their sizes. We validate our single MT-DNN …


Bikemate: Bike Riding Behavior Monitoring With Smartphones, Weixi Gu, Zimu Zhou, Yuxun Zhou, Han Zou, Yunxin Liu, Costas J. Spanos, Lin Zhang Nov 2017

Bikemate: Bike Riding Behavior Monitoring With Smartphones, Weixi Gu, Zimu Zhou, Yuxun Zhou, Han Zou, Yunxin Liu, Costas J. Spanos, Lin Zhang

Research Collection School Of Computing and Information Systems

Detecting dangerous riding behaviors is of great importance to improve bicycling safety. Existing bike safety precautionary measures rely on dedicated infrastructures that incur high installation costs. In this work, we propose BikeMate, a ubiquitous bicycling behavior monitoring system with smartphones. BikeMate invokes smartphone sensors to infer dangerous riding behaviors including lane weaving, standing pedalling and wrong-way riding. For easy adoption, BikeMate leverages transfer learning to reduce the overhead of training models for different users, and applies crowdsourcing to infer legal riding directions without prior knowledge. Experiments with 12 participants show that BikeMate achieves an overall accuracy of 86.8% for lane …


Understanding Inactive Yet Available Assignees In Github, Jing Jiang, David Lo, Xinyu Ma, Fuli Feng, Li Zhang Nov 2017

Understanding Inactive Yet Available Assignees In Github, Jing Jiang, David Lo, Xinyu Ma, Fuli Feng, Li Zhang

Research Collection School Of Computing and Information Systems

Context In GitHub, an issue or a pull request can be assigned to a specific assignee who is responsible for working on this issue or pull request. Due to the principle of voluntary participation, available assignees may remain inactive in projects. If assignees ever participate in projects, they are active assignees; otherwise, they are inactive yet available assignees (inactive assignees for short). Objective Our objective in this paper is to provide a comprehensive analysis of inactive yet available assignees in GitHub. Method We collect 2,374,474 records of activities in 37 popular projects, and 797,756 records of activities in 687 projects …


Intent Recognition In Smart Living Through Deep Recurrent Neural Networks, Xiang Zhang, Lina Yao, Chaoran Huang, Quan Z. Sheng, Xianzhi Wang Nov 2017

Intent Recognition In Smart Living Through Deep Recurrent Neural Networks, Xiang Zhang, Lina Yao, Chaoran Huang, Quan Z. Sheng, Xianzhi Wang

Research Collection School Of Computing and Information Systems

Electroencephalography (EEG) signal based intent recognition has recently attracted much attention in both academia and industries, due to helping the elderly or motor-disabled people controlling smart devices to communicate with outer world. However, the utilization of EEG signals is challenged by low accuracy, arduous and time-consuming feature extraction. This paper proposes a 7-layer deep learning model to classify raw EEG signals with the aim of recognizing subjects’ intents, to avoid the time consumed in pre-processing and feature extraction. The hyper-parameters are selected by an Orthogonal Array experiment method for efficiency. Our model is applied to an open EEG dataset provided …


Automated Android Application Permission Recommendation, Lingfeng Bao, David Lo, Xin Xia, Shanping Li Sep 2017

Automated Android Application Permission Recommendation, Lingfeng Bao, David Lo, Xin Xia, Shanping Li

Research Collection School Of Computing and Information Systems

The number of Android applications has increased rapidly as Android is becoming the dominant platform in the smartphone market. Security and privacy are key factors for an Android application to be successful. Android provides a permission mechanism to ensure security and privacy. This permission mechanism requires that developers declare the sensitive resources required by their applications. On installation or during runtime, users are required to agree with the permission request. However, in practice, there are numerous popular permission misuses, despite Android introducing official documents stating how to use these permissions properly. Some data mining techniques (e.g., association rule mining) have …


On Return Oriented Programming Threats In Android Runtime, Akshaya Venkateswara Raja, Jehyun Lee, Debin Gao Aug 2017

On Return Oriented Programming Threats In Android Runtime, Akshaya Venkateswara Raja, Jehyun Lee, Debin Gao

Research Collection School Of Computing and Information Systems

Android has taken a large share of operating systems forsmart devices including smartphones, and has been an attractive target to theattackers. The arms race between attackers and defenders typically occurs ontwo front lines — the latest attacking technology and the latest updates to theoperating system (including defense mechanisms deployed). In terms of attackingtechnology, Return-Oriented Programming (ROP) is one of the most sophisticatedattack methods on Android devices. In terms of the operating system updates,Android Runtime (ART) was the latest and biggest change to the Android family.In this paper, we investigate the extent to which Android Runtime (ART) makesReturn-Oriented Programming (ROP) attacks …


Transaction Cost Optimization For Online Portfolio Selection, Bin Li, Jialei Wang, Dingjiang Huang, Steven C. H. Hoi Aug 2017

Transaction Cost Optimization For Online Portfolio Selection, Bin Li, Jialei Wang, Dingjiang Huang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

To improve existing online portfolio selection strategies in the case of non-zero transaction costs, we propose a novel framework named Transaction Cost Optimization (TCO). The TCO framework incorporates the L1 norm of the difference between two consecutive allocations together with the principles of maximizing expected log return. We further solve the formulation via convex optimization, and obtain two closed-form portfolio update formulas, which follow the same principle as Proportional Portfolio Rebalancing (PPR) in industry. We empirically evaluate the proposed framework using four commonly used data-sets. Although these data-sets do not consider delisted firms and are thus subject to survival bias, …


Deshadownet: A Multi-Context Embedding Deep Network For Shadow Removal, Liangqiong Qu, Jiandong Tian, Shengfeng He, Yandong Tang, Rynson W. H. Lau Jul 2017

Deshadownet: A Multi-Context Embedding Deep Network For Shadow Removal, Liangqiong Qu, Jiandong Tian, Shengfeng He, Yandong Tang, Rynson W. H. Lau

Research Collection School Of Computing and Information Systems

Shadow removal is a challenging task as it requires the detection/annotation of shadows as well as semantic understanding of the scene. In this paper, we propose an automatic and end-to-end deep neural network (DeshadowNet) to tackle these problems in a unified manner. DeshadowNet is designed with a multi-context architecture, where the output shadow matte is predicted by embedding information from three different perspectives. The first global network extracts shadow features from a global view. Two levels of features are derived from the global network and transferred to two parallel networks. While one extracts the appearance of the input image, the …


Poster: Unobtrusive User Verification Using Piezoelectric Energy Harvesting, Dong Ma, Guohao Lan, Weitao Xu, Mahbub Hassan, Wen Hu Jul 2017

Poster: Unobtrusive User Verification Using Piezoelectric Energy Harvesting, Dong Ma, Guohao Lan, Weitao Xu, Mahbub Hassan, Wen Hu

Research Collection School Of Computing and Information Systems

With the capability to harvest energy from low frequency motions or vibrations, piezoelectric energy harvesting has become a promising solution to achieve self-powered wearable system. Apart from generating energy to power the wearable devices, the output electricity signal of the PEH can also be used as an information source as it reflects the activity or motion patterns of the user. In this paper, we have designed and built an insole-based user authentication system by leveraging the AC voltage generated by the PEH during human walking. Meanwhile, the generated power is also collected and stored, which could be later used as …


Denoising Autoencoders For Fast Real-Time Traffic Estimation On Urban Road Networks, Soham Ghosh, Muhammad Tayyab Asif, Laura Wynter Jun 2017

Denoising Autoencoders For Fast Real-Time Traffic Estimation On Urban Road Networks, Soham Ghosh, Muhammad Tayyab Asif, Laura Wynter

Research Collection School Of Computing and Information Systems

We propose a new method for traffic state estimation applicable to large urban road networks where a significant amount of the real-time and historical data is missing. Our proposed approach involves estimating the missing historical data through low-rank matrix completion, coupled with an online estimation approach for estimating the missing real-time data. In contrast to the traditional approach, the proposed method does not require re-calibration every time new streaming data becomes available. Empirical results from two metropolitan cities show that the proposed two-step approach provides comparable accuracy to a state of the art benchmark method while achieving two orders of …


Measuring The Declared Sdk Versions And Their Consistency With Api Calls In Android Apps, Daoyuan Wu, Ximing Liu, Jiayun Xu, David Lo, Debin Gao Jun 2017

Measuring The Declared Sdk Versions And Their Consistency With Api Calls In Android Apps, Daoyuan Wu, Ximing Liu, Jiayun Xu, David Lo, Debin Gao

Research Collection School Of Computing and Information Systems

Android has been the most popular smartphone system, with multiple platform versions (e.g., KITKAT and Lollipop) active in the market. To manage the application’s compatibility with one or more platform versions, Android allows apps to declare the supported platform SDK versions in their manifest files. In this paper, we make a first effort to study this modern software mechanism. Our objective is to measure the current practice of the declared SDK versions (which we term as DSDK versions afterwards) in real apps, and the consistency between the DSDK versions and their app API calls. To this end, we perform a …


A Dynamic Programming Approach For Quickly Estimating Large Network-Based Mev Models, Tien Mai, Emma Frejinger, Mogens Fosgereau, Fabian Bastin Apr 2017

A Dynamic Programming Approach For Quickly Estimating Large Network-Based Mev Models, Tien Mai, Emma Frejinger, Mogens Fosgereau, Fabian Bastin

Research Collection School Of Computing and Information Systems

We propose a way to estimate a family of static Multivariate Extreme Value (MEV) models with large choice sets in short computational time. The resulting model is also straightforward and fast to use for prediction. Following Daly and Bierlaire (2006), the correlation structure is defined by a rooted, directed graph where each node without successor is an alternative. We formulate a family of MEV models as dynamic discrete choice models on graphs of correlation structures and show that the dynamic models are consistent with MEV theory and generalize the network MEV model (Daly and Bierlaire, 2006). Moreover, we show that …


Dark Hazard: Large-Scale Discovery Of Unknown Hidden Sensitive Operations In Android Apps, Xiaorui Pan, Xueqiang Wang, Yue Duan, Xiaofeng Wang, Heng Yin Mar 2017

Dark Hazard: Large-Scale Discovery Of Unknown Hidden Sensitive Operations In Android Apps, Xiaorui Pan, Xueqiang Wang, Yue Duan, Xiaofeng Wang, Heng Yin

Research Collection School Of Computing and Information Systems

Hidden sensitive operations (HSO) such as stealing privacy user data upon receiving an SMS message are increasingly utilized by mobile malware and other potentially-harmful apps (PHAs) to evade detection. Identification of such behaviors is hard, due to the challenge in triggering them during an app’s runtime. Current static approaches rely on the trigger conditions or hidden behaviors known beforehand and therefore cannot capture previously unknown HSO activities. Also these techniques tend to be computationally intensive and therefore less suitable for analyzing a large number of apps. As a result, our understanding of real-world HSO today is still limited, not to …


Robust Optimization For Tree-Structured Stochastic Network Design, Xiaojian Wu, Akshat Kumar, Daniel Sheldon Feb 2017

Robust Optimization For Tree-Structured Stochastic Network Design, Xiaojian Wu, Akshat Kumar, Daniel Sheldon

Research Collection School Of Computing and Information Systems

Stochastic network design is a general framework for optimizing network connectivity. It has several applications in computational sustainability including spatial conservation planning, pre-disaster network preparation, and river network optimization. A common assumption in previous work has been made that network parameters (e.g., probability of species colonization) are precisely known, which is unrealistic in real- world settings. We therefore address the robust river network design problem where the goal is to optimize river connectivity for fish movement by removing barriers. We assume that fish passability probabilities are known only imprecisely, but are within some interval bounds. We then develop a planning …


A Riemannian Network For Spd Matrix Learning, Zhiwu Huang, Gool L. Van Feb 2017

A Riemannian Network For Spd Matrix Learning, Zhiwu Huang, Gool L. Van

Research Collection School Of Computing and Information Systems

Symmetric Positive Definite (SPD) matrix learning methods have become popular in many image and video processing tasks, thanks to their ability to learn appropriate statistical representations while respecting Riemannian geometry of underlying SPD manifolds. In this paper we build a Riemannian network architecture to open up a new direction of SPD matrix non-linear learning in a deep model. In particular, we devise bilinear mapping layers to transform input SPD matrices to more desirable SPD matrices, exploit eigenvalue rectification layers to apply a non-linear activation function to the new SPD matrices, and design an eigenvalue logarithm layer to perform Riemannian computing …


Bike Route Choice Modeling Using Gps Data Without Choice Sets Of Paths, Maëlle Zimmermann, Tien Mai, Emma Frejinger Feb 2017

Bike Route Choice Modeling Using Gps Data Without Choice Sets Of Paths, Maëlle Zimmermann, Tien Mai, Emma Frejinger

Research Collection School Of Computing and Information Systems

Concerned by the nuisances of motorized travel on urban life, policy makers are faced with the challenge of making cycling a more attractive alternative for everyday transportation. Route choice models can help achieve this objective by gaining insights into the trade-offs cyclists make when choosing their routes and by allowing the effect of infrastructure improvements to be analyzed. We estimate a link-based bike route choice model from a sample of GPS observations in the city of Eugene on a network comprising over 40,000 links. The so-called recursive logit (RL) model (Fosgerau et al., 2013) does not require to sample any …


A Method Of Integrating Correlation Structures For A Generalized Recursive Route Choice Model, Tien Mai Nov 2016

A Method Of Integrating Correlation Structures For A Generalized Recursive Route Choice Model, Tien Mai

Research Collection School Of Computing and Information Systems

We propose a way to estimate a generalized recursive route choice model. The model generalizes other existing recursive models in the literature, i.e., (Fosgerau et al., 2013b; Mai et al., 2015c), while being more flexible since it allows the choice at each stage to be any member of the network multivariate extreme value (network MEV) model (Daly and Bierlaire, 2006). The estimation of the generalized model requires defining a contraction mapping and performing contraction iterations to solve the Bellman’s equation. Given the fact that the contraction mapping is defined based on the choice probability generating functions (CPGF) (Fosgerau et al., …


Static Loop Analysis And Its Applications, Xiaofei Xie Nov 2016

Static Loop Analysis And Its Applications, Xiaofei Xie

Research Collection School Of Computing and Information Systems

Loops are challenging structures in program analysis, and an effective loop analysis is crucial in the applications, such as symbolic execution and program verification. In the research, we will first perform a deep analysis and propose a classification according to the complexity of the loops. Then try to propose techniques for analyzing and summarizing different loops. At last, we apply the techniques in multiple applications.


Summarization Of Egocentric Videos: A Comprehensive Survey, Ana Garcia Del Molino, Cheston Tan, Joo-Hwee Lim, Ah-Hwee Tan Nov 2016

Summarization Of Egocentric Videos: A Comprehensive Survey, Ana Garcia Del Molino, Cheston Tan, Joo-Hwee Lim, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

The introduction of wearable video cameras (e.g., GoPro) in the consumer market has promoted video life-logging, motivating users to generate large amounts of video data. This increasing flow of first-person video has led to a growing need for automatic video summarization adapted to the characteristics and applications of egocentric video. With this paper, we provide the first comprehensive survey of the techniques used specifically to summarize egocentric videos. We present a framework for first-person view summarization and compare the segmentation methods and selection algorithms used by the related work in the literature. Next, we describe the existing egocentric video datasets …