Introduction : Picture Books ... Then, Now and Beyond

Picture books are known and familiar objects to many children and adults. They have been variously described as art objects, cultural documents, hybrid texts and verbal-visual art forms. They have also been variously categorised according to their readership – ranging from very young children to older readers, the latter can extend through the primary years to high school and even into adulthood. Scholars and students study picture books as part of an evolving literary and cultural landscape which has given rise to new genres and trends, such as ‘multicultural picture books’, ‘environmental picture books’ and ‘postmodern picture books’, and what Cherie Allan terms, ‘postmodernesque picture books’, that is, ‘picturebooks about postmodernity’ (Allan, 2012, p. 141). Picture books are also the staple literature in many early years and primary school classrooms for literacy and literary development, thus supporting the designated strands for literacy, literature, and language in the Australian Curriculum: English.

Picture Books and Beyond

Picture books and beyond examines a wide selection of picture books, graphics novels, films, e-picture books and apps that reflects the diversity of these evolving cultural artefacts, and their opportunities for education and delight. Picture books and beyond aligns closely with the goals and directions of the Australian Curriculum: English, and considers the potential of texts for enabling students to respond critically and creatively. It also highlights links to other curricula, general capabilities, and cross-curriculum priorities.

Balancing the books : an assessment of financial stress associated with social work and human service student placements

This report presents the findings from a study of the financial impact of work-integrated learning commonly referred to as 'placement' among social work and human services students. Based on a survey of 214 respondants, 14 in-depth interviews and two focus groups, the findings indicate that two thirds of the surveyed group felt tired and anxious about their experience of balancing paid work and placement, with 2 in 5 reporting their learning experience was compromised as a result. The significant implications and potential solutions are also discussed.

A subexponential construction of graph coloring for multiparty computation

We show the first deterministic construction of an unconditionally secure multiparty computation (MPC) protocol in the passive adversarial model over black-box non-Abelian groups which is both optimal (secure against an adversary who possesses any tcoloring of planar graphs. More specifically, following the result of Desmedt et al. (2012) that the problem of MPC over non-Abelian groups can be reduced to finding a t-reliable n-coloring of planar graphs, we show the construction of such a graph which allows a path from the input nodes to the output nodes when any t-party subset is in the possession of the adversary. Unlike the deterministic constructions from Desmedt et al. (2012) our construction has subexponential complexity and is optimal at the same time, i.e., it is secure for any t

Remembering the past through picture books

In anticipation of the commemorations around the centenary of World War 1 (2014-2018) this chapter examines the ways in which war and its effects have been represented in picture books for children. It looks at the ways in which these picture books create “textual monuments” as points of reference through which younger generations can “develop a narrative of the past” and “explore different points of view”. The focus of the discussion centres on a number of recent picture books and their application to aspects of the F-2 Australian History curriculum.

Knowledge unlatched: A global library consortium model for funding open access scholarly books: Full report on the Proof of Concept Pilot 2014

This special issue of Cultural Science Journal is devoted to the report of a groundbreaking experiment in re-coordinating global markets for specialist scholarly books and enabling the knowledge commons: the Knowledge Unlatched proof-of-concept pilot. The pilot took place between January 2012 and September 2014. It involved libraries, publishers, authors, readers and research funders in the process of developing and testing a global library consortium model for supporting Open Access books. The experiment established that authors, librarians, publishers and research funding agencies can work together in powerful new ways to enable open access; that doing so is cost effective; and that a global library consortium model has the potential dramatically to widen access to the knowledge and ideas contained in book-length scholarly works.

Encouraging Empathy through Picture Books about Migration

Australia has become one of the most highly multilingual and multicultural societies in the world today with people descending from 270 ancestries, who speak more than 260 languages (Commonwealth of Australia, 2011). Immigration is something that children encounter in their daily lives either through personal experience or through witnessing the lives of migrants at school, in the community, or through popular media, including children’s literature. Schools are frequently the initial interface for individuals who resettle in Australia and they ‘play a significant role in establishing meaningful connections to Australian society and a sense of belonging in Australia’ (Uptin, Wright, & Harwood, 2013, p. 1). Children's literature about cultural and ethnic diversity explores the impacts of migration and related issues creating ‘imaginary realms’ (Dudek & Ommundsen, 2007). These fictional interpretations of the migrant experience or the experience of migration are supported by distinctive “real life” cultural experiences. Picture books furnish teachers and students with an accessible means to investigate these complex issues through sensitive discussions. This chapter investigates how picture books about migration help deepen children’s perceptive understanding of migrants’ plights, and thereby nurture tolerance and empathy.

Using children's picture books and process drama to develop students' critical literacy responses

This workshop introduces a range of process drama activities to develop students' critical literacy responses. Whilst children's picture books and process drama strategies have not traditionally been seen as sophisticated resources and strategies for developing students' critical literacy responses, this workshop shows teaching strategies that can be used in language instruction in primary classrooms with diverse student groups. The teaching activities include ‘attribute lists’, ‘sculptures’ and ‘freeze frames’.

Using children's picture books to develop students' critical literacy responses

This lecture introduces a range of children's picture books from around the world and teaching strategies that develop students' critical literacy responses. Whilst children's picture books have not traditionally been seen as sophisticated resources for developing students' critical literacy responses, this lecture presents research that shows young children as code breakers, text participants, text users and text analysts (Luke & Freebody, 1999) of written, visual, oral and gestural texts. This lecture also outlines the teaching strategies as they have been used in language instruction in primary classrooms with diverse student groups.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

Acyclic Edge Coloring of Graphs with Maximum Degree 4

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

Multiple roles of transfer prices: One vs. two books

This paper investigates multiple roles of transfer prices for shipments of goods and services between entities of a multinational enterprise. At the center is the role of transfer pricing (TP) in tax manipulation, but other roles having to do with internal operations or strategic delegation, etc. are also considered. The interesting question is to what extent and how the different roles of TPs interfere with each other. The answer depends on whether companies use one or two books, i.e. whether they (can) apply different TPs for different purposes. We illustrate, in a stylized model, the competing aims of tax manipulation and strategic delegation. Finally, we briefly look at selected reform proposals, concluding that either TP problems are not addressed, or else new distortions will be introduced instead.

Acyclic edge coloring of subcubic graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and it is denoted by a′(G). From a result of Burnstein it follows that all subcubic graphs are acyclically edge colorable using five colors. This result is tight since there are 3-regular graphs which require five colors. In this paper we prove that any non-regular connected graph of maximum degree 3 is acyclically edge colorable using at most four colors. This result is tight since all edge maximal non-regular connected graphs of maximum degree 3 require four colors.

Knowledge unlatched : A global library consortium model for funding Open Access scholarly books

Specialist scholarly books, including monographs, allow researchers to present their work, pose questions and to test and extend areas of theory through long-form writing. In spite of the fact that research communities all over the world value monographs and depend heavily on them as a requirement of tenure and promotion in many disciplines, sales of this kind of book are in free fall, with some estimates suggesting declines of as much as 90% over twenty years (Willinsky 2006). Cashstrapped monograph publishers have found themselves caught in a negative cycle of increasing prices and falling sales, with few resources left to support experimentation, business model innovation or engagement with digital technology and Open Access (OA). This chapter considers an important attempt to tackle failing markets for scholarly monographs, and to enable the wider adoption of OA licenses for book-length works: the 2012 – 2014 Knowledge Unlatched pilot. Knowledge Unlatched is a bold attempt to reconfigure the market for specialist scholarly books: moving it beyond the sale of ‘content’ towards a model that supports the services valued by scholarly and wider communities in the context of digital possibility. Its success has powerful implications for the way we understand copyright’s role in the creative industries, and the potential for established institutions and infrastructure to support the open and networked dynamics of a digital age.

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.