Cross-Site Scripting is a code hacking technique that is very popular, this technique tricks a victim in order to access their personal data through script injections and hidden HTML code. We will be looking at how this hacking technique occurs and ways that it can be prevented. During our presentation a live demonstration of this […]
Read moreCloud Computing is the idea that computing will be delivered as a service over the internet from vast data centers, commonly referred to as “cloud”. It represents a big shift in computing paradigm as more and more user data is stored online and accessed via a simple browser, thus rendering the type of local machine […]
Read moreContinuous Integration is one of many software development techniques that are quickly being adopted by businesses today. Continuous Integration is a methodology of software design that attempts to provide functioning code at all times during the software development lifecycle, providing rapid feedback between developers and customers. There are three main components of Continuous Integration: a […]
Read moreNearly every computer or video game today features some sort of artificial intelligence component. One important feature of this AI is how the characters move around the game environment. This presentation will focus on how path-finding decisions are made, the difficulties involved, and two different implementations: the A* algorithm and path recording. Sources: Nareyek, Alexander. […]
Read moreQuantum computers exploit the strange rules of quantum physics in order to compute in ways that are impossible for classical computers. While superpositioning and entanglement make quantum computing very powerful, the delicate nature of quantum bits is a big obstacle in building a practical quantum computer. However, researchers have made significant progress in qubit creation […]
Read moreApplications for which bipartite matching is useful, in particular finding perfect matchings are numerous. Heuristics have been put forward by Rakesh Verma to decrease complexity associated with determining whether a given graph is a viable candidate for a perfect matching. This can potentially lessen the overall cost of finding perfect matchings for a given set […]
Read more