On a generalization of the Oberwolfach problem

Let e(1),e(2),... e(n) be a sequence of nonnegative integers Such that the first non-zero term is not one. Let Sigma(i=1)(n) e(i) = (q - 1)/2, where q = p(n) and p is an odd prime. We prove that the complete graph on q vertices can be decomposed into e(1) C-pn-factors, e(2) C-pn (1)-factors,..., and e(n) C-p-factors. (C) 2004 Elsevier Inc. All rights reserved.

Generalization by symbolic abstraction in cascaded recurrent networks

Generalization performance in recurrent neural networks is enhanced by cascading several networks. By discretizing abstractions induced in one network, other networks can operate on a coarse symbolic level with increased performance on sparse and structural prediction tasks. The level of systematicity exhibited by the cascade of recurrent networks is assessed on the basis of three language domains. (C) 2004 Elsevier B.V. All rights reserved.

Consumer credit code disclosure: Does it work?

Since 1996 all consumer credit transactions in Australia have been regulated by the Consumer Credit Code. The principal means by which the Code purports to protect consumers and prevent market failure is a detailed and prescriptive disclosure regime. There has been little empirical work done on whether or not such disclosure actually improves consumers’ understanding of their credit contracts. By exposing participants to typical consumer credit documents, this research discovered quite poor comprehension of important features of the relevant transactions. Most significantly, there appeared to be little difference in comprehension when the consumers read contracts which complied with the disclosure requirements of the Code, and when they read contracts which did not. These results cast doubt on the effectiveness of the Code disclosure regime.