Theory and Algorithms Commons^™

An Optimized Encoding Algorithm For Systematic Polar Codes, Xiumin Wang, Zhihong Zhang, Jun Li, Yu Wang, Haiyan Cao, Zhengquan Li, Liang Shan

Publications and Research

Many different encoding algorithms for systematic polar codes (SPC) have been introduced since SPC was proposed in 2011. However, the number of the computing units of exclusive OR (XOR) has not been optimized yet. According to an iterative property of the generator matrix and particular lower triangular structure of the matrix, we propose an optimized encoding algorithm (OEA) of SPC that can reduce the number of XOR computing units compared with existing non-recursive algorithms. We also prove that this property of the generator matrix could extend to different code lengths and rates of the polar codes. Through the matrix segmentation …

Who Should Pay The Cost: A Game-Theoretic Model For Government Subsidized Investments To Improve National Cybersecurity, Xinrun Wang, Bo An, Hau Chan

Research Collection School Of Computing and Information Systems

Due to the recent cyber attacks, cybersecurity is becoming more critical in modern society. A single attack (e.g., WannaCry ransomware attack) can cause as much as $4 billion in damage. However, the cybersecurity investment by companies is far from satisfactory. Therefore, governments (e.g., in the UK) launch grants and subsidies to help companies to boost their cybersecurity to create a safer national cyber environment. The allocation problem is hard due to limited subsidies and the interdependence between self-interested companies and the presence of a strategic cyber attacker. To tackle the government's allocation problem, we introduce a Stackelberg game-theoretic model where …

Formally Designing And Implementing Cyber Security Mechanisms In Industrial Control Networks., Mehdi Sabraoui

Electronic Theses and Dissertations

This dissertation describes progress in the state-of-the-art for developing and deploying formally verified cyber security devices in industrial control networks. It begins by detailing the unique struggles that are faced in industrial control networks and why concepts and technologies developed for securing traditional networks might not be appropriate. It uses these unique struggles and examples of contemporary cyber-attacks targeting control systems to argue that progress in securing control systems is best met with formal verification of systems, their specifications, and their security properties. This dissertation then presents a development process and identifies two technologies, TLA+ and seL4, that can be …

Simulated Annealing For The Multi-Vehicle Cyclic Inventory Routing Problem, Aldy Gunawan, Vincent F. Yu, Audrey Tedja Widjaja, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

This paper studies the Multi-Vehicle Cyclic Inventory Routing Problem (MV-CIRP) as the extension of the Single-Vehicle CIRP (SV-CIRP). The objective is to minimize both distribution and inventory costs at the customers and to maximize the collected rewards simultaneously. The problem is treated as a single objective optimization problem. A subset of customers is selected for each vehicle including the quantity to be delivered to each customer. For each vehicle, a cyclic distribution plan is developed. We construct a mathematical programming model and propose a simulated annealing (SA) metaheuristic for solving both SV-CIRP and MV-CIRP. For SV-CIRP, experimental results on benchmark …

Inspect: Iterated Local Search For Solving Path Conditions, Fuxiang Chen, Aldy Gunawan, David Lo, Sunghun Kim

Research Collection School Of Computing and Information Systems

Automated test case generation is attractive as it can reduce developer workload. To generate test cases, many Symbolic Execution approaches first produce Path Conditions (PCs), a set of constraints, and pass them to a Satisfiability Modulo Theories (SMT) solver. Despite numerous prior studies, automated test case generation by Symbolic Execution is still slow, partly due to SMT solvers’ high computationally complexity. We introduce InSPeCT, a Path Condition solver, that leverages elements of ILS (Iterated Local Search) and Tabu List. ILS is not computational intensive and focuses on generating solutions in search spaces while Tabu List prevents the use of previously …

Bidding Mechanisms In Graph Games, Guy Avni, Thomas A. Henzinger, Dorde Zikelic

Research Collection School Of Computing and Information Systems

In two-player games on graphs, the players move a token through a graph to produce a finite or infinite path, which determines the qualitative winner or quantitative payoff of the game. We study bidding games in which the players bid for the right to move the token. Several bidding rules were studied previously. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the “bank” rather than the other player. Taxman bidding spans the spectrum …

Definitions And Mathematical Models Of Single Vehicle Routing Problems With Profits, Pieter Vansteenwegen, Aldy Gunawan

Research Collection School Of Computing and Information Systems

In this chapter, single vehicle routing problems with profits are introduced anddefined. Three variants are considered: the profitable tour problem, the prizecollecting traveling salesperson problem, and the orienteering problem. The difference between these variants is the way in which the profit and the travel cost, mostlydistance or time, are modeled. Profit and travel cost can be modeled as (part of) theobjective or as a constraint. All three problems differ from the well-known travelingsalesperson problem, for which the only objective is to find the shortest route to visitall customers in a given set. In vehicle routing problems with profits, some customerswill …

State-Of-The-Art Solution Techniques For Op And Top, Pieter Vansteenwegen, Aldy Gunawan

Research Collection School Of Computing and Information Systems

Definitions and mathematical models of the OP and the TOP were introduced in Chaps. 2 and 3. In this chapter, we will discuss the benchmark instances and state-of-the-art solution techniques for both OP and TOP. Some illustrations of benchmark instances and solutions are included in order to increase the understanding in the difficulty of solving this problem and to provide additional insights. The solution techniques are classified into two different categories: exact approaches and (meta)heuristic techniques.

State-Of-The-Art Solution Techniques For Optw And Toptw, Pieter Vansteenwegen, Aldy Gunawan

Research Collection School Of Computing and Information Systems

In Chaps. 2 and 3, different orienteering problems (or routing problems with profits) were introduced. The single vehicle problems were discussed in Chap. 2: the profitable tour problem (PTP), the prize-collecting traveling salesperson problem (PCTSP), and the orienteering problem (OP). The multi vehicle problems were discussed in Chap. 3: the team orienteering problem (TOP) and the team orienteering problem with time windows (TOPTW). For discussing the state-of-the-art solution techniques for these different orienteering problems in Chaps. 4, 5, and 6, the problems will be classified differently, based on the similarities between the solution techniques. Therefore, the PTP and PCTSP are …

Applications Of The Op, Pieter Vansteenwegen, Aldy Gunawan

Research Collection School Of Computing and Information Systems

In recent years, we observe from literature that the VRP and OP, including their variants, have been used to model many different planning and scheduling problems from practice, such as the routing of technicians, athlete recruitment, or military applications. Recently, other practical applications, such as the tourist trip design problem, the mobile crowdsourcing problem, the smuggler search problem, the wildfire routing problem, and the integration of vehicle routing, inventory management, and customer selection problems, have been studied and use the OP as a basic model. In this chapter, various practical applications will be discussed in more detail. We will describe …

Suitability Of Finite State Automata To Model String Constraints In Probablistic Symbolic Execution, Andrew Harris

Boise State University Theses and Dissertations

Probabilistic Symbolic Execution (PSE) extends Symbolic Execution (SE), a path-sensitive static program analysis technique, by calculating the probabilities with which program paths are executed. PSE relies on the ability of the underlying symbolic models to accurately represent the execution paths of the program as the collection of input values following these paths. While researchers established PSE for numerical data types, PSE for complex data types such as strings is a novel area of research.

For string data types SE tools commonly utilize finite state automata to represent a symbolic string model. Thus, PSE inherits from SE automata-based symbolic string models …

Quantum Algorithms With Applications To Simulating Physical Systems, Anirban Ch Narayan Chowdhury

Physics & Astronomy ETDs

The simulation of quantum physical systems is expected to be an important application for quantum computers. The work presented in this dissertation aims to improve the resource requirements of quantum computers for solving simulation problems, by providing both novel quantum algorithms and improved implementations of existing ones. I present three main results that cover diverse aspects of simulation including equilibrium physics, the preparation of useful quantum states, and simulations based on classical stochastic processes. The results rely on established quantum algorithms and other recent techniques which I review. My first original contribution is a new quantum algorithm to sample from …

Mathematical And Computer Simulation Of The Processes Of Two-Phase Joint Gas Filtration And Water In A Porous Environment, Elmira Nazirova

Bulletin of TUIT: Management and Communication Technologies

A mathematical model, methods and algorithms for the numerical solution of problems of joint gas-water filtration in porous media are considered. The mathematical model of the process of non-stationary joint gas-water filtration in a porous medium is described by a system of nonlinear differential equations of parabolic type. In the numerical solution of the boundary value problem of gas displacement by water in a porous medium, the differential sweeping method is used for systems of differential-difference equations. The system of differential-difference equations with respect to the gas pressure function is nonlinear, therefore, an iterative method is used for it, based …

Adaboost‑Based Security Level Classifcation Of Mobile Intelligent Terminals, Feng Wang, Houbing Song, Dingde Jiang, Hong Wen

Publications

With the rapid development of Internet of Things, massive mobile intelligent terminals are ready to access edge servers for real-time data calculation and interaction. However, the risk of private data leakage follows simultaneously. As the administrator of all intelligent terminals in a region, the edge server needs to clarify the ability of the managed intelligent terminals to defend against malicious attacks. Therefore, the security level classification for mobile intelligent terminals before accessing the network is indispensable. In this paper, we firstly propose a safety assessment method to detect the weakness of mobile intelligent terminals. Secondly, we match the evaluation results …

Some Theoretical Links Between Shortest Path Filters And Minimum Spanning Tree Filters, Sravan Danda, Aditya Challa, B. S.Daya Sagar, Laurent Najman

Journal Articles

Edge-aware filtering is an important pre-processing step in many computer vision applications. In the literature, there exist several versions of collaborative edge-aware filters based on spanning trees and shortest path heuristics which work well in practice. For instance, tree filter (TF) which is recently proposed based on a minimum spanning tree (MST) heuristic yields promising results in many filtering applications. However, links between the tree-based filters and shortest path-based filters are faintly explored. In this article, we introduce an edge-aware generalization of the TF termed as UMST filter based on a subgraph generated by edges of all MSTs. The major …

Identifying Depression In The National Health And Nutrition Examination Survey Data Using A Deep Learning Algorithm, Jihoon Oh, Kyongsik Yun, Uri Maoz, Tae-Suk Kim, Jeong-Ho Chae

Psychology Faculty Articles and Research

Background

As depression is the leading cause of disability worldwide, large-scale surveys have been conducted to establish the occurrence and risk factors of depression. However, accurately estimating epidemiological factors leading up to depression has remained challenging. Deep-learning algorithms can be applied to assess the factors leading up to prevalence and clinical manifestations of depression.

Methods

Customized deep-neural-network and machine-learning classifiers were assessed using survey data from 19,725 participants from the NHANES database (from 1999 through 2014) and 4949 from the South Korea NHANES (K-NHANES) database in 2014.

Results

A deep-learning algorithm showed area under the receiver operating characteristic curve (AUCs) …

Wing Design Using Sail, Leonid Scott

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

In engineering spaces where modeling is difficult, engineers seek a variety of well performing solutions in order to concentrate resources on promising areas of the problem space. We call this process illumination. Gaire et al have designed an algorithm specifically for illumination of problem spaces where the underlying model is computationally expensive. This algorithm, Surrogate Assisted Illumination (SAIL) uses an evolutionary algorithm called MAP-Elites to do illumination. However, SAIL introduces a Gaussian process to simulate the computationally expensive model, and Bayesian optimization for quality control of the Gaussian process. SAIL has demonstrated potential for finding a variety of well performing …

Tools To Improve Interruption Management, Matthew R. Munns

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

Interruptions carry a high cost, especially to software developers. To prevent unnecessary interruptions, several technologies are being explored that can help manage the timing of interruptions, such as displaying the interruptibility of a worker to their peers. Relatively simple algorithms utilizing computer interaction data have been created and used successfully in the workplace, while technology using bio-metric emotion recognition to detect the interruptibility of a user is also being developed.

Using Forensics To Introduce Ir Spectroscopy & Molecular Modeling, Joseph T. Golab

Faculty Publications & Research

A student activity is reported that analyzes “medical evidence” with experimental and computational methods. The lesson demonstrates benefits of solving practical problems with integrated tools.

A Review On Swarm Intelligence And Evolutionary Algorithms For Solving Flexible Job Shop Scheduling Problems, Kaizhou Gao, Zhiguang Cao, Le Zhang, Zhenghua Chen, Yuyan Han, Quanke Pan

Research Collection School Of Computing and Information Systems

Flexible job shop scheduling problems (FJSP) have received much attention from academia and industry for many years. Due to their exponential complexity, swarm intelligence (SI) and evolutionary algorithms (EA) are developed, employed and improved for solving them. More than 60% of the publications are related to SI and EA. This paper intents to give a comprehensive literature review of SI and EA for solving FJSP. First, the mathematical model of FJSP is presented and the constraints in applications are summarized. Then, the encoding and decoding strategies for connecting the problem and algorithms are reviewed. The strategies for initializing algorithms? population …