One possibility to automate more of software testing is to have developers write more general test cases. Given a general (parameterized test case), that holds in many situations, software can generate many different test instances and execute them automatically. Thus, even though the developers write fewer and smaller tests they can test more. However, it is not clear what other effects the use of generalized test cases has. One hypothesis is that “More general test cases are harder to understand than concrete ones and thus would lead to overall tests that are harder to understand”. Software understandability can be defined as the system that is written by one person is easy to read and understand by another person easily without any resistance. However, software understandability is hard to measure because understandability depends on the cognitive behavior of human. Software understandability assists in software reusability and software maintainability.

Ce travail s'inscrit dans le cadre de la vérification formelle de programmes. La vérification de modèle permet de s'assurer qu'une propriété est vérifiée par le modèle du système. Cette thèse étudie la vérification paramétrée de réseaux composés d'un nombre non borné de processus identiques où le nombre de processus est considéré comme un paramètre. Concernant les réseaux de protocoles probabilistes temporisés nous montrons que les problèmes de l'accessibilité et de synchronisation sont indécidables pour des topologies de communication en cliques. Cependant, en considérant des pertes et créations probabiliste de processus ces problèmes deviennent décidables. Pour ce qui est des réseaux dans lequel les messages n'atteignent qu'une sous partie des composants choisie de manière non-déterministe, nous prouvons que le problème de l'accessibilité paramétrée est décidable grâce à une réduction à un nouveau modèle de jeux à deux joueurs distribué pour lequel nous montrons que l'on peut décider de l'existence d'une stratégie gagnante en coNP. Finalement, nous considérons des stratégies locales qui permettent d'assurer que les processus effectuent leurs choix non-déterministes uniquement par rapport a leur connaissance locale du système. Sous cette hypothèse de stratégies locales, nous prouvons que les problèmes de l'accessibilité et de synchronisation paramétrées sont NP-complet. / This thesis deals with formal verification of distributed systems. Model checking is a technique for verifying that the model of a system under study fulfills a given property. This PhD investigates the parameterized verification of networks composed of many identical processes for which the number of processes is the parameter. Considering networks of probabilistic timed protocols, we show that the parameterized reachability and synchronization problems are undecidable when the communication topology is a clique. However, assuming probabilistic creation and deletion of processes, the problems become decidable. Regarding selective networks, where the messages only reach a subset of the components, we show decidability of the parameterized reachability problem thanks to reduction to a new model of distributed two-player games for which we prove decidability in coNP of the game problem. Finally, we consider local strategies that enforce all processes to resolve the non-determinism only according to their own local knowledge. Under this assumption of local strategy, we were able to show that the parameterized reachability and synchronization problems are NP-complete.

This paper investigates the linear elastic behavior of timber shear walls under monotonic prescribed displacement. ABAQUS© 16.4-5, is a numerical finite element software used as the primary analysis methodology.  Parameterized models are created for two shear wall specimens of different geometry concerning door and window configurations. The shear walls are simulated as solid timber framing which is mechanically connected to gypsum sheathing board through fasteners. The primary findings are the linear elastic shear force distribution of the mechanical joints. Additionally, deformations and reaction forces of the shear walls are determined. The overall horizontal shear wall behavior of each specific wall was also studied in the presence of door and window openings. The simulations indicate there is a clear deformation difference in the behaviors of the two shear walls. Furthermore, the highest shear force values of the fasteners are located around the corners of the openings. The findings are supported by other researcher’s experiments and analytical tests, timber shear wall theory and Eurocode design requirements.

Widespread accessibility to the Internet and the proliferation of Web 2.0 technologies has led to the growth of online tools for educational content creation, delivery, and assessment. Maintaining high quality of assessment using this medium is made more practical by using tools to author and represent a broad range of assessment problems. A survey of existing problem-authoring tools uncovered two main deficiencies: (a) lack of support for authoring "dynamic" (parameterized) problems, and (b) lack of tools that are independent of a specific publishing format, persistence format, and/or authoring platform. Dynamic problems are assessment problem templates that support parameterization of the problems by the use of variables. Variables dynamically take values assigned at random to generate different instances of a problem from a template. This provides for greater diversity of authored problems, and permits students to practice with different variations of a problem. In existing problem authoring tools, the problem types supported are often limited to static problems. A formal definition of an assessment problem structure is presented. This formal definition served as a design aide for a new problem authoring system named QBank, a web-based tool that supports authoring dynamic problems. The proof-of-concept implementation of QBank supports export of questions in CSV format and the Khan Academy Exercise format. The extensible nature of the framework allows future development of features supporting export of authored problems into other publishing and/or persistence formats. / Master of Science

No description available.

In this thesis a novel approach in generating 3D IGP is applied using shape grammar, an effective pattern generation method. The particular emphasis here is to generate the motifs (repeat unit) in 3D using parameterization, which can then be manipulated within 3D space to construct architectural structures. Three unique distinctive shape grammar algorithms were developed in 3D; Parameterized Shape Grammar (PSG), Auto-Parameterized Shape Grammar (APSG) and Volumetric Shell Shape Grammar (VSSG). Firstly, the PSG generates the motifs in 3D. It allows one to use a single changeable regular 3D polygon, and forms a motif by given grammar rules including, Euclidean transformations and Boolean operations. Next, APSG was used to construct the architectural structures that manipulates the motif by automating the grammar rules. The APSG forms a wall, a column, a self-similarity star and a dome, the main features of Islamic architecture. However, applying Euclidean transformations to create non-Euclidean surfaces resulted in gaps and or overlaps which does not form a perfect tessellation. This is improved upon by the VSSM, which integrates two key methods, shell mapping and coherent point drift, to map an aesthetically accurate 3D IGM on a given surface. This work has successfully presented methods for creating complex intricate 3D Islamic Geometric Motifs (IGM), and provided an efficient mapping technique to form visually appealing decorated structures. / Partially funded by the Centre of Visual Computing (CVC)

Alliances are used to denote agreements between members of a group with similar interests. Alliances can occur between nations, biological sequences, business cartels, and other entities. The notion of alliances in graphs was first introduced by Kristiansen, Hedetniemi, and Hedetniemi in . A defensive alliance in a graph G = (V, E) is a non empty set S ⊆ V where, for all x ∈ S, |N[x] ∩ S| ≥ |N[x] − S|. Consequently, every vertex that is a member of a defensive alliance has at least as many vertices defending it as there are vertices attacking it. Alliances can be used to model a variety of applications such as classification problems, communities in the web distributed protocols, etc [Sha01, FLG00, SX07]. In [GK98, GK00], Gerber and Kobler introduced the problem of partitioning a graph into strong defensive alliances for the first time as the "Satisfactory Graph Partitioning (SGP)" problem. In his dissertation , Shafique used the problem of partitioning a graph into alliances to model problems in data clustering. Decision problems for several types of alliances and alliance partitions have been shown to be NP-complete. However, because of their applicability, it is of interest to study methods to overcome the complexity of these problems. In this thesis, we will present a variety of algorithms for finding alliances in different families of graphs with a running time that is polynomial in terms of the size of the input, and allowing exponential running time as a function of a chosen parameter. This study is guided by the theory of parameterized complexity introduced by Rod Downey and Michael Fellows in [DF99]. In addition to parameterized algorithms for alliance related problems, we study the partition of series-parallel graphs into alliances. The class of series-parallel graphs is a special class in graph theory since many problems known to be NP-complete on general graphs have been shown to have polynomial time algorithms on series-parallel graphs [ZLL04, Hoj95, DS99, HHL87, TNS82]. For example, the problem of finding a minimum defensive alliance has been shown to have a linear time algorithm when restricted to series-parallel graphs . Series-parallel graphs have also been to focus of study in a wide range of applications including CMOS layout and scheduling problems [ML86, Oud97]. Our motivation is driven by clustering properties that can be modeled with alliances. We observe that partitioning series-parallel graphs into alliances of roughly the same size can be used to partition task graphs to minimize the communication between processors and balance the workload of each processor. We present a characterization of series-parallel graphs that allow a partition into defensive alliances and a subclass of series-parallel graphs with a satisfactory partitions.

<p>We demonstrate how quantum machine learning might play a vital role in achieving moderate speedups in machine learning problems and might have scope for providing rich models to describe the distribution underlying the observed data. We work with Restricted Boltzmann Machines to demonstrate the same to supervised learning tasks. We compare the relative performance of contrastive divergence with sampling from Dwave annealer on bars and stripes dataset and then on imabalanced network security data set. Later we do training using Quantum Imaginary Time Evolution, that is well suited for the Noisy Intermediate-Scale Quantum era to perform classification on MNIST data set.  </p>

Pile-supported ports allow seawater to run below the deck, and thus may suffer structural damages during extreme coastal events such as hurricanes. These structural damages, in turn, may result to port closures that can cause significant economic losses. Risk analysis can predict the post-hazard functionality of ports though the structural damage assessment of these structures prior to coastal events. However, assumptions on the selected demand estimates may affect the estimated probability of structural damage. This research aims to shed light on the sensitivity of the wave model selection for the risk assessment of pile-supported ports when subjected to storm surge and waves. The examined structural damage is the uplift of the deck, and the risk assessment is conducted through the development of fragility curves for a typical deck-pile connection, for which fragility curves are developed for different wave models. Uncertainties are also considered in parameters affecting the demand and capacity of the examined deck-pile connection and are propagated through the Monte Carlo simulation using the Latin Hypercube Sampling. The results indicate changes to the uplift probability as a result of the selected wave model. Thus, wave model selection can alter the uplift failure probability. In addition, the study proposes parameterized fragility models to enable the uplift risk assessment across a region. The presented results aim to throw light on the proper model selection to produce more realistic risk assessment estimates towards the resilience of coastal infrastructure. / Thesis / Master of Applied Science (MASc)

<p>We investigate the problem of the maximum number of distinct primitively rooted squares in a string. In comparison to considering general strings, the number of distinct symbols in the string is introduced as an additional parameter of the problem. Let S(d,n) = max {s(x) | x is a (d,n)-string}, where s(x) denotes the number of distinct primitively rooted squares in a string x and a (d,n)-string denotes a string of length n with exactly d distinct symbols.</p> <p>Inspired by the d-step approach which was instrumental in Santos' tackling of the Hirsch conjecture, we introduce a (d,n-d) table with entries S(d,n) where d is the index for the rows and n-d is the index for the columns. We examine the properties of the S(d,n) function in the context of (d,n-d) table and conjecture that the value of S(d,n) is no more than n-d. We present several equivalent properties with the conjecture. We discuss the significance of the main diagonal of the (d,n-d) table, i.e. the square-maximal (d, 2d)-strings for their relevance to the conjectured bound for all strings. We explore their structural properties under both assumptions, complying or not complying with the conjecture, with the intention to derive a contradiction. The result yields novel properties and statements equivalent with the conjecture with computational application to the determination of the values S(d,n).</p> <p>To further populate the (d,n-d) table, we design and implement an efficient computational framework for computing S(d,n). Instead of generating all possible (d,n)-strings as the brute-force approach needs to do, the computational effort is significantly reduced by narrowing down the search space for square-maximal strings. With an easily accessible lower bound obtained either from the previously computed values inductively or by an effective heuristic search, only a relatively small set of candidate strings that might possibly exceed the lower bound is generated. To this end, the notions of s-cover and the density of a string are introduced and utilized. In special circumstances, the computational efficiency can be further improved by starting the s-cover with a double square structure. In addition, we present an auxiliary algorithm that returns the required information including the number of distinct squares for each generated candidate string. This algorithm is a modified version of FJW algorithm, an implementation based on Crochemore's partition algorithm, developed by Franek, Jiang and Weng. As of writing of this thesis, we have been able to obtain the maximum number of distinct squares in binary strings till the length of 70.</p> / Doctor of Philosophy (PhD)