<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Filippo Galli</style></author><author><style face="normal" font="default" size="100%">Antonio Ritacco</style></author><author><style face="normal" font="default" size="100%">Giacomo Lanciano</style></author><author><style face="normal" font="default" size="100%">Marco Vannocci</style></author><author><style face="normal" font="default" size="100%">Valentina Colla</style></author><author><style face="normal" font="default" size="100%">Marco Vannucci</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Self-supervised pre-training of CNNs for flatness defect classification in the steelworks industry</style></title><secondary-title><style face="normal" font="default" size="100%">International Journal of Advances in Intelligent Informatics</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">CNN</style></keyword><keyword><style  face="normal" font="default" size="100%">Deep learning</style></keyword><keyword><style  face="normal" font="default" size="100%">Self-supervision</style></keyword><keyword><style  face="normal" font="default" size="100%">Steelworks</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ijain.org/index.php/IJAIN/article/view/410</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">13–22</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Classification of surface defects in the steelworks industry plays a significant role in guaranteeing the quality of the products. From an industrial point of view, a serious concern is represented by the hot-rolled products shape defects and particularly those concerning the strip flatness. Flatness defects are typically divided into four sub-classes depending on which part of the strip is affected and the corresponding shape. In the context of this research, the primary objective is evaluating the improvements of exploiting the self-supervised learning paradigm for defects classification, taking advantage of unlabelled, real, steel strip flatness maps. Different pre-training methods are compared, as well as architectures, taking advantage of well-established neural subnetworks, such as Residual and Inception modules. A systematic approach in evaluating the different performances guarantees a formal verification of the self-supervised pre-training paradigms evaluated hereafter. In particular, pre-training neural networks with the EgoMotion meta-algorithm shows classification improvements over the AutoEncoder technique, which in turn is better performing than a Glorot weight initialization.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giacomo Lanciano</style></author><author><style face="normal" font="default" size="100%">Antonio Ritacco</style></author><author><style face="normal" font="default" size="100%">Tommaso Cucinotta</style></author><author><style face="normal" font="default" size="100%">Marco Vannucci</style></author><author><style face="normal" font="default" size="100%">Antonino Artale</style></author><author><style face="normal" font="default" size="100%">Luca Basili</style></author><author><style face="normal" font="default" size="100%">Enrica Sposato</style></author><author><style face="normal" font="default" size="100%">Joao Barata</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SOM-Based Behavioral Analysis for Virtualized Network Functions</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 35th Annual ACM Symposium on Applied Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">machine learning</style></keyword><keyword><style  face="normal" font="default" size="100%">network function virtualization</style></keyword><keyword><style  face="normal" font="default" size="100%">self-organizing maps</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1145/3341105.3374110</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Association for Computing Machinery</style></publisher><pub-location><style face="normal" font="default" size="100%">New York, NY, USA</style></pub-location><isbn><style face="normal" font="default" size="100%">9781450368667</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In this paper, we propose a mechanism based on Self-Organizing Maps for analyzing the resource consumption behaviors and detecting possible anomalies in data centers for Network Function Virtualization (NFV). Our approach is based on a joint analysis of two historical data sets available through two separate monitoring systems: system-level metrics for the physical and virtual machines obtained from the monitoring infrastructure, and application-level metrics available from the individual virtualized network functions. Experimental results, obtained by processing real data from one of the NFV data centers of the Vodafone network operator, highlight some of the capabilities of our system to identify interesting points in space and time of the evolution of the monitored infrastructure.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Massimiliano de Leoni</style></author><author><style face="normal" font="default" size="100%">Giacomo Lanciano</style></author><author><style face="normal" font="default" size="100%">Andrea Marrella</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Aligning Partially-Ordered Process-Execution Traces and Models Using Automated Planning</style></title><secondary-title><style face="normal" font="default" size="100%">28th International Conference on Automated Planning and Scheduling (ICAPS 2018)</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Automated Planning</style></keyword><keyword><style  face="normal" font="default" size="100%">Conformance Checking</style></keyword><keyword><style  face="normal" font="default" size="100%">PDDL</style></keyword><keyword><style  face="normal" font="default" size="100%">Process Mining</style></keyword><keyword><style  face="normal" font="default" size="100%">Trace Alignment</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://www.aaai.org/ocs/index.php/ICAPS/ICAPS18/paper/view/17739/16951</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Conformance checking is the problem of verifying if the actual executions of business processes, which are recorded by information systems in dedicated event logs, are compliant with a process model that encodes the process' constraints. Within conformance checking, alignment-based techniques can exactly pinpoint where deviations are observed. Existing alignment-based techniques rely on the assumption of a perfect knowledge of the order with which process' activities were executed in reality. However, experience shows that, due to logging errors and inaccuracies, it is not always possible to determine the exact order with which certain activities were executed. This paper illustrates an alignment-based technique where the perfect knowledge assumption of the execution's order is removed. The technique transforms the problem of alignment-based conformance checking into a planning problem encoded in PDDL, for which planners can find a correct solution in a finite amount of time. We implemented the technique as a software tool that is integrated with state-of-the-art planners. To showcase its practical relevance and scalability, we report on experiments with a real-life case study and several synthetic ones of increasing complexity.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>45</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Giacomo Lanciano</style></author><author><style face="normal" font="default" size="100%">Massimiliano de Leoni</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Models and Logs used in the paper ‘Aligning Partially-Ordered Process-Execution Traces and Models Using Automated Planning’ accepted for ICAPS 2018</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Computation Theory and Mathematics</style></keyword><keyword><style  face="normal" font="default" size="100%">Event Logs</style></keyword><keyword><style  face="normal" font="default" size="100%">Petri nets</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://data.4tu.nl/repository/uuid:a02afec8-b7c7-42b7-8dff-36d3de3032be</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">TU Eindhoven</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Massimiliano de Leoni</style></author><author><style face="normal" font="default" size="100%">Giacomo Lanciano</style></author><author><style face="normal" font="default" size="100%">Andrea Marrella</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Tool for Aligning Event Logs and Prescriptive Process Models through Automated Planning</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the BPM Demo Track and BPM Dissertation Award co-located with 15th International Conference on Business Process Modeling (BPM 2017)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-1920/BPM_2017_paper_187.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">In Conformance Checking, alignment is the problem of detecting and repairing nonconformity between the actual execution of a business process, as recorded in an event log, and the model of the same process. Literature proposes solutions for the alignment problem that are implementations of planning algorithms built ad-hoc for the specific problem. Unfortunately, in the era of big data, these ad-hoc implementations do not scale sufficiently compared with well-established planning systems. In this paper, we tackle the above issue by presenting a tool, also available in ProM, to represent instances of the alignment problem as automated planning problems in PDDL (Planning Domain Definition Language) for which state-of-the-art planners can find a correct solution in a finite amount of time. If alignment problems are converted into planning problems, one can seamlessly update to the recent versions of the best performing automated planners, with advantages in term of versatility and customization. Furthermore, by employing several processes and event logs of different sizes, we show how our tool outperforms existing approaches of several order of magnitude and, in certain cases, carries out the task while existing approaches run out of memory.</style></abstract></record></records></xml>