Open Access. Powered by Scholars. Published by Universities.®
- Publication Year
- Publication
Articles 1 - 15 of 15
Full-Text Articles in Entire DC Network
Computing Well-Structured Subgraphs In Geometric Intersection Graphs., Satyabrata Jana Dr.
Computing Well-Structured Subgraphs In Geometric Intersection Graphs., Satyabrata Jana Dr.
Doctoral Theses
For a set of geometric objects, the associative geometric intersection graph is the graph with a vertex for each object and an edge between two vertices if and only if the corresponding objects intersect. Geometric intersection graphs are very important due to their theoretical properties and applicability. Based on the different geometric objects, several types of geometric intersection graphs are defined. Given a graph G, an induced (either vertex or edge) subgraph H ⊆ G is said to be an well-structured subgraph if H satisfies certain properties among the vertices in H. This thesis studies some well-structured subgraphs finding problems …
Essays In Multidimensional Mechanism Design., Kolagani Paramahamsa Dr.
Essays In Multidimensional Mechanism Design., Kolagani Paramahamsa Dr.
Doctoral Theses
This thesis analyzes three problems where a monopolistic seller is selling to an agent with multidimensional private information. While our understanding of such problems is comprehensive if the agent's private information is one-dimensional, problems with multidimensional private information are known to be ubiquitous but analytically notorious. The three chapters in this thesis make progress in understanding optimal mechanism design in such multidimensional screening problems. In the first problem, the seller is selling an object to an agent who exhibits behavioral preferences, in a departure from the standard rational models. Behavioral preferences arise because the agent is budget constrained and needs …
Quantum Markov Maps: Structureand Asymptotics., Vijaya Kumar U. Dr.
Quantum Markov Maps: Structureand Asymptotics., Vijaya Kumar U. Dr.
Doctoral Theses
No abstract provided.
Domain Restrictions In Strategy-Proof Social Choice., Gopakumar Achuthankutty Dr.
Domain Restrictions In Strategy-Proof Social Choice., Gopakumar Achuthankutty Dr.
Doctoral Theses
In Chapter 2, we consider domains of admissible preferences with a natural property called top-circularity. Several domains with practical applications such as multidimensional single-peaked domain in [9], union of a single-peaked and a single dipped domain, etc. satisfy top-circularity. We show that if such a domain satisfies either the maximal conflict property or the weak conflict property, then it is dictatorial. We show that this result can be applied to the problem of locating a public facility where the planner does not know whether agents derive positive or negative externality from the facility. The union of a single-peaked and a …
Infinite Color Urn Models., Debleena Thacker Dr.
Infinite Color Urn Models., Debleena Thacker Dr.
Doctoral Theses
In recent years, there has been a wide variety of work on random reinforcement models of various kinds. Urn models form an important class of random reinforcement models, with numerous applications in engineering and informatics and bioscience. In recent years there have been several works on different kinds of urn models and their generalizations. For occupancy urn models, where one considers recursive addition of balls into finite or infinite number of boxes, there are some works which introduce models with infinitely many colors, typically represented by the boxes.As observed in [51], the earliest mentions of urn models are in the …
Essays On Strategy-Proofness And Implementation., Sonal Yadav Dr.
Essays On Strategy-Proofness And Implementation., Sonal Yadav Dr.
Doctoral Theses
This thesis comprises of three chapters relating to strategy-proofness and implementation. We provide a brief description of each chapter below.1.1 A Hurwicz Type Result in a Model with Public Good Production We consider a two-good model with an arbitrary number of agents. One of the goods is a public good and the other is a private good. Each agent has an endowment of the private good and the private good can be converted into the public good using a well-behaved production function. A Social Choice Function (SCF) associates an allocation with each admissible preference profile. We impose the following requirements …
Methods For The Direct Simulation Of Nanoscale Film Breakup And Contact Angles, Kyle Mahady
Methods For The Direct Simulation Of Nanoscale Film Breakup And Contact Angles, Kyle Mahady
Dissertations
This thesis investigates direct simulation of fluids with free surfaces and contact lines, with a focus on capturing nanoscale physics in a continuum based computational framework. Free surfaces and contact lines have long presented some of the most challenging problems in computational fluid dynamics. Extensive progress has been made in recent years, and a wide variety of different methods are currently employed for direct simulation in these contexts. The complexity of the full governing equations for such flows poses significant challenges in terms of analytical techniques, and leads to lengthy computational times for direct simulations. For these reasons, reduced models …
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 …
Discrete Singularity Method And Its Application To Incompressible Flows., S K. Venkatesan Dr.
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 …
On Sequential Test Procedure With Application In Identification And Selection., Atasi Basu Dr.
On Sequential Test Procedure With Application In Identification And Selection., Atasi Basu Dr.
Doctoral Theses
The area of sequential testing of statistical hypothesss is an important part of sequential analysis. The idea of a sequential test goes back to Dodge and Romig (1929) who cons tructed a double sampling procedure for sampling inspection. They wers motivated by the obser- vation that the double sampling plan requires a smaller number of observations on the average when compared uith the corresponding single sampling plan, Later schemes like multiple sampling vide Wlalter Bartky (1943) and interesting practical application of large scale experimente in successive stages vide Mahalanobis (1940) started comni ng up.The formal theory in sequential analysis began …
Flow-Shop Scheduling Problems., N. R. Achuthan Dr.
Flow-Shop Scheduling Problems., N. R. Achuthan Dr.
Doctoral Theses
Researchers attention was drawn to the study of schodulirg problems through mathemtical modelling, probably for the first time, when Johnson (1954) publishod his famous paper in mval research logistic quarterly. Thercafter, mny authors have contimued to contribute to the growth of the theory of scheduling. A vast colloctim of papers related to this area is rogularly published by journals like mamgement science, operations research, operational research quarterly, naval research logistic quarterly, opsearch etc.. A good grasp of the litermture in this arca can be had from the books by Conway et al. (1967), Baker (1974) and Rinnooy Kan (1976).This thesis …
Some Problems On Econometric Regression Analysis., Maitreyi Chaudhuri Dr.
Some Problems On Econometric Regression Analysis., Maitreyi Chaudhuri Dr.
Doctoral Theses
Very often in eoonometrio enslysis one adopts the classical lineer regression model. The classical linear regression model is given by If, in addition, e is assumed to be normally Ä‘istributed, the model is called classical normal1 linear regression mode1.Ordinary least squares (0LS) methods of estimation and hypothesis testing are besed on this ndal, d eveluton copy of CV POFO But the assumptions on É›is and- xs may not be fulfilled in reality; or, in other words, the model may not be correctly specified. Cne class of problems arises when some of the regressors are omitted from the equation and/or scme …
On Some Problems Of Sequenting And Grouping., T. S. Arthanari Dr.
On Some Problems Of Sequenting And Grouping., T. S. Arthanari Dr.
Doctoral Theses
The problems of sequencing arise in almost all walks of life. Theory of scheduling deals with such problems. Usually, these probl ems are stated in the literature in terms of jobs, machines, operations, penalties, due dates et cetera, that is, in the language of machine shops. The real life problems of In machine - shop job sequencing are of a complex nature. general, we consider processing n items on a certain group of machines, so as to optimize certain objective, subject to various cons traints on precedence, machine availability, due date and so on. The job sequencing problems are includ …
Study Of Dynamic Programming And Gambling Systems., N. D. Prabhakar Dr.
Study Of Dynamic Programming And Gambling Systems., N. D. Prabhakar Dr.
Doctoral Theses
The body of methods known as Dynamic Programming (d.p.) was developed by Bellman and was successfully applied by him to solve practical problems in diverse fields (see 12] and the pa pers cited there.). These methods revolved around an intuitively appealing principle which Bellman called the principle of optimatity. A general formulation of d.p. problem was given by Blackwell (3, s] which is narrower in scope than Bollman's but includes many important applications i12) and offers a proper framework for asking the many inte- resting and mathematically sophisticated questions that arise in d.p.. Strauch, Brown, Maitra, Furukawa, Dantas, Hinderer etc., …
Convolution Properties Of Distributions On Topological Groups., S. R. S. Varadhan Dr.
Convolution Properties Of Distributions On Topological Groups., S. R. S. Varadhan Dr.
Doctoral Theses
The collection of probability distributions on the real line which is a semigroup under the convolution operation and topological space under weak convergence has attracted, during the last quarter of a century, the attention of such great mathematicians as Khintchine, Kolmogorov, Bawly, Levy and others. Their results constitute a deep analysis of the factorization problems on the one hand and the asymptotic behavior of infinite convolutions on the other. However, a complete and systematic investigation of these problems is not available in considerable generality. The aim of the present thesis is to investigate the topological and algebraic properties and the …