Facilitating argumentative knowledge construction with computer-supported collaboration scripts

Online discussions provide opportunities for learners to engage in argumentative debate, but learners rarely formulate well-grounded arguments or benefit individually from participating in online discussions. Learners often do not explicitly warrant their arguments and fail to construct counterarguments (incomplete formal argumentation structure), which is hypothesized to impede individual knowledge acquisition. Computer-supported scripts have been found to support learners during online discussions. Such scripts can support specific discourse activities, such as the construction of single arguments, by supporting learners in explicitly warranting their claims or in constructing specific argumentation sequences, e.g., argument–counterargument sequences, during online discussions. Participation in argumentative discourse is seen to promote both knowledge on argumentation and domain-specific knowledge. However, there have been few empirical investigations regarding the extent to which computer-supported collaboration scripts can foster the formal quality of argumentation and thereby facilitate the individual acquisition of knowledge. One hundred and twenty (120) students of Educational Science participated in the study with a 2×2-factorial design (with vs. without script for the construction of single arguments and with vs. without script for the construction of argumentation sequences) and were randomly divided into groups of three. Results indicated that the collaboration scripts could improve the formal quality of single arguments and the formal quality of argumentation sequences in online discussions. Scripts also facilitated the acquisition of knowledge on argumentation, without affecting the acquisition of domainspecific knowledge

The calculus of multivectors on noncommutative jet spaces

The Leibniz rule for derivations is invariant under cyclic permutations of co-multiples within the arguments of derivations. We explore the implications of this principle: in effect, we construct a class of noncommutative bundles in which the sheaves of algebras of walks along a tesselated affine manifold form the base, whereas the fibres are free associative algebras or, at a later stage, such algebras quotients over the linear relation of equivalence under cyclic shifts. The calculus of variations is developed on the infinite jet spaces over such noncommutative bundles. In the frames of such field-theoretic extension of the Kontsevich formal noncommutative symplectic (super)geometry, we prove the main properties of the Batalin--Vilkovisky Laplacian and Schouten bracket. We show as by-product that the structures which arise in the classical variational Poisson geometry of infinite-dimensional integrable systems do actually not refer to the graded commutativity assumption.Comment: Talks given at Mathematics seminar (IHES, 25.11.2016) and Oberseminar (MPIM Bonn, 2.02.2017), 23 figures, 60 page

Semantic Web Techniques to Support Interoperability in Distributed Networked Environments

We explore two Semantic Web techniques arising from ITA research into semantic alignment and interoperability in distributed networks. The first is POAF (Portable Ontology Aligned Fragments) which addresses issues relating to the portability and usage of ontology alignments. POAF uses an ontology fragmentation strategy to achieve portability, and enables subsequent usage through a form of automated ontology modularization. The second technique, SWEDER (Semantic Wrapping of Existing Data sources with Embedded Rules), is grounded in the creation of lightweight ontologies to semantically wrap existing data sources, to facilitate rapid semantic integration through representational homogeneity. The semantic integration is achieved through the creation of context ontologies which define the integrations and provide a portable definition of the integration rules in the form of embedded SPARQL construct clauses. These two Semantic Web techniques address important practical issues relevant to the potential future adoption of ontologies in distributed network environments

Ehrenfest-time dependence of counting statistics for chaotic ballistic systems

Transport properties of open chaotic ballistic systems and their statistics can be expressed in terms of the scattering matrix connecting incoming and outgoing wavefunctions. Here we calculate the dependence of correlation functions of arbitrarily many pairs of scattering matrices at different energies on the Ehrenfest time using trajectory based semiclassical methods. This enables us to verify the prediction from effective random matrix theory that one part of the correlation function obtains an exponential damping depending on the Ehrenfest time, while also allowing us to obtain the additional contribution which arises from bands of always correlated trajectories. The resulting Ehrenfest-time dependence, responsible e.g. for secondary gaps in the density of states of Andreev billiards, can also be seen to have strong effects on other transport quantities like the distribution of delay times.Comment: Refereed version. 15 pages, 14 figure