نتایج جستجو برای: adjacency pairs
تعداد نتایج: 111910 فیلتر نتایج به سال:
the present study, on the one hand, attempted to investigate the strategies applied in dispreferred responses by iranian university students of english and the extent to which pragmatic transfer could occur. on the other hand, the study aimed to probe into the association between dispreferred organization and turn-shape. to this end, 31 relevant naturally occurring conversations, totaling 120 ...
Conversation is a vital tool in communication for communicating meaningful pieces of interactions. Adjacency pairs are often seen as fundamental units conversational organization. The form and purpose specific pair component, well the context beside stage conversation, all play essential roles determining meaning function an utterance. Each has special intended meaning, which cannot be fully un...
In this paper, we define duplication corona, duplication neighborhood corona and duplication edge corona of two graphs. We compute their adjacency spectrum, Laplacian spectrum and signless Laplacian. As an application, our results enable us to construct infinitely many pairs of cospectral graphs and also integral graphs.
The articles [8], [11], [10], [5], [1], [7], [12], [4], [3], [2], [9], and [6] provide the notation and terminology for this paper. In this paper i, j, k, k1, k2, n, m, i1, i2, j1, j2 are natural numbers. Let us consider i1, i2. We say that i1 and i2 are adjacent if and only if: (Def. 1) i2 = i1 + 1 or i1 = i2 + 1. One can prove the following propositions: (1) For all i1, i2 such that i1 and i2...
We describe a statistical approach for modeling agreements and disagreements in conversational interaction. Our approach first identifies adjacency pairs using maximum entropy ranking based on a set of lexical, durational, and structural features that look both forward and backward in the discourse. We then classify utterances as agreement or disagreement using these adjacency pairs and feature...
This study tries to investigate one type of synchronous online communication, which is Internet Relay Chat, in terms conversational analysis, particularly turn-taking and adjacency pairs. Synchronous communication can be viewed as a novel medium that combines spoken, written electronic properties. There may direct causal link between the lack coherence its propensity for language play leads ana...
We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zero-block, in analogy with the result of Callan for ordinary partitions.
New criteria for which Cayley graphs of cyclic groups of any order can be completely determined–up to isomorphism–by the eigenvalues of their adjacency matrices is presented. Secondly, a new construction for pairs of nonisomorphic Cayley graphs of cyclic groups with the same list of eigenvalues of their adjacency matrices will be presented.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید