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 91 - 120 of 151
Full-Text Articles in Mathematics
Lectures In Computational Fluid Dynamics Of Incompressible Flow: Mathematics, Algorithms And Implementations, James M. Mcdonough
Lectures In Computational Fluid Dynamics Of Incompressible Flow: Mathematics, Algorithms And Implementations, James M. Mcdonough
Mechanical Engineering Textbook Gallery
From Prologue:
The present lecture notes are written to emphasize the mathematics of the Navier–Stokes (N.–S.) equations of incompressible flow and the algorithms that have been developed over the past 30 years for solving them.
Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr.
Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr.
Doctoral Theses
The linear complementarity problem is a fundamental problem that arises in optimization, game theory, economics, and engineering. It can be stated as follows:Given a square matrix A of order n with real entries and an n dimensional vector q, find n dimensional vectors w and z satisfying w − Az = q, w ≥ 0, z ≥ 0 (1.1.1) w t z = 0. (1.1.2)This problem is denoted as LCP(q, A). The name comes from the condition (1.1.2), the complementarity condition which requires that at least one variable in the pair (wj , zj ) should be equal to 0 …
Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.
Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.
Doctoral Theses
No abstract provided.
The Evolution Of Equation-Solving: Linear, Quadratic, And Cubic, Annabelle Louise Porter
The Evolution Of Equation-Solving: Linear, Quadratic, And Cubic, Annabelle Louise Porter
Theses Digitization Project
This paper is intended as a professional developmental tool to help secondary algebra teachers understand the concepts underlying the algorithms we use, how these algorithms developed, and why they work. It uses a historical perspective to highlight many of the concepts underlying modern equation solving.
The Convergence Of V-Cycle Multigrid Algorithms For Axisymmetric Laplace And Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak
The Convergence Of V-Cycle Multigrid Algorithms For Axisymmetric Laplace And Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak
Mathematics and Statistics Faculty Publications and Presentations
We investigate some simple finite element discretizations for the axisymmetric Laplace equation and the azimuthal component of the axisymmetric Maxwell equations as well as multigrid algorithms for these discretizations. Our analysis is targeted at simple model problems and our main result is that the standard V-cycle with point smoothing converges at a rate independent of the number of unknowns. This is contrary to suggestions in the existing literature that line relaxations and semicoarsening are needed in multigrid algorithms to overcome difficulties caused by the singularities in the axisymmetric Maxwell problems. Our multigrid analysis proceeds by applying the well known regularity …
Some Nonparametric And Semiparametric Methods For Discriminant Analysis., Anil Kumar Ghosh Dr.
Some Nonparametric And Semiparametric Methods For Discriminant Analysis., Anil Kumar Ghosh Dr.
Doctoral Theses
Discriminant analysis (see e.g., Devijver and Kittler, 1982; Duda, Hart and Stork, 2000; Hastle, Tibahirani and Friedman, 2001) deals with the separation of different groups of obaervationa and allocation of a new oboervation to one of the previously delined grouga. In a J-class discriminant analysis problem, we usually hae a training sample of the form {(xk, ck) : k = 1,2,...,N}, where xk = (Ik1,Ik2,...J) is a d-dimensional measarement vector, and ca € {1,2,...,J} is its class label. On the basis of thia training sample, one aims to form a decision rule d(x) : Rd + (1,2,...,J} for clasifying the …
Cryptographic And Combinatorial Properties Of Boolean Functions And S-Boxes., Kishan Chand Gupta Dr.
Cryptographic And Combinatorial Properties Of Boolean Functions And S-Boxes., Kishan Chand Gupta Dr.
Doctoral Theses
In this thesis we study combinatorial aspects of Boolean functions and S-boxes with impor- tant cryptographic properties and construct new functions possesing such properties. These have possible applications in the design of private key (symmetric key) cryptosystems.Symmetric key cryptosystems are broadly divided into two classes.1. Stream Ciphers,2. Block Ciphers.Some recent proposals of stream ciphers are SNOW [37], SCREAM [52], TURING (98], MUGI (117), HBB (102], RABBIT (9), HELIX (38] and some proposals of block ciphers are DES, AES, RC6 [97), MARS (12], SERPENT (6], TWOFISH (104].In stream cipher cryptography a pseudorandom sequence of bits of length cqual to the message …
Some Statistical Contributions To The Analysis Of Human Genome Diversity And Evolution., Analabha Basu Dr.
Some Statistical Contributions To The Analysis Of Human Genome Diversity And Evolution., Analabha Basu Dr.
Doctoral Theses
The work embodied in this thesis pertains to human population genetics. In particular, the overarching goals of this thesis are to contribute to the understanding of genomic diversity of human populations and to the development of statistical methods for making inferences in genome diversity studies. With these two goals in mind, we have carried out a detailed statistical analysis of genomic data on a large number of ethnic populations of India, generated in the laboratory of the Anthropology & Human Genetics Unit, Indian Statistical Institute, Kolkata. Additionally, wherever relevant, we have compared our data with those collated from the published …
Symmetric Representations Of Elements Of Finite Groups, Abeir Mikhail Kasouha
Symmetric Representations Of Elements Of Finite Groups, Abeir Mikhail Kasouha
Theses Digitization Project
This thesis demonstrates an alternative, concise but informative, method for representing group elements, which will prove particularly useful for the sporadic groups. It explains the theory behind symmetric presentations, and describes the algorithm for working with elements represented in this manner.
Analysis Of A Multigrid Algorithm For Time Harmonic Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak, Leszek Demkowicz
Analysis Of A Multigrid Algorithm For Time Harmonic Maxwell Equations, Jay Gopalakrishnan, Joseph E. Pasciak, Leszek Demkowicz
Mathematics and Statistics Faculty Publications and Presentations
This paper considers a multigrid algorithm suitable for efficient solution of indefinite linear systems arising from finite element discretization of time harmonic Maxwell equations. In particular, a "backslash" multigrid cycle is proven to converge at rates independent of refinement level if certain indefinite block smoothers are used. The method of analysis involves comparing the multigrid error reduction operator with that of a related positive definite multigrid operator. This idea has previously been used in multigrid analysis of indefinite second order elliptic problems. However, the Maxwell application involves a nonelliptic indefinite operator. With the help of a few new estimates, the …
Some Combinatorial Design In Vlsi Architectures And Statistics., Soumen Maity Dr.
Some Combinatorial Design In Vlsi Architectures And Statistics., Soumen Maity Dr.
Doctoral Theses
In this dissertation, we consider the following combinatorial problems: some character- ization, enumeration, construction and optimization problems in both VLSI linear and VLSI two-dimensional arrays; and construction of two combinatorial designs as used by statisticians: nearly strongly balanced uniform repeated measurements designs (NSBUR- MDs) and balanced near uniform repeated measurements designs (BNURMDS). We give below, chapter-wise, the problems considered and a brief outline of the solutions.1.1 Enumerating Catastrophic Fault Patterns in VLSI Linear Arrays with Bidirectional or Unidirectional LinksSystolic systems consist, of a large mimber of identical and elementary processing element locally conuccted in a regular fashion. Each element receives …
Essays On Minimum Cost Spanning Tree Games., Anirban Kar Dr.
Essays On Minimum Cost Spanning Tree Games., Anirban Kar Dr.
Doctoral Theses
There is a wide range of economic contexts in which aggregate costs have to be allocated amongst individual agents or components who derive t he benefits from a common project. A firm has to allocate overheard costs atmongst its different divisions. Regulatory authorities have to set taxes or fees on individual users for a variety of services. Partners in a joint venture must share costs (and benefits) of the joint venture. For example, when two doctors share an office they need to divide the cost of office space, medical equipment and secretarial help. If several municipalities use a common water …
Combinatorial Techniques For Digital Image Charecterization And Retrieval:Algorithms,Architectures,And Applications., Arijit Bishnu Dr.
Combinatorial Techniques For Digital Image Charecterization And Retrieval:Algorithms,Architectures,And Applications., Arijit Bishnu Dr.
Doctoral Theses
Interest in digital images stems mostly from its application to various areas of computer vision [33, 57] and pattern recognition [145). Problems include robotic vision and con- trol, geographic and topographic map matching, target recognition, space applications, character recognition, scene analysis, fingerprint and face recognition, etc. Lately, with the advent of content-based image retrieval (CBIR) and proliferation of the Internet, digital imaging applications are in vogue now than ever before. In almost all the cases, the data size is enormously large, and at the same time, fast on-line as well as real- time computation is needed. For example, in fingerprint …
On The Approximability Of Linear Ordering And Related Np-Optimization Problems., Sounaka Mishra Dr.
On The Approximability Of Linear Ordering And Related Np-Optimization Problems., Sounaka Mishra Dr.
Doctoral Theses
We investigate approximability of both maximum and minimum linear ordering problems (MAX-LOP and MIN-LOP) and several related problems such as the well known feedback set problems, acyclie subdigraph problem and several others and their variants.We show that both MAX-LOP and MIN-LOP are strongly NP-complete, and MIN- LOP, MIN-QAP(S) (a special case of minimum quadratic assignment problem) and MIN-W-FAS are equivalent with respect to strict-reduction. The strict-equivalence is also established among these problems as well as MIN-W-FVS, with weights on arcs/vertices bounded by a polynomial, and the unweighted versions of the feedback set. problems. We also show that MAX-LOP is strict-equivalent …
The Embedding Of Complete Bipartite Graphs Onto Grids With A Minimum Grid Cutwidth, Mário Rocha
The Embedding Of Complete Bipartite Graphs Onto Grids With A Minimum Grid Cutwidth, Mário Rocha
Theses Digitization Project
Algorithms will be domonstrated for how to embed complete bipartite graphs onto 2xn type grids, where the imimum grid cutwidth is attained.
Fundamental Theorem Of Algebra, Paul Shibalovich
Fundamental Theorem Of Algebra, Paul Shibalovich
Theses Digitization Project
The fundamental theorem of algebra (FTA) is an important theorem in algebra. This theorem asserts that the complex field is algebracially closed. This thesis will include historical research of proofs of the fundamental theorem of algebra and provide information about the first proof given by Gauss of the theorem and the time when it was proved.
Boolean Functions With Important Cryptographic Properties., Subhamoy Maitra Dr.
Boolean Functions With Important Cryptographic Properties., Subhamoy Maitra Dr.
Doctoral Theses
In this thesis we concentrate on properties of cryptographically significant Boolean functions.The techniques are mainly combinstorial and provide new resulta on enumeration and construction of such functions. Initially we concentrate on a partieular subset of Boolean functions called the symmetric Boolean functions. A closed form expression for the Walsh transform of an arbitrary symmetric Boolean function is presented. We completely characterize the symmetric functions with maximum nonlinearity and show that the maximum nonlinearity of n-variable symmetrie function can be 2n-1-2[n-1l2], Moreover, new classes of symmetric balanced and symmetric correlation immune functions are considered.We provide a randomised heuristic to construct balanced …
Mapping Quantitative Trait Loci In Humans: Some Statistical Contributions., Saurabh Ghosh Dr.
Mapping Quantitative Trait Loci In Humans: Some Statistical Contributions., Saurabh Ghosh Dr.
Doctoral Theses
Maty qualitative tralts - such an, milk yield la cows, blood pressure in lumans --are known to be determined primarly, though zot exclusively, by inherited genetic luctora. It ls the of coasklerable impartance to identify chromosontal locations of tho genes that control a quantitative character. Linkage analysis (Ou 1990), which deals with the deduction of linkagn and estimation of recombination fractions among the loci controlling a qualitative/quantitative character and major loci wkoo poertions are knows aprfori, is widely used for localisation of gens. Although statistical methodologies for magplag gemen determining dichotomos qualitative charactes in humans aro well-developed, the demicrant of …
Routing Algorithms For Channels, Switchboxes And Mcm's In Vlsi Layout Design., Sandip Das Dr.
Routing Algorithms For Channels, Switchboxes And Mcm's In Vlsi Layout Design., Sandip Das Dr.
Doctoral Theses
The term Very Large Scale Integration (VLSI) reflects the capability of semi- conductor industry to fabricate a complex electronic circuit consisting of millions of components on a single silicon substrate. The growth of semiconductor technol- ogy in recent years has been described by "Moore's law", enunciated in the late 1960s, which projected quadrupling of components in a chip in every three to four years. Several factors contributed to this tremendous growth : (i) reduction of line width of the basic device and interconnection wires due to the development of high- resolution lithographic techniques and improved processing capabilities, (ii) increase in …
On Some Self-Organizing Models And Their Applications., Amitava Dutta Dr.
On Some Self-Organizing Models And Their Applications., Amitava Dutta Dr.
Doctoral Theses
Abstract: Self-organizing neural network models constitute the main theme of this thesis. Some well-known self-organizing models are surveyed and their properties are discussed. The application areas on which the thesis focuses are briefly described.This thesis deals with Artificial Neural Network models, in particular, Self- organizing (unsupervisnd) models. We develop here a few self-organizing neural net- work models to solve certain problems which are well studied in the areas of Image Processing and Computationel Geometry and have wide applications in shape eztrac- tion and optimization.1.1 Artificial neural networkThe study of Biological Neural Networks originally comes under biological sciences. They deal with …
On Fractal Based Representation Of Image With Application To Image Processing., Suman Kumar Mitra Dr.
On Fractal Based Representation Of Image With Application To Image Processing., Suman Kumar Mitra Dr.
Doctoral Theses
The language of an image is universal. Images were the means of communicating infor- mation in ancient days. Even today, although people from different parts of the world speak in different languages, an image conveys almost the same universal meaning to all. With the rapid development of modern computer technologies and with the increasing attempt in getting information at ones finger tips, the importance of communication of information using images can not be ignored.Images are stored in computers in the form of a collection of bits representing pixels (picture elements). Pictures are to be digitized to store them in computers. …
Some Contribution To Reliability Analysis Of A Consecutive-K-Out-Of N: F System., Mohammad Khanjari Sadegh Dr.
Some Contribution To Reliability Analysis Of A Consecutive-K-Out-Of N: F System., Mohammad Khanjari Sadegh Dr.
Doctoral Theses
Present day technology has been characterized by development of complex systems or equipments containing a large number of subaystems and com- ponents. Reliability, as a buman attribute, has been praised for a very long time. For technical systems, however, the reliability concept has not been applied for more than about 50 years. Reliability is the concern of all scien- tists and engineers engaged in developing a system, from design, through the manufacturing, to its ultimate use. Reliability technology has a potentially wide range of application areas like safety or risk analysis, environmental protection, quality, optimization, maintenance, engineering design, etc.For a …
Studies On Finite Linear Cellular Automata., Palash Sarkar Dr.
Studies On Finite Linear Cellular Automata., Palash Sarkar Dr.
Doctoral Theses
Cellular Automata were originally proposed by John von Neumann as formal models of self reproducing organisms. The structure studied was mostly an ane and two dimensional infinite grida, though higher dimensions were also considered. Computation universality and other computation theoretic questions were considered important. See Burks [24] for a collection of essays on important problems on cellular automata during this period. Later physicists and biologists began to study cellular automsta for the purpose of modelling in their respective domains. In the present era, cellalar automata is being atudied from many widely different angles, and the relationship of these structurea to …
On Quantitative Evaluation Of 3-D Histo-Pathological Images From Confocal Laser Scanning Microscope., P. S. Umesh Adiga Dr.
On Quantitative Evaluation Of 3-D Histo-Pathological Images From Confocal Laser Scanning Microscope., P. S. Umesh Adiga Dr.
Doctoral Theses
Automation of image analysis in the bio-medical ficld is one of the important achievements of applied image processing research. The rapid development in the electronic instrumentation during 1960s and 70s made it possible to automate the routine process of diagnosis and prognosis of many discases. Development of high resolution imaging instruments such as X-ray CT, MRI, etc., for macro imaging and electron microscope, confocal microscope, etc., for micro imaging has given a tremendous boost to the advancement of medical field. Advancement in the field of computing has made it possible to reconstruct the pictures of internal organs of the body …
Multigrid For The Mortar Finite Element Method, Jay Gopalakrishnan, Joseph E. Pasciak
Multigrid For The Mortar Finite Element Method, Jay Gopalakrishnan, Joseph E. Pasciak
Mathematics and Statistics Faculty Publications and Presentations
A multigrid technique for uniformly preconditioning linear systems arising from a mortar finite element discretization of second order elliptic boundary value problems is described and analyzed. These problems are posed on domains partitioned into subdomains, each of which is independently triangulated in a multilevel fashion. The multilevel mortar finite element spaces based on such triangulations (which need not align across subdomain interfaces) are in general not nested. Suitable grid transfer operators and smoothers are developed which lead to a variable Vcycle preconditioner resulting in a uniformly preconditioned algebraic system. Computational results illustrating the theory are also presented.
Some Studies On Shape Of Dot Patterns., Anirban Ray Chaudhuri Dr.
Some Studies On Shape Of Dot Patterns., Anirban Ray Chaudhuri Dr.
Doctoral Theses
The important visual characteristics of an object are shape, size, color, brightness, contrast and texture. Of them, shape is a multidimensional concept that is difficult to define. It takes different meanings in different contexts. We try to explain it in terms of their attributes like elongation, roundness, and symmetry: although these terms do not capture the complete notion of shape.Perhaps Gestalt theory Koffka 351 is the first attempt to study the principles of visual perception in a systematic manner. The central concept of this theory is Gestalt' which means form or configuration. In this theory form is examined from physical. …
Muyltivariate And Regression Analysis Based On The Geometry Of Data Clouds., Biman Chakraborty Dr.
Muyltivariate And Regression Analysis Based On The Geometry Of Data Clouds., Biman Chakraborty Dr.
Doctoral Theses
Median is a natural estimate of location of a data set, and there are several versions of inultivariate median studied in the literature, each of which is an interesting descriptive statistic for multivariate data and provides some nice geometric insights into the data cloud. One would expect that multidimensional median will be a natural estimate for the center of symmetry of a multivariate distribution. However, there is no unique concept of symmetry in multivariate problems. The center of symmetry can be defined in several ways there. For example, the d-dimensional random variable X is spherically symmetric about e €Rd if …
Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen
Even Subgraphs Of A Graph, Hong-Jian Lai, Zhi-Hong Chen
Scholarship and Professional Work - LAS
No abstract provided.
On The Developement Of An Optical Character Recognition(Ocr) System For Printed Bangla Script., Umapada Pal Dr.
On The Developement Of An Optical Character Recognition(Ocr) System For Printed Bangla Script., Umapada Pal Dr.
Doctoral Theses
This thesis concerns OCR development of machine printed text in an Indian lan- guage, Bangla (Bengali) which is the fourthmost popular language in the world and the secondmost popular language in India.1.1 Optical Character Recognition Optical Character Recognition (OCR) is a process of automatic computer recog- nition of characters in optically scanned and digitized pages of text. OCR is ene of the most fascinating and challenging areas of pattern recognition with various practical applications. It can contribute tremendously to the advancement of an automation process and can improve the interface between man and machine in many applications, including office automation …
Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki
Representations, Approximations, And Algorithms For Mathematical Speech Processing, Laura R. Suzuki
Theses and Dissertations
Representing speech signals such that specific characteristics of speech are included is essential in many Air Force and DoD signal processing applications. A mathematical construct called a frame is presented which captures the important time-varying characteristic of speech. Roughly speaking, frames generalize the idea of an orthogonal basis in a Hilbert space, Specific spaces applicable to speech are L2(R) and the Hardy spaces Hp(D) for p> 1 where D is the unit disk in the complex plane. Results are given for representations in the Hardy spaces involving Carleson's inequalities (and its extensions), …