Much attention has been given to “bridging the gap” between neuroscience and educational practice. In order to gain better understanding of the nature of this gap and of possibilities to enable the linking process, we have taken a boundary perspective on these two fields and the brain-based learning approach, focusing on boundary spanning actors, boundary objects, and boundary work. In 26 semis...

we aimed to analyze the range of motion (rom) and internal rotation (ir) and external rotation (er) isokinetic strength according to humeral retroversion of the dominant shoulder.we included 40 elite baseball players in korea (obp group: n=20 players with careers spanning >10 years, age: 19.37±2.21 years, height: 181.00±5.41 cm, weight: 84.58±7.85 kg; bbp group: n=20 players with careers spanni...

We introduce block-tree graphs as a framework for deriving efficient algorithms on graphical models. We define block-tree graphs as a tree-structured graph where each node is a cluster of nodes such that the clusters in the graph are disjoint. This differs from junction-trees, where two clusters connected by an edge always have at least one common node. When compared to junction-trees, we show ...

Let Σ = { S1 , . . . , Sn } be a finite set of disjoint line segments in the plane. We conjecture that its visibility graph, Vis(Σ), is hamiltonian. In fact, we make the stronger conjecture that Vis(Σ) has a hamiltonian cycle whose embedded version is a simple polygon (i.e., its boundary edges are non-crossing visibility segments). We call such a simple polygon a spanning polygon of Σ. Existenc...

The source and target reliability in SAT network is de- fined as the flawless transmission from the source node to all the other nodes. In some references, the SAT pro- cess has been followed between all the node pairs but it is very time-consuming in today’s widespread networks and involves many costs. In this article, a method has been proposed to compare the reliability in complex networks b...

A plane graph is a planar graph with a fixed embedding. Let G = (V,E) be an edge weighted connected plane graph, where V and E are the set of vertices and edges, respectively. Let F be the set of faces of G. For each edge e ∈ E, let w(e) ≥ 0 be the weight of the edge e of G. A face-spanning subgraph of G is a connected subgraph H induced by a set of edges S ⊆ E such that the vertex set of H con...

Data Warehouse (DWH) projects bring together different communities of practice to create one body of knowledge and help increase the competitive advantages of companies. In this paper we concentrate on the role of DWH professionals as a spanning community in DWH development projects. We argue that each time DWH professionals engage in a spanning activity towards neighboring communities of pract...