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

Digital Commons Network™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 16081 - 16110 of 17525

Full-Text Articles in Entire DC Network

An Algorithm For Locating Fundamental Frequency (F0) Markers In Speech, Princy Dikshit Oct 2004

An Algorithm For Locating Fundamental Frequency (F0) Markers In Speech, Princy Dikshit

Electrical & Computer Engineering Theses & Dissertations

Speech has been the principal form of human communication since it began to evolve at least one hundred thousand years ago. Speech is produced by vibrations of the vocal cords. The rate of vibration of the cords is called fundamental frequency (F0) or pitch. The objective of this thesis is to locate pitch period cycles on a cycle-by-cycle basis. The complexity in identifying pitch cycles stems from the highly irregular nature of human speech. Dynamic programming is used to combine two sources of information for pitch period marking. One source of information is the "local" information corresponding to the location …


Huffman Approach To Opcode Compression, Jason B. Shreve Oct 2004

Huffman Approach To Opcode Compression, Jason B. Shreve

Electrical & Computer Engineering Theses & Dissertations

Instructions are the building blocks of computer programs. They are composed of opcodes, which uniquely identify each instruction, and the operands or data. In most architectures, the instruction length is a set multiple of the word size. The size and number of operands vary by instruction. Due to programmer usage, program need, or compiler design, opcodes do not occur with a constant distribution. Likely, some opcodes occur very frequently, whereas others occur very infrequently or not at all. If the length of an opcode were representative of its frequency, compression in program size might be achieved.

This thesis is an …


Hierarchical Hybrid Multicast An End System Multicast Algorithm Approach, Guillermo Loaisiga Oct 2004

Hierarchical Hybrid Multicast An End System Multicast Algorithm Approach, Guillermo Loaisiga

Electrical & Computer Engineering Theses & Dissertations

Due to the rapid development in the computer and communication technologies, the Internet is experiencing an increasing demand of high-speed, real-time distributed applications, such as live streaming multimedia, videoconferencing, distributed simulations, and multiparty games. Multicast is an efficient transmission mechanism to support these applications. Historically, IP Multicast (IPM) has provided multicast support with well-known benefits, especially in bandwidth savings. However, it has experienced little deployment due to economic and architectural limitations.

Overlay multicast holds promise for the implementation of large scale Internet multicast services. An overlay network is a virtual topology constructed on top of the Internet infrastructure. This concept …


Techniques And Patterns For Safe And Efficient Real-Time Middleware, Angelo Corsaro Sep 2004

Techniques And Patterns For Safe And Efficient Real-Time Middleware, Angelo Corsaro

All Computer Science and Engineering Research

Over 90 percent of all microprocessors are now used for real-time and embedded applications. The behavior of these applications is often constrained by the physical world. It is therefore important to devise higher-level languages and middleware that meet conventional functional requirements, as well as dependably and productively enforce real-time constraints. Real-Time Java is emerging as a safe, real-time environment. In this thesis we use it as our experimentation platform; however, our findings are easily adapted to other similar platforms. This thesis provides the following contributions to the study of safe and efficient real-time middleware. First, it identifies potential bottlenecks and …


Tcp Processor: Design, Implementation, Operation, And Usage, David V. Schuehler Sep 2004

Tcp Processor: Design, Implementation, Operation, And Usage, David V. Schuehler

All Computer Science and Engineering Research

There is a critical need to perform advanced data processing on network traffic. In order to accom-plish this, protocol processing must first be performed to reassemble individual network packets into consistent data streams representing the exact dataset being transferred between end systems. This task is currently performed by protocol stacks running on end systems. Similar protocol processing opera-tions are needed to process the data on the interior of the network. Given millions of network connections operating on multi-gigabit per second network links, this task is extremely difficult. The TCP-Processor addresses this challenge. It is a hardware circuit designed to perform …


Volume Holographic Recording And Readout For 90-Deg Geometry, Partha P. Banerjee, Monish Ranjan Chatterjee, Nickolai Kukhtarev, Tatiana Kukhtareva Sep 2004

Volume Holographic Recording And Readout For 90-Deg Geometry, Partha P. Banerjee, Monish Ranjan Chatterjee, Nickolai Kukhtarev, Tatiana Kukhtareva

Electrical and Computer Engineering Faculty Publications

When a prerecorded cross-beam hologram is reconstructed (so-called edge-lit readout) with a uniform plane wave and a point source, the resulting exact solutions reveal Bessel-function-type diffracted beam profiles, which are fundamentally modified under weak propagational diffraction. The case of a profiled beam readout with propagational diffraction may be analyzed using a transfer function approach based on 2-D Laplace transforms. In a second series of investigations, dynamic readout from a cross-beam volume hologram recorded with two orthogonal uniform plane waves is considered for various dependences of the refractive index modulation with intensity. Typically, refractive index profiles that are proportional to the …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 1, September 2004, College Of Engineering And Computer Science, Wright State University Sep 2004

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

BITs and PCs Newsletter

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


Every Polynomial-Time 1-Degree Collapses If And Only If P=Pspace, Stephen A. Fenner, Stuart A. Kurtz, James S. Royer Sep 2004

Every Polynomial-Time 1-Degree Collapses If And Only If P=Pspace, Stephen A. Fenner, Stuart A. Kurtz, James S. Royer

Faculty Publications

No abstract provided.


Run-Time Modification Of The Class Hierarchy In A Live Java Development Environment, Joel R. Brandt, Kenneth J. Goldman Sep 2004

Run-Time Modification Of The Class Hierarchy In A Live Java Development Environment, Joel R. Brandt, Kenneth J. Goldman

All Computer Science and Engineering Research

Class hierarchy design is central to object-oriented software development. However, it is sometimes difficult for developers to anticipate all the implications of a design until implementation is underway. To support experimentation with different designs, we extend prior work on live development environments to allow run-time modification of the class hierarchy. The result is a more fluid object-oriented development process, in which immediate feedback from the executing program can be used to guide hierarchy design. This paper presents a framework and developer support for run-time modification of class inheritance relations in JPie, a live visual programming environment for Java. Most notably, …


Volume Holographic Optical Elements, Ching-Cherng Sun, Partha P. Banerjee Sep 2004

Volume Holographic Optical Elements, Ching-Cherng Sun, Partha P. Banerjee

Electrical and Computer Engineering Faculty Publications

The final two papers are concerned with the analysis of novel holograms. Banerjee et al. investigate holographic recording and reconstruction for edge-lit holograms recorded in a 90-degree geometry. Various cases of recording and readout that incorporate propagational diffraction have been modeled. It is shown that the 90-degree geometry can result in beam shaping, as evidenced through preliminary experimental results with photorefractive lithium niobate. Nguyen et al. propose a new approach for designing computer-generated holograms. An artificial neural network is used to initiate the genetic algorithm so that the high computation cost of genetic algorithms for synthesizing holograms is significantly reduced …


Optimizing Proportionally Fair Prices, Laura Wynter Sep 2004

Optimizing Proportionally Fair Prices, Laura Wynter

Research Collection School Of Computing and Information Systems

We demonstrate the non-uniqueness of proportional fairness prices, and show that the model of Kelly et al. [9] falls into the category of models that can be generalized to allow optimization of the link prices, with a view toward profit maximization. However, through this framework, we also show that the total revenue that can be obtained through proportional fairness pricing on a network is unique.


Device Discovery In Frequency Hopping Wireless Ad Hoc Networks, Brian S. Peterson Sep 2004

Device Discovery In Frequency Hopping Wireless Ad Hoc Networks, Brian S. Peterson

Theses and Dissertations

This research develops a method for efficient discovery of wireless devices for a frequency hopping spread spectrum, synchronous, ad hoc network comprised of clustered sub-networks. The Bluetooth wireless protocol serves as the reference protocol. The development of a discovery, or outreach, method for scatternets requires the characterization of performance metrics of Bluetooth piconets, many of which are unavailable in literature. Precise analytical models characterizing the interference caused to Bluetooth network traffic by inquiring devices, the probability mass function of packet error rates between arbitrary pairs of Bluetooth networks, and Bluetooth discovery time distribution are developed. Based on the characterized performance …


Scheduling Algorithms For Cioq Switches, Prashanth Pappu, Jonathan S. Turner Aug 2004

Scheduling Algorithms For Cioq Switches, Prashanth Pappu, Jonathan S. Turner

All Computer Science and Engineering Research

Most scalable switches are required to buffer packets at both their inputs and outputs to overcome the slow memory speeds of packet queues. This thesis deals with the design of scheduling algorithms for such Combined Input and Output Queued (CIOQ) switches. For crossbar based CIOQ switches, we demonstrate the underperformance of commercially used scheduling algorithms under overload traffic conditions using targeted stress tests and present ideas to develop robust, stress resistant versions of these algorithms that are still simple enough to be implemented in high speed switches. To regulate the flow of traffic in buffered, multi-stage switches, we introduce a …


Wavelenght-Dispersive X-Ray Flourescence Accuration, H. Widyatmoko Aug 2004

Wavelenght-Dispersive X-Ray Flourescence Accuration, H. Widyatmoko

Makara Journal of Technology

Wavelenght–Dispersive X-Ray Flourescence Accuration. X-Fuorescence spectrometry is a method, which is increasingly applied in the geochemical analysis. X-Fuorescence spectrometry is classified under two categories – WDXRF (wavelenght – dispersive X-ray fluorescence spectrometer) and EDXRF (energy-dispersive X – ray fluorescence spectrometer). WDXRF can be configured as a sequential spectrometer , a simultaneous spectrometer or a hibrid instrument, which combines the advantages of the simultaneous and sequential spectrometers into one instrument. Each instrument is different in some characteristics, and each has applications for which it is specifically suited. In this investigation sequential spectrometer PW 1450 was used to analyze the major, minor …


Generating Properties For Runtime Monitoring From Software Specification Patterns, Oscar Mondragon, Ann Q. Gates, Oleg Sokolsky Aug 2004

Generating Properties For Runtime Monitoring From Software Specification Patterns, Oscar Mondragon, Ann Q. Gates, Oleg Sokolsky

Departmental Technical Reports (CS)

The paper presents an approach to support run-time verification of software systems that combines two existing tools, Prospec and Java-MaC, into a single framework. Prospec can be used to clarify natural language specifications for sequential, concurrent, and nondeterministic behavior. In addition, the tool assists the user in reading, writing, and understanding formal specifications through the use of property patterns and visual abstractions. Currently, Prospec automatically generates a specification written in Future Interval Logic (FIL). The goal is to automate the generation of MEDL formulas that can be used by the Java-MaC tool to check run-time compliance of system execution to …


Discovering Transcriptional Regulatory Rules From Gene Expression And Tf-Dna Binding Data By Decision Tree Learning, Jianhua Ruan, Weixiong Zhang Jul 2004

Discovering Transcriptional Regulatory Rules From Gene Expression And Tf-Dna Binding Data By Decision Tree Learning, Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

Background: One of the most promising but challenging task in the post-genomic era is to reconstruct the transcriptional regulatory networks. The goal is to reveal, for each gene that responds to a certain biological event, which transcription factors affect its transcription, and how several transcription factors coordinate to accomplish specific regulations. Results: Here we propose a supervised machine learning approach to address these questions. We build decision trees to associate the expression level of a gene with the transcription factor binding data of its promoter. From the decision trees, we extract regulatory rules that specify how the binding of a …


Beyond Convex? Global Optimization Is Feasible Only For Convex Objective Functions: A Theorem, R. Baker Kearfott, Vladik Kreinovich Jul 2004

Beyond Convex? Global Optimization Is Feasible Only For Convex Objective Functions: A Theorem, R. Baker Kearfott, Vladik Kreinovich

Departmental Technical Reports (CS)

It is known that there are feasible algorithms for minimizing convex functions, and that for general functions, global minimization is a difficult (NP-hard) problem. It is reasonable to ask whether there exists a class of functions that is larger than the class of all convex functions for which we can still solve the corresponding minimization problems feasibly. In this paper, we prove, in essence, that no such more general class exists. In other words, we prove that global optimization is always feasible only for convex objective functions.


Towards Combining Probabilistic And Interval Uncertainty In Engineering Calculations, Scott A. Starks, Vladik Kreinovich, Luc Longpre, Martine Ceberio, Gang Xiang, Roberto Araiza, J. Beck, R. Kandathi, A. Nayak, R. Torres Jul 2004

Towards Combining Probabilistic And Interval Uncertainty In Engineering Calculations, Scott A. Starks, Vladik Kreinovich, Luc Longpre, Martine Ceberio, Gang Xiang, Roberto Araiza, J. Beck, R. Kandathi, A. Nayak, R. Torres

Departmental Technical Reports (CS)

In many engineering applications, we have to combine probabilistic and interval errors. For example, in environmental analysis, we observe a pollution level x(t) in a lake at different moments of time t, and we would like to estimate standard statistical characteristics such as mean, variance, autocorrelation, correlation with other measurements. In environmental measurements, we often only know the values with interval uncertainty. We must therefore modify the existing statistical algorithms to process such interval data. Such modification are described in this paper.


Cs 340: Programming Language Workshop In Java, Ronald F. Taylor Jul 2004

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.


Cs 214: Object Oriented Programming, Roddy Keish Jul 2004

Cs 214: Object Oriented Programming, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.


Interactive Land Use Vrml Application Using Servlet Assist, Suresh Chitithoti Jul 2004

Interactive Land Use Vrml Application Using Servlet Assist, Suresh Chitithoti

Electrical & Computer Engineering Theses & Dissertations

The integration of VRML and Servlet technologies has the potential to revolutionize web-based simulation visualization. The Interactive Land Use VRML Application (ILUVA) uses Java Servlets enabling one to perform urban planning by taking a virtual land area and add buildings, roadways, landscaping, and other features. The Virtual Reality Modeling Language (VRML) is a web-based technology for specifying and delivering interactive three-dimensional visualizations over a browser. The Java Servlet technology offers several powerful capabilities such as user authentication, session management, database connectivity for maintaining several possibly simultaneous user sessions, and dynamically generated VRML. Save and restore capabilities for any applications are …


Qos Provisioning For Multi-Class Traffic In Wireless Networks, Mona El-Kadi Rizvi Jul 2004

Qos Provisioning For Multi-Class Traffic In Wireless Networks, Mona El-Kadi Rizvi

Computer Science Theses & Dissertations

Physical constraints, bandwidth constraints and host mobility all contribute to the difficulty of providing Quality of Service (QoS) guarantees in wireless networks. There is a growing demand for wireless networks to support all the services that are available on wired networks. These diverse services, such as email, instant messaging, web browsing, video conferencing, telephony and paging all place different demands on the network, making QoS provisioning for wireless networks that carry multiple classes of traffic a complex problem. We have developed a set of admission control and resource reservation schemes for QoS provisioning in multi-class wireless networks.

We present three …


Teabag: A Debugger For Curry, Stephen Lee Johnson Jul 2004

Teabag: A Debugger For Curry, Stephen Lee Johnson

Dissertations and Theses

This thesis describes TeaBag, which is a debugger for functional logic computations. TeaBag is an accessory of a virtual machine currently under development. A distinctive feature of this machine is its operational completeness of computations, which places novel demands on a debugger. This thesis describes the features of TeaBag, in particular the handling of non-determinism, the ability to control nondeterministic steps, to remove context information, to toggle eager evaluation, and to set breakpoints on both functions and terms. This thesis also describes TeaBag's architecture and its interaction with the associated virtual machine. Finally, some debugging sessions of defective programs are …


Variations On Particle Swarm Optimization And Their Experimental Evaluation On Maximum Satisfiability, Susan A Abdelshahid Jun 2004

Variations On Particle Swarm Optimization And Their Experimental Evaluation On Maximum Satisfiability, Susan A Abdelshahid

Archived Theses and Dissertations

No abstract provided.


A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya May 2004

A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Chenyang Lu, Guoliang Xing, Octav Chipara, Chien-Liang Fok, Sangeeta Bhattacharya

All Computer Science and Engineering Research

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically gather information from their surrounding areas through a wireless sensor network. A key advantage of MobiQuery lies in its capability to meet stringent spatiotemporal performance constraints crucial to many applications. These constraints include query latency, data freshness and fidelity, and changing query areas due to user mobility. A novel just-in-time prefetching algorithm enables MobiQuery to main-tain robust spatiotemporal guarantees even when nodes op-erate under extremely low duty cycles. Furthermore, it sig-nificantly reduces the storage cost and network contention caused by continuous queries from mobile users. We …


Composing Systemic Aspects Into Component-Oriented Doc Middleware, Nanbor Wang May 2004

Composing Systemic Aspects Into Component-Oriented Doc Middleware, Nanbor Wang

All Computer Science and Engineering Research

The advent and maturation of component-based middleware frameworks have sim-plified the development of large-scale distributed applications by separating system devel-opment and configuration concerns into different aspects that can be specified and com-posed at various stages of the application development lifecycle. Conventional component middleware technologies, such as J2EE [73] and .NET [34], were designed to meet the quality of service (QoS) requirements of enterprise applications, which focus largely on scalability and reliability. Therefore, conventional component middleware specifications and implementations are not well suited for distributed real-time and embedded (DRE) ap-plications with more stringent QoS requirements, such as low latency/jitter, timeliness, and …


On-Line Algorithms For Computing Mean And Variance Of Interval Data, And Their Use In Intelligent Systems, Berlin Wu, Hung T. Nguyen, Vladik Kreinovich May 2004

On-Line Algorithms For Computing Mean And Variance Of Interval Data, And Their Use In Intelligent Systems, Berlin Wu, Hung T. Nguyen, Vladik Kreinovich

Departmental Technical Reports (CS)

No abstract provided.


Application Of Kolmogorov Complexity To Advanced Problems In Mechanics, Vladik Kreinovich, Isaak A. Kunin May 2004

Application Of Kolmogorov Complexity To Advanced Problems In Mechanics, Vladik Kreinovich, Isaak A. Kunin

Departmental Technical Reports (CS)

In the 1960s, A.N. Kolmogorov described the main reason why a mathematical correct solution to a system of differential equations may be not physically possible: Traditional mathematical analysis tacitly assumes that all numbers, no matter how large or how small, are physically possible. From the engineering viewpoint, however, a number like 10^{10^10} is not possible, because it exceeds the number of particles in the Universe. In this paper, we extend Kolmogorov's ideas from discrete objects to continuous objects known with given accuracy epsilon, and show how this extension can clarify the analysis of dynamical systems.


Using 1-D Radar Observations To Detect A Space Explosion Core Among The Explosion Fragments: Sequential And Distributed Algorithms, P. Debroux, J. Boehm, Vladik Kreinovich, Gang Xiang, J. Beck, K. Tupelly, R. Kandathi, Luc Longpre, K. Villaverde May 2004

Using 1-D Radar Observations To Detect A Space Explosion Core Among The Explosion Fragments: Sequential And Distributed Algorithms, P. Debroux, J. Boehm, Vladik Kreinovich, Gang Xiang, J. Beck, K. Tupelly, R. Kandathi, Luc Longpre, K. Villaverde

Departmental Technical Reports (CS)

A radar observes the result of a space explosion. Due to radar's low horizontal resolution, we get a 1-D signal s(t) representing different 2-D slices. Based on these slices, we must distinguish between the body at the core of the explosion and the slowly out-moving fragments. We propose new algorithms for processing this 1-D data. Since these algorithms are time-consuming, we also exploit the possibility of parallelizing these algorithms.


Geometry Of Protein Structures. I. Why Hyperbolic Surfaces Are A Good Approximation For Beta-Sheets, Boguslaw Stec, Vladik Kreinovich May 2004

Geometry Of Protein Structures. I. Why Hyperbolic Surfaces Are A Good Approximation For Beta-Sheets, Boguslaw Stec, Vladik Kreinovich

Departmental Technical Reports (CS)

Protein structure is invariably connected to protein function. To analyze the structural changes of proteins, we should have a good description of basic geometry of proteins' secondary structure. A beta-sheet is one of important elements of protein secondary structure that is formed by several fragments of the protein that form a surface-like feature. The actual shapes of the beta-sheets can be very complicated, so we would like to approximate them by simpler geometrical shapes from an approximating family. Which family should we choose? Traditionally, hyperbolic (second order) surfaces have been used as a reasonable approximation to the shape of beta-sheets. …