## Publications

Excellent! Next, you can

**embed**this page using one of several options.To the site owner:

**Action required!** Mendeley is changing its
API. In order to keep using Mendeley with BibBase past April
14th, you need to:

- renew the authorization for BibBase on Mendeley, and
- update the BibBase URL in your page the same way you did when you initially set up this page.

9999
(1)

A continuous time model for Bitcoin price dynamics.
Cretarola, A.; FIGA' TALAMANCA, G.; and Patacca, M.
Springer International Publishing, 9999.

bibtex buy

bibtex buy

@inbook{ 11391_1431967, author = {Cretarola, Alessandra and FIGA' TALAMANCA, Gianna and Patacca, Marco}, title = {A continuous time model for Bitcoin price dynamics}, year = {9999}, publisher = {Springer International Publishing}, booktitle = {Mathematical and Statistical Methods for Actuarial Sciences and Finance - MAF 2018}, keywords = {Bitcoin, Sentiment, Option Pricing} }

2018
(41)

On modeling multi-experts multi-criteria decision-making argumentation and disagreement: Philosophical and computational approaches reconsidered.
Garbayo, L.; Ceberio, M.; Bistarelli, S.; and Henderson, J.
Volume 100 . pages 67–75. Springer International Publishing, 2018.

Paper doi bibtex abstract buy

Paper doi bibtex abstract buy

@inbook{ 11391_1420696, author = {Garbayo, Luciana and Ceberio, Martine and Bistarelli, Stefano and Henderson, Joel}, title = {On modeling multi-experts multi-criteria decision-making argumentation and disagreement: Philosophical and computational approaches reconsidered}, year = {2018}, publisher = {Springer International Publishing}, volume = {100}, booktitle = {Studies in Systems, Decision and Control}, abstract = {In this article we suggest that the research area of epistemology of disagreement should be critically applied to the problem of describing multi-experts multi-criteria decision-making (ME-MCDM), while providing an epistemic conceptualization of experts as epistemic peers. We explore some preliminary outcomes of using Dung’s computational framework for argumentation in ME-MCDM with conceptual considerations on the role of formal constraints and rationality approaches for epistemic peer disagreement, such as provided by David Christensen [2], inclusive of epistemic and pragmatic rationality, synchronic and diachronic rationality, and global and local aspects thereof}, url = {www.springer.com/series/13304}, doi = {10.1007/978-3-319-61753-4_10}, pages = {67--75} }

In this article we suggest that the research area of epistemology of disagreement should be critically applied to the problem of describing multi-experts multi-criteria decision-making (ME-MCDM), while providing an epistemic conceptualization of experts as epistemic peers. We explore some preliminary outcomes of using Dung’s computational framework for argumentation in ME-MCDM with conceptual considerations on the role of formal constraints and rationality approaches for epistemic peer disagreement, such as provided by David Christensen [2], inclusive of epistemic and pragmatic rationality, synchronic and diachronic rationality, and global and local aspects thereof

Not only size, but also shape counts: Argumentation solvers are benchmark-sensitive.
Bistarelli, S.; Rossi, F.; and Santini, F.

Paper doi bibtex abstract

*JOURNAL OF LOGIC AND COMPUTATION*, 28: 85–117. 2018.Paper doi bibtex abstract

@article{ 11391_1425840, author = {Bistarelli, Stefano and Rossi, Fabio and Santini, Francesco}, title = {Not only size, but also shape counts: Argumentation solvers are benchmark-sensitive}, year = {2018}, journal = {JOURNAL OF LOGIC AND COMPUTATION}, volume = {28}, abstract = {We test different solvers dedicated to the solution of classical problems in Argumentation, as enumeration/existence of extensions, and sceptical/credulous acceptance of arguments. We handle a subset of the solvers tested in ICCMA15, and a superset of graphs used in the same competition. The goal is to provide considerations that can help future comparisons and competitions as ICCMA15. We offer a detailed report of this comparison from the point of view of different graphs, solvers, problems and timeouts. We show that the characteristics of graphs impact on the performance of solvers and on their final ranking. In addition, we extract other general considerations, e.g., reducing the computation timeout does not change the same ranking.}, keywords = {argumentation; benchmark; graph models; reasoning tools; Theoretical Computer Science; Software; Arts and Humanities (miscellaneous); Hardware and Architecture; Logic}, url = {http://logcom.oxfordjournals.org/}, doi = {10.1093/logcom/exx031}, pages = {85--117} }

We test different solvers dedicated to the solution of classical problems in Argumentation, as enumeration/existence of extensions, and sceptical/credulous acceptance of arguments. We handle a subset of the solvers tested in ICCMA15, and a superset of graphs used in the same competition. The goal is to provide considerations that can help future comparisons and competitions as ICCMA15. We offer a detailed report of this comparison from the point of view of different graphs, solvers, problems and timeouts. We show that the characteristics of graphs impact on the performance of solvers and on their final ranking. In addition, we extract other general considerations, e.g., reducing the computation timeout does not change the same ranking.

Visualising bitcoin flows of ransomware: WannaCry one week later.
Bistarelli, S.; Parroccini, M.; and Santini, F.
2018.

Paper bibtex abstract

Paper bibtex abstract

@conference{ 11391_1427783, author = {Bistarelli, Stefano and Parroccini, Matteo and Santini, Francesco}, title = {Visualising bitcoin flows of ransomware: WannaCry one week later}, year = {2018}, publisher = {CEUR-WS}, volume = {2058}, booktitle = {CEUR Workshop Proceedings}, abstract = {Because of its pseudo-anonimity and decentralisation characteristics, bitcoin payments are often a tool utilised by ransomware: this kind of malware infects a victim computer by encrypting some/all its data and/or denying the access to it. Then, the victim has to pay a given amount of bitcoins to see all the blocked functionalities restored. The goal of this paper is to visualise these bitcoin transactions, and in particular we focus on the effects of one of such ransomware, i.e., WannaCry, one/two weeks after its diffusion. We exploit Block Chain Vis, a tool for visualising flows of bitcoins through the use of Visual Analytics.}, keywords = {Computer Science (all)}, url = {http://ceur-ws.org/Vol-2058/} }

Because of its pseudo-anonimity and decentralisation characteristics, bitcoin payments are often a tool utilised by ransomware: this kind of malware infects a victim computer by encrypting some/all its data and/or denying the access to it. Then, the victim has to pay a given amount of bitcoins to see all the blocked functionalities restored. The goal of this paper is to visualise these bitcoin transactions, and in particular we focus on the effects of one of such ransomware, i.e., WannaCry, one/two weeks after its diffusion. We exploit Block Chain Vis, a tool for visualising flows of bitcoins through the use of Visual Analytics.

Special track on knowledge representation and reasoning (KRR) - 33rd Annual ACM Symposium on Applied Computing, SAC 2018.
Bistarelli, S.; Ceberio, M.; Monfroy, E.; and Santini, F.
Volume 137816 . Association for Computing Machinery, 2018.

bibtex buy

bibtex buy

@inbook{ 11391_1433840, author = {Bistarelli, Stefano and Ceberio, Martine and Monfroy, Eric and Santini, Francesco}, title = {Special track on knowledge representation and reasoning (KRR) - 33rd Annual ACM Symposium on Applied Computing, SAC 2018}, year = {2018}, publisher = {Association for Computing Machinery}, volume = {137816}, booktitle = {Proceedings of the ACM Symposium on Applied Computing}, keywords = {Software} }

Message from the chairs - 1st IEEE International Workshop on Blockchain Oriented Software Engineering, IWBOSE 2018.
Tonelli, R.; Ducasse, S.; Fenu, G.; Bracciali, A.; Amaral, V.; Arcelli, F.; Bartoletti, M.; Bartosz, W.; Bistarelli, S.; Buglione, L.; Challet, D.; Counsell, S.; Destefanis, G.; Duedder, B.; Eskandari, S.; Gil, Y.; Heckel, R.; Hierons, R.; Matulevicius, R.; Morasca, S.; Orru, M.; Ricci, L.; Singh, P.; Swift, S.; Ter, M.; Vitaletti, A.; Zhang, H.; and Zunino, R.
Volume 2018- . pages iii–iv. Institute of Electrical and Electronics Engineers Inc., 2018.

doi bibtex buy

doi bibtex buy

@inbook{ 11391_1433842, author = {Tonelli, Roberto and Ducasse, Stephane and Fenu, Gianni and Bracciali, Andrea and Amaral, Vasco and Arcelli, Francesca and Bartoletti, Massimo and Bartosz, Walter and Bistarelli, Stefano and Buglione, Luigi and Challet, Damien and Counsell, Steve and Destefanis, Giuseppe and Duedder, Boris and Eskandari, Shayan and Gil, Yossi and Heckel, Reiko and Hierons, Robert and Matulevicius, Raimundas and Morasca, Sandro and Orru, Matteo and Ricci, Laura and Singh, Paramvir and Swift, Stephen and Ter, Maurice and Vitaletti, Andrea and Zhang, Hongyu and Zunino, Roberto}, title = {Message from the chairs - 1st IEEE International Workshop on Blockchain Oriented Software Engineering, IWBOSE 2018}, year = {2018}, publisher = {Institute of Electrical and Electronics Engineers Inc.}, volume = {2018-}, booktitle = {2018 IEEE 1st International Workshop on Blockchain Oriented Software Engineering, IWBOSE 2018 - Proceedings}, keywords = {Computer Networks and Communications; Hardware and Architecture; Software; Safety, Risk, Reliability and Quality}, doi = {10.1109/IWBOSE.2018.8327563}, pages = {iii--iv} }

The ECTN Virtual Education Community Prosumer Model for Promoting and Assessing Chemical Knowledge.
Laganà, A.; Gervasi, O.; Tasso, S.; Perri, D.; and Franciosa, F.
2018.

Paper doi bibtex abstract

Paper doi bibtex abstract

@conference{ 11391_1434619, author = {Laganà, Antonio and Gervasi, Osvaldo and Tasso, Sergio and Perri, Damiano and Franciosa, Francesco}, title = {The ECTN Virtual Education Community Prosumer Model for Promoting and Assessing Chemical Knowledge}, year = {2018}, publisher = {Springer, Cham}, volume = {10964}, booktitle = {Computational Science and Its Applications – ICCSA 2018}, abstract = {The dynamism of the learning economies is examined in order to single out the key factors allowing to promote knowledge dissemination and invention developments. The various steps involved in the production and usage of both tacit and explicit technological knowledge as common good are analysed in order to optimize its portability. The role played in this respect by business clusters (especially when adopting the prosumer model) dealing with knowledge is discussed with particular reference to chemical education in Higher Education Institutions. The adoption of the prosumer model for building a European system aimed at promoting and assessing chemical knowledge is examined. The particular case considered in the paper is the one born out of the activities of the Universities member of the European Chemistry Thematic Network association through its Virtual Education Community Committee and the operational support of the former spinoff of the University of Perugia Master-UP s.r.l. Results achieved during the first year of activity are discussed.}, keywords = {Prosumer model, E-tests, Assessment of competences}, url = {https://link.springer.com/chapter/10.1007/978-3-319-95174-4_42}, doi = {10.1007/978-3-319-95174-4_42}, pages = {533--548} }

The dynamism of the learning economies is examined in order to single out the key factors allowing to promote knowledge dissemination and invention developments. The various steps involved in the production and usage of both tacit and explicit technological knowledge as common good are analysed in order to optimize its portability. The role played in this respect by business clusters (especially when adopting the prosumer model) dealing with knowledge is discussed with particular reference to chemical education in Higher Education Institutions. The adoption of the prosumer model for building a European system aimed at promoting and assessing chemical knowledge is examined. The particular case considered in the paper is the one born out of the activities of the Universities member of the European Chemistry Thematic Network association through its Virtual Education Community Committee and the operational support of the former spinoff of the University of Perugia Master-UP s.r.l. Results achieved during the first year of activity are discussed.

Sharing Learning Objects Between Learning Platforms and Repositories.
Tasso, S.; Pallottelli, S.; Gervasi, O.; Rui, M.; and Laganà, A.
2018.

Paper doi bibtex abstract

Paper doi bibtex abstract

@conference{ 11391_1434621, author = {Tasso, Sergio and Pallottelli, Simonetta and Gervasi, Osvaldo and Rui, Marina and Laganà, Antonio}, title = {Sharing Learning Objects Between Learning Platforms and Repositories.}, year = {2018}, publisher = {Springer, Cham}, volume = {10963}, booktitle = {Computational Science and Its Applications – ICCSA 2018}, abstract = {The wide adoption of e-learning in several contexts requires an increasing integration of learning material from different platforms, made available to users in a secure and easy-to-use way. In the present paper the re-engineering of the Moodledata module functionalities of GLOREP federation, designed to migrate information units between several content platforms is discussed.}, keywords = {Repository; Learning management systems; Content sharing; Learning object}, url = {https://link.springer.com/chapter/10.1007/978-3-319-95171-3_62}, doi = {10.1007/978-3-319-95171-3_62}, pages = {804--816} }

The wide adoption of e-learning in several contexts requires an increasing integration of learning material from different platforms, made available to users in a secure and easy-to-use way. In the present paper the re-engineering of the Moodledata module functionalities of GLOREP federation, designed to migrate information units between several content platforms is discussed.

Strategies and systems towards grids and clouds integration:A DBMS-based solution.
Mariotti, M.; Gervasi, O.; Vella, F.; Cuzzocrea, A.; and Costantini, A.

Paper doi bibtex abstract

*FUTURE GENERATION COMPUTER SYSTEMS*, 88: 718–729. 2018.Paper doi bibtex abstract

@article{ 11391_1410919, author = {Mariotti, Mirko and Gervasi, Osvaldo and Vella, Flavio and Cuzzocrea, Alfredo and Costantini, Alessandro}, title = {Strategies and systems towards grids and clouds integration:A DBMS-based solution}, year = {2018}, journal = {FUTURE GENERATION COMPUTER SYSTEMS}, volume = {88}, abstract = {Cloud and Grid computing share some essential driving ideas although the computing and economic models are very different. In this paper, we propose different strategies for the Batch-oriented and Service-oriented computing models interoperability. In particular, we describe an innovative approach to connect together Computational Grids and IaaS providers. This is achieved via introducing a simple and powerful DBMS-based system of deploying VM images from a Cloud environment in order to fulfill particular requests of task execution coming from a Grid environment. From a user point of view, resource authorization and access are kept unchanged, thus preserving the user experience related to the Grid. From the accounting point of view, in order to inform the Grid sites that a certain resource is available on a given Cloud-enabled Grid site, the information is published on the Grid information system. In this so-delineated scenario, we are able of using the powerful capability of distributing jobs of the Grid in order to allocate resources not only belonging to Grid clusters, but also with different architectures like GPUs, FPGAs and other systems. The target DBMS-based system has been designed for orchestrate a set of computing systems able to provide physical and virtual resources, creating a unified system, in which the various users-submitted computing tasks are managed and optimized. The goodness of the proposed system is demonstrated by a series of experiments highlighting the benefits of our approach.}, keywords = {Resource integration Cloud computing Grid computing Distributed environments Heterogeneous environments Multi/many core computing GPGPU computing}, url = {http://ac.els-cdn.com/S0167739X17302996/1-s2.0-S0167739X17302996-main.pdf?_tid=4ced81dc-43d1-11e7-966e-00000aab0f6c&acdnat=1495995367_a8e65c71f66464291bdd0a90ea5ee71f}, doi = {http://dx.doi.org/10.1016/j.future.2017.02.047}, pages = {718--729} }

Cloud and Grid computing share some essential driving ideas although the computing and economic models are very different. In this paper, we propose different strategies for the Batch-oriented and Service-oriented computing models interoperability. In particular, we describe an innovative approach to connect together Computational Grids and IaaS providers. This is achieved via introducing a simple and powerful DBMS-based system of deploying VM images from a Cloud environment in order to fulfill particular requests of task execution coming from a Grid environment. From a user point of view, resource authorization and access are kept unchanged, thus preserving the user experience related to the Grid. From the accounting point of view, in order to inform the Grid sites that a certain resource is available on a given Cloud-enabled Grid site, the information is published on the Grid information system. In this so-delineated scenario, we are able of using the powerful capability of distributing jobs of the Grid in order to allocate resources not only belonging to Grid clusters, but also with different architectures like GPUs, FPGAs and other systems. The target DBMS-based system has been designed for orchestrate a set of computing systems able to provide physical and virtual resources, creating a unified system, in which the various users-submitted computing tasks are managed and optimized. The goodness of the proposed system is demonstrated by a series of experiments highlighting the benefits of our approach.

The 18th International Conference on Computational Science and Its Applications - Part I.
Gervasi, O.; Murgante, B.; Misra, S.; Stankova, E.; Torre, C. M.; Rocha, A. M. A. C.; Taniar, D.; Apduhan, B. O.; Tarantino, E.; and Ryu, Y.
2018.

Paper doi bibtex abstract

Paper doi bibtex abstract

@misc{ 11391_1438650, author = {Gervasi, Osvaldo and Murgante, Beniamino and Misra, Sanjay and Stankova, Elena and Torre, Carmelo M. and Rocha, Ana Maria A. C. and Taniar, David and Apduhan, Bernady O. and Tarantino, Eufemia and Ryu, Yeonseung}, title = {The 18th International Conference on Computational Science and Its Applications - Part I}, year = {2018}, publisher = {Springer International Publishing}, address = {Cham}, volume = {10960}, abstract = {The five volume set LNCS 10960 until 10964 constitutes the refereed proceedings of the 18th International Conference on Computational Science and Its Applications, ICCSA 2018, held in Melbourne, Australia, in July 2018. Apart from the general tracks, ICCSA 2018 also includes 34 international workshops in various areas of computational sciences, ranging from computational science technologies, to specific areas of computational sciences, such as computer graphics and virtual reality. The total of 265 full papers and 10 short papers presented in the 5-volume proceedings set of ICCSA 2018, were carefully reviewed and selected from 892 submissions.}, keywords = {Computational Methods, Algorithms, High Performance Computing and Networks, Geometric Modeling, Graphics and Visualization, Advanced and Emerging Applications}, url = {https://www.springer.com/it/book/9783319951614}, doi = {10.1007/978-3-319-95162-1}, pages = {1--754} }

The five volume set LNCS 10960 until 10964 constitutes the refereed proceedings of the 18th International Conference on Computational Science and Its Applications, ICCSA 2018, held in Melbourne, Australia, in July 2018. Apart from the general tracks, ICCSA 2018 also includes 34 international workshops in various areas of computational sciences, ranging from computational science technologies, to specific areas of computational sciences, such as computer graphics and virtual reality. The total of 265 full papers and 10 short papers presented in the 5-volume proceedings set of ICCSA 2018, were carefully reviewed and selected from 892 submissions.

The 18th International Conference on Computational Science and Its Applications - Part IV.
Gervasi, O.; Murgante, B.; Misra, S.; Stankova, E.; Torre, C. M.; Rocha, A. M. A. C.; Taniar, D.; Apduhan, B. O.; Tarantino, E.; and Ryu, Y.
2018.

Paper doi bibtex abstract

Paper doi bibtex abstract

@misc{ 11391_1438654, author = {Gervasi, O. and Murgante, B. and Misra, S. and Stankova, E. and Torre, C. M. and Rocha, A. M. A. C. and Taniar, D. and Apduhan, B. O. and Tarantino, E. and Ryu, Y.}, title = {The 18th International Conference on Computational Science and Its Applications - Part IV}, year = {2018}, publisher = {Springer International Publishing}, address = {Cham}, volume = {10963}, abstract = {The five volume set LNCS 10960 until 10964 constitutes the refereed proceedings of the 18th International Conference on Computational Science and Its Applications, ICCSA 2018, held in Melbourne, Australia, in July 2018. Apart from the general tracks, ICCSA 2018 also includes 34 international workshops in various areas of computational sciences, ranging from computational science technologies, to specific areas of computational sciences, such as computer graphics and virtual reality. The total of 265 full papers and 10 short papers presented in the 5-volume proceedings set of ICCSA 2018, were carefully reviewed and selected from 892 submissions.}, keywords = {Computational Methods, Algorithms, High Performance Computing and Networks, Geometric Modeling, Graphics and Visualization, Advanced and Emerging Applications}, url = {https://www.springer.com/it/book/9783319951706}, doi = {10.1007/978-3-319-95171-3}, pages = {1--819} }

The five volume set LNCS 10960 until 10964 constitutes the refereed proceedings of the 18th International Conference on Computational Science and Its Applications, ICCSA 2018, held in Melbourne, Australia, in July 2018. Apart from the general tracks, ICCSA 2018 also includes 34 international workshops in various areas of computational sciences, ranging from computational science technologies, to specific areas of computational sciences, such as computer graphics and virtual reality. The total of 265 full papers and 10 short papers presented in the 5-volume proceedings set of ICCSA 2018, were carefully reviewed and selected from 892 submissions.

Lezioni di necessaria umanità del diritto penale. Conversazioni europee sul nullum crimen sine lege.
Falcinelli, D.
Volume 15 . pages 129–147. Pisa University Press, Pisa, 2018.

bibtex buy

bibtex buy

@inbook{ 11391_1428726, author = {Falcinelli, Daniela}, title = {Lezioni di necessaria umanità del diritto penale. Conversazioni europee sul nullum crimen sine lege}, year = {2018}, publisher = {Pisa University Press}, address = {Pisa}, volume = {15}, booktitle = {Rapporti tra fonti europee e dialogo tra Corti}, pages = {129--147} }

Il dolo in cerca di una direzione penale. Il contributo della scienza robotica ad una teoria delle decisioni umane.
Falcinelli, D.

bibtex

*ARCHIVIO PENALE*,1–30. 2018.bibtex

@article{ 11391_1428727, author = {Falcinelli, Daniela}, title = {Il dolo in cerca di una direzione penale. Il contributo della scienza robotica ad una teoria delle decisioni umane}, year = {2018}, journal = {ARCHIVIO PENALE}, pages = {1--30} }

Spunti storici e sociologici nell’individuazione del «metodo mafioso».
Falcinelli, D.
Volume 28 . pages 127–153. Wolters Kluwer Italia, 2018.

bibtex buy

bibtex buy

@inbook{ 11391_1432622, author = {Falcinelli, D.}, title = {Spunti storici e sociologici nell’individuazione del «metodo mafioso»}, year = {2018}, publisher = {Wolters Kluwer Italia}, volume = {28}, booktitle = {Esercitazioni penali sostanziali e processuali. Pensieri in ordine sparso - in Questioni nuove di procedura penale – raccolte da A.Gaito, G. Paolozzi e G.P. Voena}, pages = {127--153} }

Art. 613 bis c.p., in CODICE DEI REATI CONTRO LA PERSONA - ANNOTATO CON DOTTRINA, GIURISPRUDENZA E FORMULECODICE DEI REATI CONTRO LA PERSONA.
Falcinelli, D.
pages 614–630. Nel Diritto Editore, 2018.

bibtex buy

bibtex buy

@inbook{ 11391_1438739, author = {Falcinelli, D.}, title = {Art. 613 bis c.p., in CODICE DEI REATI CONTRO LA PERSONA - ANNOTATO CON DOTTRINA, GIURISPRUDENZA E FORMULECODICE DEI REATI CONTRO LA PERSONA}, year = {2018}, publisher = {Nel Diritto Editore}, booktitle = {Art. 613 bis c.p., in CODICE DEI REATI CONTRO LA PERSONA - ANNOTATO CON DOTTRINA, GIURISPRUDENZA E FORMULECODICE DEI REATI CONTRO LA PERSONA Collana: Codici del Professionista, Nel Diritto Editore, maggio 2018 (a cura di Giandomenico Salcuni-Enrico Infante)}, pages = {614--630} }

Art. 83 [c.p.], in Codice penale. Commentato con dottrina e giurisprudenza (a cura di A. Cadoppi – S. Canestrari – P. Veneziani).
Falcinelli, D
pages 531–535. Giappichelli editore, 2018.

bibtex buy

bibtex buy

@inbook{ 11391_1438746, author = {Falcinelli, D}, title = {Art. 83 [c.p.], in Codice penale. Commentato con dottrina e giurisprudenza (a cura di A. Cadoppi – S. Canestrari – P. Veneziani)}, year = {2018}, publisher = {Giappichelli editore}, booktitle = {Codice penale. Commentato con dottrina e giurisprudenza (a cura di A. Cadoppi – S. Canestrari – P. Veneziani)}, pages = {531--535} }

A ConArg-based library for abstract argumentation.
Bistarelli, S.; Rossi, F.; and Santini, F.
2018.

doi bibtex

doi bibtex

@conference{ 11391_1434940, author = {Bistarelli, Stefano and Rossi, Fabio and Santini, Francesco}, title = {A ConArg-based library for abstract argumentation}, year = {2018}, publisher = {IEEE Computer Society}, journal = {PROCEEDINGS - INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE}, volume = {2017-}, booktitle = {International Conference on Tools with Artificial Intelligence, ICTAI}, keywords = {Software; Artificial Intelligence; Computer Science Applications1707 Computer Vision and Pattern Recognition}, doi = {10.1109/ICTAI.2017.00065}, pages = {374--381} }

Soft Constraint Automata with Memory.
Dokter, K.; Gadducci, F.; and Santini, F.
Volume 10865 . pages 70–85. Springer, 2018.

doi bibtex buy

doi bibtex buy

@inbook{ 11391_1434763, author = {Dokter, Kasper and Gadducci, Fabio and Santini, Francesco}, title = {Soft Constraint Automata with Memory}, year = {2018}, publisher = {Springer}, volume = {10865}, booktitle = {It's All About Coordination}, doi = {10.1007/978-3-319-90089-6_6}, pages = {70--85} }

Coherent conditional plausibility: A tool for handling fuzziness and uncertainty under partial information.
Coletti, G.; and Vantaggi, B.
Volume 357 . pages 129–152. Springer Verlag, 2018.

Paper doi bibtex abstract buy

Paper doi bibtex abstract buy

@inbook{ 11391_1427209, author = {Coletti, Giulianella and Vantaggi, Barbara}, title = {Coherent conditional plausibility: A tool for handling fuzziness and uncertainty under partial information}, year = {2018}, publisher = {Springer Verlag}, volume = {357}, booktitle = {Studies in Fuzziness and Soft Computing}, abstract = {Non-additive measures, such as plausibility, are meaningful when only a partial or indirect information on the events of interest is available, or when imprecision and ambiguity of agents are considered. Our main aim is to study inferential processes, like the Bayesian one, when the information is expressed in natural language and the uncertainty measure is either partially or imprecisely assessed. We deal with partial assessments consistent with a conditional plausibility, and adopt the interpretation of the membership of a fuzzy set in terms of coherent conditional plausibility, regarded as a function of the conditioning events. This kind of interpretation, inspired to that given in terms of coherent conditional probability, is particularly useful for computing the measure of the uncertainty of fuzzy events, when the knowledge on the variable is imprecise and can be managed with a non-additive measure of uncertainty. A simple situation related to a Zadeh’s example can be the following: a ball will be drawn from an urn containing balls of different colours and different diameters, but one knows only the distribution of the different colours. The aim is to compute the uncertainty measure of the fuzzy event “a small ball is drawn”, taking in considerations possible logical constrains among the colours and the diameters}, url = {http://www.springer.com/sgw/cda/frontpage/0,11855,1-40356-69-1191779-0,00.html?changeHeader=true"}, doi = {10.1007/978-3-319-60207-3_9}, pages = {129--152} }

Non-additive measures, such as plausibility, are meaningful when only a partial or indirect information on the events of interest is available, or when imprecision and ambiguity of agents are considered. Our main aim is to study inferential processes, like the Bayesian one, when the information is expressed in natural language and the uncertainty measure is either partially or imprecisely assessed. We deal with partial assessments consistent with a conditional plausibility, and adopt the interpretation of the membership of a fuzzy set in terms of coherent conditional plausibility, regarded as a function of the conditioning events. This kind of interpretation, inspired to that given in terms of coherent conditional probability, is particularly useful for computing the measure of the uncertainty of fuzzy events, when the knowledge on the variable is imprecise and can be managed with a non-additive measure of uncertainty. A simple situation related to a Zadeh’s example can be the following: a ball will be drawn from an urn containing balls of different colours and different diameters, but one knows only the distribution of the different colours. The aim is to compute the uncertainty measure of the fuzzy event “a small ball is drawn”, taking in considerations possible logical constrains among the colours and the diameters

Conditional Submodular Coherent Risk Measures.
Coletti, G.; Petturiti, D.; and Vantaggi, B.
2018.

doi bibtex abstract

doi bibtex abstract

@conference{ 11391_1434717, author = {Coletti, Giulianella and Petturiti, Davide and Vantaggi, Barbara}, title = {Conditional Submodular Coherent Risk Measures.}, year = {2018}, publisher = {Springer, Cham}, volume = {854}, booktitle = {Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations. IPMU 2018.}, abstract = {A family of conditional risk measures is introduced by considering a single period financial market, relying on a notion of conditioning for submodular capacities, which generalizes that introduced by Dempster. The resulting measures are expressed as discounted conditional Choquet expected values, take into account ambiguity towards uncertainty and allow for conditioning to “null” events. We also provide a characterisation of consistence of a partial assessment with a conditional submodular coherent risk measure. The latter amounts to test the solvability of a suitable sequence of linear systems}, keywords = {Coherent risk measure Conditional Choquet expected value Conditional submodular capacity}, doi = {10.1007/978-3-319-91476-3_20}, pages = {239--250} }

A family of conditional risk measures is introduced by considering a single period financial market, relying on a notion of conditioning for submodular capacities, which generalizes that introduced by Dempster. The resulting measures are expressed as discounted conditional Choquet expected values, take into account ambiguity towards uncertainty and allow for conditioning to “null” events. We also provide a characterisation of consistence of a partial assessment with a conditional submodular coherent risk measure. The latter amounts to test the solvability of a suitable sequence of linear systems

Decisions on generalized Anscombe-Aumann acts under possibly “unexpected” scenarios.
Coletti, G.; Petturiti, D.; and Vantaggi, B.
2018.

bibtex abstract

bibtex abstract

@conference{ 11391_1434728, author = {Coletti, Giulianella and Petturiti, Davide and Vantaggi, Barbara}, title = {Decisions on generalized Anscombe-Aumann acts under possibly “unexpected” scenarios}, year = {2018}, publisher = {MatfyzPress, Publishing House of the Faculty of Mathematics and Physics Charles University Sokolovská 83, 186 75 Praha 8, Czech Republic}, booktitle = {Proceedings of 11-th WUPES}, abstract = {We consider decisions on generalized Anscombe-Aumann acts, mapping states of the world to belief functions over a set of consequences. Preference rela- tions on these acts are given by a decision maker under different scenarios (conditioning events). Then, we provide a system of axioms which are neces- sary and sufficient for the representability of these “conditional preferences” through a conditional functional CEUP,u, parametrized by a unique full con- ditional probability P on the algebra of events and a cardinal utility function u on consequences. The model is able to manage also “unexpected” (i.e., “null”) conditioning events. We finally provide an elicitation procedure that reduces to a Quadratically Constrained Linear Problem (QCLP)}, pages = {49--60} }

We consider decisions on generalized Anscombe-Aumann acts, mapping states of the world to belief functions over a set of consequences. Preference rela- tions on these acts are given by a decision maker under different scenarios (conditioning events). Then, we provide a system of axioms which are neces- sary and sufficient for the representability of these “conditional preferences” through a conditional functional CEUP,u, parametrized by a unique full con- ditional probability P on the algebra of events and a cardinal utility function u on consequences. The model is able to manage also “unexpected” (i.e., “null”) conditioning events. We finally provide an elicitation procedure that reduces to a Quadratically Constrained Linear Problem (QCLP)

Detecting Correlation Between Extreme Probability Events.
Coletti, G.; van der Gaag, L.; and Petturiti, D.
2018.

bibtex abstract

bibtex abstract

@conference{ 11391_1434725, author = {Coletti, Giulianella and van der Gaag, Linda and Petturiti, Davide}, title = {Detecting Correlation Between Extreme Probability Events.}, year = {2018}, publisher = {MatfyzPress, Publishing House of the Faculty of Mathematics and Physics Charles University Sokolovská 83, 186 75 Praha 8, Czech Republic}, booktitle = {Proceedings of 11-th WUPES}, abstract = {Since the classical definitions of correlation give rise to counterintuitive findings for extreme probability events, we build upon the concept of coherent conditional probability to introduce enhanced notions of correlation. Our new notions allow handling extreme events in a principled way by accommodating the different levels of {strength} of the zero probabilities involved. Where the detection of correlations by means of these levels is computationally challenging, we provide a full characterisation of the correlations between extreme probability events without reference to the complex structure of probability.} }

Since the classical definitions of correlation give rise to counterintuitive findings for extreme probability events, we build upon the concept of coherent conditional probability to introduce enhanced notions of correlation. Our new notions allow handling extreme events in a principled way by accommodating the different levels of strength of the zero probabilities involved. Where the detection of correlations by means of these levels is computationally challenging, we provide a full characterisation of the correlations between extreme probability events without reference to the complex structure of probability.

On the Planar Split Thickness of Graphs.
Eppstein, D.; Kindermann, P.; Kobourov, S.; Liotta, G.; Lubiw, A.; Maignan, A.; Mondal, D.; Vosoughpour, H.; Whitesides, S.; and Wismath, S.

Paper doi bibtex

*ALGORITHMICA*, 80: 977–994. 2018.Paper doi bibtex

@article{ 11391_1426444, author = {Eppstein, David and Kindermann, Philipp and Kobourov, Stephen and Liotta, Giuseppe and Lubiw, Anna and Maignan, Aude and Mondal, Debajyoti and Vosoughpour, Hamideh and Whitesides, Sue and Wismath, Stephen}, title = {On the Planar Split Thickness of Graphs}, year = {2018}, journal = {ALGORITHMICA}, volume = {80}, keywords = {Approximation; Complete graphs; Fixed-parameter tractable; Genus-1 graphs; Graph drawing; Graph theory; NP-hardness; Planarity; Splittable; Thickness; Computer Science (all); Computer Science Applications1707 Computer Vision and Pattern Recognition; Applied Mathematics}, url = {http://www.springerlink.com/app/home/journal.asp?wasp=b73948a592d54affa300fbefcceb25b0&referrer=parent&backto=linkingpublicationresults,1:100117,1}, doi = {10.1007/s00453-017-0328-y}, pages = {977--994} }

New results on edge partitions of 1-plane graphs.
Di Giacomo, E.; Didimo, W.; Evans, W. S.; Liotta, G.; Meijer, H.; Montecchiani, F.; and Wismath, S. K.

Paper doi bibtex

*THEORETICAL COMPUTER SCIENCE*, 713: 78–84. 2018.Paper doi bibtex

@article{ 11391_1423401, author = {Di Giacomo, Emilio and Didimo, Walter and Evans, William S. and Liotta, Giuseppe and Meijer, Henk and Montecchiani, Fabrizio and Wismath, Stephen K.}, title = {New results on edge partitions of 1-plane graphs}, year = {2018}, journal = {THEORETICAL COMPUTER SCIENCE}, volume = {713}, keywords = {1-planarity; Edge partitions; Graph drawing; NIC-plane graphs; Theoretical Computer Science; Computer Science (all)}, url = {https://www.sciencedirect.com/science/article/pii/S0304397517309192}, doi = {10.1016/j.tcs.2017.12.024}, pages = {78--84} }

Drawing subcubic planar graphs with four slopes and optimal angular resolution.
Di Giacomo, E.; Liotta, G.; and Montecchiani, F.

Paper doi bibtex

*THEORETICAL COMPUTER SCIENCE*, 714: 51–73. 2018.Paper doi bibtex

@article{ 11391_1423399, author = {Di Giacomo, Emilio and Liotta, Giuseppe and Montecchiani, Fabrizio}, title = {Drawing subcubic planar graphs with four slopes and optimal angular resolution}, year = {2018}, journal = {THEORETICAL COMPUTER SCIENCE}, volume = {714}, keywords = {Angular resolution; Planar slope number; Subcubic planar graphs; Theoretical Computer Science; Computer Science (all)}, url = {https://www.sciencedirect.com/science/article/pii/S030439751730868X?via%3Dihub}, doi = {10.1016/j.tcs.2017.12.004}, pages = {51--73} }

Monotone Simultaneous Paths Embeddings in $ℝ^d$.
Bremner, D.; Devillers, O.; Glisse, M.; Lazard, S.; Liotta, G.; Mchedlidze, T.; Moroz, G.; Whitesides, S.; and Wismath, S.

doi bibtex

*DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE*, 20. 2018.doi bibtex

@article{ 11391_1432980, author = {Bremner, David and Devillers, Olivier and Glisse, Marc and Lazard, Sylvain and Liotta, Giuseppe and Mchedlidze, Tamara and Moroz, Guillaume and Whitesides, Sue and Wismath, Stephen}, title = {Monotone Simultaneous Paths Embeddings in $\mathbbR^d$}, year = {2018}, journal = {DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE}, volume = {20}, doi = {10.23638/dmtcs-20-1-1}, }

The Partial Visibility Representation Extension Problem.
Chaplick, S.; Guśpiel, G.; Gutowski, G.; Krawczyk, T.; and Liotta, G.

Paper doi bibtex

*ALGORITHMICA*, 80: 2286–2323. 2018.Paper doi bibtex

@article{ 11391_1432979, author = {Chaplick, Steven and Guśpiel, Grzegorz and Gutowski, Grzegorz and Krawczyk, Tomasz and Liotta, Giuseppe}, title = {The Partial Visibility Representation Extension Problem}, year = {2018}, journal = {ALGORITHMICA}, volume = {80}, keywords = {Bar visibility; NP-completeness; Partial representation extension; Planar graphs; SPQR-trees; St-ordering; Computer Science (all); Computer Science Applications1707 Computer Vision and Pattern Recognition; Applied Mathematics}, url = {http://www.springerlink.com/app/home/journal.asp?wasp=b73948a592d54affa300fbefcceb25b0&referrer=parent&backto=linkingpublicationresults,1:100117,1}, doi = {10.1007/s00453-017-0322-4}, pages = {2286--2323} }

On the NP-hardness of GRacSim drawing and k-SEFE Problems.
Grilli, L.

Paper doi bibtex abstract

*JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS*, 22: 101–116. 2018.Paper doi bibtex abstract

@article{ 11391_1428212, author = {Grilli, Luca}, title = {On the NP-hardness of GRacSim drawing and k-SEFE Problems}, year = {2018}, journal = {JOURNAL OF GRAPH ALGORITHMS AND APPLICATIONS}, volume = {22}, abstract = {We study the complexity of two problems on simultaneous graph drawing. The first problem, GRACSIM DRAWING, asks for finding a simultaneous geometric embedding of two planar graphs, sharing a common subgraph, such that only crossings at right angles are allowed, and every crossing must involve a private edge of one graph and a private edge of the other graph. The second problem, k-SEFE, is a restricted version of the topological simultaneous embedding with fixed edges (SEFE) problem, for two planar graphs, in which every private edge may receive at most k crossings, where k is a prescribed positive integer. We show that GRACSIM DRAWING is NP-hard and that k-SEFE is NP-complete. The NP-hardness of both problems is proved using two similar reductions from 3-PARTITION.}, keywords = {Computational Complexity, Graph Drawing, Simultaneous Embedding, SEFE}, url = {http://dx.doi.org/10.7155/jgaa.00456}, doi = {10.7155/jgaa.00456}, pages = {101--116} }

We study the complexity of two problems on simultaneous graph drawing. The first problem, GRACSIM DRAWING, asks for finding a simultaneous geometric embedding of two planar graphs, sharing a common subgraph, such that only crossings at right angles are allowed, and every crossing must involve a private edge of one graph and a private edge of the other graph. The second problem, k-SEFE, is a restricted version of the topological simultaneous embedding with fixed edges (SEFE) problem, for two planar graphs, in which every private edge may receive at most k crossings, where k is a prescribed positive integer. We show that GRACSIM DRAWING is NP-hard and that k-SEFE is NP-complete. The NP-hardness of both problems is proved using two similar reductions from 3-PARTITION.

Gap-planar graphs.
Bae, S. W.; Baffier, J.; Chun, J.; Eades, P.; Eickmeyer, K.; Grilli, L.; Hong, S.; Korman, M.; Montecchiani, F.; Rutter, I.; and Tóth, C. D.

Paper doi bibtex

*THEORETICAL COMPUTER SCIENCE*, 745: 36–52. 2018.Paper doi bibtex

@article{ 11391_1439152, author = {Bae, Sang Won and Baffier, Jean-Francois and Chun, Jinhee and Eades, Peter and Eickmeyer, Kord and Grilli, Luca and Hong, Seok-Hee and Korman, Matias and Montecchiani, Fabrizio and Rutter, Ignaz and Tóth, Csaba D.}, title = {Gap-planar graphs}, year = {2018}, journal = {THEORETICAL COMPUTER SCIENCE}, volume = {745}, keywords = {Beyond planarity k-gap-planar graphs; Complete graphs; Density results; k-planar graphs; k-quasiplanar graphs; Recognition problem; Theoretical Computer Science; Computer Science (all)}, url = {https://www.sciencedirect.com/science/article/pii/S0304397518303670}, doi = {10.1016/j.tcs.2018.05.029}, pages = {36--52} }

Visibility representations of boxes in 2.5 dimensions.
Arleo, A.; Binucci, C.; Di Giacomo, E.; Evans, W. S.; Grilli, L.; Liotta, G.; Meijer, H.; Montecchiani, F.; Whitesides, S.; and Wismath, S.

doi bibtex

*COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS*, 72: 19–33. 2018.doi bibtex

@article{ 11391_1428691, author = {Arleo, Alessio and Binucci, Carla and Di Giacomo, Emilio and Evans, William S. and Grilli, Luca and Liotta, Giuseppe and Meijer, Henk and Montecchiani, Fabrizio and Whitesides, Sue and Wismath, Stephen}, title = {Visibility representations of boxes in 2.5 dimensions}, year = {2018}, journal = {COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS}, volume = {72}, keywords = {2.5D box visibility representations; 2.5D geometric representations; Graph drawing; Visibility representations; Computer Science Applications1707 Computer Vision and Pattern Recognition; Geometry and Topology; Control and Optimization; Computational Theory and Mathematics; Computational Mathematics}, doi = {10.1016/j.comgeo.2018.02.007}, pages = {19--33} }

Gap-planar graphs.
Bae, S. W.; Baffier, J.; Chun, J.; Eades, P.; Eickmeyer, K.; Grilli, L.; Hong, S.; Korman, M.; Montecchiani, F.; Rutter, I.; and Tóth, C. D.
2018.

Paper doi bibtex

Paper doi bibtex

@conference{ 11391_1427574, author = {Bae, Sang Won and Baffier, Jean-Francois and Chun, Jinhee and Eades, Peter and Eickmeyer, Kord and Grilli, Luca and Hong, Seok-Hee and Korman, Matias and Montecchiani, Fabrizio and Rutter, Ignaz and Tóth, Csaba D.}, title = {Gap-planar graphs}, year = {2018}, publisher = {Springer Verlag}, volume = {10692}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, keywords = {Theoretical Computer Science; Computer Science (all)}, url = {https://link.springer.com/chapter/10.1007%2F978-3-319-73915-1_41}, doi = {10.1007/978-3-319-73915-1_41}, pages = {531--545} }

On some Galois covers of the Suzuki and Ree curves.
Giulietti, M.; Montanucci, M.; Quoos, L.; and Zini, G.

Paper doi bibtex abstract

*JOURNAL OF NUMBER THEORY*. 2018.Paper doi bibtex abstract

@article{ 11391_1425655, author = {Giulietti, M. and Montanucci, M. and Quoos, L. and Zini, G.}, title = {On some Galois covers of the Suzuki and Ree curves}, year = {2018}, journal = {JOURNAL OF NUMBER THEORY}, abstract = {We investigate two families Sq and Rq of maximal curves over finite fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree curves. We show that Sq is not Galois covered by the Hermitian curve maximal over $F_q^4$, and Rq is not Galois covered by the Hermitian curve maximal over $F_q^6$. We also compute the genera of many Galois subcovers of Sq and Rq; in this way, many new values in the spectrum of genera of maximal curves are obtained. The full automorphism group of both Sq and Rq is determined.}, keywords = {Automorphism group; Deligne-Lusztig curves; Maximal curves}, url = {10.1016/j.jnt.2017.12.005}, doi = {10.1016/j.jnt.2017.12.005}, }

We investigate two families Sq and Rq of maximal curves over finite fields recently constructed by Skabelund as cyclic covers of the Suzuki and Ree curves. We show that Sq is not Galois covered by the Hermitian curve maximal over $F_q^4$, and Rq is not Galois covered by the Hermitian curve maximal over $F_q^6$. We also compute the genera of many Galois subcovers of Sq and Rq; in this way, many new values in the spectrum of genera of maximal curves are obtained. The full automorphism group of both Sq and Rq is determined.

Permutation polynomials, fractional polynomials, and algebraic curves.
Bartoli, D.; and Giulietti, M.

Paper doi bibtex abstract

*FINITE FIELDS AND THEIR APPLICATIONS*, 51: 1–16. 2018.Paper doi bibtex abstract

@article{ 11391_1425402, author = {Bartoli, Daniele and Giulietti, Massimo}, title = {Permutation polynomials, fractional polynomials, and algebraic curves}, year = {2018}, journal = {FINITE FIELDS AND THEIR APPLICATIONS}, volume = {51}, abstract = {In this note we prove a conjecture by Li, Qu, Li, and Fu on permutation trinomials over F32k. In addition, new examples and generalizations of some families of permutation polynomials of F3k and F5k are given. We also study permutation quadrinomials of type Axq(q−1)+1+Bx2(q−1)+1+Cxq+x. Our method is based on the investigation of an algebraic curve associated with a fractional polynomial over a finite field.}, keywords = {Fractional permutation polynomials; Permutation polynomials; Theoretical Computer Science; Algebra and Number Theory; Engineering (all); Applied Mathematics}, url = {http://www.sciencedirect.com,SSL+S1071579718300017?via%3Dihub}, doi = {10.1016/j.ffa.2018.01.001}, pages = {1--16} }

In this note we prove a conjecture by Li, Qu, Li, and Fu on permutation trinomials over F32k. In addition, new examples and generalizations of some families of permutation polynomials of F3k and F5k are given. We also study permutation quadrinomials of type Axq(q−1)+1+Bx2(q−1)+1+Cxq+x. Our method is based on the investigation of an algebraic curve associated with a fractional polynomial over a finite field.

A family of semifields in odd characteristic.
Bierbrauer, J.; Bartoli, D.; Faina, G.; Marcugini, S.; and Pambianco, F.

Paper doi bibtex abstract

*DESIGNS, CODES AND CRYPTOGRAPHY*, 86: 611–621. 2018.Paper doi bibtex abstract

@article{ 11391_1398160, author = {Bierbrauer, Jürgen and Bartoli, Daniele and Faina, Giorgio and Marcugini, Stefano and Pambianco, Fernanda}, title = {A family of semifields in odd characteristic}, year = {2018}, journal = {DESIGNS, CODES AND CRYPTOGRAPHY}, volume = {86}, abstract = {We study a large family of semifields in odd characteristic, which contains the commutative Budaghyan–Helleseth semifields as well as semifields which are not isotopic to commutative semifields. Using a large group of autotopisms we obtain a complete classification result in certain parametric subcases.}, keywords = {Budaghyan–Helleseth semifields; Isotopy; Knuth semifields; Nuclei; Projective polynomials; Semifields; Computer Science Applications1707 Computer Vision and Pattern Recognition; Applied Mathematics}, url = {http://www.springerlink.com/content/0925-1022}, doi = {10.1007/s10623-017-0345-5}, pages = {611--621} }

We study a large family of semifields in odd characteristic, which contains the commutative Budaghyan–Helleseth semifields as well as semifields which are not isotopic to commutative semifields. Using a large group of autotopisms we obtain a complete classification result in certain parametric subcases.

On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed-Solomon Codes.
Bartoli, D.; Davydov, A. A.; Marcugini, S.; and Pambianco, F.

doi bibtex abstract

*PROBLEMS OF INFORMATION TRANSMISSION*, 54: 101–115. 2018.doi bibtex abstract

@article{ 11391_1427227, author = {Bartoli, D. and Davydov, A. A. and Marcugini, S. and Pambianco, F.}, title = {On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed-Solomon Codes}, year = {2018}, journal = {PROBLEMS OF INFORMATION TRANSMISSION}, volume = {54}, abstract = {A subset S of a conic C in the projective plane PG(2, q) is called almost complete (AC-subset for short) if it can be extended to a larger arc in PG(2, q) only by the points of C \ S and by the nucleus of C when q is even. New upper bounds on the smallest size t(q) of an AC-subset are obtained. The new bounds are used to increase regions of pairs (N, q) for which it is proved that every normal rational curve in PG(N, q) is a complete (q + 1)-arc or, equivalently, that none [q +1,N +1, q −N +1]q (resp. [q+1, q −N,N +2]q) generalized doubly- extended Reed-Solomon code cannot be extended to a [q + 2,N + 1, q − N + 2]q (resp. [q + 2, q − N + 1,N + 2]q) MDS code.}, keywords = {Projective planes, Conics, Codes.}, doi = {10.1134/S0032946018020011}, pages = {101--115} }

A subset S of a conic C in the projective plane PG(2, q) is called almost complete (AC-subset for short) if it can be extended to a larger arc in PG(2, q) only by the points of C \ S and by the nucleus of C when q is even. New upper bounds on the smallest size t(q) of an AC-subset are obtained. The new bounds are used to increase regions of pairs (N, q) for which it is proved that every normal rational curve in PG(N, q) is a complete (q + 1)-arc or, equivalently, that none [q +1,N +1, q −N +1]q (resp. [q+1, q −N,N +2]q) generalized doubly- extended Reed-Solomon code cannot be extended to a [q + 2,N + 1, q − N + 2]q (resp. [q + 2, q − N + 1,N + 2]q) MDS code.

On permutation trinomials of type x2ps+r+xps+r+Î»xr.
Bartoli, D.; and Zini, G.

Paper doi bibtex abstract

*FINITE FIELDS AND THEIR APPLICATIONS*, 49: 126–131. 2018.Paper doi bibtex abstract

@article{ 11391_1422031, author = {Bartoli, Daniele and Zini, Giovanni}, title = {On permutation trinomials of type x2ps+r+xps+r+Î»xr}, year = {2018}, journal = {FINITE FIELDS AND THEIR APPLICATIONS}, volume = {49}, abstract = {We determine all permutation trinomials of type x2ps+r+xps+r+λxr over the finite field Fpt when (2ps+r)4<pt. This partially extends a previous result by Bhattacharya and Sarkar in the case p=2, r=1.}, keywords = {Exceptional polynomials, Permutation trinomials}, url = {http://www.sciencedirect.com/science/article/pii/S1071579717301211?via%3Dihub}, doi = {10.1016/j.ffa.2017.09.010}, pages = {126--131} }

We determine all permutation trinomials of type x2ps+r+xps+r+λxr over the finite field Fpt when (2ps+r)4

On a conjecture about a class of permutation trinomials.
Bartoli, D.

Paper doi bibtex abstract

*FINITE FIELDS AND THEIR APPLICATIONS*, 52: 30–50. 2018.Paper doi bibtex abstract

@article{ 11391_1430240, author = {Bartoli, Daniele}, title = {On a conjecture about a class of permutation trinomials}, year = {2018}, journal = {FINITE FIELDS AND THEIR APPLICATIONS}, volume = {52}, abstract = {We prove a conjecture by Tu, Zeng, Li, and Helleseth concerning trinomials fα,β(x)=x+αxq(q−1)+1+βx2(q−1)+1∈Fq2[x] , αβ≠0, q even, characterizing all the pairs (α,β)∈Fq22 for which fα,β(x) is a permutation of Fq2.}, keywords = {Permutation polynomials; Finite fields; Algebraic curves}, url = {https://www.sciencedirect.com/science/article/pii/S1071579718300303}, doi = {10.1016/j.ffa.2018.03.003}, pages = {30--50} }

We prove a conjecture by Tu, Zeng, Li, and Helleseth concerning trinomials fα,β(x)=x+αxq(q−1)+1+βx2(q−1)+1∈Fq2[x] , αβ≠0, q even, characterizing all the pairs (α,β)∈Fq22 for which fα,β(x) is a permutation of Fq2.

Responsabilità genitoriale e tutela del minore intersessuale.
Stefanelli, S.

Paper bibtex abstract

*GENIUS*, 2018: 17–25. 2018.Paper bibtex abstract

@article{ 11391_1430569, author = {Stefanelli, Stefania}, title = {Responsabilità genitoriale e tutela del minore intersessuale}, year = {2018}, journal = {GENIUS}, volume = {2018}, abstract = {Intesa la responsabilità genitoriale in funzione della realizzazione dell’interesse del minore, alla luce della sua progressiva maturazione, ogni scelta e specialmente quella irreversibile circa l’eventuale adeguamento dei caratteri sessuali deve essere, quando possibile, rinviata al momento in cui il figlio, raggiunta la piena capacità di discernimento, sia in grado di valutarne la corrispondenza alla propria identità personale. The paper focuses on the issues around parental consent, required to perform surgeries on intersex child. Although the choice should be in the best interest of the child, the parents may be in a position in which it is difficult for them to separate their child’s interests from their own interests. For instance, they could be interested in having a perfect child, with a perfect body. Thus, a more cautious approach should be introduced in order to avoid or postpone, when possible, surgical intervention, waiting the age of the consent.}, keywords = {Intersex, responsabilità genitoriale}, url = {http://www.articolo29.it/wp-content/uploads/2018/04/genius-2018-01.pdf}, pages = {17--25} }

Intesa la responsabilità genitoriale in funzione della realizzazione dell’interesse del minore, alla luce della sua progressiva maturazione, ogni scelta e specialmente quella irreversibile circa l’eventuale adeguamento dei caratteri sessuali deve essere, quando possibile, rinviata al momento in cui il figlio, raggiunta la piena capacità di discernimento, sia in grado di valutarne la corrispondenza alla propria identità personale. The paper focuses on the issues around parental consent, required to perform surgeries on intersex child. Although the choice should be in the best interest of the child, the parents may be in a position in which it is difficult for them to separate their child’s interests from their own interests. For instance, they could be interested in having a perfect child, with a perfect body. Thus, a more cautious approach should be introduced in order to avoid or postpone, when possible, surgical intervention, waiting the age of the consent.

La filiazione e i minori - II edizione.
Sassi, A.; Stefanelli, S.; and Scaglione, F.
Volume Le persone e la famiglia, 4 Utet giuridica, Torino, 2018.

bibtex abstract buy

bibtex abstract buy

@book{ 11391_1423540, author = {Sassi, Andrea and Stefanelli, Stefania and Scaglione, Francesco}, title = {La filiazione e i minori - II edizione}, year = {2018}, publisher = {Utet giuridica}, address = {Torino}, volume = {Le persone e la famiglia, 4}, abstract = {La seconda edizione, aggiornata e ampliata, tiene conto delle importanti novità giurisprudenziali successive alla prima edizione, tra cui quelle sull'adozione in casi particolari nella coppia omoaffettiva, sul riconoscimento della genitorialità biologica e dello status acquisito all'estero, sul diritto a conoscere le proprie origini nel parto anonimo, e delle decisioni del giudice delle leggi, nonché della l. n. 76/2016 sulle unioni civili e le convivenze registrate e della l. 219/2017 sul consenso informato e le direttive anticipate di trattamento.}, keywords = {filiazione minori}, pages = {1--886} }

La seconda edizione, aggiornata e ampliata, tiene conto delle importanti novità giurisprudenziali successive alla prima edizione, tra cui quelle sull'adozione in casi particolari nella coppia omoaffettiva, sul riconoscimento della genitorialità biologica e dello status acquisito all'estero, sul diritto a conoscere le proprie origini nel parto anonimo, e delle decisioni del giudice delle leggi, nonché della l. n. 76/2016 sulle unioni civili e le convivenze registrate e della l. 219/2017 sul consenso informato e le direttive anticipate di trattamento.

Verso la capacità di agire del minore: il caso degli atti giuridici in senso stretto.
Stefanelli, S.

bibtex

*IL FORO ITALIANO*, 2018: 604–610. 2018.bibtex

@article{ 11391_1427334, author = {Stefanelli, Stefania}, title = {Verso la capacità di agire del minore: il caso degli atti giuridici in senso stretto}, year = {2018}, journal = {IL FORO ITALIANO}, volume = {2018}, keywords = {Capacità di agire, minore di età}, pages = {604--610} }

Tutele negli affetti extrafamiliari.
Stefanelli, S.
pages 847–864. Giuffré, Milano, 2018.

bibtex buy

bibtex buy

@inbook{ 11391_1433575, author = {Stefanelli, Stefania}, title = {Tutele negli affetti extrafamiliari}, year = {2018}, publisher = {Giuffré}, address = {Milano}, booktitle = {Le tutele nella famiglia}, pages = {847--864} }

Tutele nell'adozione genitoriale.
Stefanelli, S.
pages 863–883. Giuffré, Milano, 2018.

bibtex buy

bibtex buy

@inbook{ 11391_1433576, author = {Stefanelli, Stefania}, title = {Tutele nell'adozione genitoriale}, year = {2018}, publisher = {Giuffré}, address = {Milano}, booktitle = {Le tutele nella famiglia}, pages = {863--883} }

2017
(9)

Fight against corruption in Italy.
Merloni, F.; and Ponti, B.
Volume 24 . pages 201–209. Bruylant, Bruxelles, 2017.

bibtex abstract buy

bibtex abstract buy

@inbook{ 11391_1412848, author = {Merloni, Francesco and Ponti, Benedetto}, title = {Fight against corruption in Italy}, year = {2017}, publisher = {Bruylant}, address = {Bruxelles}, volume = {24}, booktitle = {Preventing Corruption and Promoting good Government and Public Integrity}, abstract = {The article exposes the key concepts of anti corruption tools in the Italian legislative framework}, keywords = {anticorruption, transparency, conflict of interest}, pages = {201--209} }

The article exposes the key concepts of anti corruption tools in the Italian legislative framework

Licenziamento disciplinare nel pubblico impiego.
Benedetto, P.
pages 390–392. Istituto dell’Enciclopedia Italiana, Roma, 2017.

bibtex abstract buy

bibtex abstract buy

@inbook{ 11391_1412847, author = {Benedetto, Ponti}, title = {Licenziamento disciplinare nel pubblico impiego}, year = {2017}, publisher = {Istituto dell’Enciclopedia Italiana}, address = {Roma}, booktitle = {Libro dell'anno del diritto 2017}, abstract = {L’integrazione della disciplina legislativa del licenziamento disciplinare, con la accelerazione delle procedure in caso falsa attestazione della presenza in servizio, e l’inasprimento delle relative sanzioni, prosegue il percorso di progressiva divaricazione della disciplina dell’impego pubblico rispetto a quella del lavoro privato. Il contributo dà conto delle logiche sottese a tale specifico intervento, collocandole sullo sfondo (problematico) di una più ampia vicenda che segna la rottura del progetto di convergenza delle tecniche di regolazione del lavoro pubblico con quelle del lavoro nella impresa privata, avviato all’inizio degli anni novanta del secolo scorso.}, keywords = {lavoro, pubblico impiego, licenziamento disciplinare}, pages = {390--392} }

L’integrazione della disciplina legislativa del licenziamento disciplinare, con la accelerazione delle procedure in caso falsa attestazione della presenza in servizio, e l’inasprimento delle relative sanzioni, prosegue il percorso di progressiva divaricazione della disciplina dell’impego pubblico rispetto a quella del lavoro privato. Il contributo dà conto delle logiche sottese a tale specifico intervento, collocandole sullo sfondo (problematico) di una più ampia vicenda che segna la rottura del progetto di convergenza delle tecniche di regolazione del lavoro pubblico con quelle del lavoro nella impresa privata, avviato all’inizio degli anni novanta del secolo scorso.

A Savage-like representation theorem for preferences on multi-acts.
Coletti, G.; Petturiti, D.; and Vantaggi, B.
Volume 456 . pages 127–134. Springer, Cham, 2017.

Paper doi bibtex abstract buy

Paper doi bibtex abstract buy

@inbook{ 11391_1396281, author = {Coletti, Giulianella and Petturiti, Davide and Vantaggi, Barbara}, title = {A Savage-like representation theorem for preferences on multi-acts}, year = {2017}, publisher = {Springer}, address = {Cham}, volume = {456}, booktitle = {Soft Methods for Data Science}, abstract = {We deal with a Savage-like decision problem under uncertainty where, for every state of the world, the consequence of each decision (multi-act) is generally uncertain: the decision maker only knows the set of possible alternatives where it can range (multi-consequence). A Choquet expected utility representation theorem for a preference relation on multi-acts is provided, relying on a state-independent cardinal utility function defined on the (finite) set of all alternatives.}, keywords = {Choquet expected utility, Decision makers, Decision problems, Preference relation, Representation theorem, Utility functions}, url = {https://link.springer.com/chapter/10.1007/978-3-319-42972-4_16}, doi = {10.1007/978-3-319-42972-4_16}, pages = {127--134} }

We deal with a Savage-like decision problem under uncertainty where, for every state of the world, the consequence of each decision (multi-act) is generally uncertain: the decision maker only knows the set of possible alternatives where it can range (multi-consequence). A Choquet expected utility representation theorem for a preference relation on multi-acts is provided, relying on a state-independent cardinal utility function defined on the (finite) set of all alternatives.

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs.
Bekos, M. A; Cornelsen, S.; Grilli, L.; Hong, S.; and Kaufmann, M.

Paper doi bibtex abstract

*ALGORITHMICA*, 79: 401–427. 2017.Paper doi bibtex abstract

@article{ 11391_1395960, author = {Bekos, Michael A and Cornelsen, Sabine and Grilli, Luca and Hong, Seok-Hee and Kaufmann, Michael}, title = {On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs}, year = {2017}, journal = {ALGORITHMICA}, volume = {79}, abstract = {Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a common vertex. A graph is outer-fan-planar if it has a fan-planar embedding in which every vertex is on the outer face. If, in addition, the insertion of an edge destroys its outer-fan-planarity, then it is maximal outer-fan-planar. In this paper, we present a linear-time algorithm to test whether a given graph is maximal outer-fan-planar. The algorithm can also be employed to produce an outer-fan-planar embedding, if one exists. On the negative side, we show that testing fan-planarity of a graph is NP-complete, for the case where the rotation system (i.e., the cyclic order of the edges around each vertex) is given.}, keywords = {Beyond planarity; Fan-planar graphs; Graph drawing;}, url = {https://link.springer.com/content/pdf/10.1007%2Fs00453-016-0200-5.pdf}, doi = {10.1007/s00453-016-0200-5}, pages = {401--427} }

Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges incident to a common vertex. A graph is outer-fan-planar if it has a fan-planar embedding in which every vertex is on the outer face. If, in addition, the insertion of an edge destroys its outer-fan-planarity, then it is maximal outer-fan-planar. In this paper, we present a linear-time algorithm to test whether a given graph is maximal outer-fan-planar. The algorithm can also be employed to produce an outer-fan-planar embedding, if one exists. On the negative side, we show that testing fan-planarity of a graph is NP-complete, for the case where the rotation system (i.e., the cyclic order of the edges around each vertex) is given.

Complete permutation polynomials from exceptional polynomials.
Bartoli, D.; Giulietti, M.; Quoos, L.; and Zini, G.

Paper doi bibtex abstract

*JOURNAL OF NUMBER THEORY*, 176: 46–66. 2017.Paper doi bibtex abstract

@article{ 11391_1400537, author = {Bartoli, Daniele and Giulietti, Massimo and Quoos, Luciane and Zini, Giovanni}, title = {Complete permutation polynomials from exceptional polynomials}, year = {2017}, journal = {JOURNAL OF NUMBER THEORY}, volume = {176}, abstract = {We classify complete permutation monomials of degree View the MathML source over the finite field with qn elements in odd characteristic, for n+1 a prime and (n+1)4<q. As a corollary, a conjecture by Wu, Li, Helleseth, and Zhang is proven in odd characteristic. When n+1 is a power of the characteristic we provide some new examples. Indecomposable exceptional polynomials of degree 8 and 9 are also classified.}, keywords = {Bent–negabent boolean functions; Complete permutation polynomials; Exceptional polynomials; Permutation polynomials; Algebra and Number Theory}, url = {http://www.sciencedirect.com/science/article/pii/S0022314X17300495}, doi = {10.1016/j.jnt.2016.12.016}, pages = {46--66} }

We classify complete permutation monomials of degree View the MathML source over the finite field with qn elements in odd characteristic, for n+1 a prime and (n+1)4

Constant dimension codes from riemann-roch spaces.
Bartoli, D.; Bonini, M.; and Giulietti, M.

Paper doi bibtex abstract

*ADVANCES IN MATHEMATICS OF COMMUNICATIONS*, 11: 705–713. 2017.Paper doi bibtex abstract

@article{ 11391_1422051, author = {Bartoli, Daniele and Bonini, Matteo and Giulietti, Massimo}, title = {Constant dimension codes from riemann-roch spaces}, year = {2017}, journal = {ADVANCES IN MATHEMATICS OF COMMUNICATIONS}, volume = {11}, abstract = {Some families of constant dimension codes arising from Riemann-Roch spaces associated with particular divisors of a curve X are constructed. These families are generalizations of the one constructed by Hansen.}, keywords = {Constant dimension codes; Random network codes; Riemann-Roch spaces; Algebra and Number Theory; Computer Networks and Communications; Discrete Mathematics and Combinatorics; Applied Mathematics}, url = {http://aimsciences.org/article/doi/10.3934/amc.2017051}, doi = {10.3934/amc.2017051}, pages = {705--713} }

Some families of constant dimension codes arising from Riemann-Roch spaces associated with particular divisors of a curve X are constructed. These families are generalizations of the one constructed by Hansen.

New bounds for linear codes of covering radius 2.
Bartoli, D.; Davydov, A. A.; Giulietti, M.; Marcugini, S.; and Pambianco, F.
2017.

Paper doi bibtex abstract

Paper doi bibtex abstract

@conference{ 11391_1425398, author = {Bartoli, Daniele and Davydov, Alexander A. and Giulietti, Massimo and Marcugini, Stefano and Pambianco, Fernanda}, title = {New bounds for linear codes of covering radius 2}, year = {2017}, publisher = {Springer Verlag}, volume = {10495}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, abstract = {The length function q(r,R) is the smallest length of a q-ary linear code of covering radius R and codimension r. New upper bounds on q(r, 2) are obtained for odd r ≥ 3. In particular, using the one-to-one correspondence between linear codes of covering radius 2 and saturating sets in the projective planes over finite fields, we prove that q(3, 2) ≤ q(3 ln q + ln ln q) + q 3 ln q + 3 and then obtain estimations of q(r, 2) for all odd r ≥ 5. The new upper bounds are smaller than the previously known ones. Also, the new bounds hold for all q, not necessary large, whereas the previously best known estimations are proved only for q large enough.}, keywords = {Covering codes, Projective spaces, Saturating sets,The length function, Upper bounds}, url = {http://springer.com,SSL+10.1007%2F978-3-319-66278-7_1}, doi = {10.1007/978-3-319-66278-7_1}, pages = {1--10} }

The length function q(r,R) is the smallest length of a q-ary linear code of covering radius R and codimension r. New upper bounds on q(r, 2) are obtained for odd r ≥ 3. In particular, using the one-to-one correspondence between linear codes of covering radius 2 and saturating sets in the projective planes over finite fields, we prove that q(3, 2) ≤ q(3 ln q + ln ln q) + q 3 ln q + 3 and then obtain estimations of q(r, 2) for all odd r ≥ 5. The new upper bounds are smaller than the previously known ones. Also, the new bounds hold for all q, not necessary large, whereas the previously best known estimations are proved only for q large enough.

A sentiment-based model for the BitCoin: theory, estimation and option pricing.
Cretarola, A.; FIGA' TALAMANCA, G.; and Patacca, M.
2017.

Paper doi bibtex abstract

Paper doi bibtex abstract

@misc{ 11391_1428323, author = {Cretarola, Alessandra and FIGA' TALAMANCA, Gianna and Patacca, Marco}, title = {A sentiment-based model for the BitCoin: theory, estimation and option pricing}, year = {2017}, address = {Ithaca/New York}, abstract = {In recent literature it is claimed that BitCoin price behaves more likely to a volatile stock asset than a currency and that changes in its price are influenced by sentiment about the BitCoin system itself; in Kristoufek [10] the author analyses transaction based as well as popularity based potential drivers of the BitCoin price finding positive evidence. Here, we endorse this finding and consider a bivariate model in continuous time to describe the price dynamics of one BitCoin as well as a second factor, affecting the price itself, which represents a sentiment indicator. We prove that the suggested model is arbitrage-free under a mild condition and, based on risk-neutral evaluation, we obtain a closed formula to approximate the price of European style derivatives on the BitCoin. By applying the same approximation technique to the joint likelihood of a discrete sample of the bivariate process, we are also able to fit the model to market data. This is done by using both the Volume and the number of Google searches as possible proxies for the sentiment factor. Further, the performance of the pricing formula is assessed on a sample of market option prices obtained by the website deribit.com.}, keywords = {BitCoin, Sentiment, Stochastic Models, Equivalent Martingale Measure, Option Pricing, Likelihood}, url = {https://ssrn.com/abstract=3042029}, doi = {10.2139/ssrn.3042029}, }

In recent literature it is claimed that BitCoin price behaves more likely to a volatile stock asset than a currency and that changes in its price are influenced by sentiment about the BitCoin system itself; in Kristoufek [10] the author analyses transaction based as well as popularity based potential drivers of the BitCoin price finding positive evidence. Here, we endorse this finding and consider a bivariate model in continuous time to describe the price dynamics of one BitCoin as well as a second factor, affecting the price itself, which represents a sentiment indicator. We prove that the suggested model is arbitrage-free under a mild condition and, based on risk-neutral evaluation, we obtain a closed formula to approximate the price of European style derivatives on the BitCoin. By applying the same approximation technique to the joint likelihood of a discrete sample of the bivariate process, we are also able to fit the model to market data. This is done by using both the Volume and the number of Google searches as possible proxies for the sentiment factor. Further, the performance of the pricing formula is assessed on a sample of market option prices obtained by the website deribit.com.

A Confidence-Based Model for Asset and Derivative Prices in the Bitcoin Market.
Cretarola, A.; and Figa-Talamanca, G.
2017.

Paper doi bibtex abstract

Paper doi bibtex abstract

@misc{ 11391_1428324, author = {Cretarola, Alessandra and Figa-Talamanca, Gianna}, title = {A Confidence-Based Model for Asset and Derivative Prices in the Bitcoin Market}, year = {2017}, address = {Ithaca/New York}, abstract = {We endorse the idea, suggested in recent literature, that BitCoin prices are influenced by sentiment and confidence about the underlying technology; as a consequence, an excitement about the BitCoin system may propagate to BitCoin prices causing a Bubble effect, the presence of which is documented in several papers about the cryptocurrency. In this paper we develop a bivariate model in continuous time to describe the price dynamics of one BitCoin as well as the behavior of a second factor affecting the price itself, which we name confidence indicator. The two dynamics are possibly correlated and we also take into account a delay between the confidence indicator and its delivered effect on the BitCoin price. Statistical properties of the suggested model are investigated and its arbitrage-free property is shown. Further, based on risk-neutral evaluation, a quasi-closed formula is derived for European style derivatives on the BitCoin. A short numerical application is finally provided.}, keywords = {BitCoin, Sentiment, Equivalent martingale measure, Option Pricing}, url = {https://ssrn.com/abstract=2908921}, doi = {10.2139/ssrn.2908921}, }

We endorse the idea, suggested in recent literature, that BitCoin prices are influenced by sentiment and confidence about the underlying technology; as a consequence, an excitement about the BitCoin system may propagate to BitCoin prices causing a Bubble effect, the presence of which is documented in several papers about the cryptocurrency. In this paper we develop a bivariate model in continuous time to describe the price dynamics of one BitCoin as well as the behavior of a second factor affecting the price itself, which we name confidence indicator. The two dynamics are possibly correlated and we also take into account a delay between the confidence indicator and its delivered effect on the BitCoin price. Statistical properties of the suggested model are investigated and its arbitrage-free property is shown. Further, based on risk-neutral evaluation, a quasi-closed formula is derived for European style derivatives on the BitCoin. A short numerical application is finally provided.

2016
(4)

The Concept of Public Data.
Ponti, B.
Volume 19 . pages 581–599. Bruylant, Bruxelles, 2016.

bibtex abstract buy

bibtex abstract buy

@inbook{ 11391_1412853, author = {Ponti, Benedetto}, title = {The Concept of Public Data}, year = {2016}, publisher = {Bruylant}, address = {Bruxelles}, volume = {19}, booktitle = {Droit comparé de la procedure administrative - Comparative Law of Administrative Procedure}, abstract = {The essay analizes the gradual emergence of a “data logic” in the informational administrative system, that is running alongside or - possibly - replacing the traditional document-based paradigms, in wich the information has acquired an autonomous significance, including in the way it is dealt with in a legal context. The article explores - in a european comparative framework - the three/interconnected legal dimension that confers the public nature to data managed by the public administration: Public in the sense data of Knowable by Anyone; Public Data in the Sense of Available to Anyone (via Internet); and Public Data as an Available and Reusable Commodity.}, pages = {581--599} }

The essay analizes the gradual emergence of a “data logic” in the informational administrative system, that is running alongside or - possibly - replacing the traditional document-based paradigms, in wich the information has acquired an autonomous significance, including in the way it is dealt with in a legal context. The article explores - in a european comparative framework - the three/interconnected legal dimension that confers the public nature to data managed by the public administration: Public in the sense data of Knowable by Anyone; Public Data in the Sense of Available to Anyone (via Internet); and Public Data as an Available and Reusable Commodity.

Introduzione.
Ponti, B.
Volume 94 . pages 15–23. Maggioli, Santarcangelo di Romagna, 2016.

bibtex abstract buy

bibtex abstract buy

@inbook{ 11391_1412856, author = {Ponti, Benedetto}, title = {Introduzione}, year = {2016}, publisher = {Maggioli}, address = {Santarcangelo di Romagna}, volume = {94}, booktitle = {Nuova trasparenza amministrativa e libertà di accesso alle informazioni. Commento sistematico al d.lgs. 33/2013 dopo le modifiche apportate dal d.lgs. 25 maggio 2016, n. 97.}, abstract = {Nella prefazione al volume sono descritti le ragioni di storiche, ordinamentali e di contesto che hanno condotto all'adozione del d.lgs. 97/2016 ed in particolare all'introduzione del FOIA- Freedom of information act, in Italia}, keywords = {trasparenza, FOIA, libertà di informazione, diritto di accesso, open data,}, pages = {15--23} }

Nella prefazione al volume sono descritti le ragioni di storiche, ordinamentali e di contesto che hanno condotto all'adozione del d.lgs. 97/2016 ed in particolare all'introduzione del FOIA- Freedom of information act, in Italia

Nuova trasparenza amminiostrativa e libertà di accesso alle informazioni. Commento sistematico al d.lgs. 33/2013 dopo le modifiche apportate dal d.lgs. 25 maggio 2016, n. 97.
Ponti, B.
2016.

bibtex abstract

bibtex abstract

@misc{ 11391_1412855, author = {Ponti, Benedetto}, title = {Nuova trasparenza amminiostrativa e libertà di accesso alle informazioni. Commento sistematico al d.lgs. 33/2013 dopo le modifiche apportate dal d.lgs. 25 maggio 2016, n. 97}, year = {2016}, publisher = {Maggioli}, address = {Santarcangelo di Romagna}, volume = {94}, abstract = {Con l’integrazione dell’accesso generalizzato alle informazioni detenute dalle pubbliche amministrazioni (il cd. “Foia”) nel quadro dell’organica disciplina della trasparenza amministrativa, giunge ad un primo compimento il percorso italiano verso l’affermazione della libertà di accesso alle informazioni da parte dei cittadini. L’applicazione della nuova disciplina costituisce una sfida rilevante. Il principio in base al quale ogni informazione detenuta è conoscibile (salvo eccezione), pone le pubbliche amministrazioni difronte ad una cambio di paradigma innanzitutto culturale, oltre che organizzativo, e vedrà il suo primo, vero banco di prova in sede di applicazione dei limiti e delle eccezioni al diritto di accesso generalizzato. Di contro, anche l’opera di “snellimento” e semplificazione degli obblighi di pubblicazione presenta una serie di problematiche applicative, a cominciare dalla concreta operatività e fruibilità delle banche dati centralizzate, “sostitutive” di numerosi obblighi di pubblicazione fin qui demandati a ciascuna amministrazione. Il volume affronta in modo sistematico tutti questi temi, ed analizza il decreto 33/2013 – così come risultante dalle modifiche introdotte dal d.lgs. 97/2016 – andando oltre la mera esegesi del testo normativo. I diversi contributi, infatti, danno ampiamente conto delle problematiche che hanno caratterizzato il periodo di vigenza della disciplina sulla trasparenza amministrativa, conferendo profondità e completezza alla disamina delle novità normative appena introdotte. Il volume si propone, quindi, come una guida aggiornata, approfondita e consapevole all’applicazione degli istituti della trasparenza amministrativa, particolarmente attenta ai profili di impatto organizzativo ed operativo.}, keywords = {trasparenza, diritto di accesso, Foia, open government, open data, pubblicità on line,}, pages = {1--626} }

Con l’integrazione dell’accesso generalizzato alle informazioni detenute dalle pubbliche amministrazioni (il cd. “Foia”) nel quadro dell’organica disciplina della trasparenza amministrativa, giunge ad un primo compimento il percorso italiano verso l’affermazione della libertà di accesso alle informazioni da parte dei cittadini. L’applicazione della nuova disciplina costituisce una sfida rilevante. Il principio in base al quale ogni informazione detenuta è conoscibile (salvo eccezione), pone le pubbliche amministrazioni difronte ad una cambio di paradigma innanzitutto culturale, oltre che organizzativo, e vedrà il suo primo, vero banco di prova in sede di applicazione dei limiti e delle eccezioni al diritto di accesso generalizzato. Di contro, anche l’opera di “snellimento” e semplificazione degli obblighi di pubblicazione presenta una serie di problematiche applicative, a cominciare dalla concreta operatività e fruibilità delle banche dati centralizzate, “sostitutive” di numerosi obblighi di pubblicazione fin qui demandati a ciascuna amministrazione. Il volume affronta in modo sistematico tutti questi temi, ed analizza il decreto 33/2013 – così come risultante dalle modifiche introdotte dal d.lgs. 97/2016 – andando oltre la mera esegesi del testo normativo. I diversi contributi, infatti, danno ampiamente conto delle problematiche che hanno caratterizzato il periodo di vigenza della disciplina sulla trasparenza amministrativa, conferendo profondità e completezza alla disamina delle novità normative appena introdotte. Il volume si propone, quindi, come una guida aggiornata, approfondita e consapevole all’applicazione degli istituti della trasparenza amministrativa, particolarmente attenta ai profili di impatto organizzativo ed operativo.

A Generalized SMART Fuzzy Disjunction of Volatility Indicators Applied to Option Pricing in a Binomial Model.
Capotorti, A.; and Figà-Talamanca, G.
2016.

doi bibtex abstract

doi bibtex abstract

@conference{ 11391_1395163, author = {Capotorti, Andrea and Figà-Talamanca, Gianna}, title = {A Generalized SMART Fuzzy Disjunction of Volatility Indicators Applied to Option Pricing in a Binomial Model}, year = {2016}, publisher = {Springer}, volume = {456}, booktitle = {Soft Methods for Data Science}, abstract = {In this paper we extend our previous contributions on the elicitation of the fuzzy volatility membership function in option pricing models. More specifically we generalize the SMART disjunction for a multi-model volatility behavior (Uniform, LogNormal, Gamma, ...) and within a double-source (direct vs. indirect) information set. The whole procedure is then applied to the Cox-Ross-Rubinstein framework for option pricing on the S&P500 Index where the historical volatility, computed from the Index returns’ time series, and the VIX Index observed data are respectively considered as the direct and indirect sources of knowledge.Asuitable distance among the resulting fuzzy option prices and the market bid-ask spread make us appreciate the proposed procedure against the classical fuzzy mean.}, doi = {10.1007/978-3-319-42972-4_12}, pages = {95--102} }

In this paper we extend our previous contributions on the elicitation of the fuzzy volatility membership function in option pricing models. More specifically we generalize the SMART disjunction for a multi-model volatility behavior (Uniform, LogNormal, Gamma, ...) and within a double-source (direct vs. indirect) information set. The whole procedure is then applied to the Cox-Ross-Rubinstein framework for option pricing on the S&P500 Index where the historical volatility, computed from the Index returns’ time series, and the VIX Index observed data are respectively considered as the direct and indirect sources of knowledge.Asuitable distance among the resulting fuzzy option prices and the market bid-ask spread make us appreciate the proposed procedure against the classical fuzzy mean.

2015
(1)

Fuzzy option prices with different sources of information smartly averaged.
Capotorti, A.; and Figà-Talamanca, G.
2015.

Paper bibtex abstract

Paper bibtex abstract

@conference{ 11391_1355279, author = {Capotorti, Andrea and Figà-Talamanca, Gianna}, title = {Fuzzy option prices with different sources of information smartly averaged}, year = {2015}, publisher = {Università degli Studi di Padova}, booktitle = {Abstracts of the 39th Annual Meeting of the Italian Association for Mathematics Applied to Economic and Social Sciences (AMASES)}, abstract = {In a previous proposal we were able to elicit membership functions through probability-possibility transformations induced by confidence intervals around the median of specific simulating distributions. Hence we got so called ``fuzzy numbers", i.e. unimodal membership functions with nested $\alpha$-cuts. It was left open the problem of merging such kind of fuzzy numbers whenever different, generally more than two, sources of information are considered.\\ We give now a proposal of two different weighted fuzzy averages between fuzzy numbers. Such operators profit from $\alpha$-cuts and LR representations of fuzzy numbers. One operator is intended to generalize, through specific deformations of standard fuzzy means, the disjunction and the other to generalize the conjunction. Generalizations emphasize agreement or not between different sources of information. Such conflicts, as well as agreements, are endogenously embedded inside the average weights of the two new operators by measuring distances or superimposition between $\alpha$-cuts. No exogenous elements are added, except for the choice of the parameters of the deformation that emphasizes conflicts.\\ The main novelty is the aggregations performed among several $\alpha$-cuts by considering full/partial overlapping and generalizing Marzullo's algorithm (designed to compute the ``relaxed'' intersections among different information sources).\\ The proposal is motivated by the practical problem of assessing the fuzzy volatility parameter via both the historical volatility and the VIX estimators. In particular, for each estimator, different scenarios are considered on the base of historical data and experts evaluations.\\ Emphasis is posed on the consequences of the new operators on the fuzzy option pricing both in multi-periodal binary and in Black and Scholes environments. Crisp bid-ask price intervals are compared with fuzzy prices obtained through both new operators and standard fuzzy mean. Such comparisons are based on proper similarity indexes: the Bhattacharya distance and usual fuzzy similarity.}, keywords = {Fuzzy merging; Fuzzy option prices}, url = {http://www.math.unipd.it/~vargiolu/AMASES2015/Aux_Files/AbstractsAMASES2015/AbstractsTalks/Abs39AMASES_Capotorti.pdf} }

In a previous proposal we were able to elicit membership functions through probability-possibility transformations induced by confidence intervals around the median of specific simulating distributions. Hence we got so called ``fuzzy numbers", i.e. unimodal membership functions with nested $\alpha$-cuts. It was left open the problem of merging such kind of fuzzy numbers whenever different, generally more than two, sources of information are considered.\\ We give now a proposal of two different weighted fuzzy averages between fuzzy numbers. Such operators profit from $\alpha$-cuts and LR representations of fuzzy numbers. One operator is intended to generalize, through specific deformations of standard fuzzy means, the disjunction and the other to generalize the conjunction. Generalizations emphasize agreement or not between different sources of information. Such conflicts, as well as agreements, are endogenously embedded inside the average weights of the two new operators by measuring distances or superimposition between $\alpha$-cuts. No exogenous elements are added, except for the choice of the parameters of the deformation that emphasizes conflicts.\\ The main novelty is the aggregations performed among several $\alpha$-cuts by considering full/partial overlapping and generalizing Marzullo's algorithm (designed to compute the ``relaxed'' intersections among different information sources).\\ The proposal is motivated by the practical problem of assessing the fuzzy volatility parameter via both the historical volatility and the VIX estimators. In particular, for each estimator, different scenarios are considered on the base of historical data and experts evaluations.\\ Emphasis is posed on the consequences of the new operators on the fuzzy option pricing both in multi-periodal binary and in Black and Scholes environments. Crisp bid-ask price intervals are compared with fuzzy prices obtained through both new operators and standard fuzzy mean. Such comparisons are based on proper similarity indexes: the Bhattacharya distance and usual fuzzy similarity.

# Embedding in another Page

Copy&paste any of the following snippets into an existing page to embed this page. For more details see the documention.

**JavaScript**(Easiest)

```
<script src="https://bibbase.org/show?bib=http://www.dmi.unipg.it/cybersecuritylab/temp_files/global.bib&jsonp=1"></script>
```

**PHP**

```
<?php
$contents = file_get_contents("https://bibbase.org/show?bib=http://www.dmi.unipg.it/cybersecuritylab/temp_files/global.bib");
print_r($contents);
?>
```

**iFrame**

```
<iframe src="https://bibbase.org/show?bib=http://www.dmi.unipg.it/cybersecuritylab/temp_files/global.bib"></iframe>
```