1,934,828 research outputs found
The reflex-free hull
No full textWe propose a hull operator, the reflex-free hull, that allows us to define a 3D analogue to bays in polygons. The reflex-free hull allows a rich set of topological types, yet for polyhedral input with n edges, it remains a polyhedral set with O(n) edges. This is in contrast to other possible hull definitions that give non-planar surfaces and higher combinatorial complexity. The reflex-free hull is related to identifying cavities in computer aided design and manufacturing, but we sketch examples to indicate that computing a reflex-free hull will be a challenging problem.Brain Korea 21 program of MOE (Ahn), RGC CERG HKUST 6074/97E (Cheng) and NSF grants 9988742 and 0076984 (Snoeyink)
Diaulota alaskana Ahn
No full text1. Diaulota alaskana Ahn (USA: Alaska) Diaulota alaskana Ahn, 1996: 278; Frank and Ahn, 2011: 25.Published as part of Ahn, Kee-Jeong, 2023, Description of Diaulota submarina sp. nov. (Coleoptera: Staphylinidae: Aleocharinae) on Korean coasts, pp. 141-147 in Zootaxa 5336 (1) on page 146, DOI: 10.11646/zootaxa.5336.1.8, http://zenodo.org/record/826868
Diaulota hokkaidona Ahn and Ohara
No full text6. Diaulota hokkaidona Ahn and Ohara (Japan: Hokkaido; Russia: Kamchatka; USA: Alaska) Diaulota hokkaidona Ahn and Ohara in Song et al., 2018: 932.Published as part of Ahn, Kee-Jeong, 2023, Description of Diaulota submarina sp. nov. (Coleoptera: Staphylinidae: Aleocharinae) on Korean coasts, pp. 141-147 in Zootaxa 5336 (1) on page 146, DOI: 10.11646/zootaxa.5336.1.8, http://zenodo.org/record/826868
Diaulota koreana Yoo and Ahn
No full text7. Diaulota koreana Yoo and Ahn (Korea) Diaulota koreana Yoo and Ahn 2021: 551.Published as part of Ahn, Kee-Jeong, 2023, Description of Diaulota submarina sp. nov. (Coleoptera: Staphylinidae: Aleocharinae) on Korean coasts, pp. 141-147 in Zootaxa 5336 (1) on page 146, DOI: 10.11646/zootaxa.5336.1.8, http://zenodo.org/record/826868
Post-fabrication tuning of a polymeric grating-assisted codirectional coupler filter by photobleaching
No full textWe present a convenient post-fabrication tuning method that uses photobleaching to adjust the center wavelength of the polymeric grating-assisted codirectional coupler filter. The passive polymer waveguide is used as a low-loss optical path and the electro-optic (EO) polymer waveguide is used for dropping the optical signal at a given wavelength. Photobleaching reduces the effective index of the EO polymer waveguide, which makes it possible to adjust the center wavelength. We call easily realize the filters with a desired center wavelength by exposing ultraviolet light on them with a proper energy even after finishing the device fabrication. The center wavelength is decreased by 25 nm with a photobleaching energy of 180 J/cm(2) without extra loss. (C) 2001 Elsevier Science B.V. All rights reserved
Diaulota oharai Ahn and Yoo
No full text8. Diaulota oharai Ahn and Yoo (Japan: Hokkaido) Diaulota oharai Ahn and Yoo in Song et al., 2018: 933.Published as part of Ahn, Kee-Jeong, 2023, Description of Diaulota submarina sp. nov. (Coleoptera: Staphylinidae: Aleocharinae) on Korean coasts, pp. 141-147 in Zootaxa 5336 (1) on page 146, DOI: 10.11646/zootaxa.5336.1.8, http://zenodo.org/record/826868
Grating-assisted codirectional coupler filter using electro-optic and passive polymer waveguides
No full textMary Ahn in a Senior Piano Recital
No full textThis is the program for the senior piano recital of Mary Ahn, which was held in Mitchell Hall Auditorium on December 16, 1962, at 3:00. Mary Ahn was a pupil of Miss Evelyn Bowden
MSSQ: Manhattan Spatial Skyline Queries
No full textSkyline queries have gained attention lately for supporting effective retrieval over massive spatial data. While efficient algorithms have been studied for spatial skyline queries using the Euclidean distance, these algorithms are (1) still quite computationally intensive and (2) unaware of the road constraints. Our goal is to develop a more efficient algorithm for L-1 distance, also known as Manhattan distance, which closely reflects road network distance for metro areas. We present a simple and efficient algorithm which, given a set P of data points and a set Q of query points in the plane, returns the set of spatial skyline points in just O(vertical bar P vertical bar log vertical bar P vertical bar) time, assuming that vertical bar Q vertical bar <= vertical bar P vertical bar. This is significantly lower in complexity than the best known method. In addition to efficiency and applicability, our algorithm has another desirable property of independent computation and extensibility to L-infinity norm distance, which naturally invites parallelism and widens applicability. Our extensive empirical results suggest that our algorithm outperforms the state-of-the-art approaches by orders of magnitude. We also present efficient algorithms that report the changes of the skyline points when single or multiple query points move along the x- or y-axis. (C) 2013 Elsevier Ltd. All rights reserved.X1199Nsciescopu
EFFECT OF STRESS FREQUENCY ON THE CYCLIC CREEP-BEHAVIOR OF ZIRCALOY-4 IN THE DYNAMIC STRAIN AGING TEMPERATURE-RANGE
No full text- …
