Jeannine

She had seen things and experienced a life that I only knew about through the movies. She acted as though she knew I would not be able to understand her, but I could see in her eyes that she hoped I could. Dan Roberts: I was born and raised in Upstate New York, along with my thirteen-year-old brother Matthew and my sister Jeannine. My parents always encouraged us to pursue our passions and at very young ages we were allowed to explore a variety of activities and hobbies that, at the time, seemed interesting to us. No matter how far they had to drive or how long they had to wait, our parents would always support whatever group or organization in which we would involve ourselves. It was through this constant support that I was confident in my decision to come to James Madison University, despite its distance from my childhood home. The minute I stepped onto the campus, I was forced to interact with a population of people that would test my philosophies and methods of thought. As I continued defending my traditions and beliefs, I began to realize that perhaps I did not have such a vise-like grip on issues as I had originally believed. It was at this time that I began to analyze many of the events that had occurred in my life to that point. The opportunity to express my redefined thought process came when Ms. Storey gave her GWRIT 102D students their first assignment. As I was writing the draft to \u27Jeannine,\u27 I was flooded with a stream of memories that I was forced to re-interpret in manners contrasting to those I had used in the past. The problem with memories is that they often present themselves as bits and pieces, and it is not until you understand them that they begin to play out like a motion picture inside your head. The first draft I turned in for the assignment was an example of my struggles with my memory. The revision process forced me to write down all the details that I had not included in my draft. Through this I was able to call upon my memories and convey the thoughts and emotions that I had desired, for memories are not events, but details that make up an event. The revision of \u27Jeannine\u27 was a compilation of details that made up our relationship

[Introduction to] Master American History in 1 Minute a Day

Join acclaimed historian Dan Roberts--known to millions as the voice of the A Moment in Time radio series--on a bite-sized romp through 500 years of American history. With just one minute a day, you can master all the essential facts of America\u27s founding, Civil War, world conflicts, homefront transformations, and more!.https://scholarship.richmond.edu/bookshelf/1372/thumbnail.jp

Newform Eisenstein Congruences of Local Origin

We give a general conjecture concerning the existence of Eisenstein congruences between weight $k\geq 3$ newforms of square-free level $NM$ and weight $k$ new Eisenstein series of square-free level $N$. Our conjecture allows the forms to have arbitrary character $\chi$ of conductor $N$. The special cases $M=1$ and $M=p$ prime are fully proved, with partial results given in general. We also consider the relation with the Bloch-Kato conjecture, and finish with computational examples demonstrating cases of our conjecture that have resisted proof.Comment: 16 page

Constructing integer-magic graphs via the combinatorial nullstellensatz

Let A be a nontrivial additive abelian group and A* = A \ {0}. A graph is A-magic if there exists an edge labeling f using elements of A∗ which induces a constant vertex labeling of the graph. Such a labeling f is called an A-magic labeling and the constant value of the induced vertex labeling is called an A-magic value. In this paper, we use the Combinatorial Nullstellensatz to construct nontrivial classes of Zp-magic graphs, prime p ≥ 3. For these graphs, some lower bounds on the number of distinct Zp-magic labelings are also established

Group-antimagic Labelings of Multi-cyclic Graphs

Let $A$ be a non-trivial abelian group. A connected simple graph $G = (V, E)$ is $A$-\textbf{antimagic} if there exists an edge labeling $f: E(G) \to A \backslash \{0\}$ such that the induced vertex labeling $f^+: V(G) \to A$, defined by $f^+(v) = \Sigma$ $\{f(u,v): (u, v) \in E(G) \}$, is a one-to-one map. The \textit{integer-antimagic spectrum} of a graph $G$ is the set IAM$(G) = \{k: G \textnormal{ is } \mathbb{Z}_k\textnormal{-antimagic and } k \geq 2\}$. In this paper, we analyze the integer-antimagic spectra for various classes of multi-cyclic graphs

Application of the Combinatorial Nullstellensatz to Integer-magic Graph Labelings

Let $A$ be a nontrivial abelian group and $A^* = A \setminus \{0\}$. A graph is $A$-magic if there exists an edge labeling $f$ using elements of $A^*$ which induces a constant vertex labeling of the graph. Such a labeling $f$ is called an $A$-magic labeling and the constant value of the induced vertex labeling is called an $A$-magic value. In this paper, we use the Combinatorial Nullstellensatz to show the existence of $\mathbb{Z}_p$-magic labelings (prime $p \geq 3$ ) for various graphs, without having to construct the $\mathbb{Z}_p$-magic labelings. Through many examples, we illustrate the usefulness (and limitations) in applying the Combinatorial Nullstellensatz to the integer-magic labeling problem. Finally, we focus on $\mathbb{Z}_3$-magic labelings and give some results for various classes of graphs

RHex Slips on Granular Media

RHex is one of very few legged robots being used for realworld rough-terrain locomotion applications. From its early days, RHex has been shown to locomote successfully over obstacles higher than its own hip height [1], and more recently, on sand [2] and sand dunes [3], [4] (see Figure 1). The commercial version of RHex made by Boston Dynamics has been demonstrated in a variety of difficult, natural terrains such as branches, culverts, and rocks, and has been shipped to Afghanistan, ostensibly for use in mine clearing in sandy environments [5]. Here, we discuss recent qualitative observations of an updated research version of RHex [6] slipping at the toes on two main types of difficult terrain: sand dunes and rubble piles. No lumped parameter (finite dimensional) formal model nor even a satisfactory computational model of RHexs locomotion on sand dunes or rubble piles currently exists. We briefly review the extent to which available physical theories describe legged locomotion on flat granular media and possible extensions to locomotion on sand dunes