Training future hybrid nonprofit social enterprise leaders: a research-based instructional needs analysis

Nonprofit social enterprises (NSEs) seek to address societal problems through for-profit ventures. Because they pursue social and commercial goals, these organizations have great potential to solve social and environmental issues more efficiently and effectively. Given their unique purpose and challenges, NSEs require a different type of leadership than traditional nonprofit organizations, a distinctive competency model with specialized social work and business management training. Research has shown, however, that finding leaders with this necessary mix for effective management poses a challenge for such organizations. This exploratory study aimed to examine the extent to which MPA (i.e., master’s degree in public administration) and MNM (i.e., master’s degree in nonprofit management) preparatory programs include the primary NSE leadership competencies in their curricula. The researcher developed an NSE leadership competency survey from the literature and distributed it to 250 MPA and MNM faculty and administrators employed at various public and private universities. Data analysis techniques included descriptive statistics, t tests, and bivariate correlations, showing neither program type focuses strongly on teaching NSE leadership competencies. MNM programs and private universities cover several well and more extensively than MPA programs and public universities. Findings highlight pedagogical enhancement opportunities for MPA and MNM NSE leadership preparation programs at public and private universities

Overgroups of the Automorphism Group of the Rado Graph

We are interested in overgroups of the automorphism group of the Rado graph. One class of such overgroups is completely understood; this is the class of reducts. In this article we tie recent work on various other natural overgroups, in particular establishing group connections between them and the reducts.Comment: 11 pages, 2 figure

Ramsey precompact expansions of homogeneous directed graphs

In 2005, Kechris, Pestov and Todorcevic provided a powerful tool to compute an invariant of topological groups known as the universal minimal flow, immediately leading to an explicit representation of this invariant in many concrete cases. More recently, the framework was generalized allowing for further applications, and the purpose of this paper is to apply these new methods in the context of homogeneous directed graphs. In this paper, we show that the age of any homogeneous directed graph allows a Ramsey precompact expansion. Moreover, we verify the relative expansion properties and consequently describe the respective universal minimal flows

Convex sublattices of a lattice and a fixed point property

The collection CL(T) of nonempty convex sublattices of a lattice T ordered by bi-domination is a lattice. We say that T has the fixed point property for convex sublattices (CLFPP for short) if every order preserving map f from T to CL(T) has a fixed point, that is x > f(x) for some x > T. We examine which lattices may have CLFPP. We introduce the selection property for convex sublattices (CLSP); we observe that a complete lattice with CLSP must have CLFPP, and that this property implies that CL(T) is complete. We show that for a lattice T, the fact that CL(T) is complete is equivalent to the fact that T is complete and the lattice of all subsets of a countable set, ordered by containment, is not order embeddable into T. We show that for the lattice T = I(P) of initial segments of a poset P, the implications above are equivalences and that these properties are equivalent to the fact that P has no infinite antichain. A crucial part of this proof is a straightforward application of a wonderful Hausdor type result due to Abraham, Bonnet, Cummings, Dzamondja and Thompson [2010]

Siblings of an ℵ0-categorical relational structure

A sibling of a relational structure $R$ is any structure $S$ which can be embedded into $R$ and, vice versa, such that $R$ can be embedded into $S$. Let $\operatorname{sib}(R)$ be the number of siblings of $R$, these siblings being counted up to isomorphism. Thomassé conjectured that for countable relational structures made of at most countably many relations, $\operatorname{sib}(R)$ is either one, countably infinite, or the size of the continuum; but even showing the special case $\operatorname{sib}(R)1$ is one or infinite is unsettled when $R$ is a countable tree. We prove that if $R$ is countable and $\aleph_{0}$-categorical, then indeed $\operatorname{sib}(R)$ is one or infinite. Furthermore, $\operatorname{sib}(R)$ is one if and only if $R$ is finitely partitionable in the sense of Hodkinson and Macpherson [14]. The key tools in our proof are the notion of monomorphic decomposition of a relational structure introduced in [35] and studied further in [23], [24], and a result of Frasnay [11]

Weather, Rangeland Practices and North Central Oklahoma Poor Condition Tallgrass Prairie Regrowth After Grazing

The term "poor condition" as used in the title and throughout this manuscript. does not reflect the management ability of the owner but rather a term defining an ecological successional stage. However, there is no documental evidence that the existing forage quality and annual forage consistency are not the most appropriate for the current land use of the area.Agronom

Tragedy of the routing table: An analysis of collective action amongst Internet network operators

S.M. thesisThis thesis analyzes and discusses the effectiveness of social efforts to achieve collective action amongst Internet network operators in order to manage the growth of the Internet routing table. The size and rate of growth of the Internet routing table is an acknowledged challenge impeding the scalability of our BGP interdomain routing architecture. While most of the work towards a solution to this problem has focused on architectural improvements, an effort launched in the 1990s called the CIDR Report attempts to incentivize route aggregation using social forces and norms in the Internet operator community. This thesis analyzes the behavior of Internet network operators in response to the CIDR Report from 1997 to 2011 to determine whether the Report was effective in achieving this goal. While it is difficult to causally attribute aggregation behavior to appearance on the CIDR report, there is a trend for networks to improve their prefix aggregation following an appearance on the CIDR Report compared to untreated networks. This suggests that the CIDR Report did affect network aggregation behavior, although the routing table continued to grow. This aggregation improvement is most prevalent early in the study period and becomes less apparent as time goes on. Potential causes of the apparent change in efficacy of the Report are discussed and examined using Ostrom s Common Pool Resource framework. The thesis then concludes with a discussion of options for mitigating routing table growth, including the continued use of community forces to better manage the Internet routing table.S.M