首页 > 最新文献

2020 IEEE 6th International Conference on Computer and Communications (ICCC)最新文献

英文 中文
A Fast Neighbor Discovery Algorithm Based on Q-learning in Wireless Ad Hoc Networks with Directional Antennas 一种基于q学习的定向天线无线自组网快速邻居发现算法
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9345296
Yuhua Wang, Laixian Peng, Renhui Xu, Yaoqi Yang, Lin Ge
Battlefield information interaction has high requirements for its effectiveness, but traditional algorithms are still inadequate in this respect. In this paper, the neighbor discovery process in wireless Ad hoc networks with directional antennas is discussed and an efficient neighbor discovery algorithm based on Q-learning theory is proposed. This paper takes traditional blind algorithm of all sectors scanning as the basis, then a fast neighbor discovery algorithm with the use of Q-learning is analyzed, which divides the neighbor discovery process into three stages, the initial stage without prior location information, the reinforcement learning stage, and the completion stage for mutual discovery in the shortest time. Finally, OPNET Modeler 14.5 is used to simulate this model, and the result show that the algorithm can improve the efficiency of neighbor discovery by nearly 86%.
战场信息交互对其有效性有很高的要求,但传统算法在这方面还存在不足。本文讨论了定向天线无线自组织网络中的邻居发现过程,提出了一种基于q -学习理论的高效邻居发现算法。本文以传统的全扇区扫描盲算法为基础,分析了一种基于q学习的快速邻居发现算法,该算法将邻居发现过程分为三个阶段,即无先验位置信息的初始阶段、强化学习阶段和最短时间内相互发现的完成阶段。最后,利用OPNET Modeler 14.5对该模型进行仿真,结果表明,该算法可将邻居发现效率提高近86%。
{"title":"A Fast Neighbor Discovery Algorithm Based on Q-learning in Wireless Ad Hoc Networks with Directional Antennas","authors":"Yuhua Wang, Laixian Peng, Renhui Xu, Yaoqi Yang, Lin Ge","doi":"10.1109/ICCC51575.2020.9345296","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345296","url":null,"abstract":"Battlefield information interaction has high requirements for its effectiveness, but traditional algorithms are still inadequate in this respect. In this paper, the neighbor discovery process in wireless Ad hoc networks with directional antennas is discussed and an efficient neighbor discovery algorithm based on Q-learning theory is proposed. This paper takes traditional blind algorithm of all sectors scanning as the basis, then a fast neighbor discovery algorithm with the use of Q-learning is analyzed, which divides the neighbor discovery process into three stages, the initial stage without prior location information, the reinforcement learning stage, and the completion stage for mutual discovery in the shortest time. Finally, OPNET Modeler 14.5 is used to simulate this model, and the result show that the algorithm can improve the efficiency of neighbor discovery by nearly 86%.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121574757","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}
引用次数: 5
Personalized Data Collection Based on Local Differential Privacy in the Mobile Crowdsensing 移动众测中基于局部差分隐私的个性化数据采集
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9345209
Feng Li, Haina Song, Jianfeng Li
Mobile crowdsensing is growing in popularity by collecting environmental information from participants' mobile phones. However, the sensing data may carry sensitive information of participants so as to violate their privacy. Thus, local differential privacy (LDP) is proposed to protect participants' privacy during data collection. But most recent studies only apply LDP to the data collection without considering the participant's personal privacy preservation requirement so as to reduce the data utility when aggregator tries to execute the frequency estimation. In this paper, a new LDP algorithm with the optimal privacy perturbation parameter based on Basic RAPPOR is proposed to improve data utility by minimizing the expected mean square error (EMSE). Then, a personalized data collection scheme based on the new LDP is elaborately presented to realize the fact that every participant can select his/her required privacy level to achieve personalized privacy preservation while guaranteeing higher data utility. Finally, the proposed personalized data collection scheme is simulated and verified on both synthetic and real datasets, which proves the feasibility and effectiveness of the proposed scheme in terms of the MSE.
通过参与者的手机收集环境信息的“移动众测”越来越受欢迎。然而,传感数据可能携带参与者的敏感信息,从而侵犯了参与者的隐私。因此,提出了本地差分隐私(LDP)来保护数据收集过程中参与者的隐私。但最近的研究大多只将LDP应用于数据收集,而没有考虑参与者的个人隐私保护要求,从而降低了聚合器在执行频率估计时的数据效用。本文提出了一种基于基本RAPPOR的具有最优隐私扰动参数的LDP算法,通过最小化期望均方误差(EMSE)来提高数据利用率。然后,详细提出了一种基于新LDP的个性化数据收集方案,实现每个参与者都可以选择自己所需的隐私级别,在保证较高数据效用的同时实现个性化隐私保护。最后,在合成数据集和真实数据集上对所提出的个性化数据采集方案进行了仿真和验证,从MSE角度验证了所提出方案的可行性和有效性。
{"title":"Personalized Data Collection Based on Local Differential Privacy in the Mobile Crowdsensing","authors":"Feng Li, Haina Song, Jianfeng Li","doi":"10.1109/ICCC51575.2020.9345209","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345209","url":null,"abstract":"Mobile crowdsensing is growing in popularity by collecting environmental information from participants' mobile phones. However, the sensing data may carry sensitive information of participants so as to violate their privacy. Thus, local differential privacy (LDP) is proposed to protect participants' privacy during data collection. But most recent studies only apply LDP to the data collection without considering the participant's personal privacy preservation requirement so as to reduce the data utility when aggregator tries to execute the frequency estimation. In this paper, a new LDP algorithm with the optimal privacy perturbation parameter based on Basic RAPPOR is proposed to improve data utility by minimizing the expected mean square error (EMSE). Then, a personalized data collection scheme based on the new LDP is elaborately presented to realize the fact that every participant can select his/her required privacy level to achieve personalized privacy preservation while guaranteeing higher data utility. Finally, the proposed personalized data collection scheme is simulated and verified on both synthetic and real datasets, which proves the feasibility and effectiveness of the proposed scheme in terms of the MSE.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125621746","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
Pilot Allocation Algorithm Based on K-means Clustering in Cell-Free Massive MIMO Systems 无小区大规模MIMO系统中基于k -均值聚类的导频分配算法
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9345177
Yu Hao, Jin Xin, Wang Tao, Song Tao, Lv Yu-xiang, Wu Hao
In this letter, a pilot allocation algorithm based on K-means clustering is proposed for the cell-free massive MIMO systems. Firstly, to avoid the communication between users and “invalid” access points (APs), a user-centered virtual cell division is adopted. Users select AP according to the large-scale factor of the channel to form a specific AP set which serves the specific users. Then, K value is determined by combining multiple features and the initial centroid is selected to cluster users. Finally, based on the results of user clustering, users in the internal cluster are assigned to orthogonal pilots, and users in different clusters are reused pilots, which can avoid pilot contamination (PC) caused by pilot reusing among users from the space perspective. Simulation results show that the proposed algorithm can reduce channel estimation error and enhance system throughput.
本文提出了一种基于k均值聚类的无小区大规模MIMO系统导频分配算法。首先,为了避免用户与“无效”接入点之间的通信,采用了以用户为中心的虚拟小区划分。用户根据信道的规模因素选择AP,形成特定的AP集,为特定的用户服务。然后,结合多个特征确定K值,选择初始质心对用户进行聚类。最后,根据用户聚类的结果,将内部簇内的用户分配到正交导频上,并将不同簇内的用户重用为导频,从空间角度避免了用户之间因导频重用而造成的导频污染(pilot pollution, PC)。仿真结果表明,该算法可以减小信道估计误差,提高系统吞吐量。
{"title":"Pilot Allocation Algorithm Based on K-means Clustering in Cell-Free Massive MIMO Systems","authors":"Yu Hao, Jin Xin, Wang Tao, Song Tao, Lv Yu-xiang, Wu Hao","doi":"10.1109/ICCC51575.2020.9345177","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345177","url":null,"abstract":"In this letter, a pilot allocation algorithm based on K-means clustering is proposed for the cell-free massive MIMO systems. Firstly, to avoid the communication between users and “invalid” access points (APs), a user-centered virtual cell division is adopted. Users select AP according to the large-scale factor of the channel to form a specific AP set which serves the specific users. Then, K value is determined by combining multiple features and the initial centroid is selected to cluster users. Finally, based on the results of user clustering, users in the internal cluster are assigned to orthogonal pilots, and users in different clusters are reused pilots, which can avoid pilot contamination (PC) caused by pilot reusing among users from the space perspective. Simulation results show that the proposed algorithm can reduce channel estimation error and enhance system throughput.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125062668","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}
引用次数: 5
Airborne STAP with Unknown Mutual Coupling for Coprime Sampling Structure 基于未知互耦的机载STAP采样结构
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9344909
Mingxin Liu, L. Zou, Xue-gang Wang
In space-time adaptive processing (STAP) of airborne radar, the mutual coupling among array elements can lead to inaccurate estimation of the clutter covariance matrix (CCM), which makes the radar performance degradation. To solve this problem, a new STAP algorithm based on the coprime structure is developed. The proposed method uses the coprime structure and difference operation to construct the virtual space-time snapshots. Thus, the CCM is computed by utilizing these virtual snapshots obtained by using the low-rank matrix recovery technology. Finally, the virtual weight vector is built. The simulation results verify the effectiveness and superiority of the proposed method. The proposed algorithm can reduce the mutual coupling effect, accurately estimate CCM, and improve degrees of freedom (DOF).
在机载雷达的空时自适应处理(STAP)中,阵元之间的相互耦合会导致杂波协方差矩阵(CCM)估计不准确,从而导致雷达性能下降。为了解决这一问题,提出了一种新的基于协素数结构的STAP算法。该方法利用协素数结构和差分运算构造虚拟时空快照。因此,CCM是通过使用低秩矩阵恢复技术获得的这些虚拟快照来计算的。最后,构建虚拟权向量。仿真结果验证了该方法的有效性和优越性。该算法能有效地降低相互耦合效应,准确估计CCM,提高自由度。
{"title":"Airborne STAP with Unknown Mutual Coupling for Coprime Sampling Structure","authors":"Mingxin Liu, L. Zou, Xue-gang Wang","doi":"10.1109/ICCC51575.2020.9344909","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9344909","url":null,"abstract":"In space-time adaptive processing (STAP) of airborne radar, the mutual coupling among array elements can lead to inaccurate estimation of the clutter covariance matrix (CCM), which makes the radar performance degradation. To solve this problem, a new STAP algorithm based on the coprime structure is developed. The proposed method uses the coprime structure and difference operation to construct the virtual space-time snapshots. Thus, the CCM is computed by utilizing these virtual snapshots obtained by using the low-rank matrix recovery technology. Finally, the virtual weight vector is built. The simulation results verify the effectiveness and superiority of the proposed method. The proposed algorithm can reduce the mutual coupling effect, accurately estimate CCM, and improve degrees of freedom (DOF).","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114009292","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
An Effective Target Address Generation Method for IPv6 Address Scan 一种有效的IPv6地址扫描目标地址生成方法
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9345025
Gang Zheng, Xinzhong Xu, Chao Wang
In recent years, IPv6 and its application are more and more widely deployed. Most network devices support and open IPv6 protocol stack. The security of IPv6 network is also concerned. In the IPv6 network security technology, address scanning is a key and difficult point. This paper presents a TGAs-based IPv6 address scanning method. It takes the known alive IPv6 addresses as input, and then utilizes the information entropy and clustering technology to mine the distribution law of seed addresses. Then, the final optimized target address set can be obtained by expanding from the seed address set according to the distribution law. Experimental results show that it can effectively improve the efficiency of IPv6 address scanning.
近年来,IPv6及其应用得到了越来越广泛的部署。大多数网络设备支持并开放IPv6协议栈。IPv6网络的安全性也受到关注。在IPv6网络安全技术中,地址扫描是一个关键和难点。本文提出了一种基于tgas的IPv6地址扫描方法。该算法以已知的活跃IPv6地址为输入,利用信息熵和聚类技术挖掘种子地址的分布规律。然后,根据分布规律对种子地址集进行扩展,得到最终的优化目标地址集。实验结果表明,该方法可以有效地提高IPv6地址扫描的效率。
{"title":"An Effective Target Address Generation Method for IPv6 Address Scan","authors":"Gang Zheng, Xinzhong Xu, Chao Wang","doi":"10.1109/ICCC51575.2020.9345025","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345025","url":null,"abstract":"In recent years, IPv6 and its application are more and more widely deployed. Most network devices support and open IPv6 protocol stack. The security of IPv6 network is also concerned. In the IPv6 network security technology, address scanning is a key and difficult point. This paper presents a TGAs-based IPv6 address scanning method. It takes the known alive IPv6 addresses as input, and then utilizes the information entropy and clustering technology to mine the distribution law of seed addresses. Then, the final optimized target address set can be obtained by expanding from the seed address set according to the distribution law. Experimental results show that it can effectively improve the efficiency of IPv6 address scanning.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122691947","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}
引用次数: 2
Spectrum Allocation Based on Spider Monkey Optimization Algorithm with Nonlinear Inertia Weight and Sine-Cosine Algorithm 基于非线性惯性权值和正弦余弦算法的蜘蛛猴优化算法的频谱分配
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9345294
Dexin Yin, Damin Zhang
To improve spectrum allocation optimization and optimal convergence accuracy in cognitive radio, a nonlinear spider monkey algorithm based on sine-cosine Algorithm (SCNWSMO) is proposed. In the decision-making stages of global leader and the local leader, the spider monkey individuals are optimized by sine-cosine Algorithm. Moreover, the nonlinear decreasing inertia weight factor is introduced to effectively control the global optimization and local optimization capabilities of the algorithm and improve the convergence speed. Finally, the performance of SCNWSMO is compared with various algorithms total system benefit, and average network benefit. Simulation results show that the SCNWSMO is advantageous over other algorithms with higher network efficiency.
为了提高认知无线电频谱分配优化和最优收敛精度,提出了一种基于正弦余弦算法(SCNWSMO)的非线性蜘蛛猴算法。在全局领导者和局部领导者决策阶段,采用正弦余弦算法对蜘蛛猴个体进行优化。同时,引入非线性减小惯性权重因子,有效地控制了算法的全局寻优和局部寻优能力,提高了算法的收敛速度。最后,将SCNWSMO的性能与各种算法的总系统效益和平均网络效益进行了比较。仿真结果表明,SCNWSMO算法优于其他算法,具有较高的网络效率。
{"title":"Spectrum Allocation Based on Spider Monkey Optimization Algorithm with Nonlinear Inertia Weight and Sine-Cosine Algorithm","authors":"Dexin Yin, Damin Zhang","doi":"10.1109/ICCC51575.2020.9345294","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345294","url":null,"abstract":"To improve spectrum allocation optimization and optimal convergence accuracy in cognitive radio, a nonlinear spider monkey algorithm based on sine-cosine Algorithm (SCNWSMO) is proposed. In the decision-making stages of global leader and the local leader, the spider monkey individuals are optimized by sine-cosine Algorithm. Moreover, the nonlinear decreasing inertia weight factor is introduced to effectively control the global optimization and local optimization capabilities of the algorithm and improve the convergence speed. Finally, the performance of SCNWSMO is compared with various algorithms total system benefit, and average network benefit. Simulation results show that the SCNWSMO is advantageous over other algorithms with higher network efficiency.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131112093","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 General Solution and Practice for Automatically Constructing Domain Knowledge Graph 领域知识图自动构建的一般解决方案与实践
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9344946
Xiaomin Yang, Shuai Zhao, B. Cheng, Xu Wang, Jianchang Ao, Zhenzi Li, Zeyan Cao
A knowledge graph is a semantic network that reveals the relationships between entities. Domain knowledge graphs can assist practitioners in complex analysis applications and decision support, and build industry barriers. A good construction system can help companies construct domain knowledge graphs efficiently and quickly. However, due to the differences in data models and business requirements in different fields, there is no general method for constructing a domain knowledge graph. Moreover, the current construction methods require a lot of manpower investment, which is relatively inefficient. To solve the inefficiency and nonuniversal problems in the process of domain knowledge graph construction, in this paper, we study the automated construction mechanism of Chinese domain knowledge graphs and propose a general automatic construction solution. Experimental results show that our proposed solution is more effective in constructing a domain knowledge graph.
知识图谱是一个揭示实体之间关系的语义网络。领域知识图可以帮助从业者进行复杂的分析应用程序和决策支持,并建立行业壁垒。一个好的构建系统可以帮助企业高效、快速地构建领域知识图谱。然而,由于不同领域的数据模型和业务需求存在差异,构建领域知识图尚无通用的方法。而且,目前的施工方法需要大量的人力投入,效率相对较低。为了解决领域知识图构建过程中存在的低效率和非通用性问题,本文研究了中文领域知识图的自动化构建机制,提出了一种通用的领域知识图自动化构建方案。实验结果表明,该方法在构建领域知识图方面具有较好的效果。
{"title":"A General Solution and Practice for Automatically Constructing Domain Knowledge Graph","authors":"Xiaomin Yang, Shuai Zhao, B. Cheng, Xu Wang, Jianchang Ao, Zhenzi Li, Zeyan Cao","doi":"10.1109/ICCC51575.2020.9344946","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9344946","url":null,"abstract":"A knowledge graph is a semantic network that reveals the relationships between entities. Domain knowledge graphs can assist practitioners in complex analysis applications and decision support, and build industry barriers. A good construction system can help companies construct domain knowledge graphs efficiently and quickly. However, due to the differences in data models and business requirements in different fields, there is no general method for constructing a domain knowledge graph. Moreover, the current construction methods require a lot of manpower investment, which is relatively inefficient. To solve the inefficiency and nonuniversal problems in the process of domain knowledge graph construction, in this paper, we study the automated construction mechanism of Chinese domain knowledge graphs and propose a general automatic construction solution. Experimental results show that our proposed solution is more effective in constructing a domain knowledge graph.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131374957","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 Effect of Various Broker Policy Algorithms in Geo-distributed Datacenters on Response Time and Load Balance Review and analysis 地理分布式数据中心中各种代理策略算法对响应时间和负载平衡的影响
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9345286
Louai Sheikhani, C. Gu
Cloud computing represents a new way to deploy computing technology to give users the ability to access, work on, share, and store information using the Internet. Developments in Cloud computing gain rapid attention of the researcher to maximize the utilization of computing resources such as storage, CPUs, and network bandwidth as service-by-service providers at less cost. The optimization models aims to optimize both resource centric such as utilization, availability, reliability and user centric like response time, budget spent fairness, and since the broker is responsible of route the user request to the most appropriate datacenter in the cloud system, choosing the right broker policy affect directly the optimization of the resources, in this paper we explore various number of existing broker policy and compare them in different scenarios in order to show the advantages and limitations of each one of them due there impact on the response time and the load distribution over the system.
云计算代表了一种部署计算技术的新方法,使用户能够使用Internet访问、处理、共享和存储信息。云计算的发展迅速受到研究人员的关注,以更低的成本最大限度地利用存储、cpu和网络带宽等计算资源。优化模型旨在以资源为中心(如利用率、可用性、可靠性)和以用户为中心(如响应时间、预算花费公平性)进行优化,并且由于代理负责将用户请求路由到云系统中最合适的数据中心,因此选择正确的代理策略直接影响资源的优化。在本文中,我们探讨了各种现有的代理策略,并在不同的场景中对它们进行了比较,以显示每种策略的优点和局限性,因为它们对系统的响应时间和负载分布有影响。
{"title":"The Effect of Various Broker Policy Algorithms in Geo-distributed Datacenters on Response Time and Load Balance Review and analysis","authors":"Louai Sheikhani, C. Gu","doi":"10.1109/ICCC51575.2020.9345286","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345286","url":null,"abstract":"Cloud computing represents a new way to deploy computing technology to give users the ability to access, work on, share, and store information using the Internet. Developments in Cloud computing gain rapid attention of the researcher to maximize the utilization of computing resources such as storage, CPUs, and network bandwidth as service-by-service providers at less cost. The optimization models aims to optimize both resource centric such as utilization, availability, reliability and user centric like response time, budget spent fairness, and since the broker is responsible of route the user request to the most appropriate datacenter in the cloud system, choosing the right broker policy affect directly the optimization of the resources, in this paper we explore various number of existing broker policy and compare them in different scenarios in order to show the advantages and limitations of each one of them due there impact on the response time and the load distribution over the system.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121764791","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
Establishment of Air Quality Forecast Model Based on Deep Learning 基于深度学习的空气质量预测模型的建立
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9345081
R. Guo, Yuanjing Ma, Shuai Wang, Yiming Du, Shihai Wang
According to the existing air quality forecasting model, this paper proposed an air quality forecasting method based on deep learning. By analyzing forecasting data, monitoring data and meteorological data, a new air quality forecasting model in the region is established. The model fully takes into account the time variability and spatial distribution characteristics of air pollutant concentration, and introduces meteorological data as covariates to predict any location in the study area.
在现有空气质量预测模型的基础上,提出了一种基于深度学习的空气质量预测方法。通过对预报资料、监测资料和气象资料的分析,建立了一种新的区域空气质量预报模型。该模型充分考虑了大气污染物浓度的时间变异性和空间分布特征,并引入气象数据作为协变量对研究区域内任意位置进行预测。
{"title":"Establishment of Air Quality Forecast Model Based on Deep Learning","authors":"R. Guo, Yuanjing Ma, Shuai Wang, Yiming Du, Shihai Wang","doi":"10.1109/ICCC51575.2020.9345081","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345081","url":null,"abstract":"According to the existing air quality forecasting model, this paper proposed an air quality forecasting method based on deep learning. By analyzing forecasting data, monitoring data and meteorological data, a new air quality forecasting model in the region is established. The model fully takes into account the time variability and spatial distribution characteristics of air pollutant concentration, and introduces meteorological data as covariates to predict any location in the study area.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127654650","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}
引用次数: 2
2D Angle Estimation Based on Block Spatial Smoothing Interpolation Method 基于分块空间平滑插值方法的二维角度估计
Pub Date : 2020-12-11 DOI: 10.1109/ICCC51575.2020.9345032
Jing Li, L. Zou, Chuanchuan Pang, Xue-gang Wang
For MIMO cascaded sparse planar array radar, the angle resolution and precision are not high enough and the sidelobe is high if use zero-padding. This paper proposed an angle estimation method based on block spatial smoothing interpolation. This method combines spatial smoothing and interpolation. Firstly, segment and smooth the antenna array. By solving the interpolation function to find the relationship of actual and expected flow pattern matrixes, we can realize the interpolation of the received signal and figure out the angle information. According to the simulation result, under a certain SNR, the elevation resolution can be improved for 2–3 times with suitable interpolation antenna number, compared to traditional method. Meanwhile, the main / sidelobe ratio is improved about 11dB. The reduction of the high sidelobe and gatelobe is also good.
对于MIMO级联稀疏平面阵列雷达,如果采用零填充,其角度分辨率和精度不够高,且旁瓣高。提出了一种基于分块空间平滑插值的角度估计方法。该方法将空间平滑和插值相结合。首先,对天线阵进行分段和平滑处理。通过求解插值函数求出实际流型矩阵与期望流型矩阵的关系,实现对接收信号的插值并求出角度信息。仿真结果表明,在一定信噪比下,与传统方法相比,适当的插值天线数可使仰角分辨率提高2-3倍。同时,主副瓣比提高约11dB。对高旁瓣和门瓣的抑制效果也很好。
{"title":"2D Angle Estimation Based on Block Spatial Smoothing Interpolation Method","authors":"Jing Li, L. Zou, Chuanchuan Pang, Xue-gang Wang","doi":"10.1109/ICCC51575.2020.9345032","DOIUrl":"https://doi.org/10.1109/ICCC51575.2020.9345032","url":null,"abstract":"For MIMO cascaded sparse planar array radar, the angle resolution and precision are not high enough and the sidelobe is high if use zero-padding. This paper proposed an angle estimation method based on block spatial smoothing interpolation. This method combines spatial smoothing and interpolation. Firstly, segment and smooth the antenna array. By solving the interpolation function to find the relationship of actual and expected flow pattern matrixes, we can realize the interpolation of the received signal and figure out the angle information. According to the simulation result, under a certain SNR, the elevation resolution can be improved for 2–3 times with suitable interpolation antenna number, compared to traditional method. Meanwhile, the main / sidelobe ratio is improved about 11dB. The reduction of the high sidelobe and gatelobe is also good.","PeriodicalId":386048,"journal":{"name":"2020 IEEE 6th International Conference on Computer and Communications (ICCC)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128147622","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
期刊
2020 IEEE 6th International Conference on Computer and Communications (ICCC)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1