Pub Date : 2020-05-08DOI: 10.1504/ijcse.2020.10029383
Tienan Zhang
In large-scale cloud platforms, information monitoring service is essential for capturing the performance of underlying resources and understanding the behaviours of various applications in different circumstances. In this paper, we present a flexible information monitoring middleware, namely multi-level information monitoring for cloud (MLIM-Cloud), and our motivation is to enable users to perform their monitoring operations in a non-intrusive and transparent manner in any virtualised infrastructure. In the MLIM-Cloud framework, three kinds of monitoring entities are designed for collecting, processing and achieving various kinds of runtime information at different infrastructure levels, including physical machines, VM instances, and up-level applications. In addition, the MLIM-Cloud middleware is both platform-independent and platform-interoperable, which means it can be easily deployed on different kinds of cloud platforms. To investigate the performance of MLIM-Cloud, an extensive set of experiments are conducted in a real-world cloud platform. The experimental results show that comparing with many existing monitoring services, the MLIM-Cloud middleware exhibits better adaptiveness and robustness when the cloud system is in presence of dynamic and unpredictable workloads.
{"title":"MLIM-Cloud: a flexible information monitoring middleware in large-scale cloud environments","authors":"Tienan Zhang","doi":"10.1504/ijcse.2020.10029383","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029383","url":null,"abstract":"In large-scale cloud platforms, information monitoring service is essential for capturing the performance of underlying resources and understanding the behaviours of various applications in different circumstances. In this paper, we present a flexible information monitoring middleware, namely multi-level information monitoring for cloud (MLIM-Cloud), and our motivation is to enable users to perform their monitoring operations in a non-intrusive and transparent manner in any virtualised infrastructure. In the MLIM-Cloud framework, three kinds of monitoring entities are designed for collecting, processing and achieving various kinds of runtime information at different infrastructure levels, including physical machines, VM instances, and up-level applications. In addition, the MLIM-Cloud middleware is both platform-independent and platform-interoperable, which means it can be easily deployed on different kinds of cloud platforms. To investigate the performance of MLIM-Cloud, an extensive set of experiments are conducted in a real-world cloud platform. The experimental results show that comparing with many existing monitoring services, the MLIM-Cloud middleware exhibits better adaptiveness and robustness when the cloud system is in presence of dynamic and unpredictable workloads.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115439511","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}
Face biometrics have been widely applied for user authentication systems in many practical scenarios, but the security of these systems can be jeopardised by presenting photos or replays of the legitimate user. To deal with such threat, many handcraft features extracted from face images or videos were used to detect spoof faces. These methods mainly analysed either illumination differences, colour differences or textures differences, but did not fusion these features together to further improve detection performance. Thus in this paper, we propose a novel face spoof detection method based on various feature maps and convolution neural network for photo and replay attacks. Specifically, both facial contour and specularly reflected features are considered, and proposed network is task oriented designed, e.g., its depth and width, and specific convolutional parameters of each layer are chosen for optimal accuracy and efficiency. A remarkable performance through plenty of experiments on multiple datasets shows that our method can defend not only photo attack, but also replay attack with a very low error probability.
{"title":"Face spoof detection using feature map superposition and CNN","authors":"Fei Gu, Zhihua Xia, Jianwei Fei, Chengsheng Yuan, Qiang Zhang","doi":"10.1504/ijcse.2020.10029396","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029396","url":null,"abstract":"Face biometrics have been widely applied for user authentication systems in many practical scenarios, but the security of these systems can be jeopardised by presenting photos or replays of the legitimate user. To deal with such threat, many handcraft features extracted from face images or videos were used to detect spoof faces. These methods mainly analysed either illumination differences, colour differences or textures differences, but did not fusion these features together to further improve detection performance. Thus in this paper, we propose a novel face spoof detection method based on various feature maps and convolution neural network for photo and replay attacks. Specifically, both facial contour and specularly reflected features are considered, and proposed network is task oriented designed, e.g., its depth and width, and specific convolutional parameters of each layer are chosen for optimal accuracy and efficiency. A remarkable performance through plenty of experiments on multiple datasets shows that our method can defend not only photo attack, but also replay attack with a very low error probability.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122500461","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 : 2020-05-08DOI: 10.1504/ijcse.2020.10024818
Jianbin Wu, Chuwei Luo, Ziyang Kang, Shuangkui Ge, Ye Xin
A coverless information hiding algorithm based on gradient matrix is introduced in this paper. Firstly, we grid the sharpened gradient matrix of an image. Then we encode the spectral radius of the gridded matrix to construct the mapping relationship between the matrix eigenvalues and random numbers. In order to improve the efficiency and security of transmission, we process the information segment by BCH (31, 21) encoder, in which redundancy check bits are added to detect and recover the errors caused by the interference in communication, thus breaking the limit that the image library has to be shared between the sender and receiver. In the meantime, splicing strategy is adopted to reduce the difficulty of building image library with the length of information sequence increasing. As the experimental results show, this proposed algorithm has a strong robustness towards glitch attack, JPEG compression attack, etc. and has a great application value in high-level secret key communication.
{"title":"A coverless information hiding algorithm based on gradient matrix","authors":"Jianbin Wu, Chuwei Luo, Ziyang Kang, Shuangkui Ge, Ye Xin","doi":"10.1504/ijcse.2020.10024818","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10024818","url":null,"abstract":"A coverless information hiding algorithm based on gradient matrix is introduced in this paper. Firstly, we grid the sharpened gradient matrix of an image. Then we encode the spectral radius of the gridded matrix to construct the mapping relationship between the matrix eigenvalues and random numbers. In order to improve the efficiency and security of transmission, we process the information segment by BCH (31, 21) encoder, in which redundancy check bits are added to detect and recover the errors caused by the interference in communication, thus breaking the limit that the image library has to be shared between the sender and receiver. In the meantime, splicing strategy is adopted to reduce the difficulty of building image library with the length of information sequence increasing. As the experimental results show, this proposed algorithm has a strong robustness towards glitch attack, JPEG compression attack, etc. and has a great application value in high-level secret key communication.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134073513","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 : 2020-05-08DOI: 10.1504/ijcse.2020.10029387
Dongwei Gao, Hefeng Chen, Chinchen Chang
In this paper, we consider the problem of constructing new plaintext aware encryption in the standard model. A new hybrid asymmetric encryption scheme is presented using a new key encapsulation method and a data encapsulation method. To prove the presented asymmetric encryption scheme is simulatable, we put forward some new sufficient conditions for judging a group to be simulatable. By introducing a new assumption called linear Diffie-Hellman knowledge assumption, we prove the proposed hybrid asymmetric encryption scheme is PA2.
{"title":"Plaintext aware encryption in the standard model under the linear Diffie-Hellman knowledge assumption","authors":"Dongwei Gao, Hefeng Chen, Chinchen Chang","doi":"10.1504/ijcse.2020.10029387","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029387","url":null,"abstract":"In this paper, we consider the problem of constructing new plaintext aware encryption in the standard model. A new hybrid asymmetric encryption scheme is presented using a new key encapsulation method and a data encapsulation method. To prove the presented asymmetric encryption scheme is simulatable, we put forward some new sufficient conditions for judging a group to be simulatable. By introducing a new assumption called linear Diffie-Hellman knowledge assumption, we prove the proposed hybrid asymmetric encryption scheme is PA2.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130490812","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 : 2020-05-08DOI: 10.1504/ijcse.2020.10029385
K. Tu, K. Yih, Fu-I Chou, J. Chou
In this article, both numerical solution and Taguchi method are presented to study the variable viscosity and non-Newtonian fluids effects on coupled heat and mass transfer by free convection over a vertical permeable plate in porous media. The surface temperature, concentration of the plate, and blowing/suction velocity are uniform. The viscosity of the fluid varies inversely as a linear function of the temperature. The partial differential equations are transformed into non-similar equations and solved by Keller box method. Numerical results of the local Nusselt number and local Sherwood number are expressed in the five parameters: 1) blowing/suction parameter ξ; 2) the power-law index of non-Newtonian fluid n; 3) buoyancy ratio N; 4) Lewis number Le; 5) viscosity-variation parameter θr. The best value for confirming the maximum of the local Nusselt (Sherwood) number by the Taguchi method is 6.6328 (10.3056).
{"title":"Numerical solution and Taguchi experimental method for variable viscosity and non-Newtonian fluids effects on heat and mass transfer by natural convection in porous media","authors":"K. Tu, K. Yih, Fu-I Chou, J. Chou","doi":"10.1504/ijcse.2020.10029385","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029385","url":null,"abstract":"In this article, both numerical solution and Taguchi method are presented to study the variable viscosity and non-Newtonian fluids effects on coupled heat and mass transfer by free convection over a vertical permeable plate in porous media. The surface temperature, concentration of the plate, and blowing/suction velocity are uniform. The viscosity of the fluid varies inversely as a linear function of the temperature. The partial differential equations are transformed into non-similar equations and solved by Keller box method. Numerical results of the local Nusselt number and local Sherwood number are expressed in the five parameters: 1) blowing/suction parameter ξ; 2) the power-law index of non-Newtonian fluid n; 3) buoyancy ratio N; 4) Lewis number Le; 5) viscosity-variation parameter θr. The best value for confirming the maximum of the local Nusselt (Sherwood) number by the Taguchi method is 6.6328 (10.3056).","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132616064","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 : 2020-05-08DOI: 10.1504/ijcse.2020.10027465
Jin Xian, Yingyi Wu, Yonghui Dai, Bo Xu, Ying Wang
In recent years, the popularity of the internet has not only brought convenience to consumers, but also brought opportunities and challenges to enterprises. Among them, online reviews have a great impact on the enterprises, especially consumer reviews of the enterprises' after-sales service will affect the enterprises' image. In this paper, text sentiment analysis method is used for the analysis of after-sale online comments. According to the analysis results, enterprises can find the shortcomings of after-sales service and improve it. This paper provides the steps of the text sentiment analysis method, and uses the empirical data of the website to carry out the experiment. The results show that the method can effectively analyse the customer's sentiment and help the after-sales staff of the company to answer questions well, thereby improving the level of after-sales service and enterprise image.
{"title":"Research on image of enterprise after-sales service based on text sentiment analysis","authors":"Jin Xian, Yingyi Wu, Yonghui Dai, Bo Xu, Ying Wang","doi":"10.1504/ijcse.2020.10027465","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10027465","url":null,"abstract":"In recent years, the popularity of the internet has not only brought convenience to consumers, but also brought opportunities and challenges to enterprises. Among them, online reviews have a great impact on the enterprises, especially consumer reviews of the enterprises' after-sales service will affect the enterprises' image. In this paper, text sentiment analysis method is used for the analysis of after-sale online comments. According to the analysis results, enterprises can find the shortcomings of after-sales service and improve it. This paper provides the steps of the text sentiment analysis method, and uses the empirical data of the website to carry out the experiment. The results show that the method can effectively analyse the customer's sentiment and help the after-sales staff of the company to answer questions well, thereby improving the level of after-sales service and enterprise image.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130027722","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 : 2020-05-08DOI: 10.1504/ijcse.2020.10029405
Leila Hamdad, Zakaria Ournani, K. Benatchba, A. Bendjoudi
Genetic algorithms (GA) are widely used in the literature to extract interesting association rules. However, they are time consuming mainly due to the growing size of databases. To speed up this process, we propose two parallel GAs (ARMGPU and ARM-CPU/GPU). In ARM-GPU, parallelism is used to compute the fitness which is the most time consuming task; while, ARM-CPU/GPU proposes a two-level-based parallel GA. In the first level, the different cores of the CPU execute a GAARM on a sub-population. The second level of parallelism is used to compute the fitness, in parallel, on GPU. To validate the proposed two parallel GAs, several tests were conducted to solve well-known large ARM instances. Obtained results show that our parallel algorithms outperform state-of-the-art exact algorithms (APRIORI and FP-GROWTH) and approximate algorithms (SEGPU and ME-GPU) in terms of execution time.
{"title":"Two-level parallel CPU/GPU-based genetic algorithm for association rule mining","authors":"Leila Hamdad, Zakaria Ournani, K. Benatchba, A. Bendjoudi","doi":"10.1504/ijcse.2020.10029405","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029405","url":null,"abstract":"Genetic algorithms (GA) are widely used in the literature to extract interesting association rules. However, they are time consuming mainly due to the growing size of databases. To speed up this process, we propose two parallel GAs (ARMGPU and ARM-CPU/GPU). In ARM-GPU, parallelism is used to compute the fitness which is the most time consuming task; while, ARM-CPU/GPU proposes a two-level-based parallel GA. In the first level, the different cores of the CPU execute a GAARM on a sub-population. The second level of parallelism is used to compute the fitness, in parallel, on GPU. To validate the proposed two parallel GAs, several tests were conducted to solve well-known large ARM instances. Obtained results show that our parallel algorithms outperform state-of-the-art exact algorithms (APRIORI and FP-GROWTH) and approximate algorithms (SEGPU and ME-GPU) in terms of execution time.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127954630","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 : 2020-05-08DOI: 10.1504/ijcse.2020.10029388
T. Lopes, L. P. S. Dias, C. Costa, Igor Fontana De Nardin, R. Righi
The bad conditions of roads characterised by potholes increase the occurrence of accidents, which sometimes also result in the loss of human lives. In this context, this article presents the collaborative model for detection and alert of potholes (CoMDAP), which provides a distributed framework that automatically collects, analyses and shares pothole and traffic data among users and drivers without any human interaction. Our differential idea consists of using particular hardware in the vehicles to automatically detect the potholes in the roads with better accuracy. The evaluation methodology first considers a prototype executed in simulated (a toy and in-home lanes) and real (a car in a particular road) scenarios in order to observe the accuracy of detecting the potholes. Furthermore, we implement an Android application that notifies the drivers as they approach a pothole. The results were encouraging, highlighting the benefits of using CoMDAP as a counterpart to enable smart cities.
{"title":"Collaborative humanless model for automatic pothole detection and driver notification","authors":"T. Lopes, L. P. S. Dias, C. Costa, Igor Fontana De Nardin, R. Righi","doi":"10.1504/ijcse.2020.10029388","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029388","url":null,"abstract":"The bad conditions of roads characterised by potholes increase the occurrence of accidents, which sometimes also result in the loss of human lives. In this context, this article presents the collaborative model for detection and alert of potholes (CoMDAP), which provides a distributed framework that automatically collects, analyses and shares pothole and traffic data among users and drivers without any human interaction. Our differential idea consists of using particular hardware in the vehicles to automatically detect the potholes in the roads with better accuracy. The evaluation methodology first considers a prototype executed in simulated (a toy and in-home lanes) and real (a car in a particular road) scenarios in order to observe the accuracy of detecting the potholes. Furthermore, we implement an Android application that notifies the drivers as they approach a pothole. The results were encouraging, highlighting the benefits of using CoMDAP as a counterpart to enable smart cities.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127590685","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 : 2020-05-08DOI: 10.1504/ijcse.2020.10029384
Jinqiao Dai, Shibin Zhang, Jinyue Xia
In this paper, we propose a multi-group e-commerce signature scheme based on quantum teleportation and Bell states. Compared with the recent quantum group signature scheme, what our scheme has optimised is the traditional signature model with only one group manager and the utilisation of quantum resources. By setting up different group managers in different groups, the scheme promotes the traditional signature model into a more practical situation and can be easily used in e-payment system. In addition, the quantum teleportation and Pauli operations based on the Bell states are used in the transaction process, and these techniques can also be easily implemented under practical situations. Finally, the security analysis shows that the scheme can defend against different attacks from internal and external sources, including intercepting resend attacks and entanglement attacks. It also proves that the scheme is reliable, safe and effective facing with denial and forgery.
{"title":"A multi-group e-commerce signature scheme based on quantum teleportation","authors":"Jinqiao Dai, Shibin Zhang, Jinyue Xia","doi":"10.1504/ijcse.2020.10029384","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029384","url":null,"abstract":"In this paper, we propose a multi-group e-commerce signature scheme based on quantum teleportation and Bell states. Compared with the recent quantum group signature scheme, what our scheme has optimised is the traditional signature model with only one group manager and the utilisation of quantum resources. By setting up different group managers in different groups, the scheme promotes the traditional signature model into a more practical situation and can be easily used in e-payment system. In addition, the quantum teleportation and Pauli operations based on the Bell states are used in the transaction process, and these techniques can also be easily implemented under practical situations. Finally, the security analysis shows that the scheme can defend against different attacks from internal and external sources, including intercepting resend attacks and entanglement attacks. It also proves that the scheme is reliable, safe and effective facing with denial and forgery.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"361 14","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113956199","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 : 2020-05-08DOI: 10.1504/ijcse.2020.10029391
Wenbin Yu, Zijia Xiong, Shanshan Rong, Yang Liu, Siyao Wang, Yinsong Xu, A. Liu
Considering quantum detection, there are two different ways to make a measurement on signals set. One is minimum error discrimination and another is unambiguous states discrimination. In this work, we study the unambiguous state discrimination of coherent states. The quantum measurement model investigated is based on binary signals. All necessary positive-operator valued measurements are established to implement the quantum measurements in non-ambiguity way. The conclusive probability and inconclusive probability for the unambiguous discrimination of both on-off keying and binary-phase-shifting keying modulations are derived rigorously to show the measurement performance of proposed detection method theoretically.
{"title":"Unambiguous discrimination of binary coherent states","authors":"Wenbin Yu, Zijia Xiong, Shanshan Rong, Yang Liu, Siyao Wang, Yinsong Xu, A. Liu","doi":"10.1504/ijcse.2020.10029391","DOIUrl":"https://doi.org/10.1504/ijcse.2020.10029391","url":null,"abstract":"Considering quantum detection, there are two different ways to make a measurement on signals set. One is minimum error discrimination and another is unambiguous states discrimination. In this work, we study the unambiguous state discrimination of coherent states. The quantum measurement model investigated is based on binary signals. All necessary positive-operator valued measurements are established to implement the quantum measurements in non-ambiguity way. The conclusive probability and inconclusive probability for the unambiguous discrimination of both on-off keying and binary-phase-shifting keying modulations are derived rigorously to show the measurement performance of proposed detection method theoretically.","PeriodicalId":340410,"journal":{"name":"Int. J. Comput. Sci. Eng.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130999939","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
扫码关注我们
求助内容：
应助结果提醒方式：