-
Notifications
You must be signed in to change notification settings - Fork 57
/
ihs_dataset.html
229 lines (192 loc) · 6.26 KB
/
ihs_dataset.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
<html>
<head>
<title>
IHS_DATASET - Generate IHS Datasets
</title>
</head>
<body bgcolor="#EEEEEE" link="#CC0000" alink="#FF3300" vlink="#000055">
<h1 align = "center">
IHS_DATASET <br> Generate IHS Datasets
</h1>
<hr>
<p>
<b>IHS_DATASET</b>
is a MATLAB program which
creates an IHS dataset.
</p>
<p>
A Latin hypercube, in <b>M</b> dimensional space, with <b>N</b> points,
can be thought of as being constructed by dividing each of the
<b>M</b> coordinate dimensions into <b>N</b> equal intervals. The
J-th coordinate of the I-th point can be constructed by choosing, in
the J-th dimension, an interval that has not been used, and then
choosing any value in that interval.
</p>
<p>
This algorithm differs in that it tries to pick a solution
which has the property that the points are "spread out"
as evenly as possible. It does this by determining an optimal
even spacing, and using the duplication factor D to allow it
to choose the best of the various options available to it
(the more duplication, the better chance of optimization).
</p>
<p>
One drawback to this algorithm is that it requires an internal
real distance array of dimension D * N * N. For a relatively moderate
problem with N = 1000, this can exceed the easily accessible
memory. Moreover, the program is inherently quadratic in N
in execution time as well as memory; the computation of the I-th
point in the set of N requires a consideration of the value of
the coordinates used up by the previous points, and the distances
from each of those points to the candidates for the next point.
</p>
<p>
The program is interactive, and allows the user to choose
<ul>
<li>
<b>M</b>, the spatial dimension;
</li>
<li>
<b>N</b>, the number of points to generate;
</li>
<li>
<b>D</b>, the duplication factor.
</li>
<li>
<b>SEED</b>, a seed for UNIFORM, the portable uniform random
number generator used to make choices.
</li>
</ul>
Once these parameters are set, the program generates the data,
and writes it to a file. The user may then specify another
set of data, or terminate the program.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>IHS_DATASET</b> is available in
<a href = "../../cpp_src/ihs_dataset/ihs_dataset.html">a C++ version</a> and
<a href = "../../f_src/ihs_dataset/ihs_dataset.html">a FORTRAN90 version</a> and
<a href = "../../m_src/ihs_dataset/ihs_dataset.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../m_src/faure_dataset/faure_dataset.html">
FAURE_DATASET</a>,
a MATLAB program which
creates a Faure quasirandom dataset;
</p>
<p>
<a href = "../../m_src/grid_dataset/grid_dataset.html">
GRID_DATASET</a>,
a MATLAB program which
creates a grid sequence and writes it to a file.
</p>
<p>
<a href = "../../m_src/latin_center_dataset/latin_center_dataset.html">
LATIN_CENTER_DATASET</a>,
a MATLAB program which
creates a Latin Center Hypercube dataset;
</p>
<p>
<a href = "../../m_src/latin_edge_dataset/latin_edge_dataset.html">
LATIN_EDGE_DATASET</a>,
a MATLAB program which
creates a Latin Edge Hypercube dataset;
</p>
<p>
<a href = "../../m_src/latin_random_dataset/latin_random_dataset.html">
LATIN_RANDOM_DATASET</a>,
a MATLAB program which
creates a Latin Random Hypercube dataset;
</p>
<p>
<a href = "../../m_src/ihs/ihs.html">
IHS</a>,
a MATLAB library which
supplies the computational routines needed by
<b>IHS_DATASET</b>.
</p>
<p>
<a href = "../../datasets/ihs/ihs.html">
IHS</a>,
a dataset directory which
contains sample datasets created
by <b>IHS_DATASET</b>.
</p>
<p>
<a href = "../../m_src/niederreiter2_dataset/niederreiter2_dataset.html">
NIEDERREITER2_DATASET</a>,
a MATLAB program which
creates a Niederreiter quasirandom dataset with base 2;
</p>
<p>
<a href = "../../m_src/normal_dataset/normal_dataset.html">
NORMAL_DATASET</a>,
a MATLAB program which
generates a dataset of multivariate normal pseudorandom values and writes them to a file.
</p>
<p>
<a href = "../../m_src/sobol_dataset/sobol_dataset.html">
SOBOL_DATASET</a>,
a MATLAB program which
computes a Sobol quasirandom sequence and writes it to a file.
</p>
<p>
<a href = "../../m_src/uniform_dataset/uniform_dataset.html">
UNIFORM_DATASET</a>,
a MATLAB program which
generates a dataset of uniform pseudorandom values and writes them to a file.
</p>
<p>
<a href = "../../m_src/van_der_corput_dataset/van_der_corput_dataset.html">
VAN_DER_CORPUT_DATASET</a>,
a MATLAB program which
creates a van der Corput quasirandom sequence and writes it to a file.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Brian Beachkofski, Ramana Grandhi,<br>
Improved Distributed Hypercube Sampling,<br>
American Institute of Aeronautics and Astronautics Paper 2002-1274.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "ihs_dataset.m">ihs_dataset.m</a>,
generates an IHS dataset and writes it to a file.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../m_src.html">
the MATLAB source codes</a>.
</p>
<hr>
<i>
Last revised on 07 April 2006.
</i>
<!-- John Burkardt -->
</body>
<!-- Initial HTML skeleton created by HTMLINDEX. -->
</html>