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

Operations Research, Systems Engineering and Industrial Engineering Commons™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 4201 - 4206 of 4206

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan Aug 1997

An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.

Go to article

Arts, Computers And Artificial Intelligence, Sol Neeman Ph.D. Nov 1996

Arts, Computers And Artificial Intelligence, Sol Neeman Ph.D.

Engineering Studies Faculty Publications and Creative Works

Science and art seem to belong to different cultures. Science and technology, mainly the products of the intellect, use terminology and vocabulary that are concise and well defined. In contrast, in artistic expression, ambiguity is a powerful component. Still the relationship between these two different categories of human activity is interesting and fascinating. In this paper, a general comparison of these two disciplines will be introduced. Then the possibility of mechanical creation of art using computers and artificial intelligence will be discussed. This will be followed by two techniques which are used to create poetry and music. First, a statistical …

Go to article

Incorporating Matlab's Signal Processing Toolbox Into A Dsp Course At An Undergraduate E.E. Program, Sol Neeman Ph.D. Jan 1996

Incorporating Matlab's Signal Processing Toolbox Into A Dsp Course At An Undergraduate E.E. Program, Sol Neeman Ph.D.

Engineering Studies Faculty Publications and Creative Works

This paper provides some suggestions for incorporating MATLAB's Signal Processing Toolbox into a DSP course. Often, in a DSP course, students have difficulties understanding abstract and non-intuitive concepts and seeing their relevance to the practical part of their curriculum. The tools offered by MATLAB's Signal Processing Toolbox, can help to make these concepts more tangible and provide a perspective for students. Some basic tools relevant to an undergraduate DSP course will be introduced, including examples of tool use and graphic results. The tools presented will be applied in the areas of synthesis and analysis of signals, FFT computation, impulse response …

Go to article

Using Matlab To Illustrate The 'Phenomenon Of Aliasing', Sol Neeman, Ph.D. Jan 1995

Using Matlab To Illustrate The 'Phenomenon Of Aliasing', Sol Neeman, Ph.D.

Engineering Studies Faculty Publications and Creative Works

The phenomenon of aliasing is important when sampling analog signals. In cases where the signal is bandlimited, one can avoid aliasing by ensuring that the sampling rate is higher than the Nyquist rate . But in cases where the signal is not bandlimited , aliasing is unavoidable if the signal is not filtered before it is sampled. It is then crucial to understand the phenomenon in order to estimate the distortion generated when the signal is reconstructed from its samples. Using the software package MATLAB by MathWorks, Inc ., two examples are presented. The first is a pure sinusoid which …

Go to article

Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh Oct 1992

Packet Routing In Networks With Long Wires, Ronald I. Greenberg, H.-C. Oh

Computer Science: Faculty Publications and Other Works

In this paper, we examine the packet routing problem for networks with wires of differing length. We consider this problem in a network independent context, in which routing time is expressed in terms of “congestion” and “dilation” measures for a set of packet paths. We give, for any constant ε > 0, a randomized on-line algorithm for routing any set of N packets in O((Clg^ε(Nd)+Dlg(Nd))/lglg(Nd)) time, where C is the maximum congestion and D is the length of the longest path, both taking wire delays into account, and d is the longest path in terms of number of wires. We also …

Go to article

Systems Reliability Using The Flow Graph, Kenneth Edward Farrier Jan 1970

Systems Reliability Using The Flow Graph, Kenneth Edward Farrier

Dissertations and Theses

The problem of calculating the reliability of a complex system of interacting elements is delineated to a linear system, no element of the system having a reliability distribution in terms of any other e1ement of the system, where only one path is taken through the system at a time. A precise definition is then developed to specify the reliability of the linear, single path at a time, system. A precise and concise generating function is found that effortlessly produces the reliability of the linear, single path at a time, system directly from the reliability flew graph of the system.

Go to article

First Prev