We describe a framework for coordinating multiple agents in the execution of a cooperative task. We work within a fair simulation environment which decides when the agents form a coalition. A multi-agent simulator environment is developed, and some experimental results are presented and discussed. The agents are modeled as non-deterministic finite automata based on predefined communication protocol. The coordination is based on exchanging status messages. We use a Linux cluster, and message passing interface together with C programming language
{"title":"Collaborative Agents Interaction Using Message Passing Interface","authors":"Gabriel Ciobanu","doi":"10.1109/SYNASC.2006.23","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.23","url":null,"abstract":"We describe a framework for coordinating multiple agents in the execution of a cooperative task. We work within a fair simulation environment which decides when the agents form a coalition. A multi-agent simulator environment is developed, and some experimental results are presented and discussed. The agents are modeled as non-deterministic finite automata based on predefined communication protocol. The coordination is based on exchanging status messages. We use a Linux cluster, and message passing interface together with C programming language","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121894653","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 paper presents MedioGRID platform as a general-purpose solution for satellite image processing on grid architecture, and exemplifies by the Greenland application the computation of vegetation indices based on MODIS satellite images. The application provides efficient and simple user interactivity through the graphical user interface. The user selects the satellite images by time and geographical area, and specifies the particular processing operations. The performance of the grid application architecture is evaluated considering a few variables such as number of jobs, number of workers and dimension of satellite images
{"title":"MODIS Image Based Computation of Vegetation Indices in MedioGRID Architecture","authors":"V. Bâcu, O. Muresan, D. Gorgan","doi":"10.1109/SYNASC.2006.53","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.53","url":null,"abstract":"The paper presents MedioGRID platform as a general-purpose solution for satellite image processing on grid architecture, and exemplifies by the Greenland application the computation of vegetation indices based on MODIS satellite images. The application provides efficient and simple user interactivity through the graphical user interface. The user selects the satellite images by time and geographical area, and specifies the particular processing operations. The performance of the grid application architecture is evaluated considering a few variables such as number of jobs, number of workers and dimension of satellite images","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129782134","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 article presents a series of algorithms used in the content-based visual query process on databases with color medical images extracted from DICOM files provided by medical tools used in the diagnosis area. Also, the paper presents a detailed study on several directions inside the content-based visual query process. In studying the content-based image query on color feature the transformation from RGB color space to HSV and the quantization at 166 colors was used. For computing the dissimilitude between the query and the target image three metrics were implemented: the Euclidian distance, the histograms intersection and the quadratic distance between histograms. The next study was made on content-based image query on color texture feature. In order to compute the color texture characteristics vectors two methods were implemented: the co-occurrence matrices and Gabor filters. The third studied problem was the content-based region query. For detecting color regions the color set back-projection algorithm was implemented. Statistic studies for this algorithm in keeping track of the patient evolution during the treatment of the peptic ulcers were made
{"title":"Algorithms and Results in Content-Based Visual Query of the Image Databases Resulting from Dicom Files","authors":"L. Stanescu, A. Ion, D. Burdescu, M. Brezovan","doi":"10.1109/SYNASC.2006.15","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.15","url":null,"abstract":"The article presents a series of algorithms used in the content-based visual query process on databases with color medical images extracted from DICOM files provided by medical tools used in the diagnosis area. Also, the paper presents a detailed study on several directions inside the content-based visual query process. In studying the content-based image query on color feature the transformation from RGB color space to HSV and the quantization at 166 colors was used. For computing the dissimilitude between the query and the target image three metrics were implemented: the Euclidian distance, the histograms intersection and the quadratic distance between histograms. The next study was made on content-based image query on color texture feature. In order to compute the color texture characteristics vectors two methods were implemented: the co-occurrence matrices and Gabor filters. The third studied problem was the content-based region query. For detecting color regions the color set back-projection algorithm was implemented. Statistic studies for this algorithm in keeping track of the patient evolution during the treatment of the peptic ulcers were made","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"82 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114101852","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}
Monitoring local and national water quality is a resource intensive process, with increasing complexity as national directives with regard to water quality are being aligned with European directives. In this paper we propose the application of intelligent agent software technology to water quality monitoring for regulatory compliance. The system can also be used to facilitate response to contamination incidents. We give a brief description of the analysis phase of our MAS development
{"title":"Applying Agent Technology in Water Pollution Monitoring Systems","authors":"M. Oprea, C. Nichita","doi":"10.1109/SYNASC.2006.17","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.17","url":null,"abstract":"Monitoring local and national water quality is a resource intensive process, with increasing complexity as national directives with regard to water quality are being aligned with European directives. In this paper we propose the application of intelligent agent software technology to water quality monitoring for regulatory compliance. The system can also be used to facilitate response to contamination incidents. We give a brief description of the analysis phase of our MAS development","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125617677","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 purpose of this paper is to offer a novel approach for modelling and simulation of material balances by using workflow technologies. The work in this paper is concentrated around BPMN as a modelling language, sustained by BPEL as an execution language, and different supporting technologies, to complete the tool chain. We are analyzing here the modelling of a simple chemical process, starting from the ideal material balance, as one can deduce from the fundamental laws of conservation, and developing then more complex models, conforming with most of the technological flow specification
{"title":"Using BPM Technologies for Material Balances Modelling","authors":"A. Fortis, Teodor-Florin Fortiş","doi":"10.1109/SYNASC.2006.79","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.79","url":null,"abstract":"The purpose of this paper is to offer a novel approach for modelling and simulation of material balances by using workflow technologies. The work in this paper is concentrated around BPMN as a modelling language, sustained by BPEL as an execution language, and different supporting technologies, to complete the tool chain. We are analyzing here the modelling of a simple chemical process, starting from the ideal material balance, as one can deduce from the fundamental laws of conservation, and developing then more complex models, conforming with most of the technological flow specification","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133096490","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 effective automatic lip extraction from images is fundamental in a variety of applications. Since the outer labial contour of the mouth is very poor color distinction when compared against its skin background, it makes extraction of lip a difficult problem. In order to improve the contrast between lip and the other face regions, discrete Hartley transform (DHT) is proposed. We perform wavelet multi-scale edge detection across the C3 component of the HDT, which takes both the color information and the geometric characteristic into account. Comparative study with some existing lip segmentation algorithms has indicated the superior performance of the developed algorithm. The proposed algorithm produces better segmentation without need to determine an optimum threshold for each face image. In contrast with the other methods investigated, the lip segmentation is determined completely automatically
{"title":"Automatic Extraction of Lip Based on Wavelet Edge Detection","authors":"Ye-peng Guan","doi":"10.1109/SYNASC.2006.19","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.19","url":null,"abstract":"The effective automatic lip extraction from images is fundamental in a variety of applications. Since the outer labial contour of the mouth is very poor color distinction when compared against its skin background, it makes extraction of lip a difficult problem. In order to improve the contrast between lip and the other face regions, discrete Hartley transform (DHT) is proposed. We perform wavelet multi-scale edge detection across the C3 component of the HDT, which takes both the color information and the geometric characteristic into account. Comparative study with some existing lip segmentation algorithms has indicated the superior performance of the developed algorithm. The proposed algorithm produces better segmentation without need to determine an optimum threshold for each face image. In contrast with the other methods investigated, the lip segmentation is determined completely automatically","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133836551","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 a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner deterministically to its goal. In comparison with existing planners, our approach eliminates backtracking and supports efficient incremental planners that add additional sub-formulas without the need to recompute solutions for previously provided subformulas. Our experimental results show that our approach is competitive with existing state-of-the-art planners that formulate the planning problem as a satisfiability problem, then solve the satisfiability problem using specialized off-the-shelf satisfiability solvers such as zChaff
{"title":"Incremental Deterministic Planning","authors":"S. Andrei, W. Chin, M. Rinard","doi":"10.1109/SYNASC.2006.47","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.47","url":null,"abstract":"We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner deterministically to its goal. In comparison with existing planners, our approach eliminates backtracking and supports efficient incremental planners that add additional sub-formulas without the need to recompute solutions for previously provided subformulas. Our experimental results show that our approach is competitive with existing state-of-the-art planners that formulate the planning problem as a satisfiability problem, then solve the satisfiability problem using specialized off-the-shelf satisfiability solvers such as zChaff","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115371376","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}
Marcela S. Boboila, G. Iordache, Florin Pop, V. Cristea
This paper presents a scheduling framework that is configured for, and used in MedioGRID, a system for real-time processing of satellite images, operating in a grid environment. Our work addresses the problem of scheduling various computationally intensive and data intensive applications that are required for extracting information from satellite images. The proposed solution allows mapping of image processing applications onto available MedioGRID resources. The scheduling is done at the level of groups of concurrent applications. It demonstrates a very good behavior for scheduling and executing groups of applications, while also achieving a near-optimal utilization of the MedioGRID resources
{"title":"A Framework for Scheduling Image Processing Applications in MedioGRID","authors":"Marcela S. Boboila, G. Iordache, Florin Pop, V. Cristea","doi":"10.1109/SYNASC.2006.2","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.2","url":null,"abstract":"This paper presents a scheduling framework that is configured for, and used in MedioGRID, a system for real-time processing of satellite images, operating in a grid environment. Our work addresses the problem of scheduling various computationally intensive and data intensive applications that are required for extracting information from satellite images. The proposed solution allows mapping of image processing applications onto available MedioGRID resources. The scheduling is done at the level of groups of concurrent applications. It demonstrates a very good behavior for scheduling and executing groups of applications, while also achieving a near-optimal utilization of the MedioGRID resources","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114421384","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}
Summary form only given. The World Wide Web is an important knowledge repository for our daily activities, and moreover it is transforming itself to service repository. Many scientists not only publish their results on the Web but offer services that accrue from their scientific discoveries and inventions. The WebOrigami, under development by SCORE at University of Tsukuba, is one such science service portal that offers services to interested mathematicians and origamists. Its aim is to help them to explore the possibilities of computational origami as well as enjoying the origami art. In this paper the author talks about the current state of the development of the system, talking about technical problems that we encounter and solutions we came up with. The state of the art of the Web programming technology is far from our satisfaction. It often leads us into many undesired pitfalls as well as security problems. The most serious problem, in our view, is the lack of an adequate computational model with which we reason about Web programming and computing. This paper focuses on the computation model for Web computing that is based on multi-tiered programming methodology; the computation model with which we are trying to abstract from our programming efforts in constructing the portal
只提供摘要形式。万维网是我们日常活动的重要知识存储库，而且它正在向服务存储库转变。许多科学家不仅在网上发表他们的研究成果，而且还提供从他们的科学发现和发明中积累的服务。筑波大学(University of Tsukuba)的SCORE开发的WebOrigami就是这样一个科学服务门户网站，它为感兴趣的数学家和折纸家提供服务。它的目的是帮助他们探索计算折纸的可能性，以及享受折纸艺术。在本文中，作者谈到了系统的发展现状，谈到了我们遇到的技术问题和我们提出的解决方案。Web编程技术的现状远不能让我们满意。它经常使我们陷入许多意想不到的陷阱以及安全问题。在我们看来，最严重的问题是缺乏一个适当的计算模型，我们可以用它来推理Web编程和计算。本文重点研究了基于多层编程方法的Web计算模型;我们试图从构建门户的编程工作中抽象出来的计算模型
{"title":"Tiers of webOrigami Programming","authors":"T. Ida","doi":"10.1109/SYNASC.2006.77","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.77","url":null,"abstract":"Summary form only given. The World Wide Web is an important knowledge repository for our daily activities, and moreover it is transforming itself to service repository. Many scientists not only publish their results on the Web but offer services that accrue from their scientific discoveries and inventions. The WebOrigami, under development by SCORE at University of Tsukuba, is one such science service portal that offers services to interested mathematicians and origamists. Its aim is to help them to explore the possibilities of computational origami as well as enjoying the origami art. In this paper the author talks about the current state of the development of the system, talking about technical problems that we encounter and solutions we came up with. The state of the art of the Web programming technology is far from our satisfaction. It often leads us into many undesired pitfalls as well as security problems. The most serious problem, in our view, is the lack of an adequate computational model with which we reason about Web programming and computing. This paper focuses on the computation model for Web computing that is based on multi-tiered programming methodology; the computation model with which we are trying to abstract from our programming efforts in constructing the portal","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123941261","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}
Abraham Gutierrez, Luis Fernández, F. Arroyo, V. Martínez
The nature of the computation based on membranes, distributed, nondeterministic and massively parallel makes that the current hardware architectures, mainly based in the use of clusters of microprocessors, be not the most appropriate to house this type of systems; especially if we think about the associated costs to solutions that try to maximize the grade of potential parallelism. The use of microcontroller, in these cases, it could be considered like a viable alternative, by its low cost and its high processing capacity, of not being because its use is restricted to problems that can be adapted to the small amount of memory that this kind of devices has to store generic data. The present work describes in a exhaustive way the implementation of a low cost hardware prototype based on microcontrollers that making use of external memory modules is able to resolve the main problem of the small capacity of storage of these components. This way range of approachable problems is enlarged and its use becomes a real alternative to the solutions based on clusters of microprocessors. The adopted hardware architecture also endows from a great flexibility to the proposed solution, since, unlike others, it doesn't require modifications to adapt to anyone of the topologies of current membrane systems. It will be responsibility of the software component that we use, the implementation of the algorithms that reproduce the behavior of different membrane systems
{"title":"Design of a Hardware Architecture Based on Microcontrollers for the Implementation of Membrane Systems","authors":"Abraham Gutierrez, Luis Fernández, F. Arroyo, V. Martínez","doi":"10.1109/SYNASC.2006.29","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.29","url":null,"abstract":"The nature of the computation based on membranes, distributed, nondeterministic and massively parallel makes that the current hardware architectures, mainly based in the use of clusters of microprocessors, be not the most appropriate to house this type of systems; especially if we think about the associated costs to solutions that try to maximize the grade of potential parallelism. The use of microcontroller, in these cases, it could be considered like a viable alternative, by its low cost and its high processing capacity, of not being because its use is restricted to problems that can be adapted to the small amount of memory that this kind of devices has to store generic data. The present work describes in a exhaustive way the implementation of a low cost hardware prototype based on microcontrollers that making use of external memory modules is able to resolve the main problem of the small capacity of storage of these components. This way range of approachable problems is enlarged and its use becomes a real alternative to the solutions based on clusters of microprocessors. The adopted hardware architecture also endows from a great flexibility to the proposed solution, since, unlike others, it doesn't require modifications to adapt to anyone of the topologies of current membrane systems. It will be responsibility of the software component that we use, the implementation of the algorithms that reproduce the behavior of different membrane systems","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129736416","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
扫码关注我们
求助内容：
应助结果提醒方式：