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 | johndpope/Codes-master | warp_stereo.m | .m | Codes-master/Other Projects/Computer Vision/3D scene reconstruction/warp_stereo.m | 4,128 | utf_8 | 5c9751977d23f86e1aa69aa6ddac6b4c | function [JL JR bbL bbR] = warp_stereo(IL, IR, TL, TR)
% find the smallest bb containining both images
bb = mcbb(size(IL),size(IR), TL, TR);
if bb(3)-bb(1)>3000 || bb(4)-bb(2)>3000,
error(['XX Error: Your rectification is not correct. ' ...
'Debug it before going further...']) ;
end
% Warp LEFT
[JL b... |
github | johndpope/Codes-master | displayEpipolarF.m | .m | Codes-master/Other Projects/Computer Vision/3D scene reconstruction/displayEpipolarF.m | 2,790 | utf_8 | 05ce5519d34ec52eff9d86921ef9622b | function displayEpipolarF(I1, I2, F)
%
% displayEpipolarF(I1, I2, F)
%
% Displays the epipolar lines interactively. I1 and I2
% are the two input images.
% F is the essential matrix transforming from I1 to I2.
% That is: if m1 is a point in I1 and m2 is a point in
% I2, then the epipolar line has equation:
% ... |
github | johndpope/Codes-master | kmpp_init.m | .m | Codes-master/Other Projects/Machine Learning/K_means clustering/kmpp_init.m | 737 | utf_8 | e47700d8fddb46bc2ecc644ffb3520dc | function [C] = kmpp_init(X, k)
n = size(X,1);
sq_distances = ones(n,1);
center_ixs = [];
for i = 1:k
% Choose a new center index using D^2 weighting
ix = discrete_sample(sq_distances);
% Update the squared distances for all points
deltas = bsxfun(@minus, X, X(ix, :));
sq_dist_to_ix = sum(del... |
github | johndpope/Codes-master | lloyd_iteration.m | .m | Codes-master/Other Projects/Machine Learning/K_means clustering/lloyd_iteration.m | 5,197 | utf_8 | e85cf96c4d24a9a6d2434f39554228ca | function [C, a] = lloyd_iteration(X, C)
% Implement your function here.
dist = pdist2_me(X,C);
[~,a]= min(dist') ;
a = a' ;
diff=1 ;
while diff > 10^-6
C = update_centers(X, C, a) ;
anew = update_assignments(X,C,a) ;
diff=(pdist2_me(anew',a'))^0.5 ;
a = anew ;
end
function D = p... |
github | johndpope/Codes-master | update_assignments.m | .m | Codes-master/Other Projects/Machine Learning/K_means clustering/update_assignments.m | 5,028 | utf_8 | c85d6a9bc879bfe6bacf5a9f525c21dc | function a = update_assignments(X, C, a)
% Implement your function here.
dist=pdist2_me(X,C) ;
[~,a]=min(dist') ;
a = a' ;
function D = pdist2_me( X, Y, metric )
% Calculates the distance between sets of vectors.
%
% Let X be an m-by-p matrix representing m points in p-dimensional space
% and Y be an n-by... |
github | johndpope/Codes-master | pdist2.m | .m | Codes-master/Other Projects/Machine Learning/K_means clustering/pdist2.m | 4,890 | utf_8 | ed273800e6fb2f0d34558c4dc4dfd80d | function D = pdist2_me( X, Y, metric )
% Calculates the distance between sets of vectors.
%
% Let X be an m-by-p matrix representing m points in p-dimensional space
% and Y be an n-by-p matrix representing another set of points in the same
% space. This function computes the m-by-n distance matrix D where D(i,j)
% is t... |
github | johndpope/Codes-master | kmeans_obj.m | .m | Codes-master/Other Projects/Machine Learning/K_means clustering/kmeans_obj.m | 5,052 | utf_8 | e81dec453b47a0fb8f489c199807194a | function obj = kmeans_obj(X, C, a)
% Implement your function here.
obj = 0 ;
for i=1:size(C,1)
obj=obj+sum((pdist2_me(X(a==i,:),C(i,:))));
end
function D = pdist2_me( X, Y, metric )
% Calculates the distance between sets of vectors.
%
% Let X be an m-by-p matrix representing m points in p-dimensional ... |
github | johndpope/Codes-master | hmm_train.m | .m | Codes-master/Other Projects/Machine Learning/Natural language processing_HMM/hmm_train.m | 1,339 | utf_8 | 66c2c5d852cf4e88d79eedc543127887 |
function [hmm_params] = hmm_train(state_seqs, obs_seqs, n, m, alpha_obs, alpha_trans)
assert (length(state_seqs) == length(obs_seqs));
% Initialization of the tables for the counts.
c_theta = zeros(n, n);
c_theta_start = zeros(1, n);
c_theta_stop = zeros(n, 1);
c_gamma = zeros(n, m);
%% ... |
github | johndpope/Codes-master | hmm_decode.m | .m | Codes-master/Other Projects/Machine Learning/Natural language processing_HMM/hmm_decode.m | 4,110 | utf_8 | 26a73415f60ff93a3535e85c1796a9f6 |
function [pred_state_seqs] = hmm_decode(hmm_params, obs_seqs)
% Working directly in log domain, as it is more numerically stable.
log_theta = log(hmm_params.theta);
log_theta_start = log(hmm_params.theta_start);
log_theta_stop = log(hmm_params.theta_stop);
log_gamma = log(hmm_params.gamma);
[n,... |
github | johndpope/Codes-master | accuracy.m | .m | Codes-master/Other Projects/Machine Learning/Natural language processing_HMM/accuracy.m | 388 | utf_8 | 65aee679eb3ae1ece334ab251ef3e5ac |
function [acc] = accuracy(pred_state_seqs, true_state_seqs)
ncorrect = 0;
ntotal = 0;
for k = 1:length(true_state_seqs)
pred_st_seq = pred_state_seqs{k};
true_st_seq = true_state_seqs{k};
Tk = length(pred_st_seq);
ncorrect = ncorrect + sum(pred_st_seq == true_st_seq);
... |
github | johndpope/Codes-master | map_to_readable.m | .m | Codes-master/Other Projects/Machine Learning/Natural language processing_HMM/map_to_readable.m | 225 | utf_8 | 86d145334708451467d62db776bbbab2 |
function [seqs_str] = map_to_readable(seqs, index_to_str)
N = length(seqs);
seqs_str = cell(1, N);
for k = 1:N
sq = seqs{k};
sq_str = index_to_str(sq);
seqs_str{k} = sq_str;
end
end
|
github | johndpope/Codes-master | baseline_train.m | .m | Codes-master/Other Projects/Machine Learning/Natural language processing_HMM/baseline_train.m | 459 | utf_8 | ba8f53501470128cde07489da373fef0 |
function [baseline_params] = baseline_train(state_seqs, obs_seqs, n, m)
assert (length(state_seqs) == length(obs_seqs));
c_gamma = zeros(n, m);
%% Your code goes here. Collecting the co-occurrence statistics.
for i=1:size(state_seqs,2)
a=state_seqs{1,i} ;
b=obs_seqs{1,i} ;
for j=1:size(a,2)
... |
github | johndpope/Codes-master | baseline_decode.m | .m | Codes-master/Other Projects/Machine Learning/Natural language processing_HMM/baseline_decode.m | 591 | utf_8 | ab7f0a7900dbaeb33094e74d02b3020f |
function [pred_state_seqs] = baseline_decode(baseline_params, obs_seqs)
gamma = baseline_params.gamma;
pred_state_seqs = cell(1, length(obs_seqs));
%% Remove from here
for k = 1:length(obs_seqs)
ob_seq = obs_seqs{k};
Tk = length(ob_seq);
% Independent prediction for each symbo... |
github | johndpope/Codes-master | adabst.m | .m | Codes-master/Other Projects/Machine Learning/Classification using Adaboost/adabst.m | 6,214 | utf_8 | 844f032e4e200f2b9e0061f3ed80678b | function [estimateclasstotal,model]=adabst(mode,datafeatures,dataclass_or_model,itt)
% This function AdaBoost, consist of two parts a simpel weak classifier and
% a boosting part:
% The weak classifier tries to find the best treshold in one of the data
% dimensions to sepparate the data into two classes -1 and 1
% The ... |
github | johndpope/Codes-master | adaboost.m | .m | Codes-master/Other Projects/Machine Learning/Classification using Adaboost/adaboost_version1e/adaboost.m | 6,215 | utf_8 | f9706fab834bc469ca1c3b1639ee5537 | function [estimateclasstotal,model]=adaboost(mode,datafeatures,dataclass_or_model,itt)
% This function AdaBoost, consist of two parts a simpel weak classifier and
% a boosting part:
% The weak classifier tries to find the best treshold in one of the data
% dimensions to sepparate the data into two classes -1 and 1
% Th... |
github | lukejs12/traj-opt-ctrl-master | tvLqrDirCol.m | .m | traj-opt-ctrl-master/trajOptCtrlLib/tvLqrDirCol.m | 5,455 | utf_8 | 5da2ead43ca2bbb7f7950948093db6b2 | function [lqrParam, u_cl_fun, tIdxFun] = tvLqrDirCol(sys, lqrParam, tspan, x0, u0)
% sys, sys.x_dot_sym, sys.x_dot_fun, sys.stateVars=[q1, q2, ... q1_dot, q2_dot, ...], sys.nStates
% lqr.Qf, lqr.Q, lqr.S, lqr.nSteps
t0 = tspan(1);
tf = tspan(2);
tIdxFun = @(t) -1+2*(t-t0)/(tf-t0);
% In... |
github | lukejs12/traj-opt-ctrl-master | tvLqr_backup_020616.m | .m | traj-opt-ctrl-master/trajOptCtrlLib/tvLqr_backup_020616.m | 4,634 | utf_8 | 5f8ac3b26dd8f91abc743f4cb68342c5 | function [lqr, u_cl_fun, x0_p, u0_p, tIdxFun] = tvLqr(sys, lqr, tspan, x0, u0)
% sys, sys.x_dot_sym, sys.x_dot_fun, sys.stateVars=[q1, q2, ... q1_dot, q2_dot, ...], sys.nStates
% lqr.Qf, lqr.Q, lqr.S, lqr.nSteps
t0 = tspan(1);
tf = tspan(2);
% Create Chebyshev polynomial representation of traje... |
github | lukejs12/traj-opt-ctrl-master | deriveEom.m | .m | traj-opt-ctrl-master/trajOptCtrlLib/deriveEom.m | 6,285 | utf_8 | f69104f10b28b2c17d7b54ee506b21af | % deriveEom Derives equations of motion from Lagrangian and writes function file to disk.
% [x_dot_sym, eomFile, stateVars] = deriveEom(sysName, coordVars, L, D, Q, saveSys)
%
% sysName String containing name of system (used to construct filename)
% coordVars Cell array identifying the coordinate varia... |
github | lukejs12/traj-opt-ctrl-master | evalLagrangian.m | .m | traj-opt-ctrl-master/trajOptCtrlLib/evalLagrangian.m | 2,578 | utf_8 | 5d24aed5f99c1de5ace4031ad170f038 | % Derives the equations of motion of the Lagragian in symfun L. Matlab
% symbolic toolkit won't differentiate wrt to an arbitrary symfun (i.e. wrt
% the time derivative of the coordinate variables), so we have to use
% subs() to substitute in dummy variable for differentiation, then swap
% back in the original varia... |
github | lukejs12/traj-opt-ctrl-master | evalLagrangianDissipation.m | .m | traj-opt-ctrl-master/trajOptCtrlLib/evalLagrangianDissipation.m | 2,567 | utf_8 | 8d650dccb301c0b7e3c171da84b063b1 | % REWRITE
% Derives the equations of motion Lagragian in symfun L. Matlab
% symbolic toolkit won't differentiate wrt to an arbitrary symfun (i.e. wrt
% the time derivative of the coordinate variables), so we have to use
% subs() to substitute in dummy variable for differentiation, then swap
% back in the original v... |
github | lukejs12/traj-opt-ctrl-master | tvLqr.m | .m | traj-opt-ctrl-master/trajOptCtrlLib/tvLqr.m | 4,236 | utf_8 | 7d4da595f7dd6b90da9a9dd5834ca601 | function [lqr, u_cl_fun, tIdxFun] = tvLqr(sys, lqr, tspan, x0, u0)
% sys, sys.x_dot_sym, sys.x_dot_fun, sys.stateVars=[q1, q2, ... q1_dot, q2_dot, ...], sys.nStates
% lqr.Qf, lqr.Q, lqr.S, lqr.nSteps
t0 = tspan(1);
tf = tspan(2);
% Create Chebyshev polynomial representation of trajectories
... |
github | lukejs12/traj-opt-ctrl-master | trajOpt.m | .m | traj-opt-ctrl-master/trajOptCtrlLib/trajOpt.m | 12,731 | utf_8 | 54232ceeb06623ff5adc9b32a11f0f32 | function [traj, u, T, param, exitflag, output, timeStop] = trajOpt(sys, method, gradType, cost, nPoints, x0, xf, guess, xLims, uMax, tLims)
close all; clear functions;
clear costfun; % Doesn't seem to be happening.
% System mechanics properties
param.physProp = orderfields(sys.param);
% Same bu... |
github | lukejs12/traj-opt-ctrl-master | incEnc_old.m | .m | traj-opt-ctrl-master/projects/Double pendulum cart/incEnc_old.m | 1,489 | utf_8 | 0055ccecd15f29239600a11a531c88c8 | % encProperties - vector of encoder resolutions (post quad, so true
% resolution encoder will see. Zero to bypass
function xOut = incEnc_old(t, x, freqInit, encRes, recordTraj)
persistent freq; % Controller frequency
persistent tLast;
persistent encLast;
persistent encLines;
persistent nState... |
github | mayuresh159/starsense_algorithms-master | bsearch.m | .m | starsense_algorithms-master/bsearch.m | 3,353 | utf_8 | 3ecc7f85b72c0f071b837bfd3e786e2b | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright (c) 2005, Aroh Barjatya
% % All rights reserved.
% %
% % Redistribution and use in source and binary forms, with or without
% % modif... |
github | mayuresh159/starsense_algorithms-master | gvalgo.m | .m | starsense_algorithms-master/gvalgo.m | 2,870 | utf_8 | 9732a4bc709cf92aee925d1bc5005568 | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright 2016 Mayuresh Sarpotdar
% %
% % Licensed under the Apache License, Version 2.0 (the "License");
% % you may not use this file except i... |
github | mayuresh159/starsense_algorithms-master | gen_table.m | .m | starsense_algorithms-master/gen_table.m | 1,385 | utf_8 | c8ac5f2650af82889f8734fcde0e9639 | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright 2016 Mayuresh Sarpotdar
% %
% % Licensed under the Apache License, Version 2.0 (the "License");
% % you may not use this file except i... |
github | mayuresh159/starsense_algorithms-master | detection.m | .m | starsense_algorithms-master/detection.m | 1,667 | utf_8 | fe390105c0303e67034cf8517d7edbca | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright 2016 Mayuresh Sarpotdar
% %
% % Licensed under the Apache License, Version 2.0 (the "License");
% % you may not use this file except i... |
github | mayuresh159/starsense_algorithms-master | read_catalog.m | .m | starsense_algorithms-master/read_catalog.m | 2,322 | utf_8 | cfd58c5df86b52f17c5cd9595885cca2 | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright 2016 Mayuresh Sarpotdar
% %
% % Licensed under the Apache License, Version 2.0 (the "License");
% % you may not use this file except i... |
github | mayuresh159/starsense_algorithms-master | select_region_v2.m | .m | starsense_algorithms-master/select_region_v2.m | 2,110 | utf_8 | c784dc0121cf170cebb8b62f403cb52e | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright 2016 Mayuresh Sarpotdar
% %
% % Licensed under the Apache License, Version 2.0 (the "License");
% % you may not use this file except i... |
github | mayuresh159/starsense_algorithms-master | image_plane_search.m | .m | starsense_algorithms-master/image_plane_search.m | 1,221 | utf_8 | 9f1125169228fc6c4acabcb814148f0f | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright 2016 Mayuresh Sarpotdar
% %
% % Licensed under the Apache License, Version 2.0 (the "License");
% % you may not use this file except i... |
github | mayuresh159/starsense_algorithms-master | quest.m | .m | starsense_algorithms-master/quest.m | 1,910 | utf_8 | 7290dc07c396cb3c70e26adf386fa665 | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright 2016 Mayuresh Sarpotdar
% %
% % Licensed under the Apache License, Version 2.0 (the "License");
% % you may not use this file except i... |
github | mayuresh159/starsense_algorithms-master | centroid.m | .m | starsense_algorithms-master/centroid.m | 1,363 | utf_8 | ceaf2c6b2f3bcea6de2fbf09fa765cdc | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright 2016 Mayuresh Sarpotdar
% %
% % Licensed under the Apache License, Version 2.0 (the "License");
% % you may not use this file except i... |
github | mayuresh159/starsense_algorithms-master | grow_region.m | .m | starsense_algorithms-master/grow_region.m | 1,551 | utf_8 | 3c0d9321fbc7d5be88f2c263f6385b7d | % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% % Copyright 2016 Mayuresh Sarpotdar
% %
% % Licensed under the Apache License, Version 2.0 (the "License");
% % you may not use this file except i... |
github | MLman/riem-mglm-cvpr2014-master | addnoise_spd.m | .m | riem-mglm-cvpr2014-master/synthdata/addnoise_spd.m | 211 | utf_8 | 7e130551e37f9edbc1ae02831355bd03 | function Anew = addnoise_spd(A, maxerr)
V = randsym(size(A,1));
if norm_TpM_spd(A,V) > maxerr
V = V/norm_TpM_spd(A,V)*maxerr;
end
Anew = expmap_spd(A, V);
function M = randsym(n)
M = randn(n);
M = (M+M')/2; |
github | MLman/riem-mglm-cvpr2014-master | paralleltranslateAtoB_spd.m | .m | riem-mglm-cvpr2014-master/spd/paralleltranslateAtoB_spd.m | 1,499 | utf_8 | 8ebf764e33f23b5dfa308c8e89eabb35 | function w_new = paralleltranslateAtoB_spd(a, b, w)
%PARALLELTRANSLATEATOB_SPD transports a set of tangent vectors w from TaM to
%TbM.
%
% w_new = PARALLELTRANSLATEATOB_SPD(a, b, w)
%
% a, b are points on SPD matrices.
% w is a set of tangent vectors.
% w_new is a set of transported tangent vectors.
%
% See ... |
github | MLman/riem-mglm-cvpr2014-master | isspd.m | .m | riem-mglm-cvpr2014-master/spd/isspd.m | 842 | utf_8 | 4d8c68730d23e74e8420d07cf47a589d | function T = isspd(mx,varargin)
%ISSPD check mx is a symmetric positive definite matrix.
% This check whether the smallest eigen value is bigger than c.
% Default c is epsilon.
%
% Example:
% T = isspd(mx)
% T = isspd(mx,C)
%
% See also MGLM_LOGEUC_SPD, MGLM_SPD, PROJ_M_SPD
% Hyunwoo J. Kim
... |
github | MLman/riem-mglm-cvpr2014-master | mglm_spd.m | .m | riem-mglm-cvpr2014-master/spd/mglm_spd.m | 3,568 | utf_8 | 0b9a5c75ce680c4a6401033bbef37131 | function [p, V, E, Y_hat, gnorm] = mglm_spd(X, Y, varargin)
%MGLM_SPD performs MGLM on SPD manifolds by interative method.
%
% [p, V, E, Y_hat, gnorm] = MGLM_SPD(X, Y)
% [p, V, E, Y_hat, gnorm] = MGLM_SPD(X, Y, MAXITER)
% has optional parameter MAXITER.
%
% The result is in p, V, E, Y_hat.
%
% X is dimX x N... |
github | MLman/riem-mglm-cvpr2014-master | mglm_sphere.m | .m | riem-mglm-cvpr2014-master/sphere/mglm_sphere.m | 3,015 | utf_8 | c72b8d6f639120803957c472802d3d4e | function [p, V, E, Y_hat, gnorm] = mglm_sphere(X, Y, varargin)
%MGLM_SPHERE performs MGLM on the unit sphere by interative method.
%
% [p, V, E, Y_hat, gnorm] = MGLM_SPHERE(X, Y)
% [p, V, E, Y_hat, gnorm] = MGLM_SPHERE(X, Y, MAXITER)
% has optional parameter MAXITER.
%
% The result is in p, V, E, Y_hat.
%
% ... |
github | e5k/TError-master | TError_sensitivity.m | .m | TError-master/TError_sensitivity.m | 13,752 | utf_8 | d0c15a4ee66ad2e105d0158e6dbb0af7 | % TERROR_sensitivity
% By: Sebastien Biass, Gholamhossein Bagheri, William Aeberhard and
% Costanza Bonadonna
% University of Geneva
% Copyright (C) 2014
%
%
% Email contact: costanza.bonadonna@unige.ch, sebastien.biasse@unige.ch
%
% This program is free software;
% you can redistribute it and/or modify it u... |
github | e5k/TError-master | plot_fits_sep.m | .m | TError-master/dep/plot_fits_sep.m | 1,658 | utf_8 | c812eeaed011bd0aa3620fb9c802d9c2 | % TError package
% This function plots all individual fits performed during Monte Carlo
% simulations
% xdata: Square root of the area (km)
% Aip: Break-in-slopes as indices
% C: Distal integration limit (km)
% fit_FN92: Exponential fit
% fit_BH05: Power-law fit
% fit_BC12: Weibull fit
% ax1-3: Handle... |
github | e5k/TError-master | rand_err.m | .m | TError-master/dep/rand_err.m | 725 | utf_8 | 3d8e3cbccd0761455b99bd49a7911b1a | % TError package
% Returns a matrix of relative and absolute errors
% Dist: Type of error distribution
% 1: Uniform
% 2: Gaussian
% sims: Number of simulations, i.e. size of the vector
% val: Reference value
% err: Relative error (%)
function mat = rand_err(dist, sims, val, err)
mat = zeros(sims,... |
github | e5k/TError-master | plot_results.m | .m | TError-master/dep/plot_results.m | 2,086 | utf_8 | f37c237ac80d1bef14436cce9f61180f | % TError package
% This function plots the results of the propagation run
function plot_results(data, in, maxERR, nb_sims, x_lab, out_name)
err = data(:,1);
data = data(:,2);
errmin = min(err);
errmax = max(err);
% Sets plot boundaries with a maximum of maxERR
if errmax > maxERR
maxX = ma... |
github | e5k/TError-master | get_WBL_ranges.m | .m | TError-master/dep/get_WBL_ranges.m | 846 | utf_8 | 2100d0b57ca64fea25368da1f8608632 | % TError package
% In case the user did not specify it, this function returns typical ranges
% of lambda and n values considering a VEI based on the mean of the volume
% values obtained with the methods of Fierstein and Nathenson (1992)
% and Bonadonna and Houghton (2005) to estimate the VEI.
% vol: Volume (km... |
github | e5k/TError-master | fminsearchbnd.m | .m | TError-master/dep/fminsearchbnd.m | 8,139 | utf_8 | 1316d7f9d69771e92ecc70425e0f9853 | function [x,fval,exitflag,output] = fminsearchbnd(fun,x0,LB,UB,options,varargin)
% FMINSEARCHBND: FMINSEARCH, but with bound constraints by transformation
% usage: x=FMINSEARCHBND(fun,x0)
% usage: x=FMINSEARCHBND(fun,x0,LB)
% usage: x=FMINSEARCHBND(fun,x0,LB,UB)
% usage: x=FMINSEARCHBND(fun,x0,LB,UB,options)
% usage: x... |
github | e5k/TError-master | plot_fits.m | .m | TError-master/dep/plot_fits.m | 2,935 | utf_8 | f0a0058639844e81bbfc1d0fbd464745 | % TError package
% This function plots the fits used for volume calculation obtained with
% reference values and adds a legend with the estimation of parameters
% xdata: Square root of the area (km)
% ydata: Thickness (cm)
% xerr: Maximum error on square root of the area
% yerr: Maximum error on thickness... |
github | e5k/TError-master | get_MER_WW87.m | .m | TError-master/dep/get_MER_WW87.m | 249 | utf_8 | 8f29bf5e61a4a68a9ec0130b3a43abf2 | % TError package
% Calculates the MER with the method of Wilson and Walker (1987)
% ht: Plume height (km above vent)
% const:Empirical constant
function MER = get_MER_WW87(Ht, cons)
% Equation (16) of Wilson and Walker (1987)
MER = (Ht./cons).^4; |
github | e5k/TError-master | get_MER_DB12.m | .m | TError-master/dep/get_MER_DB12.m | 6,530 | utf_8 | 1fa0379fa88e770a4fbc1eda9700a2a2 | % TError package
% This file was written by W. Degruyter and C. Bonadonna:
% Degruyter, W., & Bonadonna, C. (2012). Improving on mass flow rate estimates of volcanic eruptions. Geophys Res Lett, 39(16). doi:10.1029/2012GL052566
% Get MER from Degruyter and Bonadonna
% H = Height above the vent (km)
% Vmax =... |
github | e5k/TError-master | prctile.m | .m | TError-master/dep/prctile.m | 293 | utf_8 | 12ebf5d63b5e4ac6de3788c34d6cf05c | % TError package
% This functions returns the percentile p of the vector X
function yi = prctile(X,p)
x=X(:);
if length(x)~=length(X)
error('please pass a vector only');
end
n = length(x);
x = sort(x);
Y = 100*(.5 :1:n-.5)/n;
x=[min(x); x; max(x)];
Y = [0 Y 100];
yi = interp1(Y,x,p);
end |
github | e5k/TError-master | fn1992.m | .m | TError-master/dep/fn1992.m | 2,347 | utf_8 | ef26aeac484791cf5c0eb6fba619efc0 | % TError package
% Exponential fit for volume calulation with the method of Fierstein and Nathenson 1992
% xdata: Square root of the area (km)
% ydata: Log of thickness (cm)
% Aip: Vector containing the break-in-slopes as indices
function [vol, fit_FN92_v] = fn1992(xdata, ydata, Aip)
% 1 segment
if length(Aip) == 1... |
github | e5k/TError-master | get_MER_M09.m | .m | TError-master/dep/get_MER_M09.m | 256 | utf_8 | 427c0f08524aed96c53f900338bd6238 | % TError package
% Calculates the MER with the method of Mastin et al. (2009)
% ht: Plume height (km above vent)
% const:Empirical constant
function MER = get_MER_M09(ht, const)
% Equation (1) of Mastin et al. (2009)
MER = ((ht./const).^(1/.241)).*2500; |
github | e5k/TError-master | get_height_CS86.m | .m | TError-master/dep/get_height_CS86.m | 3,822 | utf_8 | a0b9cb91bcec4e484e6e3b6039fce337 | % TError package
% Calculate plume height (km asl) and wind speed (ms) using an
% implementation of the model of Carey and Sparks (1986)
% dw: Downwind range (km)
% cw: Crosswind range (km)
% d: Clast diameter (cm)
% den: Clast density (kgm-3)
function [height, wind] = get_height_CS86(dw, cw, d, den)
% ... |
github | e5k/TError-master | get_vol_BC12.m | .m | TError-master/dep/get_vol_BC12.m | 388 | utf_8 | b8de3d399e66c8c105bd776f977cb399 | % TError package
% Calculate the volume with the method of Bonadonna and Costa (2012)
% Theta, lambda, n: Fits obtained with the bc2012 function
function V = get_vol_BC12(theta, lambda, n)
% Theta: Thickness scale (cm)
% Lambda: Decay length scale of deposit thinning (km)
% n: Shape parameter
% Equation 3 ... |
github | e5k/TError-master | bc2012.m | .m | TError-master/dep/bc2012.m | 1,330 | utf_8 | 4689aa301e725eef6fc12e80cd232e91 |
% TError package
% Weibull fit for volume calulation with the method of Bonadonna and Costa 2012
% xdata: Square root of the area (km)
% ydata: Thickness (cm)
% lam_r: Range of lambda values used in optimisation algorithm
% n_r: Range of n values used in optimisation algorithm
function [vol, fit_BC12_v] = bc2012(xda... |
github | e5k/TError-master | rand_G.m | .m | TError-master/dep/rand_G.m | 235 | utf_8 | 8d0724e33244e5e76d1ded57d8ddc5b4 | % TError package
% This function returns a Gausian noise
% mu: Median
% sigma: Standard deviation
% nb_runs: Number of runs of Monte Carlo simulations
function r = rand_G(mu, sigma, nb_runs)
r = mu + sigma.*randn(nb_runs, 1); |
github | e5k/TError-master | get_vol_FN92.m | .m | TError-master/dep/get_vol_FN92.m | 988 | utf_8 | 8276e0f79b9b39b6b897e448ecbdd110 | % TError package
% Calculate the volume with the method of Fierstein and Nathenson (1992)
% T0 Extrapolated thickness at A = 0 (cm)
% k Slope of the segment
function V = get_vol_FN92(T0, k)
T0 = T0/10^5;
%% 1 segment
if size(T0,1) == 1
% Equation (12) of Fierstein and Nathenson (1992)
V = 2*(T0)/k^2; ... |
github | e5k/TError-master | writefile.m | .m | TError-master/dep/writefile.m | 1,862 | utf_8 | 9d9a9437f3560176ff3b2769e21d71c9 | % TError package
% This function writes the report of propagation runs
function writefile(fid, data, val_v, val_e, title, type1, type2, pcile)
% Type1 0: float
% Type1 1: power 10
data = data(:,2);
tmp(1) = mean(data);
tmp(2) = prctile(data, 50); % Median
tmp(3) = min(data); % Minimum
tmp(4) = prctile(data, p... |
github | e5k/TError-master | bh2005.m | .m | TError-master/dep/bh2005.m | 784 | utf_8 | 8d6ec21dbb37880e5b1447fb3fbbef63 | % TError package
% Power-law fit for volume calulation with the method of Bonadonna and Houghton 2005
% Note that we use here the commonly used approximation of an exponential
% fit of log10(x), log10(y) to approximate a power-law
% xdata: Square root of the area (km)
% ydata: Thickness (cm)
% T0: Intercept obtained... |
github | e5k/TError-master | get_vol_BH05.m | .m | TError-master/dep/get_vol_BH05.m | 459 | utf_8 | 434f588eb3d8698111ec20a22fd7524f | % TError package
% Calculate the volume with the method of Bonadonna and Houghton (2005)
% Theta, lambda, n: Fits obtained with the bc2012 function
% T0: Maximum thickness
% m: Power law exponent
% TPl: Coefficient (= Tpl)
% C: Distal integration limit (km)
function V = get_vol_BH05(T0, m, Tpl, C)
T0 =... |
github | hxmhuang/pom2k_matlab-master | bk_bcond.m | .m | pom2k_matlab-master/matlab_operator/bk_bcond.m | 13,715 | utf_8 | c755895a3916897c1172c832a9569e30 |
function [elf,uaf,vaf,uf,vf,w] = bcond(idx,elf,uaf,vaf,uf,vf,w,...
im,jm,kb,imm1,jmm1,kbm1,...
fsm,grav,ramp,rfe,h,uabe,ele,el,uabw,rfw,elw,rfn,eln,vabs,rfs,els,...
dum,dvm,hmax,u,v,t,s,tbn,sbn,dti,tbs,sbs,q2,q2l,small,v... |
github | hxmhuang/pom2k_matlab-master | advave.m | .m | pom2k_matlab-master/matlab_origin/advave.m | 4,502 | utf_8 | d42b62ba65dd2902958c581e3c7254c4 |
function [curv2d,advua,advva,fluxua,fluxva,wubot,wvbot,tps] = advave(curv2d,advua,advva,fluxua,fluxva,wubot,wvbot,tps,...
mode,im,jm,imm1,jmm1,aam2d,...
uab,vab,dx,dy,ua,va,cbc,aru,... |
github | hxmhuang/pom2k_matlab-master | bcond.m | .m | pom2k_matlab-master/matlab_origin/bcond.m | 13,715 | utf_8 | c755895a3916897c1172c832a9569e30 |
function [elf,uaf,vaf,uf,vf,w] = bcond(idx,elf,uaf,vaf,uf,vf,w,...
im,jm,kb,imm1,jmm1,kbm1,...
fsm,grav,ramp,rfe,h,uabe,ele,el,uabw,rfw,elw,rfn,eln,vabs,rfs,els,...
dum,dvm,hmax,u,v,t,s,tbn,sbn,dti,tbs,sbs,q2,q2l,small,v... |
github | sandykok/Glaucoma-Project-master | drlse_edge.m | .m | Glaucoma-Project-master/drlse_edge.m | 1,634 | utf_8 | 03b0141a707a30888366202ec187f3b9 | function phi = drlse_edge(phi_0, g, lambda,mu, alfa, epsilon, timestep, iter, potentialFunction)
phi=phi_0;
[vx, vy]=gradient(g);
for k=1:iter
phi=NeumannBoundCond(phi);
[phi_x,phi_y]=gradient(phi);
s=sqrt(phi_x.^2 + phi_y.^2);
smallNumber=1e-10;
Nx=phi_x./(s+smallNumber);
Ny=phi_y./... |
github | sandykok/Glaucoma-Project-master | maskcircle2.m | .m | Glaucoma-Project-master/maskcircle2.m | 1,731 | utf_8 | b45747b49de9244f38054231548fe1ac |
function m = maskcircle2(I,type)
if size(I,3)~=3
temp = double(I(:,:,1));
else
temp = double(rgb2gray(I));
end
h = [0 1 0; 1 -4 1; 0 1 0];
T = conv2(temp,h);
T(1,:) = 0;
T(end,:) = 0;
T(:,1) = 0;
T(:,end) = 0;
thre = max(max(abs(T)))*.5;
idx = find(abs(T) > thre);
[cx,cy] = ind2sub(size(T)... |
github | sandykok/Glaucoma-Project-master | Segment2D_public.m | .m | Glaucoma-Project-master/Segment2D_public.m | 2,957 | utf_8 | 879222d1b548c7be99ac7d01c261db85 | function phi = Segment2D_public( wb, wr, lambda, phi0, Nit )
verb = 1; fig_it = figure;
[Nx,Ny] = size(wb);
N = Nx*Ny;
r1 = 1;
r2 = 1;
r3 = 0.1;
r4 = 0.1;
Njvarphi = 3;
Njphi = 2;
epsilon = 1; [Y,X] = meshgrid(0:Ny-1,0:Nx-1);
auxFFT = cos(2*pi/Nx*X)+cos(2*pi/Ny*Y)-2;
l1 = zeros(Nx,Ny);
l2x = zeros(Nx,Ny);
l2y = zero... |
github | sandykok/Glaucoma-Project-master | odsegment.m | .m | Glaucoma-Project-master/odsegment.m | 9,242 | utf_8 | d2184c32ba8da60c40e3ff78b2fc8e95 |
function seg = odsegment(I,mask,num_iter,mu,method)
if(~exist('mu','var'))
mu=0.2;
end
if(~exist('method','var'))
method = 'chan';
end
s = 200./min(size(I,1),size(I,2));
if s<1
I = imresize(I,s);
end
if ischar(mask)
switch lower (mask)
... |
github | hhlfjjs/dispnet-master | classification_demo.m | .m | dispnet-master/matlab/demo/classification_demo.m | 5,412 | utf_8 | 8f46deabe6cde287c4759f3bc8b7f819 | function [scores, maxlabel] = classification_demo(im, use_gpu)
% [scores, maxlabel] = classification_demo(im, use_gpu)
%
% Image classification demo using BVLC CaffeNet.
%
% IMPORTANT: before you run this demo, you should download BVLC CaffeNet
% from Model Zoo (http://caffe.berkeleyvision.org/model_zoo.html)
%
% *****... |
github | arminalaghi/scsynth-master | VerilogSCFromData.m | .m | scsynth-master/src/VerilogSCFromData.m | 5,931 | utf_8 | b3371c40a05eaad8bfad878fa1a9688c | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogMReSCFromData.m | .m | scsynth-master/src/VerilogMReSCFromData.m | 4,933 | utf_8 | c9236ea16337863740b9e690b9d07526 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogCounterGenerator.m | .m | scsynth-master/src/VerilogCounterGenerator.m | 2,213 | utf_8 | c7fb34dd499cf50f146b2c16ae0b30bd | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogLFSRGenerator.m | .m | scsynth-master/src/VerilogLFSRGenerator.m | 3,770 | utf_8 | 167686c4bcf89a090331dd9f8883eeed | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 Armin Alaghi and N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at ht... |
github | arminalaghi/scsynth-master | VerilogMReSCFromFunction.m | .m | scsynth-master/src/VerilogMReSCFromFunction.m | 4,874 | utf_8 | a4357912a9b077f0119cb4dc3fb5a95a | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogSCFromFunction.m | .m | scsynth-master/src/VerilogSCFromFunction.m | 6,407 | utf_8 | bceee9b54cb581c40f8e5199ce748bf2 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogCoreMultivariateReSCGenerator.m | .m | scsynth-master/src/MReSC/VerilogCoreMultivariateReSCGenerator.m | 2,428 | utf_8 | 416a15bf0a811e2491b48f118e21d6b1 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogMultivariateReSCTestGenerator.m | .m | scsynth-master/src/MReSC/VerilogMultivariateReSCTestGenerator.m | 4,460 | utf_8 | 4503c49aba4da304ac2792df26715091 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogMultivariateSCWrapperGenerator.m | .m | scsynth-master/src/MReSC/VerilogMultivariateSCWrapperGenerator.m | 8,695 | utf_8 | 69f720943b0f8dfd776988a8251ec3f2 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | RecursiveCaseBuilder.m | .m | scsynth-master/src/MReSC/RecursiveCaseBuilder.m | 1,988 | utf_8 | 02a823fdd8233befb39d254b4ea08bfa | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogMultivariateReSCGenerator.m | .m | scsynth-master/src/MReSC/VerilogMultivariateReSCGenerator.m | 4,698 | utf_8 | 64f571292170b8246479c05eb7b04aa0 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | ComputeMultivariateBernstein.m | .m | scsynth-master/src/MReSC/ComputeMultivariateBernstein.m | 1,822 | utf_8 | 1201a5b8314d133ad6edfbaa84b08579 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | MaxAbsoluteError.m | .m | scsynth-master/src/bernstein_approx/MaxAbsoluteError.m | 558 | utf_8 | 5f19265f4d4e027947529c912fa23795 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 by N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.c... |
github | arminalaghi/scsynth-master | MeanSquareError.m | .m | scsynth-master/src/bernstein_approx/MeanSquareError.m | 551 | utf_8 | a3bc8af7484200b87699c0e8d9dee79d | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 by N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.c... |
github | arminalaghi/scsynth-master | BernAppr.m | .m | scsynth-master/src/bernstein_approx/BernAppr.m | 2,425 | utf_8 | c3af9a2ecfd9e77072c48145a8c36de8 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2011 W. Qian
%% Edited 2016 by N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this prog... |
github | arminalaghi/scsynth-master | MultivariateBernError.m | .m | scsynth-master/src/bernstein_approx/MultivariateBernError.m | 1,626 | utf_8 | 0e29101f6ca82b48f85a8cd1eab22482 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 by N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.c... |
github | arminalaghi/scsynth-master | BernError.m | .m | scsynth-master/src/bernstein_approx/BernError.m | 1,341 | utf_8 | bc313d78b867db7447707f69dc5fd657 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 by N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.c... |
github | arminalaghi/scsynth-master | BernBasis.m | .m | scsynth-master/src/bernstein_approx/BernBasis.m | 842 | utf_8 | 7c731cf8d320488b58fbf076b03df08f | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2011 W. Qian
%% Edited 2016 by N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this prog... |
github | arminalaghi/scsynth-master | MultivariateBernAppr.m | .m | scsynth-master/src/bernstein_approx/MultivariateBernAppr.m | 5,432 | utf_8 | 840e31ae1f9e358d5c0fa08337a57b6f | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2011 W. Qian
%% Edited 2016 by N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this prog... |
github | arminalaghi/scsynth-master | VerilogCoreReSCGenerator.m | .m | scsynth-master/src/ReSC/VerilogCoreReSCGenerator.m | 5,654 | utf_8 | 541e4b2b315e58a60acd041c9bfd0f09 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogSCGenerator.m | .m | scsynth-master/src/ReSC/VerilogSCGenerator.m | 7,666 | utf_8 | 6f4a1a0f847aace4e956a06bbaaa61f7 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogSCWrapperGenerator.m | .m | scsynth-master/src/ReSC/VerilogSCWrapperGenerator.m | 15,758 | utf_8 | 72782fc50c4d042d2ff50aa2c67f2e5e | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogReSCTestGenerator.m | .m | scsynth-master/src/ReSC/VerilogReSCTestGenerator.m | 3,945 | utf_8 | 17dbcb023e93d4770d9e6e228e957262 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | VerilogCoreStraussGenerator.m | .m | scsynth-master/src/ReSC/VerilogCoreStraussGenerator.m | 6,550 | utf_8 | 3c88e62a46fe39db1bca45c26724e075 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2016 N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at https://github.com/... |
github | arminalaghi/scsynth-master | GiveAsymValuesQuantized.m | .m | scsynth-master/src/ReSC/STRAUSS_BLIF/GiveAsymValuesQuantized.m | 1,706 | utf_8 | bcc93a31c9753ec85bd7b5450afefcf8 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2017 Armin Alaghi and N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at ht... |
github | arminalaghi/scsynth-master | CalculateSoPABC.m | .m | scsynth-master/src/ReSC/STRAUSS_BLIF/CalculateSoPABC.m | 2,547 | utf_8 | 7df2f1a37ecbcce701bfc1e2a00e194b | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2017 Armin Alaghi and N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at ht... |
github | arminalaghi/scsynth-master | WriteBLIFWithSharing.m | .m | scsynth-master/src/ReSC/STRAUSS_BLIF/WriteBLIFWithSharing.m | 4,305 | utf_8 | 2feeb150d75b4bf81537f9d139c74d05 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2017 Armin Alaghi and N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at ht... |
github | arminalaghi/scsynth-master | GreedySearchForAsymScalable.m | .m | scsynth-master/src/ReSC/STRAUSS_BLIF/GreedySearchForAsymScalable.m | 2,471 | utf_8 | 758c0117558c5e70474f5c6432cda226 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2017 Armin Alaghi and N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at ht... |
github | arminalaghi/scsynth-master | giveBit.m | .m | scsynth-master/src/ReSC/STRAUSS_BLIF/giveBit.m | 1,043 | utf_8 | 044d831ac69e08c9fd786537cd07b9ee | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2017 Armin Alaghi and N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at ht... |
github | arminalaghi/scsynth-master | BernToTTSymQuantized.m | .m | scsynth-master/src/ReSC/STRAUSS_BLIF/BernToTTSymQuantized.m | 1,413 | utf_8 | 454a0ead9eaf7143c825a2facedafa47 | %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Copyright (C) 2017 Armin Alaghi and N. Eamon Gaffney
%%
%% This program is free software; you can resdistribute and/or modify it under
%% the terms of the MIT license, a copy of which should have been included with
%% this program at ht... |
github | Tsroad/KnapsackProblemSeries-master | MultidiensionalMumltipleKnapsackProblem.m | .m | KnapsackProblemSeries-master/MultidiensionalMumltipleKnapsackProblem.m | 4,727 | utf_8 | 226b4e90485ef88fc9d10e698c3dcd80 | %% @authors Keung Charteris & T.s.road CZQ
% @file "MultidiensionalMumltipleKnapsackProblem.m"
% @version 1.0 ($Revision$)
% @date 18/8/2016 $LastChangedDate$
% @addr. GUET, Gui Lin, 540001, P.R.China
% @contact : cztsiang@gmail.com
% @date Copyright(c) 2016-2020, All rights reserved.
% This is an open access code d... |
github | AllenBrainAtlas/SWDB-2016-master | fn_register.m | .m | SWDB-2016-master/Projects/Reza_Code/anatoly_code/cux2_l4_275/fn_register.m | 9,875 | utf_8 | 1f04a598d854d0bebb35b8675e2acacc | function varargout = fn_register(varargin)
% function [shift e xreg] = fn_register(x,par|ref)
% function par = fn_register('par')
%---
% Be careful with the sign: xreg is obtained as
% xreg = fn_translate(x,-shift);
%
% See also fn_translate, fn_xregister
% Thomas Deneux
% Copyright 2011-2012
if nargin==0, help fn_re... |
github | AllenBrainAtlas/SWDB-2016-master | fn_progress.m | .m | SWDB-2016-master/Projects/Reza_Code/anatoly_code/cux2_l4_275/fn_progress.m | 7,598 | utf_8 | 8f3a93410cb881e5a7ffd50e4a1960b7 | function fn_progress(varargin)
% function fn_progress(prompt,max[,ht][,'ignoresub'][,'noerase'])
% function fn_progress(prompt,'%',[,ht][,'ignoresub'][,'noerase'])
% function fn_progress(text)
% function fn_progress(i)
% function fn_progress(i,'pause')
% function fn_progress('end')
% function fn_progress('cont')... |
github | AllenBrainAtlas/SWDB-2016-master | fn_pan.m | .m | SWDB-2016-master/Projects/Reza_Code/anatoly_code/cux2_l4_275/fn_pan.m | 659 | utf_8 | e4276e5d84c25979972a9126f39f0932 | function fn_pan(ha,mode)
% function fn_pan(ha[,'x|y'])
%---
% pan axes
%
% See also fn_buttonmotion, fn_moveobject
if nargin<2, mode = 'xy'; end
ax0 = axis(ha);
p0 = get(ha,'currentpoint'); p0 = p0(1,1:2);
hf = fn_parentfigure(ha);
ptr = get(hf,'pointer');
set(hf,'pointer','hand')
fn_buttonmotion(@(u,e)... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.