Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (116)
- Software Engineering (80)
- Artificial Intelligence and Robotics (37)
- Engineering (37)
- Computer Engineering (35)
-
- Graphics and Human Computer Interfaces (32)
- Information Security (24)
- Digital Communications and Networking (15)
- Social and Behavioral Sciences (15)
- Theory and Algorithms (15)
- Public Affairs, Public Policy and Public Administration (11)
- Programming Languages and Compilers (10)
- Transportation (10)
- Business (8)
- Computer and Systems Architecture (8)
- Numerical Analysis and Scientific Computing (6)
- Systems Architecture (6)
- Data Storage Systems (4)
- Communication (3)
- Management Information Systems (3)
- Social Media (3)
- Technology and Innovation (3)
- Medicine and Health Sciences (2)
- Operations Research, Systems Engineering and Industrial Engineering (2)
- Public Health (2)
- Applied Mathematics (1)
- Arts and Humanities (1)
- Keyword
-
- Neural networks (12)
- Graph neural networks (11)
- Deep learning (9)
- Reinforcement learning (9)
- Task analysis (8)
-
- Training (8)
- Graph Neural Networks (7)
- Neural network (6)
- Security (6)
- Deep learning testing (5)
- Deep neural networks (5)
- Network embedding (5)
- Adaptive Resonance Theory (4)
- Categorization (4)
- Cloud computing (4)
- Clustering (4)
- Computer architecture (4)
- Finance (4)
- Meta-learning (4)
- Multimodality (4)
- Networks (4)
- Neural Networks (4)
- Neurons (4)
- Supervised learning (4)
- Uncertainty (4)
- Adaptive resonance theory (3)
- Adaptive systems (3)
- Adversarial attack (3)
- Anomaly Detection (3)
- Attention mechanisms (3)
- Publication Year
- Publication
- Publication Type
Articles 241 - 270 of 345
Full-Text Articles in OS and Networks
Understanding Inactive Yet Available Assignees In Github, Jing Jiang, David Lo, Xinyu Ma, Fuli Feng, Li Zhang
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
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
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
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
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, …
How Technology Is Reshaping Financial Services: Essays On Consumer Behavior In Card, Channel And Cryptocurrency Services, Dan Geng
Dissertations and Theses Collection
The financial services sector has seen dramatic technological innovations in the last several years associated with the “fintech revolution.” Major changes have taken place in channel management, credit card rewards marketing, cryptocurren-cy, and wealth management, and have influenced consumers’ banking behavior in different ways. As a consequence, there has been a growing demand for banks to rethink their business models and operations to adapt to changing consumer be-havior and counter the competitive pressure from other banks and non-bank play-ers. In this dissertation, I study consumer behavior related to different aspects of financial innovation by addressing research questions that are motivated …
Deshadownet: A Multi-Context Embedding Deep Network For Shadow Removal, Liangqiong Qu, Jiandong Tian, Shengfeng He, Yandong Tang, Rynson W. H. Lau
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
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
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
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 …
Proactive And Reactive Strategies To Handle Surges In Urban Crowds, Jiali Du
Proactive And Reactive Strategies To Handle Surges In Urban Crowds, Jiali Du
Dissertations and Theses Collection
Most urban infrastructures are built to cater a planned capacity, yet surges in usage do happen in times (can be either expected or unexpected), and this has long been a major challenge for urban planner. In this thesis, I propose to study approaches handle surges in urban crowd movement. In particular, the surges in demand studied are limited to situations where a large crowd of commuters/visitors gather in a small vicinity, and I am concerned with their movements both within the vicinity and out of the vicinity (the egress from the vicinity). Significant crowd build-ups and congestions can be observed …
A Dynamic Programming Approach For Quickly Estimating Large Network-Based Mev Models, Tien Mai, Emma Frejinger, Mogens Fosgereau, Fabian Bastin
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
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
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
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
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
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
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
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 …
Proteus: Computing Disjunctive Loop Summary Via Path Dependency Analysis, Xiaofei Xie, Bihuan Chen, Yang Liu, Wei Le, Xiaohong Li
Proteus: Computing Disjunctive Loop Summary Via Path Dependency Analysis, Xiaofei Xie, Bihuan Chen, Yang Liu, Wei Le, Xiaohong Li
Research Collection School Of Computing and Information Systems
Loops are challenging structures for program analysis, especially when loops contain multiple paths with complex interleaving executions among these paths. In this paper, we first propose a classification of multi-path loops to understand the complexity of the loop execution, which is based on the variable updates on the loop conditions and the execution order of the loop paths. Secondly, we propose a loop analysis framework, named Proteus, which takes a loop program and a set of variables of interest as inputs and summarizes path-sensitive loop effects on the variables. The key contribution is to use a path dependency automaton (PDA) …
Techniques For Identifying Mobile Platform Vulnerabilities And Detecting Policy-Violating Applications, Mon Kywe Su
Techniques For Identifying Mobile Platform Vulnerabilities And Detecting Policy-Violating Applications, Mon Kywe Su
Dissertations and Theses Collection
Mobile systems are generally composed of three layers of software: application layer where third-party applications are installed, framework layer where Application Programming Interfaces (APIs) are exposed, and kernel layer where low-level system operations are executed. In this dissertation, we focus on security and vulnerability analysis of framework and application layers. Security mechanisms, such as Android’s sandbox and permission systems, exist in framework layer, while malware scanners protects application layer. However, there are rooms for improvement in both mechanisms. For instance, Android’s permission system is known to be implemented in ad-hoc manner and not well-tested for vulnerabilities. Application layer also focuses …
Ra2: Predicting Simulation Execution Time For Cloud-Based Design Space Explorations, Nguyen Binh Duong Ta, Wentong Cai, Zengxiang Li, Suiping Zhou
Ra2: Predicting Simulation Execution Time For Cloud-Based Design Space Explorations, Nguyen Binh Duong Ta, Wentong Cai, Zengxiang Li, Suiping Zhou
Research Collection School Of Computing and Information Systems
Design space exploration refers to the evaluation of implementation alternatives for many engineering and design problems. A popular exploration approach is to run a large number of simulations of the actual system with varying sets of configuration parameters to search for the optimal ones. Due to the potentially huge resource requirements, cloud-based simulation execution strategies should be considered in many cases. In this paper, we look at the issue of running largescale simulation-based design space exploration problems on commercial Infrastructure-as-a-Service clouds, namely Amazon EC2, Microsoft Azure and Google Compute Engine. To efficiently manage cloud resources used for execution, the key …
Towards Autonomous Behavior Learning Of Non-Player Characters In Games, Shu Feng, Ah-Hwee Tan
Towards Autonomous Behavior Learning Of Non-Player Characters In Games, Shu Feng, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Non-Player-Characters (NPCs), as found in computer games, can be modelled as intelligent systems, which serve to improve the interactivity and playability of the games. Although reinforcement learning (RL) has been a promising approach to creating the behavior models of non-player characters (NPC), an initial stage of exploration and low performance is typically required. On the other hand, imitative learning (IL) is an effective approach to pre-building a NPC’s behavior model by observing the opponent’s actions, but learning by imitation limits the agent’s performance to that of its opponents. In view of their complementary strengths, this paper proposes a computational model …
Decision Modeling And Empirical Analysis Of Mobile Financial Services, Jun Liu
Decision Modeling And Empirical Analysis Of Mobile Financial Services, Jun Liu
Dissertations and Theses Collection
The past twenty years have been a time of many new technological developments, changing business practices, and interesting innovations in the financial information system (IS) and technology landscape. As the financial services industry has been undergoing the digital transformation, the emergence of mobile financial services has been changing the way that customers pay for goods and services purchases and interact with financial institutions. This dissertation seeks to understand the evolution of the mobile payments technology ecosystem and how firms make mobile payments investment decisions under uncertainty, as well as examines the influence of mobile banking on customer behavior and financial …
Edit Distance Based Encryption And Its Application, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo, Kaitai Liang
Edit Distance Based Encryption And Its Application, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo, Kaitai Liang
Research Collection School Of Computing and Information Systems
Edit distance, also known as Levenshtein distance, is a very useful tool to measure the similarity between two strings. It has been widely used in many applications such as natural language processing and bioinformatics. In this paper, we introduce a new type of fuzzy public key encryption called Edit Distance-based Encryption (EDE). In EDE, the encryptor can specify an alphabet string and a threshold when encrypting a message, and a decryptor can obtain a decryption key generated from another alphabet string, and the decryption will be successful if and only if the edit distance between the two strings is within …
Self-Regulated Incremental Clustering With Focused Preferences, Di Wang, Ah-Hwee Tan
Self-Regulated Incremental Clustering With Focused Preferences, Di Wang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Due to their online learning nature, incremental clustering techniques can handle a continuous stream of data. In particular, various incremental clustering techniques based on Adaptive Resonance Theory (ART) have been shown to have low computational complexity in adaptive learning and are less sensitive to noisy information. However, parameter regularization in existing ART clustering techniques is applied either on different features or on different clusters exclusively. In this paper, we introduce Interest-Focused Clustering based on Adaptive Resonance Theory (IFC-ART), which self-regulates the vigilance parameter associated with each feature and each cluster. As such, we can incorporate the domain knowledge of the …
Passively Testing Routing Protocols In Wireless Sensor Networks, Xiaoping Che, Stephane Maag, Hwee-Xian Tan, Hwee-Pink Tan
Passively Testing Routing Protocols In Wireless Sensor Networks, Xiaoping Che, Stephane Maag, Hwee-Xian Tan, Hwee-Pink Tan
Research Collection School Of Computing and Information Systems
Smart systems are today increasingly developed with the number of wireless sensor devices that drastically increases. They are implemented within several contexts through our environment. Thus, sensed data transported in ubiquitous systems are important and the way to carry them must be efficient and reliable. For that purpose, several routing protocols have been proposed to wireless sensor networks (WSN). However, one stage that is often neglected before their deployment, is the conformance testing process, a crucial and challenging step. Active testing techniques commonly used in wired networks are not suitable to WSN and passive approaches are needed. While some works …
Semantic Memory Modeling And Memory Interaction In Learning Agents, Wenwen Wang, Ah-Hwee Tan, Loo-Nin Teow
Semantic Memory Modeling And Memory Interaction In Learning Agents, Wenwen Wang, Ah-Hwee Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
Semantic memory plays a critical role in reasoning and decision making. It enables an agent to abstract useful knowledge learned from its past experience. Based on an extension of fusion adaptive resonance theory network, this paper presents a novel self-organizing memory model to represent and learn various types of semantic knowledge in a unified manner. The proposed model, called fusion adaptive resonance theory for multimemory learning, incorporates a set of neural processes, through which it may transfer knowledge and cooperate with other long-term memory systems, including episodic memory and procedural memory. Specifically, we present a generic learning process, under which …
Robust Decision Making For Stochastic Network Design, Akshat Kumar, Arambam James Singh, Pradeep Varakantham, Daniel Sheldon
Robust Decision Making For Stochastic Network Design, Akshat Kumar, Arambam James Singh, Pradeep Varakantham, Daniel Sheldon
Research Collection School Of Computing and Information Systems
We address the problem of robust decision making for stochastic network design. Our work is motivated by spatial conservation planning where the goal is to take management decisions within a fixed budget to maximize the expected spread of a population of species over a network of land parcels. Most previous work for this problem assumes that accurate estimates of different network parameters (edge activation probabilities, habitat suitability scores) are available, which is an unrealistic assumption. To address this shortcoming, we assume that network parameters are only partially known, specified via interval bounds. We then develop a decision making approach that …
Nlu Framework For Voice Enabling Non-Native Applications On Smart Devices, Soujanya Lanka, Deepika Panthania, Pooja Kushalappa, Pradeep Varakantham
Nlu Framework For Voice Enabling Non-Native Applications On Smart Devices, Soujanya Lanka, Deepika Panthania, Pooja Kushalappa, Pradeep Varakantham
Research Collection School Of Computing and Information Systems
Voice is a critical user interface on smart devices (wearables, phones, speakers, televisions) to access applications (or services) available on them. Unfortunately, only a few native applications (provided by the OS developer) are typically voice enabled in devices of today. Since, the utility of a smart device is determined more by the strength of external applications developed for the device, voice enabling non-native applications in a scalable, seamless manner within the device is a critical use case and is the focus of our work. We have developed a Natural Language Understanding (NLU) framework that uses templates supported by the application …