{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":43,"n_cols":5,"rows_kept":43,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[6,2,6,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[13,2,13,3],[14,2,14,3],[16,2,16,3],[19,2,19,3],[19,4,19,5],[20,2,20,3],[20,4,20,5],[21,2,21,3],[22,2,22,3],[23,2,23,3],[24,2,24,3],[25,2,25,3],[26,2,26,3],[27,2,27,3],[35,2,35,3],[36,2,36,3],[40,2,40,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910557866703321"]
[null,null,"Autore",null,"Herbert David"]
[null,null,"Titolo",null,"Social Media and Social Order / / ed. by David Herbert, Stefan Fisher-Høyrem"]
[null,null,"Pubbl/distr/stampa",null,"Berlin/Boston, : De Gruyter, 2022"]
[{"$nulls":4},"Warsaw ; ; Berlin : , : De Gruyter Open Poland, , [2022]"]
[{"$nulls":4},"©2022"]
[null,null,"ISBN",null,"9788366675612"]
[{"$nulls":4},"8366675610"]
[{"$nulls":4},"9783110760408"]
[{"$nulls":4},"3110760401"]
[null,null,"Descrizione fisica",null,"1 online resource (149 p.)"]
[null,null,"Disciplina",null,"302.231"]
[null,null,"Soggetti",null,"SOCIAL SCIENCE / Media Studies"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"Frontmatter -- Contents -- Acknowledgements -- 1 Introduction: How Do Social Media Change Social Order? The Deep Datafication of Society from Global to Local Scales (and Back Again) -- 2 The Social Construction of Reality - Really! -- 3 The Dramaturgy of Social Media: Platform Ecology, Uneven Networks, and the Myth of the Self -- 4 Clusters of Prestige: Social Media and Social Order in the Norwegian Bible Belt -- 5 Meme Collectives and Preferred Truths in Assam -- 6 Insurgent Ways of Looking: Gendering the Witness and the Land in the Visuality of Israel-Palestine -- 7 Gender and Race in the Digital Town Hall: Identity-Based Attacks Against US Legislators on Twitter -- 8 Participatory Propaganda: The Engagement of Audiences in the Spread of Persuasive Communications -- List of Figures -- List of Tables"]
[null,null,null,"Sommario/riassunto","Social Media and Social Order combines a structural analysis of the global impact of social media as contributing to the production of a datafied social order with a series of actor-focused analyses, each examining how roles structured by social media are performed at various sites: enmeshed in European cities, entangled in contested Middle Eastern borders, and embedded in provincial Indian small-town networks. The final section then arcs back to a focus on the general properties of social media networks revealed through two American cases, emphasizing the human costs for the recipients of abuse "]
[{"$nulls":4},"(legislators of color) and the political costs of participatory propaganda for a deliberative understanding of democracy. A central theme is how the principle of differential treatment embedded in the datafied social order is becoming increasingly widespread across social fields. The book demonstrates how social media are implicated in reshaping social order in ways which align with this principle, including creating new precarious hierarchies of esteem, reinforcing existing social, class and religious hierarchies, opening political discussion to more participants but at the cost of reinforcing local hierarchies and dominant discourses, underlining gendered constructions of national identity, amplifying the abuse received by women and people of color in leadership positions and enmeshing users in the circulation of propaganda which resonates with their preconceptions, thus deepening societal polarization."]
[null,"2.","Record Nr.",null,"UNINA9910768434703321"]
[null,null,"Titolo",null,"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings / / edited by Moses Charikar, Klaus Jansen, Omer Reingold, José D.P. Rolim"]
[null,null,"Pubbl/distr/stampa",null,"Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007"]
[null,null,"ISBN",null,"3-540-74208-5"]
[null,null,"Edizione",null,"[1st ed. 2007.]"]
[null,null,"Descrizione fisica",null,"1 online resource (XII, 628 p.)"]
[null,null,"Collana",null,"Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4627"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Software engineering"]
[{"$nulls":4},"Algorithms"]
[{"$nulls":4},"Computer science - Mathematics"]
[{"$nulls":4},"Discrete mathematics"]
[{"$nulls":4},"Numerical analysis"]
[{"$nulls":4},"Software Engineering"]
[{"$nulls":4},"Discrete Mathematics in Computer Science"]
[{"$nulls":4},"Numerical Analysis"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Bibliographic Level Mode of Issuance: Monograph"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Contributed Talks of APPROX -- Approximation Algorithms and Hardness for Domination with Propagation -- A Knapsack Secretary Problem with Applications -- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem -- Improved Approximation Algorithms for the Spanning Star Forest Problem -- Packing and Covering ?-Hyperbolic Spaces by Balls -- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems -- Two Randomized Mechanisms for Combinatorial Auctions -- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs -- Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows -- Stochastic Steiner Tree with Non-uniform Inflation -- On the Approximation Resistance of a Random Predicate -- Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ?1 Embeddability of Negative Type Metrics -- Optimal Resource "]
[{"$nulls":4},"Augmentations for Online Knapsack -- Soft Edge Coloring -- Approximation Algorithms for the Max-Min Allocation Problem -- Hardness of Embedding Metric Spaces of Equal Size -- Coarse Differentiation and Multi-flows in Planar Graphs -- Maximum Gradient Embeddings and Monotone Clustering -- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems -- Encouraging Cooperation in Sharing Supermodular Costs -- Almost Exact Matchings -- Contributed Talks of RANDOM -- On Approximating the Average Distance Between Points -- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR -- A Sequential Algorithm for Generating Random Graphs -- Local Limit Theorems for the Giant Component of Random Hypergraphs -- Derandomization of Euclidean Random Walks -- High Entropy Random Selection Protocols -- Testingst-Connectivity -- Properly 2-Colouring Linear Hypergraphs -- Random Subsets of the Interval and P2P Protocols -- The Cover Time of Random Digraphs -- Eigenvectors of Random Graphs: Nodal Domains -- Lower Bounds for Swapping Arthur and Merlin -- Lower bounds for testing forbidden induced substructures in bipartite-graph-like combinatorial objects -- On Estimating Frequency Moments of Data Streams -- Distribution-Free Testing Lower Bounds for Basic Boolean Functions -- On the Randomness Complexity of Property Testing -- On the Benefits of Adaptivity in Property Testing of Dense Graphs -- Slow Mixing of Markov Chains Using Fault Lines and Fat Contours -- Better Binary List-Decodable Codes Via Multilevel Concatenation -- Worst-Case to Average-Case Reductions Revisited -- On Finding Frequent Elements in a Data Stream -- Implementing Huge Sparse Random Graphs -- Sublinear Algorithms for Approximating String Compressibility."]
[null,null,null,"Sommario/riassunto","This volume presents the refereed proceedings of the 10th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and the 11th International Workshop on Randomization and Computation. The papers cover design and analysis of approximation algorithms, hardness of approximation, small space and data streaming algorithms, sub-linear time algorithms, embeddings and metric space methods, and much more."]