01310nam--2200361---450-99000244633020331620090824090304.088-14-11573-7000244633USA01000244633(ALEPH)000244633USA0100024463320050628d2004----km-y0enga50------baitaIT||||||||001yyRegioni e attività produttive3. rapporto sulla legislazione e sulla spesa 2003MilanoGiuffrè2004IX, 487 p.24 cmQuaderni per la ricercaIstituto di studi sui sistemi regionali federali e sulle autonomie Massimo Severo Giannini3Quaderni per la ricercaIstituto di studi sui sistemi regionali federali e sulle autonomie Massimo Severo Giannini20013EconomiaLegislazione regionalePeriodici343.450705ITsalbcISBD990002446330203316XXIV.2.G 51 (IG IV 1654)45495 G.XXIV.2.G 51 (IG IV)00130807BKGIUMARIASEN9020050628USA011824RSIAV59020090824USA010903CHIARA9020110520USA011318Regioni e attività produttive679548UNISA01020nam0 22002533i 450 VAN007547920100518120000.020100518d1914 |0itac50 baitaIT|||| |||||ˆLa ‰cattedrale modenese preesistente all'attualeprimo ragguaglio sugli scavi del Duomo, agosto-settembre 1913Giulio Bertoni2. edModenaOrlandini191431 p., [1] c. di tav. ripieg.ill.25 cm.ModenaVANL000023BertoniGiulioVANV064438158355OrlandiniVANV113178650ITSOL20230616RICABIBLIOTECA DEL DIPARTIMENTO DI LETTERE E BENI CULTURALIIT-CE0103VAN07VAN0075479BIBLIOTECA DEL DIPARTIMENTO DI LETTERE E BENI CULTURALI07CONS Bb Modena 167 07 14524 Pepper 20100518 Cattedrale modenese preesistente all'attuale296738UNICAMPANIA02466nam0 22004933i 450 VAN0015736820250124102440.517N978331925829420210611d2016 |0itac50 baengCH|||| |||||Artificial Gauge Fields with Ultracold Atoms in Optical LatticesDoctoral Thesis accepted by Ludwig-Maximilians-Universität München, GermanyMonika AidelsburgerChamSpringer2016xiii, 172 p.ill.24 cm001VAN001041932001 Springer thesesrecognizing outstanding Ph.D. research210 BerlinSpringer2010-VAN00157369Artificial Gauge Fields with Ultracold Atoms in Optical Lattices180058500A79 (77-XX)Physics [MSC 2020]VANC023182MF54H12Topological lattices, etc. (topological aspects) [MSC 2020]VANC036390MF81-XXQuantum theory [MSC 2020]VANC019967MF81T13Yang-Mills and other gauge theories in quantum field theory [MSC 2020]VANC023357MF81V45Atomic physics [MSC 2020]VANC023266MF81V70Many-body theory; quantum Hall effect [MSC 2020]VANC028646MF82-XXStatistical mechanics, structure of matter [MSC 2020]VANC021931MFArtificial magnetic fieldsKW:KBose-Einstein CondensatesKW:KChern numbersKW:KHarper-Hofstadter ModelKW:KHofstadter modelKW:KLaser-assisted tunnelingKW:KOptical lattices and superlatticesKW:KPeriodically driven systemsKW:KQuantum gasKW:KCHChamVANL001889AidelsburgerMonikaVANV140673799827Springer <editore>VANV108073650ITSOL20250131RICAhttp://doi.org/10.1007/978-3-319-25829-4E-book – Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o ShibbolethBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICAIT-CE0120VAN08NVAN00157368BIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA08DLOAD e-book 2655 08eMF2655 20210611 Artificial Gauge Fields with Ultracold Atoms in Optical Lattices1800585UNICAMPANIA08079nam 2200721 a 450 991101952010332120200520144314.0978661093525397812809352511280935251978047016868404701686849780470168677047016867610.1002/9780470168684(CKB)1000000000355814(EBL)309751(SSID)ssj0000182448(PQKBManifestationID)11167763(PQKBTitleCode)TC0000182448(PQKBWorkID)10172250(PQKB)10281900(MiAaPQ)EBC309751(CaBNVSL)mat05201523(IDAMS)0b0000648104a9d5(IEEE)5201523(OCoLC)181348311(PPN)255939876(Perlego)2751043(EXLCZ)99100000000035581420070124d2007 uy 0engur|n|---|||||txtccrAn introduction to communication network analysis /George KesidisHoboken, N.J. Wiley-Intersciencec20071 online resource (248 p.)Description based upon print version of record.9780471371410 0471371416 Includes bibliographical references (p. 221-232).Preface -- 1. Review of Elementary Probability Theory -- 1.1 Sample space, events and probabilities -- 1.2 Random variables -- 1.3 Cumulative distribution functions, expectation and moment generating functions -- 1.4 Discretely distributed random variables -- 1.4.1 The Bernoulli distribution -- 1.4.2 The geometric distribution -- 1.4.3 The binomial distribution -- 1.4.4 The Poisson distribution -- 1.4.5 The discrete uniform distribution -- 1.5 Continuously distributed random variables -- 1.5.1 The continuous uniform distribution -- 1.5.2 The exponential distribution -- 1.5.3 The gamma distribution -- 1.5.4 The Gaussian (or normal) distribution -- 1.6 Some useful inequalities -- 1.7 Joint distribution functions -- 1.7.1 Joint PDF -- 1.7.2 Marginalizing a joint distribution -- 1.8 Conditional expectation -- 1.9 Independent random variables -- 1.9.1 Sums of independent random variables -- 1.10 Conditional independence -- 1.11 A law of large numbers -- 1.12 First order autoregressive estimators -- 1.13 Measures of separation between distributions -- 1.14 Statistical confidence -- 1.14.1 A central limit theorem -- 1.14.2Confidence intervals -- 1.14.3Recursive formulas and a stopping criterion -- 1.15 Deciding between two alternative claims -- Problems -- 2. Markov Chains -- 2.1 Memoryless property of the exponential distribution -- 2.2 Finite dimensional distributions and stationarity -- 2.3 The Poisson (counting) process on R+ -- 2.4 Continuous-time, time-homogeneous, Markov processes with countable state-space -- 2.4.1 The Markov property -- 2.4.2 Sample-path construction of a time-homogeneous, continuous-time Markov chain -- 2.4.3 The transition rate matrix and transition rate diagram -- 2.4.4 The Kolmogorov equations -- 2.4.5 The balance equations for the stationary distribution -- 2.4.6 Transience and recurrence -- 2.4.7 Convergence in distribution to steady-state -- 2.4.8 Time-reversibility and the detailed balance equation2.5 Birth-death Markov chains -- 2.5.1 Birth-death processes with finite state-space -- 2.5.2 Birth-death processes with infinite state-space -- 2.5.3 Applications of forward equations -- 2.6 Modeling time-series data using a Markov chain -- 2.7 Simulating a Markov chain -- 2.8 Overview of discrete-time Markov chains -- 2.9 Martingales adapted to discrete-time Markov chains -- Problems -- 3. Introduction to Queueing Theory -- 3.1 Arrivals, departures and queue occupancy -- 3.2 Lossless queues -- 3.2.1 No waiting room -- 3.2.2 Single-server queue -- 3.2.3 Single-server and constant service times -- 3.2.4 Single-server and general service times -- 3.3 A queue described by an underlying Markov chain -- 3.4 Stationary queues -- 3.4.1 Point processes and queues on R -- 3.4.2 Stationary and synchronous versions of a marked point process -- 3.4.3 Poisson arrivals see time-averages -- 3.4.4 Little's result -- 3.5 Erlang's blocking formula for the M/M/K/K queue -- 3.6 Overview of discrete-time queues -- Problems -- 4. Local Multiplexing -- 4.1 Internet router architecture -- 4.1.1 Big picture of an IP (layer 3) router -- 4.1.2 Ingress linecard -- 4.1.3 Switch fabric -- 4.1.4 Egress linecard -- 4.2 Token (leaky) buckets for packet-traffic regulation -- 4.3 Multiplexing flows of variable-length packets -- 4.3.1 Multiplexing with a single FIFO queue -- 4.3.2 Strict priority -- 4.3.3 Deficit Round-Robin (DRR) -- 4.3.4 Shaped Virtual Clock (SVC) -- 4.4 Service curves -- 4.5 Connection multiplexing on a single trunk -- 4.6 A game-theoretic framework for multiplexing packet flows -- 4.7 Discussion: local medium access control of a single wireless channel -- Problems -- 5. Queueing networks with static routing -- 5.1 Loss Networks -- 5.1.1 Fixed route arrival rates -- 5.1.2 Exact expression for connection blocking -- 5.1.3 Fixed point iteration for approximate connection blocking -- 5.2 Stable open networks of queues -- 5.2.1 Flow balance equation5.2.2 Open Jackson networks -- Problems -- 6. Dynamic Routing and Routing with Incentives -- 6.1 General routing issues -- 6.1.1 Discussion: IP forwarding -- 6.1.2 Discussion: MPLS -- 6.2 Unconstrained optimization -- 6.3 Revenue maximization for loss networks -- 6.4 Constrained optimization and duality -- 6.5 A distributed pricing and resource management framework -- 6.6 Discussion: joint scheduling and routing in multihop wireless networks -- 6.7 Multipath load balancing -- Problems -- 7. Peer-to-Peer File Sharing with Incentives -- 7.1 Summary of query resolution -- 7.2 Unstructured query resolution -- 7.2.1 A centralized approach -- 7.2.2 A decentralized approach: limited-scope flooding and reverse-path forwarding -- 7.2.3 A hybrid approach -- 7.2.4 An example of search by random walk -- 7.3 Structured query resolution -- 7.3.1 A "Voronoi" structured P2P framework -- 7.3.2 Specific Voronoi approaches -- 7.3.3 Variations in the design of search, including Chord -- 7.3.4 The Kademlia example -- 7.3.5 Spatial neighbor-to-neighbor graphs -- 7.4 Discussion: security issues -- 7.5 Incentives for cooperation when downloading -- 7.5.1 Rule-based incentives of BitTorrent-like swarms -- 7.5.2 Cumulative reputations -- 7.5.3 Trust groups for scalability and reliability -- 7.5.4 Discussion: P2P games -- Problems -- References -- Appendix A: Additional Background on Routing -- A.1 Network graph terminology -- A.2 Link-state algorithms -- A.3 The Bellman-Ford approach -- Appendix B: Solutions or References for Selected Problems -- ReferenceThis book is a quantitative text, which focuses on the real issues behind serious modeling and analysis of communications networks. The author covers all the necessary mathematics and theory in order for students to understand the tools that optimize computer networks today. . Covers both classical (e.g. queueing theory) and modern (e.g. pricing) aspects of networking. Integrates material on communication networks with material on modeling/analyzing and designing such networks. Includes a Solution ManualCommunication network analysisTelecommunicationTrafficTextbooksNetwork performance (Telecommunication)TextbooksSwitching theoryTextbooksTelecommunicationTrafficNetwork performance (Telecommunication)Switching theory621.382/1Kesidis George1619514MiAaPQMiAaPQMiAaPQBOOK9911019520103321An introduction to communication network analysis3951798UNINA