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

Computer Sciences Commons™

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

Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 16891 - 16920 of 17307

Full-Text Articles in Computer Sciences

Optimum Symbol-By-Symbol Detection Of Uncoded Digital Data Over The Gaussian Channel With Unknown Carrier Phase, Pooi Yuen Kam, Seng Siew Ng, Tock Soon Ng Aug 1994

Optimum Symbol-By-Symbol Detection Of Uncoded Digital Data Over The Gaussian Channel With Unknown Carrier Phase, Pooi Yuen Kam, Seng Siew Ng, Tock Soon Ng

Research Collection School Of Computing and Information Systems

A theory of optimum receiver design for symbol-by-symbol detection of an uncoded digital data sequence received over the Gaussian channel with unknown carrier phase is presented. Linear suppressed-carrier modulation is assumed. The work here aims at laying a conceptual foundation for optimum symbol-by-symbol detection, and rectifies existing approaches to the problem. The optimum receiver structure is obtained explicitly for an arbitrary carrier phase model, but its computational requirements are too heavy in general for any practical implementation. In one important special case, namely, the case in which the carrier phase can be treated as a constant over some K+1 symbol …

Go to article

Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew Jul 1994

Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew

Research Collection School Of Computing and Information Systems

We present ROMAN, a comprehensive, generic manpower rostering toolkit that successfully handles a wide spectrum of work policies found in service organizations. We review the use of various techniques and methodologies in the toolkit that contribute to its robustness and efficiency, and relate experience gained in addressing manpower rostering problems in industry.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 6, June 1994, College Of Engineering And Computer Science, Wright State University Jun 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 6, June 1994, 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

A Recursive Least Squares Training Algorithm For Multilayer Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu Jun 1994

A Recursive Least Squares Training Algorithm For Multilayer Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu

Mechanical and Aerospace Engineering Faculty Research & Creative Works

Recurrent neural networks have the potential to perform significantly better than the commonly used feedforward neural networks due to their dynamical nature. However, they have received less attention because training algorithms/architectures have not been well developed. In this study, a recursive least squares algorithm to train recurrent neural networks with an arbitrary number of hidden layers is developed. The training algorithm is developed as an extension of the standard recursive estimation problem. Simulated results obtained for identification of the dynamics of a nonlinear dynamical system show promising results.

Go to article

Identification Of Cutting Force In End Milling Operations Using Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu Jun 1994

Identification Of Cutting Force In End Milling Operations Using Recurrent Neural Networks, Q. Xu, K. Krishnamurthy, Bruce M. Mcmillin, Wen Feng Lu

Mechanical and Aerospace Engineering Faculty Research & Creative Works

The problem of identifying the cutting force in end milling operations is considered in this study. Recurrent neural networks are used here and are trained using a recursive least squares training algorithm. Training results for data obtained from a SAJO 3-axis vertical milling machine for steady slot cuts are presented. The results show that a recurrent neural network can learn the functional relationship between the feed rate and steady-state average resultant cutting force very well. Furthermore, results for the Mackey-Glass time series prediction problem are presented to illustrate the faster learning capability of the neural network scheme presented here

Go to article

Hardware Assists For High Performance Computing Using A Mathematics Of Arrays, H. Pottinger, W. Eatherton, L. Mullin, T. Schiefelbein Jun 1994

Hardware Assists For High Performance Computing Using A Mathematics Of Arrays, H. Pottinger, W. Eatherton, L. Mullin, T. Schiefelbein

Computer Science Technical Reports

Work in progress at the University of Missouri - Rolla on hardware assists for high performance computing and communication is presented. This research consists of a field programmable gate array based rapid prototyping environment (Chameleon) being used to evaluate hardware architectures for speedup of array partitioning and routing algorithms. These algorithms have been developed using a Mathematics of Arrays (MOA) and are optimal in the sense that they reduce normal array indexing operations to a series of primitive additions based on array shape. The method is simple yet powerful, produces algorithms which are provably correct, and are independent of dimensionality. …

Go to article

An Fpga Based Reconfigurable Coprocessor Board Utilizing A Mathematics Of Arrays, H. Pottinger, W. Eatherton, T. Schiefelbein, L. Mullin, R. Ziegler Jun 1994

An Fpga Based Reconfigurable Coprocessor Board Utilizing A Mathematics Of Arrays, H. Pottinger, W. Eatherton, T. Schiefelbein, L. Mullin, R. Ziegler

Computer Science Technical Reports

Work in progress at the University of Missouri-Rolla on hardware assists for high performance computing is presented. This research consists of a novel field programmable gate array (FPGA) based reconfigurable coprocessor board (the Chameleon Coprocessor) being used to evaluate hardware architectures for speedup of array computation algorithms. These algorithms have been developed using a Mathematics of Arrays (MOA) and are optimal in the sense that they reduce normal array cartesian indexing operations to a series of primitive additions and offsets based on array shape. The method is simple yet powerful, produces algorithms which are provably correct, and are independent of …

Go to article

Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas Jun 1994

Production And Decay Of D1 (2420)0 And D2* (2460)0, Avery, P.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 5, May 1994, College Of Engineering And Computer Science, Wright State University May 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 5, May 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve 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

Multirate Time-Frequency Distributions, John R. O'Hair May 1994

Multirate Time-Frequency Distributions, John R. O'Hair

Theses and Dissertations

Multirate systems, which find application in the design and analysis of filter banks, are demonstrated to also be useful as a computational paradigm. It is shown that any problem which can be expressed a set of vector-vector, matrix-vector or matrix-matrix operations can be recast using multirate. This means all of numerical linear algebra can be recast using multirate as the underlying computational paradigm. As a non-trivial example, the multirate computational paradigm is applied to the problem of Generalized Discrete Time- Frequency Distributions GDTFD to create a new family of fast algorithms. The first of this new class of distributions is …

Go to article

A User-Level Process Package For Concurrent Computing, Ravi Konuru, Steve Otto, Jonathan Walpole, Robert Prouty, Jeremy Casas May 1994

A User-Level Process Package For Concurrent Computing, Ravi Konuru, Steve Otto, Jonathan Walpole, Robert Prouty, Jeremy Casas

Computer Science Faculty Publications and Presentations

A lightweight user-level process(ULP) package for parallel computing is described. Each ULP has its own register context, stack, data and heap space and communication with other ULPs is performed using locally synchronous, location transparent, message passing primitives. The aim of the package is to provide support for lightweight over-decomposition, optimized local communication and transparent dynamic migration. The package supports a subset of the Parallel Virtual Machine(PVM) interface[Sun90).

Go to article

Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz May 1994

Constraint Objects, Divesh Srivastava, Raghu Ramakrishnan, Peter Revesz

School of Computing: Conference and Workshop Papers

We describe the Constraint Object Data Model (CODM), which enhances an object-based data model with existential constraints to naturally represent partially specified information. We present the Constraint Object Query Language (COQL), a declarative, rule-based query language that can be used to infer relationships about and monotonically refine information represented in the CODM. COQL has a model-theoretic and an equivalent fixed-point semantics, based on the notions of constraint entailment and "proofs in all possible worlds." We also provide a novel polynomial-time algorithm for quantifier elimination for set-order constraints, a restricted class of set constraints that uses membership of subset-equal.

Go to article

Dynamic Task Scheduling For The Atamm Multicomputer Operating System Using Embedded Firmware On Microcontrollers, Sudhir Sastry Apr 1994

Dynamic Task Scheduling For The Atamm Multicomputer Operating System Using Embedded Firmware On Microcontrollers, Sudhir Sastry

Electrical & Computer Engineering Theses & Dissertations

A dynamic task scheduling strategy for the distributed processing of large grain dataflow algorithms using embedded firmware on an ATAMM testbed consisting of interconnected microcontrollers is presented in this thesis. The ODU/NASA developed Algorithm to Architecture Mapping Model, ATAMM, uses marked graph models to specify data and control flow for the execution of iterative, deterministic large grain dataflow algorithms in a multicomputing environment. The testbed consists of a bank of four 68HC11 microcontrollers that communicate over a token bus. The token bus arbitration scheme used is contention free and well suited for real-time computing applications. The execution of data flow …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 4, April 1994, College Of Engineering And Computer Science, Wright State University Apr 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 4, April 1994, 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

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 3, March 1994, College Of Engineering And Computer Science, Wright State University Mar 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 3, March 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve 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

Clustering Techniques In Speaker Recognition, Douglas N. Prescott Mar 1994

Clustering Techniques In Speaker Recognition, Douglas N. Prescott

Theses and Dissertations

This thesis presents a comparison based on identification rate, of three clustering techniques applied to cepstral features for speaker identification. LBG vector quantization as developed by Linde, Buzo and Gray; is used to provide benchmark performance for comparison with Fuzzy clustering (based on the unsupervised fuzzy partition-optimal number of classes, UFP-ONC algorithm by Gath and Geva) and an Artificial Neural Network, the Multilayer Perceptron. Cepstral features from the TIMIT, King and AFIT93 corpus speaker databases are used to produce speaker-identification classifiers using each of the clustering algorithms. The experiment reported evaluates the speaker identification performance using the 20-dimensional cepstral features …

Go to article

Application Of Sequential Quadratic Programming To Large-Scale Structural Design Problems, Mark A. Abramson Mar 1994

Application Of Sequential Quadratic Programming To Large-Scale Structural Design Problems, Mark A. Abramson

Theses and Dissertations

Large-scale structural optimization problems are often difficult to solve with reasonable efficiency and accuracy. Such problems are often characterized by constraint functions which are not explicitly defined. Constraint and gradient functions are usually expensive to evaluate. An optimization approach which uses the NLPQL sequential quadratic programming algorithm of Schittkowski, integrated with the Automated Structural Optimization System ASTROS is tested. The traditional solution approach involves the formulation and solution of an explicitly defined approximate problem during each iteration. This approach is replaced by a simpler approach in which the approximate problem is eliminated. In the simpler approach, each finite element analysis …

Go to article

A Simulation Approach To Granite Sentry System Analysis, Marilyn J. Bauer Mar 1994

A Simulation Approach To Granite Sentry System Analysis, Marilyn J. Bauer

Theses and Dissertations

This study demonstrated the use of simulation modelling to analyze Granite Sentry system performance. The availability simulation model constructed provides a number of system performance measures as a function of component MTBFs and MTTRs. Analysis of failure data prior to model construction supported the generally accepted use of exponentially distributed failure rates and lognormally distributed repair times.

Go to article

The Effective Use Of Animation In Simulation Model Validation, Christopher L. Swider Mar 1994

The Effective Use Of Animation In Simulation Model Validation, Christopher L. Swider

Theses and Dissertations

This study examined two animation displays moving icons, bar graphs at two presentation speeds to determine how each of these factors affected the animations ability to communicate violations of model assumptions. Subjects viewed animation displays individually and in combination at each presentation speed. Eight problem scenarios were presented to evaluate each animations ability to communicate violations of different assumptions. Each animations communication ability was measured subjectively and objectively. Subjective measures in the form of pairwise comparisons were used to calculate normalized preference ratings for each animation. objective measures included problem identification accuracy and problem time. Subjective results indicated that moving …

Go to article

Assessing The Vulnerability Of Multi-Commodity Networks With Failing Components, Alan R. Robinson Mar 1994

Assessing The Vulnerability Of Multi-Commodity Networks With Failing Components, Alan R. Robinson

Theses and Dissertations

This research proposes an analytical approach for assessing flow disturbance, or compromise, based on limited sampling of arc flow information in multi-commodity, or multiple origin-destination O-D, networks with failing arcs. There were three objectives established for this research. The first objective was to bound the expected flow, given the arcs fail with certain probabilities, which was accomplished by reviewing current approaches for single-commodity networks and extending the results to the multi-commodity case. The second objective was to determine the best placement of flow monitors to obtain the most accurate estimates of O-D pair volumes. This was accomplished using a multi-criteria …

Go to article

A Fortran Based Learning System Using Multilayer Back-Propagation Neural Network Techniques, Gregory L. Reinhart Mar 1994

A Fortran Based Learning System Using Multilayer Back-Propagation Neural Network Techniques, Gregory L. Reinhart

Theses and Dissertations

An interactive computer system which allows the researcher to build an optimal neural network structure quickly, is developed and validated. This system assumes a single hidden layer perceptron structure and uses the back- propagation training technique. The software enables the researcher to quickly define a neural network structure, train the neural network, interrupt training at any point to analyze the status of the current network, re-start training at the interrupted point if desired, and analyze the final network using two- dimensional graphs, three-dimensional graphs, confusion matrices and saliency metrics. A technique for training, testing, and validating various network structures and …

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 2, February 1994, College Of Engineering And Computer Science, Wright State University Feb 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 2, February 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A twelve 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

Scheduling Of Unstructured Communication On The Intel Ipsc/860, Jhy-Chun Wang, Sanjay Ranka Jan 1994

Scheduling Of Unstructured Communication On The Intel Ipsc/860, Jhy-Chun Wang, Sanjay Ranka

College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects

In this paper we present several algorithms for decomposing all-to-many personalized communication into a set of disjoint partial permutations. These partial permutations avoid node contention as well as link contention. We discuss the theoretical complexity of these algorithms and study their effectiveness both from the view of static scheduling and from runtime scheduling. Experimental results for our algorithms are presented on the iPSC/860.

Go to article

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 1, January 1994, College Of Engineering And Computer Science, Wright State University Jan 1994

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 10, Number 1, January 1994, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A fourteen 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

Neural Network Diagnosis Of Malignant Melanoma From Color Images, Fikret Erçal, Hsi-Chieh Lee, William V. Stoecker, Randy Hays Moss, Anurag Chawla Jan 1994

Neural Network Diagnosis Of Malignant Melanoma From Color Images, Fikret Erçal, Hsi-Chieh Lee, William V. Stoecker, Randy Hays Moss, Anurag Chawla

Computer Science Faculty Research & Creative Works

Malignant melanoma is the deadliest form of all skin cancers. Approximately 32,000 new cases of malignant melanoma were diagnosed in 1991 in the United States, with approximately 80% of patients expected to survive 5 years. Fortunately, if detected early, even malignant melanoma may be treated successfully, Thus, in recent years, there has been rising interest in the automated detection and diagnosis of skin cancer, particularly malignant melanoma. Here, the authors present a novel neural network approach for the automated separation of melanoma from 3 benign categories of tumors which exhibit melanoma-like characteristics. The approach uses discriminant features, based on tumor …

Go to article

Strategies For The Parallel Training Of Simple Recurrent Neural Networks, Peter J. Mccann, Barry L. Kalman Jan 1994

Strategies For The Parallel Training Of Simple Recurrent Neural Networks, Peter J. Mccann, Barry L. Kalman

All Computer Science and Engineering Research

Two concurrent implementations of the method of conjugate gradients for training Elman networks are discussed. The parallelism is obtained in the computation of the error gradient and the method is therefore applicable to any gradient descent training technique for this form of network. The experimental results were obtained on a Sun Sparc Center 2000 multiprocessor. The Sparc 2000 is a shared memory machine well suited to coarse-grained distributed computations, but the concurrency could be extended to other architectures as well.

Go to article

Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos Jan 1994

Congestion Control In Atm Networks, Apostolos Dailianas, Andreas Bovopoulos

All Computer Science and Engineering Research

No abstract provided.

Go to article

Efficient Quality Of Service Support In Multimedia Computer Operating Systems, Raman Gopalakrishna, Guru M. Parulkar Jan 1994

Efficient Quality Of Service Support In Multimedia Computer Operating Systems, Raman Gopalakrishna, Guru M. Parulkar

All Computer Science and Engineering Research

This report describes our approach towards providing quality of service (QoS) guarantees for network communication within the endsystems to support multimedia applications. We first address the problem of QoS specification by identifying a set of application classes and their QoS parameters that cover the communication requirements of most applications. We then describe the QoS mapping problem, and show how requirements for resources (such as the CPU, the network interface adaptor and network connections) can be automatically derived from the application QoS parameters. We then deal with the QoS enforcement issue in which we describe techniques for scheduling protocol processing threads …

Go to article

Distributed Data Layout, Scheduling And Playout Control In A Large Scale Multimedia Storage Server, Milind M. Buddhikot, Guru Parulkar Jan 1994

Distributed Data Layout, Scheduling And Playout Control In A Large Scale Multimedia Storage Server, Milind M. Buddhikot, Guru Parulkar

All Computer Science and Engineering Research

No abstract provided.

Go to article

Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn Jan 1994

Production Quality Video Over Broadband Networks: A Description Of The System And Two Interactive Applications, William D. Richard, Jerome R. Cox Jr., A. Maynard Engebretson, Jason Fritts And Brian L. Gottlieb And Craig Horn

All Computer Science and Engineering Research

The Washington University MultiMedia eXplorer (MMX) is a complete, host-independent multimedia system capable of transmitting and receiving JPEG-compressed video, CD-quality audio, and high-resolution radiographic images over the Washington University broadband ATM network. If the host is equipped with an ATM interface card, normal network traffic can be supported via an ATM extension port on the MMX. The major components of the MMX are an ATMizer and three multimedia channels. The ATMizer implements the host interface, the interface to the ATM network, and hte interface to the three multimdeia channels. This paper describes the architecture of the MMX, the software used …

Go to article

First Prev Next Last