diff --git a/Applications/code/call_run_for_each_input.m b/Applications/code/call_run_for_each_input.m
index 0976bc6..878b0ed 100644
--- a/Applications/code/call_run_for_each_input.m
+++ b/Applications/code/call_run_for_each_input.m
@@ -3,7 +3,6 @@ function call_run_for_each_input(inputI, dataL)
 coreNAME_woL = 'newStack';
 dataL = dataL;
 inputN = inputI;
-r_date = date;
 exactStart = -1;
 target_est = 'step';
 dataNormalize = 0;
diff --git a/Applications/construct_hmm_stack.m b/Applications/construct_hmm_stack.m
index 2440f40..758affe 100644
--- a/Applications/construct_hmm_stack.m
+++ b/Applications/construct_hmm_stack.m
@@ -22,6 +22,11 @@ function construct_hmm_stack(recordInfo)
 
 %% Run the profile-HMM algorithm
 
+% Set `datetime` string
+t = datetime;
+DateStringTest = datestr(t);
+folderDateString = strrep(DateStringTest,' ','_');
+
 cd code
 
 % Criteria of convergence
@@ -29,15 +34,15 @@ function construct_hmm_stack(recordInfo)
 iterMax = 10;   %% Iteration stops if the number of iteration is larget than iterMax.
 
 contiIter = true;
-run_for_communication('newStack', dataL, date, 1, 'step', 0);
+run_for_communication('newStack', dataL, folderDateString, 1, 'step', 0);
 i = 0;
 while contiIter == true
     i = i + 1;
     
     for inputI = 1 : length(name)
-        call_run_for_each_input(inputI, dataL)
+        call_run_for_each_input(inputI, dataL, folderDateString)
     end
-    LL(i) = run_for_communication('newStack', dataL, date, 1, 'step', 0);
+    LL(i) = run_for_communication('newStack', dataL, folderDateString, 1, 'step', 0);
 
     if i ~= 1
         if abs(LL(i)-LL(i-1))/LL(i-1) < iterTol/100