The relationship between piano manufacturer and composer is interactive, and consequently both compositions and performance styles evolved organically due to this relationship. Early on, the instrument had more influence on the composer, whereas with the instrument’s establishment, composers began to exert more influence on the subsequent development of the instrument through their requests of manufacturers. The relationship between pianist-composers and manufacturers is important for pianists to study and understand, as well as the actual sound of a composer’s fortepiano and the way he performed on it. Through studying the development of the piano and the relationship between manufacturers and composers, pianists can reinterpret compositions before the mid nineteenth century, such as Mozart, Beethoven, Dussek, Chopin, and Liszt, using their knowledge of the aforementioned to bring a different perspective to their performances on the modern piano. There are numerous manufacturers and composers who made important contributions to the development of the piano. This dissertation focuses on selected pianist-composers and fortepiano manufacturers, and the impact of their relationship on piano literature before 1860.

No description available.

Zugl.: Stuttgart, Univ., Diss., 2009

It is the purpose of this investigation to examine his popularity and influence in the United States during this period so as to provide a basis for a considered and adequate understanding of the problems and their implications.

This thesis is devoted to the outer and grounded string representations of graphs and their subclasses. A string representation of a graph is a set of strings (bounded continuous curves in a plane), where each string corresponds to one vertex of the graph. Two strings intersect each other if and only if the two corresponding vertices are adjacent in the original graph. An outer string graph is a graph with a string representation where strings are realized inside a disk and one endpoint of each string lies on the boundary of the disk. Similarly, in case of grounded string graphs the strings lie in a common half- plane with one endpoint of each string on the boundary of the half-plane. We give a summary of subclasses of grounded string graphs and proves several results about their mutual inclusions and separations. To prove those, we use an order-forcing lemma which can be used to force a particular order of the endpoints of the string on the boundary circle or boundary line. The second part of the thesis contains proof that recognition of outer string graphs is NP-hard. 1

<p>U prvoj glavi dat je prikaz osnovnih pojmova koji se koriste u tezi, sa naglaskom na osnovne pojmove teorije grafova. U drugoj glavi daju se grafovski dokazi nekih geometrijskih problema. Na primer, dajemo dokaz poznate teoreme Silvestra. iz Kombinatorne geometrije, koristeći grafove. Treće poglavlje sadrži neke geometrijske dokaze u grafovima. Na primer, poznatu Turanovu teoremu, Pikovu teoremu i drugo. U četvrtom poglavlju dajemo metodičku transformaciju prethodnih problema. Neki od problema razloženi su na delove koji se mogu prezentirati od osnovne &scaron;kole do poslediplomskih studija. Peto poglavlje sadrži komentare prethodnog, kao i preporuku UNESCO-a iz 1992. godine o obrazovanju učenika u novom milenijumu.</p> / <p>Chapter 1 contains a shoot review of the basic notions which are used in the thesis with emphasis on the basic notions of graph theory. In Chapter&nbsp; 2we present graph proofs of some geometrical problems. For example, we present some proofs of the well known theorem of Sylvester, from Combinatorial geometry, using graph methods. In Chapter 3 we present some proofs in graphs which use geometry. For example, famous Turan&rsquo;s theorem, Pick&rsquo;s theorem and some others. Chapter 4 contains methodology transformations i.e. we apply the results from the previous chapters to the situations in the clossroom. In Chapter 5 we have some comments of UNESCO, from 1992, on education of children.</p>

This work deals with problems of easy web graph generate. Project implement user-friendly interface for Object-Oriented Graph creating library pChart.

Today, malware authors not only write malicious software but also employ obfuscation, polymorphism, packing and endless such evasive techniques to escape detection by Anti-Virus Products (AVP). Besides the individual behavior of malware, the relations that exist among them play an important role for improving malware detection. This work aims to enable malware analysts at F-Secure Labs to explore various such relationships between malicious URLs and file samples in addition to their individual behavior and activity. The current detection methods at F-Secure Labs analyze unknown URLs and file samples independently without taking into account the correlations that might exist between them. Such traditional classification methods perform well but are not efficient at identifying complex multi-stage malware that hide their activity. The interactions between malware may include any type of network activity, dropping, downloading, etc. For instance, an unknown downloader that connects to a malicious website which in turn drops a malicious payload, should indeed be blacklisted. Such analysis can help block the malware infection at its source and also comprehend the whole infection chain. The outcome of this proof-of-concept study is a system that detects new malware using graph modelling to infer their relationship to known malware as part of the malware classification services at F-Secure. / Idag, skadliga program inte bara skriva skadlig programvara men också använda förvirring, polymorfism, packning och ändlösa sådana undan tekniker för att fly detektering av antivirusprodukter (AVP). Förutom individens beteende av skadlig kod, de relationer som finns mellan dem spelar en viktig roll för att förbättra detektering av skadlig kod. Detta arbete syftar till att ge skadliga analytiker på F-Secure Labs att utforska olika sådana relationer mellan skadliga URL: er och fil prover i Förutom deras individuella beteende och aktivitet. De aktuella detektionsmetoder på F-Secure Labs analysera okända webbadresser och fil prover oberoende utan med beaktande av de korrelationer som kan finnas mellan dem. Sådan traditionella klassificeringsmetoder fungerar bra men är inte effektiva på att identifiera komplexa flerstegs skadlig kod som döljer sin aktivitet. Interaktioner mellan malware kan innefatta någon typ av nätverksaktivitet, släppa, nedladdning, etc. Till exempel, en okänd loader som ansluter till en skadlig webbplats som i sin tur släpper en skadlig nyttolast, bör verkligen vara svartlistad. En sådan analys kan hjälpa till att blockera malware infektion vid källan och även förstå hela infektion kedja. Resultatet av denna proof-of-concept studien är ett system som upptäcker ny skadlig kod med hjälp av diagram modellering för att sluta deras förhållande till kända skadliga program som en del av de skadliga klassificerings tjänster på F-Secure.

Interval graphs, intersection graphs of segments on a real line (intervals), play a key role in the study of algorithms and special structural properties. Unit interval graphs, their proper subclass, where each interval has a unit length, has also been extensively studied. We study mixed unit interval graphs-a generalization of unit interval graphs where each interval has still a unit length, but intervals of more than one type (open, closed, semi-closed) are allowed. This small modification captures a much richer class of graphs. In particular, mixed unit interval graphs are not claw-free, compared to unit interval graphs. Heggernes, Meister, and Papadopoulos defined a representation of unit interval graphs called the bubble model which turned out to be useful in algorithm design. We extend this model to the class of mixed unit interval graphs. The original bubble model was used by Boyaci, Ekim, and Shalom for proving the polynomiality of the MaxCut problem on unit interval graphs. However, we found a significant mistake in the proof which seems to be hardly repairable. Moreover, we demonstrate advantages of such model by providing a subexponential-time algorithm solving the MaxCut problem on mixed unit interval graphs using our extended version of the bubble model. In addition, it gives us a polynomial-time...

This thesis deals with the problem of displaying graphical outputs so that a certain fact is hidden. The aim of this thesis is to provide basic information about graphical outputs. Subsequently, outline the issue of their possible use or misuse and provide basic advice on what to focus on graphical outputs in order not to deceive the graph reader. This thesis is divided into two parts - the theoretical part and the practical part. The theoretical part contains a literary overview of the problems of graphical outputs and their processing. The practical part describes the research on practical graphs carried out on the focus group and individual respondents. Subsequently, the practical part includes the evaluation of this research and the drawing of basic recommendations for reading the graphs.