Journals and Series

Permanent URI for this community

https://prism.ucalgary.ca/handle/1880/100034

Browse

Browsing Journals and Series by Department "Computer Science"

Now showing 1 - 6 of 6
  • Thumbnail Image
    ItemOpen Access
    Development of a Video Streaming Testbed
    (University of Calgary, 2018-09-24) Stelter, Kaylee
  • Thumbnail Image
    ItemOpen Access
    The Giant Walkthrough Gut: Virtual Reality Simulation of the Digestive System
    (2018-09-12) Lee, Ryan M.; Jacob, Christian
    The Giant Walkthrough Gut is an immersive 3D computer model that utilizes virtual reality (VR) technology to fully explore and learn about the digestive system. The Giant Walkthrough Gut was developed using Unreal Engine by Epic Games, allowing for two different versions of visualization: a video and an exploratory program designed for both VR and desktop monitors. Traditionally, human anatomy and body systems have been taught with the use of 2D illustrations, text, and verbal instruction. Though spatial and auditory learners benefit from this convention, there can be a disconnect to the material for those who are kinesthetic learners. By providing a game-like experience, the Giant Walkthrough Gut has elements that can simplify the complex processes of the digestive system, having the potential to be a powerful and comprehensive tool that could supersede existing teaching methods.
  • Thumbnail Image
    ItemOpen Access
    Implementation of Primality Testing based on “Some Primality Tests that Eluded Lucas”
    (University of Calgary, 2018-09-24) Kelly, Graham
    An implementation of two primality tests in Guy, Roettger and Williams' 2015 paper 'Some Primality Tests that Eluded Lucas' was created using the GNU GMP integer package in C. These tests enable the determination of primality for numbers of the form N = Ar^n+γ or N = Ar^n+η(γ_n(r)) for small primes r coprime to A, γ^2 = 1, η^2 = 1 and n is a positive integer where (γ_n(r)) is the square root of -1 mod r^n. The runtime of the algorithms was determined to be O((log N)M(log N)) for the case of N = Ar^n+γ and O(M(log N)(loglog N)(log N))$ for the N = Ar^n+η(γ_n(r)) case. This presents a significant improvement for the determination of primality of numbers of both forms over general primality proving algorithms.
  • Thumbnail Image
    ItemOpen Access
    PURE report: traffic analysis
    (University of Calgary, 2018-09-21) Boudes, Elodie
  • Thumbnail Image
    ItemOpen Access
    Searching faster using self-loops in quantum walks
    (University of Calgary, 2018-09-24) Yu, Zhan
  • Thumbnail Image
    ItemOpen Access
    Viability of Synthetic Nucleotides in Digital Storage
    (University of Calgary, 2018-09-22) Hwang, Munsu