Crispy Critters and Earning Your Stripes

A sergeant in Vietnam leads his squad to recover the bodies from a downed chopper. Articles, stories, and other compositions in this archive were written by participants in the Mighty Pen Project. The program, developed by author David L. Robbins, and in partnership with Virginia Commonwealth University and the Virginia War Memorial in Richmond, Virginia, offers veterans and their family members a customized twelve-week writing class, free of charge. The program encourages, supports, and assists participants in sharing their stories and experiences of military experience so both writer and audience may benefit

A time for learning: representations of time and the temporal dimensions of learning through the lifecourse

Based on findings from a large-scale longitudinal study into the learning biographies of adults, this paper focuses on the different representations of time in the interview data. The paper discusses three such representations: chronological time, narrative time, and generational time. The authors show how different notions of time operate within the construction of life stories. They also analyse the ways in which different representations of time impact upon and serve as resources for reflection on and learning from life, thus contributing to understanding the complex relationships between biography, life and time. (DIPF/Orig.)

SYSTEMATIC AND UNSYSTEMATIC RISK OF RATES OF RETURN ASSOCIATED WITH SELECTED FOREST PRODUCTS COMPANIES

Resource /Energy Economics and Policy, Risk and Uncertainty,

Practical and Efficient Split Decomposition via Graph-Labelled Trees

Split decomposition of graphs was introduced by Cunningham (under the name join decomposition) as a generalization of the modular decomposition. This paper undertakes an investigation into the algorithmic properties of split decomposition. We do so in the context of graph-labelled trees (GLTs), a new combinatorial object designed to simplify its consideration. GLTs are used to derive an incremental characterization of split decomposition, with a simple combinatorial description, and to explore its properties with respect to Lexicographic Breadth-First Search (LBFS). Applying the incremental characterization to an LBFS ordering results in a split decomposition algorithm that runs in time $O(n+m)\alpha(n+m)$, where $\alpha$ is the inverse Ackermann function, whose value is smaller than 4 for any practical graph. Compared to Dahlhaus' linear-time split decomposition algorithm [Dahlhaus'00], which does not rely on an incremental construction, our algorithm is just as fast in all but the asymptotic sense and full implementation details are given in this paper. Also, our algorithm extends to circle graph recognition, whereas no such extension is known for Dahlhaus' algorithm. The companion paper [Gioan et al.] uses our algorithm to derive the first sub-quadratic circle graph recognition algorithm

Examining the Warm Handoff in Rural Integrated Care

An ever-growing body of evidence supports the efficacy of integrated care as a treatment approach; however, less is known about what specific components of integrated care are most effective. This is especially true of warm handoffs, which are an often discussed but understudied process in integrated care. A total of 246 patient charts were reviewed to determine if type of referral (warm handoff or traditional) increased the likelihood of follow-up with behavioral health services as well as factors that might impact this relationship. There were no significant differences between type of referral and likelihood of follow-up with behavioral health services. Only previous number of visits with referring provider significantly increased the likelihood of patients attending a subsequent behavioral health appointment. More research is needed to better understand the efficacy, if any, of the warm handoff as a component of integrated care

Information Flow in Logics in the Vicinity of BB

Situation theory, and channel theory in particular, have been used to provide motivational accounts of the ternary relation semantics of relevant, substructural, and various non-classical logics. Among the constraints imposed by channel-theory, we must posit a certain existence criterion for situations which result from the composites of multiple channels (this is used in modeling information flow). In associative non-classical logics, it is relatively easy to show that a certain such condition is met, but the problem is trickier in non-associative logics. Following Tedder (2017), where it was shown that the conjunction-conditional fragment of the logic B admits the existence of composite channels, I present a generalised ver- sion of the previous argument, appropriate to logics with disjunction, in the neighbourhood ternary relation semantic framework. I close by suggesting that the logic BB+(^I), which falls between Lavers' system BB+ and B+ , satisfies the conditions for the general argument to go through (and prove that it satisfies all but one of those conditions)

Crashing an Officers-Only Cav Party

Thirty years after Vietnam, an enlisted man attends a reunion intended only for the officer fliers of his troop. He finds a warm welcome, and learns, again, that all warriors are a band of brothers. Articles, stories, and other compositions in this archive were written by participants in the Mighty Pen Project. The program, developed by author David L. Robbins, and in partnership with Virginia Commonwealth University and the Virginia War Memorial in Richmond, Virginia, offers veterans and their family members a customized twelve-week writing class, free of charge. The program encourages, supports, and assists participants in sharing their stories and experiences of military experience so both writer and audience may benefit