Dwelling or duelling in possibilities: how (Ir)relevant are African feminisms?

In its four decades of rebirth, the world has debated (enough) the relevance of feminism, but there is, surprisingly, refreshingly emergent dimensions at the turn of the twenty-first century: feminisms from feminism flowing from Africa. The theories or models of Womanism, Stiwanism, Motherism, and Nego-feminism, with their underlying assumptions and values,were all born at various end times of the twentieth century with a common objective of seeking gender justice. This paper examines the crucial question of how relevant these models are to the global practice of woman as human. What propels their separateness, and why didn‘t they combine to make a more solid stance on the plight of the African woman? In fact, why can‘t they simply identify with the general feminism? Put differently, are they dwelling in the same terrain or are they separable and easily recognisable discourses duelling in possibilities for the woman in Africa in particular and the woman of the globe in general? More specifically, how (ir)relevant are African feminisms?In trying to answer these questions, the paper presents a critical review of the afore-mentioned theories of African feminisms with the goal of providing readers an understanding of what is new in each model, and what is similar or different between the various strands of African feminisms. The paper concludes with the author‘s analysis of the model that holds the best promise or possibilities for African feminism to achieve its seemingly elusive goal of gender equality

Portrait of Professor Breidenbaugh

People often do not see what is right in front of them; objects that are passed by everyday are often unnoticed. People are not necessarily unobservant, but are probably more absorbed with their own activities. One object that is hidden in plain sight on the Gettysburg College campus is the portrait of Professor Edward S. Breidenbaugh that hangs in the Science Center. The name Breidenbaugh is commonly known amongst the students at Gettysburg because of the building in his name, Breidenbaugh Hall. However, the history behind Breidenbaugh and his portrait is not as commonly known as the name, but is important in understanding his influence at Gettysburg College. [excerpt] Course Information: Course Title: HIST 300: Historical Method Academic Term: Fall 2006 Course Instructor: Dr. Michael J. Birkner \u2772 Hidden in Plain Sight is a collection of student papers on objects that are hidden in plain sight around the Gettysburg College campus. Topics range from the Glatfelter Hall gargoyles to the statue of Eisenhower and from historical markers to athletic accomplishments. You can download the paper in pdf format and click View Photo to see the image in greater detail.https://cupola.gettysburg.edu/hiddenpapers/1013/thumbnail.jp

Noisy Subspace Clustering via Thresholding

We consider the problem of clustering noisy high-dimensional data points into a union of low-dimensional subspaces and a set of outliers. The number of subspaces, their dimensions, and their orientations are unknown. A probabilistic performance analysis of the thresholding-based subspace clustering (TSC) algorithm introduced recently in [1] shows that TSC succeeds in the noisy case, even when the subspaces intersect. Our results reveal an explicit tradeoff between the allowed noise level and the affinity of the subspaces. We furthermore find that the simple outlier detection scheme introduced in [1] provably succeeds in the noisy case.Comment: Presented at the IEEE Int. Symp. Inf. Theory (ISIT) 2013, Istanbul, Turkey. The version posted here corrects a minor error in the published version. Specifically, the exponent -c n_l in the success probability of Theorem 1 and in the corresponding proof outline has been corrected to -c(n_l-1

Detecting and Refactoring Operational Smells within the Domain Name System

The Domain Name System (DNS) is one of the most important components of the Internet infrastructure. DNS relies on a delegation-based architecture, where resolution of names to their IP addresses requires resolving the names of the servers responsible for those names. The recursive structures of the inter dependencies that exist between name servers associated with each zone are called dependency graphs. System administrators' operational decisions have far reaching effects on the DNSs qualities. They need to be soundly made to create a balance between the availability, security and resilience of the system. We utilize dependency graphs to identify, detect and catalogue operational bad smells. Our method deals with smells on a high-level of abstraction using a consistent taxonomy and reusable vocabulary, defined by a DNS Operational Model. The method will be used to build a diagnostic advisory tool that will detect configuration changes that might decrease the robustness or security posture of domain names before they become into production.Comment: In Proceedings GaM 2015, arXiv:1504.0244

The hitting time of rainbow connection number two

In a graph $G$ with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number of colours required to colour the edges of $G$ so that every pair of vertices is joined by at least one rainbow path is called the rainbow connection number $rc(G)$ of the graph $G$. For any graph $G$, $rc(G) \ge diam(G)$. We will show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ close to the diameter 2 threshold, with high probability if $diam(G)=2$ then $rc(G)=2$. In fact, further strengthening this result, we will show that in the random graph process, with high probability the hitting times of diameter 2 and of rainbow connection number 2 coincide.Comment: 16 pages, 2 figure