Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (24)
- Theory and Algorithms (14)
- Applied Mathematics (11)
- Engineering (8)
- Statistics and Probability (7)
-
- Discrete Mathematics and Combinatorics (6)
- Analysis (5)
- Algebra (4)
- Data Science (4)
- Electrical and Computer Engineering (4)
- Geometry and Topology (4)
- Number Theory (4)
- Other Applied Mathematics (3)
- Other Mathematics (3)
- Physics (3)
- Algebraic Geometry (2)
- Applied Statistics (2)
- Artificial Intelligence and Robotics (2)
- Arts and Humanities (2)
- Life Sciences (2)
- Numerical Analysis and Computation (2)
- Numerical Analysis and Scientific Computing (2)
- Signal Processing (2)
- Social Statistics (2)
- Social and Behavioral Sciences (2)
- Aerospace Engineering (1)
- American Studies (1)
- Animal Sciences (1)
- Institution
-
- Indian Statistical Institute (83)
- Portland State University (12)
- California State University, San Bernardino (6)
- University of Texas at Arlington (4)
- City University of New York (CUNY) (3)
-
- Claremont Colleges (3)
- Dartmouth College (3)
- Marquette University (3)
- Old Dominion University (3)
- University of Nebraska - Lincoln (3)
- Louisiana Tech University (2)
- University of Kentucky (2)
- University of South Florida (2)
- Air Force Institute of Technology (1)
- Bridgewater State University (1)
- Butler University (1)
- Chapman University (1)
- Colby College (1)
- Fort Hays State University (1)
- Georgia Southern University (1)
- Hope College (1)
- Illinois Math and Science Academy (1)
- Lindenwood University (1)
- Louisiana State University (1)
- Macalester College (1)
- Michigan Technological University (1)
- Minnesota State University, Mankato (1)
- Munster Technological University (1)
- Murray State University (1)
- Rowan University (1)
- Publication Year
- Publication
-
- Doctoral Theses (83)
- Mathematics and Statistics Faculty Publications and Presentations (8)
- Theses Digitization Project (6)
- Mathematics Technical Papers - Archive (4)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (3)
-
- All HMC Faculty Publications and Research (2)
- Dartmouth Scholarship (2)
- Dissertations and Theses (2)
- Dissertations, Theses, and Capstone Projects (2)
- Mathematics & Statistics Faculty Publications (2)
- Portland Institute for Computational Science Publications (2)
- School of Computing: Dissertations, Theses, and Student Research (2)
- Theses and Dissertations (2)
- All Graduate Theses, Dissertations, and Other Capstone Projects (1)
- Articles (1)
- Computer Science Theses & Dissertations (1)
- Dartmouth College Ph.D Dissertations (1)
- Distinguished Student Work (1)
- Doctoral Dissertations (1)
- Electronic Theses and Dissertations (1)
- Faculty Publications (1)
- Faculty Scholarship (1)
- Honors College Theses (1)
- Honors Program: Senior Projects (Public) (1)
- Honors Projects (1)
- Honors Theses (1)
- Journal of Humanistic Mathematics (1)
- LSU Doctoral Dissertations (1)
- Mathematical Sciences Faculty Research (1)
- Mathematics Faculty Publications (1)
- Publication Type
Articles 121 - 150 of 151
Full-Text Articles in Mathematics
On Lipschitzian, And Connected Matrices In: Linear Complementarity Problem., Sriparna Bandyopadhyay Dr.
On Lipschitzian, And Connected Matrices In: Linear Complementarity Problem., Sriparna Bandyopadhyay Dr.
Doctoral Theses
This dissertation deals with a number of questions related to the linear complementarity problem (LCP). Given A ∈ Rn*n and q ∈ Rnthe LCP is to find a vector z ∈ R" such that Az+q ≥0,≥ and 2'(Az + 9) = 0. There is a vast literature on LCP developed during the last four decades. LCP plays a crucial role in the study of Mathematical Progranming from the point of view of algorithms as well as applications. The questions on existence and multiplicity of solutions in LCP has led researchers to introduce and study a variety of matrix classes. Most …
Tree-Based Multicasting In Wormhole-Routed Irregular Topologies, Ran Libeskind-Hadas, Dominic Mazzoni '99, Ranjith Rajagopalan '99
Tree-Based Multicasting In Wormhole-Routed Irregular Topologies, Ran Libeskind-Hadas, Dominic Mazzoni '99, Ranjith Rajagopalan '99
All HMC Faculty Publications and Research
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number of destinations using only a single startup phase. In contrast to existing tree-based schemes, this algorithm applies to all interconnection topologies, requires only fixed-sized input buffers that are independent of maximum message length, and uses a single asynchronous flit replication mechanism. The theoretical basis of the technique used here is sufficiently general to develop other tree-based multicasting algorithms for regular and irregular topologies. Simulation results demonstrate that this tree-based algorithm provides a very promising means of …
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 …
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 …
On Three Dimensional Digital Topology And Its Application To Image Processing., Punam Kumar Saha Dr.
On Three Dimensional Digital Topology And Its Application To Image Processing., Punam Kumar Saha Dr.
Doctoral Theses
Digital topology provides a sound mathematical basis for object classification, counting and labeling, border tracking, contour filling, thinning, segmentation and many other image processing applications. An important characteristic of topo- logical properties is that they are invariant under translation, rotation, and more generally under any elastic deformation. The analysis of three dimensional (3D) digital images has generated increasing interest with the rapid growth of 3D image processing applications including computer vision. 3D digital images are common input/output media in the several application domains of image processing, pattern recognition and computer vision among which 3D medical imaging is of particular interest. …
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 …
Continuous Deformation Of A Developable Surface, Chili Ping Hsu
Continuous Deformation Of A Developable Surface, Chili Ping Hsu
Mathematics Technical Papers - Archive
A developable surface can be developed from a piece of planar region, or vice versa. Several methods are known to construct an isometric mapping between the developable and the planar region. A simple and efficient algorithm based on the differential geometry and differential equations is presented to construct such an isometric mapping. This algorithm contains a deformation parameter ^, where ^ varies between 0 and 1, that can trace the development of the surface in a fashion that ^ = 0 corresponds to the planar region and ^ = 1 recovers the developable. An error estimation shows the error, in …
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. …
Polygonal Approximation And Scale-Space Analysis Of Closed Digital Curves., Bimal Kumar Roy Dr.
Polygonal Approximation And Scale-Space Analysis Of Closed Digital Curves., Bimal Kumar Roy Dr.
Doctoral Theses
This thesis presents a series of algorithms for polygonal approximation of closed digital curves followed by scale-space analysis with its application to corner detection.Approximation of a closed curve by plece straight line segments is known as polygonal approximation. Any curve can be approximated by a polygon with any desired degree of accuracy.Polygonal approximation is useful in reducing the number of points required to represent a curve and to smooth data. Such representation facilitates extraction of numerical features for description and classification of curves. Basically there are two approaches to the problem. One is to subdivide the points into groups each …
Some Contributions To Linear Complementarity Problem., G. S. R. Murthy Dr.
Some Contributions To Linear Complementarity Problem., G. S. R. Murthy Dr.
Doctoral Theses
This dissertation deals with a number of problems related to linear comple- mentarity problem (LCP). Given a real square matrix A of order n and a real n-vector q, the LCP is to find a nonnegative n-vector z such that Az + q 2 0 and zt(Az + 9) = 0. There is vast literature on LCP, evolved during the last four decades. LCP plays a crucial role in the study of mathematical program- ming from the view point of algorithms as well as applications. The inherent nature of the problem has led the researchers to introduce and study a …
Studies On Design, Routing And Fault Tolerance Of Interconnection Network., Krishnendu Mukhopadhyay Dr.
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 …
Optimum Continuous Sampling Plans And A Few Other Sqc Problems., D Ghosh Dr.
Optimum Continuous Sampling Plans And A Few Other Sqc Problems., D Ghosh Dr.
Doctoral Theses
The wide acceptance of Statistics as a basic tool in technölogical growth, later recog- nised as a Key technology, gained ground with the pioneering work of Shewhart in 20s, introducing Statistical Quality Control (SQC) in manufacturing industry. Around the same time a solid statistical basis was being worked out for the ageold concepts of sampling inspection for industrial products. By 1930, acceptance sam- pling for lot by lot inspection was being applied in Western Electric Company and elsewhere. Since then statistical tools have been the major technical inputs of To- tal Quality Management which has spread far and wide as …
Multivalued Approach For Uncertainty Management., Deba Prasad Mandal Dr.
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 …
On Image Segmentation Using Neural Networks And Fuzzy Sets., Ashish Ghosh Dr.
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 …
Some Aspects Of Multi Source Satellite Image Processing., L. Lalitha Dr.
Some Aspects Of Multi Source Satellite Image Processing., L. Lalitha Dr.
Doctoral Theses
The observation of a target by a device plaoed at some distance from it is cal.led remote sensing as ngainst in situ sensing where the sensor is kept in contact with the target. Usually physical emanations such as the electr omagnetic radiation from the target s observed by the sensing device. Sensors mounted on aircraft or satallite platforms measure the amount of energy reflected from or emitted by the earth's surface. Sensors scan the ground below a nd to either side of the satellite platform and as the platform noves forward, an image of the earths surface is formed.A satellite …
On Some Problems In Analysis Of Covariance Structure., Sadhan Samar Maiti Dr.
On Some Problems In Analysis Of Covariance Structure., Sadhan Samar Maiti Dr.
Doctoral Theses
In recent years, the teahniques of struotural analynie of covarianoe and correlation matrioes have frequently be en employed espeed ally in the s ooial and behavioural soieno es for analysing multivariate data. Analysis of covarlance structures (ACOVS) lea; generie tem describing a variety of statistioal procedures for testing and measuring the goodnese-of-fit of certain types of struotures postulated a priori for the cova- riance matrix by plaoing al temative restriotione on the para- neter natrioes of the general model" [Mukherjee, 1976, p. 132].The aoronyn AOOVS' standa for; analyeis of covarianoe atructurea; and waa firat proposed by Book (1960) as a …
Indifference Graphs And The Single Row Routing Problem, Peter J. Looges
Indifference Graphs And The Single Row Routing Problem, Peter J. Looges
Computer Science Theses & Dissertations
This thesis investigates the subclass of interval graphs known as indifference graphs. New optimal algorithms for recognition, center, diameter, maximum matching, Hamiltonian path and domination in indifference graphs are presented. The recognition algorithm produces a linear order with properties which allow the solution of the other problems in linear time. Indifference graphs are further applied to the single row routing problem which results in both sequential,. and parallel routing algorithms.
On Image Information Measures And Object Extraction., Nikhil Ranjan Pal Dr.
On Image Information Measures And Object Extraction., Nikhil Ranjan Pal Dr.
Doctoral Theses
The field of image processing deals with the manipulation of data which are inherently two-dimensional in nature. techniques of image processing sten from two principal application The areas, namely, Improvement of pictorial information for human interpretation and processing of scene data for automatic machine perception. These areas together have experienced a vigorous growth in recent years because they have offered a number of important applications in solving scientific and engineering problems. In biological and medical sciences, we are interested in automatie analysis and interpretation of radiographs, cell images micrographs. In netallurgical, geological and and tissue environmental sciences, we are concerned …
Generalized Gradient Methods For Solving Locally Lipschitz Feasibility Problems, Dan Butnariu
Generalized Gradient Methods For Solving Locally Lipschitz Feasibility Problems, Dan Butnariu
Mathematics Technical Papers - Archive
In this paper we study the behavior of a class of iterative algorithms for solving feasibility problems, that is finite systems of inequalities [see pdf for notation], where each [see pdf for notation] is a locally Lipschitz functional on a Hilbert space X. We show that, under quite mild conditions, the algorithms studied in this note, if converge, then they approximate a solution of the feasibility given problem, provided that the feasibility problem is consistent. We prove several convergence criteria showing that, when the envelope of the functionals [see pdf for notation], is sufficiently "regular", then the algorithms converge. The …
Some Contributions To Generalized Inverse And The Linear Complementarity Problem., N. Eagambaram Dr.
Some Contributions To Generalized Inverse And The Linear Complementarity Problem., N. Eagambaram Dr.
Doctoral Theses
A generalized inverse (g-inverse) of a matrix A is a solution x to the matrix equationA XA = A(1.1.1)A g-inverse of A can be defined alternatively as a matrix x such that x = Xb is a solution to the linear equation Ax -b for any b that makes - b consistent. There is a vast literature on g-inverse. For a number of results on g-inverses and their applications one may refer to the well known books in the literature by Rao and Mitra (1971); and by Ben Israel and Greville (1974).Another inverse that lies hidden in the definition of …
On Consisten Estimation Of Classes In R2 In The Context Of Cluster Analysis., C. A. Murthy Dr.
On Consisten Estimation Of Classes In R2 In The Context Of Cluster Analysis., C. A. Murthy Dr.
Doctoral Theses
Brief reviow of oluater analysis. The literature on oluater analy ste is baaically orianted touerda the development of algori thme 1,2,3, 4, 5]. Andaxberg [1] gives the verloue stepo in aluster analy al a starting from the chai ce of data pointa to interpreting the results. Harti gan 5] desoribes veari oun cluatering algo- ri thms in hin book. He also states the ueos of tho ae methoda in vari oue fielde. Jardines end Sibaon [6] dovelopa meaoures of di ssimilarity and regerde a alustor mothod as a funotion from di andmilori tymatrlces to trees. Clustering tochniquos can ba broadly …
On A Class Of Stochastic Approximation -Type Parameter-Learning Algorithms For Pattern Recognition., Amita Pal Dr.
On A Class Of Stochastic Approximation -Type Parameter-Learning Algorithms For Pattern Recognition., Amita Pal Dr.
Doctoral Theses
The first tank can involve one or more subtasks. For instance, it may require the design of a classifier on the basis of whatever prior knowledge there is of the feature space, or given the design, to estimate efficiently the parameters of the classifier. The latter might involve the estimation of the density function itself if very little is known about the class-conditional fenture distribution, or it may necessitate the entimation of the parameters of the fenture distribution, if one can assume it to have some known form. It may also involve estimating the boundaries of the classes, if even …
Programs And Data Sets For Quasimolecular Modeling Of Cavity Flow, Donald Greenspan
Programs And Data Sets For Quasimolecular Modeling Of Cavity Flow, Donald Greenspan
Mathematics Technical Papers - Archive
No abstract provided.
Some Studies In Analysis And Recognition Of 2 Dimensional Shapes., Swapan Kumar Parui Dr.
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 …
On Some Deterministic And Stochastic Scheduling Problems., V. Rajendra Prasad Dr.
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
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.
Algorithms For The Solution Of Systems Of Coupled Second-Order Ordinary Differential Equations, Brendan O'Shea
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.