{"title":"Perceptual Video Coding based on Adaptive Region-Level Intra-Period","authors":"Hao Li, W. Lei, Wei Zhang","doi":"10.1109/icccs55155.2022.9846027","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9846027","url":null,"abstract":"According to the human visual system (HVS), video regions have various visual masking effects and saliency features. However, in the existing perceptual video coding schemes, different regions in a picture basically keep the same coding mode, which does not make full use of the perceptual properties. Therefore, this paper proposes a perceptual video coding method based on adaptive region-level intra-period for conversational video service. Firstly, by considering the perceptual properties of video content, a picture is divided into two groups of regions, namely regions of interest (ROIs) and regions of non-interest (nonROIs). Then, a just noticeable difference (JND)-based distortion propagation estimation model is proposed to determine an appropriate region-level intra-period value for regions according to their content characteristics and perceptual importance. Further, a region-level bit allocation method is used to update the coding resource allocation process. The experimental results demonstrate that the proposed method performs much better than the existing schemes in terms of bits saving and the perceived visual quality.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129372722","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}
{"title":"Parameter Optimization of Cartographer Composition in Fire Rescue Small Apartment Scene","authors":"Jijiang Xu, Pengrui Gao, Ruijun Jing, Zhiguo Zhao, Wenhao Zhang","doi":"10.1109/icccs55155.2022.9846538","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9846538","url":null,"abstract":"When the small-area apartment fires need to be rescued, the original construction drawings cannot be used as a rescue support because of the multi-point reconstruction of the small-area apartment by the residents and the external damage, which requires the unmanned car to quickly obtain the internal environment information. The experimental hardware adopts TS100 tracked damping tank chassis, single-line lidar adopts RPLidarA1 with high stability, and the composition algorithm adopts the cartographer algorithm in laser SLAM. By reducing the number of processing points and increasing the calculation speed and reducing the amount of calculation, the composition parameters of the cartographer with the maximum efficiency of the scanning composition of the small area apartment are obtained. The final adjustment data of the composition parameters are as follows :When the velocity of the robot is 0.5 M / S, the parameter adjustment scheme-HJ-Cartographer is adopted, that is, the optimal value of the maximum iteration number (max_num_iteration) is 12 ; the optimal value of the maximum range of node scanning (max_range) is 29 ; the optimal value of voxel_filter_size is 0.25 ; the optimal number of background threads (MAP_BUILDER_background_threads) of the map generator is 5 ; the optimal value of global_sampling_ratio is 0.0055. The composition accuracy α = 96.77 %, which is 64.83 % higher than the initial composition accuracy. The composition ambiguity β = 3.23 %, which is 92.18 % lower than the initial ambiguity.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131951982","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}
{"title":"A Research of Fall Detection Module Based on NB-IOT","authors":"Youyu Wu, Pengcheng Zeng, Hua Ge","doi":"10.1109/icccs55155.2022.9846650","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9846650","url":null,"abstract":"It is of great significance for the health of the senior citizens to study the fall of the them. A timely and accurately detect the fall of the elderly and promptly inform the relatives and family members have a great influence of reducing the risk of more serious injury. To this, it’s designs a fall detection module based on Narrow Band Internet of Things (NB-IOT) and Micro-Electro-Mechanical System (MEMS). First of all, this paper introduced the fall detection research background, then expounds the module design, focusing on data acquisition module, data processing module, the design of the data transmission module, the design of the power supply module, finally complete the module Printed Circuit Board (PCB) drawing, and tested data transmission, the experimental results show that the module achieves the expected goal.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130275512","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}
{"title":"Adaptive Robust Nonlinear Filter Algorithm for Time Synchronization","authors":"Yacheng Xiao, Hongyi Wang, Jianfei Wu, Peiguo Liu","doi":"10.1109/icccs55155.2022.9846697","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9846697","url":null,"abstract":"This paper adopts a fusion algorithm to deal with different noise estimates and outlier processing in nonlinear time-synchronized system. In the framework of the unscented Kalman filter, the statistical characteristic parameters of measurement noise are estimated based on the variational Bayesian process. Combined with the maximum a posterior(MAP) estimation method, we use the measured noise parameters obtained by the variational Bayesian method to estimate the process noise and simultaneously realize the real-time adaptive estimation of the two kinds of noise statistical properties. A judgment method based on the likelihood function of innovation is embodied in the algorithm to make real-time judgments on the time deviation outlier generated in the synchronization process, and smooth the outlier through the window sliding average. In the nonlinear time synchronization process where the noise is unknown and the measurement process contains outliers, the algorithm can adaptively complete the synchronization estimation of the covariance matrix of noise, and can effectively judge and process the clock deviation outliers in the synchronization process.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121478395","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}
{"title":"Optimal Offloading Percentage for Fresh Status Updates in Mobile Edge Computing Networks","authors":"Runhao Yu, Y. Liu, Xiaolong Lan, Qingchun Chen","doi":"10.1109/icccs55155.2022.9845977","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9845977","url":null,"abstract":"In this paper, we focus on the age of information (AoI) performance of mobile edge computing (MEC) networks, and investigate the optimal offloading percentage to achieve the minimal AoI concerning the partial computing. We study the impact of parameters, including packet size, required CPU cycles for computation, average data rate, and computing capacity of MEC server, on the optimal offloading percentage in MEC network, where a single-source First-Come-First-Served(FCFS), GI/M/I queuing model is considered. Our work verifies the existence of the optimal offloading percentage and yields several interesting insights. Due to the effect of queue, the optimal offloading percentage does not always increase with respect to average data rate, but first increases and then slightly decreases, and the required number of CPU cycles for computation has a similar impact on the optimal offloading percentage.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121110766","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}
{"title":"Digital Signature Performance of a New Quantum Safe Multivariate Polynomial Public Key Algorithm","authors":"Randy Kuang, Maria Perepechaenko","doi":"10.1109/icccs55155.2022.9846785","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9846785","url":null,"abstract":"We discuss the performance of a new quantumsafe multivariate digital signature scheme proposed recently, called the Multivariate Polynomial Public Key Digital Signature (MPPK DS) scheme. Leveraging MPPK KEM or key exchange mechanism, the MPPK DS scheme is established using modular exponentiation with a randomly chosen secret base from a prime field. The security of the MPPK DS algorithm largely benefits from a generalized safe prime associated with the said field and the Euler totient function. We can achieve NIST security levels I, III, and V over a 64-bit prime field, with relatively small public key sizes of 128 bytes, 192 bytes, and 256 bytes for security levels I, III, and V, respectively. The signature sizes are 80 bytes for level I, 120 bytes for level III, and 160 bytes for level V. The MPPK DS scheme offers probabilistic procedures for signing and verification. That is, for each given signing message, a signer can randomly pick a base integer to be used for modular exponentiation with a private key, and a verifier can verify the signature with the digital message, based on the verification relationship, using any randomly selected noise variables. The verification process can be repeated as many times as the verifier wishes for different noise values, however, for a true honest signature, the verification will always pass. This probabilistic feature largely restricts an adversary to perform spoofing attacks. In this paper, we conduct some performance analyses by implementing MPPK DS in Java. We compare its performance with benchmark performances of NIST PQC Round 3 finalists: Rainbow, Dilithium, and Falcon. Overall, the MPPK DS scheme demonstrates equivalent or better performance, and much smaller public key, as well as signature sizes, compared to the three NIST PQC Round 3 finalists.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"34 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116127072","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}
{"title":"Fine-Grained Active Queue Management in the Data Plane with P4","authors":"Mai Qiao, D. Gao","doi":"10.1109/icccs55155.2022.9846852","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9846852","url":null,"abstract":"Traditional source-based congestion control methods cannot meet the complex network requirements. The proposal of active queue management algorithm can alleviate the pressure of congestion from the network level. However, most of the algorithms lack fine-grained analysis of queue, which fails to quickly alleviate congestion and will affect some innocent data flows. With the rapid development of programmable data plane, the fine-grained analysis of queue in data plane becomes a promising way to alleviate congestion. In this paper, a Fine-Grained Active Queue Management (FG-AQM) scheme is proposed to achieve rapid congestion avoidance and network performance optimization. In the proposed scheme, different hash algorithms and registers are used to analyze and determine the target flows which have great impacts on network performance. And proportional integral controller is used to calculate the packet dropout probability according to the queue delay and jitter. Combined with the output of the proportional integral controller and the target flows, FG-AQM achieves dynamic adjustment of packet dropout probability to achieve congestion avoidance. We implement FG-AQM on programmable switch and evaluate the proposed scheme against the state-of-the-art AQM solutions. Extensive simulation results show that FG-AQM can effectively deal with the data flow causing congestion and improve the throughput by 34% (compared with P4-RED) and 22% (compared with P4-PI2) on average in microburst scenarios.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121494299","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}
Jia-Hao Zhang, Zheng-Ming Gao, Suruo Li, Juan Zhao
{"title":"Improved Mayfly Optimization Algorithm with Cooperation","authors":"Jia-Hao Zhang, Zheng-Ming Gao, Suruo Li, Juan Zhao","doi":"10.1109/icccs55155.2022.9846576","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9846576","url":null,"abstract":"The mayfly optimization algorithm (MA) is a stochastic, population-based optimization technique that can be applied to a wide range of problems. To improve the optimization performance of mayfly optimization algorithm, a variation on the mayfly algorithm, called the improved mayfly optimization algorithm with cooperation, or MAC, was proposed in this paper, employing cooperative behavior. This is achieved by using multiple male populations to optimize different components of the solution vector cooperatively. Application of the MAC on several benchmark optimization problems shows a marked improvement in performance over the original algorithm.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131467389","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}
{"title":"Evolutionary Game Analysis of Manufacturing Resource Sharing in Automotive Supply Chain Based on Cloud Platform","authors":"Xin Yang, Yaoxi Liu, Li Wang, Jinyu Wei","doi":"10.1109/icccs55155.2022.9846290","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9846290","url":null,"abstract":"This paper constructs an evolutionary game model of manufacturing resource sharing in automobile supply chain under cloud manufacturing environment to illustrate the evolutionary relationship of manufacturing resource sharing between component suppliers and automobile manufacturers. In this paper, an system dynamics model is established based on Vensim, and the influence of parameter changes on the evolutionary equilibrium strategy is compared and analyzed. The initial resource sharing amount, platform management ability, resource coordination ability, informatization coefficient, time benefit coefficient, trust coefficient and incentive coefficient are all positively correlated with the probability of resource sharing component suppliers and automobile manufacturers. The cost of technology loss risk and the cost of access to cloud platform will prevent component suppliers or automobile manufacturers from sharing manufacturing resources. The manufacturing resource conversion capability coefficient and penalty cost coefficient should be in a reasonable range to promote manufacturing resource sharing between component suppliers and automobile manufacturers. The result of evolution can be used as a reference for cooperation and resource sharing in automobile manufacturing industry.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121884946","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}
{"title":"Research on General Model of Intelligence Level for Smart Home","authors":"Jianguo Liu, Miao Wang, Xianqing Wang","doi":"10.1109/icccs55155.2022.9846791","DOIUrl":"https://doi.org/10.1109/icccs55155.2022.9846791","url":null,"abstract":"As an important vertical application field of the Internet of things, smart home has been widely used after continuous commercialization exploration with the joint support of technology innovation and market demand. With the development of Internet of things, big data and artificial intelligence technology, the overall intelligence level of smart home has been significantly improved. How to evaluate the intelligence level of smart home system has become a hot issue in the industry, but there are few studies on the intelligence level evaluation of smart home system in the academic community. This paper proposes the human-system collaborative relationship model of the smart home system, and divides the smart home’s intelligence level based on this model, and establishes an evaluation method for the smart home system to better guide the smart development of the smart home industry and enhance consumers' awareness of smart home. At the end of this paper, the next step work is also prospected, and an experimental environment for the evaluation of the intelligence level of the smart home system is built to verify the intelligence level and its evaluation method.","PeriodicalId":121713,"journal":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133181538","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}