Launched in 2006, the Portuguese National Grid Initiative aims to support the development of resource sharing for demanding computing applications and ensure the enhancement of strategic competences and capacities of special interest for this type of computing in Portugal. In this paper we provide an overview of grid computing in Portugal and we describe the Portuguese National Initiative activities, current status and future plans. Among these is the deployment of a grid infrastructure for scientific computing that is now being prepared within the context of the Initiative.
{"title":"The Portuguese Grid Initiative","authors":"G. Barreira, J. Gomes, G. Borges","doi":"10.1109/ADVCOMP.2008.43","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.43","url":null,"abstract":"Launched in 2006, the Portuguese National Grid Initiative aims to support the development of resource sharing for demanding computing applications and ensure the enhancement of strategic competences and capacities of special interest for this type of computing in Portugal. In this paper we provide an overview of grid computing in Portugal and we describe the Portuguese National Initiative activities, current status and future plans. Among these is the deployment of a grid infrastructure for scientific computing that is now being prepared within the context of the Initiative.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115450528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The reported work proposes a new algorithm for classification tasks, an algorithm based on independent directions of the sample data. The classes are learned by the algorithm using the information contained by samples randomly generated from them. The learning process is based on the set of class skeletons, where the class skeleton is represented by the independent axes estimated from data. Basically, for each new sample, the recognition algorithm classifies it in the class whose skeleton is the "nearest" to this example. Comparative analysis is performed and experimentally derived conclusions concerning the performance of the proposed method are reported in the final section of the paper for signals recognition applications.
{"title":"Independent Directions-Based Algorithm for Classification Targets","authors":"D. Constantin, L. State","doi":"10.1109/ADVCOMP.2008.37","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.37","url":null,"abstract":"The reported work proposes a new algorithm for classification tasks, an algorithm based on independent directions of the sample data. The classes are learned by the algorithm using the information contained by samples randomly generated from them. The learning process is based on the set of class skeletons, where the class skeleton is represented by the independent axes estimated from data. Basically, for each new sample, the recognition algorithm classifies it in the class whose skeleton is the \"nearest\" to this example. Comparative analysis is performed and experimentally derived conclusions concerning the performance of the proposed method are reported in the final section of the paper for signals recognition applications.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121058334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents the architecture of a middleware for control component-based distributed systems. The fundamental idea underlying this architecture is the use of a hierarchical communications structure called "logical namespace tree" and a structured set of control processes interconnected, called "logical sensors graph". This architecture is named frame sensor adapter control (FSA-Ctrl). The aim of FSA-Ctrl is to provide a simple interface to specify the control actions and ensure a communication with some specified QoS parameters restrictions. In this architecture both systems, communication and control, manages the QoS policies. The communication system is based on the data distribution service (DDS), a standard proposed by object management group (OMG). Control system is derived from the sensor Web enablement (SWE) model proposed by open geospatial consortium (OGC). The system introduced in this paper is focused on the use of QoS parameters of the distributed systems components to manage the information redundancy.
{"title":"Middleware with QoS Support to Control Intelligent Systems","authors":"J. Lujan, J. Yague, J. Ten","doi":"10.1109/ADVCOMP.2008.22","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.22","url":null,"abstract":"This paper presents the architecture of a middleware for control component-based distributed systems. The fundamental idea underlying this architecture is the use of a hierarchical communications structure called \"logical namespace tree\" and a structured set of control processes interconnected, called \"logical sensors graph\". This architecture is named frame sensor adapter control (FSA-Ctrl). The aim of FSA-Ctrl is to provide a simple interface to specify the control actions and ensure a communication with some specified QoS parameters restrictions. In this architecture both systems, communication and control, manages the QoS policies. The communication system is based on the data distribution service (DDS), a standard proposed by object management group (OMG). Control system is derived from the sensor Web enablement (SWE) model proposed by open geospatial consortium (OGC). The system introduced in this paper is focused on the use of QoS parameters of the distributed systems components to manage the information redundancy.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129357678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
One way to see the semantic Web is to think of it as a set of all-knowing technologies that respond to whatever the user asks. The other view is that it is a set of standards and tools that help build better Web applications. Since the latter is probably more realistic at the moment, it means that a lot of software has to be developed before we start actually seeing the semantic Web in widespread use.Many developers would be needed for the task and unless we "win their hearts and minds", they are likely to obstruct rather than support the semantic Web idea. And from the average developer's point of view, there is not much to like on today's RDF query languages, especially when compared with relational algebra and SQL. Besides the fact that they are built on different principles, none of the languages we are aware of has a property that has served SQL so well - they are not closed.
{"title":"Everything You Ever Wanted to Learn from the Semantic Web but Were Unable to Ask","authors":"J. Dokulil, J. Yaghob, J. Katreniaková","doi":"10.1109/ADVCOMP.2008.12","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.12","url":null,"abstract":"One way to see the semantic Web is to think of it as a set of all-knowing technologies that respond to whatever the user asks. The other view is that it is a set of standards and tools that help build better Web applications. Since the latter is probably more realistic at the moment, it means that a lot of software has to be developed before we start actually seeing the semantic Web in widespread use.Many developers would be needed for the task and unless we \"win their hearts and minds\", they are likely to obstruct rather than support the semantic Web idea. And from the average developer's point of view, there is not much to like on today's RDF query languages, especially when compared with relational algebra and SQL. Besides the fact that they are built on different principles, none of the languages we are aware of has a property that has served SQL so well - they are not closed.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"45 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134530898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A graph-based method is described for searching and ranking clusters of polyhedra in large crystallographic databases. First, embeddings of topologically equivalent substructures are determined for a given target cluster based upon a graph representation of polyhedral networks. Then, an algorithm for solving the problem of absolute orientation is applied in order to rank topologically equivalent clusters according to their geometric similarity.
{"title":"Searching and Ranking Similar Clusters of Polyhedra in Crystal Structures","authors":"Hans-Joachim Klein, Christian Mennerich","doi":"10.1109/ADVCOMP.2008.34","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.34","url":null,"abstract":"A graph-based method is described for searching and ranking clusters of polyhedra in large crystallographic databases. First, embeddings of topologically equivalent substructures are determined for a given target cluster based upon a graph representation of polyhedral networks. Then, an algorithm for solving the problem of absolute orientation is applied in order to rank topologically equivalent clusters according to their geometric similarity.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122130459","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We present an algorithm which analyzes memory requirements of the streaming processing of a given XSLT stylesheet on the set of XML documents defined by a given XML schema. This schema-based analyzer represents an integral part of the Xord framework for the streaming processing of XSLT - it determines the most efficient streaming algorithm for a given transformation and the class of XML documents defined by a schema. We describe the implementation of the analyzer for the stack-based streaming algorithm.The analysis is performed using the W3C XSD format for schemas. We introduce a new compact structure for XSD representation used in the analysis.
{"title":"Schema-Based Analysis of XSLT Streamability","authors":"J. Dvořáková, F. Zavoral","doi":"10.1109/ADVCOMP.2008.27","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.27","url":null,"abstract":"We present an algorithm which analyzes memory requirements of the streaming processing of a given XSLT stylesheet on the set of XML documents defined by a given XML schema. This schema-based analyzer represents an integral part of the Xord framework for the streaming processing of XSLT - it determines the most efficient streaming algorithm for a given transformation and the class of XML documents defined by a schema. We describe the implementation of the analyzer for the stack-based streaming algorithm.The analysis is performed using the W3C XSD format for schemas. We introduce a new compact structure for XSD representation used in the analysis.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127109816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a large number of applications, engineers have to estimate values of an unknown function given some observed samples. This task is referred to as function approximation or as generalization. One way to solve the problem is to regress a family of parameterized functions so as to make it fit at best the observed samples. Yet, usually batch methods are used and parameterization is habitually linear. Moreover, very few approaches try to quantify uncertainty reduction occurring when acquiring more samples (thus more information), which can be quite useful depending on the application. In this paper we propose a sparse nonlinear Bayesian online kernel regression. Sparsity is achieved in a preprocessing step by using a dictionary method. The nonlinear Bayesian kernel regression can therefore be considered as achieved online by a Sigma Point Kalman filter. First experiments on a cardinal sine regression show that our approach is promising.
{"title":"A Sparse Nonlinear Bayesian Online Kernel Regression","authors":"M. Geist, O. Pietquin, G. Fricout","doi":"10.1109/ADVCOMP.2008.7","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.7","url":null,"abstract":"In a large number of applications, engineers have to estimate values of an unknown function given some observed samples. This task is referred to as function approximation or as generalization. One way to solve the problem is to regress a family of parameterized functions so as to make it fit at best the observed samples. Yet, usually batch methods are used and parameterization is habitually linear. Moreover, very few approaches try to quantify uncertainty reduction occurring when acquiring more samples (thus more information), which can be quite useful depending on the application. In this paper we propose a sparse nonlinear Bayesian online kernel regression. Sparsity is achieved in a preprocessing step by using a dictionary method. The nonlinear Bayesian kernel regression can therefore be considered as achieved online by a Sigma Point Kalman filter. First experiments on a cardinal sine regression show that our approach is promising.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130103454","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
I. Blanquer, V. Hernández, D. Segrelles, E. Torres
TRENCADIS (towards a grid environment to process and share DICOM objects) is a data sharing infrastructure based on grid technologies that federate distributed repositories of radiological studies using ontological models on the information of the structured reports. TRENCADIS has demonstrated its efficiency in data sharing. This work describes an extension of the architecture, based on WSRF, to deal with both high-performance and high-throughput applications on medical images. This enables TRENCADIS to work with complex workflows exploiting the computing capabilities of current e-infrastructures, such as EGEE.
{"title":"Introducing High-Performance and High-Throughput Processing in the TRENCADIS Data Sharing Architecture","authors":"I. Blanquer, V. Hernández, D. Segrelles, E. Torres","doi":"10.1109/ADVCOMP.2008.23","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.23","url":null,"abstract":"TRENCADIS (towards a grid environment to process and share DICOM objects) is a data sharing infrastructure based on grid technologies that federate distributed repositories of radiological studies using ontological models on the information of the structured reports. TRENCADIS has demonstrated its efficiency in data sharing. This work describes an extension of the architecture, based on WSRF, to deal with both high-performance and high-throughput applications on medical images. This enables TRENCADIS to work with complex workflows exploiting the computing capabilities of current e-infrastructures, such as EGEE.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130789118","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Almeida-Luz, M. A. Vega-Rodríguez, J. Gómez-Pulido, J. M. Sánchez-Pérez
The mobile networks are every day more commonand useful, but the costs involved in its management are high. The location area partitioning is a strategy of location management that tries to minimize the involved costs. In this paper we present a new approach based on differential evolution algorithm applied to the location area partitioning, as a cost optimization problem. We use realistic dat for generating the test networks. This work has the objective of defining the best values to the differential evolution (DE) parameters and setting the DE scheme, which allows us to obtain better results when compared to classical strategies and the other authors' results. The best solution is obtained after the development of four distinct experiments, each one applied to one of the differential evolution parameters. The final results obtained by this approach are very good.
{"title":"Applying Differential Evolution to a Realistic Location Area Problem Using SUMATRA","authors":"S. Almeida-Luz, M. A. Vega-Rodríguez, J. Gómez-Pulido, J. M. Sánchez-Pérez","doi":"10.1109/ADVCOMP.2008.19","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.19","url":null,"abstract":"The mobile networks are every day more commonand useful, but the costs involved in its management are high. The location area partitioning is a strategy of location management that tries to minimize the involved costs. In this paper we present a new approach based on differential evolution algorithm applied to the location area partitioning, as a cost optimization problem. We use realistic dat for generating the test networks. This work has the objective of defining the best values to the differential evolution (DE) parameters and setting the DE scheme, which allows us to obtain better results when compared to classical strategies and the other authors' results. The best solution is obtained after the development of four distinct experiments, each one applied to one of the differential evolution parameters. The final results obtained by this approach are very good.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122239434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper addresses the computation of the response to a sinusoidal input of a dual-rate linear time-invariant discrete system from a lifted transfer function model. Such response will consist on a fundamental component with the same frequency as the input signal, plus another components at different frequencies induced by the lifting and inverse-lifting operations. Based on those results, a generalized Bode diagram is suggested.
{"title":"Frequency Response of Discrete Dual-Rate Systems","authors":"A. Sala, J. Salt, J. Sandoval","doi":"10.1109/ADVCOMP.2008.29","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.29","url":null,"abstract":"This paper addresses the computation of the response to a sinusoidal input of a dual-rate linear time-invariant discrete system from a lifted transfer function model. Such response will consist on a fundamental component with the same frequency as the input signal, plus another components at different frequencies induced by the lifting and inverse-lifting operations. Based on those results, a generalized Bode diagram is suggested.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"65 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126172110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：