<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-22T00:08:30Z</responseDate>
  <request identifier="2299" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:2299</identifier>
        <datestamp>2024-03-06T11:09:00Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Quasi-Monte Carlo, Monte Carlo, and regularized gradient optimization methods for source characterization of atmospheric releases</dc:title>
          <dc:creator>Sikorski, Krzysztof</dc:creator>
          <dc:creator>Addepalli, Bhagirath</dc:creator>
          <dc:creator>Pardyjak, E. R.</dc:creator>
          <dc:creator>Zhdanov, M.</dc:creator>
          <dc:subject>Atmospheric source problem</dc:subject>
          <dc:subject>Gaussian Plume Model</dc:subject>
          <dc:subject>Quasi Monte Carlo method</dc:subject>
          <dc:subject>gradient optimization</dc:subject>
          <dc:description>An inversion technique based on MC/QMC search and regularized gradient optimization was developed to solve the atmospheric source characterization problem. The Gaussian Plume Model was adopted as the forward operator and QMC/MC search was implemented in order to find good starting points for the gradient optimization. This approach was validated on the Copenhagen Tracer Experiments. The QMC approach with the utilization of clasical and scrambled Halton, Hammersley and Sobol points was shown to be 10-100 times more efficient  than the Mersenne Twister Monte Carlo generator. Further experiments are needed for different data sets. Computational complexity analysis needs to be &#13;
carried out .</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Krzysztof Sikorski and Bhagirath Addepalli and E. R. Pardyjak and M. Zhdanov</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.09391.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-22998</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.4</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
