2019 IEEE 5th International Conference on Computer and Communications (ICCC)最新文献

筛选
英文 中文
Comparison of Antenna Parameters for Different Substrate Materials at Terahertz Frequency Region 不同衬底材料在太赫兹频段天线参数的比较
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/ICCC47050.2019.9064424
Syed Abid Sahdman, Kazi Shihabul Islam, Sk Shahabuddin Ahmed, S. Siddiqui, Farzana Shabnam
{"title":"Comparison of Antenna Parameters for Different Substrate Materials at Terahertz Frequency Region","authors":"Syed Abid Sahdman, Kazi Shihabul Islam, Sk Shahabuddin Ahmed, S. Siddiqui, Farzana Shabnam","doi":"10.1109/ICCC47050.2019.9064424","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064424","url":null,"abstract":"Terahertz band communication is considered to be one of the most potential aspects of networks beyond 5G. However, it has been observed that antennas designed for this region still have very high losses. Dielectric substrate plays a key role in determining the antenna parameters like Sparameter, VSWR, 3D radiation pattern, directivity and gain. This paper provides a comprehensive solid background of the previous research works done on microstrip patch antenna in the terahertz region. Furthermore, a design for circular microstrip patch antenna consisting of a copper patch primarily focused on terahertz band communication has also been proposed. Simulation of the proposed antenna is carried out using an electromagnetic field solver software called Computer Simulation Technology (CST). The antenna’s performance based on different types of substrates such as Polyimide, Teflon, Quartz and Silicon Dioxide is analyzed between frequencies ranging between 1.5 to 1.7 terahertz (THz). The minimum return loss achieved for the fore mentioned resonant frequency range is-22.336dB for Teflon and the corresponding gain is 4.71 dB, which represents the optimum results among the four substrates","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"41 1","pages":"680-684"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81601941","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
Two-Layer 3DoF+ System Based on Ultra-High Resolution Panoramic Video 基于超高分辨率全景视频的双层3DoF+系统
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/ICCC47050.2019.9064317
Yifan Wang, Jiarun Song, Fuzheng Yang
{"title":"Two-Layer 3DoF+ System Based on Ultra-High Resolution Panoramic Video","authors":"Yifan Wang, Jiarun Song, Fuzheng Yang","doi":"10.1109/ICCC47050.2019.9064317","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064317","url":null,"abstract":"3DoF+ supports limited movements of the user to better interact with the video contents. It provides user with more detailed information by utilizing the ultra-high resolution panoramic video. However, such high-resolution video poses a great challenge to network bandwidth and client performance. In this paper, a two-layer based 3DoF+ panoramic video system is proposed utilizing the ultra-high resolution panoramic video. According to the user’s viewpoint, this system will select different layer videos to display to provide users with a real overall zooming viewing experience, while effectively saving bandwidth. Experimental results show that the proposed system saves 85.95% transmission bandwidth than the traditional system in average.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"155 1","pages":"1734-1738"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79787625","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
An Adaptive Task Scheduling System Based on Real-time Clustering and NetFlow Prediction 基于实时聚类和NetFlow预测的自适应任务调度系统
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/ICCC47050.2019.9064183
Hao Zhang, G. He
{"title":"An Adaptive Task Scheduling System Based on Real-time Clustering and NetFlow Prediction","authors":"Hao Zhang, G. He","doi":"10.1109/ICCC47050.2019.9064183","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064183","url":null,"abstract":"With more and more enterprise users begin to adapt cloud computing service as their target platform for important business activity, the Cloud Computing Platform (CCP) is facing severe loading and stability problems. As a result, an excellent task scheduling system is much needed. To build such a system, the widely used method is to design detailed plan manually based on each task. However, this method has many disadvantages. Firstly, people have to add new task and rearrange them every time new user comes, with too much time wasted. Secondly, changing environment like time, task numbers may also influence the final running results. In this paper, we creatively introduce an adaptive task scheduling system which is driven by history user data [1]. By collecting these data, we conduct clustering at intervals of time to achieve the latest user task size classification. We also predict the netflow amount for next few hours, based on historical time series. Later, we arrange the order of current tasks dynamically through a weighted scoring mechanism. Experiments result on the real-life dataset demonstrate the superiority of our proposed method over state-of-the-art method.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"40 1","pages":"77-80"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85381229","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
A More Accurate Delay Model based Task Scheduling in Cellular Edge Computing Systems 基于延迟模型的蜂窝边缘计算系统任务调度
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/ICCC47050.2019.9064217
Yuan Zhang, Mingyang Xie
{"title":"A More Accurate Delay Model based Task Scheduling in Cellular Edge Computing Systems","authors":"Yuan Zhang, Mingyang Xie","doi":"10.1109/ICCC47050.2019.9064217","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064217","url":null,"abstract":"This paper studies task scheduling for delay minimization in cellular edge computing systems. Existing works depend on the delay model implied by Little’s Law. However, that model could be inaccurate. This work designs scheduling algorithm without using Little’s Law. Firstly, a more accurate delay model for cellular edge computing systems is established. Then, a Lyapunov function of delay is defined based on which a novel task scheduling algorithm is proposed. Simulation results show that the proposed scheduling algorithm can further reduce the delay compared with the traditional scheduling algorithm. Specifically, the proposed scheduling algorithm can achieve maximum delay reduction of 55% for light-traffic users.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"38 1","pages":"72-76"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85493093","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}
引用次数: 4
IEEE 1588 and a Dynamic Delay Correction Clock Synchronization Algorithm IEEE 1588和动态延迟校正时钟同步算法
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/ICCC47050.2019.9064350
Li Qing, Ren Xinyang
{"title":"IEEE 1588 and a Dynamic Delay Correction Clock Synchronization Algorithm","authors":"Li Qing, Ren Xinyang","doi":"10.1109/ICCC47050.2019.9064350","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064350","url":null,"abstract":"In this paper, the authors deeply studied PTP protocol, focusing on the research of clock offset and path delay in the clock synchronization process. The authors optimized the path asymmetry of PTP transmission which is not considered in the IEEE1588 protocol, and proposed a dynamic delay correction algorithm. In the experiment, the improved algorithm is verified convergent, which proves the rationality and effectiveness of the optimization. The result is that clock synchronization accuracy improved from tens or hundreds of $mu s$ by original PTP, to tens of ns by improved algorithm. According to overseas and domestic research status, this algorithm has significantly improved time accuracy to satisfy practical requirements.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"27 1","pages":"442-446"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82311393","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
Disaster-Recovery Communications Utilizing SWIPT-based D2D Relay Network 利用基于swipt的D2D中继网络的灾难恢复通信
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/ICCC47050.2019.9064404
Yukai Xu, Baoling Liu
{"title":"Disaster-Recovery Communications Utilizing SWIPT-based D2D Relay Network","authors":"Yukai Xu, Baoling Liu","doi":"10.1109/ICCC47050.2019.9064404","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064404","url":null,"abstract":"In this paper, we investigate disaster-recovery communications utilizing simultaneous wireless information and power transfer (SWIPT) enabled decode-and-forward (DF) relay D2D network. Specifically, there is a disaster area between the source node and the target node, and the relay cannot be installed in the disaster area. So the optimal location for the relay must be found in the healthy area. Moreover, unlike the existing with the assumption of linear or piece-wise linear energy harvesting (EH) model, a realistic scenario of the nonlinear EH model has been taken into account. In particular, we formulate an optimization problem by jointly optimizing the transmit power of the source node, the power-splitting (PS) ratio of the relay, and the location of the relay. Since the formulated problem is difficult to solve, an iterative algorithm is developed to obtain the optimal target rate. Simulation results verify the proposed algorithm and show that the designed system scheme is superior to other benchmark schemes.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"39 1","pages":"1041-1046"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80599852","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}
引用次数: 4
Performance Analysis of Amplify-and-Forward Best-Relay System Based on SWIPT 基于SWIPT的放大转发最佳中继系统性能分析
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/ICCC47050.2019.9064239
Guanhua Wang, Yingting Liu, Tankun Wu, Hongwu Yang
{"title":"Performance Analysis of Amplify-and-Forward Best-Relay System Based on SWIPT","authors":"Guanhua Wang, Yingting Liu, Tankun Wu, Hongwu Yang","doi":"10.1109/ICCC47050.2019.9064239","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064239","url":null,"abstract":"In this paper, an amplify-and-forward (AF) best-relay system based on simultaneous wireless information and power transfer (SWIPT) is proposed and analyzed. Its working principle is as follows: the source node sends signals to M relays and the destination. In the M relays, the relay that has the highest harvested energy level is considered as the best one and forwards the received signal to the destination. The maximal ratio combining (MRC) technology was subsequently used to combine the two signals at the destination. A direct link between the source node and the destination was added to the traditional non-direct links. The performance of the system was studied in Rayleigh fading channel. The expression of the system outage probability was derived and simulated using the Monte Carlo method. The simulation results validate the proposed analysis method. It also demonstrates that the performance of the proposed system is significantly improved compared with the traditional non-direct links.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"16 1","pages":"1075-1079"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80317197","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 Structural Hole-Based Approach to Control Public Opinion 基于结构性漏洞的舆论控制方法
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/ICCC47050.2019.9064379
Cheng Gong, Yajun Du, Fei Chen
{"title":"A Structural Hole-Based Approach to Control Public Opinion","authors":"Cheng Gong, Yajun Du, Fei Chen","doi":"10.1109/ICCC47050.2019.9064379","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064379","url":null,"abstract":"Structural hole spanners play an important role in information diffusion. Compared with opinion leader, structural hole spanners have better location in social network to expand the scope of information diffusion. In the past, researchers focused on the evolution rules and the opinion dynamics environments to monitor public opinion and even manage public opinion to the place they want. In this paper, we propose a novel structural-hole-based approach to control public opinion in social networks (shorten for SHCPO approach). We discuss influences of opinion evolution with ordinary agents and structural hole spanners via using our improving Friedkin-Johnsen (FJ) model. We analysis evolution tendency of public opinion, which is the final consensus of public opinion via FJ model, with ordinary agents in a community and with structural hole spanners in joint communities. We conclude three kinds of connections between structural hole spanners and ordinary agents in joint communities. They are structural hole spanners connecting (1) two opinion leaders; (2) two ordinary agents; (3) one opinion leader and one ordinary agents. The three connections will lead to different conditions for opinion evolution. And then, we remove the connections if public opinion tendencies are negative in joint communities and its end-communities. It prevents public opinion of the community and one of its end-communities. It guides the public opinion tendencies of joint communities going towards positive. The experiment result shows that SHCPO approach has certain extent effects.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"81 1","pages":"1423-1429"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82400809","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
ICCC 2019 Preface
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/iccc47050.2019.9064278
{"title":"ICCC 2019 Preface","authors":"","doi":"10.1109/iccc47050.2019.9064278","DOIUrl":"https://doi.org/10.1109/iccc47050.2019.9064278","url":null,"abstract":"","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"52 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82550014","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 Research on Improved PSO Algorithm-Based Decision-Making over Maintenance Works 基于改进粒子群算法的维修工程决策研究
2019 IEEE 5th International Conference on Computer and Communications (ICCC) Pub Date : 2019-12-01 DOI: 10.1109/ICCC47050.2019.9064320
Yunjing Zhang, Guangming Tang
{"title":"The Research on Improved PSO Algorithm-Based Decision-Making over Maintenance Works","authors":"Yunjing Zhang, Guangming Tang","doi":"10.1109/ICCC47050.2019.9064320","DOIUrl":"https://doi.org/10.1109/ICCC47050.2019.9064320","url":null,"abstract":"Maintenance works decision-making is a scientific approach to addressing the conflict between the supply of maintenance resources and the demand for it. Whether for routine or emergency maintenance works, maintenance works decision-making is always beneficial to enhance their efficiency massively. Therefore, in the field of maintenance works decision-making, the key problem lies in how to make the deployment of maintenance inventory and the assignment of maintenance works optimal under the constrains like usage expenses, availability, spare parts fill rate and so on. This paper starts with the multi-target problem and the Particle Swarm optimization algorithm, and then proposes the improved multi-target PSO algorithm. The rationale is that, fussy adjustment is made to the inertia weight and acceleration factor, to increase the number of sub-groups formed by the learning particle swarm. Meanwhile, the particles with an optimal location are generated in the new particles of the subgroups for the next-step calculation of particle location, to compare and update the non-inferior solutions in the external files. As shown by the comparative experiment of test functions, the algorithm proposed in this paper could improve the classic PSO algorithm significantly in terms of the number of solutions and their distribution. Finally, some assumptions are made to model the decision-making over the practical maintenance works, which indicates that this algorithm is quick to work out a high-quality feasible solution. It is effective to support the practice of maintenance works, showing its feasibility and practicality.","PeriodicalId":6739,"journal":{"name":"2019 IEEE 5th International Conference on Computer and Communications (ICCC)","volume":"26 1","pages":"34-39"},"PeriodicalIF":0.0,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82624630","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学术官方微信