<?xml version='1.0' encoding='utf-8'?>
<mods xmlns="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" version="3.7" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-7.xsd">
  <titleInfo>
    <title>COORDINATE-EXCHANGE ALGORITHM CONSTRUCTION OF UNIFORM SPACE FILLING DESIGN</title>
  </titleInfo>
  <name>
    <role>
      <roleTerm type="text" authority="marcrelator" authorityURI="http://id.loc.gov/vocabulary/relators" valueURI="http://id.loc.gov/vocabulary/relators/cre">creator</roleTerm>
    </role>
    <namePart>Han, Shipeng</namePart>
  </name>
  <name authority="wikidata" authorityURI="https://www.wikidata.org" valueURI="https://www.wikidata.org/wiki/Q102366358">
    <role>
      <roleTerm type="text" authority="marcrelator" authorityURI="http://id.loc.gov/vocabulary/relators" valueURI="http://id.loc.gov/vocabulary/relators/ths">advisor</roleTerm>
    </role>
    <namePart>Kang, Lulu</namePart>
  </name>
  <abstract>Many scientific phenomena are now investigated by complex computer models. A computer experiment is a sequence of runs with various inputs. The uniform experimental design seeks its design points to be uniformly scattered on the experimental domain and is one kind of a space-filling design that can be used for computer experiments and OK for industrial experiments. The coordinate-exchange method we use is one-dimensional constrained optimization, searching for the optimal coordinate to make the points filling the space uniformly. This method saves large amounts of calculation compared to the multivariate optimization problems. In this thesis we provide the coordinate-exchange algorithm and demonstrate our methodology with numerical examples. Key words: Coordinate-exchange, Uniform design, Computer experiment, Space-filling design, optimal design.</abstract>
  <note type="provenance">Submitted by Liana Khananashvili (khananashvili@iit.edu) on 2014-10-28T17:50:11Z No. of bitstreams: 2 Thesis of Shipeng Han.pdf: 364421 bytes, checksum: 3748a017bf6e0db485994e6cfd91564b (MD5) Cover.pdf: 22210 bytes, checksum: f71f974752a328b761028abf9a88770a (MD5)</note>
  <note type="provenance">Made available in DSpace on 2014-10-28T17:50:11Z (GMT). No. of bitstreams: 2 Thesis of Shipeng Han.pdf: 364421 bytes, checksum: 3748a017bf6e0db485994e6cfd91564b (MD5) Cover.pdf: 22210 bytes, checksum: f71f974752a328b761028abf9a88770a (MD5) Previous issue date: 2014-05</note>
  <note type="thesis">M.S. in Applied Mathematics, May 2014</note>
  <originInfo>
    <dateCaptured>2014</dateCaptured>
  </originInfo>
  <originInfo>
    <dateCreated keyDate="yes">2014-05</dateCreated>
  </originInfo>
  <identifier type="hdl">http://hdl.handle.net/10560/3325</identifier>
  <language>
    <languageTerm type="code" authority="rfc3066">en</languageTerm>
  </language>
  <typeOfResource authority="coar" valueURI="http://purl.org/coar/resource_type/c_46ec">Thesis</typeOfResource>
  <physicalDescription>
    <digitalOrigin>born digital</digitalOrigin>
    <internetMediaType>application/pdf</internetMediaType>
  </physicalDescription>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.org">In Copyright</accessCondition>
  <accessCondition type="useAndReproduction" displayLabel="rightsstatements.orgURI">http://rightsstatements.org/page/InC/1.0/</accessCondition>
  <accessCondition type="restrictionOnAccess">Restricted Access</accessCondition>
  <name type="corporate">
    <namePart>MATH / Applied Mathematics</namePart>
    <affiliation>Illinois Institute of Technology</affiliation>
    <role>
      <roleTerm type="text">Affiliated department</roleTerm>
    </role>
  </name>
</mods>