Physical Sciences and Mathematics Commons^™

Programs And Data Sets For Quasimolecular Modeling Of Cavity Flow, Donald Greenspan

Mathematics Technical Papers - Archive

No abstract provided.

Algebraic Geometry For Computer-Aided Geometric Design, Thomas W. Sederberg, Ronald N. Goldman

Faculty Publications

Classical algebraic geometry has been virtually ignored in computer-aided geometric design. However, because it deals strictly with algorithms, it is really more suited to this field than is modern algebraic geometry, which introduces abstractions far removed from the algorithmic nature of computer-aided design. This tutorial examines resultants, curve implicitization, curve inversion, and curve intersection. Discussion follows a series of examples simple enough for those with only a modest algebra background to follow.

Some Studies In Analysis And Recognition Of 2 Dimensional Shapes., Swapan Kumar Parui Dr.

Doctoral Theses

Analysis and recognition of 2-dimensional shapes constitute an important problem in the fields of Pattern Recognition, Image Analysis, Computer Vision, Robotics and other related areas of research. If we look at the problem from the point of view of image or scene analysis, in a sense, the antire subject of automatic scene analysis might be defined as the problem of describing and recognizing the shape of the ob jects in an image. Shape is the primal intrinsic property for the vision system because we associate the definitions of objects with shape, rather than with colour or reflectivity, for example.According to …

An Improved Algorithm For Generating Minimal Perfect Hash Functions, Thomas J. Sager

Computer Science Technical Reports

A minimal perfect hash function (MPHF) is a function from a set of M objects to the first M non-negative integers. MPHF's are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language or commonly employed words in a natural language. In this paper we improve on an earlier result and present an algorithm for generating MPHF's with an expected time complexity proportional to M⁴. We also give a MPHF for the 256 most frequently used words in the English language.

On Some Deterministic And Stochastic Scheduling Problems., V. Rajendra Prasad Dr.

Doctoral Theses

Scheduling problems are quite common in nature. They arise whenever there is a need to plan the execution of various operations over time. Like many ot her real life problems such as inventories, networks, queues etc. almost all the scheduling problems car be rapresented by appropriate mathematical models. The theory of scheduling is a disciplina which doals with the construction of suitable mathematical models for sche duling problems and their analysis. Scheduling theory came into prominance after Johnson (1954) had published his work on a fiow shop sche duling problem.The current reseu rch work in scheduling thoory can ba classified …

An Algorithm For Finding The Generalized Nucleolus Of A Finite Set And The Multiobjective Discrete Programming Problems, Irinel C. Dragan

Mathematics Technical Papers - Archive

No abstract provided.

A Direct Formulation And Computer-Implementation Of A Symbolic Network Analysis Algorithm, Timothy James Knerr

Electrical & Computer Engineering Theses & Dissertations

An algorithm for the symbolic analysis of linear, time-invariant, active or passive networks is presented. The algorithm incorporates the best features of earlier numerical and topological methods of symbolic analysis. A hybrid set of equations is formulated for a closed linear graph and arranged in matrix form. A numerical evalu­ation procedure for the determinant of this hybrid matrix results in an efficient method of symbolic analysis. A proof of the algorithm based on determinant evaluation by a permutation product expansion provides insight into relationships with other methods of symbolic analysis. A computer program implementation of the algorithm is described and …

An Algorithm For The Electromagnetic Scattering Due To An Axially Symmetric Body With An Impedance Boundary Condition, F. Stenger, M. Hagmann, J. Scheing

Computer Science Faculty Publications

Let B be a body in R³, and let S denote the boundary of B. The surface S is described by S = {(x, y, z): (x² + Y²)^½= ƒ(z), -1≤ z ≤ I}, where ƒ analytic function that is real and positive on (-1, 1) and ƒ(±1) = 0. An algorithm is described for computing the scattered field due to a plane wave incident field, under Leontovich boundary conditions. The Galerkin method of solution used here leads to a block diagonal matrix involving 2M …

Algorithms For The Solution Of Systems Of Coupled Second-Order Ordinary Differential Equations, Brendan O'Shea

Articles

Several step-by-step methods for the computer solution systems of coupled second-order ordinary differential equations, are examined from the point of view of efficiency “time-wise” and “storage-wise”. Particular reference is made to a system arising in the close-coupling approximation of the Schroedinger equation. The stability of the solution is also considered.

An Efficient Dft Algorithm Using The Walsh Transform, Albert P. Gerheim

Electrical & Computer Engineering Theses & Dissertations

The matrix transformation relating the sequency and frequency domains is derived. It is shown that these­ frequency-to-frequency conversion can be performed via a computationally efficient sparse matrix algorithm. The sequency-to-frequency algorithm can be used with a fast Hadamard transform to implement a discrete Fourier trans­ form. The efficiencies of this combined algorithm and a radix-two fast Fourier transform are compared.

The algorithm is applied to the sequency domain de­ sign of a Wiener digital filter. Improved computational efficiencies are achieved relative to the procedure de­veloped by Kahveci and Hall (9).

Generalized Inverses Of Special Types Of Matrices., Rao Vara Prasada Pullepu Sree Satya Narayana Dr.

Doctoral Theses

Inverses, in the regular sense of the term, do not exist for singular square matrices and rectangular matrices. however for such matrices there exist matrices which satisfy many important properties similar to those of inverses of nonsingular matrices and for many purposes, can be used in the same way as regular inverses. These matrices are named generalised inverses (g-inverses) to distinguish then from the inverses of nonsingular matricos. Only since 1955 this field of study af generalized inverse was: invostigated systenatically and was expiorcd for nany beautiful and interesting results and applications though the concept of generalizod inverse was first …

An Algorithm For Finding All Isomorphisms Of Two Graphs, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

No abstract provided.

On The Decomposition Of Asynchronous Systems, Robert M. Keller

All HMC Faculty Publications and Research

This paper reports of part of a continuing investigation of parallel computation, in particular, efforts toward understanding the nature of different types of parallel control. The first section defines an asynchronous system to be a simple type of state machine. This was arrived at in an attempt to generalize from the types of control in parallel program schemata and networks of asynchronous modules without bounded delays. Asynchronous systems with output are also defined in a familiar way. The deviation from standard work comes in the definition of a parallel decomposition of asynchronous systems. Some preliminary work on compositions of this …