04385nam 2200721 a 450 991044999130332120210603210523.01-282-75919-197866127591920-520-92984-51-59734-926-710.1525/9780520929845(CKB)1000000000007731(EBL)227329(OCoLC)475933822(SSID)ssj0000254209(PQKBManifestationID)11191628(PQKBTitleCode)TC0000254209(PQKBWorkID)10208646(PQKB)11418121(MiAaPQ)EBC227329(OCoLC)56087241(MdBmJHUP)muse30392(DE-B1597)520030(OCoLC)58752357(DE-B1597)9780520929845(Au-PeEL)EBL227329(CaPaEBR)ebr10057118(CaONFJC)MIL275919(EXLCZ)99100000000000773120021024d2003 uy 0engurun#---|u||utxtccrSurviving freedom[electronic resource] after the Gulag /Janusz Bardach and Kathleen GleesonBerkeley University of California Pressc20031 online resource (295 p.)Description based upon print version of record.0-520-23735-8 Front matter --CONTENTS --PREFACE --PROLOGUE --1. VIEW FROM THE EMBASSY WINDOW --2. WAITING FOR TOMORROW --3. JOURNEY TO THE PAST --4. THE HOUSE ON THE HILL --5. FARNA STREET --6. NO MAN'S LAND --7. LYING AND CHEATING --8. GUARDIAN OF THE DEAD --9. MARCHING ON RED SQUARE --10. FIRST FINAL EXAMS --11. POSTWAR POLAND --12. FAMILY OF FRIENDS --13. SUMMER 1947 --14. FINDING MY WAY --15. ENEMIES EVERYWHERE --16. COMING INTO MY OWN --17. ASPIRANTURA --18. LOWER THAN GRASS, QUIETER THAN STILL WATER --19. THE END OF TERROR --EPILOGUE --ACKNOWLEDGMENTSIn 1941, as a Red Army soldier fighting the Nazis on the Belarussian front, Janusz Bardach was arrested, court-martialed, and sentenced to ten years of hard labor. Twenty-two years old, he had committed no crime. He was one of millions swept up in the reign of terror that Stalin perpetrated on his own people. In the critically acclaimed Man Is Wolf to Man, Bardach recounted his horrific experiences in the Kolyma labor camps in northeastern Siberia, the deadliest camps in Stalin's gulag system. In this sequel Bardach picks up the narrative in March 1946, when he was released. He traces his thousand-mile journey from the northeastern Siberian gold mines to Moscow in the period after the war, when the country was still in turmoil. He chronicles his reunion with his brother, a high-ranking diplomat in the Polish embassy in Moscow; his experiences as a medical student in the Stalinist Soviet Union; and his trip back to his hometown, where he confronts the shattering realization of the toll the war has taken, including the deaths of his wife, parents, and sister. In a trenchant exploration of loss, post-traumatic stress syndrome, and existential loneliness, Bardach plumbs his ordeal with honesty and compassion, affording a literary window into the soul of a Stalinist gulag survivor. Surviving Freedom is his moving account of how he rebuilt his life after tremendous hardship and personal loss. It is also a unique portrait of postwar Stalinist Moscow as seen through the eyes of a person who is both an insider and outsider. Bardach's journey from prisoner back to citizen and from labor camp to freedom is an inspiring tale of the universal human story of suffering and recovery.JewsSoviet UnionBiographyJews, PolishSoviet UnionBiographyPlastic surgeonsSoviet UnionBiographyPolitical prisonersSoviet UnionBiographyElectronic books.JewsJews, PolishPlastic surgeonsPolitical prisoners947.085/092BBardach Janusz451194Gleeson Kathleen1032379MiAaPQMiAaPQMiAaPQBOOK9910449991303321Surviving freedom2450200UNINA03023nam 22004935 450 991015867050332120251116170917.0978365816812410.1007/978-3-658-16812-4(CKB)3710000001009154(DE-He213)978-3-658-16812-4(MiAaPQ)EBC4776566(PPN)19834001X(EXLCZ)99371000000100915420170104d2016 u| 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierGeneralized network improvement and packing problems /by Michael Holzhauser1st ed. 2016.Wiesbaden :Springer Fachmedien Wiesbaden :Imprint: Springer Spektrum,2016.1 online resource (XVI, 213 p. 26 illus.)3-658-16812-9 3-658-16811-0 Fractional Packing and Parametric Search Frameworks -- Budget-Constrained Minimum Cost Flows: The Continuous Case -- Budget-Constrained Minimum Cost Flows: The Discrete Case -- Generalized Processing Networks -- Convex Generalized Flows.Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms. Contents Fractional Packing and Parametric Search Frameworks Budget-Constrained Minimum Cost Flows: The Continuous Case Budget-Constrained Minimum Cost Flows: The Discrete Case Generalized Processing Networks Convex Generalized Flows Target Groups Researchers and students in the fields of mathematics, computer science, and economics Practitioners in operations research and logistics The Author Dr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern.Mathematical optimizationAlgorithmsDiscrete Optimizationhttps://scigraph.springernature.com/ontologies/product-market-codes/M26040Algorithmshttps://scigraph.springernature.com/ontologies/product-market-codes/M14018Mathematics of Algorithmic Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/M13130Mathematical optimization.Algorithms.Discrete Optimization.Algorithms.Mathematics of Algorithmic Complexity.519.6Holzhauser Michaelauthttp://id.loc.gov/vocabulary/relators/aut755926BOOK9910158670503321Generalized network improvement and packing problems1523362UNINA