Construction of Visual Communication Teaching Mode Based on Improved Mobile Search Algorithm in Internet + Environment

Huihui Wang
{"title":"Construction of Visual Communication Teaching Mode Based on Improved Mobile Search Algorithm in Internet + Environment","authors":"Huihui Wang","doi":"10.1109/ICVRIS.2019.00112","DOIUrl":null,"url":null,"abstract":"When using the traditional algorithm for graph mobile search in the Internet+ environment, the result is not accurate due to the lack of a strict standard. The size and position of the graphic display cannot be effectively determined, and it is difficult to effectively support the graphical mobile search control. Therefore, a new mobile communication learning algorithm in visual communication teaching mode is proposed. The display size of the buffer image in the visual communication teaching mode is calculated by the fixed value method. The minimum value of the search layout and the highest value of the surface utilization are used as the search objective function. The ant colony algorithm is used to solve the problem and the optimal solution is obtained. Get the best display position of the graphics in the visual communication teaching mode. The description of the graphics movement is implemented by a grammatical description according to the rules and a semantic description according to ASM (abstract stale ma­chine). The parallel flow and selection identification are used to describe the parallel flow and selection process of graphic movement in the visual communication teaching mode, and the parallel movement and selection process are used to realize the automatic movement of graphic movement. The program is written and run by C language to achieve the purpose of automatic graph movement. The experimental results show that the user satisfaction of the proposed algorithm is 7.792, which is significantly higher than the traditional algorithm, indicating that the proposed algorithm has better search effect and higher practical value.","PeriodicalId":294342,"journal":{"name":"2019 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Virtual Reality and Intelligent Systems (ICVRIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICVRIS.2019.00112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

When using the traditional algorithm for graph mobile search in the Internet+ environment, the result is not accurate due to the lack of a strict standard. The size and position of the graphic display cannot be effectively determined, and it is difficult to effectively support the graphical mobile search control. Therefore, a new mobile communication learning algorithm in visual communication teaching mode is proposed. The display size of the buffer image in the visual communication teaching mode is calculated by the fixed value method. The minimum value of the search layout and the highest value of the surface utilization are used as the search objective function. The ant colony algorithm is used to solve the problem and the optimal solution is obtained. Get the best display position of the graphics in the visual communication teaching mode. The description of the graphics movement is implemented by a grammatical description according to the rules and a semantic description according to ASM (abstract stale ma­chine). The parallel flow and selection identification are used to describe the parallel flow and selection process of graphic movement in the visual communication teaching mode, and the parallel movement and selection process are used to realize the automatic movement of graphic movement. The program is written and run by C language to achieve the purpose of automatic graph movement. The experimental results show that the user satisfaction of the proposed algorithm is 7.792, which is significantly higher than the traditional algorithm, indicating that the proposed algorithm has better search effect and higher practical value.
互联网+环境下基于改进移动搜索算法的视觉传播教学模式构建
在互联网+环境下,使用传统算法进行图移动搜索时,由于缺乏严格的标准,搜索结果不准确。图形显示的大小和位置无法有效确定,难以有效支持图形移动搜索控件。为此,提出了一种新的视觉传播教学模式下的移动通信学习算法。视觉传达教学模式中缓冲图像的显示尺寸采用定值法计算。以搜索布局的最小值和曲面利用率的最大值作为搜索目标函数。采用蚁群算法求解该问题,得到了最优解。获得图形在视觉传达教学模式中的最佳展示位置。图形运动的描述是根据规则进行语法描述和根据ASM(抽象陈化机器)进行语义描述。在视觉传达教学模式中,采用平行流和选择识别来描述图形运动的平行流和选择过程,并采用平行运动和选择过程来实现图形运动的自动运动。程序采用C语言编写和运行,实现图形自动移动的目的。实验结果表明,所提算法的用户满意度为7.792,显著高于传统算法,表明所提算法具有更好的搜索效果和更高的实用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信