plateform stringclasses 1
value | repo_name stringlengths 13 113 | name stringlengths 3 74 | ext stringclasses 1
value | path stringlengths 12 229 | size int64 23 843k | source_encoding stringclasses 9
values | md5 stringlengths 32 32 | text stringlengths 23 843k |
|---|---|---|---|---|---|---|---|---|
github | raacampbell/sigstar-master | sigstar.m | .m | sigstar-master/sigstar.m | 8,746 | utf_8 | e2e197f27b32745594c8e72b1c70b5bd | function varargout=sigstar(groups,stats,nosort)
% sigstar - Add significance stars to bar charts, boxplots, line charts, etc,
%
% H = sigstar(groups,stats,nsort)
%
% Purpose
% Add stars and lines highlighting significant differences between pairs of groups.
% The user specifies the groups a... |
github | PRNicovich/NicoLase-master | SequenceUploader.m | .m | NicoLase-master/Software/BasicController/SequenceUploaderGUI/SequenceUploader.m | 12,740 | utf_8 | a370678e820544b286f7eef186968bb4 | % SequenceUploader.m
%
% GUI front-end to handle uploading laser sequences to Arduino via USB
% serial.
% Requires Arduino to be running corresponding SerialEvent.ino sketch
%
% Changed data type to cell. Need to update load, save, functions
% to reflect this.
function SequenceUploader(varargin)
if nargin ==... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/figure9 and figure 11/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/figure9 and figure 11/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/figure 10/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/figure 10/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/figure2/figure2_bcef/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/figure2/figure2_ad/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/figure 15/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/figure 15/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/figure14 and 16/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/figure14 and 16/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/table2/model12/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/table2/hodgel2/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/table1/model12/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/table1/hodgel2/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/table6/model12/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/table6/hodgel2/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/figure 6/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/figure 6/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/table4/model12/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/table4/hodgel2/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/figure5 and 7/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/figure5 and 7/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lb_xqq.m | .m | qqxu_yyao-master/code/figure3/figure3_a/lb_xqq.m | 2,162 | utf_8 | 2b5870b2696cb63aaae0db49a3591c28 | function fit = lb_xqq(d,X,y,kappa,alpha,tlist,nt,trate,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds(X,1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 10
print = 0;
end
tic();
[U,S,V] = svd(full(d'*d));
s = diag(S);
s(s<=1e-8) ... |
github | qianqianxu010/qqxu_yyao-master | lbi_likelihood.m | .m | qqxu_yyao-master/code/figure3/figure3_bc/lbi_likelihood.m | 2,966 | utf_8 | 12ac6b64fd8b7cf78993c81c3e428132 | function fit = lbi_likelihood(d,X,y,kappa,alpha,tlist,nt,trate,model,group,print)
if nargin < 4
error('more input arguments needed.');
end
if nargin < 5 || isempty(alpha)
sigma = svds([d,X],1);
alpha = length(y)/kappa/sigma^2;
end
if nargin < 7 || isempty(nt)
nt = 100;
end
if nargin < 8 || isempty(trate... |
github | richardedden/Gannet3.0-master | Spectral_Registration_HERMES.m | .m | Gannet3.0-master/Spectral_Registration_HERMES.m | 15,813 | utf_8 | 2ca3fe28c982c2d0eb2fbc5c52a20483 | function [AllFramesFTrealign, MRS_struct] = Spectral_Registration_HERMES(MRS_struct)
% Spectral registration is a time-domain frequency-and-phase correction
% routine as per Near et al. (2015). Incorporates a multiplexed,
% probabilistic approach for aligning HERMES data (MM: 170609)
showPlots = 'n';
% Looping... |
github | richardedden/Gannet3.0-master | loadRawKspace.m | .m | Gannet3.0-master/loadRawKspace.m | 14,071 | utf_8 | 6f71d46235f331fc46f9420239f607f3 | function kspace = loadRawKspace(listordatafile, varargin)
% LOADRAWKSPACEPHILIPS Loads the Philips *.list and *.data files that can
% be exported from Philips MRI systems.
%
% [KSPACE] = LOADRAWKSPACEPHILIPS(LISTORDATAFILE)
% [KSPACE] = LOADRAWKSPACEPHILIPS(LISTORDATAFILE,COIL_COMBINATIONS)
%
% KSPACE ... |
github | richardedden/Gannet3.0-master | SiemensRead.m | .m | Gannet3.0-master/SiemensRead.m | 15,927 | utf_8 | 583cf8b23154ffac81dcd1596661d31e | % Read spectroscopy data from Siemens machine
%
% Read a .rda file
%
% Version 181113
function MRS_struct = SiemensRead(MRS_struct, off_filename, on_filename, water_filename)
% [filename , pathname ] = uigetfile('*.rda', 'Select an RDA file')
% rda_filename = [pathname , filename]; %'c:/data/spectroscopy/spec ra... |
github | richardedden/Gannet3.0-master | GEDeIdentify.m | .m | Gannet3.0-master/GEDeIdentify.m | 10,284 | utf_8 | 3b42771beecc69a187b45e84c4aa8663 | function GEDeIdentify(fnames)
% GEDeIdentify
% Reads GE P-files and removes participant/exam information from the
% header. Newly de-identified P-files are then output, with filenames
% appended with '_noID'. The original files are not overwritten.
%
% If GEDeIdentify has already been run, and de-identifi... |
github | richardedden/Gannet3.0-master | GannetFitPhantom.m | .m | Gannet3.0-master/GannetFitPhantom.m | 43,041 | utf_8 | 6e2fc975a03da00d980c3e1fe027bb13 | function MRS_struct = GannetFitPhantom(MRS_struct, varargin)
% Gannet 3.0 GannetFitPhantom
% Updates by MM 2018
if MRS_struct.p.PRIAM
vox = MRS_struct.p.Vox;
else
vox = {MRS_struct.p.Vox{1}};
end
if MRS_struct.p.HERMES && nargin < 2
target = {MRS_struct.p.target, MRS_struct.p.target2};
else
% varargin... |
github | richardedden/Gannet3.0-master | VAXD_to_uint64le.m | .m | Gannet3.0-master/VAXD_to_uint64le.m | 23,023 | utf_8 | d7e49086b76b41b1296caeaac0ea816b |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<meta http-equiv="X-UA-Compatible" content="IE=8"/>
<!-- START OF GLOBAL NAV -->
<link rel="stylesheet" href="/matlabcentral/css/sitewide.css" type="... |
github | richardedden/Gannet3.0-master | dicom_move.m | .m | Gannet3.0-master/dicom_move.m | 4,262 | utf_8 | 2926e5b9b84d2ec31c878bdbc61433bc | % Advance to the point in the file where the target group and
% element are and return the length of the field.
% Orginally:
% Greg Reynolds 26-January-2005.
% Vastly updated:
% Greg Reynolds 17-June-2005.
%
% Now with in-sequence data support.
function length = dicom_move(fd, strGroup, strElement)
%fprintf('\nSearch... |
github | richardedden/Gannet3.0-master | dicom_get_spectrum_siemens.m | .m | Gannet3.0-master/dicom_get_spectrum_siemens.m | 780 | utf_8 | 5c8347b72dbf305c1ac63574d944bdc8 | % A special function to read Siemens' spectroscopy FIDs.
function complex_fid = dicom_get_spectrum_siemens(fd)
% advance the field to the appropriate place
% in the file
field_length = dicom_move(fd, '7FE1', '1010');
field_size = field_length / 4;
% we can use fread to read data in as floats
[fid, fid_size] = fread... |
github | richardedden/Gannet3.0-master | SiemensTwixRead.m | .m | Gannet3.0-master/SiemensTwixRead.m | 19,909 | utf_8 | db7ea6219bebf5d89135e4fbe7ac868d | function MRS_struct = SiemensTwixRead(MRS_struct,fname,fname_water)
%% function MRS_struct = SiemensTwixRead(MRS_struct,fname,fname_water)
% Reads Siemens TWIX files (*.dat).
%
% Author:
% Dr. Georg Oeltzschner (Johns Hopkins University, 2017-03-22)
% goeltzs1@jhmi.edu
%
% Credits:
%
... |
github | richardedden/Gannet3.0-master | PhilipsDeIdentify.m | .m | Gannet3.0-master/PhilipsDeIdentify.m | 5,968 | utf_8 | 36bdcb4055a125bea8249b45b3b57379 | function PhilipsDeIdentify(fnames)
% PhilipsDeIdentify
% Reads Philips SPAR files and removes participant information. Newly
% de-identified SPAR files are then output, with filenames appended with
% '_noID'. The original files are not overwritten.
%
% PhilipsDeIdentify will also create copies of the SDAT... |
github | richardedden/Gannet3.0-master | VAXF_to_uint32le.m | .m | Gannet3.0-master/VAXF_to_uint32le.m | 3,657 | utf_8 | f1c1a8982d0de06b34b2d32051fc9a80 |
function [ uint32le] = VAXF_to_uint32le(floatVAXF)
%VAXF_TO_UINT32LE Converts from VAXF (single precision) to IEEE-LE (UINT32)
% This function converts floating point numbers initialized in MATLAB
% into equivalent raw 32bit unsigned integers (little endian)using the
% specification for the VAXF floating point... |
github | richardedden/Gannet3.0-master | GannetFit.m | .m | Gannet3.0-master/GannetFit.m | 74,376 | utf_8 | 256a6c67e03d91120ebacb286d33c191 | function MRS_struct = GannetFit(MRS_struct, varargin)
% Gannet 3.0 GannetFit
% Started by RAEE Nov 5, 2012
% Updates by MGS, MM 2016-2018
if MRS_struct.p.PRIAM
vox = MRS_struct.p.Vox;
else
vox = {MRS_struct.p.Vox{1}};
end
if MRS_struct.p.HERMES && nargin < 2
target = {MRS_struct.p.target, MRS_struct.p.tar... |
github | richardedden/Gannet3.0-master | read_twix_hdr_Gannet.m | .m | Gannet3.0-master/read_twix_hdr_Gannet.m | 5,882 | utf_8 | 875bfd897e787ddd4d9d7944f24f24aa | function [prot,rstraj] = read_twix_hdr_Gannet(fid)
% function to read raw data header information from siemens MRI scanners
% (currently VB and VD software versions are supported and tested).
%
% Author: Philipp Ehses (philipp.ehses@tuebingen.mpg.de), Mar/11/2014
nbuffers = fread(fid, 1,'uint32');
... |
github | richardedden/Gannet3.0-master | GannetMask_GE.m | .m | Gannet3.0-master/GannetMask_GE.m | 9,054 | utf_8 | 0aa5d3e49dc0c41e5cd34b6dfe046a40 | function MRS_struct = GannetMask_GE(fname, dcm_dir, MRS_struct, ii, vox, kk)
% MM (180329): Updated GannetMask_GE function. Rotated localizer files are
% no longer required. Voxel geometry is taken directly from P-file headers
% and the structural image DICOMs.
% Code heavily based on Ralph Noeske's (GE Berlin) SV_MRI... |
github | richardedden/Gannet3.0-master | mapVBVD_Gannet.m | .m | Gannet3.0-master/mapVBVD_Gannet.m | 34,774 | windows_1250 | 03b0bc0773078ccaae98f014f2686316 | function twix_obj = mapVBVD_Gannet(filename,varargin)
% Reads Siemens raw .dat file from VB/VD MRI raw data.
% requires twix_map_obj.m & read_twix_hdr.m
%
%
% Author: Philipp Ehses (philipp.ehses@tuebingen.mpg.de)
%
%
% Philipp Ehses 11.02.07, original version
% [..]
% Philipp Ehses 22.03.11, port ... |
github | richardedden/Gannet3.0-master | VAXG_to_uint64le.m | .m | Gannet3.0-master/VAXG_to_uint64le.m | 22,957 | utf_8 | 85b7986f2b0756d461e145d9f245f5e9 |
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html lang="en">
<head>
<meta http-equiv="X-UA-Compatible" content="IE=8"/>
<!-- START OF GLOBAL NAV -->
<link rel="stylesheet" href="/matlabcentral/css/sitewide.css" type="... |
github | richardedden/Gannet3.0-master | read_cpx.m | .m | Gannet3.0-master/priam/read_cpx.m | 31,579 | utf_8 | 844112a772835941bc960e0b75da100d | %%read cpx
function data = read_cpx(file, border, flip_img, kspace, read_params, compression_parameter)
%--------------------------------------------------------------------------
% data = read_cpx(file, border, flip_img)
%
% read_cpx: Function for reading the whole cpx-file and writes the data in
% a predef... |
github | richardedden/Gannet3.0-master | VAXF_to_uint32le.m | .m | Gannet3.0-master/priam/VAXF_to_uint32le.m | 1,233 | utf_8 | dd5c8fcf994294c3f309b18dbbc222dd |
function [ uint32le] = VAXF_to_uint32le(floatVAXF)
%VAXF_TO_UINT32LE Converts from VAXF (single precision) to IEEE-LE (UINT32)
A = 2; % VAX specific
B = 128; % VAX specific
C = 0.5; % VAX specific
D = log(2); % VAX specific
% Determine the sign bit. If -ve transform to positive.
S = zeros(size(floatVAXF)... |
github | danielrherber/pm-architectures-project-master | INSTALL_PMA_project.m | .m | pm-architectures-project-master/INSTALL_PMA_project.m | 12,514 | utf_8 | c691b3bcadbe0670edcc5750605e3c7f | %--------------------------------------------------------------------------
% INSTALL_PMA_project
% This scripts helps you get the PM Architectures Project up and running
%--------------------------------------------------------------------------
% Automatically adds project files to your MATLAB path, downloads the
% r... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v11BFS_test.m | .m | pm-architectures-project-master/optional/mex/PMA_EnumerationAlg_v11BFS/PMA_EnumerationAlg_v11BFS_test.m | 1,729 | utf_8 | aee239805c3d4a05b006c69859395ab4 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v11BFS_test.m
% Test function for PMA_EnumerationAlg_v11BFS
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v12BFS_test.m | .m | pm-architectures-project-master/optional/mex/PMA_EnumerationAlg_v12BFS/PMA_EnumerationAlg_v12BFS_test.m | 1,670 | utf_8 | 9a7752ab7039daff71b158b617d29e30 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v12BFS_test.m
% Test function for PMA_EnumerationAlg_v12BFS
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v10_test.m | .m | pm-architectures-project-master/optional/mex/PMA_EnumerationAlg_v10/PMA_EnumerationAlg_v10_test.m | 1,714 | utf_8 | 96c1dcd6cb0ea6c053167be52968e835 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v10_test.m
% Test function for PMA_EnumerationAlg_v10
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contr... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v12DFS_test.m | .m | pm-architectures-project-master/optional/mex/PMA_EnumerationAlg_v12DFS/PMA_EnumerationAlg_v12DFS_test.m | 1,739 | utf_8 | 77bbd41c8b07d88a8a23c60b33860b37 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v12DFS_test.m
% Test function for PMA_EnumerationAlg_v12DFS
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v1_test.m | .m | pm-architectures-project-master/optional/mex/PMA_EnumerationAlg_v1/PMA_EnumerationAlg_v1_test.m | 1,476 | utf_8 | 3514e1b885e2c12e5c8a990dfe328c86 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v1_test.m
% Test function for PMA_EnumerationAlg_v1
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contrib... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v8_test.m | .m | pm-architectures-project-master/optional/mex/PMA_EnumerationAlg_v8/PMA_EnumerationAlg_v8_test.m | 1,775 | utf_8 | 6a83df4cda269aa4c4933ce0f4721281 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v8_test.m
% Test function for PMA_EnumerationAlg_v8
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary contrib... |
github | danielrherber/pm-architectures-project-master | PMA_EnumerationAlg_v11DFS_test.m | .m | pm-architectures-project-master/optional/mex/PMA_EnumerationAlg_v11DFS/PMA_EnumerationAlg_v11DFS_test.m | 1,795 | utf_8 | 2bbe78bc2eaa9172cc64dab0a91e9ca2 | %--------------------------------------------------------------------------
% PMA_EnumerationAlg_v11DFS_test.m
% Test function for PMA_EnumerationAlg_v11DFS
%--------------------------------------------------------------------------
%
%--------------------------------------------------------------------------
% Primary... |
github | danielrherber/pm-architectures-project-master | PMA_EX_Assigning.m | .m | pm-architectures-project-master/examples/patterns/PMA_EX_Assigning.m | 3,627 | utf_8 | d7a9a23e3c5732d8c9aea7c807032600 | %--------------------------------------------------------------------------
% PMA_EX_Assigning.m
% The assigning pattern has to do with assignments or allocations between
% two predefined sets of entities
%--------------------------------------------------------------------------
% D. Selva, B. Cameron, and E. Crawley,... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A290778.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A290778.m | 1,830 | utf_8 | 0cfbaf917fbd7802ee38aa29aa71d4a6 | %--------------------------------------------------------------------------
% PMA_EX_A290778
% A290778, Number of connected undirected unlabeled loopless multigraphs
% with 4 vertices and n>0 edges
% 0, 2, 5, 11, 22, 37, 61, 95, 141, 203, 288, 393, 531, 704, 918, 1180, ...
%---------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A003049.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A003049.m | 2,021 | utf_8 | f584c159bc8ce412d3a1300433e48b41 | %--------------------------------------------------------------------------
% PMA_EX_A003049
% A003049, number of connected Eulerian graphs with n unlabeled nodes
% 1, 0, 1, 1, 4, 8, 37, 184, 1782, 31026, 1148626, 86539128, ...
%--------------------------------------------------------------------------
%
%-------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000262.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000262.m | 2,263 | utf_8 | 50eb76dac971f41b08eb6fa7a5e8a48a | %--------------------------------------------------------------------------
% PMA_EX_A000262
% A000262, generate all labeled-rooted skinny-tree forests on n vertices
% 1, 3, 13, 73, 501, 4051, 37633, 394353, 4596553, 58941091, 824073141, ...
%--------------------------------------------------------------------------
%
... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A002094.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A002094.m | 1,785 | utf_8 | ed779649f9702ce35e72860f1b9ad5b8 | %--------------------------------------------------------------------------
% PMA_EX_A002094
% A002094, number of unlabeled connected loop-less graphs on n nodes
% containing exactly one cycle (of length at least 2) and with all nodes
% of degree <= 4
% 0, 1, 2, 5, 10, 25, 56, 139, 338, 852, 2145, 5513, 14196, 36962, .... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000055.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000055.m | 1,922 | utf_8 | 650bf3c5e30d219b284b1efb3770920b | %--------------------------------------------------------------------------
% PMA_EX_A000055
% A000055, number of trees with n unlabeled nodes
% 1, 1, 1, 2, 3, 6, 11, 23, 47, 106, 235, 551, 1301, 3159, 7741, 19320, ...
%--------------------------------------------------------------------------
%
%----------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000081.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000081.m | 1,867 | utf_8 | 4538afb6937c9dc2ae2408cff099da88 | %--------------------------------------------------------------------------
% PMA_EX_A000081
% A000081, number of unlabeled rooted trees with n nodes
% 1, 1, 2, 4, 9, 20, 48, 115, 286, 719, 1842, 4766, 12486, 32973, 87811,...
%--------------------------------------------------------------------------
%
%---------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A056156.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A056156.m | 1,840 | utf_8 | 33e053760558d9789ddfa10ee4f8a797 | %--------------------------------------------------------------------------
% PMA_EX_A056156
% A056156, number of connected bipartite graphs with n edges, no isolated
% vertices and a distinguished bipartite block, up to isomorphism
% 1, 2, 3, 7, 12, 32, 67, 181, 458, 1295, 3642, 10975, 33448, 106424, ...
%------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A007721.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A007721.m | 1,991 | utf_8 | 15953d4e83dcbf0d575fa72bbc3a7646 | %--------------------------------------------------------------------------
% PMA_EX_A007721
% A007721, number of distinct degree sequences among all connected graphs
% with n nodes
% 1, 1, 2, 6, 19, 68, 236, 863, 3137, 11636, 43306, 162728, 614142, ...
%-----------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A095268.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A095268.m | 1,832 | utf_8 | 05f164536400f5c2d117b612adad7711 | %--------------------------------------------------------------------------
% PMA_EX_A095268
% A095268, number of distinct degree sequences among all n-vertex graphs
% with no isolated vertices
% 0, 1, 2, 7, 20, 71, 240, 871, 3148, 11655, 43332, 162769, 614198, ...
%-----------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000664.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000664.m | 1,671 | utf_8 | f5af115330785f4b63bbbc61f44d5895 | %--------------------------------------------------------------------------
% PMA_EX_A000664
% A000664, number of graphs with n edges
% 1, 1, 2, 5, 11, 26, 68, 177, 497, 1476, 4613, 15216, 52944, ...
%--------------------------------------------------------------------------
%
%-----------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A005814.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A005814.m | 1,783 | utf_8 | 5f0653b6e4045ede4e59415514289624 | %--------------------------------------------------------------------------
% PMA_EX_A005814
% A005814, number of 3-regular (trivalent) labeled graphs on 2n vertices
% with multiple edges and loops allowed
% 2, 47, 4720, 1256395, 699971370, 706862729265, 1173744972139740, ...
%------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A253186.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A253186.m | 1,663 | utf_8 | af32b530b71fff011202c0ac340a542a | %--------------------------------------------------------------------------
% PMA_EX_A253186
% A253186, Number of connected unlabeled loopless multigraphs with 3
% vertices and n>0 edges
% 0, 1, 2, 3, 4, 6, 7, 9, 11, 13, 15, 18, 20, 23, 26, 29, 32, 36, 39, ...
%----------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A289158.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A289158.m | 1,791 | utf_8 | 6fd38b9fef7f6de0556f6fb2cc0a8e13 | %--------------------------------------------------------------------------
% PMA_EX_A289158
% A289158, number of connected multigraphs with n nodes of degree at most 4
% and with at most double edges
% 1, 2, 7, 28, 112, 590, 3419, 23453, 178599, 1516692, 14083855, ...
%-------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A001349.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A001349.m | 1,609 | utf_8 | 3ff42cc091dfad95220688dccfed4fb8 | %--------------------------------------------------------------------------
% PMA_EX_A001349
% A001349, number of connected graphs with n nodes
% 1, 1, 2, 6, 21, 112, 853, 11117, 261080, 11716571, ...
%--------------------------------------------------------------------------
%
%----------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000088.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000088.m | 1,586 | utf_8 | 9f1a7fae9de8395f516534740b701509 | %--------------------------------------------------------------------------
% PMA_EX_A000088
% A000088, number of graphs on n unlabeled nodes
% 1, 2, 4, 11, 34, 156, 1044, 12346, 274668, 12005168, ...
%--------------------------------------------------------------------------
%
%----------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A002854.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A002854.m | 2,109 | utf_8 | a0167851c916c8ae304b7a1c95167855 | %--------------------------------------------------------------------------
% PMA_EX_A002854
% A002854, number of unlabeled Euler graphs with n nodes; number of
% unlabeled two-graphs with n nodes; number of unlabeled switching classes
% of graphs with n nodes; number of switching classes of unlabeled signed
% complete... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000029.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000029.m | 2,243 | utf_8 | d3b607bbc44a0efb3c5367de89a21f7a | %--------------------------------------------------------------------------
% PMA_EX_A000029
% A000029, number of necklaces with n beads of 2 colors, allowing turning
% over (these are also called bracelets)
% 2, 3, 4, 6, 8, 13, 18, 30, 46, 78, 126, 224, 380, 687, 1224, 2250, ...
%--------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A005176.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A005176.m | 1,876 | utf_8 | c53c260a09d057bd7dcb779bfa9b6ba9 | %--------------------------------------------------------------------------
% PMA_EX_A005176
% A005176, number of regular graphs with n nodes
% 1, 2, 2, 4, 3, 8, 6, 22, 26, 176, 546, 19002, 389454, 50314870, ...
%--------------------------------------------------------------------------
%
%-----------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000272.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000272.m | 1,744 | utf_8 | e7fc7252d4ffb1720ebfb076f0b99842 | %--------------------------------------------------------------------------
% PMA_EX_A000272
% A000272, number of trees on n labeled nodes: n^(n-2)
% 1, 1, 3, 16, 125, 1296, 16807, 262144, 4782969, 100000000, 2357947691,...
%--------------------------------------------------------------------------
%
%-----------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A006820.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A006820.m | 1,680 | utf_8 | 5207c5ac9a4606b3de19d9e767dad0c7 | %--------------------------------------------------------------------------
% PMA_EX_A006820
% A006820, number of connected regular simple graphs of degree 4 (or
% quartic graphs) with n nodes
% 0, 0, 0, 0, 1, 1, 2, 6, 16, 59, 265, 1544, 10778, 88168, 805491, ...
%-------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A001190.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A001190.m | 2,205 | utf_8 | cbb0cdb1a843a6dc286365bd62523336 | %--------------------------------------------------------------------------
% PMA_EX_A001190
% A001190, Wedderburn-Etherington numbers: unlabeled binary rooted trees
% (every node has out-degree 0 or 2) with n endpoints (and 2n-1 nodes in
% all)
% 1, 1, 1, 2, 3, 6, 11, 23, 46, 98, 207, 451, 983, 2179, 4850, 10905, ...
... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A001147.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A001147.m | 1,694 | utf_8 | 75382f46bf11d92b8008c8e5125b5252 | %--------------------------------------------------------------------------
% PMA_EX_A001147
% A001147, number of perfect matchings in the complete graph K(2n)
% double factorial of odd numbers: a(n) = (2*n-1)!! = 1*3*5*...*(2*n-1)
% 1, 3, 15, 105, 945, 10395, 135135, 2027025, 34459425, 654729075, ...
%----------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000110.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000110.m | 2,045 | utf_8 | 7ee3880eca9665c691d9a03285d1e2bc | %--------------------------------------------------------------------------
% PMA_EX_A000110
% A000110, Bell or exponential numbers: number of ways to partition a set
% of n labeled elements
% 1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975, 678570, 4213597, ...
%---------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A134818.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A134818.m | 1,770 | utf_8 | e142b906f8bdfb2bed2809b8af6fcb82 | %--------------------------------------------------------------------------
% PMA_EX_A134818
% A134818, number of connected multigraphs with n nodes of degree at most 4
% and with at most triple edges
% 1, 3, 9, 37, 146, 772, 4449, 30307, 228605, 1921464, 17652327, ...
%-------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A002905.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A002905.m | 1,693 | utf_8 | 4265009bc90d431baf1452c221adb3c0 | %--------------------------------------------------------------------------
% PMA_EX_A002905
% A002905, number of connected graphs with n edges
% 1, 1, 3, 5, 12, 30, 79, 227, 710, 2322, 8071, 29503, 112822, ...
%--------------------------------------------------------------------------
%
%------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000041.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000041.m | 1,788 | utf_8 | 7dfe59867b54914359069c02cb8dbdb8 | %--------------------------------------------------------------------------
% PMA_EX_A000041
% A000041, a(n) is the number of partitions of n (the partition numbers)
% 1, 2, 3, 5, 7, 11, 15, 22, 30, 42, 56, 77, 101, 135, 176, 231, 297, ...
%--------------------------------------------------------------------------
%
%-... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A060542.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A060542.m | 1,852 | utf_8 | e1774878392ad02353f4a60b4fef27a9 | %--------------------------------------------------------------------------
% PMA_EX_A060542
% A060542, number of ways of dividing 3n labeled items into 3 unlabeled
% boxes with n items in each box
% 1, 15, 280, 5775, 126126, 2858856, 66512160, 1577585295, 37978905250, ...
%---------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A250308.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A250308.m | 2,031 | utf_8 | 39cc04a740c70d4a8320de3d5b8c74d7 | %--------------------------------------------------------------------------
% PMA_EX_A250308
% A250308, number of unlabeled unrooted trees on 2n vertices with all
% vertices of odd degree
% 1, 1, 2, 3, 7, 13, 32, 74, 192, 497, 1379, 3844, 11111, 32500, 96977, ...
%-------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A108246.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A108246.m | 1,866 | utf_8 | c4125903cf22d3fa777baf3ee40fbae4 | %--------------------------------------------------------------------------
% PMA_EX_A108246
% A108246, number of labeled 2-regular graphs with no multiple edges, but
% loops are allowed (i.e., each vertex is endpoint of two (usual) edges or
% one loop)
% 1, 1, 2, 8, 38, 208, 1348, 10126, 86174, 819134, 8604404, 98981... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000142.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000142.m | 1,950 | utf_8 | 68895576df71f9e279b06b3f6ae8c109 | %--------------------------------------------------------------------------
% PMA_EX_A000142
% A000142, generate all permutations of n vertices
% 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, ...
%--------------------------------------------------------------------------
%
%----------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A003082.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A003082.m | 2,119 | utf_8 | 8afa49537783fa23dedfeeefcfd88433 | %--------------------------------------------------------------------------
% PMA_EX_A003082
% A003082, Number of multigraphs with 4 nodes and n edges
% 1, 3, 6, 11, 18, 32, 48, 75, 111, 160, 224, 313, 420, 562, 738, ...
%--------------------------------------------------------------------------
%
%--------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A032279.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A032279.m | 2,165 | utf_8 | 0b4ad759b2465d71e4ca999402b3e117 | %--------------------------------------------------------------------------
% PMA_EX_A032279
% A032279, number of bracelets (turnover necklaces) of n beads of 2 colors,
% 5 of them black
% 1, 1, 3, 5, 10, 16, 26, 38, 57, 79, 111, 147, 196, 252, 324, 406, ...
%------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A191646.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A191646.m | 2,923 | utf_8 | 35dd25ce117b21b0e717b96f2e0b15b9 | %--------------------------------------------------------------------------
% PMA_EX_A191646
% A191646, Triangle read by rows: T(q,p) = number of connected multigraphs
% with p >= 0 edges and 1 <= q <= p+1 vertices, with no loops allowed
% 1 1 1 1 1 1 1 1 1 1 1
% 0 ... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A306334.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A306334.m | 2,252 | utf_8 | 6e9bf322294eddc9ce5a7b18246f834f | %--------------------------------------------------------------------------
% PMA_EX_A306334
% A306334, a(n) is the number of different linear hydrocarbon molecules
% with n carbon atoms
% 1, 3, 4, 10, 18, 42, 84, 192, 409, 926, 2030, 4577, 10171, 22889, 51176, ...
%-----------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A014395.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A014395.m | 1,823 | utf_8 | 97252b121cc5b7d971a935af6ec8107d | %--------------------------------------------------------------------------
% PMA_EX_A014395
% A014395, Number of multigraphs with 5 nodes and n edges
% 1, 3, 7, 17, 35, 76, 149, 291, 539, 974, 1691, 2874, 4730, 7620, ...
%--------------------------------------------------------------------------
%
%-------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A001187.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A001187.m | 1,662 | utf_8 | 59a4737f18e61993fd031755071523ca | %--------------------------------------------------------------------------
% PMA_EX_A001187
% A001187, number of connected labeled graphs with n nodes
% 1, 1, 4, 38, 728, 26704, 1866256, 251548592, 66296291072, ...
%--------------------------------------------------------------------------
%
%-------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A005333.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A005333.m | 2,301 | utf_8 | 4cb66a01742fed6a55d85fc1012daf3f | %--------------------------------------------------------------------------
% PMA_EX_A005333
% A005333, number of 2-colored connected labeled graphs with n vertices of
% the first color and n vertices of the second color
% 1, 5, 205, 36317, 23679901, 56294206205, 502757743028605, ...
%----------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A058014.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A058014.m | 2,094 | utf_8 | ab036c71e724155f136fa8cb8088cee2 | %--------------------------------------------------------------------------
% PMA_EX_A058014
% A058014, number of labeled trees with n+1 nodes such that the degrees of
% all nodes, excluding the first node, are odd
% 1, 1, 4, 13, 96, 541, 5888, 47545, 686080, 7231801, 130179072, ...
%-----------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000598.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000598.m | 1,763 | utf_8 | 8449fd497213498d662096c8f3bbe0ef | %--------------------------------------------------------------------------
% PMA_EX_A000598
% A000598, number of rooted ternary trees with n nodes; number of n-carbon
% alkyl radicals C(n)H(2n+1) ignoring stereoisomers
% 1, 1, 2, 4, 8, 17, 39, 89, 211, 507, 1238, 3057, 7639, 19241, 48865, ...
%------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A002851.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A002851.m | 1,672 | utf_8 | b11d011458599876d72fbe2438d4b6ad | %--------------------------------------------------------------------------
% PMA_EX_A002851
% A002851, number of unlabeled trivalent (or cubic) connected graphs with
% 2n nodes
% 0, 1, 2, 5, 19, 85, 509, 4060, 41301, 510489, 7319447, 117940535, ...
%---------------------------------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A000014.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A000014.m | 1,991 | utf_8 | d2567223ff8f52573acbc16117a5f14d | %--------------------------------------------------------------------------
% PMA_EX_A000014
% A000014, number of series-reduced trees with n nodes
% 1, 1, 0, 1, 1, 2, 2, 4, 5, 10, 14, 26, 42, 78, 132, 249, 445, 842, ...
%--------------------------------------------------------------------------
%
%--------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A001710.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A001710.m | 1,888 | utf_8 | bcef7dc5b6eb2429af447a339bd34418 | %--------------------------------------------------------------------------
% PMA_EX_A001710
% A001710, number of necklaces one can make with n distinct beads: n!
% bead permutations, divide by two to represent flipping the necklace over,
% divide by n to represent rotating the necklace
% number of connected labeled gr... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A182012.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A182012.m | 1,845 | utf_8 | f94fb31ce5bbc497a7d3e3a59e23ecfc | %--------------------------------------------------------------------------
% PMA_EX_A182012
% A182012, number of graphs on 2n unlabeled nodes all having odd degree
% 1, 3, 16, 243, 33120, 87723296, 3633057074584, 1967881448329407496, ...
%--------------------------------------------------------------------------
%
%--... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A318870.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A318870.m | 1,919 | utf_8 | 91cc438c47ff9a85da6f018493ebb505 | %--------------------------------------------------------------------------
% PMA_EX_A318870
% A318870, number of connected bipartite graphs on n unlabeled nodes with a
% distinguished bipartite block
% 2, 1, 2, 4, 10, 27, 88, 328, 1460, 7799, 51196, 422521, 4483460, ...
%-----------------------------------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A005177.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A005177.m | 1,883 | utf_8 | 5619fb72621421ee227fca1eaeac0904 | %--------------------------------------------------------------------------
% PMA_EX_A005177
% A005177, number of connected regular graphs with n nodes
% 1, 1, 1, 2, 2, 5, 4, 17, 22, 167, 539, 18979, 389436, 50314796, ...
%--------------------------------------------------------------------------
%
%-------------------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A004108.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A004108.m | 1,642 | utf_8 | 16ddb51a1eca8ec0a528fcf67e5c46ab | %--------------------------------------------------------------------------
% PMA_EX_A004108
% A004108, number of n-node unlabeled connected graphs without endpoints
% 0, 0, 1, 3, 11, 61, 507, 7442, 197772, 9808209, 902884343, ...
%--------------------------------------------------------------------------
%
%----------... |
github | danielrherber/pm-architectures-project-master | PMA_EX_A053419.m | .m | pm-architectures-project-master/examples/oeis/PMA_EX_A053419.m | 1,682 | utf_8 | 690bf73db2adaf3d4a99bc701ae21b70 | %--------------------------------------------------------------------------
% PMA_EX_A053419
% A053419, number of graphs with loops (symmetric relations) with n edges
% 2, 5, 14, 38, 107, 318, 972, 3111, 10410, 36371, 132656, 504636, ...
%--------------------------------------------------------------------------
%
%---... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.