Interactive architecture

This chapter explores the development of concepts of interactive environments by comparing two major projects that frame the period of this book. The Fun Palace of 1960 and the Generator of 1980 both proposed interactive environments responsive to the needs and behaviour of their users, but the contrast in terms of the available technology and what it enabled could not be more marked. The Fun Palace broke new architectural, organizational and social ground and was arguably the first proposition for cybernetic architecture; the Generator demonstrated how it could be achieved. Both projects are now acknowledged as seminal architectural propositions of the twentieth century, and both were designed by Cedric Price.

Modernity and the 'failure' of crime control

Rather than understanding the recurrent failure of various attempts at crime control as unfortunate and undesirable aberrations, all too familiar glitches an otherwise uninterrupted teleological march to a better society, such failures are instead positioned as part of the fabric of late modernity itself. That is, society changes not according to a predetermined logic along neatly defined and clearly reasoned tracks, rather it hurtles from crisis to crisis, from failure to failure, and it is the regulation of that failure which produces new initiatives and new forms of governance. Utilising the example of the modern prison, this chapter contends that too great an emphasis upon this institution’s ‘failure’ results not only in a neglect of the many other functions that it serves in the regulation of difference, but also, and more generally, it results in an underestimation of the importance of failure in providing new impetus for social transformation.

The logic of ADHD : a brief review of fallacious reasoning

This paper has two central purposes: the first is to survey some of the more important examples of fallacious argument, and the second is to examine the frequent use of these fallacies in support of the psychological construct: Attention Deficit Hyperactivity Disorder (ADHD). The paper divides 12 familiar fallacies into three different categories—material, psychological and logical—and contends that advocates of ADHD often seem to employ these fallacies to support their position. It is suggested that all researchers, whether into ADHD or otherwise, need to pay much closer attention to the construction of their arguments if they are not to make truth claims unsupported by satisfactory evidence, form or logic.

The appropriateness of default investment options in defined contribution plans : Australian evidence

For participants in defined contribution (DC) plans who refrain from exercising investment choice, plan contributions are invested following the default investment option of their respective plans. Since default investment options of different plans vary widely in terms of their benchmark asset allocation, the most important determinant of investment performance, participants enrolled in these options face significantly different wealth outcomes at retirement. This paper simulates the terminal wealth outcomes under different static asset allocation strategies to evaluate their relative appeal as default investment choice in DC plans. We find that strategies with low or moderate allocation to stocks are consistently outperformed in terms of upside potential of exceeding the participant’s wealth accumulation target at retirement as well as downside risk of falling below that target outcome by aggressive strategies whose allocation to stocks approach 100%. The risk of extremely adverse wealth outcomes for plan participants also does not appear to be very sensitive to asset allocation. Our evidence suggests the appropriateness of strategies heavily tilted towards stocks to be nominated as default investment options in DC plans unless plan providers emphasize predictability of wealth outcomes over adequacy of retirement wealth.

Don’t judge a superannuation default investment option by its name

With the massive decline in savings arising from the Global Financial Crisis (GFC), it is timely to review superannuation fund investment and disclosure strategies in the lead-up to the crisis. Accordingly, this study examines differences among superannuation funds’ default investment options in terms of naming and framing over three years from 2005 to 2007, as presented in product disclosure statements (PDSs). The findings indicate that default options are becoming more alike regardless of their name, and consequently, members may face increasing difficulties in distinguishing between balanced and growth-named default options when comparing them across superannuation funds. Comparability is also likely to be constrained by variations in the framing of default options presented in investment option menus in PDSs. These findings highlight the need for standardisation of default option definitions and disclosures to ensure descriptive accuracy, transparency and comparability.

Some applications of logic to feasibility in higher types

While it is commonly accepted that computability on a Turing machine in polynomial time represents a correct formalization of the notion of a feasibly computable function, there is no similar agreement on how to extend this notion on functionals, that is, what functionals should be considered feasible. One possible paradigm was introduced by Mehlhorn, who extended Cobham's definition of feasible functions to type 2 functionals. Subsequently, this class of functionals (with inessential changes of the definition) was studied by Townsend who calls this class POLY, and by Kapron and Cook who call the same class basic feasible functionals. Kapron and Cook gave an oracle Turing machine model characterisation of this class. In this article, we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalise the corresponding properties of the class of feasible functions, thus giving further evidence that the notion of feasibility of functionals mentioned above is correctly chosen. We also improve the Kapron and Cook result on machine representation.Our proofs are based on essential applications of logic. We introduce a weak fragment of second order arithmetic with second order variables ranging over functions from NN which suitably characterises basic feasible functionals, and show that it is a useful tool for investigating the properties of basic feasible functionals. In particular, we provide an example how one can extract feasible programs from mathematical proofs that use nonfeasible functions.

Mind change complexity of learning logic programs

The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds for learnability of these classes both from positive facts and from positive and negative facts. Building on Angluin’s notion of finite thickness and Wright’s work on finite elasticity, Shinohara defined the property of bounded finite thickness to give a sufficient condition for learnability of indexed families of computable languages from positive data. This paper shows that an effective version of Shinohara’s notion of bounded finite thickness gives sufficient conditions for learnability with ordinal mind change bound, both in the context of learnability from positive data and for learnability from complete (both positive and negative) data. Let Omega be a notation for the first limit ordinal. Then, it is shown that if a language defining framework yields a uniformly decidable family of languages and has effective bounded finite thickness, then for each natural number m >0, the class of languages defined by formal systems of length <= m: • is identifiable in the limit from positive data with a mind change bound of Omega (power)m; • is identifiable in the limit from both positive and negative data with an ordinal mind change bound of Omega × m. The above sufficient conditions are employed to give an ordinal mind change bound for learnability of minimal models of various classes of length-bounded Prolog programs, including Shapiro’s linear programs, Arimura and Shinohara’s depth-bounded linearly covering programs, and Krishna Rao’s depth-bounded linearly moded programs. It is also noted that the bound for learning from positive data is tight for the example classes considered.

Fuzzy logic power system stabilizer in multimachine stability studies

Power system stabilizers (PSS) work well at the particular network configuration and steady state conditions for which they were designed. Once conditions change, their performance degrades. This can be overcome by an intelligent nonlinear PSS based on fuzzy logic. Such a fuzzy logic power system stabilizer (FLPSS) is developed, using speed and power deviation as inputs, and provides an auxiliary signal for the excitation system of a synchronous motor in a multimachine power system environment. The FLPSS's effect on the system damping is then compared with a conventional power system stabilizer's (CPSS) effect on the system. The results demonstrate an improved system performance with the FLPSS and also that the FLPSS is robust

Fuzzy logic traffic control at a road junction with time-varying flow rates

Fuzzy logic has been applied to control traffic at road junctions. A simple controller with one fixed rule-set is inadequate to minimise delays when traffic flow rate is time-varying and likely to span a wide range. To achieve better control, fuzzy rules adapted to the current traffic conditions are used.