:Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :>_> apparently LectureBot despises dogs :/ :esper!esper@theNPA-456A3540.cable.rstb.cablerocket.net PRIVMSG #lecture :he speaks! :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net JOIN :#lecture :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :.. :the-npa.org MODE #lecture +o qwertydawom :ChanServ!services@smashthestack.org MODE #lecture -o qwertydawom :Ch4r!rac@i.see.you PRIVMSG #lecture :ARGH! :Ch4r!rac@i.see.you PART #lecture :Ch4r!rac@i.see.you JOIN :#lecture :ChanServ!services@smashthestack.org MODE #lecture +oq Ch4r Ch4r :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :hehe :Ch4r!rac@i.see.you MODE #lecture +o qwertydawom :Ch4r!rac@i.see.you PRIVMSG #lecture :STARt, QUICK :Ch4r!rac@i.see.you MODE #lecture -o Ch4r :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :ok :Ch4r!rac@i.see.you PRIVMSG #lecture :go go go :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :blast off! :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net MODE #lecture +m :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :The history of graph theory probably begins with Euler works in the 18th century and finds its origin in the study of some problems, :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :such as that of the bridges of Konigsberg, the walk of the knight on a chessboard or the problem of the coloring of the maps. :cyberwarrior!saad@theNPA-87AED4DA.hsd1.il.comcast.net PART #lecture :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Graph theory was then developed in many fields such as chemistry, biology, social sciences, computer science, etc. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Since the beginning of the 20th century, it is a whole stand-alone part of mathematics, thanks to the works of König, Menger, Cayley then of Berge and Erdös. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :In a general way, a graph allows to represent the structure, the connections of a complex set expressing the relations between its elements : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :communication network, interaction of several animal species, electric networks, ... :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :The graphs thus constitute a method of thinking which allows to modelize a great variety of problems coming down to the study of vertices and arcs. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net MODE #lecture -m :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :The latest works in graph theory are often done by computer scientists, due to the importance the algorithmic aspect bears. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Indeed, the thing is essentialy to modelize problems. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :We express the problem in terms of graphs and then it becomes a problem of the graph theory which we, most of the time, know how to solve since it belongs to a category of known problems. :mu-tiger!mu@theNPA-B3EE7147.cable.mindspring.com JOIN :#lecture :mu-tiger!mu@theNPA-B3EE7147.cable.mindspring.com PRIVMSG #lecture :shit, i can't afford it :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :The solutions of graphs problems can be easy and efficient (because the time needed to treat them via computers is reasonable since it depends polynomially of the number of vertices of the graph) or hard (since the treating time is exponential) in which case we use a heuristic, that is to say a process of searching for a solution (not necessarily the best one). :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :(hello Mu :)) :mu-tiger!mu@theNPA-B3EE7147.cable.mindspring.com PRIVMSG #lecture :ACTION waves :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :The graph theory knows a lot of people enjoying it these 30 last years, maybe it's because, in its elementary concepts, it does not contain a considerable mathematical luggage. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Now, let us introduce the basic vocabulary of the graph theory (see also the last lecture). :SysSpider!SysSpider@theNPA-E76EA375.dsl.telepac.pt JOIN :#lecture :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :The used terms are those of the common language and euclidean geometry (and unfortunately, there are in the same number.. f**king common language). :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Definitions : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D1. A "graph" (or "polygraph") G is a couple G = (V, E) constituted of a set V non-empty and finite, and of a set E of pairs of elements of V, or in other words, of a part of the cartesian product X^2. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :A graph is also said to be a "planar graph" when we can represent it in the plane without intersection of edges. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Theorem : Let F be the number of faces of a graph (we also count the infinite exterior face), E its number of edges and V its number of vertices. If the graph is planar then : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :F - E + V = 2 (1) :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :which is the relation known as "Euler's formula". :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net JOIN :#lecture :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :We will prove this formula doing an induction on E-V. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :1. The formula is true for E - V = -1 since, in this case, the graph is a tree so it has only one single face, so F = 1, so F - E + V = 1 - (-1) = 2. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :2. Let's take a connected graph contaning at least one cycle G. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :If we remove an edge e to this cycle, we should then be able via induction to apply to G-{e} the same formula if it's correct. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Indeed the graph missing the edge will have f faces, v vertices and a edges and so the formula : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :f - a + v = 2 (2) :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :if we reput the edge then we will write (and the demonstration ends here) : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :(f+1) - (a+1) + s = f - a + s = 2 (3) :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Q.E.D. ;) :Ch4r!rac@i.see.you PRIVMSG #lecture ::P :SysSpider!SysSpider@theNPA-E76EA375.dsl.telepac.pt PRIVMSG #lecture :QUOD ERAT DEMONSTRANDUM :SysSpider!SysSpider@theNPA-E76EA375.dsl.telepac.pt PRIVMSG #lecture :or :SysSpider!SysSpider@theNPA-E76EA375.dsl.telepac.pt PRIVMSG #lecture :quit exiging demonstrations :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D2. The elements of V are the "vertices" of the graph G, those of E are the "edges" of the graph G (indeed, an edge is composed of two vertices, hence the allusion to the pair of elements in the previous definition). :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Note : In a "multigraph", the two vertices of an edge can be identical (loop) and two distinct edges can have their two extremities common. A multigraph then does not satisfy the definition D1. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D3. Let e = {x, y} be an edge of G, we say that the vertices x, y that are the "extremities" of the edge of G are "adjacents" or "neighbours" in the graph G, and that the edge e is "incident" to the vertices x and y. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D4. If two edges e and e' have a common extremity, we'll say they're "incident", in other words, that they're independent. :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP JOIN :#lecture :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Note : if e is an edge of G, we will denote by G-e the subgraph of G' = (X, E-{e}). If X' is a subset of X, we will denote by G-X' the subset deprived of the vertices of X'. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D5. What we name "order" of a graph is the number of its vertices. :fallen!fallen@theNPA-358383BF.org JOIN :#lecture :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Note : let G be a graph of order n, the set E must be by definition chosen as subset of the set of the pairs of elements of the set X, so a set (trivial - since a vertex cannot be neighbour to himself) of cardinal : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :n(n-1)/2 (4) :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :As a consequence, there exists : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :2^{n(n-1)/2} (5) :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :possible choices for E and so as many graphs having X for set of vertices. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Some of these graphs, are by the fact that we consider their vertices to be undistinguishable "automorphs". (we'll define that later) :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net JOIN :#lecture :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :The obtained result means that there exists about 2 millions of graphs with 7 vertices, and something like 4*10^{105} graphs with 27 vertices - number to be compared with the fact that we estimate at less than 10^{100} the number of atoms in the universe. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D6. The "neighbourhood" of a vertex is the set of its neighbours. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D7. We call "degree" of a vertex, the number of its vertices, which is also the number of edges that are incident to him (a vertex of degree zero being called an "isolate vertex") :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Note : A vertex of degree 1 is called a "pendant vertex" :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Properties (trivial) : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :P1. In a graph, the number of odd vertices is always even. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :P2. A graph having all its vertices of even degree is of odd order (apart from the isolate vertex). :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Note : A "regular graph" is a graph whose all the vertices have the same degree. :lolage!lolage@theNPA-C95E1641.belf.cable.ntl.com JOIN :#lecture :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D8. We will say that a graph G' = (V', E') is a "subgraph" or "induced subgraph" of a graph G = (V, E) when V' included in or equal to V and E' included or equal to E. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D9. A "covering subgraph" of a graph G = (V, E) is a subgraph G = (V, E'), that is to say a subgraph of which are vertices all the vertices of G and whose edges are in E'. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D10. For a graph of order n, there exists two extremal cases for the set of its edges : either the graph has no edge, or all the possible edges able to connect pairwisely two vertices are present. In the latter case the graph is called a "complete graph". :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Note : A complete graph is thus a graph where each vertex is connected to all the others. The complete graph of order n is denoted by K_n (read : K index n). In this graph each vertex is of degree n-1 ("the star of David" is complete only if we join all the vertices together - this way we loose the symmetry of the star but we get a graph K_5). :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D11. A "stable graph" is a subgraph without edge and a "clique" a complete subgraph. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D12. In a graph it is natural to want to move from vertex to vertex following the edges. Such a walk passing through the n vertices is called a "string P_n", or rather a "path" : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :A path is a list P_n = P_k = (x_1, ..., x_k) of vertices such that there exists in the graph one edge between each pair of successive vertices : forall i = 1, ..., k-1 (x_i, x_{i+1}) in E. The length of the path corresponds to the number of browsed edges : k-1. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Note : a path is said to be a "simple path" if each edge of the path is being walked on only once. Hence, we also define a "cycle" : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :C_n = C_{k+1} = (x_1, ..., x_k, x_{k+1}) (6) :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :to be a simple path ending at its starting point such that x_1 = x_{k+1}. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D13. A "simple cycle" is a cycle of whose all the edges are different. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :D14. An "oriented graph" is a graph whose edges have a direction and a way and are then called "arcs" (so opposed to the non-oriented graph). :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Notes : :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :N1. The terms of path and circuit are employed in proper for the oriented graph. For the non-oriented graphs that we manipulate mainly here, we talk of string and cycle. However the formal definition is exactly the same in both cases, the only thing that changes is the structure (oriented graph or not) on which they are defined. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :N2. A non-oriented graph is just a symmetric oriented graph. Indeed, if an arc connects the vertex a to the vertex b and another arc connects the vertex b to the vertex a, we then draw only one line between a and b that we call... an edge. :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :Ok, so this ends today's lecture. We'll go on with graph theory (more definitions, properties, theorems and proofs, yay! :) ) next week. :esper!esper@theNPA-456A3540.cable.rstb.cablerocket.net PRIVMSG #lecture :yaay :) :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :w00t :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :But, if you have any questions? :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PRIVMSG #lecture :ACTION applaudes :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :can you make a AL lecture sometime :P :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :ACTION copy-cats int :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :al is? :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :artificial life :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture :huh? :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :ZOMBIES! :D :fallen!fallen@theNPA-358383BF.org PRIVMSG #lecture :artificial means fake belhifet :fallen!fallen@theNPA-358383BF.org PRIVMSG #lecture :=) :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :no it doesn't :O :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :it means man-made :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :ahso :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture :life of artificial intelligent stuff? :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :*sigh* :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :I guess I'll leave this one for you Sys :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture :agents :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i'm so eternally doomed to misunderstandment :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :qwertydawom: i won't have any time for it in my life ;P :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :haha :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i don't even know if vxing will hit the classes or not already :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i'll probably lecture twice in some week :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :well, you're the one covering viruses :p :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :yeah... :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :okay :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :mine's tomorrow :O :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :yeah let me warn everyone :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :yup :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :MY VXING LECTURE ON BOOT SECTOR VIRUSES IS TOMORROW SAME TIME :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :*ahem* :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i politely invite you to come and enjoy my humble teachings :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture ::D :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :ACTION wonders if it's actually the time SysSpider just said.. :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture ::) :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :ACTION slaps Oliverj "9pm GMT" :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture ::P :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :GMT is standard wtf, just take it :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :why CET, EST, in a while we'll end up with ESP! :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net TOPIC #lecture :qwertydawom's [ Syspider's 2nd VXing Lecture - Wednesday 9pm GMT/10pm CST/8pm EST ] :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net TOPIC #lecture :[ Syspider's 2nd VXing Lecture - Wednesday 9pm GMT/10pm CST/8pm EST ] :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net MODE #lecture +o SysSpider :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :make sure those times are right ;P :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :how do you make parts of the topic bold? :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :Ctrl+B :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :ah :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PRIVMSG #lecture :like this :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :cool! :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture ::) :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :or this? :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture ::D :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :yay :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :underline? :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PART #lecture :Leaving :esper!esper@theNPA-456A3540.cable.rstb.cablerocket.net PRIVMSG #lecture :hehe :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net JOIN :#lecture :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :yeah :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :Ctrl+U :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :ctrl + u and ctrl+i do wierd stuff to xchat :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :9,1pfft :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PRIVMSG #lecture :or like this :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :test :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PRIVMSG #lecture :nvm :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PRIVMSG #lecture :>< :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PRIVMSG #lecture :yeah dont press ctrl i :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :7,12muahahaha :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :05woot :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PRIVMSG #lecture :i did so i had to cycle :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture :SysSpider: maybe you should attempt a reverse engineering lecture :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PRIVMSG #lecture :or w/e :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i use Ctrl+B/U/K :esper!esper@theNPA-456A3540.cable.rstb.cablerocket.net PRIVMSG #lecture :!itunes :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture :i know you want to :IceShaman!IceShaman@theNPA-264A2E8B.range86-133.btcentralplus.com PRIVMSG #lecture :yeah :esper!esper@theNPA-456A3540.cable.rstb.cablerocket.net PRIVMSG #lecture :is listening to 05Suteki da ne by 03Nobuo Uematsu, RIKKI :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :belhifet: i'm not the best person to do that, although i'm not bad at it :IceShaman!IceShaman@theNPA-264A2E8B.range86-133.btcentralplus.com PRIVMSG #lecture :that lecture just killed my brain :IceShaman!IceShaman@theNPA-264A2E8B.range86-133.btcentralplus.com PRIVMSG #lecture :cheers anyway qwertydawom :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :lol :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :11 yay 11 :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :you're welcome :) :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture :!!!!!!!!!!! :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP MODE #lecture +C :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture :NOBUO! :IceShaman!IceShaman@theNPA-264A2E8B.range86-133.btcentralplus.com PRIVMSG #lecture :hmm I apparently have to study a book on decision maths in the next 6 weeks :IceShaman!IceShaman@theNPA-264A2E8B.range86-133.btcentralplus.com PRIVMSG #lecture :go me! :qwertydawom!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :noez@ :Oliverj!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :ACTION is a fag! :Oliverj!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :ACTION is an inveterate fag! :phew!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :shut up :phew!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture ::P :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture ::D :phew!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :ACTION registers oliverj :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i could change anyway :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :enough time to say that :Brainkiller!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture : hmm I apparently have to study a book on decision maths in the next 6 weeks --> why? :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :mwahahaha! :Brainkiller!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :oh, btw :Brainkiller!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net PRIVMSG #lecture :off to #binaryuniverse now :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i'll stay here monitoring their quitting :IceShaman!IceShaman@theNPA-264A2E8B.range86-133.btcentralplus.com PRIVMSG #lecture :Brainkiller, so I pass maths? :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i'll kick everyone rather :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :easier *yawn* :Oliverj!D3X73R@theNPA-33EAA028.mem.bellsouth.net PRIVMSG #lecture :i own jooz. :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP MODE #lecture +k noiownj00 :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture : /killall? :qwertydawom!qwertydawo@theNPA-F1A64CEF.fbx.proxad.net KICK #lecture Oliverj :Who is "jooz"? :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP KICK #lecture qwertydawom :SysSpider :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP KICK #lecture SysSpider :SysSpider :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture : /killall -9? :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP JOIN :#lecture :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :o.O :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :wtf :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture ::P :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :WHO DID THAT! :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PRIVMSG #lecture :you obviously :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :no, sajoining me :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :or something like that :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i kicked everyone, including me and qwerty :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :and set a key so we wouldn't auto rejoin :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :*sigh* :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PRIVMSG #lecture :i'll just follow the traditional way -.- :SysSpider!SysSpider@B295BC5B.323B86CA.1FCA0619.IP PART #lecture :Free the weed! :intimidat0r!intimidat0@theNPA-2248BF14.nwrk.east.verizon.net PART #lecture :Leaving :mu-tiger!mu@theNPA-B3EE7147.cable.mindspring.com PART #lecture :belhifet!doa@theNPA-6AE9BEDB.adsl.forthnet.gr PART #lecture :Leaving