## 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
(3)

Abstract argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making.
Bistarelli, S.; Ceberio, M.; Henderson, J. A.; and Santini, F.
Volume 100 . pages 7--19. Springer International Publishing, 9999.

Paper doi bibtex abstract buy

Paper doi bibtex abstract buy

@inbook{ 11391_1417228, author = {Bistarelli, Stefano and Ceberio, Martine and Henderson, Joel A. and Santini, Francesco}, title = {Abstract argumentation frameworks to promote fairness and rationality in multi-experts multi-criteria decision making}, year = {9999}, publisher = {Springer International Publishing}, volume = {100}, booktitle = {Studies in Systems, Decision and Control}, abstract = {In this work, we propose to model Multi-Experts Multi-CriteriaDecision-Making (MEMCDM) problems using Abstract Argumentation Frameworks. We specifically design our model so as to ensure fairness and rationality in the decision-making process. For instance, when, of two expert’s decisions, one is unfair, we impose an attack between these two decisions, forcing one of the two decisions out of the argumentation network’s resulting extensions. Similarly, we specifically put irrational decisions in opposition to force one out. In doing so, we aim to enable the prediction of decisions that are themselves fair and rational. Our model is illustrated on a toy example.}, keywords = {Computer Science (miscellaneous); Decision Sciences (miscellaneous); 2001; Automotive Engineering; Control and Systems Engineering; Control and Optimization; Social Sciences (miscellaneous)}, url = {www.springer.com/series/13304}, doi = {10.1007/978-3-319-61753-4_2}, pages = {7--19} }

In this work, we propose to model Multi-Experts Multi-CriteriaDecision-Making (MEMCDM) problems using Abstract Argumentation Frameworks. We specifically design our model so as to ensure fairness and rationality in the decision-making process. For instance, when, of two expert’s decisions, one is unfair, we impose an attack between these two decisions, forcing one of the two decisions out of the argumentation network’s resulting extensions. Similarly, we specifically put irrational decisions in opposition to force one out. In doing so, we aim to enable the prediction of decisions that are themselves fair and rational. Our model is illustrated on a toy example.

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*, . 9999.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 = {9999}, journal = {FUTURE GENERATION COMPUTER SYSTEMS}, 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}, }

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.

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*, 1--27. 9999.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 = {9999}, journal = {ALGORITHMICA}, 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 = {http://www.springerlink.com/app/home/journal.asp?wasp=b73948a592d54affa300fbefcceb25b0&referrer=parent&backto=linkingpublicationresults,1:100117,1}, doi = {10.1007/s00453-016-0200-5}, pages = {1--27} }

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.

2017
(32)

On merging two trust-networks in one with bipolar preferences.
Bistarelli, S.; and Santini, F.

doi bibtex abstract

*MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE*, 27: 215--233. 2017.doi bibtex abstract

@article{ 11391_1357705, author = {Bistarelli, Stefano and Santini, Francesco}, title = {On merging two trust-networks in one with bipolar preferences}, year = {2017}, journal = {MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE}, volume = {27}, abstract = {In this paper, we study weighted trust-networks (but also unweighted), where each edge is associated with either a positive or a negative score. Hence, we consider a distrust relationship as well, allowing a user to rate poor experiences with other individuals in his web of acquaintances. We propose an algorithm to compose two of such networks in a single one, in order to merge the knowledge obtained in two different communities of individuals (possibly partially-overlapping), through two different trust management-systems. Our algorithm is based on semiring algebraic-structures, in order to have a parametric computational-framework. Such composition can be adopted whenever two trust-based communities (with the same scope) need to be amalgamated: for instance, two competitor-companies that need to unify the trust-based knowledge on their (sub-) suppliers.}, doi = {10.1017/S0960129515000092}, pages = {215--233} }

In this paper, we study weighted trust-networks (but also unweighted), where each edge is associated with either a positive or a negative score. Hence, we consider a distrust relationship as well, allowing a user to rate poor experiences with other individuals in his web of acquaintances. We propose an algorithm to compose two of such networks in a single one, in order to merge the knowledge obtained in two different communities of individuals (possibly partially-overlapping), through two different trust management-systems. Our algorithm is based on semiring algebraic-structures, in order to have a parametric computational-framework. Such composition can be adopted whenever two trust-based communities (with the same scope) need to be amalgamated: for instance, two competitor-companies that need to unify the trust-based knowledge on their (sub-) suppliers.

From Argumentation Frameworks to Voting Systems and Back.
Benedetti, I.; and Bistarelli, S.

doi bibtex abstract

*FUNDAMENTA INFORMATICAE*, 150: 25--48. 2017.doi bibtex abstract

@article{ 11391_1398932, author = {Benedetti, Irene and Bistarelli, Stefano}, title = {From Argumentation Frameworks to Voting Systems and Back}, year = {2017}, journal = {FUNDAMENTA INFORMATICAE}, volume = {150}, abstract = {Formal voting theories are established and can be used to determine if a voting system is fair or not in order to preserve democracy. There are a lot of voting systems described in the literature, with several properties, useful in many contexts. The Argumentation Framework is based on the exchange and the evaluation of interacting arguments which may represent information of various kinds. We show that Argumentation Frameworks can be interpreted within a voting theory and considered as voting methods. Using a mapping that associates an argument to a candidate and attacks to votes, we define a bidirectional mapping between the two theories and investigate how fairness criteria defined for voting systems can be re-interpreted within Argumentation Framework. We also show how voting ballots can be seen as suitable semantics for Argumentation Frameworks.}, doi = {10.3233/FI-2017-1459}, pages = {25--48} }

Formal voting theories are established and can be used to determine if a voting system is fair or not in order to preserve democracy. There are a lot of voting systems described in the literature, with several properties, useful in many contexts. The Argumentation Framework is based on the exchange and the evaluation of interacting arguments which may represent information of various kinds. We show that Argumentation Frameworks can be interpreted within a voting theory and considered as voting methods. Using a mapping that associates an argument to a candidate and attacks to votes, we define a bidirectional mapping between the two theories and investigate how fairness criteria defined for voting systems can be re-interpreted within Argumentation Framework. We also show how voting ballots can be seen as suitable semantics for Argumentation Frameworks.

A formal and run-time framework for the adaptation of local behaviours to match a global property.
Bistarelli, S.; Martinelli, F.; Matteucci, I.; and Santini, F.
2017.

Paper doi bibtex abstract

Paper doi bibtex abstract

@conference{ 11391_1409310, author = {Bistarelli, Stefano and Martinelli, Fabio and Matteucci, Ilaria and Santini, Francesco}, title = {A formal and run-time framework for the adaptation of local behaviours to match a global property}, year = {2017}, publisher = {Springer Verlag}, volume = {10231}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, abstract = {We address the problem of automatically identifying what local properties the agents of a Cyber Physical System have to satisfy to guarantee a global required property φ. To enrich the picture, we consider properties where, besides qualitative requirements on the actions to be performed, we assume a weight associated with them: quantitative properties are specified through a weighted modal-logic. We propose both a formal machinery based on a Quantitative Partial Model Checking function on contexts, and a run-time machinery that algorithmically tries to check if the local behaviours proposed by the agents satisfy φ. The proposed approach can be seen as a run-time decomposition, privacysensitive in the sense agents do not have to disclose their full behaviour.}, keywords = {Computer software; Embedded systems; Machinery; Model checking, Local property; Modal logic; Partial model checking; Runtimes}, url = {http://springerlink.com/content/0302-9743/copyright/2005/}, doi = {10.1007/978-3-319-57666-4_9}, pages = {134--152} }

We address the problem of automatically identifying what local properties the agents of a Cyber Physical System have to satisfy to guarantee a global required property φ. To enrich the picture, we consider properties where, besides qualitative requirements on the actions to be performed, we assume a weight associated with them: quantitative properties are specified through a weighted modal-logic. We propose both a formal machinery based on a Quantitative Partial Model Checking function on contexts, and a run-time machinery that algorithmically tries to check if the local behaviours proposed by the agents satisfy φ. The proposed approach can be seen as a run-time decomposition, privacysensitive in the sense agents do not have to disclose their full behaviour.

A hasse diagram for weighted sceptical semantics with a unique-status grounded semantics.
Bistarelli, S.; and Santini, F.
2017.

Paper doi bibtex abstract

Paper doi bibtex abstract

@conference{ 11391_1417230, author = {Bistarelli, Stefano and Santini, Francesco}, title = {A hasse diagram for weighted sceptical semantics with a unique-status grounded semantics}, year = {2017}, publisher = {Springer Verlag}, volume = {10377}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, abstract = {We provide an initial study on the Hasse diagram that represents the partial order -w.r.t. set inclusion- among weighted sceptical semantics in Argumentation: grounded, ideal, and eager. Being our framework based on a parametric structure of weights, we can directly compare weighted and classical approaches. We define a unique-status weighted grounded semantics, and we prove that the lattice of stronglyadmissible extensions becomes a semi-lattice.}, keywords = {Theoretical Computer Science; Computer Science (all)}, url = {http://springerlink.com/content/0302-9743/copyright/2005/}, doi = {10.1007/978-3-319-61660-5_6}, pages = {49--56} }

We provide an initial study on the Hasse diagram that represents the partial order -w.r.t. set inclusion- among weighted sceptical semantics in Argumentation: grounded, ideal, and eager. Being our framework based on a parametric structure of weights, we can directly compare weighted and classical approaches. We define a unique-status weighted grounded semantics, and we prove that the lattice of stronglyadmissible extensions becomes a semi-lattice.

Synchronized Content and Metadata Management in a Federation of Distributed Repositories of Chemical Learning Objects.
Sergio Tasso, undefined; Simonetta Pallottelli, undefined; Osvaldo Gervasi, undefined; Razvan Tanase, undefined; and Rui, M.
Volume Part III, LNCS 10406 . Springer, Cham, 2017.

Paper doi bibtex abstract buy

Paper doi bibtex abstract buy

@inbook{ 11391_1416693, author = {Sergio Tasso, and Simonetta Pallottelli, and Osvaldo Gervasi, and Razvan Tanase, and Rui, Marina}, title = {Synchronized Content and Metadata Management in a Federation of Distributed Repositories of Chemical Learning Objects}, year = {2017}, publisher = {Springer, Cham}, volume = {Part III, LNCS 10406}, booktitle = {Computational Science and Its Applications – ICCSA 2017}, abstract = {The paper deals with the synchronization mechanism among the servers of a federation of distributed repositories for the constant updating of the didactic-scientific material, its properties and its locations. A shared metadata database is the synchronization point of reference and it allows to improve performance in terms of searching and downloading. The proposed federation is meant to deal with a large variety of different contents though the discussed prototype implementation is concerned with scientific and educational subjects in particular. Additional elements of evaluation are the capability of enhancing collaboration and fault tolerance.}, keywords = {Repository Synchronization Learning objects Content sharing}, url = {https://link.springer.com/chapter/10.1007/978-3-319-62398-6_2#Abs1}, doi = {https://doi.org/10.1007/978-3-319-62398-6_2}, }

The paper deals with the synchronization mechanism among the servers of a federation of distributed repositories for the constant updating of the didactic-scientific material, its properties and its locations. A shared metadata database is the synchronization point of reference and it allows to improve performance in terms of searching and downloading. The proposed federation is meant to deal with a large variety of different contents though the discussed prototype implementation is concerned with scientific and educational subjects in particular. Additional elements of evaluation are the capability of enhancing collaboration and fault tolerance.

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.

Il fatto di reato sullo sfondo del ne bis in idem nazional-europeo.
Falcinelli, D.

bibtex

*ARCHIVIO PENALE*, 1: 1--21. 2017.bibtex

@article{ 11391_1396677, author = {Falcinelli, D.}, title = {Il fatto di reato sullo sfondo del ne bis in idem nazional-europeo}, year = {2017}, journal = {ARCHIVIO PENALE}, volume = {1}, pages = {1--21} }

IL DIRITTO PENALE DELLA VITTIMA DEL REATO.
Falcinelli, D.
Dike Giuridica Editrice, Roma, 2017.

bibtex buy

bibtex buy

@book{ 11391_1401976, author = {Falcinelli, D.}, title = {IL DIRITTO PENALE DELLA VITTIMA DEL REATO}, year = {2017}, publisher = {Dike Giuridica Editrice}, address = {Roma}, pages = {3--252} }

Il “consenso dell’avente diritto”: un paradigma del diritto penale dei diritti umani.
Falcinelli, D.
pages 327--354. Margiacchi editore UP, Perugia, 2017.

bibtex buy

bibtex buy

@inbook{ 11391_1408684, author = {Falcinelli, D.}, title = {Il “consenso dell’avente diritto”: un paradigma del diritto penale dei diritti umani}, year = {2017}, publisher = {Margiacchi editore UP}, address = {Perugia}, booktitle = {Bioetica. Un approccio interdisciplinare}, pages = {327--354} }

La “violenza assistita” nel linguaggio del diritto penale. Il delitto di maltrattamenti in famiglia aggravato dall’art. 61 n. 11 quinquies c.p.
Falcinelli, D.

bibtex

*RIVISTA ITALIANA DI DIRITTO E PROCEDURA PENALE*, 173--197. 2017.bibtex

@article{ 11391_1415663, author = {Falcinelli, D.}, title = {La “violenza assistita” nel linguaggio del diritto penale. Il delitto di maltrattamenti in famiglia aggravato dall’art. 61 n. 11 quinquies c.p.}, year = {2017}, journal = {RIVISTA ITALIANA DI DIRITTO E PROCEDURA PENALE}, pages = {173--197} }

Capitolo IV - DOVERI DI INFORMAZIONE E COGESTIONE DEL RISCHIO NEL SISTEMA DI GARANZIE DELLA SICUREZZA SUL LAVORO.
Falcinelli, D.
Cedam, Padova, 2017.

bibtex buy

bibtex buy

@inbook{ 11391_1415955, author = {Falcinelli, D.}, title = {Capitolo IV - DOVERI DI INFORMAZIONE E COGESTIONE DEL RISCHIO NEL SISTEMA DI GARANZIE DELLA SICUREZZA SUL LAVORO}, year = {2017}, publisher = {Cedam}, address = {Padova}, booktitle = {Lavoro in Sicurezza} }

From reviews to arguments and from arguments back to reviewers’ behaviour.
Gabbriellini, S.; and Santini, F.
2017.

Paper doi bibtex abstract

Paper doi bibtex abstract

@conference{ 11391_1398690, author = {Gabbriellini, Simone and Santini, Francesco}, title = {From reviews to arguments and from arguments back to reviewers’ behaviour}, year = {2017}, publisher = {Springer Verlag}, volume = {10162}, booktitle = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, abstract = {Our aim is to understand reviews from the point of view of the arguments they contain, and then do a first step from how arguments are distributed in such reviews towards the behaviour of the reviewers that posted them. We consider 253 reviews of a selected product (a ballet tutu for kids), extracted from the “Clothing, Shoes and Jeweller” section of Amazon.com. We explode these reviews into arguments, and we study how their characteristics, e.g., the distribution of positive (in favour of purchase) and negative ones (against purchase), change through a period of four years. Among other results, we discover that negative arguments tend to permeate also positive reviews. As a second step, by using such observations and distributions, we successfully replicate the reviewers’ behaviour by simulating the review-posting process from their basic components, i.e., the arguments themselves.}, keywords = {Theoretical Computer Science; Computer Science (all)}, url = {http://springerlink.com/content/0302-9743/copyright/2005/}, doi = {10.1007/978-3-319-53354-4_4}, pages = {56--72} }

Our aim is to understand reviews from the point of view of the arguments they contain, and then do a first step from how arguments are distributed in such reviews towards the behaviour of the reviewers that posted them. We consider 253 reviews of a selected product (a ballet tutu for kids), extracted from the “Clothing, Shoes and Jeweller” section of Amazon.com. We explode these reviews into arguments, and we study how their characteristics, e.g., the distribution of positive (in favour of purchase) and negative ones (against purchase), change through a period of four years. Among other results, we discover that negative arguments tend to permeate also positive reviews. As a second step, by using such observations and distributions, we successfully replicate the reviewers’ behaviour by simulating the review-posting process from their basic components, i.e., the arguments themselves.

Residuation for bipolar preferences in soft constraints.
Gadducci, F.; and Santini, F.

doi bibtex abstract

*INFORMATION PROCESSING LETTERS*, 118: 69--74. 2017.doi bibtex abstract

@article{ 11391_1398178, author = {Gadducci, Fabio and Santini, Francesco}, title = {Residuation for bipolar preferences in soft constraints}, year = {2017}, journal = {INFORMATION PROCESSING LETTERS}, volume = {118}, abstract = {Soft constraint formalisms are an abstract representation of Constraint Satisfaction Problems (CSPs): the set of preferences is now parametric, often forming (a variety of) an absorptive semiring. However, the latter is suitable only for negative preferences, i.e., such that the combination of constraints worsens the quality of the solution. This work comments on related work and exploits residuated semirings in order to lift the Local Consistency heuristics that hold for classical CSPs. As a result, we merge and generalise existent formalisms for modelling soft CSPs with bipolar (positive and negative) preferences.}, keywords = {Bipolar preferences; Combinatorial problems; Local consistency; Soft constraints; Theoretical Computer Science; Signal Processing; Information Systems; Computer Science Applications1707 Computer Vision and Pattern Recognition}, doi = {10.1016/j.ipl.2016.10.002}, pages = {69--74} }

Soft constraint formalisms are an abstract representation of Constraint Satisfaction Problems (CSPs): the set of preferences is now parametric, often forming (a variety of) an absorptive semiring. However, the latter is suitable only for negative preferences, i.e., such that the combination of constraints worsens the quality of the solution. This work comments on related work and exploits residuated semirings in order to lift the Local Consistency heuristics that hold for classical CSPs. As a result, we merge and generalise existent formalisms for modelling soft CSPs with bipolar (positive and negative) preferences.

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

doi bibtex abstract buy

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 Verlag}, volume = {456}, booktitle = {Advances in Intelligent Systems and Computing}, 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}, 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.

Fuzziness in Italy – Traces of a scattered history.
Cattaneo, G.; Coletti, G.; Nola, A. D.; Fedrizzi, M.; Gerla, G.; Pasi, G.; Tabacchi, M. E.; Termini, S.; and Ventre, A.

Paper bibtex abstract

*ARCHIVES FOR THE PHILOSOPHY AND HISTORY OF THE SOFT COMPUTING*, 1(2017): 1--31. 2017.Paper bibtex abstract

@article{ 11391_1416861, author = {Cattaneo, Giampiero and Coletti, Giulianella and Nola, Antonio Di and Fedrizzi, Mario and Gerla, Giangiacomo and Pasi, Gabriella and Tabacchi, Marco Elio and Termini, Settimo and Ventre, Aldo}, title = {Fuzziness in Italy – Traces of a scattered history}, year = {2017}, journal = {ARCHIVES FOR THE PHILOSOPHY AND HISTORY OF THE SOFT COMPUTING}, volume = {1(2017)}, abstract = {The history of Fuzziness in Italy is varied and scattered among a number of research groups. As a matter fact "fuzziness" spread in Italy through a sort of spontaneous diffusion, and, also subsequently, no one felt the need to create some "national" common structure like an Association or similar things. Since a coesive retelling would be next to impossible, a few members of the Italian fuzzy community have been asked to recount their experience and express their hope for the future.}, url = {http://aphsc.org/index.php/aphsc/article/view/50/46}, pages = {1--31} }

The history of Fuzziness in Italy is varied and scattered among a number of research groups. As a matter fact "fuzziness" spread in Italy through a sort of spontaneous diffusion, and, also subsequently, no one felt the need to create some "national" common structure like an Association or similar things. Since a coesive retelling would be next to impossible, a few members of the Italian fuzzy community have been asked to recount their experience and express their hope for the future.

Fuzzy memberships as likelihood functions in a possibilistic framework.
Coletti, G.; Petturiti, D.; and Vantaggi, B.

Paper doi bibtex abstract

*INTERNATIONAL JOURNAL OF APPROXIMATE REASONING*, 88: 547--566. 2017.Paper doi bibtex abstract

@article{ 11391_1403797, author = {Coletti, Giulianella and Petturiti, Davide and Vantaggi, Barbara}, title = {Fuzzy memberships as likelihood functions in a possibilistic framework}, year = {2017}, journal = {INTERNATIONAL JOURNAL OF APPROXIMATE REASONING}, volume = {88}, abstract = {Likelihood functions are studied in a probabilistic and possibilistic setting: inferential conclusions are drawn from a set of likelihood functions and prior information relying on the notion of disintegrability. The present study allows for a new interpretation of fuzzy membership functions as coherent conditional possibilities. The concept of possibility of a fuzzy event is then introduced and a comparison with the probability of a fuzzy event is provided}, keywords = {Conditional possibility; Conditional probability; Fuzzy set; Inference; Likelihood function; Theoretical Computer Science; Software; Artificial Intelligence; Applied Mathematics}, url = {http://www.sciencedirect.com/science/article/pii/S0888613X16302869}, doi = {10.1016/j.ijar.2016.11.017}, pages = {547--566} }

Likelihood functions are studied in a probabilistic and possibilistic setting: inferential conclusions are drawn from a set of likelihood functions and prior information relying on the notion of disintegrability. The present study allows for a new interpretation of fuzzy membership functions as coherent conditional possibilities. The concept of possibility of a fuzzy event is then introduced and a comparison with the probability of a fuzzy event is provided

On partitioning the edges of 1-plane graphs.
Lenhart, W. J.; Liotta, G.; and Montecchiani, F.

Paper doi bibtex

*THEORETICAL COMPUTER SCIENCE*, 662: 59--65. 2017.Paper doi bibtex

@article{ 11391_1398909, author = {Lenhart, William J. and Liotta, Giuseppe and Montecchiani, Fabrizio}, title = {On partitioning the edges of 1-plane graphs}, year = {2017}, journal = {THEORETICAL COMPUTER SCIENCE}, volume = {662}, keywords = {1-Planarity; Edge Partitions; Optimal 1-Plane Graphs; Theoretical Computer Science; Computer Science (all)}, url = {http://www.journals.elsevier.com/theoretical-computer-science/}, doi = {10.1016/j.tcs.2016.12.004}, pages = {59--65} }

Area-thickness trade-offs for straight-line drawings of planar graphs.
Di Giacomo, E.; Didimo, W.; Liotta, G.; and Montecchiani, F.

Paper doi bibtex

*COMPUTER JOURNAL*, 60: 135--142. 2017.Paper doi bibtex

@article{ 11391_1398705, author = {Di Giacomo, Emilio and Didimo, Walter and Liotta, Giuseppe and Montecchiani, Fabrizio}, title = {Area-thickness trade-offs for straight-line drawings of planar graphs}, year = {2017}, journal = {COMPUTER JOURNAL}, volume = {60}, keywords = {Area requirement; Crossing complexity; Graph drawing; H-planarity; Thickness; Computer Science}, url = {http://comjnl.oxfordjournals.org/}, doi = {10.1093/comjnl/bxw075}, pages = {135--142} }

Large graph visualizations using a distributed computing platform.
Arleo, A.; Didimo, W.; Liotta, G.; and Montecchiani, F.

Paper doi bibtex abstract

*INFORMATION SCIENCES*, 381: 124--141. 2017.Paper doi bibtex abstract

@article{ 11391_1396277, author = {Arleo, Alessio and Didimo, Walter and Liotta, Giuseppe and Montecchiani, Fabrizio}, title = {Large graph visualizations using a distributed computing platform}, year = {2017}, journal = {INFORMATION SCIENCES}, volume = {381}, abstract = {Big Data analytics is recognized as one of the major issues in our current information society, and raises several challenges and opportunities in many fields, including economy and finance, e-commerce, public health and administration, national security, and scientific research. The use of visualization techniques to make sense of large volumes of information is an essential ingredient, especially for the analysis of complex interrelated data, which are represented as graphs. The growing availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph visualization algorithms, able to scale to the size of large graphs. We study the problem of designing a distributed visualization algorithm that must be simple to implement and whose computing infrastructure does not require major hardware or software investments. We design, implement, and experiment a force-directed algorithm in Giraph, a popular open source framework for distributed computing, based on a vertex-centric design paradigm. The algorithm is tested both on real and artificial graphs with up to one million edges. The experiments show the scalability and effectiveness of our technique when compared to a centralized implementation of the same force-directed model. Graphs with about one million edges can be drawn in a few minutes, by spending about 1 USD per drawing with a cloud computing infrastructure of Amazon.}, keywords = {Big data; Cloud computing; Distributed algorithms; Force-directed techniques; Giraph; Large graphs; Network visualization; Control and Systems Engineering; Theoretical Computer Science; Software; Computer Science Applications1707 Computer Vision and Pattern Recognition; Information Systems and Management; Artificial Intelligence}, url = {http://www.journals.elsevier.com/information-sciences/}, doi = {10.1016/j.ins.2016.11.012}, pages = {124--141} }

Big Data analytics is recognized as one of the major issues in our current information society, and raises several challenges and opportunities in many fields, including economy and finance, e-commerce, public health and administration, national security, and scientific research. The use of visualization techniques to make sense of large volumes of information is an essential ingredient, especially for the analysis of complex interrelated data, which are represented as graphs. The growing availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph visualization algorithms, able to scale to the size of large graphs. We study the problem of designing a distributed visualization algorithm that must be simple to implement and whose computing infrastructure does not require major hardware or software investments. We design, implement, and experiment a force-directed algorithm in Giraph, a popular open source framework for distributed computing, based on a vertex-centric design paradigm. The algorithm is tested both on real and artificial graphs with up to one million edges. The experiments show the scalability and effectiveness of our technique when compared to a centralized implementation of the same force-directed model. Graphs with about one million edges can be drawn in a few minutes, by spending about 1 USD per drawing with a cloud computing infrastructure of Amazon.

An experimental study on the ply number of straight-line drawings.
De Luca, F.; Di Giacomo, E.; Didimo, W.; Kobourov, S.; and Liotta, G.
2017.

Paper doi bibtex

Paper doi bibtex

@conference{ 11391_1402895, author = {De Luca, Felice and Di Giacomo, Emilio and Didimo, Walter and Kobourov, Stephen and Liotta, Giuseppe}, title = {An experimental study on the ply number of straight-line drawings}, year = {2017}, publisher = {Springer Verlag}, volume = {10167}, booktitle = {WALCOM: Algorithms and Computation, 11th International Conference and Workshops, WALCOM 2017}, keywords = {Theoretical Computer Science; Computer Science (all)}, url = {http://springerlink.com/content/0302-9743/copyright/2005/}, doi = {10.1007/978-3-319-53925-6_11}, pages = {135--148} }

A family of semifields in characteristic 2.
Bartoli, D.; Bierbrauer, J.; Kyureghyan, G.; Giulietti, M.; Marcugini, S.; and Pambianco, F.

Paper doi bibtex abstract

*JOURNAL OF ALGEBRAIC COMBINATORICS*, 45: 455--473. 2017.Paper doi bibtex abstract

@article{ 11391_1393304, author = {Bartoli, Daniele and Bierbrauer, Jürgen and Kyureghyan, Gohar and Giulietti, Massimo and Marcugini, Stefano and Pambianco, Fernanda}, title = {A family of semifields in characteristic 2}, year = {2017}, journal = {JOURNAL OF ALGEBRAIC COMBINATORICS}, volume = {45}, abstract = {We construct and describe the basic properties of a family of semifields in characteristic 2. The construction relies on the properties of projective polynomials over finite fields. We start by associating non-associative products to each such polynomial. The resulting presemifields form the degenerate case of our family. They are isotopic to the Knuth semifields which are quadratic over left and right nuclei. The non-degenerate members of our family display a very different behavior. Their left and right nuclei agree with the center, the middle nucleus is quadratic over the center. None of those semifields is isotopic or Knuth equivalent to a commutative semifield. As a by-product we obtain the complete taxonomy of the characteristic 2 semifields which are quadratic over the middle nucleus, bi-quadratic over the left and right nuclei and not isotopic to twisted fields. This includes determining when two such semifields are isotopic and the order of the autotopism group.}, keywords = {Isotopy, Knuth semifields, Projective polynomials, Semifields, Twisted fields}, url = {http://link.springer.com/article/10.1007%2Fs10801-016-0713-7}, doi = {10.1007/s10801-016-0713-7}, pages = {455--473} }

We construct and describe the basic properties of a family of semifields in characteristic 2. The construction relies on the properties of projective polynomials over finite fields. We start by associating non-associative products to each such polynomial. The resulting presemifields form the degenerate case of our family. They are isotopic to the Knuth semifields which are quadratic over left and right nuclei. The non-degenerate members of our family display a very different behavior. Their left and right nuclei agree with the center, the middle nucleus is quadratic over the center. None of those semifields is isotopic or Knuth equivalent to a commutative semifield. As a by-product we obtain the complete taxonomy of the characteristic 2 semifields which are quadratic over the middle nucleus, bi-quadratic over the left and right nuclei and not isotopic to twisted fields. This includes determining when two such semifields are isotopic and the order of the autotopism group.

Large p -groups of automorphisms of algebraic curves in characteristic p.
Giulietti, M.; and Korchmaros, G.

Paper doi bibtex abstract

*JOURNAL OF ALGEBRA*, 481: 215--249. 2017.Paper doi bibtex abstract

@article{ 11391_1400536, author = {Giulietti, Massimo and Korchmaros, Gabor}, title = {Large p -groups of automorphisms of algebraic curves in characteristic p}, year = {2017}, journal = {JOURNAL OF ALGEBRA}, volume = {481}, abstract = {Let S be a p-subgroup of the K-automorphism group Aut(X) of an algebraic curve X of genus g≥2 and p-rank γ defined over an algebraically closed field K of characteristic p≥3. Nakajima [27] proved that if γ≥2 then |S|≤(g−1). If equality holds, X is a Nakajima extremal curve. We prove that if |S|>(g−1) then one of the following cases occurs. (i) γ=0 and the extension K(X)|K(X)S completely ramifies at a unique place, and does not ramify elsewhere.(ii) |S|=p, and X is an ordinary curve of genus g=p−1.(iii) X is an ordinary, Nakajima extremal curve, and K(X) is an unramified Galois extension of a function field of a curve given in (ii).(iii) X is an ordinary, Nakajima extremal curve, and K(X) is an unramified Galois extension of a function field of a curve given in (ii). There are exactly p−1 subgroups M of S such that K(X)|K(X)M is such a Galois extension. Moreover, if some of them is an abelian extension then S has maximal nilpotency class.The full K-automorphism group of any Nakajima extremal curve is determined, and several infinite families of Nakajima extremal curves are constructed by using their pro-p fundamental groups.}, keywords = {Algebraic curves, Automorphism groups, Positive characteristic}, url = {http://www.sciencedirect.com/science/article/pii/S0021869317301692}, doi = {10.1016/j.jalgebra.2017.02.024}, pages = {215--249} }

Let S be a p-subgroup of the K-automorphism group Aut(X) of an algebraic curve X of genus g≥2 and p-rank γ defined over an algebraically closed field K of characteristic p≥3. Nakajima [27] proved that if γ≥2 then |S|≤(g−1). If equality holds, X is a Nakajima extremal curve. We prove that if |S|>(g−1) then one of the following cases occurs. (i) γ=0 and the extension K(X)|K(X)S completely ramifies at a unique place, and does not ramify elsewhere.(ii) |S|=p, and X is an ordinary curve of genus g=p−1.(iii) X is an ordinary, Nakajima extremal curve, and K(X) is an unramified Galois extension of a function field of a curve given in (ii).(iii) X is an ordinary, Nakajima extremal curve, and K(X) is an unramified Galois extension of a function field of a curve given in (ii). There are exactly p−1 subgroups M of S such that K(X)|K(X)M is such a Galois extension. Moreover, if some of them is an abelian extension then S has maximal nilpotency class.The full K-automorphism group of any Nakajima extremal curve is determined, and several infinite families of Nakajima extremal curves are constructed by using their pro-p fundamental groups.

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

Maximum scattered linear sets and complete caps in Galois spaces.
Bartoli, D.; Giulietti, M.; Marino, G.; and Polverino, O.

Paper doi bibtex abstract

*COMBINATORICA*, . 2017.Paper doi bibtex abstract

@article{ 11391_1400538, author = {Bartoli, Daniele and Giulietti, Massimo and Marino, Giuseppe and Polverino, Olga}, title = {Maximum scattered linear sets and complete caps in Galois spaces}, year = {2017}, journal = {COMBINATORICA}, abstract = {Explicit constructions of inFInite families of scattered Fq-linear sets in PG(r-1, qt) of maximal rank rt/2, for t ≥ 4 even, are provided. When q = 2, these linear sets correspond to complete caps in AG(r,2t) FIxed by a translation group of size 2rt/2. The doubling construction applied to such caps gives complete caps in AG(r+1, 2t) of size 2rt/2+1. For Galois spaces of even dimension greater than 2 and even square order, this solves the long-standing problem of establishing whether the theoretical lower bound for the size of a complete cap is substantially sharp.}, keywords = {maximum scattered linear sets, complete caps, Galois spaces}, url = {https://link.springer.com/article/10.1007%2Fs00493-016-3531-6}, doi = {10.1007/s00493-016-3531-6}, }

Explicit constructions of inFInite families of scattered Fq-linear sets in PG(r-1, qt) of maximal rank rt/2, for t ≥ 4 even, are provided. When q = 2, these linear sets correspond to complete caps in AG(r,2t) FIxed by a translation group of size 2rt/2. The doubling construction applied to such caps gives complete caps in AG(r+1, 2t) of size 2rt/2+1. For Galois spaces of even dimension greater than 2 and even square order, this solves the long-standing problem of establishing whether the theoretical lower bound for the size of a complete cap is substantially sharp.

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*, 1--11. 2017.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 = {2017}, journal = {DESIGNS, CODES AND CRYPTOGRAPHY}, 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 = {1--11} }

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 completeness of plane cubic curves over finite fields.
Bartoli, D.; Marcugini, S.; and Pambianco, F.

Paper doi bibtex abstract

*DESIGNS, CODES AND CRYPTOGRAPHY*, 83: 233--267. 2017.Paper doi bibtex abstract

@article{ 11391_1382004, author = {Bartoli, Daniele and Marcugini, Stefano and Pambianco, Fernanda}, title = {On the completeness of plane cubic curves over finite fields}, year = {2017}, journal = {DESIGNS, CODES AND CRYPTOGRAPHY}, volume = {83}, abstract = {We address the problem of determining when a plane algebraic cubic curve is complete as an (n, 3)-arc in (Formula presented.). Theoretical results are given for absolutely irreducible singular cubic curves, while computer based results are given for (Formula presented.).}, keywords = {(n, 3)-arcs, Near-MDS codes, Plane algebraic cubic curves}, url = {http://www.springerlink.com/content/0925-1022}, doi = {10.1007/s10623-016-0215-6}, pages = {233--267} }

We address the problem of determining when a plane algebraic cubic curve is complete as an (n, 3)-arc in (Formula presented.). Theoretical results are given for absolutely irreducible singular cubic curves, while computer based results are given for (Formula presented.).

Conjectural upper bounds on the smallest size of a complete cap in PG(N, q), N ≥ 3.
Daniele, B.; Davydov, A. A.; Giorgio, F.; Stefano, M.; and Fernanda, P.

doi bibtex abstract

*ELECTRONIC NOTES IN DISCRETE MATHEMATICS*, 57: 15--20. 2017.doi bibtex abstract

@article{ 11391_1398163, author = {Daniele, Bartoli and Davydov, Alexander A. and Giorgio, Faina and Stefano, Marcugini and Fernanda, Pambianco}, title = {Conjectural upper bounds on the smallest size of a complete cap in PG(N, q), N ≥ 3}, year = {2017}, journal = {ELECTRONIC NOTES IN DISCRETE MATHEMATICS}, volume = {57}, abstract = {In this work we summarize some recent results to be included in a forthcoming paper [2]. In the projective space PG(N, q) over the Galois field of order q, N ≥ 3, an iterative step-by-step construction of complete caps by adding a new point at every step is considered. It is proved that uncovered points are evenly placed in the space. A natural conjecture on an estimate of the number of new covered points at every step is done. For a part of the iterative process, this estimate is proved rigorously. Under the mentioned conjecture, new upper bounds on the smallest size t2 (N, q) of a complete cap in PG(N, q) are obtained. The effectiveness of the bounds is illustrated by comparison with complete caps sizes obtained by computer searches. The reasonableness of the conjecture is discussed.}, keywords = {Projective spaces, small complete caps, upper bounds}, doi = {10.1016/j.endm.2017.02.004}, pages = {15--20} }

In this work we summarize some recent results to be included in a forthcoming paper [2]. In the projective space PG(N, q) over the Galois field of order q, N ≥ 3, an iterative step-by-step construction of complete caps by adding a new point at every step is considered. It is proved that uncovered points are evenly placed in the space. A natural conjecture on an estimate of the number of new covered points at every step is done. For a part of the iterative process, this estimate is proved rigorously. Under the mentioned conjecture, new upper bounds on the smallest size t2 (N, q) of a complete cap in PG(N, q) are obtained. The effectiveness of the bounds is illustrated by comparison with complete caps sizes obtained by computer searches. The reasonableness of the conjecture is discussed.

Upper bounds on the smallest size of a complete cap in PG(3, q) and PG(4, q).
Daniele, B.; Davydov, A. A.; Kreshchuk, A. A.; Stefano, M.; and Fernanda, P.

doi bibtex abstract

*ELECTRONIC NOTES IN DISCRETE MATHEMATICS*, 57: 21--26. 2017.doi bibtex abstract

@article{ 11391_1398165, author = {Daniele, Bartoli and Davydov, Alexander A. and Kreshchuk, Alexey A. and Stefano, Marcugini and Fernanda, Pambianco}, title = {Upper bounds on the smallest size of a complete cap in PG(3, q) and PG(4, q)}, year = {2017}, journal = {ELECTRONIC NOTES IN DISCRETE MATHEMATICS}, volume = {57}, abstract = {In this work we summarize some recent results to be included in a forthcoming paper [2]. We present and analyze computational results concerning small complete caps in the projective spaces PG(N, q) of dimension N = 3 and N = 4 over the finite field of order q. The results have been obtained using randomized greedy algorithms and the algorithm with fixed order of points (FOP). The new complete caps are the smallest known. Based on them, we obtained new upper bounds on the minimum size t2 (N, q) of a complete cap in PG(N, q), N = 3, 4. Our investigations and results allow to conjecture that these bounds hold for all q.}, keywords = {Projective spaces, small complete caps, upper bounds.}, doi = {10.1016/j.endm.2017.02.005}, pages = {21--26} }

In this work we summarize some recent results to be included in a forthcoming paper [2]. We present and analyze computational results concerning small complete caps in the projective spaces PG(N, q) of dimension N = 3 and N = 4 over the finite field of order q. The results have been obtained using randomized greedy algorithms and the algorithm with fixed order of points (FOP). The new complete caps are the smallest known. Based on them, we obtained new upper bounds on the minimum size t2 (N, q) of a complete cap in PG(N, q), N = 3, 4. Our investigations and results allow to conjecture that these bounds hold for all q.

Status, discendenza ed affettività nella filiazione omogenitoriale.
Stefania, S.

bibtex abstract

*FAMIGLIA E DIRITTO*, 2017: 83--94. 2017.bibtex abstract

@article{ 11391_1397441, author = {Stefania, Stefanelli}, title = {Status, discendenza ed affettività nella filiazione omogenitoriale}, year = {2017}, journal = {FAMIGLIA E DIRITTO}, volume = {2017}, abstract = {Il diritto del minore ad uno status coerente con la consolidata affettività fonda, sempre che sia provata la realizzazione del superiore interesse del fanciullo, la sentenza che ne pronuncia l’adozione in casi partico-lari da parte del convivente del genitore, al pari di quella che riconosce piena efficacia all’atto di nascita formato all’estero con l’indicazione della filiazione da due madri, sul presupposto per cui nell’ordinamento vigente il concetto di discendenza non si riferisce soltanto ad un legame genetico, ma assume una conno-tazione giuridico-sociale, che conferisce dignità anche ad un legame di genitorialità legale fondato sull’affettività.}, keywords = {Adozione coparentale; riconoscimento atto di nascita estero da due genitori dello stesso sesso; tutela della consolidata affettività; tutela dell'identità genetica; diritto a formare una famiglia}, pages = {83--94} }

Il diritto del minore ad uno status coerente con la consolidata affettività fonda, sempre che sia provata la realizzazione del superiore interesse del fanciullo, la sentenza che ne pronuncia l’adozione in casi partico-lari da parte del convivente del genitore, al pari di quella che riconosce piena efficacia all’atto di nascita formato all’estero con l’indicazione della filiazione da due madri, sul presupposto per cui nell’ordinamento vigente il concetto di discendenza non si riferisce soltanto ad un legame genetico, ma assume una conno-tazione giuridico-sociale, che conferisce dignità anche ad un legame di genitorialità legale fondato sull’affettività.

Anonimato materno e genitorialità dopo Cass., Sez. Un., n. 1946 del 2017.
Stefania, S.

bibtex

*RIVISTA TRIMESTRALE DI DIRITTO E PROCEDURA CIVILE*, 2017: 1041--1067. 2017.bibtex

@article{ 11391_1417279, author = {Stefania, Stefanelli}, title = {Anonimato materno e genitorialità dopo Cass., Sez. Un., n. 1946 del 2017}, year = {2017}, journal = {RIVISTA TRIMESTRALE DI DIRITTO E PROCEDURA CIVILE}, volume = {2017}, keywords = {Parto anonimo, accertamento della maternità, diritto a conoscere le proprie origini}, pages = {1041--1067} }

La procreazione con donazione di gameti.
Stefanelli, S.
Volume 2 . pages 2139--2164. ESI, Napoli, 2017.

bibtex buy

bibtex buy

@inbook{ 11391_1417351, author = {Stefanelli, Stefania}, title = {La procreazione con donazione di gameti}, year = {2017}, publisher = {ESI}, address = {Napoli}, volume = {2}, booktitle = {Scritti in onore di Vito Rizzo}, keywords = {Procreazione medicalmente assistita}, pages = {2139--2164} }

2016
(14)

A Simulation Framework for Efficient Resource Management on Hybrid Systems.
Tasso, S.; Gervasi, O.; Vella, F.; and Cuzzocrea, A.
2016.

Paper doi bibtex abstract

Paper doi bibtex abstract

@conference{ 11391_1368248, author = {Tasso, Sergio and Gervasi, Osvaldo and Vella, Flavio and Cuzzocrea, Alfredo}, title = {A Simulation Framework for Efficient Resource Management on Hybrid Systems}, year = {2016}, publisher = {IEEE Computer Society, Conference Publishing System}, booktitle = {2015 IEEE 18th International Conference on Computational Science and Engineering}, abstract = {In this paper we present the results obtained designing and implementing a simulator for a hybrid system (named H-system), to investigate the effects on the system load and throughput of a heterogeneous system compared toa conventional one. In fact, the recent advances on Graphical Processing Units (GPUs) and the introduction of a standard language such as OpenCL, which allows to write applications to be executed both on the multicore (CPU) and on the manycore (GPU) architectures, made it possible to use such devices in cooperation with the CPU to execute jobs both on GPUs and CPUs, increasing the global H-system performances. In the present scenario, however the scheduling in a H-system is not well addressed and such type of investigations are very important. In fact, the efficient scheduling of OpenCl jobs in conjunction with ordinary job may dramatically change the future scenario of computing. Our work shows clearly that adopting a proper hardware and software configuration of the H-system (in particular the GPUs/CPUs ratio), increases the computing performances, in terms of mean response time and of the workload balance of the system.}, keywords = {Simulator, GPU, Hybrid Systems, Heterogeneous Computing}, url = {http://conferences.computer.org/cse/2015/papers/8297a216.pdf}, doi = {10.1109/CSE.2015.51}, pages = {216--223} }

In this paper we present the results obtained designing and implementing a simulator for a hybrid system (named H-system), to investigate the effects on the system load and throughput of a heterogeneous system compared toa conventional one. In fact, the recent advances on Graphical Processing Units (GPUs) and the introduction of a standard language such as OpenCL, which allows to write applications to be executed both on the multicore (CPU) and on the manycore (GPU) architectures, made it possible to use such devices in cooperation with the CPU to execute jobs both on GPUs and CPUs, increasing the global H-system performances. In the present scenario, however the scheduling in a H-system is not well addressed and such type of investigations are very important. In fact, the efficient scheduling of OpenCl jobs in conjunction with ordinary job may dramatically change the future scenario of computing. Our work shows clearly that adopting a proper hardware and software configuration of the H-system (in particular the GPUs/CPUs ratio), increases the computing performances, in terms of mean response time and of the workload balance of the system.

A DBMs-based system for integrating grids and clouds: Anatomy, models, functionalities.
Mariotti, M.; Gervasi, O.; Vella, F.; Costantini, A.; and Cuzzocrea, A.
2016.

Paper doi bibtex

Paper doi bibtex

@conference{ 11391_1388625, author = {Mariotti, Mirko and Gervasi, Osvaldo and Vella, Flavio and Costantini, Alessandro and Cuzzocrea, Alfredo}, title = {A DBMs-based system for integrating grids and clouds: Anatomy, models, functionalities}, year = {2016}, publisher = {Association for Computing Machinery}, volume = {22-23-}, booktitle = {ACM International Conference Proceeding Series}, keywords = {Cloud computing; Distributed environments; GPGPU Computing; Grid computing; Heterogeneous environments; Multi/Many Core Computing; Resource integration; Human-Computer Interaction; Computer Networks and Communications; 1707; Software}, url = {http://portal.acm.org/}, doi = {10.1145/2896387.2900327}, pages = {1--8} }

Computational Science and Its Applications – ICCSA 2016 - 16th International Conference - Beijing, China, July 4–7, 2016 - Proceedings, Part I.
Gervasi, O.; Murgante, B.; Misra, S.; C, R. A. M. A.; Torre C., M.; Taniar, D.; Apduhan B., O.; Stankova, E.; and Wang, S.
2016.

Paper doi bibtex abstract

Paper doi bibtex abstract

@misc{ 11391_1391650, author = {Gervasi, O. and Murgante, B. and Misra, S. and C, Rocha A. M. A. and Torre C., M. and Taniar, D. and Apduhan B., O. and Stankova, E. and Wang, S.}, title = {Computational Science and Its Applications – ICCSA 2016 - 16th International Conference - Beijing, China, July 4–7, 2016 - Proceedings, Part I}, year = {2016}, publisher = {Springer International Publishing}, volume = {9786}, abstract = {The five-volume set LNCS 9786-9790 constitutes the refereed proceedingsof the 16th International Conference on Computational Science and ItsApplications, ICCSA 2016, held in Beijing, China, in July 2016. The 239 revised full papers and 14 short papers presented at 33 workshops were carefully reviewed and selected from 849 submissions. They are organized in five thematical tracks: computational methods, algorithms and scientific applications; high performance computing and networks; geometric modeling, graphics and visualization; advanced and emerging applications; and information systems and technologies.}, url = {http://www.springer.com/it/book/9783319420844}, doi = {10.1007/978-3-319-42085-1}, pages = {1--650} }

The five-volume set LNCS 9786-9790 constitutes the refereed proceedingsof the 16th International Conference on Computational Science and ItsApplications, ICCSA 2016, held in Beijing, China, in July 2016. The 239 revised full papers and 14 short papers presented at 33 workshops were carefully reviewed and selected from 849 submissions. They are organized in five thematical tracks: computational methods, algorithms and scientific applications; high performance computing and networks; geometric modeling, graphics and visualization; advanced and emerging applications; and information systems and technologies.

Le Regioni nel Trattato di Lisbona: premesse per una nuova governance?.
Favilli, C.; Paterniti, F.; Odone, C.; Ponti, B.; Doria, A. L.; Bartoli, M.; Berionni, L.; Balsamo, M.; and Paoletti, D.
Maggioli Editore, Santarcangelo di Romagna (RN), 2016.

bibtex buy

bibtex buy

@inbook{ 11391_1411623, author = {Favilli, Chiara and Paterniti, Francesco and Odone, Cecila and Ponti, Benedetto and Doria, Anna Lisa and Bartoli, Massimo and Berionni, Laura and Balsamo, Marina and Paoletti, Diletta}, title = {Le Regioni nel Trattato di Lisbona: premesse per una nuova governance?}, year = {2016}, publisher = {Maggioli Editore}, address = {Santarcangelo di Romagna (RN)}, booktitle = {Regioni strumento di governane democratica: una sfida europea}, keywords = {regioni, Unione europea, trattato di Lisbona, multi-leval governance} }

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.

La trasparenza ed i suoi strumenti: dalla pubblicità all'accesso generalizzato.
Ponti, B.
Volume 94 . pages 25--68. Maggioli, Santarcangelo di Romagna, 2016.

bibtex abstract buy

bibtex abstract buy

@inbook{ 11391_1412865, author = {Ponti, Benedetto}, title = {La trasparenza ed i suoi strumenti: dalla pubblicità all'accesso generalizzato.}, 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 = {Il Saggio, ricostruisce in modo articolato l'introduzione dell'accesso civico generalizzato nel contesto di un oordinamento caratterizzato dagli obblighi di pubblicazione in funzione di trasparenza, e la sua disciplina giuridica, come delineata dal d.lgs. 97/2016..}, keywords = {trasparenza amministrativa, open data, diritto di accesso, FOIA,}, pages = {25--68} }

Il Saggio, ricostruisce in modo articolato l'introduzione dell'accesso civico generalizzato nel contesto di un oordinamento caratterizzato dagli obblighi di pubblicazione in funzione di trasparenza, e la sua disciplina giuridica, come delineata dal d.lgs. 97/2016..

Finitely maxitive T-conditional possibility theory: Coherence and extension.
Coletti, G.; and Petturiti, D.

doi bibtex abstract

*INTERNATIONAL JOURNAL OF APPROXIMATE REASONING*, 71: 64--88. 2016.doi bibtex abstract

@article{ 11391_1384224, author = {Coletti, Giulianella and Petturiti, Davide}, title = {Finitely maxitive T-conditional possibility theory: Coherence and extension}, year = {2016}, journal = {INTERNATIONAL JOURNAL OF APPROXIMATE REASONING}, volume = {71}, abstract = {Starting from the axiomatic definition of finitely maxitive T-conditional possibility (where T is a continuous triangular norm), the paper aims at a comprehensive and self-contained treatment of coherence and extension of a possibilistic assessment defined on an arbitrary set of conditional events. Coherence (or consistence with a T-conditional possibility) is characterized either in terms of existence of a linearly ordered class of finitely maxitive possibility measures (T-nested class) agreeing with the assessment, or in terms of solvability of a finite sequence of nonlinear systems for every finite subfamily of conditional events. Coherence reveals to be a necessary and sufficient condition for the extendibility of an assessment to any superset of conditional events and, in the case of T equal to the minimum or a strict t-norm, the set of coherent values for the possibility of a new conditional event can be computed solving two optimization problems over a finite sequence of nonlinear systems for every finite subfamily of conditional events}, keywords = {Coherence, Extension, Finitely maxitive measure, T-conditional possibility, Artificial Intelligence, Software, Theoretical Computer Science, Applied Mathematics}, doi = {10.1016/j.ijar.2016.01.006}, pages = {64--88} }

Starting from the axiomatic definition of finitely maxitive T-conditional possibility (where T is a continuous triangular norm), the paper aims at a comprehensive and self-contained treatment of coherence and extension of a possibilistic assessment defined on an arbitrary set of conditional events. Coherence (or consistence with a T-conditional possibility) is characterized either in terms of existence of a linearly ordered class of finitely maxitive possibility measures (T-nested class) agreeing with the assessment, or in terms of solvability of a finite sequence of nonlinear systems for every finite subfamily of conditional events. Coherence reveals to be a necessary and sufficient condition for the extendibility of an assessment to any superset of conditional events and, in the case of T equal to the minimum or a strict t-norm, the set of coherent values for the possibility of a new conditional event can be computed solving two optimization problems over a finite sequence of nonlinear systems for every finite subfamily of conditional events

Conditional belief functions as lower envelopes of conditional probabilities in a finite setting.
Coletti, G.; Petturiti, D.; and Vantaggi, B.

Paper doi bibtex abstract

*INFORMATION SCIENCES*, 339: 64--84. 2016.Paper doi bibtex abstract

@article{ 11391_1384226, author = {Coletti, Giulianella and Petturiti, Davide and Vantaggi, Barbara}, title = {Conditional belief functions as lower envelopes of conditional probabilities in a finite setting}, year = {2016}, journal = {INFORMATION SCIENCES}, volume = {339}, abstract = {The aim is to provide a characterization of full conditional measures on a finite Boolean algebra, obtained as lower envelope of the extensions of a full conditional probability defined on another finite Boolean algebra. Such conditional measures are conditional belief functions defined by means of a generalized Bayesian conditioning rule relying on a linearly ordered class of belief functions. This notion of Bayesian conditioning for belief functions is compared with other well-known conditioning rules by looking for those conditional measures that can be seen as lower conditional probabilities.}, keywords = {Bayesian updating, Belief function, Conditional probability, Extensions, Lower envelope}, url = {http://www.journals.elsevier.com/information-sciences/}, doi = {10.1016/j.ins.2015.12.020}, pages = {64--84} }

The aim is to provide a characterization of full conditional measures on a finite Boolean algebra, obtained as lower envelope of the extensions of a full conditional probability defined on another finite Boolean algebra. Such conditional measures are conditional belief functions defined by means of a generalized Bayesian conditioning rule relying on a linearly ordered class of belief functions. This notion of Bayesian conditioning for belief functions is compared with other well-known conditioning rules by looking for those conditional measures that can be seen as lower conditional probabilities.

L-visibility drawings of IC-planar graphs.
Liotta, G.; and Montecchiani, F.

doi bibtex abstract

*INFORMATION PROCESSING LETTERS*, 116: 217--222. 2016.doi bibtex abstract

@article{ 11391_1386147, author = {Liotta, Giuseppe and Montecchiani, Fabrizio}, title = {L-visibility drawings of IC-planar graphs}, year = {2016}, journal = {INFORMATION PROCESSING LETTERS}, volume = {116}, abstract = {An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is of the form of s suitably oriented "L", and every edge is either a horizontal or vertical segment. As a byproduct of our drawing technique, we prove that every IC-plane graph has a RAC drawing in quadratic area with at most two bends per edge.}, keywords = {Computational Geometry; IC-planar graphs; Visibility representations; Information Systems; Computer Science Applications1707 Computer Vision and Pattern Recognition; Signal Processing; Theoretical Computer Science}, doi = {10.1016/j.ipl.2015.11.011}, pages = {217--222} }

An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. We show that every IC-plane graph has a visibility drawing where every vertex is of the form of s suitably oriented "L", and every edge is either a horizontal or vertical segment. As a byproduct of our drawing technique, we prove that every IC-plane graph has a RAC drawing in quadratic area with at most two bends per edge.

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.
2016.

Paper doi bibtex

Paper doi bibtex

@conference{ 11391_1398920, 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 = {2016}, publisher = {Springer Verlag}, volume = {9801}, booktitle = {Graph Drawing and Network Visualization - 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers}, keywords = {Theoretical Computer Science; Computer Science (all)}, url = {https://link.springer.com/chapter/10.1007%2F978-3-319-50106-2_20}, doi = {10.1007/978-3-319-50106-2_20}, pages = {251--265} }

Maximal curves from subcovers of the GK-curve.
Giulietti, M.; Quoos, L.; and Zini, G.

Paper doi bibtex abstract

*JOURNAL OF PURE AND APPLIED ALGEBRA*, 220: 3372--3383. 2016.Paper doi bibtex abstract

@article{ 11391_1393330, author = {Giulietti, Massimo and Quoos, Luciane and Zini, Giovanni}, title = {Maximal curves from subcovers of the GK-curve}, year = {2016}, journal = {JOURNAL OF PURE AND APPLIED ALGEBRA}, volume = {220}, abstract = {For every q=n3 with n a prime power greater than 2, the GK-curve is an Fq2-maximal curve that is not Fq2-covered by the Hermitian curve. In this paper some Galois subcovers of the GK curve are investigated. Infinitely many examples of maximal curves that cannot be Galois covered by the Hermitian curve are obtained. We also describe explicit equations for some families of quotient curves of the GK-curve. In several cases, such curves provide new values in the spectrum of genera of Fq2-maximal curves.}, keywords = {maximal curves, quotient curves, GK-curve}, url = {http://www.sciencedirect.com/science/article/pii/S0022404916300123}, doi = {10.1016/j.jpaa.2016.04.004}, pages = {3372--3383} }

For every q=n3 with n a prime power greater than 2, the GK-curve is an Fq2-maximal curve that is not Fq2-covered by the Hermitian curve. In this paper some Galois subcovers of the GK curve are investigated. Infinitely many examples of maximal curves that cannot be Galois covered by the Hermitian curve are obtained. We also describe explicit equations for some families of quotient curves of the GK-curve. In several cases, such curves provide new values in the spectrum of genera of Fq2-maximal curves.

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.

Accertamento della maternità nella gestazione per altri.
Stefania, S.

bibtex abstract

*BIOLAW JOURNAL. RIVISTA DI BIODIRITTO*, 7--37. 2016.bibtex abstract

@article{ 11391_1385761, author = {Stefania, Stefanelli}, title = {Accertamento della maternità nella gestazione per altri}, year = {2016}, journal = {BIOLAW JOURNAL. RIVISTA DI BIODIRITTO}, abstract = {The paper analyses the different legal regime concerning maternity ascer-tainment, as a function of both natural conception and the use of medical technolo-gies, as well as in relation to the genetic ties between the commissioning mother and the child, ties which are absent if the egg has been provided by a donor who is nei-ther the intended mother nor the surrogate. This research points out that the recog-nition of the intended parent as the legitimate parent can be contested by the son or daughter, based on the biological truth of generation and by means of DNA testing. The best interest of the child, however, is a key argument in favor of the preservation of de facto family ties.}, pages = {7--37} }

The paper analyses the different legal regime concerning maternity ascer-tainment, as a function of both natural conception and the use of medical technolo-gies, as well as in relation to the genetic ties between the commissioning mother and the child, ties which are absent if the egg has been provided by a donor who is nei-ther the intended mother nor the surrogate. This research points out that the recog-nition of the intended parent as the legitimate parent can be contested by the son or daughter, based on the biological truth of generation and by means of DNA testing. The best interest of the child, however, is a key argument in favor of the preservation of de facto family ties.

Adottabilità e mantenimento dei rapporti con la famiglia biologica.
Stefania, S.
pages 739--764. CEDAM, Padova, 2016.

bibtex buy

bibtex buy

@inbook{ 11391_1378367, author = {Stefania, Stefanelli}, title = {Adottabilità e mantenimento dei rapporti con la famiglia biologica}, year = {2016}, publisher = {CEDAM}, address = {Padova}, booktitle = {CEDU E ORDINAMENTO ITALIANO. LA GIURISPRUDENZA DELLA CORTE EUROPEA DEI DIRITTI DELL’UOMO E L’IMPATTO NELL’ORDINAMENTO INTERNO}, keywords = {Tutela dell'affettività; vita privata e familiare; adozione in casi particolari}, pages = {739--764} }

2015
(3)

Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs.
Angelini, P.; Binucci, C.; Da Lozzo, G.; Didimo, W.; Grilli, L.; Montecchiani, F.; Patrignani, M.; and Tollis, I.

Paper doi bibtex abstract

*COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS*, 50: 34--48. 2015.Paper doi bibtex abstract

@article{ 11391_1361678, author = {Angelini, Patrizio and Binucci, Carla and Da Lozzo, Giordano and Didimo, Walter and Grilli, Luca and Montecchiani, Fabrizio and Patrignani, Maurizio and Tollis, Ioannis}, title = {Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs}, year = {2015}, journal = {COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS}, volume = {50}, abstract = {We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Γ of G in the plane such that the edges of S are not crossed in Γ by any edge of G? We give positive and negative results for different kinds of connected spanning subgraphs S of G. Moreover, in order to enlarge the subset of instances that admit a solution, we consider the possibility of bending the edges of G not in S; in this setting we discuss different trade-offs between the number of bends and the required drawing area.}, keywords = {Graph drawing,Graph planarity,Algorithms,Area requirement,Crossing complexity}, url = {http://www.sciencedirect.com/science/article/pii/S0925772115000632}, doi = {10.1016/j.comgeo.2015.07.002}, pages = {34--48} }

We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Γ of G in the plane such that the edges of S are not crossed in Γ by any edge of G? We give positive and negative results for different kinds of connected spanning subgraphs S of G. Moreover, in order to enlarge the subset of instances that admit a solution, we consider the possibility of bending the edges of G not in S; in this setting we discuss different trade-offs between the number of bends and the required drawing area.

Nonparametric Estimation of Energy and Commodity Price Processes.
Figà-talamanca, G.; and Roncoroni, A.
John Wiley and Sons, 2015.

bibtex buy

bibtex buy

@inbook{ 11391_1156578, author = {Figà-talamanca, G. and Roncoroni, A.}, title = {Nonparametric Estimation of Energy and Commodity Price Processes}, year = {2015}, publisher = {John Wiley and Sons}, booktitle = {Handbook of Multi-Commodity Markets and Products: Structuring, Trading and Risk Management} }

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.

2014
(4)

Drawing Simultaneously Embedded Graphs with Few Bends.
Luca, G.; Seok-hee, H.; Jan, K.; and Ignaz, R.
2014.

Paper doi bibtex abstract

Paper doi bibtex abstract

@conference{ 11391_1326706, author = {Luca, Grilli and Seok-hee, Hong and Jan, Kratochvíl and Ignaz, Rutter}, title = {Drawing Simultaneously Embedded Graphs with Few Bends}, year = {2014}, publisher = {Springer-Verlag Berlin Heidelberg}, volume = {8871}, booktitle = {Graph Drawing}, abstract = {We study the problem of drawing simultaneously embedded graphs with few bends. We show that for any simultaneous embedding with fixed edges (Sefe) of two graphs, there exists a corresponding drawing realizing this embedding such that common edges are drawn as straight-line segments and each exclusive edge has a constant number of bends. If the common graph is biconnected and induced, a straight-line drawing exists. This yields the first efficient testing algorithm for simultaneous geometric embedding (Sge) for a non-trivial class of graphs.}, url = {http://link.springer.com/chapter/10.1007%2F978-3-662-45803-7_4}, doi = {10.1007/978-3-662-45803-7_4}, pages = {40--51} }

We study the problem of drawing simultaneously embedded graphs with few bends. We show that for any simultaneous embedding with fixed edges (Sefe) of two graphs, there exists a corresponding drawing realizing this embedding such that common edges are drawn as straight-line segments and each exclusive edge has a constant number of bends. If the common graph is biconnected and induced, a straight-line drawing exists. This yields the first efficient testing algorithm for simultaneous geometric embedding (Sge) for a non-trivial class of graphs.

On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar GraphsGraph Drawing.
Bekos, M. A.; Sabine, C.; Luca, G.; Seok-hee, H.; and Michael, K.
2014.

Paper doi bibtex abstract

Paper doi bibtex abstract

@conference{ 11391_1326707, author = {Bekos, Michael A. and Sabine, Cornelsen and Luca, Grilli and Seok-hee, Hong and Michael, Kaufmann}, title = {On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar GraphsGraph Drawing}, year = {2014}, publisher = {Springer-Verlag Berlin Heidelberg}, volume = {8871}, booktitle = {Graph Drawing}, 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 polynomial-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-hard, for the case where the rotation system (i.e., the cyclic order of the edges around each vertex) is given.}, url = {http://link.springer.com/chapter/10.1007%2F978-3-662-45803-7_17}, doi = {10.1007/978-3-662-45803-7_17}, pages = {198--209} }

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 polynomial-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-hard, for the case where the rotation system (i.e., the cyclic order of the edges around each vertex) is given.

A Statistical Test for the Heston Model.
Figà-talamanca, G.
pages 105--108. Springer-Verlag, 2014.

bibtex buy

bibtex buy

@inbook{ 11391_1229708, author = {Figà-talamanca, Gianna}, title = {A Statistical Test for the Heston Model}, year = {2014}, publisher = {Springer-Verlag}, booktitle = {Mathematical and Statistical Methods for Actuarial Sciences and Finance}, pages = {105--108} }

Smart Fuzzy Weighted Averages of Information Elicited through Fuzzy Numbers.
Andrea, C.; and Gianna Figa' Talamanca, undefined
2014.

doi bibtex abstract

doi bibtex abstract

@conference{ 11391_1229709, author = {Andrea, Capotorti and Gianna Figa' Talamanca, }, title = {Smart Fuzzy Weighted Averages of Information Elicited through Fuzzy Numbers}, year = {2014}, publisher = {Springer}, volume = {442}, booktitle = {Information Processing and Management of Uncertainty in Knowledge-Based Systems, Pt 1}, abstract = {We illustrate a preliminary proposal of weighted fuzzy averages between two membership functions. Conflicts, as well as agreements, between the different sources of information in the two new operators are endogenously embedded inside the average weights. The proposal is motivated by the practical problem of assessing the fuzzy volatility parameter in the Black and Scholes environment via alternative estimators.}, keywords = {merging operators, aggregation, fuzzy sets}, doi = {10.1007/978-3-319-08795-5_48}, pages = {466--475} }

We illustrate a preliminary proposal of weighted fuzzy averages between two membership functions. Conflicts, as well as agreements, between the different sources of information in the two new operators are endogenously embedded inside the average weights. The proposal is motivated by the practical problem of assessing the fuzzy volatility parameter in the Black and Scholes environment via alternative estimators.

# 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>
```