Journal of Joseph Joslin, Jr. of South Killingly, a Teamster in the Continental Service, March 1777 -- August 1778

Joseph Joslin, Jr. was a teamster contracted with the Continental Army. His journal covers his activities during the period of March, 1777 to August, 1778

Progression of apprentices to higher education

This report presents the findings of research undertaken for the Department for Business, Innovation and Skills (BIS) into the progression to higher education of advanced level apprentices over the past seven years. This is part of a longitudinal study whose first results were published in 2011 (Joslin & Smith, 2011)

A job analysis of the duties and preparation of tenth-grade english teachers in Maine, New Hampshire, Vermont, and Rhode Island

Thesis (Ed.M.)--Boston Universit

An equivalence result for VC classes of sets

Let R and θ be infinite sets and let A # R × θ. We show that the class of projections of A onto R is a Vapnik–Chervonenkis (VC) class of sets if and only if the class of projections of A onto θ is a VC class. We illustrate the result in the context of semiparametric estimation of a transformation model. In this application, the VC property is hard to establish for the projection class of interest but easy to establish for the other projection class

Squeaky Wheel Optimization

We describe a general approach to optimization which we term `Squeaky Wheel' Optimization (SWO). In SWO, a greedy algorithm is used to construct a solution which is then analyzed to find the trouble spots, i.e., those elements, that, if improved, are likely to improve the objective function score. The results of the analysis are used to generate new priorities that determine the order in which the greedy algorithm constructs the next solution. This Construct/Analyze/Prioritize cycle continues until some limit is reached, or an acceptable solution is found. SWO can be viewed as operating on two search spaces: solutions and prioritizations. Successive solutions are only indirectly related, via the re-prioritization that results from analyzing the prior solution. Similarly, successive prioritizations are generated by constructing and analyzing solutions. This `coupled search' has some interesting properties, which we discuss. We report encouraging experimental results on two domains, scheduling problems that arise in fiber-optic cable manufacturing, and graph coloring problems. The fact that these domains are very different supports our claim that SWO is a general technique for optimization

Flaw Selection Strategies for Partial-Order Planning

Several recent studies have compared the relative efficiency of alternative flaw selection strategies for partial-order causal link (POCL) planning. We review this literature, and present new experimental results that generalize the earlier work and explain some of the discrepancies in it. In particular, we describe the Least-Cost Flaw Repair (LCFR) strategy developed and analyzed by Joslin and Pollack (1994), and compare it with other strategies, including Gerevini and Schubert's (1996) ZLIFO strategy. LCFR and ZLIFO make very different, and apparently conflicting claims about the most effective way to reduce search-space size in POCL planning. We resolve this conflict, arguing that much of the benefit that Gerevini and Schubert ascribe to the LIFO component of their ZLIFO strategy is better attributed to other causes. We show that for many problems, a strategy that combines least-cost flaw selection with the delay of separable threats will be effective in reducing search-space size, and will do so without excessive computational overhead. Although such a strategy thus provides a good default, we also show that certain domain characteristics may reduce its effectiveness.Comment: See http://www.jair.org/ for an online appendix and other files accompanying this articl

A simple parallel prefix algorithm for compact finite-difference schemes

A compact scheme is a discretization scheme that is advantageous in obtaining highly accurate solutions. However, the resulting systems from compact schemes are tridiagonal systems that are difficult to solve efficiently on parallel computers. Considering the almost symmetric Toeplitz structure, a parallel algorithm, simple parallel prefix (SPP), is proposed. The SPP algorithm requires less memory than the conventional LU decomposition and is highly efficient on parallel machines. It consists of a prefix communication pattern and AXPY operations. Both the computation and the communication can be truncated without degrading the accuracy when the system is diagonally dominant. A formal accuracy study was conducted to provide a simple truncation formula. Experimental results were measured on a MasPar MP-1 SIMD machine and on a Cray 2 vector machine. Experimental results show that the simple parallel prefix algorithm is a good algorithm for the compact scheme on high-performance computers

Do Options Contain Information About Excess Bond Returns?

There is strong empirical evidence that risk premia in long-term interest rates are time-varying. These risk premia critically depend on interest rate volatility, yet existing research has not examined the impact of time-varying volatility on excess returns for long-term bonds. To address this issue, we incorporate interest rate option prices, which are very sensitive to interest rate volatility, into a dynamic model for the term structure of interest rates. We estimate three-factor affine term structure models using both swap rates and interest rate cap prices. When we incorporate option prices, the model better captures interest rate volatility and is better able to predict excess returns for long-term swaps over short-term swaps, both in- and out-of-sample. Our results indicate that interest rate options contain valuable information about risk premia and interest rate dynamics that cannot be extracted from interest rates alone.

“LIQUID SUNSHINE, or SOMETHING ELSE,” a play by Kalli Anne Joslin

Liquid Sunshine, or Something Else is a historical play set in 1920s Florida that examines the intersections of race, gender, and immigration during American Prohibition. Set in an unnamed town that incorporates aspects of Tampa, Miami, and Key West, the owner of a local Cuban restaurant must grapple with increased police presence in her community as she is simultaneously asked to run an illegal still and shelter a family of Eastern European immigrants