Publications

ERROR

Authors: Agosti, M; Coppotelli, T; Ferro, N; Pretto, L; Dept Informat Engn; Dept Informat Engn; The increasing number of users and the diffusion of Digital Libraries (DLs) has increased the demand for newer and improved systems to give better assistance to the user during the search of resources in collections managed by Digital Library Systems (DLSs). In this perspective, the annotations made on documents offer an interesting possibility for improving both the user experience of the DLS and the retrieval performance of the system itself. However, while different approaches based on annotations have been proposed, they still lack a full experimental evaluation, mainly because an experimental collection with annotation is missing. Therefore, this paper addresses the problem of setting an adequate experimental test-bed for DL search algorithms which exploit annotations, and discusses a flexible strategy for creating test collections with annotated documents. © Springer-Verlag Berlin Heidelberg 2007. Agosti; Coppotelli; Ferro; Pretto

Journal: English

Published: Agosti M.; Coppotelli T.; Ferro N.; Pretto L.

DOI: WOS:000252143400023

Abstract ▼

Pages: 159-Annotations and digital libraries: Designing adequate test-beds

CORRECT

Authors: Agosti, M; Coppotelli, T; Ferro, N; Pretto, L; Dept Informat Engn; Dept Informat Engn; This study addresses the lack of an adequate test collection that can be used to evaluate search systems that exploit annotations to increase the retrieval effectiveness of an information search tool. In particular, a new approach is proposed that enables the automatic creation of multiple test collections without human effort. This approach takes advantage of the human relevance assessments contained in an already existing test collection and it introduces content-level annotations in that collection. © Springer-Verlag Berlin Heidelberg 2007. Agosti; Coppotelli; Ferro; Pretto

Journal: English

Published: title_year

DOI: WOS:000252882500016

Abstract ▼

Pages: 176-An approach for the construction of an experimental test collection to evaluate search systems that exploit annotations

ERROR

Authors: This paper presents the theoretical formulation and the experimental validation of an innovative algorithm for the kinematic inversion of redundant free-flying space robotic systems, which causes minimum attitude disturbances on the spacecrafts on which they are mounted. The subject is of particular interest because robotic systems used in space need to limit induced spacecraft attitude disturbances while performing manipulator manoeuvres in order to avoid communications problems. Reduced spacecraft attitude disturbances will result in a lower fuel consumption, and therefore in an increase of the system useful life. The proposed algorithm is based on the use of a weighted pseudo-inversion of the Jacobian matrix of the robot and is aimed at minimizing the torque transferred to the spacecraft due to the robotic arm movement during continuous end-effector path tracking. The algorithm has been tested using a 3D free-flying robot previously tested in an ESA Parabolic Flight Campaign. In this test campaign the 3D robot has been converted in a 2D robot taking advantage of its modular structure, and it has been suspended by means of air-bearings on a granite plane. In this way it is possible to perform planar tests, which have the advantage that it is possible to simulate a microgravity environment without time constraints. The base of the robot has been fixed on ground by means of a custom designed dynamometer, which measures the forces and torques transferred to ground to be minimized. The forces and torques transferred to ground using the proposed kinematic inversion method have been compared with those relevant to a classical kinematic inversion which minimizes only the joints velocities. The experimental results validated the proposed algorithm and confirmed its good performance. Cocuzza; Pretto; Menon; Angrilli

Journal: 2007

Published: Cocuzza S.; Pretto I.; Menon C.; Angrilli F.

DOI: 352573454

Abstract ▼

MATCH

Authors: This paper presents the theoretical formulation and the experimental validation of an innovative algorithm for the kinematic inversion of redundant space robotic systems aimed at minimizing the torque transferred to the spacecraft due to the robotic arm movement. The differential kinematics has been formulated at the acceleration level and an additional constraint has been imposed in order to minimize the torque transferred to the spacecraft center of mass. This problem results to be a constrained linear least squares problem and a closed form solution has been proposed for non singular trajectories. An extension of this algorithm has been presented for singular trajectories, or for non singular trajectories in which joint accelerations exceed their limits, in order to limit the joint accelerations under acceptable values. In this case the problem results to be a constrained linear least squares problem with both equality and inequality constraints, and need iterative or recursive calculations to be solved. The proposed algorithm has been experimentally tested using a 3D free-flying robot previously tested in an ESA Parabolic Flight Campaign. In this test campaign the 3D robot has been converted in a 2D robot taking advantage of its modular structure, and it has been suspended by means of air-bearings on a granite plane. In this way it is possible to perform simulated microgravity tests without time constraints. The base of the robot has been fixed on ground by means of a custom design dynamometer, which measures the torque transferred to the ground to be minimized. The experimental results validated the proposed algorithm and confirmed its good performance. Cocuzza; Pretto; Angrilli

Journal: 2008

Published: title_year

DOI: 358576037

Abstract ▼

MATCH

Authors: Smith, AG;

Journal: English

Published: title_year

DOI: WOS:000265844200013

Pages: 188-Information Access through Search Engines and Digital Libraries

CORRECT

Authors: Pretto, I; Ruffieux, S; Menon, C; Ijspeert, AJ; Cocuzza, S; Sch Engn Sci; Sch Engn Sci; Biol Inspired Res Grp; CISAS G Colombo Ctr Studies & Activ Space; Bio-inspired climbing robots relying on adhesion systems are believed to become essential tools for several industrial applications in the near future. In recent years, research has mainly focused on modeling micro-scale adhesion phenomena; a macro-scale adhesion model has however to be developed for the design of macro-scale systems. In this paper a macro-model of adhesion suitable for real-time applications is presented; it relies on a continuous representation of adhesion. An extension of the von Mises criterion is proposed as failure adhesion criterion in order to estimate the occurrence of detachment at any point of the contacting surface. An experimental set up has been designed in order to define the parameters of the model. A semi-automatic process has been developed to ensure repeatability and accuracy of the results. Polydimethylsiloxane (PDMS), which has revealed promising adhesive features for robotic use, has been used during the experimental phase. The macro-model of adhesion has been implemented in a multi-body dynamics environment based on Open Dynamics Engine (ODE) to simulate a spider-inspired robot. Simulations based on this model are suitable to represent the behaviour of climbing robots and also to optimize their design. © 2008 Jilin University. Pretto; Ruffieux; Menon; Ijspeert; Cocuzza

Journal: English

Published: doi

DOI: WOS:000260115200017

Abstract ▼

Volume: JOURNAL OF BIONIC ENGINEERING###1672-6529 Pages: 105-A Point-Wise Model of Adhesion Suitable for Real-Time Applications of Bio-Inspired Climbing Robots

CORRECT

Authors: Peserico, E; Pretto, L; Dip Ing Informaz; Dip Ing Informaz; This paper explores the fundamental question of how many iterations the celebrated HITS algorithm requires on a general graph to converge in score and, perhaps more importantly, in rank (i.e. to "get right" the order of the nodes). We prove upper and almost matching lower bounds. We also extend our results to weighted graphs. © 2009 Springer Berlin Heidelberg. Peserico; Pretto

Journal: English

Published: doi

DOI: WOS:000269148100035

Abstract ▼

Pages: 357-HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank

CORRECT

Authors: Peserico, E; Pretto, L; Dip Ing Informaz; Dip Ing Informaz; How many iterations does the (ever more) popular HITS algorithm require to converge in score and, perhaps more importantly, in rank (i.e. to get the nodes of a graph "in the right order")? After pinning down the elusive notion of convergence in rank we provide the first non-trivial bounds on the convergence of HITS. A "worst case" example, requiring a number of iterations superexponential in the size of the target graph to achieve even "mild" convergence, suggests the need for greater caution in the experimental evaluation of the algorithm - as recent results of poor performance (e.g. vs. SALSA) might be due to insufficient iterations, rather than to an intrinsic deficiency of HITS. An almost matching upper bound shows that, as long as one employs exponential acceleration e.g. through a "squaring trick", a polynomial running time (practical in many application domains) always provides strong convergence guarantees. Peserico; Pretto

Journal: English

Published: doi

DOI: WOS:000270976500152

Abstract ▼

Pages: 771-Score and Rank Convergence of HITS

MATCH

Authors: AREA MIN. 07 - Scienze agrarie e veterinarie

Published: title_year

CORRECT

Authors: Celesti-Grapow, L; Alessandrini, A; Arrigoni, PV; Banfi, E; Bernardo, L; Bovio, M; Brundu, G; Cagiotti, MR; Camarda, I; Carli, E; Conti, F; Fascetti, S; Galasso, G; Gubellini, L; La Valva, V; Lucchese, F; Marchiori, S; Mazzola, P; Peccenini, S; Poldini, L; Pretto, F; Prosser, F; Siniscalco, C; Villani, MC; Viegi, L; Wilhalm, T; Blasi, C; Dept Plant Biol; Dept Plant Biol; Bot Garden; Dept Bot & Plant Ecol; Dept Appl Biol; Dept Environm Sci; Dept Biol; Landscape Study Dept; In this paper we present a comprehensive inventory of the non-native vascular flora of Italy, which was produced within the project "A survey of the Italian non-native flora", funded by the Italian Ministry for the Environment. Previously published floristic accounts were the main source of information. Historical records were critically revised and integrated with recent literature, data from herbaria and some unpublished information, so as to obtain a complete, up-to-date catalogue of the non-native vascular plant species that occur spontaneously in Italy. The inventory lists 1023 non-native species and subspecies, which account for 13.4% of all the Italian flora. The Italian non-native flora was divided, according to its residence time, into 103 archaeophytes and 920 neophytes. According to its current invasion status, it was classified into 437 casual (42.7% of all non-native) and 524 established taxa, the latter being divided into 361 naturalized non-invasive (35.3%) and 163 invasive taxa (15.9%). The inventory includes a group of 62 species (6.1%) that lack recent records (i.e. since 1950). By combining local expertise into a unified, nationwide scheme using a standardized method and terminology, the inventory provides the essential scientific basis for the development of plant invasion research and management in the country. © 2009 Società Botanica Italiana. Celesti-Grapow; Alessandrini; Arrigoni; Banfi; Bernardo; Bovio; Brundu; Cagiotti; Camarda; Carli; Conti; Fascetti; Galasso; Gubellini; la Valva; Lucchese; Marchiori; Mazzola; Peccenini; Poldini; Pretto; Prosser; Siniscalco; Villani; Viegi; Wilhalm; Blasi

Journal: English

Published: doi

DOI: WOS:000272170900017

Abstract ▼

Volume: PLANT BIOSYSTEMS###1126-3504 Pages: 430-Inventory of the non-native flora of Italy