Training: A winning detour

When fieldwork takes a detour.

This study explored the experience of occupational therapists who encountered counterproductive events during their fieldwork training. Interviews were conducted to gather information regarding the participant's perception of factors that contributed to a negative fieldwork experience. The results were divided into major categories: (1) the role of the supervisor, (2) poor supervisory character...

A WordNet Detour to FrameNet

Linguistic Construction of a Winning Apology

The study analyzes the apology delivered by the then-democratic Presidential contender in 2007, Senator Barack H. Obama, to the Indian-American community. This apology succeeded in convincing American citizens of Obama’s goodwill and clean political standards, which eventually led him to surpass his chief opponent, Senator Hillary R. Clinton and become the President of the United States. The st...

On edge detour graphs

For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. A set S ⊆ V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn1(G) of G is the minimum order of its edge detour sets and any edge detour set of order dn1...

Nontraceable detour graphs

The detour order (of a vertex v) of a graph G is the order of a longest path (beginning at v). The detour sequence of G is a sequence consisting of the detour orders of its vertices. A graph is called a detour graph if its detour sequence is constant. The detour deficiency of a graph G is the difference between the order of G and its detour order. Homogeneously traceable graphs are therefore de...