SpaceQuester

Untitled

Jun 24th, 2017
311
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.52 KB | None | 0 0
  1. #define _USE_MATH_DEFINES
  2. #include "math.h"
  3. #include <stdlib.h>
  4. #include <stdio.h>
  5. #include <locale.h>
  6. #include <time.h>
  7. #include <stdbool.h>
  8.  
  9. #define N 4
  10.  
  11. #define V f[0]
  12. #define m f[1]
  13. #define n f[2]
  14. #define h f[3]
  15.  
  16. double f[N];
  17.  
  18. double C = 1;
  19.  
  20. double g_K = 36;
  21. double g_Na = 120;
  22. double g_L = 0.3;
  23.  
  24. double E_K = -77; // -77 // -12
  25. double E_Na = 55; // 55 // 115
  26. double E_L = -54.4; // -54.4 // 10
  27.  
  28. double I_app = 5.2;
  29.  
  30. const double Meander_start_from_zero = 10;
  31. const double Meander_width = 90;
  32. const double Meander_height = 5.1;
  33. const double Meander_interval = 10;
  34.  
  35. int RandomI(int min, int max)
  36. {
  37. return ((double)rand() / (RAND_MAX - 1)) * (max - min) + min;
  38. }
  39.  
  40. double RandomD(double min, double max)
  41. {
  42. return ((double)rand() / RAND_MAX) * (max - min) + min;
  43. }
  44.  
  45. double alpha_n(double f[N])
  46. {
  47. return 0.01 * (V + 55) / (1 - exp(-(V + 55) / 10));
  48. //return (10 - V) / (100*(exp((10-V)/10)) - 1);
  49. }
  50.  
  51. double beta_n(double f[N])
  52. {
  53. return 0.125 * exp(-(V + 65) / 80);
  54. //return 0.125 * exp(-V/80);
  55. }
  56.  
  57. double alpha_m(double f[N])
  58. {
  59. return 0.1 * (V + 40) / (1 - exp(-(V + 40) / 10));
  60. //return (25 - V) / (10*(exp((25-V)/10) - 1));
  61. }
  62.  
  63. double beta_m(double f[N])
  64. {
  65. return 4 * exp(-(V + 65) / 18);
  66. //return 4 * exp(-V/18);
  67. }
  68.  
  69. double alpha_h(double f[N])
  70. {
  71. return 0.07 * exp(-(V + 65) / 20);
  72. //return 0.07 * exp(-V/20);
  73. }
  74.  
  75. double beta_h(double f[N])
  76. {
  77. return 1 / (exp(-(V + 35) / 10) + 1);
  78. //return 1 / (exp((30-V)/10) + 1);
  79. }
  80.  
  81. double I_stim(double t)
  82. {
  83. if (t < Meander_start_from_zero)
  84. return 0;
  85.  
  86. t -= Meander_start_from_zero;
  87. t = fmod(t, Meander_width + Meander_interval);
  88.  
  89. return t < Meander_width ? Meander_height : 0;
  90. }
  91.  
  92. double HodgkinHuxley(int i, double f[N], double t)
  93. {
  94. switch (i)
  95. {
  96. case 0:
  97. return (g_Na * m * m * m * h * (E_Na - V) + g_K * n * n * n * n * (E_K - V) + g_L * (E_L - V) + I_stim(t)) / C;
  98.  
  99. case 1:
  100. return alpha_m(f) * (1 - m) - beta_m(f) * m;
  101.  
  102. case 2:
  103. return alpha_n(f) * (1 - n) - beta_n(f) * n;
  104.  
  105. case 3:
  106. return alpha_h(f) * (1 - h) - beta_h(f) * h;
  107. }
  108. return 0;
  109. }
  110.  
  111. void RungeKutta(double t, double dt, double f[N], double f_next[N])
  112. {
  113. double k[N][4];
  114.  
  115. // k1
  116. for (int i = 0; i < N; i++)
  117. k[i][0] = HodgkinHuxley(i, f, t) * dt;
  118.  
  119. double phi_k1[N];
  120. for (int i = 0; i < N; i++)
  121. phi_k1[i] = f[i] + k[i][0] / 2;
  122.  
  123. // k2
  124. for (int i = 0; i < N; i++)
  125. k[i][1] = HodgkinHuxley(i, phi_k1, t) * dt;
  126.  
  127. double phi_k2[N];
  128. for (int i = 0; i < N; i++)
  129. phi_k2[i] = f[i] + k[i][1] / 2;
  130.  
  131. // k3
  132. for (int i = 0; i < N; i++)
  133. k[i][2] = HodgkinHuxley(i, phi_k2, t) * dt;
  134.  
  135. double phi_k3[N];
  136. for (int i = 0; i < N; i++)
  137. phi_k3[i] = f[i] + k[i][2] / 2;
  138.  
  139. // k4
  140. for (int i = 0; i < N; i++)
  141. k[i][3] = HodgkinHuxley(i, phi_k3, t) * dt;
  142.  
  143. for (int i = 0; i < N; i++)
  144. f_next[i] = f[i] + (k[i][0] + 2 * k[i][1] + 2 * k[i][2] + k[i][3]) / 6;
  145. }
  146.  
  147. void CopyArray(double source[N], double target[N])
  148. {
  149. for (int i = 0; i < N; i++)
  150. target[i] = source[i];
  151. }
  152.  
  153. bool Approximately(double a, double b)
  154. {
  155. if (a < 0)
  156. a = -a;
  157.  
  158. if (b < 0)
  159. b = -b;
  160.  
  161. return a - b <= 0.000001;
  162. }
  163.  
  164. int main(int argc, char *argv[])
  165. {
  166. //sscanf(argv[1], "%lf", &Meander_height);
  167.  
  168. FILE *fp0;
  169. srand(time(NULL));
  170.  
  171. for (int i = 0; i < N; i++)
  172. f[i] = 0;
  173.  
  174. const double t_start = 0;
  175. const double t_max = 100;
  176. const double dt = 0.0001;
  177.  
  178. double t = t_start;
  179.  
  180. fp0 = fopen("I_stim_height.txt", "a");
  181. fprintf(fp0, "%f\t", Meander_height);
  182. fclose(fp0);
  183.  
  184. fp0 = fopen("results.txt", "w+");
  185. //setlocale(LC_NUMERIC, "French_Canada.1252");
  186.  
  187. clock_t start_rk4, end_rk4;
  188. start_rk4 = clock();
  189. int lastPercent = -1;
  190.  
  191. while (t < t_max || Approximately(t, t_max))
  192. {
  193. fprintf(fp0, "%f\t", t);
  194. fprintf(fp0, "%f\t", I_stim(t));
  195. for (int i = 0; i < N; i++)
  196. {
  197. fprintf(fp0, i == N - 1 ? "%f" : "%f\t", f[i]);
  198. }
  199. fprintf(fp0, "\n");
  200.  
  201. double phi_next[N];
  202.  
  203. RungeKutta(t, dt, f, phi_next);
  204. CopyArray(phi_next, f);
  205.  
  206. t += dt;
  207.  
  208. int percent = (int)(100 * (t - t_start) / (t_max - t_start));
  209. if (percent != lastPercent)
  210. {
  211. printf("Progress: %d%%\n", percent);
  212. lastPercent = percent;
  213. }
  214. }
  215.  
  216. end_rk4 = clock();
  217. double extime_rk4 = (double)(end_rk4 - start_rk4) / CLOCKS_PER_SEC;
  218. int minutes = (int)extime_rk4 / 60;
  219. int seconds = (int)extime_rk4 % 60;
  220. printf("\nExecution time is: %d minutes %d seconds\n ", minutes, seconds);
  221.  
  222. fclose(fp0);
  223.  
  224. fp0 = fopen("time_exec.txt", "w+");
  225. fprintf(fp0, "%f\n", extime_rk4);
  226. fclose(fp0);
  227. }
Advertisement
Add Comment
Please, Sign In to add comment