Search Results

This chapter introduces the problem of productivity: How do language learners determine which potential generalizations can actually be used to create novel expressions in their language and which only occur as parts of stored items? The first part of the chapter reviews historical approaches to this question, discussing previous unsuccessful attempts to reduce the problem of what is stored and what is computed to other properties. The second part of the chapter outlines a new theory of storage and computation based on the idea that the problem can be solved via a probabilistic inference which optimizes a tradeoff between fewer, simpler stored items, and simpler derivations of linguistic expressions. This inference-based model is contrasted with four other models to which it will be compared throughout the book: (i) the full-parsing model where all structure is always computed, (ii) the full-listing model where all structure is stored after the first time it is computed and (iii) two variants of the exemplar-based model which hypothesizes all possible mixtures of computation and storage in the derivation of every expression.

The genre of the romantic comedy was domesticated in the studio era of Finnish cinema that lasted from the early 1930s to late 1950s by filmmakers who admired Hollywood films, an example of whom would be Valentin Vaala. This domestication was an easy process for the reason that romantic comedies are universal in tone, which means they can be set pretty much in any location, discuss context-specific problems related to relationships and be produced with the modest budgets of small nation cinemas. This has made the genre more than suited for Finnish cinema. Before analysing the Finnish films in detail, I am going to provide a quick background exploration of Finnish romantic comedies of the studio era in order to show the transformation.

This chapter tells the story of the Beothuk people in Newfoundland, hunter-gatherers indigenous to this northern island. The Europeans, mostly English and Irish, came in the 18th and 19th centuries. With the coming of the settlers the Beothuk dwindled and finally, in 1829 they were declared extinct. The exact cause of this extinction is still debated, but there is no doubt that the ancestors of many of those still living in Newfoundland were the agents of extermination of a people, whether by disease or genocidal violence. Since their extermination Beothuk bones emerged from the earth and were sometimes taken away and stored and displayed in museums in Newfoundland, Edinburgh and elsewhere. These bones still exist, now withdrawn from display, but intermittently receiving the attention of oesteoarchaeologists and physical anthropologists, as well as a handful of activists petitioning for their return. This chapter addresses the capacity of bones to speak, to give testimony and, in giving testimony, to make “old acts indelible”. How do these bones trouble and haunt contemporary articulations of settler identity and our ethical engagement with the absent presence of those who have been violently dispossessed?

This chapter introduces the essential elements of linear viscoelastic material behaviour and modeling in one- and three-dimensions. Both relaxation and creep phenomena are introduced and modeled using Boltzmann’s superposition integral. Various common kernel functions are introduced, as is the standard and generalized standard linear model in differential and integral form. The correspondence principle is discussed for the solution of practical problems and to connect relaxation and creep formulations. Storage and loss moduli for oscillatory loadings are discussed, as are loss tangents and dissipation. For the generalized standard linear solid its time integration via the Herrmann-Peterson recursion relation is discussed. Effects of temperature are discussed, and the concept of time-temperature equivalence is introduced.

We consider how best to store sparse vectors, to add a multiple of one to another and to form inner products. We also discuss using a full array even when the vector is sparse. We compare the different ways that sparse matrices can be held and discuss the use of linked lists. Sorting may be needed before or during a sparse matrix computation, so we discuss two sorting methods that we have found particularly useful: the counting sort and the heap sort. We consider grouping variables into supervariables and we discuss matrix-vector and matrix-matrix products.

The means by which allocatable and pointer objects can be dynamically allocated and deallocated storage space are described. The transfer of allocated storage is also considered. The advantages and disadvantages of allocatable objects over pointer objects are explained.