03650nam 22005415 450 991091378210332120241210102230.09789819788996981978899410.1007/978-981-97-8899-6(CKB)36812859500041(MiAaPQ)EBC31812266(Au-PeEL)EBL31812266(DE-He213)978-981-97-8899-6(EXLCZ)993681285950004120241203d2024 u| 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierNavigating the Pandemic in India Voices of Older Adults and Intersectional Realities /by Sujata Sriram, Swarnima Bhargava1st ed. 2024.Singapore :Springer Nature Singapore :Imprint: Springer,2024.1 online resource (209 pages)9789819788989 9819788986 Chapter 1: Introduction and Review of Literature – Intersections of Covid-19 and Older Adults in India. - Chapter 2: Methodology - Doing Narrative research with Older Adults in India during the Pandemic. - Chapter 3: Introducing the Participants of the study – Glimpses into the worlds of Kannan, Sister Alice, Seetha, and Rattan -- Chapter 4: Origin stories of the virus - Making Sense of Covid-19 -- Chapter 5: Interruptions of Life caused by Covid-19 – Everyday routine, worship, work, medical care, travel and meeting loved ones -- Chapter 6: Stories of Strength and Coping: Individual and Systemic Response to Covid-19 -- Chapter 7: Multiplicity of Losses due to Covid-19: Fears, grief, loneliness, questioning god and the government. Chapter 8: To Jab or Not to Jab – Questions and Concerns about the Covid-19 Vaccine -- Chapter 9: Finale – Resetting the way we live.This book weaves together intersectional threads that underlie the experiences of older men and women in India during the Covid-19 pandemic. While older adults were considered particularly vulnerable to the scourge of the pandemic, there is scant first-hand evidence about how they understood the pandemic and how they were affected by it. Data about the effects of the virus on this population, as communicated by the government and the press, resulted in reductive/problematic narratives that shaped and colored their lives. The intersectional lens used in the book highlights the differential impacts of poverty, (dis)ability, gender, civil status, and health status on the experiences of older adults during the pandemic. This book brings forth first-person narratives of older adults navigating the Covid-19 pandemic in India. It is a handy ready reckoner for mental health and medical professionals, students in qualitative research methods, psychology, social work, geriatric medicine, health and public health, and public administration. The book's findings are provocative and generate curiosity about the lives and experiences of an age category seldom focused on.Quality of lifeClinical health psychologyQuality of Life ResearchHealth PsychologyQuality of life.Clinical health psychology.Quality of Life Research.Health Psychology.610306Sriram Sujata1777830Bhargava Swarnima1777831MiAaPQMiAaPQMiAaPQBOOK9910913782103321Navigating the Pandemic in India4299635UNINA07852nam 22008415 450 991048360010332120251226202853.03-642-12200-010.1007/978-3-642-12200-2(CKB)2560000000009134(SSID)ssj0000399498(PQKBManifestationID)11290899(PQKBTitleCode)TC0000399498(PQKBWorkID)10376188(PQKB)10639519(DE-He213)978-3-642-12200-2(MiAaPQ)EBC3065228(PPN)14907347X(BIP)29233187(EXLCZ)99256000000000913420100421d2010 u| 0engurnn|008mamaatxtccrLATIN 2010: Theoretical Informatics 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010, Proceedings /edited by Alejandro López-Ortiz1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XV, 706 p. 143 illus.) Theoretical Computer Science and General Issues,2512-2029 ;6034Bibliographic Level Mode of Issuance: Monograph3-642-12199-3 Includes bibliographical references and index.Continuous and Discrete Methods in Computer Science -- Colorful Strips -- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions -- Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set -- Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines -- Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width -- Average Parameterization and Partial Kernelization for Computing Medians -- Sharp Separation and Applications to Exact and Parameterized Algorithms -- Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight -- The Language Theory of Bounded Context-Switching -- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling -- Packet Routing on the Grid -- Faithful Representations of Graphs by Islands in the Extended Grid -- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication -- Sparse Recovery Using Sparse Random Matrices -- Optimal Succinctness for Range Minimum Queries -- Compact Rich-Functional Binary Relation Representations -- Radix Cross-Sections for Length Morphisms -- Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata -- Quotient Complexity of Ideal Languages -- Complexity of Operations on Cofinite Languages -- Fast Set Intersection and Two-Patterns Matching -- Counting Reducible, Powerful, and Relatively Irreducible Multivariate Polynomials over Finite Fields -- A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication -- Modelling the LLL Algorithm by Sandpiles -- Communication-Efficient Construction of the Plane Localized Delaunay Graph -- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization -- RandomisedBroadcasting: Memory vs. Randomness -- Limit Theorems for Random MAX-2-XORSAT -- On Quadratic Threshold CSPs -- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming -- Finding the Best CAFE Is NP-Hard -- The Size and Depth of Layered Boolean Circuits -- Lipschitz Unimodal and Isotonic Regression on Paths and Trees -- Ambiguity and Deficiency in Costas Arrays and APN Permutations -- Iterated Shared Memory Models -- Optimal Polygonal Representation of Planar Graphs -- Minimum-Perimeter Intersecting Polygons -- Finding the Smallest Gap between Sums of Square Roots -- Matching Points with Things -- Homotopic Rectilinear Routing with Few Links and Thick Edges -- Tilings Robust to Errors -- Visiting a Sequence of Points with a Bevel-Tip Needle -- Euclidean Prize-Collecting Steiner Forest -- Prize-Collecting Steiner Networks via Iterative Rounding -- Kernelization through Tidying -- Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials -- The Power of Fair Pricing Mechanisms -- Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization -- Some Observations on Holographic Algorithms -- The Interval Constrained 3-Coloring Problem -- Counting Hexagonal Patches and Independent Sets in Circle Graphs -- Approximating Maximum Diameter-Bounded Subgraphs -- Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration -- The Complexity of Counting Eulerian Tours in 4-Regular Graphs -- Efficient Edge Domination on Hole-Free Graphs in Polynomial Time -- Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs -- Rank Selection in Multidimensional Data -- Layered Working-Set Trees -- Lightweight Data Indexing and Compression in External Memory.The papers contained in this volume were presented at the 9th Latin American TheoreticalInformaticsSymposiumheldattheBenitoJu´ arezUniversityofO- aca, Oaxaca City, M´ exico, April 19-23, 2010. The LATIN series of conferences was launched in 1992 to foster the interaction between the Latin American t- oretical computer science community and computer scientists around the world. LATIN 2010wasthe ninth ofa series,after SaoPaulo,Brazil(1992);Valparaiso, Chile (1995); Campinas, Brazil (1998); Punta del Este, Uruguay (2000); C- cun, Mexico (2002); Buenos Aires, Argentina (2004); Valdivia, Chile (2006) and B´ uzios, Rio de Janeiro, Brazil (2008). From the 155 submissions, the Program Committee selected 56 papers for presentation at the conference. The selectionofpaperswasbasedonoriginality, quality, and relevance to theoretical computer science. It is expected that most of these papers will appear in a more complete and polished form in scienti'c journalsinthefuture.Inadditiontothecontributedpapers,thisvolumecontains the abstracts of four invited plenary talks given at the conference by Cristopher Moore, Piotr Indyk, Sergio Rajsbaum, and Leslie Valiant. A special session on the life and work of the late Imre Simon was held. Prof. Simon played a key role in the development of theoretical computer science in Latin American as well as theLATINconference.ThissessionhadcontributionsfromRicardoBaeza-Yates, John Brzozowski, Volker Diekert, and Jacques Sakarovitch.Theoretical Computer Science and General Issues,2512-2029 ;6034Computer programmingComputer networksComputer scienceAlgorithmsArtificial intelligenceComputer scienceMathematicsDiscrete mathematicsProgramming TechniquesComputer Communication NetworksTheory of ComputationAlgorithmsArtificial IntelligenceDiscrete Mathematics in Computer ScienceComputer programming.Computer networks.Computer science.Algorithms.Artificial intelligence.Computer scienceMathematics.Discrete mathematics.Programming Techniques.Computer Communication Networks.Theory of Computation.Algorithms.Artificial Intelligence.Discrete Mathematics in Computer Science.005.11Lopez-Ortiz Alejandro1753894Latin American Symposium on Theoretical Informatics.MiAaPQMiAaPQMiAaPQBOOK9910483600103321LATIN 2010: Theoretical Informatics4521685UNINA