Anirudh Ramanathan foxish

MongoDB is document database that supports range and field queries (https://github.com/foxish/docker-mongodb/tree/master/kubernetes)

Concepts

Replication

A single server can run either standalone or as part of a replica set. A "replica set" is set of mongod instances with 1 primary. Primary: receives writes, services reads. Can step down and become secondary. Secondary: replicate the primary's oplog. If the primary goes down, secondaries will hold an election.

MVVM

HotDrink and Graph visualizations
- Using hotdrink and building an adapter for it to work with D3.
- D3 works on HTML5 and SVGs, making it work with mobile as well.
- Observables on both sides (Hotdrink and D3) and glue-code between them.
- Examples of Dijkstra's algorithm, Knight's tour and Elastic Triangle expressed in a constraint system.
- Github repo: TBD
- We saw programs which take an entire constraint system as a parameter, and the generic algorithm it's running is that of the user interface.
A mobile web-crawler
- Use of the webview is rather common in Android applications.
Android has a lot of malware.

Dr. Pradeep Dubey.

Synopsis:
- Starting with hardware, went up till the application layer, with IBM moving "upwards" and become a services company.
- Parallel computing lab, works with the end-user supercomputing applications, and not bottom-up.
- Multicore -> Manycore -> Bigdata -> ML.
- Why do we need to look beyond EZ (exaflops and zettabytes)?
Why machine learning?
ML drives innovation now.
How does it matter to people at large?

The copy-and-swap idiom is used in creating the copy assignment operator and prevents us from replicating code in the copy constructor and destructor. It's about assigning one object B to another A and destructing the memory previously held by the name A. As constructors should have strong safety guarantees, it should first allocate the memory needed and then clear the old copy, to ensure that it doesn't throw some bad alloc after it has destructed the object. It also takes a copy-by-val RHS, which can be destructed automatically after the function and swaps the contents of the RHS into 'this'. This serves all purposes and is simply copy first, followed by swap.
RVO and copy-elision (when passing arguments into functions) can let compilers do some fancy optimizations, while keeping things like constness of names and smaller code size. Pass-by-val can be quite fast if the compiler does optimize certain things.

	<!DOCTYPE html>
	<html>
	<head>
	<script src="http://fb.me/react-0.13.0.js"></script>
	<meta charset="utf-8">
	<meta name="viewport" content="width=device-width">
	<title>React JS Example</title>
	</head>
	<body>

	// This function can be used to write a check-labels config file.
	func writeLabelFile(c *CheckLabelsMunger, filename string) error {
	fp, err := os.Create(filename)
	if err != nil {
	return err
	}
	defer fp.Close()
	labels, err := c.labelAccessor.GetLabels()
	if err != nil {
	return err

	var Perceptron = function () {
	// initialize both weights to 0.
	this.w0 = 0;
	this.w1 = 0;

	// learning rate
	this.learn_rate = 0.08;

	// the bias neuron
	this.x0 = 1;