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

Computer Sciences Commons™

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

2015

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 991 - 1020 of 2105

Full-Text Articles in Computer Sciences

Direct: A Scalable Approach For Route Guidance In Selfish Orienteering Problems, Pradeep Varakantham, Hala Mostafa, Na Fu, Hoong Chuin Lau May 2015

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 …

Go to article

Simulation In Algorithmic Self-Assembly, Jacob Hendricks May 2015

Simulation In Algorithmic Self-Assembly, Jacob Hendricks

Graduate Theses and Dissertations

Winfree introduced a model of self-assembling systems called the abstract Tile Assembly Model (aTAM) where square tiles with glues on their edges attach spontaneously via matching glues to form complex structures. A generalization of the aTAM called the 2HAM (two-handed aTAM) not only allows for single tiles to bind, but also for "supertile" assemblies consisting of any number of tiles to attach. We consider a variety of models based on either the aTAM or the 2HAM. The underlying commonality of the work presented here is simulation. We introduce the polyTAM, where a tile system consists of a collection of polyomino …

Go to article

The All-Digital Future And Digital Cise, George K. Thiruvathukal May 2015

The All-Digital Future And Digital Cise, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

EIC George Thiruvathukal describes the magazine's digital future and the importance of archives--being able to access digital content in the years to come will be an important challenge for both publishers and readers.

Go to article

Concurrent Non-Blocking Skip List Using Multi-Word Compare And Swap Operation, Anish Ratna Tuladhar May 2015

Concurrent Non-Blocking Skip List Using Multi-Word Compare And Swap Operation, Anish Ratna Tuladhar

UNLV Theses, Dissertations, Professional Papers, and Capstones

We present a non-blocking lock-free implementation of skip list data structure using multi word compare and swap (CASN) operation. This operation is designed to work on arbitrary number of memory locations as a single atomic step. We discuss the implementation details of CASN operation which only utilizes the single word compare and swap atomic primitive found in most of the contemporary multiprocessor systems. Using this operation, we first design lock-free algorithms to implement various operations on linked list data structure, then extend it to design skip lists. Skip list is a probabilistic data structure composed of linked lists stacked together …

Go to article

Fake And Spam Messages: Detecting Misinformation During Natural Disasters On Social Media, Meet Rajdev May 2015

Fake And Spam Messages: Detecting Misinformation During Natural Disasters On Social Media, Meet Rajdev

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

During natural disasters or crises, users on social media tend to easily believe contents of postings related to the events, and retweet the postings, hoping that the postings will be reached by many other users. Unfortunately, there are malicious users who understand the tendency and post misinformation such as spam and fake messages with expecting wider propagation. To resolve the problem, in this paper we conduct a case study of the 2013 Moore Tornado and Hurricane Sandy. Concretely, we (i) understand behaviors of these malicious users; (ii) analyze properties of spam, fake and legitimate messages; (iii) propose flat and hierarchical …

Go to article

The Onion Name System: Tor-Powered Distributed Dns For Tor Hidden Services, Jesse Victors May 2015

The Onion Name System: Tor-Powered Distributed Dns For Tor Hidden Services, Jesse Victors

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

The Tor network is a third-generation onion router that aims to provide private and anonymous Internet access to its users. In recent years its userbase, network, and community have grown significantly in response to revelations of national and global electronic surveillance, and it remains one of the most popular anonymity networks in use today. Tor also provides access to anonymous servers known as hidden services – servers of unknown location and ownership that may provide websites, chat services, or an electronic dead drop. These hidden services can be accessed through any Tor-powered web browser but they suffer from usability challenges …

Go to article

Efficient Reverse Top-K Boolean Spatial Keyword Queries On Road Networks, Yunjun Gao, Xu Qin, Baihua Zheng, Gang Chen May 2015

Efficient Reverse Top-K Boolean Spatial Keyword Queries On Road Networks, Yunjun Gao, Xu Qin, Baihua Zheng, Gang Chen

Research Collection School Of Computing and Information Systems

Reverse k nearest neighbor (RkNN) queries have a broad application base such as decision support, profile-based marketing, and resource allocation. Previous work on RkNN search does not take textual information into consideration or limits to the Euclidean space. In the real world, however, most spatial objects are associated with textual information and lie on road networks. In this paper, we introduce a new type of queries, namely, reverse top-k Boolean spatial keyword (RkBSK) retrieval, which assumes objects are on the road network and considers both spatial and textual information. Given a data set P on a road network and a …

Go to article

Flutcha: Using Fluency To Distinguish Humans From Computers, Kotaro Hara, Mohammad Taghi Hajiaghayi, Benjamin B. Benderson May 2015

Flutcha: Using Fluency To Distinguish Humans From Computers, Kotaro Hara, Mohammad Taghi Hajiaghayi, Benjamin B. Benderson

Research Collection School Of Computing and Information Systems

Improvements in image understanding technologies aremaking it possible for computers to pass traditionalCAPTCHA tests with high probability. This suggests theneed for new kinds of tasks that are easy to accomplishfor humans but remain difficult for computers. In thispaper, we introduce Fluency CAPTCHA (FluTCHA), anovel method to distinguish humans from computersusing the fact that humans are better than machines atimproving the fluency of sentences. We propose a wayto let users work on FluTCHA tests and simultaneouslycomplete useful linguistic tasks. Evaluation studiesdemonstrate the feasibility of using FluTCHA todistinguish humans from computers.

Go to article

Electronic Contract Signing Without Using Trusted Third Party, Zhiguo Wan, Robert H. Deng, David Kuo Chuen Lee May 2015

Electronic Contract Signing Without Using Trusted Third Party, Zhiguo Wan, Robert H. Deng, David Kuo Chuen Lee

Research Collection School Of Computing and Information Systems

Electronic contract signing allows two potentially dis-trustful parties to digitally sign an electronic document “simultaneously” across a network. Existing solutions for electronic contract signing either require the involvement of a trusted third party (TTP), or are complex and expensive in communication and computation. In this paper we propose an electronic contract signing protocol between two parties with the following advantages over existing solutions: 1) it is practical and scalable due to its simplicity and high efficiency; 2) it does not require any trusted third party as the mediator; and 3) it guarantees fairness between the two signing parties. We achieve …

Go to article

Matchmaking Game Players On Public Transport, Nairan Zhang, Youngki Lee, Rajesh Krishna Balan May 2015

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 …

Go to article

Predicting Bundles Of Spatial Locations From Learning Revealed Preference Data, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan May 2015

Predicting Bundles Of Spatial Locations From Learning Revealed Preference Data, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau, Ramayya Krishnan

Research Collection School Of Computing and Information Systems

We propose the problem of predicting a bundle of goods, where the goods considered is a set of spatial locations that an agent wishes to visit. This typically arises in the tourism setting where attractions can often be bundled and sold as a package to visitors. While the problem of predicting future locations given the current and past trajectories is well-established, we take a radical approach by looking at it from an economic point of view. We view an agent's past trajectories as revealed preference (RP) data, where the choice of locations is a solution to an optimisation problem according …

Go to article

Gameon: P2p Gaming On Public Transport, Nairan Zhang, Youngki Lee, Meera Radhakrishnan, Rajesh Krishna Balan May 2015

Gameon: P2p Gaming On Public Transport, Nairan Zhang, Youngki Lee, Meera Radhakrishnan, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

Mobile games, and especially multiplayer games are a very popular daily distraction for many users. We hypothesise that commuters travelling on public buses or trains would enjoy being able to play multiplayer games with their fellow commuters to alleviate the commute burden and boredom. We present quantitative data to show that the typical one-way commute time is fairly long (at least 25 minutes on average) as well as survey results indicating that commuters are willing to play multiplayer games with other random commuters. In this paper, we present GameOn, a system that allows commuters to participate in multiplayer games with …

Go to article

Solving Multi-Vehicle Profitable Tour Problem Via Knowledge Adoption In Evolutionary Bi-Level Programming, Stephanus Daniel Handoko, Abhishek Gupta, Chen Kim Heng, Hoong Chuin Lau, Yew Soon Ong, Puay Siew Tan May 2015

Solving Multi-Vehicle Profitable Tour Problem Via Knowledge Adoption In Evolutionary Bi-Level Programming, Stephanus Daniel Handoko, Abhishek Gupta, Chen Kim Heng, Hoong Chuin Lau, Yew Soon Ong, Puay Siew Tan

Research Collection School Of Computing and Information Systems

Profitable tour problem (PTP) belongs to the class of vehicle routing problem (VRP) with profits seeking to maximize the difference between the total collected profit and the total cost incurred. Traditionally, PTP involves single vehicle. In this paper, we consider PTP with multiple vehicles. Unlike the classical VRP that seeks to serve all customers, PTP involves the strategic-level customer selection so as to maximize the total collected profit and the operational-level route optimization to minimize the total cost incurred. Therefore, PTP is essentially the knapsack problem at the strategic level with VRP at the operational level. That means the evolutionary …

Go to article

Measuring Centralities For Transportation Networks Beyond Structures, Yew-Yih Cheng, Lee Ka Wei, Roy, Ee-Peng Lim, Feida Zhu May 2015

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 …

Go to article

A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger May 2015

A Nested Recursive Logit Model For Route Choice Analysis, Tien Mai, Mogens Fosgerau, Emma Frejinger

Research Collection School Of Computing and Information Systems

We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination. The value …

Go to article

Ambient Rendezvous: Energy Efficient Neighbor Discovery Via Acoustic Sensing, Keyu Wang, Zheng Yang, Zimu Zhou, Yunhao Liu, Lionel M. Ni May 2015

Ambient Rendezvous: Energy Efficient Neighbor Discovery Via Acoustic Sensing, Keyu Wang, Zheng Yang, Zimu Zhou, Yunhao Liu, Lionel M. Ni

Research Collection School Of Computing and Information Systems

The continual proliferation of mobile devices has stimulated the development of opportunistic encounter-based networking and has spurred a myriad of proximity-based mobile applications. A primary cornerstone of such applications is to discover neighboring devices effectively and efficiently. Despite extensive protocol optimization, current neighbor discovery modalities mainly rely on radio interfaces, whose energy and wake up delay required to initiate, configure and operate these protocols hamper practical applicability. Unlike conventional schemes that actively emit radio tones, we exploit ubiquitous audio events to discover neighbors passively. The rationale is that spatially adjacent neighbors tend to share similar ambient acoustic environments. We propose …

Go to article

Mining Patterns Of Unsatisfiable Constraints To Detect Infeasible Paths, Sun Ding, Hee Beng Kuan Tan, Lwin Khin Shar May 2015

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 …

Go to article

Map: A Computational Model For Adaptive Persuasion, Yilin Kang, Ah-Hwee Tan May 2015

Map: A Computational Model For Adaptive Persuasion, Yilin Kang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

While a variety of persuasion agents have been created and applied in different domains such as marketing, military training and health industry, there is a lack of a model which provides a unified framework for different persuasion strategies. Specifically, persuasion is not adaptable to the individuals’ personal states in different situations. Grounded in the Elaboration Likelihood Model (ELM), this paper presents a computational model called Model for Adaptive Persuasion (MAP) for virtual agents. MAP is a semi-connected network model which enables an agent to adapt its persuasion strategies through feedback. We have implemented and evaluated a MAP-based virtual nurse agent …

Go to article

Multi-Agent Task Assignment For Mobile Crowdsourcing Under Trajectory Uncertainties, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau, Archan Misra May 2015

Multi-Agent Task Assignment For Mobile Crowdsourcing Under Trajectory Uncertainties, Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau, Archan Misra

Research Collection School Of Computing and Information Systems

In this work, we investigate the problem of mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually browse and filter tasks to perform, we intend to automatically make task recommendations based on workers' historical trajectories and desired time budgets. However, predicting workers' trajectories is inevitably faced with uncertainties, as no one will take exactly the same route every day; yet such uncertainties are oftentimes abstracted away in the known literature. In this work, we depart from the deterministic modeling and study the stochastic task recommendation problem where …

Go to article

Oscar: Online Selection Of Algorithm Portfolios With Case Study On Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau May 2015

Oscar: Online Selection Of Algorithm Portfolios With Case Study On Memetic Algorithms, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper introduces an automated approach called OSCAR that combines algorithm portfolios and online algorithm selection. The goal of algorithm portfolios is to construct a subset of algorithms with diverse problem solving capabilities. The portfolio is then used to select algorithms from for solving a particular (set of) instance(s). Traditionally, algorithm selection is usually performed in an offline manner and requires the need of domain knowledge about the target problem; while online algorithm selection techniques tend not to pay much attention to a careful construction of algorithm portfolios. By combining algorithm portfolios and online selection, our hope is to design …

Go to article

Adviser: A Web-Based Algorithm Portfolio Deviser, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau May 2015

Adviser: A Web-Based Algorithm Portfolio Deviser, Mustafa Misir, Stephanus Daniel Handoko, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The basic idea of algorithm portfolio [1] is to create a mixture of diverse algorithms that complement each other’s strength so as to solve a diverse set of problem instances. Algorithm portfolios have taken on a new and practical meaning today with the wide availability of multi-core processors: from an enterprise perspective, the interest is to make best use of parallel machines within the organization by running different algorithms simultaneously on different cores to solve a given problem instance. Parallel execution of a portfolio of algorithms as suggested by [2, 3] a number of years …

Go to article

Rclinker: Automated Linking Of Issue Reports And Commits Leveraging Rich Contextual Information, Tien-Duy B. Le, Mario Linares Vasquez, David Lo, Denys Poshyvanyk May 2015

Rclinker: Automated Linking Of Issue Reports And Commits Leveraging Rich Contextual Information, Tien-Duy B. Le, Mario Linares Vasquez, David Lo, Denys Poshyvanyk

Research Collection School Of Computing and Information Systems

Links between issue reports and their corresponding commits in version control systems are often missing. However, these links are important for measuring the quality of a software system, predicting defects, and many other tasks. Several approaches have been designed to solve this problem by automatically linking bug reports to source code commits via comparison of textual information in commit messages and bug reports. Yet, the effectiveness of these techniques is oftentimes suboptimal when commit messages are empty or contain minimum information; this particular problem makes the process of recovering traceability links between commits and bug reports particularly challenging. In this …

Go to article

Active Semi-Supervised Defect Categorization, Ferdian Thung, Xuan-Bach D. Le, David Lo May 2015

Active Semi-Supervised Defect Categorization, Ferdian Thung, Xuan-Bach D. Le, David Lo

Research Collection School Of Computing and Information Systems

Defects are inseparable part of software development and evolution. To better comprehend problems affecting a software system, developers often store historical defects and these defects can be categorized into families. IBM proposes Orthogonal Defect Categorization (ODC) which include various classifications of defects based on a number of orthogonal dimensions (e.g., symptoms and semantics of defects, root causes of defects, etc.). To help developers categorize defects, several approaches that employ machine learning have been proposed in the literature. Unfortunately, these approaches often require developers to manually label a large number of defect examples. In practice, manually labelling a large number of …

Go to article

Beyond Traits: Social Context Based Personality Model, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann May 2015

Beyond Traits: Social Context Based Personality Model, Jaroslaw Kochanowicz, Ah-Hwee Tan, Daniel Thalmann

Research Collection School Of Computing and Information Systems

The relation between individual’s personality and environmental context is a key issue in psychology, recently also in character simulations. This paper contributes to both domains by proposing a socio-cognitive, contextual personality model - a new voice in a century old problem of personality, but also an approach to simulating groups of more humanlike agents. After analyzing the influence of popularity of ‘trait personality models’ on psychology and computer simulation, we propose Social Context based Personality model - a continuation and specification of the Cognitive-Affective Personality System theory. The discussion, model and implementation are provided, followed by an example application in …

Go to article

Report On The Fg 2015 Video Person Recognition Evaluation, J.R. Beveridge, H. Zhang, B.A. Draper, P.J. Flynn, Z. Feng, P. Huber, J. Kittler, Zhiwu Huang, Li S., Li Y., M. Kan, R. Wang, S. Shan, X. Chen, Li H., G. Hua, V. Struc, J. Krizaj, C. Ding, D. Tao May 2015

Report On The Fg 2015 Video Person Recognition Evaluation, J.R. Beveridge, H. Zhang, B.A. Draper, P.J. Flynn, Z. Feng, P. Huber, J. Kittler, Zhiwu Huang, Li S., Li Y., M. Kan, R. Wang, S. Shan, X. Chen, Li H., G. Hua, V. Struc, J. Krizaj, C. Ding, D. Tao

Research Collection School Of Computing and Information Systems

This report presents results from the Video Person Recognition Evaluation held in conjunction with the 11th IEEE International Conference on Automatic Face and Gesture Recognition. Two experiments required algorithms to recognize people in videos from the Point-and-Shoot Face Recognition Challenge Problem (PaSC). The first consisted of videos from a tripod mounted high quality video camera. The second contained videos acquired from 5 different handheld video cameras. There were 1401 videos in each experiment of 265 subjects. The subjects, the scenes, and the actions carried out by the people are the same in both experiments. Five groups from around the world …

Go to article

Tasknav: Task-Based Navigation Of Software Documentation, Christoph Treude, Mathieu Sicard, Marc Klocke, Martin P. Robillard May 2015

Tasknav: Task-Based Navigation Of Software Documentation, Christoph Treude, Mathieu Sicard, Marc Klocke, Martin P. Robillard

Research Collection School Of Computing and Information Systems

To help developers navigate documentation, we introduce Task Nav, a tool that automatically discovers and indexes task descriptions in software documentation. With Task Nav, we conceptualize tasks as specific programming actions that have been described in the documentation. Task Nav presents these extracted task descriptions along with concepts, code elements, and section headers in an auto-complete search interface. Our preliminary evaluation indicates that search results identified through extracted task descriptions are more helpful to developers than those found through other means, and that they help bridge the gap between documentation structure and the information needs of software developers. Video: https://www.youtube.com/watch?v=opnGYmMGnqY.

Go to article

Scalable Multi-Hop Data Dissemination In Vehicular Ad Hoc Networks, Moumena Abdullah Chaqfeh May 2015

Scalable Multi-Hop Data Dissemination In Vehicular Ad Hoc Networks, Moumena Abdullah Chaqfeh

Dissertations

Vehicular Ad hoc Networks (VANETs) aim at improving road safety and travel comfort, by providing self-organizing environments to disseminate traffic data, without requiring fixed infrastructure or centralized administration. Since traffic data is of public interest and usually benefit a group of users rather than a specific individual, it is more appropriate to rely on broadcasting for data dissemination in VANETs. However, broadcasting under dense networks suffers from high percentage of data redundancy that wastes the limited radio channel bandwidth. Moreover, packet collisions may lead to the broadcast storm problem when large number of vehicles in the same vicinity rebroadcast nearly …

Go to article

A Partial Replication Load Balancing Technique For Distributed Data As A Service On The Cloud, Klaithem Saeed Al Nuaimi May 2015

A Partial Replication Load Balancing Technique For Distributed Data As A Service On The Cloud, Klaithem Saeed Al Nuaimi

Dissertations

Data as a service (DaaS) is an important model on the Cloud, as DaaS provides clients with different types of large files and data sets in fields like finance, science, health, geography, astronomy, and many others. This includes all types of files with varying sizes from a few kilobytes to hundreds of terabytes. DaaS can be implemented and provided using multiple data centers located at different locations and usually connected via the Internet. When data is provided using multiple data centers it is referred to as distributed DaaS. DaaS providers must ensure that their services are fast, reliable, and efficient. …

Go to article

Efficient Estimation Of Cluster Population, Sanjeev K C May 2015

Efficient Estimation Of Cluster Population, Sanjeev K C

UNLV Theses, Dissertations, Professional Papers, and Capstones

Partitioning a given set of points into clusters is a well known problem in pattern recognition, data mining, and knowledge discovery. One of the well known methods for identifying clusters in Euclidean space is the K-mean algorithm. In using the K-mean clustering algorithm it is necessary to know the value of k (the number of clusters) in advance. We propose to develop algorithms for good estimation of k for points distributed in two dimensions. The techniques we pursue include a bucketing method, g-hop neighbors, and Voronoi diagrams. We also present experimental results for examining the performances of the bucketing method …

Go to article

Situational Assessment Using Graph Comparison, Pavan Kumar Pallapunidi May 2015

Situational Assessment Using Graph Comparison, Pavan Kumar Pallapunidi

UNLV Theses, Dissertations, Professional Papers, and Capstones

In strategic operations, the assessment of any given situation is very important and may trigger the development of a mission plan. The mission plan consists of various actions that should be executed in order to successfully mitigate the situation. For a new mission plan to be designed or implemented, the effect of the previous mission plan should be accessed. These mission plans use various sensors to collect the data which can be very large and aggregate them to obtain detailed information of the situation. In order to implement an effective mission plan the current situation has to be assessed effectively. …

Go to article

First Prev Next Last