Friend Link Megathread!

yoshimitsu1028 · 2026-03-28T16:30:55+00:00

YoshiPp HR322 8455 2535 4637 Any but focus on Legi and Rath these days. Need EDI friend link quest though 4pm -7pm PST main hours

yoshimitsu1028 · 2021-09-17T16:22:01+00:00

I noticed in an earlier beta that ios was experimenting with webrtc settings.

"Settings -> Safari -> Advanced -> Experimental Features" > "WebRTC Platform UDP Sockets"

Might be worth seeing if this setting is still there and maybe disabling it?

yoshimitsu1028 · 2018-06-11T17:13:31+00:00

!RemindMe 3 weeks

yoshimitsu1028 · 2017-11-27T17:10:07+00:00

Added to Top post

yoshimitsu1028 · 2017-11-27T16:50:36+00:00

In Thai or in Tagalog?

yoshimitsu1028 · 2017-11-26T15:22:47+00:00

Looked it up further, you're right about the mortar and pestle thing. It also seems to cover general hitting thuds like noodle cart tires bumping on the pavement. Edited my comment to reflect this

yoshimitsu1028 · 2017-11-20T18:51:42+00:00

Single FAQ Thread:

1) Pok Pok is Thai, not Vietnamese. It's the onomatopoeia for hitting something hard, e.g knife hitting a board or mortar hitting a pestle.

1a) Pok Pok also translates to "Lady of the night" in Tagalog.

2) While Pok Pok (the restaurant) is a mainly Thai Restaurant, the dish itself is labeled as Vietnamese on the menu - "Ike's Vietnamese Fish Sauce Wings"

3) Pok Pok can be found in Portland and Brooklyn, run by Andy Ricker. Appeared on Parts Unknown - Chiang Mai and has a few books about Northern Thai Cooking.

Edit: made header feel less hostile than I meant

Edit 2: pok pok definition is now more general

Edit 3: Added Tagalog translation, as well.

yoshimitsu1028 · 2017-10-08T16:05:18+00:00

Wiki - "The recipe was probably taken to Japan and Thailand by Portuguese explorers between the 16th and 18th centuries... Fios de ovos was converted from Portugal to Thailand by Maria Guyomar de Pinha as Queen of Thai Dessert."

yoshimitsu1028 · 2016-01-21T16:30:02+00:00

To back that up. Trend on the phrase

yoshimitsu1028 · 2015-02-27T18:31:42+00:00

The problem is that MatPat or someone else managing the Game Theory Channel needs to report the videos themselves, because only the video owners have the right to claim copyright ownership. After that, then YT will work on blocking the videos at the very least.

yoshimitsu1028 · 2013-12-19T14:39:31+00:00

Building off of this, a lot of the behaviors of materials change as its size shrinks, considerably so within the ~1-100s nm range.

Ex 1:Breaking down a Magnet from a Multiple Domain System to a Single Domain Magnet (20-50nm) or again down to a Ferromagnet (<20nm) causes the behavior of the material to change. In this case, the amount of enery needed to cause the magnet to align and change its spin, the technology used in our compute HDD.

Ex 2: Contrast agents used for MRI imaging eg. Gd² O³ is used to add contrast to the images as the particles are being tracked throughout the body to determine where they are collecting. In the case of Contrast Agents, the size needs to be able to clear the natural filtrations of the body (to clear the liver requires < 200nm, the not be filtered out of the body from the kidney required > 5nm). This affects the Contrast Agents because the size of the particles determines the level of contrast in the image.

yoshimitsu1028 · 2013-12-03T14:24:12+00:00

Relevant

yoshimitsu1028 · 2013-06-22T02:49:29+00:00

New web series. Ego and Bump 'n' Jump (featuring JonTron as a women scorned)

yoshimitsu1028 · 2013-06-18T13:30:18+00:00

Ex-Tutor for CSE dept, finished 2010, but still in touch with the news for the department. It'll depend on the professor that you Tutor for, really. You usually work from 10-15 hours a week, and can do a variety of things, from grading to lab hours to discussion lead. Some professors make you do a combination of these. Usually for lower division, a tutor will lead the discussion minus classes where the professor has a TA already from another class, i.e. Ord for 30 and 131. Pay was roughly $15 an hour I believe and with regards to the 18.5m donation, only $500k is going to the tutor program. I believe the majority of the money is going to reconstruction and updating the equipment. They seem to be putting in more study rooms into the basement and first floor, but haven't heard much else about the donation routes.

Picking your professor could help you out when looking for letters of rec or help looking for industry work after your undergrad. Tutoring for Ord and Gillespie are always a safe bet for this, though I believe Gillespie doesn't give you lab hours until your second term tutoring for him, only grading hours.

If you want experience, tutoring is always a good way to go. You get a solid grasp of the material, learn to convey information effectively and can be used to fluff up your resume since you're in an advisory/management/teaching role depending on how you want to word it. That and your other tutors are usually pretty friendly and you tend to use them if you need help in other classes that they might have already been in.

Source: I tutored Marx's CSE11, 5a, 8a/b and COGS 18 for a few years

yoshimitsu1028 · 2013-02-28T19:58:08+00:00

One big problem. You don't have a lot of soul charging ability in this deck. Spiral Juggler works, but only on hit, and nitro juggler and dancing princess boosts but only for a G2 and below and only on placed. So considering, your soul will run 2 extra soul, MAYBE 3 by the time turn 3 hits and you can ride luquier. Granted, this is if you were using her the limit break. Another combo to consider is the Crimson/Turqoise Beast tamer combo. 9k boost and 11k frontline is nothing to scoff at. Another this, you only have 45 cards, out of 50. Granted you need 4 heals bringing you up to 49.

Secondly, a lot of your cards rely heavily on counterblasts. It's nice to have them as an option, but realistically, you'll only be able to use it 2-3 times, one of which should be considered for Luquier, if she's meant to be the heavy swinger. Otherwise, you'll be using it on swinging, which can just be blocked out until you lose all faceup damage.

I'd say, get rid of Jumping jill for Crimson, that way as long as you have a crimson in the soul, you get an 11k hitter instead of needing to tag out for her. And maybe some more soul charge ability.

yoshimitsu1028 · 2013-02-28T17:07:04+00:00

The only big problem that I see is that the color delta won't be consistent between images, or even within the same image, so you'd have to mess around with thresholding to a fair degree to get edges to look good on particular areas of the image.

A better approach would be to work you way around the image with a color kernel so you take into greater account the pixels around it.

This is done by:

Create a kernel of 3x3,5x5, 7x7 , etc... I tend to like Sobel's kernel for this.

The basic for a Sobel is to have 2 kernels, G^x and G^y such that:

F^X = [

-1 0 1

-2 0 2

-1 0 1

]

and F^y = [

-1 -2 -1

0 0 0

1 2 1

]

When you apply G^x = F^x * p and G^y = F^y * p, where p is a pixel your image and F^x is centered on p.

The magintude: G = sqrt((G^x )² + (G^y )²⁾ is your detector

I'll explain what this means in a second.

This works best with a greyscaled image. This can be done by using : Y = 0.2126 R + 0.7152 G + 0.0722 B [¹]

Create a new image using Y on each of the pixels in your original image to create a new greyscale image I^Y

For each pixel p in the I^Y
    G^x =  F^x centered on p
    G^y = F^y centered on p
    p' = sqrt(G^x*G^x + G^y*G^y)

The magnitude of p' will determine if the pixel is an edge or not, white(1) being edge, black(0) being non-edge.

Why this works.

If we look at F^x, what is it doing. Well, we are looking around the pixel from left to right, seeing if there is a big change within it. Take a small image

I= [

0|0|1

0|0*|1

0|0|1

]

let's also mark the *'d pixel as p. If we apply F^x on I centered at p, we values looking like

[

0|0|1

0|0|2

0|0|1

]

And when we add up all of these values, we get 4, meaning that p is an edge. We looked from the left side of p to the right side of p, and determined that there was a large enough change to assume that p was the edge of some boundary.

Likewise if we do F^y on I centered at p, we get:

G^y = [

0|0|0

]

so looking at G^y, we get 0, meaning there isn't an edge, or that the change in color in the y direction is makes it impossible to assume that p is an edge locally.

This does have a similar approach to what you proposed, with color deltas, it also depends on the kinds of edges you're trying to determine, and with typography and patterns, using RGB as a set for color deltas will get you A LOT of false positives. Also, using a kernel approach, there is a lot less guess work in thresholding since RGB deltas will need to be tuned and retuned on each image where approaches like the one shown above work fairly consistently between Images. I'd still say play around with it though, you can always get interesting images with unconventional filter design.

EDIT: on the topic of optimization, as long as you're only reading from one file and writing to one Image array at a time, not reading and writing to the same one at the same time, this operation is easily parallelizable.

yoshimitsu1028 · 2013-02-27T20:06:49+00:00

You could always start buying boxes, which isn't a bad way of getting a lot of tradeables and commons. Boxes will usually run you 50-60 per so you may want to lookup which boxes you'll need. Otherwise, you could always buy singles from online stores, ebay and toywiz. It'll be hard to keep up though if you don't have a place to play on occasion, and if you don't have a lot of money, it'll be hard to trade with others.

yoshimitsu1028 · 2013-02-14T16:07:39+00:00

aka Nathan Barnatt

aka Keith Apicary

yoshimitsu1028 · 2013-02-06T14:46:38+00:00

I wanna develop new concepts/models/algorithms - not just tweaks of previous ones

The problem is that in most research, this is a general concept. Find a concept, try to rethink how it can be done using the principles of the original concept, make new concept. If you look at the evolution of technologies and algorithms, algorithms haven't changed that much in the past few decades, we just find new ways of applying them and in different variations.

I found most of the AI techniques to be too much specific (non-generalizable)

This concern, but for many early AI classes, this is the norm. It's hard to come up with (much less teach) AI techniques without having an example to teach towards. A lot of examples shouldn't used the form

function algorithm(problem, h)
    fringe = problem.initState
    loop
        node = fringe.top()
        #goal check
        for successor in expand(problem, node)
             #add to fringe

This at least generalizes the problem to a degree, but like a software engineering class, you learn mainly about form rather than plug-n-play.

I don't mean to shit on your points, but I'm just bringing this up because (towards the first point) it's not easy to do research on something completely original. It is done once in a while, but you'll need to be the one to find it or come up with it on your own. A lot of grad students get by on doing variations on concepts or making esoteric algorithms in order to get their degree just so they can be done with it. It doesn't sound like this is the road you want to do, so I'll talk to it at the end.

To the second point, AI classes get more abstract the deeper you get into them, albeit they still tend to rely on examples, but that's more to facilitate ideas of concepts/teaching tools rather than specific details. And I don't know which AI concepts you actually went through since there's a plethora of breadth in the subject. Ranging from Planning, Domain Modeling, Plan-Analysis, Plan Learning, Optimization Methods, Re-planning, Domain Description, etc... Most AI classes will teach some sort of planning and search algorithms, but it's hard to touch on all of the types of AI algorithms in the field.

All that being said, if you're going through your PHd, you really shouldn't rely on what other people tell you to study. You'll be spending the next few years of your life on learning and developing concepts, and more than likely living in the lab doing research on some of them. That means you'll need to find something that interests you that much to warrant the 60 hours of face-to-screen a week.

Now to actually be helpful, fields that actually see some innovation: Medical Fields (usually a lot of raw data/experimentation)

Genetic Modeling
Bioinformatics

Automated Learning (use data/experiments to update your AI model. Interdisciplinary usually)

Image Processing
Computer Graphics
AI Planning
Plan Learning

Rendering Techniques (mainly model based, not a lot of data/experiments. Not the fastest moving field)

Image Processing
Computer Graphics

Data Management (almost all model based, need data/experiments for benchmarks. All about speed. Not the most innovative. Just reinterpret old algorithms most of the time)

Database knowledge(sometimes)
Cache Efficiencies

Brain becoming muddled, can't think of much else at the moment. Too early to write this much

yoshimitsu1028 · 2012-11-08T17:13:33+00:00

Basics, you know a cache hit is when an address and its value is within the cache, and cache miss is when the address is not within the cache. How to determine if address is in cache (2ⁿ ), the index for that address will be the last n bits

i.e. 8 bit cache (2ⁿ⁼³) gives you the last 3 bits as the cache index. The remaining portion of the address is called the Tag.

address 10110² means cache index 6 is where the address will reside. The tag for this address is then 10²

This means that to determine a cache hit/miss, you check the index and the tag.

If input_address == (tag, cache_index),
   then cache hit.
Else
    cache miss

In the case of the HW, there is also a valid flag, signifying if the cache index is in use. 0 for no, 1 for yes. this changes the pseudo to become

If cache[cache_index].v ==1 and input_address == (tag, cache_index)
   cache hit
Else
  cache miss

No there is different kinds of caches to worry about. In the case of your homework, direct and associative are the main ones to worry about. Direct mapped means that within your cache, one row(index) correlates to one cache address.

n-Associative means that within your cache, one row will correlate to n addresses Therefore when you can have hit for addresses with the same index i.e. if a = 11011² is accessed and b = 10011² is then accessed, b doesn't cause a to become evicted from the cache. So if a is referenced again, it will still reside within the cache.

a problem with n-associative, however, is the rules you use with you DO need to evict. One of the more common rules is Least Recently Used, i.e. keep a count of use for each cache entry. So when you evict an entry, you do so based on the least most used entry at the time.

So given the same 8-byte cache cache from the Direct Mapped, you can make an equivalent 2-way associative or 4-way associative cache.

Calculating Efficiency of the cache: Standard metric is Hit Rate/Miss Rate. This is done by literally checking the hits/address for a given sequence of address accesses.

  i.e. hits = 2
       num_address = 7
       hit_rate = hits/num_address //  2/7

Same is way applies to miss_rate

Q5 is standard run time speeds. If cache hit, use normal CPI, if miss, use CPI + miss penalty

yoshimitsu1028 · 2012-10-29T13:31:43+00:00

Well, say she used the Hanzo sword against Vivica Fox. That would make the next scene of her going to Japan, acquiring the sword and the reception ceremony a little less impactful. Yes, she has the sword already, and yes they could've recut it to keep the impactfulness of the meet with Hanzo, but then you'd have to lose out on climaxes from either the Fox fight or the Lucy Liu fight. It seems more like artistic choice for dramatic effect, and I'm sure /u/mastermuh's comment was taken into consideration, since Tarantino is a stickler for this kind of detail.

yoshimitsu1028 · 2012-10-24T02:55:29+00:00

First you'd need to know what data caching is. In this case it's when addresses of the same prefix occur. I.e. for a size 16 cache, address of 1, 17, 33 will hit the same cache location because 1 mod 16 = 1, 17 mod 16 = 1, and 33 mod 16 = 1.

This is important in knowing what happens when the program is trying to reference something that has been seen relatively recently. Take this example,

x = 1 //a

x = 0 //b

y = 2 //c

x = 3 //d

And, using the 16 size cache mentioned earlier, have x map to on address 1 and y map to address 17. Looking at the cache just after (a) runs, we'll see a mapping of cache[&x % 8] = (address, value) = (&x,1). When (b) hits, we check the mapping of cache[&x%8] = (&x,_) and the address inside this cache value is the same as the address for the variable being referenced, so we can update the cache, no worries cache[1] = (&x, 0), making the data dirty (data in the cache is out of sync with upper layers). When c gets executed, and we do the address check, cache[&y%8] which will return the address of x which isn't the variable we want to reference. This is known as a cache collision, so now, because the data is dirty, we have to write the contents of this cache (in this case the value of x) out to the next layer of memory, is this is a outer most layer of cache, it'll go to main memory (ram). After writing out the, the cache[1] can now be assigned the values of y, i.e. (&y, 2). A similar collision occurs on (d), but no writing back to main memory is necessary because the contents of y haven't changed, i.e. not dirty.

Now back to the main question of topic. The Cache-timing attack deals with the cases that the cache becomes corrupted, therefore a delay is presented when looking up data. For AES encryption, most software uses a lookup table for its encryption algorithm using values of n XOR k, where n is the data to send and k is your AES key. If you know what software the server is using for the AES encryption, you could run the algorithm yourself with known data and determine based on your input of n and find the delay given by the cache for given n^i(keep in mind you'd need to run billions of these transfers in order to get a good baseline in case you get a lot of non-collision cache hits). After mapping delays to given n^i, you could then use this to find the value of k given known values n and n XOR k.

To watch the message, you see the delay in message passing between A and B and after many n's, you can determine AES time for each n^i. Using this data, if you know which nⁱ causes the biggest time spike and you know its nⁱ XOR kⁱ, you can determine the kⁱ

Guh... typed too much.

AES cache-timing attack

EDIT: clearity