Search

Your search keyword '"Andrzejak, Artur"' showing total 160 results
Start Over Author "Andrzejak, Artur"
160 results on '"Andrzejak, Artur"'

2. One DSL to Rule Them All: IDE-Assisted Code Generation for Agile Data Analysis

Author

Andrzejak, Artur, Wenz, Oliver, and Costa, Diego

Subjects
Computer Science - Software Engineering, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Human-Computer Interaction, Computer Science - Programming Languages
Abstract

Data analysis is at the core of scientific studies, a prominent task that researchers and practitioners typically undertake by programming their own set of automated scripts. While there is no shortage of tools and languages available for designing data analysis pipelines, users spend substantial effort in learning the specifics of such languages/tools and often design solutions too project specific to be reused in future studies. Furthermore, users need to put further effort into making their code scalable, as parallel implementations are typically more complex. We address these problems by proposing an advanced code recommendation tool which facilitates developing data science scripts. Users formulate their intentions in a human-readable Domain Specific Language (DSL) for dataframe manipulation and analysis. The DSL statements can be converted into executable Python code during editing. To avoid the need to learn the DSL and increase user-friendliness, our tool supports code completion in mainstream IDEs and editors. Moreover, DSL statements can generate executable code for different data analysis frameworks (currently we support Pandas and PySpark). Overall, our approach attempts to accelerate programming of common data analysis tasks and to facilitate the conversion of the implementations between frameworks. In a preliminary assessment based on a popular data processing tutorial, our tool was able to fully cover 9 out of 14 processing steps for Pandas and 10 out of 16 for PySpark, while partially covering 4 processing steps for each of the frameworks., Comment: 7 pages

Published
2019

4. Testing Very Large Database Management Systems: The Case of SAP HANA

Author

Bach, Thomas, Andrzejak, Artur, Seo, Changyun, Bierstedt, Christian, Lemke, Christian, Ritter, Daniel, Hwang, Dong Won, Sheshi, Erda, Schabernack, Felix, Renkes, Frank, Gaumnitz, Gordon, Martens, Jakob, Hoemke, Lars, Felderer, Michael, Rudolf, Michael, Jambigi, Neetha, May, Norman, Joy, Robin, Scheja, Ruben, Schwedes, Sascha, Seibel, Sebastian, Seifert, Sebastian, Haas, Stefan, Kraft, Stephan, Kroll, Thomas, Scheuer, Tobias, and Lehner, Wolfgang

Published
2022
Full Text
View/download PDF

5. Memory and Resource Leak Defects and their Repairs in Java Projects

Author

Ghanavati, Mohammadreza, Costa, Diego, Seboek, Janos, Lo, David, and Andrzejak, Artur

Subjects
Computer Science - Software Engineering
Abstract

Despite huge software engineering efforts and programming language support, resource and memory leaks are still a troublesome issue, even in memory-managed languages such as Java. Understanding the properties of leak-inducing defects, how the leaks manifest, and how they are repaired is an essential prerequisite for designing better approaches for avoidance, diagnosis, and repair of leak-related bugs. We conduct a detailed empirical study on 491 issues from 15 large open-source Java projects. The study proposes taxonomies for the leak types, for the defects causing them, and for the repair actions. We investigate, under several aspects, the distributions within each taxonomy and the relationships between them. We find that manual code inspection and manual runtime detection are still the main methods for leak detection. We find that most of the errors manifest on error-free execution paths, and developers repair the leak defects in a shorter time than non-leak defects. We also identify 13 recurring code transformations in the repair patches. Based on our findings, we draw a variety of implications on how developers can avoid, detect, isolate and repair leak-related bugs.

Published
2018
Full Text
View/download PDF

8. Online Workload Forecasting

Author

Herbst, Nikolas, Amin, Ayman, Andrzejak, Artur, Grunske, Lars, Kounev, Samuel, Mengshoel, Ole J., Sundararajan, Priya, Kounev, Samuel, editor, Kephart, Jeffrey O., editor, Milenkoski, Aleksandar, editor, and Zhu, Xiaoyun, editor

Published
2017
Full Text
View/download PDF

12. Ensuring Collective Availability in Volatile Resource Pools Via Forecasting

Author

Andrzejak, Artur, Kondo, Derrick, Anderson, David P., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, De Turck, Filip, editor, Kellerer, Wolfgang, editor, and Kormentzas, George, editor

Published
2008
Full Text
View/download PDF

13. Managing Performance of Aging Applications Via Synchronized Replica Rejuvenation

Author

Andrzejak, Artur, Moser, Monika, Silva, Luis, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Clemm, Alexander, editor, Granville, Lisandro Zambenedetti, editor, and Stadler, Rolf, editor

Published
2007
Full Text
View/download PDF

14. On Adaptability in Grid Systems

Author

Andrzejak, Artur, Reinefeld, Alexander, Schintke, Florian, Schütt, Thorsten, Getov, Vladimir, editor, Laforenza, Domenico, editor, and Reinefeld, Alexander, editor

Published
2006
Full Text
View/download PDF

15. Adaptive Service Placement Algorithms for Autonomous Service Networks

Author

Graupner, Sven, Andrzejak, Artur, Kotov, Vadim, Trinks, Holger, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Carbonell, Jaime G., editor, Siekmann, Jörg, editor, Brueckner, Sven A., editor, Di Marzo Serugendo, Giovanna, editor, Karageorgos, Anthony, editor, and Nagpal, Radhika, editor

Published
2005
Full Text
View/download PDF

18. Introduction to randomized algorithms

Author

Andrzejak, Artur, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Mayr, Ernst W., editor, Jürgen Prömel, Hans, editor, and Steger, Angelika, editor

Published
1998
Full Text
View/download PDF

20. Topic 6: Grid, Cluster and Cloud Computing

Author

Elmroth, Erik, Fragopoulou, Paraskevi, Andrzejak, Artur, Brandic, Ivona, Djemame, Karim, Romano, Paolo, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kaklamanis, Christos, editor, Papatheodorou, Theodore, editor, and Spirakis, Paul G., editor

Published
2012
Full Text
View/download PDF

24. Building a large and efficient hybrid peer-to-peer Internet caching system

Author

Xiao, Li, Zhang, Xiaodong, Andrzejak, Artur, and Chen, Songqing

Subjects
Internet -- Research, Internet, Business, Computers, Electronics, Electronics and electrical industries
Abstract

Proxy hit ratios tend to decrease as the demand and supply of Web contents are becoming more diverse. By case studies, we quantitatively confirm this trend and observe significant document duplications among a proxy and its client browsers' caches. One reason behind this trend is that the client/server Web caching model does not support direct resource sharing among clients, causing the Web contents and the network bandwidths among clients to be relatively underutilized. To address these limits and improve Web caching performance, we have extensively enhanced and deployed our browsers-aware framework, a peer-to-peer Web caching management scheme. We make the browsers and their proxy share the contents to exploit the neglected but rich data locality in browsers and reduce document duplications among the proxy and browsers' caches to effectively utilize the Web contents and network bandwidth among clients. The objective of our scheme is to improve the scalability of proxy-based caching both in the number of connected clients and in the diversity of Web documents. In this paper, we show that building such a caching system with considerations of sharing contents among clients, minimizing document duplications, and achieving data integrity and communication anonymity is not only feasible but also highly effective. Index Term--Internet systems, peer-to-peer systems, proxy caching, browser caching, data integrity, communication anonymity.

Published
2004

33. Topic 6 Grid and Cluster Computing

Author

Badia, Rosa M., Pérez, Christian, Andrzejak, Artur, Arenas, Alvaro, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Kermarrec, Anne-Marie, editor, Bougé, Luc, editor, and Priol, Thierry, editor

Published
2007
Full Text
View/download PDF

34. Approximate Distributed Set Reconciliation with Defined Accuracy

Author

Reinefeld, Alexander, Schweikardt, Nicole, Andrzejak, Artur, Kruber, Nico, Reinefeld, Alexander, Schweikardt, Nicole, Andrzejak, Artur, and Kruber, Nico

Abstract

Mit aktuell vorhandenen Mitteln ist es schwierig, objektiv approximative Algorithmen zum Mengenabgleich gegenüberzustellen und zu vergleichen. Jeder Algorithmus kann durch unterschiedliche Wahl seiner jeweiligen Parameter an ein gegebenes Szenario angepasst werden und so zum Beispiel Bandbreiten- oder CPU-optimiert werden. Änderungen an den Parametern gehen jedoch meistens auch mit Änderungen an der Genauigkeit bei der Erkennung von Differenzen in den teilnehmenden Mengen einher und behindern somit objektive Vergleiche, die auf derselben Genauigkeit basieren. In dieser Arbeit wird eine Methodik entwickelt, die einen fairen Vergleich von approximativen Algorithmen zum Mengenabgleich erlaubt. Dabei wird eine feste Zielgenauigkeit definiert und im Weiteren alle die Genauigkeit beeinflussenden Parameter entsprechend gesetzt. Diese Methode ist universell genug, um für eine breite Masse an Algorithmen eingesetzt zu werden. In der Arbeit wird sie auf zwei triviale hashbasierte Algorithmen, einem basierend auf Bloom Filtern und einem basierend auf Merkle Trees angewandt, um dies zu untermauern. Im Vergleich zu vorherigen Arbeiten zu Merkle Trees wird vorgeschlagen, die Größe der Hashsummen dynamisch im Baum zu wählen und so den Bandbreitenbedarf an die gewünschte Zielgenauigkeit anzupassen. Dabei entsteht eine neue Variante des Mengenabgleichs mit Merkle Trees, bei der sich erstmalig die Genauigkeit konfigurieren lässt. Eine umfassende Evaluation eines jeden der vier unter dem Genauigkeitsmodell angepassten Algorithmen bestätigt die Anwendbarkeit der entwickelten Methodik und nimmt eine Neubewertung dieser Algorithmen vor. Die vorliegenden Ergebnisse erlauben die Auswahl eines effizienten Algorithmus für unterschiedliche praktische Szenarien basierend auf einer gewünschten Zielgenauigkeit. Die präsentierte Methodik zur Bestimmung passender Parameter, um für unterschiedliche Algorithmen die gleiche Genauigkeit zu erreichen, kann auch auf weitere Algorithmen zum Mengenabgleic, The objective comparison of approximate versioned set reconciliation algorithms is challenging. Each algorithm's behaviour can be tuned for a given use case, e.g. low bandwidth or computational overhead, using different sets of parameters. Changes of these parameters, however, often also influence the algorithm's accuracy in recognising differences between participating sets and thus hinder objective comparisons based on the same level of accuracy. We develop a method to fairly compare approximate set reconciliation algorithms by enforcing a fixed accuracy and deriving accuracy-influencing parameters accordingly. We show this method's universal applicability by adopting two trivial hash-based algorithms as well as set reconciliation with Bloom filters and Merkle trees. Compared to previous research on Merkle trees, we propose to use dynamic hash sizes to align the transfer overhead with the desired accuracy and create a new Merkle tree reconciliation algorithm with an adjustable accuracy target. An extensive evaluation of each algorithm under this accuracy model verifies its feasibility and ranks these four algorithms. Our results allow to easily choose an efficient algorithm for practical set reconciliation tasks based on the required level of accuracy. Our way to find configuration parameters for different, yet equally accurate, algorithms can also be adopted to other set reconciliation algorithms and allows to rate their respective performance in an objective manner. The resultant new approximate Merkle tree reconciliation broadens the applicability of Merkle trees and sheds some new light on its effectiveness.

Published
2020

Catalog

Books, media, physical & digital resources
See catalog results