Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 7 of 7
Full-Text Articles in Entire DC Network
Nonparametric Methods For Data In Infinite Dimensional Space., Anirvan Chakraborty Dr.
Nonparametric Methods For Data In Infinite Dimensional Space., Anirvan Chakraborty Dr.
Doctoral Theses
For univariate as well as finite dimensional multivariate data, there is an extensive literature on nonparametric statistical methods. One of the reasons for the popularity of nonparametric methods is that it is often difficult to justify the assumptions (e.g., Gaussian distribution of the data) made in the models used in parametric methods. Nonparametric procedures use more flexible models, which involve less assumptions. So, they are more robust against possible departures from the model assumptions, and are applicable to a wide variety of data. Nonparametric methods outperform their parametric competitors in many situations, where the assumptions required for the parametric methods …
Essays In Political Economy And Voting., Mihir Bhattacharya Dr.
Essays In Political Economy And Voting., Mihir Bhattacharya Dr.
Doctoral Theses
This thesis comprises three chapters on issues in political economy and voting. The first chapter considers a multilevel multidimensional aggregation problem in voting. The second chapter considers a model of party formation where citizens propose links to other candidates. The final chapter considers a model of electoral competition between regional and national parties.We provide a brief description of each chapter below. 1.1 Multilevel Multidimensional Consistent AggregatorsIn this chapter we study gerrymander-proof or consistent aggregation rules in different contexts. There are several papers that have studied the structure of consistent voting rules satisfying various versions of consistency. Virtually all these papers …
On The Analysis Of Some Recursive Equations In Probability., Arunangshu Biswas Dr.
On The Analysis Of Some Recursive Equations In Probability., Arunangshu Biswas Dr.
Doctoral Theses
This thesis deals with recursive systems used in theoretical and applied probability. Recursive systems are stochastic processes {Xn}n≥1 where the Xn depends on the earlier Xn−1 and also on some increment process which is uncorrelated with the process Xn. The simplest example of a recursive system is the Random Walk, whose properties have been extensively studied. Mathematically a recursive system takes the form Xn = f(Xn−1, n), is the increment/ innovation procedure and f(·, ·) is a function on the product space of xn and n. We first consider a recursive system called Self-Normalized sums (SNS) corresponding to a sequence …
On Supervised And Unsupervised Methodologies For Mining Of Text Data., Tanmay Basu Dr.
On Supervised And Unsupervised Methodologies For Mining Of Text Data., Tanmay Basu Dr.
Doctoral Theses
The supervised and unsupervised methodologies of text mining using the plain text data of English language have been discussed. Some new supervised and unsupervised methodologies have been developed for effective mining of the text data after successfully overcoming some limitations of the existing techniques.The problems of unsupervised techniques of text mining, i.e., document clustering methods are addressed. A new similarity measure between documents has been designed to improve the accuracy of measuring the content similarity between documents. Further, a hierarchical document clustering technique is designed using this similarity measure. The main significance of the clustering algorithm is that the number …
Complete And Partial Ordering Approaches In The Context Of Poverty Ordering And On The Impacts Of Growth And Inequality On Poverty., Sandip Sarkar Dr.
Complete And Partial Ordering Approaches In The Context Of Poverty Ordering And On The Impacts Of Growth And Inequality On Poverty., Sandip Sarkar Dr.
Doctoral Theses
No abstract provided.
Essays On Incentive Compatibility On Restricted Domains., Anup Pramanik Dr.
Essays On Incentive Compatibility On Restricted Domains., Anup Pramanik Dr.
Doctoral Theses
This thesis comprises three chapters that investigate the structure of dominant strategy incentive compatible (strategy-proof) social choice functions on restricted domains. The first chapter deals with standard mechanism design problem in quasi-linear environments with multidimensional non-convex type spaces. It identifies a class of type spaces called ordinal type spaces and shows that the simple and familiar 2-cycle monotonicity condition is necessary and sufficient for implementation. This result covers the single-peaked domain. The second chapter deals with the standard social choice problem (no monetary transfers) but one where agents have indifference in their preference orderings generated via an exogenous partition of …
Some Studies On Selected Stream Ciphers Analysis Fault Attack & Related Results., Subhadeep Banik Dr.
Some Studies On Selected Stream Ciphers Analysis Fault Attack & Related Results., Subhadeep Banik Dr.
Doctoral Theses
Stream Ciphers are important Symmetric Cryptological primitives, built for the purpose of providing secure message encryption. As no formal security proofs exist, our confidence in these algorithms is largely based on the fact that intense cryptanalysis has been carried out over several years without revealing any weakness. This thesis makes some independent contributions to the cryptanalysis of a selection of stream ciphers.In this thesis, we take a closer look at two stream ciphers viz. RC4+ designed by Maitra et al. at Indocrypt 2008 and GGHN designed by Gong et al. at CISC 2005. Both these ciphers were designed as viable …