Terminally ill patients and volunteer support: Is it the right intervention?

Comments on the article by K. T. Herbst-Damm and J. A. Kulik (see record 2005-02260-012) entitled Volunteer support, marital status, and the survival times of terminally ill patients. Can a simple and low-cost intervention, such as a visit by a volunteer, extend the life of terminally ill patients? The answer, according to a study by Herbst-Damm and Kulik (2005), is yes. When it comes to quality of life, however, the effects of volunteer visits remain murky. Thus, it is critical that we look beyond effects on longevity and assess how such a program would influence quality of life. Extending the life of terminally ill patients might not always a blessing. Prolonging their life might even cause harm, as it can extend unwanted physical and mental suffering. It may also go against some patients' desire to hasten their death. Despite Herbst-Damm and Kulik's important findings, the current author remains unconvinced as to the merits of implementing volunteer visits as an intervention policy. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

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.     

Regularizing Flows over Lie Groups

In this paper we discuss regularization of images that take their value in matrix Lie groups. We describe an image as a section in a principal bundle which is a fibre bundle where the fiber (the feature space) is a Lie group. Via the scalar product on the Lie algebra, we define a bi-invariant metric on the Lie-group manifold. Thus, the fiber becomes a Riemannian manifold with respect to this metric. The induced metric from the principal bundle to the image manifold is obtained by means of the bi-invariant metric. A functional over the space of sections, i.e., the image manifolds, is defined. The resulting equations of motion generate a flow which evolves the sections in the spatial-Lie-group manifold. We suggest two different approaches to treat this functional and the corresponding PDEs. In the first approach we derive a set of coupled PDEs for the local coordinates of the Lie-group manifold. In the second approach a coordinate-free framework is proposed where the PDE is defined directly with respect to the Lie-group elements. This is a parameterization-free method. The differences between these two methods are discussed. We exemplify this framework on the well-known orientation diffusion problem, namely, the unit-circle S ¹ which is identified with the group of rotations in two dimensions, SO(2). Regularization of the group of rotations in 3D and 4D, SO(3) and SO(4), respectively, is demonstrated as well.

Online dynamic graph drawing

This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided.     

Task Switching After Cerebellar Damage.

The authors of this study investigated task switching following cerebellar damage. The study group consisted of 7 children and adolescents (M age = 13.8 years) who underwent surgical removal of a benign posterior fossa tumor. They were tested at a sufficient interval after surgery (M lag = 6.13 years) for restoration of normal cognitive skills and intelligence. Although all showed normal learning of the task compared with control participants, when rapid behavioral changes were required (short preparation time), they exhibited behavioral rigidity manifested by enhanced switching cost. These results are in line with another study on serial reaction time with the same patients (A. Berger et al., in press). They have important implications for our understanding of the cognitive sequelae of early cerebellar damage as well as the involvement of the cerebellum in task switching. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Analysis of a distributed algorithm for extrema finding in a ring

A new and more detailed analysis of the unidirectional algorithm of Chang and Roberts for distributed extrema finding on a ring is presented. This analysis shows that this simple algorithm, which is known to be average case optimal, compares very favorably with all the other known algorithms as it requires O(n log n) messages with probability tending to one. A bidirectional version of this algorithm is presented and is shown to dominate the unidirectional one in its average message complexity. Finally, both the unidirectional and the bidirectional algorithms are generalized to perform k selection in the ring, i.e., find the k largest labeled processors.     

Academic in-group bias in the top five economics journals

Scientometrics - This paper studies academic in-group bias in the top five economics journals. We examine citation counts for articles published in these journals during the years 2006–2015,...