Wip,
2015
University of Arkansas, Fayetteville
Wip, Armon Nayeraini
Computer Science and Computer Engineering Undergraduate Honors Theses
Games have been shown to be capable tools in teaching. Additionally, programming can be a hard skill to learn. The objective of this research was to create a game that helps student learn coding concepts by playing a video game. The result of our work is a fully functional game that introduces the beginning concepts of programming: sequential, conditional, iterative operations.
Compression Of Video Tracking And Bandwidth Balancing Routing In Wireless Multimedia Sensor Networks,
2015
Lawrence Technological University
Compression Of Video Tracking And Bandwidth Balancing Routing In Wireless Multimedia Sensor Networks, Yin Wang, Jianjun Yang, Ju Shen, Bryson Payne, Juan Guo, Kun Hua
Computer Science Faculty Publications
There has been a tremendous growth in multimedia applications over wireless networks. Wireless Multimedia Sensor Networks(WMSNs) have become the premier choice in many research communities and industry. Many state-of-art applications, such as surveillance, traffic monitoring, and remote heath care are essentially video tracking and transmission in WMSNs. The transmission speed is constrained by the big file size of video data and fixed bandwidth allocation in constant routing paths. In this paper, we present a CamShift based algorithm to compress the tracking of videos. Then we propose a bandwidth balancing strategy in which each sensor node is able to dynamically select …
Locating Potential Aspect Interference Using Clustering Analysis,
2015
Nova Southeastern University
Locating Potential Aspect Interference Using Clustering Analysis, Brian Todd Bennett
CCAC Theses and Dissertations
Software design continues to evolve from the structured programming paradigm of the 1970s and 1980s and the object-oriented programming (OOP) paradigm of the 1980s and 1990s. The functional decomposition design methodology used in these paradigms reduced the prominence of non-functional requirements, which resulted in scattered and tangled code to address non-functional elements. Aspect-oriented programming (AOP) allowed the removal of crosscutting concerns scattered throughout class code into single modules known as aspects. Aspectization resulted in increased modularity in class code, but introduced new types of problems that did not exist in OOP. One such problem was aspect interference, in which aspects …
Design, Programming, And User-Experience,
2015
University of Connecticut - Storrs
Design, Programming, And User-Experience, Kaila G. Manca
Honors Scholar Theses
This thesis is a culmination of my individualized major in Human-Computer Interaction. As such, it showcases my knowledge of design, computer engineering, user-experience research, and puts into practice my background in psychology, com- munications, and neuroscience.
I provided full-service design and development for a web application to be used by the Digital Media and Design Department and their students.This process involved several iterations of user-experience research, testing, concepting, branding and strategy, ideation, and design. It lead to two products.
The first product is full-scale development and optimization of the web appli- cation.The web application adheres to best practices. It was …
Making Your Popcorn And Enjoying It Too,
2015
Texas A&M University-Commerce
Making Your Popcorn And Enjoying It Too, Sean Anderson, Adam C. Northam
Velma K. Waters Library Faculty Publications
No abstract provided.
Java Animated Software For Teaching The Frank-Wolfe Algorithm For Static Traffic Network Equilibrium,
2015
Old Dominion University
Java Animated Software For Teaching The Frank-Wolfe Algorithm For Static Traffic Network Equilibrium, Zhi Li
Computational Modeling & Simulation Engineering Theses & Dissertations
The popular Frank-Wolfe (FW) algorithm for solving the network equilibrium problems plays an important role in transportation simulation. Not only has the basic Frank Wolfe algorithm been studied, but also other variations of the FW algorithm (such as Conjugate Frank Wolfe and Bi-Conjugate Frank Wolfe algorithms) have been extensively studied by the research communities.
In this work, the basic Frank Wolfe algorithm is re-visited for the purpose of developing a useful, user-friendly, and appealing Java computer animation for enhancing the teaching effectiveness of this fundamental transportation static network equilibrium algorithm. Since the shortest path (SP) algorithms (such as the well-known …
Leading Undergraduate Students To Big Data Generation,
2015
University of North Georgia
Leading Undergraduate Students To Big Data Generation, Jianjun Yang, Ju Shen
Computer Science Faculty Publications
People are facing a flood of data today. Data are being collected at unprecedented scale in many areas, such as networking, image processing, virtualization, scientific computation, and algorithms. The huge data nowadays are called Big Data. Big data is an all encompassing term for any collection of data sets so large and complex that it becomes difficult to process them using traditional data processing applications. In this article, the authors present a unique way which uses network simulator and tools of image processing to train students abilities to learn, analyze, manipulate, and apply Big Data. Thus they develop students hands-on …
Hole Detection And Shape-Free Representation And Double Landmarks Based Geographic Routing In Wireless Sensor Networks,
2015
University of North Georgia
Hole Detection And Shape-Free Representation And Double Landmarks Based Geographic Routing In Wireless Sensor Networks, Jianjun Yang, Zongming Fei, Ju Shen
Computer Science Faculty Publications
In wireless sensor networks, an important issue of geographic routing is “local minimum” problem, which is caused by a “hole” that blocks the greedy forwarding process. Existing geographic routing algorithms use perimeter routing strategies to find a long detour path when such a situation occurs. To avoid the long detour path, recent research focuses on detecting the hole in advance, then the nodes located on the boundary of the hole advertise the hole information to the nodes near the hole. Hence the long detour path can be avoided in future routing. We propose a heuristic hole detecting algorithm which identifies …
Privacycanary: Privacy-Aware Recommenders With Adaptive Input Obfuscation,
2015
Singapore Management University
Privacycanary: Privacy-Aware Recommenders With Adaptive Input Obfuscation, Thivya Kandappu, Arik Friedman, Roksan Borelli, Vijay Sivaraman
Research Collection School Of Computing and Information Systems
Recommender systems are widely used by online retailers to promote products and content that are most likely to be of interest to a specific customer. In such systems, users often implicitly or explicitly rate products they have consumed, and some form of collaborative filtering is used to find other users with similar tastes to whom the products can be recommended. While users can benefit from more targeted and relevant recommendations, they are also exposed to greater risks of privacy loss, which can lead to undesirable financial and social consequences. The use of obfuscation techniques to preserve the privacy of user …
The Expression Problem, Gracefully,
2015
Portland State University
The Expression Problem, Gracefully, Andrew P. Black
Computer Science Faculty Publications and Presentations
The “Expression Problem” was brought to prominence by Wadler in 1998. It is widely regarded as illustrating that the two mainstream approaches to data abstraction — procedural abstraction and type abstraction— are complementary, with the strengths of one being the weaknesses of the other. Despite an extensive literature, the origin of the problem remains ill-understood. I show that the core problem is in fact the use of global constants, and demonstrate that an important aspect of the problem goes away when Java is replaced by a language like Grace, which eliminates them.
The Grace Programming Language Draft Specification Version 0.5. 2025,
2015
Portland State University
The Grace Programming Language Draft Specification Version 0.5. 2025, Andrew P. Black, Kim B. Bruce, James Noble
Computer Science Faculty Publications and Presentations
This is a specification of the Grace Programming Language. This specification is notably incomplete, and everything is subject to change. For discussion and rationale, see http://gracelang.org.
Metalogic Notes,
2015
University of Dayton
Metalogic Notes, Saverio Perugini
Computer Science Working Papers
A collection of notes, formulas, theorems, postulates and terminology in symbolic logic, syntactic notions, semantic notions, linkages between syntax and semantics, soundness and completeness, quantified logic, first-order theories, Goedel's First Incompleteness Theorem and more.
Statistics Notes,
2015
University of Dayton
Statistics Notes, Saverio Perugini
Computer Science Working Papers
A collection of terms, definitions, formulas and explanations about statistics.
Injective Type Families For Haskell,
2015
University of Edinburgh
Injective Type Families For Haskell, Jan Stolarek, Simon Peyton Jones, Richard A. Eisenberg
Computer Science Faculty Research and Scholarship
Haskell, as implemented by the Glasgow Haskell Compiler (GHC), allows expressive type-level programming. The most popular type- level programming extension is TypeFamilies, which allows users to write functions on types. Yet, using type functions can cripple type inference in certain situations. In particular, lack of injectivity in type functions means that GHC can never infer an instantiation of a type variable appearing only under type functions. In this paper, we describe a small modification to GHC that allows type functions to be annotated as injective. GHC naturally must check validity of the injectivity annotations. The algorithm to do so is …
Math In The Dark: Tools For Expressing Mathematical Content By Visually Impaired Students,
2015
Nova Southeastern University
Math In The Dark: Tools For Expressing Mathematical Content By Visually Impaired Students, Patricia M. Mcdermott-Wells
CCAC Theses and Dissertations
Blind and visually impaired students are under-represented in the science, technology, engineering, and mathematics disciplines of higher education and the workforce. This is due primarily to the difficulties they encounter in trying to succeed in mathematics courses. While there are sufficient tools available to create Braille content, including the special Nemeth Braille used in the U.S. for mathematics constructs, there are very few tools to allow a blind or visually impaired student to create his/her own mathematical content in a manner that sighted individuals can use. The software tools that are available are isolated, do not interface well with other …
A Predictive Modeling System: Early Identification Of Students At-Risk Enrolled In Online Learning Programs,
2015
Nova Southeastern University
A Predictive Modeling System: Early Identification Of Students At-Risk Enrolled In Online Learning Programs, Mary L. Fonti
CCAC Theses and Dissertations
Predictive statistical modeling shows promise in accurately predicting academic performance for students enrolled in online programs. This approach has proven effective in accurately identifying students who are at-risk enabling instructors to provide instructional intervention. While the potential benefits of statistical modeling is significant, implementations have proven to be complex, costly, and difficult to maintain. To address these issues, the purpose of this study is to develop a fully integrated, automated predictive modeling system (PMS) that is flexible, easy to use, and portable to identify students who are potentially at-risk for not succeeding in a course they are currently enrolled in. …
Archive - A Data Management Program,
2015
James Madison University
Archive - A Data Management Program, James H. Devilbiss, C. Steven Whisnant, Yasmeen Shorish
Department of Physics and Astronomy - Faculty Scholarship
To meet funding agency requirements, a portable data management solution is presented for small research groups. The database created is simple, searchable, robust, and can reside across multiple hard drives. Employing a standard metadata schema for all data, the database ensures a high level of standardization, findability, and organization. The software is written in Perl, runs on UNIX, and presents a web-based user interface. It uses a fast, portable log-in scheme, making it easy to export to other locations. As research continues to move towards more open data sharing and reproducibility, this database solution is agile enough to accommodate external …
Constrained Templates In C++,
2015
The University Of Akron
Constrained Templates In C++, Braden L. Obrzut
Williams Honors College, Honors Research Projects
This paper seeks to answer what C++ concepts are, the benefit they provide to C++ programmers, and where we would like to go looking ahead. To accomplish this, it will examine the current state of generic programming in C++, look at what other languages do to avoid the issue, and how concepts can be used to solve the problem in a manner which provides more freedom to the programmer. In the general sense, concepts allow the programmer to specify preconditions which must be satisfied on the inputs to generic code. The desire being to fully describe what is required by …
The Future Of Ios Development: Evaluating The Swift Programming Language,
2015
Claremont McKenna College
The Future Of Ios Development: Evaluating The Swift Programming Language, Garrett Wells
CMC Senior Theses
Swift is a new programming language developed by Apple for creating iOS and Mac OS X applications. Intended to eventually replace Objective-C as Apple’s language of choice, Swift needs to convince developers to switch over to the new language. Apple has promised that Swift will be faster than Objective-C, as well as offer more modern language features, be very safe, and be easy to learn and use. In this thesis I test these claims by creating an iOS application entirely in Swift as well as benchmarking two different algorithms. I find that while Swift is faster than Objective-C, it does …
The Nax Language: Unifying Functional Programming And Logical Reasoning In A Language Based On Mendler-Style Recursion Schemes And Term-Indexed Types,
2014
Portland State University
The Nax Language: Unifying Functional Programming And Logical Reasoning In A Language Based On Mendler-Style Recursion Schemes And Term-Indexed Types, Ki Yung Ahn
Dissertations and Theses
Two major applications of lambda calculi in computer science are functional programming languages and mechanized reasoning systems (or, proof assistants). According to the Curry--Howard correspondence, it is possible, in principle, to design a unified language based on a typed lambda calculus for both logical reasoning and programming. However, the different requirements of programming languages and reasoning systems make it difficult to design such a unified language that provides both. Programming languages usually extend lambda calculi with programming-friendly features (e.g., recursive datatypes, general recursion) for supporting the flexibility to model various computations, while sacrificing logical consistency. Logical reasoning systems usually extend …
