Software bugs prediction is one of the most active research areas in the software engineering community. The process of testing and debugging code proves to be costly during the software development life cycle. Software metrics measure the quality of source code to identify software bugs and vulnerabilities. Traceable code patterns are able to de- scribe code at a finer granularity level to measure quality. Micro patterns will be used in this research to mechanically describe java code at the class level. Machine learning has also been introduced for bug prediction to localize source code for testing and debugging. Deep Learning is a branch of Machine Learning that is relatively new. This research looks to improve the prediction of software bugs by utilizing micro patterns with deep learning techniques. Software bug prediction at a finer granularity level will enable developers to localize code to test and debug during the development process.

Defects in software systems directly impact a product’s quality and overall customer satisfaction. Assessing defective code for the purpose of locating vulnerable areas and improving software quality and reliability is important for sustained software development efforts. Over the years, various techniques have been used to determine the likelihood that code fragments contain defects, such as identifying code smells, but these techniques have drawbacks. There is a need for better approaches. This thesis assesses software defects using nano-patterns by demonstrating that certain categories of nano-patterns are more defect-prone than others. We studied three open source systems from the Apache Software Foundation and found that ObjectCreator, FieldReader, TypeManipulator, Looping, Exceptions, LocalReader, and LocalWriter nano-patters are more defect-prone than others. Apart from assessing software defects, we expect this new finding will contribute to further research on other applications of nano-patterns and improve coding practices.

Threat evaluation is used in various applications to find threatening objects or situations and neutralize them before they cause any damage. To make the threat evaluation as user-friendly as possible, it is important to know where the uncertainties are. The method Traceable Uncertainty can make the threat evaluation process more transparent and hopefully easier to rely on. Traceable Uncertainty is used when different sources of information are combined to find support for the decision making process. The uncertainty of the current information is measured before and after the combination. If the magnitude of uncertainty has changed more than a threshold, a new branch will be created which excludes the new information from the combination of evidence. Traceable Uncertainty has never been tested on any realistic scenario to investigate whether it is possible to implement the method on a large scale system. The hypothesis of this thesis is that Traceable Uncertainty can be used on large scale systems if its threshold parameter is tuned in the right way. Different threshold values were tested when recorded radar data were analyzed for threatening targets. Experiments combining random generated evidence were also analyzed for different threshold values. The results showed that a threshold value in the range [0.15, 0.25] generated a satisfying amount of interpretations that were not too similar to eachother. The results could also be filtered to take away unnecessary interpretations. This shows that in this aspect and for this data set, Traceable Uncertainty can be used on large scale systems.

A graph G is maximal nontraceable (MNT) (maximal nonhamiltonian (MNH)) if G is not traceable (hamiltonian), i.e. does not contain a hamiltonian path (cycle), but G+xy is traceable (hamiltonian) for all nonadjacent vertices x and y in G. A graph G is hypohamiltonian if G is not hamiltonian, but every vertex deleted subgraph G -u of G is hamiltonian. A graph which is maximal nonhamiltonian and hypohamiltonian is called maximal hypohamiltonian (MHH). Until recently, not much has appeared in the literature about MNT graphs, although there is an extensive literature on MNH graphs. In 1998 Zelinka constructed two classes of MNT graphs and made the conjecture, which he later retracted, that every MNT graph belongs to one of these classes. We show that there are many different types of MNT graphs that cannot be constructed by Zelinka's methods. Although we have not been able to characterize MNT graphs in general, our attempt at characterizing MNT graphs with a specified number of blocks and cut-vertices enabled us to construct infinite families of non-Zelinka MNT graphs which have either two or three blocks. We consider MNT graphs with toughness less than one, obtaining results leading to interesting constructions of MNT graphs, some based on MHH graphs. One result led us to discover a non-Zelinka MNT graph of smallest order, namely of order 8. We also present examples of MNTgraphs with toughness at least one, including an infinite family of 2-connected, claw-free graphs. We find a lower bound for the size of 2-connected MNT graphs of order n. We construct an infinite family of 2-connected cubic MNT graphs of order n, using MHH graphs as building blocks. We thus find the minimum size of 2-connected MNT graphs for infinitely many values of n. We also present a construction, based on MHH graphs, of an infinite family of MNT graphs that are almost cubic. We establish the minimum size of MNT graphs of order n, for all except 26 values of n, and we present a table of MNT graphs of possible smallest size for the excluded 26 values of n. / Mathematical Sciences / PHD (MATHEMATICS)

Šiame darbe nagrinėjama speciali atraminių elementų erdvė – tiesinių elementų erdvė. Šios geometrijos bendrąją tiesinių ir afiniųjų siečių teoriją sukūrė V. Bliznikas. Jis parodė, [5] kaip tiesinės sieties geometrinis objektas indukuoja aukštesniųjų eilių afiniųjų, taip pat tenzorinių siečių objektams. V. Blizniko sukurtais tyrimo metodais dalinai naudojomės ir šiame darbe. Metrinių hiperplokštuminių elementų erdvė yra taip vadinamų normalizuotų erdvių atvejis. Normalizuotos erdvės tai tokios, kuriose apibrėžtos koks nors diferencialinis – geometrinis objektas, kurio invariantai ir sudaro normalizuotos erdvės geometrijos turinį. Tokiais objektais dažnai būna skaliarinė funkcija. (Finslerio ar Kartano erdvės), metrinis tenzorius (tiesinių ar hiperplokštuminių elementų erdvės), afiniosios sieties objektas (afiniosios sieties erdvės) ir pan. Šiame darbe nagrinėjamos metrinių tiesinių elementų erdvės, kurios yra normalizuojamos metrinio tenzoriaus pagalba. Be to, tas tenzorius turi specialią struktūrą (žr. [1]). Ta struktūra charakteringa tuo, kad visuomet tokios erdvės yra Landsbergo erdvių analogai. Darbe pavyko tokioms metrikoms sukonstruoti vidines beveik kompleksines ir beveik sandaugos struktūras, surasti jų integruojamumo sąlygą, kurios dėka metrikos specifika yra kitokia nei analogiškos sąlygos Finslerio erdvėse. Darbas sudarytas ir iš įžangos ir 8 paragrafų. Pirmajame paragrafe dėstomas įvadas į liestinių sluoksniuočių geometriją. Antrajame nagrinėjama šių erdvių... [toliau žr. visą tekstą] / The elements of metric space with a special form of metric are dealt with in the work. It is shown how in such spase linear and affine links are defined with the help of metric tenzor, the ogjects of curvature are founds the existence of the type of metric affine links is proved. It is proved that the metric tenzor induces two parametric almost complex and almost the structures of product, the integration criteria of these structures are found. Keywords: • differentiable manifold • tangent stratified; • linear and affine traceable; • integrated struktures; • structural tensors.

We say a graph is locally P if the induced graph on the neighbourhood of every vertex has the property P. Specically, a graph is locally traceable (LT) or locally hamiltonian (LH) if the induced graph on the neighbourhood of every vertex is traceable or hamiltonian, respectively. A locally locally hamiltonian (L2H) graph is a graph in which the graph induced by the neighbourhood of each vertex is an LH graph. This concept is generalized to an arbitrary degree of nesting, to make it possible to work with LkH graphs. This thesis focuses on the global cycle properties of LT, LH and LkH graphs. Methods are developed to construct and combine such graphs to create others with desired properties. It is shown that with the exception of three graphs, LT graphs with maximum degree no greater than 5 are fully cycle extendable (and hence hamiltonian), but the Hamilton cycle problem for LT graphs with maximum degree 6 is NP-complete. Furthermore, the smallest nontraceable LT graph has order 10, and the smallest value of the maximum degree for which LT graphs can be nontraceable is 6. It is also shown that LH graphs with maximum degree 6 are fully cycle extendable, and that there exist nonhamiltonian LH graphs with maximum degree 9 or less for all orders greater than 10. The Hamilton cycle problem is shown to be NP-complete for LH graphs with maximum degree 9. The construction of r-regular nonhamiltonian graphs is demonstrated, and it is shown that the number of vertices in a longest path in an LH graph can contain a vanishing fraction of the vertices of the graph. NP-completeness of the Hamilton cycle problem for LkH graphs for higher values of k is also investigated. / Mathematical Sciences / D. Phil. (Mathematics)

A graph G is maximal nontraceable (MNT) (maximal nonhamiltonian (MNH)) if G is not traceable (hamiltonian), i.e. does not contain a hamiltonian path (cycle), but G+xy is traceable (hamiltonian) for all nonadjacent vertices x and y in G. A graph G is hypohamiltonian if G is not hamiltonian, but every vertex deleted subgraph G -u of G is hamiltonian. A graph which is maximal nonhamiltonian and hypohamiltonian is called maximal hypohamiltonian (MHH). Until recently, not much has appeared in the literature about MNT graphs, although there is an extensive literature on MNH graphs. In 1998 Zelinka constructed two classes of MNT graphs and made the conjecture, which he later retracted, that every MNT graph belongs to one of these classes. We show that there are many different types of MNT graphs that cannot be constructed by Zelinka's methods. Although we have not been able to characterize MNT graphs in general, our attempt at characterizing MNT graphs with a specified number of blocks and cut-vertices enabled us to construct infinite families of non-Zelinka MNT graphs which have either two or three blocks. We consider MNT graphs with toughness less than one, obtaining results leading to interesting constructions of MNT graphs, some based on MHH graphs. One result led us to discover a non-Zelinka MNT graph of smallest order, namely of order 8. We also present examples of MNTgraphs with toughness at least one, including an infinite family of 2-connected, claw-free graphs. We find a lower bound for the size of 2-connected MNT graphs of order n. We construct an infinite family of 2-connected cubic MNT graphs of order n, using MHH graphs as building blocks. We thus find the minimum size of 2-connected MNT graphs for infinitely many values of n. We also present a construction, based on MHH graphs, of an infinite family of MNT graphs that are almost cubic. We establish the minimum size of MNT graphs of order n, for all except 26 values of n, and we present a table of MNT graphs of possible smallest size for the excluded 26 values of n. / Mathematical Sciences / PHD (MATHEMATICS)

No description available.

In this research consumers attitudes towards general food safety and their perceptions of the safety of beef in Japan and Canada are examined. Risk perceptions, the willingness to pay for beef traceability from farm to final consumer and the willingness to pay for animal testing for bovine spongifrom encephalopothy (BSE) are measured through a stated preference exercise, provided as part of national surveys in each country. Japanese respondents continue to have higher risk attitudes and perceptions about beef than Canadian respondents in 2009 as compared to 2006. In each country survey respondents strongly prefer domestic beef over imports from any other country. However, interest in beef from other countries increases as full traceability, or one hundred % animal testing for BSE or both attributes are incorporated into the markets. The willingness to pay increases at a diminishing rate, from either traceability or BSE animal testing to both attributes. In latent class models the Japanese data suggest that there are three distinct classes of survey respondents, where class 1 respondents are characterized as being more trusting and willing to pay for beef from different countries, class 2 respondents strongly prefer domestic beef and their willingness to pay for imported beef does not increase with traceability or animal testing and class 3 respondents would only be willing to pay for traceable and a combination of traceable and animal tested domestic beef. Similarly, Canadian survey respondents can be segregated into two classes. Class 1 consumers are more trusting and will be willing to pay for both domestic and imported beef. Class 2 consumers are more cautious. / Agricultural and Resource Economics