649 result(s)
Page Size: 10, 20, 50
Export: bibtex, xml, json, csv
Order by:

CNR Author operator: and / or
more
Typology operator: and / or
more
Language operator: and / or
Date operator: and / or
more
Rights operator: and / or
2007 Contribution to journal Open Access OPEN
Series of Workshops on Digital Library Foundations
Castelli D., Fox E.
This document presents the results of the workshop on "Foundations of Digital Libraries" held in connection with the ACM-IEEE JCDL 2007 Conference in June in Vancouver. The papers presented during the workshop aimed to contribute to laying the foundations for digital libraries as a whole, as well as continuing the work on the definition of a Reference Model for Digital Libraries that was launched by the EU DELOS Network of Excellence on Digital Libraries.Source: D-Lib magazine 13 (2007): 9–10. doi:10.1045/september2007-castelli
DOI: 10.1045/september2007-castelli
Metrics:


See at: D-Lib Magazine Open Access | D-Lib Magazine Open Access | CNR ExploRA


2007 Conference article Open Access OPEN
A grid-based infrastructure for distributed retrieval
Simeoni F., Candela L., Kakaletris G., Sibeko M., Pagano P., Papanikos G., Polydoras P., Ioannidis Y., Aarvaag D., Crestani F.
In large-scale distributed retrieval, challenges of latency, heterogeneity, and dynamicity emphasise the importance of infrastructural support in reducing the development costs of state-of-the-art solutions. We present a service-based infrastructure for distributed retrieval which blends middleware facilities and a design framework to 'lift' the resource sharing approach and the computational services of a European Grid platform into the domain of e-Science applications. In this paper, we give an overview of the Diligent Search Framework and illustrate its exploitation in the field of Earth Science.Source: 11th European Conference on Digital Libraries, ECDL 2007, pp. 161–173, Budapest, Hungary, September 16-21, 2007
DOI: 10.1007/978-3-540-74851-9_14
Metrics:


See at: strathprints.strath.ac.uk Open Access | doi.org Restricted | www.scopus.com Restricted | www.springerlink.com Restricted | CNR ExploRA


2007 Journal article Open Access OPEN
832 Karin: absence of rotational spectral variations
Vernazza P., Rossi A., Birlan M., Fulchignoni M., Nedelcu A., Dotto E.
832 Karin is the largest member of the young Karin cluster that formed 5.75 ± 0.05 Myr ago in the outer main belt. Surprisingly, recent near-IR spectroscopy measurements [Sasaki, T., Sasaki, S., Watanabe, J., Sekiguchi, T., Yoshida, F., Kawakita, H., Fuse, T., Takato, N., Dermawan, B., Ito, T., 2004. Astrophys. J. 615 (2), L161­L164] revealed that Karin's surface shows different colors as a function of rotational phase. It was interpreted that 832 Karin shows us the reddish space-weathered exterior surface of the parent body as well as an interior face, which has not had time to become space-weathered. This result is at odds with recent results including seismic and geomorphic modeling, modeling of the Karin cluster formation and measurements of the space weathering rate. Consequently, we aimed to confirm/infirm this surprising result by sampling Karin's spectrum well throughout its rotation. Here, we present new visible (0.45­0.95 µm) and near-infrared (0.7­2.5 µm) spectroscopic observations of 832 Karin obtained in January and April 2006, covering most of Karin's longitudes. In the visible range, we find that Karin shows no rotational spectral variations. Similarly, we find that Karin exhibits very little (to none) spectral variations with rotation in the near-IR range. Our results imply that 832 Karin has a homogeneous surface, in terms of composition and surface age. Our results also imply that the impact that generated the family refreshed entirely Karin's surface, and probably the surfaces of all members.Source: Icarus (N.Y.N.Y. 1962) 191 (2007): 330–336. doi:10.1016/j.icarus.2007.04.014
DOI: 10.1016/j.icarus.2007.04.014
Metrics:


See at: Icarus Open Access | Icarus Restricted | Hyper Article en Ligne Restricted | HAL-UPMC Restricted | CNR ExploRA


2007 Contribution to book Open Access OPEN
A content-addressable network for similarity search in metric spaces
Falchi F., Gennaro C., Zezula P.
In this paper we present a scalable and distributed access structure for similarity search in metric spaces. The approach is based on the Content-addressable Network (CAN) paradigm, which provides a Distributed Hash Table (DHT) abstraction over a Cartesian space. We have extended the CAN structure to support storage and retrieval of generic metric space objects. We use pivots for projecting objects of the metric space in an N-dimensional vector space, and exploit the CAN organization for distributing the objects among the computing nodes of the structure. We obtain a Peer-to-Peer network, called the MCAN, which is able to search metric space objects by means of the similarity range queries. Experiments conducted on our prototype system confirm full scalability of the approach.Source: Databases, Information Systems, and Peer-to-Peer Computing, edited by Gianluca Moro, Sonia Bergamaschi, Sam Joseph, Jean-Henry Morin and Aris M. Ouksel, pp. 98–110, 2007
DOI: 10.1007/978-3-540-71661-7_9
Metrics:


See at: etd.adm.unipi.it Open Access | doi.org Restricted | www.scopus.com Restricted | CNR ExploRA


2007 Journal article Restricted
A digital library framework for reusing e-learning video documents
Bolettieri P., Falchi F., Gennaro C., Rabitti F.
The objective of this paper is to demonstrate the reuse of digital content, as video documents or PowerPoint presentations, by exploiting existing technologies for automatic extraction of metadata (OCR, speech recognition, cut detection, MPEG-7 visual descriptors, etc.). The multimedia documents and the extracted metadata are then indexed and managed by the Multimedia Content Management System (MCMS) MILOS, specifically developed to support design and effective implementation of digital library applications. As a result, the indexed digital material can be retrieved by means of content based retrieval on the text extracted and on the MPEG-7 visual descriptors (via similarity search), assisting the user of the e-Learning Library (student or teacher) to retrieve the items not only on the basic bibliographic metadata (title, author, etc.).Source: Lecture notes in computer science 4753 (2007): 444–449. doi:10.1007/978-3-540-75195-3_35
DOI: 10.1007/978-3-540-75195-3_35
Metrics:


See at: doi.org Restricted | www.springerlink.com Restricted | CNR ExploRA


2007 Contribution to book Restricted
A general approach to shape characterization for biomedical problems
Moroni D., Perner P., Salvetti O.
In this paper, we present a general approach to shape characterization and deformation analysis of 2D/3D deformable visual objects. In particular, we define a reference dynamic model, encoding morphological and functional properties of an objects class, capable to analyze different scenarios in heart left ventricle analysis. The proposed approach is suitable for generalization to the analysis of periodically deforming anatomical structures, where it could provide useful support in medical diagnosis. Preliminary results in heart left ventricle analysis are discussed.Source: Advances in Mass Data Analysis of Signals and Images in Medicine, Biotechnology and Chemistry, edited by Petra Perner & Ovidio Salvetti, pp. 136–145, 2007
DOI: 10.1007/978-3-540-76300-0
Metrics:


See at: doi.org Restricted | www.springerlink.com Restricted | CNR ExploRA


2007 Conference article Closed Access
A reference architecture for digital library systems: principles and applications
Candela L., Castelli D., Pagano P.
A reference architecture for a given domain provides an architectural template which can be used as a starting point for designing the software architecture of a system in that domain. Despite the popularity of tools and systems commonly termed ``Digital Library'', very few attempts exist to set the foundation governing their development thus making integration and reuse of third party assets and results very difficult. This paper presents a reference architecture for the Digital Library domain characterised by many, multidisciplinary and distributed players, both resource providers and consumers, whose requirements evolve along the time. The paper validates this reference architecture by describing the structure of two current systems, DILIGENT and DRIVER, facing the problem to deliver large-scale digital libraries in two different contexts and with diverse technologies.Source: First International DELOS Conference, pp. 22–35, Pisa, Italy, February 13-14, 2007
DOI: 10.1007/978-3-540-77088-6_3
Metrics:


See at: doi.org Restricted | www.scopus.com Restricted | www.springerlink.com Restricted | CNR ExploRA


2007 Conference article Unknown
A similarity approach on searching for digital rights
Allasia W., Falchi F., Gallo F.
We present an innovative approach that treats the right management metadata as metric objects, enabling similarity search on IPR attributes between digital items. We show how the content base similarity search can help both the user to deal with a huge amount of similar items with different licenses and the content providers to detect fake copies or illegal uses. Our aim is the management of the metadata related to the Digital Rights in centralized systems or networks with indexing capabilities for both text and similarity searches, providing theSource: Multimedia Metadata Applications Workshop. Held in conjunction of International Conference on New Media and Semantics Systems. I-MEDIA'07 and I-SEMANTICS'07, pp. 147–154, Graz, Austria, 5-7 September 2007

See at: CNR ExploRA


2007 Conference article Restricted
A top-down query answering procedure for normal logic programs under the any-world assumption
Straccia U.
The Any-World Assumption (AWA) has been introduced for normal logic programs as a generalization of the well-known notions of Closed World Assumption (CWA) and the Open World Assumption (OWA). The AWA allows any assignment (i.e., interpretation), over a truth space (bilattice), to be a default assumption and, thus, the CWA and OWA are just special cases. To answer queries, we provide a novel and simple top-down procedure.Source: 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty., pp. 115–127, Hammamet, Tunisi, Ottobre 2007
DOI: 10.1007/978-3-540-75256-1
Metrics:


See at: doi.org Restricted | link.springer.com Restricted | CNR ExploRA


2007 Journal article Closed Access
An empirical study on the impact of automation on the requirements analysis process
Lami G., Ferguson R. W.
Requirements analysis is an important phase in a software project. The analysis is often performed in an informal way by specialists who review documents looking for ambiguities, technical inconsistencies and incomplete parts. Automation is still far from being applied in requirements analyses, above all since natural languages are informal and thus difficult to treat automatically. There are only a few tools that can analyse texts. One of them, called QuARS, was developed by the Istituto di Scienza e Tecnologie dell'Informazione and can analyse texts in terms of ambiguity. This paper describes how QuARS was used in a formal empirical experiment to assess the impact in terms of effectiveness and efficacy of the automation in the requirements review process of a software company.Source: Journal of Computer Science and Technology 22 (2007): 338–347. doi:10.1007/s11390-007-9045-3
DOI: 10.1007/s11390-007-9045-3
Metrics:


See at: Journal of Computer Science and Technology Restricted | www.springerlink.com Restricted | CNR ExploRA


2007 Journal article Restricted
Analysis of a pointing task on a white board
Faconti G., Massink M.
We study the variations in two dimensional (2D) pointing behaviour of a group of subjects by means of capturing their movement traces in an automatic way with the Mimio device. Such traces can provide detailed insight in the variability of 2D pointing relevant for example for the design of computer vision based gestural interaction. This study provides experimental evidence that for medium large distances Fitts' model, and Welfords and Shannons variants, continue to show a linear relationship between movement time (MT) and the index of difficulty (ID) with a high correlation for the ranges considered. The expected increased sensitivity to changes in ID for these distances are confirmed. Nearly all movements show three phases: a planning phase, a ballistic phase and an adjustment phase. Finally, we show that the arrival time at the target resembles a log-normal distribution.Source: Lecture notes in computer science 4323 (2007): 185–198. doi:10.1007/978-3-540-69554-7
DOI: 10.1007/978-3-540-69554-7
Metrics:


See at: link.springer.com Restricted | link.springer.com Restricted | www.springerlink.com Restricted | CNR ExploRA


2007 Journal article Unknown
Approximate L(?1, ?2, . . . , ?t)-Coloring of Trees and Interval Graphs
Bertossi A. A., Pinotti M. C.
Given a vector (?1 , ?2 , . . . , ?t ) of nonincreasing positive integers, and an undirected graph G = (V , E ), an L(?1 , ?2 , . . . , ?t )-coloring of G is a function f from the ver- tex set V to a set of nonnegative integers such that |f (u ) - f (v )| >= ?i , if d (u , v ) = i , 1 <= i <= t , where d (u , v ) is the distance (i.e., the minimum number of edges) between the vertices u and v . An optimal L(?1 , ?2 , . . . , ?t )- coloring for G is one minimizing the largest integer used over all such colorings. Such a coloring problem has rele- vant applications in channel assignment for interference avoidance in wireless networks. This article presents efficient approximation algorithms for L(?1 , ?2 , . . . , ?t )- coloring of two relevant classes of graphs--trees, and interval graphs. Specifically, based on the notion of strongly simplicial vertices, O (n(t +?1 )) and O (nt 2 ?1 ) time algorithms are proposed to find ?-approximate colorings on interval graphs and trees, respectively, where n is the number of vertices and ? is a constant depending on t and ?1 , . . . , ?t . Moreover, an O (n) time algorithm is given for the L(?1 , ?2 )-coloring of unit interval graphs, which provides a 3-approximation. Specifically, based on the notion of strongly simplicial vertices, O (n(t +δ1 )) and O (nt 2 δ1 ) time algorithms are proposed to find α-approximate colorings on interval graphs and trees, respectively, where n is the number of vertices and α is a constant depending on t and δ1 , . . . , δt . Moreover, an O (n) time algorithm is given for the L(δ1 , δ2 )-coloring of unit interval graphs, which provides a 3-approximation. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 49(3), 204-216 2007Source: Networks (N.Y.N.Y., Print) 49 (2007): 204–216.

See at: CNR ExploRA


2007 Conference article Restricted
Architectural verification of black-box component-based systems
Bertolino A., Muccini H., Polini A.
We introduce an original approach, which combines monitoring and model checking techniques into a comprehensive methodology for the architectural verification of Component-based systems. The approach works by first capturing the traces of execution via the instrumented middleware; then, the observed traces are reverse engineered into Message Sequence Charts, which are then checked for compliance to the Component-based Software Architecture, using a model checker. The methodology has been conceived for being applied indifferently for validating the system in house before deployment and for continuous validation in the field following evolution. A case study for the first case is here illustrated.Source: RISE 2006 Third International Workshop, pp. 98–113, Geneva, Switzerland, 13-15 September 2006
DOI: 10.1007/978-3-540-71876-5
Metrics:


See at: www.springerlink.com Restricted | CNR ExploRA


2007 Journal article Restricted
Are de-orbiting missions possible using electrodynamic tethers? Task review from the space debris perspective
Pardini C., Hanada T., Krisko P. H., Anselmo L., Hirayama H.
Over 9000 satellites and other trackable objects are currently in orbit around the Earth, along with many smaller particles. As the low Earth orbit is not a limitless resource, some sort of debris mitigation measures are needed to solve the problem of unusable satellites and spent upper stages. De-orbiting devices based on the use of conducting tethers have been recently proposed as innovative solutions to mitigate the growth of orbital debris. However, electrodynamic tethers introduce unusual problems when viewed from the space debris perspective. In particular, because of their small diameter, tethers of normal design may have a high probability of being severed by impacts with relatively small meteoroids and orbital debris. This paper compares the results obtained at ISTI/CNR, the Kyushu University and NASA/JSC concerning the vulnerability to debris impacts on a specific conducting tether able to de-orbit spacecraft in inclinations up to 75◦ and initial altitude less than 1400 km. A double line tether design has been analyzed, in addition to the single wire solution, in order to reduce the tether vulnerability. The results confirm that the survivability concern is fully justified for a single line tether and no de-orbit mission, from the altitudes and inclinations considered, is possible if the tether diameter is smaller than a few millimeters. The survival probability is shown to grow for a double line configuration with a sufficiently high number of knots and loops. The results are strongly dependent on the environment model adopted and the MASTER-2001 orbital debris and meteoroids fluxes result in survival probabilities appreciably higher than those of ORDEM2000 coupled with the Grün meteoroids model.Source: Acta astronautica 60 (2007): 916–929. doi:10.1016/j.actaastro.2006.11.001
DOI: 10.1016/j.actaastro.2006.11.001
Metrics:


See at: Acta Astronautica Restricted | Acta Astronautica Restricted | www.scopus.com Restricted | CNR ExploRA


2007 Conference article Restricted
Authoring multi-device Web applications with database access
Mori G., Paternò F., Santoro C.
In this paper we present an environment for authoring Web sites through a model-based approach for user interface design. In particular, we focus on how it supports the access to remote databases and the dynamic generation of the Web pages presenting the corresponding query results. The environment is able to support development of applications implemented in many Web mark-up languages (XHTML, XHTML MP, X+V, VoiceXML) adapted to various interaction platforms (vocal, mobile, desktop,...).Source: Web Engineering . 7th International Conference, ICWE 2007, pp. 182–187, Como, Italy, 16-20 Luglio 2007

See at: www.springerlink.com Restricted | CNR ExploRA


2007 Contribution to book Restricted
Automatic fuzzy-neural based segmentation of microscopic cell images
Colantonio S., Gurevich I. B., Salvetti O.
In this paper, we propose a novel, completely automated method for the segmentation of lymphatic cell nuclei represented in microscopic specimen images. Actually, segmenting cell nuclei is the first, necessary step for developing an automated application for the early diagnostics of lymphatic system tumours. The proposed method follows a two-step approach to, firstly, find the nuclei and, then, to refine the segmentation by means of a neural model, able to localize the borders of each nucleus. Experimental results have shown the feasibility of the method.Source: Advances in Mass Data Analysis of Signals and Images in Medicine, Biotechnology and Chemistry, edited by Perner Petra, Salvetti Ovidio, pp. 115–127, 2007
DOI: 10.1007/978-3-540-76300-0
Metrics:


See at: doi.org Restricted | www.springerlink.com Restricted | CNR ExploRA


2007 Journal article Open Access OPEN
Behavioral complexity indicators for process algebra: the NKS approach
Bolognesi T.
Several techniques for the experimental investigation of the computing power of various formal models, from cellular automata to Turing machines, have been proposed by S.Wolfram with his NKS (New Kind of Science). Visual complexity indicators reveal the 'internal shapes' of computations, and may expose constant, periodic, nested/fractal, pseudo-random, and even more sophisticated dynamics. In this paper we investigate visual complexity indicators for process algebra. With its emphasis on reactive, continuously observable behavior, as opposed to input/output behavior, process algebra might appear as an ideal candidate for NKS-style investigations; however, this formal model is in some sense more elaborate than the simple formalisms addressed in NKS, and poses specific problems, such as the presence of both events and states, and the explosive nature of non-determinism. We consider a set of process algebraic operators and prove its Turing universality by showing that they can emulate any elementary cellular automaton, including n. 110, which is itself universal. The correctness of the emulation is supported by an original visual indicator, which is then used for exploring various subclasses of algebraic expressions and their emergent features. Based on this indicator, and even by restricting to deterministic computations, we have detected and measured, by a data compression technique, the emergence of randomness in a subclass of expressions which is provably not universal. Besides providing a suggestive visualization of the relative strengths of operator subsets, we believe that results of this type, both of theoretical and of experimental nature, are desirable in light of one of the key NKS conjectures, according to which random-like behavior would be a witness of computational universality.Source: The journal of logic and algebraic programming 72 (2007): 50–77. doi:10.1016/j.jlap.2007.02.004
DOI: 10.1016/j.jlap.2007.02.004
Metrics:


See at: The Journal of Logic and Algebraic Programming Open Access | biblioproxy.cnr.it Restricted | CNR ExploRA


2007 Journal article Closed Access
Building geospatial ontologies from geographical databases
Baglioni M., Masserotti M. V., Renso C., Spinsanti L.
The last few years have seen a growing interest in approaches that define methodologies to automatically extract semantics from databases by using ontologies. Geographic data are very rarely collected in a well organized way, quite often they lack both metadata and conceptual schema. Extracting semantic information from data stored in a geodatabase is complex and an extension of the existing methodologies is needed. We describe an approach to extract a geospatial ontology from geographical data stored in spatial databases. To provide geospatial semantics we introduce new relations which define geospatial ontology that can serve as a basis for an advanced user querying system. Some examples of use of the methodology in the urban domain are presented.Source: Lecture notes in computer science 4853 (2007): 195–209. doi:10.1007/978-3-540-76876-0_13
DOI: 10.1007/978-3-540-76876-0_13
Metrics:


See at: doi.org Restricted | www.springerlink.com Restricted | CNR ExploRA


2007 Contribution to book Open Access OPEN
CLEF 2006: ad hoc track overview
Di Nunzio G., Ferro N., Mandl T., Peters C.
We describe the objectives and organization of the CLEF 2006 ad hoc track and discuss the main characteristics of the tasks offered to test monolingual, bilingual, and multilingual textual document retrieval systems. The track was divided into two streams. The main stream offered mono- and bilingual tasks using the same collections as CLEF 2005: Bulgarian, English, French, Hungarian and Portuguese. The second stream, designed for more experienced participants, offered the so-calledSource: Evaluation of Multilingual and Multi-modal Information Retrieval, pp. 21–34, 2007
DOI: 10.1007/978-3-540-74999-8
Metrics:


See at: hdl.handle.net Open Access | NARCIS Restricted | NARCIS Restricted | CNR ExploRA


2007 Conference article Restricted
Blind source separation applied to spectral unmixing: comparing different measures of nongaussianity
Caiafa C. F., Salerno E., Proto A. N.
We report some of our results of a particular blind source separation technique applied to spectral unmixing of remote-sensed hyperspectral images. Different nongaussianity measures are introduced in the learning procedure, and the results are compared to assess their relative efficiencies, with respect to both the output signal-to-interference ratio and the overall computational complexity. This study has been conducted on both simulated and real data sets, and the first results show that skewness is a powerful and unexpensive tool to extract the typical sources that charcterize remote-sensed images.Source: Knowledge-Based Intelligent Information and Engineering Systems. 11th International Conference KES 2007, XVII Italian Workshop on Neural Networks, pp. 1–8, Vietri sul Mare, Italy, 12-14 September 2007
DOI: 10.1007/978-3-540-74829-8
Metrics:


See at: link.springer.com Restricted | CNR ExploRA