LEADER 03970nam 22006851 450 001 9910459139603321 005 20121024150045.0 010 $a1-4725-9923-3 010 $a1-283-00432-1 010 $a9786613004321 010 $a1-4411-0760-6 024 7 $a10.5040/9781472599230 035 $a(CKB)2560000000058322 035 $a(EBL)655504 035 $a(OCoLC)703137729 035 $a(SSID)ssj0000469964 035 $a(PQKBManifestationID)12150461 035 $a(PQKBTitleCode)TC0000469964 035 $a(PQKBWorkID)10531374 035 $a(PQKB)11764752 035 $a(MiAaPQ)EBC655504 035 $a(Au-PeEL)EBL655504 035 $a(CaPaEBR)ebr10447200 035 $a(CaONFJC)MIL300432 035 $a(OCoLC)704901364 035 $a(UtOrBLW)bpp09258009 035 $a(EXLCZ)992560000000058322 100 $a20150227d2011 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 14$aThe historical present $emedievalism and modernity /$fWalter Kudrycz 210 1$aLondon ;$aNew York :$cContinuum,$d2011. 215 $a1 online resource (257 p.) 300 $aDescription based upon print version of record. 311 $a1-4411-0949-8 311 $a1-4411-1057-7 320 $aIncludes bibliographical references (pages [239]-245) and index. 327 $aMachine generated contents note: 1.Progress, Decline and Fall: Historiography and the Middle Ages in the Age of Reason -- 2.A New Order of Things: Kant, Pre-Romanticism and the Emergence of the Modern Medievalism -- 3.Golden Ages and Perfect Presents: Romanticism, Idealism and the Middle Ages -- 4.Professors and Professionals: Medieval History and the Nineteenth-Century Academic Environment -- 5.As it Really Was: Academic Medieval History into the Twentieth Century -- 6.The Waning of Progress: Radical Historiography into the Twentieth Century -- 7.From Process to Structure: The Annales School and Twentieth-Century Academic Medieval History -- 8.The New Romantics: Literature, Literacy and Late Twentieth-Century Understandings of the Middle Ages -- 9.The Shock of the Old: Medieval History and the Formation of the Current Academic Environment. 330 $a"Medievalism has become a central concern for those studying and teaching medieval history. It can be distinguished from traditional medieval history because it is not directly concerned with the study of the Middle Ages themselves, but rather it looks at how ideas about the medieval era operate in modern culture. This volume breaks new ground by moving beyond the arena of contemporary popular culture by interpreting modern academic attitudes towards the Middle Ages as themselves forms of medievalism. What is presented as refined historical truth is no more than a construction of truth derived from the larger philosophical and cultural trends of our own day. This volume argues that modernity's sense of the medieval past is the product of the dominant intellectual movements of the nineteenth century, Romanticism and Idealism, and that nineteenth century attitudes have continued to inform current understandings of the Middle Ages. This is a narrative that combines the main themes of modern scholarship on the medieval age with a subtly portrayed picture of the philosophical culture which produced them."--Bloomsbury Publishing. 606 $aCivilization, Medieval 606 $aHistory, Modern 606 $aMedievalism 606 $aMiddle Ages$xHistoriography 606 $2History: theory & methods 608 $aElectronic books. 615 0$aCivilization, Medieval. 615 0$aHistory, Modern. 615 0$aMedievalism. 615 0$aMiddle Ages$xHistoriography. 676 $a909.07072 700 $aKudrycz$b Walter$0947522 801 0$bUtOrBLW 801 1$bUtOrBLW 906 $aBOOK 912 $a9910459139603321 996 $aThe historical present$92140889 997 $aUNINA LEADER 01013nam a22002411i 4500 001 991002627949707536 005 20030723143110.0 008 030925s1999 it |||||||||||||||||ita 035 $ab12316118-39ule_inst 035 $aARCHE-036365$9ExL 040 $aBiblioteca Interfacoltà$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a248.4630 100 1 $aSettembrini, Salvatore$0453541 245 13$aLa partecipazione dei latianesi ai pellegrinaggi giubilari nel corso dei secoli /$cSalvatore Settembrini 260 $aLatiano :$bNeografica,$c1999 300 $a1 v. ;$c24 cm 650 4$aLatiano$xStoria$xPellegrini$xGiubilei 907 $a.b12316118$b02-04-14$c08-10-03 912 $a991002627949707536 945 $aLE002 St. XXVI E 37$g1$i2002000092472$lle002$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i12713533$z08-10-03 996 $aPartecipazione dei latianesi ai pellegrinaggi giubilari nel corso dei secoli$9162009 997 $aUNISALENTO 998 $ale002$b08-10-03$cm$da $e-$fita$git $h3$i1 LEADER 02962nam 2200745 450 001 9910163981303321 005 20230810002130.0 010 $a3-95845-511-5 035 $a(CKB)3710000001056423 035 $a(MiAaPQ)EBC4806900 035 $a5c85863f-6db8-4b7b-a8aa-6037b0dd2d03 035 $a(EXLCZ)993710000001056423 100 $a20190909d2017 uy 0 101 0 $ager 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aLinux Mint 18 $ePraxiswissen fu?r Ein- und Umsteiger /$fChristoph Troche 205 $a1., 2017 210 1$aFrechen :$cMitp,$d[2017] 210 4$d©2017 215 $a1 online resource (279 pages) 225 0 $amitp Anwendungen 300 $aIncludes index. 311 $a3-95845-510-7 330 $aLong description: Ganz einfach und Schritt für Schritt auf Linux umsteigen Die Benutzeroberfläche Cinnamon kennenlernen und an die eigenen Bedürfnisse anpassen Windows und Linux Mint parallel betreiben Dieses Buch ermöglicht Ihnen einen problemlosen Start mit Linux Mint 18. Christoph Troche erklärt Ihnen gut nachvollziehbar die verschiedenen Installationsmöglichkeiten von Linux Mint (Live-Version, Festinstallation, allein oder parallel zu Windows) und demonstriert, wie Mint eingerichtet wird. Er macht Sie mit der Arbeitsoberfläche Cinnamon bekannt, so dass Sie direkt loslegen können. Der Autor zeigt Ihnen die Programme, die das Betriebssystem bereits mitbringt und empfiehlt geeignete Alternativen. Im weiteren Verlauf des praxisnahen Buches erhalten Sie wertvolle Informationen und Tipps in Sachen Multimedia, Mobilität, Datensicherung in der Cloud oder Sicherheit Ihres Systems. So hilft Ihnen dieses verständliche Praxisbuch dabei, alltägliche Aufgaben problemlos zu meistern und Linux Mint optimal zu nutzen. 330 $aBiographical note: Christoph Troche ist Fachbuchautor und Linux-User der ersten Stunde. Er legt besonders großen Wert auf die praktische Verwendbarkeit und Benutzerfreundlichkeit seiner Anleitungen. 606 $aWindows 606 $aBetriebssystem 606 $aLinux 606 $aSkype 606 $aTerminal 606 $aKDE 606 $aMATE 606 $aNemo 606 $aWine 606 $axcfe 606 $asarah 606 $aPidgin 606 $aKonsole 606 $aCinnamon 615 00$aWindows 615 00$aBetriebssystem 615 00$aLinux 615 00$aSkype 615 00$aTerminal 615 00$aKDE 615 00$aMATE 615 00$aNemo 615 00$aWine 615 00$axcfe 615 00$asarah 615 00$aPidgin 615 00$aKonsole 615 00$aCinnamon 676 $a005.432 700 $aTroche$b Christoph$01219800 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910163981303321 996 $aLinux Mint 18$92895990 997 $aUNINA LEADER 10749nam 22004693 450 001 996587860503316 005 20240308080228.0 010 $a981-9707-98-6 035 $a(CKB)30597476200041 035 $a(MiAaPQ)EBC31200979 035 $a(Au-PeEL)EBL31200979 035 $a(EXLCZ)9930597476200041 100 $a20240308d2024 uy 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Architectures for Parallel Processing $e23rd International Conference, ICA3PP 2023, Tianjin, China, October 20-22, 2023, Proceedings, Part III 205 $a1st ed. 210 1$aSingapore :$cSpringer,$d2024. 210 4$d©2024. 215 $a1 online resource (524 pages) 225 1 $aLecture Notes in Computer Science Series ;$vv.14489 311 $a981-9707-97-8 327 $aIntro -- Preface -- Organization -- Contents - Part III -- Addressing Coupled Constrained Reinforcement Learning via Interative Iteration Design -- 1 Introduction -- 2 Preliminaries -- 2.1 Coupled Constrained Markov Decision Process -- 2.2 Policy Gradient -- 3 InIt for Decoupling High-Dimensional Coupled Action Space -- 3.1 InIt Design -- 3.2 InIt-Based Solution -- 3.3 Extension to High-Dimensional Action Space -- 4 Experiments -- 4.1 Experiment Setups -- 4.2 Baselines -- 4.3 Performance Evaluation -- 5 Conclusion and Future Work -- References -- A Path Planning and Obstacle Avoidance Method for USV Based on Dynamic-Target APF Algorithm in Edge -- 1 Introduction -- 2 Related Works -- 3 System Design and Environment Modeling -- 3.1 System Overview -- 3.2 Environment Modeling -- 4 Algorithm Design -- 4.1 Improved A* Algorithm -- 4.2 Improved APF Algorithm -- 4.3 DTAPF Method -- 4.4 Offset Guidance -- 5 Evaluation -- 5.1 Simulation Environment Configurations -- 5.2 Performance of Algorithms -- 5.3 Verification of System Architecture -- 6 Conclusion -- References -- Node-Disjoint Paths in Balanced Hypercubes with Application to Fault-Tolerant Routing -- 1 Introduction -- 2 Preliminaries -- 3 Node-Disjoint Paths -- 3.1 The Mixed Sequence -- 3.2 Construction of Node-Disjoint Paths -- 4 Simulations and Performance Evaluation -- 5 Conclusion -- References -- Performance Evaluation of Spark, Ray and MPI: A Case Study on Long Read Alignment Algorithm -- 1 Introduction -- 2 Methods -- 2.1 Parallel Algorithm Design -- 2.2 Index Sharing -- 2.3 Sequence Segmentation -- 2.4 Parallel Alignment -- 2.5 Asynchronous Output -- 3 Results -- 3.1 Experimental Setup -- 3.2 Input Data -- 3.3 Results Consistency -- 3.4 Strong Scalability -- 3.5 Weak Scalability and Peak RAM Memory -- 3.6 Efficiency -- 3.7 Throughput -- 3.8 Latency -- 3.9 Load Balance -- 4 Related Work. 327 $a5 Discussion -- 6 Conclusion -- References -- Fairness Analysis and Optimization of BBR Congestion Control Algorithm -- 1 Introduction -- 2 Related Work -- 3 Problem Analysis -- 3.1 RTT Fairness in BBR Algorithm -- 4 Algorithm Optimization -- 5 Experiment -- 5.1 Experimental Setup -- 5.2 Results on RTT Fairness -- 6 Conclusion -- References -- Accelerating QUIC with AF_XDP -- 1 Introduction -- 2 Background -- 2.1 QUIC Acceleration -- 2.2 Network Stack Optimization -- 2.3 eBPF and AF_XDP -- 2.4 AF_XDP Datapath -- 3 Design and Implementation -- 3.1 Overview -- 3.2 Architecture -- 3.3 Implementation -- 4 Evaluation -- 4.1 Experiment Setup -- 4.2 QUIC Performance -- 4.3 CPU Usage -- 4.4 Network Policy -- 5 Discussion -- 6 Conclusion -- References -- Segmenta: Pipelined BFT Consensus with Slicing Broadcast -- 1 Introduction -- 2 Related Work -- 3 Analysis and Design -- 3.1 Directly Apply RBC Module in Hotstuff -- 3.2 Design to Reduce the Additional Communication Round -- 4 System Model -- 5 The Segmenta Protocol -- 5.1 Segmenta-Specific Data Structures -- 5.2 Segmenta Phases -- 5.3 Safety, Liveness, and Communication Complexity -- 5.4 Echoing Shards Optimistically -- 6 Chained Segmenta Protocol -- 7 Evaluation -- 7.1 Experimental Setup -- 7.2 Prediction Model -- 7.3 Throughput and Latency -- 8 Conclusion -- References -- Synthetic Data Generation for Differential Privacy Using Maximum Weight Matching -- 1 Introduction -- 2 Related Work -- 3 Preliminary -- 3.1 Problem Statement -- 3.2 Differential Privacy -- 4 Our Solution -- 4.1 Construction of Attribute Graph -- 4.2 Marginal Selection -- 4.3 PostProcess -- 4.4 Data Synthesis -- 5 Experiments -- 5.1 Experimental Settings -- 5.2 Experimental Results -- 6 Conclusion -- A Proof of Lemma -- References -- Approximate Multicast Coflow Scheduling in Reconfigurable Data Center Networks -- 1 Introduction. 327 $a2 Problem Formulation -- 2.1 System Model -- 2.2 Circuit Scheduling Model -- 2.3 Problem Formulation -- 3 The Delay-Efficient Multicast Coflow Scheduling Algorithm -- 3.1 Multicast Coflow Scheduling -- 3.2 Circuit Scheduling -- 3.3 Approximation Ratio Analysis -- 4 Numerical Evaluation -- 4.1 Simulation Settings -- 4.2 Performance Evaluation -- 5 Related Work -- 6 Conclusion -- References -- DAS: A DRAM-Based Annealing System for Solving Large-Scale Combinatorial Optimization Problems -- 1 Introduction -- 2 Background -- 2.1 Ising Model -- 2.2 The Overview of DRAM -- 2.3 In-DRAM Bulk Bitwise Operations -- 3 DAS: Detailed Design -- 3.1 An Overview of DAS -- 3.2 Spin Propagation Between Spin Nodes -- 3.3 Calculation of Local Search Term -- 3.4 Design of Probability Flipping -- 4 Evaluation and Applications -- 4.1 Area Overhead -- 4.2 Application and Analysis -- 5 Conclusion -- References -- Graph Neural Network for Critical Class Identification in Software System -- 1 Summary -- 2 Related Works -- 2.1 Research on the Importance of Nodes in Complex Networks -- 2.2 Research on Key Node Identification in Software Network -- 3 Basic Theory -- 3.1 Node Feature Extraction Based on Direct Extrapolation Graph Neural Network -- 3.2 Node Feature Extraction Based on Inductive Graph Neural Network -- 4 Research methods -- 4.1 Modeling Class dependency network -- 4.2 Network Embedding Learning -- 4.3 Key Class Identification -- 5 Experimental Analysis -- 5.1 Experiment Data -- 5.2 Experiment Setup -- 5.3 Analysis of Experimental Results -- 6 Conclusion -- References -- Spatio-Temporal Fusion Based Low-Loss Video Compression Algorithm for UAVs with Limited Processing Capability -- 1 Introduction -- 2 System Overview -- 3 Algorithm Design -- 3.1 Feature Clustering Based Temporal Video Sampling -- 3.2 Dynamic Encoding Based Spatial Video Sampling -- 4 Evaluation. 327 $a4.1 Experimental Setup -- 4.2 Experimental Results -- 5 Implementation -- 6 Related Work -- 7 Conclusion -- References -- CRAFT: Common Router Architecture for Throughput Optimization -- 1 Introduction -- 2 Related Work -- 3 The Proposed Viaduct Theory in Throughput Optimization -- 3.1 Viaduct Theory in Throughput Optimization -- 3.2 Comparison of Ring Decouple Theory and Viaduct Theory in Low-Cost Router -- 4 A Common Router Architecture for Throughput Optimization Based on Viaduct Theory -- 4.1 Flow Control Optimization with Viaduct Theory -- 4.2 Pipeline Stage and Latency Optimization -- 4.3 High Throughput Optimization with Viaduct Theory -- 4.4 Low Hardware Cost with Viaduct Theory -- 4.5 Bypass Strategy for Low Workload -- 5 Experiment Results -- 5.1 For Low-Cost Program -- 5.2 For High-Performance Program -- 5.3 Hardware Overhead -- 6 Conclusion -- References -- A Cross-Chain System Supports Verifiable Complete Data Provenance Queries -- 1 Introduction -- 2 Related Work -- 2.1 Query Function -- 2.2 Verifiable Query -- 2.3 Cross-Chain Technology -- 3 Preliminaries -- 3.1 Preliminary Knowledge -- 3.2 System Components -- 4 Solution -- 4.1 Verifiable Complete Data Provenance Query -- 4.2 Efficient Query -- 5 Experiment -- 5.1 Experimental Setup -- 5.2 Results and Discussion -- 6 Conclusion -- References -- Enabling Traffic-Differentiated Load Balancing for Datacenter Networks -- 1 Introduction -- 2 Motivation -- 3 TDLB Design -- 3.1 Design Overview -- 3.2 Design Rationale -- 3.3 Design Detail -- 4 Evaluation -- 4.1 Performce Under Symmetric Topology -- 4.2 Performance Under Asymmetric Topology -- 5 Related Work -- 6 Conclusion -- References -- Deep Reinforcement Learning Based Load Balancing for Heterogeneous Traffic in Datacenter Networks -- 1 Introduction -- 2 Background and Motivation -- 2.1 Background -- 2.2 Motivation -- 3 DRLB Design. 327 $a3.1 Design Overview -- 3.2 Design Detail -- 4 Experimental Results and Evaluation -- 4.1 Experimental Setup -- 4.2 Evaluation of Experimental Results -- 5 Related Works -- 6 Conclusion -- References -- Adaptive Routing for Datacenter Networks Using Ant Colony Optimization -- 1 Inroduction -- 2 Background and Motivation -- 2.1 Background -- 2.2 Motivation -- 2.3 Summary -- 3 RACO Design -- 3.1 RACO Overview -- 3.2 Statistics Module -- 3.3 Calculation Module -- 3.4 Algorithm Pseudocode -- 4 Performance Evaluation -- 4.1 Experimental Setup -- 4.2 Performance Under Symmetrical Topology -- 4.3 Performance Under Asymmetric Topology -- 5 Related Work -- 6 Conclusion -- References -- MPC: A Novel Internal Clustering Validity Index Based on Midpoint-Involved Distance -- 1 Introduction -- 2 MPdist: A Midpoint-Involved Distance -- 3 MPC: An Internal CVI Based on MPdist -- 3.1 The Definition of MPC -- 3.2 The Analysis of Time Complexity -- 4 Experimental Results -- 4.1 Description of the Test Datasets -- 4.2 Performances of CVIs on Evaluating the Results of the AHC -- 4.3 Performances of CVIs on Evaluating the Results of the K-Means -- 4.4 Performance Evaluation by Real Large-Scale Datasets -- 5 Conclusion and Future Works -- References -- HAECN: Hierarchical Automatic ECN Tuning with Ultra-Low Overhead in Datacenter Networks -- 1 Introduction -- 2 Motivation -- 3 HAECN Design -- 3.1 HAECN Overview -- 3.2 Design Details of HAECN -- 3.3 Reinforcement Learning Agent in HAECN -- 3.4 Learning Algorithm in HAECN -- 4 Implementation -- 5 Evaluation -- 5.1 Performance Under Bursty Networks -- 5.2 Performance Under Gradual Stabilization Network Environments -- 6 Related Work -- 7 Conclusion -- References -- An Android Malware Detection Method Based on Metapath Aggregated Graph Neural Network -- 1 Introduction -- 2 Related Work -- 3 Our Approach. 327 $a3.1 Feature Engineering. 410 0$aLecture Notes in Computer Science Series 700 $aTari$b Zahir$0845849 701 $aLi$b Keqiu$0763560 701 $aWu$b Hongyi$01730694 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996587860503316 996 $aAlgorithms and Architectures for Parallel Processing$94142072 997 $aUNISA