Maximizing learning without sacrificing the fun: Stealth assessment,adaptivity and learning supports in educational games

In this study, we investigated the validity of a stealth assessment of physics understanding in an educational game, as well as the effectiveness of different game-level delivery methods and various in-game supports on learning. Using a game called Physics Playground, we randomly assigned 263 ninth- to eleventh-grade students into four groups: adaptive, linear, free choice and no-treatment control. Each condition had access to the same in-game learning supports during gameplay. Results showed that: (a) the stealth assessment estimates of physics understanding were valid—significantly correlating with the external physics test scores; (b) there was no significant effect of game-level delivery method on students' learning; and (c) physics animations were the most effective (among eight supports tested) in predicting both learning outcome and in-game performance (e.g. number of game levels solved). We included student enjoyment, gender and ethnicity in our analyses as moderators to further investigate the research questions.     

网络法律浅析

随着当今网络技术的迅猛发展,人们的行为和生活越来越受到其影响,发生着改变,故调整其行为规范的网络相关法律法规也越来越受到人们的关注。从法理学角度出发对网络法律进行构建与研究,在此基础上规范其基本理念和适用原则,对于建立完善网络法律体系尤为重要。本文从法理学角度出发,对网络法律的基本理念和原则进行了简要探析。     

A dynamic Houjin (square) and a symmetric Houjin

A Houjin is an n by n square lattice with each cell containing a symbol (such as a number or a letter). Further, these numbers or letters are designed to exhibit symmetry. For example, a magic square is a Houjin where the embedded symmetry is that the numbers in each row, column, and a center diagonal have an equal sum. This article reports a new Houjin: a dynamic Houjin. A dynamic Houjin changes its numbers at each time step while satisfying the symmetry as a Houjin (a magic square). The dynamic Houjin has a further symmetry in a time dimension, i.e., the sums of the numbers in each cell are identical.     

3-D face recognition method based on optimum 3-D image measurement technology

Most face recognition systems employ 2-D color or gray-scale images. However, face recognition based on 2-D images is adversely affected by 3-D movement, variable lighting, and the use of cosmetics. 3-D image measurement technology has the potential to overcome these limitations of face recognition based on 2-D images since it can perform geometric analysis. We propose a method that is capable of recognizing a person from a 3-D facial image obtained using a 3-D shape measurement system by employing a technique that optimizes the intensity-modulation pattern projection. This face recognition method is based on the iterative closest point algorithm. It is robust to changes in reflectivity and color. Since the 3-D facial information can be registered, this method can estimate rotations and translations to compensate for different positions or directions. In order to prove the validity of the proposed technique, a verification experiment was conducted which used 105 sample 3-D images obtained from 15 subjects. It achieved a detection rate of 96% when heads were turned at an angle of 20° or less relative to the camera.     

用数值模拟方法研究水驱特征曲线的结果

本文用数值模拟方法,按照大庆油田的油层条件,系统研究了水驱特征曲线的一般特征、出现直线段的时间及直线最小适用范围,同时重新评价了小井距试验区的水驱特征曲线,从而为在本油田正确使用水驱特征曲线提供了依据。文中用中期采油量倍增法估算的可采储量也可为开发决策提供参考数据。     

Synthesis of 2-amino-6-(2-formyl-5-hydroxymethyl-1-pyrrolyl-)hexanoic acid

Summary The title compound has been synthesized by a novel route fromN -trifluoroacetyl lysine methyl ester and 2,9-dimethyldeca-2,8-diene-4,7-dione. Transformation of the pyrrole substituents and easy cleavage of protecting groups yields the compound in samples of high purity.

---

Synthese der 2-Amino-6-(2-formyl-5-hydroxymethyl-l-pyrrolyl)-hexansäure

Zusammenfassung Die Titelverbindung wird auf einem neuen Weg ausN -Trifluoracetyllysinmethylester und 2,9-Dimethyldeca-2,8-dien-4,7-dion synthetisiert. Nach Umwandlung der Pyrrolsubstituenten und Abspaltung der Schutzgruppen unter milden Bedingungen erhält man die Titelverbindung in hoher Reinheit.

     

Prediction of mode I fracture toughness of unidirectional fibre composites with arbitrary crack fibre orientation from its lowest or matrix fracture tougness

Corrigendum

Prediction of mode I fracture toughness of unidirectional fibre composites with arbitrary crack fibre orientation from its lowest or matrix fracture tougnessby P.K. Sarkar and S.K. Maiti     

Average-case analysis of the Modified Harmonic algorithm

In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This analysis is based on the following result. Letf ₁ andf ₂ be two linear combinations of random variables {N _i } _i=1 ^k where theN _i 's have a joint multinomial distribution for eachn= _i=1 ^k ,N _i . LetE(f ₁) O andE(f ₂) 0. Then lim_n E(max(_{f 1},f ₂ ))/n = lim _n max(E(f ₁),E(f ₂))/n. We then consider the special case when the item sizes are uniformly distributed over (0,1]. For specific values of the parameters, the Modified Harmonic algorithm turns out to be better than the other two linear-time on-line algorithms—Next Fit and Harmonic—in both the worst case as well as the average case. We also obtain optimal values for the parameters of the algorithm from the average-case standpoint. For these values of the parameters, the average-case performance ratio is less than 1.19. This compares well with the performance ratios 1.333. and 1.2865. of the Next Fit algorithm and the Harmonic algorithm, respectively.