We investigate the isomorphism types of combinatorial geometries arising from Hrushovski’s flat strongly minimal structures and answer some questions from Hrushovski’s original paper.

This article tests Diessel’s ‘integration’ path of development of adverbial clauses (cf. Diessel, 2004), with special focus on the acquisition of ‘causal’ adverbial clauses, in the context of the overall development of grammatical/semantic complexification in a French child’s longitudinal corpus of spontaneous speech (Madeleine, Paris Corpus) from 10 months to 4;01 years old. Three main pattern...

ÐThe problem of computing with faulty shared bits is addressed. The focus is on constructing a reliable test&set bit from a collection of test&set bits of which some may be faulty. Faults are modeled by allowing operations on the faulty bits to return a special distinguished value, signaling that the operation may not have taken place. Such faults are called omission faults. Some of the constru...

We focus on generalizing constructions of Batch Single-Choice Cut-And-Choose Oblivious Transfer and Multi-sender k-out-of-n Oblivious Transfer, which are at the core of efficient secure computation constructions proposed by Lindell et al. and the IPS compiler. Our approach consists in showing that such primitives can be based on a much weaker and simpler primitive called Verifiable Oblivious Tr...

Mandarin light verb constructions, which can be categorized into DO and GIVE groups based on the semantic content of the light verb, are generally believed to be associated with information packaging: in the schematised canonical syntactic realisation ̳dui ̳to‘+NP+LV+NP‘, the preposed preverbal undergoer argument has a contrastive focus function. However, a plethora of LVCs retrieved from a Mand...

The Stanford dependency scheme aims to provide a simple and intuitive but linguistically sound way of annotating the dependencies between words in a sentence. In this paper, we address two limitations the scheme has suffered from: First, despite providing good coverage of core grammatical relations, the scheme has not offered explicit analyses of more difficult syntactic constructions; second, ...

This paper describes desiderative constructions in Japanese with the main focus on ta(i) ‘want’ desideratives. In spite of the morphological one-word status, desiderative constructions have been claimed to have a complex structure at some abstract level of representation. We claim that there are two types of desideratives, and that their predicates have different lexical representations within ...

Difference sets and their generalisations to difference families arise from the study of designs and many other applications. Here we give a brief survey of some of these applications, noting in particular the diverse definitions of difference families and the variations in priorities in constructions. We propose a definition of disjoint difference families that encompasses these variations and...

Here we discuss the universal block decoding problem for memoryless systems and focus on figures of merit and linear code constructions that facilitate the analysis and construction of low-complexity decoding algorithms. We discuss the properties of ‘universally good codes’ and how such codes lie on the Gilbert-Varshamov bound. We next speak to analogues of the minimum-distance criterion and de...