Tien-Ching Lin

Learn More
Given a sequence of n real numbers A = a1, a2,. .. , an and a positive integer k, the Sum Selection Problem is to find the segment A(i, j) = ai, ai+1,. .. , aj such that the rank of the sum s(i, j) = È j t=i at is k over all n(n−1) 2 segments. We present a deterministic algorithm for this problem that runs in O(n log n) time. The previously best known(More)
A prototype is representative of a set of similar objects. This paper proposes an approach that formulates the problem of prototype generation as finding the mean from a given set of objects, where the prototype solution must satisfy certain constraints. These constraints describe the important perceptual features of the sample shapes that the proposed(More)
In 1982, Drezner proposed the (1|1)-centroid problem on the plane, in which two players, called the leader and the follower, open facilities to provide service to customers in a competitive manner. The leader opens the first facility, and then the follower opens the second. Each customer will patronize the facility closest to him (ties broken in favor of(More)
The growing popularity and importance of web applications have been increasing continuously in recent years. Use of JAVASCRIPT and dynamic DOM (Document Object Model) manipulation on the client side of web applications is becoming a widespread approach for achieving rich interactivity and responsiveness in modern web applications. AJAX (Asynchronous(More)