Administrative Management Capacity in Out-of-School Time Organizations: An Exploratory Study

Based on interviews with sixteen high-quality out-of-school time (OST) program providers, identifies the managerial and administrative needs of OST nonprofits such as financial and human resources management and information technology. Suggests solutions

The Pit

In training, not everyone can handle the stress of throwing a grenade. 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

The Sketching Complexity of Graph and Hypergraph Counting

Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing and other areas. The space complexity of subgraph counting has been studied extensively in the literature, but many natural settings are still not well understood. In this paper we revisit the subgraph (and hypergraph) counting problem in the sketching model, where the algorithm's state as it processes a stream of updates to the graph is a linear function of the stream. This model has recently received a lot of attention in the literature, and has become a standard model for solving dynamic graph streaming problems. In this paper we give a tight bound on the sketching complexity of counting the number of occurrences of a small subgraph $H$ in a bounded degree graph $G$ presented as a stream of edge updates. Specifically, we show that the space complexity of the problem is governed by the fractional vertex cover number of the graph $H$. Our subgraph counting algorithm implements a natural vertex sampling approach, with sampling probabilities governed by the vertex cover of $H$. Our main technical contribution lies in a new set of Fourier analytic tools that we develop to analyze multiplayer communication protocols in the simultaneous communication model, allowing us to prove a tight lower bound. We believe that our techniques are likely to find applications in other settings. Besides giving tight bounds for all graphs $H$, both our algorithm and lower bounds extend to the hypergraph setting, albeit with some loss in space complexity

THE DETERMINANTS OF COUPON DISCOUNTS FOR BREAKFAST CEREALS

This study identifies the determinants of coupon values at the brand level using a framework developed from price discrimination theory and the principles of demand. Couponing is considered within the context of a complex marketing program in which it is coordinated with other non-price promotional strategies. A simultaneous, two-equation, fixed-effects, panel-data model is specified and fitted with data on household purchases of ready-to-eat (RTE) breakfast cereals between 1992 and 1997. The empirical model accounts for the bi-directional causality between brand prices and discount levels and captures the retail effects of the major cereal maker's price cuts and discount reductions that occurred in 1996. Higher brand prices cause coupon values to rise, supporting the hypothesis that cereal makers price discriminate among consumers. Other non-price promotions, including advertising, store flyers, and in-store displays, appear to be coordinated with couponing. Specifically, coupon values fall with more intense advertising and in-store displays but rise when the couponed products are featured in store flyers. Discount levels are positively related to brand market share and the size of discounts that are redeemed for rival cereals. Moreover, coupon values fall with increasing brand loyalty among RTE cereal purchasers. Cereal prices are positively affected by coupon values, advertising expenditures, food-ingredient and packaging costs, and the prices of competing brands. Inventory levels are negatively correlated with brand price. Employee wages were not found to significantly influence cereal prices.Marketing,

A quantum key distribution protocol for rapid denial of service detection

We introduce a quantum key distribution protocol designed to expose fake users that connect to Alice or Bob for the purpose of monopolising the link and denying service. It inherently resists attempts to exhaust Alice and Bob's initial shared secret, and is 100% efficient, regardless of the number of qubits exchanged above the finite key limit. Additionally, secure key can be generated from two-photon pulses, without having to make any extra modifications. This is made possible by relaxing the security of BB84 to that of the quantum-safe block cipher used for day-to-day encryption, meaning the overall security remains unaffected for useful real-world cryptosystems such as AES-GCM being keyed with quantum devices.Comment: 13 pages, 3 figures. v2: Shifted focus of paper towards DoS and added protocol 4. v1: Accepted to QCrypt 201

Adaptive computational methods for aerothermal heating analysis

The development of adaptive gridding techniques for finite-element analysis of fluid dynamics equations is described. The developmental work was done with the Euler equations with concentration on shock and inviscid flow field capturing. Ultimately this methodology is to be applied to a viscous analysis for the purpose of predicting accurate aerothermal loads on complex shapes subjected to high speed flow environments. The development of local error estimate strategies as a basis for refinement strategies is discussed, as well as the refinement strategies themselves. The application of the strategies to triangular elements and a finite-element flux-corrected-transport numerical scheme are presented. The implementation of these strategies in the GIM/PAGE code for 2-D and 3-D applications is documented and demonstrated

The Controversy over Maltby’s Hong Kong Dispatch

The recent release of the full text of Major-General CM. Maltby’s Official Dispatch as the General Officer Commanding at Hong Kong (Public Record Office WO 106/240113) prompted British and Canadian newspapers to run sensational stories quoting Maltby’s criticisms of the discipline and battlefield performance of the Canadian battalions. Maltby’s statements, which were censored when the Dispatch was initially released, require a detailed examination and will be discussed in a future issue of CMH. In addition, the Spring 1994 issue will carry an article by Paul Dickson on “Crerar and the Decision to Garrison Hong Kong.” For the present we are publishing an exchange of correspondence, dated January 1948, between Lieutenant-Colonel G.W.L. Nicholson, then Deputy Director of the Army Historical Section, and Brigadier John H. Price who was second-in-command of the Royal Rifles of Canada in Hong Kong. Brigadier Price was asked to comment, not on the censored Dispatch, but on extracts from a draft report prepared by the Historical Section of the British Cabinet Office. This report contained the substance of the most serious charges Maltby made about the conduct of the Royal Rifles. For the information of the reader, other officers mentioned in the exchange include Brigadier C. Wallis, Indian Army, commander of the East Brigade (to which the Royal Rifles belonged), Lieutenant-Colonel W.J. Home, commander of the Royal Rifles, Lieutenant-Colonel J.L.R. Sutcliffe, Commanding Officer, Winnipeg Grenadiers, Brigadier J.K. Lawson, Commanding Officer, “C” Force (as the Canadian contingent was known) and Colonel P. Hennessy, Lawson’s second-in-command