• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 48
  • 9
  • 5
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 3
  • 2
  • 2
  • 1
  • 1
  • Tagged with
  • 93
  • 35
  • 30
  • 30
  • 30
  • 24
  • 24
  • 23
  • 21
  • 17
  • 12
  • 12
  • 10
  • 10
  • 8
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
31

Les conséquences géopolitiques du traité d'Apamée en Asie Mineure

Payen, Germain 24 April 2018 (has links)
Thèse en cotutelle, doctorat en histoire : Université Laval, Québec, Canada, Université de Paris-Sorbonne, Paris, France. / Cette thèse considère les suites de la paix d’Apamée sur le plan des relations politiques entre les États d’Anatolie et sur l’évolution de la place tenue par cette péninsule dans l’ordre géopolitique méditerranéen. Le traité d’Apamée, conclu en 188 avant notre ère entre la puissance romaine et le royaume séleucide, fut un acte diplomatique majeur pour l’Asie Mineure et l’ensemble de la région anatolienne, libérés de la domination des Séleucides. Jusqu’ici, l’historiographie traditionnelle a abordé ce sujet selon deux perspectives, à savoir l’apparition de l’impérialisme romain en Orient et la vie politique et administrative des cités égéennes. À l’inverse, cette étude se concentre sur les principales puissances politiques de la région anatolienne : les royaumes. Dans le cadre de cet espace fragmenté et diversifié, des modifications de l’équilibre géopolitique régional peuvent être mises en relation avec le bouleversement de l’ordre méditerranéen, par le croisement de sources grecques, latines et orientales, ainsi qu’en faisant usage de procédés développés par le courant de la World History. L’évolution ultérieure de la situation mise en place à Apamée est étudiée jusqu’au point de disparition d’une Anatolie dirigée par des souverains non incorporés dans l’horizon impérial des grandes puissances étrangères, situation à laquelle les ultimes défaites de Mithridate VI du Pont et de Tigrane d’Arménie face à Rome mirent un terme définitif. / The geopolitical aftermath of the treaty of Apamea in Asia Minor This thesis examines the effects of the peace of Apamea with regard to the political relations between the Anatolian states and analyses the importance that this region played in Mediterranean politics following this accord. The treaty of Apamea, concluded in 188 BC between Rome and the Seleucid kingdom, became a diplomatic milestone for Asia Minor and the entirety of Anatolia, then freed from Seleucid domination. The study of this subject has a long tradition in modern historiography, which consists of works focused on either the appearance of Roman imperialism in the East, or the political and administrative lives of the Greek cities. This study is specifically devoted to the central political powers of the Anatolian peninsula; that is to say, the independent kingdoms of Anatolia. The changes seen on the geopolitical balance of this fragmented region can be linked to the profound modifications on the scale of the whole Mediterranean. The sources considered include Greek, Latin and oriental documents and artefacts, as well as some “World History” theoretical approaches. The further evolution of the Apamean order can then be followed up until the disappearance of any powerful local power outside the foreign nations incorporated into imperial rule. The simultaneous defeats of Mithridates VI of Pontus and Tigranes of Armenia against Rome mark the end of this situation where independent kingdoms in this region pursued their own autonomous foreign policies.
32

Gaius Marius : a political biography

Evans, Richard J., 1954- 01 1900 (has links)
The political career of Gaius Marius (ca. 157-86 BC}, which spans the years between 120 and 86 BC, was memorable not only for its unprecedented personal and public triumphs, but was also of momentous significance in the whole history of the Roman Republic. At precisely the time that Marius achieved a supreme position in the state, the military might of the Romans, hitherto invincible at least in fairly recent times (second century}, had been dealt a series of humiliating setbacks abroad. Firstly, in North Africa by a rather minor despot, Jugurtha the king of Numidia. Secondly, much closer to home in Illyria and in southern Gaul by the migrating Germanic tribes, the Cimbri and the Teutones. Against this background of quite unremitting disaster, Marius obtained a place in republican political life which had not been witnessed before. In his pursuit of senatorial offices, Marius initially experienced both victories and disappointments (success in the tribunician elections but failure in elections for the aedileship) before finally winning the prestigious consulship in the elections held in 108. Thereafter, he was consul a further six times, and five of these consulships were held in successive years between 104 and 100. Just as he was dominant on the field of battle against the Numidians and the Germanic tribes, so, too, did he control the politics of the city during the decade from 108 to 99: The chapters which follow below set out to trace Marius' long rise to preeminence, his contribution to the intricate tribunician legislation of the period in which he flourished and, moreover, his involvement with other senior political figures who were his contemporaries. Furthermore, this biographical study seeks to fully expose the fact that, as a result of his participation in the politics of the time, Marius' career became an obvious example which other equally ambitious politicians (for instance, Sulla, Pompey, Crassus, Caesar and Octavian) sought to emulate or even to surpass. Consequently, Marius may not have realised the extent of the dangers which he bequeathed to the res publica but, inadvertently or not, he caused the beginning of the fall of the Roman Republic. / D. Litt. et Phil. (Ancient History) / History
33

Why-Query Support in Graph Databases

Vasilyeva, Elena 28 March 2017 (has links) (PDF)
In the last few decades, database management systems became powerful tools for storing large amount of data and executing complex queries over them. In addition to extended functionality, novel types of databases appear like triple stores, distributed databases, etc. Graph databases implementing the property-graph model belong to this development branch and provide a new way for storing and processing data in the form of a graph with nodes representing some entities and edges describing connections between them. This consideration makes them suitable for keeping data without a rigid schema for use cases like social-network processing or data integration. In addition to a flexible storage, graph databases provide new querying possibilities in the form of path queries, detection of connected components, pattern matching, etc. However, the schema flexibility and graph queries come with additional costs. With limited knowledge about data and little experience in constructing the complex queries, users can create such ones, which deliver unexpected results. Forced to debug queries manually and overwhelmed by the amount of query constraints, users can get frustrated by using graph databases. What is really needed, is to improve usability of graph databases by providing debugging and explaining functionality for such situations. We have to assist users in the discovery of what were the reasons of unexpected results and what can be done in order to fix them. The unexpectedness of result sets can be expressed in terms of their size or content. In the first case, users have to solve the empty-answer, too-many-, or too-few-answers problems. In the second case, users care about the result content and miss some expected answers or wonder about presence of some unexpected ones. Considering the typical problems of receiving no or too many results by querying graph databases, in this thesis we focus on investigating the problems of the first group, whose solutions are usually represented by why-empty, why-so-few, and why-so-many queries. Our objective is to extend graph databases with debugging functionality in the form of why-queries for unexpected query results on the example of pattern matching queries, which are one of general graph-query types. We present a comprehensive analysis of existing debugging tools in the state-of-the-art research and identify their common properties. From them, we formulate the following features of why-queries, which we discuss in this thesis, namely: holistic support of different cardinality-based problems, explanation of unexpected results and query reformulation, comprehensive analysis of explanations, and non-intrusive user integration. To support different cardinality-based problems, we develop methods for explaining no, too few, and too many results. To cover different kinds of explanations, we present two types: subgraph- and modification-based explanations. The first type identifies the reasons of unexpectedness in terms of query subgraphs and delivers differential graphs as answers. The second one reformulates queries in such a way that they produce better results. Considering graph queries to be complex structures with multiple constraints, we investigate different ways of generating explanations starting from the most general one that considers only a query topology through coarse-grained rewriting up to fine-grained modification that allows fine changes of predicates and topology. To provide a comprehensive analysis of explanations, we propose to compare them on three levels including a syntactic description, a content, and a size of a result set. In order to deliver user-aware explanations, we discuss two models for non-intrusive user integration in the generation process. With the techniques proposed in this thesis, we are able to provide fundamentals for debugging of pattern-matching queries, which deliver no, too few, or too many results, in graph databases implementing the property-graph model.
34

Differential splicing in lymphoma

Zimmermann, Karin 05 September 2018 (has links)
Alternatives Spleißen ist ein wesentlicher Mechanismus, um Proteindiversität in Eukaryoten zu gewährleisten. Gewebespezifität sowie entwicklungsrelevante Prozesse werden unter anderem massgeblich davon beeinflusst. Aberrante (alternative) Spleißvorgänge können wiederum zu veränderten Proteinisoformen führen, die verschiedenste Krankheiten wie Krebs verursachen oder zu veränderter Medikamentenwirksamkeit beitragen können. In dieser Arbeit untersuchen wir differentielles Spleißen im Kontext von Krebserkrankungen. Dazu betrachten wir drei Aspekte, die uns wichtig erscheinen. Der erste Teil dieser Arbeit beschäftigt sich mit dem systematischen Vergleich verschiedener Methoden für die Detektion von differentiellem Spleißen in Exon-ArrayDaten. Anhand artifizieller und experimentell validierter Daten identifizieren wir Methoden, die über verschiedene Parameterszenarien hinweg robuste Ergebnisse liefern, und ermitteln bestimmte Datenparameter, die die Ergebnisgüte sowie die Qualität der angewandten Methoden beeinflussen. Im zweiten Teil identifizieren wir Spleiß-regulatorischer Proteine, die für die beobachteten Spleissveränderungen zwischen Krebs und einer Kontrolle verantwortlich sein könnten. Zu diesem Zweck stellen wir eine von uns entwickelte Methode basierend auf einem Netzwerkansatz vor. Hierbei werden Spleißfaktoren und differentiell gesplicete Exons in ein Netzwerk integriert und anschliessend anhand der Unterschiede in ihrer Zentralität geordnet. Im dritten Teil analysieren wir die Vergleichbarkeit zweier Datentypen, generiert durch unterschiedliche Technologien, in Bezug auf die Detektion von differentiellem Spleißen. Dazu beziehen wir mehrere Vergleichsebenen mit ein und wenden Methoden an, die für beide Technologien geeignet sind um eine methodenbasierte Beeinträchtigung der Vergleichbarkeit auszuschließen. Die Anwendung unseres Ansatzes auf zwei Datensätze identifiziert ähnliche Trends in der Vergleichbarkeit bei einer sich unterscheidenden Gesamtkonkordanz. / Alternative splicing is a crucial mechanism in eukaryotes, which provides an ample protein diversity that is necessary for maintaining an organism. In contrast, aberrant (alternative) splicing may lead to altered protein isoforms contributing to diseases such as cancer. In this thesis, we study differential splicing in cancer, i.e. splicing changes observed between cancerous and control tissues. We seek to identify methods best suited for the detection of differential splicing, we investigate regulatory factors potentially causal for the splicing changes observed, and we study the comparability of two data types obtained from different technologies with respect to differential splicing detection. The first part of the thesis assesses the performance of methods for detecting differential splicing from exon arrays as existing methods are often of low concordance. We examine global data parameters and their potential influence on results and method performance using artificial and validated experimental data. Overall, our evaluation indicates methods that perform robustly well across artificial and experimental data and identifies parameters impacting result performance. The second part aims at identifying regulatory factors responsible for splicing changes observed between cancer, and healthy tissue. Therefor, we develop a novel, network based approach which first integrates differentially spliced exons with splicing regulatory proteins (splicing factors), using transcriptomics data, and then ranks splicing factors according to their potential involvement in cancer. Third, we compare differential splicing detection based on RNA sequencing and exon array data by developing a multi-level comparison framework using two differential splicing detection methods applicable to both, RNA sequencing and exon array data, to avoid method inherent bias. We apply our multi-level framework to two data sets, leading, despite varying overall concordance, to similar trends in comparability.
35

Snapshots in large-scale distributed file systems

Stender, Jan 21 January 2013 (has links)
Viele moderne Dateisysteme unterstützen Snapshots zur Erzeugung konsistenter Online-Backups, zur Wiederherstellung verfälschter oder ungewollt geänderter Dateien, sowie zur Rückverfolgung von Änderungen an Dateien und Verzeichnissen. Während frühere Arbeiten zu Snapshots in Dateisystemen vorwiegend lokale Dateisysteme behandeln, haben moderne Trends wie Cloud- oder Cluster-Computing dazu geführt, dass die Datenhaltung in verteilten Speichersystemen an Bedeutung gewinnt. Solche Systeme umfassen häufig eine Vielzahl an Speicher-Servern, was besondere Herausforderungen mit Hinblick auf Skalierbarkeit, Verfügbarkeit und Ausfallsicherheit mit sich bringt. Diese Arbeit beschreibt einen Snapshot-Algorithmus für großangelegte verteilte Dateisysteme und dessen Integration in XtreemFS, ein skalierbares objektbasiertes Dateisystem für Grid- und Cloud-Computing-Umgebungen. Die zwei Bausteine des Algorithmus sind ein System zur effizienten Erzeugung und Verwaltung von Dateiinhalts- und Metadaten-Versionen, sowie ein skalierbares, ausfallsicheres Verfahren zur Aggregation bestimmter Versionen in einem Snapshot. Um das Problem einer fehlenden globalen Zeit zu bewältigen, implementiert der Algorithmus ein weniger restriktives, auf Zeitstempeln lose synchronisierter Server-Uhren basierendes Konsistenzmodell für Snapshots. Die wesentlichen Beiträge der Arbeit sind: 1) ein formales Modell von Snapshots und Snapshot-Konsistenz in verteilten Dateisystemen; 2) die Beschreibung effizienter Verfahren zur Verwaltung von Metadaten- und Dateiinhalts-Versionen in objektbasierten Dateisystemen; 3) die formale Darstellung eines skalierbaren, ausfallsicheren Snapshot-Algorithmus für großangelegte objektbasierte Dateisysteme; 4) eine detaillierte Beschreibung der Implementierung des Algorithmus in XtreemFS. Eine umfangreiche Auswertung belegt, dass der vorgestellte Algorithmus die Nutzerdatenrate kaum negativ beeinflusst, und dass er mit großen Zahlen an Snapshots und Versionen skaliert. / Snapshots are present in many modern file systems, where they allow to create consistent on-line backups, to roll back corruptions or inadvertent changes of files, and to keep a record of changes to files and directories. While most previous work on file system snapshots refers to local file systems, modern trends like cloud and cluster computing have shifted the focus towards distributed storage infrastructures. Such infrastructures often comprise large numbers of storage servers, which presents particular challenges in terms of scalability, availability and failure tolerance. This thesis describes snapshot algorithm for large-scale distributed file systems and its integration in XtreemFS, a scalable object-based file system for grid and cloud computing environments. The two building blocks of the algorithm are a version management scheme, which efficiently records versions of file content and metadata, as well as a scalable and failure-tolerant mechanism that aggregates specific versions in a snapshot. To overcome the lack of a global time in a distributed system, the algorithm implements a relaxed consistency model for snapshots, which is based on timestamps assigned by loosely synchronized server clocks. The main contributions of the thesis are: 1) a formal model of snapshots and snapshot consistency in distributed file systems; 2) the description of efficient schemes for the management of metadata and file content versions in object-based file systems; 3) the formal presentation of a scalable, fault-tolerant snapshot algorithm for large-scale object-based file systems; 4) a detailed description of the implementation of the algorithm as part of XtreemFS. An extensive evaluation shows that the proposed algorithm has no severe impact on user I/O, and that it scales to large numbers of snapshots and versions.
36

Data Fusion in Spatial Data Infrastructures

Wiemann, Stefan 12 January 2017 (has links) (PDF)
Over the past decade, the public awareness and availability as well as methods for the creation and use of spatial data on the Web have steadily increased. Besides the establishment of governmental Spatial Data Infrastructures (SDIs), numerous volunteered and commercial initiatives had a major impact on that development. Nevertheless, data isolation still poses a major challenge. Whereas the majority of approaches focuses on data provision, means to dynamically link and combine spatial data from distributed, often heterogeneous data sources in an ad hoc manner are still very limited. However, such capabilities are essential to support and enhance information retrieval for comprehensive spatial decision making. To facilitate spatial data fusion in current SDIs, this thesis has two main objectives. First, it focuses on the conceptualization of a service-based fusion process to functionally extend current SDI and to allow for the combination of spatial data from different spatial data services. It mainly addresses the decomposition of the fusion process into well-defined and reusable functional building blocks and their implementation as services, which can be used to dynamically compose meaningful application-specific processing workflows. Moreover, geoprocessing patterns, i.e. service chains that are commonly used to solve certain fusion subtasks, are designed to simplify and automate workflow composition. Second, the thesis deals with the determination, description and exploitation of spatial data relations, which play a decisive role for spatial data fusion. The approach adopted is based on the Linked Data paradigm and therefore bridges SDI and Semantic Web developments. Whereas the original spatial data remains within SDI structures, relations between those sources can be used to infer spatial information by means of Semantic Web standards and software tools. A number of use cases were developed, implemented and evaluated to underpin the proposed concepts. Particular emphasis was put on the use of established open standards to realize an interoperable, transparent and extensible spatial data fusion process and to support the formalized description of spatial data relations. The developed software, which is based on a modular architecture, is available online as open source. It allows for the development and seamless integration of new functionality as well as the use of external data and processing services during workflow composition on the Web. / Die Entwicklung des Internet im Laufe des letzten Jahrzehnts hat die Verfügbarkeit und öffentliche Wahrnehmung von Geodaten, sowie Möglichkeiten zu deren Erfassung und Nutzung, wesentlich verbessert. Dies liegt sowohl an der Etablierung amtlicher Geodateninfrastrukturen (GDI), als auch an der steigenden Anzahl Communitybasierter und kommerzieller Angebote. Da der Fokus zumeist auf der Bereitstellung von Geodaten liegt, gibt es jedoch kaum Möglichkeiten die Menge an, über das Internet verteilten, Datensätzen ad hoc zu verlinken und zusammenzuführen, was mitunter zur Isolation von Geodatenbeständen führt. Möglichkeiten zu deren Fusion sind allerdings essentiell, um Informationen zur Entscheidungsunterstützung in Bezug auf raum-zeitliche Fragestellungen zu extrahieren. Um eine ad hoc Fusion von Geodaten im Internet zu ermöglichen, behandelt diese Arbeit zwei Themenschwerpunkte. Zunächst wird eine dienstebasierten Umsetzung des Fusionsprozesses konzipiert, um bestehende GDI funktional zu erweitern. Dafür werden wohldefinierte, wiederverwendbare Funktionsblöcke beschrieben und über standardisierte Diensteschnittstellen bereitgestellt. Dies ermöglicht eine dynamische Komposition anwendungsbezogener Fusionsprozesse über das Internet. Des weiteren werden Geoprozessierungspatterns definiert, um populäre und häufig eingesetzte Diensteketten zur Bewältigung bestimmter Teilaufgaben der Geodatenfusion zu beschreiben und die Komposition und Automatisierung von Fusionsprozessen zu vereinfachen. Als zweiten Schwerpunkt beschäftigt sich die Arbeit mit der Frage, wie Relationen zwischen Geodatenbeständen im Internet erstellt, beschrieben und genutzt werden können. Der gewählte Ansatz basiert auf Linked Data Prinzipien und schlägt eine Brücke zwischen diensteorientierten GDI und dem Semantic Web. Während somit Geodaten in bestehenden GDI verbleiben, können Werkzeuge und Standards des Semantic Web genutzt werden, um Informationen aus den ermittelten Geodatenrelationen abzuleiten. Zur Überprüfung der entwickelten Konzepte wurde eine Reihe von Anwendungsfällen konzipiert und mit Hilfe einer prototypischen Implementierung umgesetzt und anschließend evaluiert. Der Schwerpunkt lag dabei auf einer interoperablen, transparenten und erweiterbaren Umsetzung dienstebasierter Fusionsprozesse, sowie einer formalisierten Beschreibung von Datenrelationen, unter Nutzung offener und etablierter Standards. Die Software folgt einer modularen Struktur und ist als Open Source frei verfügbar. Sie erlaubt sowohl die Entwicklung neuer Funktionalität durch Entwickler als auch die Einbindung existierender Daten- und Prozessierungsdienste während der Komposition eines Fusionsprozesses.
37

Proyección del heroísmo romano en los desfiles militares de Julio César y Octavio Augusto: el triunfo como recurso pedagógico

Inzulza Sanhueza, Cristián January 2017 (has links)
Informe de Seminario para optar al grado de Licenciado en Historia / Seminario de grado: Evolución de la política, religión y cultura en la antigüedad greco-romana
38

Caught Between Nationalism And Socialism: The Kazak Alash Orda Movement In Continuity

Gurbuz, Yunus Emre 01 October 2007 (has links) (PDF)
This dissertation aims to discuss the incorporation of the &ldquo / nationalist&rdquo / Kazak intellectuals of Alash Orda to the Soviet Socialist Republics and their role in the establishment of the Kazak ASSR. In the course of events they acted first together with Russian liberal democrats, then they sought to establish a national government and fought against the Bolsheviks, but after 1920 they chose to stay in the USSR and join the modernization process of their homeland alongside the Bolsheviks. In the mainstream academic discourse the local leaders in the republics of the USSR are generally considered as passive victims of the Soviet policies. The members of the Kazak national movement of Alash Orda are also neglected as weak political figures after they had accepted the Soviet rule. But they continued their struggle for enlightening the Kazak people in 1920s. Their collaboration with the Bolsheviks was concomitant to their motives of modernizing the Kazaks. Their role in the Soviet Kazakstan did not come to an end after their acceptance of the Soviet sovereignty but it continued. My argument is that the struggle of the members of Alash Orda was in continuity with their program before the revolution, and their cooperation with the Bolsheviks was a way to realize their objectives, and it opened a sphere for them to have a role in the formation of the Kazak ASSR.
39

Natural landscapes in the literary writings of the Eastern Jin (A.D. 316-420) and Liu Song (A.D. 420-479)Eras

Chung, Ka-yin, Gladys., 鍾嘉賢. January 2003 (has links)
published_or_final_version / abstract / toc / Chinese / Master / Master of Philosophy
40

Rome's relations with the Greek East from the earliest contacts to 146 B.C. and their relation to internal political struggles

Briscoe, John January 1965 (has links)
No description available.

Page generated in 0.0524 seconds