07558nam 22008175 450 99646583990331620230221150325.01-280-38772-697866135656483-642-14165-X10.1007/978-3-642-14165-2(CKB)2670000000028924(SSID)ssj0000446321(PQKBManifestationID)11281707(PQKBTitleCode)TC0000446321(PQKBWorkID)10491751(PQKB)11234749(DE-He213)978-3-642-14165-2(MiAaPQ)EBC3065500(PPN)149072864(EXLCZ)99267000000002892420100705d2010 u| 0engurnn#008mamaatxtccrAutomata, Languages and Programming[electronic resource] 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I /edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XXIII, 754 p. 42 illus.)Theoretical Computer Science and General Issues,2512-2029 ;6198Bibliographic Level Mode of Issuance: Monograph3-642-14164-1 Includes bibliographical references and index.Invited Talks -- Local Search: Simple, Successful, But Sometimes Sluggish -- When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability -- Session 1-Track A. Combinatorial Optimization -- Plane Spanners of Maximum Degree Six -- The Positive Semidefinite Grothendieck Problem with Rank Constraint -- Cycle Detection and Correction -- Decomposition Width of Matroids -- Session 2-Track A1. Game Theory -- The Cooperative Game Theory Foundations of Network Bargaining Games -- On the Existence of Pure Nash Equilibria in Weighted Congestion Games -- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions -- Mean-Payoff Games and Propositional Proofs -- Session 2-Track A2. Security -- Online Network Design with Outliers -- Efficient Completely Non-malleable Public Key Encryption -- Polynomial-Space Approximation of No-Signaling Provers -- From Secrecy to Soundness: Efficient Verification via Secure Computation -- Session 3-Track A1. Data Structures -- Mergeable Dictionaries -- Faster Algorithms for Semi-matching Problems (Extended Abstract) -- Clustering with Diversity -- New Data Structures for Subgraph Connectivity -- Session 3-Track A2. Sorting & Hashing -- Tight Thresholds for Cuckoo Hashing via XORSAT -- Resource Oblivious Sorting on Multicores -- Interval Sorting -- Session 4-Track A. Graphs, Nets and Optimization -- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems -- Thresholded Covering Algorithms for Robust and Max-min Optimization -- Graph Homomorphisms with Complex Values: A Dichotomy Theorem -- Metrical Task Systems and the k-Server Problem on HSTs -- Session 5-Track A1. Scheduling -- Scheduling Periodic Tasks in a Hard Real-Time Environment -- Scalably Scheduling Power-Heterogeneous Processors -- Better Scalable Algorithms for Broadcast Scheduling -- Max-min Online Allocations with a Reordering Buffer -- Session 5-Track A2. Graphs & Hypergraphs -- Orientability of Random Hypergraphs and the Power of Multiple Choices -- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs -- Dynamic Programming for Graphs on Surfaces -- Interval Graphs: Canonical Representation in Logspace -- Session 6-Track A. Best Paper Award -- Approximating the Partition Function of the Ferromagnetic Potts Model -- Session 7-Track A. Algebraic Problems -- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors -- On Sums of Roots of Unity -- Exponential Time Complexity of the Permanent and the Tutte Polynomial -- On Approximate Horn Formula Minimization -- Session 8-Track A. Networks & Communication Complexity -- Choosing, Agreeing, and Eliminating in Communication Complexity -- Additive Spanners in Nearly Quadratic Time -- Composition Theorems in Communication Complexity -- Network Design via Core Detouring for Problems without a Core -- Session 9-Track A1. Complexity & Automata -- Weak Completeness Notions for Exponential Time -- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests -- On the Complexity of Searching in Trees: Average-Case Minimization -- Session 9-Track A2. Finding & Testing -- Finding Is as Easy as Detecting for Quantum Walks -- Improved Constructions for Non-adaptive Threshold Group Testing -- Testing Non-uniform k-Wise Independent Distributions over Product Spaces -- Session 10-Track A1. Approximations -- A Sublogarithmic Approximation for Highway and Tollbooth Pricing -- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm -- Cell Probe Lower Bounds and Approximations for Range Mode -- SDP Gaps for 2-to-1 and Other Label-Cover Variants -- Session 10-Track A2. Streaming & Preprocessing -- Data Stream Algorithms for Codeword Testing -- Streaming Algorithms for Independent Sets -- Preprocessing of Min Ones Problems: A Dichotomy -- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems -- Session 11-Track A1. Adaptive, Knowledge & Optimality -- Optimal Trade-Offs for Succinct String Indexes -- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems -- Concurrent Knowledge Extraction in the Public-Key Model -- Session 11-Track A2. Covering, Graphs & Independence -- On the k-Independence Required by Linear Probing and Minwise Independence -- Covering and Packing in Linear Space -- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs.Theoretical Computer Science and General Issues,2512-2029 ;6198Software engineeringComputer programmingComputer networksAlgorithmsArtificial intelligenceComputer scienceSoftware EngineeringProgramming TechniquesComputer Communication NetworksAlgorithmsArtificial IntelligenceTheory of ComputationSoftware engineering.Computer programming.Computer networks.Algorithms.Artificial intelligence.Computer science.Software Engineering.Programming Techniques.Computer Communication Networks.Algorithms.Artificial Intelligence.Theory of Computation.005.1Abramsky Samsonedthttp://id.loc.gov/vocabulary/relators/edtGavoille Cyriledthttp://id.loc.gov/vocabulary/relators/edtKirchner Claudeedthttp://id.loc.gov/vocabulary/relators/edtMeyer auf der Heide Friedhelmedthttp://id.loc.gov/vocabulary/relators/edtSpirakis Pauledthttp://id.loc.gov/vocabulary/relators/edtBOOK996465839903316Automata, languages and programming339738UNISA04572 am 2200877 n 450 9910348253903321201901222-7297-1010-810.4000/books.pul.15416(CKB)4100000009763188(FrMaCLE)OB-pul-15416(oapen)https://directory.doabooks.org/handle/20.500.12854/49800(PPN)241653975(EXLCZ)99410000000976318820210809j|||||||| ||| 0freuu||||||m||||txtrdacontentcrdamediacrrdacarrierIdées économiques sous la Révolution (1789-1794) /Jean-Michel ServetLyon Presses universitaires de Lyon20191 online resource (488 p.) 2-7297-0346-2 “Ce qu'on appelle la Révolution était tramé depuis longtemps par les prétendus philosophes du siècle, connus sous le nom d'économistes. Les académies et les différents clubs, les jansénistes et les protestants étaient leurs principaux agents. Les membres de la majorité de l'Assemblée n'ont été que les simples artisans.” Anonyme, 1791 “Dans votre inconcevable animosité contre les Économistes, vous dites que l'Assemblée constituante avait les oreilles rebattues de leurs principes, et qu'elle poussa trop loin les impositions directes (à moi la tape, et à moi seul ; car j'étais alors le seul économiste de l'Assemblée, et il ne restait en France que Morellet, Abeille, Germain Garnier et moi). Vous ne savez pas qu'à l'Assemblée consti­tuante, dès qu'il était question de commerce ou de finance, on commençait par quelques violentes invectives contre les Économistes." Dupont de Nemours “Les économistes ont eu moins d'éclat dans l'histoire que les philosophes ; moins qu'eux ils ont contribué peut-être à l'avènement de la Révolution ; je crois pourtant que c'est surtout dans leurs écrits qu'on peut le mieux étudier son vrai naturel [...]. Toutes les institutions que la Révolution devait abolir sans retour ont été l'objet particulier de leurs attaques ; aucune n'a trouvé grâce à leurs yeux. Toutes celles, au contraire, qui peuvent passer pour son œuvre propre ont été annoncées par eux à l'avance et préconisées avec ardeur.” Alexis de Tocqueville “On a porté aux nues la Révolution française ; on a célébré ses vertus, ses bienfaits : cette face du sujet était épuisée. Il n'y avait plus qu'une seule façon de dire sur la Révolution quelque chose qui ne fût pas banal : c'était de dire du mal... Chose curieuse ! L'école libérale elle-même, fille pourtant de ces économistes et de ce Turgot qui ont préparé la Révolution, et héritière en ligne directe de ses doctrines sur l'individualisme et la liberté du travail, ne témoigne cependant qu'un enthousiasme des plus mitigés.” Charles…EconomicsHistoryéconomieéconomisteéconomie politiquefiscalitéréformeinflationguerreloiRévolution françaiseRévolution françaiseéconomiefiscalitéloiéconomisteréformeinflationguerreéconomie politiqueEconomicsHistoryéconomieéconomisteéconomie politiquefiscalitéréformeinflationguerreloiRévolution françaiseBruschi Christian250679Collin Bruno1283171Dockes Pierre381198Goutte Pierre-Henri1283172Grange Henri457679Hecht Jacqueline313651Klotz Gérard322211Michalet Charles-Albert173286Peron Michel1283173Potier Jean-Pierre121925Rimbaud Gérard1283174Servet Jean-Michel250680Vianes André410416Vissol Thierry597703Servet Jean-Michel250680FR-FrMaCLEBOOK9910348253903321Idées économiques sous la Révolution (1789-1794)3018925UNINA02166nam 2200409z- 450 991022003510332120210211(CKB)3800000000216426(oapen)https://directory.doabooks.org/handle/20.500.12854/42846(oapen)doab42846(EXLCZ)99380000000021642620202102d2017 |y 0engurmn|---annantxtrdacontentcrdamediacrrdacarrierCelebrating Twenty Years of the Brazilian Symposium on Cardiovascular PhysiologyFrontiers Media SA20171 online resource (241 p.)Frontiers Research Topics2-88945-176-3 This e-book is dedicated to the celebration of 20 years of the Brazilian Symposium on Cardiovascular Physiology. In 1996 groups from the School of Medicine of Ribeirao Preto, University of Sao Paulo (FMRP-USP) and from the Federal University of Sao Paulo (UNIFESP) joined together to discuss cardiovascular physiology. In subsequent editions of the meeting, the participation of other groups from all over the country has grown and acquired the status of a national symposium. The participants now agree that the symposium should be itinerant and that the chair group is responsible for its organization. In 2016, we proudly reached the 20th edition of the Brazilian Symposium on Cardiovascular Physiology. It is certainly a memorable date and a great opportunity to share the accomplishments of Brazilian groups in the field of cardiovascular physiology.PhysiologybicsscAutonomic Nervous Systemcardiac functionCardiovascular PhysiologyRenal functionVascular functionXX Brazilian Symposium on Cardiovascular PhysiologyPhysiologyCamille M. Balariniauth1277971Valdir A. BragaauthBOOK9910220035103321Celebrating Twenty Years of the Brazilian Symposium on Cardiovascular Physiology3012324UNINA