Search

Past studies on the issue of learning-theory foundations in game-based learning stressed the importance of establishing learning-theory foundation and provided an exploratory examination of established learning theories. However, we found research seldom addressed the development of the use or failure to use learning-theory foundations and categorized these learning theories into relative types and synthesized their development. We investigate this issue from the perspective of learning theories invoked to underpin educational computer game design and use based on the four types of learning theories: behaviourism, cognitivism, humanism and constructivism. Because the investigation needs to examine and analyse the results from a large number of independent previous studies, this study applied the meta-analysis method to present a more comprehensive description and discussion of the influence and implications of the findings. This study shows the distribution of development trends for the use of learning theory as a theoretical foundation, as opposed to those that fail to use learning theory in game-based learning, along with the distribution of types and principles of learning theories that used a learning-theory foundation. These new findings can supplement the results of previous studies with regard to the issue of learning-theory foundations in game-based learning. The contributions of this study for the issue of learning-theory foundations in game-based learning are discussed. [ABSTRACT FROM AUTHOR]

Prior studies show that more than 70 percent of communication paths in a popular unstructured peer-to-peer (P2P) system (i.e., Gnutella) do not exploit the physical network topology, leading to the topology mismatch problem, and thus, lengthen communication between participating peers. While previous efforts in solving overlay topology matching problems do not guarantee the bounds of performance metrics (e.g., the communication delay between any two overlay peers and the broadcasting scope of any participating peer), in this paper, we present a novel topology matching algorithm that has provable performance qualities. In our proposal, each participating node creates and manages a constant number of overlay connections to other peers in a distributed manner. In rigorous performance analysis, we show that 1) the expected overlay communication delay between any two nodes in our P2P network is a constant; 2) in addition, any joining node has the exponential broadcasting scope in expectation; 3) furthermore, a participating node takes a polylogarithmic overhead to exploit the physical network locality and maintain its flooding scope. Together with extensive simulations, we present our proposal that significantly outperforms two recent solutions, i.e., THANCS and mOverlay, in terms of overlay communication latency and/or broadcasting scope. [ABSTRACT FROM AUTHOR]

Multi-channel light-emitting diode (LED) light sources have been developed for various applications in lighting, but especially for spectrum-tunable lighting. However, how to select the optimal combination of LEDs for these light sources is rarely discussed. Unlike the negative-pruning process which operates by removing LEDs from a set of available LEDs based on an unrealizable negative-coefficient criterion alone, the proposed pruning process removes LEDs so as to minimize the synthesis error. This method not only produces the same optimal set of LEDs as those identified by the full-search method but also suggests when using phosphor-converted LEDs is beneficial. It does this by investigating the trade-off between the full width half maximum of the LEDs and the number of LEDs. [ABSTRACT FROM AUTHOR]