Discourse analysis involves many aspects, such as adjacency pairs, coherence, cohesion, and so on, among which context plays an important role. This paper intends to explore the role of context in discourse analysis on the basis of introducing different definitions and classifications of context.

Penelitian yang berjudul A Study of Adjacency Pairs in The Late Show with James Corden, Case An Afternoon Prince Harry and Corden Episode ini menyelidiki tindakan sosial tertentu ditunjukkan dari ujaran dan preferensi berpasangan. mencoba menemukan jenis pasangan ketetanggaan termasuk dalam percakapan antara Pangeran Harry, merupakan dominan, terungkap Harry. Data dianalisis menggunakan teori H...

Let Γ = (G,σ) be a signed graph, where σ is the sign function on edges of G. In this paper, we use operation partial transpose to obtain non-isomorphic Laplacian cospectral graphs. We will introduce two new operations These establish relationship between adjacency spectrum one graph with another graph. As an application, these utilized construct several pairs Finally, integral

An important problem in color-based image retrieval and video segmentation is to lack information about how color is spatially distributed. To solve this problem and enhance the performance of image and video analyses, a spatial color descriptor is proposed involving a color adjacency histogram and color vector angle histogram. The color adjacency histogram represents the spatial distribution o...

In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...

Let G be a graph of order n, A(G) its adjacency matrix and D(G) the diagonal degrees G. In 2017, for every α in [0, 1], Nikiforov defined Aα(G) = αD(G) + (1 − α)A(G). this paper, we investigate Aα-spectrum graphs obtained from duplicate corona operations. As an application our results, provide conditions construction some pairs non isomorphic Aα-cospectral graphs.

Let G be a graph with minimum degree δ. It is well-known that maximal adjacency orderings (MAOs) compute a vertex set S such that every pair of S is connected by at least δ internally vertex-disjoint paths in G. We present an algorithm that, given any pair of S, computes these δ paths in linear time O(n+m). This improves the previously best solutions for these special vertex pairs, which were f...

In the course of research, data on Horizon 2020 project participants with “drones” SciVoc identifiers (N = 2245) were downloaded from a database compiled Scopus tables 2245). An algorithm was then used to plot vectors participants’ contact pairs, which transformed into graph and an adjacency matrix. From intermediate, optimised graph, network connections plotted. Network metrics computed, clust...