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

Computer Engineering Commons™

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

2004

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 181 - 210 of 253

Full-Text Articles in Computer Engineering

Camrit: Control-Based Adaptive Middleware For Real-Time Image Transmission, Xiaorui Wang, Huang-Ming Huang, Venkita Subramonian, Chenyang Lu, Christopher Gill Jan 2004

Camrit: Control-Based Adaptive Middleware For Real-Time Image Transmission, Xiaorui Wang, Huang-Ming Huang, Venkita Subramonian, Chenyang Lu, Christopher Gill

All Computer Science and Engineering Research

Real-time image transmission is crucial to an emerging class of distributed embedded systems operating in open network environments. Examples include avionics mission re-planning over Link-16, security systems based on wireless camera networks, and online collaboration using camera phones. Meeting image transmission deadlines is a key chal-lenge in such systems due to unpredictable network condi-tions. In this paper, we present the design, modeling, and analysis of CAMRIT, a Control-based Adaptive Middleware framework for Real-time Image Transmission in distributed real-time embedded systems. CAMRIT features a distributed feedback control loop that meets image transmission dead-lines by dynamically adjusting the quality of image tiles. …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 3, January 2004, College Of Engineering And Computer Science, Wright State University Jan 2004

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

Go to article

Using Web Services To Integrate Heterogeneous Simulations In A Grid Environment, J. Mark Pullen, Ryan Brunton, Don Brutzman, David Drake, Michael Hieb, Katherine L. Morse, Andreas Tolk Jan 2004

Using Web Services To Integrate Heterogeneous Simulations In A Grid Environment, J. Mark Pullen, Ryan Brunton, Don Brutzman, David Drake, Michael Hieb, Katherine L. Morse, Andreas Tolk

Computational Modeling & Simulation Engineering Faculty Publications

The distributed information technologies collectively known as Web services recently have demonstrated powerful capabilities for scalable interoperation of heterogeneous software across a wide variety of networked platforms. This approach supports a rapid integration cycle and shows promise for ultimately supporting automatic composability of services using discovery via registries. This paper presents a rationale for extending Web services to distributed simulation environments, including the High Level Architecture (HLA), together with a description and examples of the integration methodology used to develop significant prototype implementations. A logical next step is combining the power of Grid computing with Web services to facilitate rapid …

Go to article

A Predictive Sensor Network Using Ant System, Rajani Muraleedharan, Lisa Ann Osadciw Jan 2004

A Predictive Sensor Network Using Ant System, Rajani Muraleedharan, Lisa Ann Osadciw

Electrical Engineering and Computer Science - All Scholarship

The need for a robust predictive sensor communication network inspired this research. There are many critical issues in a communication network with different data rate requirements, limited power and bandwidth. Energy consumption is one of the key issues in a sensor network as energy dissipation occurs during routing, communication and monitoring of the environment. This paper covers the routing of a sensor communication network by applying an evolutionary algorithm- the ant system. The issues considered include optimal energy, data fusion from different sensor types and predicting changes in environment with respect to time.

Go to article

Future Of Asynchronous Transfer Mode Networking, Fakhreddine Mohamed Hachfi Jan 2004

Future Of Asynchronous Transfer Mode Networking, Fakhreddine Mohamed Hachfi

Theses Digitization Project

The growth of Asynchronous Transfer Mode (ATM) was considered to be the ideal carrier of the high bandwidth applications like video on demand and multimedia e-learning. ATM emerged commercially in the beginning of the 1990's. It was designed to provide a different quality of service at a speed up 100 Gbps for both real time and non real time application. The turn of the 90's saw a variety of technologies being developed. This project analyzes these technologies, compares them to the Asynchronous Transfer Mode and assesses the future of ATM.

Go to article

Orchestration Within The Sonification Of Basic Data Sets, Charlie Cullen, Eugene Coyle Jan 2004

Orchestration Within The Sonification Of Basic Data Sets, Charlie Cullen, Eugene Coyle

Conference papers

The use of sonification as a means of representing and analysing data has become a growing field of research in recent years and as such has become a far more accepted means of working with data. Existing work carried out as part of this research has focused primarily on the sonification of DNA/RNA sequences and their subsequent protein structures for the purposes of analysis. This sonification work raised many questions as regards the need for sequences to be set to music in a standard manner so that different strands could be analysed by comparison, and hence the orchestration and instrumentation …

Go to article

A Book Management System Elibrary, Shanpeng Song Jan 2004

A Book Management System Elibrary, Shanpeng Song

Theses Digitization Project

"eLibrary" is a book management software application that runs on Microsoft Windows platforms. The software incorporates a Windows Explorer like interface and XML/XSL to display book details. The purpose of this project is to build a full-featured, commerical-quality software package to help people manage their books (either printed or electronic). The goal is for eLibrary to be a complete solution for people who wish to build their own personal electronic library catalog.

Go to article

A Genetic Algorithms Approach To Learning Communication And Coordination In Simulated Robots, Chris Sotzing Jan 2004

A Genetic Algorithms Approach To Learning Communication And Coordination In Simulated Robots, Chris Sotzing

Senior Scholar Papers

This project is motivated by an existing robot system for mapping unknown environments and attempts to improve its effectiveness through the use of genetic algorithms. Using a robot simulator, the mapping system is created using simulated robots and a simulated environment. The robots are controlled by a supervisor agent that makes the high-level decisions about tasks for individual robots to complete to accomplish the mapping effort. This research investigates the ability of adding a genetic algorithm learning component to the supervisor to improve its ability to coordinate the robotic agents.

Go to article

A Comparative Evaluation Of .Net Remoting And Java Rmi, Taneem Ibrahim Jan 2004

A Comparative Evaluation Of .Net Remoting And Java Rmi, Taneem Ibrahim

Inquiry: The University of Arkansas Undergraduate Research Journal

Distributed application technologies such as Micrososoft.NET Remoting, and Java Remote Method Invocation (RMI) have evolved over many years to keep up with the constantly increasing requirements of the enterprise. In the broadest sense, a distributed application is one in which the application processing is divided among two or more machines. Distributed middleware technologies have made significant progress over the last decade. Although Remoting and RMI are the two of most popular contemporary middleware technologies, little literature exists that compares them. In this paper, we study the issues involved in designing a distributed system using Java RMI and Microsoft.NET Remoting. In …

Go to article

Graduate School Of Computer And Information Sciences Master's Degree Programs 2004, Nova Southeastern University Jan 2004

Graduate School Of Computer And Information Sciences Master's Degree Programs 2004, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Go to article

Orthogonal Spreading Sequences Constructed Using Hall’S Difference Set, Jennifer Seberry, Le Chung Tran, Yejing Wang, Beata J. Wysocki, Tadeusz Wysocki, Ying Zhao Jan 2004

Orthogonal Spreading Sequences Constructed Using Hall’S Difference Set, Jennifer Seberry, Le Chung Tran, Yejing Wang, Beata J. Wysocki, Tadeusz Wysocki, Ying Zhao

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

In the paper we propose a new set of orthogonal spreading sequences based on the Hadamard matrix of order 32 constructed using the Hall difference set. The proposed sequences are characterised by low peaks in the aperiodic cross-correlation functions and have also good aperiodic auto-correlation properties.

Go to article

Modified Convolutional Interleavers And Their Performance In Turbo Codes, Sina Vafi, Tadeusz Wysocki Jan 2004

Modified Convolutional Interleavers And Their Performance In Turbo Codes, Sina Vafi, Tadeusz Wysocki

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

In previous work,we have presented application of a model of the convolutional interleaver in turbo codes acting as a block interleaver through inserting a number of stuff bits equal to the number of interleaver memories at the end of each data 6lock.h order to get better turbo codes performance, the interleaver with larger period, which increases the number of stuff bits and educes effective channel bandwidth usage, has been suggested. In this paper, we introduce a modification to this interleaver improving turbo codes performance without increasing the interleaver period. This is carried out by increasing distance of adjacent bits that …

Go to article

Two Complex Orthogonal Space-Time Codes For Eight Transmit Antennas, Le Chung Tran, J. Seberry, Yejing Wang, B. J. Wysocki, T. A. Wysocki, Tianbing Xia, Ying Zhao Jan 2004

Two Complex Orthogonal Space-Time Codes For Eight Transmit Antennas, Le Chung Tran, J. Seberry, Yejing Wang, B. J. Wysocki, T. A. Wysocki, Tianbing Xia, Ying Zhao

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

Two new constructions of complex orthogonal space-time block codes of order 8 based on the theory of amicable orthogonal designs are presented and their performance compared with that of the standard code of order 8. These new codes are suitable for multi-modulation schemes where the performance can be sacrificed for a higher throughput.

Go to article

The Effect Of Imperfect Carrier Recovery On The Performance Of The Diversity Antenna Selection Technique In Wireless Channels Utilizing Dstm, Le Chug Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins Jan 2004

The Effect Of Imperfect Carrier Recovery On The Performance Of The Diversity Antenna Selection Technique In Wireless Channels Utilizing Dstm, Le Chug Tran, Tadeusz Wysocki, Jennifer Seberry, Alfred Mertins

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

his paper examines the effect of imperfect carrier phase/frequency recovery at the receiver on the bit error performance of our diversity antenna selection technique (AST) proposed for channels utilizing Differential Space-Time Modulation (DSTM). The tolerance of differential detection associated with the proposed AST to phase/frequency errors is then analyzed.

Go to article

Space Time Spreading With Modified Walsh-Hadamard Sequences, P Vial, B. J. Wysocki, I Raad, Tadeusz Wysocki Jan 2004

Space Time Spreading With Modified Walsh-Hadamard Sequences, P Vial, B. J. Wysocki, I Raad, Tadeusz Wysocki

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

Previous work has shown that the performance of a Space Time Spreading (STS) system using walsh codes with two transmit antennas at the Base Station (BS) is degraded in the presence of mutual interference from adjacent sectors in the same cell. In this paper we use Modified Walsh-Hadamard sequences exhibiting improved cross-correlation performance, which potentially mitigates the effects of MA1 (Multiple Access Interference). The presented study also looks at variation of sets of different Modified Walsh- Hadamard codes being used by the adjacent interferer, with a hundred randomly selected pairings being chosen, as well as the case where one set …

Go to article

Acknowledgment Use With Synthesized And Recorded Prompts, Karen Ward, Tasha Hollingsed, Javier A. Aldaz Salmon Jan 2004

Acknowledgment Use With Synthesized And Recorded Prompts, Karen Ward, Tasha Hollingsed, Javier A. Aldaz Salmon

Graduate Student Papers (CS)

Acknowledgments, e.g., “yeah” and “uh-huh,” are ubiquitous in human conversation but are rarer in human-computer interaction. What interface factors might contribute to this difference? Using a simple spoken-language interface that responded to acknowledgments, we compared subjects’ use of acknowledgments when the interface used recorded speech with that seen when the interface used synthesized speech. Contrary to our hypothesis, we saw a drop in the numbers of subjects using acknowledgments: subjects appeared to interpret the recorded-voice interface as signalling a more limited interface. These results were consistent for both Mexican Spanish and American English versions of the interface.

Go to article

A Predictive Sensor Network Using Ant System, Rajani Muraleedharan, Lisa Ann Osadciw Jan 2004

A Predictive Sensor Network Using Ant System, Rajani Muraleedharan, Lisa Ann Osadciw

Electrical Engineering and Computer Science - All Scholarship

The need for a robust predictive sensor communication network inspired this research. There are many critical issues in a communication network with different data rate requirements, limited power and bandwidth. Energy consumption is one of the key issues in a sensor network as energy dissipation occurs during routing, communication and monitoring of the environment. This paper covers the routing of a sensor communication network by applying an evolutionary algorithm- the ant system. The issues considered include optimal energy, data fusion from different sensor types and predicting changes in environment with respect to time.

Go to article

Post-Training Support For Learning Technology, Sam Snoddy Jr., David G. Novick Jan 2004

Post-Training Support For Learning Technology, Sam Snoddy Jr., David G. Novick

Departmental Papers (CS)

To examine the effects of post-training support, we studied the introduction of new gradebook software in a public high school. The school's 108 faculty members received training on the software, and approximately half of the faculty received posttraining support for eight weeks. The study measured the faculty's current computer usage, usage of earlier versions of the software, and their perceived skill levels in using the software. The data suggest that the faculty members who received post-training support maintained and raised their skill levels, while unsupported faculty had their skill levels decline.

Go to article

Assessing Effectiveness Of Personality Style In Documentation, Kenneth Sayles, David G. Novick Jan 2004

Assessing Effectiveness Of Personality Style In Documentation, Kenneth Sayles, David G. Novick

Departmental Papers (CS)

This paper extends previous work by other researchers that indicated that users of computers preferred a computer with a personality that was similar to theirs. We conducted a similar experiment, but looking beyond preference to see if the personality of documentation would make a difference in the user’s performance. Our data suggest did not indicate that personality match affects performance; and if such a relationship exists it is likely to be weak. We discuss the related research, describe our methodology, present our results, and describe their implications and limitations.

Go to article

Expression Morphing Between Different Orientations, Tao Fu Jan 2004

Expression Morphing Between Different Orientations, Tao Fu

Electronic Theses and Dissertations

How to generate new views based on given reference images has been an important and interesting topic in the area of image-based rendering. Two important algorithms that can be used are field morphing and view morphing. Field morphing, which is an algorithm of image morphing, generates new views based on two reference images which were taken at the same viewpoint. The most successful result of field morphing is morphing from one person's face to the other one's face. View morphing, which is an algorithm of view synthesis, generates in between views based on two reference views which were taken at …

Go to article

Complex Orthogonal Sequences From Amicable Hadamard Matrices, L. C. Tran, J. Seberry, B. J. Wysocki, Tadeusz Wysocki, T. Xia, Ying Zhao Jan 2004

Complex Orthogonal Sequences From Amicable Hadamard Matrices, L. C. Tran, J. Seberry, B. J. Wysocki, Tadeusz Wysocki, T. Xia, Ying Zhao

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

The paper deals with the novel technique of designing complex spreading sequences with only four phases (0.25π, 0.75π, 1.25π, 1.75π). The interesting feature of those new sequences is the fact that not only the complex sequences are orthogonal but the real parts and imaginary parts are independently orthogonal. This can be utilized for spreading of complex constellation signals where the independent spreading using bipolar sequences (real part for in-phase component and imaginary part for quadrature component) can be applied. The paper introduces the theoretical background, and some example constructions of the amicable …

Go to article

A Mobile Robotic Computing Platform For Three-Dimensional Indoor Mappi, Kenneth Mccoig Jan 2004

A Mobile Robotic Computing Platform For Three-Dimensional Indoor Mappi, Kenneth Mccoig

Electronic Theses and Dissertations

There are several industries exploring solutions to quickly and accurately digitize unexplored indoor environments, into useable three-dimensional databases. Unfortunately, there are inherent challenges to the indoor mapping process such as, scanning limitations and environment complexity, which require a specific application of tools to map an environment precisely with low cost and high speed. This thesis successfully demonstrates the design and implementation of a low cost mobile robotic computing platform with laser scanner, for quickly mapping with high resolution, urban and/or indoor environments using a gyro-enhanced orientation sensor and selectable levels of detail. In addition, a low cost alternative solution to …

Go to article

The Frequency Distribution Of Quantization Error In Digitizers For Coherent Sampling, Sol Neeman Ph.D. Jan 2004

The Frequency Distribution Of Quantization Error In Digitizers For Coherent Sampling, Sol Neeman Ph.D.

Engineering Studies Faculty Publications and Creative Works

In this paper the frequency distribution of quantization error in coherent sampling of digitizers will be investigated. As the distribution of the quantization error affects the values of THD and SNR, it is relevant for a correct interpretation of THD and SNR of sine waves in coherent sampling. The distribution of the quantization error will be analyzed as a function of N, total number of samples and M, number of cycles in the sample set and it will be proved that for certain cases, the quantization error falls on odd harmonics only of the frequency of the sampled sine wave.

Go to article

A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar Jan 2004

A Fast And Simple Algorithm For Computing M-Shortest Paths In State Graph, M. Sherwood, Laxmi P. Gewali, Henry Selvaraj, Venkatesan Muthukumar

Electrical & Computer Engineering Faculty Research

We consider the problem of computing m shortest paths between a source node s and a target node t in a stage graph. Polynomial time algorithms known to solve this problem use complicated data structures. This paper proposes a very simple algorithm for computing all m shortest paths in a stage graph efficiently. The proposed algorithm does not use any complicated data structure and can be implemented in a straightforward way by using only array data structure. This problem appears as a sub-problem for planning risk reduced multiple k-legged trajectories for aerial vehicles.

Go to article

Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano Jan 2004

Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

In this paper we construct a setting in which the question of when a logic supports a classical modal expansion can be made precise. Given a fully selfextensional logic S, we find sufficient conditions under which the Vietoris endofunctor V on S-referential algebras can be defined and we propose to define the modal expansions of S as the logic that arises from the V-coalgebras. As an example, we also show how the Vietoris endofunctor on referential algebras extends the Vietoris endofunctor on Stone spaces. From another point of view, we examine when a category of ‘spaces’ (X,A), ie sets X …

Go to article

Software Quality Strategic Driver Model (Sq-Sdm 11), Ronan Fitzpatrick Jan 2004

Software Quality Strategic Driver Model (Sq-Sdm 11), Ronan Fitzpatrick

Other resources

No abstract provided.

Go to article

Analysis Of Data Sets Using Trio Sonification, Charlie Cullen, Eugene Coyle Jan 2004

Analysis Of Data Sets Using Trio Sonification, Charlie Cullen, Eugene Coyle

Conference papers

Recent advances in technology have suggested that sound and audio play a far greater part in our daily working lives than ever before. Mobile phone ring tones are now based upon polyphonic music sequences that allow relatively complex audio to be generated from a handset by way of conveying information (i.e. a call or message is incoming). This real world example of sonification suggests that far more could be made of sonification techniques for analysis- particularly in the business environment. One advantage of sonification is its relatively hands free nature in that once a sequence is being played it does …

Go to article

Neural Analysis Of Top Shielded Multilayered Coplanar Waveguides, Mustafa Türkmen, Celal Yildiz, Şeref Sağiroğlu Jan 2004

Neural Analysis Of Top Shielded Multilayered Coplanar Waveguides, Mustafa Türkmen, Celal Yildiz, Şeref Sağiroğlu

Turkish Journal of Electrical Engineering and Computer Sciences

Artificial neural networks (ANNs) have been promising tools for many applications. In recent years, a computer-aided design approach based on (ANNs) has been introduced to microwave modelling, simulation and optimization. In this work, the characteristic parameters of top shielded multilayered coplanar waveguides (CPWs) have been determined with the use of ANN models. These neural models were trained with Levenberg-Marquardt, resilient propagation, Bayesian regulation, quasi-Newton, and backpropagation learning algorithms. Better performance and learning speed with a simpler structure were achieved from these models. The results have shown that the estimated characteristic parameters are in very good agreement with the computed results …

Go to article

A Simple And Global Optimization Algorithm For Engineering Problems: Differential Evolution Algorithm, Dervi̇ş Karaboğa, Selçuk Ökdem Jan 2004

A Simple And Global Optimization Algorithm For Engineering Problems: Differential Evolution Algorithm, Dervi̇ş Karaboğa, Selçuk Ökdem

Turkish Journal of Electrical Engineering and Computer Sciences

Differential Evolution (DE) algorithm is a new heuristic approach mainly having three advantages; finding the true global minimum regardless of the initial parameter values, fast convergence, and using few control parameters. DE algorithm is a population based algorithm like genetic algorithms using similar operators; crossover, mutation and selection. In this work, we have compared the performance of DE algorithm to that of some other well known versions of genetic algorithms: PGA, Grefensstette, Eshelman. In simulation studies, De Jong's test functions have been used. From the simulation results, it was observed that the convergence speed of DE is significantly better than …

Go to article

Graduate Certificate In Information Security 2004, Nova Southeastern University Jan 2004

Graduate Certificate In Information Security 2004, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Go to article

First Prev Next Last