In order to let students learn authentically, we provide an opportunity for them to learn naturally and apply knowledge by adding authentic learning experience in classrooms. We wanted to know whether integrating embodied interactions in authentic learning can enhance authentic learning experience, and even improve learning performance. In this research, we proposed a near-authentic environment that students can engage in a designed situation with their body movements. This study analyzed how this learning mechanic could enhance learning motivation or performance. We observed the subjects' perceptions of learning experience through the designed activity and examine whether they were engaging. This research uncovered that their intrinsic motivation was relatively high in this activity and there were some interesting behaviors among students' interactions.

This study developed a question-based learning process embedded on an e-book to help students’ textbook reading. We designed three reading phases: preview, reading, and review according to the reading strategy. In each phase, students were assisted by different questions. To evaluate the effect, we used this e-book in an experiment involving twenty-five students studying on a textbook content of computer science. Our research objectives are to test the effects of the system on academic performance and to evaluate whether the system use affects learner’s motivation and active reading.

We propose a self-stabilizing asynchronous phase synchronization protocol for uniform unidirectional rings. Consider applications with phase bound K, i.e., the phases are phase 0, phase 1, ...; phase K-1, phase 0, phase 1, etc. Under the protocol, when the ring is stabilized, it satisfies the following criterion: No node begins to execute phase (k+1) mod K until all nodes have executed phase k, and after all nodes have executed their phase k, each node eventually executes phase (k+1) mod K. Besides the variable used to denote the phase that a node is working on, each node maintains only one auxiliary variable with b states, where b can be any number greater than or equal to the ring size. Provided that K and b satisfy the limitation: K/spl times/b>n(b-1), the proposed protocol is correct under the parallel model and takes at most 2(K/spl times/b) rounds to stabilize.

Over the year, researchers have proposed the core based tree (CBT) and protocol independent multicast (PIM) protocols to route multicast data on the Internet. Such protocols need to locate the core of a group to have efficient multicast routing. In this paper, we propose a scalable distributed protocol that can be used to move the core to a near-optimal location for a dynamic multicast tree, and allow the core to migrate efficiently when the multicast tree is expanded or shrunk. In our protocol, it does not require knowledge of the complete network topology, and information of overall members is distributed among local agents; the core only maintains information of agents of the group. Also, only the agents participate in core selection. Therefore, the proposed protocol reduces the runtime overhead and message complexity while doing core migration.

This paper proposes a self-stabilizing phase synchronization protocol for uniform rings with an odd size. Nodes in the ring work asynchronously and proceed in a cyclic sequence of K phases, where K is even. The phase values of all the nodes are required to be no more than one apart. A system state which satisfies the requirement is therefore called a legitimate state. The proposed protocol guarantees that no matter with which initial state the system may start, the ring stabilizes eventually at a state after which the closure property on the legitimate state holds. Phase values should never go backward. The closure property on the legitimate states commonly used in previous works on self-stabilization cannot capture this requirement. This paper defines two terms, legitimate step and illegitimate step, to address this issue. An execution step that brings the ring from a legitimate state to another legitimate state in a way that the phase values of the nodes only advance is called a legitimate step. An execution step that observes the closure property on the legitimate states but makes some phase values go backward is modeled as an illegitimate step. It is shown that, for the proposed protocol, only a finite number of illegitimate steps are possible. After all possible illegitimate steps have occurred, the closure property on the legitimate steps holds.

Coterie is a widely accepted concept for solving the mutual exclusion problem. Nondominated coteries are an important class of coteries which have better performance than dominated coteries. The performance of a coterie is usually measured by availability. Higher availability of a coterie exhibits greater ability to tolerate node or communication link failures. In this paper, we demonstrate a way to recognize nondominated coteries using availability. By evaluating the availability of a coterie instead of using a formal proof, the coterie can be recognized as a nondominated coterie or not. Moreover, with regard to wr-coterie, a concept for solving the replica control problem, we also present a similar result for recognizing nondominated wr-coteries. Finally, we apply our results to some well-known coteries and wr-coteries.

We propose a structure named Cohorts to solve the problem of the access control of multiple entries to a critical section. Our solution is formalized as forming quorums in a k-coterie. It is resilient to node failures and/or network partitioning, invokes constant expected message cost and has comparably high availability.

Quorum-based mutual exclusion algorithms are resilient to node and communication line failures. Recently, some mutual exclusion algorithms successfully use logical structures to construct coteries with small quorums sizes. In this paper, we introduce a geometric approach on dealing with the logical structures and present some useful geometric properties for constructing coteries and k-coteries. Based on those geometric properties, a logical structure named three-sided graph is proposed to provide a new scheme for constructing coteries with small quorums: The smallest quorum size is O(/spl radic/N) in a homogeneous system with N nodes and O(1) in a heterogeneous system. In addition, we also extend the three-sided graph to the O-sided graph for constructing k-coteries.

There are several execution models for self-stabilizing systems discussed in the literature. Among them the distributed model is a more realistic one in the sense that it makes the weakest assumption about the execution environment; whereas the serial model is a less realistic one in the sense that it makes the strongest assumption. In this paper we first discuss how to convert a self-stabilizing system operating with the serial model into a system operating with the distributed model, but such a conversion does not guarantee that the converted system is self-stabilizing. Then we propose a transform technique which makes the proof whether or not the converted system is self-stabilizing much easier.>

A k-coterie is a family of sets (called quorums) in which any (k+1) quorums contain at least a pair of quorums intersecting each other. K-coteries can be used to develop distributed k-mutual exclusion algorithms that are resilient to node and/or communication link failures. A k-coterie is said to dominate another k-coterie if and only if every quorum in the latter is a super set of some quorum in the former. Obviously the dominating one has more chance than the dominated one for a quorum to be formed successfully in an error-prone environment. Thus, we should always concentrate on nondominated k-coteries that no k-coterie can dominate. We introduce a theorem for checking the nondomination of k-coteries, define a class of special nondominated k-coteries-strongly nondominated (SND) k-coteries, and propose two operations to generate new SND k-coteries from known SND k-coteries.

The authors extend the concept of coterie into k-coterie for k entries to a critical section. A structure named Cohorts is proposed to construct quorums in a k-coterie. The solution is resilient to node failures and/or network partitioning and has a low communication cost. The Cohorts structure is further improved to increase the availabilities of 1-entry critical sections.>

article Free Access Share on Leader election in uniform rings Author: Shing-Tsaan Huang National Tsing-Hua University, Taiwan National Tsing-Hua University, TaiwanView Profile Authors Info & Claims ACM Transactions on Programming Languages and SystemsVolume 15Issue 301 July 1993pp 563–573https://doi.org/10.1145/169683.174161Published:01 July 1993Publication History 57citation803DownloadsMetricsTotal Citations57Total Downloads803Last 12 Months27Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

The authors present an efficient routing algorithm for realizing any permutation in LIN (linear-permutation-class) on single-stage shuffle-exchange networks with k*k switching elements, where k=p is a prime number. For any positive integer number n there are N=k/sup n/ processors connected by the network. The proposed algorithm can realize LIN in 2n-1 passes; it can be implemented by using Nn processors in O(n) time. It can also be extended to the shuffle-exchange networks with (p/sup t/*p/sup t/) switching elements, where t is a positive integer number. In addition, the routing of any arbitrary permutations on the networks with any integer k>2 is discussed. Further, by using the techniques developed here, the authors present an optimal O(log n) parallel algorithm for solving a set of linear equations with a nonsingular coefficient matrix when the arithmetic is over the finite field GF(p/sup t/).>

Properties of some shuffle/exchange type permutation sets are studied from operational points of view. The permutation sets studied are Omega , Omega /sup -1/, Psi , L, and U; Omega and Omega /sup -1/ are, respectively, the omega and inverse omega permutation sets, Omega identical to ( Omega intersection Omega /sup -1/); and L and U are, respectively, the admissible lower and upper triangular permutation sets. Several intuitive operations are introduced. Based on these operations, important known results relating to these sets are readdressed. The recursive nature of the sets is also discussed.>

An algorithm for detecting deadlocks in distributed systems with CSP-like communication is proposed. Unlike previous work, the proposed algorithm avoids periodically sending deadlock-detecting messages by the processes and requires no local storage for the processes with size predetermined by the number of processes in the system. The algorithm is proven to have the following properties: (0) it never detects false deadlocks; (1) it has only one process in a knot report the deadlock; and (2) it detects every true deadlock in finite time.

An algorithm is presented that defects for termination of distributed computations by an auxiliary controlling agent. The algorithm assigns a weight W, 0>

The k-way bitonic sort algorithm, a generalization of K.E. Batcher's bitonic sort algorithm (1968), is presented. This variation of the algorithm is based on a k-way decomposition instead of a two-way decomposition. It is proven that Batcher's bitonic sequence decomposition theorem still holds with this multiway decomposition. This leads to applications of sorting networks with bitonic sorters of arbitrary or mixed sizes.>

The self-routing technique using control tags on multiple-pass perfect-shuffle networks is generalized. In particular, they show that bit-permute-complement permutations can be realized and unscrambled in (2n-1) passes or less, where n=log/sub 2/N, N being the number of terminals on either side. They also show that most of the frequently used permutations are in the intersection of omega-realizing and inverse-omega-realizing sets and can be realized and unscrambled in n passes.>

In this paper, we present a new model, finite permutation machine (FPM), to describe the permutation networks. A set of theorems are developed to capture the theory of operations for the permutation networks. Using this new framework, an interesting problem is attacked: are 2n − 1 passes of shuffle exchange necessary and sufficient to realize all permutations? where n = log2 N and N is the number of inputs and outputs interconnected by the network. We prove that to realize all permutations, 2n − 1 passes of shuffle exchange are necessary and that 3n − 3 passes are sufficient. This reduces the sufficient number of passes by 2 from the best-known result.