Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Education (193)
- Other Mathematics (120)
- Arts and Humanities (118)
- Science and Mathematics Education (101)
- Algebra (87)
-
- Applied Mathematics (70)
- Social and Behavioral Sciences (50)
- Geometry and Topology (42)
- Analysis (40)
- Computer Sciences (38)
- Statistics and Probability (37)
- Curriculum and Instruction (35)
- Discrete Mathematics and Combinatorics (32)
- Algebraic Geometry (31)
- History (29)
- Number Theory (29)
- Teacher Education and Professional Development (29)
- Higher Education (27)
- Logic and Foundations (27)
- Educational Assessment, Evaluation, and Research (19)
- Educational Methods (18)
- Engineering (18)
- Physics (17)
- Elementary Education (15)
- Philosophy (15)
- Set Theory (15)
- United States History (15)
- Secondary Education (14)
- Institution
-
- Indian Statistical Institute (204)
- Claremont Colleges (107)
- University of South Carolina (63)
- Illinois Math and Science Academy (44)
- University of South Florida (39)
-
- Minnesota State University Moorhead (38)
- University of Denver (38)
- University of New Mexico (38)
- Bryant University (35)
- Western Kentucky University (23)
- University of Richmond (19)
- City University of New York (CUNY) (18)
- Providence College (18)
- Bemidji State University (17)
- John Carroll University (17)
- Brigham Young University (16)
- Dordt University (15)
- Old Dominion University (13)
- California State University, San Bernardino (12)
- The College of Wooster (12)
- Walden University (12)
- Central Washington University (11)
- Georgia Southern University (11)
- Lincoln University (11)
- Bridgewater State University (10)
- Technological University Dublin (10)
- University of North Dakota (10)
- University of Rhode Island (10)
- Liberty University (9)
- Utah State University (9)
- Publication Year
- Publication
-
- Doctoral Theses (204)
- Faculty Publications (66)
- Journal of Humanistic Mathematics (63)
- Electronic Theses and Dissertations (41)
- Numeracy (39)
-
- Math Department Newsletters (38)
- Branch Mathematics and Statistics Faculty and Staff Publications (36)
- All HMC Faculty Publications and Research (26)
- Honors Projects in Mathematics (22)
- Open Educational Resources (22)
- Theses and Dissertations (21)
- Mathematics & Computer Science Student Scholarship (17)
- Series (17)
- Department of Math & Statistics Faculty Publications (16)
- Masters Essays (16)
- Manuscript Collection Finding Aids (15)
- Faculty Work Comprehensive List (14)
- Senior Independent Study Theses (12)
- Math for Girls Day Documents (11)
- Walden Dissertations and Doctoral Studies (11)
- Mathematics Graduate Theses (9)
- Mathematics: Faculty Scholarship (9)
- All Master's Theses (8)
- Honors Capstones (8)
- Honors Program Theses and Projects (8)
- Journal of Undergraduate Research (8)
- Master's Theses or Doctor of Nursing Practice (8)
- Mathematics & Statistics Faculty Publications (7)
- Dartmouth Scholarship (6)
- Dissertations (6)
- Publication Type
- File Type
Articles 961 - 990 of 1170
Full-Text Articles in Mathematics
New Topologies And Parallel Algorithms For Static Interconnection Networks., Srabani Sen Gupta Dr.
New Topologies And Parallel Algorithms For Static Interconnection Networks., Srabani Sen Gupta Dr.
Doctoral Theses
Many real-life applications in the areas of signal processing, image processing, etc., require a large amount of fast computations to be performed. Although high speed powerful processors are currently available due to the phenomenal advances in VLSI technology, the increasing demand for massive real-time computations can not be met just by a uniprocessor system. One way of achieving the goal of fast computation is through parallel processing. In parallel processing, a problem is broken into several subproblems, which are distributed among different processors so that each of the processors can perform its task simultaneously. Main areas of recent research in …
Some Problems In Estimating Finite Population Total And Variance In Survey Sampling., Saswati Bhattacharya Dr.
Some Problems In Estimating Finite Population Total And Variance In Survey Sampling., Saswati Bhattacharya Dr.
Doctoral Theses
The problem of drawing inference concerning the parameters of a finite population of identifiable units has been increasingly engaging the attention of statisticians. The central problem here is to devise a suitable method of selecting a sample from the population and to employ an appropriate estimator to estimate the finite population total or mean. A consider- able progress in this field of study has been made and many authors have contributed towards the development of the theory in this aspect of the problem of statistical inferenceNumerous papers have been written covering the first aspect of the problem, namely, method of …
Pompeiu Problem And Analogues Of The Weiner-Tauberian Theorem For Certain Homogeneous Spaces., Rama Rawat Dr.
Pompeiu Problem And Analogues Of The Weiner-Tauberian Theorem For Certain Homogeneous Spaces., Rama Rawat Dr.
Doctoral Theses
Let G be a connected locally compact unimodular group acting transitively on a locally compact space X. For a function f on X and g € G, define of by 9f(x) = fA 9.a), a € X. One of the recurring themes in analysis is the question of when a function f in a given function space F(X) will have property that Span{gf : g € G} is dense in F(X). If X = R and G = R, the celebrated Wiener-Tauberian theorem answers this question completely for the space L1(R): The span of the translates of fE L1(R) is …
Using The Simplex Code To Construct Relative Difference Sets In 2-Groups, James A. Davis, Surinder K. Sehgal
Using The Simplex Code To Construct Relative Difference Sets In 2-Groups, James A. Davis, Surinder K. Sehgal
Department of Math & Statistics Faculty Publications
Relative Difference Sets with the parameters (2a, 2b, 2a, 2a-b) have been constructed many ways (see [2], [3], [5], [6], and [7] for examples). This paper modifies an example found in [1] to construct a family of relative difference sets in 2-groups that gives examples for b = 2 and b = 3 that have a lower rank than previous examples. The Simplex code is used in the construction.
Σary, Moorhead State University, Mathematics Department
Σary, Moorhead State University, Mathematics Department
Math Department Newsletters
No abstract provided.
The Fixed Point Index As A Local Lefschetz Number., Neeta Pandey Dr.
The Fixed Point Index As A Local Lefschetz Number., Neeta Pandey Dr.
Doctoral Theses
In this thesis we defitne a class of self maps of connected compact polyhodza - those which prmserve erpanding directions - and define the fixed point indices of such maps at an isolated set of fixed points of the map as a local Lefschets rumber. Our definition uses simplicial approximations of the given map in the spirit of O Nell (I19| and Fournier (71) and is intrinsic so that it is computable.Let X be a connected compact polyhedron and f:X→ X be a map an X. The Lefscheta number L() of / is then defined to be ([13]),L) -E(-1)jTrace {, …
On Some Problems Related To Hermite And Laguerre Expansions., P. K. Ratnakumar Dr.
On Some Problems Related To Hermite And Laguerre Expansions., P. K. Ratnakumar Dr.
Doctoral Theses
The first three chapters of this thesis are concerned with the spherical means associated to the Hermite and Laguerre expansions. The study of spherical means has a very long history. The classic work of F. John deals with various applications of the spherical means to the theory of partial differential equations. They entered Fourier analysis with the celebrated theorem of E. Stein on spherical analogue of the Lebesgue differentiation theorem. Ever since they have appcared again and again in several areas of analysis like integral geometry, inversion of Fourier transforms and related arcas.
On Cvt Minimization In Single Machine Scheduling., D. K. Manna Dr.
On Cvt Minimization In Single Machine Scheduling., D. K. Manna Dr.
Doctoral Theses
Scheduling problens are quite common in real life. They arise whenever there is a need to plan execution of various tasks over time and therefore they play very important roles in commercial set-ups concerning manufacturing or service in the optimal use of resources and/or customers satisfaction. The theory of scheduling deals with the construction of suitable models and their analyses. Researchersattention was drawn to the study of scheduling problems using mathematical modeling, probably for the first time when Johnson (1954] published his famous work on flowshop problem. Since then, the study of scheduling problem and its context has gradually attracted …
Fourier Transforms Of Very Rapidly Decreasing Functions On Certain Lie Groups., M. Sundari Dr.
Fourier Transforms Of Very Rapidly Decreasing Functions On Certain Lie Groups., M. Sundari Dr.
Doctoral Theses
Recall that for a function f ϵ L1(Rn ), its Fourier transform fÌ‚ is definedby: fÌ‚ (ƹ) = ʃ Rnf(x)ei(ƹ,x)dx ( 0.1.1)where (.,.) denotes the standard inner product on Rn and dr the Lebesgue measure on Rn. A celebrated theorem of L. Schwartz asserts that a function f on Rn is rapidly decreasing (or in the Schwartz class ) if and only if its Fourier transform is rapidly decreasing . In sharp contrast to Schwartz s theorem, is a result due to Hardy ([18) which says that ʃ and fÌ‚ cannot both be very rapidly decreasing . More precisely, if …
Recurrence And Transience Of Reflecting Diffusions., S. Balaji Dr.
Recurrence And Transience Of Reflecting Diffusions., S. Balaji Dr.
Doctoral Theses
An attempt to obtain conditions for certain stability properties of reflecting diffusions in unbounded domains with boundary has been made in this thesis. For diffusions in R', such stability properties like recurrence, transience and positive recurrence have been studied extensively; see Bhattacharya (1978), Kliemann (1987), Pinsky (1987). One might see Pinsky (1995) for an up-to-date review of kuown methods and results in this all case. (For corresponding recurrence classification results on Markov chains using martin- gale ideas based on stoxchastic analogues of Lyapunov functions, see Meyn and Tweedie (1993a), (1993b) and the references given therein). The main concern in this …
The Duals Of Warfield Groups, Peter Loth
The Duals Of Warfield Groups, Peter Loth
Mathematics Faculty Publications
A Warfield group is a direct summand of a simply presented abelian group. In this paper, we describe the Pontrjagin dual groups of Warfield groups, both for the p-local and the general case. A variety of characterizations of these dual groups is obtained. In addition, numerical invariants are given that distinguish between two such groups which are not topologically isomorphic.
Collected Papers, Vol. 2, Florentin Smarandache
Collected Papers, Vol. 2, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
No abstract provided.
Some Problems Of Continuum Percolation., Anish Sarkar Dr.
Some Problems Of Continuum Percolation., Anish Sarkar Dr.
Doctoral Theses
The model of continuum percolation can be described as follows. We start with a homogeneous Poisson point process X. At each point of X we centre a ball with a random radius such that the radii corresponding to different points are independent of each other and also independent of the Poisson process X. In this way, the space is divided into two regiorns, the covered region or the occupied region consisting of the region which is covered by at least one ball, and the uncovered region or the vacant region which is complement of the covered region. In this dissertation …
Design,Analysis And Routing In Static Interconnection Networks., Rajib Kumar Das Dr.
Design,Analysis And Routing In Static Interconnection Networks., Rajib Kumar Das Dr.
Doctoral Theses
Many real-life applications such as image processing, weather forecasting, digital signal processing, etc., require large amount of computations. By distributing the task among several processors, one can appreciably reduce the computation time. To solve complex problems, several computer architectures using multiple processors have been introduced. Recent developments in IC technology have made it economically feasible to construct multiple processor systems consisting of hundreds or thousands of processors.There are two types of multiprocessor systems (PS87). One is tightly coupled, where the processors share a common clock and/or memory. The other is loosely coupled, where each processor runs independently with a local …
Σary, Moorhead State University, Mathematics Department
Σary, Moorhead State University, Mathematics Department
Math Department Newsletters
No abstract provided.
Some Problems In Joint Spectral Theory., Tirthankar Bhattacharya Dr.
Some Problems In Joint Spectral Theory., Tirthankar Bhattacharya Dr.
Doctoral Theses
No abstract provided.
A Note On Generators Of Least Degree In Gorenstein Ideals, Matthew Miller, Rafael H. Villarreal
A Note On Generators Of Least Degree In Gorenstein Ideals, Matthew Miller, Rafael H. Villarreal
Faculty Publications
No abstract provided.
Paracompact Subspaces In The Box Product Topology, Peter Nyikos, Leszek Piatkiwicz
Paracompact Subspaces In The Box Product Topology, Peter Nyikos, Leszek Piatkiwicz
Faculty Publications
No abstract provided.
Mathematical Rebuses, Florentin Smarandache
Mathematical Rebuses, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
No abstract provided.
On Texture Image Analysis Using Fractal Geometry Based Features., Nirupam Sarkar Dr.
On Texture Image Analysis Using Fractal Geometry Based Features., Nirupam Sarkar Dr.
Doctoral Theses
Visual textureTexture is a property to characterize a region of a scene. A set of natural texture images is shown in Fig. 1.1. A specific texture may be generated due to certain organization of several objects in a region, or due to the reflectance pattern caused by color variation or unevenness of an object surface. Since texture provides a lot of information of a region, texture analysis and synthesis are important components of digital image processing.It is difficult to provide a formal definition of texture although we perceive and recognize texture rather easily. According to Sklansky [152) "A region in …
Neuro-Fuzzy Models For Classification And Rule Generation., Sushmita Mitra Dr.
Neuro-Fuzzy Models For Classification And Rule Generation., Sushmita Mitra Dr.
Doctoral Theses
Machine recognition [1, 2] of patterns can be viewed as a two-fold task, consisting of learning the invariant and common properties of a set of samples characterizing a class, and of deciding a new sample as a possible member of the class by noting that it has properties common to those of the set of samples. In other words, pattern recognition by computers can be described as a transformation from the measurenment space M to the feature space F and finally to the decision space D (1), i.e., M ⟶F⟶D.Here, the mapping 6 : F⟶D is the decision function and …
Connectionist Models For Certain Tasks Related To Object Recognition., Jayanta Basak Dr.
Connectionist Models For Certain Tasks Related To Object Recognition., Jayanta Basak Dr.
Doctoral Theses
Recognition of objects in an image, according to Suetens et al. [1), relers to the task of finding and labeling parts of a two-dimensional image of a scene that correspond to the real objects in the scene. Object recognition is necessary in a variety of domains like robot navigation, aerial imagery analysis, industrial inspection and so on. Normally, different strategies for object recognition (1-(5] involve establishing some model for each object, i.e., some general description of each object, and then labeling different parts of the scene according to the knowledge about the models.Object models can have two-dimensional (2D) or three-climensional …
On Detection And Use Of Reflectional Symmetry In Computer Vision., Dipti Prasad Mukherjee Dr.
On Detection And Use Of Reflectional Symmetry In Computer Vision., Dipti Prasad Mukherjee Dr.
Doctoral Theses
The problems of detection and use of reflectional symmetry in the images of planar shape contours are studied. Symmetry, in general, provides important shape representation cues, some of which we utilise here, to acquire viewpoint information and, towards model based shape matching. We concentrate on local reflectional symmetries of emoothly curved planar objecta, though the methoda are equally applicable to polygonal objects; even this could be extended to certain three-dimensional shapes and for other object relations such as rotational symmetry.Under the affine or perspective approximation to image projection, properties of geometrie invariance are used to find (reflectional) symmetric contour pairs. …
On The Equivalence Of Certain Consequences Of The Proper Forcing Axiom, Peter Nyikos, Leszek Piatkiwicz
On The Equivalence Of Certain Consequences Of The Proper Forcing Axiom, Peter Nyikos, Leszek Piatkiwicz
Faculty Publications
No abstract provided.
Σary, Moorhead State University, Mathematics Department
Σary, Moorhead State University, Mathematics Department
Math Department Newsletters
No abstract provided.
A Reverse Isoperimetric Inequality, Stability And Extremal Theorems For Plane-Curves With Bounded Curvature, Ralph Howard, Andrejs Treibergs
A Reverse Isoperimetric Inequality, Stability And Extremal Theorems For Plane-Curves With Bounded Curvature, Ralph Howard, Andrejs Treibergs
Faculty Publications
No abstract provided.
Essays In Dynamic Games., Saikat Datta Dr.
Essays In Dynamic Games., Saikat Datta Dr.
Doctoral Theses
This thesis contains four essays which broadly come under the area of Dynamic Games. All the essays involve developments or applications of non-cooperative equilibrium concepts to games played over infinite horizons. The two essays in Chapter 2 and Chapter 3 involve the concept of renegotiation proof equilibriain repeated games. The essay in Chapter 4 discusses how a social norm of slow building of trust in bilateral relationships can be understood as a social equi- librium even in the absence of asymmetric information problems. Chapter 5, which represents joint work with Prabal Raychaudhuri, applies non-cooperative bargaining theory to a context where …
Sensible Rules For Remembering Duals -- The S-O-B Method, Arthur T. Benjamin
Sensible Rules For Remembering Duals -- The S-O-B Method, Arthur T. Benjamin
All HMC Faculty Publications and Research
We present a natural motivation and simple mnemonic for creating the dual LP of any linear programing problem.
Computer Squares And Principal Graphs Of Subfactors., Uma Krishnan Dr.
Computer Squares And Principal Graphs Of Subfactors., Uma Krishnan Dr.
Doctoral Theses
This thosin in devoted to the study of aome probloms related to the inclusion of a pair of (usually hyperfinite) Ili factors R. Specifically, the following and the relation between them are studied:(a) pairs of graphs which can occur as principal grapha for NC M;(b) construction of commuting squares starting with a pair of finite graphs;(c) computation of the higher relative commutants of sublactorn con- structed from specific commuting squares.The first chapter is introductory in nature and is included for the sake of comploteness and convenience of reference. It contains a rather perfunctory description of the basic construction for a …
Asymptotic Properties Of Posterior Distributions And Study Of Some Nonregular Cases., Subhashis Ghosal Dr.
Asymptotic Properties Of Posterior Distributions And Study Of Some Nonregular Cases., Subhashis Ghosal Dr.
Doctoral Theses
The asymptotic approach to statistical estimation is frequently adopted be cause of ita general applicability and relative simplicity. The modern study of asymptotic theory, initiated in Le Cam (1953), has undergone a vigorous devel- opment through the classic works of Le Cam, Hájek, Bahadur, Ibragimov and Has'minskii (Khas'minskii), Bickel, Pfanzagl, Millar and many other scholars; see Le Cam (1986), Le Cam and Yang (1990), Ibragimov and Has'minskii (1981) and the review article by Ghosh (1985) for an account of this development.Most of the results in asymptotic theory of estimation are obtained under the classical Cramér-Rao type regularity conditions or their …