Adam Maus – Page 4

GET/POST to a URL in Python

A relatively simple and straightforward way to post information to a server using Python

May 8, 2011
Modelling Sensitivity using Neural Networks

Artificial neural networks can be applied to the delayed Henon map and shown to replicate the sensitivities of the map surprisingly well.

April 20, 2011
Inverted Delayed Henon Map

Inverting the delayed Henon map yields a repellor whose sensitivities can be explored.

April 9, 2011
Delayed Henon Map Sensitivities

Partial derivatives can be used to explore how sensitive the output of a function is to perturbations in each of the time lags.

April 2, 2011
Subgraph Centrality

Subgraph Centrality: Accounts for the participation of a node in all subgraphs of the network

March 28, 2011
Freeman’s Approach to Degree Centrality

Freeman’s Approach to Degree Centrality: Centrality is based on connections between nodes in the network

March 28, 2011
Closeness Centrality

Closeness Centrality: Nodes with short geodesic (shortest path between two nodes) distances to other nodes tend to have higher closeness

March 28, 2011
Bonacich’s Centrality

Bonacich’s Approach to Centrality (also known as Eigenvector Centrality): You are more central when there are more connections within your local network

March 28, 2011
Betweenness Centrality

Betweenness Centrality: The higher a node’s centrality is the more “dependent” other nodes are on it

March 28, 2011
Estimate Henon Map’s Largest Lyapunov Exponent in C

I have been experimenting with C since I have not had as much exposure to the language since college and I recently built a computer with a CUDA-enabled graphics card that I hope to use for my research.

March 28, 2011