847 resultados para San Francisco Symphony Orchestra
Resumo:
Rowland, J.J. (2002) Interpreting Analytical Spectra with Evolutionary Computation. In: Fogel, G.B. and Corne, D.W. (eds), Evolutionary Computation in Bioinformatics. Morgan Kaufmann, San Francisco, pp 341--365, ISBN 1-55860-797-8
Resumo:
En Tomo V. 2 h. de grabados calcográficos representando monedas de Huesca.
Resumo:
38 hojas : ilustraciones, fotografías.
Resumo:
91 hojas.
Resumo:
40 hojas : ilustraciones, fotografías.
Resumo:
39 hojas : ilustraciones, fotografías.
Resumo:
http://www.archive.org/details/californiapilgri00truerich
Resumo:
This paper introduces the original concept of a cloud personal assistant, a cloud service that manages the access of mobile clients to cloud services. The cloud personal assistant works in the cloud on behalf of its owner: it discovers services, invokes them, stores the results and history, and delivers the results to the mobile user immediately or when the user requests them. Preliminary experimental results that demonstrate the concept are included.
Resumo:
This recording represents the complete solo piano works of Robert Helps (1928-2001). As of this writing (March, 2008), approx.120 minutes of Helps' solo piano music has been published, all of which is included on the Digital Media (CD). This project includes the following works: Trois Hommages, Quartet, Nocturne, Valse Mirage, In Retrospect, Three Etudes, Portrait, Three Etudes for the Left Hand, Starscape, Recollections, Shall We Dance and Image. (His few remaining pieces are officially "pending publication" and are therefore not included in this project.) Robert Helps, American pianist and composer, enjoyed a successful career on both fronts, teaching at such institutions as San Francisco Conservatory, Stanford University, the University of California, Berkeley, the New England Conservatory, the Manhattan School of Music and Princeton University. Helps, never the recipient of a university or conservatory degree, received private instruction from pianist Abby Whiteside and composer Roger Sessions. His recording of the Sessions' Sonatas is considered to be their benchmark performance. As a composer, he received commission and awards from the American Academy of Arts and Letters, the Ford Foundation, the Guggenheim Foundation and the National Endowment for the Arts. Helps' compositions were anachronistic in style: his compositional style ranges from Post-Impressionism, Neo Romanticsim and early 20th century Atonalism, although he never engaged in serial practices. Since his death in 2001, the Robert Helps Trust has been established at the University of South Florida. Funds are being used to support the continued publishing of his scores. The Robert Helps International Composition Competition and Festival was established in 2005.
Resumo:
During Franz Schubert’s penultimate year of 1827, he produced two profoundly important and mature works that are the focus of this recording project. The works are, in chronological order: • Winterreise (cycle of 24 songs on the poetry of Wilhelm Müller, 1794-1827) • Piano Trio in Eb Major, Op. 100, D. 929 A unique feature of the project is to present Winterreise in two poetic orders: as traditionally performed and published by Schubert, and in the final ordering published by the poet. The program notes accompanying the dissertation’s three compact discs have extensive information as well as comparative tables of Müller’s and Schubert’s final ordering of the cycle. There are significant differences in ordering, and ultimately the listener will determine which is more dramatically satisfying. Dark melancholy is the central emotion in Winterreise, which Schubert composed at various times throughout 1827 in a mood of corresponding gloom and distress. By contrast, the summer and fall of that year produced, in quick succession, the two glowing and remarkable Piano Trios in Bb and Eb, the second of which is included on these compact discs. The contrast between the trios and Winterreise follows the outward circumstances of Schubert’s life and health, a pattern of sorrow and later consolation and elation. The sound recordings for this dissertation recording project are available on three compact discs that can be found in the Digital Repository at the University of Maryland (DRUM). Winterreise was recorded in August 2009, at the University of Baltimore recital hall in Baltimore, Maryland with University of Maryland Professor François Loup. The trio, recorded in live performance in Baltimore in the spring of 2010, features two members of the Baltimore Symphony Orchestra: Qing Li, B.S.O. principal second violin, and Bo Li, B.S.O. section cellist.
Resumo:
info:eu-repo/semantics/nonPublished
Resumo:
p.195-205
Resumo:
Graph partitioning divides a graph into several pieces by cutting edges. Very effective heuristic partitioning algorithms have been developed which run in real-time, but it is unknown how good the partitions are since the problem is, in general, NP-complete. This paper reports an evolutionary search algorithm for finding benchmark partitions. Distinctive features are the transmission and modification of whole subdomains (the partitioned units) that act as genes, and the use of a multilevel heuristic algorithm to effect the crossover and mutations. Its effectiveness is demonstrated by improvements on previously established benchmarks.
Resumo:
In this paper we propose a generalisation of the k-nearest neighbour (k-NN) retrieval method based on an error function using distance metrics in the solution and problem space. It is an interpolative method which is proposed to be effective for sparse case bases. The method applies equally to nominal, continuous and mixed domains, and does not depend upon an embedding n-dimensional space. In continuous Euclidean problem domains, the method is shown to be a generalisation of the Shepard's Interpolation method. We term the retrieval algorithm the Generalised Shepard Nearest Neighbour (GSNN) method. A novel aspect of GSNN is that it provides a general method for interpolation over nominal solution domains. The performance of the retrieval method is examined with reference to the Iris classification problem,and to a simulated sparse nominal value test problem. The introducion of a solution-space metric is shown to out-perform conventional nearest neighbours methods on sparse case bases.