Refine
Year of publication
Document Type
- Article (35930)
- Doctoral Thesis (6513)
- Monograph/Edited Volume (5568)
- Postprint (3296)
- Review (2295)
- Part of a Book (1076)
- Other (959)
- Preprint (569)
- Conference Proceeding (561)
- Part of Periodical (531)
Language
- English (30912)
- German (26140)
- Spanish (363)
- French (330)
- Italian (115)
- Russian (112)
- Multiple languages (70)
- Hebrew (36)
- Portuguese (25)
- Polish (24)
Keywords
- Germany (204)
- climate change (182)
- Deutschland (143)
- machine learning (87)
- European Union (79)
- diffusion (78)
- Sprachtherapie (77)
- morphology (74)
- Logopädie (73)
- Migration (73)
Institute
- Institut für Biochemie und Biologie (5489)
- Institut für Physik und Astronomie (5455)
- Institut für Geowissenschaften (3673)
- Institut für Chemie (3485)
- Wirtschaftswissenschaften (2645)
- Historisches Institut (2522)
- Department Psychologie (2352)
- Institut für Mathematik (2150)
- Institut für Romanistik (2113)
- Sozialwissenschaften (1882)
Box-Simulationen von rotierender Magnetokonvektion im flüssigen Erdkern Numerische Simulationen der 3D-MHD Gleichungen sind mit Hilfe des Codes NIRVANA durchgeführt worden. Die Gleichungen für kompressible rotierende Magnetokonvektion wurden für erdähnliche Bedingungen numerisch in einer kartesischen Box gelöst. Charakteristische Eigenschaften mittlerer Größen, wie der Turbulenz-Intensität oder der turbulente Wärmefluss, die durch die kombinierte Wirkung kleinskaliger Fluktuationen entstehen, wurden bestimmt. Die Korrelationslänge der Turbulenz hängt signifikant von der Stärke und der Orientierung des Magnetfeldes ab, und das anisotrope Verhalten der Turbulenz aufgrund von Coriolis- und Lorentzkraft ist für schnellere Rotation wesentlich stärker ausgeprägt. Die Ausbildung eines isotropen Verhaltens auf kleinen Skalen unter dem Einfluss von Rotation alleine wird bereits durch ein schwaches Magnetfeld verhindert. Dies resultiert in einer turbulenten Strömung, die durch die vertikale Komponente dominiert wird. In Gegenwart eines horizontalen Magnetfeldes nimmt der vertikale turbulente Wärmefluss leicht mit zunehmender Feldstärke zu, so dass die Kühlung eines rotierenden Systems verbessert wird. Der horizontale Wärmetransport ist stets westwärts und in Richtung der Pole orientiert. Letzteres kann unter Umständen die Quelle für eine großskalige meridionale Strömung darstellen, während erstes in globalen Simulationen mit nicht axialsymmetrischen Randbedingungen für den Wärmefluss von Bedeutung ist. Die mittlere elektromotorische Kraft, die die Erzeugung von magnetischem Fluss durch die Turbulenz beschreibt, wurde unmittelbar aus den Lösungen für Geschwindigkeit und Magnetfeld berechnet. Hieraus konnten die entsprechenden α-Koeffizienten hergeleitet werden. Aufgrund der sehr schwachen Dichtestratifizierung ändert der α-Effekt sein Vorzeichen nahezu exakt in der Mitte der Box. Der α-Effekt ist positiv in der oberen Hälfte und negativ in der unteren Hälfte einer auf der Nordhalbkugel rotierenden Box. Für ein starkes Magnetfeld ergibt sich zudem eine deutliche abwärts orientierte Advektion von magnetischem Fluss. Ein Mean-Field Modell des Geodynamos wurde konstruiert, das auf dem α-Effekt basiert, wie er aus den Box-Simulationen berechnet wurde. Für eine äußerst beschränkte Klasse von radialen α-Profilen weist das lineare α^2-Modell Oszillationen auf einer Zeitskala auf, die durch die turbulente Diffusionszeit bestimmt wird. Die wesentlichen Eigenschaften der periodischen Lösungen werden präsentiert, und der Einfluss der Größe des inneren Kerns auf die Charakteristiken des kritischen Bereichs, innerhalb dessen oszillierende Lösungen auftreten, wurden untersucht. Reversals werden als eine halbe Oszillation interpretiert. Sie sind ein recht seltenes Ereignis, da sie lediglich dann stattfinden können, wenn das α-Profil ausreichend lange in dem periodische Lösungen erlaubenden Bereich liegt. Aufgrund starker Fluktuationen auf der konvektiven Zeitskala ist die Wahrscheinlichkeit eines solchen Reversals relativ klein. In einem einfachen nicht-linearen Mean-Field Modell mit realistischen Eingabeparametern, die auf den Box-Simulationen beruhen, konnte die Plausibilität des Reversal-Modells anhand von Langzeitsimulationen belegt werden.
Although claiming the authority of an eye-witness account, frater Simon’s letter is almost certainly a ficticious description of the fall of Constantinople to the Ottoman Turks in 1453. This presumed lack of authenticity has obviously prompted modern scholarship for a long time to be oblivious to this contemporary and exclusive source on the events, preferring well-known and reliable sources such as Leonard of Chios and Isidore of Kiev. However, since frater Simon’s letter has survived in two different versions and ten manuscripts from the 15th century, it is clearly more than a marginal note. Rather is it a remarkable contribution to the literary treatment of the Turkish threat and timeless moral instruction.With his portrayal of the pagan Mehmed II as a just ruler, the recurring moral instructions and the lack of a call to arms. Simon’s text stands out against themyriad of more or less contemporary depictions. In preparation for a critical edition the paper gives an analysis of the text and an overview of the extant manuscripts.
Although claiming the authority of an eye-witness account, frater Simon’s letter is almost certainly a ficticious description of the fall of Constantinople to the Ottoman Turks in 1453. This presumed lack of authenticity has obviously prompted modern scholarship for a long time to be oblivious to this contemporary and exclusive source on the events, preferring well-known and reliable sources such as Leonard of Chios and Isidore of Kiev. However, since frater Simon’s letter has survived in two different versions and ten manuscripts from the 15th century, it is clearly more than a marginal note. Rather is it a remarkable contribution to the literary treatment of the Turkish threat and timeless moral instruction.With his portrayal of the pagan Mehmed II as a just ruler, the recurring moral instructions and the lack of a call to arms. Simon’s text stands out against themyriad of more or less contemporary depictions. In preparation for a critical edition the paper gives an analysis of the text and an overview of the extant manuscripts.
The model-driven software development paradigm requires that appropriate model transformations are applicable in different stages of the development process. The transformations have to consistently propagate changes between the different involved models and thus ensure a proper model synchronization. However, most approaches today do not fully support the requirements for model synchronization and focus only on classical one-way batch-oriented transformations. In this paper, we present our approach for an incremental model transformation which supports model synchronization. Our approach employs the visual, formal, and bidirectional transformation technique of triple graph grammars. Using this declarative specification formalism, we focus on the efficient execution of the transformation rules and how to achieve an incremental model transformation for synchronization purposes. We present an evaluation of our approach and demonstrate that due to the speedup for the incremental processing in the average case even larger models can be tackled.
Various kinds of typed attributed graphs are used to represent states of systems from a broad range of domains. For dynamic systems, established formalisms such as graph transformations provide a formal model for defining state sequences. We consider the extended case where time elapses between states and introduce a logic to reason about these sequences. With this logic we express properties on the structure and attributes of states as well as on the temporal occurrence of states that are related by their inner structure, which no formal logic over graphs accomplishes concisely so far. Firstly, we introduce graphs with history by equipping every graph element with the timestamp of its creation and, if applicable, its deletion. Secondly, we define a logic on graphs by integrating the temporal operator until into the well-established logic of nested graph conditions. Thirdly, we prove that our logic is equally expressive to nested graph conditions by providing a suitable reduction. Finally, the implementation of this reduction allows for the tool-based analysis of metric temporal properties for state sequences.
Graph repair, restoring consistency of a graph, plays a prominent role in several areas of computer science and beyond: For example, in model-driven engineering, the abstract syntax of models is usually encoded using graphs. Flexible edit operations temporarily create inconsistent graphs not representing a valid model, thus requiring graph repair. Similarly, in graph databases—managing the storage and manipulation of graph data—updates may cause that a given database does not satisfy some integrity constraints, requiring also graph repair.
We present a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of least-changing repairs. In our context, we formalize consistency by so-called graph conditions being equivalent to first-order logic on graphs. We present two kind of repair algorithms: State-based repair restores consistency independent of the graph update history, whereas deltabased (or incremental) repair takes this history explicitly into account. Technically, our algorithms rely on an existing model generation algorithm for graph conditions implemented in AutoGraph. Moreover, the delta-based approach uses the new concept of satisfaction (ST) trees for encoding if and how a graph satisfies a graph condition. We then demonstrate how to manipulate these STs incrementally with respect to a graph update.
During the overall development of complex engineering systems different modeling notations are employed. For example, in the domain of automotive systems system engineering models are employed quite early to capture the requirements and basic structuring of the entire system, while software engineering models are used later on to describe the concrete software architecture. Each model helps in addressing the specific design issue with appropriate notations and at a suitable level of abstraction. However, when we step forward from system design to the software design, the engineers have to ensure that all decisions captured in the system design model are correctly transferred to the software engineering model. Even worse, when changes occur later on in either model, today the consistency has to be reestablished in a cumbersome manual step. In this report, we present in an extended version of [Holger Giese, Stefan Neumann, and Stephan Hildebrandt. Model Synchronization at Work: Keeping SysML and AUTOSAR Models Consistent. In Gregor Engels, Claus Lewerentz, Wilhelm Schäfer, Andy Schürr, and B. Westfechtel, editors, Graph Transformations and Model Driven Enginering - Essays Dedicated to Manfred Nagl on the Occasion of his 65th Birthday, volume 5765 of Lecture Notes in Computer Science, pages 555–579. Springer Berlin / Heidelberg, 2010.] how model synchronization and consistency rules can be applied to automate this task and ensure that the different models are kept consistent. We also introduce a general approach for model synchronization. Besides synchronization, the approach consists of tool adapters as well as consistency rules covering the overlap between the synchronized parts of a model and the rest. We present the model synchronization algorithm based on triple graph grammars in detail and further exemplify the general approach by means of a model synchronization solution between system engineering models in SysML and software engineering models in AUTOSAR which has been developed for an industrial partner. In the appendix as extension to [19] the meta-models and all TGG rules for the SysML to AUTOSAR model synchronization are documented.
The correctness of model transformations is a crucial element for the model-driven engineering of high quality software. A prerequisite to verify model transformations at the level of the model transformation specification is that an unambiguous formal semantics exists and that the employed implementation of the model transformation language adheres to this semantics. However, for existing relational model transformation approaches it is usually not really clear under which constraints particular implementations are really conform to the formal semantics. In this paper, we will bridge this gap for the formal semantics of triple graph grammars (TGG) and an existing efficient implementation. Whereas the formal semantics assumes backtracking and ignores non-determinism, practical implementations do not support backtracking, require rule sets that ensure determinism, and include further optimizations. Therefore, we capture how the considered TGG implementation realizes the transformation by means of operational rules, define required criteria and show conformance to the formal semantics if these criteria are fulfilled. We further outline how static analysis can be employed to guarantee these criteria.
The correctness of model transformations is a crucial element for model-driven engineering of high-quality software. A prerequisite to verify model transformations at the level of the model transformation specification is that an unambiguous formal semantics exists and that the implementation of the model transformation language adheres to this semantics. However, for existing relational model transformation approaches, it is usually not really clear under which constraints particular implementations really conform to the formal semantics. In this paper, we will bridge this gap for the formal semantics of triple graph grammars (TGG) and an existing efficient implementation. While the formal semantics assumes backtracking and ignores non-determinism, practical implementations do not support backtracking, require rule sets that ensure determinism, and include further optimizations. Therefore, we capture how the considered TGG implementation realizes the transformation by means of operational rules, define required criteria, and show conformance to the formal semantics if these criteria are fulfilled. We further outline how static and runtime checks can be employed to guarantee these criteria.
Model-driven software development requires techniques to consistently propagate modifications between different related models to realize its full potential. For large-scale models, efficiency is essential in this respect. In this paper, we present an improved model synchronization algorithm based on triple graph grammars that is highly efficient and, therefore, can also synchronize large-scale models sufficiently fast. We can show, that the overall algorithm has optimal complexity if it is dominating the rule matching and further present extensive measurements that show the efficiency of the presented model transformation and synchronization technique.
Advanced mechatronic systems have to integrate existing technologies from mechanical, electrical and software engineering. They must be able to adapt their structure and behavior at runtime by reconfiguration to react flexibly to changes in the environment. Therefore, a tight integration of structural and behavioral models of the different domains is required. This integration results in complex reconfigurable hybrid systems, the execution logic of which cannot be addressed directly with existing standard modeling, simulation, and code-generation techniques. We present in this paper how our component-based approach for reconfigurable mechatronic systems, M ECHATRONIC UML, efficiently handles the complex interplay of discrete behavior and continuous behavior in a modular manner. In addition, its extension to even more flexible reconfiguration cases is presented.
Advanced mechatronic systems have to integrate existing technologies from mechanical, electrical and software engineering. They must be able to adapt their structure and behavior at runtime by reconfiguration to react flexibly to changes in the environment. Therefore, a tight integration of structural and behavioral models of the different domains is required. This integration results in complex reconfigurable hybrid systems, the execution logic of which cannot be addressed directly with existing standard modeling, simulation, and code-generation techniques. We present in this paper how our component-based approach for reconfigurable mechatronic systems, MECHATRONIC UML, efficiently handles the complex interplay of discrete behavior and continuous behavior in a modular manner. In addition, its extension to even more flexible reconfiguration cases is presented.
Currently, a transformation of our technical world into a networked technical world where besides the embedded systems with their interaction with the physical world the interconnection of these nodes in the cyber world becomes a reality can be observed. In parallel nowadays there is a strong trend to employ artificial intelligence techniques and in particular machine learning to make software behave smart. Often cyber-physical systems must be self-adaptive at the level of the individual systems to operate as elements in open, dynamic, and deviating overall structures and to adapt to open and dynamic contexts while being developed, operated, evolved, and governed independently.
In this presentation, we will first discuss the envisioned future scenarios for cyber-physical systems with an emphasis on the synergies networking can offer and then characterize which challenges for the design, production, and operation of these systems result. We will then discuss to what extent our current capabilities, in particular concerning software engineering match these challenges and where substantial improvements for the software engineering are crucial. In today's software engineering for embedded systems models are used to plan systems upfront to maximize envisioned properties on the one hand and minimize cost on the other hand. When applying the same ideas to software for smart cyber-physical systems, it soon turned out that for these systems often somehow more subtle links between the involved models and the requirements, users, and environment exist. Self-adaptation and runtime models have been advocated as concepts to covers the demands that result from these subtler links. Lately, both trends have been brought together more thoroughly by the notion of self-aware computing systems. We will review the underlying causes, discuss some our work in this direction, and outline related open challenges and potential for future approaches to software engineering for smart cyber-physical systems.
The service-oriented architecture supports the dynamic assembly and runtime reconfiguration of complex open IT landscapes by means of runtime binding of service contracts, launching of new components and termination of outdated ones. Furthermore, the evolution of these IT landscapes is not restricted to exchanging components with other ones using the same service contracts, as new services contracts can be added as well. However, current approaches for modeling and verification of service-oriented architectures do not support these important capabilities to their full extend.In this report we present an extension of the current OMG proposal for service modeling with UML - SoaML - which overcomes these limitations. It permits modeling services and their service contracts at different levels of abstraction, provides a formal semantics for all modeling concepts, and enables verifying critical properties. Our compositional and incremental verification approach allows for complex properties including communication parameters and time and covers besides the dynamic binding of service contracts and the replacement of components also the evolution of the systems by means of new service contracts. The modeling as well as verification capabilities of the presented approach are demonstrated by means of a supply chain example and the verification results of a first prototype are shown.
In this extended abstract, we will analyze the current challenges for the envisioned Self-Adaptive CPS. In addition, we will outline our results to approach these challenges with SMARTSOS [10] a generic approach based on extensions of graph transformation systems employing open and adaptive collaborations and models at runtime for trustworthy self-adaptation, self-organization, and evolution of the individual systems and the system-of-systems level taking the independent development, operation, management, and evolution of these systems into account.
Zum Thema "Quo vadis, Modellierung?" hält Prof. Dr. Holger Giese am 11. Dezember 2008 seine Antrittsvorlesung an der Universität Potsdam. Der Wissenschaftler bekleidet eine Professur für Systemanalyse und Modellierung. Es handelt sich um eine gemeinsame Berufung der Universität Potsdam mit dem Hasso-Plattner- Institut für Softwaresystemtechnik an der Universität Potsdam. Seit den Anfängen der Informatik vollzieht sich die Entwicklung von detaillierten, lösungsorientierten und eher technisch geprägten Modellen hin zu solchen, die immer abstrakter und eher an den Problemen beziehungsweise Anwendungsbereichen orientiert sind. Diese ermöglichen es, die Komplexität heutiger Systeme besser zu beherrschen. Der Einsatz führt in einigen Anwendungsbereichen heute schon zu bedeutend höherer Produktivität und Qualität sowie geringeren Entwicklungszeiten. Anderseits hat sich aber auch in anderen Anwendungsgebieten gezeigt, dass die ständige Anpassung der Software an sich ändernde Anforderungen oder Organisationsstrukturen dazu führt, dass in frühen Entwicklungsphasen entstandene Modelle in der Praxis oft sehr schnell nicht mehr mit der Software übereinstimmen. In seiner Antrittsvorlesung will Holger Giese diese Entwicklung Revue passieren lassen und der Frage nachgehen, was dies für die Zukunft der Modellierung bedeutet, mit welchen aktuellen Ansätzen man diesem Problem zu begegnen versucht und welche zukünftigen Entwicklungen für die Modellierung zu erwarten sind.
Erwerb der Phone
(2006)
Beworbene Vergangenheit
(2017)