Proceedings of the 6th International Conference on Computer Science and Application Engineering最新文献

筛选
英文 中文
CVPCG: Centrosymmetric Virtual Point Cloud Generation For 3D Object Detection 中心对称虚拟点云生成用于3D对象检测
Lingmei Ai, Zhuoyu Xie, Xiaoying Zhang
{"title":"CVPCG: Centrosymmetric Virtual Point Cloud Generation For 3D Object Detection","authors":"Lingmei Ai, Zhuoyu Xie, Xiaoying Zhang","doi":"10.1145/3565387.3565449","DOIUrl":"https://doi.org/10.1145/3565387.3565449","url":null,"abstract":"Although point-based 3D object detection methods have made great progress, these methods still have the problem of low precision due to the incomplete information collected by lidar. To solve this problem, this paper proposes a virtual point cloud generation architecture for 3D object detection. Firstly, the point cloud is converted into voxel representation and input to the voxel transformer to extract local and global features, and then the 3D features are converted into 2D features for one-stage low confidence threshold prediction. Secondly, the points inside each prediction box will generate virtual points through the centrosymmetric method, and then the prediction results of the high confidence threshold of the second stage are generated through a series of 3D sparse convolution and 2D backbone network. Finally, various features are fed into the RoI-grid Pool to generate confidence results. Experimental results on KITTI and Waymo Open dataset show that our method is effective, and the precision have significant advantages compared to other methods.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129168630","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
Data Forwarding at Intersections in Vehicular Social Networks 车辆社交网络交叉口的数据转发
Jing Zeng, Zifeng Hao, Xiaolan Tang, Chengan Zhao
{"title":"Data Forwarding at Intersections in Vehicular Social Networks","authors":"Jing Zeng, Zifeng Hao, Xiaolan Tang, Chengan Zhao","doi":"10.1145/3565387.3565435","DOIUrl":"https://doi.org/10.1145/3565387.3565435","url":null,"abstract":"In vehicular social networks, the vehicles in different communities have different data requirements and different mobility models. Traditional researches focus on the forwarder selection in vehicle-to-vehicle communication, and hence the frequent forwarder change affects the overall performance. In vehicular scenarios with roadside units deployed at intersections, how to select an appropriate forwarding direction based on the social features is a key issue. In this paper, the roadside unit gathers the social attributes of vehicles on the roads by a well-designed information collection method, in which the odd-hop nodes and the even-hop nodes take different tasks to reduce resource cost. Furthermore, the direct forwarding contribution ratio is computed according to the social attributes, and together with the connectivity and the empirical direction selection of similar data, the forwarding priority of each candidate direction is calculated. Finally, the forwarding directions are selected and the replicas of data packets are distributed in these directions. Experiments with real road map and three communities show that, compared with traditional schemes, the proposed scheme has a high delivery ratio and a small transmission overhead (the number of V2V and V2I data transmissions) while maintaining an acceptable delay.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127983871","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
Design of Embedded Trust Root Based on Dual-Kernel Architecture 基于双核架构的嵌入式信任根设计
Xiangying Kong, Xinran Kong
{"title":"Design of Embedded Trust Root Based on Dual-Kernel Architecture","authors":"Xiangying Kong, Xinran Kong","doi":"10.1145/3565387.3565413","DOIUrl":"https://doi.org/10.1145/3565387.3565413","url":null,"abstract":"Given the characteristics and design constraints of the embedded system, a software trust root construction method based on dual kernel architecture and composed of bootloader and trusted kernel and a stem branch trust chain transmission model are proposed ,aiming at the requirements of the trusted environment of embedded applications, The Bootloader, solidified in the boot FLASH, embeds the SHA-1 engine, to measure and load the trusted kernel. Meanwhile, the trusted kernel realizes the protection of the Bootloader by prohibiting the user kernel and upper-layer applications from writing access to the FLASH. The interaction between them, as the root of trust, can resist non-physical attacks; the trusted kernel provides password service-related functions for the user kernel; the application system and the user kernel where it is lockated run as a process of the trusted kernel. Finally, based on predicate logic, a formal proof of trusted boot is given, and a prototype system is built to verify the availability of the scheme.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117287190","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
MPSKT: Multi-head ProbSparse Self-Attention for Knowledge Tracing MPSKT:多头ProbSparse Self-Attention for Knowledge Tracing
Lingmei Ai, Xiaoying Zhang, Ximing Hu
{"title":"MPSKT: Multi-head ProbSparse Self-Attention for Knowledge Tracing","authors":"Lingmei Ai, Xiaoying Zhang, Ximing Hu","doi":"10.1145/3565387.3565420","DOIUrl":"https://doi.org/10.1145/3565387.3565420","url":null,"abstract":"Over the past two years, COVID-19 has led to a widespread rise in online education, and knowledge tracing has been used on various educational platforms. However, most existing knowledge tracing models still suffer from long-term dependence. To address this problem, we propose a Multi-head ProbSparse Self-Attention for Knowledge Tracing(MPSKT). Firstly, the temporal convolutional network is used to encode the position information of the input sequence. Then, the Multi-head ProbSparse Self-Attention in the encoder and decoder blocks is used to capture the relationship between the input sequences, and the convolution and pooling layers in the encoder block are used to shorten the length of the input sequence, which greatly reduces the time complexity of the model and better solves the problem of long-term dependence of the model. Finally, experimental results on three public online education datasets demonstrate the effectiveness of our proposed model.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115788635","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
A Separating Embedding Space Based Relation Network with RGB Modality Only for Cloth-Changing Person Re-Identification 基于RGB模态分离嵌入空间的换布人再识别关系网络
Jian Xu, Bo Liu, Yanshan Xiao
{"title":"A Separating Embedding Space Based Relation Network with RGB Modality Only for Cloth-Changing Person Re-Identification","authors":"Jian Xu, Bo Liu, Yanshan Xiao","doi":"10.1145/3565387.3565397","DOIUrl":"https://doi.org/10.1145/3565387.3565397","url":null,"abstract":"The Cloth-changing person re-identification (CC-ReID) is more challenging than person re-identification (Re-ID) since the cloth-relevant features are unreliable. The current CC-ReID methods usually utilize some human parsing techniques such as semantic segmentation to guide the model to learn more cloth-irrelevant feature cues. However, the human parsing models are not necessarily reliable. For this, we propose a Separating Embedding Space based Relation Network (SESRN) for CC-ReID. Firstly, we use pairs of images as input of the model and consider the relation between them in SESRN instead of a single image that the existing CC-ReID models use. Secondly, we propose to separate the common feature embedding space outputted from the common backbone into two embedding subspaces including the cloth-irrelevant feature embedding subspace and cloth-related feature embedding subspace without using any human parsing techniques since we think that they are unreliable and introduce noise into model. Thirdly, we generate the different feature map weights on different subspaces or different comparison pairs on the same subspace, which is a simple and effective feature map visualization and analysis framework in CC-ReID. Finally, the extensive experiments show the effectiveness and robustness of our method.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126848818","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 Group Behavior Modeling of Virtual Tibetan Horse Racing 虚拟藏族赛马群体行为建模研究
Rui Huang, Xiaobo Yang, Haili Zhao, Yimeng Xiao, Yifan Liu
{"title":"Research on Group Behavior Modeling of Virtual Tibetan Horse Racing","authors":"Rui Huang, Xiaobo Yang, Haili Zhao, Yimeng Xiao, Yifan Liu","doi":"10.1145/3565387.3565451","DOIUrl":"https://doi.org/10.1145/3565387.3565451","url":null,"abstract":"Due to the changeable behavior characteristics of biological groups, this paper aims at the problem that traditional animation technology cannot accurately simulate the movement and avoidance behavior of biological groups. Taking Tibetan horse racing in the biogroup as an example, it is essential to propose a virtual simulation method of Tibetan horse racing group based on the improved Boids model. On the basis of the SAC rules, obstacle avoidance rules are introduced, and the characteristic simulation of horse racing can be realized only by following the four movement rules of separation, alignment, cohesion, and obstacle avoidance, and each individual has ability to adjust its position and speed within the group according to its environment. In order to improve the fluency of system operation and optimize the scene model, a WebGL-based virtual roaming interactive system for Tibetan Horse Racing Festival was developed with Unity3D as a platform. Experimental results show that: Compared with traditional animation techniques and social force models, the algorithm can extremely improve the virtual simulation effect of horse racing group behavior, realize the real simulation of horse racing as well as improve the accuracy of biological group virtual simulation, which enhances user's real sense of reality and has practical significance for the spread and protection of Tibetan culture. In addition, it can be used for virtual racecourse, horse racing teaching demonstration, horse racing scene simulation, etc. In general, it has superior application value.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116967449","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
Quadratic Model of Air Quality Prediction 空气质量预测的二次模型
L. Yang, Shasha Liu, Xiaoran Li, Wenwen Xu
{"title":"Quadratic Model of Air Quality Prediction","authors":"L. Yang, Shasha Liu, Xiaoran Li, Wenwen Xu","doi":"10.1145/3565387.3565388","DOIUrl":"https://doi.org/10.1145/3565387.3565388","url":null,"abstract":"It is necessary to predict the air pollutants under the condition of increasing air pollution. In this paper, the quadratic mathematical modeling of air quality prediction is mainly based on the primary forecast data and the measured data, and the daily concentration values of six conventional pollutants in the next three days are predicted. Firstly, based on the KNN regression principle, the optimal k-value quadratic prediction model suitable for A1, A2 and A3 monitoring points is established; Secondly, considering the influence of pollutant concentration between adjacent areas, a collaborative prediction model based on random forest algorithm and BP neural network is established to predict the pollutant concentration of four monitoring points A, A1, A2 and A3. At the same time, considering the different variables in the characteristic set of time and space input, a prediction data is introduced to adjust the parameters of the results of the model, spatiotemporal hybrid prediction model based on regression prediction is established. The final results show that the accuracy of prediction is improved based on the first prediction data and combined with the measured data.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125328651","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 On-orbit Reconfigurable Technology for Space Station Payload System Based on SmartFusion2 基于SmartFusion2的空间站有效载荷系统在轨可重构技术研究
Ting Wang, Yu'e Gao, Ce Li, Jinzhun Wang, Chong Wang
{"title":"Research on On-orbit Reconfigurable Technology for Space Station Payload System Based on SmartFusion2","authors":"Ting Wang, Yu'e Gao, Ce Li, Jinzhun Wang, Chong Wang","doi":"10.1145/3565387.3565446","DOIUrl":"https://doi.org/10.1145/3565387.3565446","url":null,"abstract":"Targeted at the requirements of high reliability and extensibility of space station payload system, an On-orbit Reconfigurable Technology and implementation method based on SmartFusion2 is proposed. Adopting the theory of In Application Programming (IAP), the technical principles and key techniques of reconfigurable SmartFusion2 space station payload system is studied profoundly while the framework of “boot+3 Apps” is employed to update the application by means of ground data injection and to realize code area switch through the cooperation of the application and boot. With comprehensive consideration of the needs of the space-ground communication link, on-orbit operation control and space experiment, the reliability design is conducted from the perspectives of redundancy, verification and enabling protection, forming a common upload function module that can be easily ported to other processor platforms.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121084288","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
The Relative Extrema of Vertex Degree Distances of Dumbbell Graphs 哑铃图顶点度距离的相对极值
Hai-li Guo
{"title":"The Relative Extrema of Vertex Degree Distances of Dumbbell Graphs","authors":"Hai-li Guo","doi":"10.1145/3565387.3565394","DOIUrl":"https://doi.org/10.1145/3565387.3565394","url":null,"abstract":"The dumbbell graph is defined as a graph joining two cycles with the end-vertices of a path. In this paper, the vertex degree distances of the dumbbell graph, and the distribution of the relative extrema of vertex degree distances on the path and on two cycles of the dumbbell graph are studied. Some meaningful results are obtained: (1) on the path, the vertex degree distance is maximized at the end-vertex joining with the cycle of less length and minimized at the vertex nearing the end-vertex joining with the cycle of longer length; (2) on the cycles except end-vertices (of the path), the minimum of the vertex degree distance is taken at the neighbor vertices of end-vertex of the less length cycle; the maximum is taken at the vertex farthest from the end-vertex, but whether the vertex of the maximum is on the long cycle or the short cycle is related not only to the two cycle length, but also to the path length.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126148482","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
Production Scheduling Optimization of Prefabricated Components Based on Improved Artificial Fish Swarm Algorithm 基于改进人工鱼群算法的预制构件生产调度优化
Chunguang Chang, Manqing Wang, Shen Wang
{"title":"Production Scheduling Optimization of Prefabricated Components Based on Improved Artificial Fish Swarm Algorithm","authors":"Chunguang Chang, Manqing Wang, Shen Wang","doi":"10.1145/3565387.3565427","DOIUrl":"https://doi.org/10.1145/3565387.3565427","url":null,"abstract":"In this paper, the production scheduling problem of prefabricated hybrid flow shop is studied. Resource constraints such as limited labor, limited buffer and steam maintenance parallel machine are considered in the actual production process, and an optimization model of production scheduling is established to minimize production cost, storage cost and delay cost. The maximum permutation method is used to arrange the discrete data, and then the artificial fish swarm algorithm is improved by combining the modified adjustment operation and mutation operation of genetic algorithm. Finally, by analyzing the actual production case of a prefabricated component factory, it is verified that the improved artificial fish swarm algorithm has good optimization and convergence.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121413452","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学术官方微信