Combining inference and search produces successful schemes for solving constraint satisfaction problems. Based on this idea a general scheme which uses inference inside evolutionary computation techniques is presented. A genetic algorithm and the particle swarm optimization heuristic make use of adaptable inference levels offered by the mini-bucket elimination algorithm. Experimental results prove the efficiency of our approach in solving the Max-CSP optimization task. The inference/search trade-off is analyzed
{"title":"A New Scheme of Using Inference Inside Evolutionary Computation Techniques to Solve CSPs","authors":"M. Ionita, Mihaela Breaban, Cornelius Croitoru","doi":"10.1109/SYNASC.2006.7","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.7","url":null,"abstract":"Combining inference and search produces successful schemes for solving constraint satisfaction problems. Based on this idea a general scheme which uses inference inside evolutionary computation techniques is presented. A genetic algorithm and the particle swarm optimization heuristic make use of adaptable inference levels offered by the mini-bucket elimination algorithm. Experimental results prove the efficiency of our approach in solving the Max-CSP optimization task. The inference/search trade-off is analyzed","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"66 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":"125154871","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 focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advantage of systematically dealing with domains, categories, operators over them by creating general contexts of expressing algorithms, which can be applied by parameterizing them with various domains, using the same algorithm definition. While similar approaches have been previously presented by the author, the present paper aims at a stronger focus on algorithm characteristics defined on categorical principles and giving a more general framework for implementing Mathematica algorithms based on generic principles and category theory. The paper also discusses run time efficiency aspects for these generic implementations
{"title":"Implementing Parameterized Type Algorithm Definitions in Mathematica","authors":"A. Andreica","doi":"10.1109/SYNASC.2006.45","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.45","url":null,"abstract":"The paper focuses on means of defining parameterized type categories and algorithms built on such types in Mathematica. Symbolic algorithms based on category theory have the advantage of systematically dealing with domains, categories, operators over them by creating general contexts of expressing algorithms, which can be applied by parameterizing them with various domains, using the same algorithm definition. While similar approaches have been previously presented by the author, the present paper aims at a stronger focus on algorithm characteristics defined on categorical principles and giving a more general framework for implementing Mathematica algorithms based on generic principles and category theory. The paper also discusses run time efficiency aspects for these generic implementations","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"74 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":"123087989","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}
Nowadays, the success of the manufacturing industry is largely determined by its ability to respond to the rapidly changing market and customer needs. This has resulted in an increasing deployment of automated manufacturing equipment and systems that provide the agility to cope with these new demands. Flexible manufacturing systems (FMS) are the most widely used technology to cover these needs. Of course, these FMS must be studied in a formal frame, but the complexity and the dimension of real FMS has prevented from developing efficient control techniques and several challenges are still left. We face up these challenges and present a language that is able to specify nearly any type of real FMS. We use a timed process algebra called BTC (for bounded true concurrency) that we have developed from CSP and which takes into account that the available resources in a system have to be shared by all the processes. It is able to consider heterogeneous resources of any type (preemptable and non-preemptable) which makes it suitable for specifying FMS. We show by means of an example that the specifications obtained suit the real systems quite well and are straightforward. To the best of our knowledge, this is the first attempt to do this with process algebras, and we think that it is a good way, mainly, because we are able to split up the system into subsystems which are easier analyzed
{"title":"Process Algebra Specification of Flexible Manufacturing Systems","authors":"M. Ruiz, D. Cazorla, F. Cuartero, J. J. Pardo","doi":"10.1109/SYNASC.2006.64","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.64","url":null,"abstract":"Nowadays, the success of the manufacturing industry is largely determined by its ability to respond to the rapidly changing market and customer needs. This has resulted in an increasing deployment of automated manufacturing equipment and systems that provide the agility to cope with these new demands. Flexible manufacturing systems (FMS) are the most widely used technology to cover these needs. Of course, these FMS must be studied in a formal frame, but the complexity and the dimension of real FMS has prevented from developing efficient control techniques and several challenges are still left. We face up these challenges and present a language that is able to specify nearly any type of real FMS. We use a timed process algebra called BTC (for bounded true concurrency) that we have developed from CSP and which takes into account that the available resources in a system have to be shared by all the processes. It is able to consider heterogeneous resources of any type (preemptable and non-preemptable) which makes it suitable for specifying FMS. We show by means of an example that the specifications obtained suit the real systems quite well and are straightforward. To the best of our knowledge, this is the first attempt to do this with process algebras, and we think that it is a good way, mainly, because we are able to split up the system into subsystems which are easier analyzed","PeriodicalId":309740,"journal":{"name":"2006 Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"6 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":"132412555","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}
Sparse matrix-vector multiplication (shortly SpMtimesV) is one of most common subroutines in the numerical linear algebra. The problem is that the memory access patterns during the SpMtimesV are irregular and the utilization of cache can suffer from low spatial or temporal locality. This paper introduces new approach for the acceleration the SpMtimesV. This approach consists of 3 steps. The first step divides the whole matrix into smaller parts (regions) those can fit in the cache. The second step improves locality during the multiplication due to better utilization of distant references. The last step maximizes machine computation performance of the partial multiplication for each region. In this paper, we describe aspects of these 3 steps in more detail (including fast and time-inexpensive algorithms for all steps). Our measurements proved that our approach gives a significant speedup for almost all matrices arising from various technical areas
{"title":"A New Approach for Accelerating the Sparse Matrix-Vector Multiplication","authors":"P. Tvrdík, I. Šimeček","doi":"10.1109/SYNASC.2006.4","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.4","url":null,"abstract":"Sparse matrix-vector multiplication (shortly SpMtimesV) is one of most common subroutines in the numerical linear algebra. The problem is that the memory access patterns during the SpMtimesV are irregular and the utilization of cache can suffer from low spatial or temporal locality. This paper introduces new approach for the acceleration the SpMtimesV. This approach consists of 3 steps. The first step divides the whole matrix into smaller parts (regions) those can fit in the cache. The second step improves locality during the multiplication due to better utilization of distant references. The last step maximizes machine computation performance of the partial multiplication for each region. In this paper, we describe aspects of these 3 steps in more detail (including fast and time-inexpensive algorithms for all steps). Our measurements proved that our approach gives a significant speedup for almost all matrices arising from various technical areas","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":"128840083","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 some aspects concerning the construction of a new thorn for the Cactus code, a complete 3-dimensional machinery in numerical relativity. This thorn is dedicated to numerical simulations in cosmology, that means it can provide evolutions of different cosmological models, mainly based on Friedman-Robertson-Walker metric. Some numerical results are presented, testing the convergence, stability and the applicability of the code
{"title":"Doing Numerical Cosmology with the Cactus Code","authors":"D. Vulcanov","doi":"10.1109/SYNASC.2006.32","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.32","url":null,"abstract":"The article presents some aspects concerning the construction of a new thorn for the Cactus code, a complete 3-dimensional machinery in numerical relativity. This thorn is dedicated to numerical simulations in cosmology, that means it can provide evolutions of different cosmological models, mainly based on Friedman-Robertson-Walker metric. Some numerical results are presented, testing the convergence, stability and the applicability of the code","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":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128077291","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, e-timed workflow nets are introduced, and a characterization of the soundness property for them is provided. This characterization is based on boundedness and liveness as for classical workflow nets. It is shown that the properties of boundedness and liveness for e-timed Petri nets can be reduced to the same properties for Petri nets with zero-tests on bounded places. As these two properties are decidable for Petri nets with zero-tests on bounded places, the soundness property for e-timed workflow nets is decidable
{"title":"E-timed Workflow Nets","authors":"F. Ţiplea, G. I. Macovei","doi":"10.1109/SYNASC.2006.33","DOIUrl":"https://doi.org/10.1109/SYNASC.2006.33","url":null,"abstract":"In this paper, e-timed workflow nets are introduced, and a characterization of the soundness property for them is provided. This characterization is based on boundedness and liveness as for classical workflow nets. It is shown that the properties of boundedness and liveness for e-timed Petri nets can be reduced to the same properties for Petri nets with zero-tests on bounded places. As these two properties are decidable for Petri nets with zero-tests on bounded places, the soundness property for e-timed workflow nets is decidable","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":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131228979","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
扫码关注我们
求助内容：
应助结果提醒方式：