LEADER 00835nam0-22002891i-450- 001 990005600930403321 005 20060710105746.0 035 $a000560093 035 $aFED01000560093 035 $a(Aleph)000560093FED01 035 $a000560093 100 $a19990604d1956----km-y0itay50------ba 101 0 $aita 105 $ay-------001yy 200 1 $aArte e gusto nella musica$edall'Ars Nova a Debussy$fLuigi Ronga 210 $aMilano ; Napoli$cRiccardo Ricciardi$d1956 215 $a427 p.$d24 cm 610 0 $aMusica$aStoria$aSec. 14.-20. 676 $a780.903$v21$zita 700 1$aRonga,$bLuigi$0165188 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990005600930403321 952 $a780.903 RON 1$bST. ARTE 4234$fFLFBC 959 $aFLFBC 996 $aArte e gusto nella musica$9609175 997 $aUNINA LEADER 04318nam 22006375 450 001 996418193503316 005 20200701005230.0 010 $a3-030-35993-X 024 7 $a10.1007/978-3-030-35993-5 035 $a(CKB)5300000000003422 035 $a(DE-He213)978-3-030-35993-5 035 $a(MiAaPQ)EBC6126751 035 $a(PPN)243226047 035 $a(EXLCZ)995300000000003422 100 $a20200302d2020 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aCharge Transport in Low Dimensional Semiconductor Structures$b[electronic resource] $eThe Maximum Entropy Approach /$fby Vito Dario Camiola, Giovanni Mascali, Vittorio Romano 205 $a1st ed. 2020. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2020. 215 $a1 online resource (XVI, 337 p. 83 illus., 23 illus. in color.) 225 1 $aThe European Consortium for Mathematics in Industry ;$v31 311 $a3-030-35992-1 327 $aBand Structure and Boltzmann Equation -- Maximum Entropy Principle -- Application of MEP to Charge Transport in Semiconductors -- Application of MEP to Silicon -- Some Formal Properties of the Hydrodynamical Model -- Quantum Corrections to the Semiclassical Models -- Mathematical Models for the Double-Gate MOSFET -- Numerical Method and Simulations -- Application of MEP to Charge Transport in Graphene. 330 $aThis book offers, from both a theoretical and a computational perspective, an analysis of macroscopic mathematical models for description of charge transport in electronic devices, in particular in the presence of confining effects, such as in the double gate MOSFET. The models are derived from the semiclassical Boltzmann equation by means of the moment method and are closed by resorting to the maximum entropy principle. In the case of confinement, electrons are treated as waves in the confining direction by solving a one-dimensional Schrödinger equation obtaining subbands, while the longitudinal transport of subband electrons is described semiclassically. Limiting energy-transport and drift-diffusion models are also obtained by using suitable scaling procedures. An entire chapter in the book is dedicated to a promising new material like graphene. The models appear to be sound and sufficiently accurate for systematic use in computer-aided design simulators for complex electron devices. The book is addressed to applied mathematicians, physicists, and electronic engineers. It is written for graduate or PhD readers but the opening chapter contains a modicum of semiconductor physics, making it self-consistent and useful also for undergraduate students. 410 0$aThe European Consortium for Mathematics in Industry ;$v31 606 $aMathematical physics 606 $aApplied mathematics 606 $aEngineering mathematics 606 $aNanotechnology 606 $aMathematical Physics$3https://scigraph.springernature.com/ontologies/product-market-codes/M35000 606 $aTheoretical, Mathematical and Computational Physics$3https://scigraph.springernature.com/ontologies/product-market-codes/P19005 606 $aMathematical and Computational Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/T11006 606 $aNanotechnology$3https://scigraph.springernature.com/ontologies/product-market-codes/Z14000 615 0$aMathematical physics. 615 0$aApplied mathematics. 615 0$aEngineering mathematics. 615 0$aNanotechnology. 615 14$aMathematical Physics. 615 24$aTheoretical, Mathematical and Computational Physics. 615 24$aMathematical and Computational Engineering. 615 24$aNanotechnology. 676 $a621.3815284 700 $aCamiola$b Vito Dario$4aut$4http://id.loc.gov/vocabulary/relators/aut$0947750 702 $aMascali$b Giovanni$4aut$4http://id.loc.gov/vocabulary/relators/aut 702 $aRomano$b Vittorio$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996418193503316 996 $aCharge Transport in Low Dimensional Semiconductor Structures$92141812 997 $aUNISA LEADER 05304nam 22007935 450 001 9910726280003321 005 20250305103056.0 010 $a9783031269042$b(electronic bk.) 010 $z9783031269035 024 7 $a10.1007/978-3-031-26904-2 035 $a(MiAaPQ)EBC7253098 035 $a(Au-PeEL)EBL7253098 035 $a(OCoLC)1381711965 035 $a(DE-He213)978-3-031-26904-2 035 $a(PPN)270617094 035 $a(CKB)26773174400041 035 $a(EXLCZ)9926773174400041 100 $a20230523d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms for Constructing Computably Enumerable Sets /$fby Kenneth J. Supowit 205 $a1st ed. 2023. 210 1$aCham :$cSpringer International Publishing :$cImprint: Birkhäuser,$d2023. 215 $a1 online resource (191 pages) 225 1 $aComputer Science Foundations and Applied Logic,$x2731-5762 311 08$aPrint version: Supowit, Kenneth J. Algorithms for Constructing Computably Enumerable Sets Cham : Springer International Publishing AG,c2023 9783031269035 320 $aIncludes bibliographical references. 327 $a1 Index of notation and terms -- 2 Set theory, requirements, witnesses -- 3 What?s new in this chapter? -- 4 Priorities (a splitting theorem) -- 5 Reductions, comparability (Kleene-Post Theorem) -- 6 Finite injury (Friedberg-Muchnik Theorem) -- 7 The Permanence Lemma -- 8 Permitting (Friedberg-Muchnik below C Theorem) -- 9 Length of agreement (Sacks Splitting Theorem) -- 10 Introduction to infinite injury -- 11 A tree of guesses (Weak Thickness Lemma) -- 12 An infinitely branching tree (Thickness Lemma) -- 13 True stages (another proof of the Thickness Lemma) -- 14 Joint custody (Minimal Pair Theorem) -- 15 Witness lists (Density Theorem) -- 16 The theme of this book: delaying tactics -- Appendix A: a pairing function -- Bibliograph -- Solutions to selected exercises. 330 $aLogicians have developed beautiful algorithmic techniques for the construction of computably enumerable sets. This textbook presents these techniques in a unified way that should appeal to computer scientists. Specifically, the book explains, organizes, and compares various algorithmic techniques used in computability theory (which was formerly called "classical recursion theory"). This area of study has produced some of the most beautiful and subtle algorithms ever developed for any problems. These algorithms are little-known outside of a niche within the mathematical logic community. By presenting them in a style familiar to computer scientists, the intent is to greatly broaden their influence and appeal. Topics and features: ˇ All other books in this field focus on the mathematical results, rather than on the algorithms. ˇ There are many exercises here, most of which relate to details of the algorithms. ˇ The proofs involving priority trees are written here in greater detail, and with more intuition, than can be found elsewhere in the literature. ˇ The algorithms are presented in a pseudocode very similar to that used in textbooks (such as that by Cormen, Leiserson, Rivest, and Stein) on concrete algorithms. ˇ In addition to their aesthetic value, the algorithmic ideas developed for these abstract problems might find applications in more practical areas. Graduate students in computer science or in mathematical logic constitute the primary audience. Furthermore, when the author taught a one-semester graduate course based on this material, a number of advanced undergraduates, majoring in computer science or mathematics or both, took the course and flourished in it. Kenneth J. Supowit is an Associate Professor Emeritus, Department of Computer Science & Engineering, Ohio State University, Columbus, Ohio, US. 410 0$aComputer Science Foundations and Applied Logic,$x2731-5762 606 $aComputer science 606 $aComputable functions 606 $aRecursion theory 606 $aSet theory 606 $aComputer science?Mathematics 606 $aTheory of Computation 606 $aComputability and Recursion Theory 606 $aSet Theory 606 $aTheory and Algorithms for Application Domains 606 $aMathematics of Computing 606 $aMatemātica discreta$2thub 606 $aTeoria de conjunts$2thub 606 $aAlgorismes$2thub 608 $aLlibres electrōnics$2thub 615 0$aComputer science. 615 0$aComputable functions. 615 0$aRecursion theory. 615 0$aSet theory. 615 0$aComputer science?Mathematics. 615 14$aTheory of Computation. 615 24$aComputability and Recursion Theory. 615 24$aSet Theory. 615 24$aTheory and Algorithms for Application Domains. 615 24$aMathematics of Computing. 615 7$aMatemātica discreta 615 7$aTeoria de conjunts. 615 7$aAlgorismes 676 $a004.0151 676 $a004.0151 700 $aSupowit$b Kenneth J.$01359561 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 912 $a9910726280003321 996 $aAlgorithms for Constructing Computably Enumerable Sets$93374026 997 $aUNINA