Advice to the Lovelorn

In these decadent times, no newspaper is complete without a column of advice for the loverlorn and for others with problems. Since newspapers consist of words and we specialize in words, it follows with logic absolute that we, too, must address ourselves to the problems of the lovelorn

Advice-Versa

Much of what passes for advice is, on examination, self-contradictory, Never give anyone advice, Don\u27t listen to what others tell you, God-damn all profanity, and Avoid iambic meter, son are examples. In the quiz below, thirty bits of paradoxical linguistic advice have been split into two parts, the first in the left-hand column and the second in the right-hand one. Can you re-combine each half with its illogical mate? Answers are found in Answers and Solutions at the end of this issue

The emergence of the identity of a fictional expert advice-giver in an American Internet advice column

This paper is a contribution to research on the expression of expert advice-giving (e.g., Heritage and Sefi 1992; Silverman et al. 1992). We present a linguistic analysis of the ways in which the identity of the fictional expert advisor Lucy emerges in an Internet advice column run by professional health educators as part of a university health service. In discourse-analytical close readings of 280 question-answer records, we identify and discuss seven recurring strategies (the advisor's name, self-reference and use of address terms; expert information-giving; giving options and making readers think; the choice of vocabulary; offering opinions; the use of empathy; the display of humor), which together contribute to Lucy's voice as an expert advice-giver if the readers repeatedly access the question-answer exchanges. This emerging identity is in line with the site's mission to provide information designed to facilitate independent and responsible decision processes and corresponds to an ideal of nondirectiveness, as also identified in the literature on other advisory settings (He 1994; Sarangi and Clarke 2002; Vehviläinen 2003). The constructed identity of Lucy thus makes ‘Lucy Answers' an attractive site to (re)turn to for advice and complements the other services provided by the health educator

Composing Aspects at Shared Join Points

Aspect-oriented languages provide means to superimpose aspectual behavior on a given set of join points. It is possible that not just a single, but several units of aspectual behavior need to be superimposed on the same join point. Aspects that specify the superimposition of these units are said to "share" the same join point. Such shared join points may give rise to issues such as\ud determining the exact execution order and the dependencies among the aspects. In this paper, we present a detailed analysis of the problem, and identify a set of requirements upon mechanisms for composing aspects at shared join points. To address the identified issues, we propose a general and declarative model for defining constraints upon the possible compositions of aspects at a shared join point. Finally, by using an extended notion of join points, we show how concrete aspectoriented programming languages, particularly AspectJ and Compose*, can adopt the proposed model

Evaluation of the Adult Learning Grant cohort 1 (waves 1 and 2)

"The Adult Learning Grant (ALG) was announced as part of the Government’s Skills Strategy in 2003. The ALG pilot began in September 2003 in ten areas across England. The ALG aims to support adults in learning through the offer of a meanstested monetary allowance... Throughout the report (except for ALG experiences), [this] analysis focuses on comparisons between ALG applicants (or sub-groups: awardees or recipients) and qualification-eligible non-applicants." -- pp. i & iii

Guidelines for Good Mathematical Writing

Communicating mathematics well is an important part of doing mathematics. Many of us know from writing papers or giving talks that communicating effectively not only serves our audience but also clarifies and structures our own thinking. There is an art and elegance to good writing that every writer should strive for. And writing, as a work of art, can bring a person great personal satisfaction. Within the MAA, we value exposition and mathematical communication. In this column, I’m sharing the advice I give my students to help them write well. There are more extensive treatments (e.g., see Paul Halmos’s How to Write Mathematics), but I wanted a shorter introduction. So I developed the guidelines below

Sharing HOL4 and HOL Light proof knowledge

New proof assistant developments often involve concepts similar to already formalized ones. When proving their properties, a human can often take inspiration from the existing formalized proofs available in other provers or libraries. In this paper we propose and evaluate a number of methods, which strengthen proof automation by learning from proof libraries of different provers. Certain conjectures can be proved directly from the dependencies induced by similar proofs in the other library. Even if exact correspondences are not found, learning-reasoning systems can make use of the association between proved theorems and their characteristics to predict the relevant premises. Such external help can be further combined with internal advice. We evaluate the proposed knowledge-sharing methods by reproving the HOL Light and HOL4 standard libraries. The learning-reasoning system HOL(y)Hammer, whose single best strategy could automatically find proofs for 30% of the HOL Light problems, can prove 40% with the knowledge from HOL4

Physiology of Chatham Island forget-me-not (Myosotidium hortensia) seed : a thesis presented in partial fulfilment of the requirements for the degree of Master of Applied Science in Seed Science and Technology at Massey University

Chatham Island forget-me-not (Myosotidium hortensia (Decne) Baillon) is endemic to the Chatham Islands where it is mainly confined to the outer islands. There is speculation that seed of M. hortensia is recalcitrant and reports that germination can be slow and erratic. Moreover there is little information on the seed biology of M. hortensia available. In this study the seed structure and composition of the seed storage reserves of M. hortensia were determined. The seed is a dicotyledon. The embryo is predominantly cotyledonary tissue with a only small embryo axis present. There appears to be a single cell thick layer of endosperm tissue between the embryo and seed coat. Food reserves are stored as both protein and oil with no starch reserves apparent. The seed contains 24% oil and therefore can be considered an oilseed. These oil reserves include the commercially important γ-linolenic (cis, cis, cis-6, 9, 12-octadecatrienoic) acid (9% of the fatty acid content). Seed of M. hortensia was evaluated for recalcitrant behaviour by determining if desiccation to low seed moisture content caused a loss of viability. Seed was harvested at two moisture contents, 47.4% (green seed) and 35.5% (black seed), and air dried to a final moisture content of 7.5%. Seed viability and germination performance were monitored at harvest and as moisture content declined. At 7.5% seed moisture content viability was 89% and germination 92% for seed harvested at 47% seed moisture content, and 82% and 78%, respectively, for seed harvested at 36% seed moisture content. Within each colour classification, after desiccation there was no significant difference in germination compared to that at harvest, indicating that M. hortensia seed can be desiccated to a low seed moisture content without loss of germination and is therefore not recalcitrant. Seed stored at 5°C and 7.5% seed moisture content showed no decline in viability after 21 months, but, seed stored at the same temperature and 9.5% seed moisture content showed a significant loss of viability after 9 months storage. The loss of viability at this higher (9.5%) seed moisture content is characteristic of oilseeds, but it is not clear whether the high oil content of the seed alone can account for the loss of viability after nine months storage at a temperature of 5°C. This study confirmed earlier reports that germination of M. hortensia seed is slow and erratic. At maturity seed of M. hortensia is dormant. Seed dormancy is a function of the seed coat rather than the embryo. The dormancy is likely to be a result of either physical constraint of embryo growth or restriction of gas exchange by the seed coat, or a combination of both. Removal or weakening of the seed coat allowed germination to proceed. However, some of the treatments used to weaken the seed coat resulted in an increase in abnormal seedling development. An effective and non-damaging technique for alleviating dormancy was to prick the seed coat with a 0.6-0.8mm diameter dissecting needle in the middle of the cotyledons

Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication

This paper develops a new technique for proving amortized, randomized cell-probe lower bounds on dynamic data structure problems. We introduce a new randomized nondeterministic four-party communication model that enables "accelerated", error-preserving simulations of dynamic data structures. We use this technique to prove an $\Omega(n(\log n/\log\log n)^2)$ cell-probe lower bound for the dynamic 2D weighted orthogonal range counting problem (2D-ORC) with $n/\mathrm{poly}\log n$ updates and $n$ queries, that holds even for data structures with $\exp(-\tilde{\Omega}(n))$ success probability. This result not only proves the highest amortized lower bound to date, but is also tight in the strongest possible sense, as a matching upper bound can be obtained by a deterministic data structure with worst-case operational time. This is the first demonstration of a "sharp threshold" phenomenon for dynamic data structures. Our broader motivation is that cell-probe lower bounds for exponentially small success facilitate reductions from dynamic to static data structures. As a proof-of-concept, we show that a slightly strengthened version of our lower bound would imply an $\Omega((\log n /\log\log n)^2)$ lower bound for the static 3D-ORC problem with $O(n\log^{O(1)}n)$ space. Such result would give a near quadratic improvement over the highest known static cell-probe lower bound, and break the long standing $\Omega(\log n)$ barrier for static data structures