Pub Date : 2022-09-27DOI: 10.1109/ISCIT55906.2022.9931277
Firas Gerges, D. Azar, J. Vybihal, J. T. Wang
The motion picture is one of the major industries in the entertainment domain and a key contributor to the world-wide economy. Millions of dollars are often required and invested in the movie production process. Predicting the rate of success of a movie before its production will avoid huge financial losses. Various approaches exist in the literature to tackle the problem of forecasting movie success. However, most of these approaches fall short in creating an efficient model that could help investors and stakeholders in the decision-making process. These approaches rely on post-production or post-release information, making them inappropriate for pre-investment prediction. Existing approaches that tackle the pre-production forecasting show low predictive performance in general. Due to the white-box nature of decision tree algorithms, practitioners would be interested in leveraging the tree-like structure as a decision-making system while producing a movie. In this work, we propose an evolutionary approach, based on Genetic Algorithms (GA), for optimizing the outputs of the decision tree algorithm (C5) used for the prediction of movie success during the early stage of production. Experiments demonstrate that our hybrid method combining machine learning and evolutionary computation significantly surpasses current state-of-the-art machine learning techniques, achieving a prediction accuracy of 90.5%.
{"title":"Early Prediction of Movie Success Using Machine Learning and Evolutionary Computation","authors":"Firas Gerges, D. Azar, J. Vybihal, J. T. Wang","doi":"10.1109/ISCIT55906.2022.9931277","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931277","url":null,"abstract":"The motion picture is one of the major industries in the entertainment domain and a key contributor to the world-wide economy. Millions of dollars are often required and invested in the movie production process. Predicting the rate of success of a movie before its production will avoid huge financial losses. Various approaches exist in the literature to tackle the problem of forecasting movie success. However, most of these approaches fall short in creating an efficient model that could help investors and stakeholders in the decision-making process. These approaches rely on post-production or post-release information, making them inappropriate for pre-investment prediction. Existing approaches that tackle the pre-production forecasting show low predictive performance in general. Due to the white-box nature of decision tree algorithms, practitioners would be interested in leveraging the tree-like structure as a decision-making system while producing a movie. In this work, we propose an evolutionary approach, based on Genetic Algorithms (GA), for optimizing the outputs of the decision tree algorithm (C5) used for the prediction of movie success during the early stage of production. Experiments demonstrate that our hybrid method combining machine learning and evolutionary computation significantly surpasses current state-of-the-art machine learning techniques, achieving a prediction accuracy of 90.5%.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134257996","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 : 2022-09-27DOI: 10.1109/ISCIT55906.2022.9931215
Baohao Chen, Lin Tian, Guosheng Lu, Chengliang Zhang, Miao Liu, Xinglin Wang
This paper proposes a multi-channel synchronization method for multi-antenna wireless communication systems., including the calibration of the transmit channels and the calibration of the receive channels. In particular., the calibration of the transmit channels and receive channels use an antenna array., respectively. Based on the transmitted signals with specific amplitude and phase., the received signals are first analyzed by extracting the feature from signals. Then., we use the analysis results to obtain the amplitude and phase calibration factors of the transmit channels and receive channels. Next., we apply the calibration factors to the digital part in order to compensate the amplitude and phase offset of the radio frequency (RF) module., thus the channel consistency is achieved. Compared with the RF local oscillator power division networks., the proposed channel synchronization method only needs to simply modify the calibration settings in the case of increasing or decreasing the number of channels., which greatly improves the flexibility of systems. Simulation results show that this method can compensate the amplitude and phase offset of the RF module., which proves the effectiveness of the method.
{"title":"A Multi-Channel Synchronization Method for Multi-Antenna Wireless Communication Systems","authors":"Baohao Chen, Lin Tian, Guosheng Lu, Chengliang Zhang, Miao Liu, Xinglin Wang","doi":"10.1109/ISCIT55906.2022.9931215","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931215","url":null,"abstract":"This paper proposes a multi-channel synchronization method for multi-antenna wireless communication systems., including the calibration of the transmit channels and the calibration of the receive channels. In particular., the calibration of the transmit channels and receive channels use an antenna array., respectively. Based on the transmitted signals with specific amplitude and phase., the received signals are first analyzed by extracting the feature from signals. Then., we use the analysis results to obtain the amplitude and phase calibration factors of the transmit channels and receive channels. Next., we apply the calibration factors to the digital part in order to compensate the amplitude and phase offset of the radio frequency (RF) module., thus the channel consistency is achieved. Compared with the RF local oscillator power division networks., the proposed channel synchronization method only needs to simply modify the calibration settings in the case of increasing or decreasing the number of channels., which greatly improves the flexibility of systems. Simulation results show that this method can compensate the amplitude and phase offset of the RF module., which proves the effectiveness of the method.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116147469","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 : 2022-09-27DOI: 10.1109/ISCIT55906.2022.9931274
Junjie Wu, Qiao Li, Yuedong Zhuo
Wireless avionics intra-communication (WAIC) can increase efficiency and flexibility while reducing cable weight and maintenance costs. Unlike WLAN applications for in-flight entertainment (IFE) systems, WAIC focuses more on quality of service (QoS) requirements, especially low latency. In order to explicitly reflect the data transmission capability of the system, it is considered to use the concept of effective capacity (EC), which is a cross-layer channel model combining physical and data link layers. In this study, we model a kind of avionics compartment channel and fit its channel fading distribution as a Rician distribution. Depending on this distribution, an explicit expression of the EC can be obtained analytically. When the average SNR is set to 15dB and the bandwidth is set to 20MHz, the maximum system arrival rate can be set to 80Mbit/s, where there is a large margin compared to the maximum WAIC communication rate given by ITU-R. Case studies show when the delay-violation probability is set to 10−4, the upper bound of queuing delay can be kept below 10ms with the frame duration set to 2ms, coinciding with analytical results.
{"title":"Analysis of WAIC QoS Guarantees Using Wireless LAN Technology","authors":"Junjie Wu, Qiao Li, Yuedong Zhuo","doi":"10.1109/ISCIT55906.2022.9931274","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931274","url":null,"abstract":"Wireless avionics intra-communication (WAIC) can increase efficiency and flexibility while reducing cable weight and maintenance costs. Unlike WLAN applications for in-flight entertainment (IFE) systems, WAIC focuses more on quality of service (QoS) requirements, especially low latency. In order to explicitly reflect the data transmission capability of the system, it is considered to use the concept of effective capacity (EC), which is a cross-layer channel model combining physical and data link layers. In this study, we model a kind of avionics compartment channel and fit its channel fading distribution as a Rician distribution. Depending on this distribution, an explicit expression of the EC can be obtained analytically. When the average SNR is set to 15dB and the bandwidth is set to 20MHz, the maximum system arrival rate can be set to 80Mbit/s, where there is a large margin compared to the maximum WAIC communication rate given by ITU-R. Case studies show when the delay-violation probability is set to 10−4, the upper bound of queuing delay can be kept below 10ms with the frame duration set to 2ms, coinciding with analytical results.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132211204","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}
With the development of cloud computing technol-ogy, more and more users choose to encrypt their huge image data and store them on the cloud server to save their limited storage resources. In order to conduct a safe and effective query operation, it is necessary to research the technology of searching encrypted images. However, most of existing research schemes on encrypted image retrieval technology are focused on the improvement of efficiency and accuracy, ignoring the threat brought by malicious cloud servers or malicious nodes. To solve this problem, we propose a Traceable Multi-user Image retrieval scheme based on Blockchain (TMIB). TMIB scheme utilizes the blockchain based on characteristics such as de-centralization and data tamper-proofing to prohibit returning wrong query results by a malicious cloud server. Moreover, TMIB scheme adopts a proxy re-encryption approach to achieve availability in multi-user scenarios. Furthermore, a watermark is embedded in the encrypted images to track the malicious users for preventing malicious users from distributing the images again. Finally, we analyze the security and feasibility, proving the high precision and efficiency of TMIB scheme in the actual scene through experiments.
{"title":"TMIB: A Traceable Multi-user Image Retrieval Scheme based on Blockchain","authors":"Chenyang Mao, Zhonghua Shen, Yong Liu, Qian Meng, Yuying Liu, Jiamin Hu","doi":"10.1109/ISCIT55906.2022.9931194","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931194","url":null,"abstract":"With the development of cloud computing technol-ogy, more and more users choose to encrypt their huge image data and store them on the cloud server to save their limited storage resources. In order to conduct a safe and effective query operation, it is necessary to research the technology of searching encrypted images. However, most of existing research schemes on encrypted image retrieval technology are focused on the improvement of efficiency and accuracy, ignoring the threat brought by malicious cloud servers or malicious nodes. To solve this problem, we propose a Traceable Multi-user Image retrieval scheme based on Blockchain (TMIB). TMIB scheme utilizes the blockchain based on characteristics such as de-centralization and data tamper-proofing to prohibit returning wrong query results by a malicious cloud server. Moreover, TMIB scheme adopts a proxy re-encryption approach to achieve availability in multi-user scenarios. Furthermore, a watermark is embedded in the encrypted images to track the malicious users for preventing malicious users from distributing the images again. Finally, we analyze the security and feasibility, proving the high precision and efficiency of TMIB scheme in the actual scene through experiments.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128570803","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 : 2022-09-27DOI: 10.1109/ISCIT55906.2022.9931320
Can Lin, Guofa Cai, Ting Ning, Jiguang He
Wireless body area networks (WBANs) can provide continuous monitoring of human biological signals. Due to the limited energy of the sensors, wireless powered system has been adopted to prolong network lifetime for implant WBANs. In this paper, we propose an energy buffer aided wireless-powered relaying system for self-sustainable implant WBAN, which includes an implant device, a wearable device with an energy buffer and an off-body access point (AP). In the downlink, the wearable device harvests energy that is stored in the energy buffer from a radio-frequency signal broadcasted by the AP and provides energy supply via wireless energy transfer to the implant device. In the uplink, the implant device uses harvested energy to transmit its collected data to the wearable device. Then the wearable device uses the stored energy to decode and forward the data to the AP. We investigate two transmission policies for the wearable device, namely best-effort policy (BEP) and on-off policy (OOP). We derive the limiting distribution of the energy for both the BEP and OOP, and the performance expressions in terms of the outage probability and average throughput. Simulation results are presented to validate the analytical expressions and provide some useful insights.
{"title":"A Wireless-Powered Relaying System with Energy Buffer for Implant WBAN","authors":"Can Lin, Guofa Cai, Ting Ning, Jiguang He","doi":"10.1109/ISCIT55906.2022.9931320","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931320","url":null,"abstract":"Wireless body area networks (WBANs) can provide continuous monitoring of human biological signals. Due to the limited energy of the sensors, wireless powered system has been adopted to prolong network lifetime for implant WBANs. In this paper, we propose an energy buffer aided wireless-powered relaying system for self-sustainable implant WBAN, which includes an implant device, a wearable device with an energy buffer and an off-body access point (AP). In the downlink, the wearable device harvests energy that is stored in the energy buffer from a radio-frequency signal broadcasted by the AP and provides energy supply via wireless energy transfer to the implant device. In the uplink, the implant device uses harvested energy to transmit its collected data to the wearable device. Then the wearable device uses the stored energy to decode and forward the data to the AP. We investigate two transmission policies for the wearable device, namely best-effort policy (BEP) and on-off policy (OOP). We derive the limiting distribution of the energy for both the BEP and OOP, and the performance expressions in terms of the outage probability and average throughput. Simulation results are presented to validate the analytical expressions and provide some useful insights.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"2599 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128836921","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 : 2022-09-27DOI: 10.1109/ISCIT55906.2022.9931202
Canliang Liao, Chang Liu, Zheng Xue, Yang Liu, G. Han
Cooperative edge caching in vehicular ad hoc net-works is expected to support massive data transmissions with low transmission delays, which is required in various powerful applications brought by the proliferation of smart vehicles and rapid development of B5G/6G communication techniques. How-ever, due to highly dynamic topology of vehicular networks and constrained storage capacities of edge servers, the design of effective caching scheme is challenging, especially in road intersections because of its complexity and flexibility. In this paper, we propose a cooperative edge caching scheme in a four-way intersection of two-lane roads to reduce the average download delay of content, which allows vehicles to fetch contents from road side units (RSUs) or base stations (BSs). To characterize the variation of communication rates between moving vehicles and RSUs, we divide coverage areas of RSUs into different communication zones, based on which we mathematically derived the average download delay of requested contents. Then we formulated an optimization problem of cooperative content placement to minimize the overall download delay, and proposed a dynamic programming (DP)-based algorithm to solve this nonlinear integer programming (NLIP) problem. Simulation results show that the proposed DP-based cooperative caching placement scheme is more efficient for average download delay reduction compared with benchmark schemes such as a popularity-based caching placement scheme and a random caching placement scheme.
{"title":"Cooperative Edge Caching for Vehicular Networks in Road Intersections","authors":"Canliang Liao, Chang Liu, Zheng Xue, Yang Liu, G. Han","doi":"10.1109/ISCIT55906.2022.9931202","DOIUrl":"https://doi.org/10.1109/ISCIT55906.2022.9931202","url":null,"abstract":"Cooperative edge caching in vehicular ad hoc net-works is expected to support massive data transmissions with low transmission delays, which is required in various powerful applications brought by the proliferation of smart vehicles and rapid development of B5G/6G communication techniques. How-ever, due to highly dynamic topology of vehicular networks and constrained storage capacities of edge servers, the design of effective caching scheme is challenging, especially in road intersections because of its complexity and flexibility. In this paper, we propose a cooperative edge caching scheme in a four-way intersection of two-lane roads to reduce the average download delay of content, which allows vehicles to fetch contents from road side units (RSUs) or base stations (BSs). To characterize the variation of communication rates between moving vehicles and RSUs, we divide coverage areas of RSUs into different communication zones, based on which we mathematically derived the average download delay of requested contents. Then we formulated an optimization problem of cooperative content placement to minimize the overall download delay, and proposed a dynamic programming (DP)-based algorithm to solve this nonlinear integer programming (NLIP) problem. Simulation results show that the proposed DP-based cooperative caching placement scheme is more efficient for average download delay reduction compared with benchmark schemes such as a popularity-based caching placement scheme and a random caching placement scheme.","PeriodicalId":325919,"journal":{"name":"2022 21st International Symposium on Communications and Information Technologies (ISCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129158032","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
扫码关注我们
求助内容：
应助结果提醒方式：