In recent years, more and more foreigners begin to learn Chinese characters, but they often make typos when using Chinese. The fundamental reason is that they mainly learn Chinese characters from the glyph and pronunc...In recent years, more and more foreigners begin to learn Chinese characters, but they often make typos when using Chinese. The fundamental reason is that they mainly learn Chinese characters from the glyph and pronunciation, but do not master the semantics of Chinese characters. If they can understand the meaning of Chinese characters and form knowledge groups of the characters with relevant meanings, it can effectively improve learning efficiency. We achieve this goal by building a Chinese character semantic knowledge graph (CCSKG). In the process of building the knowledge graph, the semantic computing capacity of HowNet was utilized, and 104,187 associated edges were finally established for 6752 Chinese characters. Thanks to the development of deep learning, OpenHowNet releases the core data of HowNet and provides useful APIs for calculating the similarity between two words based on sememes. Therefore our method combines the advantages of data-driven and knowledge-driven. The proposed method treats Chinese sentences as subgraphs of the CCSKG and uses graph algorithms to correct Chinese typos and achieve good results. The experimental results show that compared with keras-bert and pycorrector + ernie, our method reduces the false acceptance rate by 38.28% and improves the recall rate by 40.91% in the field of learning Chinese as a foreign language. The CCSKG can help to promote Chinese overseas communication and international education.展开更多
The study investigated user experience, display complexity, display type (tables versus graphs), and task difficulty as variables affecting the user’s ability to navigate through complex visual data. A total of 64 pa...The study investigated user experience, display complexity, display type (tables versus graphs), and task difficulty as variables affecting the user’s ability to navigate through complex visual data. A total of 64 participants, 39 undergraduate students (novice users) and 25 graduate students (intermediate-level users) participated in the study. The experimental design was 2 × 2 × 2 × 3 mixed design using two between-subject variables (display complexity, user experience) and two within-subject variables (display format, question difficulty). The results indicated that response time was superior for graphs (relative to tables), especially when the questions were difficult. The intermediate users seemed to adopt more extensive search strategies than novices, as revealed by an analysis of the number of changes they made to the display prior to answering questions. It was concluded that designers of data displays should consider the (a) type of display, (b) difficulty of the task, and (c) expertise level of the user to obtain optimal levels of performance.展开更多
This paper gives an overview of studies on parameters displayed on the Automotive Head Up Display （A-HUD） including calculation and construction of symbology page based on study results. A study has been made on vit...This paper gives an overview of studies on parameters displayed on the Automotive Head Up Display （A-HUD） including calculation and construction of symbology page based on study results. A study has been made on vital parameters required for car drivers and design calculations have been made based on design parameters like field of view, distance from the design eye position, minimum character size viewable from a distance of 1.5m between driver and the projected image, and optical magnification factor. lhe display format suitable for A-HUD applications depends upon the parameters required to be displayed. The aspect ratio chosen is 4：3. This paper also provides method to design the symbology page embedding six vital parameters with their relative positioning and size considering relative position between display device and optical elements which has been considered with a magnification factor of 2.5. The field of view obtained is 6.7° × 4.8°.展开更多
Motivated by Problem 164 proposed by Y. Berkovich and E. Zhmud＇ in their book ＂Characters of Finite Groups＂, we give a characterization of finite groups whose irreducible character codegrees are prime powers. This ...Motivated by Problem 164 proposed by Y. Berkovich and E. Zhmud＇ in their book ＂Characters of Finite Groups＂, we give a characterization of finite groups whose irreducible character codegrees are prime powers. This is based on a new kind of character graphs of finite groups associated with codegrees. Such graphs have close and obvious connections with character codegree graphs. For example, they have the same number of connected components. By analogy with the work of finite groups whose character graphs （associated with degrees） have no triangles, we conduct a result of classifying finite groups whose character graphs associated with codegrees have no triangles in the latter part of this paper.展开更多
In this paper, we construct a new class of finite groups whose common divisor graphs are complete graphs, while there is no prime dividing all the nontrivial degrees.
In this article, we prove that a finite solvable group with character degree graph containing at least four vertices has Fitting height at most 4 if each derived subgraph of four vertices has total degree not more tha...In this article, we prove that a finite solvable group with character degree graph containing at least four vertices has Fitting height at most 4 if each derived subgraph of four vertices has total degree not more than 8. We also prove that if the vertex set ρ（G） of the character degree graph △（G） of a solvable group G is a disjoint union ρ（G） =π1∪π2, where ｜πi｜≥2 and pi,qi∈πi for i = 1,2, and no vertex in πl is adjacent in △（G） to any vertex in π2 except for p1p2 and q1q2, then the Fitting height of G is at most 4.展开更多
文摘In recent years, more and more foreigners begin to learn Chinese characters, but they often make typos when using Chinese. The fundamental reason is that they mainly learn Chinese characters from the glyph and pronunciation, but do not master the semantics of Chinese characters. If they can understand the meaning of Chinese characters and form knowledge groups of the characters with relevant meanings, it can effectively improve learning efficiency. We achieve this goal by building a Chinese character semantic knowledge graph (CCSKG). In the process of building the knowledge graph, the semantic computing capacity of HowNet was utilized, and 104,187 associated edges were finally established for 6752 Chinese characters. Thanks to the development of deep learning, OpenHowNet releases the core data of HowNet and provides useful APIs for calculating the similarity between two words based on sememes. Therefore our method combines the advantages of data-driven and knowledge-driven. The proposed method treats Chinese sentences as subgraphs of the CCSKG and uses graph algorithms to correct Chinese typos and achieve good results. The experimental results show that compared with keras-bert and pycorrector + ernie, our method reduces the false acceptance rate by 38.28% and improves the recall rate by 40.91% in the field of learning Chinese as a foreign language. The CCSKG can help to promote Chinese overseas communication and international education.
文摘The study investigated user experience, display complexity, display type (tables versus graphs), and task difficulty as variables affecting the user’s ability to navigate through complex visual data. A total of 64 participants, 39 undergraduate students (novice users) and 25 graduate students (intermediate-level users) participated in the study. The experimental design was 2 × 2 × 2 × 3 mixed design using two between-subject variables (display complexity, user experience) and two within-subject variables (display format, question difficulty). The results indicated that response time was superior for graphs (relative to tables), especially when the questions were difficult. The intermediate users seemed to adopt more extensive search strategies than novices, as revealed by an analysis of the number of changes they made to the display prior to answering questions. It was concluded that designers of data displays should consider the (a) type of display, (b) difficulty of the task, and (c) expertise level of the user to obtain optimal levels of performance.
文摘This paper gives an overview of studies on parameters displayed on the Automotive Head Up Display （A-HUD） including calculation and construction of symbology page based on study results. A study has been made on vital parameters required for car drivers and design calculations have been made based on design parameters like field of view, distance from the design eye position, minimum character size viewable from a distance of 1.5m between driver and the projected image, and optical magnification factor. lhe display format suitable for A-HUD applications depends upon the parameters required to be displayed. The aspect ratio chosen is 4：3. This paper also provides method to design the symbology page embedding six vital parameters with their relative positioning and size considering relative position between display device and optical elements which has been considered with a magnification factor of 2.5. The field of view obtained is 6.7° × 4.8°.
文摘Motivated by Problem 164 proposed by Y. Berkovich and E. Zhmud＇ in their book ＂Characters of Finite Groups＂, we give a characterization of finite groups whose irreducible character codegrees are prime powers. This is based on a new kind of character graphs of finite groups associated with codegrees. Such graphs have close and obvious connections with character codegree graphs. For example, they have the same number of connected components. By analogy with the work of finite groups whose character graphs （associated with degrees） have no triangles, we conduct a result of classifying finite groups whose character graphs associated with codegrees have no triangles in the latter part of this paper.
基金Supported by Science Foundation of He’nan University of Technology(Grant Nos.2011BS043 and 2010BS048)Tianyuan Fund of Mathematics of China(Grant No.11226046)
文摘In this paper, we construct a new class of finite groups whose common divisor graphs are complete graphs, while there is no prime dividing all the nontrivial degrees.
文摘In this article, we prove that a finite solvable group with character degree graph containing at least four vertices has Fitting height at most 4 if each derived subgraph of four vertices has total degree not more than 8. We also prove that if the vertex set ρ（G） of the character degree graph △（G） of a solvable group G is a disjoint union ρ（G） =π1∪π2, where ｜πi｜≥2 and pi,qi∈πi for i = 1,2, and no vertex in πl is adjacent in △（G） to any vertex in π2 except for p1p2 and q1q2, then the Fitting height of G is at most 4.
