Ákos Horváth

Ákos Horváth

Auto-generated profile, based on publicly available information

Ákos Horváth

Budapest University of Technology and Economics

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2015 in Science of Computer Programming
Verified
Journal Article
Closed access
ZUZoltán Ujhelyi
Zoltán Ujhelyi
GBGábor Bergmann
Gábor Bergmann
ÁHÁbel Hegedüs
Ábel Hegedüs
ÁHÁkos Horváth
Ákos Horváth
BIBenedek Izsó
Benedek Izsó
DVDániel Varró
Dániel Varró

1 January 2010
Verified
Book Chapter
Closed access
PDF file
GBGábor Bergmann
Gábor Bergmann
ÁHÁkos Horváth
Ákos Horváth
IRIstván Ráth
István Ráth
DVDániel Varró
Dániel Varró
ABAndrás Balogh
András Balogh
AÖAndrás Ökrös
András Ökrös

15 September 2014
Verified
Conference Paper
Open access
HAHani Abdeen
Hani Abdeen
DVDániel Varró
Dániel Varró
HSHouari Sahraoui
Houari Sahraoui
ANAndrás Szabolcs Nagy
András Szabolcs Nagy
CDCsaba Debreceni
Csaba Debreceni
ÁHÁkos Horváth
Ákos Horváth
Design space exploration (DSE) aims to find optimal design candidates of a domain with respect to different objectives where design candidates are constrained by complex structural and numerical restrictions. Rule-based DSE aims to find such candidates that are reachable from an initial model by applying a sequence of exploration rules. Solving a rule-based DSE problem is a difficult challenge due to the inherently dynamic nature of the problem. In the current paper, we propose to integrate multi-objective optimization techniques by using Non-dominated Sorting Genetic Algorithms (NSGA) to drive rule-based design space exploration. For this purpose, finite populations of the most promising design candidates are maintained wrt. different optimization criteria. In our context, individuals of a generation are defined as a sequence of rule applications leading from an initial model to a candidate model. Populations evolve by mutation and crossover operations which manipulate (change, extend or combine) rule execution sequences to yield new individuals. Our multi-objective optimization approach for rule-based DSE is domain independent and it is automated by tooling built on the Eclipse framework. The main added value is to seamlessly lift multi-objective optimization techniques to the exploration process preserving both domain independence and a high-level of abstraction. Design candidates will still be represented as models and the evolution of these models as rule execution sequences. Constraints are captured by model queries while objectives can be derived both from models or rule applications.

13 November 2009 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
DCDelia Ciullo
Delia Ciullo
MGMaria Antonieta Garcia
Maria Antonieta Garcia
AHAkos Horvath
Akos Horvath
ELEmilio Leonardi
Emilio Leonardi
MMMarco Mellia
Marco Mellia
PVPaolo Veglia
Paolo Veglia
Early P2P-TV systems have already attracted millions of users, and many new commercial solutions are entering this market. Little information is however available about how these systems work, due to their closed and proprietary design. In this paper, we present large scale experiments to compare three of the most successful P2P-TV systems, namely PPLive, SopCast and TVAnts. Our goal is to assess what level of "network awareness" has been embedded in the applications. We first define a general framework to quantify which network layer parameters leverage application choices, i.e., what parameters mainly drive the peer selection and data exchange. We then apply the methodology to a large dataset, collected during a number of experiments where we deployed about 40 peers in several European countries. From analysis of the dataset, we observe that TVAnts and PPLive exhibit a mild preference to exchange data among peers in the same autonomous system the peer belongs to, while this clustering effect is less intense in SopCast. However, no preference versus country, subnet or hop count is shown. Therefore, we believe that next-generation P2P live streaming applications definitively need to improve the level of network-awareness, so to better localize the traffic in the network and thus increase their network-friendliness as well.

20 August 2014 in Automated Software Engineering
Verified
Journal Article
Closed access
PDF file
ÁHÁbel Hegedüs
Ábel Hegedüs
ÁHÁkos Horváth
Ákos Horváth
DVDániel Varró
Dániel Varró

1 September 2011
Verified
Conference Paper
Closed access
ÁHÁbel Hegedüs
Ábel Hegedüs
ÁHÁkos Horváth
Ákos Horváth
IRIstván Ráth
István Ráth
MBMoisés Castelo Branco
Moisés Castelo Branco
DVDániel Varró
Dániel Varró
Domain-specific modeling languages (DSML) proved to be an important asset in creating powerful design tools for domain experts. Although these tools are capable of preserving the syntax-correctness of models even during free-hand editing, they often lack the ability of maintaining model consistency for complex language-specific constraints. Hence, there is a need for a tool-level automatism to assist DSML users in resolving consistency violation problems. In this paper, we describe an approach for the automatic generation of quick fixes for DSMLs, taking a set of domain-specific constraints and model manipulation policies as input. The computation relies on statespace exploration techniques to find sequences of operations that decrease the number of inconsistencies. Our approach is illustrated using a BPMN case study, and it is evaluated by several experiments to show its feasibility and performance.