Matching Items (1,390)
Filtering by

Clear all filters

ContributorsASU Library. Music Library (Publisher)
Created2018-04-09
150111-Thumbnail Image.png
Description
Finding the optimal solution to a problem with an enormous search space can be challenging. Unless a combinatorial construction technique is found that also guarantees the optimality of the resulting solution, this could be an infeasible task. If such a technique is unavailable, different heuristic methods are generally used to

Finding the optimal solution to a problem with an enormous search space can be challenging. Unless a combinatorial construction technique is found that also guarantees the optimality of the resulting solution, this could be an infeasible task. If such a technique is unavailable, different heuristic methods are generally used to improve the upper bound on the size of the optimal solution. This dissertation presents an alternative method which can be used to improve a solution to a problem rather than construct a solution from scratch. Necessity analysis, which is the key to this approach, is the process of analyzing the necessity of each element in a solution. The post-optimization algorithm presented here utilizes the result of the necessity analysis to improve the quality of the solution by eliminating unnecessary objects from the solution. While this technique could potentially be applied to different domains, this dissertation focuses on k-restriction problems, where a solution to the problem can be presented as an array. A scalable post-optimization algorithm for covering arrays is described, which starts from a valid solution and performs necessity analysis to iteratively improve the quality of the solution. It is shown that not only can this technique improve upon the previously best known results, it can also be added as a refinement step to any construction technique and in most cases further improvements are expected. The post-optimization algorithm is then modified to accommodate every k-restriction problem; and this generic algorithm can be used as a starting point to create a reasonable sized solution for any such problem. This generic algorithm is then further refined for hash family problems, by adding a conflict graph analysis to the necessity analysis phase. By recoloring the conflict graphs a new degree of flexibility is explored, which can further improve the quality of the solution.
ContributorsNayeri, Peyman (Author) / Colbourn, Charles (Thesis advisor) / Konjevod, Goran (Thesis advisor) / Sen, Arunabha (Committee member) / Stanzione Jr, Daniel (Committee member) / Arizona State University (Publisher)
Created2011
ContributorsJin, Leon (Performer) / Duo, Hongzuo (Performer) / Bergstedt, David (Performer) / Ellis, Gage (Performer) / Novak, Gail (Performer) / ASU Library. Music Library (Publisher)
Created2021-02-24
ContributorsASU Library. Music Library (Publisher)
Created2021-02-22
ContributorsWaters, Jared (Performer) / Creviston, Hannah (Performer) / Liu, Miao (Performer) / Guo, Hongzuo (Performer) / DeLaCruz, Nathaniel (Performer) / LoGuidice, Rosa (Performer) / Chiko, Ty (Performer) / Gatchel, David (Performer) / ASU Library. Music Library (Publisher)
Created2021-01-28
ContributorsKosminov, Vladislav (Performer) / Solari, John (Performer) / Liu, Shiyu (Performer) / Huang, Anruo (Performer) / Holly, Sean (Performer) / Novak, Gail (Performer) / Yang, Elliot (Performer) / Wu, Selene (Performer) / Kinnard, Zachariah (Performer) / Kuebelbeck, Stephen (Performer) / Johnson, Kaitlyn (Performer) / Bosworth, Robert (Performer) / Matejek, Ryan (Performer) / ASU Library. Music Library (Publisher)
Created2021-01-27
ContributorsASU Library. Music Library (Publisher)
Created2021-04-22
ContributorsSuehiro, Dylan (Conductor) / Kelley, Karen (Performer) / Ladley, Teddy (Performer) / ASU Library. Music Library (Publisher)
Created2021-04-19
ContributorsASU Library. Music Library (Publisher)
Created2021-04-12
152264-Thumbnail Image.png
Description
In order to cope with the decreasing availability of symphony jobs and collegiate faculty positions, many musicians are starting to pursue less traditional career paths. Also, to combat declining audiences, musicians are exploring ways to cultivate new and enthusiastic listeners through relevant and engaging performances. Due to these challenges, many

In order to cope with the decreasing availability of symphony jobs and collegiate faculty positions, many musicians are starting to pursue less traditional career paths. Also, to combat declining audiences, musicians are exploring ways to cultivate new and enthusiastic listeners through relevant and engaging performances. Due to these challenges, many community-based chamber music ensembles have been formed throughout the United States. These groups not only focus on performing classical music, but serve the needs of their communities as well. The problem, however, is that many musicians have not learned the business skills necessary to create these career opportunities. In this document I discuss the steps ensembles must take to develop sustainable careers. I first analyze how groups build a strong foundation through getting to know their communities and creating core values. I then discuss branding and marketing so ensembles can develop a public image and learn how to publicize themselves. This is followed by an investigation of how ensembles make and organize their money. I then examine the ways groups ensure long-lasting relationships with their communities and within the ensemble. I end by presenting three case studies of professional ensembles to show how groups create and maintain successful careers. Ensembles must develop entrepreneurship skills in addition to cultivating their artistry. These business concepts are crucial to the longevity of chamber groups. Through interviews of successful ensemble members and my own personal experiences in the Tetra String Quartet, I provide a guide for musicians to use when creating a community-based ensemble.
ContributorsDalbey, Jenna (Author) / Landschoot, Thomas (Thesis advisor) / McLin, Katherine (Committee member) / Ryan, Russell (Committee member) / Solis, Theodore (Committee member) / Spring, Robert (Committee member) / Arizona State University (Publisher)
Created2013