01277nam a2200325 i 450099100190949970753620020503154836.0000505s1971 it 000 0 ita db10289896-39ule_instEXGIL93514ExLBiblioteca Interfacoltàita301.092301Cassano, Franco119189Autocritica della sociologia contemporanea :Weber, Mills, Habermas /Franco CassanoBari :De Donato,1971203 p. ;21 cmIdeologia e societàSociologiaHabermas, JurgenMills, Charles WrightWeber, Max.b1028989617-02-1727-06-02991001909499707536LE005IF XIX F 1612005000048289le005-E0.00-l- 00000.i1106736628-06-02LE002 Ps. II L 1512002000557803le002-E0.00-l- 00000.i1034279527-06-02LE022 MPs-S 114 A 1812022000168328le022-E0.00-l- 00000.i1320709x19-03-04Autocritica della sociologia contemporanea89225UNISALENTOle005le002le02201-01-00ma -itait 0301633nam 2200505 450 991082025180332120230807215330.01-943047-00-6(CKB)3710000000407482(EBL)3139036(SSID)ssj0001483893(PQKBManifestationID)12626165(PQKBTitleCode)TC0001483893(PQKBWorkID)11429956(PQKB)11317994(MiAaPQ)EBC3139036(Au-PeEL)EBL3139036(CaPaEBR)ebr11048898(OCoLC)922998715(EXLCZ)99371000000040748220141113h20152015 uy| 0engur|n|---|||||txtccrThe critique's contradiction as the key to post-Kantianism Longuenesse and the collapse of Kant's distinction between sensibility and the understanding /Daniel AddisonAurora, Colorado :Davies Group, Publishers,[2015]©20151 online resource (218 p.)New studies in idealismDescription based upon print version of record.1-934542-46-6 Includes bibliographical references and index.Sensitivity (Personality trait)Sensitivity (Personality trait)193Addison Daniel1978-1715749MiAaPQMiAaPQMiAaPQBOOK9910820251803321The critique's contradiction as the key to post-Kantianism4110649UNINA06311nam 22006615 450 991048504130332120251226195227.03-642-41527-X10.1007/978-3-642-41527-2(CKB)3710000000024424(SSID)ssj0001049422(PQKBManifestationID)11622855(PQKBTitleCode)TC0001049422(PQKBWorkID)11019461(PQKB)11475072(DE-He213)978-3-642-41527-2(MiAaPQ)EBC3093125(PPN)176116516(EXLCZ)99371000000002442420131004d2013 u| 0engurnn#008mamaatxtccrDistributed Computing 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013, Proceedings /edited by Yehuda Afek1st ed. 2013.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2013.1 online resource (XXIV, 586 p. 54 illus.)Theoretical Computer Science and General Issues,2512-2029 ;8205Bibliographic Level Mode of Issuance: Monograph3-642-41526-1 Distributed Minimum Cut Approximation -- When Distributed Computation Is Communication Expensive -- An O(√n) Space Bound for Obstruction-Free Leader Election -- Distributed Protocols for Leader Election: A Game-Theoretic Perspective -- Compact Deterministic Self-stabilizing Leader Election: The Exponential Advantage of Being Talkative -- Time Optimal Synchronous Self Stabilizing Spanning Tree -- Proving Non-opacity -- Exploiting Locality in Lease-Based Replicated Transactional Memory via Task Migration -- Generic Multiversion STM -- Practical Parallel Nesting for Software Transactional Memory -- Asynchronous Resilient Linearizability -- Fair Synchronization -- Gossip Protocols for Renaming and Sorting -- Faster Rumor Spreading: Breaking the log n Barrier -- Lock-Free Data-Structure Iterators -- Practical Non-blocking Unordered Lists -- Atomic Snapshots in O(log3 n) Steps Using Randomized Helping -- Adaptive Register Allocation with a Linear Number of Registers -- An Optimal Implementation of Fetch-and-Increment -- On Barriers and the Gap between Active and Passive Replication -- Conflict Resolution and Membership Problem in Beeping Channels -- Frequency Hopping against a Powerful Adversary -- Sleeping Experts in Wireless Networks -- Broadcast in the Ad Hoc SINR Model -- Distributed Randomized Broadcasting in Wireless Networks under the SINR Model -- Asynchronous Multiparty Computation with Linear Communication Complexity -- Secure End-to-End Communication with Optimal Throughput and Resilience against Malicious Adversary -- On the Communication Complexity of Distributed Name-Independent Routing Schemes -- Convergence in (Social) Influence Networks -- Trustful Population Protocols -- Prudent Opportunistic Cognitive Radio Access Protocols -- Braess’s Paradox in Wireless Networks: The Danger of Improved Technology -- Fast Structuring of Radio Networks Large for Multi-message Communications -- In-Network Analytics for Ubiquitous Sensing -- A Super-Fast Distributed Algorithm for BipartiteMetric Facility Location -- CONE-DHT: A Distributed Self-stabilizing Algorithm for a Heterogeneous Storage System -- Brief Announcement: Distributed MST in Core-Periphery Networks -- Brief Announcement: Enhancing Permissiveness in Transactional Memory via Time-Warping -- Brief Announcement: ParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List -- Brief Anouncement: The Topology of Asynchronous Byzantine Colorless Tasks -- Brief Announcement: Revisiting Dynamic Distributed Systems -- Brief Announcement: Computing in the Presence of Concurrent Solo Executions -- Brief Announcement: A Concurrent Lock-Free Red-Black Tree -- Brief Announcement: A General Technique for Non-blocking Trees -- Brief Announcement: Communication-Efficient Byzantine Consensus without a Common Clock -- Brief Announcement: Consistency and Complexity Tradeoffs for Highly-Available Multi-cloud Store -- Brief Announcement: BFT Storage with 2t + 1 Data Replicas -- Brief Announcement: Private Channel Models in Multi-party Communication Complexity -- Vinod Vaikuntanathan Brief Announcement: Certified Impossibility Results for Byzantine-Tolerant Mobile Robots -- Brief Announcement: Distributed Compressed Sensing for Sensor Networks -- Brief Announcement: Towards Distributed and Reliable Software Defined Networking -- Brief Announcement: Dynamic Forwarding Table Aggregation without Update Churn: The Case of Dependent Prefixes.This book constitutes the proceedings of the 27th International Symposium on Distributed Computing, DISC 2013, held in Jerusalem, Israel, in October 2013. The 27 full papers presented in this volume were carefully reviewed and selected from 142 submissions; 16 brief announcements are also included. The papers are organized in topical sections named: graph distributed algorithms; topology, leader election, and spanning trees; software transactional memory; shared memory executions; shared memory and storage; gossip and rumor; shared memory tasks and data structures; routing; radio networks and the SINR model; crypto, trust, and influence; and networking.Theoretical Computer Science and General Issues,2512-2029 ;8205AlgorithmsComputer networksData structures (Computer science)Information theoryAlgorithmsComputer Communication NetworksData Structures and Information TheoryAlgorithms.Computer networks.Data structures (Computer science)Information theory.Algorithms.Computer Communication Networks.Data Structures and Information Theory.004.36Afek Yehudaedthttp://id.loc.gov/vocabulary/relators/edtMiAaPQMiAaPQMiAaPQBOOK9910485041303321Distributed computing104445UNINA