Physical Sciences and Mathematics Commons^™

Algorithms For Massive, Expensive, Or Otherwise Inconvenient Graphs, David Tench

Doctoral Dissertations

A long-standing assumption common in algorithm design is that any part of the input is accessible at any time for unit cost. However, as we work with increasingly large data sets, or as we build smaller devices, we must revisit this assumption. In this thesis, I present some of my work on graph algorithms designed for circumstances where traditional assumptions about inputs do not apply.
1. Classical graph algorithms require direct access to the input graph and this is not feasible when the graph is too large to fit in memory. For computation on massive graphs we consider the dynamic …

Systems And Network Administration - Introduction, Jimmy Richford, Nyc Tech-In-Residence Corps

Open Educational Resources

Lecture for CISC 4311: Systems and Network Administration (Fall 2020)

Cisc 4331 – Systems And Network Administration - Week 5, Jimmy Richford, Nyc Tech-In-Residence Corps

Open Educational Resources

Lecture 5 for CISC 4331 - Systems and Network Administration

Cisc 4331 – Systems And Network Administration - Week 3, Jimmy Richford, Nyc Tech-In-Residence Corps

Open Educational Resources

Lecture 3 for CISC 4331: Systems and Network Administration

Cisc 4331 – Systems And Network Administration Week 6, Jimmy Richford, Nyc Tech-In-Residence Corps

Open Educational Resources

Lecture 6 for CISC 4331 - Systems and Network Administration

Cisc 4331 – Systems And Network Administration - Week 4, Jimmy Richford, Nyc Tech-In-Residence Corps

Open Educational Resources

Lecture 4 for CISC 4331 - Systems and Network Administration

Cisc 4331 – Systems And Network Administration - Week 2, Jimmy Richford, Nyc Tech-In-Residence Corps

Open Educational Resources

Lecture 2 for CISC 4331: Systems and Network Administration

Lecture - Csci 275: Linux Systems Administration And Security, Moe Hassan, Nyc Tech-In-Residence Corps

Open Educational Resources

Lecture for CSCI 275: Linux Systems Administration and Security

Who's In And Who's Out?: What's Important In The Cyber World?, Tony M. Kelly

HON499 projects

The aim of this paper is to offer an introduction to the exploding field of cybersecurity by asking what are the most important concepts or topics that a new member of the field of cybersecurity should know. This paper explores this question from three perspectives: from the realm of business and how the cyber world is intertwined with modern commerce, including common weaknesses and recommendations, from the academic arena examining how cybersecurity is taught and how it should be taught in a classroom or laboratory environment, and lastly, from the author’s personal experience with the cyber world. Included information includes …

Evaluation Of Tcp Header Fields For Data Overhead Efficiency, Justin K. Yirka

Undergraduate Research Posters

Bandwidth across the internet is constricted by monetary factors and hardware development, so researchers are left to improve the efficiency of data transmitted in order to improve internet speeds. The transmission control protocol (TCP) is the primary transport protocol on the modern internet, ensuring reliable delivery of the majority of data transmitted. I evaluated the TCP header fields for efficient use of data overhead so as to determine current waste and to suggest possible areas for revision. I examined original specifications for TCP mechanisms, comparing them to modern implementations as determined by updated standards and modern practices in the networking …

Abduction In Annotated Logic Programming, Krishnaprasad Thirunarayan

Kno.e.sis Publications

The author investigates techniques to make the logic programming paradigm more expressive for knowledge representation, while simultaneously retaining the computational advantages of efficiency and simplicity. He extends the annotated language of K. Thirunarayan and K. Kifer (1989) in various directions to obtain an enriched representation language. In particular, rule bodies are permitted to be a conjunction of literals, and the rules to be recursive. A class of annotated logic programs called the stratified programs is identified which can be given a unique supported minimal Herbrand model as their meaning. Abductive reasoning is integrated into this annotated logic framework. The notion …

On The Relationship Between Parsimonious Covering And Boolean Minimization, Venu Dasigi, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Minimization of Boolean switching functions is a basic problem in the design of logic circuits. The designer first comes up with a switching function expressed in terms of several binary input variables that satisfies the desired functionality, and then attempts to minimize the function as a sum of products or product of sums. It turns out that a sum of products form of a switching function that has no redundancy is a union of prime implicants of the function.

In this paper we would like to explicate some of the relationships of the boolean minimization problem to a formalization of …