Agent-Based Modelling
Piper Jackson
PhD Candidate
Software Technology Lab
School of Computing Science
Simon Fraser University
History
Von Neumann machines:
Self-reproducing
Cellular Automata
Object oriented programming (OOP)
Example: Boids
Simple age
COMMUTATIVE ALGEBRA, FALL 2013
ASSIGNMENT 3 SOLUTIONS
(1) Suppose a T and r R with the property that f (r)a = af (r). Consider then
(f
f () )(r). By equation 5.2 this would be af (r), but for f to be a homomorphism
it must also equal f (r) (since is a co
COMMUTATIVE ALGEBRA, FALL 2013
ASSIGNMENT 2
(1) When I is the trivial order, the there is no compatibility condition because there is
no i j I. Thus being a compatible system just means being a family fi : Ai C.
This is exactly the information that a copr
COMMUTATIVE ALGEBRA, FALL 2013
ASSIGNMENT 1 SOLUTIONS
(1) We need to assume L has a 0, but we shouldnt have the 0 condition in the denition
of lter; instead the question should ask that every proper lter is contained in an
ultralter.
Let F be a proper lte
Alternative Axioms for Matroids
Luis Goddyn, September 24, 2013
The following axioms are roughly in order of decreasing importance. A good student
should be able to recall the rst four. Note: In the following we often write S e for S cfw_e.
We write N0 an
Choosability and the Graph Monomial
Luis Goddyn
Here is an outline of results on the usage of the graph monomial in choosability.
Let R be a ring which is a subring of a eld, and let R[x1 , . . . , xn ] be the ring of polynomials over
R in the variables x
Disjoint Spanning Trees
Luis Goddyn
1
Forest Partitioning
A forest in a graph G is a set of edges which induces an acyclic subgraph of G. We say that a set J of
k
edges of a graph G is k-partitionable if J = i=1 Ji is the union of k forests Ji in G. (We m
Modeling of Complex Social
Systems
MATH 800
Fall 2011
Complex Social Systems
A system is a set of elements and relationships
A complex system is a system whose behavior
cannot be easily or intuitively predicted
Complex Social Systems
A system is a set
Bojan Ramadanovic
Alexa van der Waall
Math 800
02nd November 2011
Two distinct models of the
criminal justice system in B.C.
Models in practice
The project
Models for the Ministry of the Attorney General and
the Ministry of Public Safety and Solicitor Gen
Topological Data Analysis
MATH 800
Fall 2011
Topological Data Analysis (TDA)
An -chain is a nite sequence of points x1, ., xn
such that |xi xi+1 | < for all i=1,n-1
x and y are -connected if there is an
Fuzzy Logic and Fuzzy Cognitive Map
MATH 800 4
Fall 2011
Vijay Mago, Postdoctoral Fellow, The Modelling of Complex Social Systems (MoCSSy) Program, The
IRMACS Centre, Simon Fraser University, BC, Canada.
[email protected]
Fuzzy Logic Introduction
Fuzzy Sets
Fu
COMMUTATIVE ALGEBRA, FALL 2013
ASSIGNMENT 4 SOLUTIONS
(1) These two questions end up being quite similar.
Rowen ch8 #2 Let = cfw_s : s S be a set of commuting indeterminates. Let R[] be the
polynomial ring in and let
T = R[]/ ss 1 : s S
Note that the map