Pancake flipping, a famous open problem in computer science, can be formalised as the problem of sorting a permutation of positive integers using as few prefix reversals as possible. In that context, a prefix reversal of length k reverses the order of the first k elements of the permutation. The burnt variant of pancake flipping involves permutations of signed integers, and reversals in that ca...

During January and February 2003 vast areas of Australia’s Alpine areas were burnt during a series of massive bushfires (see Fig. 1 in Bureau of Meteorology (2003)). While not minimising any part of the period, two days stand out meteorologically. The first was 18 January 2003, when fires caused the deaths of four people, many other injuries, the loss of over 500 houses and other infrastructure...

Rocha e Silva and Rosenthal (1) have reported that the exudates from burnt rat skin contain histamine, bradykinin, adenosine derivatives and possibly serotonin and other as yet unidentified pharmacologically active and toxic substances. Hodson (2) has reported the peripheral antiserotonin activity of B.W. 501 C 67 (α-anilino-N-2-m-chlorophenoxypropyl acetamidine hydrochloride monohydrate)...

It is a fact that Mediterranean Europe suffers severe wildfire events, as it occurred in summer 2003. The Valencia de Alcántara fire that took place near the border between Portugal and Spain, was one of the mentioned events. The present paper tries to evaluate how reliable are burnt area estimations made from medium resolution satellite images, processed and delivered in near real time. In ord...

Digital elevation models (DEM) of the four catchments were imported into E2, and subcatchment boundaries were delineated. Rainfall surfaces derived from spatial interpolation of ground-based observation data onto a 5 km x 5 km grid was pre-processed to provide a weighted average daily rainfall for each sub-catchment. Data of long term mean monthly potential evapotranspiration (PET) was also use...

We prove that a stack of n pancakes is rearranged in all n! ways by repeatedly applying the following rule: Flip the maximum number of pancakes that gives a new stack. This complements the previously known pancake flipping Gray code (S. Zaks, A New Algorithm for Generation of Permutations BIT 24 (1984), 196–204) which we also describe as a greedy algorithm: Flip the minimum number of pancakes t...