Reinventing discovery learning: a field-wide research program

© 2017, Springer Science+Business Media B.V., part of Springer Nature. Whereas some educational designers believe that students should learn new concepts through explorative problem solving within dedicated environments that constrain key parameters of their search and then support their progressive appropriation of empowering disciplinary forms, others are critical of the ultimate efficacy of this discovery-based pedagogical philosophy, citing an inherent structural challenge of students constructing historically achieved conceptual structures from their ingenuous notions. This special issue presents six educational research projects that, while adhering to principles of discovery-based learning, are motivated by complementary philosophical stances and theoretical constructs. The editorial introduction frames the set of projects as collectively exemplifying the viability and breadth of discovery-based learning, even as these projects: (a) put to work a span of design heuristics, such as productive failure, surfacing implicit know-how, playing epistemic games, problem posing, or participatory simulation activities; (b) vary in their target content and skills, including building electric circuits, solving algebra problems, driving safely in traffic jams, and performing martial-arts maneuvers; and (c) employ different media, such as interactive computer-based modules for constructing models of scientific phenomena or mathematical problem situations, networked classroom collective “video games,” and intercorporeal master–student training practices. The authors of these papers consider the potential generativity of their design heuristics across domains and contexts

Data-Oblivious Stream Productivity

We are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidable, but for restricted formats computable sufficient conditions can be obtained. The usual analysis disregards the identity of data, thus leading to approaches that we call data-oblivious. We present a method that is provably optimal among all such data-oblivious approaches. This means that in order to improve on the algorithm in this paper one has to proceed in a data-aware fashion

Does clinical management improve outcomes following self-Harm? Results from the multicentre study of self-harm in England

Background Evidence to guide clinical management of self-harm is sparse, trials have recruited selected samples, and psychological treatments that are suggested in guidelines may not be available in routine practice. Aims To examine how the management that patients receive in hospital relates to subsequent outcome. Methods We identified episodes of self-harm presenting to three UK centres (Derby, Manchester, Oxford) over a 10 year period (2000 to 2009). We used established data collection systems to investigate the relationship between four aspects of management (psychosocial assessment, medical admission, psychiatric admission, referral for specialist mental health follow up) and repetition of self-harm within 12 months, adjusted for differences in baseline demographic and clinical characteristics. Results 35,938 individuals presented with self-harm during the study period. In two of the three centres, receiving a psychosocial assessment was associated with a 40% lower risk of repetition, Hazard Ratios (95% CIs): Centre A 0.99 (0.90–1.09); Centre B 0.59 (0.48–0.74); Centre C 0.59 (0.52–0.68). There was little indication that the apparent protective effects were mediated through referral and follow up arrangements. The association between psychosocial assessment and a reduced risk of repetition appeared to be least evident in those from the most deprived areas. Conclusion These findings add to the growing body of evidence that thorough assessment is central to the management of self-harm, but further work is needed to elucidate the possible mechanisms and explore the effects in different clinical subgroups

Exact resultants for corner-cut unmixed multivariate polynomial systems using the dixon formulation

Structural conditions on the support of a multivariate polynomial system are developed for which the Dixon-based resultant methods compute exact resultants. For cases when this cannot be done, an upper bound on the degree of the extraneous factor in the projection operator can be determined a priori, thus resulting in quick identification of the extraneous factor in the projection operator. (For the bivariate case, the degree of the extraneous factor in a projection operator can be determined a priori.) The concepts of a corner-cut support and almost corner-cut support of an unmixed polynomial system are introduced. For generic unmixed polynomial systems with corner-cut and almost corner-cut supports, the Dixon based methods can be used to compute their resultants exactly. These structural conditions on supports are based on analyzing how such supports differ from box supports of n-degree systems for which the Dixon formulation is known to compute the resultants exactly. Such an analysis also gives a sharper bound on the complexity of resultant computation using the Dixon formulation in terms of the support and the mixed volume of the Newton polytope of the support. These results are a direct generalization of the authors ’ results on bivariate systems including the results of Zhang and Goldman as well as of Chionh for generic unmixed bivariate polynomial systems with corner-cut supports

Antibody localization in horse, rabbit, and goat antilymphocyte sera

The localization of antibodies was studied in rabbit, goat, and horse ALS raised by weekly immunization with canine or human spleen cells for 4 to 12 weeks. A combination of analytic techniques was used including column chromatography, electrophoresis, immunoelectrophoresis, determination of protein concentration, and measurement of antibody titers. In the rabbit and goat ALS, virtually all of the leukoagglutinins and lymphocytotoxins were in the easily separable IgG; accidentally induced thromboagglutinins were in the same location. In the rabbit hemagglutinins were found in both the IgG and IgM, whereas in the goat these were almost exclusively in the IgM. The antiwhite cell antibodies were most widely distributed in the horse. The cytotoxins were primarily in the IgG, but the leukoagglutinins were most heavily concentrated in the T-equine globulin which consists mostly of IgA. By differential ammonium sulfate precipitation of a horse antidoglymphocyte serum, fractions were prepared that were rich in IgG and IgA. Both were able to delay the rejection of canine renal homografts, the IgA-rich preparation to a somewhat greater degree. The findings in this study have been discussed in relation to the refining techniques that have been used for the production of globulin from heterologous ALS. © 1970

An Information-Theoretic Solution to Parameter Setting*

In this paper, we point out a possible way by which the child could obtain the target values of the word order parameters for her language. The essential idea is an entropy-based statistical analysis of the input stream

Rectification by charging -- the physics of contact-induced current asymmetry in molecular conductors

We outline the qualitatively different physics behind charging-induced current asymmetries in molecular conductors operating in the weakly interacting self-consistent field (SCF) and the strongly interacting Coulomb Blockade (CB) regimes. A conductance asymmetry arises in SCF because of the unequal mean-field potentials that shift a closed-shell conducting level differently for positive and negative bias. A very different current asymmetry arises for CB due to the unequal number of open-shell excitation channels at opposite bias voltages. The CB regime, dominated by single charge effects, typically requires a computationally demanding many-electron or Fock space description. However, our analysis of molecular Coulomb Blockade measurements reveals that many novel signatures can be explained using a {{simpler}} orthodox model that involves an incoherent sum of Fock space excitations and {\it{hence treats the molecule as a metallic dot or an island}}. This also reduces the complexity of the Fock space description by just including various charge configurations only, thus partially underscoring the importance of electronic structure, while retaining the essence of the single charge nature of the transport process. We finally point out, however, that the inclusion of electronic structure and hence well-resolved Fock space excitations is crucial in some notable examples.Comment: 12 pages, 10 figure

Three Cuts for Accelerated Interval Propagation

This paper addresses the problem of nonlinear multivariate root finding. In an earlier paper we described a system called Newton which finds roots of systems of nonlinear equations using refinements of interval methods. The refinements are inspired by AI constraint propagation techniques. Newton is competative with continuation methods on most benchmarks and can handle a variety of cases that are infeasible for continuation methods. This paper presents three "cuts" which we believe capture the essential theoretical ideas behind the success of Newton. This paper describes the cuts in a concise and abstract manner which, we believe, makes the theoretical content of our work more apparent. Any implementation will need to adopt some heuristic control mechanism. Heuristic control of the cuts is only briefly discussed here

Guided Unfoldings for Finding Loops in Standard Term Rewriting

In this paper, we reconsider the unfolding-based technique that we have introduced previously for detecting loops in standard term rewriting. We improve it by guiding the unfolding process, using distinguished positions in the rewrite rules. This results in a depth-first computation of the unfoldings, whereas the original technique was breadth-first. We have implemented this new approach in our tool NTI and compared it to the previous one on a bunch of rewrite systems. The results we get are promising (better times, more successful proofs).Comment: Pre-proceedings paper presented at the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018), Frankfurt am Main, Germany, 4-6 September 2018 (arXiv:1808.03326