An optimization model for Web content adaptation

Authors:
Rong-Hong Jan;Ching-Peng Lin;Maw-Sheng Chern
Affiliations:
Department of Computer and Information Science, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 30050, Taiwan, ROC;Department of Computer and Information Science, National Chiao Tung University, 1001 Ta Hsueh Road, Hsinchu 30050, Taiwan, ROC;Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu 30043, Taiwan, ROC
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2006

Citing 9
Cited 2

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
Collaborative proxy system for distributed Web content transcoding

Proceedings of the ninth international conference on Information and knowledge management
WebSplitter: a unified XML framework for multi-device collaborative Web browsing

CSCW '00 Proceedings of the 2000 ACM conference on Computer supported cooperative work
PTC: Proxies that Transcode and Cache in Heterogeneous Web Client Environments

WISE '02 Proceedings of the 3rd International Conference on Web Information Systems Engineering
Design of a Framework for Dynamic Content Adaptation to Web-Enabled Terminals and Enterprise Applications

APSEC '99 Proceedings of the Sixth Asia Pacific Software Engineering Conference
An Active Transcoding Proxy to Support Mobile Web Access

SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Dynamic Programming

Dynamic Programming
Adapting multimedia Internet content for universal access

IEEE Transactions on Multimedia

A cluster-based approach to web adaptation in context-aware applications

Journal of Web Engineering
QAVA: quota aware video adaptation

Proceedings of the 8th international conference on Emerging networking experiments and technologies

Quantified Score

Hi-index	0.02

Visualization

Abstract

This paper considers Web content adaptation with a bandwidth constraint for server-based adaptive Web systems. The problem can be stated as follows: Given a Web page P consisting of n component items d"1,d"2,...,d"n and each of the component items d"i having J"i versions d"i"""1,d"i"""2,...,d"i"""J"""""""i, for each component item d"i select one of its versions to compose the Web page such that the fidelity function is maximized subject to the bandwidth constraint. We formulate this problem as a linear multi-choice knapsack problem (LMCKP). This paper transforms the LMCKP into a knapsack problem (KP) and then presents a dynamic programming method to solve the KP. A numerical example illustrates this method and shows its effectiveness.