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 1171 - 1200 of 1369

Full-Text Articles in Physical Sciences and Mathematics

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

Model And Design-Based Analysis Of Complex Surveys., Joydip Mitra Dr. Dec 1994

Model And Design-Based Analysis Of Complex Surveys., Joydip Mitra Dr.

Doctoral Theses

We consider estimating the total Y of a variable y defined on a survey population. The survey is complex only in the sense that we admit sample selection with arbitrary probabilities. Our 'analysis' consists in examining efficacies of conf Idence intervals for the For this we need point estimators and or mean square error (MSE) variance { estimators, respectively say, total. the corresponding e and v. The distribution, resulting from repeated sampling, of the pivotal quantity d = (e-Y)/V 1s supposed to approximate that of standard normal deviate t or of Students t with (n-1) degrees of freedom, assuming large …

Go to article

Studies On Design, Routing And Fault Tolerance Of Interconnection Network., Krishnendu Mukhopadhyay Dr. Sep 1994

Studies On Design, Routing And Fault Tolerance Of Interconnection Network., Krishnendu Mukhopadhyay Dr.

Doctoral Theses

A recent trend in computing is to distribute the computations among a set of processing elements. There are two basic appronches to this - one is to build a loosely-coupled system and the other is to form a tightly-coupled system [PS85].In a loosely-coupled system, the processors do not share common memory or a common clock; but sharing of important resources like data files, softwares, special hardware components etc., is possible without duplicating the resources themselves. The processing nodes may even be geographicully separated from each other and are connected through databuses, telephone/radio links, satellite, etc. Such loosely- coupled systems are …

Go to article

Σary, Moorhead State University, Mathematics Department May 1994

Σary, Moorhead State University, Mathematics Department

Math Department Newsletters

No abstract provided.

Go to article

Retiling A Colored Hexagonal Plane, Kari Kelton Apr 1994

Retiling A Colored Hexagonal Plane, Kari Kelton

Mahurin Honors College Capstone Experience/Thesis Projects

No abstract provided.

Go to article

Markov Dilation Of Nonconservative Quantum Dynamical Semigroups And Quantum Boundary Theory., B. V. Rajarama Bhat Dr. Mar 1994

Markov Dilation Of Nonconservative Quantum Dynamical Semigroups And Quantum Boundary Theory., B. V. Rajarama Bhat Dr.

Doctoral Theses

In classical probability theory, based on Kolmogorov consistency theorem, one can associate a Markov process to any one parameter semigroup of stochastic matrices or transition probability operators. It is indeed the foundation for the theory of Markov processes. Here a quantum version of this theorem has been established. This effectively answers some of the questions raised by P. A. Meyer in his book (see page 220 of (Me).It is widely agreed upon that irreversible dynamics in the quantum setting is de- scribed by contractive semigroups of completely positive maps on C" algebras ([Kr). (AL]). In other words these semigroups, known …

Go to article

Some Limit Theorem On Conditional U-Statistics And Censored Data Non Parametric Regression., Arusharka Sen Dr. Feb 1994

Some Limit Theorem On Conditional U-Statistics And Censored Data Non Parametric Regression., Arusharka Sen Dr.

Doctoral Theses

In Statistics, a classical problem is that of estimating the regression function which is defined as m{t) := E(Y|X = ), te R, for two random variables X and Y such that EY < 0o. The estimators are constructed iased on a sample {(Xi, Yi.)}, 1sis n,n 2 1, from the distribution of (X, Y). Throughout this thesis, we assume X and Y to be real-valued for the sake of convenience. The classical approach to this problem is to assume a parametrized, polynomial form for nt-), i.e., m(t) := Bo + E-1 P,ti, p 21, and obtain estimates of the unknown paraineters Bo, Bj,, 1sjsp. Later, with the development of techıniques for non-parametrie density estimation, it was sought to extend these techniques to regression estimation. Heuristically, the two problems can be seen to be related as follows : let fi(-) be the marginal density of X and note that E1(X S x) = h(t)dt, z € R, whereas EY 1(X Sx) = m(t)fi(t)dt, x E MR. (1.0.2) In other wordds, (1.0.1) can be looked upon as a special case of (1.0.2), with Y = 1. + similarity, as we shall see later on, has been the underlying theme in Chapters 2 and 4 of the present work.) The following non-parametric regression estimator was proposed independently by Nadaraya (1964) and Watson (1964): "(): := m.(Y,)/m.(1, ), te R, (1.0.3) where m,(Y, t) = (nan)- E-, Y;K((t - X:)/an). (1.0.4) m,(1,1) (na,)-E, K((I - X)/a,). Here K(), the so-called kernel function, is chosen to satiafy various analytical conditions (typically, K(-) is taken to be a density function), and a, 1 0 are the bandwidths which go to zero sufficiently slowly (e.g., na,0o as n00) in order to ensure consistency of the estimator mW (). The intuition behind such an estimator is that m,(Y,) is an estimator of mt-)fi() while m,(1,) cstimates the density fa(-). See Prakasa Rao (1983), Chapters 1-4. for an introduction to non-parametric density and regression estimation. Now, m(t) is a functional of the conditional distribution of Y, given X = t. A natu- ral generalisation of the regression estimation problem seems to be the estimation of the following functionals: mh(t1,....tk) := E{h(Y1,.....Yk) | X1, = t1.,Xk. = tk), (t....) € R*, k 2 1, (1.0.5) where h: R*- R is such that Elh(Y...., Y) < 0. A similar generalisation led Hoelfding (1948) from the sample mcan to the theory of so-called U-statistics, in the uncondilional set-up. The estimation of (1.0.5) were considerexl, for the first time in published form, in Stute (1991) where the following conditional U-statistics were proposed as estimators;where Fn(-) := n-1E, 1(Xi; < ) denotes the empirical distribution function (c.d.f Bochynek discussed the asymptotic normality of conditional U- and V-statistics and pei formed simulation studies on them. Stute (1991) established weak and strong pointwis consistency and asymptotic normality of U(t). Liero (1991) studied uniform strong con sistency of conditional U-statistics and established asymptotic normality of the integrate squared error (ISE) statistic:for suitable A c R* and weight function w(-). We quote the following examples to illustrate the possible use of conditional U-statistics See Stute (1991) and Bochynek (1987) for other examples. Throughout this thesis, our set up will be as foliows: {(Xn, Yn)}n>ı is a bi-variate i.i.d sequence, with (X1, Y1) having join density f(,-) and X, having marginal density fi(-). Consequently,

Go to article

Multivalued Approach For Uncertainty Management., Deba Prasad Mandal Dr. Feb 1994

Multivalued Approach For Uncertainty Management., Deba Prasad Mandal Dr.

Doctoral Theses

Real life problems are rarely free from uncertainty which usually emerges from the deficiencies of information available from a situation. The defi- ciencies may result from incomplete, imprecise, not fully reliable, vague or contradictory information depending on the problem. Management of uncer- tainty in a decision making system has been an important research problem for many years.Until the inception of the concept of fuzzy set theory in 1965 (1), the theory of probability and statistics was the primary mathematical tool for modeling uncertainty in a system/situation. Fuzzy set theory has shown enormous proinise in handling uncertaintics to a reasonable extent …

Go to article

Hypergroup Graphs And Subfactors., A. K. Vijayarajan Dr. Feb 1994

Hypergroup Graphs And Subfactors., A. K. Vijayarajan Dr.

Doctoral Theses

The main theme of this t hesis is hypergroups. In this thesis the the- ory of hypergroups is applied to study the relation between certain graphs and subfactors of II, factors in the context of principal graphs associated with the inclusions of II, factors. More general classes of hypergroups are iutroduced, new examples of hypergroups associated to certain graphs are coustructed and classification of small order hypergroups is discussed.The text of the thesis is arranged in four chapters. The first chapter is on preliminaries of the theory of hypergroups, the second on the appli- cation of the theory of hyjrrgroups …

Go to article

Discrete Singularity Method And Its Application To Incompressible Flows., S K. Venkatesan Dr. Feb 1994

Discrete Singularity Method And Its Application To Incompressible Flows., S K. Venkatesan Dr.

Doctoral Theses

The smooth flow of a fluid has sprung many surprises. A flow which at an instant of time is quite regular and orderly could produce on the slightest of disturbance a complex bewildering varieties of flows, broadly termed as turbulence. Direct numerical simulation of the Navier-Stokes equations have shown that it is quite possible that these turbulent flows are solutions of the Navier-Stokes equations. In fact it is by now well recognized that many non-linear systems produce chaos quite similar to turbulence. However the large number of scales and their complex interactions involved make turbulence difficult to understand. Direct numerical …

Go to article

Parametric Homotopy Principle Of Some Practical Differential Relations., Mahuya Datta Dr. Feb 1994

Parametric Homotopy Principle Of Some Practical Differential Relations., Mahuya Datta Dr.

Doctoral Theses

A system uf r-th order partial differential inequalities is a subspace in the space of r-jets of CT" maps between manifolds. The problem of homotopy classification of C solutions of such systems is stauliel in this thesis. The text roughly divides into two parts. In the first part, the problem is considered in an equivariant setting when the system is open and invariant under the action of a compact L.ie group, but may not be invariant under the action of the pseudogroup of equivariant local diffeomorphisms. The second part concerns a non-equivariant set-up without the openness condition on the systern. …

Go to article

Study Of Moduli Of Bundles., Indranil Biswas Dr. Feb 1994

Study Of Moduli Of Bundles., Indranil Biswas Dr.

Doctoral Theses

Hitchin (Hi2) realized the importance of studying pairs (E,∅) where E is a vector bundle and ∅ is a homomorphism of E into EOL for a fixed line bundle L. When C is a smooth pro jective algebraic curve this has since been studied quite extensively. One can construct a covering of C in this situation and the given data can be completely recovered by this covering map and a line bundle on the covering curve (see Beauville, Narasimhan and Ramanan (BNR]). When L is the canonical bundle this procedure gives a completely integrable system on the cotangent bundle of …

Go to article

Hyperinvariant Subspaces Of The Harmonic Dirichlet Space, William T. Ross, Stefan Richter, Carl Sundberg Jan 1994

Hyperinvariant Subspaces Of The Harmonic Dirichlet Space, William T. Ross, Stefan Richter, Carl Sundberg

Department of Math & Statistics Faculty Publications

No abstract provided.

Go to article

On Image Segmentation Using Neural Networks And Fuzzy Sets., Ashish Ghosh Dr. Nov 1993

On Image Segmentation Using Neural Networks And Fuzzy Sets., Ashish Ghosh Dr.

Doctoral Theses

During the last five decades or even more a large number of researchers are trying to design intelligent systems to perform tasks at which human beings are more efficient at present. One of the most important behavioral tasks in which human beings show their expertise is image analysis or recognition; where a large amount of pictorial data is processed in a very small amount of time (called real time). Widespread attempts have been made to develop intelligent systems (under different names, like pattern recognition system, image under- standing system, computer vision system etc.) for pictorial pattern analysis and recognition. The …

Go to article

Stacking Ellipses -- Revisited, Calvin Jongsma Nov 1993

Stacking Ellipses -- Revisited, Calvin Jongsma

Faculty Work Comprehensive List

Response to the article “Stacking Ellipses” by Richard E. Pfiefer in The College Mathematics Journal, Vol. 22, No. 4 (Sep., 1991), pp. 312-313.

Go to article

On Markov Processes Charecterised Via Martingale Problem., Abhay G. Bhatt Dr. Oct 1993

On Markov Processes Charecterised Via Martingale Problem., Abhay G. Bhatt Dr.

Doctoral Theses

Martingale approach to the study of finite dimensional diffusions was initiated by Stroock-Varadhan, who coined the term martingale problem. Their success led to a similar approach being used to study Markov processes occuring in other areas such as infinite particle systems, branching processes, genetic models, density dependent population processes, random evolutions etc.Suppose X is a Markov process corresponding to a semigroup (T)e20 with generator L. Then all the information about X is contained in L. We also have thatMf(t) := f(X(t)) – ∫t0 Lf(X(s))dsis a martingale for every f ∈ D(L). i.e. X is a solution to the martingale problem …

Go to article

First Prev Next Last