Jakub Marszałkowski

Jakub Marszałkowski
Poznan University of Technology · Institute of Computing Science

M. Sc., PhD student

About

17
Publications
1,948
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
86
Citations
Additional affiliations
October 2010 - present
Poznan University of Technology
Position
  • Research Assistant

Publications

Publications (17)
Article
A CSS-sprite packing problem is considered in this article. CSS-sprite is a technique of combining many pictures of a web page into one image for the purpose of reducing network transfer time. The CSS-sprite packing problem is formulated here as an optimization challenge. The significance of geometric packing, image compression and communication pe...
Article
Advertising is the basic source of income for many web businesses. Preparing website layout for the advertisements is a problem faced by many web designers. The ads and other content are placed in several columns. Usually column widths are chosen ad hoc to fit the widest advertising unit. To make a more informed decisions website column width selec...
Article
Search engine ranking position is essential for marketing plans of many e-businesses. There is a lot of confusion over factors influencing this position. One of them is time performance factor. The purpose of this paper is to identify the role of load time factor in the algorithm ranking the search results in Google. We present empirical study of 4...
Article
Full-text available
In this paper we analyze the impact of memory hierarchies on time-energy trade-off in parallel computations. Contemporary computing systems have deep memory hierarchies with significantly different speeds and power consumptions. This results in nonlinear phenomena in the processing time and energy usage emerging when the size of the computation is...
Article
Energy consumption has become a factor limiting further progress of supercomputing. Grasping the relationships determining transformation of energy into computations is often difficult. Therefore, we propose a new method of visualizing the relationships as two-dimensional maps similar to isotherms or isobars in the weather maps. Complex models of e...
Book
Presented report for the first time is forming a coherent view of the sector. It contains completely new and first-time available data coming from research performed by Jakub Marszałkowski and Game Industry Conference team, including: + industry size with updated numbers of studios and trends, + the number of people working in game production in Po...
Article
In this paper tag cloud construction for web exposition is studied. Construction of a tag cloud must simultaneously solve at least three interdisciplinary engineering problems: modeling and controlling graphics aesthetics, solving discrete two-dimensional layout optimization problem, and all these must be done on computationally constrained browser...
Conference Paper
Full-text available
Tag clouds provide a graphical method of summarizing content of a text document (e.g. of a web page) with a set of phrases projected onto a plane. In this paper we consider building aesthetic tag clouds algorithmically for website use. General design choices in tag-cloud construction are analyzed. State of the art will be outlined along the lines o...
Conference Paper
Full-text available
Advertising servers play an important role in the entire contrary e-business. In this paper an approach for a high performance ad server is proposed. A prototype of a new architecture is presented: system achieving scalability by multiplication of ad servers with separate local memory storage and single managing server for entire cluster of those,...
Article
Full-text available
With a rapid growth of Internet usage, e-commerce projects, such as content management systems, on-line shops, social networking pages, and online webbased gaming, meet new performance challenges. In this note we enclose information on database systems using MySQL working in the background of web-based applications. Effect of table name length in s...

Questions

Question (1)
Question
I have small uncertainty with Cohen’s kappa coefficient and other kappa coefficients like Fleiss’ kappa or Siegel and Castellan's (1988) fixed-marginal multirater kappa.
Is Cohen’s kappa equal to the two others when we have only two annotators?

Network

Cited By

Projects

Project (1)
Archived project
Project http://www.cs.put.poznan.pl/ishop/ Internet Shopping Optimization Project (IShOP) is an INTER POLLUX project, cofunded by Luxembourg National Research Funds (FNR) and the Polish National Research Centre for Research and Development (NCBiR). This project is a collaboration between the Laboratory of Algorithm Design and Programming Systems of the Institute of Computing Science, Poznan University of Technology, Poland, and the Interdisciplinary Center of Security, Reliability and Trust (SnT) of the University of Luxembourg, Luxembourg. ----- The Aim This project proposes innovative and realistic models for different typical online shopping operations, supported by strong mathematical and operational research fundamentals, and well balanced with lightweight computational algorithms. These models are designed in order to allow the optimization of such transactions. Finding accurate solutions to the defined problems implies both lowering customer expenses and favouring market competitiveness. One of the main aims of this project is to model and formulate new advanced and realistic flavours of the Internet Shopping Optimization Problem (ISOP), considering discounts and additional conditions like price sensitive shipping costs, incomplete offers from shops, or the minimization of the total realization time, price, and delivery time functions, among others. The models will be mathematically and theoretically well founded. Moreover, the challenge of defining and addressing a multi-criteria version of the problem will be addressed too. Other important contributions will be the mapping of ISOP to other new challenges. One of them is the design of a novel business model for cloud brokering that will benefit both cloud providers and consumers. Providers will be able to easily offer their large number of services, and to get a fast answer from the market to offers (e.g., when infrastructure is under-utilized). Additionally, customers will easily benefit from offers and find the most appropriate deals for his/her needs (according to service level agreements, pricing, performance, etc.). Modelling some of these aspects and coupling it with an optimization tool for the brokering of cloud services among various providers would be a key contribution to the field. A wide set of optimization algorithms will be designed and developed for the addressed problems. They include from fast lightweight specialized heuristics to highly accurate parallel and multi-objective population-based metaheuristics. They all will be embedded in a software framework for their practical applications, and validation.