1,354,982 research outputs found
Analýza projevů Mahua Moitra 2020-2021 v Lok Sabha
No full textWomen in parliament long seem to be limited to addressing only certain topics and issues - mostly those that have a 'female-centric' focus. This perspective has been backed by the idea that being women, they are more empathetic, compassionate, honest and liberal. This gives them a better insight into what females want and they are therefore better equipped to address these issues compared to their male counterparts. It is my perspective that female politicians should be looked at beyond this limited scope and addressed as legislators who represent the voice of all people and not only a specific demographic. Using the grounded theory through an exploratory case study method, this thesis focuses on Mahua Moitra and the speeches she made in the Lok Sabha in 2020- 2021. Through this analysis, the thesis gathers what she has contributed to the developing narrative of female political representation in India. Keywords Mahua Moitra, Speech Analysis, Lok Sabha, Female Political Representation in India, Female MPZdá se, že ženy v politice byly dlouho omezovány na řešení pouze určitých témat a problémů - většinou těch, které se zaměřují na ženy. Tento pohled byl podpořen myšlenkou, že političky jakožto ženy jsou empatičtější, soucitnější, čestnější a liberálnější.Tyto vlastnosti jsou předpokladem k tomu, že političky vědí, co ženy chtějí, a jsou proto lépe vybaveny k řešení těchto problémů ve srovnání s jejich mužskými protějšky. Zastávám názor, že na političky by se mělo přestat pohlížet prizmatem tohoto omezeného rámce, a naopak by se k nim mělo přistupovat jako k zákonodárcům, kteří zastupují hlas všech lidí, nejen pouze jedné konkrétní demografické skupiny. S využitím zakotvené teorie a prostřednictvím metody výzkumné případové studie se tato práce zaměřuje na Mahuau Moitru a její politické projevy v Lok Sabha v letech 2020-2021. Prostřednictvím této analýzy má prácepředstavuje, jakým způsobem Mahua Moitra přispěla k rozvoji narativu ženské politické reprezentace v Indii. Klíčová slova: Mahua Moitra, analýza řeči, Lok Sabha, ženská politická reprezentace v Indii, poslankyněDepartment of SociologyKatedra sociologieFakulta sociálních vědFaculty of Social Science
Robustness Meets Algorithms (Invited Talk)
No full textIn every corner of machine learning and statistics, there is a need for estimators that work not just in an idealized model but even when their assumptions are violated. Unfortunately in high-dimensions, being provably robust and efficiently computable are often at odds with each other. In this talk, we give the first efficient algorithm for estimating the parameters of a high-dimensional Gaussian which is able to tolerate a constant fraction of corruptions that is independent of the dimension. Prior to our work, all known estimators either needed time exponential in the dimension to compute, or could tolerate only an inverse polynomial fraction of corruptions. Not only does our algorithm bridge the gap between robustness and algorithms, it turns out to be highly practical in a variety of settings
An Almost Optimal Algorithm for Computing Nonnegative Rank
No full textHere, we give an algorithm for deciding if the nonnegative rank of a matrix M of dimension m \times n$ is at most r which runs in time (nm)[superscript O(r2)]. This is the first exact algorithm that runs in time singly exponential in r. This algorithm (and earlier algorithms) are built on methods for finding a solution to a system of polynomial inequalities (if one exists). Notably, the best algorithms for this task run in time exponential in the number of variables but polynomial in all of the other parameters (the number of inequalities and the maximum degree). Hence, these algorithms motivate natural algebraic questions whose solution have immediate algorithmic implications: How many variables do we need to represent the decision problem, and does M have nonnegative rank at most r? A naive formulation uses nr + mr variables and yields an algorithm that is exponential in n and m even for constant r. Arora et al. [Proceedings of STOC, 2012, pp. 145--162] recently reduced the number of variables to 2r[superscript 2] 2[superscript r], and here we exponentially reduce the number of variables to 2r[superscript 2] and this yields our main algorithm. In fact, the algorithm that we obtain is nearly optimal (under the exponential time hypothesis) since an algorithm that runs in time (nm)[superscript o(r)] would yield a subexponential algorithm for 3-SAT [Proceedings of STOC, 2012, pp. 145--162]. Our main result is based on establishing a normal form for nonnegative matrix factorization---which in turn allows us to exploit algebraic dependence among a large collection of linear transformations with variable entries. Additionally, we also demonstrate that nonnegative rank cannot be certified by even a very large submatrix of M, and this property also follows from the intuition gained from viewing nonnegative rank through the lens of systems of polynomial inequalities.National Science Foundation (U.S.) (Computing and Innovation Fellowship)National Science Foundation (U.S.) (grant DMS-0835373
Super-resolution, Extremal Functions and the Condition Number of Vandermonde Matrices
No full textSuper-resolution is a fundamental task in imaging, where the goal is to extract fine-grained structure from coarse-grained measurements. Here we are interested in a popular mathematical abstraction of this problem that has been widely studied in the statistics, signal processing and machine learning communities. We exactly resolve the threshold at which noisy super-resolution is possible. In particular, we establish a sharp phase transition for the relationship between the cutoff frequency (m) and the
separation (∆). If m > 1/∆ + 1, our estimator converges to the true values at an inverse polynomial rate in terms of the magnitude of the noise. And when m < (1 − epsilon )/∆ no estimator can distinguish between a particular pair of ∆-separated signals even if the magnitude of the noise is exponentially small. Our results involve making novel connections between extremal functions and the spectral properties of Vandermonde matrices. We establish a sharp phase transition for their condition number which in
turn allows us to give the first noise tolerance bounds for the matrix pencil method. Moreover we show that our methods can be interpreted as giving preconditioners for Vandermonde matrices, and we use this observation to design faster algorithms for super-resolution. We believe that these ideas may have other applications in designing faster algorithms for other basic tasks in signal processing
Report on the 9th Biennial Conference of the Comparative Literature Association of India
No full textIn her article Report on the 9th Biennial Conference of the Comparative Literature Association of India Babli Moitra Saraf presents her perception of the intellectual trajectories of the conference and discusses a number of selected papers read. The conference in the main addressed two issues: the institutional status of Comparative Literature and Comparative Literature as an academic discipline. A close third was the agenda of Comparative Literature to construct a World Literature
Accurate Description of Photoionization Dynamical Parameters
No full textCalculation of dynamical parameters for photoionization requires an accurate description of the initial and final states of the system, as well as of the outgoing electron. We show that using a linear combination of atomic orbitals B-spline density functional theory (DFT) method to describe the outgoing electron, in combination with correlated equation of motion coupled cluster singles and double Dyson orbitals, gives good agreement with experiment and outperforms other simpler approaches, like plane and Coulomb waves, used to describe the photoelectron. Results are presented for cross-sections, angular distributions, and dichroic parameters in chiral molecules, as well as for photoionization from excited states. We also present a comparison with the results obtained using Hartree-Fock and DFT molecular orbitals selected according to Koopmans' theorem for the bound states
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
No full textLinial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities) is O(logfe). Here we attempt to derive a more general theory of Steiner cut and flow problems, and we prove bounds that are poly-logarithmic in k for a much broader class of multicommodity flow and cut problems. Our structural results are motivated by the meta question: Suppose we are given a poly(log n) approximation algorithm for a flow or cut problem when can we give a poly(log k) approximation algorithm for a generalization of this problem to a Steiner cut or flow problem? Thus we require that these approximation guarantees be independent of the size of the graph, and only depend on the number of commodities (or the number of terminal nodes in a Steiner cut problem). For many natural applications (when k = no(1)) this yields much stronger guarantees. We construct vertex-sparsifiers that approximately preserve the value of all terminal min-cuts. We prove such sparsifiers exist through zero-sum games and metric geometry, and we construct such sparsifiers through oblivious routing guarantees. These results let us reduce a broad class of multicommodity-type problems to a uniform case (on k nodes) at the cost of a loss of a poly (log k) in the approximation guarantee. We then give poly(log k) approximation algorithms for a number of problems for which such results were previously unknown, such as requirement cut, 1-multicut, oblivious 0-extension, and natural Steiner generalizations of oblivious routing, min-cut linear arrangement and minimum linear arrangement.Hertz Foundation (Fellowship
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Vertex sparsifiers : new results from old techniques
No full textGiven a capacitated graph and a set of terminals , how should we produce a graph only on the terminals so that every (multicommodity) flow between the terminals in could be supported in with low congestion, and vice versa? (Such a graph is called a flow sparsifier for .) What if we want to be a “simple” graph? What if we allow to be a convex combination of simple graphs? Improving on results of Moitra [Proceedings of the 50th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2009, pp. 3--12] and Leighton and Moitra [Proceedings of the 42nd ACM Symposium on Theory of Computing, ACM, New York, 2010, pp. 47--56], we give efficient algorithms for constructing (a) a flow sparsifier that maintains congestion up to a factor of , where ; (b) a convex combination of trees over the terminals that maintains congestion up to a factor of ; (c) for a planar graph , a convex combination of planar graphs that maintains congestion up to a constant factor. This requires us to give a new algorithm for the 0-extension problem, the first one in which the preimages of each terminal are connected in . Moreover, this result extends to minor-closed families of graphs. Our bounds immediately imply improved approximation guarantees for several terminal-based cut and ordering problems
- …
