Misho Krastev misho-kr

Pre-Calculus

Description

This course is designed to prepare you for a college-level Calculus course. Through this course you will acquire a solid foundation in algebra and trigonometry. Emphasis is placed on understanding the properties of linear, polynomial, rational, radical, piece-wise, exponential, logarithmic, and trigonometric functions. You will learn to work with various types of functions in symbolic, graphical, numerical and verbal form.

This course will be taught over ten weeks, with materials released on a weekly basis. Each week will consist of a series of short lecture videos, quizzes every 3-5 lectures, readings and homework assignments through which you can practice your mastery of the material.

A prerequisite background in Introductory Algebra and Basic Geometry is necessary for this course.

Fedora 20 Installation Notes

This page describes the steps to prepare for and perform the installation of Fedora Linux on my laptop and desktop machines.

The process is fairly straightforward, and thanks to the efforts of the Fedora team really easy to carry on. Still, there are steps (mostly customizations) that require looking up man pages and other documentation, and there is benefit to record that information somewhere. I also tend to forget what custom scripts I have created and used, so unless I remember to preserve them I have to write them again (and again). This notes should serve as reminders to copy over such scripts.

Download and other links

Get Fedora and choose convenient format, usually Gnome Desktop DVD 64 bit

Docs, Papers, Blogs ...

Kubernetes

Unix, Linux, etc.

Cryptography I

Cryptography is an indispensable tool for protecting information in computer systems. This course explains the inner workings of cryptographic primitives and how to correctly use them. Students will learn how to reason about the security of cryptographic constructions and how to apply this knowledge to real-world applications. More ...

Week 1

This week's topic is an overview of what cryptography is about as well as our first example ciphers. You will learn about pseudo-randomness and how to use it for encryption. We will also look at a few basic definitions of secure encryption.

Introduction

Algorithms: Design and Analysis, Part 1

This course is at an undergraduate level, likely situated in third or fourth year. Students should feel programming language concepts, including recursion, as well as proof techniques, including induction.

Week 1

I. Introduction

Why study algorithms, designer's mantra -- CAN WE DO BETTER

Cloud Computing Concepts

This course is at an undergraduate level, likely situated in third or fourth year. Students should feel programming language concepts, including recursion, as well as proof techniques, including induction.

Introduction: Clouds, MapReduce, Key-value stores
Classical Precursors: Peer-to-peer systems, Grids
Widely-used algorithms: Gossip, Membership, Paxos
Classical algorithms: Time and Ordering, Snapshots, Multicast
Fun: Interviews with leading managers and researchers, from both industry and academia

Algorithms: Design and Analysis, Part 2

The course will have six weeks of lectures and assignments, followed by a final exam.

Week 1

I. TWO MOTIVATING APPLICATIONS

Distributed shortest-path routing -- sending email messages

	import logging
	import uuid
	import time

	import mesos.interface
	import mesos.native
	from mesos.interface import mesos_pb2

	logging.basicConfig(level=logging.INFO)

	#! /bin/bash

	# HEADS UP! Make sure to use '*' or a valid hostname for the FDQN prompt

	echo 01 > ca.srl
	openssl genrsa -des3 -out ca-key.pem
	openssl req -new -x509 -days 365 -key ca-key.pem -out ca.pem

	openssl genrsa -des3 -out server-key.pem
	openssl req -new -key server-key.pem -out server.csr