Micro-persistence and difficulty in a game-based learning environment for computational thinking acquisition

Persistence has been identified as a crucial quality of learning. However, it is hard to attain in online game-based environments as the drive to progress in the game may influence the ability to achieve the learning goals. This study aimed to examine the associations between micro-persistence, that is, the tendency to complete an individual task successfully, and task difficulty while acquiring computational thinking (CT). We further explored whether contextual or personal attributes better explain micro-persistence. We analysed data of 111 school students who used the CodeMonkey platform. We took a learning analytics approach for analysing the platform's log files. We found that micro-persistence is associated with task difficulty and that students who demonstrated an aptitude to learn new material are motivated to achieve the best solution. We also found that contextual variables better-explained micro-persistence than personal attributes. Encouraging micro-persistence can improve CT acquisition and the learning processes involved.     

Bit transposition for very large scientific and statistical databases

Conventional access methods cannot be effectively used in large Scientific/Statistical Database (SSDB) applications. A file structure (called bit transposed file (BTF)) is proposed which offers several attractive features that are better suited for the special characteristics that SSDBs exhibit. This file structure is an extreme version of the (attribute) transposed file. The data are stored by vertical bit partitions. The bit patterns of attributes are assigned using one of several data encoding methods. Each of these encoding methods is appropriate for different query types. The bit partitions can also be compressed using a version of the run length encoding scheme. Efficient operators on compressed bit vectors have been developed and form the basis of a query language. Because of the simplicity of the file structure and query language, optimization problems for database design, query evaluation, and common subexpression removal can be formalized and efficient exact solution or near optimal solution can be achieved. In addition to selective power with low overheads for SSDBs, the BTF is also amenable to special parallel hardware. Results from experiments with the file structure suggest that this approach may be a reasonable alternative file structure for large SSDBs.     

用于弹性机织物的双组分丝

今天,人们对休闲活动的热情与日俱增.随之而来的是对用功能性强的高性能织物制作的服装的需求的增长,这种服装使穿着者在肘部、肩部、胯部、股部和膝部(在服装的长度或宽度方向上)都能伸展自如.这种服装耐用、轻便、时尚,穿用者能够移动、赛跑、骑车、跳跃、行走和攀爬.     

Lymphangiomatosis with splenic involvement

Severe splenomegaly and anemia developed in a 5-year-old girl with diffuse lymphangiomatosis of the upper part of the body. Radioisotope scanning and celiac angiography demonstrated lymphangiomatosis of the spleen, a rare but diagnosable condition. Intractable infection in areas of ulcerated skin led to her death from overwhelming sepsis.     

A 3-D fracture mechanics approach to the strength of composite materials

The first ply failure in composite laminates are studied by 3-D fracture mechanic approach. The fracture model is based on a crack embedded in one of the inner layers. Numerical results for the case of “angle ply” laminates are based on a general 3-D finite difference program.Stress intensity factors and fracture energy are evaluated by the $\text{J-}\text{integral}$ 2-D and 3-D methods as well as by the stresses and energy balance. It was found that the $\text{J(2-}\text{D}\text{)}$ method can be applied to 3-D problems while the $\text{J(3-}\text{D}\text{)}$ method is not suitable for the numerical computation.The influence of geometrical properties of the crack and the layers on the various stress intensity factors is presented and discussed. Change in failure mechanism of the weakest ply was proved by experiments to fit with numerical results. It was found that the weakest layer is strengthened by the others, a fact which has been verified experimentally and hasn't been explained by other approaches.     

Problems of Hebrew in a medical journal

In 1994-1996 at the Surgical Department in Trebisov a total of 203 diagnostic and therapeutic operations of the papila of Vater were performed. The rate of successful operations was 91.3% in 1996. The authors emphasise the necessity to introduce endoscopic methods into the common practice of surgical departments. They consider EPS the therapeutic method of choice in choledocholithiasis with very good results.     

Quantitative pulsed CEST-MRI at a clinical 3T MRI system

Objectives

The goal of this study was to quantify CEST related parameters such as chemical exchange rate and fractional concentration of exchanging protons at a clinical 3T scanner. For this purpose, two CEST quantification approaches—the AREX metric (for ‘apparent exchange dependent relaxation’), and the AREX-based Ω-plot method were used. In addition, two different pulsed RF irradiation schemes, using Gaussian-shaped and spin-lock pulses, were compared.

Materials and methods

Numerical simulations as well as MRI measurements in phantoms were performed. For simulations, the Bloch–McConnell equations were solved using a two-pool exchange model. MR experiments were performed on a clinical 3T MRI scanner using a cylindrical phantom filled with creatine solution at different pH values and different concentrations.

Results

The validity of the Ω-plot method and the AREX approach using spin-lock preparation for determination of the quantitative CEST parameters was demonstrated. Especially promising results were achieved for the Ω-plot method when the spin-lock preparation was employed.

Conclusion

Pulsed CEST at 3T could be used to quantify parameters such as exchange rate constants and concentrations of protons exchanging with free water. In the future this technique might be used to estimate the exchange rates and concentrations of biochemical substances in human tissues in vivo.

     

Minimal within-host dengue models highlight the specific roles of the immune response in primary and secondary dengue infections

In recent years, the within-host viral dynamics of dengue infections have been increasingly characterized, and the relationship between aspects of these dynamics and the manifestation of severe disease has been increasingly probed. Despite this progress, there are few mathematical models of within-host dengue dynamics, and the ones that exist focus primarily on the general role of immune cells in the clearance of infected cells, while neglecting other components of the immune response in limiting viraemia. Here, by considering a suite of mathematical within-host dengue models of increasing complexity, we aim to isolate the critical components of the innate and the adaptive immune response that suffice in the reproduction of several well-characterized features of primary and secondary dengue infections. By building up from a simple target cell limited model, we show that only the innate immune response is needed to recover the characteristic features of a primary symptomatic dengue infection, while a higher rate of viral infectivity (indicative of antibody-dependent enhancement) and infected cell clearance by T cells are further needed to recover the characteristic features of a secondary dengue infection. We show that these minimal models can reproduce the increased risk of disease associated with secondary heterologous infections that arises as a result of a cytokine storm, and, further, that they are consistent with virological indicators that predict the onset of severe disease, such as the magnitude of peak viraemia, time to peak viral load, and viral clearance rate. Finally, we show that the effectiveness of these virological indicators to predict the onset of severe disease depends on the contribution of T cells in fuelling the cytokine storm.     

Multiprocessor join scheduling

A practical join processing strategy that allows effective utilization of arbitrary degrees of parallelism in both the I/O subsystem and join processing subsystems is presented. Analytic bounds on the minimum execution time, minimum number of processors, and processor utilization are presented along with bounds on the execution time, given a fixed number of processors. These bounds assume that sufficient buffers are available. An analytic lower bound on buffer requirements as well as a practical heuristic for use in limited buffer environments are also presented. A sampling of corroborative simulation results are included