| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910452225403321 |
|
|
Autore |
Bone Robert <1924-2007.> |
|
|
Titolo |
Richard Wright [[electronic resource] /] / by Robert Bone |
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Minneapolis, : University of Minnesota Press, 1969 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (49 p.) |
|
|
|
|
|
|
Collana |
|
University of Minnesota pamphlets on American writers ; ; no. 74 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
|
|
Soggetti |
|
Authors, American |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliography: p. 47-48. |
|
|
|
|
|
|
Nota di contenuto |
|
Richard Wright; Selected Bibliography |
|
|
|
|
|
|
Sommario/riassunto |
|
Richard Wright - American Writers 74 was first published in 1989. Minnesota Archive Editions uses digital technology to make long-unavailable books once again accessible, and are published unaltered from the original University of Minnesota Press editions. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNISA996418294103316 |
|
|
Titolo |
Computing and Combinatorics [[electronic resource] ] : 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings / / edited by Donghyun Kim, R. N. Uma, Zhipeng Cai, Dong Hoon Lee |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2020 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2020.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (691 pages) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 12273 |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer science |
Computer engineering |
Computer networks |
Data structures (Computer science) |
Information theory |
Artificial intelligence |
Theory of Computation |
Computer Engineering and Networks |
Data Structures and Information Theory |
Artificial Intelligence |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
|
|
|
|
|
Nota di contenuto |
|
Subspace approximation with outliers -- Linear-time Algorithms for Eliminating Claws in Graphs -- A new lower bound for the eternal vertex cover number of graphs -- Bounded-Degree Spanners in the Presence of Polygonal Obstacles -- End-Vertices of AT-free Bigraphs -- Approaching Optimal Duplicate Detection in a Sliding Window -- Computational Complexity Characterization of Protecting Elections from Bribery -- Coding with Noiseless Feedback over the Z-channel -- Path-monotonic Upward Drawings of Plane Graphs -- Seamless Interpolation between Contraction Hierarchies and Hub Labels for fast and space-e cient Shortest Path Queries in Road Networks -- Visibility |
|
|
|
|
|
|
|
|
|
|
|
polygon queries among dynamic polygonal obstacles in plane -- How Hard is Completeness Reasoning for Conjunctive Queries? -- Imbalance Parameterized by Twin Cover Revisited -- Local Routing in a Tree Metric 1-Spanner -- Deep Specification Mining with Attention -- Constructing Independent Spanning Trees in Alternating Group Networks -- W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension -- An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane -- Quantum Speedup for the Minimum Steiner Tree Problem -- Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families -- Approximation algorithms for car-sharing problems -- Realization Problems on Reachability Sequences -- Power of Decision Trees with Monotone Queries -- Computing a maximum clique in geometric superclasses of disk graphs -- Visibility -- Tight approximation for the minimum bottleneck generalized matching problem -- Graph Classes and Approximability of the Happy Set Problem -- A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs -- Uniqueness of $DP$-Nash Subgraphs and $D$-sets -- On the Enumeration of Minimal Non-Pairwise Compatibility Graphs -- Constructing Tree Decompositions of Graphs with Bounded Gonality -- Election Control through Social In uence with Unknown Preferences -- New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem -- On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs -- On the Restricted 1-Steiner Tree Problem -- Computational Complexity of Synchronization under Regular Commutative Constraints -- Approximation algorithms for general cluster routing problem -- Hardness of Sparse Sets and Minimal Circuit Size Problem -- Succinct Monotone Circuit Certi cation: Planarity and Parameterized Complexity -- On Measures of Space Over Real and Complex Numbers -- Parallelized maximization of nonsubmodular function subject to a cardinality constraint -- An improved Bregman $k$-means++ algorithm via local search -- On the Complexity of Directed Intersection Representation of DAGs -- On the Mystery of Negations in Circuits : Structure vs Power -- Even better xed-parameter algorithms for bicluster editing -- Approximate Set Union via Approximate Randomization -- A Non-Extendibility Certi cate for Submodularity and Applications -- Parameterized Complexity of Maximum Edge Colorable Subgraph -- Approximation Algorithms for the Lower-Bounded k-Median and Ist Generalizations -- A Survey for Conditional Diagnosability of Alternating Group Networks -- Fixed Parameter Tractability of Graph Deletion Problems over Data Streams -- Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the proceedings of the 26th International Conference on Computing and Combinatorics, COCOON 2020, held in Atlanta, GA, USA, in August 2020. Due to the COVID-19 pandemic COCOON 2020 was organized as a fully online conference. The 54 papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers cover various topics, including algorithm design, approximation algorithm, graph theory, complexity theory, problem solving, optimization, computational biology, computational learning, communication network, logic, and game theory. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
3. |
Record Nr. |
UNISA996218336603316 |
|
|
Autore |
Libanius |
|
|
Titolo |
Selected Orations . Volume II / / Libanios ; editor, translator, Albert Francis Norman |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cambridge, MA : , : Harvard University Press, , 1977 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (xiv, 542 pages) |
|
|
|
|
|
|
Collana |
|
Loeb classical library ; ; 452 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Speeches, addresses, etc., Greek |
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Sommario/riassunto |
|
Libanius (A.D. 314-393) was one of the last great publicists and educators of Greek paganism. His story, as presented in his 'Autobiography' (Oration I) and the 'Life' by Eunapius, is supplemented by information from a correspondence of over 1500 items (dated A.D. 355-365 and A.D. 388-393) and 64 extant orations. Sophistic works of various types, including the 'Hypotheses of Demosthenes' Orations', complete the corpus of his works. He was born in Antioch of respectable municipal family and, after study at Athens, began his teaching career in Constantinople in 340, but soon had to retire to Nicomedeia, where he became acquainted with St. Basil and influential in the development of Julian's paganism. After a second tenure at Constantinople he returned home to become professor in Antioch in 354, a position which he held through many vicissitudes, for the rest of his life. His views and prejudices caused him to react sharply against many contemporary trends. As sophist of Antioch and a devoted exponent of the traditional Hellenic system of education, he remained deliberately and contemptuously unacquainted with Latin, and deplored its increasing influence. Naturally humane in outlook and sympathizing with the local bouregoisie, he criticized bitterly the encroachments and oppressions of the central administration, and the general cruelty of his day. Sincerely pagan in an increasingly aggressive Christian society, he became an influential mouthpiece of protest against religious persecution, official or unofficial. Illness and professional and family |
|
|
|
|
|
|
|
|
|
|
disappointments sharpen these criticisms in his later years. The orations upon Julian, to whose memory he remained devoted all his life, were composed between 362 and 365, and present Libanius with a positive role and a congenial subject, revealing him at the height of his powers and influence. They were used by the Church historians, and this, coupled with his relations with Basil and with Chrysostom, his pupil in Antioch, lent them respectability enough to make his works, despite their consistent criticisms of the Christian religion, acceptable to Byzantine piety. |
|
|
|
|
|
| |