A circuit is a new model of computation, like turing machines. circuit are defined in terms of boolean logic, with components \(\text{AND}, \text{OR}, \text{NOT}\).

Most important quirk

constituents

• sequence of \(n\) true/false inputs \(x_1, …, x_{n}\)
• a graph with nodes belled AND/OR/NOT combining these things pairwise boolean gates
• a single output true/false

complexity measures of circuits

size (circuits)

number of gates—corresponds roughly to “time complexity”

depth (circuits)

length of the longest part from the output gate to inputs—roughly “parallel time complexity”

civil rights movement starting

civil rights moment was kicked off by the Rosa Parks incident, which caused the Montomery Bus Boycott.

Martin Luther King capitalized the incident to kick start civil rights movement. He employed the method of nonviolence movement.

educational integration in the civil rights movement

• K-12 disintegration: Brown v. Board of Education
• University of Georgia was the first disintegrated university in the south

service integration in the civil rights movement

Lunch counter boycotts. Nashville became the first desegregated lunch counter.

A part of the New Deal programs for unmarried men to go and build American infrastructure outdoors under reasonably harsh conditions. “Kind of like boy scouts for adults.” It is structured like the military; Black men were segregated and not given leadership roles.

1933-1942.

key question: are there bias and changes in young children + changes in skin color to generate more samples of skin disease.

previous work: DermGAN (Ghorbani 2020), this is not pediatric and also a bit deterministic.

key problems

data is scarce

data is not available and lack of data sharing.

data is sensitive

especially children.

pediatric specificity

we want to generate children’s skin disease samples, which as vastly out of sample. The work is therefore trained on only 1000-2000ish samples.

in demand paging, if we have to kick out a page, which one do we kick?

possible basic approaches

• random page (this works surprisingly well)
• throw out the page that’s the longest in memory (this is BAD because if a page is there for a long time, its probably accessed a lot)
• oracle (pick the page whose next accesses is farest in the future… we can’t predict the future)
• LRU (replace the page that’s accessed longest time ago)

LRU sounds decently good, but recall that \(2^{36}\) wall times to store wall time for each page are needed which is bad