Refine
Year of publication
Document Type
- Conference Proceeding (579) (remove)
Language
- English (489)
- German (77)
- Multiple languages (10)
- French (2)
- Russian (1)
Keywords
- social media (5)
- Archiv (4)
- Information Structure (4)
- Nachlass (4)
- COVID-19 (3)
- Cloud Computing (3)
- E-Learning (3)
- E-Mail Tracking (3)
- ERP (3)
- MOOC (3)
Institute
- Extern (139)
- Fachgruppe Betriebswirtschaftslehre (78)
- Institut für Biochemie und Biologie (57)
- Department Sport- und Gesundheitswissenschaften (43)
- Institut für Ernährungswissenschaft (38)
- Department Psychologie (30)
- Institut für Künste und Medien (23)
- Interdisziplinäres Zentrum für Musterdynamik und Angewandte Fernerkundung (23)
- Institut für Informatik und Computational Science (20)
- Institut für Slavistik (17)
We describe a framework to support the implementation of web-based systems to manipulate data stored in relational databases. Since the conceptual model of a relational database is often specified as an entity-relationship (ER) model, we propose to use the ER model to generate a complete implementation in the declarative programming language Curry. This implementation contains operations to create and manipulate entities of the data model, supports authentication, authorization, session handling, and the composition of individual operations to user processes. Furthermore and most important, the implementation ensures the consistency of the database w.r.t. the data dependencies specified in the ER model, i.e., updates initiated by the user cannot lead to an inconsistent state of the database. In order to generate a high-level declarative implementation that can be easily adapted to individual customer requirements, the framework exploits previous works on declarative database programming and web user interface construction in Curry.
Preface
(2010)
The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. In this decade, previous workshops took place in Dresden (2008), Würzburg (2007), Vienna (2006), Ulm (2005), Potsdam (2004), Dresden (2002), Kiel (2001), and Würzburg (2000). Contributions to workshops deal with all theoretical, experimental, and application aspects of constraint programming (CP) and logic programming (LP), including foundations of constraint/ logic programming. Some of the special topics are constraint solving and optimization, extensions of functional logic programming, deductive databases, data mining, nonmonotonic reasoning, , interaction of CP/LP with other formalisms like agents, XML, JAVA, program analysis, program transformation, program verification, meta programming, parallelism and concurrency, answer set programming, implementation and software techniques (e.g., types, modularity, design patterns), applications (e.g., in production, environment, education, internet), constraint/logic programming for semantic web systems and applications, reasoning on the semantic web, data modelling for the web, semistructured data, and web query languages.
The workshops on (constraint) logic programming (WLP) are the annual meeting of the Society of Logic Programming (GLP e.V.) and bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence and operations research. The 23rd WLP was held in Potsdam at September 15 – 16, 2009. The topics of the presentations of WLP2009 were grouped into the major areas: Databases, Answer Set Programming, Theory and Practice of Logic Programming as well as Constraints and Constraint Handling Rules.
Aspect-oriented middleware is a promising technology for the realisation of dynamic reconfiguration in heterogeneous distributed systems. However, like other dynamic reconfiguration approaches, AO-middleware-based reconfiguration requires that the consistency of the system is maintained across reconfigurations. AO-middleware-based reconfiguration is an ongoing research topic and several consistency approaches have been proposed. However, most of these approaches tend to be targeted at specific contexts, whereas for distributed systems it is crucial to cover a wide range of operating conditions. In this paper we propose an approach that offers distributed, dynamic reconfiguration in a consistent manner, and features a flexible framework-based consistency management approach to cover a wide range of operating conditions. We evaluate our approach by investigating the configurability and transparency of our approach and also quantify the performance overheads of the associated consistency mechanisms.
In this paper we consider a simple syntactic extension of Answer Set Programming (ASP) for dealing with (nested) existential quantifiers and double negation in the rule bodies, in a close way to the recent proposal RASPL-1. The semantics for this extension just resorts to Equilibrium Logic (or, equivalently, to the General Theory of Stable Models), which provides a logic-programming interpretation for any arbitrary theory in the syntax of Predicate Calculus. We present a translation of this syntactic class into standard logic programs with variables (either disjunctive or normal, depending on the input rule heads), as those allowed by current ASP solvers. The translation relies on the introduction of auxiliary predicates and the main result shows that it preserves strong equivalence modulo the original signature.
The difference-list technique is described in literature as effective method for extending lists to the right without using calls of append/3. There exist some proposals for automatic transformation of list programs into differencelist programs. However, we are interested in construction of difference-list programs by the programmer, avoiding the need of a transformation step. In [GG09] it was demonstrated, how left-recursive procedures with a dangling call of append/3 can be transformed into right-recursion using the unfolding technique. For simplification of writing difference-list programs using a new cons/2 procedure was introduced. In the present paper, we investigate how efficieny is influenced using cons/2. We measure the efficiency of procedures using accumulator technique, cons/2, DCG’s, and difference lists and compute the resulting speedup in respect to the simple procedure definition using append/3. Four Prolog systems were investigated and we found different behaviour concerning the speedup by difference lists. A result of our investigations is, that an often advice given in the literature for avoiding calls append/3 could not be confirmed in this strong formulation.
We propose a paraconsistent declarative semantics of possibly inconsistent generalized logic programs which allows for arbitrary formulas in the body and in the head of a rule (i.e. does not depend on the presence of any specific connective, such as negation(-as-failure), nor on any specific syntax of rules). For consistent generalized logic programs this semantics coincides with the stable generated models introduced in [HW97], and for normal logic programs it yields the stable models in the sense of [GL88].
A wide range of additional forward chaining applications could be realized with deductive databases, if their rule formalism, their immediate consequence operator, and their fixpoint iteration process would be more flexible. Deductive databases normally represent knowledge using stratified Datalog programs with default negation. But many practical applications of forward chaining require an extensible set of user–defined built–in predicates. Moreover, they often need function symbols for building complex data structures, and the stratified fixpoint iteration has to be extended by aggregation operations. We present an new language Datalog*, which extends Datalog by stratified meta–predicates (including default negation), function symbols, and user–defined built–in predicates, which are implemented and evaluated top–down in Prolog. All predicates are subject to the same backtracking mechanism. The bottom–up fixpoint iteration can aggregate the derived facts after each iteration based on user–defined Prolog predicates.
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.
We introduce a simple approach extending the input language of Answer Set Programming (ASP) systems by multi-valued propositions. Our approach is implemented as a (prototypical) preprocessor translating logic programs with multi-valued propositions into logic programs with Boolean propositions only. Our translation is modular and heavily benefits from the expressive input language of ASP. The resulting approach, along with its implementation, allows for solving interesting constraint satisfaction problems in ASP, showing a good performance.
Light verbs make heavy work
(2011)
The variability of bone strength and skeletal robustness of young men - how it can be influenced
(2011)
Association between skeletal robustness and physical activity in schoolchildren - First results
(2011)
Seit dem Jahr 2007 kooperieren die Moskauer Staatliche Juristische O. E. Kutafin Akademie und die Juristische Fakultät der Universität Potsdam mit hohem gegenseitigen Ertrag. Über den wissenschaftlichen Erkenntnisgewinn hinaus trägt die Partnerschaft zum Verständnis des anderen bei und hilft, die Gegensätze zu überwinden, welche das Verhältnis zwischen Deutschland und Russland im 20. Jahrhundert kennzeichneten. Im jährlichen Wechsel finden die Woche des Russischen Rechts in Potsdam und die Woche des Deutschen Rechts in Moskau statt. Der Band gibt die Vorträge namhafter Moskauer Wissenschaftlerinnen und Wissenschaftler wieder. Der Leser findet die Vorträge in russischer Sprache, jeweils mit Zusammenfassungen auf Deutsch. Das thematische Spektrum ist weit. Es reicht von der Kriminalistik, dem Völkerrecht, der Europäisierung des Russischen Rechts über die Einführung in das Russische Bankrecht und das Bankensystem der Russischen Föderation bis zur Einführung in das Internationale Privatrecht in Russland.
Die Beiträge des Sammelbandes sind im Rahmen eines Forschungs- und Doktoranden-seminars vorgetragen und diskutiert worden, das im Dezember 2010 in Potsdam stattfand und an dem Wissenschaftler der Staatlichen Universität für Wirtschaft und Finanzen, St. Petersburg, und Wissenschaftler der Lehrstühle für Statistik und Ökonometrie sowie für Volkswirtschaftslehre, insbesondere Wirtschaftstheorie, der Universität Potsdam teilnahmen. Die Veröffentlichung der Aufsätze zeigt zum einen die Vielfalt der Forschungsfelder an beiden Universitäten, die sich aus den unterschiedlichen Schwerpunkten der wissenschaftlichen Einheiten ergeben, sie zeigt auch zum anderen in beispielhafter Weise die unterschiedlichen Forschungstraditionen und Forschungsstile an beiden Universitäten. Die Beiträge beziehen sich sowohl auf ausgewählte Branchen und als auch auf bestimmte raumwirtschaftliche Fragestellungen.
Process analysis usually focuses only on single and selected processes. It is either existent processes that are recorded and analysed or reference processes that are implemented. So far no evident effort has been put into generalising specific process aspects into patterns and comparing those patterns with regard to their efficiency and effectiveness. This article focuses on the combination of dynamic and holistic analytical elements in enterprise architectures. Our goal is to outline an approach to analyse the development of business processes in a cyclical matter and demonstrate this approach based on an existent modelling language. We want to show that organisational learning can derive from the systematic analysis of past and existent processes from which patterns of successful problem solving can be deducted.
Insertion of artificial cell surface receptors for antigen-specific labelling of hybridoma cells
(2012)
Defining the allocation of decision rights for enterprise applications is a crucial issue in IT governance and organization design. Today, emerging delivery models such as Software as a Service (SaaS) defy the notion of the internal IT department as the focal point of centralized governance. Recognizing the importance of this issue, we find that the phenomenon of 'SaaS governance' itself is not yet well understood. Based on two cases of SaaS adoption, we take a process-theoretic approach to investigate the complex interaction between factors that influence in the allocation of SaaS authority. The results suggest that some factors, such as the locus of initiative and the decision for SaaS, interact with absorptive capacities and determine the later mode of application governance at a very early stage. Thus, the initiative for introducing SaaS emerges as an important intermediate variable between the overall IT governance mode and the resulting SaaS governance outcome.
Like versus dislike
(2012)
As Facebook's Like-button has become ubiquitous, it is the purpose of this research to investigate (1) whether Likes serve as a signal of a product's or service's quality and (2) how the introduction of a Dislike-button would alter perceptions. Following a qualitative study, we conducted an experiment in which 653 participants were presented with website screenshots featuring varying levels of Likes and Dislikes. The results indicate that the theoretical framing of Likes as a Signal is valid and that people do perceive the quality of products and services as superior when they are associated with more Likes. Signaling also explains the counter-intuitive finding that Dislikes can have a positive effect on people's quality perceptions. Results are discussed with respect to theory and practical implications.
Aktuelle Fragen des Menschenrechtsschutzes : 1. Potsdamer Menschenrechtstag am 26. Oktober 2011
(2012)
Aus Anlass der Neubesetzung des Menschenrechtszentrums mit den Direktoren Prof. Dr. Andreas Zimmermann, LL.M. (Harvard) und Prof. Dr. Logi Gunnarsson fand am 26.10.2011 der Potsdamer Menschenrechtstag unter der Themenstellung „Aktuelle Fragen des Menschenrechtsschutzes“ statt. Ganz im Sinne der interdisziplinären Ausrichtung des MenschenRechtsZentrums der Universität Potsdam beschäftigten sich die beiden Direktoren in ihren Einführungsvorträgen aus ihrer jeweiligen Disziplin heraus mit philosophischen und rechtlichen Problemstellungen der Menschenrechte und ihres Schutzes.
Plant invasions, resilience, economics, and restoration - can fynbos pay for alien management?
(2012)
CpG-oligonucleotides modulate sphingosine-1-phosphate metabolism in normal human keratinocytes
(2012)
The interplay of autonomy goals and spousal support a prospective study with couples facing cancer
(2012)
DPP-4 inhibition with linagliptin delays the progression of diabetic nephropathy in db/db mice
(2012)
Nanogradient polymer brushes
(2012)
Intrasession reliability of insole in-shoe plantar pressure measurements in different foot areas
(2012)
Test-retest-reliability of metabolic and cardiovascular load during isokinetic strength testing
(2012)
Ultrasound evaluation of the patellar tendon cross-sectional area and its relation to maximum force
(2012)
Multivariate analyses of fixation durations in reading with linear mixed and additive mixed models
(2012)
Die Tagungsreihe zur Hochschuldidaktik der Informatik HDI wird vom Fachbereich Informatik und Ausbildung / Didaktik der Informatik (IAD) in der Gesellschaft für Informatik e. V. (GI) organisiert. Sie dient den Lehrenden der Informatik in Studiengängen an Hochschulen als Forum der Information und des Austauschs über neue didaktische Ansätze und bildungspolitische Themen im Bereich der Hochschulausbildung aus der fachlichen Perspektive der Informatik. Diese fünfte HDI 2012 wurde an der Universität Hamburg organisiert. Für sie wurde das spezielle Motto „Informatik für eine nachhaltige Zukunft“ gewählt, um insbesondere Fragen der Bildungsrelevanz informatischer Inhalte, der Kompetenzen für Studierende informatisch geprägter Studiengänge und der Rolle der Informatik in der Hochschulentwicklung zu diskutieren.
Avatime, a Kwa language of Ghana, has an additive particle tsyɛ that at first sight looks similar to additive particles such as too and also in English. However, on closer inspection, the Avatime particle behaves differently. Contrary to what is usually claimed about additive particles, tsyɛ does not only associate with focused elements. Moreover, unlike its English equivalents, tsyɛ does not come with a requirement of identity between the expressed proposition and an alternative. Instead, it indicates that the proposition it occurs in is similar to or compatible with a presupposed alternative proposition.
In this paper, doubling in Russian Sign Language and Sign Language of the Netherlands is discussed. In both sign languages different constituents (including verbs, nouns, adjectives, adverbs, and whole clauses) can be doubled. It is shown that doubling in both languages has common functions and exhibits a similar structure, despite some differences. On this basis, a unified pragmatic explanation for many doubling phenomena on both the discourse and the clause-internal levels is provided, namely that the main function of doubling both in RSL and NGT is foregrounding of the doubled information.
E-Learning Symposium 2012
(2013)
Dieser Tagungsband beinhaltet die auf dem E-Learning Symposium 2012 an der Universität Potsdam vorgestellten Beiträge zu aktuellen Anwendungen, innovativen Prozesse und neuesten Ergebnissen im Themenbereich E-Learning. Lehrende, E-Learning-Praktiker und -Entscheider tauschten ihr Wissen über etablierte und geplante Konzepte im Zusammenhang mit dem Student-Life-Cycle aus. Der Schwerpunkt lag hierbei auf der unmittelbaren Unterstützung von Lehr- und Lernprozessen, auf Präsentation, Aktivierung und Kooperation durch Verwendung von neuen und etablierten Technologien.