1 | /** |
---|
2 | This software was developed by the University of Tennessee as part of the |
---|
3 | Distributed Data Analysis of Neutron Scattering Experiments (DANSE) |
---|
4 | project funded by the US National Science Foundation. |
---|
5 | |
---|
6 | If you use DANSE applications to do scientific research that leads to |
---|
7 | publication, we ask that you acknowledge the use of the software with the |
---|
8 | following sentence: |
---|
9 | |
---|
10 | "This work benefited from DANSE software developed under NSF award DMR-0520547." |
---|
11 | |
---|
12 | copyright 2008, University of Tennessee |
---|
13 | */ |
---|
14 | #include "parameters.hh" |
---|
15 | #include <stdio.h> |
---|
16 | #include <math.h> |
---|
17 | using namespace std; |
---|
18 | |
---|
19 | /** |
---|
20 | * TODO: normalize all dispersion weight lists |
---|
21 | */ |
---|
22 | |
---|
23 | |
---|
24 | /** |
---|
25 | * Weight points |
---|
26 | */ |
---|
27 | WeightPoint :: WeightPoint() { |
---|
28 | value = 0.0; |
---|
29 | weight = 0.0; |
---|
30 | } |
---|
31 | |
---|
32 | WeightPoint :: WeightPoint(double v, double w) { |
---|
33 | value = v; |
---|
34 | weight = w; |
---|
35 | } |
---|
36 | |
---|
37 | /** |
---|
38 | * Dispersion models |
---|
39 | */ |
---|
40 | DispersionModel :: DispersionModel() { |
---|
41 | npts = 1; |
---|
42 | width = 0.0; |
---|
43 | }; |
---|
44 | |
---|
45 | void DispersionModel :: accept_as_source(DispersionVisitor* visitor, void* from, void* to) { |
---|
46 | visitor->dispersion_to_dict(from, to); |
---|
47 | } |
---|
48 | void DispersionModel :: accept_as_destination(DispersionVisitor* visitor, void* from, void* to) { |
---|
49 | visitor->dispersion_from_dict(from, to); |
---|
50 | } |
---|
51 | void DispersionModel :: operator() (void *param, vector<WeightPoint> &weights){ |
---|
52 | // Check against zero width |
---|
53 | if (width<=0) { |
---|
54 | width = 0.0; |
---|
55 | npts = 1; |
---|
56 | } |
---|
57 | |
---|
58 | Parameter* par = (Parameter*)param; |
---|
59 | double value = (*par)(); |
---|
60 | |
---|
61 | if (npts<2) { |
---|
62 | weights.insert(weights.end(), WeightPoint(value, 1.0)); |
---|
63 | } else { |
---|
64 | for(int i=0; i<npts; i++) { |
---|
65 | double val = value + width * (1.0*i/float(npts-1) - 0.5); |
---|
66 | |
---|
67 | if ( ((*par).has_min==false || val>(*par).min) |
---|
68 | && ((*par).has_max==false || val<(*par).max) ) |
---|
69 | weights.insert(weights.end(), WeightPoint(val, 1.0)); |
---|
70 | } |
---|
71 | } |
---|
72 | } |
---|
73 | |
---|
74 | /** |
---|
75 | * Method to set the weights |
---|
76 | * Not implemented for this class |
---|
77 | */ |
---|
78 | void DispersionModel :: set_weights(int npoints, double* values, double* weights){} |
---|
79 | |
---|
80 | /** |
---|
81 | * Gaussian dispersion |
---|
82 | */ |
---|
83 | |
---|
84 | GaussianDispersion :: GaussianDispersion() { |
---|
85 | npts = 1; |
---|
86 | width = 0.0; |
---|
87 | nsigmas = 2; |
---|
88 | }; |
---|
89 | |
---|
90 | void GaussianDispersion :: accept_as_source(DispersionVisitor* visitor, void* from, void* to) { |
---|
91 | visitor->gaussian_to_dict(from, to); |
---|
92 | } |
---|
93 | void GaussianDispersion :: accept_as_destination(DispersionVisitor* visitor, void* from, void* to) { |
---|
94 | visitor->gaussian_from_dict(from, to); |
---|
95 | } |
---|
96 | |
---|
97 | double gaussian_weight(double mean, double sigma, double x) { |
---|
98 | double vary, expo_value; |
---|
99 | vary = x-mean; |
---|
100 | expo_value = -vary*vary/(2*sigma*sigma); |
---|
101 | //return 1.0; |
---|
102 | return exp(expo_value); |
---|
103 | } |
---|
104 | |
---|
105 | /** |
---|
106 | * Gaussian dispersion |
---|
107 | * @param mean: mean value of the Gaussian |
---|
108 | * @param sigma: standard deviation of the Gaussian |
---|
109 | * @param x: value at which the Gaussian is evaluated |
---|
110 | * @return: value of the Gaussian |
---|
111 | */ |
---|
112 | void GaussianDispersion :: operator() (void *param, vector<WeightPoint> &weights){ |
---|
113 | // Check against zero width |
---|
114 | if (width<=0) { |
---|
115 | width = 0.0; |
---|
116 | npts = 1; |
---|
117 | nsigmas = 3; |
---|
118 | } |
---|
119 | |
---|
120 | Parameter* par = (Parameter*)param; |
---|
121 | double value = (*par)(); |
---|
122 | |
---|
123 | if (npts<2) { |
---|
124 | weights.insert(weights.end(), WeightPoint(value, 1.0)); |
---|
125 | } else { |
---|
126 | for(int i=0; i<npts; i++) { |
---|
127 | // We cover n(nsigmas) times sigmas on each side of the mean |
---|
128 | double val = value + width * (2.0*nsigmas*i/float(npts-1) - nsigmas); |
---|
129 | |
---|
130 | if ( ((*par).has_min==false || val>(*par).min) |
---|
131 | && ((*par).has_max==false || val<(*par).max) ) { |
---|
132 | double _w = gaussian_weight(value, width, val); |
---|
133 | weights.insert(weights.end(), WeightPoint(val, _w)); |
---|
134 | } |
---|
135 | } |
---|
136 | } |
---|
137 | } |
---|
138 | |
---|
139 | |
---|
140 | /** |
---|
141 | * LogNormal dispersion |
---|
142 | */ |
---|
143 | |
---|
144 | LogNormalDispersion :: LogNormalDispersion() { |
---|
145 | npts = 1; |
---|
146 | width = 0.0; |
---|
147 | nsigmas = 2; |
---|
148 | }; |
---|
149 | |
---|
150 | void LogNormalDispersion :: accept_as_source(DispersionVisitor* visitor, void* from, void* to) { |
---|
151 | visitor->lognormal_to_dict(from, to); |
---|
152 | } |
---|
153 | void LogNormalDispersion :: accept_as_destination(DispersionVisitor* visitor, void* from, void* to) { |
---|
154 | visitor->lognormal_from_dict(from, to); |
---|
155 | } |
---|
156 | |
---|
157 | double lognormal_weight(double mean, double sigma, double x) { |
---|
158 | |
---|
159 | double sigma2 = pow(sigma, 2); |
---|
160 | return 1/(x*sigma2) * exp( -pow((log(x) -mean), 2) / (2*sigma2)); |
---|
161 | |
---|
162 | } |
---|
163 | |
---|
164 | /** |
---|
165 | * Lognormal dispersion |
---|
166 | * @param mean: mean value of the LogNormal |
---|
167 | * @param sigma: standard deviation of the LogNormal |
---|
168 | * @param x: value at which the LogNormal is evaluated |
---|
169 | * @return: value of the LogNormal |
---|
170 | */ |
---|
171 | void LogNormalDispersion :: operator() (void *param, vector<WeightPoint> &weights){ |
---|
172 | // Check against zero width |
---|
173 | if (width<=0) { |
---|
174 | width = 0.0; |
---|
175 | npts = 1; |
---|
176 | nsigmas = 3; |
---|
177 | } |
---|
178 | |
---|
179 | Parameter* par = (Parameter*)param; |
---|
180 | double value = (*par)(); |
---|
181 | |
---|
182 | if (npts<2) { |
---|
183 | weights.insert(weights.end(), WeightPoint(value, 1.0)); |
---|
184 | } else { |
---|
185 | for(int i=0; i<npts; i++) { |
---|
186 | // We cover n(nsigmas) times sigmas on each side of the mean |
---|
187 | double val = value + width * (2.0*nsigmas*i/float(npts-1) - nsigmas); |
---|
188 | |
---|
189 | if ( ((*par).has_min==false || val>(*par).min) |
---|
190 | && ((*par).has_max==false || val<(*par).max) ) { |
---|
191 | double _w = lognormal_weight(value, width, val); |
---|
192 | weights.insert(weights.end(), WeightPoint(val, _w)); |
---|
193 | } |
---|
194 | } |
---|
195 | } |
---|
196 | } |
---|
197 | |
---|
198 | |
---|
199 | |
---|
200 | /** |
---|
201 | * Schulz dispersion |
---|
202 | */ |
---|
203 | |
---|
204 | SchulzDispersion :: SchulzDispersion() { |
---|
205 | npts = 1; |
---|
206 | width = 0.0; |
---|
207 | nsigmas = 2; |
---|
208 | }; |
---|
209 | |
---|
210 | void SchulzDispersion :: accept_as_source(DispersionVisitor* visitor, void* from, void* to) { |
---|
211 | visitor->schulz_to_dict(from, to); |
---|
212 | } |
---|
213 | void SchulzDispersion :: accept_as_destination(DispersionVisitor* visitor, void* from, void* to) { |
---|
214 | visitor->schulz_from_dict(from, to); |
---|
215 | } |
---|
216 | |
---|
217 | double schulz_weight(double mean, double sigma, double x) { |
---|
218 | double vary, expo_value; |
---|
219 | double z = pow(mean/ sigma, 2)-1; |
---|
220 | double R= x/mean; |
---|
221 | double zz= z+1; |
---|
222 | return pow(zz,zz) * pow(R,z) * exp(-1*R*zz)/((mean) * tgamma(zz)) ; |
---|
223 | } |
---|
224 | |
---|
225 | /** |
---|
226 | * Schulz dispersion |
---|
227 | * @param mean: mean value of the Schulz |
---|
228 | * @param sigma: standard deviation of the Schulz |
---|
229 | * @param x: value at which the Schulz is evaluated |
---|
230 | * @return: value of the Schulz |
---|
231 | */ |
---|
232 | void SchulzDispersion :: operator() (void *param, vector<WeightPoint> &weights){ |
---|
233 | // Check against zero width |
---|
234 | if (width<=0) { |
---|
235 | width = 0.0; |
---|
236 | npts = 1; |
---|
237 | nsigmas = 3; |
---|
238 | } |
---|
239 | |
---|
240 | Parameter* par = (Parameter*)param; |
---|
241 | double value = (*par)(); |
---|
242 | |
---|
243 | if (npts<2) { |
---|
244 | weights.insert(weights.end(), WeightPoint(value, 1.0)); |
---|
245 | } else { |
---|
246 | for(int i=0; i<npts; i++) { |
---|
247 | // We cover n(nsigmas) times sigmas on each side of the mean |
---|
248 | double val = value + width * (2.0*nsigmas*i/float(npts-1) - nsigmas); |
---|
249 | |
---|
250 | if ( ((*par).has_min==false || val>(*par).min) |
---|
251 | && ((*par).has_max==false || val<(*par).max) ) { |
---|
252 | double _w = schulz_weight(value, width, val); |
---|
253 | weights.insert(weights.end(), WeightPoint(val, _w)); |
---|
254 | } |
---|
255 | } |
---|
256 | } |
---|
257 | } |
---|
258 | |
---|
259 | |
---|
260 | |
---|
261 | |
---|
262 | /** |
---|
263 | * Array dispersion based on input arrays |
---|
264 | */ |
---|
265 | |
---|
266 | void ArrayDispersion :: accept_as_source(DispersionVisitor* visitor, void* from, void* to) { |
---|
267 | visitor->array_to_dict(from, to); |
---|
268 | } |
---|
269 | void ArrayDispersion :: accept_as_destination(DispersionVisitor* visitor, void* from, void* to) { |
---|
270 | visitor->array_from_dict(from, to); |
---|
271 | } |
---|
272 | |
---|
273 | /** |
---|
274 | * Method to get the weights |
---|
275 | */ |
---|
276 | void ArrayDispersion :: operator() (void *param, vector<WeightPoint> &weights) { |
---|
277 | Parameter* par = (Parameter*)param; |
---|
278 | double value = (*par)(); |
---|
279 | |
---|
280 | if (npts<2) { |
---|
281 | weights.insert(weights.end(), WeightPoint(value, 1.0)); |
---|
282 | } else { |
---|
283 | for(int i=0; i<npts; i++) { |
---|
284 | if ( ((*par).has_min==false || _values[i]>(*par).min) |
---|
285 | && ((*par).has_max==false || _values[i]<(*par).max) ) |
---|
286 | weights.insert(weights.end(), WeightPoint(_values[i], _weights[i])); |
---|
287 | } |
---|
288 | } |
---|
289 | } |
---|
290 | /** |
---|
291 | * Method to set the weights |
---|
292 | */ |
---|
293 | void ArrayDispersion :: set_weights(int npoints, double* values, double* weights){ |
---|
294 | npts = npoints; |
---|
295 | _values = values; |
---|
296 | _weights = weights; |
---|
297 | } |
---|
298 | |
---|
299 | |
---|
300 | /** |
---|
301 | * Parameters |
---|
302 | */ |
---|
303 | Parameter :: Parameter() { |
---|
304 | value = 0; |
---|
305 | min = 0.0; |
---|
306 | max = 0.0; |
---|
307 | has_min = false; |
---|
308 | has_max = false; |
---|
309 | has_dispersion = false; |
---|
310 | dispersion = new GaussianDispersion(); |
---|
311 | } |
---|
312 | |
---|
313 | Parameter :: Parameter(double _value) { |
---|
314 | value = _value; |
---|
315 | min = 0.0; |
---|
316 | max = 0.0; |
---|
317 | has_min = false; |
---|
318 | has_max = false; |
---|
319 | has_dispersion = false; |
---|
320 | dispersion = new GaussianDispersion(); |
---|
321 | } |
---|
322 | |
---|
323 | Parameter :: Parameter(double _value, bool disp) { |
---|
324 | value = _value; |
---|
325 | min = 0.0; |
---|
326 | max = 0.0; |
---|
327 | has_min = false; |
---|
328 | has_max = false; |
---|
329 | has_dispersion = disp; |
---|
330 | dispersion = new GaussianDispersion(); |
---|
331 | } |
---|
332 | |
---|
333 | void Parameter :: get_weights(vector<WeightPoint> &weights) { |
---|
334 | (*dispersion)((void*)this, weights); |
---|
335 | } |
---|
336 | |
---|
337 | void Parameter :: set_min(double value) { |
---|
338 | has_min = true; |
---|
339 | min = value; |
---|
340 | } |
---|
341 | |
---|
342 | void Parameter :: set_max(double value) { |
---|
343 | has_max = true; |
---|
344 | max = value; |
---|
345 | } |
---|
346 | |
---|
347 | double Parameter :: operator()() { |
---|
348 | return value; |
---|
349 | } |
---|
350 | |
---|
351 | double Parameter :: operator=(double _value){ |
---|
352 | value = _value; |
---|
353 | } |
---|