The biggest particle accelerator in the world, the LHC, began to work in August 2008 and the four high energy experiments (ALICE, ATLAS, CMS and LHCb) hosted in the beam crossing caverns start to take data. The amount of collected data was very huge ( about several PB) and the grid infrastructure developed and deployed in the last 9 years was monitored and put under challenging situations. In this talk a review of the main parts of the LCG, the LHC computing grid project, was explained and the recent performance studies obtained at CERN was presented. A special description of the ATLAS computing model was given.
{"title":"The GRID Computing Face with the Start of the LHC Experiments","authors":"J. Cairols","doi":"10.1109/ADVCOMP.2008.46","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.46","url":null,"abstract":"The biggest particle accelerator in the world, the LHC, began to work in August 2008 and the four high energy experiments (ALICE, ATLAS, CMS and LHCb) hosted in the beam crossing caverns start to take data. The amount of collected data was very huge ( about several PB) and the grid infrastructure developed and deployed in the last 9 years was monitored and put under challenging situations. In this talk a review of the main parts of the LCG, the LHC computing grid project, was explained and the recent performance studies obtained at CERN was presented. A special description of the ATLAS computing model was given.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"10 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":"124243391","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}
J. M. Chaves-González, M. A. Vega-Rodríguez, D. Domínguez-González, J. Gómez-Pulido, J. M. Sánchez-Pérez
In this paper we study different versions of the PBIL (population-based incremental learning) algorithm to evaluate and try to improve the results obtained by the standard version of the algorithm when it is used to solve a realistic-sized frequency assignment problem (FAP). PBIL is based on genetic algorithms and competitive learning, being a population evolution model based on probabilistic models. On the other hand, it is important to point out that frequency planning is a very important task for current GSM operators. The FAP problem consists in trying to minimize the number of interferences (or conflicts in the communications) caused when a limited number of frequencies has to be assigned to a quite high number of transceivers (and there are much more transceivers than frequencies). In the work presented here we take as initial point the results obtained with the standard version of PBIL and we perform on the one hand a complete study with six variations of the algorithm (PBIL-negativeLR, PBIL-different, etc.) and on the other hand a hybridization between PBIL and a local search method. Our final goal is to discover which approach can compute the most accurate frequency plans for real-world instances.
{"title":"Studying Different Variants of PBIL to Solve a Real-World FAP Problem in GSM Networks","authors":"J. M. Chaves-González, M. A. Vega-Rodríguez, D. Domínguez-González, J. Gómez-Pulido, J. M. Sánchez-Pérez","doi":"10.1109/ADVCOMP.2008.11","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.11","url":null,"abstract":"In this paper we study different versions of the PBIL (population-based incremental learning) algorithm to evaluate and try to improve the results obtained by the standard version of the algorithm when it is used to solve a realistic-sized frequency assignment problem (FAP). PBIL is based on genetic algorithms and competitive learning, being a population evolution model based on probabilistic models. On the other hand, it is important to point out that frequency planning is a very important task for current GSM operators. The FAP problem consists in trying to minimize the number of interferences (or conflicts in the communications) caused when a limited number of frequencies has to be assigned to a quite high number of transceivers (and there are much more transceivers than frequencies). In the work presented here we take as initial point the results obtained with the standard version of PBIL and we perform on the one hand a complete study with six variations of the algorithm (PBIL-negativeLR, PBIL-different, etc.) and on the other hand a hybridization between PBIL and a local search method. Our final goal is to discover which approach can compute the most accurate frequency plans for real-world instances.","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":"133190463","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}
E. Parras-Gutierrez, M. J. del Jesus, V. Rivas, J. Merelo
Increasing the usability of traditional methods is one of the key issues on future trends in data mining. Nevertheless, most data mining algorithms need to be given a suitable set of parameters for every problem they face, thus methods to automatically search the values of these parameters are required. This paper introduces two co-evolutionary algorithms intended to automatically establish the parameters needed to design radial basis function neural networks. Results show that both algorithms can be effectively used to obtain good models, while reducing significantly the number of parameters to be fixed at hand.
{"title":"Parameter Estimation for Radial Basis Function Neural Network Design by Means of Two Symbiotic Algorithms","authors":"E. Parras-Gutierrez, M. J. del Jesus, V. Rivas, J. Merelo","doi":"10.1109/ADVCOMP.2008.20","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.20","url":null,"abstract":"Increasing the usability of traditional methods is one of the key issues on future trends in data mining. Nevertheless, most data mining algorithms need to be given a suitable set of parameters for every problem they face, thus methods to automatically search the values of these parameters are required. This paper introduces two co-evolutionary algorithms intended to automatically establish the parameters needed to design radial basis function neural networks. Results show that both algorithms can be effectively used to obtain good models, while reducing significantly the number of parameters to be fixed at hand.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"24 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":"116626838","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 presence of a large quantity of unlabeled documents on the web increases, and organizing related heterogeneous XML documents by using their structural and conceptual properties into clusters become a great need. In this paper, we consider the pre-processing step as a key step to improve clustering quality, we propose a new pre-processing method which is based on combining Hapax words and path-based descriptors. A constrained agglomerative clustering method is used, and a comparison between different document representations is performed. The effectiveness of the method is evaluated on the INEX corpus, and clustering quality is measured by using micro and macro average purity measures.
{"title":"Towards Compromising Structural and Bag of Words Approaches for Clustering Heterogeneous XML Documents","authors":"Nadia Zerida, Jin Yao","doi":"10.1109/ADVCOMP.2008.28","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.28","url":null,"abstract":"The presence of a large quantity of unlabeled documents on the web increases, and organizing related heterogeneous XML documents by using their structural and conceptual properties into clusters become a great need. In this paper, we consider the pre-processing step as a key step to improve clustering quality, we propose a new pre-processing method which is based on combining Hapax words and path-based descriptors. A constrained agglomerative clustering method is used, and a comparison between different document representations is performed. The effectiveness of the method is evaluated on the INEX corpus, and clustering quality is measured by using micro and macro average purity measures.","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":"129284589","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 this paper, we present the design and architecture of an interoperable solution in order to transparently and securely access French and Japanese computing resources. The aim is to propose an international sparse linear algebra expert system available through a Web portal where a user can request some analysis on the resolution of a problem involving different kind of matrices, solvers and heuristics, and using different architectures. Hence, numerous validation studies can be performed. The solution mostly relies on the integration of a "protocol'' interoperability between the French and Japanese grid middleware DIET and AEGIS.
{"title":"Implementing Interoperability between the AEGIS and DIET GridRPC Middleware to Build an International Sparse Linear Algebra Expert System","authors":"Y. Caniou, Noriyuki Kushida, Naoya Teshima","doi":"10.1109/ADVCOMP.2008.31","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.31","url":null,"abstract":"In this paper, we present the design and architecture of an interoperable solution in order to transparently and securely access French and Japanese computing resources. The aim is to propose an international sparse linear algebra expert system available through a Web portal where a user can request some analysis on the resolution of a problem involving different kind of matrices, solvers and heuristics, and using different architectures. Hence, numerous validation studies can be performed. The solution mostly relies on the integration of a \"protocol'' interoperability between the French and Japanese grid middleware DIET and AEGIS.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"481 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":"125778776","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 wavelet transform has been shown to be a powerful tool for characterising network traffic.However, the resulting decomposition of a wavelet transform typically forms a high-dimension space. This is obviously problematic on compact representations,visualizations, and modelling approaches that are based on these high-dimensional data. In this study, we show how data projection techniques can represent the high-dimensional wavelet decomposition in a low dimensional space to facilitate visual analysis. A low dimensional representation can significantly reduce the model complexity. Hence, features in the data can be presented with a small number of parameters. We demonstrate these projections in the context of network traffic pattern analysis. The experimental results show that the proposed method can effectively discriminate between different application flows, such as FTP and P2P.
{"title":"A Novel Visual Discriminator for Network Traffic Patterns","authors":"Liangxiu Han, J. V. van Hemert","doi":"10.1109/ADVCOMP.2008.35","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.35","url":null,"abstract":"The wavelet transform has been shown to be a powerful tool for characterising network traffic.However, the resulting decomposition of a wavelet transform typically forms a high-dimension space. This is obviously problematic on compact representations,visualizations, and modelling approaches that are based on these high-dimensional data. In this study, we show how data projection techniques can represent the high-dimensional wavelet decomposition in a low dimensional space to facilitate visual analysis. A low dimensional representation can significantly reduce the model complexity. Hence, features in the data can be presented with a small number of parameters. We demonstrate these projections in the context of network traffic pattern analysis. The experimental results show that the proposed method can effectively discriminate between different application flows, such as FTP and P2P.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"17 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":"122425356","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 this work we present the e-CA (e-Ciencia Andaluza) project, a pioneering initiative in Spain initially started by a team from the Instituto de Astrofisica de Andalucia, aiming to provide the basis for the development and coordination of Andalusian e-Science and its integration in the national Spanish e-Science network. This project involves more than 70 researchers from diverse scientific areas, including economy, particle physics, geophysics, physics of the atmosphere, bioinformatics or astrophysics among others. Here we will describe the firsts steps of e-CA, including the preparation of the Yellow Pages of the Andalusian e-Science. In the second part of this work we will describe as an example of the ongoing activities in the astrophysics area.
{"title":"The Andalusian e-Science Initiative (e-CA). An Application to Astrophysics","authors":"Lourdes Verdes-Montenegro, Juan de Dios Santander","doi":"10.1109/ADVCOMP.2008.45","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.45","url":null,"abstract":"In this work we present the e-CA (e-Ciencia Andaluza) project, a pioneering initiative in Spain initially started by a team from the Instituto de Astrofisica de Andalucia, aiming to provide the basis for the development and coordination of Andalusian e-Science and its integration in the national Spanish e-Science network. This project involves more than 70 researchers from diverse scientific areas, including economy, particle physics, geophysics, physics of the atmosphere, bioinformatics or astrophysics among others. Here we will describe the firsts steps of e-CA, including the preparation of the Yellow Pages of the Andalusian e-Science. In the second part of this work we will describe as an example of the ongoing activities in the astrophysics area.","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":"126275874","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 the last few years there have appeared different initiatives for creating workflow environments to be used in grid deployments. This paper analyzes the state of the art of the proposals for workflow applied to grid computing and proposes an alternative providing new features, focusing on multigrid and extensibility capabilities. The workflow system developed is based on the definition of a workflow modelling language named WINGs. The features provided by this language will set the capabilities needed in the execution engine and therefore the functionality of the whole system. A use case in combination with the Fura grid middleware is described to show the functionality of the current development.
{"title":"WINGS: Versatile Workflow for the Grid","authors":"C. Alfonso, M. Caballer, V. Hernández","doi":"10.1109/ADVCOMP.2008.14","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.14","url":null,"abstract":"In the last few years there have appeared different initiatives for creating workflow environments to be used in grid deployments. This paper analyzes the state of the art of the proposals for workflow applied to grid computing and proposes an alternative providing new features, focusing on multigrid and extensibility capabilities. The workflow system developed is based on the definition of a workflow modelling language named WINGs. The features provided by this language will set the capabilities needed in the execution engine and therefore the functionality of the whole system. A use case in combination with the Fura grid middleware is described to show the functionality of the current development.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"36 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":"128359537","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 shows how the Unified Modeling Language(UML) can be used to represent a textual object or sentence of a natural language. Precisely, the representation builds on the UML class. That is data of a textual object - which are component types or "word types", lemmas of components, morphological information, syntactic dependency relations between components, and meanings - take up the compartments of the UML class - which are the compartment of the name, attributes, operations,and responsibilities. In addition to existent UML concepts,the representation introduces new ones to denote syntactic dependency relations and their types, gender and some morphological information of object components.
{"title":"UML-Based Representation for Textual Objects","authors":"Ahmad Alsaadi","doi":"10.1109/ADVCOMP.2008.13","DOIUrl":"https://doi.org/10.1109/ADVCOMP.2008.13","url":null,"abstract":"This paper shows how the Unified Modeling Language(UML) can be used to represent a textual object or sentence of a natural language. Precisely, the representation builds on the UML class. That is data of a textual object - which are component types or \"word types\", lemmas of components, morphological information, syntactic dependency relations between components, and meanings - take up the compartments of the UML class - which are the compartment of the name, attributes, operations,and responsibilities. In addition to existent UML concepts,the representation introduces new ones to denote syntactic dependency relations and their types, gender and some morphological information of object components.","PeriodicalId":269090,"journal":{"name":"2008 The Second International Conference on Advanced Engineering Computing and Applications in Sciences","volume":"5 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":"114953764","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
扫码关注我们
求助内容：
应助结果提醒方式：