John Rutter, a world-famous British choral conductor and composer, was educated well in his childhood and the choral experience during that time has helped him to become an outstanding musician. After he was well-known, he not only established the Cambridge Singers and Collegium label, but also spared no pains to spread choral music such as being a guest-conductor or lecturer around the world. Three Birthday Madrigals was completed in 1997. It¡¦s for two to four part female chorus and is a rearrangement from Birthday Madrigals, a choral suite including five pieces of music for mixed choir that was commissioned by Brian Kay to celebrate the seventy-fifth birthday of the great jazz pianist, George Shearing, in 1995. The texts of Three Birthday Madrigals all came from the eminent poet of Elizabethan Era of the late Renaissance Period; The first piece It was a lover and his lass came from William Shakespeare¡¦s As You Like It, the second piece My true love hath my heart is a sonnet, coming from Sir Philip Sidney¡¦s Arcadia, and the third piece When daisies pied combined William Shakespeare¡¦s Love's Labour's Lost with George Peele¡¦s The Old Wives¡¦ Tale. Rutter used two distinguished styles in Three Birthday Madrigals. He applied the jazz style to describe the delightful feeling of the first piece and the relaxing and pleasing feeling of the third piece. He utilized the English Partsong tradition when expressing the touching and profound love of the second piece. The most noticeable feature of the first piece is the dotted rhythm. Rutter indicated that the dotted eighth and sixteenth notes should be performed with a two-to-one ratio to interpret the swing style. The piano accompaniment sentence is extremely important, and improvisation-like manner will determine the jazz flavor firmly. The second piece preserves the unique aesthetic quality of pure human voices by having the singing a cappella. The first soprano part carries the melody most of time with the other voices supplying the harmonies. The third piece is a jazz waltz. It is similar with the first piece; the piano accompaniment plays an important role in creating atmosphere jazz and in enriching the musical color. Rutter applied smooth line against syncopation and clothed each section with legato and staccato simultaneously to make contrast. Therefore, when interpreting this piece, the choir should express the contrast clearly to make the music lively and attractive. This master report consists of seven parts: the preface, a biographic sketch of John Rutter, Rutter¡¦s compositional genres, Rutter¡¦s choral music, a biographic sketch of three poets, analysis and interpretation of Three Birthday Madrigals, and the conclusion. There are two appendices at the end of this paper. Appendix A supplies two e-mail letters from Rutter. Appendix B is a list of Rutter¡¦s published secular choral music.

Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico, Programa de Pós-graduação em Engenharia Ambiental, Florianópolis, 2009 / Made available in DSpace on 2012-10-24T08:19:48Z (GMT). No. of bitstreams: 1 266545.pdf: 2280543 bytes, checksum: 0e07f38848d7a720151dd8059f722695 (MD5) / O presente trabalho investigou o processo chuva-vazão da bacia do Rio Saci através de monitoramento e modelagem hidrológica, com ênfase no processo de interceptação. Essa bacia tem 10,2 ha, sendo que 8,7 ha são compostos de pinus e o restante mata nativa. A interceptação foi estimada através da medição de precipitação total, precipitação interna e escoamento de tronco. Foram obtidos dados com resolução temporal de 10 min com início no dia 23/08/2008 e final no dia 17/11/2008. Uma série de vazão de mesmo tamanho foi medida através do uso de um vertedor acoplado a uma calha parshall e com um sensor de nível ligado a um datalogger. A evapotranspiração potencial para o período foi calculada com o modelo de Penman modificado usando dados do INMET. O modelo de Rutter esparso e o Tank Model com 4 tanques foram utilizados para modelagem do processo chuva-vazão. O método GLUE foi utilizado para análise de incerteza e sensibilidade dos modelos. A evapotranspiração potencial máxima calculada foi de 0,11 mm/10 min e mínima de 0,01 mm/10 min. A precipitação total medida foi de 665 mm e a precipitação interna, escoamento de tronco e perda por interceptação corresponderam a 71,2%, 7,4% e 21,4% da precipitação total, respectivamente. O modelo de Rutter esparso mostrou-se satisfatório para simulação da interceptação e apresentou maior sensibilidade aos parâmetros de armazenamento e a proporção de água desviada de copa para tronco. A série de vazão monitorada foi dividida em três outras sub-séries: Série 1 (seca), Série 2 (transição) e Série 3 (úmida). O Tank Model usando precipitação total (Tank Pg), precipitação líquida e o Tank Model com modelo de Rutter esparso acoplado foi aplicado nas três séries. Todos os modelos mostraram-se com resultados semelhantes nas Série 2 e 3. Porém, a calibração do Tank Pg com precipitação total na fase seca foi muito inferior aos demais, mostrando a importância da interceptação nesse caso. / This work investigated the rainfall-runoff process of the Saci River catchment through hydrological monitoring and modeling, emphasizing the interception aspects of it. This catchment area is approximately 10.2 ha, in which around 8.7 ha are Pinus sp. afforestment while 1.5 ha is considered to be native forest. Rainfall interception was estimated indirectly by measuring gross rainfall, throughfall and stemflow. A series of data starting from the 23/08/2008 to the 17/11/2008 with 10 min time resolution was obtained. A discharge time series of the same length temporal resolution as rainfall was measured by using a Parshall flume coupled with a weir system and with a water level gauge connected to a datalogger. Potential evapotranspiration was calculated for the same period using the modified Penman method and INMET data. Rainfall interception and rainfall-runoff process was simulated with the Sparse Rutter Model and with the Tank Model, respectively. The GLUE method was used for uncertainty and sensitivity analysis of both models. The maximum potential evapotranspiration calculated was 0.11 mm/10 min and the minimum was 0.01 mm/10 min. The total amount of gross rainfall measured was 665 mm and throughfall, stemflow and interception corresponded to 71.2%, 7.4% and 21.4% of gross rainfall, respectively. The Sparse Rutter Model showed satisfactory results in simulating interception and greater sensitivity to the storage and to the drainage partitioning coefficient parameters. The discharge series was subdivided in three other series: Series 1 (dry), Series 2, (transition) and Series 3 (humid). The Tank Model with gross rainfall input (Tank Pg), the Tank Model with net rainfall input and the Tank Model coupled with the Sparse Rutter Model were applied in all those discharge series. All models showed similar results when applied to Series 1 and 2. However, the simulation results using Tank Pg in the dry series was inferior to the other models. This shows that interception plays a major role for rainfall-runoff simulation especially in dry climate conditions.

Gabriel Fauré’s Requiem, Op. 48 was an evolving work, which he continued to revise from its inception in 1887 until the published version of 1900. The focus and intent of this paper is to present a detailed analysis of Requiem, Op. 48 as well as historical background to aid conductors in the preparation and performance of this work. Discussions include the history of the requiem mass as a liturgical form, the evolution of Requiem, Op. 48, the John Rutter edition (1984) and his research, and a conductor’s analysis addressing issues of harmony, form, and style.

Gabriel Fauré’s Requiem, Op. 48 was an evolving work, which he continued to revise from its inception in 1887 until the published version of 1900. The focus and intent of this paper is to present a detailed analysis of Requiem, Op. 48 as well as historical background to aid conductors in the preparation and performance of this work. Discussions include the history of the requiem mass as a liturgical form, the evolution of Requiem, Op. 48, the John Rutter edition (1984) and his research, and a conductor’s analysis addressing issues of harmony, form, and style.

Planners who are involved in locational decision making often use raster-based geographic information systems (GIS) to quantify the value of land in terms of suitability or cost for a certain use. From a computational point of view, this process can be seen as a transformation of one or more sets of values associated with a grid of cells into another set of such values through a function reflecting one or more criteria. While it is generally anticipated that different transformations lead to different ‘best’ locations, little has been known on how such differences arise (or do not arise). Examples of such spatial decision problems can be easily found in the literature and many of them concern the selection of a set of cells (to which the land use under consideration is allocated) from a raster surface of suitability or cost depending on context. To facilitate GIS’s algorithmic approach, it is often assumed that the quality of the set of cells can be evaluated as a whole by the sum of their cell values. The validity of this assumption must be questioned, however, if those values are measured on a scale that does not permit arithmetic operations. Ordinal scale of measurement in Stevens’s typology is one such example. A question naturally arises: is there a more mathematically sound and consistent approach to evaluating the quality of a path when the quality of each cell of the given grid is measured on an ordinal scale? The thesis attempts to answer the questions highlighted above in the context of path planning through a series of computational experiments using a number of random landscape grids with a variety of spatial and non-spatial structures. In the first set of experiments, we generated least-cost paths on a number of cost grids transformed from the landscape grids using a variety of transformation parameters and analyzed the locations and (weighted) lengths of those paths. Results show that the same pair of terminal cells may well be connected by different least-cost paths on different cost grids though derived from the same landscape grid and that the variation among those paths is affected by how given values are distributed in the landscape grid as well as by how derived values are distributed in the cost grids. Most significantly, the variation tends to be smaller when the landscape grid contains more distinct patches of cells potentially attracting or distracting cost-saving passage or when the cost grid contains a smaller number of low-cost cells. The second set of experiments aims to compare two optimization models, minisum and minimax (or maximin) path models, which aggregate the values of the cells associated with a path using the sum function and the maximum (or minimum) function, respectively. Results suggest that the minisum path model is effective if the path search can be translated into the conventional least-cost path problem, which aims to find a path with the minimum cost-weighted length between two terminuses on a ratio-scaled raster cost surface, but the minimax (or maximin) path model is mathematically sounder if the cost values are measured on an ordinal scale and practically useful if the problem is concerned not with the minimization of cost but with the maximization of some desirable condition such as suitability. / Planerare som arbetar bland annat med att fatta beslut som hänsyftar till vissa lokaler använder ofta rasterbaserade geografiska informationssystem (GIS) för att sätta ett värde på marken med avseende på lämplighet eller kostnad för en viss användning. Ur en beräkningssynpunkt kan denna process ses som en transformation av en eller flera uppsättningar värden associerade med ett rutnät av celler till en annan uppsättning sådana värden genom en funktion som återspeglar ett eller flera kriterier. Medan det generellt förväntas att olika omvandlingar leder till olika "bästa" platser, har lite varit känt om hur sådana skillnader uppstår (eller inte uppstår). Exempel på sådana rumsliga beslutsproblem kan lätt hittas i litteraturen och många av dem handlar om valet av en uppsättning celler (som markanvändningen övervägs tilldelas) från en rasteryta av lämplighet eller kostnad beroende på kontext. För att underlätta GISs algoritmiska tillvägagångssätt antas det ofta att kvaliteten på uppsättningen av celler kan utvärderas som helhet genom summan av deras cellvärden. Giltigheten av detta antagande måste emellertid ifrågasättas om dessa värden mäts på en skala som inte tillåter aritmetiska transformationer. Användning av ordinal skala enligt Stevens typologi är ett exempel av detta. En fråga uppstår naturligt: Finns det ett mer matematiskt sunt och konsekvent tillvägagångssätt för att utvärdera kvaliteten på en rutt när kvaliteten på varje cell i det givna rutnätet mäts med ordinalskala? Avhandlingen försöker svara på ovanstående frågor i samband med ruttplanering genom en serie beräkningsexperiment med hjälp av ett antal slumpmässigt genererade landskapsnät med en rad olika rumsliga och icke-rumsliga strukturer. I den första uppsättningen experiment genererade vi minsta-kostnad rutter på ett antal kostnadsnät som transformerats från landskapsnätverket med hjälp av en mängd olika transformationsparametrar, och analyserade lägen och de (viktade) längderna för dessa rutter. Resultaten visar att samma par ändpunkter mycket väl kan vara sammanbundna med olika minsta-kostnad banor på olika kostnadsraster härledda från samma landskapsraster, och att variationen mellan dessa banor påverkas av hur givna värden fördelas i landskapsrastret såväl som av hur härledda värden fördelas i kostnadsrastret. Mest signifikant är att variationen tenderar att vara mindre när landskapsrastret innehåller mer distinkta grupper av celler som potentiellt lockar eller distraherar kostnadsbesparande passage, eller när kostnadsrastret innehåller ett mindre antal låg-kostnad celler. Den andra uppsättningen experiment syftar till att jämföra två optimeringsmodeller, minisum och minimax (eller maximin) sökmodeller, vilka sammanställer värdena för cellerna som är associerade med en sökväg med summanfunktionen respektive maximum (eller minimum) funktionen. Resultaten tyder på att minisumbanemodellen är effektiv om sökningen av sökvägen kan översättas till det konventionella minsta kostnadsproblemet, vilket syftar till att hitta en väg med den minsta kostnadsvägda längden mellan två terminaler på en ratio-skalad rasterkostyta, men minimax (eller maximin) banmodellen är matematiskt sundare om kostnadsvärdena mäts i ordinär skala och praktiskt användbar om problemet inte bara avser minimering av kostnad men samtidigt maximering av någon önskvärd egenskap såsom lämplighet. / <p>QC 20181002</p>

Observing the earth from above is a great way of understanding our world better. From space, many complex patterns and relationships on the ground can be identified through high-quality satellite data. The quality and availability of this data in combination with recent advancement in various deep learning techniques allows us to find these patterns more effectively then ever. In this thesis, we will analyze satellite imagery by using deep neural networks in an attempt to find road networks in different cities around the world. Once we have located networks of roads in the cities we will represent them as graphs and deploy the Dijkstra shortest path algorithm to find optimal routes within these networks. Having the ability to efficiently use satellite imagery for near real-time road detection and optimal route prediction has many possible applications, especially from a humanitarian and commercial point of view. For example, in the humanitarian realm, the frequency of natural disasters is unfortunately increasing due to climate change and the need for emergency real-time mapping for relief organisations in the case of a severe flood or similar is growing.  The state-of-the-art deep neural network models that will be implemented, compared and contrasted for this task are mainly based on the U-net and ResNet architectures. However, before introducing these architectures the reader will be given a comprehensive introduction and theoretical background of deep neural networks to distinctly formulate the mathematical groundwork. The final results demonstrates an overall strong model performance across different metrics and data sets, with the highest obtained IoU-score being approximately 0.7 for the segmentation task. For some models we can also see a high degree of similarity between the predicted optimal paths and the ground truth optimal paths. / Att betrakta jorden från ovan är ett bra tillvägagångsätt för att förstå vår egen värld bättre. Från rymden, många komplexa mönster och samband på marken går att urskilja genom hög-upplöst satellitdata. Kvalitén och tillgängligheten av denna data, i kombination med de senaste framstegen inom djupa inlärningstekniker, möjliggör oss att hissa dessa mönster mer effektivt än någonsin. I denna avhandling kommer vi analysera satellitbilder med hjälp av djupa neurala nätverk i ett försök att hitta nätverk av vägar i olika städer runtom i världen. Efter vi har lokaliserat dessa nätverk av vägar så kommer vi att representera nätverken som grafer och använda oss av Dijkstras algoritm för att hitta optimala rutter inom dessa nätverk.  Att ha förmågan att kunna effektivt använda sig av satellitbilder för att i nära realtid kunna identifiera vägar och optimala rutter har många möjliga applikationer. Speciellt ur ett humant och kommersiellt perspektiv. Exempelvis, inom det humanitära området, så ökar dessvärre frekvensen av naturkatastrofer på grund av klimatförändringar och därmed är behovet av nödkartläggning i realtid för hjälporganisationer större än någonsin. En effektiv nödkartläggning skulle exempelvis kunna underlätta enormt vid en allvarlig översvämning eller dylikt.  Dem toppmoderna djupa neurala nätverksmodellerna som kommer implementeras, jämföras och nyanseras för denna uppgift är i huvudsak baserad på U-net och ResNet arkitekturerna. Innan vi presenterar dessa arkitekturer i denna avhandling så kommer läsaren att få en omfattande teoretisk bakgrund till djupa neurala nätverk för att tydligt formulera dem matematiska grundpelarna. Dem slutgiltiga resultaten visar övergripande stark prestanda för samtliga av våra modeller. Både på olika datauppsättningar samt utvärderingsmått. Den högste IoU poängen som uppnås är cirka 0,7 och vi kan även se en hög grad av likhet mellan vissa av våra förutsagda optimala rutter och mark sanningens optimala rutter.