The Guild

Exclusive: Video interview with Felicia Day on whedonage.com

I love Felicia Day, she is so cute and such a geek. 🙂 I liked her performance on Dr Horrible, she has a nice voice. The Buffy appearence is always a puls 🙂 I will watch the Guild soon. I dont actually remember witch youtube video was the first that made me focus my attention to Felicia and the guild, but at that time I already read a few articles about it while I was readyn stuff about Dr horrible.

I read some articles on Dr Horrible from drhorrible.com reaction section link list like
‘Dr. Horrible’s Sing-Along Blog’: An Oral History
and of course the Master Plan

Good Luck!

Firefly: the curse

I dont believe in curses but
blame the financial industry, for making unrealistic expectations considering rewenue…
and they do nothing but pushing virtual money for millions of dollar, and cannot even do that without screwing up (700million$ bailout…)
you cannot compete with “high revenue with esentially no work” the revenue/work ratio is infinite…

–Joss Whedon:
Buffy 7 Season
Angel 5 Season (Cancelled) (David Boreneas is still doing Bones so it’s not him)
Firefly 1 half season

–Morena Baccarin:
Firefly
Appeares on StarGate SG1 and it gots cancelled
Heartland cancelled (10 episodes)
Still Life (never even aired (saw the unaired pilot though)) http://www.imdb.com/title/tt0366100/
(please someone release this! I want to watch it. Where do I have to break in to see that?)

–Nathan Fillion:
Firefly
Drive 6 eps (5 aired) (poor Amy Acker too)
Desperate housewives (still waiting for the effect on this one:)
Buffy (last 5 episodes of the series) (…wait a minute, did buffy ended or got cancelled?)

–Summer Glau:
Firefly
The 4400 Canceled (appeared in 3 seasons: twice in 2, 3 times in 3, and 4 times in season 4)
Terminator (I’m keeping my fingers crossed at all times)

–Jewel Staite:
Firefly
Wonderfalls
StarGate Atlantis (SGA) gots cancelled after the 2nd year (she was so relieved that Atlantis didn’t get cancelled after season 4, that was so cute, I’m so sorry)

–Adam Baldwin:
Firefly
appeares on Angel Season 5 which was the year the show got cancelled
The Inside got cancelled
Day Break ended after 1 season
Chuck (I hope this one will last)

these are just the shows I have seen
you guys dont have much luck 🙁
It’s just too bad (for me) because you are great and I’d love to see more of you on the screen (or real life:))

Which Serenity/Firefly character are you?

Your results:
You are Derrial Book (Shepherd)

Derrial Book (Shepherd)
70%
Kaylee Frye (Ship Mechanic)
65%
Dr. Simon Tam (Ship Medic)
60%
Alliance
50%
Malcolm Reynolds (Captain)
40%
Zoe Washburne (Second-in-command)
40%
River (Stowaway)
40%
Wash (Ship Pilot)
35%
Jayne Cobb (Mercenary)
35%
A Reaver (Cannibal)
35%
Inara Serra (Companion)
20%
Even though you are holy
you have a mysterious past.


Click here to take the Serenity Personality Quiz

Thunderbird vs. 16k bit root CA

A thunderbird erthetetlen hibaablakokkal utasitja el a levelek alairasat, es titkositasat hogyha a tanusitvanyt kiallito CA lanc egyike 8kbitnel nagyobb RSA kulcsu tanusitvanyt hasznal. Legalabbis erre gyanakszom, mert mar volt ilyen problemam a Firefox-szal. A bibaablakok semmilyen error code-ot nem tartalmazank, cak, hogy valami nem stimmel, lehet hogy a tanusitvany datuma jart le …bla-bla-bla. Termeszetesen a felsorolt hibalehetosegek egyike sem igaz.
Igy kenytelen voltam letrehozni egy uj root CA-t kizarolag a levelalairasokra hasznalt tanusitvanyok eloallitasahoz.
(A MS Office 2003 Outlook jol kezelte az osszes hozza vagott tanusitvanyt a 16kbites CA-val eloallitott 4kbitest is.)

Optimal Coding 6 – 2D algorithms

Line and Circle drawing
Line-Drawing Algorithms
Bresenham’s line algorithm
Implementations in Delphi

Here is my old “Pascal” line drawing function for 256 color SVGA in DOS:
procedure LineSVGA256(x1,y1,x2,y2:word;c:byte);assembler;
var xtav,ytav,xdir,ydir:word;
asm mov dx,0ffffh; mov ax,0a000h; mov es,ax; mov ax,x1; mov bx,x2
sub ax,bx; jnc @negxdir; neg ax; neg dx
@negxdir: mov xtav,ax; mov xdir,dx; mov dx,0ffffh; mov ax,y1; mov bx,y2
sub ax,bx; jnc @negydir; neg ax; neg dx
@negydir: mov ytav,ax; mov ydir,dx; cmp ax,xtav; jc @vizsintes
@fuggoleges: or byte ptr cs:[@incdecf],00001000b; cmp xdir,1; jnz @i0; and byte ptr cs:[@incdecf],11110111b
@i0: or byte ptr cs:[@addsubf],00101000b; cmp ydir,1; jnz @i2; and byte ptr cs:[@addsubf],11010111b
@i2: mov cx,ytav; mov bx,cx; shr bx,1; inc cx; push bx
mov ax,y1; mov bx,VideoUResX; mul bx; add ax,x1; jnc @ide1; inc dx
@ide1: mov di,ax; mov ax,4f05h; xor bx,bx; int 10h; pop bx; mov al,c
@_0: mov es:[di],al
@addsubf: sub di,VideoUResX
jnc @05; add dx,ydir; push bx; mov ax,4f05h; xor bx,bx; int 10h; mov al,c; pop bx;
@05: add bx,xtav; cmp bx,ytav; jc @_1; sub bx,ytav;
@incdecf: dec di
jno @_1; add dx,xdir; push bx; mov ax,4f05h; xor bx,bx; int 10h; mov al,c; pop bx;
@_1: loop @_0; jmp @vege
@vizsintes: or byte ptr cs:[@addsubv],00101000b; cmp ydir,1; jnz @i1; and byte ptr cs:[@addsubv],11010111b
@i1: or byte ptr cs:[@incdecv],00001000b; cmp xdir,1; jnz @i3; and byte ptr cs:[@incdecv],11110111b
@i3:mov cx,xtav; mov bx,cx; shr bx,1; inc cx; push bx
mov ax,y1; mov bx,VideoUResX; mul bx; add ax,x1; jnc @ide2; inc dx
@ide2: mov di,ax; mov ax,4f05h; xor bx,bx; int 10h; pop bx; mov al,c
@_2: mov es:[di],al
@incdecv: dec di
jno @15; add dx,xdir; push bx; mov ax,4f05h; xor bx,bx; int 10h; mov al,c; pop bx;
@15: add bx,ytav; cmp bx,xtav; jc @_3; sub bx,xtav;
@addsubv: sub di,VideoUResX
jnc @_3; add dx,ydir; push bx; mov ax,4f05h; xor bx,bx; int 10h; mov al,c; pop bx;{}
@_3: loop @_2
@vege:
end;

Midpoint circle algorithm/Bresenham’s circle algorithm
Circle-Drawing Algorithms

Optimal Coding 5 – Algorithms – Mul

The Fastcode Project is mostly about optimizing for architecture. I was looking for similar project, but sadly i couldn’t find any. Maybe I wasn’t usign the right phrases in google.
A few days ago I remembered the LibTom Library for C I downloaded a while ago. The LibTomMath is a multiple precision integer library. I was reading the code of mp_mul function. Then I looked up the referenced algorithms and more…

Comba multiplication
Karatsuba multiplication
Toom-Cook multiplication
Strassen algorithm for polynomial multiplication
Multiplication using the Fast Fourier Transform
Martin Fürer FFT algorithm

the time complexity of conventional long multiplication is O(n^2)
Karatsuba Multiplication: O(n^lg2(3)) or O(n^1.585)
Toom-Cook 3-way: O(n^1.464)
FFT: O(n log n)

A promising library: GNU Multiple Precision Arithmetic Library

And here is some instruction timings for optimizing for architectures I forgot to put up last time: http://swox.com/doc/x86-timing.pdf