Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

  • bbb89f8
  • /
  • Figure 6 -- Tokens Task Data Analysis
  • /
  • tok_sim_UGM.m
Raw File Download

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • content
  • directory
content badge
swh:1:cnt:7c0f1c5095d7a9096c2c5800d016ef7ad2093567
directory badge
swh:1:dir:d615f04e1fe23058870cce8c51d6ba6cdac3dbd8

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • content
  • directory
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
Generate software citation in BibTex format (requires biblatex-software package)
Generating citation ...
tok_sim_UGM.m
% tok_sim_UGM.m
% Generates response times for tokens task using the discrete-time UGM from
% Barendregt et al., 2022.

function T = tok_sim_UGM(Nt,theta,a,sigma,tau,varargin)

% Use specified token movement stimulus if specified. Otherwise, generate
% random token movement stimulus:
if isempty(varargin)
    xi = [NaN 2*binornd(1,0.5,1,Nt)-1];
else
    xi = [NaN varargin{1}];
end

% Pre-allocate noise-free response time:
T = NaN;

% Define timestep for discretization:
n = 0; t = 0; dt = 0.200;

% Instantly respond with random choice if threshold is trivally-collapsed:
if theta == 0
    T = 0;
else
    E = 0; x = 0;

    % Determine threshold crossing time and associated choice:
    while isnan(T)
        n = n+1; t = t+dt;
        if n>Nt
            T = Nt;
        else
            p = prob_choice(sum(xi(1:n)==1),sum(xi(1:n)==-1),Nt);
            E = E+((-E+p-0.5)*dt+sigma*randn*sqrt(dt))/tau;
            x = a*E*t;
            if x>=theta
                T = n;
            elseif x<=-theta
                T = n;
            end
        end
    end
end

back to top

Software Heritage — Copyright (C) 2015–2025, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API