238,370 research outputs found
Hung Liu: Capp Street Project, 1988
Get PDFCatalog 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 textA major survey of contemporary artist Hung Liu, whose layered portraits explore history and memory through the stories of marginalized figure
Pi pan Liu Shaoqi wei jing ji lun
No full text东风红卫兵绘.题名及丛书由编目者拟定."一九六六年・十二・五"Dong feng hong wei bing hui.Ti ming ji cong shu you bian mu zhe ni ding."Yi jiu liu liu nian.shi er.wu
Recommended from our members
Double Vision: The Art of Hung Liu
No full textAn article, "Double Vision: The Art of Hung Liu," by Nancy Walkup Reynolds, for Trends, Spring of 1998. Reynolds is a Project Coordinator for the North Texas Institute for Educators on the Visual Arts, University of North Texas, and has written this article on contemporary artist Hung Liu. Liu, born in China but now resides in the United States appropriate images from historical photographs to create paintings and mix media installations that expresses her bicultural perspective
De Saisset Hung Liu installation
No full textColor image of one of the walls of mixed media art from the Hung Liu exhibit installation at the de Saisset
Liu shi yu dan si ji
No full text劉鳳著.綫裝, 1函.框20.1x13.6公分, 9行18字. 白口, 左右雙邊, 單黑魚尾. 版心上鐫"澹思集", 中鐫卷次, 下鐫葉次及"劉漙卿刻"書名及版式據卷三.書根題"劉侍御澹思集", 每冊書根題後分別錄"樂", "御", "書", "數"見《香港中文大學圖書館古籍善本書錄》(2001, p. 244)鈐有"天一閣", "沈氏鳴野山房圖籍印"Library's copy: 館存卷三至五, 卷九至十六, 共四冊 ; 缺卷一至二[v.1], 卷六至八[v.3]Xian zhuang, 1 han.Kuang 20.1 x 13.6 gong fen, 9 hang 18 zi. Bai kou, zuo you shuang bian, dan hei yu wei. Ban xin shang juan "Dan si ji", zhong juan juan ci, xia juan ye ci ji "Liu Tuanqing ke"Shu ming ji ban shi ju juan san.Shu gen ti "Liu shi yu dan si ji", mei ce shu gen ti hou fen bie lu "Yue", "Yu", "Shu", "Shu"Jian "Xianggang Zhong wen da xue tu shu guan gu ji shan ben shu lu" (2001, p. 244)Liu Feng zhu.Qian you "Tian yi ge", "Shen shi Ming ye shan fang tu ji yin"Library's copy: guan cun juan san zhi wu, juan jiu zhi shi liu, gong si ce ; que juan yi zhi er [v.1], juan liu zhi ba [v.3
A Subband-Selective Broadband GSC with Cosine-Modulated Blocking Matrix
Get PDFIn this paper, a novel subband-selective generalized sidelobe canceller (GSC) for partially adaptive broadband beamforming is proposed. The columns of the blocking matrix are derived from a prototype vector by cosine-modulation, and the broadside constraint is incorporated by imposing zeros on the prototype vector appropriately. These columns constitute a series of bandpass filters, which select signals with specific angles of arrival and frequencies. This results in highpass-type bandlimited spectra of the blocking matrix outputs, which is further exploited by subbands decomposition and suitably discarding the low-pass subbands prior to running independent unconstrained adaptive filters in each non-redundant subband. By these steps, the computational complexity of a GSC implementation is greatly reduced compared to fully adaptive GSC schemes, while performance is comparable or even enhanced due to subband decorrelation in both spatial and temporal domains
Approximate Selection with Unreliable Comparisons in Optimal Expected Time
Get PDFGiven 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α})
Diestrammena (Gymnaeta) tianmushanensis Liu et Zhang 2001
No full textDiestrammena (Gymnaeta) tianmushanensis Liu et Zhang, 2001 (Figs. 50–53) Tachycines (Gymnaeta) tianmushanensis Liu et Zhang, 2001. In Wu et Pan: Insects of Tianmushan National Nature Reserve. P. 98–99; Jiao et al., 2008. Zootaxa, 1917: 57–58, Figs. 4–6. Specimens examined: 13, Anhui (Wenquan Huangshan), 23. X. 1985, leg. Liu Xian-Wei; 1 Ƥ, Zhejiang (Linan Tianmushan), 1989. IX. 2. Distribution. China (Zhejiang; Anhui).Published as part of Zhang, Feng & Liu, Xian-Wei, 2009, A review of the subgenus Diestrammena (Gymnaeta) from China (Orthoptera: Rhaphidophoridae Aemodogryllinae), pp. 21-36 in Zootaxa 2272 on page 33, DOI: 10.5281/zenodo.19100
sj-docx-1-tag-10.1177_17562848231179329 – Supplemental material for Esophageal secondary peristalsis following acid infusion and chemical clearance correlate with mucosal integrity and acid sensitivity in GERD patients
No full textSupplemental material, sj-docx-1-tag-10.1177_17562848231179329 for Esophageal secondary peristalsis following acid infusion and chemical clearance correlate with mucosal integrity and acid sensitivity in GERD patients by Ming-Wun Wong, Jui-Sheng Hung, Wei-Yi Lei, Tso-Tsai Liu, Chih-Hsun Yi, Shu-Wei Liang, Chandra Prakash Gyawali, Jen-Hung Wang and Chien-Lin Chen in Therapeutic Advances in Gastroenterology</p
- …
