Вход на сайт

Просмотр новости

Найдите то, что Вас интересует

Anthony Lin receives Google Faculty Research Award

Дата публикации: 02-05-2017 11:00:00



Основное содержимое страницы с новостью.

Posted: 2nd May 2017

Associate Professor Anthony Lin is the recipient of a Google Faculty Research Award, for his research on Cascading Style Sheet (CSS) Minification via Graph Optimisation and Constraint Solving.

Recent studies have shown that on average web pages have more than tripled in size in the past six years. This large increase in web page size not only raises the bandwidth requirement and download time, but it also increases processing time for web browsers. This is especially bad news for users with limited data usage, slow internet connection, and/or limited computing power. Two standard techniques for reducing file sizes transmitted over the web are: (1) compression, and (2) minification. Compression means applying a standard compression algorithm (typically, gzip) before a file is transmitted to the user, and a decompression algorithm (typically, gunzip) after a file is downloaded by the browser. Gzip is now supported by many web hosts and almost all modern browsers, and can be applied to all types of files (including images, JavaScript, HTML, and CSS). Minification, on the other hand, means that we apply a semantic-preserving transformation to the source code (JavaScript, CSS, and HTML) in a way that makes the resulting code (in the same language) smaller. Both compression and minification are typically used to reduce the size of a deployed page.

Anthony's research project aims to develop advanced CSS minification algorithm that combines and merges similar rules in a CSS file. This is an instance of code refactoring in the context of CSS. Identifying such refactoring opportunities involves challenges including: (1) developing a formalisation of the semantics of CSS selectors, along with an algorithm for checking intersection of two given selectors, (2) reducing the resulting refactoring/minification problem to a graph optimization problem that can be solved by a constraint solving problem (SMT and MaxSAT problems).

The goal of the research is to achieve a better file size reduction in comparison to existing minification techniques.

Схожие новости

#Наименование новостиТональностьИнформативностьДата публикации
1Dan Olteanu receives Google Faculty Research Award for his work on factorised databases01028-08-2014
2Google research Award success for Shimon Whiteson01028-02-2017
3Collaborative team win Facebook Research ‘Probability and Programming’ research award08.121-05-2019
4$60,000 Google Research Award011.7320-07-2010
5Professor Sir Tony Hoare wins new honour01004-05-2017
6Kasper Rasmussen wins Royal Society University Research Fellowship01021-07-2015
7Google PhD Fellowship 2016 awarded to Oxford Comp Sci student Marcelo Sousa018.3315-03-2016
8Oxford Computer Science student Lia Yeh awarded Google PhD Fellowship07.0216-10-2023
9Thesis awarded the ACP Doctoral Research Award01025-07-2017
10Food Science professor receives international Willmar Schwabe Award01016-07-2026

Классификация: Пресс-релизы. Схожих патентов: 0. Схожих новостей: 10. Тональность: 0. Информативность: 10. Источник: www.cs.ox.ac.uk.