The relation between prior knowledge and students' collaborative discovery learning processes

In this study we investigate how prior knowledge influences knowledge development during collaborative discovery learning. Fifteen dyads of students (pre-university education, 15-16 years old) worked on a discovery learning task in the physics field of kinematics. The (face-to-face) communication between students was recorded and the interaction with the environment was logged. Based on students' individual judgments of the truth-value and testability of a series of domain-specific propositions, a detailed description of the knowledge configuration for each dyad was created before they entered the learning environment. Qualitative analyses of two dialogues illustrated that prior knowledge influences the discovery learning processes, and knowledge development in a pair of students. Assessments of student and dyad definitional (domain-specific) knowledge, generic (mathematical and graph) knowledge, and generic (discovery) skills were related to the students' dialogue in different discovery learning processes. Results show that a high level of definitional prior knowledge is positively related to the proportion of communication regarding the interpretation of results. Heterogeneity with respect to generic prior knowledge was positively related to the number of utterances made in the discovery process categories hypotheses generation and experimentation. Results of the qualitative analyses indicated that collaboration between extremely heterogeneous dyads is difficult when the high achiever is not willing to scaffold information and work in the low achiever's zone of proximal development

On The Feasibility Of Centrally-Coordinated Peer-To-Peer Live Streaming

In this paper we present an exploration of central coordination as a way of managing P2P live streaming overlays. The main point is to show the elements needed to construct a system with that approach. A key element in the feasibility of this approach is a near real-time optimization engine for peer selection. Peer organization in a way that enables high bandwidth utilization plus optimized peer selection based on multiple utility factors make it possible to achieve large source bandwidth savings and provide high quality of user experience. The benefits of our approach are also seen most when NAT constraints come into play

The Nelson-Seiberg theorem revised

The well-accepted Nelson-Seiberg theorem relates R-symmetries to supersymmetry (SUSY) breaking vacua, and provides a guideline for SUSY model building which is the most promising physics beyond the Standard Model. In the case of Wess-Zumino models with perturbative superpotentials, we revise the theorem to a combined necessary and sufficient condition for SUSY breaking which can be easily checked before solving the vacuum. The revised theorem provides a powerful tool to construct either SUSY breaking or SUSY vacua, and offers many practicable applications in low energy SUSY model building and string phenomenology.Comment: 5 pages; v2: abstract and introduction revised; v3: condition of perturbative superpotentials added, JHEP published versio

ILR Impact Brief - Knowledge, Skills, and Performance: Getting the Most From Team Training

Teams are an integral feature of the American workplace; indeed, more than 80% of the Fortune 500 companies make extensive use of work teams. Action teams, pulled together to carry out a particular time-limited function that requires the specialized expertise of its members, are becoming increasingly common. Researchers have noted that the success of these teams is often thwarted by their lack of information about teamwork in general and their insufficient mastery of basic team competencies. Most organizations train team members for the particular job at hand, so the question arises as to the utility of generic team training. In other words, would imparting knowledge and skills that could be applied in, and adapted to, any number of situations improve outcomes, and if so, what is the mechanism that facilitates this result

An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design

We investigate the 3-architecture Connected Facility Location Problem arising in the design of urban telecommunication access networks. We propose an original optimization model for the problem that includes additional variables and constraints to take into account wireless signal coverage. Since the problem can prove challenging even for modern state-of-the art optimization solvers, we propose to solve it by an original primal heuristic which combines a probabilistic fixing procedure, guided by peculiar Linear Programming relaxations, with an exact MIP heuristic, based on a very large neighborhood search. Computational experiments on a set of realistic instances show that our heuristic can find solutions associated with much lower optimality gaps than a state-of-the-art solver.Comment: This is the authors' final version of the paper published in: Squillero G., Burelli P. (eds), EvoApplications 2016: Applications of Evolutionary Computation, LNCS 9597, pp. 283-298, 2016. DOI: 10.1007/978-3-319-31204-0_19. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-31204-0_1

Low-rank semidefinite programming for the MAX2SAT problem

This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming approaches. Semidefinite programming techniques are well-known as a theoretical tool for approximating maximum satisfiability problems, but their application has traditionally been very limited by their speed and randomized nature. Our approach overcomes this difficult by using a recent approach to low-rank semidefinite programming, specialized to work in an incremental fashion suitable for use in an exact search algorithm. The method can be used both within complete or incomplete solver, and we demonstrate on a variety of problems from recent competitions. Our experiments show that the approach is faster (sometimes by orders of magnitude) than existing state-of-the-art complete and incomplete solvers, representing a substantial advance in search methods specialized for MAX2SAT problems.Comment: Accepted at AAAI'19. The code can be found at https://github.com/locuslab/mixsa