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

Computer Engineering Commons

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

Computer Sciences

Selected Works

Keyword
Publication Year
Publication
File Type

Articles 1 - 30 of 215

Full-Text Articles in Computer Engineering

Seasonal Warranty Prediction Based On Recurrent Event Data, Qianqian Shan, Yili Hong, William Q. Meeker Jr. Aug 2019

Seasonal Warranty Prediction Based On Recurrent Event Data, Qianqian Shan, Yili Hong, William Q. Meeker Jr.

William Q Meeker

Warranty return data from repairable systems, such as vehicles, usually result in recurrent event data. The non-homogeneous Poisson process (NHPP) model is used widely to describe such data. Seasonality in the repair frequencies and other variabilities, however, complicate the modeling of recurrent event data. Not much work has been done to address the seasonality, and this paper provides a general approach for the application of NHPP models with dynamic covariates to predict seasonal warranty returns. A hierarchical clustering method is used to stratify the population into groups that are more homogeneous than the than the overall population. The stratification facilitates ...


Provisioning On-Line Games: A Traffic Analysis Of A Busy Counter-Strike Server, Francis Chang, Wu-Chang Feng, Wu-Chi Feng, Jonathan Walpole Aug 2019

Provisioning On-Line Games: A Traffic Analysis Of A Busy Counter-Strike Server, Francis Chang, Wu-Chang Feng, Wu-Chi Feng, Jonathan Walpole

Jonathan Walpole

A poster that illustrates the client/server model employed by an multiplayer online game, focusing on bandwidth usage.


Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg Apr 2019

Integrating Mathematics And Educational Robotics: Simple Motion Planning, Ronald I. Greenberg, George K. Thiruvathukal, Sara T. Greenberg

George K. Thiruvathukal

This paper shows how students can be guided to integrate elementary mathematical analyses with motion planning for typical educational robots. Rather than using calculus as in comprehensive works on motion planning, we show students can achieve interesting results using just simple linear regression tools and trigonometric analyses. Experiments with one robotics platform show that use of these tools can lead to passable navigation through dead reckoning even if students have limited experience with use of sensors, programming, and mathematics.


Learning To Love Data (Week): Creating Data Services Awareness On Campus, Katie Wissel, Lisa Deluca Sep 2018

Learning To Love Data (Week): Creating Data Services Awareness On Campus, Katie Wissel, Lisa Deluca

Lisa DeLuca, MLIS, MPA

No abstract provided.


Impact Of The Application Layer Protocol On Energy Consumption, 4g Utilization And Performance How The Application Layer Protocol Strengthens Green Iot, Sachin Pawaskar, Johannes Hofer Jul 2018

Impact Of The Application Layer Protocol On Energy Consumption, 4g Utilization And Performance How The Application Layer Protocol Strengthens Green Iot, Sachin Pawaskar, Johannes Hofer

Sachin Pawaskar

The IoT communication over our data highways is growing tremendously. In future many device and machine manufacturers will transmit data from customer end-devices to data centers to improve and change the products to the customer’s needs. The focus of the next decades will be on reducing energy consumption and data overhead in order to keep utilization of 4G/5G networks low. This paper analyzes two different communication approaches often used in IoT scenarios. The benchmark compares the protocol MQTT against the RESTful approach which is based on HTTP(s) in terms of energy consumption and performance. The results of ...


Scrumtutor: A Web-Based Interactive Tutorial For Scrum Software Development, Sindhura Potineni, Srividya K. Bansal, Ashish Amresh Apr 2018

Scrumtutor: A Web-Based Interactive Tutorial For Scrum Software Development, Sindhura Potineni, Srividya K. Bansal, Ashish Amresh

Ashish Amresh

In a traditional software engineering class, students are typically engaged in theoretical lectures followed by homework assignments or a project. Use of hands-on training and laboratory activities using realworld projects is more likely to produce students with a higher level of achievement and more confidence in the course material. If every topic or technique introduced in the course has a corresponding hands-on activity that demonstrates an application or use of the concept in the industry, students better understand the need for the technique and the learning environment is more interactive, engaging, and interesting to students. This paper presents a project ...


Specification: The Biggest Bottleneck In Formal Methods And Autonomy, Kristin Yvonne Rozier Apr 2018

Specification: The Biggest Bottleneck In Formal Methods And Autonomy, Kristin Yvonne Rozier

Kristin Yvonne Rozier

Advancement of AI-enhanced control in autonomous systems stands on the shoulders of formal methods, which make possible the rigorous safety analysis autonomous systems require. An aircraft cannot operate autonomously unless it has design-time reasoning to ensure correct operation of the autopilot and runtime reasoning to ensure system health management, or the ability to detect and respond to off-nominal situations. Formal methods are highly dependent on the specifications over which they reason; there is no escaping the “garbage in, garbage out” reality. Specification is difficult, unglamorous, and arguably the biggest bottleneck facing verification and validation of aerospace, and other, autonomous systems ...


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

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.


Pythagorean Combinations For Lego Robot Building., Ronald I. Greenberg Jan 2018

Pythagorean Combinations For Lego Robot Building., Ronald I. Greenberg

Ronald Greenberg

This paper provides tips for LEGO robot construction involving bracing or gear meshing along a diagonal using standard Botball kits.


Randomized Routing On Fat-Trees, Ronald I. Greenberg Jan 2018

Randomized Routing On Fat-Trees, Ronald I. Greenberg

Ronald Greenberg

Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/n). The ...


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

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

Ronald Greenberg

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 ...


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

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

Ronald Greenberg

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.


An Empirical Comparison Of Area-Universal And Other Parallel Computing Networks, Ronald I. Greenberg, Lee Guan Jan 2018

An Empirical Comparison Of Area-Universal And Other Parallel Computing Networks, Ronald I. Greenberg, Lee Guan

Ronald Greenberg

This paper provides empirical comparison of the communication capabilities of two area-universal networks, the fat-tree and the fat-pyramid, to the popular mesh and hypercube networks for parallel computation. While area-universal networks have been proven capable of simulating, with modest slowdown, any computation of any other network of comparable area, prior work has generally left open the question of how area-universal networks compare to other networks in practice. Comparisons are performed using techniques of throughput and latency analysis that have previously been applied to k-ary n-cube networks and using various existing models to equate the hardware cost of the networks being ...


An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan Jan 2018

An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan

Ronald Greenberg

A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.


An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan Jan 2018

An Empirical Comparison Of Networks And Routing Strategies For Parallel Computation, Ronald I. Greenberg, Lee Guan

Ronald Greenberg

This paper compares message routing capabilities of important networks proposed for general-purpose parallel computing. All the networks have been proven to have some type of universality property, i.e., an ability to simulate other networks of comparable cost with modest slowdown, using appropriate cost and communication models. But in this paper we seek an empirical comparison of communication capability under typical direct use rather than an analysis of worst-case results for simulating message traffic of another network.


A Systolic Simulation And Transformation System, Ronald I. Greenberg, H.-C. Oh Jan 2018

A Systolic Simulation And Transformation System, Ronald I. Greenberg, H.-C. Oh

Ronald Greenberg

This paper presents a CAD tool, SystSim, to ease the design of systolic systems. Given a high-level, functional description of processors, and a high-level description of their interconnection, SystSim will perform simulations and provide graphical output. SystSim will also perform transformations such as retiming, which eases use of the methodology of Leiserson and Saxe of designing a system with broadcasting and then obtaining a systolic system through retiming.


Parallel Cosine Nearest Neighbor Graph Construction, David C. Anastasiu, George Karypis Dec 2017

Parallel Cosine Nearest Neighbor Graph Construction, David C. Anastasiu, George Karypis

David C. Anastasiu

The nearest neighbor graph is an important structure in many data mining methods for clustering, advertising, recommender systems, and outlier detection. Constructing the graph requires computing up to n2 similarities for a set of n objects. This high complexity has led researchers to seek approximate methods, which find many but not all of the nearest neighbors. In contrast, we leverage shared memory parallelism and recent advances in similarity joins to solve the problem exactly. Our method considers all pairs of potential neighbors but quickly filters pairs that could not be a part of the nearest neighbor graph, based on similarity ...


Document Clustering, David C. Anastasiu, Andrea Tagarelli Nov 2017

Document Clustering, David C. Anastasiu, Andrea Tagarelli

David C. Anastasiu

In a world flooded with information, document clustering is an important tool that can help categorize and extract insight from text collections. It works by grouping similar documents, while simultaneously discriminating between groups. In this article, we provide a brief overview of the principal techniques used to cluster documents, and introduce a series of novel deep-learning based methods recently designed for the document clustering task. In our overview, we point the reader to salient works that can provide a deeper understanding of the topics discussed.


Efficient Identification Of Tanimoto Nearest Neighbors; All Pairs Similarity Search Using The Extended Jaccard Coefficient, David C. Anastasiu, George Karypis Oct 2017

Efficient Identification Of Tanimoto Nearest Neighbors; All Pairs Similarity Search Using The Extended Jaccard Coefficient, David C. Anastasiu, George Karypis

David C. Anastasiu

Tanimoto, or extended Jaccard, is an important similarity measure which has seen prominent use in fields such as data mining and chemoinformatics. Many of the existing state-of-the-art methods for market basket analysis, plagiarism and anomaly detection, compound database search, and ligand-based virtual screening rely heavily on identifying Tanimoto nearest neighbors. Given the rapidly increasing size of data that must be analyzed, new algorithms are needed that can speed up nearest neighbor search, while at the same time providing reliable results. While many search algorithms address the complexity of the task by retrieving only some of the nearest neighbors, we propose ...


Software Metrics And Dashboard, Shilpika Shilpika, George K. Thiruvathukal, Saulo Aguiar, Konstantin Läufer, Nicholas J. Hayward Oct 2017

Software Metrics And Dashboard, Shilpika Shilpika, George K. Thiruvathukal, Saulo Aguiar, Konstantin Läufer, Nicholas J. Hayward

Nicholas Hayward

Software metrics are a critical tool which provide continuous insight to products and processes and help build reliable software in mission critical environments. Using software metrics we can perform calculations that help assess the effectiveness of the underlying software or process. The two types of metrics relevant to our work is complexity metrics and in-process metrics. Complexity metrics tend to focus on intrinsic code properties like code complexity. In-process metrics focus on a higher-level view of software quality, measuring information that can provide insight into the underlying software development process.

Our aim is to develop and evaluate a metrics dashboard ...


Metrics, Software Engineering, Small Systems – The Future Of Systems Development, William L. Honig Oct 2017

Metrics, Software Engineering, Small Systems – The Future Of Systems Development, William L. Honig

William L Honig

In this talk I will introduce the importance of metrics, or measures, and the role they play in the development of high quality computer systems. I will review some key mega trends in computer science over the last three decades and then explain why I believe the trend to small networked systems, along with metrics and software engineering will define the future of high technology computer based systems. I first learned about metrics at the Bell System where everything was measured. Metrics can be understood easily if you think of them as measures, for example of calories or salt in ...


Introduction To Atomic Requirements, William L. Honig Oct 2017

Introduction To Atomic Requirements, William L. Honig

William L Honig

An introduction to requirements and the importance of making single atomic requirements statements. Atomic requirements have advantages and improve the requirements process, support requirement verification and validation, enable traceability, support testability of systems, and provide management advantages. Why has there been so little emphasis on atomic requirements?


Requirements Quick Notes, William L. Honig, Shingo Takada Oct 2017

Requirements Quick Notes, William L. Honig, Shingo Takada

William L Honig

A short introduction to requirements and their role in system development. Includes industry definition of requirements, overview of basic requirements process including numbering of requirements, ties to testing, and traceability. An introduction to requirements quality attributes (correct, unambiguous, etc.) Includes references to requirements process, numbering, and quality papers.


An Example Of Atomic Requirements - Login Screen, William L. Honig Oct 2017

An Example Of Atomic Requirements - Login Screen, William L. Honig

William L Honig

A simple example of what an atomic or individual or singular requirement statement should be. Using the example of the familiar login screen, shows the evolution from a low quality initial attempt at requirements to a complete atomic requirement statement. Introduces the idea of a system glossary to support the atomic requirement.


Requirements Metrics - Definitions Of A Working List Of Possible Metrics For Requirements Quality, William L. Honig Oct 2017

Requirements Metrics - Definitions Of A Working List Of Possible Metrics For Requirements Quality, William L. Honig

William L Honig

A work in progress to define a metrics set for requirements. Metrics are defined that apply to either the entire requirements set (requirements document as a whole) or individual atomic (or singular, individual) requirements statements. Requirements are identified with standard names and a identification scheme and include both subjective and objective measures. An example metric for the full set of requirements: Rd2 - Requirements Consistency, Is the set of atomic requirements internally consistent, with no contradictions, no duplication between individual requirements? An example of a metric for a single requirement: Ra4 - Requirement Verifiability, How adequately can this requirement be tested? Is ...


Atomic Requirements Quick Notes, William L. Honig, Shingo Takada Oct 2017

Atomic Requirements Quick Notes, William L. Honig, Shingo Takada

William L Honig

Working paper on atomic requirements for systems development and the importance of singular, cohesive, individual requirements statements. Covers possible definitions of atomic requirements, and their characteristics. Atomic requirements improve many parts of the development process from requirements to testing and contracting.


Cs 466/666-01: Introduction To Formal Languages, Thomas Sudkamp Oct 2017

Cs 466/666-01: Introduction To Formal Languages, Thomas Sudkamp

Thomas Sudkamp

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the syntax of languages can be defined using grammars and patterns accepted by finite state machines. Along with presenting with fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science.


Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2017

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Thomas Sudkamp

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. The Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.


Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2017

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Thomas Sudkamp

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.


Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2017

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Thomas Sudkamp

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.