Search Constraints
« Previous |
1 - 10 of 531
|
Next »
Number of results to display per page
Search Results
-
- Resource Type:
- Thesis
- Creator:
- St-Aubin, Bruno
- Abstract:
- Simulation is inherently multi-disciplinary. It requires knowledge about the system under study, expertise in simulation theory to define models and programming skills to implement models. Geospatial simulation requires an additional layer of expertise in topology, geospatial data structures, spatial analysis, computational geometry, and other related topics. Commercial modeling and simulation software can be used to provide an environment to facilitate simulation studies for users. However, these software tend to be narrowly scoped to specific business applications and tightly couple model and simulator. As such, it is difficult to expand their usage and reuse them outside of the application domain they were intended for. The Discrete Event System Specification (DEVS) is a modular and hierarchical simulation formalism that clearly separates the model, simulator and experiments. It can be used break down the disciplinary silos within which single-use simulators are built and allow users to study real-world systems from a broad range of application domains. In this research, we present an architecture that facilitates the operationalization of DEVS based, geospatial simulation environments in multidisciplinary projects. The architecture relies on a clear definition of roles and responsibilities to leverage the different skillsets in an organization. It considers a series of business processes for modelers, subject matter experts, web developers and end users. It relies on a web-based architecture to provide simulation as a service capability and support users across the entire simulation lifecycle. It seeks to democratize DEVS simulation by making use of the strengths and skills available in larger organizations and by providing the necessary tools for collaboration. Importantly, it preserves key features of DEVS (genericity, modularity, flexibility, etc.) and encourages users to follow best practices in model documentation to foster model reusability and improve model discoverability. It relies on modeling and simulation as a service to overcome technological barriers of entry for DEVS simulation and provide a set of reusable tools to design simulation-based, web applications for end users.
- Thesis Degree:
- Doctor of Philosophy (Ph.D.)
- Thesis Degree Discipline:
- Engineering, Electrical and Computer
- Date Created:
- 2023
-
- Resource Type:
- Thesis
- Creator:
- Kuri, Sajib Kumar
- Abstract:
- Segment Routing over IPv6, also known as SRv6, is a modern networking solution that aims to improve the current Internet of Things (IoT) network's reliability, availability, and scalability. Performance measures are required to evaluate SRv6 behaviors or functions. The proposed work aims to provide real IoT traffic profiles to assess the performance of SRv6 behaviors. In particular, a three-module SRv6 programming model is proposed to measure the performance of SRv6 policy headend and endpoint behavior and ensure reliability and quality of service (QoS). Moreover, a novel finder algorithm for maximum receive rate (MRR) benchmarking is proposed, which can outperform existing techniques in terms of throughput/bandwidth performance while maintaining the same computational resources. Finally, implementation results provide insights into forwarding different IoT use-cases traffic based on the functional service requirements. That also ensures a higher usage level of existing IoT networks, minimizing the need for additional capacity and lowering network costs.
- Thesis Degree:
- Master of Applied Science (M.App.Sc.)
- Thesis Degree Discipline:
- Engineering, Electrical and Computer
- Date Created:
- 2022
-
- Resource Type:
- Thesis
- Creator:
- D'Angelo, Anthony Mark
- Abstract:
- In this thesis we consider constrained geometric optimization problems. The first is a constrained version of the k-Steiner tree problem restricting the Steiner points to lie on a restricted set of curves. We solve the 1-Steiner tree problem in the Euclidean plane in optimal asymptotic time and space bounds when the Steiner point is constrained to lie on an input line. We then show how existing results can be used to generalize the result. The second problem is the smallest k-enclosing disc problem for a point set S contained in a simple polygon. In this problem we work with geodesic discs, meaning we use the geodesic distance function (i.e., the length of the shortest path). We present both a 2-approximation algorithm and an algorithm that finds the optimal radius for the smallest k-enclosing geodesic disc of a set of points inside a simple polygon. The last problem we consider is the smallest k-enclosing geodesic disc problem for a set of points in a simple polygon when the computed disc must be centred on an input chord of the polygon.
- Thesis Degree:
- Doctor of Philosophy (Ph.D.)
- Thesis Degree Discipline:
- Computer Science
- Date Created:
- 2023
-
- Resource Type:
- Thesis
- Creator:
- Sukumar, Sushmi Thushara
- Abstract:
- Research on effective usage of Machine Learning (ML) and Natural Language Processing (NLP) techniques are taken up to mitigate the problem of extracting information from huge volumes of unstructured data available on the Internet without losing valuable information. Constructing Knowledge Graph is one such application to query and extract unstructured data. The data is passed through a coreference resolution module using Neuralcoref, a named entity linking module using Wikifier API, and a relationship extraction module using two models, namely, OpenNRE and REBEL, and stores the results as a KG in Neo4j with its corresponding entities and relationships. Experiments were conducted on an unstructured dataset (BBC news dataset) containing text data to analyze the results obtained from the pipeline. The results obtained in the relationship extraction stage were analyzed for evaluation purposes and achieved 61.4% and 87% accuracy through the OpenNRE and REBEL models, respectively.
- Thesis Degree:
- Master of Applied Science (M.App.Sc.)
- Thesis Degree Discipline:
- Engineering, Electrical and Computer
- Date Created:
- 2023
-
- Resource Type:
- Thesis
- Creator:
- Karim, Saman
- Abstract:
- The inaccessibility of rulebooks hinders the rule learning experience of boardgame players who are blind or low vision (BLV). We explore the design of conversational agents (CAs) to support players' learning needs and provide companionship by conducting two qualitative studies. In study 1, 14 boardgame players who are BLV first identified their rule learning challenges and co-designed desired social and functional characteristics of CAs to combat these challenges. Based on these findings, we developed a CA using Amazon Alexa and 9 players who are BLV evaluated our CA in study 2. Our findings generated five design principles for CAs to support boardgame rule learning: conciseness, ease of navigation, customization, supplementary features, and social characteristics. These principles guide designers and researchers in exploring the novel design space. Our research also demonstrates the feasibility of our method for conducting accessible remote co-design and evaluation with participants who are BLV.
- Thesis Degree:
- Master of Computer Science (M.C.S.)
- Thesis Degree Discipline:
- Computer Science
- Date Created:
- 2023
-
- Resource Type:
- Thesis
- Creator:
- Khan, Md Rezwan Hassan
- Abstract:
- With the growing demand for micro-service applications and cloud-based software, service providers like Amazon, Netflix, and eBay, are finding it difficult to detect the failures in their increasing number of interlinked services of applications. Various machine-learning techniques have been proposed to detect these failures. However, one of the significant challenges anomaly detectors face is model performance decay over time due to data pattern changes in time series data. Another significant issue is detecting a high number of false positives( false anomalies), creating false alerts that question the credibility of the detector's performance. This thesis attempts to tackle these issues mentioned above by building a dynamic automated pipeline for an unsupervised anomaly detection engine for a micro-services application to predict anomalies in the system's behaviour. The proposed model outperforms the baseline model's performance. Regarding computational costs, LSTM is three times faster than the statistical approach.
- Thesis Degree:
- Master of Computer Science (M.C.S.)
- Thesis Degree Discipline:
- Computer Science
- Date Created:
- 2023
-
- Resource Type:
- Thesis
- Creator:
- Al Shamaa, Mhd Saleh
- Abstract:
- Considering the dynamic and elastic nature of cloud computing services, service providers must provide efficient task-scheduling solutions to accommodate the increasing demands in cloud services while satisfying Service Level Agreements (SLA) cost-effectively. In this thesis, we present two novel task scheduling algorithms in cloud computing: ENS-PSO and PxGA, to minimize the makespan. ENS-PSO improves Particle Swarm Optimization (PSO) by introducing an effective neighborhood search technique. Also, we introduce static and dynamic methods to select ENS-PSO neighborhood search size. PxGA enhances the Genetic Algorithm (GA) by applying a weighted probabilistic approach to the crossover operation. CloudSim toolkit is utilized to evaluate the algorithms in terms of makespan, computational time, degree of imbalance, and energy consumption. The simulation results prove that ENS-PSO and PxGA outperform other classic and recent algorithms. Moreover, at the expense of higher computational time, ENS-PSO outperforms PxGA on the overall makespan by 3-4%.
- Thesis Degree:
- Master of Information Technology (M.I.T.)
- Thesis Degree Discipline:
- Network Technology
- Date Created:
- 2023
-
- Resource Type:
- Thesis
- Creator:
- Fryer, Joshua Stewart
- Abstract:
- Multicore architectures have emerged as an avenue to continue the improvement of software performance even as growth in single-core performance has struggled over the past two decades. However, designing for such systems is a more complex task than for single-core, sequential computing. To effectively utilize multicore systems, designers must devise communication strategies, coordinate dataflow between processing elements in a way that avoids erroneous behaviour such as race conditions, and the software's general architecture must be designed in a way that takes advantage of advancements in hardware architecture. In this thesis, we present an architecture and domain-specific language that allows software developers to rapidly prototype hardware architectures, software partitioning, and inter-core communication strategies at design time. We demonstrate an interpreter for this domain-specific language, and use it to illustrate a process of experimenting with inter-core communication and software partitioning strategies.
- Thesis Degree:
- Master of Applied Science (M.App.Sc.)
- Thesis Degree Discipline:
- Engineering, Electrical and Computer
- Date Created:
- 2023
-
- Resource Type:
- Thesis
- Creator:
- Smith, Jennifer Joy
- Abstract:
- While a growing number and variety of cybersecurity educational resources exist, there is a lack of teacher perspective on how the resources are used in practice and how they serve teaching and learning needs. This thesis aims to understand teachers' and creators' perspectives about what makes cybersecurity educational material effective and engaging for their students. We conducted two studies with 15 Canadian teachers and 8 creators of educational resources. We found that both creators and teachers shared similar preferences about what makes educational resources effective and engaging. In general, both groups agreed on what types of resources teachers need to teach cybersecurity to tweens in the classroom. However, we identified several gaps and constraints for both parties that hindered the effectiveness and dissemination of available resources. We make specific design recommendations and best practices to help optimize the effectiveness and adoption of resources for teachers.
- Thesis Degree:
- Master of Arts (M.A.)
- Thesis Degree Discipline:
- Human-Computer Interaction
- Date Created:
- 2023
-
- Resource Type:
- Thesis
- Creator:
- Shortt, John
- Abstract:
- WebAssembly is a programming language and virtual machine architecture that allows code to be executed in any environment that implements a WebAssembly runtime. WebAssembly has been formally specified using an abstract syntax, and a soundness proof of this specification has been written and mechanized. We build on this to create a system that determines a bound on the runtime cost of a WebAssembly function. We show that for a broad class of real-world programs this cost can be computed efficiently and we develop a software tool called WANALYZE that does so. The software tool is comprised of a set of algorithms that perform a series of transformations on the raw WebAssembly bytecode into forms that are more suitable for analysis. We test WANALYZE against a suite of programs of varying size and complexity and find that WANALYZE is able to successfully analyze over 99.9% of the functions in these programs.
- Thesis Degree:
- Master of Computer Science (M.C.S.)
- Thesis Degree Discipline:
- Computer Science
- Date Created:
- 2023