20,477 research outputs found

    Hung Liu: Capp Street Project, 1988

    No full text
    Catalog for "Hung Liu: Capp Street Project, 1988" from the Rena Bransten Gallery exhibition from September 20 to November 18, 2023. The catalog uses images from CCA's Capp Street Project Archive

    Hung Liu - portraits of promised lands

    No full text
    A major survey of contemporary artist Hung Liu, whose layered portraits explore history and memory through the stories of marginalized figure

    De Saisset Hung Liu installation

    No full text
    Color image of one of the walls of mixed media art from the Hung Liu exhibit installation at the de Saisset

    Approximate Selection with Unreliable Comparisons in Optimal Expected Time

    No full text
    Given n elements, an integer k ≤ n/2 and a parameter ε ≥ 1/n, we study the problem of selecting an element with rank in (k-nε, k+nε] using unreliable comparisons where the outcome of each comparison is incorrect independently with a constant error probability, and multiple comparisons between the same pair of elements are independent. In this fault model, the fundamental problems of finding the minimum, selecting the k-th smallest element and sorting have been shown to require Θ(n log 1/Q), Θ(n log k/Q) and Θ(n log n/Q) comparisons, respectively, to achieve success probability 1-Q [Uriel Feige et al., 1994]. Considering the increasing complexity of modern computing, it is of great interest to develop approximation algorithms that enable a trade-off between the solution quality and the number of comparisons. In particular, approximation algorithms would even be able to attain a sublinear number of comparisons. Very recently, Leucci and Liu [Stefano Leucci and Chih-Hung Liu, 2022] proved that the approximate minimum selection problem, which covers the case that k ≤ nε, requires expected Θ(ε^{-1} log 1/Q) comparisons, but the general case, i.e., for nε < k ≤ n/2, is still open. We develop a randomized algorithm that performs expected O(k/n ε^{-2} log 1/Q) comparisons to achieve success probability at least 1-Q. For k = n ε, the number of comparisons is O(ε^{-1} log 1/Q), matching Leucci and Liu’s result [Stefano Leucci and Chih-Hung Liu, 2022], whereas for k = n/2 (i.e., approximating the median), the number of comparisons is O(ε^{-2} log 1/Q). We also prove that even in the absence of comparison faults, any randomized algorithm with success probability at least 1-Q performs expected Ω(min{n, k/n ε^{-2} log 1/Q}) comparisons. As long as n is large enough, i.e., when n = Ω(k/n ε^{-2} log 1/Q), our lower bound demonstrates the optimality of our algorithm, which covers the possible range of attaining a sublinear number of comparisons. Surprisingly, for constant Q, our algorithm performs expected O(k/n ε^{-2}) comparisons, matching the best possible approximation algorithm in the absence of computation faults. In contrast, for the exact selection problem, the expected number of comparisons is Θ(n log k) with faults versus Θ(n) without faults. Our results also indicate a clear distinction between approximating the minimum and approximating the k-th smallest element, which holds even for the high probability guarantee, e.g., if k = n/2, Q = 1/n and ε = n^{-α} for α ∈ (0, 1/2), the asymptotic difference is almost quadratic, i.e., Θ̃(n^α) versus Θ̃(n^{2α})

    Review: Hung Liu: Portraits of Promised Lands

    No full text
    Book review of Hung Liu: Portraits of Promised Lands by Dorothy Moss et al. Yale University Press in association with the National Portrait Gallery, Smithsonian Institution, June 2021. ISBN 978-0-300-25744-1 (h/c), $50.00. Reviewed March 2022 by Meredith Hale, Metadata Librarian, University of Tennessee, Knoxville, [email protected]

    Communitas Lecture: Hung Liu

    No full text
    The term communitas invokes the fundamental spirit of community. And it is in this spirit that the Department of Art + Design presents a year-long lecture series with a wide range of artists, designers, and scholars whose work and lives promote the values of equality, diversity, and togetherness. These lectures are free and open to the public in addition to being offered to students for credit. (ART 3710/ .5 cr) All lectures take place at 5PM in the Russell/Wanlass Performance Hall

    Proterothrix alcippeae Mironov, Literak, Hung & Capek 2012

    No full text
    Proterothrix alcippeae Mironov, Literak, Hung & Capek, 2012: 32 — Holotype male (ZISP 4780), from Alcippe rufogularis (Mandelli) (Pellorneidae), Ninh Binh, Cuc Phuong National Park, Vietnam (20°21' N 105°35' E)Published as part of LIU, DONG, YI, TIAN-CI, XU, YUN & ZHANG, ZHI-QIANG, 2013, new mite species described during 2007 to 2012 3663, pp. 1-102 in Zootaxa 3663 (1) on page 81, DOI: 10.11646/zootaxa.3663.1.1, http://zenodo.org/record/563059

    Montesauria pellornei Mironov, Literak, Hung & Capek 2012

    No full text
    Montesauria pellornei Mironov, Literak, Hung & Capek, 2012: 14 — Holotype male (ZISP 4743), from Pellorneum ruficeps Swainson (Pellorneidae), Ninh Binh, Cuc Phuong National Park, Vietnam (20°21'N 105°35'E).Published as part of LIU, DONG, YI, TIAN-CI, XU, YUN & ZHANG, ZHI-QIANG, 2013, new mite species described during 2007 to 2012 3663, pp. 1-102 in Zootaxa 3663 (1) on page 81, DOI: 10.11646/zootaxa.3663.1.1, http://zenodo.org/record/563059

    Montesauria seicerci Mironov, Literak, Hung & Capek 2012

    No full text
    Montesauria seicerci Mironov, Literak, Hung & Capek, 2012: 22 — Holotype male (ZISP 4766), from Seicercus valentini (Hartert) (Phylloscopidae), Ninh Binh, Cuc Phuong National Park, Vietnam (20°21'N 105°35'E).Published as part of LIU, DONG, YI, TIAN-CI, XU, YUN & ZHANG, ZHI-QIANG, 2013, new mite species described during 2007 to 2012 3663, pp. 1-102 in Zootaxa 3663 (1) on page 81, DOI: 10.11646/zootaxa.3663.1.1, http://zenodo.org/record/563059
    corecore