Physical Sciences and Mathematics Commons^™

Using Case Studies To Teach Cybersecurity Courses, Yu Cai

Journal of Cybersecurity Education, Research and Practice

This paper introduces a holistic and case-analysis teaching model by integrating case studies into cybersecurity courses. The proposed model starts by analyzing real-world cyber breaches. Students look into the details of these attacks and learn how these attacks took place from the beginning to the end. During the process of case analysis, a list of security topics reflecting different aspects of these breaches is introduced. Through guided in-class discussion and hands-on lab assignments, student learning in lecture will be reinforced. Overall, the entire cybersecurity course is driven by case studies. The proposed model is great for teaching cybersecurity. First, the …

Annotation-Enabled Interpretation And Analysis Of Time-Series Data, Niveditha Venugopal

Dissertations and Theses

As we continue to produce large amounts of time-series data, the need for data analysis is growing rapidly to help gain insights from this data. These insights form the foundation of data-driven decisions in various aspects of life. Data annotations are information about the data such as comments, errors and provenance, which provide context to the underlying data and aid in meaningful data analysis in domains such as scientific research, genomics and ECG analysis. Storing such annotations in the database along with the data makes them available to help with analysis of the data. In this thesis, I propose a …

Csc 480 Artificial Intelligence, Ernest Battifarano, Nyc Tech-In-Residence Corps

Open Educational Resources

No abstract provided.

Csc 322 Software Engineering, William Chan, Nyc Tech-In-Residence Corps

Open Educational Resources

No abstract provided.

Csci 39549 Agile Software Development, Arylee Mcsweany, Rebecca Sliter, Nyc Tech-In-Residence Corps

Open Educational Resources

No abstract provided.

Csc 59970 Introduction To Data Science, Grant Long, Nyc Tech-In-Residence Corps

Open Educational Resources

No abstract provided.

Using Magic In Computing Education And Outreach, Ronald I. Greenberg, Dale F. Reed

Computer Science: Faculty Publications and Other Works

This special session explores the use of magic tricks based on computer science ideas; magic tricks help grab students' attention and can motivate them to invest more deeply in underlying CS concepts. Error detection ideas long used by computer scientists provide a particularly rich basis for working such "magic'', with a CS Unplugged parity check activity being a notable example. Prior work has shown that one can perform much more sophisticated tricks than the relatively well-known CS Unplugged activity, and these tricks can motivate analyses across a wide variety of computer science concepts and are relevant to learning objectives across …

Csc 59939 Topics In Modern Software Engineering, Nikolai Avteniev, Nyc Tech-In-Residence Corps

Open Educational Resources

No abstract provided.

Cmp 464 Web Programming, Ross Dakin, Nyc Tech-In-Residence Corps

Open Educational Resources

No abstract provided.

Minutes & Seconds: The Scientists, Patrick Aievoli

Zea E-Books Collection

Minutes & Seconds, is a captivating intelligible read for those who strive to understand where the “what if” moment has gone. Succeeding his other captivating books, Aievoli’s deep introspective lens dials his readers in to awaken the proverbial sleeping giant inside of our consciousness. He designs an insightful exciting romp through the surreal landscape of our society and illustrates how various pioneers have lead us to a crossroads. I’m truly impressed with Aievoli’s perspicacious comprehension of where digital has taken us through the hands of these select individuals. --Sequoyah Wharton

In creating Minutes & Seconds, Aievoli has assembled an interesting …

Zero Textbook Cost Syllabus For Cis 2200h (Introduction To Information Systems And Technologies), Curtis Izen

Open Educational Resources

This course introduces students to information systems in business. Due to the rapid developments in Information Technology (IT) and the dramatic changes brought by these new technologies in the way companies operate, compete and do business, familiarity with information systems has become indispensable for the leaders of today and tomorrow's organizations.

Perception & Perspective: An Analysis Of Discourse And Situational Factors In Reference Frame Selection, Robert J. Ross, Kavita E. Thomas

Conference papers

To integrate perception into dialogue, it is necessary to bind spatial language descriptions to reference frame use. To this end, we present an analysis of discourse and situational factors that may influence reference frame choice in dialogues. We show that factors including spatial orientation, task, self and other alignment, and dyad have an influence on reference frame use. We further show that a computational model to estimate reference frame based on these features provides results greater than both random and greedy reference frame selection strategies.

Effects Of Dynamic Goals On Agent Performance, Nathan R. Ball

Theses and Dissertations

Autonomous systems are increasingly being used for complex tasks in dynamic environments. Robust automation needs to be able to establish its current goal and determine when the goal has changed. In human-machine teams autonomous goal detection is an important component of maintaining shared situational awareness between both parties. This research investigates how different categories of goals affect autonomous change detection in a dynamic environment. In order to accomplish this goal, a set of autonomous agents were developed to perform within an environment with multiple possible goals. The agents perform the environmental task while monitoring for goal changes. The experiment tests …

Computing Minimum Rainbow And Strong Rainbow Colorings Of Block Graphs, Melissa Karanen, Juho Lauri

Michigan Tech Publications

A path in an edge-colored graph G is rainbow if no two edges of it are colored the same. The graph G is rainbow-connected if there is a rainbow path between every pair of vertices. If there is a rainbow shortest path between every pair of vertices, the graph G is strongly rainbow-connected. The minimum number of colors needed to make G rainbow-connected is known as the rainbow connection number of G, and is denoted by src(G). Similarly, the minimum number of colors needed to make G strongly rainbow-connected is known as the strong rainbow connection number of G, and …

Connection: An Autism-Focused Dating App, Cyrena Johnson

Scholars Week

30% of US internet users 18-29 use dating apps to find partners. Meanwhile, only 9% of adults with autism are married—and there are no popular dating apps designed for ASDs. We propose the app Connection, a dating app designed for the autistic community. Using queries and informal analysis, we created possible features and prototype displays for Connection to show its future application.

Efficient Quantum Approximation : Examining The Efficiency Of Select Universal Gate Sets In Approximating 1-Qubit Quantum Gates., Brent A. Mode

College of Arts & Sciences Senior Honors Theses

Quantum computation is of current ubiquitous interest in physics, computer science, and the public interest. In the not-so-distant future, quantum computers will be relatively common pieces of research equipment. Eventually, one can expect an actively quantum computer to be a common feature of life. In this work, I study the approximation efficiency of several common universal quantum gate sets at short sequence lengths using an implementation of the Solovay-Kitaev algorithm. I begin by developing from almost nothing the relevant formal mathematics to rigorously describe what one means by the terms universal gate set and covering efficiency. I then describe some …

Code4her Spring 2018, Rebeccah Knoop

Honors Projects

CODE4her is a mentorship program with a goal of sparking interest in computer science organized by the BGSU Women in Computing (BGWIC) student organization. Participation is open to middle school girls (grades 5-8), and participants are paired with BGWIC members who serve as mentors.

Budgeting In Student Life: An Educational Website, Heather Grunden

Honors Projects

An applied honors project in the form of a website prototype. The purpose of this website is to introduce college students to the concept of budgeting and to teach them the core steps of creating their own budget, since many existing budgeting applications are pay-to-use, and the free options tend to have little to no instruction.

Modular Scheduling System For Westside School District, Tyler Bienhoff

Honors Theses

Westside School district offers a modular scheduling system for their high school that is more similar to a college schedule than the typical high school system. Due to the complexity of their master schedule each semester, there are no commercially available products that can assist in creating a schedule. Hence, this thesis discusses a scheduling algorithm and management system that was built specifically for Westside High School with the potential to be expanded for use by other interested schools. The first part of the paper is focused on gathering input from students and faculty for which courses and how many …

Csci 49900 Advanced Applications: A Capstone Course For Csci Majors, Alejandro Gonzalez Sole, Jesse Greenberg, James Lin, Sabeena Lalwani, Sean Laude, Sid Wighe, Nyc Tech-In-Residence Corps

Open Educational Resources

No abstract provided.

The Algorithmic Composition Of Classical Music Through Data Mining, Tom Donald Richmond, Imad Rahal

All College Thesis Program, 2016-2019

The desire to teach a computer how to algorithmically compose music has been a topic in the world of computer science since the 1950’s, with roots of computer-less algorithmic composition dating back to Mozart himself. One limitation of algorithmically composing music has been the difficulty of eliminating the human intervention required to achieve a musically homogeneous composition. We attempt to remedy this issue by teaching a computer how the rules of composition differ between the six distinct eras of classical music by having it examine a dataset of musical scores, rather than explicitly telling the computer the formal rules of …

Csc 59940: Topics In Front End Web Application Development (Syllabus), David Moon, Michelle Shu, Nyc Tech-In-Residence Corps

Open Educational Resources

Syllabus for the course "CSC 59940 - Front-End Web Application Development" delivered at the City College of New York in Spring 2018 by Michelle Shu and David Moon as part of the Tech-in-Residence Corps program.

Feature Detection In Medical Images Using Deep Learning, Anthony Pasquarelli

Honors Projects in Information Systems and Analytics

This project explores the use of deep learning to predict age based on pediatric hand X-Rays. Data from the Radiological Society of North America’s pediatric bone age challenge were used to train and evaluate a convolutional neural network. The project used InceptionV3, a CNN developed by Google, that was pre-trained on ImageNet, a popular online image dataset. Our fine-tuned version of InceptionV3 yielded an average error of less than 10 months between predicted and actual age. This project shows the effectiveness of deep learning in analyzing medical images and the potential for even greater improvements in the future. In addition …

The Big Revolution: Future Potential Of Blockchain Technology, Sweksha Poudel, Sushant Bhatta, Jeremy Evert

Student Research

Blockchain is the continuation of humanity’s connection with technology. If we think back to a more ancient era, trade was done in a very informal manner. Often the result of one’s desire to get what they wanted was with violence. Society as a whole then started becoming more formalized and grew in complexity. Institutions like banks and governments established currency, policy, and regulation. Eventually, we had access to these same institutions on the internet and the list grew exponentially. Marketplaces like Amazon and eBay made trade much easier for the common man to use and it kept lowering uncertainties of …

The Fat-Pyramid: A Robust Network For Parallel Computation, Ronald I. Greenberg

Ronald Greenberg

This paper shows that a fat-pyramid of area Theta(A) built from processors of size lg A requires only O(lg^2 A) slowdown in bit-times to simulate any network of area A under very general conditions. Specifically, there is no restriction on processor size (amount of attached memory) or number of processors in the competing network, nor is the assumption of unit wire delay required. This paper also derives upper bounds on the slowdown required by a fat-pyramid to simulate a network of larger area in the case of unit wire delay.

The Fat-Pyramid And Universal Parallel Computation Independent Of Wire Delay, Ronald I. Greenberg

Ronald Greenberg

This paper shows that a fat-pyramid of area Θ(A) requires only O(log A) slowdown to simulate any competing network of area A under very general conditions. The result holds regardless of the processor size (amount of attached memory) and number of processors in the competing networks as long as the limitation on total area is met. Furthermore, the result is valid regardless of the relationship between wire length and wire delay. We especially focus on elimination of the common simplifying assumption that unit time suffices to traverse a wire regardless of its length, since the assumption becomes more and more …

Minimizing Channel Density With Movable Terminals, Ronald I. Greenberg, Jau-Der Shih

Ronald Greenberg

We give algorithms to minimize density for channels with terminals that are movable subject to certain constraints. The main cases considered are channels with linear order constraints, channels with linear order constraints and separation constraints, channels with movable modules containing fixed terminals, and channels with movable modules and terminals. In each case, previous results for running time and space are improved by a factor of L/lg n and L , respectively, where L is the channel length and n is the number of terminals.

Packet Routing In Networks With Long Wires, Ronald I. Greenberg, Hyeong-Cheol Oh

Ronald Greenberg

In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of "congestion" and "dilation" measures for a set of packet paths. We give, for any constant ϵ > 0, a randomized on-line algorithm for routing any set of Npackets in O((C lg^ϵ(Nd) + D lg(Nd))/lg lg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into …

Finding Connected Components On A Scan Line Array Processor, Ronald I. Greenberg

Ronald Greenberg

This paper provides a new approach to labeling the connected components of an n x n image on a scan line array processor (comprised of n processing elements). Variations of this approach yield an algorithm guaranteed to complete in o(n lg n) time as well as algorithms likely to approach O(n) time for all or most images. The best previous solutions require using a more complicated architecture or require Omega(n lg n) time. We also show that on a restricted version of the architecture, any algorithm requires Omega(n lg n) time in the worst case.

Feasible Offset And Optimal Offset For Single-Layer Channel Routing, Ronald I. Greenberg, Jau-Der Shih

Ronald Greenberg

The paper provides an efficient method to find all feasible offsets for a given separation in a VLSI channel routing problem in one layer. The prior literature considers this task only for problems with no single-sided nets. When single-sided nets are included, the worst-case solution time increases from Theta(n) to Omega(n^2), where n is the number of nets. But, if the number of columns c is O(n), one can solve the problem in time O(n^{1.5}lg n ), which improves upon a `naive' O(cn) approach. As a corollary of this result, the same time bound suffices to find the optimal offset …