 Jan 2019

www.rollingstone.com www.rollingstone.com

make yourself essential
make yourself so good at what you do that they can't ignore you

 Oct 2018


A product under $50 is usually affordable enough that a customer may be ready to buy the first or second time.
maybe we'll be okay to be deficient here for a while

TODAY
create urgency/scarcity

 Sep 2018

www.markeko.com www.markeko.com

If you are an eCommerce, there will be fewer people who visited the “Check Out” page than the “Shopping Cart”. If you built an audience with your Facebook pixel, you audience size should be different.
this is basically the point
> the people who are checking out are the people you want to target, so that subset is smaller than say all the people mildly interested


removeddit.com removeddit.com

I generally stick with drugstore when it comes to eyeliner  although I love black track fluid line by MAC, I've found drugstore options that are just as good. Same goes for mascara. permalinkredditceddit
MAC is lowend


www.facebook.com www.facebook.com

(like budget, audience, placement, and scheduling) t
need to know these

Manual to set your own target cost per result.
which is better? Manual or automatic? Won't fb fuck us on automatic?
#Qs

conversion pixel or app event.
what is meant by this? conversion pixel a pixel made just for conversion?
#Qs


www.facebook.com www.facebook.com

Set up automatic bidding
wdym automatic bidding?
#Qs


apps.shopify.com apps.shopify.com

Just don't forget to collect emails of new visitors using such tools as Omnisend.
consider use


www.youtube.com www.youtube.com

ayesha song is the one im looking for, hindi song daddy was listening to


apps.shopify.com apps.shopify.com

AdRoll Growth Platform
pricey


apps.shopify.com apps.shopify.com

About Flexify: Facebook Product Feed
so essentially it seems that this is about syncing, and considering that a facebook account is something for a little later we can postpone this until further discussion

Dynamically promote your products
this piece is just an FB ad push, but it basically says that FB is good at timing, devices, relevancy, and scale.


apps.shopify.com apps.shopify.com

targeting
this might actually be something propietary, but it is something that can be done by hand regardless

Set up Facebook dynamic ads and retarget shoppers most likely to buy
from what i understand they're just asking facebook to do the work. they're not actually doing any work themselves


www.reddit.com www.reddit.com

ver 10 months I generated over $55k in sales at around 30% profit margin
he only made about 20k... + whatever he sold it for

I failed miserably. I built a second store in a different niche and worked tirelessly.
he worked through a niche, we should maybe try that if this doesn't work out


www.thefastlaneforum.com www.thefastlaneforum.com

excellent customer service
this is his niche

 Jun 2018

Local file Local file

Nullable
what nonterminals can derive epsilon

7
not derived from the B, B disappears, goes to epsilon in the follow set of B
rule 7 makes the capital B disappear

using First()is not sufficien
soon as you have the idea that capital leters can disappear you find that first is not enough

B →e
our new rule

Helper Function: Follow( )
first alone cannot cover all cases

S →Ay
first terminal expect to see if i have an S on the stack is AyB

⊦
first of s that i will see is the begin of file(?)

First
what is first all about> use to fill up part of our predict table

match
have to match then you just pop it off

Parsing the Input
How do we know what to expand next???
That is the rest of the lecture.

TopDown Parsing
summary slide

> S
S' is nonterminal so expand

→⊦S⫞
only one rule to expand S'

terminalat
terminal is a blue letter

→AyB
replace with AyB

Example
not like natural deduction only one way

decide which rule to apply next at each step of the derivation
one of the most important questions

AyB
children

S
root


Local file Local file

Properties of a PostOrder Traversal
we do not want ambiguity when evaluating a parse tree


Local file Local file

ThePoisso
big n, small p

r of success
x is successes in hypergeometric

There is only the one arrangement withxfailures followed by1success. Thisarrangement has probability
so just x failures followed by 1 success
same as negative binomial but k = 1 so x+11 = x of course where x is the number of failures

different arrangements ofx S’s and(nx)F’sover thentrials.
how many ways can we order successes over n trials

x+k1x
how many ways can we order the fucking failures given x+k1 trials

k1)successes, in any order
last success is fixed

Xbe the number of failures obtained before thek’th success.
follows NB if you have S/F with independent trials, with replacement
k successes x is # of failures until k success

ba+1in order thatbPx=af(x) = 1.
reqt of all probability functions

function(f(x)orX(a)) and thevalue of a function( for examplef(2)orX(a) = 2)
for a = THH

Proof of (a)

so our sample space has8!5!3!= 56equally possible outcome
= (8C5)(3C3) = 561 which is also valid

herefore by themultiplication rule there are36(3)56(3)ways to get a number which is even and>3000
flaw: you cannot make one 4 digit number in p ways and then turn around and make another 4 digit number in q ways and then claim that the there pxq ways to make a single 4 digit number. it doesnt make sense

(4;4)
only that particular even number is not available, so:
[3,7] and even is only 4 and 6> subtract 2

o the probability it is even is theprobability it is either2;4;or6or37
there are multiple ways to do it and some are simpler than others
if you have einstellung with one, skip it and move on and you may find a simpler solution
> same deal in (b)

Since each of1;2;:::;7isequally likely to be the first digit, we get the probability the number is greater than3000is57
same deal as in (a)

Case 1:all three letters are the same.
split into cases when desired/required

Now we can use the same technique to arrange the remaining eight letters. Having placed two of theS’s, there remain eight free boxes, in which we are to place three T’s in83ways, two I’s in52ways,one C in31ways, one A in21ways and finally the remaining S in the last empty box in11way.There are
Position is unique, not the letters. The letters are indistinguishable.
i.e: S1=S2=S3 but position 1 != pos2!=pos3

There are9(4)pin numbers that do not contain 1 and so there are10(4)9(4)that do contain a1. Therefor
the complement of all pins without 1s
so all pins with 1s which is the same as (9^(3)*2)/(10^(4)) since there are two (2) places for the 1 to go

Since we have a uniform probability model
every simple event is equally likely

We avoid this complication by starting with the second box
.


Local file Local file

two or more transition leaving the same state can have the same label yet lead to different states
must also consider/connais that all DFAs are NFAs

eNFA
basically your start pos is multiple start pos's

NFA version
solns?

(q0,1) U T(q1,1) U T(q2
yourew moving from any number of these states so of course the final state set is going to be the result of a union

A =
accepting state

{q2
intrsxn w accepting states, right?

all the possible subsets of Q
so here a subset is basically just concatenating instead of putting into a set

q1
this is a simplistic diagram
you could have 1 taking you back to q0 from q1 and q2 since you want 2 0s at the end


Local file Local file

S
alphabet

input
i.e: combinations of the alphabet


Local file Local file

i1 times for each i.
R^(i) = R⋅R^(i1) remember: you already have an R as a "coefficient"
so: R^(0) = R⋅R^(1) ??? Wait, then what's R^(1) which then must exist by this definition?
ANS:?

union of R concatenated with itself any finite number of times
concatenated to itself i1 times (for each term in the sum)

superscript
superscript indicates length

*
basically like the '*' in regex

R·S = {greyjay, greywhale, bluejay, bluewhale}
distribute

Regular Language
as you will recall, has infinite numbers of valid identifiers

meets the specification
language spec..

specifyall
not recognize

Lexical Analysis:
token analysis


drive.google.com drive.google.com

page 43:
i dont really understand this proof

page 43:
nonneg: 0 or positive nonpos: 0 or negative

page 37:
so basically its already known that Span B is a subset of S, basically by definition:
We already know that all the vectors in B are in S and since S is closed under linear combinations, Span B is a subset of S (i.e: can be written as an LC of the vectors in S). (you cannot go beyond)

the best you can do with n1 vectors (even if you are touching all 4 dimensions) is to create a hyperplane assuming linear independence
page 31

thm 5 explanation:
 we cannot have any other coefficient set which will make the equation 0 besides the trivial solution
so we find that ci=di for every vector 1<=i<=k in S

the proof makes sense in example 14 since we show that
 R2 is a subset of Span B and that
 Span B is a subset of R2
 B is linearly independent
page 16

example 17 makes sense since you show that
 any vector in R2 is a linear combination of the vectors in B by offering a c1, c2 s.t. we have a soln for every x1,x2
 linear independence is had as we find that the only soln to the problem of x1=x2 =0 is c1=c2=0 (trivial
page27

 May 2018

docs.racketlang.org docs.racketlang.org

bindings
essentially giving out all the bindings


Local file Local file

P(BjA)P(A) +P(BjA)P(A)
prob that b occurs given a + prob that b occurs given a complement
this just reduces into p(b)

P(A)P(BjA
P(A)P(BA) = P(A)P(AnB)/P(A) = P(A)

(AiAjAkAl) +
notice it keeps going so you would then add back in P(AiAjAkAlAm)

(where the subscripts are all distinct, for examplei < j < k < l).
clever way to ensure distinctiveness

P(D) = 1PD= 19(4)10(4)
yes my method works (of choosing one of the four locations) so:
P(D)=4*9^(4)/10^(4) is right also
since we can only have one 1, otherwise you would need to use their method of finding the complement

(23) + (32) = 12ways
makes sense

We need to have more efficient ways of determining the number of outcomes inSor in a compoundevent without having to list them all. Chapter 3 considers ways to do this, and then Chapter 4 developsother ways to manipulate and calculate probabilities
happens later, chapter 2 is genuinely soft

Solution 1:
In this solution we simply flesh out the sample space and assign a prob'y dist'n to the events.
Then we simply count up the number of events which fulfill our criteria and produce the probability.

f2,3,4;:::;A;2~;:::;Ag
here, the same event is a compound event.
note that only one of these events will occur in a single trial in both cases, but there are multiple ways in which the event can occur (club)

={spade, heart, diamond, club}.
as you can see with this example and the next,: the sample spaces need not be unique in order to produce the same result.

598
you do indeed have 5 options for the even digit, and then 9,8,7 for the rest of the digits


anthonyzhang.me anthonyzhang.me

Structural recursion
structural recursion with an accumulator is called accumulative recursion, stores subproblems


Local file Local file

Tokens
LIST OF TOKEN TYPES

break up an assembly language instruction into components and classifying these components.
so that: you can ID errors you can output the appropriate output when desired

lexeme
basically a fancy way of saying "word"

MSB
MSB is a 1 so you dupe that and you will get a 2s comp (i.e: signed) 1, i.e.: 0xf

0x87654321
0x87654321 has the MSB as 1 which will trigger the different behaviours
recall that 8= 2^3 and is uniquely represented as the nibble 1000

char(instr>> 24) << char(instr>> 16) << char(instr>> 8) << char(instr);
printing from MSB to LSB (>>24 comes first!)

least significant byte
 cuts out MSB > NOPE:it means what it means, see how char keeps cutting out the MSB until it is equal to the LSB?
it is saying that these are ALL EQUAL

instr0001
THE FINALE!

s is 2 = 000102shifted 21 bits left
consider that a 0 bit shift left would not add any additional 0s to the right.
1 bit shift left would put 11 zero there.
26? 26 zeroes

(0x0F)
number is 15, so we're just going to keep the right nibble on

3124beyond
why is beyond on 24 when its just a label??
ANSWER: You don't want to be going back up to 20 and rerunning it every time. That would be wrong

// y gets 0, and (bar, 0)// gets added to st.
builtin mechanism where if its not there it will get added

each instruction is exactly 4 bytes long
aka 32 bits

Big hint:just recognize the proper form and call everything else an error.
this is a good slide for pseudocoding your soln at least

semantic
relating to meaning

syntax
relating to form

9999999999
actually, how big can the number be?

a kind
a what?
maybe they just mean some "type", basically

10
note that the scanner is providing the output as a decimal value

errors
to stop program early, i suppose

<< 2 =1 0
fall off is lost


Local file Local file

R
sas university is also an option


www.student.cs.uwaterloo.ca www.student.cs.uwaterloo.ca

16 Unnecessary Complications
rethink the belows' use

ature that all of the names are in the scope of all the valueexpressions. It canbe used to define rec
idgi but sounds important for recursive+mutuallyrecursive

Before the implicitbeginin alambdaor function definition, Racket allows internaldefines.This is an alternative to immediately using one of the constructs in the next section (internal definitions a
idgi but sounds important

Racket also provides onearmedwhenandunless
what?

ote that the values of toplevel expressions are printed after evaluation if they are not<void>.If you
ote that the values of toplevel expressions are printed after evaluation if they are not<void>.If you</void>

Racket Reference
referring to a resrouce listed above (in ss 1)


Local file Local file

S
if you got an 'a' then you go to the empty set

he setof states {1, 3}
at the same time

A string is accepted if at least one pathleads to an accepting state.
if you end up in q1 and q2 then you will accept (at least 1)

Differs
not a single answer but a set of answers

q0
you are here AND in q1


Local file Local file

state d(state, ci)
update state based on input
can think of as just a big lookup table

d
state symbol pair

(S, b)
in S and see a b go to b
in state b see an e then go to be,,
and so on

A=
can be empty

S
subset of states

deterministic
as stated before, know where im going next, for every step, i know here im going to next EX;; b + e = be > we know this, nondfa would not know this

0
beginning in an accepting state

more
unbounded

*
Kleene Star

a
if input stopped here > in an nonaccepting or error state > not a sucessful termination of the program, will JUST hang

,
a or b

ab
accepts this specific string only

nothing
no concentric circle state, accepts {} (nothing, epsilon)

Err
idea of error state

Transi
equivalent of arrows in prev diagram

at
why is sleepy not an accepting state?
psbl ans: can't stay in "sleepy"

accepting state
goal is to end up in an accepting state
as many as you want
BUT only one start state

deterministic
meaning every move is determined


Local file Local file

Recognizing A Regular Language
May 24th, 2018

infinite
obviously going to be infinite

.e
^what the star means>>

ε
means the empty string

infinitee
most prog langs

bababa
combinations of our set

{ a, b}
irl it would be ascii

Input:intmaxEntry
easy to figure out whther say, youve been given a valid register (finite)
but this is an infinite sized langauge > so we must specify and recognize them

machine code to be able to convert an assembly language
how can i break strings into a series of tokens that i understand (?what?)


www.bloomberg.com www.bloomberg.com

capricious
easily swung this way or that emotional given to sudden and unaccountable changes of mood or behaviour


Local file Local file

update
why is the order reversed?
why do we update then load & restore then update?

in our MIPS simulator we use $30
stack pointer location


learn.uwaterloo.ca learn.uwaterloo.ca

archetypes
stereotype is generally one dimensional and negative archetype is the source from which copies are made
Stereotype is a "conceptual model" created by abstracting the key features of current examples. > abstracting means extracting so an investment banker stereotype may have the abstracted traits of selfishness and vanity

asetiological
origin stories

Mythology is for me a medium of exploration
author perspective


english.stackexchange.com english.stackexchange.com

abstracting
i.e: pulling it out from the archetype intos omoething else


learn.uwaterloo.ca learn.uwaterloo.ca

myths which we will be looking at in this course willcontain elements from
contain elements across these boundaries we have just created

Perceptions ofhistorical truth are inherently subjective
GIST

Troy in the Troad
might be based in reality


www.linkedin.com www.linkedin.com

complements
completes, vs compliment which is just a nice thing to say


www.student.cs.uwaterloo.ca www.student.cs.uwaterloo.ca

executed
only skip on nonzero (i.e: summation is >0)

 Apr 2018

www.student.cs.uwaterloo.ca www.student.cs.uwaterloo.ca

Pipeline Start Up Time
looks important

ill get fetched.In between instructions. W
order matters!!!!!!!!!!!!

Datahazard
hazards: IMP

WBIF
abbrev meanings



1
1 X is functfield determined

, the main control unit generates the ALUOp bits, which then are used as input to the ALU control that generates the actual signals to control the ALU unit
crux

add $t1,$t2,$t3, which reads $t2 and $t3 and writes $t1
class 1 of instructions

and implement a nondelayed beq instruction.
idk about irl/ in the courseontes but this is imp/good to know

data memory must be written on store instructions
data memory is the fucking data which is not the fucking register

while the value written will be available to a read in a subsequent clock cycle
when?

Zero
used for branch instructions, ex: beq

Readdata 2
32 bits wide

Readdata 1
32bits wide

adder to increment the PC to the address of the next instruction. Th is adder, which is combinational
wired to be a permaadder

ombinational logic
alu or and for instance

on a load and written on a store
load: read from memory on a load store: and write to memory on a store


Local file Local file

SHDC
yes these are spots/buckets for those numbers
2 results will be the same since we have two 2s in our given split

The number of distinct arrangements with a man at each end is6!3!3!=20, since we are arranging3M’s and3W’s in the middle 6 positions. Thenumber with a woman at each end is6!5!1!=6.Thus
amalt awalt

aren−(r−1) =n−r+1
simple explano of the final temrm

 Jan 2018

Local file Local file

AlmostnotabsorbingAlmostallabsorbing
We cannot think of Earth radiation as being radiated into space directly from the surface. Much of the radiation emitted will be absorbed, primarily by water.
There are regions in the atmosphere which absorb Earth’s radiation. This atmosphere is acting as a body, radiation from this atmosphere layer will be directed downward, as well as upward, and hence the surface will receive not only the net solar radiation, but IR from the atmosphere as well.

 Dec 2017

raphaelkoh.me raphaelkoh.me

Observer Pattern
optimal for multiple subjects (ex: product types) and multiple observers (ex: store types)

 Nov 2017

anthonyzhang.me anthonyzhang.me

which makes it so that the type of the object is considered at runtime, rather than from the type of the variable
object is of type B, variable is of type A

if (this == other) return *this;
selfassignment would cause an infinite loop
Tags
Annotators
URL

 Oct 2017

raphaelkoh.me raphaelkoh.me

int
how that legal?


anthonyzhang.me anthonyzhang.me

To avoid implicit conversion, we can use the explicit keyword, which goes right before the Node in the declaration. This makes the compiler give an error if we attempt to perform implicit conversion.
?

int *data = this>data;
does this>data return an address??
ANS; no

pretty sure it should day "Node" here

Node
delete constructor

v
incorrect, should be Vector

new
new always allocates on hea
Tags
Annotators
URL
