[Abstract]: The disposal of animal waste has become a problem in many parts of the world due to the rapid growth in the number and the size of intensive animal industries. Safe waste disposal sites are rarely available and the relocation and/or treatment of animal waste is seldom economically viable. The reuse of animal waste for energy recovery and re-feeding is also not popular. Animal waste is a valuable source of plant nutrients and a very good soil conditioner, and has been commonly applied as fertiliser to agricultural fields. However, due to the increasing oversupply of animal waste in recent years, it has often been applied in excess to the agricultural fields. Excessive application of animal waste, without due consideration of its implications, is a serious concern. The run-off and leaching losses of nutrients from the fields fertilised with animal waste have contributed significantly to the eutrophication and toxic blue-green algae blooms in surface water systems and nitrification of ground water systems. It has also led to nutrient imbalances in the soils and odour pollution to the surrounding communities. The animal waste, which is a valuable source of plant nutrients, has thus become both an economic and environmental burden, and there is a need to develop a strategy for its sensible use as a fertiliser in agricultural fields. Sensible use of animal waste involves the consideration of all the agricultural, environmental, social, and economical limitations. A rational method of achieving this is to restrict the use of animal waste to sites suitable for such uses, identify areas where it can be relocated and applied economically, limit the application rates to a safe level, and observe appropriate manure management practices. This study addressed each of these components by developing a comprehensive manure application plan (MAP) for the site-specific use of animal waste as fertiliser in agricultural fields. Various geographic information systems (GIS) based techniques, including a weighted linear combination model and map algebra based cartographic modelling, were employed to achieve the goal. The appropriateness of the existing techniques and procedures were evaluated and modified to meet the current input requirements. New methods of analysis were devised as necessary. The Westbrook sub-catchment of the Condamine River catchment in south-east Queensland was selected as the study area. The sub-catchment covers 24,903 hectares and contains 39 intensive animal industries. The catchment is also a part of the Murray-Darling Basin, which has been suffering from toxic blue green algae blooms recurrently since 1991. This study identified that only about one-fifth of the sub-catchment area is suitable for animal waste application. Depending on the method of site suitability analysis and the number of input factors used the suitable area ranged between 16 and 22 percent. This comparatively small area is mainly due to the presence of a large proportion of non-agricultural areas in the sub-catchment. The suitable areas were also found to have various degrees of suitability for waste application. However, the degree of site suitability was affected by the number of input factors used in the analysis, the weighting of the factors, and the method of factor attribute standardisation. Conventional methods of weighting input factors were found to be cumbersome and not particularly suitable. Hence, this study developed a new ‘objective oriented comparison’ method of factor weighting. Standardisation of input factors using a continuous, rather than discrete, classification (ie fuzzy set) method was found to be more consistent in degree of suitability determination. The discrete classification of factor attributes into classes of different numbers and sizes, and the weighting of classes to a sum of one, were identified as a limitation in using this standardisation method. A new ‘weight adjustment’ method was devised and demonstrated to reduce factor-weighting biases. The suitable sites, degree of site suitability, and other relevant spatial and non-spatial information were processed within a GIS framework to develop a comprehensive manure application plan. The inherently high presence of available phosphorus in the soils of the study area was recognised and the P2O5 content in the manure was used as the basis for determining manure application rates. A complimentary nitrogen supply map was also generated. Manure management practices applicable to the areas with a lower degree of suitability were also suggested.

Wildfire hazard and its destructive consequences have become a growing issue around the world especially in the context of global warming. An effective and efficient fire simulation model will make it possible to predict the fire spread and assist firefighters in the process of controlling the damage and containing the fire area. Simulating wildfire spread remains challenging due to the complexity of fire behaviors. The raster-based method and the vector-based method are two major approaches that allow one to perform computerized fire spread simulation. In this thesis, we present a scheme we have developed that utilizes a level set method to build a fire spread simulation model. The scheme applies the strengths and overcomes some of the shortcomings of the two major types of simulation method. We store fire data and local rules at cells. Instead of calculating which are the next ignition points cell by cell, we apply Huygens' principle and elliptical spread assumption to calculate the direction and distance of the expanding fire by the level set method. The advantage to storing data at cells is that it makes our simulation model more suitable for heterogeneous fuel and complex topographic environment. Using a level set method for our simulation model makes it possible to overcome the crossover problem. Another strength of the level set method is its continuous data processing. Applying the level set method in the simulation models, we need fewer vector points than raster cells to produce a more realistic fire shape. We demonstrate this fire simulation model through two implementations using narrow band level set method and fast marching method. The simulated results are compared to the real fire image data generated from Troy and Colina fires. The simulation data are then studied and compared. The ultimate goal is to apply this simulation model to the broader picture to better predict different types of fires such as crown fire, spotting fires, etc.

Given a grid of cells, each having a value indicating its cost per unit area, a variant of the least-cost path problem is to find a corridor of a specified width connecting two termini such that its cost-weighted area is minimized. A computationally efficient method exists for finding such corridors, but as is the case with conventional raster-based least-cost paths, their incremental orientations are limited to a fixed number of (typically eight orthogonal and diagonal) directions, and therefore, regardless of the grid resolution, they tend to deviate from those conceivable on the Euclidean plane. Additionally, these methods are limited to problems found on two-dimensional grids and ignore the ever-increasing availability and necessity of three-dimensional raster based geographic data. This thesis attempts to address the problems highlighted above by designing and testing least-cost corridor algorithms. First a method is proposed for solving the two-dimensional raster-based least-cost corridor problem with reduced distortion by adapting a distortion reduction technique originally designed for least-cost paths and applying it to an efficient but distortionprone least-cost corridor algorithm. The proposed method for distortion reduction is, in theory, guaranteed to generate no less accurate solutions than the existing one in polynomial time and, in practice, expected to generate more accurate solutions, as demonstrated experimentally using synthetic and real-world data. A corridor is then modeled on a threedimensional grid of cost-weighted cubic cells or voxels as a sequence of sets of voxels, called ‘neighborhoods,’ that are arranged in a 26-hedoral form, design a heuristic method to find a sequence of such neighborhoods that sweeps the minimum cost-weighted volume, and test its performance with computer-generated random data. Results show that the method finds a low-cost, if not least-cost, corridor with a specified width in a threedimensional cost grid and has a reasonable efficiency as its complexity is O(n2) where n is the number of voxels in the input cost grid and is independent of corridor width. A major drawback is that the corridor found may self-intersect, which is often not only an undesirable quality but makes the estimation of its cost-weighted volume inaccurate. / Med tanke på ett rutnät av celler, som vart och ett har ett värde som indikerar dess kostnad per areaenhet, är en variant av det billigaste banproblemet att hitta en korridor med en specificerad bredd som förbinder två terminaler så att dess kostnadsviktade område minimeras. Det finns en beräkningseffektiv metod för att hitta sådana korridorer, men som är fallet med konventionella rasterbaserade lägsta kostnadsspår är deras inkrementella orienteringar begränsade till ett fast antal (vanligtvis åtta ortogonala och diagonala) riktningar, och därför, oavsett nätupplösning tenderar de att avvika från de tänkbara på det euklidiska planet. Dessutom är dessa metoder begränsade till problem som finns i tvådimensionella nät och ignorerar den ständigt ökande tillgängligheten och nödvändigheten av tredimensionell rasterbaserad geografisk data. Denna avhandling försöker ta itu med problemen som belyses ovan genom att utforma och testa korridoralgoritmer till lägsta kostnad. Först föreslås en metod för att lösa det tvådimensionella rasterbaserade problemet med billigaste korridorer med minskad förvrängning genom att anpassa en distorsionsminskningsteknik som ursprungligen utformades för billigaste vägar och tillämpa den på en effektiv men distorsionsbenägen billigaste korridoralgoritm. Den föreslagna metoden för distorsionsminskning är i teorin garanterad att generera inte mindre exakta lösningar än den befintliga i polynomtid och i praktiken förväntas generera mer exakta lösningar, vilket demonstreras experimentellt med syntetiska och verkliga data. En korridor modelleras sedan på ett tredimensionellt rutnät av kostnadsvägda kubikceller eller voxels som en sekvens av uppsättningar av voxels, kallade "stadsdelar", som är ordnade i en 26-hedoral form, designar en heuristisk metod för att hitta en sekvens av sådana stadsdelar som sveper den lägsta kostnadsviktade volymen och testar dess prestanda med datorgenererade slumpmässiga data. Resultaten visar att metoden hittar en låg kostnad, om inte minst kostnad, korridor med en specificerad bredd i ett tredimensionellt kostnadsnät och har en rimlig effektivitet eftersom dess komplexitet är O (n2) där n är antalet voxlar i ingångskostnadsnätet och är oberoende av korridorbredd En stor nackdel är att korridoren som hittas kan korsa sig själv, vilket ofta inte bara är en oönskad kvalitet utan gör uppskattningen av dess kostnadsviktade volym felaktig. / <p>QC 20210309</p>