http://www.bibsonomy.org/burst/concept/tag/10BibSonomy BuRST Feed for /concept/tag/102008-10-16T09:11:26+02:00http://www.bibsonomy.org/bibtex/28d9985b0c9e73dc2853c10b1352088d7/brazovayeyebrazovayeye2008-06-19T17:35:00+02:0010 programming, genetic discipulus, demes DSS, algorithms, <span style="color:#555555;">Larry M. <a href="http://www.bibsonomy.org/author/Deschaine">Deschaine</a> und Janardan J. <a href="http://www.bibsonomy.org/author/Patel">Patel</a> und Ronald D. <a href="http://www.bibsonomy.org/author/Guthrie">Guthrie</a> und Joseph T. <a href="http://www.bibsonomy.org/author/Grimski">Grimski</a> und M. J. <a href="http://www.bibsonomy.org/author/Ades">Ades</a> </span><em>Advanced Technology Simulation Conference, </em><em>Seattle, </em><em>22-26 April2001. </em>Thu Jun 19 17:35:00 CEST 2008SeattleAdvanced Technology Simulation Conference22-26 AprilUsing Linear Genetic Programming to Develop a {C/C++} Simulation Model of a Waste Incinerator200110 programming, genetic discipulus, demes DSS, algorithms, Abstract We explore whether Linear Genetic Programming (LGP) can evolve a C/C++ computer simulation model that accurately models the performance of a waste incinerator. Human expert written simulation models are used worldwide in a variety of industrial and business applications. They are expensive to develop, may or may not be valid for the specific process that is being modeled, and may be erroneous. LGP is a machine learning technique that uses information about a process's inputs and outputs to simultaneously write the simulation model, calibrate and optimize the model's constants, and validate the solution. The result is a calibrated, validated, error-free C/C++ computer model specific to the desired process. To evaluate whether this is feasible for complex industrial processes, the method on data obtained from the operation of a hazardous waste incinerator. This process is difficult to model. Previously, in a well-conducted study, the popular machine learning technique, analytic neural networks, was unable to derive useful solutions to this problem. The present study uses various mutation rates (95%, 50%, and 10%), 10 random initial seeds per mutation rate, and a large number of generations (1,280 to 4,461). The LGP system provided accurate solutions to this problem with a validation data measure of fitness, R2, equal to 0.961. This work demonstrates the value of LGP for process simulation. The study confirms previously published results and found that the distribution of outputs from multiple genetic programming (GP) runs tends to include an extended tail of outstanding solutions. Such a tail was not found in previous studies of neural networks. This result emphasizes the need for employing a strategy of multiple runs using various initial seeds and mutation rates to find good solutions to complex problems using LGP. This result also demonstrates the value of a fast LGP algorithm implemented at the machine code level for both static scientific data mining and real-time process control. The work consumed 600 hours of CPU time; it is estimated that other GP algorithms would have required between 4 and 136 years of CPU time to achieve similar results.posted on 2006-11-22http://www.bibsonomy.org/bibtex/23c4683a7825d2be42750bc96863baf09/nepomuknepomuk2006-11-22T10:48:40+01:00fzi 10 2006 xamde nepomuk aifb maxvoelkel wp1 lang:en from:xamde <span style="color:#555555;">Max <a href="http://www.bibsonomy.org/author/V{\&#034;{o}}lkel">V&#246;lkel</a> und Tudor <a href="http://www.bibsonomy.org/author/Groza">Groza</a> </span><em>Proceedings of IADIS International Conference on WWW/Internet, </em><em>Murcia, Spain, </em><em>IADIS, </em><em>IADIS, </em><em>OCT2006. </em>Wed Nov 22 10:48:40 CET 2006Murcia, SpainProceedings of IADIS International Conference on WWW/InternetOCTSemVersion: An RDF-based Ontology Versioning System2006fzi 10 2006 xamde nepomuk aifb maxvoelkel wp1 lang:en from:xamde posted on 2006-11-22http://www.bibsonomy.org/bibtex/23c4683a7825d2be42750bc96863baf09/xamdexamde2006-11-22T10:48:40+01:00fzi 10 2006 xamde nepomuk aifb maxvoelkel for:nepomuk wp1 lang:en <span style="color:#555555;">Max <a href="http://www.bibsonomy.org/author/V{\&#034;{o}}lkel">V&#246;lkel</a> und Tudor <a href="http://www.bibsonomy.org/author/Groza">Groza</a> </span><em>Proceedings of IADIS International Conference on WWW/Internet, </em><em>Murcia, Spain, </em><em>IADIS, </em><em>IADIS, </em><em>OCT2006. </em>Wed Nov 22 10:48:40 CET 2006Murcia, SpainProceedings of IADIS International Conference on WWW/InternetOCTSemVersion: An RDF-based Ontology Versioning System2006fzi 10 2006 xamde nepomuk aifb maxvoelkel for:nepomuk wp1 lang:en