Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon. Entire thread

Papers Worth Reading

Name: Anonymous 2014-05-01 5:45

Spike sorting with hidden Markov models

The ability to detect and sort overlapping spike waveforms in extracellular recordings is key to studies of neural coding at high spatial and temporal resolution. Most spike-sorting algorithms are based on initial spike detection (e.g. by a voltage threshold) and subsequent waveform classification. Much effort has been devoted to the clustering step, despite the fact that conservative spike detection is notoriously difficult in low signal-to-noise conditions and often entails many spike misses.
Hidden Markov models (HMMs) can serve as generative models for continuous extracellular data records. These models naturally combine the spike detection and classification steps into a single computa- tional procedure. They unify the advantages of independent component analysis (ICA) and overlap-search algorithms because they blindly perform source separation even in cases where several neurons are recorded on a single electrode. We apply HMMs to artificially generated data and to extracellular signals recorded with glass electrodes. We show that in comparison with state-of-art spike-sorting algorithms, HMM-based spike sorting exhibits a comparable number of false positive spike classifications but many fewer spike misses.

Name: Anonymous 2014-05-03 21:31

>>2
>LEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEELLLLLLLLLLLLLLLLLLLLLLLLLLLLLL
>LELELELELELLELELELLELELELLELELELLELELELELLELE
>LELELELELELELLELELELEL LE BABBY MAYMAY ;D LELELELELELLELELLELE
>LELELELLELLE YOUR MAYMAY HAS ME LELELLEINNG SO HARD /G/RO LELLELELEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEELELLELELELLELELLELELELELELLELELELLE
>LELELELELELELLELELE LE NO READ FACE >;))))))))))))))))))))))))))))))))))))))) LELELELELLELELELELL LE BABBY
>LELELELELLELELLEE BABIES FIRST MAYMAY LEL LELELELELLELELELELLELELELELLELEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEELELLELELELELLELELELELEL
>LELELELELLELE LELELELELELEELEEEEEEEEEEEEEEEEL LE /G/RO NO READ :DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD LELELELELLELELELL
>LELELELELLELEL BABBY LELELELELELEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEELELELELE

Name: Anonymous 2014-05-03 21:53

>>5
You are ugly, ill-tempered, and stupid, and nobody will ever love let alone accept you. Why not just save yourself the pain of existence and kill yourself?

Name: Anonymous 2014-05-03 22:04

>>4
What analysis method do you use to get text from electrode waveforms?

Name: Anonymous 2014-05-04 1:45

>>6
To the contrary, I love >>5-sama and I am not >>5-sama.

Name: Anonymous 2014-05-04 2:21

>>8
Then you two faggots should meet up and slap each other's balls.

Name: Anonymous 2014-05-04 5:19

>>9
I'll meat up with you and slap up upon your cute little bundly balls!

Name: Anonymous 2014-05-04 8:52

>>4
But generating markov links is a sound application, which can be used to correct syntactic and stylistic mistakes. I.e. a text editor can point that I made an error in "it is is a syntactic mistake" (I frequently type the same word twice due to my OCD). And that isn't an IRC bot at all! So I guess you just spend to much time on IRC writing useless bots, my friend.

Name: Anonymous 2014-05-04 16:36

Name: Anonymous 2014-05-04 17:42

/goldberg/
Shalom!

Name: Anonymous 2014-05-04 17:48

Name: Anonymous 2014-05-04 20:19

Not a paper but a thesis:
Elm: Concurrent FRP for Functional GUIs
http://www.testblogpleaseignore.com/wp-content/uploads/2012/04/thesis.pdf

Name: Anonymous 2014-05-04 21:03

>>7
The anus method.

Name: Anonymous 2014-05-06 2:35

I came up with a centroid variant! =) I call them introverted centroids, because in certain conditions (above some n centres) the majority of distance calculations are centroid-centroid rather than centroid-data ^^

Name: Anonymous 2014-05-06 9:37

Name: Anonymous 2014-05-06 10:04

im not reading any of this shit

why don't you all fuck off with your special interests

Name: Anonymous 2014-05-06 10:14

>>19
Kill yourself.

Name: Anonymous 2014-05-06 11:33

Name: Anonymous 2014-05-06 19:48

>>20
NO OYU EFK KIEFLL YOU SELF SSELF YOU SILLYY TLIELELEL ELL TURTLE SHIT EFIJEJJS SLDL CHETTA

Name: Anonymous 2014-05-06 19:55

>>21
Luke is back!

Name: Anonymous 2014-05-06 20:09

>>18

http://www.lexifi.com/files/resources/MLFiPaper.pdf
peyton jones have just invented linked lists!

Name: bmap 2014-05-08 7:04

>>24
i do hope that wasn't the last concept you was able to grasp from that paper.

Name: Anonymous 2014-05-08 9:32

>>25
Nope. The problem has nothing, that makes Haskell solution better suited than say PHP solution.

Name: Anonymous 2014-07-15 10:29

> Even faster integer multiplication

> We give a new proof of F\"urer's bound for the cost of multiplying n-bit integers in the bit complexity model. Unlike F\"urer, our method does not require constructing special coefficient rings with "fast" roots of unity. Moreover, we prove the more explicit bound O(n log n K^(log^* n))$ with K = 8. We show that an optimised variant of F\"urer's algorithm achieves only K = 16, suggesting that the new algorithm is faster than F\"urer's by a factor of 2^(log^* n). Assuming standard conjectures about the distribution of Mersenne primes, we give yet another algorithm that achieves K = 4.

http://arxiv.org/abs/1407.3360

Name: Anonymous 2014-08-16 19:15

Name: Anonymous 2014-08-16 20:09

>>28
Doesn't apply to me.

Name: Anonymous 2014-08-16 20:13

>>28

Thanks. From now on, I'll use white on yellow just to annoy the faggots. Make your writings provocative!

Name: Anonymous 2014-08-16 23:37

lol at my own post xD

Name: Anonymous 2014-08-16 23:43

I do still have that centroid code around somewhere though =)

Name: Anonymous 2014-08-16 23:53

And it is kind of clever, i mean it localizes the data to specific centroids rather than just localizing the centroids in the data =D

Name: Anonymous 2016-07-07 19:18

Experimental Evidence of Quantum Randomness Incomputability
https://arxiv.org/pdf/1004.1521v2.pdf

Name: Anonymous 2016-07-08 12:54

Check em

Name: Anonymous 2016-07-08 19:48

>>34
Can you run https://en.wikipedia.org/wiki/RdRand
through these test and determine if its incomputable too?

Name: Anonymous 2016-07-08 21:15

Are there any papers on dubs theory?

Name: Anonymous 2016-07-08 21:21

>>37
It's your chance to shine!

Name: Anonymous 2016-07-09 2:58

>>37
If dubs are achieved, but no one verifies them, were they ever dubs at all?

Think about it.

Name: Anonymous 2016-07-09 6:01

>>39
one would hope not

Name: Anonymous 2016-07-10 14:07

Check em

Newer Posts
Don't change these.
Name: Email:
Entire Thread Thread List