2005
Conference article
Unknown
Digital Libraries over the Grid: Heaven or Hell?.
Castelli D., Ioannidis Y.
The last decade has seen unprecedented advances in network and distributedsystem technologies, which have opened up the way for the construction of globalscale systems based on completely new conceptions of computation and sharing of resources. The dream of integrating unlimited levels of processing power, unlimited amounts of information, and an unlimited variety of services, and o.ering the entire package in a reliable and seamless fashion to widely distributed users is quickly becoming reality. As Digital Libraries move towards more usercentric, pro-active, collaborative functionality and application diversity, they should be among the first to take advantage of such environments. The long-term vision of the field for creating Dynamic Universal Knowledge Environments calls for intensive computation and processing of very large amounts of information, hence, the needs for the appropriate distributed architecture are pressing.Source: ECDL 2005 - 9th European Conference on Digital Libraries (Vienna, Austria, 18-23 September 2005), pp. 477–478, Vienna, 18-23 September 2005
Castelli D., Ioannidis Y.
The last decade has seen unprecedented advances in network and distributedsystem technologies, which have opened up the way for the construction of globalscale systems based on completely new conceptions of computation and sharing of resources. The dream of integrating unlimited levels of processing power, unlimited amounts of information, and an unlimited variety of services, and o.ering the entire package in a reliable and seamless fashion to widely distributed users is quickly becoming reality. As Digital Libraries move towards more usercentric, pro-active, collaborative functionality and application diversity, they should be among the first to take advantage of such environments. The long-term vision of the field for creating Dynamic Universal Knowledge Environments calls for intensive computation and processing of very large amounts of information, hence, the needs for the appropriate distributed architecture are pressing.Source: ECDL 2005 - 9th European Conference on Digital Libraries (Vienna, Austria, 18-23 September 2005), pp. 477–478, Vienna, 18-23 September 2005
See at: CNR ExploRA
2005
Journal article
Restricted
A comparison between handwritten and automatic generation of C code from SDL using static analysis
Becucci M., Fantechi A., Giromini M., Spinicci E.
The experience reported in this paper relates to an evaluation of the automatic generation of C code from the Specification and Description Language (SDL) specification of embedded applications. The evaluation has been carried out by comparing the automatically generated code with the manually implemented code, both compliant to the same SDL specification: this comparison is based on a selection of metrics measured on both codes by means of commercial static analysis tools. Notwithstanding the different structure of the two codes, we appropriately selected and aggregated the obtained results in order to use them as indicators of code size, control flow complexity and integration flow complexity. For a better comparison of the two codes, we have also introduced a novel complexity metric, which compares the control flow complexity with the integration flow of the two different software architectures. The aim of the paper is not merely to evaluate the code generator used, but rather to propose a set of techniques that can be used to conduct similar evaluations.Source: Software, practice and experience (Online) 35 (2005): 1317–1347. doi:10.1002/spe.673
DOI: 10.1002/spe.673
Metrics:
Becucci M., Fantechi A., Giromini M., Spinicci E.
The experience reported in this paper relates to an evaluation of the automatic generation of C code from the Specification and Description Language (SDL) specification of embedded applications. The evaluation has been carried out by comparing the automatically generated code with the manually implemented code, both compliant to the same SDL specification: this comparison is based on a selection of metrics measured on both codes by means of commercial static analysis tools. Notwithstanding the different structure of the two codes, we appropriately selected and aggregated the obtained results in order to use them as indicators of code size, control flow complexity and integration flow complexity. For a better comparison of the two codes, we have also introduced a novel complexity metric, which compares the control flow complexity with the integration flow of the two different software architectures. The aim of the paper is not merely to evaluate the code generator used, but rather to propose a set of techniques that can be used to conduct similar evaluations.Source: Software, practice and experience (Online) 35 (2005): 1317–1347. doi:10.1002/spe.673
DOI: 10.1002/spe.673
Metrics:
See at:
Software Practice and Experience 
| onlinelibrary.wiley.com | CNR ExploRA
2005
Journal article
Closed Access
A formal security analysis of an OSA/Parlay authentication interface
Corin R., Di Caprio G., Etalle S., Gnesi S., Lenzini G., Moiso C.
We report on an experience in analyzing the security of the Trust and Security Management (TSM) protocol, an authentication procedure within the OSA/Parlay Application Program Interfaces (APIs) of the Open Service Access and Parlay Group. The experience has been conducted jointly by research institutes experienced in security and industry experts in telecommunication networking. OSA/Parlay APIs are designed to enable the creation of telecommunication applications outside the traditional network space and business model. Network operators consider the OSA/Parlay a promising architecture to stimulate the development of web service applications by third party providers, which may not necessarily be experts in telecommunication and security. The TSM protocol is executed by the gateways to OSA/Parlay networks; its role is to authenticate client applications trying to access the interfaces of some object representing an offered network capability. For this reason, potential security flaws in the TSM authentication strategy can cause the unauthorized use of the network, with evident damages to the operator and the quality of services. We report a rigorous formal analysis of the TSM specification, which is originally given in UML. Furthermore, we illustrate our design choices to obtain the formal model, describe the tool-aided verification and finally expose the security flaws discovered.Source: Lecture notes in computer science 3535 (2005): 131–146.
Corin R., Di Caprio G., Etalle S., Gnesi S., Lenzini G., Moiso C.
We report on an experience in analyzing the security of the Trust and Security Management (TSM) protocol, an authentication procedure within the OSA/Parlay Application Program Interfaces (APIs) of the Open Service Access and Parlay Group. The experience has been conducted jointly by research institutes experienced in security and industry experts in telecommunication networking. OSA/Parlay APIs are designed to enable the creation of telecommunication applications outside the traditional network space and business model. Network operators consider the OSA/Parlay a promising architecture to stimulate the development of web service applications by third party providers, which may not necessarily be experts in telecommunication and security. The TSM protocol is executed by the gateways to OSA/Parlay networks; its role is to authenticate client applications trying to access the interfaces of some object representing an offered network capability. For this reason, potential security flaws in the TSM authentication strategy can cause the unauthorized use of the network, with evident damages to the operator and the quality of services. We report a rigorous formal analysis of the TSM specification, which is originally given in UML. Furthermore, we illustrate our design choices to obtain the formal model, describe the tool-aided verification and finally expose the security flaws discovered.Source: Lecture notes in computer science 3535 (2005): 131–146.
See at:
link.springer.com | CNR ExploRA
2005
Journal article
Restricted
A grid information service based on peer-to-peer
Puppin D., Moncelli S., Baraglia R., Tonellotto N., Silvestri F.
Information Services are fundamental blocks of the Grid infrastructure. They are responsible for collecting and distributing information about resource availability and status to users: the quality of these data may have a strong impact on scheduling algorithms and overall performance. Many popular information services have a centralized structure. This clearly introduces problems related to information updating and fault tolerance. Also, in very large configurations, scalability may be an issue. In this work, we present a Grid Information Service based on the peer-to-peer technology. Our system offers a fast propagation of information and has high scalability and reliability. We implemented our system complying to the OGSA standard using the Globus Toolkit 3. Our system can run on Linux and Windows systems, with different network configurations, so to trade off between redundancy (reliability) and costSource: Lecture notes in computer science 3648 (2005): 454–464.
Puppin D., Moncelli S., Baraglia R., Tonellotto N., Silvestri F.
Information Services are fundamental blocks of the Grid infrastructure. They are responsible for collecting and distributing information about resource availability and status to users: the quality of these data may have a strong impact on scheduling algorithms and overall performance. Many popular information services have a centralized structure. This clearly introduces problems related to information updating and fault tolerance. Also, in very large configurations, scalability may be an issue. In this work, we present a Grid Information Service based on the peer-to-peer technology. Our system offers a fast propagation of information and has high scalability and reliability. We implemented our system complying to the OGSA standard using the Globus Toolkit 3. Our system can run on Linux and Windows systems, with different network configurations, so to trade off between redundancy (reliability) and costSource: Lecture notes in computer science 3648 (2005): 454–464.
See at:
hpc.isti.cnr.it | CNR ExploRA
2005
Journal article
Restricted
A hierarchical radio resource management framework for integrating WLANs in cellular networking environments
Karetsos G. T., Kyriazakos S. A., Groustiotis E., Di Giandomenico F., Mura I.
Over the last few years wireless local area networking (WLAN) has become a very important technology that offers high-speed communication services to mobile users in indoor environments. WLAN technology offers some very attractive characteristics such as high data rates, increased QoS capabilities, and low installation costs which has made many professionals claim that it will be the main opponent of IMT- 2000, despite the enormous effort needed for the specification and implementation of 3G systems. However, WLANs also present many important constraints related mainly to their restricted coverage capabilities. On the other hand, 3G systems are deployed gradually and carefully since their business prospects have not been validated yet and it is expected that 2G and 2G+ cellular systems will continue to play an important role for at least five more years. Thus, today's wireless networking environment is in fact a conglomeration of all these technologies for which there is a strong need for cooperation. In this article we describe a heterogeneous wireless networking environment together with its features and user requirements. We explain the importance of the existence of WLANs and describe a framework and system architecture that support seamless integration of WLAN in heterogeneous cellular networking environments, focusing on support for efficient resource provision and management.Source: IEEE wireless communications 12 (2005): 11–17. doi:10.1109/MWC.2005.1561940
DOI: 10.1109/mwc.2005.1561940
Metrics:
Karetsos G. T., Kyriazakos S. A., Groustiotis E., Di Giandomenico F., Mura I.
Over the last few years wireless local area networking (WLAN) has become a very important technology that offers high-speed communication services to mobile users in indoor environments. WLAN technology offers some very attractive characteristics such as high data rates, increased QoS capabilities, and low installation costs which has made many professionals claim that it will be the main opponent of IMT- 2000, despite the enormous effort needed for the specification and implementation of 3G systems. However, WLANs also present many important constraints related mainly to their restricted coverage capabilities. On the other hand, 3G systems are deployed gradually and carefully since their business prospects have not been validated yet and it is expected that 2G and 2G+ cellular systems will continue to play an important role for at least five more years. Thus, today's wireless networking environment is in fact a conglomeration of all these technologies for which there is a strong need for cooperation. In this article we describe a heterogeneous wireless networking environment together with its features and user requirements. We explain the importance of the existence of WLANs and describe a framework and system architecture that support seamless integration of WLAN in heterogeneous cellular networking environments, focusing on support for efficient resource provision and management.Source: IEEE wireless communications 12 (2005): 11–17. doi:10.1109/MWC.2005.1561940
DOI: 10.1109/mwc.2005.1561940
Metrics:
See at:
IEEE Wireless Communications | ieeexplore.ieee.org | CNR ExploRA
2005
Journal article
Closed Access
A method for recognizing and describing the links among dream sources
Barcaro U., Cavallaro C., Navona C.
A method is described for the identification of possible links between dream sources. The analysis is based on automatic recognition of word root recurrences in text files, including dream reports and associations. Graph representation of the links provides a quantitative description of their basic figuresSource: Dreaming (N.Y.N.Y.) 15 (2005): 271–287. doi:10.1037/1053-0797.15.4.271
DOI: 10.1037/1053-0797.15.4.271
Metrics:
Barcaro U., Cavallaro C., Navona C.
A method is described for the identification of possible links between dream sources. The analysis is based on automatic recognition of word root recurrences in text files, including dream reports and associations. Graph representation of the links provides a quantitative description of their basic figuresSource: Dreaming (N.Y.N.Y.) 15 (2005): 271–287. doi:10.1037/1053-0797.15.4.271
DOI: 10.1037/1053-0797.15.4.271
Metrics:
See at:
Dreaming | CNR ExploRA
2005
Journal article
Closed Access
Abrupt alteration of asteroid 2004 MN4's spin state during its 2029 Earth flyby
Scheeres D. J., Benner L. A. M., Ostro S. J., Rossi A., Marzari F., Washabaugh P.
We predict that when Asteroid 2004 MN4 passes 5.6±1.4 Earth radii from Earth's center on April 13, 2029, terrestrial torques during the flyby will alter its spin state in a dramatic manner that will be observable using groundbased telescopes. Although the asteroid will most likely not undergo catastrophic disruption, it may be subject to localized failure across its surface and interior, providing a unique opportunity to measure otherwise inaccessible mechanical properties of an asteroid.Source: Icarus (N.Y.N.Y. 1962) 178 (2005): 281–283. doi:10.1016/j.icarus.2005.06.002
DOI: 10.1016/j.icarus.2005.06.002
Metrics:
Scheeres D. J., Benner L. A. M., Ostro S. J., Rossi A., Marzari F., Washabaugh P.
We predict that when Asteroid 2004 MN4 passes 5.6±1.4 Earth radii from Earth's center on April 13, 2029, terrestrial torques during the flyby will alter its spin state in a dramatic manner that will be observable using groundbased telescopes. Although the asteroid will most likely not undergo catastrophic disruption, it may be subject to localized failure across its surface and interior, providing a unique opportunity to measure otherwise inaccessible mechanical properties of an asteroid.Source: Icarus (N.Y.N.Y. 1962) 178 (2005): 281–283. doi:10.1016/j.icarus.2005.06.002
DOI: 10.1016/j.icarus.2005.06.002
Metrics:
See at:
Icarus | CNR ExploRA
2005
Conference article
Unknown
A model based approach to design applications for network processor
Afsharian S., Bertolino A., De Angelis G., Iovanna P., Mirandola R.
Network Processors (NPs) are an emerging class of embedded systems used in the telecommunication domain for applications like routing and switching. In this paper we introduce the main characteristics of the existing NP architectures and the difficulties intrinsic to their software application design. On the other hand we review the basic principles underlying the well-known modelbased development (MBD) approach. After motivating the opportunity of applying MBD to the domain of NPs, we outline a framework currently under development for the application of MBD to the design of NP software applications, thus allowing for the early derivation of test plans and for performance analysis.Source: RISE 2004 - Workshop on Rapid Integration of Software Engineering, pp. 93–101, Luxembourg, 26 November 2004
Afsharian S., Bertolino A., De Angelis G., Iovanna P., Mirandola R.
Network Processors (NPs) are an emerging class of embedded systems used in the telecommunication domain for applications like routing and switching. In this paper we introduce the main characteristics of the existing NP architectures and the difficulties intrinsic to their software application design. On the other hand we review the basic principles underlying the well-known modelbased development (MBD) approach. After motivating the opportunity of applying MBD to the domain of NPs, we outline a framework currently under development for the application of MBD to the design of NP software applications, thus allowing for the early derivation of test plans and for performance analysis.Source: RISE 2004 - Workshop on Rapid Integration of Software Engineering, pp. 93–101, Luxembourg, 26 November 2004
See at: CNR ExploRA
2005
Conference article
Restricted
sPLMap: A probabilistic approach to schema matching
Nottelmann H., Straccia U.
This paper introduces the first formal framework for learning mappings between heterogeneous schemas, which is based on probabilistic logics. This task, also called ``schema matching'', is a crucial step in integrating heterogeneous collections. As schemas may have different granularities, and as schema attributes do not always match precisely, a general-purpose schema mapping approach requires support for uncertain mappings, and mappings have to be learned automatically. The framework combines different classifiers for finding suitable mapping candidates (together with their weights), and selects that set of mapping rules which is the most likely one. Finally, the framework with different variants has been evaluated on two different data sets.Source: Advances in Information Retrieval, 27th European Conference on IR Research, pp. 81–95, March 2005
DOI: 10.1007/978-3-540-31865-1_7
Metrics:
Nottelmann H., Straccia U.
This paper introduces the first formal framework for learning mappings between heterogeneous schemas, which is based on probabilistic logics. This task, also called ``schema matching'', is a crucial step in integrating heterogeneous collections. As schemas may have different granularities, and as schema attributes do not always match precisely, a general-purpose schema mapping approach requires support for uncertain mappings, and mappings have to be learned automatically. The framework combines different classifiers for finding suitable mapping candidates (together with their weights), and selects that set of mapping rules which is the most likely one. Finally, the framework with different variants has been evaluated on two different data sets.Source: Advances in Information Retrieval, 27th European Conference on IR Research, pp. 81–95, March 2005
DOI: 10.1007/978-3-540-31865-1_7
Metrics:
See at:
doi.org | link.springer.com | www.scopus.com | CNR ExploRA
2005
Conference article
Unknown
A relational query primitive for constraint-based pattern mining
Bonchi F., Giannotti F., Pedreschi D.
As a step towards the design of an Inductive Database Sys- tem, in this paper we present a primitive for constraint-based frequent pattern mining, which represents a careful trade-o between expressive- ness and eciency Such primitive is a simple mechanism which takes a relational table in input and extracts from it all frequent patterns which satisfy a given set of user-de ned constraints. Despite its simplicity, the proposed primitive is expressive enough to deal with a broad range of interesting constraint-based frequent pattern queries,using a comprehen- sive repertoire of constraints de ned over SQL aggregates. Thanks to its simplicity, the proposed primitive is amenable to be smoothly embedded in a variety of data mining query languages and be eciencly xecuted, by the state-of-the-art optimization techniques based on pushing the var- ious form of constraints by means of data reduction.Source: European Workshop on Inductive Databases and Constraint Based Mining, pp. 14–37, Hinterzarten, Germany, 11-13 March 2004
Bonchi F., Giannotti F., Pedreschi D.
As a step towards the design of an Inductive Database Sys- tem, in this paper we present a primitive for constraint-based frequent pattern mining, which represents a careful trade-o between expressive- ness and eciency Such primitive is a simple mechanism which takes a relational table in input and extracts from it all frequent patterns which satisfy a given set of user-de ned constraints. Despite its simplicity, the proposed primitive is expressive enough to deal with a broad range of interesting constraint-based frequent pattern queries,using a comprehen- sive repertoire of constraints de ned over SQL aggregates. Thanks to its simplicity, the proposed primitive is amenable to be smoothly embedded in a variety of data mining query languages and be eciencly xecuted, by the state-of-the-art optimization techniques based on pushing the var- ious form of constraints by means of data reduction.Source: European Workshop on Inductive Databases and Constraint Based Mining, pp. 14–37, Hinterzarten, Germany, 11-13 March 2004
See at: CNR ExploRA
2005
Journal article
Restricted
A scalable nearest neighbor search in P2P systems
Batko M., Gennaro C., Zezula P.
Similarity search in metric spaces represents an important paradigm for content-based retrieval in many applications. Existing centralized search structures can speed-up retrieval, but they do not scale up to large volume of data because the response time is linearly increasing with the size of the searched file. In this article, we study the problem of executing the nearest neighbor(s) queries in a distributed metric structure, which is based on the P2P communication paradigm and the generalized hyperplane partitioning. By exploiting parallelism in a dynamic network of computers, the query execution scales up very well considering both the number of distance computations and the hop count between the peers. Results are verified by experiments on real-life data sets.Source: Lecture notes in computer science 3367 (2005): 78–92.
Batko M., Gennaro C., Zezula P.
Similarity search in metric spaces represents an important paradigm for content-based retrieval in many applications. Existing centralized search structures can speed-up retrieval, but they do not scale up to large volume of data because the response time is linearly increasing with the size of the searched file. In this article, we study the problem of executing the nearest neighbor(s) queries in a distributed metric structure, which is based on the P2P communication paradigm and the generalized hyperplane partitioning. By exploiting parallelism in a dynamic network of computers, the query execution scales up very well considering both the number of distance computations and the hop count between the peers. Results are verified by experiments on real-life data sets.Source: Lecture notes in computer science 3367 (2005): 78–92.
See at:
www.springerlink.com | CNR ExploRA
2005
Journal article
Open Access
A simple normal enhancement technique for Interactive non-photorealistic renderings
Cignoni P., Scopigno R., Tarini M.
We present a simple technique to improve the perception of an object's shape. Bump mapping is well known in the computer graphics community for providing the impression of small-scale geometrical features, which are not explicitly modelled. Here, we propose a similar approach (variation of normals) for the purpose of enhancing the perception of a given geometry. Our approach is based on a simple modification of the surface normals in order to enhance the geometric features of the object during the rendering. The enhanced normals produced by this approach can be used in any rendering technique. The technique presented is particularly well suited to improve the rendering of mechanical parts where common straightforward shading techniques can often generate shading ambiguities.Source: Computers & graphics 29 (2005): 125–133. doi:10.1016/j.cag.2004.11.012
DOI: 10.1016/j.cag.2004.11.012
Metrics:
Cignoni P., Scopigno R., Tarini M.
We present a simple technique to improve the perception of an object's shape. Bump mapping is well known in the computer graphics community for providing the impression of small-scale geometrical features, which are not explicitly modelled. Here, we propose a similar approach (variation of normals) for the purpose of enhancing the perception of a given geometry. Our approach is based on a simple modification of the surface normals in order to enhance the geometric features of the object during the rendering. The enhanced normals produced by this approach can be used in any rendering technique. The technique presented is particularly well suited to improve the rendering of mechanical parts where common straightforward shading techniques can often generate shading ambiguities.Source: Computers & graphics 29 (2005): 125–133. doi:10.1016/j.cag.2004.11.012
DOI: 10.1016/j.cag.2004.11.012
Metrics:
See at:
Computers & Graphics 
| Archivio istituzionale della ricerca - Università dell'Insubria | Computers & Graphics | CNR ExploRA
2005
Journal article
Open Access
A static mapping heuristics to map parallel applications to heterogeneous computing systems
Baraglia R., Ferrini R., Ritrovato P.
In order to minimize the execution time of a parallel application running on a heterogeneously distributed computing system, an appropriate mapping scheme is needed to allocate the application tasks to the processors . The general problem of mapping tasks to machines is a well known NP-hard problem and several heuristics have been proposed to approximate its optimal solution. In this paper we propose a static graph-based mapping algorithm, called Heterogeneous Multi-phase Mapping (HMM), that permits suboptimal mapping of a parallel application onto a heterogeneous computing distributed system by using a local search technique together with a tabu search meta-heuristic. HMM allocates parallel tasks by exploiting the information embedded in the parallelism forms used to implement an application, and considering an affinity parameter, that identifies which machine in the HC system is most suitable for executing a task. We compare HMM with four different leading techniques and with an exhaustive mapping algorithm. We also give an example of mapping of two real applications using HMM. Experimental results show that HMM performs well demonstrating the applicability of our approach.Source: Concurrency and computation 17 (2005): 1579–1605. doi:10.1002/cpe.902
DOI: 10.1002/cpe.902
Metrics:
Baraglia R., Ferrini R., Ritrovato P.
In order to minimize the execution time of a parallel application running on a heterogeneously distributed computing system, an appropriate mapping scheme is needed to allocate the application tasks to the processors . The general problem of mapping tasks to machines is a well known NP-hard problem and several heuristics have been proposed to approximate its optimal solution. In this paper we propose a static graph-based mapping algorithm, called Heterogeneous Multi-phase Mapping (HMM), that permits suboptimal mapping of a parallel application onto a heterogeneous computing distributed system by using a local search technique together with a tabu search meta-heuristic. HMM allocates parallel tasks by exploiting the information embedded in the parallelism forms used to implement an application, and considering an affinity parameter, that identifies which machine in the HC system is most suitable for executing a task. We compare HMM with four different leading techniques and with an exhaustive mapping algorithm. We also give an example of mapping of two real applications using HMM. Experimental results show that HMM performs well demonstrating the applicability of our approach.Source: Concurrency and computation 17 (2005): 1579–1605. doi:10.1002/cpe.902
DOI: 10.1002/cpe.902
Metrics:
See at:
Concurrency and Computation Practice and Experience | dl.acm.org | Concurrency and Computation Practice and Experience | CNR ExploRA
2005
Conference article
Unknown
Adaptative optimal bandwidth partitioning among TCP elephant connections over multiple rain-faded satellite channels
Celandroni N., Davoli F., Ferro E., Gotta A.
The assignment of a common bandwidth resource to TCP connections over a satellite channel is considered in the paper. The connections are grouped according to their source-destination pairs, corresponding to up- and down-link channels traversed, and each group may experience different fading conditions. By exploiting the tradeoff between bandwidth and channel redundancy (as determined by bit and coding rates) in the maximization of TCP goodput, an overall optimization problem is constructed, which can be solved by numerical techniques. Different relations between goodput maximization and fairness of the allocation are investigated. The allocation strategies are tested and compared in a real dynamic fading environment.Source: International Workshop on QoS in Multiservice IP Networks QoS - IP, pp. 559–573, Catania, Italy, 2-4 February 2005
Celandroni N., Davoli F., Ferro E., Gotta A.
The assignment of a common bandwidth resource to TCP connections over a satellite channel is considered in the paper. The connections are grouped according to their source-destination pairs, corresponding to up- and down-link channels traversed, and each group may experience different fading conditions. By exploiting the tradeoff between bandwidth and channel redundancy (as determined by bit and coding rates) in the maximization of TCP goodput, an overall optimization problem is constructed, which can be solved by numerical techniques. Different relations between goodput maximization and fairness of the allocation are investigated. The allocation strategies are tested and compared in a real dynamic fading environment.Source: International Workshop on QoS in Multiservice IP Networks QoS - IP, pp. 559–573, Catania, Italy, 2-4 February 2005
See at: CNR ExploRA
2005
Journal article
Open Access
An Analysis of the relative hardness of reuters-21578 subsets
Debole F., Sebastiani F.
The existence, public availability, and widespread acceptance of a standard benchmark for a given information retrieval (IR) task are beneficial to research on this task, because they allow different researchers to experimentally compare their own systems by comparing the results they have obtained on this benchmark. The Reuters-21578 test collection, together with its earlier variants, has been such a standard benchmark for the text categorization (TC) task throughout the last 10 years.However , the benefits that this has brought about have somehow been limited by the fact that different researchers have 'carved' different subsets out of this collection and tested their systems on one of these subsets only; systems that have been tested on different Reuters-21578 subsets are thus not readily comparable.In this article, we present a systematic, comparative experimental study of the three subsets of Reuters-21578 that have been most popular among TC researchers.The results we obtain allow us to determine the relative hardness of these subsets, thus establishing an indirect means for comparing TC systems that have, or will be, tested on these different subsets.Source: Journal of the American Society for Information Science and Technology (Print) 56 (2005): 584–596. doi:10.1002/asi.20147
DOI: 10.1002/asi.20147
Metrics:
Debole F., Sebastiani F.
The existence, public availability, and widespread acceptance of a standard benchmark for a given information retrieval (IR) task are beneficial to research on this task, because they allow different researchers to experimentally compare their own systems by comparing the results they have obtained on this benchmark. The Reuters-21578 test collection, together with its earlier variants, has been such a standard benchmark for the text categorization (TC) task throughout the last 10 years.However , the benefits that this has brought about have somehow been limited by the fact that different researchers have 'carved' different subsets out of this collection and tested their systems on one of these subsets only; systems that have been tested on different Reuters-21578 subsets are thus not readily comparable.In this article, we present a systematic, comparative experimental study of the three subsets of Reuters-21578 that have been most popular among TC researchers.The results we obtain allow us to determine the relative hardness of these subsets, thus establishing an indirect means for comparing TC systems that have, or will be, tested on these different subsets.Source: Journal of the American Society for Information Science and Technology (Print) 56 (2005): 584–596. doi:10.1002/asi.20147
DOI: 10.1002/asi.20147
Metrics:
See at:
Journal of the American Society for Information Science and Technology | Journal of the American Society for Information Science and Technology | onlinelibrary.wiley.com | CNR ExploRA
2005
Conference article
Unknown
An architecture-centric approach for producing quality systems
Bertolino A., Bucchiarone A., Gnesi S., Muccini H.
Software architecture has been advocated as an a®ective means to produce quality systems. In this working paper, we argue that integration between analysis conducted at different stages of development is still lacking. Hence we propose an architecture-centric approach, which by combining di®erent technologies and tools for analysis and testing supports a seamless tool-supported approach to validating required properties. The idea is to start from the requirements, produce a validated model of the SA, and then use the SA to derive a set of conformance test cases. In this paper, we outline the process, and discuss how some existing tools, namely QuARS, ModTest, CowTest and UIT, could be exploited to support the approach. The integrated framework is under development.Source: First International Conference on the Quality of Software, pp. 21–37, Erfurt, Germany, 20-22 September 2005
Bertolino A., Bucchiarone A., Gnesi S., Muccini H.
Software architecture has been advocated as an a®ective means to produce quality systems. In this working paper, we argue that integration between analysis conducted at different stages of development is still lacking. Hence we propose an architecture-centric approach, which by combining di®erent technologies and tools for analysis and testing supports a seamless tool-supported approach to validating required properties. The idea is to start from the requirements, produce a validated model of the SA, and then use the SA to derive a set of conformance test cases. In this paper, we outline the process, and discuss how some existing tools, namely QuARS, ModTest, CowTest and UIT, could be exploited to support the approach. The integrated framework is under development.Source: First International Conference on the Quality of Software, pp. 21–37, Erfurt, Germany, 20-22 September 2005
See at: CNR ExploRA
2005
Conference article
Unknown
Analysing trans-modal interface migration
Bandelloni R., Berti S., Paternò F.
While new solutions for supporting migratory interfaces are emerging, there is still a lack of analysis of their impact on users. In this paper we discuss the design of a solution for trans-modal migratory interfaces in multidevice and results obtained testing it with users. We conducted a study aimed at evaluating the user impact of a migration service applied to platforms supporting different interaction modalities (graphic vs. vocal) in Web environments.Source: Human-Computer Interaction - INTERACT 2005: IFIP TC13 International, pp. 1071–1074, Rome, Italy, 12-16 September 2005
Bandelloni R., Berti S., Paternò F.
While new solutions for supporting migratory interfaces are emerging, there is still a lack of analysis of their impact on users. In this paper we discuss the design of a solution for trans-modal migratory interfaces in multidevice and results obtained testing it with users. We conducted a study aimed at evaluating the user impact of a migration service applied to platforms supporting different interaction modalities (graphic vs. vocal) in Web environments.Source: Human-Computer Interaction - INTERACT 2005: IFIP TC13 International, pp. 1071–1074, Rome, Italy, 12-16 September 2005
See at: CNR ExploRA
2005
Journal article
Unknown
Anonymity and data mining
Atzori M., Bonchi F., Giannotti F., Pedreschi D.
Improving trust in the knowledge society is a key requirement for its development. Privacy-awareness, if addressed at a technical level and acknowledged by regulations and social norms, may foster social acceptance and dissemination of new emerging knowledge-based applications. This is true of data mining, which is aimed at learning patterns, models and trends that hold across a collection of data. While the potential benefits of data mining are clear, it is also clear that the analysis of personal sensitive data arouses concerns about citizen's privacy, confidentiality and freedom. In this paper we focus on individual privacy, or anonymity, from a data mining perspective. It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in order to ensure a required statistical significance, represent a large number of individuals and thus conceal individual identities: this is the case of the minimum support threshold in association rule mining. In this paper we show that this belief is ill-founded. By shifting the concept of k-anonymity from the source data to the extracted patterns, we formally characterize the notion of a threat to anonymity in the context of pattern discovery, and provide a methodology to efficiently and effectively identify all possible such threats that might arise from the disclosure of a set of extracted patterns. On this basis, we obtain a formal and effective notion of privacy protection that allows the disclosure of the extracted knowledge together with the proof that it does not violate the anonymity of the individuals in the source database.Source: Computer systems science and engineering 20 (2005): 369–376.
Atzori M., Bonchi F., Giannotti F., Pedreschi D.
Improving trust in the knowledge society is a key requirement for its development. Privacy-awareness, if addressed at a technical level and acknowledged by regulations and social norms, may foster social acceptance and dissemination of new emerging knowledge-based applications. This is true of data mining, which is aimed at learning patterns, models and trends that hold across a collection of data. While the potential benefits of data mining are clear, it is also clear that the analysis of personal sensitive data arouses concerns about citizen's privacy, confidentiality and freedom. In this paper we focus on individual privacy, or anonymity, from a data mining perspective. It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in order to ensure a required statistical significance, represent a large number of individuals and thus conceal individual identities: this is the case of the minimum support threshold in association rule mining. In this paper we show that this belief is ill-founded. By shifting the concept of k-anonymity from the source data to the extracted patterns, we formally characterize the notion of a threat to anonymity in the context of pattern discovery, and provide a methodology to efficiently and effectively identify all possible such threats that might arise from the disclosure of a set of extracted patterns. On this basis, we obtain a formal and effective notion of privacy protection that allows the disclosure of the extracted knowledge together with the proof that it does not violate the anonymity of the individuals in the source database.Source: Computer systems science and engineering 20 (2005): 369–376.
See at: CNR ExploRA
2005
Journal article
Unknown
Any-world assumptions in logic programming
Loyer Y., Straccia U.
Due to the usual incompleteness of information representation, any approach to assign a semantics to logic programs has to rely on a default assumption on the missing information. The emph{stable model semantics}, that has become the dominating approach to give semantics to logic programs, relies on the Closed World Assumption (CWA), which asserts that by default the truth of an atom is emph{false}. There is a second well-known assumption, called emph{Open World Assumption} (OWA), which asserts that the truth of the atoms is supposed to be emph{unknown} by default. However, the CWA, the OWA and the combination of them are extremal, though important, assumptions over a large variety of possible assumptions on the truth of the atoms, whenever the truth is taken from emph{an arbitrary truth space}. The topic of this paper is to allow emph{any} assignment (ie interpretation), over a truth space, to be a default assumption. Our main result is that our extension is conservative in the sense that under the ``everywhere false' default assumption (CWA) the usual stable model semantics is captured. Due to the generality and the purely algebraic nature of our approach, it abstracts from the particular formalism of choice and the results may be applied in other contexts as well.Source: Theoretical computer science 342 (2005): 351–381.
Loyer Y., Straccia U.
Due to the usual incompleteness of information representation, any approach to assign a semantics to logic programs has to rely on a default assumption on the missing information. The emph{stable model semantics}, that has become the dominating approach to give semantics to logic programs, relies on the Closed World Assumption (CWA), which asserts that by default the truth of an atom is emph{false}. There is a second well-known assumption, called emph{Open World Assumption} (OWA), which asserts that the truth of the atoms is supposed to be emph{unknown} by default. However, the CWA, the OWA and the combination of them are extremal, though important, assumptions over a large variety of possible assumptions on the truth of the atoms, whenever the truth is taken from emph{an arbitrary truth space}. The topic of this paper is to allow emph{any} assignment (ie interpretation), over a truth space, to be a default assumption. Our main result is that our extension is conservative in the sense that under the ``everywhere false' default assumption (CWA) the usual stable model semantics is captured. Due to the generality and the purely algebraic nature of our approach, it abstracts from the particular formalism of choice and the results may be applied in other contexts as well.Source: Theoretical computer science 342 (2005): 351–381.
See at: CNR ExploRA
2005
Journal article
Restricted
Computational methods for reentry trajectories and risk assessment
Anselmo L., Pardini C.
The trajectory modeling of uncontrolled satellites close to reentry in the atmosphere is still a challenging activity. Tracking data may be sparse and not particularly accurate, the objects complicate shape and unknown attitude evolution may render difficult the aerodynamic computations and, last but not the least, the models used to predict the air density at the altitudes of interest, as a function of solar and geomagnetic activity, are affected by significant uncertainties. After a brief overview of the relevance of the risk related to satellite reentries and debris survival down to the ground, the paper describes some of the methods and techniques developed in support of the reentry predictions carried out for civil protection purposes. An appropriate management of the intrinsic uncertainties of the problem is in fact critical for the dissemination of the information, avoiding, as much as possible, misunderstandings and unjustified alarm. Special attention is paid to the evaluation of the risk, the availability of orbit determinations, the uncertainties of the residual lifetime estimation, and the definition of reentry and risk windows. When possible, the discussion is supported by real data, results and examples, often based on the authors direct experience and researches.Source: Advances in space research 35 (2005): 1343–1352. doi:10.1016/j.asr.2005.04.089
DOI: 10.1016/j.asr.2005.04.089
Metrics:
Anselmo L., Pardini C.
The trajectory modeling of uncontrolled satellites close to reentry in the atmosphere is still a challenging activity. Tracking data may be sparse and not particularly accurate, the objects complicate shape and unknown attitude evolution may render difficult the aerodynamic computations and, last but not the least, the models used to predict the air density at the altitudes of interest, as a function of solar and geomagnetic activity, are affected by significant uncertainties. After a brief overview of the relevance of the risk related to satellite reentries and debris survival down to the ground, the paper describes some of the methods and techniques developed in support of the reentry predictions carried out for civil protection purposes. An appropriate management of the intrinsic uncertainties of the problem is in fact critical for the dissemination of the information, avoiding, as much as possible, misunderstandings and unjustified alarm. Special attention is paid to the evaluation of the risk, the availability of orbit determinations, the uncertainties of the residual lifetime estimation, and the definition of reentry and risk windows. When possible, the discussion is supported by real data, results and examples, often based on the authors direct experience and researches.Source: Advances in space research 35 (2005): 1343–1352. doi:10.1016/j.asr.2005.04.089
DOI: 10.1016/j.asr.2005.04.089
Metrics:
See at:
Advances in Space Research | CNR ExploRA