Driving better vegetable irrigation through profitable practice change

The availability and quality of irrigation water has become an issue limiting productivity in many Australian vegetable regions. Production is also under competitive pressure from supply chain forces. Producers look to new technologies, including changing irrigation infrastructure, exploring new water sources, and more complex irrigation management, to survive these stresses. Often there is little objective information investigating which improvements could improve outcomes for vegetable producers, and external communities (e.g. meeting NRM targets). This has led to investment in inappropriate technologies, and costly repetition of errors, as business independently discover the worth of technologies by personal experience. In our project, we investigated technology improvements for vegetable irrigation. Through engagement with industry and other researchers, we identified technologies most applicable to growers, particularly those that addressed priority issues. We developed analytical tools for ‘what if’ scenario testing of technologies. We conducted nine detailed experiments in the Lockyer Valley and Riverina vegetable growing districts, as well as case studies on grower properties in southern Queensland. We investigated root zone monitoring tools (FullStop™ wetting front detectors and Soil Solution Extraction Tubes - SSET), drip system layout, fertigation equipment, and altering planting arrangements. Our project team developed and validated models for broccoli, sweet corn, green beans and lettuce, and spreadsheets for evaluating economic risks associated with new technologies. We presented project outcomes at over 100 extension events, including irrigation showcases, conferences, field days, farm walks and workshops. The FullStops™ were excellent for monitoring root zone conditions (EC, nitrate levels), and managing irrigation with poor quality water. They were easier to interpret than the SSET. The SSET were simpler to install, but required wet soil to be reliable. SSET were an option for monitoring deeper soil zones, unsuitable for FullStop™ installations. Because these root zone tools require expertise, and are labour intensive, we recommend they be used to address specific problems, or as a periodic auditing strategy, not for routine monitoring. In our research, we routinely found high residual N in horticultural soils, with subsequently little crop yield response to additional nitrogen fertiliser. With improved irrigation efficiency (and less leaching), it may be timely to re-examine nitrogen budgets and recommendations for vegetable crops. Where the drip irrigation tube was located close to the crop row (i.e. within 5-8 cm), management of irrigation was easier. It improved nitrogen uptake, water use efficiency, and reduced the risk of poor crop performance through moisture stress, particularly in the early crop establishment phases. Close proximity of the drip tube to the crop row gives the producer more options for managing salty water, and more flexibility in taking risks with forecast rain. In many vegetable crops, proximate drip systems may not be cost-effective. The next best alternative is to push crop rows closer to the drip tube (leading to an asymmetric row structure). The vegetable crop models are good at predicting crop phenology (development stages, time to harvest), input use (water, fertiliser), environmental impacts (nutrient, salt movement) and total yields. The two immediate applications for the models are understanding/predicting/manipulating harvest dates and nitrogen movements in vegetable cropping systems. From the economic tools, the major influences on accumulated profit are price and yield. In doing ‘what if’ analyses, it is very important to be as accurate as possible in ascertaining what the assumed yield and price ranges are. In most vegetable production systems, lowering the required inputs (e.g. irrigation requirement, fertiliser requirement) is unlikely to have a major influence on accumulated profit. However, if a resource is constraining (e.g. available irrigation water), it is usually most profitable to maximise return per unit of that resource.

Are We The One?

A collaborative, performative and relational experience for two people, woven together by a custom digital phone App. Two walkers, who have never met, simultaneously use a phone App to record a personalised walk around their locality, crafting a series of special moments and surprises for each other. The App then allows participants to continue their two walks, but now directed by what the other person has just created for them. Finally, at the end of the experience they can then choose whether they would like to actually meet in person. Based loosely on the idea of a date, each participant is initially asked to give a little bit of personal information, and then actually speak volumes about themselves through how they choose to care for their 'date's future experience. After walking in parallel universes, but never far away from each other, both daters can ultimately choose to then meet in person -- if what they have experienced tells them that maybe "We Are The One".

Search on a hypercubic lattice using a quantum random walk. I. d > 2

Random walks describe diffusion processes, where movement at every time step is restricted to only the neighboring locations. We construct a quantum random walk algorithm, based on discretization of the Dirac evolution operator inspired by staggered lattice fermions. We use it to investigate the spatial search problem, that is, to find a marked vertex on a d-dimensional hypercubic lattice. The restriction on movement hardly matters for d > 2, and scaling behavior close to Grover's optimal algorithm (which has no restriction on movement) can be achieved. Using numerical simulations, we optimize the proportionality constants of the scaling behavior, and demonstrate the approach to that for Grover's algorithm (equivalent to the mean-field theory or the d -> infinity limit). In particular, the scaling behavior for d = 3 is only about 25% higher than the optimal d -> infinity value.

Determinant: Old algorithms, new insights (Extended Abstract)

In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of the coefficients of the characteristic polynomial, in terms of walks and closed walks of different kinds in the underlying graph. We develop algorithms based on these characterizations, and show that they tally with well-known algorithms arrived at independently from considerations in linear algebra.

Search on a fractal lattice using a quantum random walk

The spatial search problem on regular lattice structures in integer number of dimensions d >= 2 has been studied extensively, using both coined and coinless quantum walks. The relativistic Dirac operator has been a crucial ingredient in these studies. Here, we investigate the spatial search problem on fractals of noninteger dimensions. Although the Dirac operator cannot be defined on a fractal, we construct the quantum walk on a fractal using the flip-flop operator that incorporates a Klein-Gordon mode. We find that the scaling behavior of the spatial search is determined by the spectral (and not the fractal) dimension. Our numerical results have been obtained on the well-known Sierpinski gaskets in two and three dimensions.

Measurement Based Impromptu Deployment of a Multi-Hop Wireless Relay Network

We study the problem of optimal sequential (''as-you-go'') deployment of wireless relay nodes, as a person walks along a line of random length (with a known distribution). The objective is to create an impromptu multihop wireless network for connecting a packet source to be placed at the end of the line with a sink node located at the starting point, to operate in the light traffic regime. In walking from the sink towards the source, at every step, measurements yield the transmit powers required to establish links to one or more previously placed nodes. Based on these measurements, at every step, a decision is made to place a relay node, the overall system objective being to minimize a linear combination of the expected sum power (or the expected maximum power) required to deliver a packet from the source to the sink node and the expected number of relay nodes deployed. For each of these two objectives, two different relay selection strategies are considered: (i) each relay communicates with the sink via its immediate previous relay, (ii) the communication path can skip some of the deployed relays. With appropriate modeling assumptions, we formulate each of these problems as a Markov decision process (MDP). We provide the optimal policy structures for all these cases, and provide illustrations of the policies and their performance, via numerical results, for some typical parameters.

Optimal sequential wireless relay placement on a random lattice path

Our work is motivated by impromptu (or ``as-you-go'') deployment of wireless relay nodes along a path, a need that arises in many situations. In this paper, the path is modeled as starting at the origin (where there is the data sink, e.g., the control center), and evolving randomly over a lattice in the positive quadrant. A person walks along the path deploying relay nodes as he goes. At each step, the path can, randomly, either continue in the same direction or take a turn, or come to an end, at which point a data source (e.g., a sensor) has to be placed, that will send packets to the data sink. A decision has to be made at each step whether or not to place a wireless relay node. Assuming that the packet generation rate by the source is very low, and simple link-by-link scheduling, we consider the problem of sequential relay placement so as to minimize the expectation of an end-to-end cost metric (a linear combination of the sum of convex hop costs and the number of relays placed). This impromptu relay placement problem is formulated as a total cost Markov decision process. First, we derive the optimal policy in terms of an optimal placement set and show that this set is characterized by a boundary (with respect to the position of the last placed relay) beyond which it is optimal to place the next relay. Next, based on a simpler one-step-look-ahead characterization of the optimal policy, we propose an algorithm which is proved to converge to the optimal placement set in a finite number of steps and which is faster than value iteration. We show by simulations that the distance threshold based heuristic, usually assumed in the literature, is close to the optimal, provided that the threshold distance is carefully chosen. (C) 2014 Elsevier B.V. All rights reserved.

Distribution, Demography, and Conservation of Lion-tailed Macaques (Macaca silenus) in the Anamalai Hills Landscape, Western Ghats, India

The status of the endemic and endangered lion-tailed macaque (Macaca silenus) has not been properly assessed in several regions of the Western Ghats of southern India. We conducted a study in Parambikulam Forest Reserve in the state of Kerala to determine the distribution, demography, and status of lion-tailed macaques. We laid 5km(2) grid cells on the map of the study area (644km(2)) and made four replicated walks in each grid cell using GPS. We gathered data on lion-tailed macaque group locations, demography, and site covariates including trail length, duration of walk, proportion of evergreen forest, height of tallest trees, and human disturbance index. We also performed occupancy modeling using PRESENCE ver. 3.0. We estimated a minimum of 17 groups of macaques in these hills. Low detection and occupancy probabilities indicated a low density of lion-tailed macaques in the study area. Height of the tallest trees correlated positively whereas human disturbance and proportion of evergreen forest correlated negatively with occupancy in grid cells. We also used data from earlier studies carried out in the surrounding Anamalai Tiger Reserve and Nelliyampathy Hills to discuss the conservation status in the large Anamalai Hills Landscape. This landscape harbors an estimated population of 1108 individuals of lion-tailed macaques, which is about one third of the entire estimated wild population of this species. A conservation plan for this landscape could be used as a model for conservation in other regions of the Western Ghats.

Markov chains, R-trivial monoids and representation theory

We develop a general theory of Markov chains realizable as random walks on R-trivial monoids. It provides explicit and simple formulas for the eigenvalues of the transition matrix, for multiplicities of the eigenvalues via Mobius inversion along a lattice, a condition for diagonalizability of the transition matrix and some techniques for bounding the mixing time. In addition, we discuss several examples, such as Toom-Tsetlin models, an exchange walk for finite Coxeter groups, as well as examples previously studied by the authors, such as nonabelian sandpile models and the promotion Markov chain on posets. Many of these examples can be viewed as random walks on quotients of free tree monoids, a new class of monoids whose combinatorics we develop.

As-You-Go Deployment of a 2-Connected Wireless Relay Network for Sensor-Sink Interconnection

A person walks along a line (which could be an idealisation of a forest trail, for example), placing relays as he walks, in order to create a multihop network for connecting a sensor at a point along the line to a sink at the start of the line. The potential placement points are equally spaced along the line, and at each such location the decision to place or not to place a relay is based on link quality measurements to the previously placed relays. The location of the sensor is unknown apriori, and is discovered as the deployment agent walks. In this paper, we extend our earlier work on this class of problems to include the objective of achieving a 2-connected multihop network. We propose a network cost objective that is additive over the deployed relays, and accounts for possible alternate routing over the multiple available paths. As in our earlier work, the problem is formulated as a Markov decision process. Placement algorithms are obtained for two source location models, which yield a discounted cost MDP and an average cost MDP. In each case we obtain structural results for an optimal policy, and perform a numerical study that provides insights into the advantages and disadvantages of multi-connectivity. We validate the results obtained from numerical study experimentally in a forest-like environment.

Seis passeios pelas praias de uma ficção: notas sobre algumas movimentações de drag queens na cidade do Rio de Janeiro

O presente trabalho tem por objetivo traçar breves notas sobre algumas movimentações de drag queens e outras artistas da travestilidade que tiveram lugar na cidade do Rio de Janeiro, nos anos de 2009 e 2010. Através de um trabalho de observação participante, foram selecionados alguns locais e espetáculos que poderiam ser representativos desta categoria artística, não se pretendendo um levantamento extenso sobre quem são e onde estão tais artistas. Nomeio como artistas da travestilidade aqueles corpos que têm o ato de travestir-se como central em sua construção artístico-cultural, principalmente construindo corporalidades baseadas em um gênero diferente daquele identificado socialmente no nascimento, como drag queens, atores transformistas, travestis e transexuais artistas. Apoiando-me em pressupostos dos métodos cartográfico e etnográfico assumi, nesta dissertação, o posicionamento de um pesquisador-espectador, objetivando o contato com aquilo que drag queens e outras artistas da travestilidade desejam tornar público, ou seja, seus shows e espetáculos. Acompanhei diversas apresentações deste tipo em teatros, boates, bares e clubes de bairro, bem como em outros locais nos quais se fizeram presentes, como na Parada do Orgulho LGBT do Rio de Janeiro e em alguns blocos do carnaval carioca. Tendo ainda como campo de diálogo alguns postulados da Esquizoanálise vertente teórica fundamentada principalmente nas contribuições de Gilles Deleuze e Félix Guattari , pretendi situar e afirmar as drag queens e a arte da travestilidade dentro dos estudos de gênero e sexualidade, principalmente aqueles mais diretamente relacionados às manifestações de uma subcultura camp e cultura gay e/ou homossexual.

Da rua para a rua: percursos para uma performance

Partindo do corpo que caminha pela cidade, com ou sem rumo, a presente dissertação procura investigar as relações que cercam essa simples ação, levando em consideração, inclusive, a roupa que esse homem veste. O corpo é discutido, tentando encontrar modos mais viscerais para um contato com a realidade operante e arquitetar novas narrativas. A caminhada é o mais simples ato para a (des)apropriação de territórios a serem experimentados. A roupa é a fronteira entre o corpo e a cidade. A camuflagem aparece como um meio eficiente de contactar o corpo com o meio e sua lógica atravessa nosso contato com o mundo. As cidades, suas ruas e espaços públicos solicitam o uso coletivo e se entregam satisfeitos às intervenções urbanas. O texto segue visitando trabalhos que cruzam esse conjunto, buscando desvios nos espaços e resignificando objetos abundantes que se apresentam sem finalidade, procurando inverter lógicas vigentes para realizar outros usos do corpo, da roupa e da cidade

A poética do sublime na teoria da tragédia de Friedrich Schiller

Em sua breve carreira filosófica, o poeta e dramaturgo alemão Friedrich Schiller (1759-1805) se apropriou do conceito kantiano do sublime, identificando-o ao trágico e à tragédia, manifestação artística que seria genuinamente regulada por princípios estéticos daquela ordem. Deste modo, buscamos neste trabalho relacionar o caráter subjetivo da experiência do sublime com as suas implicações de ordem prática para a arquitetura da tragédia, em especial as que dizem respeito à estrutura ideal do drama, intimamente vinculada à sua finalidade, que é a efetivação do efeito estético que lhe cabe por definição. Se, por uma via, o pensamento de Schiller caminha em direção ao desenvolvimento de uma concepção do trágico a partir de um dos conceitos fundamentais da estética moderna, por outra ele permanece atrelado à tradição aristotélica quando se concentra no estudo da tragédia enquanto gênero literário e busca por meio deste estudo estabelecer regras para a citação dramatúrgica. Assim, Schiller constrói uma poética do sublime, um programa de arte que inaugura um debate importante sobre o fenômeno do trágico na filosofia alemã. Mas, como pretendemos defender, é justamente a concepção do trágico forjada a partir de uma interpretação acentuadamente moral do sublime que torna o conteúdo de sua teoria da tragédia problemático, embora tal teoria seja a resposta encontrada por Schiller para perguntas ainda pertinentes. Afinal, por que nos entretêm assuntos trágicos?

Patterns of Impact Resulting from a 'Sit Less, Move More' Web-Based Program in Sedentary Office Employees

Purpose Encouraging office workers to 'sit less and move more' encompasses two public health priorities. However, there is little evidence on the effectiveness of workplace interventions for reducing sitting, even less about the longer term effects of such interventions and still less on dual-focused interventions. This study assessed the short and mid-term impacts of a workplace web-based intervention (Walk@WorkSpain, W@WS; 2010-11) on self-reported sitting time, step counts and physical risk factors (waist circumference, BMI, blood pressure) for chronic disease. Methods Employees at six Spanish university campuses (n=264; 42 +/- 10 years; 171 female) were randomly assigned by worksite and campus to an Intervention (used W@WS; n=129; 87 female) or a Comparison group (maintained normal behavior; n=135; 84 female). This phased, 19-week program aimed to decrease occupational sitting time through increased incidental movement and short walks. A linear mixed model assessed changes in outcome measures between the baseline, ramping (8 weeks), maintenance (11 weeks) and follow-up (two months) phases for Intervention versus Comparison groups. Results A significant 2 (group) x 2 (program phases) interaction was found for self-reported occupational sitting (F[3]=7.97, p=0.046), daily step counts (F[3]=15.68, p=0.0013) and waist circumference (F[3]=11.67, p=0.0086). The Intervention group decreased minutes of daily occupational sitting while also increasing step counts from baseline (446 +/- 126; 8,862 +/- 2,475) through ramping (+425 +/- 120; 9,345 +/- 2,435), maintenance (+422 +/- 123; 9,638 +/- 3,131) and follow-up (+414 +/- 129; 9,786 +/- 3,205). In the Comparison group, compared to baseline (404 +/- 106), sitting time remained unchanged through ramping and maintenance, but decreased at follow-up (-388 +/- 120), while step counts diminished across all phases. The Intervention group significantly reduced waist circumference by 2.1cms from baseline to follow-up while the Comparison group reduced waist circumference by 1.3cms over the same period. Conclusions W@WSis a feasible and effective evidence-based intervention that can be successfully deployed with sedentary employees to elicit sustained changes on "sitting less and moving more".

A reversible infinite HMM using normalised random measures

Copyright 2014 by the author(s). We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Markov chain. The resulting prior over infinite transition matrices is closely related to the hierarchical Dirichlet process but enforces reversibility. A reinforcement scheme has recently been proposed with similar properties, but the de Finetti measure is not well characterised. We take the alternative approach of explicitly constructing the mixing measure, which allows more straightforward and efficient inference at the cost of no longer having a closed form predictive distribution. We use our process to construct a reversible infinite HMM which we apply to two real datasets, one from epigenomics and one ion channel recording.