Skip to main content
Top

2018 | OriginalPaper | Chapter

Solving CSS-Sprite Packing Problem Using a Transformation to the Probabilistic Non-oriented Bin Packing Problem

Authors : Soumaya Sassi Mahfoudh, Monia Bellalouna, Leila Horchani

Published in: Computational Science – ICCS 2018

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

CSS-Sprite is a technique of regrouping small images of a web page, called tiles, into images called sprites in order to reduce network transfer time. CSS-sprite packing problem is considered as an optimization problem. We approach it as a probabilistic non-oriented two-dimensional bin packing problem (2PBPP|R). Our main contribution is to allow tiles rotation while packing them in sprites. An experimental study evaluated our solution, which outperforms current solutions.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
4.
5.
go back to reference Bellalouna, M.: Problèmes d’optimisation combinatoires probabilistes. Ph.D. thesis, Ecole Nationale des Ponts et Chaussees (1993) Bellalouna, M.: Problèmes d’optimisation combinatoires probabilistes. Ph.D. thesis, Ecole Nationale des Ponts et Chaussees (1993)
6.
go back to reference Chazelle, B.: The bottom-left bin-packing heuristic: an efficient implementation. IEEE Trans. Comput. 32(8), 697–707 (1983)CrossRef Chazelle, B.: The bottom-left bin-packing heuristic: an efficient implementation. IEEE Trans. Comput. 32(8), 697–707 (1983)CrossRef
7.
go back to reference Chen, P.H., Chen, Y., Goel, M., Mang, F.: Approximation of two-dimensional rectangle packing. Technical report (1999) Chen, P.H., Chen, Y., Goel, M., Mang, F.: Approximation of two-dimensional rectangle packing. Technical report (1999)
8.
go back to reference Chen, T.C., Chang, Y.W.: Modern floorplanning based on b*-tree and fast simulated annealing. Trans. Comp.-Aided Des. Integr. Circ. Sys. 25, 637–650 (2006)MathSciNetCrossRef Chen, T.C., Chang, Y.W.: Modern floorplanning based on b*-tree and fast simulated annealing. Trans. Comp.-Aided Des. Integr. Circ. Sys. 25, 637–650 (2006)MathSciNetCrossRef
9.
go back to reference El Hayek, J., Moukrim, A., Nègre, S.: New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. Comput. Oper. Res, 35(10), 3184–3201 (2008)CrossRef El Hayek, J., Moukrim, A., Nègre, S.: New resolution algorithm and pretreatments for the two-dimensional bin-packing problem. Comput. Oper. Res, 35(10), 3184–3201 (2008)CrossRef
12.
go back to reference Habib, A., Rahman, M.S.: Balancing decoding speed and memory usage for Huffman codes using quaternary tree. Appl. Inform. 4(1), 39–55 (2017)CrossRef Habib, A., Rahman, M.S.: Balancing decoding speed and memory usage for Huffman codes using quaternary tree. Appl. Inform. 4(1), 39–55 (2017)CrossRef
13.
go back to reference Huang, E., Korf, R.: Optimal rectangle packing: an absolute placement approach. J. Artif. Intell. Res. 46, 47–87 (2013)MathSciNetMATH Huang, E., Korf, R.: Optimal rectangle packing: an absolute placement approach. J. Artif. Intell. Res. 46, 47–87 (2013)MathSciNetMATH
14.
go back to reference Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6), 929–936 (1988)MathSciNetCrossRef Jaillet, P.: A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6), 929–936 (1988)MathSciNetCrossRef
15.
go back to reference Jaillet, P.: Analysis of probabilistic combinatorial optimization problems in euclidean spaces. Math. Oper. Res. 18(1), 51–70 (1993)MathSciNetCrossRef Jaillet, P.: Analysis of probabilistic combinatorial optimization problems in euclidean spaces. Math. Oper. Res. 18(1), 51–70 (1993)MathSciNetCrossRef
16.
go back to reference Jeon, M., Kim, Y., Hwang, J., Lee, J., Seo, E.: Workload characterization and performance implications of large-scale blog servers. ACM Trans. Web (TWEB) 6, 16 (2012) Jeon, M., Kim, Y., Hwang, J., Lee, J., Seo, E.: Workload characterization and performance implications of large-scale blog servers. ACM Trans. Web (TWEB) 6, 16 (2012)
17.
go back to reference Korf, R.: Optimal rectangle packing: new results. In. Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, ICAPS 2004, pp. 142–149 (2004) Korf, R.: Optimal rectangle packing: new results. In. Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, ICAPS 2004, pp. 142–149 (2004)
18.
go back to reference Lodi, A.: Algorithms for two-dimensional bin packing and assignment problems. Ph.D. thesis, Université de bologne (1999) Lodi, A.: Algorithms for two-dimensional bin packing and assignment problems. Ph.D. thesis, Université de bologne (1999)
19.
go back to reference Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123(1–3), 379–396 (2002)MathSciNetCrossRef Lodi, A., Martello, S., Vigo, D.: Recent advances on two-dimensional bin packing problems. Discret. Appl. Math. 123(1–3), 379–396 (2002)MathSciNetCrossRef
20.
go back to reference Marszalkowski, J., Mizgajski, J., Mokwa, D., Drozdowski, M.: Analysis and solution of CSS-sprite packing problem. ACM Trans. Web (TWEB) 10(1), 283–294 (2015) Marszalkowski, J., Mizgajski, J., Mokwa, D., Drozdowski, M.: Analysis and solution of CSS-sprite packing problem. ACM Trans. Web (TWEB) 10(1), 283–294 (2015)
22.
go back to reference Rehman, M., Sharif, M., Raza, M.: Image compression: a survey. Res. J. Appl. Sci. Eng. Technol. 7(4), 656–672 (2014) Rehman, M., Sharif, M., Raza, M.: Image compression: a survey. Res. J. Appl. Sci. Eng. Technol. 7(4), 656–672 (2014)
23.
go back to reference Shea, D.: CSS sprites: image slicings kiss of death. A List Apart (2013) Shea, D.: CSS sprites: image slicings kiss of death. A List Apart (2013)
26.
go back to reference Velho, P., Schnorr, M., Casanova, H., Legrand, A.: On the validity of flow-level TCP network models for grid and cloud simulations. ACM Trans. Model. Comput. Simul. (TOMACS) 23, 23 (2013)MathSciNetCrossRef Velho, P., Schnorr, M., Casanova, H., Legrand, A.: On the validity of flow-level TCP network models for grid and cloud simulations. ACM Trans. Model. Comput. Simul. (TOMACS) 23, 23 (2013)MathSciNetCrossRef
27.
go back to reference Wium Lie, H., Bos, B.: Cascading style sheets. World Wide Web J. 2, 75–123 (1997) Wium Lie, H., Bos, B.: Cascading style sheets. World Wide Web J. 2, 75–123 (1997)
Metadata
Title
Solving CSS-Sprite Packing Problem Using a Transformation to the Probabilistic Non-oriented Bin Packing Problem
Authors
Soumaya Sassi Mahfoudh
Monia Bellalouna
Leila Horchani
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-319-93701-4_44

Premium Partner