Browsing by Author "Fu, Tao-Yang"

Now showing 1 - 3 of 3

Evolutionary interactive music composition
(2006)
Fu, Tao-Yang
;
Wu, Tsu-Yu
;
Chen, Chin-Te
;
Wu, Kai-Chu
;
Chen, Ying-Ping
This paper proposes the CFE framework-Composition, Feedback, and Evolution-and presents an interactive music composition system. The system composes short, manageable pieces of music by interacting with users. The most important features of the system include creating customized music according to the user preference and providing the facilities specifically designed for producing large amounts of music. We present the structure as well as the implementation of the system and the auxiliary functionalities that enhance the system. We also introduce the auto-feedback test with which we verify and evaluate the interactive music composition system.
Parallelizing Itinerary-Based KNN Query Processing in Wireless Sensor Networks
(2010-05-01)
Fu, Tao-Yang
;
Peng, Wen-Chih
;
Lee, Wang-Chien
;
資訊工程學系
;
Department of Computer Science
Wireless sensor networks have been proposed for facilitating various monitoring applications (e. g., environmental monitoring and military surveillance) over a wide geographical region. In these applications, spatial queries that collect data from wireless sensor networks play an important role. One such query is the K-Nearest Neighbor (KNN) query that facilitates collection of sensor data samples based on a given query location and the number of samples specified (i.e., K). Recently, itinerary-based KNN query processing techniques, which propagate queries and collect data along a predetermined itinerary, have been developed. Prior studies demonstrate that itinerary-based KNN query processing algorithms are able to achieve better energy efficiency than other existing algorithms developed upon tree-based network infrastructures. However, how to derive itineraries for KNN query based on different performance requirements remains a challenging problem. In this paper, we propose a Parallel Concentric-circle Itinerary-based KNN (PCIKNN) query processing technique that derives different itineraries by optimizing either query latency or energy consumption. The performance of PCIKNN is analyzed mathematically and evaluated through extensive experiments. Experimental results show that PCIKNN outperforms the state-of-the-art techniques.
Processing k nearest neighbor queries in location-aware sensor networks
(2007-12-01)
Xu, Yingqi
;
Fu, Tao-Yang
;
Lee, Wang-Chien
;
Winter, Julian
;
交大名義發表
Efficient search for k nearest neighbors to a given location point (called a KNN query) is an important problem arising in a variety of sensor network applications. In this paper, we investigate in-network query processing strategies under a KNN query processing framework in location-aware wireless sensor networks. A set of algorithms, namely the geo-routing tree, the KNN boundary tree and the itinerary-based KNN algorithms, are designed in accordance with the global infrastructure-based, local infrastructure-based and infrastructure-free strategies, respectively. They have distinctive performance characteristics and are desirable under different contexts. We evaluate the performance of these algorithms under several sensor network scenarios and application requirements, and identify the conditions under which the various approaches are preferable. (C) 2007 Elsevier B.V. All rights reserved.