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

Physical Sciences and Mathematics Commons™

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

Mathematics

Discipline
Institution
Publication Year
Publication
Publication Type
File Type

Articles 1201 - 1230 of 1412

Full-Text Articles in Physical Sciences and Mathematics

The Fixed Point Index As A Local Lefschetz Number., Neeta Pandey Dr. Feb 1997

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 {, …

Go to article

On Some Problems Related To Hermite And Laguerre Expansions., P. K. Ratnakumar Dr. Feb 1997

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.

Go to article

On Cvt Minimization In Single Machine Scheduling., D. K. Manna Dr. Feb 1997

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 …

Go to article

Fourier Transforms Of Very Rapidly Decreasing Functions On Certain Lie Groups., M. Sundari Dr. Feb 1997

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 …

Go to article

Recurrence And Transience Of Reflecting Diffusions., S. Balaji Dr. Feb 1997

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 …

Go to article

Arboreal Adventure: A Cross Curricular Unit On Trees, Anne Elizabeth Boshoven Jan 1997

Arboreal Adventure: A Cross Curricular Unit On Trees, Anne Elizabeth Boshoven

Theses Digitization Project

No abstract provided.

Go to article

The Duals Of Warfield Groups, Peter Loth Jan 1997

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.

Go to article

The Laws Of Complexity & The Complexity Of Laws: The Implications Of Computational Complexity Theory For The Law, Eric Kades Jan 1997

The Laws Of Complexity & The Complexity Of Laws: The Implications Of Computational Complexity Theory For The Law, Eric Kades

Faculty Publications

No abstract provided.

Go to article

Collected Papers, Vol. 2, Florentin Smarandache Jan 1997

Collected Papers, Vol. 2, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Go to article

Some Problems Of Continuum Percolation., Anish Sarkar Dr. Dec 1996

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 …

Go to article

Design,Analysis And Routing In Static Interconnection Networks., Rajib Kumar Das Dr. Jul 1996

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 …

Go to article

Σary, Moorhead State University, Mathematics Department May 1996

Σary, Moorhead State University, Mathematics Department

Math Department Newsletters

No abstract provided.

Go to article

Some Problems In Joint Spectral Theory., Tirthankar Bhattacharya Dr. Mar 1996

Some Problems In Joint Spectral Theory., Tirthankar Bhattacharya Dr.

Doctoral Theses

No abstract provided.

Go to article

A Note On Generators Of Least Degree In Gorenstein Ideals, Matthew Miller, Rafael H. Villarreal Feb 1996

A Note On Generators Of Least Degree In Gorenstein Ideals, Matthew Miller, Rafael H. Villarreal

Faculty Publications

No abstract provided.

Go to article

Paracompact Subspaces In The Box Product Topology, Peter Nyikos, Leszek Piatkiwicz Jan 1996

Paracompact Subspaces In The Box Product Topology, Peter Nyikos, Leszek Piatkiwicz

Faculty Publications

No abstract provided.

Go to article

Mathematical Rebuses, Florentin Smarandache Jan 1996

Mathematical Rebuses, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Go to article

On Texture Image Analysis Using Fractal Geometry Based Features., Nirupam Sarkar Dr. Nov 1995

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 …

Go to article

Neuro-Fuzzy Models For Classification And Rule Generation., Sushmita Mitra Dr. Oct 1995

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 …

Go to article

Connectionist Models For Certain Tasks Related To Object Recognition., Jayanta Basak Dr. Sep 1995

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 …

Go to article

On Detection And Use Of Reflectional Symmetry In Computer Vision., Dipti Prasad Mukherjee Dr. Jul 1995

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. …

Go to article

On The Equivalence Of Certain Consequences Of The Proper Forcing Axiom, Peter Nyikos, Leszek Piatkiwicz Jun 1995

On The Equivalence Of Certain Consequences Of The Proper Forcing Axiom, Peter Nyikos, Leszek Piatkiwicz

Faculty Publications

No abstract provided.

Go to article

Σary, Moorhead State University, Mathematics Department May 1995

Σary, Moorhead State University, Mathematics Department

Math Department Newsletters

No abstract provided.

Go to article

A Reverse Isoperimetric Inequality, Stability And Extremal Theorems For Plane-Curves With Bounded Curvature, Ralph Howard, Andrejs Treibergs Apr 1995

A Reverse Isoperimetric Inequality, Stability And Extremal Theorems For Plane-Curves With Bounded Curvature, Ralph Howard, Andrejs Treibergs

Faculty Publications

No abstract provided.

Go to article

Essays In Dynamic Games., Saikat Datta Dr. Mar 1995

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 …

Go to article

Sensible Rules For Remembering Duals -- The S-O-B Method, Arthur T. Benjamin Mar 1995

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.

Go to article

Computer Squares And Principal Graphs Of Subfactors., Uma Krishnan Dr. Feb 1995

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 …

Go to article

Asymptotic Properties Of Posterior Distributions And Study Of Some Nonregular Cases., Subhashis Ghosal Dr. Feb 1995

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 …

Go to article

Optimal Klappenspiel, Arthur T. Benjamin, Derek Stanford '93 Jan 1995

Optimal Klappenspiel, Arthur T. Benjamin, Derek Stanford '93

All HMC Faculty Publications and Research

The game Klappenspiel ("flipping game") is a traditional German game of flipping tiles according to dice rolls. In this paper, we derive the optimal strategy for this game by using dynamic programming. We show that the probability of winning using the optimal strategy is 0.30%.

Go to article

Metode De Calcul În Analiza Matematică, Florentin Smarandache, C. Dumitrescu Jan 1995

Metode De Calcul În Analiza Matematică, Florentin Smarandache, C. Dumitrescu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Go to article

Calibration Of A Conceptual Rainfall-Runoff Model Using Simulated Annealing, Neil R. Sumner Jan 1995

Calibration Of A Conceptual Rainfall-Runoff Model Using Simulated Annealing, Neil R. Sumner

Theses: Doctorates and Masters

Simulated annealing (Kirkpatrick et al, 1983) is used to estimate the parameters of a mathematical model that predicts the water yield from a catchment. The calibration problem involves finding the global minimum of a multivariate function that has many extraneous local minima, a situation in which conventional optimisation methods are ineffective. The objective function which quantifies discrepancies between the computed and observed streamflows must be carefully selected to satisfy the least square assumptions. Several published simulated annealing algorithms have been implemented, tested and evaluated using standard test functions. Appropriate cooling schedules are found for each algorithm and test function investigated. …

Go to article

First Prev Next Last