Release v1.1

1. Amended +qsn/@QSN/bias_sensitivity.m to allow calculation of sensitivity for readout over a given time window
2. Fixed problems caused by matlab's definition of the sinc function (normalized sinc function) by amending target functionals in +qsn/@Control/Control.m
3. Minor bug fixes to optimisation code
4. Added license info and copyright tags
5. Amended README

Author: lw1660-sms

+qsn/@Control/Control.m

@@ -16,6 +16,11 @@
   %   [x,err,exec_time,exit_flag,output,x0] = obj.solve_static (opt, x0)
   %                                       - solve problem by static controls
   %
+
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Frank C Langbein <frank@langbein.org>, Cardiff University
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Sophie M Shermer <lw1660@gmail.com>, Swansea University
+  % SPDX-License-Identifier: AGPL-3.0-or-later
+
   properties (SetAccess = private)
     system    = 'undef';                   % QSN object
     problem   = struct ('type', 'undef');  % Control problem description
@@ -144,7 +149,7 @@
         N = length(E);
         L = ones(N,1)*E.'-E*ones(1,N);
         W = (out'*V).*(V'*in)';
-        pp = 1-real(W*(exp(1i*L*T).*sinc(L*obj.problem.dt/2))*W');
+        pp = 1-real(W*(exp(1i*L*T).*sinc(L*obj.problem.dt/(2*pi)))*W');
         prob = prob + pp;
         ppp(rep) = pp;
       end
@@ -423,7 +428,7 @@ function disp (obj)
       N = length(E);
       L = ones(N,1)*E.'-E*ones(1,N);
       W = (out'*V).*(V'*in)';
-      prob = 1-real(W*(exp(1i*L*T).*sinc(L*obj.problem.dt/2))*W');
+      prob = 1-real(W*(exp(1i*L*T).*sinc(L*obj.problem.dt/(2*pi)))*W');
       err = prob;
       grad = [];
     end
@@ -461,7 +466,7 @@ function disp (obj)
         N = length(E);
         L = ones(N,1)*E.'-E*ones(1,N);
         W = (out'*V).*(V'*in)';
-        pp = 1-real(W*(exp(1i*L*T).*sinc(L*obj.problem.dt/2))*W');
+        pp = 1-real(W*(exp(1i*L*T).*sinc(L*obj.problem.dt/(2*pi)))*W');
         prob = prob + pp;
       end
       prob = prob / obj.problem.samples;
@@ -506,4 +511,4 @@ function disp (obj)
       end
     end
   end
-end
+end

+qsn/@Control/private/dexpma.m

@@ -2,6 +2,11 @@
   % [F,dF] = dexpma(M,dM,v)
   %
   % Gradient helper for eal_static_st
+
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Frank C Langbein <frank@langbein.org>, Cardiff University
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Sophie M Shermer <lw1660@gmail.com>, Swansea University
+  % SPDX-License-Identifier: AGPL-3.0-or-later
+  
   N   = length(M);
   AM  = [M zeros(N);dM M];
   if exist('v','var')

+qsn/@DS/DS.m

@@ -34,7 +34,11 @@
   %
   %   obj . plot_graph (type, scale, violations) 
   %                                        - Plot distances as graph
-  %
+
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Frank C Langbein <frank@langbein.org>, Cardiff University
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Sophie M Shermer <lw1660@gmail.com>, Swansea University
+  % SPDX-License-Identifier: AGPL-3.0-or-later
+
   properties (SetAccess = private)
     N    = NaN;        % Number of nodes
     D    = NaN;        % Distance matrix

+qsn/@DS/plot_graph.m

@@ -6,7 +6,10 @@ function plot_graph(obj, type, scale,violations)
   %   type        - Mode of graph construction: 'fdp' or 'neato'
   %   scale       - Graph scale
   %   violations  - Only print triangle violations
-  %
+
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Frank C Langbein <frank@langbein.org>, Cardiff University
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Sophie M Shermer <lw1660@gmail.com>, Swansea University
+  % SPDX-License-Identifier: AGPL-3.0-or-later
 
   S = obj.D >= obj.eps;
   D = (obj.D * S + 1) * scale;

+qsn/@DS/private/BellmanFord.m

@@ -21,6 +21,8 @@
   % N is the next node; specifically, N(v) is the next node from source
   % node s in the minimum path from source node s to destination node v.
   %
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019 Edmond Jonckheere, University of Southern California
+  % SPDX-License-Identifier: AGPL-3.0-or-later
 
   % Initialization
   Numnode = size(w,1);
@@ -53,4 +55,4 @@
     end
   end
 
-end
+end

+qsn/@DS/private/Dijkstra.m

@@ -16,6 +16,8 @@
   % N is the next node; specifically, N(v) is the next node from source node s
   % in the minimum path from source node s to destination node v.
   %
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019 Edmond Jonckheere, University of Southern California
+  % SPDX-License-Identifier: AGPL-3.0-or-later
 
   % Initialization
   Numnode = size(w,1);
@@ -61,4 +63,4 @@
 
   end
 
-end
+end

+qsn/@DS/private/fix_triangle_violations_isoceles.m

@@ -12,6 +12,10 @@
   %   DD   - Resulting distance matrix
   %
 
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Frank C Langbein <frank@langbein.org>, Cardiff University
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Sophie M Shermer <lw1660@gmail.com>, Swansea University
+  % SPDX-License-Identifier: AGPL-3.0-or-later
+
   if show ~= 0
     D0 = D;
   end
@@ -95,4 +99,4 @@
 
   end
 
-end
+end

+qsn/@DS/private/fix_triangle_violations_mincon.m

@@ -17,6 +17,10 @@
   %   DD    - Resulting distance matrix
   %
 
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Frank C Langbein <frank@langbein.org>, Cardiff University
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Sophie M Shermer <lw1660@gmail.com>, Swansea University
+  % SPDX-License-Identifier: AGPL-3.0-or-later
+
   n = size(D,1);
 
   S = (n * n - n) / 2;

+qsn/@DS/private/fix_triangle_violations_minuncon.m

@@ -11,7 +11,10 @@
   %             mode = [N,1] - L_N norm with scaling factor
   %   show  - If true, verbose mode
   %   DD    - Resulting distance matrix
-  %
+  
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Frank C Langbein <frank@langbein.org>, Cardiff University
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Sophie M Shermer <lw1660@gmail.com>, Swansea University
+  % SPDX-License-Identifier: AGPL-3.0-or-later
 
   n = size(D,1);
 

+qsn/@DS/private/fix_triangle_violations_straight.m

@@ -10,6 +10,10 @@
   %   DD   - Resulting distance matrix
   %
 
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Frank C Langbein <frank@langbein.org>, Cardiff University
+  % SPDX-FileCopyrightText: Copyright (C) 2011-2019, 2022 Sophie M Shermer <lw1660@gmail.com>, Swansea University
+  % SPDX-License-Identifier: AGPL-3.0-or-later
+
   if show ~= 0
     D0 = D;
   end