Engineering Commons^™

Improved Framework For Fast And Efficient Memory-Based Frame Data Reconfiguration For Multi-Row Spanning Designs On Field Programmable Gate Arrays, Rohan Sreeram

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Reconfigurable computing is an evolving paradigm in computer architecture where the ability to load different designs onto a field programmable gate array (FPGA) at execution time has proven useful in adapting FPGA prototypes to a wide range of applications. Reconfiguration techniques can be primarily categorized as Partial Dynamic Reconfiguration (PDR) and Partial Bitstream Relocation (PBR). PDR involves reconfiguring a single Partial Reconfiguration Region (PRR) with a partial bitstream, while PBR is targeted at reconfiguring multiple PRRs on the FPGA with a partial bitstream. Previous techniques have primarily focused on using either slower off-chip memory or on-chip memory-based solutions to store …

Developing A Filter Kit System Database: Procedure And Analysis, He Shi

Morehead State Theses and Dissertations

A thesis presented to the faculty of the College of Science and Technology at Morehead State University in partial fulfillment of the requirements for the Degree Master of Science by He Shi on April 30, 2010.

A Computer Vision Application To Accurately Estimate Object Distance, Kayton B. Parekh

Mathematics, Statistics, and Computer Science Honors Projects

Scientists have been working to create robots that perform manual work for years. However, creating machines that can navigate themselves and respond to their environment has proven to be difficult. One integral task to such research is to estimate the position of objects in the robot's visual field.

In this project we examine an implementation of computer vision depth perception. Our application uses color-based object tracking combined with model-based pose estimation to estimate the depth of specific objects in the view of our Pioneer 2 and Power Wheels robots. We use the Camshift algorithm for color-based object tracking, which uses …

Rapport: Semantic-Sensitive Namespace Management In Large-Scale File Systems, Yu Hua, Hong Jiang, Yifeng Zhu, Dan Feng

School of Computing: Technical Reports

Explosive growth in volume and complexity of data exacerbates the key challenge to effectively and efficiently manage data in a way that fundamentally improves the ease and efficacy of their use. Existing large-scale file systems rely on hierarchically structured namespace that leads to severe performance bottlenecks and renders it impossible to support real-time queries on multi-dimensional attributes. This paper proposes a novel semantic-sensitive scheme, called Rapport, to provide dynamic and adaptive namespace management and support complex queries. The basic idea is to build files’ namespace by utilizing their semantic correlation and exploiting dynamic evolution of attributes to support namespace management. …

Channel Characterization For Wireless Underground Sensor Networks, Agnelo Rocha Da Silva

School of Computing: Dissertations, Theses, and Student Research

Wireless Underground Sensor Networks (WUSNs) are natural extensions of the established Wireless Sensor Network (WSN) phenomenon and consist of sensors buried underground which communicate through soil. WUSNs have the potential to impact a wide variety of applications including precision agriculture, environmental monitoring, border patrol, and infrastructure monitoring. The main difference between WUSNs and traditional wireless networks is the communication medium. However, a comprehensive wireless underground channel model for WUSNs has not been developed so far. In this thesis, the Soil Subsurface Wireless Communication (SSWC) channel model is developed based on an extensive empirical study in a large agriculture field. The …

Integrating Perception And Problem Solving To Predict Complex Object Behaviors, Damian M. Lyons, Sirhan Chaudhry, Marius Agica, John Vincent Monaco

Faculty Publications

One of the objectives of Cognitive Robotics is to construct robot systems that can be directed to achieve realworld goals by high-level directions rather than complex, low-level robot programming. Such a system must have the ability to represent, problem-solve and learn about its environment as well as communicate with other agents. In previous work, we have proposed ADAPT, a Cognitive Architecture that views perception as top-down and goaloriented and part of the problem solving process.

Our approach is linked to a SOAR-based problem-solving and learning framework. In this paper, we present an architecture for the perceptive and world modelling components …

Towards A Natural Proof Of Metrization Theorem For Space-Times, Vladik Kreinovich, Olga Kosheleva

Departmental Technical Reports (CS)

In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemma was instrumental in proving that under reasonable conditions, every topological space can be metrized.

A few years before that, in 1919, a complex mathematical theory was experimentally proven to be extremely useful in the description of real world phenomena: namely, during a solar eclipse, General Relativity theory -- that uses pseudo-Riemann spaces to describe space-time -- has been (spectacularly) experimentally confirmed. Motivated by this success, Urysohn started working on an extension of his lemma …

Selecting The Best Location For A Meteorological Tower: A Case Study Of Multi-Objective Constraint Optimization, Aline James, Craig Tweedie, Tanja Magoc, Vladik Kreinovich, Martine Ceberio

Departmental Technical Reports (CS)

Using the problem of selecting the best location for a meteorological tower as an example, we show that in multi-objective optimization under constraints, the traditional weighted average approach is often inadequate. We also show that natural invariance requirements lead to a more adequate approach -- a generalization of Nash's bargaining solution.

How To Relate Spectral Risk Measures And Utilities, Songsak Sriboonchitta, Hung T. Nguyen, Vladik Kreinovich

Departmental Technical Reports (CS)

Traditional decision theory describes human behavior and human preferences in terms of utility functions. In the last decades, it was shown that in many economic situations, a reasonable description of the actual decisions can be found if we use a different approach -- of spectral risk measures. In each of these approaches, we first need to empirically find the corresponding function: utility function in the traditional approach and the weighting function for spectral risk measures. Since both approaches provide a reasonable description of the same actual behavior (in particular, of the same actual economic behavior), it is desirable to be …

Why Polynomial Formulas In Soft Computing, Decision Making, Etc.?, Olga Kosheleva, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

We show that in many application areas including soft constraints reasonable requirements of scale-invariance lead to polynomial formulas for combining degrees (of certainty, of preference, etc.)

Contributors’ Preference In Open Source Software Usability: An Empirical Study, Arif Raza, Luiz Fernando Capretz

Electrical and Computer Engineering Publications

The fact that the number of users of open source software (OSS) is practically un-limited and that ultimately the software quality is determined by end user’s experience, makes the usability an even more critical quality attribute than it is for proprietary software. With the sharp increase in use of open source projects by both individuals and organizations, the level of usability and related issues must be addressed more seriously. The research model of this empirical investigation studies and establishes the relationship between the key usability factors from contributors’ perspective and OSS usability. A data set of 78 OSS contributors that …

Towards Improved Trapezoidal Approximation To Intersection (Fusion) Of Trapezoidal Fuzzy Numbers: Specific Procedure And General Non-Associativity Theorem, Gang Xiang, Vladik Kreinovich

Departmental Technical Reports (CS)

In some cases, our uncertainty about a quantity can be described by an interval of its possible values. If we have two or more pieces of interval information about the same quantity, then we can conclude that the actual value belongs to the intersection of these intervals.

In general, we may need a fuzzy number to represent our partial knowledge. A fuzzy number can be viewed as a collection of intervals (alpha-cuts) corresponding to different degrees alpha from [0,1]. In practice, we can only store finitely many alpha-cuts. Usually, we only store the lower and upper alpha-cuts (corresponding to alpha …

Access Control Contracts For Java Program Modules, Carlos E. Rubio-Medrano, Yoonsik Cheon

Departmental Technical Reports (CS)

Application-level security has become an issue in recent years; for example, errors, discrepancies and omissions in the specification of access control constraints of security-sensitive software components are recognized as an important source for security vulnerabilities. We propose to formally specify access control assumptions or constraints of a program module and enforce them at run-time. We call such specifications access control contracts. To realize access control contracts, we extended the JML language, a formal interface specification language for Java, and developed a prototype support tool that translates access control contracts to runtime checks. The access control contract reduces the vulnerability that …

Pretty Lights, Nicholas (Nick) Delmas, Matthew (Matt) Maniaci

Computer Engineering

Digital media players often include a visualization component that allows a user to watch a visualization synchronized to their music or videos. This project uses the visualization plugin API of an existing media playback program (WinAmp) but it displays its visuals using physical LED lights. Instead of outputting visuals to the computer screen, data is sent over USB to a micro controller that runs the LED lights. This project aims to give users a more visceral visual experience than traditional visualizations on the computer screen.

Cs 206: Computer Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including advanced topics in spreadsheets, database and presentation graphics, using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of advanced computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.

Cs 790: Optimizing Compliers For Modern Architectures, Meilin Liu

Computer Science & Engineering Syllabi

This course studies compiler optimization for modern architectures. Between parsing the input program and generating the target machine code, optimizing compilers perform a wide range of program transformations on a program to improve its performance. In this course we focus on data dependence analysis, program transformations and loop transformations, loop scheduling, and a combination of these optimizing techniques.

Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we present a Non-Bayesian conditioning rule for belief revision. This rule is truly Non-Bayesian in the sense that it doesn’t satisfy the common adopted principle that when a prior belief is Bayesian, after conditioning by X, Bel(X|X) must be equal to one. Our new conditioning rule for belief revision is based on the proportional conflict redistribution rule of combination developed in DSmT (Dezert-Smarandache Theory) which abandons Bayes’ conditioning principle. Such Non-Bayesian conditioning allows to take into account judiciously the level of conflict between the prior belief available and the conditional evidence. We also introduce the deconditioning problem …

Cs 499/699: Logic For Computer Scientists, Pascal Hitzler

Computer Science & Engineering Syllabi

Logic is often called the Calculus of Computer Science. Indeed, logic permeates most areas of Computer Science in one way or the other, sometimes more prominently, and sometimes as motivational or formal underpinning. Examples are database schema, program verification, semantics of programming languages, computer security, artificial intelligence, cognitive robotics, Web information systems, computer hardware circuitry, or modeling in software engineering.

Cs 740: Algorithms, Complexity And The Theory Of Computability, Pascal Hitzler

Computer Science & Engineering Syllabi

What does it mean to say that some computational problem is intrinsically more difficult than some other problem? How can I claim that I have found a good algorithmic solution? The study of these questions gives rise to an area of Theoretical Computer Science called Complexity Theory, which is based on a systematic and thorough formal study of the complexity of problems with respect to their algorithmic solvability, using Turing machines as main conceptual tool. In this class, we will understand how problem and algorithmic complexity is measured, and discuss some of the main complexity classes arising from this study. …

Cs 400/600: Data Structures And Software Design, Guozhu Dong

Computer Science & Engineering Syllabi

No abstract provided.

Cs 142: Computer Programming - Ii, Michael Ondrasek

Computer Science & Engineering Syllabi

The concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development, of user interfaces and handling runtime errors with an emphasis on program verification and testing. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: CS 141 (Computer Programming I) and MTH 127 (College Algebra) or equivalent.

Cs 141: Computer Programming - I, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 209 is the second of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming.

Cs 242: Computer Programming Iii, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.

Cs 466/666: Introduction To Formal Languages, Guozhu Dong

Computer Science & Engineering Syllabi

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 the fundamentals of these tow 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 Sciences, by Thomas Sudkamp.

Cs 242: Computer Programming Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Cs 784: Programming Languages, Prabhaker Mateti

Computer Science & Engineering Syllabi

Programming paradigms and concepts for high level programming languages. Techniques for formal specification. 4.000 Credit hours. Prerequisites: CS 480/680.

Cs 801: Advanced Database Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of current trends and research issues in database systems.

Cs 241-01: Computer Programming Ii, Travis E. Doom

Computer Science & Engineering Syllabi

A continuation of CS240. The emphasis is on data abstraction and software engineering. Prerequisite: CS240.

Cs 271/Bio 371: Introduction To Bioinformatics, Michael L. Raymer, Dan E. Krane

Computer Science & Engineering Syllabi

The course web page will be the primary method for distributing important announcements, course material, class notes, etc. Please check the page often. Login to the campus WebCT system using your cats username and password. The URL is: http://wisdom.wright.edu