Urban informatics, ubiquitous computing and social media for healthy cities

The increasing ubiquity of digital technology, internet services and location-aware applications in our everyday lives allows for a seamless transitioning between the visible and the invisible infrastructure of cities: road systems, building complexes, information and communication technology, and people networks create a buzzing environment that is alive and exciting. Driven by curiosity, initiative and interdisciplinary exchange, the Urban Informatics Research Lab at Queensland University of Technology (QUT), Brisbane, Australia, is an emerging cluster of people interested in research and development at the intersection of people, place and technology with a focus on cities, locative media and mobile technology. This paper introduces urban informatics as a transdisciplinary practice across people, place and technology that can aid local governments, urban designers and planners in creating responsive and inclusive urban spaces and nurturing healthy cities. Three challenges are being discussed. First, people, and the challenge of creativity explores the opportunities and challenges of urban informatics that can lead to the design and development of new tools, methods and applications fostering participation, the democratisation of knowledge, and new creative practices. Second, technology, and the challenge of innovation examines how urban informatics can be applied to support user-led innovation with a view to promote entrepreneurial ideas and creative industries. Third, place, and the challenge of engagement discusses the potential to establish places within cities that are dedicated to place-based applications of urban informatics with a view to deliver community and civic engagement strategies.

Soundness of workflow nets: classification, decidability, and analysis

Workflow nets, a particular class of Petri nets, have become one of the standard ways to model and analyze workflows. Typically, they are used as an abstraction of the workflow that is used to check the so-called soundness property. This property guarantees the absence of livelocks, deadlocks, and other anomalies that can be detected without domain knowledge. Several authors have proposed alternative notions of soundness and have suggested to use more expressive languages, e.g., models with cancellations or priorities. This paper provides an overview of the different notions of soundness and investigates these in the presence of different extensions of workflow nets.We will show that the eight soundness notions described in the literature are decidable for workflow nets. However, most extensions will make all of these notions undecidable. These new results show the theoretical limits of workflow verification. Moreover, we discuss some of the analysis approaches described in the literature.

Indigenous mathematics : creating an equitable learning environment

This chapter examines how a change in school leadership can successfully address competencies in complex situations and thus create a positive learning environment in which Indigenous students can excel in their learning rather than accept a culture that inhibits school improvement. Mathematics has long been an area that has failed to assist Indigenous students in improving their learning outcomes, as it is a Eurocentric subject (Rothbaum, Weisz, Pott, Miyake & Morelli, 2000, De Plevitz, 2007) and does not contextualize pedagogy with Indigenous culture and perspectives (Matthews, Cooper & Baturo, 2007). The chapter explores the work of a team of Indigenous and non-Indigenous academics from the YuMi Deadly Centre who are turning the tide on improving Indigenous mathematical outcomes in schools and in communities with high numbers of Aboriginal and Torres Strait Islander students.

Recognising Torres Strait Islander women’s knowledges in their children’s mathematics education

This paper discusses women’s involvement in their children’s mathematics education. It does, where possible, focus Torres Strait Islander women who share the aspirations of Aborginal communities around Australia. That is, they are keen for their children to receive an education that provides them with opportunities for their present and future lives. They are also keen to have their cultures’ child learning practices recognised and respected within mainstream education. This recognition has some way to go with the language of instruction in schools written to English conventions, decontextualised and disconnected to the students’ culture, Community and home language.

Numerical methods for second-order stochastic differential equations

We seek numerical methods for second‐order stochastic differential equations that reproduce the stationary density accurately for all values of damping. A complete analysis is possible for scalar linear second‐order equations (damped harmonic oscillators with additive noise), where the statistics are Gaussian and can be calculated exactly in the continuous‐time and discrete‐time cases. A matrix equation is given for the stationary variances and correlation for methods using one Gaussian random variable per timestep. The only Runge–Kutta method with a nonsingular tableau matrix that gives the exact steady state density for all values of damping is the implicit midpoint rule. Numerical experiments, comparing the implicit midpoint rule with Heun and leapfrog methods on nonlinear equations with additive or multiplicative noise, produce behavior similar to the linear case.

Multi-objective optimisation of bijective s-boxes

In this paper we investigate the heuristic construction of bijective s-boxes that satisfy a wide range of cryptographic criteria including algebraic complexity, high nonlinearity, low autocorrelation and have none of the known weaknesses including linear structures, fixed points or linear redundancy. We demonstrate that the power mappings can be evolved (by iterated mutation operators alone) to generate bijective s-boxes with the best known tradeoffs among the considered criteria. The s-boxes found are suitable for use directly in modern encryption algorithms.

Resource allocation and scheduling of multiple composite web services in cloud computing using cooperative coevolution genetic algorithm

In cloud computing, resource allocation and scheduling of multiple composite web services is an important and challenging problem. This is especially so in a hybrid cloud where there may be some low-cost resources available from private clouds and some high-cost resources from public clouds. Meeting this challenge involves two classical computational problems: one is assigning resources to each of the tasks in the composite web services; the other is scheduling the allocated resources when each resource may be used by multiple tasks at different points of time. In addition, Quality-of-Service (QoS) issues, such as execution time and running costs, must be considered in the resource allocation and scheduling problem. Here we present a Cooperative Coevolutionary Genetic Algorithm (CCGA) to solve the deadline-constrained resource allocation and scheduling problem for multiple composite web services. Experimental results show that our CCGA is both efficient and scalable.