Dean Burry






















Dean Burry
Born 1972 (age 45–46)
Origin
St. John's, Newfoundland, Canada
Genres
Classical, opera
Occupation(s) composer, educator, librettist

Dean Burry (born 1972 in St. John's, Newfoundland) is a Canadian composer, librettist, and educator. He is known for being one of the composers of The Hobbit.[1]




Contents






  • 1 Early life


  • 2 College


  • 3 Awards


  • 4 Works


  • 5 See also


  • 6 References


  • 7 External links





Early life


Burry began his passion in music at age 10. He was inspired by a teacher to compete in piano competitions. He was also interested in theater, writing plays and musicals for his school drama club.



College


Burry first attended college at Mount Allison University in Sackville, New Brunswick. While at Mount Allison, he produced and conducted The Resurrection, Joe and Mary Had a Baby, and Unto the Earth: Vignettes of a War. He later went to the University of Toronto and studied composition studies.



Awards


  • In 2011, Burry was given the Louis Applebaum Composers Award.


Works



  • Under the Night

  • The Heart That Knows and Home and Away for Live Bait Theatre

  • Songs of the Island for the Charlottetown Festival

  • The Hobbit and The Secret World of OG for the Canadian Children’s Opera Company

  • Isis and the Seven Scorpions for the Canadian Opera

  • A Creature of Habit

  • The Mummers’ Masque

  • Baby Kintyre

  • The Bremen Town Musicians

  • Angela and Her Sisters

  • Le nez de la sorcière


  • Pandora’s Locker[2]



See also



  • Music Contributors from The Hobbit

  • List of Canadian composers

  • List of University of Toronto people



References





  1. ^ Dean Burry, composer of The Hobbit visits Sarasota to promote the opera | HeraldTribune.com


  2. ^ The official website of composer/librettist Dean Burry - Home




External links


  • Dean Burry Interview on Brothers Grimm opera



-

Popular posts from this blog

Xamarin.iOS Cant Deploy on Iphone

Image
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } -1 I have a windows laptop and a mac mini my problem is that It wont deploy on iphone if I use Visual Studio Xamarin on windows to install my app, but it works fine with Visual Studio For Mac. Here's what I get after build succeded on Visual Studio Xamarin on windows : 1>------ Build started: Project: FinalCustomerApp.iOS, Configuration: Debug iPhone ------ 1> Connecting to Mac server 192.168.8.100... 1> FinalCustomerApp.iOS -> C:UsersJeremy PaulDesktopFinalCustomerAppFinalCustomerAppFinalCustomerApp.iOSbiniPhoneDebugFinalCustomerApp.iOS.exe 1> Detected signing identity: 1> Code Signing Key: &quo
Read more

Glorious Revolution

Image
"The Bloodless Revolution" redirects here. For a history of the vegetarian movement, see The Bloodless Revolution (book). This article is about the English revolution of 1688. For the revolution of 1868 in Spain, see Glorious Revolution (Spain). For other uses, see Glorious Revolution (disambiguation). Glorious Revolution The Prince of Orange lands at Torbay Date 1688–1689 Location British Isles Also known as Revolution of 1688 War of the English Succession Bloodless Revolution Participants English, Welsh and Scottish society, Dutch forces Outcome Replacement of James II by William III and Mary II Jacobite rising of 1689 Williamite War in Ireland War with France; England and Scotland join Grand Alliance Drafting of the Bill of Rights 1689 Part of a series on the History of England Timeline Prehistoric Britain Roman Britain Sub-Roman Britain Medieval period Economy in the Middle Ages Anglo-Saxon period
Read more

Dulmage-Mendelsohn matrix decomposition in Python

Image
0 Matlab has a function called dmperm that computes the so-called Dulmage–Mendelsohn decomposition of a n x n matrix. From wikipedia, the Dulmage–Mendelsohn is a partition of the vertices of a bipartite graph into subsets, with the property that two adjacent vertices belong to the same subset if and only if they are paired with each other in a perfect matching of the graph. Looking both on scipy and numpy, I could not find this function, nor some similar version. Is it possible to implement it using basic linear algebra operations? Any idea if this is implemented in some Python package? python matlab linear-algebra graph-theory matrix-decomposition share | improve this question
Read more