Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 12 of 12

Full-Text Articles in Physical Sciences and Mathematics

The Graph Database: Jack Of All Trades Or Just Not Sql?, George F. Hurlburt, Maria R. Lee, George K. Thiruvathukal Nov 2017

The Graph Database: Jack Of All Trades Or Just Not Sql?, George F. Hurlburt, Maria R. Lee, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

This special issue of IT Professional focuses on the graph database. The graph database, a relatively new phenomenon, is well suited to the burgeoning information era in which we are increasingly becoming immersed. Here, the guest editors briefly explain how a graph database works, its relation to the relational database management system (RDBMS), and its quantitative and qualitative pros and cons, including how graph databases can be harnessed in a hybrid environment. They also survey the excellent articles submitted for this special issue.


Reproducible Research For Computing In Science & Engineering, Lorena A. Barba, George K. Thiruvathukal Nov 2017

Reproducible Research For Computing In Science & Engineering, Lorena A. Barba, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

The editors of the new track for reproducible research outline the parameters for future peer review, submission, and access, highlighting the magazine’s previous work in this field and some of the challenges still to come.


Separating Markup From Text, Ronald I. Greenberg, George K. Thiruvathukal Nov 2017

Separating Markup From Text, Ronald I. Greenberg, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

As more and more online versions of Humanities texts are created, it is becoming commonplace to embed elaborate formatting, for example, through the use of HTML. But this can interfere with computerized analyses of the original text. While it may seem, at first, straightforward to simply strip markup from text, this is not the reality. Many digital texts add things that appear to be legitimate content according to the markup syntax, for example, line numbers, and even apart from this issue, existing tools for stripping markup produce inconsistent results. Apart from adopting and enforcing strict conventions for adding markup to …


History Of Computing, George K. Thiruvathukal, David B. Dennis Aug 2017

History Of Computing, George K. Thiruvathukal, David B. Dennis

Computer Science: Faculty Publications and Other Works

The social and organizational history of humanity is intricately entangled with the history of technology in general and the technology of information in particular. Advances in this area have often been closely involved in social and political transformations. While the contemporary period is often referred to by such names as the Computing and Information Age, this is the culmination of a series of historical transformations that have been centuries in the making. This course will provide a venue for students to learn about history through the evolution of number systems and arithmetic, calculating and computing machines, and advanced communication technology …


Comparison Of Visual Datasets For Machine Learning, Kent Gauen, Ryan Dailey, John Laiman, Yuxiang Zi, Nirmal Asokan, Yung-Hsiang Lu, George K. Thiruvathukal, Mei-Ling Shyu, Shu-Ching Chen Aug 2017

Comparison Of Visual Datasets For Machine Learning, Kent Gauen, Ryan Dailey, John Laiman, Yuxiang Zi, Nirmal Asokan, Yung-Hsiang Lu, George K. Thiruvathukal, Mei-Ling Shyu, Shu-Ching Chen

Computer Science: Faculty Publications and Other Works

One of the greatest technological improvements in recent years is the rapid progress using machine learning for processing visual data. Among all factors that contribute to this development, datasets with labels play crucial roles. Several datasets are widely reused for investigating and analyzing different solutions in machine learning. Many systems, such as autonomous vehicles, rely on components using machine learning for recognizing objects. This paper compares different visual datasets and frameworks for machine learning. The comparison is both qualitative and quantitative and investigates object detection labels with respect to size, location, and contextual information. This paper also presents a new …


Examining The Use Of Amazon’S Mechanical Turk For Edge Extraction Of The Occlusal Surface Of Fossilized Bovid Teeth, George K. Thiruvathukal, Gregory J. Matthews, Maxwell P. Luetkemeier, Juliet K. Brophy Jul 2017

Examining The Use Of Amazon’S Mechanical Turk For Edge Extraction Of The Occlusal Surface Of Fossilized Bovid Teeth, George K. Thiruvathukal, Gregory J. Matthews, Maxwell P. Luetkemeier, Juliet K. Brophy

Computer Science: Faculty Publications and Other Works

In order to reconstruct environments associated with Plio-Pleistocene hominins in southern Africa, researchers frequently rely upon the animals associated with the hominins, in particular, animals in the Family Bovidae. Bovids in southern Africa are typically identified by their teeth. However, identifying the taxon of a bovid tooth is challenging due to various biasing factors. Furthermore, inaccurate identification of fossil bovids can have significant consequences on the reconstructed paleoenvironment. Recent research on the classification of bovid fossil teeth has relied on using elliptical Fourier analysis to summarize the shape of the outline of the occlusal surface of the tooth and the …


Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg Jul 2017

Educational Magic Tricks Based On Error-Detection Schemes, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Magic tricks based on computer science concepts help grab student attention and can motivate them to delve more deeply. Error detection ideas long used by computer scientists provide a rich basis for working magic; probably the most well known trick of this type is one included in the CS Unplugged activities. This paper shows that much more powerful variations of the trick can be performed, some in an unplugged environment and some with computer assistance. Some of the tricks also show off additional concepts in computer science and discrete mathematics.


Motion Planning For Simple Two-Wheeled Robots, Ronald I. Greenberg, Jeffery M. Karp Jul 2017

Motion Planning For Simple Two-Wheeled Robots, Ronald I. Greenberg, Jeffery M. Karp

Computer Science: Faculty Publications and Other Works

This paper considers various simple ways of navigating in a 2-dimensianal territory with a two-wheeled robot of a type typical in educational robotics. We determine shortest paths under various modes of operation and compare.


A Distributed Graph Approach For Pre-Processing Linked Rdf Data Using Supercomputers, Michael J. Lewis, George K. Thiruvathukal, Venkatram Vishwanath, Michael J. Papka, Andrew Johnson May 2017

A Distributed Graph Approach For Pre-Processing Linked Rdf Data Using Supercomputers, Michael J. Lewis, George K. Thiruvathukal, Venkatram Vishwanath, Michael J. Papka, Andrew Johnson

Computer Science: Faculty Publications and Other Works

Efficient RDF, graph based queries are becoming more pertinent based on the increased interest in data analytics and its intersection with large, unstructured but connected data. Many commercial systems have adopted distributed RDF graph systems in order to handle increasing dataset sizes and complex queries. This paper introduces a distribute graph approach to pre-processing linked data. Instead of traversing the memory graph, our system indexes pre-processed join elements that are organized in a graph structure. We analyze the Dbpedia data-set (derived from the Wikipedia corpus) and compare our access method to the graph traversal access approach which we also devise. …


Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg Apr 2017

Pythagorean Approximations For Lego: Merging Educational Robot Construction With Programming And Data Analysis, Ronald I. Greenberg

Computer Science: Faculty Publications and Other Works

Abstract. This paper can be used in two ways. It can provide reference information for incorporating diagonal elements (for bracing or gear meshing) in educational robots built from standard LEGO kits. Alternatively, it can be used as the basis for an assignment for high school or college students to recreate this information; in the process, students will exercise skills in both computer programming and data analysis. Using the paper in the second way can be an excellent integrative experience to add to an existing course; for example, the Exploring Computer Science high school curriculum concludes with the units “Introduction to …


Does A Taste Of Computing Increase Computer Science Enrollment?, Steven Mcgee, Randi Mcgee-Tekula, Jennifer Duck, Ronald I. Greenberg, Lucia Dettori, Dale F. Reed, Brenda Wilkerson, Don Yanek, Andrew Rasmussen, Gail Chapman Apr 2017

Does A Taste Of Computing Increase Computer Science Enrollment?, Steven Mcgee, Randi Mcgee-Tekula, Jennifer Duck, Ronald I. Greenberg, Lucia Dettori, Dale F. Reed, Brenda Wilkerson, Don Yanek, Andrew Rasmussen, Gail Chapman

Computer Science: Faculty Publications and Other Works

The Exploring Computer Science (ECS) high school curriculum is designed to foster deep engagement through equitable inquiry around computer science concepts. We have shown that students find ECS courses personally relevant, are increasing their expectancies of success and perceived value for the field of computer science, and are more likely to take another computing course.


Queryable Compression For Massively Streaming Social Networks, Chandra N. Sekharan, Sridhar Radhakrishnan, Ben Nelson, Amlan Chatterjee Jan 2017

Queryable Compression For Massively Streaming Social Networks, Chandra N. Sekharan, Sridhar Radhakrishnan, Ben Nelson, Amlan Chatterjee

Computer Science: Faculty Publications and Other Works

The social networks of today are a set of massive, dynamically changing graph structures. Each of these graphs contain a set of nodes (individuals) and a set of edges among the nodes (relationships). The choice of representation of a graph determines what information is easy to obtain from it. However, many social network graphs are so large that even their basic representations (e.g. adjacency lists) do not fit in main memory. Hence an ongoing field of study has focused on designing compressed representations of graphs that facilitate certain query functions.This work is based on representing dynamic social networks that we …