Refine
Has Fulltext
- yes (248) (remove)
Year of publication
- 2010 (248) (remove)
Document Type
- Article (148)
- Postprint (26)
- Review (25)
- Conference Proceeding (23)
- Preprint (10)
- Monograph/Edited Volume (8)
- Part of Periodical (4)
- Master's Thesis (2)
- Other (2)
Language
- German (173)
- English (64)
- Spanish (8)
- Multiple languages (2)
- French (1)
Is part of the Bibliography
- no (248) (remove)
Keywords
- Deutschland (18)
- Germany (17)
- Poland (16)
- Polen (16)
- Consolidation (14)
- European Union (14)
- Europäische Union (14)
- Integration (14)
- Vertiefung (14)
- Humboldt und Hispanoamerika (4)
Institute
- WeltTrends e.V. Potsdam (35)
- Institut für Jüdische Studien und Religionswissenschaft (32)
- Vereinigung für Jüdische Studien e. V. (32)
- Historisches Institut (25)
- Kommunalwissenschaftliches Institut (23)
- MenschenRechtsZentrum (22)
- Institut für Romanistik (19)
- Department Linguistik (18)
- Extern (18)
- Institut für Informatik und Computational Science (16)
Der Beitrag erinnert an das wechselvolle Leben des Friedensnobelpreisträgers Henry Dunant, sucht nach biografischen Wurzeln seines von Menschlichkeit und Würde getragenen Verhaltens und macht auf seine Leistungen aufmerksam. Er will aber auch die Frage nach der Bedeutung des humanitären Völkerrechts im Verhältnis von Krieg und Frieden nicht außer Acht lassen.
Deductive databases need general formulas in rule bodies, not only conjuctions of literals. This is well known since the work of Lloyd and Topor about extended logic programming. Of course, formulas must be restricted in such a way that they can be effectively evaluated in finite time, and produce only a finite number of new tuples (in each iteration of the TP-operator: the fixpoint can still be infinite). It is also necessary to respect binding restrictions of built-in predicates: many of these predicates can be executed only when certain arguments are ground. Whereas for standard logic programming rules, questions of safety, allowedness, and range-restriction are relatively easy and well understood, the situation for general formulas is a bit more complicated. We give a syntactic analysis of formulas that guarantees the necessary properties.
This paper is a critical examination of the relationship between reality and simulation. After a brief theoretical introduction, it unfolds its argument on an empirical level, using a thick game playing description of GRAND THEFT AUTO IV. This in-game experience serves as material for the subsequent analysis, in the course of which defining characteristics of computer game playing are formulated. Finally, on the basis of this analysis, the paper postulates the hypothesis that playing computer games like GTA IV promotes competency in deconstructing simulations and implements a cyclic logic of recreation.
Because software development is increasingly expensive and timeconsuming, software reuse gains importance. Aspect-oriented software development modularizes crosscutting concerns which enables their systematic reuse. Literature provides a number of AOP patterns and best practices for developing reusable aspects based on compelling examples for concerns like tracing, transactions and persistence. However, such best practices are lacking for systematically reusing invasive aspects. In this paper, we present the ‘callback mismatch problem’. This problem arises in the context of abstraction mismatch, in which the aspect is required to issue a callback to the base application. As a consequence, the composition of invasive aspects is cumbersome to implement, difficult to maintain and impossible to reuse. We motivate this problem in a real-world example, show that it persists in the current state-of-the-art, and outline the need for advanced aspectual composition mechanisms to deal with this.