Engineering Commons^™

Using Fine-Grained Cycle Stealing To Improve Throughput, Efficiency And Response Time On A Dedicated Cluster While Maintaining Quality Of Service, Gary Stiehr

All Computer Science and Engineering Research

For various reasons, a dedicated cluster is not always fully utilized even when all of its processors are allocated to jobs. This occurs any time that a running job does not use 100% of each of the processors allocated to it. Keeping in mind the needs of both the cluster’s system administrators and its users, we would like to increase the throughput and efficiency of the cluster while maintaining or improving the average turnaround time of the jobs and the quality of service of the “primary” jobs originally scheduled on the cluster. To increase the throughput and efficiency of the …

A Study Of Umts Turbo Codes Across Space Time Spreading Channel With The Case Of M = 1 And M = 2, Ibrahim S. Raad, Peter Vial, Tadeusz A. Wysocki

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

The study presented in this paper is that of Universal Mobile Telecommunications Systems (UMTS) Turbo Codes across Space Time Spreading channel with one transmitter antenna, one receiver (m = 1) and two transmitter antennas and one receiver (m = 2) to see to what extent the bit error rate (BER) can be improved. Using the Max-log decoding algorithm and 12 iterations it is shown in the simulation results that an extra 5 dB is achievable.

Load-Balanced Route Discovery For Mobile Ad Hoc Networks, Mehran Abolhasan, Justin Lipman, Tadeusz A. Wysocki

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

This paper presents Flow-Aware Routing Protocol (FARP), a new routing strategy designed to improve load balancing and scalability in mobile ad hoc networks. FARP is a hop-by-hop routing protocol, which introduces a flow-aware route discovery strategy to reduce the number of control overheads propagating through the network and distributes the flow of data through least congested nodes to balance the network traffic. FARP was implemented in Glomosim and compared with AODV. To investigate the load distribution capability of FARP new performance metrics were introduced to measure the data packet flow distribution capability of the each routing protocol. The simulation results …

Condition Monitoring Of Squirrel-Cage Induction Motors Fed By Pwm-Based Drives Using A Parameter Estimation Approach, Behrooz Mirafzal, F. Fateh, Chia-Chou Yeh, Richard J. Povinelli, Nabeel Demerdash

Electrical and Computer Engineering Faculty Research and Publications

Abstract:

A rotor condition monitoring technique is presented in this paper based on a parameter estimation approach. In this technique, the stator currents, voltages and motor speed are used as the input signals, where the outputs will be the rotor's inductance, resistance and consequently rotor time constant. This approach is verified by simulation of two different induction motor cases. These simulations are buttressed by experimental data obtained for a 2-hp induction motor in the case of healthy as well as one, three and five rotor bar breakages. In these tests, the induction motor was energized from a PWM-based drive, in …

Thermodynamic Modeling, Energy Equipartition, And Nonconservation Of Entropy For Discrete-Time Dynamical Systems, Wassim H. Haddad, Qing Hui, Sergey G. Nersesov, Vijaysekhar Chellaboina

Department of Electrical and Computer Engineering: Faculty Publications

We develop thermodynamic models for discrete-time large-scale dynamical systems. Specifically, using compartmental dynamical system theory, we develop energy flowmodels possessing energy conservation, energy equipartition, temperature equipartition, and entropy nonconservation principles for discrete-time, large-scale dynamical systems. Furthermore, we introduce a new and dual notion to entropy; namely, ectropy, as a measure of the tendency of a dynamical system to do useful work and grow more organized, and show that conservation of energy in an isolated thermodynamic system necessarily leads to nonconservation of ectropy and entropy. In addition, using the system ectropy as a Lyapunov function candidate, we show that our discrete-time, …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 3, November 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Checking If There Exists A Monotonic Function That Is Consistent With The Measurements: An Efficient Algorithm, Kavitha Tupelly, Vladik Kreinovich, Karen Villaverde

Departmental Technical Reports (CS)

In many problems in science and engineering ranging from astrophysics to geosciences to financial analysis, we know that a physical quantity y depends on the physical quantity x, i.e., y=f(x) for some function f(x), and we want to check whether this dependence is monotonic. Specifically, finitely many measurements of xi and yi=f(xi) have been made, and we want to check whether the results of these measurements are consistent with the monotonicity of f. An efficient parallelizable algorithm is known for solving this problem when the values xi are known precisely, while the values yi are known with interval uncertainty. In …

Probabilistic Approach To Trust: Ideas, Algorithms, And Simulations, Pattama Jaksurat, Eric A. Freudenthal, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In traditional security systems, for each task, we either trust an agent or we don't. If we trust an agent, we allow this agent full access to this particular task. This agent can usually allow his trusted sub-agents the same access, etc. If a trust management system only uses "trust" and "no trust" options, then a person should trust everyone in this potentially long chain. The problem is that trust is rarely a complete trust, there is a certain probability of distrust. So, when the chain becomes long, the probability of a security leak increases. It is desirable to keep …

Computing The Cube Of An Interval Matrix Is Np-Hard, Olga Kosheleva, Vladik Kreinovich, Guenter Mayer, Hung T. Nguyen

Departmental Technical Reports (CS)

In many practical applications, we are interested in computing the product of given matrices and/or a power of a given matrix. In some cases, the initial matrices are only known with interval uncertainty. It turns out that under this uncertainty, there is a principal difference between the product of two matrices and the product of three (or more) matrices:

on the one hand, it is more or less known that the problems of computing the exact range for the product of two matrices -- and for the square of a matrix -- are computationally feasible;

on the other hand, we …

Foundations Of Statistical Processing Of Set-Valued Data: Towards Efficient Algorithms, Hung T. Nguyen, Vladik Kreinovich, Gang Xiang

Departmental Technical Reports (CS)

Due to measurement uncertainty, often, instead of the actual values xi of the measured quantities, we only know the intervals [Xi]=[Xi-Di,Xi+Di], where Xi is the measured value and Di is the upper bound on the measurement error (provided, e.g., by the manufacturer of the measuring instrument). These intervals can be viewed as random intervals, i.e., as samples from the interval-valued random variable. In such situations, instead of the exact value of a sample statistic such as covariance C(x,y), we can only have an interval [C](x,y) of possible values of this statistic.

In this paper, we extend the foundations of traditional …

Integrated Coverage And Connectivity Configuration For Energy Conservation In Sensor Networks, Guoliang Xing, Xiaorui Wang, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill

All Computer Science and Engineering Research

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Fur-thermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs …

System–On–A–Programmable–Chip Development Platforms In The Classroom, Tyson S. Hall, James O. Hamblen

Faculty Works

This paper describes the authors’ experiences using a system-on-a-programmable-chip (SOPC) approach to support the development of design projects for upper-level undergraduate students in their electrical and computer engineering curriculum. Commercial field-programmable gate-array (FPGA)-based SOPC development boards with reduced instruction set computer (RISC) processor cores are used to support a wide variety of student design projects. A top-down rapid prototyping approach with commercial FPGA computer-aided design tools, a C compiler targeted for the RISC soft-processor core, and a large FPGA with memory is used and reused to support a wide variety of student projects.

Local Model Network Application In Control, Ruiyao Gao

Doctoral

The local model (LM) network is considered for the control of complex nonlinear systems. Both controller design and system analysis techniques are investigated for the Purpose of the development of an overall global controller with guaranteed stability and performance, based on the control methods and theories well developed for linear systems. In particular, the influence of the offset term of affine LM networks on the performance and stability of closed-loop systems is investigated. Assuming the system changes ‘slowly’ enough, an integrator can be utilised in the controller design by considering the offset term as ‘constant’. Gain-scheduled local controller (LC) networks …

Automated Motion Synthesis For Virtual Choreography, Gazihan Alankus, A. Alphan Bayazit, O. Burchan Bayazit

All Computer Science and Engineering Research

In this paper, we present a technique to automati-cally synthesize dancing moves for arbitrary songs. Our current implementation is for virtual characters, but it is easy to use the same algorithms for entertainer robots, such as robotic dancers, which fits very well to this year’s conference theme. Our technique is based on analyzing a musical tune (can be a song or melody) and synthesizing a motion for the virtual character where the character’s movement synchronizes to the musical beats. In order to analyze beats of the tune, we developed a fast and novel algorithm. Our motion synthesis algorithm analyze library …

Peer-To-Peer Searching And Sharing Of Electronic Documents, Paul Stacey

Masters

Peer-to-peer systems have existed since the first incarnation of the Internet. In recent times the Internet has taken on a more hierarchical form, power has been taken away from the individual and placed in the hands of operators of large servers. However, with the re-emergence of p2p the individual is gaining more freedom. End users attached to the Internet now have the power to host and publish content through the user of p2p technologies. Peer-to-peer systems present significant design challenges and have opened up a floodgate of research in an effort to overcome some of the fundamental problems. This thesis …

Convergence Properties Of An Interval Probabilistic Approach To System Reliability Estimation, Cliff Joslyn, Vladik Kreinovich

Departmental Technical Reports (CS)

Based on a black box model of a complex system, and on intervals and probabilities describing the known information about the inputs, we want to estimate the system's reliability. Using the results of tests performed on the system's computer model, we can estimate the lower and upper bounds of the probability that the system is in a desirable state. In this paper, we prove that these estimates are correct in the sense that under reasonable assumptions, these estimates converge to the actual probability bounds.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 2, October 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Ceg 361/561-01: Introduction To Software Testing, John A. Reisner

Computer Science & Engineering Syllabi

This course covers software testing strategies, along with established best practices, so students learn how to test their software in a complete and systematic (vice ad-hoc) manner. Particular attention is paid to planning, writing, and executing software testing documentation, i.e., software test plan, to include documented results. Various projects are assigned, designed to illustrate various challenges associated with software testing, and to reinforce the strategies and techniques used to overcome these challenges.

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

Computer Science & Engineering Syllabi

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.

Ceg 770: Computer Engineering Mathematics, Yong Pei

Computer Science & Engineering Syllabi

Computer Engineering and Science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, queueing theory, mathematics of signal processing, difference equations, and related differential and matrix equations. In addition to mathematical theory, appropriate applications will be presented.

Cs 240: Introduction To Computer Science I, Dale E. Nelson

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 434/634: Concurrent Software Design, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency, and their solutions are examined through course projects and through readings on operating system design.

Ceg 449/699: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

This senior/graduate course provides an in-depth study of networking protocol and system design in the area of wireless networking and mobile computing. It will help students in the networking area establish a solid foundation in wireless networking protocols, fundamental concepts and principles. It will also introduce students to a few hot topics in wireless networking and mobile computing research.

The course will start with a review over fundamental design challenges, architectural principles and philosophy for the Internet and heterogeneous networks. The focus will then move on to an in-depth examination of wireless networking protocols, and system design techniques for mobile …

Ceg 220: Introduction To C Programming For Engineers I, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. Some programming assignments may involve complex arithmetic and trigonometric exponential functions.

Ceg 360/560 Ee 415/651: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG 260.

Cs 405/605: Introduction To Database Management Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Entity Relationship, relational, object-oriented models for databases are presented. Physical implementation methods are discussed.

Cs 784: Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces concepts related to the specification and design of high-level programming languages. It discusses different programming paradigms, algebraic specification and implementation of data types, and develops interpreters for specifying operationally the various programming language features/constructs. It also introduces attribute grammar formalism and axiomatic semantics briefly. The programming assignments will be coded in Scheme.

Cs 409/609: Principles Of Artificial Intelligence, Michael T. Cox

Computer Science & Engineering Syllabi

"Principles of Artificial Intelligence" is a graduate/undergraduate level introductory course in Artificial Intelligence (AI), designed for students interested in or specializing in AL We will cover several basic topics ranging from knowledge representation, inference, problem solving, search, the predicate calculus and other fundamentals of AI, to selected topics concerning intelligent agents, natural language processing, planning, learning, and case-based reasoning. The intent of the course is to provide a background in artificial intelligence, an exposure to the major issues and methods in the field, and experience in writing AI programs. The course will also examine real AI systems and allow the …

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

No abstract provided.

Cs 205: Computer Literacy And Office Automation, Kim Gros

Computer Science & Engineering Syllabi

To understand basic computer operations and the principal components of a computer and connected peripheral devices

To understand and examine current operating systems, software utilities, device drivers and application software

To define and understand current storage technology and learn about logical file storage and management

To become proficient in using application software categories that are covered in the seven modules

To understand the basics of e-mail

To introduce networking concepts including the Internet and its components and web browser basics

To learn ways to protect your data and avoid computer disasters