#Jessica Bartram

[tfg5]

[xlntwtch2]

from jessicabartram.ca

"Jessica Bromley Bartram is an illustrator, graphic designer, and ceramic artist who lives in Ottawa. With all of her creative pursuits, she’s interested in process, collaboration, and communication, and enjoys experimenting with different mediums throughout the creative process...."

Jessica Bartram

[1-ufo]

OK, then! Richard Mayhew — Matt Bellamy. Door — Taylor Momsen (of the Pretty Reckless). Mr. Croup — Ralph Fiennes. Mr. Vandemar — Dave Bautista. Jessica Bartram — Kate Hudson. The Marquis de Carabas — Daveed Diggs. Old Bailey — Alan Arkin. Lord Portico — Daniel Craig. Varney — Robert Maillet. Anastasia — Rosalie Chiang. Hunter — Naomie Harris. Islington — Eliot Page. Lear — Russell Brand. The Earl of Earl’s Court — Stephen Fry. Serpentine — Michelle Yeoh. (cont’d)

(cont’d) The Abbot of the Black Friars — Morgan Freeman. Brother Fuliginous — Donald Glover. Hammersmith — Julius Bjornsson. Lamia — Laysla de Oliveira

Cool!

[thefandomgamesfour]

[4panel]

[torontocomics]

DEBUTING AT TCAF 2018 - 4PANEL 2 by Various Artists

In the pages of 4PANEL 2, artists Jessica Bartram, Jonathan Dyck, Drazen Kozjan, Hartley Lin, Erik Nebel, Samplerman and Fiona Smyth explore the 4PANEL strip form in unique and beautiful ways, each presenting a collection of new strips in a self-contained section of the book.

In all ways an expansion on its predecessor, the massive 4PANEL 2 anthology demonstrates the ability of individual creators to artistically test the generative nature of the constraint-based 4PANEL template; the wonderful works filling up this book display a range of visual and representational styles, and of visual and narrative structures — and, happily, the resulting sections these seven contributors offer up could not be more different!

Exhibiting Creator: Jonathan Dyck, Hartley Lin, Fiona Smyth Publisher: Popnoir Editions Price: $22 CAD

[thefandomgamesfive]

[jbbartram-illu]

Today is my birthday (hooray!), so I’m celebrating by posting a sneak peek of the inside of Charles, the book I illustrated for Fitzhenry & Whiteside!

Here’s the description from the publisher:

“Charles is a remarkable baby crow who has lost his mother. This is his story, and the story of his rescuer, intermixed with the story of some strawberries they shared. At times funny and whimsical, it is also a story of the power of the natural world and the ties of love that are never broken. In writing the story, Hume was inspired by his memories of taking care of an injured crow when he was growing up on a farm. Jessica Bartram's classic illustrations amply reflect the grace and timelessness of this tale.“

Charles is available in independent bookstores in Canada (and some Chapters/Indigo locations), as well as online via Indigo and Amazon.

[thefandomgamesthreeboot]

[inprnt]

"Under the Earth" by Jessica Bartram on INPRNT

[ylove-bandaesthetics]

Richard Mayhew — Matt Bellamy, circa The Resistance. Door — Taylor Momsen. Mr. Croup — Ralph Fiennes. Mr. Vandemar — Dave Bautista. Jessica Bartram — Kate Hudson. The Marquis de Carabas — Daveed Diggs. Old Bailey — Alan Arkin. Anastasia — Emilia Jones. Lord Portico — Daniel Craig. Varney — Robert Maillet. Hunter — Naomie Harris. Islington — Blake Lively. Lear — Russell Brand. The Earl of Earl’s Court — Stephen Fry. Clarence — Lil Nas X. Serpentine — Michelle Yeoh. (cont'd)

(cont'd) The Abbot of the Black Friars — Morgan Freeman. Brother Fuliginous — Donald Glover. Dunnikin — Tommy Chong. Lamia — Laysla de Oliveira.

~~~

You have a vivid imagination omg lol! I’ll take your word that this is the best casting for a book like this! And when I do start reading it I’ll come back to this list and imagine them all as their chatacters! ✨

[kaygun]

A Clique Analysis of Quakers in early modern Britain (1500-1700)

A description of the problem

Today, I am going to re-implement in clojure a part of a networking analysis done by John R. Ladd, Jessica Otis, Christopher N. Warren, and Scott Weingart titled "Exploring and Analyzing Network Data with Python" at Programming Historian. The original analysis is done with python using networkx. I am going to re-implement the part of the analysis about finding maximum cliques within the network. I am going to use JGraphT which is as extensive as networkx in its functionality. The rest of the analysis can too be repeated within clojure.

Data

The network data is from the Six Degrees of Francis Bacon project. Project aims to show and analyze the social networks of early modern Britain (1500-1700). The dataset composed of pairs of important Quaker figures that know each other. The data is culled from the Oxford Dictionary of National Biography. I collected two files: a list of nodes and a list of edges from Programming Historian.

Here is a small sample from the nodes list:

Name, Historical Significance, Gender, Birthdate, Deathdate, ID Joseph Wyeth, religious writer, male, 1663, 1731, 10013191 Alexander Skene of Newtyle, local politician and author, male, 1621, 1694, 10011149 James Logan, colonial official and scholar, male, 1674, 1751, 10007567 Dorcas Erbery, Quaker preacher, female, 1656, 1659, 10003983 Lilias Skene, Quaker preacher and poet, male, 1626, 1697, 10011152

and a sample from the edge list:

Source, Target George Keith, Robert Barclay George Keith, Benjamin Furly George Keith, Anne Conway Viscountess Conway and Killultagh George Keith, Franciscus Mercurius van Helmont George Keith, William Penn George Keith, George Fox George Keith, George Whitehead George Keith, William Bradford James Parnel, Benjamin Furly James Parnel, Stephen Crisp Peter Collinson, John Bartram Peter Collinson, James Logan

The Code

Preamble

I am going to use JGraphT, and it needs to declared in the list of dependencies. Here's my deps.edn dependencies:

{ :deps {org.jgrapht/jgrapht-ext {:mvn/version "1.5.1"} org.jgrapht/jgrapht-opt {:mvn/version "1.5.1"} org.jgrapht/jgrapht-io {:mvn/version "1.5.1"} org.jgrapht/jgrapht-core {:mvn/version "1.5.1"}} :mvn/repos { "central" {:url "https://repo1.maven.org/maven2/"} "clojars" {:url "https://repo.clojars.org/"}}}

Next, the namespace:

(ns quakers (:require [clojure.set :as s]) (:require [clojure.java.io :as io]) (:import [java.io File]) (:import [org.jgrapht.alg.clique BronKerboschCliqueFinder]) (:import [org.jgrapht.alg.scoring PageRank]) (:import [org.jgrapht.graph DefaultEdge SimpleGraph DefaultEdge]))

Let me start by a utility code that reads the necessary file and converts into a usable sequence:

(defn from-file [file processor] (->> file File. io/reader line-seq (map processor) rest))

#'quakers/from-file

Let us first ingest the nodes. For this analysis, I care only about the names. So, I'll ingest just those. Instead of showing the whole list, I'll show the first 5 names.

(def nodes (from-file "quakers_nodelist.csv" #(-> % (clojure.string/split #",") first))) (->> nodes (take 5) (into []))

#'quakers/nodes ["Joseph Wyeth" "Alexander Skene of Newtyle" "James Logan" "Dorcas Erbery" "Lilias Skene"]

Next, I'll ingest the edges which are pairs of nodes. As before, I'll show only the first 5:

(def edges (from-file "quakers_edgelist.csv" #(-> % (clojure.string/split #",")))) (->> edges (take 5) (into []))

#'quakers/edges [["George Keith" "Robert Barclay"] ["George Keith" "Benjamin Furly"] ["George Keith" "Anne Conway Viscountess Conway and Killultagh"] ["George Keith" "Franciscus Mercurius van Helmont"] ["George Keith" "William Penn"]]

Now, I'll construct the graph.

(def graph (SimpleGraph. DefaultEdge)) (doseq [x nodes] (.addVertex graph x)) (doseq [[x y] edges] (.addEdge graph x y))

#'quakers/graph

Maximal cliques

The next step is to calculate the maximal cliques within the network and list them:

(def result (->> graph BronKerboschCliqueFinder. .maximumIterator iterator-seq (map seq) (into []))) result

#'quakers/result [("Edward Burrough" "George Fox" "John Crook" "William Dewsbury") ("Edward Burrough" "George Fox" "John Crook" "John Perrot") ("James Nayler" "Edward Burrough" "George Fox" "Francis Howgill") ("James Nayler" "Edward Burrough" "George Fox" "Thomas Ellwood") ("James Nayler" "Edward Burrough" "George Fox" "John Perrot") ("William Penn" "George Fox" "George Keith" "George Whitehead") ("Benjamin Furly" "William Penn" "George Fox" "George Keith") ("James Nayler" "Richard Farnworth" "Margaret Fell" "Anthony Pearson")]

There are 8 maximal cliques each with 4 names in them:

[(count result) (map count result)]

[8 (4 4 4 4 4 4 4 4)]

PageRank

In this part of the post, I'll do something different. Let me apply the PageRank algorithm to this network to find the important nodes. As before, I'll display the top 5 nodes.

(def result2 (->> graph PageRank. .getScores (into {}) (sort-by second) reverse)) (->> result2 (map first) (take 5) (into []))

#'quakers/result2 ["George Fox" "William Penn" "James Nayler" "George Whitehead" "Margaret Fell"]

[eyeballapproved]

Jessica Bartram

[boudhabar]

Jessica Bartram

[marielashlinn]

The beginnings of my new project Pixie Dream Ghoul is available on Etsy! Pixie Dream Ghoul is a multi-issue zine project that explores spooky themes and the intersections of identity and the supernatural, dreams, rituals, spells and stories.

Issue 1 explores the creators relationship with witchcraft and features writing and art by:

Catherine Belshaw Samantha Lapierre Sora (cfmss) Kat Jetté Jessica Bromley Bartram Magida El-Kassis Mathilda Gustavsson and Mariel Ashlinn Kelly (me)

Issue 2 will come out in the fall and the theme is “Haunted” if you’d like to submit writing or art email me with the subject line PDG2 - the deadline for Haunted submissions is September 1, 2017. Finished books are 4.75 x 6.5 black and white.

[4panel]