期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
On Perceptibility and Recognizability of Traditional Settlements' Landscape Genes in Chinese Minority Areas: A Case Study in Yutou Dong Minority Village of Tongdao 认领 引用 被引量:2
1
作者 YANG Liguo 《Journal of Landscape Research》 2015年第3期34-39,42,共6页
Taking Yutou Dong Minority Village in Tongdao County for example, this study carried out questionnaire survey and interview survey from the perspective of environment element perceptibility and culture psychology reco... Taking Yutou Dong Minority Village in Tongdao County for example, this study carried out questionnaire survey and interview survey from the perspective of environment element perceptibility and culture psychology recognizability, on the basis of identifying 9 landscape genes, namely drum tower, wind-rain bridge, the village gate, Sa altar, overall layout, totem signs, and environmental factors. The survey results showed that 1 Sa altar has the highest perceptibility, and drum tower has the lowest perceptibility; 2 Sa altar and drum tower have the highest recognizability, overall layout, totem signs and environment have the lowest; 3 Location has the highest perceptibility and size has the poorest; 4 Sentiment has the highest perceptibility, function the lowest; 5 Men have higher perception and sense of recognition than women; 6 Education background has greater impact on perception, but no obvious impact on sense of recognition; 7 Length of residence in the village has positive effect on perception and sense of recognition; 8 Distance from the village has positive effect on perception and sense of recognition. 展开更多
关键词 Traditional settlement Landscape genes Perceptibility and recognizability
暂未订购 下载PDF
Characterization of L_2(16) by τ_e(L_2(16)) 认领 引用
2
作者 Qingliang ZHANG Wu.iie SHI 《Journal of Mathematical Research with Applications》 CSCD 2012年第2期248-252,共5页
Let G be a group and r(G) the set of element orders of G. Let k E 7(G) and mk be the number of elements of order k in G. Let (G) = {mk]k C Try(G)}. In this paper, we prove that L2(16) is recognizable by T^... Let G be a group and r(G) the set of element orders of G. Let k E 7(G) and mk be the number of elements of order k in G. Let (G) = {mk]k C Try(G)}. In this paper, we prove that L2(16) is recognizable by T^(L2(16)). In other words, we prove that if G is a group such that ^-^(G) =(L2(16)) = {1,255,272,544, 1088, 1920}, then G is isomorphic to L2(16). 展开更多
关键词 element orders recognizable number of elements same order Thompson problem.
暂未订购 下载PDF
Recognition by spectrum of the groups 2~D2m+1(3) 认领 引用 被引量:1
3
作者 KONDRAT’EV A. S. 《Science China Mathematics》 2009年第2期293-300,共8页
It is proved that a finite group with the same set of element orders as the simple group 2~D2m+1(3) is isomorphic to 2~D2m+1(3).
关键词 finite group finite simple group spectrum prime graph recognizability by spectrum
暂未订购 下载PDF
Recognizing by Spectrum for the Automorphism Groups of Sporadic Simple Groups 认领 引用 被引量:1
4
作者 V.D.Mazurov A.R.Moghaddamfar 《Communications in Mathematics and Statistics》 2015年第4期491-496,共6页
The spectrum of a finite group is the set of its element orders,and two groups are said to be isospectral if they have the same spectra.A finite group G is said to be recognizable by spectrum,if every finite group iso... The spectrum of a finite group is the set of its element orders,and two groups are said to be isospectral if they have the same spectra.A finite group G is said to be recognizable by spectrum,if every finite group isospectral with G is isomorphic to G.We prove that if S is one of the sporadic simple groups McL,M12,M22,He,Suz and O'N,then Aut(S)is recognizable by spectrum.This finishes the proof of the recognizability by spectrum of the automorphism groups of all sporadic simple groups,except J2. 展开更多
关键词 Automorphism groups of sporadic simple groups Prime graph Recognizable by spectrum
Fuzzy Syntactic Congruence and Rational Fuzzy Languages 认领 引用
5
作者 SHU Lan1, PENG Jia-yin21.Dept. of Applied Math., University of Electronic Science and Technology of China, Chengdu 610054, China2.Department of Mathematics, Neijiang Teacher′s College, Sichuan Neijiang 614002, China 《Systems Science and Systems Engineering》 2002年第4期393-396,共4页
In this paper the notion of rational fuzzy language is introduced, and a theorem is obtained: a fuzzy subset of Σ* is recognizable if and only if it′s rational. The result connects the rational fuzzy language wi... In this paper the notion of rational fuzzy language is introduced, and a theorem is obtained: a fuzzy subset of Σ* is recognizable if and only if it′s rational. The result connects the rational fuzzy language with fuzzy finite-state automaton language. 展开更多
关键词 fuzzy finite-state automaton fuzzy rational language recognizable
上一页 1 下一页 到第
在线咨询 使用帮助 返回顶部 意见反馈