Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.06.050
{"title":"Analysis and Prediction of Student Evaluation Scores Based on Bias SVD","authors":"","doi":"10.18178/wcse.2020.06.050","DOIUrl":"https://doi.org/10.18178/wcse.2020.06.050","url":null,"abstract":"","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127156579","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}
Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.06.037
{"title":"Collaborative Recommendation of Tourist Attractions Based on the Comprehensive Similarity of Users","authors":"","doi":"10.18178/wcse.2020.06.037","DOIUrl":"https://doi.org/10.18178/wcse.2020.06.037","url":null,"abstract":"","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124971859","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}
Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.06.056
Yefei Tian, Yufei Luo, A. Dang
Non-orthogonal multiple access (NOMA) has been proposed to enhance system capacity for visible light communication (VLC) systems. However, the effective power allocation strategy is one of critical problems that needs to be solved in NOMA. In this paper, a new method for multi-user downlink power allocation in VLC NOMA based on reinforcement learning is proposed. This method utilizes distributed multi-agent Q-learning algorithm with low complexity to maximize sum throughput of the multiuser VLC downlink system which is subject to both user fairness and quality of service (QoS). The numerical results show that a large sum logarithmic user rate can be obtained with higher probability compared with other conventional power allocation algorithms.
{"title":"Power Allocation based on Q-Learning for NOMA Visible Light Communication Networks","authors":"Yefei Tian, Yufei Luo, A. Dang","doi":"10.18178/wcse.2020.06.056","DOIUrl":"https://doi.org/10.18178/wcse.2020.06.056","url":null,"abstract":"Non-orthogonal multiple access (NOMA) has been proposed to enhance system capacity for visible light communication (VLC) systems. However, the effective power allocation strategy is one of critical problems that needs to be solved in NOMA. In this paper, a new method for multi-user downlink power allocation in VLC NOMA based on reinforcement learning is proposed. This method utilizes distributed multi-agent Q-learning algorithm with low complexity to maximize sum throughput of the multiuser VLC downlink system which is subject to both user fairness and quality of service (QoS). The numerical results show that a large sum logarithmic user rate can be obtained with higher probability compared with other conventional power allocation algorithms.","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121909332","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}
Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.06.047
{"title":"A Novel Human Parsing Method Enhanced by Cross-Refinement","authors":"","doi":"10.18178/wcse.2020.06.047","DOIUrl":"https://doi.org/10.18178/wcse.2020.06.047","url":null,"abstract":"","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128345797","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}
Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.02.023
Eaint Mon Win, May Aye Khine
Community detection is one of the most important research area wherein invention and growth of social networks. Community is a set of members densely connected within a group and sparely connected with the other groups. In social networks, the singular characteristic of communities is multi membership of a node resulting in overlapping communities. Another relevant feature of social networks is the possibility to evolve over time. In recent years, many researchers have worked on various methods that can efficiently unveil overlapped structure on dynamic network. This paper reviews the previous studies done on the problem of overlapping community detection algorithms. Moreover, some approaches for dynamic network that change from time to time are also described.
{"title":"A Study on Community Overlapping Detection Algorithms in Social Networks","authors":"Eaint Mon Win, May Aye Khine","doi":"10.18178/wcse.2020.02.023","DOIUrl":"https://doi.org/10.18178/wcse.2020.02.023","url":null,"abstract":"Community detection is one of the most important research area wherein invention and growth of social networks. Community is a set of members densely connected within a group and sparely connected with the other groups. In social networks, the singular characteristic of communities is multi membership of a node resulting in overlapping communities. Another relevant feature of social networks is the possibility to evolve over time. In recent years, many researchers have worked on various methods that can efficiently unveil overlapped structure on dynamic network. This paper reviews the previous studies done on the problem of overlapping community detection algorithms. Moreover, some approaches for dynamic network that change from time to time are also described.","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129043991","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}
Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.06.045
{"title":"TriAG:Answering SPARQL Queries Accelerated by GPU","authors":"","doi":"10.18178/wcse.2020.06.045","DOIUrl":"https://doi.org/10.18178/wcse.2020.06.045","url":null,"abstract":"","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123873321","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}
Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.06.034
{"title":"3D Virtual Vision Construction Platform for Airport Design Evaluation Based on Virtual Reality Technique","authors":"","doi":"10.18178/wcse.2020.06.034","DOIUrl":"https://doi.org/10.18178/wcse.2020.06.034","url":null,"abstract":"","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"38 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120919797","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}
Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.06.055
{"title":"Research on Virtual Disassembly and Assembly Training and Assessment System of Engine","authors":"","doi":"10.18178/wcse.2020.06.055","DOIUrl":"https://doi.org/10.18178/wcse.2020.06.055","url":null,"abstract":"","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131354770","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}
Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.06.032
{"title":"SE-UXNet: A Medical Imaging Segmentation Network Based on Attention Mechanism","authors":"","doi":"10.18178/wcse.2020.06.032","DOIUrl":"https://doi.org/10.18178/wcse.2020.06.032","url":null,"abstract":"","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131189872","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}
Pub Date : 1900-01-01DOI: 10.18178/wcse.2020.06.010
{"title":"Flight Delay Prediction Based on Elastic Neural Network","authors":"","doi":"10.18178/wcse.2020.06.010","DOIUrl":"https://doi.org/10.18178/wcse.2020.06.010","url":null,"abstract":"","PeriodicalId":292895,"journal":{"name":"Proceedings of 2020 the 10th International Workshop on Computer Science and Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131696550","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：