02761nam 22005894a 450 991045504000332120200520144314.00-520-92578-51-59734-867-8(CKB)111056485641990(EBL)223016(OCoLC)475926938(SSID)ssj0000237407(PQKBManifestationID)11188321(PQKBTitleCode)TC0000237407(PQKBWorkID)10191585(PQKB)10694416(StDuBDS)EDZ0000084651(MiAaPQ)EBC223016(Au-PeEL)EBL223016(CaPaEBR)ebr10053506(EXLCZ)9911105648564199020000714d2001 ub 0engur|n|---|||||txtccrReturning cycles[electronic resource] contexts for the interpretation of Schubert's impromptus and last sonatas /Charles FiskBerkeley University of California Pressc20011 online resource (324 p.)California studies in 19th century music ;11Description based upon print version of record.0-520-22564-3 Includes bibliographical references and index.Preliminaries; Contents; Acknowledgments; Prologue: Schubert after Winterreise; 1. Resonant Beginnings; 2. Fields of Resonance; 3. The Wanderer's Tracks; 4. Retelling the "Unfinished"; 5. Expanding the Scope of Schubertian Tonality; 6. Displacing the Sonata: The Opus 142 Impromptus; 7. Beethoven in the Image of Schubert; 8. Recovering a Song of Origin; 9. Schubert's Last "Wanderer"; Afterword; Notes; IndexThis compelling investigation of the later music of Franz Schubert explores the rich terrain of Schubert's impromptus and last piano sonatas. Drawing on the relationships between these pieces and Schubert's Winterreise song cycle, his earlier ""Der Wanderer,"" the closely related ""Unfinished"" Symphony, and his story of exile and homecoming, ""My Dream,"" Charles Fisk explains how Schubert's view of his own life may well have shaped his music in the years shortly before his death.California studies in 19th century music ;11.Piano musicAnalysis, appreciationSonatas (Piano)Analysis, appreciationElectronic books.Piano musicAnalysis, appreciation.Sonatas (Piano)Analysis, appreciation.786.2/1894/092Fisk Charles958832MiAaPQMiAaPQMiAaPQBOOK9910455040003321Returning cycles2172509UNINA06071nam 22008055 450 99646538820331620200705230904.03-540-27821-410.1007/b99805(CKB)1000000000212503(SSID)ssj0000104941(PQKBManifestationID)11128569(PQKBTitleCode)TC0000104941(PQKBWorkID)10085692(PQKB)10519496(DE-He213)978-3-540-27821-4(MiAaPQ)EBC3088816(PPN)155228269(EXLCZ)99100000000021250320121227d2004 u| 0engurnn|008mamaatxtccrApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques[electronic resource] 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA August 22-24, 2004 , Proceedings /edited by Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron1st ed. 2004.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2004.1 online resource (X, 434 p.) Lecture Notes in Computer Science,0302-9743 ;3122Bibliographic Level Mode of Issuance: Monograph3-540-22894-2 Includes bibliographical references at the end of each chapters and index.Contributed Talks of APPROX -- Designing Networks with Existing Traffic to Support Fast Restoration -- Simultaneous Source Location -- Computationally-Feasible Truthful Auctions for Convex Bundles -- Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks -- On the Crossing Spanning Tree Problem -- A 3/4-Approximation Algorithm for Maximum ATSP with Weights Zero and One -- Maximum Coverage Problem with Group Budget Constraints and Applications -- The Greedy Algorithm for the Minimum Common String Partition Problem -- Approximating Additive Distortion of Embeddings into Line Metrics -- Polylogarithmic Inapproximability of the Radio Broadcast Problem -- On Systems of Linear Equations with Two Variables per Equation -- An Auction-Based Market Equilibrium Algorithm for the Separable Gross Substitutability Case -- Cost-Sharing Mechanisms for Network Design -- Approximating Max k CSP Using Random Restrictions -- Approximation Schemes for Broadcasting in Heterogenous Networks -- Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks -- Convergence Issues in Competitive Games -- Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem -- Min-Max Multiway Cut -- Contributed Talks of RANDOM -- The Chromatic Number of Random Regular Graphs -- Estimating the Distance to a Monotone Function -- Edge Coloring with Delays -- Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption -- The Sketching Complexity of Pattern Matching -- Non-Abelian Homomorphism Testing, and Distributions Close to Their Self-convolutions -- Robust Locally Testable Codes and Products of Codes -- A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes -- Strong Refutation Heuristics for Random k-SAT -- Counting Connected Graphs and Hypergraphs via the Probabilistic Method -- Improved Randomness Extraction from Two Independent Sources -- The Diameter of Randomly Perturbed Digraphs and Some Applications -- Maximum Weight Independent Sets and Matchings in Sparse Random Graphs -- Estimating Frequency Moments of Data Streams Using Random Linear Combinations -- Fooling Parity Tests with Parity Gates -- Distribution-Free Connectivity Testing -- Testing the Independence Number of Hypergraphs -- A Note on Approximate Counting for k-DNF.Lecture Notes in Computer Science,0302-9743 ;3122ComputersComputer scienceAlgorithmsComputer science—MathematicsNumerical analysisTheory of Computationhttps://scigraph.springernature.com/ontologies/product-market-codes/I16005Computer Science, generalhttps://scigraph.springernature.com/ontologies/product-market-codes/I00001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Discrete Mathematics in Computer Sciencehttps://scigraph.springernature.com/ontologies/product-market-codes/I17028Numeric Computinghttps://scigraph.springernature.com/ontologies/product-market-codes/I1701XAlgorithmshttps://scigraph.springernature.com/ontologies/product-market-codes/M14018Computers.Computer science.Algorithms.Computer science—Mathematics.Numerical analysis.Theory of Computation.Computer Science, general.Algorithm Analysis and Problem Complexity.Discrete Mathematics in Computer Science.Numeric Computing.Algorithms.004.0151Jansen Klausedthttp://id.loc.gov/vocabulary/relators/edtKhanna Sanjeevedthttp://id.loc.gov/vocabulary/relators/edtRolim José D. Pedthttp://id.loc.gov/vocabulary/relators/edtRon Danaedthttp://id.loc.gov/vocabulary/relators/edtInternational Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsMiAaPQMiAaPQMiAaPQBOOK996465388203316Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques772207UNISA