The following individuals have successfully completed the Web Development Certificate at Seattle University. They are listed according to the quarter they completed.
Rebeccca Peltz rebeccapeltz
rebeccapeltz
/ podcast-hd-264-profile
Created
April 19, 2021 20:29
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| require("dotenv").config(); | |
| const cloudinary = require("cloudinary").v2; | |
| cloudinary.api | |
| .create_streaming_profile("podcast_hd_h264", { | |
| display_name: "Custom podcast h264", | |
| representations: [ | |
| { | |
| transformation: [ | |
| { |
rebeccapeltz
/ sampler.html
Created
February 8, 2020 17:52
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html lang="en"> | |
| <head> | |
| <meta charset="UTF-8"> | |
| <meta name="viewport" content="width=device-width, initial-scale=1.0"> | |
| <meta http-equiv="X-UA-Compatible" content="ie=edge"> | |
| <title>Transforms</title> | |
| <style> | |
| .bdr { |
rebeccapeltz
/ webdev_alumni.md
Created
September 19, 2018 20:53
rebeccapeltz
/ gist:89ae27d4210257f2f84be6e2872de5be
Last active
August 28, 2018 17:40
r accuracy/r^2
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| sstot = sum((credit$R1 - mean(credit$R1))^2) | |
| totsse =0 | |
| accuracy = rep(0,nrow(credit)) | |
| r2 = 0 | |
| #cross validate nfold leave one out | |
| for (i in 1:nrow(credit)){ | |
| # print(i) | |
| model.svm = svm(R1 ~ ., data=credit[-i,]) | |
| pred.svm = sapply(predict(model.svm,credit[i,]),roundOff) | |
| # print(paste("pred",pred.svm)) |
rebeccapeltz
/ webdev_alumni.md
Last active
June 29, 2018 00:51
— forked from shawnr/webdev_alumni.md
Web Development Certificate Alumni
The following individuals have successfully completed the Web Development Certificate at Seattle University. They are listed according to the quarter they completed.
rebeccapeltz
/ index.html
Created
September 8, 2017 02:52
JS Bin // source https://jsbin.com/jekuhom
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <!DOCTYPE html> | |
| <html> | |
| <head> | |
| <meta charset="utf-8"> | |
| <meta name="viewport" content="width=device-width"> | |
| <title>JS Bin</title> | |
| </head> | |
| <body> | |
| <script id="jsbin-javascript"> |
rebeccapeltz
/ genetic_reproduction.js
Created
May 29, 2017 17:29
Genetic Algorithm Reproduction transcribed to JavaScript
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| GA.evolvePopulation = function (generation) { | |
| var newGeneration = new Population(generation.populationSize(), false); | |
| var elitismOffset = 0; | |
| //keep best offsrping from past generation in first position if elitism is enabled | |
| if (GA.elitism) { | |
| newGeneration.saveTour(0, pop.getFittest()); | |
| elitismOffset = 1; | |
| } | |
| //choose parent and "mate" - create new offspring from current generation | |
| for (var i = elitismOffset; i < newGeneration.populationSize(); i++) { |
rebeccapeltz
/ trees.js
Created
May 29, 2017 17:14
Implementing a Binary Search Tree with utility in JavaScript
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 'use strict'; | |
| //https://gist.github.com/alexhawkins/f993569424789f3be5db | |
| //http: //stackoverflow.com/questions/1331289/javascript-binary-search-tree-implementation | |
| function BinarySearchTree(value) { | |
| this.value = value; | |
| this.left = null; | |
| this.right = null; | |
| } |
rebeccapeltz
/ stack.js
Created
May 29, 2017 17:05
Implement a stack by wrapping a JavaScript array.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| "use strict"; | |
| var Stack = function() { | |
| this._arr = []; | |
| this.top = null; | |
| this.size = this._arr.length; | |
| }; | |
| Stack.prototype.push = function(data) { | |
| this._arr[this.size] = data; | |
| this.size += 1; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // O(N) | |
| function(str) { | |
| if (str.length < 2) return str; | |
| return str.split('').reverse().join(''); | |
| } | |
| // O(N/2) | |
| function(str) { | |
| var buffer = new Buffer(str); | |
| for (var i=0;i< buffer.length/2; i++){ |
NewerOlder