2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing最新文献_第3页

Parallel Migration Models Applied to Competitive Differential Evolution 应用于竞争差异进化的平行迁移模型

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.45

P. Bujok, J. Tvrdík

引用次数: 3

Cellular Genetic Algorithm with Communicating Grids for a Delivery Problem 基于通信网格的细胞遗传算法求解某配送问题

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.58

O. Brudaru, A. Vilcu, D. Popovici

{"title":"Cellular Genetic Algorithm with Communicating Grids for a Delivery Problem","authors":"O. Brudaru, A. Vilcu, D. Popovici","doi":"10.1109/SYNASC.2011.58","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.58","url":null,"abstract":"This paper describes a cellular genetic algorithm with communicating grids for solving a delivery problem. Specific operators for mutation and crossover are described. The GA is hybridized using a heuristic that is acting as a hyper-mutation operator. It is inspired from a very efficient dynamic programming algorithm. A similarity vector is associated to each solution. A Kohonen self-organizing map is used to place the initial population on the grid and specific placement techniques are applied during the whole activity. These techniques favor the groups based on similarity. The position of groups on the grid and their contents are dynamic. A similarity based communication protocol is used to change a given percent of the best individuals of the clusters and a given threshold is used to tune the communication scheme. The performance of the algorithm is experimentally analyzed: the capacity of the cellular algorithm to find known optimal solutions, its stability in terms of the unitized risk values, the way to obtain good values of the parameters is described, different similarity function are compared between them and the threshold values for optimal clustering and communication protocol are obtained. Also, the effect of communication period and the percent of changed individuals on the quality of the found solution are analyzed. The results show that the cellular algorithm dominates the canonical counterpart hybrid genetic algorithms.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125734415","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}

引用次数: 0

Multi-agent Resource Allocation Algorithm Based on the XSufferage Heuristic for Distributed Systems 基于x苦难启发式的分布式系统多智能体资源分配算法

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.37

Alexandru Gherega, Valentin Pupezescu

{"title":"Multi-agent Resource Allocation Algorithm Based on the XSufferage Heuristic for Distributed Systems","authors":"Alexandru Gherega, Valentin Pupezescu","doi":"10.1109/SYNASC.2011.37","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.37","url":null,"abstract":"Distributed computing systems provide a highly dynamic behavior which originates from heterogeneous computing and storage resources, heterogeneous users and the variety of submitted applications and finally from the heterogeneous communication that takes part among the systems entities. As such applying global optima oriented allocation algorithms usually produces poor results and heuristics are used instead. We concentrated our experiments around the Sufferage heuristic and its adaptive cluster-aware version XSufferage. Both Sufferage and XSufferage use a centralized design and produce good results for low levels of dynamism and deterministic environments. In real life distributed environments, both heuristics produce poor results. We expose the Sufferage heuristic through a distributed architecture based on a cooperative set of entities, which form a Multi-Agent System, such that the results could be improved. We implemented a new algorithm, based on this architecture, called Distributed XSufferage. In order to test the new algorithm, a series of experiments were developed by simulating two real life Grid environments. A complex set of performance metrics were collected -- flow time, make span, throughput -- both resource and cluster level, utilization -- both resource and cluster level and resources and clusters mean loads. Algorithms produce their allocation solution based on estimates and modeling of system's resources and as such are sensitive to estimation errors. Throughout our experiments DX Sufferage was more robust to such errors compared to the original Sufferage and, respectively, XSufferage heuristics.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126362153","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}

引用次数: 2

On the Complexity of Szilard Languages of Matrix Grammars 论矩阵语法西拉德语言的复杂性

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.34

Liliana Cojocaru, E. Mäkinen

引用次数: 5

RangeLab: A Static-Analyzer to Bound the Accuracy of Finite-Precision Computations RangeLab:限定有限精度计算精度的静态分析器

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.52

M. Martel

引用次数: 5

Project Duration Assessment Model Based on Modified Shortest Path Algorithm and Superposition 基于改进最短路径算法和叠加的项目工期评估模型

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.29

V. Jevtic, D. Dobrilović, Jelena Stojanov, Ž. Stojanov

引用次数: 1

Psychologically Inspired, Rule-Based Outlier Detection in Noisy Data 基于心理启发、规则的噪声数据异常点检测

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.57

Beáta Reiz, S. Pongor

引用次数: 6

Probabilistic Approach for Automated Reasoning for Lane Identification in Intelligent Vehicles 基于概率推理的智能车辆车道识别方法

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.10

V. Popescu, Mihai Bâce, S. Nedevschi

引用次数: 2

A Computer Aided Software for Nonlinear Digital Control 非线性数字控制的计算机辅助软件

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.42

V. Tanasa, D. Normand-Cyrot

{"title":"A Computer Aided Software for Nonlinear Digital Control","authors":"V. Tanasa, D. Normand-Cyrot","doi":"10.1109/SYNASC.2011.42","DOIUrl":"https://doi.org/10.1109/SYNASC.2011.42","url":null,"abstract":"The aim of this paper is to provide a basic software tool involved in the design and the computation of nonlinear digital control schemes. The complete software SimNLSys will include different modules associated with each control scheme, aimed with respective objectives such as stabilization, damping, output matching or optimality, to quote a few. The software module presented here also encompasses the goal of computing solutions to nonlinear ODE's describing input-affine dynamics. The underlying methodologies propose challenging nonlinear sampled-data control strategies described in terms of Lie series expansions and computable through formal series calculus. The goal is to reach a friendly graphical user interface, to promote the practical efficiency of such strategies. For this, SymNLSys is built using the symbolic Matlab toolbox and the resulting mathematical control law expressions can be implemented directly on experimental plants. The paper describes the used differential geometric methods and discusses the implementation and limitations of the symbolic and numerical algorithms. Also some results obtained via this software are provided.","PeriodicalId":184344,"journal":{"name":"2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123930634","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}

引用次数: 0

Software Framework for Agent-Based Games and Simulations 基于agent的游戏与仿真软件框架

2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing Pub Date : 2011-09-26 DOI: 10.1109/SYNASC.2011.32

George Sacerdotianu, S. Ilie, C. Bǎdicǎ

引用次数: 2