The goal specificity effect on strategy use and instructional efficiency during computer-based scientific discovery learning

Using a computer-based scientific discovery learning environment on buoyancy in fluids we investigated the effects of goal specificity (nonspecific goals vs. specific goals) for two goal types (problem solving goals vs. learning goals) on strategy use and instructional efficiency. Our empirical findings close an important research gap, because in earlier studies the goal specificity effect either was restricted to one goal type or goal type was confounded with goal specificity. In addition, there is hardly a study with empirical evidence for the goal specificity effect on strategy use, which counts even more for a cognitive cost-benefit ratio as a dependent variable. Instead, in earlier studies the goal specificity effect has been attributed to differences in strategy use and cognitive cost-benefit ratio in a rather theoretical way. In the present study for strategy use an interaction was found between goal specificity and goal type, indicating that the goal specificity effect occurs only in case of problem solving goals, but not in case of learning goals. Compared to students provided with specific problem solving goals, students who worked on nonspecific problem solving goals, used a control of variables-strategy more frequently. Additionally, we found a main effect of goal specificity on instructional efficiency for both of the goal types, pointing at a more favorable relationship between performance gain and cognitive load caused by nonspecific goals.     

Pose-invariant face recognition by matching on multi-resolution MRFs linked by supercoupling transform

Recognition of faces in arbitrary pose is addressed in this paper. For this task, an MRF-based classification approach is proposed which employs the energy of the established match between a pair of images as a criterion of goodness-of-match. By incorporating an image matching method as part of the recognition process, the system is made robust to moderate global spatial transformations. The approach draws on a method [1] which has the potential to cope with pose changes but a direct application of which suffers from several shortcomings. In order to overcome these problems, a number of enhancements are proposed. First, by adopting a multi-scale relaxation scheme based on super coupling transform, the inference using sequential tree re-weighted message passing approach [2] is accelerated. Next, by taking advantage of a statistical shape prior for the matching, the results are regularized and constrained, making the system robust to spurious structures and outliers. For classification, both textural and structural similarities of the facial images are taken into account. The method is evaluated on two databases and promising results are obtained.     

A biologically inspired active compliant joint using local positive velocity feedback (LPVF).

Starting from studies which revealed that positive feedback is found in the control system for walking in arthropods, we have constructed a new positive feedback driven joint that can be used for solving compliant motion tasks. We propose two different joint constructions each of which shows passive compliance. Based on these joints we introduce three different local positive velocity feedback (LPVF) controllers and discuss their properties in the context of motion generation in closed kinematic chains. The third circuit named undelayed dLPVF is used for the control of a compliant planar manipulator which turns a crank. Our concept is of highly decentralized nature and follows the idea of embodiment. In our case this means that a process which is controlled by LPVF controllers reveals its nature when the controllers interact with this process.     

Consensus in the presence of mortal Byzantine faulty processes

We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed behavior before they eventually crash. We call this failure model “mortal Byzantine”. After discussing some application examples where this model is justified, we provide matching upper and lower bounds on the number of faulty processes, and on the required number of rounds in synchronous systems. We then continue our study by varying different system parameters. On the one hand, we consider the failure model under weaker timing assumptions, namely for partially synchronous systems and asynchronous systems with unreliable failure detectors. On the other hand, we vary the failure model in that we limit the occurrences of faulty steps that actually lead to a crash in synchronous systems.     

Pattern Recognition in Images by Symmetries and Coordinate Transformations

A theory for detecting general curve families by means of symmetry measurements is presented. Symmetries are modeled by iso-gray curves of conjugate harmonic function pairs which define coordinate transformations. Harmonic function pair coordinates render the target curve patterns as parallel lines, which is defined here as linear symmetry. Detecting these lines, or generalized linear symmetry fitting, corresponds to finding invariants of Lie groups of transformations. A technique based on total least square error minimization for estimating the invariance parameters is presented. It uses the Lie infinitesimal operators to construct feature extraction methods that are efficient and simple to implement. The technique, which is shown to be an extension of the generalized Hough Transform, enables detection by voting and accumulating evidence for the searched pattern. In this approach complex valued votes are permitted, where the phase of the vote identifies the member of the family of patterns that are detectable. Experimental results illustrating the theory and its application to real as well as synthetic images are presented.     

An empirical InSAR-optical fusion approach to mapping vegetation canopy height

Exploiting synergies afforded by a host of recently available national-scale data sets derived from interferometric synthetic aperture radar (InSAR) and passive optical remote sensing, this paper describes the development of a novel empirical approach for the provision of regional- to continental-scale estimates of vegetation canopy height. Supported by data from the 2000 Shuttle Radar Topography Mission (SRTM), the National Elevation Dataset (NED), the LANDFIRE project, and the National Land Cover Database (NLCD) 2001, this paper describes a data fusion and modeling strategy for developing the first-ever high-resolution map of canopy height for the conterminous U.S. The approach was tested as part of a prototype study spanning some 62,000 km² in central Utah (NLCD mapping zone 16). A mapping strategy based on object-oriented image analysis and tree-based regression techniques is employed. Empirical model development is driven by a database of height metrics obtained from an extensive field plot network administered by the USDA Forest Service-Forest Inventory and Analysis (FIA) program. Based on data from 508 FIA field plots, an average absolute height error of 2.1 m (r = 0.88) was achieved for the prototype mapping zone.     

ATP and Presentation Service for Mizar Formalizations

This paper describes the Automated Reasoning for Mizar ( $\textsf{Miz}\mathbb{AR}$ ) service, which integrates several automated reasoning, artificial intelligence, and presentation tools with Mizar and its authoring environment. The service provides ATP assistance to Mizar authors in finding and explaining proofs, and offers generation of Mizar problems as challenges to ATP systems. The service is based on a sound translation from the Mizar language to that of first-order ATP systems, and relies on the recent progress in application of ATP systems in large theories containing tens of thousands of available facts. We present the main features of $\textsf{Miz}\mathbb{AR}$ services, followed by an account of initial experiments in finding proofs with the ATP assistance. Our initial experience indicates that the tool offers substantial help in exploring the Mizar library and in preparing new Mizar articles.     

Automatic annotation of tennis games: An integration of audio,vision, and learning

Fully automatic annotation of tennis game using broadcast video is a task with a great potential but with enormous challenges. In this paper we describe our approach to this task, which integrates computer vision, machine listening, and machine learning. At the low level processing, we improve upon our previously proposed state-of-the-art tennis ball tracking algorithm and employ audio signal processing techniques to detect key events and construct features for classifying the events. At high level analysis, we model event classification as a sequence labelling problem, and investigate four machine learning techniques using simulated event sequences. Finally, we evaluate our proposed approach on three real world tennis games, and discuss the interplay between audio, vision and learning. To the best of our knowledge, our system is the only one that can annotate tennis game at such a detailed level.