Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 4836 for “"regular"”.
-
Regular and generalized regular rings
… from a specific type of ring, which he termed a regular ring. In the first place, these rings turn out to be a generalization of artinian semisimple rings, and subsequent studies have shown that the concepts of regularity and some of its weaker and stronger forms are characterized by specific …
-
Regular Round Matroids
… to be independent. Some matroids, called regular matroids, have the property that all elements in their ground set can be represented by vectors over any field. A matroid is called round if its dual has no two disjoint minimal dependent sets. Roundness is an important property that was …
-
Comparison of Health Status Between Regular and Non-Regular Employees of University Hospitals
… measurements for health. The study subjects were regular and non-regular employees who worked at the three university hospitals located in Gyeonggi region. The researcher conducted a comparison of general characteristics between the regular and non-regular employees. THE SUBJECTS AND METHOD: Three …
-
Production of regular and non-regular verbs : evidence for a lexical entry complexity account
… been thoroughly tested by comparing the use of regular versus non-regular word forms. Regular verbs (e.g. walk-walked) are computed using a suffixation rule in a neural system for grammatical processing; non-regular verbs (run-ran) are retrieved from associative memory. The role of regularity …
-
Distance-Regular Graphs and Generalizations
… a graph with these properties is called distance-regular.
-
Regular and irregular signal resampling
… in which the input and output grids are both regularly spaced. It is known that the output signal is obtained by applying a time-varying filter to the input signal. The existing methods for finding the coefficients of this filter inherently tradeoff computational and memory requirements. …
-
On 4-Regular Planar Hamiltonian Graphs
… graph of a knot diagram can be viewed as a 4-regular planar graph. The existence of a Hamiltonian cycle in such a graph is necessary in order to use the graph to compute an upper bound on rope length for a given knot. The algorithm to generate such graphs is discussed and an exact count of the …
-
Flow Through Regular Assemblies of Spheres
Made available in DSpace on 2014-12-10T21:24:42Z (GMT). No. of bitstreams: 1 7105146.pdf: 9228397 bytes, checksum: 71fb994e40acf7180d1858ebc07bd1aa (MD5) Previous issue date: 1970
-
Flow Through Regular Arrays of Spheres
Made available in DSpace on 2014-12-10T21:24:50Z (GMT). No. of bitstreams: 1 7310081.pdf: 5796181 bytes, checksum: c828d2ab81dbe89410184afaf12b1336 (MD5) Previous issue date: 1972
-
The testability of regular logic structures
The use of regular logic structures has become very important in the recent past due to the complexity of the circuits that are being fabricated and the need to design, test and debug them. The testability of different classes of regular logic structures that are widely used in many practical …
-
Matrix-regular orders on operator spaces
Made available in DSpace on 2011-05-07T13:06:47Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9624488.pdf: 4605844 bytes, checksum: ff8ba31fb3c0ce108255c3391578726b (MD5) Previous issue date: 1995
-
On the regular slice spectral sequence
… spectral sequence of [HHR (or SSS) called the regular slice spectral sequence (or RSSS). This latter spectral sequence is defined using only the regular slice cells. We show that the regular slice tower of a spectrum is just the suspension of the slice tower of the desuspension of that …
-
Modeling reconfiguration algorithms for regular architecture
Three models are proposed to evaluate and design distributed reconfigurable systems for fault tolerant, highly reliable applications. These models serve as valuable tools for developing fault tolerant systems. In each model, cells work together in parallel to change the global structure through a …
-
Algorithms for Regular Chains of Dimension One
One of the core commands in the RegularChains library inside Maple is Triangularize. The underlying decomposes the solution set of a polynomial system into geometrically meaningful components represented by regular chains. This algorithm works by repeatedly calling a procedure, called Intersect, …
-
The Left Regular Representation of a Semigroup
As with groups, one can study the left regular representation of a semigroup. If one considers such representations, then it is natural to ask similar questions to the group case. We start by formulating several questions in the semigroup case and then work towards understanding the structure of …
-
Matchings, Connectivity, and Eigenvalues in Regular Graphs
We study extremal and structural problems in regular graphs involving various parameters. In Chapter 2, we obtain the best lower bound for the matching number over $n$-vertex connected regular graphs in terms of edge-connectedness and determine when the matching number is minimized. We also …
-
Realcompact Alexandroff spaces and regular σ-frames
In the early 1940's, A.D. Alexandroff [1940), [1941) and [1943] introduced a concept of space, more general than topological space, in order to obtain a simple connection between a space and the system of real-valued functions defined on it. Such a connection aided the investigation of the …
-
On unitary representations with regular infinitesimal character
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1986.
-
The validity problem for extended regular expressions
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1996.
Page 1 of 242