|
[1] E. H. L. Aarts, F. M. J. De Bont, E. H. A. Haberts and P. J. M. Van Laarhoven,"Statistical Cooling: A General Approach to Combinatorial Optimizations", Philips Journal of Research, Vol. 4,pp.193-226, 1985. [2] N. Abbound, M. Sakawa and M. Inuiguchi, "Statistical Cooling: A General Approach to Combinatorial Optimizations", Philips Journal of Research, Vol. 29, pp.593-611, 1998. [3] S. Acharya, R. Alonso, M. Franklin and S. Zdonik, "Broadcast disks: Data mangement for asymmetric communication environments," Proceedings of ACM SIGMOD Conference, pp. 199-210, 1995. [4] S. Acharya, M. Franklin and S. Zdonik, "Disseminating updates on broadcast disks," in proceedings of Very Large Data Bases Conference, pp. 354-365, 1996. [5] D. Aksoy and M. S. F. Leung, "Pull vs Push: A Quantitative Comparison for Data Broadcast," Global Telecommunications Conference, Vol. 3 ,pp.1464-1468, 2004. [6] A. A. Bertossi, M. C. Pinotti and S. Ramaprasad, "Optimal multi-channel data allocation with flat broadcast per channel," Proceedings of the 18th International Parallel and Distributed Processing Symposium, 2004. [7] O. E. Demir and D. Aksoy, "Energy-Efficient Broadcast-based Event Update Dissemination," Pertormance, Computing, and Communications, 2004 IEEE International Conference ,pp. 477-482, 2004. [8] Q. Fang, S. V. Vrbsky, Y. Dang and W. Ni, "A Pull-Based Broadcast Algorithm that Considers Timing Constraints," Proceedings of the International Conference on Parallel Processing Workshops, 2004. [9] C. M. Fiduccia and R. M. Mattheyses, "A Linear-time Heuristic for Improving Network Partitions", Proc. Design Automation Conf., pp. 175-181, 1982. [10] M. Garey and S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, 1979. [11] L. Hagen and A. B. Kahng, "Fast Spectral Methods for Ratio Cut Partitioning and Clustering", Proc. International Conf. on Computer-Aided Design, pp. 10-13, 1991. [12] J. L. Huang and M. S. Chen, "Broadcast Program Generation for Unordered Queries with Data Replication," Proceedings of the ACM Symposium on Applied Computing, pp. 866-870, 2003. [13] J. L. Huang and M. S. Chen, "Dependent Data Broadcasting for Unordered Queries in a Multiple Channel Mobile Environment," IEEE Transaction on Knowledge and Data Engineering ,Vol.16, No.9, pp. 1143-1156, 2004. [14] J. L. Huang, M. S. Chen and W. C. Peng , " Broadcasting Dependent Data for Order Queries Without Replication in a Multi-Channel Mobile Environ ment," Proceedings of the 19th International Conference on Data Engineering, 2003. [15] Y. Huang and Y. H. Lee, "An Efficient Indexing Method For Wireless Data Broadcast With Dynamic Updates," Communications, Circuits and Systems and West sino Expositions, IEEE 2002 International Conference, Vol.29, pp. 358-362, 2002. [16] J. J. Huang and Y. Lee, "Efficient Index Caching Schemes for Data Broadcasting in Mobile Computing Environments," Proceedings of the 14th International Workshop on Database and Expert Systems Applications, 2003. [17] K. F. Jea and M. H. Chen, "A Data Broadcast Scheme Based on Prediction for The Wireless Environment," Proceedings of the Ninth international Conference on Parallel and distributed Systems, 2002. [18] G. Karypis, R. Aggarwal, V. Kumar and S. Shekhar, "Multilevel Hypergraph Partitioning:Applications in VLSI Domain," Department of Computer Science, University of Minnesota, Minneapolis, MN, USA, 1997. [19] G. Karypis and V. Kumar, "METIS: Unstructured Graph Partitioning and Sparse Matrix Ordering-Version 2.0," Department of Computer Science,University of Minnesota, Minneapolis, MN, USA, 1995. [20] B. W. Kernighan and S. Lin, "An Efficient Heuristic for Partitioning Graphs," The Bell System Technical Journal, 49, pp. 291-308, 1970. [21] S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, "Optimization by Simulated Annealing", Science, pp. 671-680, 1983. [22] G. Lee, M. S. Yeh, S. C. Lo and A. L. Chen, "A Strategy for Efficient Access of Multiple Data Items in Mobile Environments," Proceedings of the Third International Conference on Mobile Data Management , 2002. [23] J. Ma, K. Iwama, T. Takaoka and Q. P. Gu, "Efficient Parallel and Distributed Topological Sort Algorithms," Parallel Algorithms/Architecture Synthesis, Proceedings, Second Aizu International Symposium, pp. 378-383, 1997. [24] W. Ni , Q. Fang and S. V. Vrbsky , "A Lazy Data Request Approach for On-demand Data Broadcasting," Proceedings of the 23rd International Conference on Distributed Systems Workshops , 2003. [25] W. C. Peng, J. L. Huang and M. S. Chen, "Dynamic Leveling: Adaptive Data Broadcasting in a Mobile Computing Environment," Mobile Networks and Applications 8, pp. 355-364, 2003. [26] OBV Ramanaiah and H. Mohanty, "NICD: A Novel Indexless Wireless On-Demand Data Broadcast Algorithm," Proceedings of the Internation Conference on Information Technology: Coding and Computing , 2004 . [27] N. Saxena, K. Basu and S. K. Das, "Design and Performance Analysis of a Dynamic Hybrid Scheduling Algorithm for Heterogeneous Asymmetric Environments," Proceedings of the 18th International Parallel and distributed Processing Symposium , 2004. [28] S. Wang and H. L. Chen, "Near-Optimal Data Allocation Over Multiple Broadcast Channels," Networks, Proceedings. 12th IEEE International Conference on Vol 1, pp. 207-211, 2004. [29] X. Wu and V. C. S. Lee, "Preemptive Maximum Stretch Optimization Scheduling for Wireless On-Demand Data Broadcast," Proceeding of the International Database Engineering and Applications Symposium , 2004. [30] J. Xu, B. Zheng, W. C. Lee and D. L. Lee, "Energy Efficient Index for Querying Location-Dependent Data in Mobile Broadcast Environments," Proceedings of the International Conference on Data Engineering , 2003. [31] J. Zhang and L. Gruenwald , "Optimizing Data Placement Over Wireless Broadcast Channel For Multi-Dimensional Range Query Processing," Proceedings of the International Conference on Mobile Data Management, 2004. [32] G. K. Zipf. Human Behavior and the Principle of Least Effort. Addison-Wesley, Massachusetts, 1949.
|