Papers by Claudio Schifanella
2016 IEEE International Smart Cities Conference (ISC2), 2016
Bookmarks Related papers MentionsView impact
IEEE Access, 2016
Bookmarks Related papers MentionsView impact
2014 IEEE Joint Intelligence and Security Informatics Conference, 2014
ABSTRACT This paper proposes a method to infer the itinerary of cargo transported in shipping con... more ABSTRACT This paper proposes a method to infer the itinerary of cargo transported in shipping containers based on a large, heterogeneous and noisy dataset of Container Status Messages. Such itinerary information can be used to improve the risk analysis performed by authorities in their effort to secure the global trade and fight frauds. Our method, based on conditional random fields, is able not only to partition the original noisy dataset into appropriate sequences describing distinct shipments of containerized cargo but also to identify the messages that describe the various stages of the transportation. The experiments performed suggest that conditional random fields provide a high accuracy for this sequential pattern mining problem.
Bookmarks Related papers MentionsView impact
... choreographies and capabilities Claudio Schifanella Computer Science Department University of... more ... choreographies and capabilities Claudio Schifanella Computer Science Department University of Torino ... I would like to thank my parents who have been extremely understanding and sup-portive of my studies, my brother Rossano for the continuous support both in scientific ...
Bookmarks Related papers MentionsView impact
Proceedings of the 19th ACM Conference on Computer Supported Cooperative Work and Social Computing Companion - CSCW '16 Companion, 2016
Bookmarks Related papers MentionsView impact
Proceedings of the 19th ACM Conference on Computer Supported Cooperative Work and Social Computing Companion - CSCW '16 Companion, 2016
Bookmarks Related papers MentionsView impact
2014 Ieee Acm International Conference on Advances in Social Networks Analysis and Mining, Aug 1, 2014
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science, 2005
Bookmarks Related papers MentionsView impact
IEEE Access, 2016
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Proceedings of the 24th International Conference on World Wide Web - WWW '15 Companion, 2015
Bookmarks Related papers MentionsView impact
Mallow, 2009
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Woa, 2004
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
A typical problem of research in the area of Service-Oriented Systems is the composition of a set... more A typical problem of research in the area of Service-Oriented Systems is the composition of a set of services for executing a complex task. In this paper we face an instance of this problem in which a set of parties (be they peers, agents or systems) have to interact according to a given choreography. In particular, we mean to exploit the role definitions con-tained in the choreography for realizing interaction policies that can be executed by the involved parties. In this case it is necessary that the choreography captures not only the in-teractive behavior of the system as a whole but that the role definitions contain also a set of requirements of capabilities that the parties should exhibit, where by the term "capabil-ity" we mean the skill of doing something or of making some condition become true. Such capabilities have the twofold aim of connecting the interactive behavior to be shown by the role-player to its internal state and of making the policy executable.
Bookmarks Related papers MentionsView impact
Abstract—An agent interaction protocol, a service choreography, can quite naturally be interprete... more Abstract—An agent interaction protocol, a service choreography, can quite naturally be interpreted as an alliance of parties, which cooperate to achieve a goal. On the other hand, each participant entered the alliance moved by goals of its own, which it would like to fulfill by playing one of the roles. The achievement of the shared and,of the specific goals depend,both on the interaction schema, that is captured by the choreography, and on the participant’s capabilities, where by this word we mean the skills of the participant, the actions that it can execute. We show in this paper that the choice of which capabilities to use cannot rely totally on local criteria, as instead it is commonly done by the approaches to matchmaking, but it must take into account the choreography/protocol. This happens whenever the match is not exact, e.g. when plugin match is used. We also describe an extended plugin match that takes into account also the constraints given by the choreography for perfor...
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11, 2011
Tensors (multi-dimensional arrays) are widely used for representing high-order dimensional data, ... more Tensors (multi-dimensional arrays) are widely used for representing high-order dimensional data, in applications ranging from social networks, sensor data, and Internet traffic. Multi-way data analysis techniques, in particular tensor decompositions, allow extraction of hidden correlations among multi-way data and thus are key components of many data analysis frameworks. Intuitively, these algorithms can be thought of as multi-way clustering schemes, which consider multiple facets of the data in identifying clusters, their weights, and contributions of each data element. Unfortunately, algorithms for fitting multi-way models are, in general, iterative and very time consuming. In this paper, we observe that, in many applications, there is a priori background knowledge (or metadata) about one or more domain dimensions. This metadata is often in the form of a hierarchy that clusters the elements of a given data facet (or mode). In this paper, we investigate whether such single-mode data hierarchies can be used to boost the efficiency of tensor decomposition process, without significant impact on the final decomposition quality. We consider each domain hierarchy as a guide to help provide higher- or lower-resolution views of the data in the tensor on demand and we rely on these metadata-induced multi-resolution tensor representations to develop a multiresolution approach to tensor decomposition. In this paper, we focus on an alternating least squares (ALS) based implementation of the PARAllel FACtors (PARAFAC) decomposition (which decomposes a tensor into a diagonal tensor and a set of factor matrices). Experiment results show that, when the available metadata is used as a rough guide, the proposed multiresolution method helps fit PARAFAC models with consistent (for both dense and sparse tensor representations, under different parameters settings) savings in execution time and memory consumption, while preserving the quality of the decomposition.
Bookmarks Related papers MentionsView impact
Uploads
Papers by Claudio Schifanella