Chul Young Lee

Learn More
A polymorphic CAG repeat was identified in the human alpha 1A voltage-dependent calcium channel subunit. To test the hypothesis that expansion of this CAG repeat could be the cause of an inherited progressive ataxia, we genotyped a large number of unrelated controls and ataxia patients. Eight unrelated patients with late onset ataxia had alleles with larger(More)
The one-dimensional on-line bin-packing problem is considered, A simple <italic>O</italic>(1)-space and <italic>O</italic>(<italic>n</italic>)-time algorithm, called HARMONIC<italic><subscrpt>M</subscrpt></italic>, is presented. It is shown that this algorithm can achieve a worst-case performance ratio of less than 1.692, which is better than that of the(More)
Visual domain adaptation addresses the problem of adapting the sample distribution of the source domain to the target domain, where the recognition task is intended but the data distributions are different. In this paper, we present a low-rank reconstruction method to reduce the domain distribution disparity. Specifically, we transform the visual samples in(More)
We show that, in the mouse, the core mechanism for the master circadian clock consists of interacting positive and negative transcription and translation feedback loops. Analysis of Clock/Clock mutant mice, homozygous Period2(Brdm1) mutants, and Cryptochrome-deficient mice reveals substantially altered Bmal1 rhythms, consistent with a dominant role of(More)
Security remains a major roadblock to universal acceptance of the Web for many kinds of transactions, especially since the recent sharp increase in remotely exploitable vulnerabilities have been attributed to Web application bugs. Many verification tools are discovering previously unknown vulnerabilities in legacy C programs, raising hopes that the same(More)
This paper uses a new formulation of the notion of duality that allows the unified treatment of a number of geometric problems. In particular, we are able to apply our approach to solve two long-standing problems of computational geometry: one is to obtain a quadratic algorithm for computing the minimum-area triangle with vertices chosen among n points in(More)
This paper provides a unified discussion of the Delaunay triangulation. Its geometric properties are reviewed and several applications are discussed. Two algorithms are presented for constructing the triangulation over a planar set ofN points. The first algorithm uses a divide-and-conquer approach. It runs inO(N logN) time, which is asymptotically optimal.(More)
Travel time is a fundamental measure in transportation. Accurate travel-time prediction also is crucial to the development of intelligent transportation systems and advanced traveler information systems. We apply support vector regression (SVR) for travel-time prediction and compare its results to other baseline travel-time prediction methods using real(More)