Computer Engineering Commons^™

Fast Quantum Algorithms For Handling Probabilistic, Interval, And Fuzzy Uncertainty, Mark Martinez, Luc Longpre, Vladik Kreinovich, Scott A. Starks, Hung T. Nguyen

Departmental Technical Reports (CS)

We show how quantum computing can speed up computations related to processing probabilistic, interval, and fuzzy uncertainty.

Robust Methodology For Characterizing System Response To Damage: Approach Based On Partial Order, Paul J. Tanenbaum, Carlos De La Mora, Piotr Wojciechowski, Olga Kosheleva, Vladik Kreinovich, Scott A. Starks, Alexandr V. Kuzminykh

Departmental Technical Reports (CS)

To describe the response of engineering complex systems to various damage mechanics, engineers have traditionally use number-valued utilities to describe the results of different possible outcomes, and (number-valued) probabilities (often, subjective probabilities) to describe the relative frequency of different outcomes. This description is based on the assumption that experts can always make a definite preference between two possible outcomes, i.e., that the set of all outcomes is linearly (totally) ordered. In practice, experts often cannot make a choice, their preference is only a partial order.

Outlier Detection Under Interval And Fuzzy Uncertainty: Algorithmic Solvability And Computational Complexity, Vladik Kreinovich, Praveen Patangay, Luc Longpre, Scott A. Starks, Cynthia Campos, Scott Ferson, Lev Ginzburg

Departmental Technical Reports (CS)

No abstract provided.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 19, Number 7, May 2003, 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.

Isomorphic Strategy For Processor Allocation In K-Ary N-Cube Systems, Moonsoo Kang, Chansu Yu, Hee Yong Youn, Ben Lee, Myungchul Kim

Electrical and Computer Engineering Faculty Publications

Due to its topological generality and flexibility, the k-ary n-cube architecture has been actively researched for various applications. However, the processor allocation problem has not been adequately addressed for the k-ary n-cube architecture, even though it has been studied extensively for hypercubes and meshes. The earlier k-ary n-cube allocation schemes based on conventional slice partitioning suffer from internal fragmentation of processors. In contrast, algorithms based on job-based partitioning alleviate the fragmentation problem but require higher time complexity. This paper proposes a new allocation scheme based on isomorphic partitioning, where the processor space is partitioned into higher dimensional isomorphic subcubes. The …

Final Design Report Of Computer Controller Of Robotic Arm, Kurt Niederhauser

Undergraduate Honors Capstone Projects

My Part of the project was to design the hardware. I assembled the TT8 microprocessor and designed the optocial isolation board for the input and output signals to the TT8 microprocessor. We had two boards. One board had the TT8 Processor and other chips used for regulating the affairs of the TT8 (This board I assembled), and then there was another board that had all the control signals for the TT8 (this board I had to design), which sent the signals letting the TT8 know when the robot arm had been extended or retracted as far is it could go. …

Guest Editorial: Text And Web Mining, Ah-Hwee Tan, Philip S. Yu

Research Collection School Of Computing and Information Systems

Text mining and web mining are two interrelated fields that have received a lot of attention in recent years. Text mining [1, 2] is concerned with the analysis of very large document collections and the extraction of hidden knowledge from text-based data. Web mining [3] refers to the analysis and mining of all web-related data, including web content, hyperlink structure, and web access statistics.

A Performance-Driven Framework For Customizing Csp Middleware Support, Guoliang Xing

All Computer Science and Engineering Research

A Distributed Constraint Satisfaction Problem (DCSP) aims to find consistent assignments of values to a set of variables distributed on multiple nodes. Despite its simple definition, DCSPs can model a broad variety of traditional artificial intelligence problems. Furthermore, many problems found in emerging sensor-actuator networks can be formalized to DCSPs. However, due to the platform limitations of networked embedded systems such as sensor-actuators networks, building real-world applications for solving DCSPs not only requires the improved DCSP algorithms but also novel system approaches. This thesis first develops a performance-driven middleware framework for solving DCSP problems. Then the prototype system built with …

Specialized Hardware Support For Dynamic Storage Allocation, Steven M. Donahue

All Computer Science and Engineering Research

With the advent of operating systems and programming languages that can evaluate and guarantee real-time specifications, applications with real-time requirements can be authored in higher-level languages. For example, a version of Java suitable for real-time (RTSJ) has recently reached the status of a reference implementation, and it is likely that other implementations will follow. Analysis to show the feasibility of a given set of tasks must take into account their worst-case execution time, including any storage allocation or deallocation associated with those tasks. In this thesis, we present a hardware-based solution to the problem of storage allocation and (explicit) deallocation …

Using Contaminated Garbage Collection And Reference Counting Garbage Collection To Provide Automatic Storage Reclamation For Real-Time Systems, Matthew P. Hampton

All Computer Science and Engineering Research

Language support of dynamic storage management simplifies the application programming task immensely. As a result, dynamic storage allocation and garbage collection have become common in general purpose computing. Garbage collection research has led to the development of algorithms for locating program memory that is no longer in use and returning the unused memory to the run-time system for late use by the program. While many programming languages have adopted automatic memory reclamation features, this has not been the trend in Real-Time systems. Many garbage collection methods involve some form of marking the objects in memory. This marking requires time proportional …

Hashtables For Real-Time And Embedded Systems, Anand Krishnan

All Computer Science and Engineering Research

Real-time are beginning to appear in advanced, high-level programming languages such as Java. When complemented by a real-time operating system, the Real-Time Specification for Java (RTSJ) offers strong execution constraints for applications developed in Java. While the RTSJ make the basic services of Java such as storage and thread management ready for many real-time applications, the collection objects, and the rest of the application run-time library, cannot be used by RTSJ applications until their run-time properties are examined and modified as necessary to make them suitable for use by real-time applications. In this work, we examine the Hashtable collection facility …

Dynamic Assignment Of Scoped Memory Regions In The Translation Of Java To Real-Time Java, Morgan G. Deters

All Computer Science and Engineering Research

Advances in middleware, operating systems, and popular, general-purpose languages have brought the ideal of reasonably-bound execution time closer to developers who need such assurances for real-time and embedded systems applications. Extensions to the Java libraries and virtual machine have been proposed in a real-time Java standard, which provides for specification of release times, execution costs, and deadlines for a restricted class of threads. To use such features, the programmer is required to use unwieldy code constructs to create region-like areas of storage, associate them with execution scopes, and allocate objects from them. Further, the developer must ensure that they do …

Integrated Coverage And Connectivity Configuration In Wireless Sensor Networks, Xiaorui Wang, Guoliang Xing, 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. Furthermore, 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 …

Multiflow Tcp, Udp, Ip, And Atm Traffic Generation Module, Eliot I. Sinclair, John W. Lockwood

All Computer Science and Engineering Research

Networking devices must be capable of processing traffic flows from multiple sources. In order to verify that such devices operates properly, a network testbench can be used to inject traffic into the device. The specification of the traffic flows can be difficult. At the low level, there are header fields, data checksums, and packet length fields that all must be formatted correctly. Further, there can be multiple flows of traffic that will arrive simultaneously. It is desirable to specify traffic at a high level of abstraction. A software program can then be written to parse the specification and generate the …

System-On-Chip Packet Processor For An Experimental Network Services Platform, David Taylor, Alex Chandra, Yuhua Chen, Sarang Dharmapurikar, John Lockwood, Wenjing Tang, Jonathan Turner

All Computer Science and Engineering Research

As the focus of networking research shifts from raw performance to the delivery of advanced network services, there is a growing need for open-platform systems for extensible networking research. The Applied Research Laboratory at Washington University in Saint Louis has developed a flexible Network Services Platform (NSP) to meet this need. The NSP provides an extensible platform for prototyping next-generation network services and applications. This paper describes the design of a system-on-chip Packet Processor for the NSP which performs all core packet processing functions including segmentation and reassembly, packet classification, route lookup, and queue management. Targeted to a commercial configurable …

A Thesis On A 3d Input Device For Sketching Characters, Mark A. Schroering

All Computer Science and Engineering Research

The goal of this project is to develop a 3D input device using a stiff piece of paper and a camera. The camera tracks the piece of paper in 3D space. The user orients the paper in 3D space and then draws on the paper using a pen-like device. The camera tracks the movement of the pen on the piece of paper. The location of the pen in 3D space can then be calculated from the orientation of the paper. A drawing application that uses this 3D input device was also developed. The application allows a user to make characters …

Detecting Cracks In Thin Plates By Using Lamb Wave Scanning: Geometric Approach, Roberto A. Osegueda, Vladik Kreinovich, Enrique Roldan, Rodrigo Mares

Departmental Technical Reports (CS)

A crack in a thin plate reflects ultrasonic waves; therefore, it is reasonable to determine the location of the crack by measuring the reflected waves. The problem of locating the crack can be reformulated in purely geometric terms. Previously, time-consuming iterative numerical methods were used to solve the resulting geometric problem. In this paper, we show that explicit (and fast to compute) formulas can be used instead.

Probabilities, Intervals, What Next? Optimization Problems Related To Extension Interval Computations To Situations With Partial Information About Probabilities, Vladik Kreinovich

Departmental Technical Reports (CS)

When we have only interval ranges [xi-,xi+] of sample values x1,...,xn, what is the interval [V-,V+] of possible values for the variance V of these values? We prove that the problem of computing the upper bound V+ is NP-hard. We provide a feasible (quadratic time) algorithm for computing the exact lower bound V- on the variance of interval data. We also provide feasible algorithms that computes V+ under reasonable easily verifiable conditions, in particular, in case interval uncertainty is introduced to maintain privacy in a statistical database.

We also extend the main formulas of interval arithmetic for different arithmetic operations …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 19, Number 6, April 2003, 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.

User Interface Improvement For Mlpq System, Shasha Wu

School of Computing: Dissertations, Theses, and Student Research

This thesis describes the experience of migrating the MLPQ constraint database system, a complex standalone Multiple Document Interface (MDI) application, to a server-based remote accessible application. Centralized, standalone MDI application is a common style for personal software products in Windows. For a database management system, server-based, thin-client computing is a more popular infrastructure. Migrating an existing standalone constraint database application to be a web accessible constraint database server is the main goal of this thesis. This migration process provides a method for the constraint database system to collaborate with other specific applications. We rebuild the desktop MLPQ constraint database system …

Parallel Implementation Of A Face Recognition [Sic] System Based On Modular Pca Approach, Rajkiran Gottumukkal

Electrical & Computer Engineering Theses & Dissertations

This thesis describes research in automated methods for the recognition of human faces. The research is driven by the need to design a method, which would ensure high accuracy under the conditions of facial expression, illumination and pose variations. The resulting method is able to cope with uncontrolled nature of facial expression, illumination and head rotations. The main novelty of this work is the idea that some of the local facial features do not vary even when the facial expression, illumination and pose vary. This idea is applied to the existing principle component analysis lPCA) method to arrive at a …

Creating Enterprise Simulations Using High Level Architecture, Anton R. Lidums

Electrical & Computer Engineering Theses & Dissertations

Despite an established need, there are two remaining roadblocks to building distributed simulations and enterprise simulation systems. First, commercial simulation packages and engineering modeling tools are not readily distributable across multiple computers and have traditionally had very little impetus for utilizing a distributable format. Second, although HLA simulations have been built and there are tools to facilitate those efforts, very little has been done or written that specifically describes a "non-standard" integration implementation in sufficient detail to make the process reusable or repeatable. This thesis introduces a proof of concept prototype that was developed to integrate simulations. The paper presents …

Automatic Speaker Identification Using Reusable And Retrainable Binary-Pair Partitioned Neural Networks, Ashutosh Mishra

Electrical & Computer Engineering Theses & Dissertations

This thesis presents an extension of the work previously done on speaker identification using Binary Pair Partitioned (BPP) neural networks. In the previous work, a separate network was used for each pair of speakers in the speaker population. Although the basic BPP approach did perform well and had a simple underlying algorithm, it had the obvious disadvantage of requiring an extremely large number of networks for speaker identification with large speaker populations. It also requires training of networks proportional to the square of the number of speakers under consideration, leading to a very large number of networks to be trained …

Study About High Influence Doping To Base Resistance And Bandgap Narrowing At Si/Si1-Xgex/Si Heterojunction Bipolar Transistor, Achmad Fadhol

Makara Journal of Technology

Study About High Influence Doping to Base Resistance and Bandgap Narrowing at Si/Si1-xGex/Si Heterojunction Bipolar Transistor. Heterojunction is a link formed bedween two semiconductor materials and differend bandgap which has thinness under 50nm and grow the mixture of plate SiGe as bases. The link is an abrupt link or graded one. In this research learnt formulation of doping concentration influence to basis resistance and bandgap narrowing through Si/Si1-xGex/Si Heterojunction Bipolar Transistor with abrupt emitter-basis link, besides taking care to mobility and basis wide to basis resistance, it is also influence of mole fraction to bandgap power. From the result shows …

Photocatalytic Treatment Of Heavy Metal Waste Cr(Vi) Withtio2 Photocatalyst, Slamet Slamet, Riyadi Syakur, Wahyu Danumulyo

Makara Journal of Technology

Photocatalytic Treatment of Heavy Metal Waste Cr(VI) with TiO2 Photocatalyst. The photocatalytic reduction of hexavalent chromium/Cr(VI) using TiO2 and copper-doped TiO2 as photocatalysts have been studied in stirred tank and circulating photoreactors. All photocatalysts were characterized with FTIR (Fourier Transform Infra Red), BET (Brunauer-Emmett-Teller), XRD (X-Ray Diffraction) and SEM (Scanning Electron Microscope). TiO2 Merck and Degussa P-25 are the commercial photocatalysts used to compare the photocatalytic activity of all the prepared catalysts. Blank test experiments as well as the effect of dopants, EDTA (ethylenediaminetetraacetic acid) and activated carbon addition were studied. Cr(VI) reduction on various pH and initial Cr(VI) concentration …

Development And Analysis Of Geographic Information System For Electricity Network (Case Study: Surabaya Industrial Estate Rungkut In Surabaya)., Lilik Jamilatul Awalin, Bangun Muljo Sukojo

Makara Journal of Technology

Development and Analysis of Geographic Information System for Electricity Network (Case Study: Surabaya Industrial Estate Rungkut in Surabaya). Geographic Information System (GIS) is a system of data which has spatial base. This may be cause has ability to process and analysis data quickly. The ability of GIS will be able to process the alternative in decision making. The need of electric power grows until recent time along with the existence of industrial sector expansion and land use expansion claim better service, large and balance stock of electric power. GIS is a solution for planning and managing data base system, for …

Application Of Remote Sensing And Geographic Information System Methods For Land Using Difference, Bangun Muljo Sukojo, Diah Susilowati

Makara Journal of Technology

Application of Remote Sensing and Geographic Information System Methods for Land Using Difference. Land using difference analysis has been done using remote sensing and Geographic Information System (GIS) methods. Identification of land using difference was conducted using map overlaying process of 1990s (digitized scalling 1:50.000) and 1997s land using map (interpreted from Landsat TM (Thematic Mapper) Image 1997) with UTM (Universal Transverse Mercator) coordinate. Image enhancement was done through histogram equalization with supervised classification devided into 7 classes: rice field, settlement, dry field, industry, pond, sport field and bush. Land using difference and river pollution BOD (Biological Oxygen Demand), COD …

Phase Composition Analysis Using Rietveld Methode And It's Influence To The Hardness Of Ti-Si-N Nanocomposites, Keba Moto, Lia Setiarini, Zufar Abubakar

Makara Journal of Technology

Phase composition analysis using rietveld methode and it’s influence to the hardness of Ti-Si-N nanocomposites. XRD data of nanocomposites Ti-Si-N have been analysed using GSAS based on Rietveld Method in order to identify phases and their composition as well as its influence on the hardness of these nanocomposites. Several new phases have been found in the sample beside the nc-TiN/a-Si3N4& a-/nc-TiSi2 that have been known widely. From the obtained crystalline phase, after the calculation of amorf Si3N4 and TiSi2 phase fraction, it is found that the optimum hardness can be reached when the fraction of a-Si3N4 phase around 8 wt.%

Influence Of Strain Rate And Temperature Of Hot Tension Testing On Mechanical Properties Of Medium Carbon Steel S48c, Dedi Priadi, Iwan Setyadi, Eddy S. Siradj

Makara Journal of Technology

Influence of Strain Rate and Temperature of Hot Tension Testing on Mechanical Properties of Medium Carbon Steel S48C. The characterization of S48C by hot tension testing was done to understanding the influence of temperature and strain rate for S48C flow stress, that close relationship with its forge ability. The hot tension testing was performed on temperatures and strain rates variation (T 850, 900, 950 0C and έ 0,01;1 s-1). The result of hot tension testing showed that increasing temperature decreases ultimate tensile strength (UTS) and flow stress of S48C. The higher decreasing of UTS is on 950 0C about 85% …

A Study In Java Bytecode Engineering With Pcesjava, Martin R. Linenweber

All Computer Science and Engineering Research

This thesis reports on experience with PCESjava, a collection of tools which we have developed for the purpose of aiding programmers. Particular applications optimize and instrument JAVA bytecode programs. Using these tools, we have successfully identified impediments to real-time performance in a popular JAVA collections object. Our approach here is based on automatic instruction to obtain traces that show paths whose execution time is not reasonably bounded. We also report on the application of our tool to reduce program footprint in JAVA programs by rewriting the bytecodes to occupy less space. Our transformations also improves the running time of set …