No description available.

Scientific phenomena are often studied through collections of related scalar fields such as data generated by simulation experiments that are parameter or time dependent . Exploration of such data requires robust measures to compare them in a feature aware and intuitive manner. Topological data analysis is a growing area that has had success in analyzing and visualizing scalar fields in a feature aware manner based on the topological features. Various data structures such as contour and merge trees, Morse-Smale complexes and extremum graphs have been developed to study scalar fields. The extremum graph is a topological data structure based on either the maxima or the minima of a scalar field. It preserves local geometrical structure by maintaining relative locations of extrema and their neighborhoods. It provides a suitable abstraction to study a collection of datasets where features are expressed by descending or ascending manifolds and their proximity is of importance. In this thesis, we design a measure to understand the similarity between scalar fields based on the extremum graph abstraction. We propose a topological structure called the complete extremum graph and define a distance measure on it that compares scalar fields in a feature aware manner. We design an algorithm for computing the distance and show its applications in analyzing time varying data such as understanding periodicity, feature correspondence and tracking, and identifying key frames.

MAMLD1 is suggested to play a role in the development of 46,XY disorders of sexual development (46,XY DSD). So far, mutations in this gene have been detected in several cases of hypospadias with normal testosterone levels at birth. From in vitro studies it was concluded that Mamld1 might transiently affect testosterone synthesis during genital development. We describe the first MAMLD1 mutation in a 46,XY patient with complete gonadal dysgenesis. The novel MAMLD1 missense mutation (p.P677L) results in a severely reduced transactivation in vitro of the promoter of the MAMLD1 target gene HES3/Hes3. However, as knowledge about the functional role of MAMLD1 in gonadal development is limited, we suggest that additional factors (digenic or oligogenic cause) play a role in the development of complete gonadal dysgenesis in this patient.

This master´s thesis deals with the determination of vertical gravity gradient in the shaft below the infantry bunker TS - 73 "Polom" located in village Babí. After performing position, elevation and gravity measurements detailed points, representing the two vertical profiles were calculated gravity, vertical gravity gradient, block densities ang gravity anomalies depending on the depth. Other outputs work as a topographic map and a map of full Bouguer anomalies for the wider area of the location and interpretive geologic profile.

The object of this master´s thesis was levelling and weight measurement of the Tetčice polygon through which passes the fault of the Boskovice furrow. This is the 10th period of levelling and the second period of gravimetric measurement. The theoretical part describes the geological structure of the site, technology of high-precision levelling and technology of gravimetric measurement. The first part of the practical part deals with my own levelling measurement, the calculation of the resulting cambers and heights, consequential comparasion of the results with previous periods and, especially, with evaluation of the vertical movement tendecies. The second part of the practical part deals with my own gravimetric measurement, the calculation of the complete Bouguer gravity anomaly, creation map of complete Bouguer gravity anomaly and as well as evaluation of gravimetric measurement in relation to the results of the previous periods.

Diplomová práce pojednává o chaotických dynamických systémech se zvláštním zaměřením na jejich synchronizaci. Proces synchronizace je aplikován použitím dvou různých metod, a to - metodou úplné synchronizace na dva Lorenzovy systémy a metodou negativní zpětné vazby na dva Rösslerovy systémy. Dále je prozkoumána možná aplikace synchronizace chaotických systémů v oblasti soukromé komunikace, která je doplněná algoritmy v prostředí MATLAB.

This eleborate study is aimed at analysis of complete methods machining. There are characterized particular methods and their effect on the surface´s quality of machined area in this study. Concluding part of the study includes practical demonstration of machining by using cemented carbide-tipped tool and polycrystalline diamond and evaluation of this demonstration.

The goal of this Master's Thesis is finding a SAT solving heuristic by the application of an evolutionary algorithm. This thesis surveys various approaches used in SAT solving and some variants of evolutionary algorithms that are relevant to this topic. Afterwards the implementation of a linear genetic programming system that searches for a suitable heuristic for SAT problem instances is described, together with the implementation of a custom SAT solver which expoloits the output of the genetic program. Finally, the achieved results are summarized.

So heißt die im Foyer der Sächsische Landesbibliothek - Staats- und Universitätsbibliothek Dresden gezeigte Wanderausstellung, deren Eröffnung am Vorabend des 9. September ein gelungener Auftakt zur AIBM-Jahrestagung 2009 war. Von der Fachgruppe Freie Forschungsinstitute in der Gesellschaft für Musikforschung initiiert und durch einen von Klaus Döge und Kollegen herausgegebenen attraktiven Katalog dokumentiert (www.adwmainz.de/index.php?id=772), stellt die mit Blick auf das Jahr der Geisteswissenschaften 2007 konzipierte Exposition zwanzig langfristige Musikeditions- und -forschungsprojekte vor, die – in der Regel durch die Union der deutschen Akademien der Wissenschaften betreut und von Bund und Ländern gemeinsam finanziert – seit mehr als fünfzig Jahren maßgeblich zu den Fundamenten von Musikhistorie und Musikpraxis beigetragen und auch international hohe Anerkennung gefunden haben.

The thesis presents a contribution to the analysis and visualization of computational performance based on event traces with a particular focus on parallel programs and High Performance Computing (HPC). Event traces contain detailed information about specified incidents (events) during run-time of programs and allow minute investigation of dynamic program behavior, various performance metrics, and possible causes of performance flaws. Due to long running and highly parallel programs and very fine detail resolutions, event traces can accumulate huge amounts of data which become a challenge for interactive as well as automatic analysis and visualization tools. The thesis proposes a method of exploiting redundancy in the event traces in order to reduce the memory requirements and the computational complexity of event trace analysis. The sources of redundancy are repeated segments of the original program, either through iterative or recursive algorithms or through SPMD-style parallel programs, which produce equal or similar repeated event sequences. The data reduction technique is based on the novel Complete Call Graph (CCG) data structure which allows domain specific data compression for event traces in a combination of lossless and lossy methods. All deviations due to lossy data compression can be controlled by constant bounds. The compression of the CCG data structure is incorporated in the construction process, such that at no point substantial uncompressed parts have to be stored. Experiments with real-world example traces reveal the potential for very high data compression. The results range from factors of 3 to 15 for small scale compression with minimum deviation of the data to factors > 100 for large scale compression with moderate deviation. Based on the CCG data structure, new algorithms for the most common evaluation and analysis methods for event traces are presented, which require no explicit decompression. By avoiding repeated evaluation of formerly redundant event sequences, the computational effort of the new algorithms can be reduced in the same extent as memory consumption. The thesis includes a comprehensive discussion of the state-of-the-art and related work, a detailed presentation of the design of the CCG data structure, an elaborate description of algorithms for construction, compression, and analysis of CCGs, and an extensive experimental validation of all components. / Diese Dissertation stellt einen neuartigen Ansatz für die Analyse und Visualisierung der Berechnungs-Performance vor, der auf dem Ereignis-Tracing basiert und insbesondere auf parallele Programme und das Hochleistungsrechnen (High Performance Computing, HPC) zugeschnitten ist. Ereignis-Traces (Ereignis-Spuren) enthalten detaillierte Informationen über spezifizierte Ereignisse während der Laufzeit eines Programms und erlauben eine sehr genaue Untersuchung des dynamischen Verhaltens, verschiedener Performance-Metriken und potentieller Performance-Probleme. Aufgrund lang laufender und hoch paralleler Anwendungen und dem hohen Detailgrad kann das Ereignis-Tracing sehr große Datenmengen produzieren. Diese stellen ihrerseits eine Herausforderung für interaktive und automatische Analyse- und Visualisierungswerkzeuge dar. Die vorliegende Arbeit präsentiert eine Methode, die Redundanzen in den Ereignis-Traces ausnutzt, um sowohl die Speicheranforderungen als auch die Laufzeitkomplexität der Trace-Analyse zu reduzieren. Die Ursachen für Redundanzen sind wiederholt ausgeführte Programmabschnitte, entweder durch iterative oder rekursive Algorithmen oder durch SPMD-Parallelisierung, die gleiche oder ähnliche Ereignis-Sequenzen erzeugen. Die Datenreduktion basiert auf der neuartigen Datenstruktur der "Vollständigen Aufruf-Graphen" (Complete Call Graph, CCG) und erlaubt eine Kombination von verlustfreier und verlustbehafteter Datenkompression. Dabei können konstante Grenzen für alle Abweichungen durch verlustbehaftete Kompression vorgegeben werden. Die Datenkompression ist in den Aufbau der Datenstruktur integriert, so dass keine umfangreichen unkomprimierten Teile vor der Kompression im Hauptspeicher gehalten werden müssen. Das enorme Kompressionsvermögen des neuen Ansatzes wird anhand einer Reihe von Beispielen aus realen Anwendungsszenarien nachgewiesen. Die dabei erzielten Resultate reichen von Kompressionsfaktoren von 3 bis 5 mit nur minimalen Abweichungen aufgrund der verlustbehafteten Kompression bis zu Faktoren > 100 für hochgradige Kompression. Basierend auf der CCG_Datenstruktur werden außerdem neue Auswertungs- und Analyseverfahren für Ereignis-Traces vorgestellt, die ohne explizite Dekompression auskommen. Damit kann die Laufzeitkomplexität der Analyse im selben Maß gesenkt werden wie der Hauptspeicherbedarf, indem komprimierte Ereignis-Sequenzen nicht mehrmals analysiert werden. Die vorliegende Dissertation enthält eine ausführliche Vorstellung des Stands der Technik und verwandter Arbeiten in diesem Bereich, eine detaillierte Herleitung der neu eingeführten Daten-strukturen, der Konstruktions-, Kompressions- und Analysealgorithmen sowie eine umfangreiche experimentelle Auswertung und Validierung aller Bestandteile.