Effective Floating Strategies

F. Mittelbach
{"title":"Effective Floating Strategies","authors":"F. Mittelbach","doi":"10.1145/3103010.3103015","DOIUrl":null,"url":null,"abstract":"This paper presents an extension to the general framework for globally optimized pagination described in Mittelbach (2016). The extended algorithm supports automatic placement of floats as part of the optimization. It uses a flexible constraint model that allows for the implementation of typical typographic rules that can be weighted against each other to support different application scenarios. By \"flexible\" we mean that the rules of typographic presentation of the content of a document element are not fixed---but neither are they completely arbitrary; also, some of these rules are absolute whereas others are in the form of preferences. It is easy to see that without restrictions the float placement possibilities grow exponentially if the number of floats has a linear relation to the document size. It is therefore important to restrict the objective function used for optimization in a way that the algorithm does not have to evaluate all theoretically possible placements while still being guaranteed to find an optimal solution. Different objective functions are being evaluated against typical typographic requirements in order to arrive at a system that is both rich in its expressiveness of modeling a large class of pagination applications and at the same time is capable of solving the optimization problem in acceptable time for realistic input data. Frank Mittelbach. 2016. A General Framework for Globally Optimized Pagination. In Proceedings of the 2016 ACM Symposium on Document Engineering (DocEng '16). ACM, New York, NY, USA, pages 11--20.","PeriodicalId":200469,"journal":{"name":"Proceedings of the 2017 ACM Symposium on Document Engineering","volume":"819 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2017 ACM Symposium on Document Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3103010.3103015","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper presents an extension to the general framework for globally optimized pagination described in Mittelbach (2016). The extended algorithm supports automatic placement of floats as part of the optimization. It uses a flexible constraint model that allows for the implementation of typical typographic rules that can be weighted against each other to support different application scenarios. By "flexible" we mean that the rules of typographic presentation of the content of a document element are not fixed---but neither are they completely arbitrary; also, some of these rules are absolute whereas others are in the form of preferences. It is easy to see that without restrictions the float placement possibilities grow exponentially if the number of floats has a linear relation to the document size. It is therefore important to restrict the objective function used for optimization in a way that the algorithm does not have to evaluate all theoretically possible placements while still being guaranteed to find an optimal solution. Different objective functions are being evaluated against typical typographic requirements in order to arrive at a system that is both rich in its expressiveness of modeling a large class of pagination applications and at the same time is capable of solving the optimization problem in acceptable time for realistic input data. Frank Mittelbach. 2016. A General Framework for Globally Optimized Pagination. In Proceedings of the 2016 ACM Symposium on Document Engineering (DocEng '16). ACM, New York, NY, USA, pages 11--20.
有效的浮动策略
本文提出了对Mittelbach(2016)中描述的全局优化分页的一般框架的扩展。扩展算法支持自动放置浮点数作为优化的一部分。它使用灵活的约束模型,允许实现典型的排版规则,这些规则可以相互权衡,以支持不同的应用程序场景。所谓“灵活”,我们指的是文档元素内容的排版呈现规则不是固定的——但也不是完全任意的;此外,其中一些规则是绝对的,而其他规则则以偏好的形式存在。很容易看出,如果没有限制,如果浮点数与文档大小呈线性关系,那么浮点数放置的可能性就会呈指数级增长。因此,限制用于优化的目标函数是很重要的,这样算法就不必评估所有理论上可能的位置,同时仍然保证找到最优解。根据典型的排版需求评估不同的目标函数,以便得到一个既具有丰富的对大型分页应用程序建模的表达能力,同时又能够在可接受的时间内解决实际输入数据的优化问题的系统。Frank Mittelbach, 2016。全局优化分页的通用框架。2016年ACM文献工程研讨会论文集(DocEng '16)。ACM,美国纽约,第11—20页。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信