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

Physical Sciences and Mathematics Commons

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

1991

Opportunities for Undergraduate Research Experience Program (OURE)

Computer Sciences

Articles 1 - 9 of 9

Full-Text Articles in Physical Sciences and Mathematics

Computer Modeling Of A Liquid Fuel Spray, Clemin R. Goodin Jr. Apr 1991

Computer Modeling Of A Liquid Fuel Spray, Clemin R. Goodin Jr.

Opportunities for Undergraduate Research Experience Program (OURE)

The initial phase of this project involved manipulation of a lengthy FORTRAN computer code named "Kirwan." The code originated from England many years ago and was transferred to UMR by Dr. Drallmeier. Dr. Drallmeier had the code on a series of 5.25 inch floppy diskettes and the objective of the project was to load the code on to the Apollo computer system and be able to use it....The second phase of the project was begun in early November 1990 and is currently ongoing. The objective of this project is to predict "Rosin-Rammler" (RR) distribution equations for a fuel spray, given …


Using Software To Demonstrate Kinematics Of Gear Sets, John F. Hall Apr 1991

Using Software To Demonstrate Kinematics Of Gear Sets, John F. Hall

Opportunities for Undergraduate Research Experience Program (OURE)

The research was done in the area of developing software which could be used to demonstrate the motion of gears. To demonstrate this motion involved learning about programming using graphics. Engineering skills were used in the programming in various ways. One way was in developing and implementing the equations and theory. The more critical engineering aspect of this project is in determining what is effective in demonstrating the kinematic principles associated with gear sets.

The programs will be a helpful aid in showing students what is happening with the motion of gear sets. Not only will instructors be allowed to …


Suggestions For Improvements In Current Computer Image Processing Methods In Detection And Quantification Of The Severity Of Atrophic Rhinitis In Pigs, Jimmy Yu Apr 1991

Suggestions For Improvements In Current Computer Image Processing Methods In Detection And Quantification Of The Severity Of Atrophic Rhinitis In Pigs, Jimmy Yu

Opportunities for Undergraduate Research Experience Program (OURE)

This paper investigates several techniques to aid in the utilization of computer image processing methods to detect and quantify the severity of atrophic rhinitis in pigs. An algorithm for reducing the complexity of matrix multiplications from O(n3) to O(n2.81) is explored. A one-pixel-wide edge detection method is also studied. These techniques are considered for improving the accuracy, repeatability, and speed of existing detection and quantification methods.


Simulated Annealing On The Composite Graph Coloring Problem, Kevin Alons Apr 1991

Simulated Annealing On The Composite Graph Coloring Problem, Kevin Alons

Opportunities for Undergraduate Research Experience Program (OURE)

The composite graph is a finite undirected graph G with no loops and no multiple edges and with positive integers associated with each vertex of G. The number of integers associated with each vertex is the chromaticity of the vertex. The chromatic degree of a vertex v is the sum of the chromaticity of v and the chromaticities of all vertices adjacent to v. The graph G is a v-composite graph if the chromaticities are not equal.


Vehicle Routing Using The Sweep Algorithm In Parallel, Jana G. Beattie, Carol L. Spelman Apr 1991

Vehicle Routing Using The Sweep Algorithm In Parallel, Jana G. Beattie, Carol L. Spelman

Opportunities for Undergraduate Research Experience Program (OURE)

This paper presents a parallel version of the Sweep Algorithm, a heuristic solution to the smgle-termma] vehicle routing problem The Sweep Algorithm uses a duster-first route-second approach in finding a near-optimal set of routes. The clusters of delivery points are formed by using the terminal as the center and moving around it m a sweeping fashion After a duster is defined, the route is found with a traveling salesperson algorithm.

The parallel version begins the sweep at different angles and performs both forward and backward sweeps. Each node handles a sweep and returns information concerning total distance traveled to the …


Computer Visualization Of Irrotational Flow Over Bluff And Streamlined Bodies, Nora Okong' O Apr 1991

Computer Visualization Of Irrotational Flow Over Bluff And Streamlined Bodies, Nora Okong' O

Opportunities for Undergraduate Research Experience Program (OURE)

Computer programs were developed to visualize irrotational flow over bluff bodies (circular cylinders and half-bodies) and streamlined bodies (elliptical cylinders and airfoils). The method of superposition of flows was used, with stream functions or complex velocity potentials for fundamental flows being added to obtain the flows over the bodies. For the flow over the circular cylinders, half-bodies and elliptical cylinders, the stream function was calculated directly. The flow over the airfoil was obtained by Joukowski mapping of the imaginary part of the complex velocity potential for flow over a circular cylinder.

The programs developed will be valuable learning tools for …


The Traveling Salesman Problem A Parallel Branch And Bound Solution, Tracy Orton, Lan Tran Apr 1991

The Traveling Salesman Problem A Parallel Branch And Bound Solution, Tracy Orton, Lan Tran

Opportunities for Undergraduate Research Experience Program (OURE)

A book published in Germany in 1852 said of the successful traveling salesman: "The most important aspect is to cover as many locations as possible without visiting the same location twice." This quote is the earliest mention of the "Traveling Salesman Problem" (TSP). There are many algorithms to solve the TSP, the one we implemented was the Branch and Bound algorithm. The TSP graph G is completely connected by a set of edges E, with a non-negative cost Cij associated with each edge. A tour of the graph is a cycle containing all vertices once and only once, starting …


An Overview And Evaluation: Computer Software To Aid Students In Prewriting, Writing, And Revision, Mary Lou Shomaker Apr 1991

An Overview And Evaluation: Computer Software To Aid Students In Prewriting, Writing, And Revision, Mary Lou Shomaker

Opportunities for Undergraduate Research Experience Program (OURE)

The research on computer software to aid inexperienced writers was done from May, 1990 through August, 1990, and involved examining software that would help students improve their writing. The softwares also were evaluated according to their value for use in computer assisted writing classes. The project had three objectives: 1) to evaluate software designed to aid the writer in the pre-writing, writing, and revising stages; 2) to identify the components of this type of software; 3) to recommend software for the beginning academic writer.


A Computer Graphics Program For Displaying Water Molecules On A Dn3500 Apollo Workstation, Michael A. Stuller Apr 1991

A Computer Graphics Program For Displaying Water Molecules On A Dn3500 Apollo Workstation, Michael A. Stuller

Opportunities for Undergraduate Research Experience Program (OURE)

A computer graphics program is developed for displaying water molecule configurations on the screen of a DN3500 Apollo workstation. The motivation was to generate a fast display of output from molecular dynamics or Monte Carlo computer simulations. Input to the program consists of a listing of the Cartesian coordinates of the atomic constituents of the molecules. Options in the program include: 1) number of molecules; 2) plot size; 3) atomic radii; 4) superposition of substrate atomic positions; 5) viewing angle; and 6) color-coded and/or numbered atoms. The program is written in Fortran.