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 | xingyizhou/deepcut-master | visualise_pairwise_probabilities.m | .m | deepcut-master/lib/pose/visualise_pairwise_probabilities.m | 11,319 | utf_8 | 1fa773ddf944a43ab5e8c3feeb112917 | function pw_prob = visualise_pairwise_probabilities(expidx,firstidx,nImgs, cidx1, cidx2, bVis)
if (ischar(expidx))
expidx = str2num(expidx);
end
if (nargin < 2)
firstidx = 1;
end
if (ischar(firstidx))
firstidx = str2num(firstidx);
end
if (nargin < 3)
nImgs = 1;
elseif ischar(nImgs)
nImgs = str2n... |
github | xingyizhou/deepcut-master | get_sticks_segmentation.m | .m | deepcut-master/lib/pose/get_sticks_segmentation.m | 4,247 | utf_8 | f4a731fa6576a5a11c36a2745382758f | function [ scmap_all,poly ] = get_sticks_segmentation( p, im, joints )
stride = 4; %p.stride;
half_stride = stride/2;
scale_factor = p.scale_factor;
sz = 17;
scmap_height = ceil(size(im, 1) * scale_factor / stride);
scmap_width = ceil(size(im, 2) * scale_factor / stride);
joint_pairs = [1 2; 2 3; 6 5; 4 5; 7 8; 8 9;... |
github | xingyizhou/deepcut-master | cnn_process_image.m | .m | deepcut-master/lib/pose/cnn_process_image.m | 2,082 | utf_8 | 632db58540a4487242a82f56f5b16d83 | function [feat_prob, locreg_pred, next_pred, rpn_prob, rpn_bbox] = cnn_process_image(input, net, sigmoid)
% switch width and height for Caffe
input = permute(input, [2 1 3]);
blob_size = [size(input), 1];
net.blobs('data').reshape(blob_size);
blob_size = [size(input), 1];
batch = zeros(b... |
github | xingyizhou/deepcut-master | cnn_process_image_tiled.m | .m | deepcut-master/lib/pose/cnn_process_image_tiled.m | 4,143 | utf_8 | 841d103bf3af203f69b73b6329b4d543 | function [scoremaps, locreg_pred, nextreg_pred] = cnn_process_image_tiled(input, net, sigmoid, im_bg_width, im_bg_height, stride)
max_size = 1000;
rf = 224; %receptive field
cut_off = rf/stride;
num_tiles_x = get_num_tiles(im_bg_width, max_size);
num_tiles_y = get_num_tiles(im_bg_height, max_size)... |
github | xingyizhou/deepcut-master | test_spatial_app_neighbour.m | .m | deepcut-master/lib/pose/test_spatial_app_neighbour.m | 19,301 | utf_8 | cf34ccd9382ceed5c2deb34d25d73503 | function test_spatial_app_neighbour(expidx,firstidx,nImgs,bRecompute,bVis)
fprintf('test_spatial_hist()\n');
if (ischar(expidx))
expidx = str2num(expidx);
end
if (ischar(firstidx))
firstidx = str2num(firstidx);
end
if (nargin < 2)
firstidx = 1;
end
if (nargin < 3)
nImgs = 1;
elseif ischar(nImgs)
... |
github | xingyizhou/deepcut-master | compute_rotation_classes.m | .m | deepcut-master/lib/pose/compute_rotation_classes.m | 4,547 | utf_8 | 5b12622ed83d02ed1ac467ab23c53be2 | function compute_rotation_classes(expidx, image_set)
fprintf('rcnn_compute_rotation_classes()\n');
p = exp_params(expidx);
pidxs = p.pidxs;
[~,parts] = util_get_parts24();
num_joints = length(pidxs);
spatidxs = {[22 17],[22 16],[22 23],[22 4],[22 5],[16 14],[17 19],[4 2],[5 7],[2 0],[7 9],[14 12],[19 21]};
% conv... |
github | xingyizhou/deepcut-master | get_spatial_features_diff_dx_dy.m | .m | deepcut-master/lib/pose/get_spatial_features_diff_dx_dy.m | 4,592 | utf_8 | 4123447d22fef99629103f2f683e149f | % ------------------------------------------------------------------------
function [X_pos, keys_pos, boxes_pos, X_neg, keys_neg, boxes_neg] = get_spatial_features_diff_dx_dy(imgidxs, p, gt_roidb, cidxs, bVis, annolist)
% -----------------------------------------------------------------------
scale = p.scale;
nFeatSam... |
github | xingyizhou/deepcut-master | get_spatial_features_diff_dx_dy_dense.m | .m | deepcut-master/lib/pose/get_spatial_features_diff_dx_dy_dense.m | 6,867 | utf_8 | 35bfc0cf26d5571d5d49eee9d92a01a6 | % ------------------------------------------------------------------------
function [X_pos, keys_pos, boxes_pos, X_neg, keys_neg, boxes_neg] = get_spatial_features_diff_dx_dy_dense(expidx,cidx)
% -----------------------------------------------------------------------
RandStream.setGlobalStream ...
(RandStream(... |
github | xingyizhou/deepcut-master | cnn_test_dense_unaries.m | .m | deepcut-master/lib/pose/cnn_test_dense_unaries.m | 11,148 | utf_8 | 0b029fec933f831ec03cf05dc45363ec | function cnn_test_dense_unaries( expidx, image_set, bVis, firstidx, nImgs, net_bin_file_param)
p = exp_params(expidx);
if (nargin < 4)
firstidx = 1;
elseif ischar(firstidx)
firstidx = str2num(firstidx);
end
if strcmp(image_set, 'test')
load(p.testGT)
else
load(p.trainGT)
end
num_images = size(annoli... |
github | xingyizhou/deepcut-master | get_spatial_features_neighbour.m | .m | deepcut-master/lib/pose/get_spatial_features_neighbour.m | 9,092 | utf_8 | 6d15c0b010028e31ed9f6f88c46c18f7 | function [X_pos, keys_pos, boxes_pos, X_neg, keys_neg, boxes_neg] = get_spatial_features_neighbour(expidx,cidx)
RandStream.setGlobalStream ...
(RandStream('mt19937ar','seed',42));
p = exp_params(expidx);
allpairs = isfield(p, 'allpairs') && p.allpairs;
if allpairs
load(p.pairwise_relations, 'graph');
... |
github | xingyizhou/deepcut-master | cnn_prepare_dense_training_data.m | .m | deepcut-master/lib/pose/cnn_prepare_dense_training_data.m | 4,255 | utf_8 | 005582247732cb038b153d3a58704def | function cnn_prepare_dense_training_data( expidx, start_idx, text )
if nargin < 2
start_idx = 0;
end
if nargin < 3
text = true;
end
p = exp_params(expidx);
pidxs = p.pidxs;
num_joints = length(pidxs);
if p.person_part
num_joints = num_joints+1;
end
parts = get_parts();
% load annolist
load(p.trainGT);
... |
github | xingyizhou/deepcut-master | get_augm_spatial_features_diff_neighbour_locref.m | .m | deepcut-master/lib/pose/multicut/get_augm_spatial_features_diff_neighbour_locref.m | 1,250 | utf_8 | 0c6289652148d58a16c9cb64eb4543d6 | function featAugm = get_augm_spatial_features_diff_neighbour_locref(feat)
% relative coord of 2 detections
delta = feat(:, 1:2);
a = compute_angle(delta(:,1), delta(:,2));
delta_forward = feat(:, 5:6);
a_forward = compute_angle(delta_forward(:,1), delta_forward(:,2));
delta1 = delta - delta_forward;
dist1 = sqrt(del... |
github | xingyizhou/deepcut-master | get_augm_spatial_features_diff_neighbour.m | .m | deepcut-master/lib/pose/multicut/get_augm_spatial_features_diff_neighbour.m | 1,575 | utf_8 | 8965be1171257cacb83e148b4a6bf061 | function featAugm = get_augm_spatial_features_diff_neighbour(feat, p)
if nargin < 2
one_direction = false;
no_angle = false;
else
one_direction = isfield(p, 'pairwise_one_direction') && p.pairwise_one_direction;
no_angle = isfield(p, 'pairwise_no_angle') && p.pairwise_no_angle;
end
% relative coord of... |
github | xingyizhou/deepcut-master | get_augm_spatial_features_same_regr.m | .m | deepcut-master/lib/pose/multicut/get_augm_spatial_features_same_regr.m | 524 | utf_8 | 7d7107724600a0ee89da688c3d3b2df0 | function featAugm = get_augm_spatial_features_same_regr(feat)
% relative coord of 2 detections
deltaX = feat(:, 1);
deltaY = feat(:, 2);
dist_sq = deltaX.^2 +deltaY.^2;
dist = sqrt(dist_sq);
featAugm = cat(2, dist, dist_sq);
end
function angle = compute_angle(deltaX, deltaY)
angle = atan2(deltaY,deltaX);
angle = wr... |
github | wgrissom/gSliderRF-master | t2hz.m | .m | gSliderRF-master/rf_tools/t2hz.m | 423 | utf_8 | c3a73b25e6c6525a20d9cb52348f4471 | %
% Takes dimensionless x used by abr, and scales it to kHz based
% on pulse duration t (ms), using a particularly mysterious algorithm.
%
% fs = t2hz(x,t)
%
% x -- normalized frequency x vector used by abr
% t -- pulse duration in ms
%
% fs -- scaled frequency axis, in kHz
%
% written by John Pauly... |
github | wgrissom/gSliderRF-master | fmp.m | .m | gSliderRF-master/rf_tools/fmp.m | 601 | utf_8 | 3e82f5090f78c3e10f1a4ede82b13ad7 | %
% Generate an equal ripple minimum phase filter starting with a linear
% phase filter.
%
% Called by dzmp.
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function hmp = fmp(h)
l = length(h);
if rem(l,2) == 0,
disp('filter length must be odd');
return;
end;
lp ... |
github | wgrissom/gSliderRF-master | dinf.m | .m | gSliderRF-master/rf_tools/dinf.m | 525 | utf_8 | 6697ad36b31225053c7097db69346939 | % dinf -- calculate D infinity for a linear phase filter
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function d = dinf(d1,d2)
a1 = 5.309e-3;
a2 = 7.114e-2;
a3 = -4.761e-1;
a4 = -2.66e-3;
a5 = -5.941e-1;
a6 = -4.278e-1;
l10d1 = log10(d1);
l10d2 = log10(d2);
[m1 n1] = s... |
github | wgrissom/gSliderRF-master | ab2inv.m | .m | gSliderRF-master/rf_tools/ab2inv.m | 326 | utf_8 | 30089bcc7a15245071286410c8259cc0 | % mz = ab2inv(a,b) -- or -- mz = ab2inv(ab)
%
% Computes the inversion profile 1-2*b.*conj(b)
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function mz = ab2inv(a,b);
if nargin == 1,
[m n] = size(a);
b = a(:,(n/2+1):n);
a = a(:,1:n/2);
end;
mz = 1-2*conj(b... |
github | wgrissom/gSliderRF-master | csg.m | .m | gSliderRF-master/rf_tools/csg.m | 1,163 | utf_8 | 67e370272ef2d52e61bc0e0830a2af08 | % function [nk] = csg(k,mxg,mxs)
%
% This routine takes a k-space trajectory and time warps it to
% meet gradient amplitude and slew rate constraints.
%
% Inputs:
% k -- k-space trajectory, scaled to cycles/cm
% mxg -- maximum gradient, G/cm
% mxs -- maximum slew rate, (G/cm)/ms
%
% Outputs:
% ... |
github | wgrissom/gSliderRF-master | verse.m | .m | gSliderRF-master/rf_tools/verse.m | 467 | utf_8 | c2236159d782535ee0e9b74b2692b5ee | % rfv = verse(gv,rf)
%
% Computes the versed version of rf for a given time-vayring gradient gv
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function rfv = verse(g,rf)
[m n] = size(g);
if m<n, g = g.'; end;
[m n] = size(rf);
if m<n,
rf = conj(rf');
[m n] = size(rf);
... |
github | wgrissom/gSliderRF-master | fftcp.m | .m | gSliderRF-master/rf_tools/fftcp.m | 371 | utf_8 | 2f8287fdabc60cb289e5152952772681 | %
% A centered FFT, padded with zeros to a specified length
%
% hf = fftcp(h,n)
%
% h -- input waveform
% n -- fft length
%
% hf -- centered, padded fft of h
%
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function hf = fftcp(h,n)
l = length(h);
hf = fftc([ze... |
github | wgrissom/gSliderRF-master | dzlp.m | .m | gSliderRF-master/rf_tools/dzlp.m | 471 | utf_8 | 6875742199bf5064218f1fdfc928b692 | % dzlp -- design a linear phase filter by calling remez with the
% proper arguments
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function h = dzlp(n,tb,d1,d2)
di = dinf(d1,d2);
w = di/tb;
f = [0 (1-w)*(tb/2) (1+w)*(tb/2) (n/2)]/(n/2);
m = [1 1 0 0];
w = [1 d1/d2]... |
github | wgrissom/gSliderRF-master | csg2.m | .m | gSliderRF-master/rf_tools/csg2.m | 1,107 | utf_8 | 1a897c7cbb0b798717f5ada408e158d4 | % function [nk] = csg(k,mxg,mxs)
%
% This routine takes a k-space trajectory and time warps it to
% meet gradient amplitude and slew rate constraints.
%
% Inputs:
% k -- k-space trajectory, scaled to cycles/cm
% mxg -- maximum gradient, G/cm
% mxs -- maximum slew rate, (G/cm)/ms
%
% Outputs:
% ... |
github | wgrissom/gSliderRF-master | abr.m | .m | gSliderRF-master/rf_tools/abr.m | 864 | utf_8 | 80ebe0cc67f158bbd07a42db27cd00e8 | % abr - compute the Cayley-Klein parameters for the rotation produced
% by an RF pulse. Uses Le Roux's convention on beta
%
% [a b] = abr(rf,<g,> x);
% a, b = Cayley-Klein paramters
% rf = n point rf waveform
% g = optional gradient waveform
% x = vectors of spatial positions to compute a and b.
%
% ... |
github | wgrissom/gSliderRF-master | ab2st.m | .m | gSliderRF-master/rf_tools/ab2st.m | 317 | utf_8 | 616d6ad2d30f915a082a47e0318910a1 | % mxy = ab2se(a,b) -- or -- mxy = ab2se(ab)
%
% Computes the "straight through" term a.*a
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function mxy = ab2st(a,b);
if nargin == 2,
mxy = i*a.*a;
elseif nargin == 1,
mxy = i*a(:,1).*a(:,1);
else
ab2xx
end
|
github | wgrissom/gSliderRF-master | dzmp.m | .m | gSliderRF-master/rf_tools/dzmp.m | 563 | utf_8 | 6f1bcb453f9fdeded004b04a6088bc53 | % dzmp -- design a minimum phase filter by first designing a linear phase
% filter and factoring it into two terms
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function h = dzmp(n,tb,d1,d2)
n2 = 2*n-1;
di = 0.5*dinf(2*d1,0.5*d2.*d2);
w = di/tb;
f = [0 (1-w)*(tb/2... |
github | wgrissom/gSliderRF-master | ab2sat.m | .m | gSliderRF-master/rf_tools/ab2sat.m | 327 | utf_8 | 07fdc8679545a30daf96f1e1c71d4f26 | % mz = ab2sat(a,b) -- or -- mz = ab2sat(ab)
%
% Computes the saturation profile 1-2*b.*conj(b)
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function mz = ab2sat(a,b);
if nargin == 1,
[m n] = size(a);
b = a(:,(n/2+1):n);
a = a(:,1:n/2);
end;
mz = 1-2*conj(b... |
github | wgrissom/gSliderRF-master | mag2mp.m | .m | gSliderRF-master/rf_tools/mag2mp.m | 1,167 | utf_8 | 08dbda7ffd611b17c2a19b8eae6f6356 | % mag2mp - take the magnitude of the fft of a signal, and return the
% fft of the analytic signal.
%
% as = mag2mp(ms)
% as - fft of analytic signal
% ms - magnitude of analytic signal fft.
%
% If you have a waveform B that you want to the minimum phase
% version of, then
% 1) pad B out by adding zeros up to a... |
github | wgrissom/gSliderRF-master | dimp.m | .m | gSliderRF-master/rf_tools/dimp.m | 208 | utf_8 | 16451c4583b2a18e963c9eccbdb10625 | % dimp -- calculate D infinity for a minimum phase filter
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function d=dimp(d1,d2)
d = 0.5*dinf(2*d1,0.5*d2.*d2);
|
github | wgrissom/gSliderRF-master | gt2cm.m | .m | gSliderRF-master/rf_tools/gt2cm.m | 460 | utf_8 | f5cf423c2adf0362687fdc592ddfaf95 | %
% Takes dimensionless x used by abr, and scales it to cm based
% on a gradient strength g (G/cm) and pulse duration t (ms)
%
% xs = gt2cm(x,g,t)
%
% x -- normalized frequency x vector used by abr
% g -- Gradient strength, G/cm
% t -- pulse duration in ms
%
% xs -- scaled spatial axis, in cm
%
... |
github | wgrissom/gSliderRF-master | msinc.m | .m | gSliderRF-master/rf_tools/msinc.m | 372 | utf_8 | 0432dea54c363f8bbd9ed32bff365d9c | % h = msinc(n,m)
%
% Returns a hamming windowed sinc of length n, with m sinc-cycles,
% which means a time-bandwidth of 4*m
%
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function ms = msinc(n,m)
x = [-n/2:(n-1)/2]/(n/2);
snc = sin(m*2*pi*x+0.00001)./(m*2*pi*x+0.00001)... |
github | wgrissom/gSliderRF-master | fftc.m | .m | gSliderRF-master/rf_tools/fftc.m | 216 | utf_8 | 4c1f1b8abff335837a89a244046bfe3f | %
% fft wrt the center of the array, instead of the first sample
%
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function y=fftc(x)
y = fftshift(fft(fftshift(x)));
|
github | wgrissom/gSliderRF-master | cplot.m | .m | gSliderRF-master/rf_tools/cplot.m | 216 | utf_8 | 95e77449a34a7d7c1ad863e7d8a25fb1 | %
% cplot(x) - plot complex function;
%
% written by John Pauly, 1989
% (c) Board of Trustees, Leland Stanford Junior University
function cplot(x)
l = length(x);
t = [1:l]/(l+1);
plot(t,real(x),t,imag(x));
|
github | wgrissom/gSliderRF-master | dz2d.m | .m | gSliderRF-master/rf_tools/dz2d.m | 1,352 | utf_8 | d4f1dce53003e0b901a393b96bf6c7d1 | % function [rf, g] = dz2d(nt,bw,tbp,ns,mxg,mxs)
%
% Designs a 2D rf pulse with a inward spiral gradient
%
% Inputs:
% nt -- number of turns in spiral
% bw -- spatial bandwidth, cycles/cm
% tbp -- "time-bandwdith" product for rf,
% ns -- number of samples
% mxg -- maximum gradient G/cm
% mxs -- max... |
github | wgrissom/gSliderRF-master | ab2se.m | .m | gSliderRF-master/rf_tools/ab2se.m | 306 | utf_8 | 224675c4638cca53d25868e619b593e9 | % mxy = ab2se(a,b) -- or -- mxy = ab2se(ab)
%
% Computes the spin-echo profile i*b.*b
% written by John Pauly, 1992
% (c) Board of Trustees, Leland Stanford Junior University
function mxy = ab2se(a,b);
if nargin == 1,
[m n] = size(a);
b = a(:,(n/2+1):n);
a = a(:,1:n/2);
end
mxy = i*b.*b; |
github | jessee-kung/MSNGE-master | MSNGE.m | .m | MSNGE-master/MSNGE.m | 5,113 | utf_8 | af22945cc414f03f6c21352194f652ef | function [ W, H, norm_list ] = MSNGE(X, W_init, H_init, S, q, use_l1, lambda, itr_max)
% Multi Subspace Non-negative Graph-Embedding
%
% Author:
% Jessee Hsin-Wen Kung
%
% Revision:
% 1.0 - 20, Feb, 2013 - Original version
% 1.1 - 19, Jul, 2013 - Refactor to MSNGE
%
% Multimedia Processing... |
github | gragonraja/pFTA-master | mtimesx_test_ssspeed.m | .m | pFTA-master/mtimesx/mtimesx_test_ssspeed.m | 415,311 | utf_8 | c663b5bc66edbfec752f88862a1805d1 | % Test routine for mtimesx, op(single) * op(single) speed vs MATLAB
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_test_ssspeed
% Filename: mtimesx_test_ssspeed.m
% Programmer: James Tursa
% ... |
github | gragonraja/pFTA-master | mtimesx_build.m | .m | pFTA-master/mtimesx/mtimesx_build.m | 16,492 | utf_8 | efe61ef053de4980e66a2b736c6b7b17 | % mtimesx_build compiles mtimesx.c with BLAS libraries
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_build
% Filename: mtimesx_build.m
% Programmer: James Tursa
% Version: 1.40
% Dat... |
github | gragonraja/pFTA-master | mtimesx_test_nd.m | .m | pFTA-master/mtimesx/mtimesx_test_nd.m | 14,364 | utf_8 | 0d3b436cea001bccb9c6cccdaa21b34d | % Test routine for mtimesx, multi-dimensional speed and equality to MATLAB
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_test_nd
% Filename: mtimesx_test_nd.m
% Programmer: James Tursa
% ... |
github | gragonraja/pFTA-master | mtimesx_test_sdequal.m | .m | pFTA-master/mtimesx/mtimesx_test_sdequal.m | 350,821 | utf_8 | 7e6a367b3ad6154ce1e4da70a91ba4cf | % Test routine for mtimesx, op(single) * op(double) equality vs MATLAB
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_test_sdequal
% Filename: mtimesx_test_sdequal.m
% Programmer: James Tursa... |
github | gragonraja/pFTA-master | mtimesx_test_ddequal.m | .m | pFTA-master/mtimesx/mtimesx_test_ddequal.m | 94,229 | utf_8 | 219fa3623cf14a54da7d267a29e61151 | % Test routine for mtimesx, op(double) * op(double) equality vs MATLAB
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_test_ddequal
% Filename: mtimesx_test_ddequal.m
% Programmer: James Tur... |
github | gragonraja/pFTA-master | mtimesx_test_dsequal.m | .m | pFTA-master/mtimesx/mtimesx_test_dsequal.m | 350,693 | utf_8 | 325490ae690791eb9f0e7d03408cc540 | % Test routine for mtimesx, op(double) * op(single) equality vs MATLAB
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_test_dsequal
% Filename: mtimesx_test_dsequal.m
% Programmer: James Tursa... |
github | gragonraja/pFTA-master | mtimesx_test_sdspeed.m | .m | pFTA-master/mtimesx/mtimesx_test_sdspeed.m | 388,309 | utf_8 | 1ed55a613d5cbfe9a11579562f600c9a | % Test routine for mtimesx, op(single) * op(double) speed vs MATLAB
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_test_sdspeed
% Filename: mtimesx_test_sdspeed.m
% Programmer: James Tursa
% ... |
github | gragonraja/pFTA-master | mtimesx_test_ddspeed.m | .m | pFTA-master/mtimesx/mtimesx_test_ddspeed.m | 121,611 | utf_8 | 32613fb321b2de56bd52cb4b4567187d | % Test routine for mtimesx, op(double) * op(double) speed vs MATLAB
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_test_ddspeed
% Filename: mtimesx_test_ddspeed.m
% Programmer: James Tursa
... |
github | gragonraja/pFTA-master | mtimesx_sparse.m | .m | pFTA-master/mtimesx/mtimesx_sparse.m | 3,015 | utf_8 | eeb3eb2df4d70c69695b45188807e91c | % mtimesx_sparse does sparse matrix multiply of two inputs
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_sparse
% Filename: mtimesx_sparse.m
% Programmer: James Tursa
% Version: 1.00
... |
github | gragonraja/pFTA-master | mtimesx_test_dsspeed.m | .m | pFTA-master/mtimesx/mtimesx_test_dsspeed.m | 388,140 | utf_8 | 53e3e8d0e86784747c58c68664ae0d85 | % Test routine for mtimesx, op(double) * op(single) speed vs MATLAB
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_test_dsspeed
% Filename: mtimesx_test_dsspeed.m
% Programmer: James Tursa
% ... |
github | gragonraja/pFTA-master | mtimesx_test_ssequal.m | .m | pFTA-master/mtimesx/mtimesx_test_ssequal.m | 355,156 | utf_8 | 4c01cb508f7cf6adb1b848f98ee9ca41 | % Test routine for mtimesx, op(single) * op(single) equality vs MATLAB
%******************************************************************************
%
% MATLAB (R) is a trademark of The Mathworks (R) Corporation
%
% Function: mtimesx_test_ssequal
% Filename: mtimesx_test_ssequal.m
% Programmer: James Tursa... |
github | gragonraja/pFTA-master | ComputeLeadingProbMatrix.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/ComputeLeadingProbMatrix.m | 1,621 | utf_8 | 2dbd7e525ca769ed877a909839c3d9ac | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | computeAccuraySingle.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/computeAccuraySingle.m | 1,266 | utf_8 | e4fb3629a33d6516b0f30ac5e45d2061 | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | SubSampling.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/SubSampling.m | 1,183 | utf_8 | 3f36ca1c5656b22a563252f18ba8d539 | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | fusionRand.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/fusionRand.m | 2,205 | utf_8 | 8e3386b28f9b907c8133ae9ad8633d02 | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | lateFusionBatch.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/lateFusionBatch.m | 2,273 | utf_8 | b0c0b83ac9e45dcadf7ac8ddc3bcf8ae | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | knnClassifier.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/knnClassifier.m | 903 | utf_8 | cbc89230237f34cac8e0d68e7d286c5c | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | LearnScriptNoBoosting.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/LearnScriptNoBoosting.m | 3,334 | utf_8 | 3f1a636dae018d4df288c239d4729409 | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | earlyFusionBatch.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/earlyFusionBatch.m | 4,966 | utf_8 | ba107253bed018eb8076d511e1f9d38f | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | getCrossValidationKNN.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/getCrossValidationKNN.m | 2,591 | utf_8 | 9640a02bf126b2a109e917196054ebfe | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | computeLeaveOneOut.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/computeLeaveOneOut.m | 995 | utf_8 | f99072f9a0abc0964878f02bcf4b9056 | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | select_train_cell.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/select_train_cell.m | 1,148 | utf_8 | 91245045defd70ee0df42d93e02f2c04 | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | GaussianRandomGenerator.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/GaussianRandomGenerator.m | 974 | utf_8 | 9bf9c98914120f718c4220de4e60fe89 | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | ComputeFTAHashCodes.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/ComputeFTAHashCodes.m | 1,149 | utf_8 | 2be1e41dab98d83446402fe2f67e5fb2 | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | CrossEntropyLoss.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/CrossEntropyLoss.m | 8,229 | utf_8 | 1355e10e54a00d6627d2253c2b18fb86 | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | computeAccuray.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/computeAccuray.m | 1,360 | utf_8 | 6db3457051e0bdb0c7594d59525a30aa | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | FTAHash.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/FTAHash.m | 1,282 | utf_8 | 244e6e04725541c59246feab618c83bf | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | gragonraja/pFTA-master | ComputeHashBitMatrixProb.m | .m | pFTA-master/HAPT - probability_earlyFuse_github/ComputeHashBitMatrixProb.m | 993 | utf_8 | 08b9a59817af85bf344326c410a2b8ef | % Copyright (c) Jun Ye. 2016. This program is free software: you can
% redistribute it and/or modify it under the terms of the
% GNU General Public License as published by the Free Software Foundation,
% either version 3 of the License, or (at your option) any later version.
% This program is distributed in the hop... |
github | plusk01/grid-localization-master | motion_model_odometry.m | .m | grid-localization-master/motion_model_odometry.m | 5,015 | utf_8 | 4c0461f5de7dbf54d026c7645a668cb8 | function p = motion_model_odometry( xt, ut, xt_d1, params )
%MOTION_MODEL Motion Model using Odometry for p(xt | ut, xt_d1)
% Probabilistic Robotics, Thrun et al., p 134
% inputs:
% xt = (x_prime y_prime theta_prime): hypothesized successor pose
% ut = (xbart_d1 xbart): motion information based on odome... |
github | plusk01/grid-localization-master | grid_localization.m | .m | grid-localization-master/grid_localization.m | 4,288 | utf_8 | 4d41a5a0aab2200c5d970e7d2c3f3925 | function [ pkt ] = grid_localization( pkt_d1, ut, zt, m, motion_params, measurement_params )
%GRID_LOCALIZATION A localizer using the discrete Bayes filter
% Using stochastic motion and measurement models, localize the Thrunbot
% based on a discrete Bayes filter. Here we use the Odometry Motion Model
% (p. 134) a... |
github | plusk01/grid-localization-master | drawRobot.m | .m | grid-localization-master/drawRobot.m | 1,599 | utf_8 | 730213531a5237692727d58323c4e26f | function handle = drawRobot( xt, handle)
%DRAWROBOT Draws a simple Thrunbot
% inputs:
% xt: input state vector (x, y, theta (deg))
% outputs:
% handle: the figure handle for the robot
if nargin == 1 || isempty(handle)
handle_circle = [];
handle_line = [];
else
% Unpack t... |
github | plusk01/grid-localization-master | beam_range_finder_model.m | .m | grid-localization-master/beam_range_finder_model.m | 3,546 | utf_8 | 2092aed160fa469e1a5c8731267ae2ec | function q = beam_range_finder_model( zt, xt, m, Theta )
%BEAM_RANGE_FINDER_MODEL Measurement model for the range finder on Thrunbot
% Probabilistic Robotics, Thrun et al., p 158, Table 6.1
% Returns the probability of getting the noisy measurement zt given that
% Thrunbot is currently at the hypothesized success... |
github | plusk01/grid-localization-master | showProbabilities.m | .m | grid-localization-master/showProbabilities.m | 2,874 | utf_8 | e95fd7d63b8bde4863a79aecd1cb77e2 | function showProbabilities( fig, probs, xt)
%SHOWPROBABILITIES Show the grid of probabilities, i.e., the 2D PDF
% Detailed explanation goes here
if (nargin < 3)
xt = [];
end
figure(fig), clf;
% If probs is has a depth, we have to plot each layer
K = size(probs,3);
for i = 1:... |
github | galdl/outage_scheduling-master | savecase.m | .m | outage_scheduling-master/libs/matpower5.1/savecase.m | 17,217 | utf_8 | 812e156845208a7e9dd4c78ab3606fd2 | function fname_out = savecase(fname, varargin)
%SAVECASE Saves a MATPOWER case file, given a filename and the data.
% SAVECASE(FNAME, CASESTRUCT)
% SAVECASE(FNAME, CASESTRUCT, VERSION)
% SAVECASE(FNAME, BASEMVA, BUS, GEN, BRANCH)
% SAVECASE(FNAME, BASEMVA, BUS, GEN, BRANCH, GENCOST)
% SAVECASE(FNAME, BASEMVA... |
github | galdl/outage_scheduling-master | ktropf_solver.m | .m | outage_scheduling-master/libs/matpower5.1/ktropf_solver.m | 11,710 | utf_8 | 5cd97b9ba5b0916c199be22be6a70a8f | function [results, success, raw] = ktropf_solver(om, mpopt)
%KTROPF_SOLVER Solves AC optimal power flow using KNITRO.
%
% [RESULTS, SUCCESS, RAW] = KTROPF_SOLVER(OM, MPOPT)
%
% Inputs are an OPF model object and a MATPOWER options struct.
%
% Outputs are a RESULTS struct, SUCCESS flag and RAW output struct.
%
% ... |
github | galdl/outage_scheduling-master | qps_mips.m | .m | outage_scheduling-master/libs/matpower5.1/qps_mips.m | 7,794 | utf_8 | 6a4b3806a55e325054491e79de80ce18 | function [x, f, eflag, output, lambda] = qps_mips(H, c, A, l, u, xmin, xmax, x0, opt)
%QPS_MIPS Quadratic Program Solver based on MIPS.
% [X, F, EXITFLAG, OUTPUT, LAMBDA] = ...
% QPS_MIPS(H, C, A, L, U, XMIN, XMAX, X0, OPT)
% Uses the MATLAB Interior Point Solver (MIPS) to solve the following
% QP (quadrat... |
github | galdl/outage_scheduling-master | toggle_softlims.m | .m | outage_scheduling-master/libs/matpower5.1/toggle_softlims.m | 14,518 | utf_8 | e2b1ce863bc938a0b7d3c103e56ef5a8 | function mpc = toggle_softlims(mpc, on_off)
%TOGGLE_SOFTLIMS Relax DC optimal power flow branch limits.
% MPC = TOGGLE_SOFTLIMS(MPC, 'on')
% MPC = TOGGLE_SOFTLIMS(MPC, 'off')
% T_F = TOGGLE_SOFTLIMS(MPC, 'status')
%
% Enables, disables or checks the status of a set of OPF userfcn
% callbacks to implement rela... |
github | galdl/outage_scheduling-master | modcost.m | .m | outage_scheduling-master/libs/matpower5.1/modcost.m | 4,148 | utf_8 | 7ad37d349aef8613d44ca72096179496 | function gencost = modcost(gencost, alpha, modtype)
%MODCOST Modifies generator costs by shifting or scaling (F or X).
% NEWGENCOST = MODCOST(GENCOST, ALPHA)
% NEWGENCOST = MODCOST(GENCOST, ALPHA, MODTYPE)
%
% For each generator cost F(X) (for real or reactive power) in
% GENCOST, this function modifies the co... |
github | galdl/outage_scheduling-master | toggle_dcline.m | .m | outage_scheduling-master/libs/matpower5.1/toggle_dcline.m | 22,346 | utf_8 | 07141529d23fa749d4f747b02e1a192b | function mpc = toggle_dcline(mpc, on_off)
%TOGGLE_DCLINE Enable, disable or check status of DC line modeling.
% MPC = TOGGLE_DCLINE(MPC, 'on')
% MPC = TOGGLE_DCLINE(MPC, 'off')
% T_F = TOGGLE_DCLINE(MPC, 'status')
%
% Enables, disables or checks the status of a set of OPF userfcn
% callbacks to implement DC l... |
github | galdl/outage_scheduling-master | case_info.m | .m | outage_scheduling-master/libs/matpower5.1/case_info.m | 24,435 | utf_8 | 1b96ce45c0e9b4632739ae2c55a09c11 | function [groupss, isolated] = case_info(mpc, fd)
%CASE_INFO Prints information about islands in a network.
% CASE_INFO(MPC)
% CASE_INFO(MPC, FD)
% [GROUPS, ISOLATED] = CASE_INFO(...)
%
% Prints out detailed information about a MATPOWER case. Optionally prints
% to an open file, whose file identifier, as retu... |
github | galdl/outage_scheduling-master | psse_parse_section.m | .m | outage_scheduling-master/libs/matpower5.1/psse_parse_section.m | 11,337 | utf_8 | e43aa967e63c1ab4d667fed4cd63e0cc | function [data, warns] = psse_parse_section(warns, records, sections, s, verbose, label, template)
%PSSE_PARSE_SECTION Parses the data from a section of a PSS/E RAW data file
% [DATA, WARNINGS] = PSSE_PARSE_SECTION(WARNINGS, RECORDS, SECTIONS, SIDX, ...
% VERBOSE, LABEL, TEM... |
github | galdl/outage_scheduling-master | ipoptopf_solver.m | .m | outage_scheduling-master/libs/matpower5.1/ipoptopf_solver.m | 11,041 | utf_8 | 591f13b41b7cc6d1cc333c404ad42ffd | function [results, success, raw] = ipoptopf_solver(om, mpopt)
%IPOPTOPF_SOLVER Solves AC optimal power flow using MIPS.
%
% [RESULTS, SUCCESS, RAW] = IPOPTOPF_SOLVER(OM, MPOPT)
%
% Inputs are an OPF model object and a MATPOWER options struct.
%
% Outputs are a RESULTS struct, SUCCESS flag and RAW output struct.
... |
github | galdl/outage_scheduling-master | toggle_iflims.m | .m | outage_scheduling-master/libs/matpower5.1/toggle_iflims.m | 12,177 | utf_8 | 7b13a1c7d3c6abfff1066996a963f90f | function mpc = toggle_iflims(mpc, on_off)
%TOGGLE_IFLIMS Enable, disable or check status of set of interface flow limits.
% MPC = TOGGLE_IFLIMS(MPC, 'on')
% MPC = TOGGLE_IFLIMS(MPC, 'off')
% T_F = TOGGLE_IFLIMS(MPC, 'status')
%
% Enables, disables or checks the status of a set of OPF userfcn
% callbacks to im... |
github | galdl/outage_scheduling-master | loadcase.m | .m | outage_scheduling-master/libs/matpower5.1/loadcase.m | 9,744 | utf_8 | 3b9f2a0546e217b2be54a408712e93bc | function [baseMVA, bus, gen, branch, areas, gencost, info] = loadcase(casefile)
%LOADCASE Load .m or .mat case files or data struct in MATPOWER format.
%
% [BASEMVA, BUS, GEN, BRANCH, AREAS, GENCOST] = LOADCASE(CASEFILE)
% [BASEMVA, BUS, GEN, BRANCH, GENCOST] = LOADCASE(CASEFILE)
% [BASEMVA, BUS, GEN, BRANCH] =... |
github | galdl/outage_scheduling-master | have_fcn.m | .m | outage_scheduling-master/libs/matpower5.1/have_fcn.m | 23,477 | utf_8 | b233d7dc93c96513131e66f4ee959fbc | function rv = have_fcn(tag, rtype)
%HAVE_FCN Test for optional functionality / version info.
% TORF = HAVE_FCN(TAG)
% TORF = HAVE_FCN(TAG, TOGGLE)
% VER_STR = HAVE_FCN(TAG, 'vstr')
% VER_NUM = HAVE_FCN(TAG, 'vnum')
% DATE = HAVE_FCN(TAG, 'date')
% INFO = HAVE_FCN(TAG, 'all')
%
% Returns availabilit... |
github | galdl/outage_scheduling-master | psse_convert_hvdc.m | .m | outage_scheduling-master/libs/matpower5.1/psse_convert_hvdc.m | 4,820 | utf_8 | 1705c7ca3b3688c2f934d42fb6d4a723 | function dcline = psse_convert_hvdc(dc, bus)
%PSSE_CONVERT_HVDC Convert HVDC data from PSS/E RAW to MATPOWER
% DCLINE = PSSE_CONVERT_HVDC(DC, BUS)
%
% Convert all two terminal HVDC line data read from a PSS/E
% RAW data file into MATPOWER format. Returns a dcline matrix for
% inclusion in a MATPOWER case struct... |
github | galdl/outage_scheduling-master | mpoption.m | .m | outage_scheduling-master/libs/matpower5.1/mpoption.m | 65,137 | utf_8 | da412795e04899d174df7909834e891c | function opt = mpoption(varargin)
%MPOPTION Used to set and retrieve a MATPOWER options struct.
%
% OPT = MPOPTION
% Returns the default options struct.
%
% OPT = MPOPTION(OVERRIDES)
% Returns the default options struct, with some fields overridden
% by values from OVERRIDES, which can be a struc... |
github | galdl/outage_scheduling-master | psse_parse.m | .m | outage_scheduling-master/libs/matpower5.1/psse_parse.m | 18,422 | utf_8 | cb7d4b7d4e5ea3ed6d657f61587ffcda | function [data, warns] = psse_parse(records, sections, verbose, rev)
%PSSE_PARSE Parses the data from a PSS/E RAW data file.
% DATA = PSSE_PARSE(RECORDS, SECTIONS)
% DATA = PSSE_PARSE(RECORDS, SECTIONS, VERBOSE)
% DATA = PSSE_PARSE(RECORDS, SECTIONS, VERBOSE, REV)
% [DATA, WARNINGS] = PSSE_PARSE(RECORDS, SECTI... |
github | galdl/outage_scheduling-master | toggle_reserves.m | .m | outage_scheduling-master/libs/matpower5.1/toggle_reserves.m | 19,753 | utf_8 | f70967f186adad0a04785743c368014f | function mpc = toggle_reserves(mpc, on_off)
%TOGGLE_RESERVES Enable, disable or check status of fixed reserve requirements.
% MPC = TOGGLE_RESERVES(MPC, 'on')
% MPC = TOGGLE_RESERVES(MPC, 'off')
% T_F = TOGGLE_RESERVES(MPC, 'status')
%
% Enables, disables or checks the status of a set of OPF userfcn
% callbac... |
github | galdl/outage_scheduling-master | t_mips.m | .m | outage_scheduling-master/libs/matpower5.1/t/t_mips.m | 10,696 | utf_8 | e0ff3491a03096f6bfbfcbaffd303c3e | function t_mips(quiet)
%T_MIPS Tests of MIPS NLP solver.
% MIPS
% Copyright (c) 2010-2015 by Power System Engineering Research Center (PSERC)
% by Ray Zimmerman, PSERC Cornell
%
% $Id: t_mips.m 2644 2015-03-11 19:34:22Z ray $
%
% This file is part of MIPS.
% Covered by the 3-clause BSD License (see LICENS... |
github | galdl/outage_scheduling-master | t_mpoption.m | .m | outage_scheduling-master/libs/matpower5.1/t/t_mpoption.m | 13,991 | utf_8 | 22c1eeed5e603d8b8508d4758da0a10d | function t_mpoption(quiet)
%T_MPOPTION Tests for MPOPTION.
% MATPOWER
% Copyright (c) 2013-2015 by Power System Engineering Research Center (PSERC)
% by Ray Zimmerman, PSERC Cornell
%
% $Id: t_mpoption.m 2660 2015-03-20 02:10:18Z ray $
%
% This file is part of MATPOWER.
% Covered by the 3-clause BSD Licen... |
github | galdl/outage_scheduling-master | pricelimits.m | .m | outage_scheduling-master/libs/matpower5.1/extras/smartmarket/pricelimits.m | 1,718 | utf_8 | f3e844c39e3e7f4ff1a16fdea4b981a1 | function lim = pricelimits(lim, haveQ)
%PRICELIMITS Fills in a struct with default values for offer/bid limits.
% LIM = PRICELIMITS(LIM, HAVEQ)
% The final structure looks like:
% LIM.P.min_bid - bids below this are withheld
% .max_offer - offers above this are withheld
% ... |
github | galdl/outage_scheduling-master | auction.m | .m | outage_scheduling-master/libs/matpower5.1/extras/smartmarket/auction.m | 11,427 | utf_8 | 0bfb7190a782813b3f674db1de29db83 | function [co, cb] = auction(offers, bids, auction_type, limit_prc, gtee_prc)
%AUCTION Clear auction based on OPF results (qty's and lambdas).
% [CO, CB] = AUCTION(OFFERS, BIDS, AUCTION_TYPE, LIMIT_PRC, GTEE_PRC)
% Clears a set of BIDS and OFFERS based on the results of an OPF, where the
% pricing is adjusted for... |
github | galdl/outage_scheduling-master | off2case.m | .m | outage_scheduling-master/libs/matpower5.1/extras/smartmarket/off2case.m | 15,356 | utf_8 | 8e8ba3ae41dc045c963fcdf4881379e8 | function [gen, gencost] = off2case(gen, gencost, offers, bids, lim)
%OFF2CASE Updates case variables gen & gencost from quantity & price offers.
% [GEN, GENCOST] = OFF2CASE(GEN, GENCOST, OFFERS, BIDS, LIM) updates
% GEN & GENCOST variables based on the OFFERS and BIDS supplied, where each
% is a struct (or BIDS ... |
github | galdl/outage_scheduling-master | simulateMonth.m | .m | outage_scheduling-master/src/simulateMonth.m | 668 | utf_8 | 85dff9fd60ee7d4a51e3526e98b72211 | % runs from distant node. Therefore - generates params itself, and reads
% arguemnts from local file
function [monthlyStats]=simulateMonth(i_month,maintenancePlan,nn_db,params)
%% generate the initial state struct
state=getInitialState(params);
%% read maintenance plan and update the state according to it
state = updat... |
github | galdl/outage_scheduling-master | getFixedLineStatus.m | .m | outage_scheduling-master/src/getFixedLineStatus.m | 966 | utf_8 | ca02a47607a6c7f1a6d4d29aa790c08e | %only return line status - the actual state update will be done in the
%dynamic mode
function [lineStatus,fixed] = getFixedLineStatus(currHour,dynamicUC,params,state)
get_global_constants
% update current topology and update if lines were fixed - changes both
% in day-ahead and in real-time (RT), used for outage_sched... |
github | galdl/outage_scheduling-master | evaluatePlans.m | .m | outage_scheduling-master/src/evaluatePlans.m | 7,556 | utf_8 | bd136aeb66768a85c04ef73b2afdc112 | %% load according to file name and run tests on pre-found maintenance plans
function []=evaluatePlans(plansToEvaluate,strEvalType,caseName,savedFileName,dynamicSamplesPerDay)
load(savedFileName);
params.myopicUCForecast=0; %use full forecast for evaluation
fractionOfFinishedJobs=0.95;
params.dynamicSamplesPerDay=d... |
github | galdl/outage_scheduling-master | evaluate_UC_reliability_opf.m | .m | outage_scheduling-master/src/evaluate_UC_reliability_opf.m | 5,972 | utf_8 | 87e6fba9b1275700ad47bc87a95bf6bb | function [reliability,n1_matrix,connected] = evaluate_UC_reliability_opf(uc_sample,params)
%% initialize
run('get_global_constants.m')
mpopt = mpoption('out.all', 0,'verbose', 0,'pf.alg','NR'); %NR(def), FDXB, FDBX, GS
% mpopt = mpoption('out.all', 0,'verbose', 0,'model','DC','opf.dc.solver', 'CPLEX');
% mpopt = mpopti... |
github | galdl/outage_scheduling-master | generalOPF.m | .m | outage_scheduling-master/src/generalOPF.m | 6,351 | utf_8 | 0da1facca3d29159f0902062be1ea596 | %calls either a regular SCOPF or N-1 SCOPF
function [Pg,objective,onoff] = generalOPF(str,params)
%% Data
mpc=params.mpcase;
%% data dimensions
nb = size(mpc.bus, 1); %% number of buses
nl = size(mpc.branch, 1); %% number of branches
ng = size(mpc.gen, 1); %% number of dispatchable injections
%% Cho... |
github | galdl/outage_scheduling-master | genpath_exclude.m | .m | outage_scheduling-master/src/genpath_exclude.m | 2,866 | utf_8 | 9b604c8fa80762bf0ce84662e66c3de5 | % pathStr = genpath_exclude(basePath,ignoreDirs)
%
% Extension of Matlab's "genpath" function, except this will exclude
% directories (and their sub-tree) given by "ignoreDirs".
%
%
%
% Inputs:
% basePath: string. The base path for which to generate path string.
%
% excludeDirs: cell-array of strings.... |
github | galdl/outage_scheduling-master | phi_p.m | .m | outage_scheduling-master/src/phi_p.m | 330 | utf_8 | cda7f6876dfb15a230b4135170cbe8b2 | %can operate element-wise on vectors
function [f,g,H] = phi_p(t,p,lambda)
f=zeros(size(t));
g=f;
H=g;
%a loop is necessary since phi operates differently in 2 seperate regions
for i=1:length(t)
[f(i),g(i),H(i)]=phi(p*t(i));
f(i)=(f(i)/p)*lambda(i);
g(i)=g(i)*lambda(i);
H(i)=H(i)*p*lambda(i);
... |
github | galdl/outage_scheduling-master | evaluate_UC_reliability.m | .m | outage_scheduling-master/src/evaluate_UC_reliability.m | 5,038 | utf_8 | 4dbaa774ea01a5add2a98827968e3cde | function [reliability,n1_matrix,connected] = evaluate_UC_reliability(uc_sample,params)
%% initialize
run('get_global_constants.m')
mpopt = mpoption('out.all', 0,'verbose', 0,'pf.alg','NR'); %NR(def), FDXB, FDBX, GS
% mpopt = mpoption('out.all', 0,'verbose', 0,'model','DC','opf.dc.solver', 'CPLEX');
% mpopt = mpoption('... |
github | galdl/outage_scheduling-master | updateState.m | .m | outage_scheduling-master/src/updateState.m | 743 | utf_8 | 405c75afeb7837272d9f3203ec7a186d | %bring fixed lines back online, draw failures of new lines (contingencies)
%, and save it into 'state'
function [state,contingenciesHappened] = updateState(params,state)
get_global_constants
[lineStatus,fixed] = getFixedLineStatus(1,1,params,state);
%% draw contingencies in lines
lineAge=state.currTime-state.topo... |
github | galdl/outage_scheduling-master | generalSCUC.m | .m | outage_scheduling-master/src/generalSCUC.m | 18,074 | utf_8 | 32b29b7a035ac6c0bd319db6c9d50083 | %case5,case24_ieee_rts,case3012wp
%When nargin>2 , this function is used for the dynamic myopic UC (horizon=1),
%where we try to not deviate from the original onoff plan, and to have the
%least deviation from the original Pg due to redispatch costs
function [Pg,objective,onoff,y,demandVector,success,windSpilled,loa... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.