WordPress.com (where this blog is hosted) recently started appending
Possibly related posts: (automatically generated)
To every blog post. These are links to other blogs hosted on wordpress.com that are (possibly) related to it. This feature can be disabled but personally I like it 
You can try it by clicking for example on one of my “not so new” posts (like this one) and scrolling to the bottom.
The History of Bungie is the history of a small (2 person) independent gaming software company that became a landmark in gaming with the Halo series.
One day, Shirou saw a fight between two servants, Archer and Lancer.
To preserve the secrecy of the war, Lancer mortally wounds him; but a girl who up until now seemed a normal classmate of his, Tohsaka Rin, saves his life using a magical pendant.
On his way home, Lancer attacked him again. Just before he’s about to die for good, the servant Saber appears before him, greeting him with the words “Are you my master?”
Fate/stay night is my favorite anime. The summary above doesn’t do it justice. I remember reading it and thinking “this sounds lame”. It came so highly recommended that I decided to watch it anyway. I didn’t use to watch anime until I started watching FSN.
The Story
The game had the game in which the anime is based had three different scenarios that came together to explain the enitre story. The FSN anime storyline is basically the FATE scenario from the game with some extras (mostly from the Unlimited Blade Works scenario). Because of this, to understand the story, one has to pay great attention to otherwise small details. The relationship between characters and other essential bits can only be understood from interpreting short flashbacks or “clue scenes”. It was easy for me to understand almost the whole thing the first time I watched the show but I was still finding small details the third time. Yes, I’ve watched this anime 3 times! That’s how much I enjoyed it. A friend of mine who also watched it completely missed some crucial bits such as the identity of Archer which in spite of being semi-obvious from the first few episodes, is only shown by an object at the end of episode 14 (another clue is given in a later episode by another object or rather two). Without knowing who Archer is, you miss out on one of the main topics of the show – ideals suck (and disillusion which is the name of the first opening btw).
I also found interesting that the current Holy Grail War was shown as largely a consequence of the previous war. Many of those participating in the war had their lives completely changed by the previous war.
Emya Shiro, the show’s main character is the stereotypical dropout loser that you see in many anime with the particularity that he has some lofty ideals of saving the world.
Tosaka Rin, the “friendly” sorcerer that is sort of Shiro’s teacher in the ways of the force… herm… magic, is also sort of stereotypical (even if bisexual) It’s sort of interesting to see that she lives her life to fulfill what she believes were her father’s expectations for her – a top of the class student and a dedicated sorceress,
I don’t want to talk about the other important characters so as not to spoil the anime for anyone. It’s a 24 ep show that was subbed by the excellent Eclipse productions.
The soundtrack is by Kaway Kenji (Gundam 00, Higurashi, …) and even though it’s a bit too “synth” I still like it a lot.
In Summary: WATCH IT!
def simpson(f, a, b, n): "Approximate the definite integral of f from a to b by Simpson's rule." if n % 2 != 0: print "Ups: n must be even!" return -1 h = (float(b) - a)/n si = 0.0 sp = 0.0 for i in range(1, n, 2): xk = a + i*h si += f(xk) for i in range(2, n, 2): xk = a + i*h sp += f(xk) s = 2*sp + 4*si + f(a) + f(b) return (h/3)*s def f(x): return x**4 ni = 50 nf = 1000000 n = ni a = -20 b = 0 s = [] qc = [] ec = [] t = 0.0 div = 0.0 i = 0.0 while n < nf: t = simpson(f, a, b, n) s.append(t) n = n * 2 for i in range(0, len(s)-2): div = (s[i+2] - s[i+1]) if div == 0: break t = (s[i+1] - s[i]) / div qc.append(t) t = div / 15 ec.append(t) for i in range(0, len(qc)): print "%.12f, %.12f, %.12f => qc=%.12f, e=%.12f" % (s[i], s[i+1], s[i+2], qc[i], ec[i])
My friend José Gaspar will be teaching an Advanced Administration Course (Curso Administração Avançada de Servidores Linux)
Some highlights/keywords:
Location: Rua da Boavista, Porto Portugal (link)
Date: From April 22 to June 3.
Schedule: Tuesday and Thursday, 19h-23h (4h)
Duration: 72h
Price: 300 euros
More information (in portuguese):
http://moodle.libhertz.com
http://www.solutionsout.com/cursos.htm
# this requires numpy get it from http://numpy.sf.net from copy import deepcopy from numpy import * # this function, swapRows, was adapted from # Numerical Methods Engineering with Python, Jean Kiusalaas def swapRows(v,i,j): """Swaps rows i and j of vector or matrix [v].""" if len(v) == 1: v[i],v[j] = v[j],v[i] else: temp = v[i].copy() v[i] = v[j] v[j] = temp def pivoting(a, b): """changes matrix A by pivoting""" n = len(b) for k in range(0, n-1): p = int(argmax(abs(a[k:n, k]))) + k if (p != k): swapRows(b, k, p) swapRows(a,k,p) def gauss(a, b, t=1.0e-9, verbose=False): """ Solves [a|b] by gauss elimination""" n = len(b) # make copies of a and b so as not to change the values in the arguments tempa = deepcopy(a) tempb = deepcopy(b) # check if matrix is singular if abs(linalg.det(tempa)) < t: return -1 pivoting(tempa, tempb) for k in range(0,n-1): for i in range(k+1, n): if tempa[i,k] != 0.0: m = tempa[i,k]/tempa[k,k] if verbose: print "m =", m tempa[i,k+1:n] = tempa[i,k+1:n] - m * tempa[k,k+1:n] tempb[i] = tempb[i] - m * tempb[k] # Back substitution for k in range(n-1,-1,-1): tempb[k] = (tempb[k] - dot(tempa[k,k+1:n], tempb[k+1:n]))/tempa[k,k] return tempb def residue(a, b, c): """Calculates the residue of a system solved by gauss elimination""" n = len(b) t = a * c # t is the A with the values of x replaced (an [n x n] matrix) s = [] for i in range(0, n): s.append(sum(t[i])) # s is the solution res = b - s # res is the residue return res #a = array([[1.0, 2.0, 0.0],[-1.0, 2.0, 3.0],[1.0, 4.0, 1.0]]) #b = array([3.0, -1.0, 4.0]) #a = array([[-1.414214, 2, 0],[1, -1.414214, 1], [0, 2, -1.414214]]) #b = array([1.0,1.0,1.0]) #a = array([[2.0, 2.0, 2.0],[1.0, 1.0, 5.0], [2.0, 5.0, 1.0]]) #b = array([6.0, 7.0, 8.0]) a = array([[1.001, 2.001, 3.001],[0.999, 2.0, 2.999], [1.002, 1.999, 2.999]]) b = array([4.003, 4.001, 3.999]) x = gauss(a, b) print "Solution = ", x #sol = linalg.solve(a, b) #print "linalg Solution = ", sol y = residue(a, b, x) print "Residue = ", y u = gauss(a, y) print "Residue destribution = ", u z = gauss(a, b+y) print "New Solution (with added residue) = ", z y2 = residue(a, b+y, z) print "Residule of new solution = ", y2 if linalg.norm(y2) < linalg.norm(y): print "New solution has a smaller residue." else: print "Original solution has a smaller residue."
