Oklahoman by blood: indigenous land tenure from Indian Territory to McGirt

After the McGirt v. Oklahoma decision in 2020, Oklahoma’s statehood became the subject of intense legal scrutiny regarding the supposed “disestablishment” of American Indian reservations. The State’s position follows a playbook all too familiar to citizens of Indian Country, resurfacing antiquated beliefs about what it means to be a tribal citizen and misrepresenting the historical forces that animate Oklahoma’s statehood movements. Writing with historians, Indigenous people, and interdisciplinary scholarship, this thesis will incorporate the analytical tools of Critical Indigenous Studies alongside archival and empirical methodologies. This thesis contextualizes Oklahoma’s tribal-state governance dynamic as a contest for land, resources, and life made possible by the logic of settler colonialism and white nationalism instrumental in both contemporary and historic struggles for American Indian legal and political recognition. To do this, I look at the contested history of Indigenous land tenure in Oklahoma beginning with Charles Page and the establishment of Sand Springs in chapter two, followed by the enmeshment of blood politics and internalized colonialism in chapter three, and ending chapter four with an analysis of three distinct statehood movements preceding Oklahoma’s entrance to the United States

Newspaper advertising, Retail Pricing Practices, and Gross Retail Margins for Turkeys in Selected Utah and Other U. S. Markets for Various Years and Seasons

Newspaper advertising and retail pricing practices for turkeys were ascertained and gross retail margins established for three Utah markets, 1955 to 1966, and for 12 other selected U. S. markets, 1965 and 1966. Turkey was extensively used as an advertised special item, particularly in holiday seasons. Food retailing organizations advertised turkey at low prices and margins at Thanksgiving and Christmas when consumer demand for turkey is traditionally strong. Prior to these holidays, food retailing organizations in a market simultaneously advertised turkey at identical prices and with little product differentiation thus limiting the effectiveness of turkey as an advertised item to gain competitive advantage for a food retailer

LaserTank is NP-complete

We show that the classical game LaserTank is $\mathrm{NP}$-complete, even when the tank movement is restricted to a single column and the only blocks appearing on the board are mirrors and solid blocks. We show this by reducing $3$-SAT instances to LaserTank puzzles.Comment: 5 page

Is DEET safe for children?

Reported evidence suggests that DEET use is safe for children older than 2 months, with only very rare incidence of major adverse effects (strength of recommendation [SOR]: C). Typically, a topical concentration between 10% and 30% should be used (SOR: C). Increasing DEET concentration does not improve protection, but does increase the duration of action (SOR: A)

Finding community structure in very large networks

The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their computational cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O(m d log n) where d is the depth of the dendrogram describing the community structure. Many real-world networks are sparse and hierarchical, with m ~ n and d ~ log n, in which case our algorithm runs in essentially linear time, O(n log^2 n). As an example of the application of this algorithm we use it to analyze a network of items for sale on the web-site of a large online retailer, items in the network being linked if they are frequently purchased by the same buyer. The network has more than 400,000 vertices and 2 million edges. We show that our algorithm can extract meaningful communities from this network, revealing large-scale patterns present in the purchasing habits of customers

Do Pine Trees in Aspen Stands Increase Bird Diversity

In the Black Hills of South Dakota, quaking aspen (Populus tremuloides) is being replaced by conifers through fire suppression and successional processes. Al- though the Black Hills National forest is removing conifers (primarily ponderosa pine [Pinus ponderosa])toincreasetheaspencommunitiesinsomemixedstands,ForestPlan guidelines allow four conifers per hectare to remain to increase diversity in the remaining aspen stand. We compared bird species richness in pure ponderosa pine, mixed stands dominated by ponderosa pine with quaking aspen, mixed stands dominated by aspen with ponderosa pine, and pure aspen stands. Stands dominated by ponderosa pine had lower (

Coexistence of opposite opinions in a network with communities

The Majority Rule is applied to a topology that consists of two coupled random networks, thereby mimicking the modular structure observed in social networks. We calculate analytically the asymptotic behaviour of the model and derive a phase diagram that depends on the frequency of random opinion flips and on the inter-connectivity between the two communities. It is shown that three regimes may take place: a disordered regime, where no collective phenomena takes place; a symmetric regime, where the nodes in both communities reach the same average opinion; an asymmetric regime, where the nodes in each community reach an opposite average opinion. The transition from the asymmetric regime to the symmetric regime is shown to be discontinuous.Comment: 14 pages, 4 figure

Finding and evaluating community structure in networks

We propose and study a set of algorithms for discovering community structure in networks -- natural divisions of network nodes into densely connected subgroups. Our algorithms all share two definitive features: first, they involve iterative removal of edges from the network to split it into communities, the edges removed being identified using one of a number of possible "betweenness" measures, and second, these measures are, crucially, recalculated after each removal. We also propose a measure for the strength of the community structure found by our algorithms, which gives us an objective metric for choosing the number of communities into which a network should be divided. We demonstrate that our algorithms are highly effective at discovering community structure in both computer-generated and real-world network data, and show how they can be used to shed light on the sometimes dauntingly complex structure of networked systems.Comment: 16 pages, 13 figure

Comparing community structure identification

We compare recent approaches to community structure identification in terms of sensitivity and computational cost. The recently proposed modularity measure is revisited and the performance of the methods as applied to ad hoc networks with known community structure, is compared. We find that the most accurate methods tend to be more computationally expensive, and that both aspects need to be considered when choosing a method for practical purposes. The work is intended as an introduction as well as a proposal for a standard benchmark test of community detection methods.Comment: 10 pages, 3 figures, 1 table. v2: condensed, updated version as appears in JSTA