检索结果-南通市图书馆

How Do the Participant Relations Affect adjacency Pairs?

在线全文

学校读者我要写书评

暂无评论

海外英语 2010年第12X期 2-4页

作者：张宝国南通大学外语学院

This paper will briefly discuss the issue of how different participant relations affect adjacency pairs in conversation analysis.In terms of the affects or influence on adjacency pairs,this article only places its focus on the ways how the first pair part (FPP) and second pair part (SPP) in conversation are relevant to each other.As for the final result,the data back up such conclusions:in conversation between acquaintance /friends,family members,and as such,the relevance are built up either directly or indirectly.However,in conversation between strangers,this relevance seems to be constructed only directly.

关键词： participant relation adjacency pairs relevance direct or indirect

Teaching Fillers,Discourse Markers and adjacency Pairs to College Students

在线全文

学校读者我要写书评

暂无评论

海外英语 2015年第17期 216-219页

作者：王蓓河海大学常州校区英国利物浦大学TESOL

Speaking has long been underestimated in College English education,compared with reading,writing and listening.Even In universities where spoken courses are provided,verbal filler and discourse markers which vastly exist in native speaker'scorpora are rarely found in these prescribed spoken course books.For the teaching of adjacency pairs,which are always one ofthe focuses in teaching conversation skills in College English spoken program,students are required to make up a new one basedon the given scenario after they have memorized model dialogues.Unfortunately,students always experience pragmatic difficultywhen they interact with people in the real world if they are guided by this approach.This article suggests a triangle which is com-posed of exposure,instruction and practice to teach verbal filler,discourse markers and adjacency pairs.This triangle combinesboth direct approach and indirect approach.Furthermore,in spoken program,English teachers can adapt spoken course books tointegrate features of authentic conversations.

关键词： verbal filler discourse markers adjacency pairs di

CK-Modes Clustering Algorithm Based on Node Cohesion in Labeled Property Graph

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2019年第5期34卷 1152-1166页

作者： Da-Wei Wang Wan-Qiu Cui Biao Qin School of Information Renmin University of ChinaBeijing 100872China School of Computer Science Beijing University of Posts and TelecommunicationsBeijing 100876China

The designation of the cluster number K and the initial centroids is essential for K-modes clustering algorithm. However, most of the improved methods based on K-modes specify the K value manually and generate the initial centroids randomly, which makes the clustering algorithm significantly dependent on human-based decisions and unstable on the iteration time. To overcome this limitation, we propose a cohesive K-modes (CK-modes) algorithm to generate the cluster number K and the initial centroids automatically. Explicitly, we construct a labeled property graph based on index-free adjacency to capture both global and local cohesion of the node in the sample of the input datasets. The cohesive node calculated based on the property similarity is exploited to split the graph to a K-node tree that determines the K value, and then the initial centroids are selected from the split subtrees. Since the property graph construction and the cohesion calculation are only performed once, they account for a small amount of execution time of the clustering operation with multiple iterations, but significantly accelerate the clustering convergence. Experimental validation in both real-world and synthetic datasets shows that the CK-modes algorithm outperforms the state-of-the-art algorithms.

关键词： cluster number property graph index-free adjacency K-node tree cohesive node

On the number of matchings of graphs formed by a graph operation

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China Mathematics 2006年第10期49卷 1383-1391页

作者： YEH Yeong-Nan Institute of Mathematics Academia Sinica

Let G be a simple graph. Define R(G) to be the graph obtained from G by adding a new vertex e* corresponding to each edge e = (a, b) of G and by joining each new vertex e* to the end vertices a and b of the edge e corresponding to it. In this paper, we prove that the number of matchings of R(G) is completely determined by the degree sequence of vertices of G.

关键词： matching, Hosoya index, matching polynomial, oriented incident matrix,skew adjacency matrix.

Real-time emergency route generating algorithm in tunnel

在线全文

学校读者我要写书评

暂无评论

中国有色金属学会会刊：英文版 2011年第S3期21卷 637-641页

作者： FANG Yuan-min1, CHEN Jie1, AI Chun-long2, ZHANG Chun-liang2, ZHOU Shi-yong2, FU Xia-jiang2, GU De-mao2 1. Faculty of Land Resource Engineering, Kunming University of Science and Technology, Kunming 650093, China 2. Dahongshan Copper Ore Mine of Yuxi Mining Co. Ltd., Xinping 653405, China Faculty of Land Resource Engineering Kunming University of Science and Technology Kunming 650093 China Dahongshan Copper Ore Mine of Yuxi Mining Co. Ltd. Xinping 653405 China

As part of the digital mine system, a real time emergency route generating algorithm for a large scale metal mine is studied. The tunnel is abstracted and mathematically described by the center line model. A series of definitions are made and the center lines are regularized. In order to improve the quality of the final routes, a center line dataset preprocessing is done according to the factors including the slope threshold and the tunnel closed state information, etc. While in preprocessing, the mineshaft and shaft with the steep slope are excluded implicitly. The interface is preserved for point-like objects (e.g. blowers), directions (e.g. wind direction of blowers) and so on. The final path finding algorithm is optimized by the filter operation that the calculation is only performed at the endpoints and hub points, which can further reduce computing data amount. In our experiment, 3 368 nodes out of 22 401 nodes are selected as key nodes, therefore, the data processing amount of the algorithm is reduced to 1/7 and the routes can be found in real time. The algorithm is implemented and integrated into the final digital mine system.

关键词： digital mine tunnel path finding problem DIJKSTRA algorithm adjacency list

Bijections Preserving Invertibility of Differences of Matrices on H_n

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2008年第10期24卷 1651-1654页

作者： Damjan KOBAL Faculty of Mathematics and Physics University of Ljubljana Jadranska 19 1000 Ljubljana Slovenia

We characterise bijections on the space of hermitian matrices preserving the invertibility of differences of matrix pairs in both directions.

关键词： hermitian invertibility preserver adjacency full rank

Diameter Preserving Surjection on Alternate Matrices

在线全文

学校读者我要写书评

暂无评论

Acta Mathematica Sinica,English Series 2009年第9期25卷 1517-1528页

作者： Li Ping HUANG School of Mathematics and Computing Science Changsha University of Science and Technology Changsha 410076 China

Let F be a field with ｜F｜ ≥ 3, Km be the set of all m × m （m ≥ 4） alternate matrices over F. The arithmetic distance of A, B ∈ Km is d（A, B）：= rank（A - B）. If d（A, B） = 2, then A and B are said to be a... 详细信息

Let F be a field with ｜F｜ ≥ 3, Km be the set of all m × m （m ≥ 4） alternate matrices over F. The arithmetic distance of A, B ∈ Km is d（A, B）：= rank（A - B）. If d（A, B） = 2, then A and B are said to be adjacent. The diameter of Km is max{d（A, B）： A, B ∈ km}. Assume that φ ： Km→Km is a map. We prove the following are equivalent：（a） φ is a diameter preserving surjection in both directions, （b） φ is both an adjacency preserving surjection and a diameter preserving map, （c） φ is a bijective map which preserves the arithmetic distance.

关键词： geometry of matrices alternate matrix arithmetic distance adjacency diameter

Upper bounds for signless Laplacian Z-spectral radius of uniform hypergraphs

在线全文

学校读者我要写书评

暂无评论

Frontiers of Mathematics in China 2019年第1期14卷 17-24页

作者： Jun HE Yanmin LIU Junkang TIAN Xianghu LIU School of Mathematics Zunyi Normal College Zunyi 563006 China

Let ■ be a k-uniform hypergraph on n vertices with degree sequence △= d1≥…≥ dn =δ. In this paper, in terms of degree di , we give some upper bounds for the Z-spectral radius of the signless Laplacian tensor (Q(... 详细信息

关键词： Hypergraph adjacency tensor signless Laplacian tensor spectral radius

Algorithm for constructing an optimally connected rectangular floor plan

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Frontiers of Architectural Research 2014年第3期3卷 324-330页

作者： Krishnendra Shekhawat Department of Mathematics University of Geneva Geneva 1211 Switzerland

In most apptications, such as urbanism and architecture, randomty utitizing given spaces is certainty not favorable. This study proposes an expticit algorithm for utitizing the given spaces inside a rectangte with satisfactory resutts. In the titerature, connectivity is not considered as a criterion for floor plan design, but it is deemed essentiat in architecture. For example, dinin8 rooms are preferabty connected to kitchens, toitets shoutd be connected to many rooms, and each bedroom should be separated from the other rooms. This paper describes adjacency among spaces and proves that the obtained rectangular floor plan is one of the best ones in terms of connectivity. An architectural and mathematicat object catted extra spaces is introduced by the proposed algorithm and is subseauenttv examined in this work.

关键词： Floor plan Extra space Algorithm adjacency