Proceedings of the 2022 7th International Conference on Intelligent Information Technology最新文献

筛选
英文 中文
Extensive Study on Integer Factorization With Valuated Binary Tree 赋值二叉树整数分解的广泛研究
Jianhui Li, Chaogang Yi, Man-shing Liu, Qiao-Zhi Li, Xuesong Wang, Gongshan Yu
{"title":"Extensive Study on Integer Factorization With Valuated Binary Tree","authors":"Jianhui Li, Chaogang Yi, Man-shing Liu, Qiao-Zhi Li, Xuesong Wang, Gongshan Yu","doi":"10.1145/3524889.3524913","DOIUrl":"https://doi.org/10.1145/3524889.3524913","url":null,"abstract":"The paper makes an extensive study on integer factorization with valuated binary tree with on approach that can easily find a node one of whose ancestors contains computable information to factorize an objective odd integer. It proves that an odd composite integer with a divisor of special form can be factorized in relatively short time. Theoretic analyses for the approach are proved with detail mathematical deductions, algorithm is designed to realize the factorization and numerical experiments are made to factorize some Fermat numbers. Experiments show that the computational efficacy is general faster than what were known in the past. The paper once again demonstrates the significance of applying the valuated binary tree on analyzing the odd integers.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123821157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Oral Cone Beam Computed Tomography Images Segmentation Based On Multi-view Fusion 基于多视图融合的口腔锥束计算机断层图像分割
Yunyao Jin, Qijun Zhao, Jun-ge Cheng
{"title":"Oral Cone Beam Computed Tomography Images Segmentation Based On Multi-view Fusion","authors":"Yunyao Jin, Qijun Zhao, Jun-ge Cheng","doi":"10.1145/3524889.3524899","DOIUrl":"https://doi.org/10.1145/3524889.3524899","url":null,"abstract":"In computer-aided orthodontic treatment, it is necessary to establish a 3D model of the teeth and alveolar bone. Segmenting the teeth and alveolar bone from cone-beam computed tomography (CBCT) images is the primary step of reconstructing the model. However, previous studies mainly focused on the segmentation and reconstruction of teeth, and the research on alveolar bone segmentation is very rare. Different viewpoints of oral CBCT images provide complementary information. This paper proposes a multi-view information fusion method to realize the segmentation of teeth and alveolar bone in oral CBCT images. Firstly, for each of the three axes of the 3D data, an individual 2D deep network is trained to achieve coarse segmentation results. Secondly, in order to make full use of the information obtained from different viewpoints of oral CBCT images, a convolution network is used for multi-view fusion. To better fuse the information of different viewpoints, the channel-spatial attention mechanism is applied. Final segmentation is obtained by stacking 2D slices predictions, and the contextual information is added in a post-processing manner through fusing three-viewpoints results. According to the experimental results, our proposed method achieves significant improvements over the baseline.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129980545","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Personality Trait Identification Based on Hidden semi-Markov Model in Online Social Networks 基于隐半马尔可夫模型的在线社交网络人格特征识别
Bailin Xie, N. Wei
{"title":"Personality Trait Identification Based on Hidden semi-Markov Model in Online Social Networks","authors":"Bailin Xie, N. Wei","doi":"10.1145/3524889.3524898","DOIUrl":"https://doi.org/10.1145/3524889.3524898","url":null,"abstract":"In recent years, online social networks (OSNs) have become great places for people to communicate with each other and share knowledge. However, OSNs have also become the main grounds for exploiting the vulnerabilities of people and launching a variety of fraud. Most of hackers implement fraud based on the target users’ personality traits. It is difficult for users to identify such fraud in OSNs. In order to alert users to the hackers’ fraud strategies, and improve users’ ability to identify fraud, the research on personality trait identification is important. In this paper a new method is presented for identifying user's personality trait based on the personality trait dictionary and hidden semi-Markov models, from the perspective of the behavior process of user's posting/forwarding information in OSNs. The proposed method includes a training phase and an identification phase. In the identification phase, the average log likelihood of every observation sequence is calculated. An experiment based on real datasets of Weibo is conducted to evaluate this method. The experiment results validate the effectiveness of this method.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128741983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal Resource Allocation of Mobile Edge Computing Using Grasshopper Optimization Algorithm 基于Grasshopper优化算法的移动边缘计算资源优化分配
Zhonghua Li, Guannan He
{"title":"Optimal Resource Allocation of Mobile Edge Computing Using Grasshopper Optimization Algorithm","authors":"Zhonghua Li, Guannan He","doi":"10.1145/3524889.3524894","DOIUrl":"https://doi.org/10.1145/3524889.3524894","url":null,"abstract":"In mobile edge computing (MEC), MEC server can enhance mobile devices (MDs) to execute tasks. Due to the limited communication resource of base station and computation resource of MEC server, it is important for resource allocation (RA) problem to consider such factors as the computation resource demands, the data size and the maximum tolerable execution latency of tasks. From a business perspective, high-value tasks need to be performed in a higher priority. This paper proposes an improved grasshopper optimization algorithm (GOA) for the RA problem to maximize the value of executed tasks on the MEC server. The proposed GOA-RA is examined on a series of numerical experiments to evaluate the effects of the channel bandwidth and the clock cycles of the MEC server. Besides, a group of comparison experiments are arranged between GOA-RA, a genetic algorithm (GA) and a discrete particle swarm optimization (PSO) algorithm with different number of MDs. The results demonstrate that the proposed GOA-RA is effective for the RA problem in MEC system.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130451404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
NIAP: A Neighbor Information based Multichannel RFID Reader Anti-collision Protocol NIAP:基于邻居信息的多通道RFID阅读器防碰撞协议
Zijun Su, Chang Wan, Guannan He, Zhonghua Li
{"title":"NIAP: A Neighbor Information based Multichannel RFID Reader Anti-collision Protocol","authors":"Zijun Su, Chang Wan, Guannan He, Zhonghua Li","doi":"10.1145/3524889.3524901","DOIUrl":"https://doi.org/10.1145/3524889.3524901","url":null,"abstract":"Reader collisions may occur when readers interrogate tags simultaneously due to mutual interference in Radio Frequency IDentification (RFID) systems. Many state-of-the-art protocols are devoted to eliminate reader collisions to pursue high throughput. This paper proposes a Neighbor Information based multichannel RFID reader Anti-collision Protocol (NIAP). In terms of competition strategy, the competition priority of a reader is determined by its number of neighbor readers based on the solving maximum independent sets algorithm. With regard to channel switching strategy, a reader which wants to switch to a new channel judges the severity of the reader-to-tag collisions according to the distance from the interrogating neighbor reader. Eligible reader-to-tag collisions are allowed to occur considering the coverage of readers. The simulation results show the proposed NIAP outperforms the other multichannel protocols.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115152297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
330G Broadband High Order Harmonic Frequency Doubler 330G宽带高次谐波倍频器
Xixi Lu, Chuan-Hsing Chen, Yong Fang, Jing Yan
{"title":"330G Broadband High Order Harmonic Frequency Doubler","authors":"Xixi Lu, Chuan-Hsing Chen, Yong Fang, Jing Yan","doi":"10.1145/3524889.3524911","DOIUrl":"https://doi.org/10.1145/3524889.3524911","url":null,"abstract":"In this paper, the R band (220-325GHz) five-fold module is designed using a reverse parallel Schottky varactor diode pair produced by Teratech. The reverse parallel diode pair is used to generate the nonlinear components with harmonic input in V band (50-75GHz).The electromagnetic three-dimensional model of Schottky diode is simulated, the parasitic effect of the diode is considered, and the detailed design method of each part is given. The quintuple multiplier has a maximum output power of -9dBm at 220-330GHz.The designed frequency multiplier experiment test shows that when the input power is 5dBm, the output frequency range is 260-330GHz, the output power is greater than -11dBm, the conversion loss is less than 16.5dB, and the width between the band is up to 23%.Compared with the previous academic results, the proposed drive power is smaller, the harmonic frequency is higher, the frequency band is higher, especially the band width is more than 20 GHz.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133678455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Program Vulnerability Mining System based on Symbolic Execution 基于符号执行的程序漏洞挖掘系统
Bailin Xie, Qi Li, Jiabin Luo
{"title":"Program Vulnerability Mining System based on Symbolic Execution","authors":"Bailin Xie, Qi Li, Jiabin Luo","doi":"10.1145/3524889.3524903","DOIUrl":"https://doi.org/10.1145/3524889.3524903","url":null,"abstract":"In recent years, vulnerability mining is a hot topic. Existing vulnerability mining methods of binary program are mainly based on fuzzy testing. These methods discover vulnerabilities by continuously inputting random data into the target program, in order to trigger the binary program's errors. However, the vulnerability output of these methods mainly depends on the input random data. The coverage rate of program execution path is low in these methods. In order to improve the coverage rate of program execution path and discover more unknown vulnerabilities, this paper presents an automatic vulnerability mining system based on symbolic execution. This system discovers vulnerabilities by performing constraint check on each execution path of the binary program. This system contains five modules, and each module is responsible for mining a type of vulnerabilities. This system has been developed based on the Python's Angr module. An experiment based on test programs is conducted to evaluate this system. The experimental results validate the effectiveness of this system. The experiment results also show that this system can discover most of the binary program's execution paths.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122427379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on Full Coverage Path Planning Algorithm of Mobile Robot Based on Astar Improved Algorithm 基于Astar改进算法的移动机器人全覆盖路径规划算法研究
Haichu Chen, Huannan Zheng
{"title":"Research on Full Coverage Path Planning Algorithm of Mobile Robot Based on Astar Improved Algorithm","authors":"Haichu Chen, Huannan Zheng","doi":"10.1145/3524889.3524893","DOIUrl":"https://doi.org/10.1145/3524889.3524893","url":null,"abstract":"In order to solve the problems that most robots have in full coverage path planning in the working area, including unreasonable moving paths, long exploration time, and disorderly planning routes in obstacle areas. This paper improves the Astar algorithm and studies a full coverage path planning algorithm for mobile robot path planning. This improved algorithm enables the robot to construct a map in a certain closed area, and use the constructed map to scan the closed space, so that the robot has the ability of autonomous path planning and realizes autonomous navigation and motion control. This algorithm is transplanted into a mobile robot control system, and an experimental study is carried out on this algorithm. Experiments show that the algorithm is stable in time and has strong robustness. Comparing the map established by the robot with the actual experimental area, it is found that the algorithm has a high coverage rate and strong practicability. In addition, a remote video transmission function system is integrated on the mobile robot, and experimental tests such as remote video transmission, robot image recognition and automatic tracking have been carried out, and good results have been achieved.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128978273","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Research on fault diagnosis expert system of the electric vehicle drive system 电动汽车驱动系统故障诊断专家系统研究
Qichao Qin, Youpeng Chen, Zhuogeng Qin, Chaoqun Tu
{"title":"Research on fault diagnosis expert system of the electric vehicle drive system","authors":"Qichao Qin, Youpeng Chen, Zhuogeng Qin, Chaoqun Tu","doi":"10.1145/3524889.3524909","DOIUrl":"https://doi.org/10.1145/3524889.3524909","url":null,"abstract":"Diagnosing the fault source of the electric vehicle (EV) drive system quickly and accurately is important to improve the safety and reliability of the EV. In the paper, according to the structure and fault characteristics of the EV drive system, a fault diagnosis method of the EV drive system based on expert system was proposed. The knowledge base of the expert system is established in the form of rules, and the inference engine of the expert system is designed based on the forward inference method of database. Using Visual Studio and SQLServer, a fault diagnosis expert system for EV drive system is established. The results show that the system can give accurate diagnosis results and maintenance strategy, with good versatility and practicability.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"168 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116409010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Research on "one-to-many" Vehicle and Cargo Matching Optimization Problem based on Improved Genetic Algorithm 基于改进遗传算法的一对多车货匹配优化问题研究
Xinyun He, Yuan Zhang, Zhu Le, Yanping Du
{"title":"Research on \"one-to-many\" Vehicle and Cargo Matching Optimization Problem based on Improved Genetic Algorithm","authors":"Xinyun He, Yuan Zhang, Zhu Le, Yanping Du","doi":"10.1145/3524889.3524891","DOIUrl":"https://doi.org/10.1145/3524889.3524891","url":null,"abstract":"The matching relationship between vehicles and cargo affects the merits of the transportation program, so the vehicles and cargo arrangements reasonable matching program is very necessary. Vehicle and cargo matching refers to obtaining the optimal allocation plan through intelligent matching under the condition of known certain vehicle and cargo information, so as to realize the optimization of cost and time single-objective and dual-objective. When solving the problem of vehicle and cargo matching, pay attention to the impact of vehicle and cargo information on the results. Therefore, this article comprehensively considers the effect of different attributes of vehicles and cargo on the matching scheme, and proposes a \"one-to-many\" vehicle and cargo matching model based on the attributes of vehicles and cargo. The difference between this article and the general “one-to-many” vehicle and cargo matching scenario is that it provides feasible cargo matching schemes for multiple types and multiple vehicles at the same time, in order to get the highest overall profit under the condition of meeting the weight limit of each vehicle. An improved Genetic algorithm is used to solve the problem, and the greedy operator is introduced to screen the initial results. The results show that this method can effectively increase the full-load rate of mainline vehicles and rationalize the allocation of vehicle and cargo resources.","PeriodicalId":129277,"journal":{"name":"Proceedings of the 2022 7th International Conference on Intelligent Information Technology","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121453780","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信