Alphascript publishing nov 2010 (3 resultados)

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online.TheAtkinson-Shiffrin model (also known as the Multi-store modelMulti-memory model and the Modal model) is a psychological modelproposed in 1968 by Richard Atkinson and Richard Shiffrin as a proposalfor the structure of memory. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Batman: Battle for the Cowl is a three issue comic book limited series published by DC Comics. Written and penciled by Tony Daniel, the story details the chaos in Gotham City after Batman R.I.P. and Final Crisis due to Batman's perceived absence and abandonment by the public. His disappearance is actually caused by the character's apparent death at the hands of Darkseid in Final Crisis, which causes dissension in the ranks of his allies and enemies who fight for the right to become the new Batman. Englisch.…

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics, a distance-regular graph is a regular graph such that for any two vertices v and w at distance i the number of vertices adjacent to w and at distance j from v is the same. Every distance-transitive graph is distance regular. Indeed, distance-regular graphs were introduced as a combinatorial generalization of distance-transitive graphs, having the numerical regularity properties of the latter without necessarily having a large automorphism group. Alternatively, a distance-regular graph is a graph for which there exist integers bi,ci,i=0.,d such that for any two vertices x,y in G and distance i=d(x,y), there are exactly ci neighbors of y in Gi-1(x) and bi neighbors of y in Gi+1(x), where Gi(x) is the set of vertices y of G with d(x,y)=i (Brouwer et al. 1989, p. 434). The array of integers characterizing a distance-regular graph is known as its intersection array. A distance-regular graph with diameter 2 is strongly regular, and conversely (unless the graph is disconnected). Englisch.…